Rosetta 3.4
|
A node which is not changing type or rotamer throughout a simulation. More...
#include <AdditionalBackgroundNodesInteractionGraph.hh>
Public Types | |
typedef std::list < BackgroundToFirstClassEdge < V, E, G > * >::iterator | BackgroundEdgeListIter |
typedef std::list < BackgroundToFirstClassEdge < V, E, G > * > | BackgroundEdgeList |
typedef std::vector < BackgroundToFirstClassEdge < V, E, G > * > | BackgroundEdgeVector |
typedef std::vector < BackgroundToFirstClassEdge < V, E, G > * >::iterator | BackgroundEdgeVectorIter |
typedef std::vector < FirstClassNode< V, E, G > * > | FirstClassNodeVector |
Public Member Functions | |
virtual | ~BackgroundNode () |
BackgroundNode destructor. | |
BackgroundNode (AdditionalBackgroundNodesInteractionGraph< V, E, G > *owner, int node_index) | |
BackgroundNode constructor - no default or copy constructors; no operator =. | |
BackgroundEdgeListIter | add_edge (BackgroundToFirstClassEdge< V, E, G > *edge_ptr) |
Adds a BackgroundToFirstClassEdge to the edge list for this node. Returns an iterator to the new list element. | |
void | drop_edge (BackgroundEdgeListIter edge) |
removes an edge from the nodes edge list in constant time | |
BackgroundToFirstClassEdge< V, E, G > * | find_edge (int fc_node_index) |
Linear time edge lookup function. | |
virtual void | prepare_for_simulated_annealing ()=0 |
virtual void | print () const =0 |
virtual unsigned int | count_static_memory () const =0 |
virtual unsigned int | count_dynamic_memory () const |
Returns an int representing the amount of memory in bytes used by this node. | |
Protected Member Functions | |
void | update_edge_vector () |
Syncs the edge vector with the edge list. | |
int | get_node_index () const |
int | get_num_incident_edges () const |
BackgroundToFirstClassEdge< V, E, G > * | get_incident_edge (int index) const |
int | get_index_of_adjacent_first_class_node (int index) const |
FirstClassNode< V, E, G > * | get_adjacent_first_class_node (int index) const |
bool | get_edge_vector_up_to_date () const |
AdditionalBackgroundNodesInteractionGraph < V, E, G > * | get_owner () const |
A node which is not changing type or rotamer throughout a simulation.
typedef std::list< BackgroundToFirstClassEdge< V, E, G >* > core::pack::interaction_graph::BackgroundNode< V, E, G >::BackgroundEdgeList |
typedef std::list< BackgroundToFirstClassEdge< V, E, G >* >::iterator core::pack::interaction_graph::BackgroundNode< V, E, G >::BackgroundEdgeListIter |
typedef std::vector< BackgroundToFirstClassEdge< V, E, G >* > core::pack::interaction_graph::BackgroundNode< V, E, G >::BackgroundEdgeVector |
typedef std::vector< BackgroundToFirstClassEdge< V, E, G >* >::iterator core::pack::interaction_graph::BackgroundNode< V, E, G >::BackgroundEdgeVectorIter |
typedef std::vector< FirstClassNode< V, E, G >* > core::pack::interaction_graph::BackgroundNode< V, E, G >::FirstClassNodeVector |
core::pack::interaction_graph::BackgroundNode< V, E, G >::~BackgroundNode | ( | ) | [virtual] |
BackgroundNode destructor.
core::pack::interaction_graph::BackgroundNode< V, E, G >::BackgroundNode | ( | AdditionalBackgroundNodesInteractionGraph< V, E, G > * | owner, |
int | node_index | ||
) |
BackgroundNode constructor - no default or copy constructors; no operator =.
BackgroundNode::BackgroundNode
owner | - [in] - the owning graph node_index - [in] - the index of the background node |
std::list< BackgroundToFirstClassEdge< V, E, G > * >::iterator core::pack::interaction_graph::BackgroundNode< V, E, G >::add_edge | ( | BackgroundToFirstClassEdge< V, E, G > * | edge_ptr | ) |
Adds a BackgroundToFirstClassEdge to the edge list for this node. Returns an iterator to the new list element.
edge_ptr | - [in] - pointer to the edge being added |
unsigned int core::pack::interaction_graph::BackgroundNode< V, E, G >::count_dynamic_memory | ( | ) | const [virtual] |
Returns an int representing the amount of memory in bytes used by this node.
BackgroundNode::count_dynamic_memory
total_memory | - [out] - the amount of memory used by this node |
Reimplemented in core::pack::interaction_graph::HPatchBackgroundNode< V, E, G >, and core::pack::interaction_graph::SurfaceBackgroundNode< V, E, G >.
virtual unsigned int core::pack::interaction_graph::BackgroundNode< V, E, G >::count_static_memory | ( | ) | const [pure virtual] |
void core::pack::interaction_graph::BackgroundNode< V, E, G >::drop_edge | ( | BackgroundEdgeListIter | edge | ) |
removes an edge from the nodes edge list in constant time
edge | - [in] - the iterator to the edge's position in node's edge list |
BackgroundToFirstClassEdge< V, E, G > * core::pack::interaction_graph::BackgroundNode< V, E, G >::find_edge | ( | int | fc_node_index | ) |
Linear time edge lookup function.
fc_node_index | - [in] - the index of the first class node that is on the other end of the sought edge |
FirstClassNode< V, E, G>* core::pack::interaction_graph::BackgroundNode< V, E, G >::get_adjacent_first_class_node | ( | int | index | ) | const [inline, protected] |
bool core::pack::interaction_graph::BackgroundNode< V, E, G >::get_edge_vector_up_to_date | ( | ) | const [inline, protected] |
BackgroundToFirstClassEdge< V, E, G >* core::pack::interaction_graph::BackgroundNode< V, E, G >::get_incident_edge | ( | int | index | ) | const [inline, protected] |
int core::pack::interaction_graph::BackgroundNode< V, E, G >::get_index_of_adjacent_first_class_node | ( | int | index | ) | const [inline, protected] |
int core::pack::interaction_graph::BackgroundNode< V, E, G >::get_node_index | ( | ) | const [inline, protected] |
int core::pack::interaction_graph::BackgroundNode< V, E, G >::get_num_incident_edges | ( | ) | const [inline, protected] |
AdditionalBackgroundNodesInteractionGraph< V, E, G >* core::pack::interaction_graph::BackgroundNode< V, E, G >::get_owner | ( | ) | const [inline, protected] |
virtual void core::pack::interaction_graph::BackgroundNode< V, E, G >::prepare_for_simulated_annealing | ( | ) | [pure virtual] |
virtual void core::pack::interaction_graph::BackgroundNode< V, E, G >::print | ( | ) | const [pure virtual] |
void core::pack::interaction_graph::BackgroundNode< V, E, G >::update_edge_vector | ( | ) | [protected] |
Syncs the edge vector with the edge list.
BackgroundNode::update_edge_vector