Generated on Sat Feb 7 2015 02:01:50 for Gecode by doxygen 1.8.9.1
Gecode::Int::ViewValGraph::Node< View > Class Template Reference

Base-class for nodes (both view and value nodes) More...

#include <view-val-graph.hh>

Public Member Functions

 Node (void)
 Initialize. More...
 
Edge< View > * edge_fst (void) const
 Return first edge (organized by bi-links) More...
 
Edge< View > * edge_lst (void) const
 Return last edge (organized by bi-links) More...
 

Static Public Member Functions

static void * operator new (size_t, Space &)
 Allocate memory from space. More...
 
static void operator delete (void *, size_t)
 Needed for exceptions. More...
 
static void operator delete (void *, Space &)
 Needed for exceptions. More...
 

Public Attributes

Edge< View > * iter
 Next edge for computing strongly connected components. More...
 
unsigned int low
 Values for computing strongly connected components. More...
 
unsigned int min
 
unsigned int comp
 

Detailed Description

template<class View>
class Gecode::Int::ViewValGraph::Node< View >

Base-class for nodes (both view and value nodes)

Note: the obvious ill-design to have also nodes and edges parametric wrt View is because the right design (having template function members) gets miscompiled (and actually not even compiled with some C++ compilers). Duh!

Definition at line 120 of file view-val-graph.hh.

Constructor & Destructor Documentation

template<class View >
Gecode::Int::ViewValGraph::Node< View >::Node ( void  )
inline

Initialize.

Definition at line 47 of file node.hpp.

Member Function Documentation

template<class View >
Edge< View > * Gecode::Int::ViewValGraph::Node< View >::edge_fst ( void  ) const
inline

Return first edge (organized by bi-links)

Definition at line 52 of file node.hpp.

template<class View >
Edge< View > * Gecode::Int::ViewValGraph::Node< View >::edge_lst ( void  ) const
inline

Return last edge (organized by bi-links)

Definition at line 57 of file node.hpp.

template<class View >
void * Gecode::Int::ViewValGraph::Node< View >::operator new ( size_t  s,
Space home 
)
inlinestatic

Allocate memory from space.

Definition at line 68 of file node.hpp.

template<class View >
void Gecode::Int::ViewValGraph::Node< View >::operator delete ( void *  ,
size_t   
)
inlinestatic

Needed for exceptions.

Definition at line 62 of file node.hpp.

template<class View >
void Gecode::Int::ViewValGraph::Node< View >::operator delete ( void *  ,
Space  
)
inlinestatic

Needed for exceptions.

Definition at line 65 of file node.hpp.

Member Data Documentation

template<class View>
Edge<View>* Gecode::Int::ViewValGraph::Node< View >::iter

Next edge for computing strongly connected components.

Definition at line 123 of file view-val-graph.hh.

template<class View>
unsigned int Gecode::Int::ViewValGraph::Node< View >::low

Values for computing strongly connected components.

Definition at line 125 of file view-val-graph.hh.

template<class View>
unsigned int Gecode::Int::ViewValGraph::Node< View >::min

Definition at line 125 of file view-val-graph.hh.

template<class View>
unsigned int Gecode::Int::ViewValGraph::Node< View >::comp

Definition at line 125 of file view-val-graph.hh.


The documentation for this class was generated from the following files: