Changeset 4067


Ignore:
Timestamp:
Aug 5, 2021, 12:42:51 PM (11 months ago)
Author:
Peter
Message:

docs

File:
1 edited

Legend:

Unmodified
Added
Removed
  • branches/kendall-score/yat/utility/ranking/NodeBase.h

    r4065 r4067  
    4343      NodeBase* right_;
    4444
     45      // return true if head node
    4546      bool is_head_node(void) const;
     47      // return true if having a parent and its left child is this
    4648      bool is_left_node(void) const;
     49      // return true if having a parent and its right child is this
    4750      bool is_right_node(void) const;
     51      // return true if having no parent
    4852      bool is_root_node(void) const;
     53      // return traverse up in the tree following the left branch
     54      // until a node has no left branch and we return that leaf node.
    4955      NodeBase* left_most(void);
     56      const NodeBase* left_most(void) const;
     57      // same as left_most but follow right branch
    5058      NodeBase* right_most(void);
    51       const NodeBase* left_most(void) const;
    5259      const NodeBase* right_most(void) const;
     60      // Only used to validate that the tree is valid, used in debug
     61      // code and assertions.
    5362      bool validate(void) const;
    5463      bool recursive_validate(void) const;
Note: See TracChangeset for help on using the changeset viewer.