Lines Matching defs:node
36 A block can either be formatted, i.e. a node in the S+Tree, or
122 Node *node = NULL;
124 node = static_cast<Node*>(this);
125 return node;
133 if (Node *node = ToNode()) {
134 if (node->IsInternal())
135 internalNode = static_cast<InternalNode*>(node);
145 if (Node *node = ToNode()) {
146 if (node->IsLeaf())
147 leafNode = static_cast<LeafNode*>(node);
163 if (Node *node = const_cast<Block*>(this)->ToNode())
164 return node->IsLeaf();
172 if (Node *node = const_cast<Block*>(this)->ToNode())
173 return node->IsInternal();
246 /*! \brief Returns the number of child "items" the node contains/refers to.
248 If the node is a leaf node, this number is indeed the number of the
249 items it contains. For internal node it is the number of keys, as oposed
252 \return The number of child "items" the node contains/refers to.
285 // check the minimal size of the node against its declared free space
287 FATAL(("WARNING: bad node %" B_PRIu64
306 \brief Represents an internal tree node.
308 Internal tree node refer to its child nodes via DiskChilds.
349 // check the minimal size of the node against its declared free space
355 FATAL(("WARNING: bad internal node %" B_PRIu64
369 \brief Represents an tree leaf node.
423 // check the minimal size of the node against its declared free space
428 FATAL(("WARNING: bad leaf node %" B_PRIu64
449 \brief A structure referring to a child node of an internal node.