Home
last modified time | relevance | path

Searched refs:GetLeftChildIndex (Results 1 - 3 of 3) sorted by relevance

/arkcompiler/ets_runtime/ecmascript/
H A Dtagged_tree.cpp233 if (GetColor(GetLeftChildIndex(bro)) == TreeColor::BLACK && in DeleteRebalance()
239 SetColor(thread, GetLeftChildIndex(bro), TreeColor::BLACK); in DeleteRebalance()
259 GetColor(GetLeftChildIndex(bro)) == TreeColor::BLACK) { in DeleteRebalance()
263 if (GetColor(GetLeftChildIndex(bro)) == TreeColor::BLACK) { in DeleteRebalance()
271 SetColor(thread, GetLeftChildIndex(bro), TreeColor::BLACK); in DeleteRebalance()
283 int child = GetLeftChildIndex(entry); in GetPreDecessor()
288 while (parent >= 0 && (GetLeftChildIndex(parent) == entry)) { in GetPreDecessor()
405 index = tree->GetLeftChildIndex(index); in GetSortArray()
495 parentIndex = tree->GetLeftChildIndex(parentIndex); in GetLowerKey()
516 parentIndex = tree->GetLeftChildIndex(parentInde in GetHigherKey()
[all...]
H A Dtagged_tree.h203 inline int GetLeftChildIndex(int parent) const in GetLeftChildIndex() function in panda::ecmascript::TaggedTree
/arkcompiler/ets_runtime/ecmascript/tests/
H A Dtagged_tree_test.cpp57 if (CheckRBTreeOfAllPaths(tree, numsOfBlack, tree->GetLeftChildIndex(index), count) && in CheckRBTreeOfAllPaths()
73 child = tree->GetLeftChildIndex(child); in CheckBlackNodeNumbers()
86 int pleft = tree->GetLeftChildIndex(parent); in IsVaildRBTree()
92 int ileft = tree->GetLeftChildIndex(index); in IsVaildRBTree()

Completed in 6 milliseconds