| _array | ARRAY< P > | [protected] |
| _length | _point2d_list< L, P, V > | [protected] |
| _max | ARRAY< P > | [protected] |
| _num | ARRAY< P > | [protected] |
| _partial_length | _point2d_list< L, P, V > | [protected] |
| _point2d_list(int m=16) | _point2d_list< L, P, V > | [inline] |
| _point2d_list(const ARRAY< P > &p) | _point2d_list< L, P, V > | [inline] |
| _unique | ARRAY< P > | [protected] |
| add(const P &p) | ARRAY< P > | [inline] |
| add_uniquely(const P &el) | ARRAY< P > | [inline] |
| append(TPLIST *poly) | _point2d_list< L, P, V > | |
| append_ele(const P &el) | ARRAY< P > | [inline, protected] |
| array() const | ARRAY< P > | [inline] |
| array() | ARRAY< P > | [inline] |
| ARRAY(int m=0) | ARRAY< P > | [inline] |
| ARRAY(cARRAY< P > &l) | ARRAY< P > | [inline] |
| ARRAY(const P &e) | ARRAY< P > | [inline] |
| average() const | _point2d_list< L, P, V > | |
| avg_dist_to_seg(const P &p, int k) const | _point2d_list< L, P, V > | |
| clear() | ARRAY< P > | [inline] |
| clear_ele(int) | ARRAY< P > | [inline, protected, virtual] |
| clear_range(int, int) | ARRAY< P > | [inline, protected, virtual] |
| clone_piece(int k1, int k2) const | _point2d_list< L, P, V > | |
| closest(const P &p, P &, Greal &, int &) const | _point2d_list< L, P, V > | |
| closest(const P &p, P &, int &) const | _point2d_list< L, P, V > | |
| closest(const P &p) const | _point2d_list< L, P, V > | |
| contains(const TPLIST &list) const | _point2d_list< L, P, V > | |
| contains(const P &p) const | _point2d_list< L, P, V > | |
| dist_to_seg(const P &p, int k) const | _point2d_list< L, P, V > | |
| empty() const | ARRAY< P > | [inline] |
| get_index(const P &el) const | ARRAY< P > | [inline] |
| get_tangent(Greal s) const | _point2d_list< L, P, V > | |
| insert(int ind, int num) | ARRAY< P > | [inline] |
| interpolate(Greal s, V *tan=0, int *segp=0, Greal *tp=0) const | _point2d_list< L, P, V > | |
| interpolate_length(Greal s, int &seg, Greal &t) const | _point2d_list< L, P, V > | |
| invert(const P &p) const | _point2d_list< L, P, V > | |
| invert(const P &p, int seg) const | _point2d_list< L, P, V > | |
| last() | ARRAY< P > | [inline] |
| last() const | ARRAY< P > | [inline] |
| length() const | _point2d_list< L, P, V > | [inline] |
| nearest_point(const P &p) const | _point2d_list< L, P, V > | |
| num() const | ARRAY< P > | [inline] |
| operator+=(const P &el) | ARRAY< P > | [inline] |
| operator+=(cARRAY< P > &l) | ARRAY< P > | [inline] |
| operator-=(cARRAY< P > &l) | ARRAY< P > | [inline] |
| operator-=(const P &el) | ARRAY< P > | [inline] |
| operator=(cARRAY< P > &l) | ARRAY< P > | [inline] |
| operator==(const ARRAY< P > &c) const | ARRAY< P > | [inline] |
| operator[](int j) | ARRAY< P > | [inline] |
| operator[](int j) const | ARRAY< P > | [inline] |
| partial_length(int i) const | _point2d_list< L, P, V > | [inline] |
| pop() | ARRAY< P > | [inline] |
| prepend(TPLIST *poly) | _point2d_list< L, P, V > | |
| push(const P &p) | ARRAY< P > | [inline] |
| ray_intersect(const P &p, const V &d, P &hit, int loop=0) const | _point2d_list< L, P, V > | |
| ray_intersect(const P &p, const V &d, int k0, int k1) const | _point2d_list< L, P, V > | |
| realloc(int new_max=0) | ARRAY< P > | [inline, virtual] |
| rem(const P &p) | ARRAY< P > | [inline] |
| remove(int k) | ARRAY< P > | [inline] |
| reverse() | ARRAY< P > | [inline] |
| segment_length(int i) const | _point2d_list< L, P, V > | [inline] |
| set_unique() | ARRAY< P > | [inline] |
| sort(compare_func_t compare) | ARRAY< P > | [inline, virtual] |
| truncate(int n) | ARRAY< P > | [inline, virtual] |
| update_length() | _point2d_list< L, P, V > | |
| valid_index(int k) const | ARRAY< P > | [inline] |
| ~ARRAY() | ARRAY< P > | [inline, virtual] |
