Searched refs:m_pEnter (Results 1 – 2 of 2) sorted by relevance
85 else updateSubtree(m_pEnter->pChild); in getEMDL1()549 m_pEnter = NULL; in isOptimal()576 m_pEnter = m_NBVEdges[m_iEnter]; in isOptimal()577 if(iMinC == (1 - m_pEnter->pChild->u + m_pEnter->pParent->u)) { in isOptimal()579 cvPEmdNode pN = m_pEnter->pParent; in isOptimal()580 m_pEnter->pParent = m_pEnter->pChild; in isOptimal()581 m_pEnter->pChild = pN; in isOptimal()584 m_pEnter->iDir = 1; in isOptimal()630 cvPEmdNode pEParentN = m_pEnter->pParent; in findNewSolution()631 cvPEmdNode pEChildN = m_pEnter->pChild; in findNewSolution()[all …]
131 cvPEmdEdge m_pEnter; // Enter BV edge member in EmdL1