Searched refs:uOldLeft (Results 1 – 4 of 4) sorted by relevance
147 unsigned uOldLeft = NewNodeIndexToOldNodeIndex[uNewLeft]; in DiffTreesE() local148 if (NODE_CHANGED == uOldLeft) in DiffTreesE()162 unsigned uOldParentLeft = OldTree.GetParent(uOldLeft); in DiffTreesE()217 unsigned uOldLeft = OldTree.GetLeft(uOld); in DiffTreesE() local223 bool bSameNotRotated = (uNewLeftPartner == uOldLeft && uNewRightPartner == uOldRight); in DiffTreesE()224 bool bSameRotated = (uNewLeftPartner == uOldRight && uNewRightPartner == uOldLeft); in DiffTreesE()228 Log("OldNode=%u OldL=%u OldR=%u\n", uOld, uOldLeft, uOldRight); in DiffTreesE()
76 unsigned uOldLeft = OldTree.GetLeft(uOld); in RealignDiffsE() local78 assert(uOldLeft < uNodeCount && uOldRight < uNodeCount); in RealignDiffsE()79 if (uOldLeft != uNewNodeIndexToOldNodeIndex[uNewLeft]) in RealignDiffsE()81 assert(uOldLeft == uNewNodeIndexToOldNodeIndex[uNewRight]); in RealignDiffsE()
74 unsigned uOldLeft = OldTree.GetLeft(uOld); in RealignDiffsE() local76 assert(uOldLeft < uNodeCount && uOldRight < uNodeCount); in RealignDiffsE()77 if (uOldLeft != uNewNodeIndexToOldNodeIndex[uNewLeft]) in RealignDiffsE()79 assert(uOldLeft == uNewNodeIndexToOldNodeIndex[uNewRight]); in RealignDiffsE()