Home
last modified time | relevance | path

Searched refs:childindex (Results 1 – 25 of 57) sorted by relevance

123

/dports/graphics/Coin/coin-Coin-4.0.0/src/misc/
H A DSoLightPath.cpp101 SoLightPath::append(const int childindex) in append() argument
103 this->indices.append(childindex); in append()
110 SoLightPath::push(const int childindex) in push() argument
112 this->indices.append(childindex); in push()
135 SoLightPath::setTail(const int childindex) in setTail() argument
137 this->indices[this->indices.getLength()-1] = childindex; in setTail()
H A DSoCompactPathList.cpp116 SoCompactPathList::push(int childindex) in push() argument
129 if (this->lookuptable[idx + i] == childindex) break; in push()
H A DSoPath.cpp211 SoPath::append(const int childindex) in append() argument
228 if (childindex >= children->getLength()) { in append()
230 childindex); in append()
235 SoNode * node = (*children)[childindex]; in append()
236 this->append(node, childindex); in append()
/dports/games/tesseract-data/tesseract/src/game/
H A Dwaypoint.cpp228 CHECKCLOSEST(curnode->childindex(1)); in closestwaypoint()
233 CHECKCLOSEST(curnode->childindex(0)); in closestwaypoint()
247 curnode += curnode->childindex(0); in closestwaypoint()
279 CHECKWITHIN(curnode->childindex(1)); in findwaypointswithin()
284 CHECKWITHIN(curnode->childindex(0)); in findwaypointswithin()
288 CHECKWITHIN(curnode->childindex(1)); in findwaypointswithin()
298 curnode += curnode->childindex(0); in findwaypointswithin()
328 CHECKNEAR(curnode->childindex(1)); in avoidnear()
333 CHECKNEAR(curnode->childindex(0)); in avoidnear()
337 CHECKNEAR(curnode->childindex(1)); in avoidnear()
[all …]
/dports/games/tesseract/tesseract/src/game/
H A Dwaypoint.cpp228 CHECKCLOSEST(curnode->childindex(1)); in closestwaypoint()
233 CHECKCLOSEST(curnode->childindex(0)); in closestwaypoint()
247 curnode += curnode->childindex(0); in closestwaypoint()
279 CHECKWITHIN(curnode->childindex(1)); in findwaypointswithin()
284 CHECKWITHIN(curnode->childindex(0)); in findwaypointswithin()
288 CHECKWITHIN(curnode->childindex(1)); in findwaypointswithin()
298 curnode += curnode->childindex(0); in findwaypointswithin()
328 CHECKNEAR(curnode->childindex(1)); in avoidnear()
333 CHECKNEAR(curnode->childindex(0)); in avoidnear()
337 CHECKNEAR(curnode->childindex(1)); in avoidnear()
[all …]
/dports/games/sauerbraten/sauerbraten/src/fpsgame/
H A Dwaypoint.cpp238 CHECKCLOSEST(curnode->childindex(1)); in closestwaypoint()
243 CHECKCLOSEST(curnode->childindex(0)); in closestwaypoint()
257 curnode += curnode->childindex(0); in closestwaypoint()
292 CHECKWITHIN(curnode->childindex(1)); in findwaypointswithin()
297 CHECKWITHIN(curnode->childindex(0)); in findwaypointswithin()
301 CHECKWITHIN(curnode->childindex(1)); in findwaypointswithin()
311 curnode += curnode->childindex(0); in findwaypointswithin()
344 CHECKNEAR(curnode->childindex(1)); in avoidnear()
349 CHECKNEAR(curnode->childindex(0)); in avoidnear()
353 CHECKNEAR(curnode->childindex(1)); in avoidnear()
[all …]
/dports/games/redeclipse/base-2.0.0/src/game/
H A Dwaypoint.cpp235 CHECKCLOSEST(curnode->childindex(1)); in closestwaypoint()
240 CHECKCLOSEST(curnode->childindex(0)); in closestwaypoint()
254 curnode += curnode->childindex(0); in closestwaypoint()
289 CHECKWITHIN(curnode->childindex(1)); in findwaypointswithin()
294 CHECKWITHIN(curnode->childindex(0)); in findwaypointswithin()
298 CHECKWITHIN(curnode->childindex(1)); in findwaypointswithin()
308 curnode += curnode->childindex(0); in findwaypointswithin()
341 CHECKNEAR(curnode->childindex(1)); in avoidnear()
346 CHECKNEAR(curnode->childindex(0)); in avoidnear()
350 CHECKNEAR(curnode->childindex(1)); in avoidnear()
[all …]
/dports/games/redeclipse16/base-1.6.0/src/game/
H A Dwaypoint.cpp237 CHECKCLOSEST(curnode->childindex(1)); in closestwaypoint()
242 CHECKCLOSEST(curnode->childindex(0)); in closestwaypoint()
256 curnode += curnode->childindex(0); in closestwaypoint()
291 CHECKWITHIN(curnode->childindex(1)); in findwaypointswithin()
296 CHECKWITHIN(curnode->childindex(0)); in findwaypointswithin()
300 CHECKWITHIN(curnode->childindex(1)); in findwaypointswithin()
310 curnode += curnode->childindex(0); in findwaypointswithin()
343 CHECKNEAR(curnode->childindex(1)); in avoidnear()
348 CHECKNEAR(curnode->childindex(0)); in avoidnear()
352 CHECKNEAR(curnode->childindex(1)); in avoidnear()
[all …]
/dports/graphics/Coin/coin-Coin-4.0.0/include/Inventor/misc/
H A DSoLightPath.h49 void append(const int childindex);
50 void push(const int childindex);
52 void setTail(const int childindex);
/dports/games/redeclipse/base-2.0.0/src/engine/
H A Dbih.cpp69 curnode += curnode->childindex(faridx); in traverse()
83 curnode += curnode->childindex(faridx); in traverse()
106 curnode += curnode->childindex(faridx); in traverse()
113 curnode += curnode->childindex(nearidx); in traverse()
577 curnode += curnode->childindex(faridx); in collide()
590 curnode += curnode->childindex(faridx); in collide()
609 curnode += curnode->childindex(faridx); in collide()
615 curnode += curnode->childindex(nearidx); in collide()
739 curnode += curnode->childindex(faridx); in genstaintris()
752 curnode += curnode->childindex(faridx); in genstaintris()
[all …]
H A Dhitzone.h9 int childindex(int which) const { return child[which]&0x3FFF; } in childindex() function
112 curnode += curnode->childindex(faridx); in intersect()
116 else if(triintersect(m, s, curnode->childindex(faridx), o, ray)) in intersect()
122 if(triintersect(m, s, curnode->childindex(nearidx), o, ray)) in intersect()
131 curnode += curnode->childindex(faridx); in intersect()
135 else if(triintersect(m, s, curnode->childindex(faridx), o, ray)) in intersect()
148 save.node = curnode + curnode->childindex(faridx); in intersect()
154 … intersect(m, s, o, ray, invray, curnode + curnode->childindex(nearidx), tmin, tmax); in intersect()
155 curnode += curnode->childindex(faridx); in intersect()
159 else if(triintersect(m, s, curnode->childindex(faridx), o, ray)) in intersect()
[all …]
/dports/graphics/Coin/coin-Coin-4.0.0/include/Inventor/
H A DSoPath.h69 void append(const int childindex);
72 void push(const int childindex);
137 SoPath::push(const int childindex) in push() argument
139 this->append(childindex); in push()
/dports/graphics/Coin/coin-Coin-4.0.0/src/actions/
H A DSoAction.cpp962 SoAction::pushCurPath(const int childindex, SoNode * node) in pushCurPath() argument
964 if (node) this->currentpath.simpleAppend(node, childindex); in pushCurPath()
966 this->currentpath.append(childindex); in pushCurPath()
977 childindex, node->getName().getString(), curlen); in pushCurPath()
985 childindex, node->getName().getString(),curlen); in pushCurPath()
991 SbBool inpath = PRIVATE(this)->applieddata.pathlistdata.compactlist->push(childindex); in pushCurPath()
1028 childindex, node->getName().getString(), curlen); in pushCurPath()
1035 childindex, node->getName().getString(), curlen); in pushCurPath()
1194 SoAction::popPushCurPath(const int childindex, SoNode * node) in popPushCurPath() argument
1198 this->currentpath.append(childindex); in popPushCurPath()
[all …]
/dports/games/sauerbraten/sauerbraten/src/engine/
H A Dbih.cpp66 curnode += curnode->childindex(faridx); in traverse()
70 … else if(triintersect(m, curnode->childindex(faridx), mo, mray, maxdist, dist, mode)) return true; in traverse()
75 … if(triintersect(m, curnode->childindex(nearidx), mo, mray, maxdist, dist, mode)) return true; in traverse()
80 curnode += curnode->childindex(faridx); in traverse()
84 … else if(triintersect(m, curnode->childindex(faridx), mo, mray, maxdist, dist, mode)) return true; in traverse()
96 save.node = curnode + curnode->childindex(faridx); in traverse()
102 …if(traverse(m, o, ray, invray, maxdist, dist, mode, curnode + curnode->childindex(nearidx), tmin, … in traverse()
103 curnode += curnode->childindex(faridx); in traverse()
108 … else if(triintersect(m, curnode->childindex(faridx), mo, mray, maxdist, dist, mode)) return true; in traverse()
110 curnode += curnode->childindex(nearidx); in traverse()
/dports/graphics/Coin/coin-Coin-4.0.0/src/nodes/
H A DSoGroup.cpp492 SoGroup::removeChild(int childindex) in removeChild() argument
495 if (childindex < 0 || childindex >= this->getNumChildren()) { in removeChild()
498 childindex, this->getNumChildren()); in removeChild()
503 this->getChild(childindex), in removeChild()
504 NULL, childindex); in removeChild()
505 this->getChildren()->remove(childindex); in removeChild()
/dports/games/tesseract-data/tesseract/src/engine/
H A Dbih.cpp59 curnode += curnode->childindex(faridx); in traverse()
68 … if(triintersect(m, curnode->childindex(nearidx), mo, mray, maxdist, dist, mode)) return true; in traverse()
73 curnode += curnode->childindex(faridx); in traverse()
89 save.node = curnode + curnode->childindex(faridx); in traverse()
96 curnode += curnode->childindex(faridx); in traverse()
103 curnode += curnode->childindex(nearidx); in traverse()
570 curnode += curnode->childindex(faridx); in collide()
583 curnode += curnode->childindex(faridx); in collide()
597 stack[stacksize++] = curnode + curnode->childindex(faridx); in collide()
602 curnode += curnode->childindex(faridx); in collide()
[all …]
H A Dhitzone.h9 int childindex(int which) const { return child[which]&0x3FFF; } in childindex() function
111 curnode += curnode->childindex(faridx); in intersect()
115 else if(triintersect(m, s, curnode->childindex(faridx), o, ray)) in intersect()
121 …if(triintersect(m, s, curnode->childindex(nearidx), o, ray)) tmax = min(tmax, skelmodel::intersect… in intersect()
126 curnode += curnode->childindex(faridx); in intersect()
130 else if(triintersect(m, s, curnode->childindex(faridx), o, ray)) in intersect()
143 save.node = curnode + curnode->childindex(faridx); in intersect()
149 … intersect(m, s, o, ray, invray, curnode + curnode->childindex(nearidx), tmin, tmax); in intersect()
150 curnode += curnode->childindex(faridx); in intersect()
154 else if(triintersect(m, s, curnode->childindex(faridx), o, ray)) in intersect()
[all …]
/dports/games/tesseract/tesseract/src/engine/
H A Dbih.cpp59 curnode += curnode->childindex(faridx); in traverse()
68 … if(triintersect(m, curnode->childindex(nearidx), mo, mray, maxdist, dist, mode)) return true; in traverse()
73 curnode += curnode->childindex(faridx); in traverse()
89 save.node = curnode + curnode->childindex(faridx); in traverse()
96 curnode += curnode->childindex(faridx); in traverse()
103 curnode += curnode->childindex(nearidx); in traverse()
570 curnode += curnode->childindex(faridx); in collide()
583 curnode += curnode->childindex(faridx); in collide()
597 stack[stacksize++] = curnode + curnode->childindex(faridx); in collide()
602 curnode += curnode->childindex(faridx); in collide()
[all …]
H A Dhitzone.h9 int childindex(int which) const { return child[which]&0x3FFF; } in childindex() function
111 curnode += curnode->childindex(faridx); in intersect()
115 else if(triintersect(m, s, curnode->childindex(faridx), o, ray)) in intersect()
121 …if(triintersect(m, s, curnode->childindex(nearidx), o, ray)) tmax = min(tmax, skelmodel::intersect… in intersect()
126 curnode += curnode->childindex(faridx); in intersect()
130 else if(triintersect(m, s, curnode->childindex(faridx), o, ray)) in intersect()
143 save.node = curnode + curnode->childindex(faridx); in intersect()
149 … intersect(m, s, o, ray, invray, curnode + curnode->childindex(nearidx), tmin, tmax); in intersect()
150 curnode += curnode->childindex(faridx); in intersect()
154 else if(triintersect(m, s, curnode->childindex(faridx), o, ray)) in intersect()
[all …]
/dports/games/redeclipse16/base-1.6.0/src/engine/
H A Dbih.cpp70 curnode += curnode->childindex(faridx); in traverse()
74 … else if(triintersect(m, curnode->childindex(faridx), mo, mray, maxdist, maxdist, mode)) in traverse()
83 if(triintersect(m, curnode->childindex(nearidx), mo, mray, maxdist, maxdist, mode)) in traverse()
92 curnode += curnode->childindex(faridx); in traverse()
96 … else if(triintersect(m, curnode->childindex(faridx), mo, mray, maxdist, maxdist, mode)) in traverse()
112 save.node = curnode + curnode->childindex(faridx); in traverse()
118 …traverse(m, o, ray, invray, maxdist, maxdist, mode, curnode + curnode->childindex(nearidx), tmin, … in traverse()
123 curnode += curnode->childindex(faridx); in traverse()
128 … else if(triintersect(m, curnode->childindex(faridx), mo, mray, maxdist, maxdist, mode)) in traverse()
134 curnode += curnode->childindex(nearidx); in traverse()
/dports/games/bloodfrontier/bloodfrontier/src/engine/
H A Dbih.cpp79 curnode = &nodes[curnode->childindex(faridx)]; in traverse()
83 … else if(triintersect(tris[curnode->childindex(faridx)], o, ray, maxdist, maxdist, mode, noclip)) in traverse()
92 … if(triintersect(tris[curnode->childindex(nearidx)], o, ray, maxdist, maxdist, mode, noclip)) in traverse()
101 curnode = &nodes[curnode->childindex(faridx)]; in traverse()
105 … else if(triintersect(tris[curnode->childindex(faridx)], o, ray, maxdist, maxdist, mode, noclip)) in traverse()
119 save.node = &nodes[curnode->childindex(faridx)]; in traverse()
123 … else if(triintersect(tris[curnode->childindex(faridx)], o, ray, maxdist, maxdist, mode, noclip)) in traverse()
129 curnode = &nodes[curnode->childindex(nearidx)]; in traverse()
/dports/graphics/Coin/coin-Coin-4.0.0/include/Inventor/actions/
H A DSoAction.h119 void pushCurPath(const int childindex, SoNode * node = NULL);
123 void popPushCurPath(const int childindex, SoNode * node = NULL);
/dports/devel/bullet/bullet3-3.21/src/BulletCollision/Gimpact/
H A Dgim_box_set.h212 GUINT childindex = getLeftNodeIndex(nodecount); in refit() local
214 getNodeBound(childindex, bound); in refit()
216 childindex = getRightNodeIndex(nodecount); in refit()
218 getNodeBound(childindex, bound2); in refit()
/dports/graphics/blender/blender-2.91.0/extern/bullet2/src/BulletCollision/Gimpact/
H A Dgim_box_set.h212 GUINT childindex = getLeftNodeIndex(nodecount); in refit() local
214 getNodeBound(childindex, bound); in refit()
216 childindex = getRightNodeIndex(nodecount); in refit()
218 getNodeBound(childindex, bound2); in refit()
/dports/games/supertuxkart/SuperTuxKart-1.2-src/lib/bullet/src/BulletCollision/Gimpact/
H A Dgim_box_set.h236 GUINT childindex = getLeftNodeIndex(nodecount); in refit() local
238 getNodeBound(childindex,bound); in refit()
240 childindex = getRightNodeIndex(nodecount); in refit()
242 getNodeBound(childindex,bound2); in refit()

123