LeafNode
class ValueNode : public LeafNode {
: LeafNode(),
class SpecialOpNode : public LeafNode {
class LeafNode : public QueryNode {
LeafNode();
virtual ~LeafNode();
class AttributeNode : public LeafNode {
class StringNode : public LeafNode {
class DateNode : public LeafNode {
LeafNode *
LeafNode *leafNode = NULL;
leafNode = static_cast<LeafNode*>(node);
LeafNode::GetItemHeaders() const
LeafNode::ItemHeaderAt(int32 index) const
LeafNode::GetLeftKey(VKey *k) const
LeafNode::GetRightKey(VKey *k) const
LeafNode::Check() const
LeafNode::GetItemSpaceOffset() const
class LeafNode : public Node {
class LeafNode;
LeafNode *ToLeafNode();
DirItem(LeafNode *node, ItemHeader *header)
IndirectItem(LeafNode *node, ItemHeader *header)
LeafNode *
Item::Item(LeafNode *node, const ItemHeader *header)
Item::SetTo(LeafNode *node, const ItemHeader *header)
Item::SetTo(LeafNode *node, int32 index)
class LeafNode;
Item(LeafNode *node, const ItemHeader *header);
status_t SetTo(LeafNode *node, const ItemHeader *header);
status_t SetTo(LeafNode *node, int32 index);
LeafNode *GetNode() const;
LeafNode *fNode;
TreeIterator::GoToPreviousLeaf(LeafNode **node)
TreeIterator::GoToNextLeaf(LeafNode **node)
TreeIterator::FindRightMostLeaf(const VKey *k, LeafNode **node)
LeafNode *node = NULL;
LeafNode *node = NULL;
LeafNode *node = NULL;
LeafNode *node = fTreeIterator.GetNode()->ToLeafNode();
ItemIterator::_GetLeafNode(LeafNode **leafNode) const
ItemIterator::_SearchRightMost(LeafNode *node, const VKey *k,
status_t _GetLeafNode(LeafNode **node) const;
status_t _SearchRightMost(LeafNode *node, const VKey *k,
class LeafNode;
status_t GoToPreviousLeaf(LeafNode **node = NULL);
status_t GoToNextLeaf(LeafNode **node = NULL);
status_t FindRightMostLeaf(const VKey *k, LeafNode **node = NULL);
StatItem(LeafNode *node, ItemHeader *header)
LeafNode::LeafNode()
LeafNode::~LeafNode()
LeafNode::Arity() const
LeafNode::SetChildAt(QueryNode *child, int32 index)
LeafNode::ChildAt(int32 index)