Lines Matching defs:rootNode

39     void RBTreeNodeInit(JSHandle<RBTreeNode>& rootNode, std::string& myKey, std::string& myValue,

49 rootNode = RBTreeNode::Set(thread, rootNode, hash, key, value);
50 rootNode->SetIsRed(thread, JSTaggedValue(false));
54 void RBTreeValueCheck(JSHandle<RBTreeNode>& rootNode, std::string& myKey, std::string& myValue,
64 JSHandle<JSTaggedValue> rootNodeVa(thread, rootNode.GetTaggedValue());
89 JSHandle<RBTreeNode> rootNode(thread, JSTaggedValue::Hole());
92 RBTreeNodeInit(rootNode, myKey, myValue, NODE_NUMBERS);
93 EXPECT_EQ(rootNode->GetCount(), NODE_NUMBERS);
95 RBTreeValueCheck(rootNode, myKey, myValue, 0, NODE_NUMBERS);
102 JSHandle<RBTreeNode> rootNode(thread, JSTaggedValue::Hole());
105 RBTreeNodeInit(rootNode, myKey, myValue, NODE_NUMBERS);
106 EXPECT_EQ(rootNode->GetCount(), NODE_NUMBERS);
114 RBTreeNode::Delete(thread, rootNode.GetTaggedValue(), hash, key.GetTaggedValue(), holeValue);
115 rootNode = JSHandle<RBTreeNode>(thread, dValue);
117 EXPECT_EQ(rootNode->GetCount(), (NODE_NUMBERS / 2));
123 JSHandle<JSTaggedValue> rootNodeVa(thread, rootNode.GetTaggedValue());
128 RBTreeValueCheck(rootNode, myKey, myValue, NODE_NUMBERS / 2, NODE_NUMBERS);
133 JSHandle<RBTreeNode> rootNode(thread, JSTaggedValue::Hole());
136 RBTreeNodeInit(rootNode, myKey, myValue, TREE_NODE_NUMBERS);
137 EXPECT_EQ(rootNode->GetCount(), TREE_NODE_NUMBERS);
139 uint32_t count = rootNode->GetCount();
143 JSHandle<JSTaggedValue> rootNodeVa = JSHandle<JSTaggedValue>::Cast(rootNode);
175 JSHandle<RBTreeNode> rootNode(thread, JSTaggedValue::Hole());
178 RBTreeNodeInit(rootNode, myKey, myValue, NODE_NUMBERS);
179 EXPECT_EQ(rootNode->GetCount(), NODE_NUMBERS);
181 JSHandle<LinkedNode> head = RBTreeNode::Detreeing(thread, rootNode);
188 EXPECT_EQ(count, rootNode->GetCount());