Lines Matching full:pchild
85 else updateSubtree(m_pEnter->pChild);
182 m_Nodes[r][c].pChild = NULL;
188 m_EdgesRight[r][c].pChild = &(m_Nodes[r][(c+1)%binsDim2]);
195 m_EdgesUp[r][c].pChild = &(m_Nodes[(r+1)%binsDim1][c]);
216 m_3dNodes[r][c][z].pChild = NULL;
222 m_3dEdgesUp[r][c][z].pChild = &(m_3dNodes[(r+1)%binsDim1][c][z]);
229 m_3dEdgesRight[r][c][z].pChild = &(m_3dNodes[r][(c+1)%binsDim2][z]);
236 m_3dEdgesDeep[r][c][z].pChild = &(m_3dNodes[r][c])[(z+1)%binsDim3];
310 pBV->pParent->pChild = pBV;
322 pBV->pParent->pChild= pBV;
427 pBV->pParent->pChild= pBV;
464 pCurE = pCurN->pChild; // the initial child from initial solution
467 pNxtN = pCurE->pChild;
497 pNxtE = pNxtN->pChild;
498 if(pNxtE && pNxtE->pChild==pCurN) // has connection
502 pNxtN->pChild = NULL;
506 pNxtE->pChild = pNxtN;
510 else pCurN->pChild = pNxtE;
531 pCurE = pCurN->pChild;
536 pNxtN = pCurE->pChild;
556 iC = 1 - pE->pParent->u + pE->pChild->u;
565 iC = 1 + pE->pParent->u - pE->pChild->u;
577 if(iMinC == (1 - m_pEnter->pChild->u + m_pEnter->pParent->u)) {
580 m_pEnter->pParent = m_pEnter->pChild;
581 m_pEnter->pChild = pN;
612 cvPEmdNode pLChildN = m_pLeave->pChild;
613 cvPEmdEdge pPreE = pLParentN->pChild;
616 pLParentN->pChild = m_pLeave->pNxt; // Leaving-BV is the first child
631 cvPEmdNode pEChildN = m_pEnter->pChild;
633 m_pEnter->pNxt = pEParentN->pChild; // insert the Enter BV as the first child
634 pEParentN->pChild = m_pEnter; // of its parent
651 if(pNxtN->pChild==pNxtE)
653 pNxtN->pChild = pNxtE->pNxt; // first child
657 pPreE0 = pNxtN->pChild;
664 pNxtE->pChild = pNxtN;
666 pNxtE->pNxt = pCurN->pChild;
667 pCurN->pChild = pNxtE;
688 cvPEmdNode pTo = m_pEnter->pChild;
748 m_pEnter->pParent = m_pEnter->pChild;
749 m_pEnter->pChild = pN;
770 pCurE = pCurN->pChild;
776 pNxtN = pCurE->pChild;
