Rosetta 3.4
Public Types | Public Member Functions | Protected Member Functions
core::scoring::TwelveANeighborGraph Class Reference

#include <TwelveANeighborGraph.hh>

Inheritance diagram for core::scoring::TwelveANeighborGraph:
Inheritance graph
[legend]
Collaboration diagram for core::scoring::TwelveANeighborGraph:
Collaboration graph
[legend]

List of all members.

Public Types

typedef ContextGraph parent

Public Member Functions

virtual ~TwelveANeighborGraph ()
 TwelveANeighborGraph ()
 TwelveANeighborGraph (Size num_nodes)
 TwelveANeighborGraph (TwelveANeighborGraph const &source)
TwelveANeighborGraphoperator= (TwelveANeighborGraph const &source)
virtual Distance neighbor_cutoff () const
virtual void conditionally_add_edge (Size lower_node_id, Size upper_node_id, DistanceSquared dsq)
virtual ContextGraphOP clone () const
virtual void update_from_pose (pose::Pose const &pose)
virtual void delete_edge (graph::Edge *edge)
 remove an edge from the graph. (NEW AS OF 12/9/07) Never call C++'s "delete" function on an edge pointer directly. Derived classes must implement this function. If they wish to use unordered_object_pools to manage their memory

Protected Member Functions

virtual Size count_static_memory () const
virtual Size count_dynamic_memory () const
virtual graph::Nodecreate_new_node (Size node_index)
 factory method for node creation, defined by derived graph classes, called by the base class
virtual graph::Edgecreate_new_edge (Size index1, Size index2)
 factory method for edge creation, defined by derived graph classes, called by the base class
virtual graph::Edgecreate_new_edge (graph::Edge const *example_edge)
 factory method for edge copy-construction. Derived class should downcast the example_edge pointer and may read that edge's data.

Member Typedef Documentation

Reimplemented from core::scoring::ContextGraph.


Constructor & Destructor Documentation

core::scoring::TwelveANeighborGraph::~TwelveANeighborGraph ( ) [virtual]
core::scoring::TwelveANeighborGraph::TwelveANeighborGraph ( )

Referenced by clone(), and count_static_memory().

core::scoring::TwelveANeighborGraph::TwelveANeighborGraph ( Size  num_nodes)
core::scoring::TwelveANeighborGraph::TwelveANeighborGraph ( TwelveANeighborGraph const &  source)

References operator=().


Member Function Documentation

ContextGraphOP core::scoring::TwelveANeighborGraph::clone ( ) const [virtual]
void core::scoring::TwelveANeighborGraph::conditionally_add_edge ( Size  lower_node_id,
Size  upper_node_id,
DistanceSquared  dsq 
) [virtual]
Size core::scoring::TwelveANeighborGraph::count_dynamic_memory ( ) const [protected, virtual]
Size core::scoring::TwelveANeighborGraph::count_static_memory ( ) const [protected, virtual]
graph::Edge * core::scoring::TwelveANeighborGraph::create_new_edge ( graph::Edge const *  example_edge) [protected, virtual]

factory method for edge copy-construction. Derived class should downcast the example_edge pointer and may read that edge's data.

Reimplemented from core::graph::Graph.

References core::graph::Edge::get_first_node_ind(), and core::graph::Edge::get_second_node_ind().

graph::Edge * core::scoring::TwelveANeighborGraph::create_new_edge ( Size  index1,
Size  index2 
) [protected, virtual]

factory method for edge creation, defined by derived graph classes, called by the base class

factory method for edge creation Should be overriden in derived classes

Reimplemented from core::graph::Graph.

graph::Node * core::scoring::TwelveANeighborGraph::create_new_node ( Size  node_index) [protected, virtual]

factory method for node creation, defined by derived graph classes, called by the base class

factory method for node creation Should be overriden in derived classes

Reimplemented from core::graph::Graph.

void core::scoring::TwelveANeighborGraph::delete_edge ( graph::Edge edge) [virtual]

remove an edge from the graph. (NEW AS OF 12/9/07) Never call C++'s "delete" function on an edge pointer directly. Derived classes must implement this function. If they wish to use unordered_object_pools to manage their memory

Reimplemented from core::graph::Graph.

Distance core::scoring::TwelveANeighborGraph::neighbor_cutoff ( ) const [virtual]
TwelveANeighborGraph & core::scoring::TwelveANeighborGraph::operator= ( TwelveANeighborGraph const &  source)
void core::scoring::TwelveANeighborGraph::update_from_pose ( pose::Pose const &  pose) [virtual]

The documentation for this class was generated from the following files:
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines