MADNESS  0.10.1
Classes | Public Types | Public Member Functions | Public Attributes | List of all members
Node Struct Reference
Collaboration diagram for Node:
Collaboration graph
[legend]

Classes

struct  do_random_insert
 

Public Types

typedef WorldContainer< Key, NodedcT
 
typedef WorldContainer< Key, NodedcT
 

Public Member Functions

 Node ()
 
 Node ()
 
 Node ()
 
 Node (const Node &node)
 
 Node (const Node &node)
 
 Node (double value)
 
 Node (double value)
 
 Node (int k)
 
 ~Node ()
 
double do_sum (vector< Future< double > > v)
 
Future< double > do_sum_spawn (const dcT &d, const Key &key)
 
int get () const
 
double get () const
 
double get () const
 
bool is_leaf () const
 
bool is_leaf () const
 
void random_insert (const dcT &constd, const Key &key, double valin)
 
void random_insert (const dcT &constd, const Key &keyin, double valin)
 
void recursive_print (const dcT &d, const Key &key) const
 
template<class Archive >
void serialize (Archive &ar)
 
template<class Archive >
void serialize (Archive &ar)
 
template<typename Archive >
void serialize (const Archive &ar)
 
void set (double v)
 
void set (double v)
 

Public Attributes

bool isleaf
 
int k
 
Key key
 
double value
 

Member Typedef Documentation

◆ dcT [1/2]

◆ dcT [2/2]

Constructor & Destructor Documentation

◆ Node() [1/8]

Node::Node ( )
inline

◆ Node() [2/8]

Node::Node ( int  k)
inline

◆ ~Node()

Node::~Node ( )
inline

◆ Node() [3/8]

Node::Node ( )
inline

◆ Node() [4/8]

Node::Node ( double  value)
inline

◆ Node() [5/8]

Node::Node ( const Node node)
inline

◆ Node() [6/8]

Node::Node ( )
inline

◆ Node() [7/8]

Node::Node ( double  value)
inline

◆ Node() [8/8]

Node::Node ( const Node node)
inline

Member Function Documentation

◆ do_sum()

double Node::do_sum ( vector< Future< double > >  v)
inline

References madness::sum(), and v.

Referenced by do_sum_spawn().

◆ do_sum_spawn()

Future<double> Node::do_sum_spawn ( const dcT d,
const Key key 
)
inline

References d(), do_sum(), and v.

Referenced by doit().

◆ get() [1/3]

int Node::get ( ) const
inline

References k.

Referenced by operator<<().

◆ get() [2/3]

double Node::get ( ) const
inline

◆ get() [3/3]

double Node::get ( ) const
inline

◆ is_leaf() [1/2]

bool Node::is_leaf ( ) const
inline

Referenced by operator<<(), walker1(), and walker2().

◆ is_leaf() [2/2]

bool Node::is_leaf ( ) const
inline

◆ random_insert() [1/2]

void Node::random_insert ( const dcT constd,
const Key key,
double  valin 
)
inline

◆ random_insert() [2/2]

void Node::random_insert ( const dcT constd,
const Key keyin,
double  valin 
)
inline

◆ recursive_print()

void Node::recursive_print ( const dcT d,
const Key key 
) const
inline

References d(), and madness::Key< NDIM >::n.

Referenced by doit().

◆ serialize() [1/3]

template<class Archive >
void Node::serialize ( Archive &  ar)
inline

◆ serialize() [2/3]

template<class Archive >
void Node::serialize ( Archive &  ar)
inline

◆ serialize() [3/3]

template<typename Archive >
void Node::serialize ( const Archive &  ar)
inline

References k.

◆ set() [1/2]

void Node::set ( double  v)
inline

References v.

Referenced by walker1(), and walker2().

◆ set() [2/2]

void Node::set ( double  v)
inline

References v.

Member Data Documentation

◆ isleaf

bool Node::isleaf

◆ k

int Node::k

Referenced by operator<<().

◆ key

Key Node::key

◆ value

double Node::value

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