#include <assert.h>
#include <iostream>
Go to the source code of this file.
Namespaces | |
namespace | gdt |
Classes | |
class | gdt::Record< F > |
class | gdt::gdtlist< E > |
Defines | |
#define | UNKNOWN_COUNTER -1 |
#define | __DLINKP (dlink*) |
#define | AFTER 0 |
#define | BEFORE 1 |
#define | forall_items(it, S) for(it=(S).first(); it; it=(S).succ(it)) |
#define | __FORALL_PREAMBLE if (0); else |
#define | LOOP_VAR(y) loop_var |
#define | LOOP_VAR1(y) loop_var1 |
#define | LOOP_ITEM(p) (typename T::item)p |
#define | forall(x, S) |
Typedefs | |
typedef void * | list_item |
typedef ::list_item | gdt::list_item |
Enumerations | |
enum | { gdt::after = AFTER, gdt::before = BEFORE } |
Functions | |
template<class T> | |
void | gdt::Swap (T &x, T &y) |
template<class OS, class E> | |
OS & | operator<< (OS &os, const gdt::gdtlist< E > &l) |
template<class IS, class E> | |
IS & | operator>> (IS &is, gdt::gdtlist< E > &l) |
template<class T> | |
bool | LoopSucc (const T &S, void *&p) |
template<class T> | |
bool | LoopPred (const T &S, void *&p) |
template<class T, class var_type> | |
void | LoopInf (const T &S, var_type &x, void *p) |
template<class T, class var_type> | |
void | LoopKey (const T &S, var_type &x, void *p) |
Definition in file gdtlist.h.
#define forall | ( | x, | |||
S | ) |
Value:
__FORALL_PREAMBLE \ for(void* LOOP_VAR(__LINE__) = (S).first_item();\ LoopInf(S,x,LOOP_VAR(__LINE__)), LoopSucc(S,LOOP_VAR(__LINE__)); )
Definition at line 980 of file gdtlist.h.
Referenced by gdt::PQ_tree< T >::assign_parent_to_draw_graph(), gdt::PQ_tree< T >::bubble(), gdt::PQ_tree< T >::freeze(), gdt::gdt_graph_array< struct_gdtedge *, gdt::EDGE_OP, struct_split_edge_info >::gdt_graph_array(), gdt::PQ_tree< T >::make_empty(), gdt::PQ_tree< T >::operator=(), gdt::PQ_tree< T >::pnode_sorting(), gdt::PQ_tree< T >::PQ_tree(), gdt::PQ_tree< T >::PQ_tree_into_undi_graph(), gdt::PQ_tree< T >::reduce(), gdt::PQ_tree_freezed< T >::sorted_leaves_list(), gdt::PQ_tree< T >::template_P2(), gdt::PQ_tree< T >::template_P3(), gdt::PQ_tree< T >::template_P4(), gdt::PQ_tree< T >::template_P5(), gdt::PQ_tree< T >::template_P6(), gdt::PQ_tree< T >::template_Q2(), and gdt::PQ_tree_freezed< T >::tree_search().
#define forall_items | ( | it, | |||
S | ) | for(it=(S).first(); it; it=(S).succ(it)) |
Definition at line 930 of file gdtlist.h.
Referenced by gdt::gdtbinary_heap2< P, struct_gdtnode, gdt::LessToGreater< P, gdt::stdless< P > > >::consistent_list(), and gdt::gdtnode_pq< P >::get_nodes().
#define LOOP_ITEM | ( | p | ) | (typename T::item)p |
Definition at line 949 of file gdtlist.h.
Referenced by LoopInf(), LoopKey(), LoopPred(), and LoopSucc().
#define UNKNOWN_COUNTER -1 |
Definition at line 10 of file gdtlist.h.
Referenced by gdt::gdtlist< E >::conc(), gdt::gdtlist< E >::consistency_check(), and gdt::gdtlist< E >::split().
void LoopInf | ( | const T & | S, | |
var_type & | x, | |||
void * | p | |||
) | [inline] |
void LoopKey | ( | const T & | S, | |
var_type & | x, | |||
void * | p | |||
) | [inline] |
bool LoopPred | ( | const T & | S, | |
void *& | p | |||
) | [inline] |
bool LoopSucc | ( | const T & | S, | |
void *& | p | |||
) | [inline] |
OS& operator<< | ( | OS & | os, | |
const gdt::gdtlist< E > & | l | |||
) | [inline] |
IS& operator>> | ( | IS & | is, | |
gdt::gdtlist< E > & | l | |||
) | [inline] |