58   ImutAVLTree *getLeft() const { return left; }  in getLeft()  function
80         T = T->getLeft();  in find()
100     if (const ImutAVLTree* L = getLeft())  in size()
175     if (ImutAVLTree* L = getLeft())  in foreach()
191     unsigned HL = getLeft() ? getLeft()->validateTree() : 0;  in validateTree()
202     assert((!getLeft() ||  in validateTree()
203             ImutInfo::isLess(ImutInfo::KeyOfValue(getLeft()->getValue()),  in validateTree()
320     uint32_t X = computeDigest(getLeft(), getRight(), getValue());  in computeDigest()
427   TreeTy*         getLeft(TreeTy* T) const { return T->getLeft(); }  in getLeft()  function
499       TreeTy *LL = getLeft(L);  in balanceTree()
507       TreeTy *LRL = getLeft(LR);  in balanceTree()
516       TreeTy *RL = getLeft(R);  in balanceTree()
524       TreeTy *RLL = getLeft(RL);  in balanceTree()
545       return createNode(getLeft(T), V, getRight(T));  in add_internal()
547       return balanceTree(add_internal(V, getLeft(T)), getValue(T), getRight(T));  in add_internal()
549       return balanceTree(getLeft(T), getValue(T), add_internal(V, getRight(T)));  in add_internal()
565       return combineTrees(getLeft(T), getRight(T));  in remove_internal()
567       return balanceTree(remove_internal(K, getLeft(T)),  in remove_internal()
570       return balanceTree(getLeft(T), getValue(T),  in remove_internal()
587     if (isEmpty(getLeft(T))) {  in removeMinBinding()
591     return balanceTree(removeMinBinding(getLeft(T), Noderemoved),  in removeMinBinding()
601     markImmutable(getLeft(T));  in markImmutable()
712         if (TreeTy* L = Current->getLeft())
742         if (TreeTy* L = Current->getLeft())