title
Graph Drawing Toolkit

An object-oriented C++ library for handling and drawing graphs

gdt Namespace Reference


Classes

class  EDGE_OP
class  NODE_OP
class  gdt_graph_array
class  gdtnode_array
class  gdtedge_array
class  gdtnode_map
class  gdtedge_map
class  gdtarray
struct  stdless
class  gdtbinary_heap2
class  gdtpoint
class  gdtsegment
class  gdtline
class  gdtpolygon
class  gdtcircle
class  Record
class  gdtlist
class  gdtmap
class  gdtnode_matrix
class  gdtnode_pq
struct  LessToGreater
class  gdtp_queue
class  gdtqueue
class  gdtstack
class  PQ_node_struct
class  PQ_tree
class  PQ_node_struct_freezed
class  PQ_tree_freezed

Typedefs

typedef list_item heap_item
typedef ::list_item list_item
typedef heap_item pq_item
typedef void * Ptr

Enumerations

enum  { after = AFTER, before = BEFORE }

Functions

std::ostream & operator<< (std::ostream &os, const gdtpoint &p)
std::istream & operator>> (std::istream &is, gdtpoint &p)
bool operator!= (const gdt::gdtpoint &p1, const gdt::gdtpoint &p2)
bool operator== (const gdt::gdtpoint &p1, const gdt::gdtpoint &p2)
std::ostream & operator<< (std::ostream &os, const gdtsegment &s)
template<class T>
void Swap (T &x, T &y)
int Hash (void *p)
int Hash (int p)
int gdtceil (double f)
template<class T>
Ptr ptr_copy (T x)
template<class T>
T & ptr_access (T *, Ptr &p)
template<class T>
void ptr_default_init (T *, Ptr &p)
template<class T>
const T & ptr_const_access (T *, const Ptr &p)
template<class T>
void ptr_delete (T *, Ptr p)


Typedef Documentation

typedef list_item gdt::heap_item

Definition at line 24 of file gdtbinary_heap2.h.

typedef ::list_item gdt::list_item

Definition at line 30 of file gdtlist.h.

typedef heap_item gdt::pq_item

Definition at line 10 of file gdtp_queue.h.

typedef void* gdt::Ptr

Definition at line 16 of file ptr.h.


Enumeration Type Documentation

anonymous enum

Enumerator:
after 
before 

Definition at line 28 of file gdtlist.h.


Function Documentation

int gdt::gdtceil ( double  f  ) 

Referenced by gdt::gdtmap< Key, Value >::init_table().

Here is the caller graph for this function:

int gdt::Hash ( int  p  )  [inline]

Definition at line 34 of file gdtmap.h.

int gdt::Hash ( void *  p  )  [inline]

Definition at line 29 of file gdtmap.h.

References HASH_POINTER_SHIFT.

bool gdt::operator!= ( const gdt::gdtpoint p1,
const gdt::gdtpoint p2 
)

std::ostream& gdt::operator<< ( std::ostream &  os,
const gdtsegment &  s 
)

std::ostream& gdt::operator<< ( std::ostream &  os,
const gdtpoint &  p 
)

bool gdt::operator== ( const gdt::gdtpoint p1,
const gdt::gdtpoint p2 
)

std::istream& gdt::operator>> ( std::istream &  is,
gdtpoint &  p 
)

template<class T>
T& gdt::ptr_access ( T *  ,
Ptr &  p 
) [inline]

Definition at line 43 of file ptr.h.

template<class T>
const T& gdt::ptr_const_access ( T *  ,
const Ptr &  p 
) [inline]

Definition at line 63 of file ptr.h.

template<class T>
Ptr gdt::ptr_copy ( x  )  [inline]

Definition at line 30 of file ptr.h.

References COPY_INTO_PTR.

Referenced by gdt::gdtbinary_heap2< P, struct_gdtnode, gdt::LessToGreater< P, gdt::stdless< P > > >::insert().

Here is the caller graph for this function:

template<class T>
void gdt::ptr_default_init ( T *  ,
Ptr &  p 
) [inline]

Definition at line 55 of file ptr.h.

template<class T>
void gdt::ptr_delete ( T *  ,
Ptr  p 
) [inline]

Definition at line 75 of file ptr.h.

template<class T>
void gdt::Swap ( T &  x,
T &  y 
) [inline]

Definition at line 22 of file gdtlist.h.

Referenced by gdt::gdtlist< E >::reverse_items().

Here is the caller graph for this function:


Generated on Thu Jan 10 14:49:38 2008 for GDToolkit GAPI by  doxygen 1.5.3