1786   assert(RootWeights.count(N) && "Cannot get weight of unseen root!");  in getWeight()
1787   assert(RootWeights[N] != -1 && "Cannot get weight of unvisited root!");  in getWeight()
1788   assert(RootWeights[N] != -2 && "Cannot get weight of RAWU'd root!");  in getWeight()
1789   return RootWeights[N];  in getWeight()
1795   assert(RootWeights.count(N) && RootWeights[N] >= 0 &&  in getHeight()
2046   assert(RootWeights.count(N) && "Cannot balance non-root node.");  in balanceSubTree()
2047   assert(RootWeights[N] != -2 && "This node was RAUW'd!");  in balanceSubTree()
2051   if (RootWeights[N] != -1)  in balanceSubTree()
2060   if ((!isOpcodeHandled(Op0.getNode()) || RootWeights.count(Op0.getNode())) &&  in balanceSubTree()
2061       (!isOpcodeHandled(Op1.getNode()) || RootWeights.count(Op1.getNode()))) {  in balanceSubTree()
2064     if (isOpcodeHandled(Op0N) && RootWeights[Op0N] == -1) {  in balanceSubTree()
2071     if (isOpcodeHandled(Op1N) && RootWeights[Op1N] == -1) {  in balanceSubTree()
2077     RootWeights[N] = Weight;  in balanceSubTree()
2125     if (Child.getNode() != N && RootWeights.count(Child.getNode())) {  in balanceSubTree()
2128       int Weight = RootWeights[Child.getNode()];  in balanceSubTree()
2271     RootWeights[N] = CurrentWeight;  in balanceSubTree()
2321     if ((RootWeights.count(V0.getNode()) && RootWeights[V0.getNode()] == -2) ||  in balanceSubTree()
2322         (RootWeights.count(V1.getNode()) && RootWeights[V1.getNode()] == -2)) {  in balanceSubTree()
2389     RootWeights[N] = -2;  in balanceSubTree()
2394   RootWeights[NewRoot.getNode()] = Leaves.top().Weight;  in balanceSubTree()
2411     if (RootWeights.count(BasePtr.getNode()))  in rebalanceAddressTrees()
2438       if (RootWeights.count(N))  in rebalanceAddressTrees()
2441       RootWeights[N] = -1;  in rebalanceAddressTrees()
2445     RootWeights[BasePtr.getNode()] = -1;  in rebalanceAddressTrees()
2462   RootWeights.clear();  in rebalanceAddressTrees()