
#include <string>#include <GDT/gdtarray.h>#include <GDT/gdtlist.h>#include <GDT/gdtmap.h>


Go to the source code of this file.
Definition in file rm3_global.h.
| #define gdt_maximum | ( | a, | |||
| b | ) | ((a)>(b) ? (a) : (b)) |
| #define gdt_minimum | ( | a, | |||
| b | ) | ((a)>(b) ? (b) : (a)) |
Definition at line 68 of file rm3_global.h.
| #define GDT_NONSTANDARD_DECL |
Definition at line 50 of file rm3_global.h.
| #define GDT_NONSTANDARD_DECL_FUNCTION |
Definition at line 51 of file rm3_global.h.
| #define ROOT_INCL_ID 34010 |
Definition at line 21 of file rm3_global.h.
| #define safe_delete | ( | a | ) | {delete(a); a = NULL;} |
Definition at line 71 of file rm3_global.h.
| typedef struct_gdtedge* gdtedge |
Definition at line 259 of file rm3_global.h.
| typedef struct_gdtnode* gdtnode |
Definition at line 256 of file rm3_global.h.
| enum algorithm_type |
Definition at line 80 of file rm3_global.h.
| enum angle_type |
| enum marker_type |
Definition at line 169 of file rm3_global.h.
| bool check_date | ( | ) |
| GDT_NONSTANDARD_DECL_FUNCTION gdt::gdtarray< gdt::gdtlist<int> > find_all_permutations | ( | int | n | ) |
| std::string gdt_itoa | ( | int | n | ) |
Referenced by gdt::PQ_tree< T >::PQ_tree_into_undi_graph().

| std::ostream& operator<< | ( | std::ostream & | out, | |
| const marker_type | x | |||
| ) | [inline] |
Definition at line 246 of file rm3_global.h.
| std::istream& operator>> | ( | std::istream & | in, | |
| marker_type & | x | |||
| ) | [inline] |
Definition at line 248 of file rm3_global.h.
| std::string replace_all | ( | std::string | s, | |
| std::string | s1, | |||
| std::string | s2 | |||
| ) |
| const int BOUND_ON_NODES |
Referenced by _solution::_solution().
1.5.3