forked from panda3d/panda3d
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathfindApproxLevelEntry.I
More file actions
85 lines (78 loc) · 2.06 KB
/
findApproxLevelEntry.I
File metadata and controls
85 lines (78 loc) · 2.06 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
/**
* PANDA 3D SOFTWARE
* Copyright (c) Carnegie Mellon University. All rights reserved.
*
* All use of this software is subject to the terms of the revised BSD
* license. You should have received a copy of this license along
* with this source code in a file named "LICENSE."
*
* @file findApproxLevelEntry.I
* @author drose
* @date 2002-03-13
*/
/**
*
*/
INLINE FindApproxLevelEntry::
FindApproxLevelEntry(const WorkingNodePath &node_path, FindApproxPath &approx_path) :
_node_path(node_path),
_approx_path(approx_path)
{
_i = 0;
_next = nullptr;
nassertv(_node_path.is_valid());
}
/**
* This constructor is used to construct the next entry based on a child node
* of the previous entry's node.
*/
INLINE FindApproxLevelEntry::
FindApproxLevelEntry(const FindApproxLevelEntry &parent,
PandaNode *child_node, int i,
FindApproxLevelEntry *next) :
_node_path(parent._node_path, child_node),
_i(i),
_approx_path(parent._approx_path),
_next(next)
{
nassertv(validate_ptr(this) && validate_ptr(&parent));
nassertv(_node_path.is_valid());
}
/**
*
*/
INLINE FindApproxLevelEntry::
FindApproxLevelEntry(const FindApproxLevelEntry ©) :
_node_path(copy._node_path),
_i(copy._i),
_approx_path(copy._approx_path)
{
_next = nullptr;
nassertv(_node_path.is_valid());
}
/**
*
*/
INLINE void FindApproxLevelEntry::
operator = (const FindApproxLevelEntry ©) {
_node_path = copy._node_path;
_i = copy._i;
nassertv(&_approx_path == ©._approx_path);
nassertv(_node_path.is_valid());
}
/**
* Returns true if the next node matched by this entry must be a stashed node,
* false otherwise.
*/
INLINE bool FindApproxLevelEntry::
next_is_stashed(int increment) const {
return _approx_path.matches_stashed(_i + increment);
}
/**
* Returns true if this entry represents a solution to the search; i.e. all
* the components of the path have been successfully matched.
*/
INLINE bool FindApproxLevelEntry::
is_solution(int increment) const {
return (_i + increment >= _approx_path.get_num_components());
}