Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | Directories | File List | Namespace Members | Class Members | File Members | Related Pages

mlib::UVpt_list Member List

This is the complete list of members for mlib::UVpt_list, including all inherited members.

_arrayARRAY< P > [protected]
_do_indexARRAY< P > [protected]
_maxARRAY< P > [protected]
_numARRAY< P > [protected]
_partial_lengthmlib::Pointlist< L, P, V, S > [protected]
_uniqueARRAY< P > [protected]
add(const P &p)ARRAY< P > [inline]
add_uniquely(const P &el)ARRAY< P > [inline]
append(Pointlist< L, P, V, S > *poly)mlib::Pointlist< L, P, V, S >
append_ele(const P &el)ARRAY< P > [inline, protected, virtual]
ARRAY(int m=0)ARRAY< P > [inline]
ARRAY(CARRAY< P > &l)ARRAY< P > [inline]
array()ARRAY< P > [inline]
average() const mlib::Pointlist< L, P, V, S > [inline]
avg_dist_to_seg(const P &p, int k) const mlib::Pointlist< L, P, V, S >
avg_len() const mlib::Pointlist< L, P, V, S > [inline]
begin_index()ARRAY< P > [inline]
clear()mlib::Pointlist< L, P, V, S > [inline, virtual]
clear_ele(int)ARRAY< P > [inline, protected, virtual]
clear_index(const P &) const ARRAY< P > [inline, protected, virtual]
clear_range(int i, int j)ARRAY< P > [inline, protected, virtual]
clone_piece(int k1, int k2) const mlib::Pointlist< L, P, V, S >
closest(const P &p, P &, double &, int &) const mlib::Pointlist< L, P, V, S >
closest(const P &p, P &, int &) const mlib::Pointlist< L, P, V, S >
closest(const P &p) const mlib::Pointlist< L, P, V, S >
contains(const Point2list< UVpt_list, UVpt, UVvec, UVline > &list) const mlib::Point2list< UVpt_list, UVpt, UVvec, UVline >
contains(const UVpt &p) const mlib::Point2list< UVpt_list, UVpt, UVvec, UVline >
mlib::Pointlist::contains(const P &el) const ARRAY< P > [inline]
dist(const P &p) const mlib::Pointlist< L, P, V, S > [inline]
dist_to_seg(const P &p, int k) const mlib::Pointlist< L, P, V, S >
empty() const ARRAY< P > [inline]
end_index()ARRAY< P > [inline]
extract(int start, int n) const ARRAY< P > [inline]
first() const ARRAY< P > [inline]
fix_endpoints(UVpta, UVptb)mlib::Point2list< UVpt_list, UVpt, UVvec, UVline >
get_index(const P &el) const ARRAY< P > [inline, virtual]
get_tangent(double s) const mlib::Pointlist< L, P, V, S >
insert(int ind, int num)ARRAY< P > [inline]
interpolate(double s, V *tan=0, int *segp=0, double *tp=0) const mlib::Pointlist< L, P, V, S >
interpolate_length(double s, int &seg, double &t) const mlib::Pointlist< L, P, V, S >
intersects_line(const UVline &line) const mlib::Point2list< UVpt_list, UVpt, UVvec, UVline >
intersects_seg(const UVline &segment) const mlib::Point2list< UVpt_list, UVpt, UVvec, UVline >
invert(const P &p) const mlib::Pointlist< L, P, V, S >
invert(const P &p, int seg) const mlib::Pointlist< L, P, V, S >
is_closed() const mlib::Pointlist< L, P, V, S > [inline]
is_indexing() const ARRAY< P > [inline]
is_straight(double len_scale=1e-5) const mlib::Pointlist< L, P, V, S >
last() const ARRAY< P > [inline]
length() const mlib::Pointlist< L, P, V, S > [inline]
max_val(int i) const mlib::Pointlist< L, P, V, S >
min_val(int i) const mlib::Pointlist< L, P, V, S >
nearest_point(const P &p) const mlib::Pointlist< L, P, V, S >
num() const ARRAY< P > [inline]
operator+=(const P &el)ARRAY< P > [inline]
operator+=(CARRAY< P > &b)ARRAY< P > [inline]
operator-=(const P &el)ARRAY< P > [inline]
operator-=(CARRAY< P > &l)ARRAY< P > [inline]
operator=(CARRAY< P > &b)ARRAY< P > [inline]
operator[](int j) const ARRAY< P > [inline]
partial_length(int i) const mlib::Pointlist< L, P, V, S > [inline]
Point2list(int m=16)mlib::Point2list< UVpt_list, UVpt, UVvec, UVline > [inline]
Point2list(const ARRAY< UVpt > &p)mlib::Point2list< UVpt_list, UVpt, UVvec, UVline > [inline]
Pointlist(int m=16)mlib::Pointlist< L, P, V, S > [inline]
Pointlist(const ARRAY< P > &p)mlib::Pointlist< L, P, V, S > [inline]
pop()ARRAY< P > [inline]
prepend(Pointlist< L, P, V, S > *poly)mlib::Pointlist< L, P, V, S >
pt(int i) const mlib::Pointlist< L, P, V, S > [inline]
pull_element(const P &p)ARRAY< P > [inline]
pull_index(int k)ARRAY< P > [inline]
push(const P &p)ARRAY< P > [inline]
ray_intersect(const UVpt &p, const UVvec &d, UVpt &hit, int loop=0) const mlib::Point2list< UVpt_list, UVpt, UVvec, UVline >
ray_intersect(const UVpt &p, const UVvec &d, UVpt_list &hit, int loop=0) const mlib::Point2list< UVpt_list, UVpt, UVvec, UVline >
ray_intersect(const UVpt &p, const UVvec &d, int k0, int k1) const mlib::Point2list< UVpt_list, UVpt, UVvec, UVline >
realloc(int new_max=0)ARRAY< P > [inline, virtual]
rem(const P &p)ARRAY< P > [inline]
remove(int k)ARRAY< P > [inline]
resample(int num_segs)mlib::Pointlist< L, P, V, S >
reverse()ARRAY< P > [inline, virtual]
seg(int i) const mlib::Pointlist< L, P, V, S > [inline]
segment_length(int i) const mlib::Pointlist< L, P, V, S > [inline]
self_intersects() const mlib::Pointlist< L, P, V, S >
set_index(const P &, int) const ARRAY< P > [inline, protected, virtual]
set_unique()ARRAY< P > [inline]
shift(int p)mlib::Pointlist< L, P, V, S > [inline, virtual]
sort(compare_func_t compare)ARRAY< P > [inline, virtual]
spread() const mlib::Pointlist< L, P, V, S >
sum() const mlib::Pointlist< L, P, V, S >
tan(int i) const mlib::Pointlist< L, P, V, S > [inline]
translate(const V &vec)mlib::Pointlist< L, P, V, S > [inline]
truncate(int n)ARRAY< P > [inline, virtual]
update_length()mlib::Pointlist< L, P, V, S >
UVpt_list(int m=0)mlib::UVpt_list [inline]
UVpt_list(const Point2list< UVpt_list, UVpt, UVvec, UVline > &p)mlib::UVpt_list [inline]
valid_index(int k) const ARRAY< P > [inline]
vec(int i) const mlib::Pointlist< L, P, V, S > [inline]
winding_number(const UVpt &) const mlib::Point2list< UVpt_list, UVpt, UVvec, UVline >
~ARRAY()ARRAY< P > [inline, virtual]


Generated on Mon Sep 18 11:48:24 2006 for jot by  doxygen 1.4.4