Lines Matching refs:m_nbChildren
190 : m_nbChildren(0)
208 m_children[m_nbChildren] = node;
209 m_nbChildren++;
218 m_nbChildren, m_children, &m_area);
231 m_nbChildren = 0;
242 for (unsigned int i = 0; i < m_nbChildren; i++)
254 , m_nbChildren(0)
271 for (unsigned i = 0; i < m_nbChildren; i++)
295 if (m_nbChildren == 0)
302 for (unsigned int i = 1; i < m_nbChildren; i++) {
316 m_nbChildren, m_children, 0);
329 m_children[m_nbChildren] = node;
330 m_nbChildren++;
337 if (m_nbChildren > m_tree->m_maxChildren)
346 for (unsigned int i = 0; i < m_nbChildren; i++) {
356 for (unsigned int i = nodeIndex; i < m_nbChildren - 1; i++)
358 m_nbChildren--;
365 for (unsigned int i = index; i < m_nbChildren - 1; i++)
367 m_nbChildren--;
372 m_nbChildren = 0;
389 for (unsigned int i = 1; i < m_nbChildren; i++) {
416 elementB = m_children[m_nbChildren - 1];
438 for (unsigned int i = 0; i < m_nbChildren; i++) {
443 if (dA < dB && listA->m_nbChildren < m_tree->m_maxChildren)
445 else if (dB < dA && listB->m_nbChildren < m_tree->m_maxChildren)
449 listA->m_nbChildren > listB->m_nbChildren ? listB : listA;
456 for (unsigned int i = 0; i < listA->m_nbChildren; i++)
460 for (unsigned int i = 0; i < listB->m_nbChildren; i++)
530 for (unsigned int i = 0; i < m_nbChildren; i++)
538 if (!m_nbChildren)
574 for (unsigned int i = 0; i < m_nbChildren; i++) {
590 for (unsigned int i = 0; i < m_nbChildren; i++) {
