Lines Matching full:children

98     children.clear();
114     children.reserve(2 * n - 2);
130 …ode, on exit, \a outVBegin and \a outVEnd range over the indices of the volume children of the node
131     * and \a outOBegin and \a outOEnd range over the object children of the node */
146     if(children[idx + 1] < numBoxes) { //second index is always bigger
147       outVBegin = &(children[idx]);
151     else if(children[idx] >= numBoxes) { //if both children are objects
153       outOBegin = &(objects[children[idx] - numBoxes]);
156       outVBegin = &(children[idx]);
158       outOBegin = &(objects[children[idx + 1] - numBoxes]);
188       children.push_back(from + (int)objects.size() - 1); //there are objects.size() - 1 tree nodes
189       children.push_back(from + (int)objects.size());
198       children.push_back(idx1);
199       children.push_back(mid + (int)objects.size() - 1);
210       children.push_back(idx1);
211       children.push_back(idx2);
215 …std::vector<int> children; //children of x are children[2x] and children[2x+1], indices bigger tha…