|
| Node * | nth_node (nat_t i) |
| |
| Node * | nth_node (nat_t i) const |
| |
| template<class Op > |
| void | for_each_node (Op &op) const |
| |
| template<class Op > |
| void | for_each_node (Op &&op=Op()) const |
| |
| template<class ContainerRet = SLList<Node *>, class Pred > |
| ContainerRet | filter_nodes (Pred &pred) const |
| |
| template<class ContainerRet = SLList<Node *>, class Pred > |
| ContainerRet | filter_nodes (Pred &&pred=Pred()) const |
| |
| template<typename RetT = NodeInfoType, class ContainerRet = SLList<RetT>, class Op > |
| ContainerRet | map_nodes (Op &op) const |
| |
| template<typename RetT = NodeInfoType, class ContainerRet = SLList<RetT>, class Op > |
| ContainerRet | map_nodes (Op &&op=Op()) const |
| |
| template<typename RetT = NodeInfoType, class ContainerRet = SLList<RetT>, class Op , class Pred > |
| ContainerRet | map_nodes_if (Op &op, Pred &pred) const |
| |
| template<typename RetT = NodeInfoType, class ContainerRet = SLList<RetT>, class Op , class Pred > |
| ContainerRet | map_nodes_if (Op &op, Pred &&pred=Pred()) const |
| |
| template<typename RetT = NodeInfoType, class ContainerRet = SLList<RetT>, class Op , class Pred > |
| ContainerRet | map_nodes_if (Op &&op, Pred &pred) const |
| |
| template<typename RetT = NodeInfoType, class ContainerRet = SLList<RetT>, class Op , class Pred > |
| ContainerRet | map_nodes_if (Op &&op=Op(), Pred &&pred=Pred()) const |
| |
| template<typename RetT , class Op > |
| RetT | fold_nodes (const RetT &init_val, Op &op) const |
| |
| template<typename RetT , class Op > |
| RetT | fold_nodes (const RetT &init_val, Op &&op=Op()) const |
| |
| template<typename RetT , class Op > |
| RetT | fold_nodes (RetT &&init_val, Op &op) const |
| |
| template<typename RetT , class Op > |
| RetT | fold_nodes (RetT &&init_val, Op &&op=Op()) const |
| |
| template<class Pred > |
| bool | all_nodes (Pred &pred) const |
| |
| template<class Pred > |
| bool | all_nodes (Pred &&pred=Pred()) const |
| |
| template<class Pred > |
| bool | exists_node (Pred &pred) const |
| |
| template<class Pred > |
| bool | exists_node (Pred &&pred=Pred()) const |
| |
| template<class Pred > |
| bool | none_node (Pred &pred) const |
| |
| template<class Pred > |
| bool | none_node (Pred &&pred=Pred()) const |
| |
| template<class Pred > |
| Node * | search_node (Pred &pred) const |
| |
| template<class Pred > |
| Node * | search_node (Pred &&pred=Pred()) const |
| |
| template<class Pred > |
| bool | remove_first_node_if (Pred &pred) |
| |
| template<class Pred > |
| bool | remove_first_node_if (Pred &&pred=Pred()) |
| |
| template<class Pred > |
| void | remove_node_if (Pred &pred) |
| |
| template<class Pred > |
| void | remove_node_if (Pred &&pred=Pred()) |
| |
| SLList< Node * > | nodes () const |
| |
| Arc * | nth_arc (nat_t i) |
| |
| Arc * | nth_arc (nat_t i) const |
| |
| template<class Op > |
| void | for_each_arc (Op &op) const |
| |
| template<class Op > |
| void | for_each_arc (Op &&op) const |
| |
| template<class ContainerRet = SLList<Arc *>, class Pred > |
| ContainerRet | filter_arcs (Pred &pred) const |
| |
| template<class ContainerRet = SLList<Arc *>, class Pred > |
| ContainerRet | filter_arcs (Pred &&pred=Pred()) const |
| |
| template<typename RetT = ArcInfoType, class ContainerRet = SLList<RetT>, class Op > |
| ContainerRet | map_arcs (Op &op) const |
| |
| template<typename RetT = ArcInfoType, class ContainerRet = SLList<RetT>, class Op > |
| ContainerRet | map_arcs (Op &&op=Op()) const |
| |
| template<typename RetT = ArcInfoType, class ContainerRet = SLList<RetT>, class Op , class Pred > |
| ContainerRet | map_arcs_if (Op &op, Pred &pred) const |
| |
| template<typename RetT = ArcInfoType, class ContainerRet = SLList<RetT>, class Op , class Pred > |
| ContainerRet | map_arcs_if (Op &op, Pred &&pred=Pred()) const |
| |
| template<typename RetT = ArcInfoType, class ContainerRet = SLList<RetT>, class Op , class Pred > |
| ContainerRet | map_arcs_if (Op &&op, Pred &pred) const |
| |
| template<typename RetT = ArcInfoType, class ContainerRet = SLList<RetT>, class Op , class Pred > |
| ContainerRet | map_arcs_if (Op &&op=Op(), Pred &&pred=Pred()) const |
| |
| template<typename RetT , class Op > |
| RetT | fold_arcs (const RetT &init_val, Op &op) const |
| |
| template<typename RetT , class Op > |
| RetT | fold_arcs (const RetT &init_val, Op &&op=Op()) const |
| |
| template<typename RetT , class Op > |
| RetT | fold_arcs (RetT &&init_val, Op &op) const |
| |
| template<typename RetT , class Op > |
| RetT | fold_arcs (RetT &&init_val, Op &&op=Op()) const |
| |
| template<class Pred > |
| bool | all_arcs (Pred &pred) const |
| |
| template<class Pred > |
| bool | all_arcs (Pred &&pred) const |
| |
| template<class Pred > |
| bool | exists_arc (Pred &pred) const |
| |
| template<class Pred > |
| bool | exists_arc (Pred &&pred) const |
| |
| template<class Pred > |
| bool | none_arc (Pred &pred) const |
| |
| template<class Pred > |
| bool | none_arc (Pred &&pred) const |
| |
| template<class Pred > |
| Arc * | search_arc (Pred &pred) const |
| |
| template<class Pred > |
| Arc * | search_arc (Pred &&pred) const |
| |
| template<class Pred > |
| bool | remove_first_arc_if (Pred &pred) |
| |
| template<class Pred > |
| bool | remove_first_arc_if (Pred &&pred) |
| |
| template<class Pred > |
| void | remove_arc_if (Pred &pred) |
| |
| template<class Pred > |
| void | remove_arc_if (Pred &&pred) |
| |
| SLList< Arc * > | arcs () const |
| |
| Arc * | nth_adjacent_arc (Node *p, nat_t i) |
| |
| Arc * | nth_adjacent_arc (Node *p, nat_t i) const |
| |
| template<class Op > |
| void | for_each_adjacent_arc (Node *p, Op &op) const |
| |
| template<class Op > |
| void | for_each_adjacent_arc (Node *p, Op &&op) const |
| |
| template<class ContainerRet = SLList<Arc *>, class Pred > |
| ContainerRet | filter_adjacent_arcs (Node *p, Pred &pred) const |
| |
| template<class ContainerRet = SLList<ArcInfoType>, class Pred > |
| ContainerRet | filter_adjacent_arcs (Node *p, Pred &&pred=Pred()) const |
| |
| template<typename RetT = ArcInfoType, class ContainerRet = SLList<RetT>, class Op > |
| ContainerRet | map_adjacent_arcs (Node *p, Op &op) const |
| |
| template<typename RetT = ArcInfoType, class ContainerRet = SLList<RetT>, class Op > |
| ContainerRet | map_adjacent_arcs (Node *p, Op &&op=Op()) const |
| |
| template<typename RetT = ArcInfoType, class ContainerRet = SLList<RetT>, class Op , class Pred > |
| ContainerRet | map_adjacent_arcs_if (Node *p, Op &op, Pred &pred) const |
| |
| template<typename RetT = ArcInfoType, class ContainerRet = SLList<RetT>, class Op , class Pred > |
| ContainerRet | map_adjacent_arcs_if (Node *p, Op &op, Pred &&pred=Pred()) const |
| |
| template<typename RetT = ArcInfoType, class ContainerRet = SLList<RetT>, class Op , class Pred > |
| ContainerRet | map_adjacent_arcs_if (Node *p, Op &&op, Pred &pred) const |
| |
| template<typename RetT = ArcInfoType, class ContainerRet = SLList<RetT>, class Op , class Pred > |
| ContainerRet | map_adjacent_arcs_if (Node *p, Op &&op=Op(), Pred &&pred=Pred()) const |
| |
| template<typename RetT , class Op > |
| RetT | fold_adjacent_arcs (Node *p, const RetT &init_val, Op &op) const |
| |
| template<typename RetT , class Op > |
| RetT | fold_adjacent_arcs (Node *p, const RetT &init_val, Op &&op=Op()) const |
| |
| template<typename RetT , class Op > |
| RetT | fold_adjacent_arcs (Node *p, RetT &&init_val, Op &op) const |
| |
| template<typename RetT , class Op > |
| RetT | fold_adjacent_arcs (Node *p, RetT &&init_val, Op &&op=Op()) const |
| |
| template<class Pred > |
| bool | all_adjacent_arcs (Node *p, Pred &pred) const |
| |
| template<class Pred > |
| bool | all_adjacent_arcs (Node *p, Pred &&pred) const |
| |
| template<class Pred > |
| bool | exists_adjacent_arc (Node *p, Pred &pred) const |
| |
| template<class Pred > |
| bool | exists_adjacent_arc (Node *p, Pred &&pred) const |
| |
| template<class Pred > |
| bool | none_adjacent_arc (Node *p, Pred &pred) const |
| |
| template<class Pred > |
| bool | none_adjacent_arc (Node *p, Pred &&pred) const |
| |
| template<class Pred > |
| Arc * | search_adjacent_arc (Node *p, Pred &pred) const |
| |
| template<class Pred > |
| Arc * | search_adjacent_arc (Node *p, Pred &&pred) const |
| |
| template<class Pred > |
| bool | remove_first_adjacent_arc_if (Node *p, Pred &pred) |
| |
| template<class Pred > |
| bool | remove_first_adjacent_arc_if (Node *p, Pred &&pred) |
| |
| template<class Pred > |
| void | remove_adjacent_arc_if (Node *p, Pred &pred) |
| |
| template<class Pred > |
| void | remove_adjacent_arc_if (Node *p, Pred &&pred) |
| |
| SLList< Arc * > | adjacent_arcs (Node *p) const |
| |
| void | reset_all_node_tag (GraphTag tag) const |
| |
| void | reset_all_node_tag () const |
| |
| void | reset_all_arc_tag (GraphTag tag) const |
| |
| void | reset_all_arc_tag () const |
| |
| void | reset_tag (GraphTag tag) const |
| |
| void | reset_all_tags () const |
| |
| void | reset_node_cookies () const |
| |
| void | reset_arc_cookies () const |
| |
| void | reset_node_counter () const |
| |
| void | reset_arc_counter () const |
| |
| void | reset_counters () const |
| |
| void | reset_cookies () const |
| |
| void | reset_nodes () const |
| |
| void | reset_arcs () const |
| |