Analysis Software
Documentation for sPHENIX simulation software
|
#include <JETSCAPE/blob/main/external_packages/gtl/include/GTL/pq_node.h>
Private Member Functions | |
q_node (node, int) | |
void | partial (iterator) |
void | full (iterator) |
PQ_KIND | kind () const |
void | write (ostream &, int) |
void | clear () |
p_node * | P () |
q_node * | Q () |
direction_indicator * | D () |
pq_leaf * | L () |
void | pertinent (iterator) |
q_node * | merge (iterator) |
void | turn () |
Private Attributes | |
iterator | pert_begin |
iterator | pert_end |
iterator | partial_pos [3] |
bool | pert_cons |
int | partial_count |
int | full_count |
Friends | |
class | planarity |
class | pq_tree |
Additional Inherited Members | |
Protected Types inherited from pq_node | |
enum | PQ_KIND { P_NODE, Q_NODE, LEAF, DIR } |
enum | PQ_MARK { UNMARKED, QUEUED, BLOCKED, UNBLOCKED } |
typedef symlist< pq_node * > ::iterator | iterator |
Protected Member Functions inherited from pq_node | |
pq_node (node n_, int id_) | |
virtual | ~pq_node () |
Protected Attributes inherited from pq_node | |
int | pert_children |
int | pert_leaves |
bool | is_endmost |
pq_node * | father |
PQ_MARK | mark |
symlist< pq_node * > | sons |
iterator | pos |
list< pq_node * >::iterator | lpos |
node | n |
int | id |
node | up |
int | up_id |
Definition at line 419 of file pq_node.h.
View newest version in sPHENIX GitHub at line 419 of file pq_node.h
|
private |
Definition at line 102 of file pq_node.cpp.
View newest version in sPHENIX GitHub at line 102 of file pq_node.cpp
|
inlineprivatevirtual |
Reimplemented from pq_node.
Definition at line 270 of file pq_node.cpp.
View newest version in sPHENIX GitHub at line 270 of file pq_node.cpp
References pq_node::clear(), full_count, partial_count, pert_begin, and pert_end.
|
inlineprivatevirtual |
|
inlineprivatevirtual |
Reimplemented from pq_node.
Definition at line 121 of file pq_node.cpp.
View newest version in sPHENIX GitHub at line 121 of file pq_node.cpp
References full_count, pert_begin, pq_node::pert_leaves, and pertinent().
|
inlineprivatevirtual |
|
inlineprivatevirtual |
Definition at line 293 of file pq_node.cpp.
View newest version in sPHENIX GitHub at line 293 of file pq_node.cpp
References assert, symlist< T >::back(), symlist< T >::erase(), pq_node::father, symlist< T >::front(), pq_node::is_endmost, pq_node::Q_NODE, pq_node::sons, and symlist< T >::splice().
Referenced by pq_tree::Q2(), and pq_tree::Q3().
|
inlineprivatevirtual |
|
inlineprivatevirtual |
Reimplemented from pq_node.
Definition at line 106 of file pq_node.cpp.
View newest version in sPHENIX GitHub at line 106 of file pq_node.cpp
References it, partial_count, partial_pos, pert_begin, pq_node::pert_leaves, and pertinent().
|
private |
Definition at line 133 of file pq_node.cpp.
View newest version in sPHENIX GitHub at line 133 of file pq_node.cpp
References assert, symlist< T >::back(), pq_node::DIR, end, symlist< T >::end(), symlist< T >::front(), it, pert_begin, pq_node::pert_children, pert_cons, pert_end, pq_node::sons, Acts::Test::tmp(), turn(), and pq_node::UNBLOCKED.
Referenced by full(), and partial().
|
inlineprivatevirtual |
Implements pq_node.
Definition at line 477 of file pq_node.h.
View newest version in sPHENIX GitHub at line 477 of file pq_node.h
Referenced by planarity::case_A(), planarity::case_B(), pq_tree::Q2(), and pq_tree::Q3().
|
private |
Definition at line 316 of file pq_node.cpp.
View newest version in sPHENIX GitHub at line 316 of file pq_node.cpp
References symlist< T >::reverse(), and pq_node::sons.
Referenced by pq_tree::P6(), pertinent(), pq_tree::Q2(), and pq_tree::Q3().
|
inlineprivatevirtual |
Implements pq_node.
Definition at line 278 of file pq_node.cpp.
View newest version in sPHENIX GitHub at line 278 of file pq_node.cpp
References pq_node::BLOCKED, pq_node::mark, and pq_node::UNBLOCKED.
|
friend |
|
friend |
|
private |
|
private |
Definition at line 561 of file pq_node.h.
View newest version in sPHENIX GitHub at line 561 of file pq_node.h
Referenced by clear(), planarity::examine_obstruction(), partial(), pq_tree::Q1(), pq_tree::Q2(), pq_tree::Q3(), and pq_tree::reduce().
|
private |
Definition at line 546 of file pq_node.h.
View newest version in sPHENIX GitHub at line 546 of file pq_node.h
Referenced by planarity::examine_obstruction(), partial(), pq_tree::Q2(), pq_tree::Q3(), and pq_tree::reduce().
|
private |
Definition at line 532 of file pq_node.h.
View newest version in sPHENIX GitHub at line 532 of file pq_node.h
Referenced by planarity::case_B(), planarity::case_E(), clear(), planarity::examine_obstruction(), full(), pq_tree::P3(), pq_tree::P6(), partial(), pertinent(), pq_tree::Q1(), pq_tree::Q2(), pq_tree::Q3(), pq_tree::reduce(), and pq_tree::replace_pert().
|
private |
Definition at line 555 of file pq_node.h.
View newest version in sPHENIX GitHub at line 555 of file pq_node.h
Referenced by planarity::examine_obstruction(), pq_tree::P3(), pertinent(), and pq_tree::reduce().
|
private |
Definition at line 538 of file pq_node.h.
View newest version in sPHENIX GitHub at line 538 of file pq_node.h
Referenced by planarity::case_B(), planarity::case_E(), clear(), planarity::examine_obstruction(), pq_tree::P3(), pq_tree::P4(), pq_tree::P5(), pq_tree::P6(), pertinent(), pq_tree::Q1(), pq_tree::Q2(), pq_tree::Q3(), pq_tree::reduce(), and pq_tree::replace_pert().