Lines Matching refs:Node
60 * ordered map <uint64_t, Node*>. Nodes are structs which take form
74 * flag of Node set to True). Then later if this same address is
142 * of the Node)
154 * Node Balancing: The tree structure is maintained by an
179 struct Node;
181 typedef std::map<uint64_t, Node*> IndexNodeMap;
199 uint64_t getSum(Node* node, bool from_left, uint64_t sum_from_below,
210 uint64_t getSumsLeavesToRoot(Node* node) const;
227 uint64_t updateSum(Node* node,
240 uint64_t updateSumsLeavesToRoot(Node* node, bool is_new_leaf);
264 void sanityCheckTree(const Node* node, uint64_t level = 0) const;
349 * Node which takes form of Leaf, INode or Root
351 struct Node{
368 Node* parent;
383 Node() : sumLeft(0), sumRight(0), discardLeft(false),