#include <gugr_planesweep.h>
Public Methods | |
intersection (const point2< rational > &a) | |
~intersection () | |
void * | operator new (size_t s) |
void | operator delete (void *p, size_t s) |
Public Attributes | |
point2< rational > | I |
List< ListNode< segment *> > | S |
gugr::graph_vertex * | v |
intersection * | next |
intersection * | prev |
|
Definition at line 87 of file gugr_planesweep.h. References I. Referenced by operator delete().
|
|
Definition at line 88 of file gugr_planesweep.h. References S.
00088 { S.DeleteElems(); } |
|
Definition at line 100 of file gugr_planesweep.h. References intersection(), and gust::PoolFree().
00101 { 00102 if( p != 0 ) PoolFree( p, s ); 00103 } |
|
Definition at line 93 of file gugr_planesweep.h. References gust::PoolAlloc().
00094 { 00095 size_t dummy; 00096 void *p = PoolAlloc( s, &dummy ); 00097 if( p == NULL ) throw PoolAllocError(); 00098 return(p); 00099 } |
|
Definition at line 83 of file gugr_planesweep.h. Referenced by intersection(). |
|
Definition at line 90 of file gugr_planesweep.h. |
|
Definition at line 91 of file gugr_planesweep.h. |
|
Definition at line 84 of file gugr_planesweep.h. Referenced by ~intersection(). |
|
Definition at line 85 of file gugr_planesweep.h. |