#include <shape/ssi_def.hpp>
#include <shape/ssi_qsegment.hpp>
#include <list>
#include <queue>
#include <shape/ssi_ordered_pair.hpp>
Go to the source code of this file.
Classes
Namespaces
Defines
Typedefs
- typedef std::list< point2 > list2_t
- typedef std::list< point3 > list3_t
- typedef list2_t::iterator p2ref_t
- typedef std::priority_queue
< assoc_t< pdpoint_t >
, std::vector< assoc_t
< pdpoint_t > >, assoc_t
< pdpoint_t >::dist_cmp > pheap_t
- typedef std::priority_queue
< assoc_t< sdpoint_t >
, std::vector< assoc_t
< sdpoint_t > >, assoc_t
< sdpoint_t >::dist_cmp > sheap_t
- typedef std::set< assoc_t
< pdpoint_t >, assoc_t
< pdpoint_t >::pair_cmp > pset_t
- typedef assoc_t< sdpoint_t > sdassc_t
- typedef assoc_t< pdpoint_t > pdassc_t
- typedef std::pair< pdpoint_t
*, pdpoint_t * > ppair_t
- typedef std::list< ppair_t > links_t
- typedef std::map< dcurve
*, links_t > curves_links_t
- typedef ordered_pair< dcurve * > cpair_t
- typedef pset_t::iterator pset_iterator
Functions
- template<class DP > double distance (DP *pa, DP *pb)
- void append (dcurve *a, dcurve *b)
- void prepend (dcurve *a, dcurve *b)
- void reverse (dcurve *c)
- bool empty (dcurve *c)
- pdpoint_t * sibble (pdpoint_t *p)
- void extremums (sdpoint_t *dst, dcurve *src)
- void extremums (pdpoint_t *dst, dcurve *c)
- dcurve * curve (pdpoint_t *p)
- dcurve * curve (sdpoint_t *p)
- bool isfirst (sdpoint_t *p)
- bool islast (sdpoint_t *p)
- bool isfirst (pdpoint_t *p)
- bool islast (pdpoint_t *p)
- bool isextrem (pdpoint_t *p)
- bool isextrem (sdpoint_t *p)
- void link (sdpoint_t *a, sdpoint_t *b)
- void link (pdpoint_t *a, pdpoint_t *b)
- void swap (dcurve *c)
- bool isright (pdpoint_t *p)
- template<class DPoint > void _link (DPoint *a, DPoint *b)
- sdknode * make (sdpoint_t *first, sdpoint_t *last, const dim_cmp< sdpoint_t > &f)
- pdknode * make (pdpoint_t **first, pdpoint_t **last, const dim_cmp< pdpoint_t > &f)
- void solve_sheap (sheap_t &h)
- void solve_pheap (pheap_t &h)
- template<class A , class B > void container_add (A &h, const B &a)
- void container_add (pset_t &s, const pdassc_t &a)
- cpair_t curves (const pdassc_t &ass)
- pdassc_t sibbles (const pdassc_t &ass)
- void satisfy_links (curves_links_t::iterator it)
- void solve_pset (curves_links_t &links, pset_t &s)
- std::list< dcurve * > * reduce2 (std::vector< dcurve * > *conflicts)
Define Documentation
| #define ParametricSurface shape::surface_parametric<double> |
| #define SYANSP_SHAPE_GAIA_DSEARCH_H |
