Bedge_list Member List

This is the complete list of members for Bedge_list, including all inherited members.

_array	ARRAY< Bedge * >	[protected]
_do_index	ARRAY< Bedge * >	[protected]
_max	ARRAY< Bedge * >	[protected]
_num	ARRAY< Bedge * >	[protected]
_unique	ARRAY< Bedge * >	[protected]
add(const Bedge *&p)	ARRAY< Bedge * >	[inline]
add_uniquely(const Bedge *&el)	ARRAY< Bedge * >	[inline]
all_satisfy(CSimplexFilter &f) const	SimplexArray< Bedge_list, Bedge * >	[inline]
any_satisfy(CSimplexFilter &f) const	SimplexArray< Bedge_list, Bedge * >	[inline]
append(const Bedge_list &list)	SimplexArray< Bedge_list, Bedge * >	[inline]
append_ele(const Bedge *&s)	SimplexArray< Bedge_list, Bedge * >	[inline, protected, virtual]
array()	ARRAY< Bedge * >	[inline]
ARRAY(int m=0)	ARRAY< Bedge * >	[inline]
ARRAY(CARRAY< Bedge * > &l)	ARRAY< Bedge * >	[inline]
avg_len() const	Bedge_list	[inline]
Bedge_list(CARRAY< Bedge * > &list)	Bedge_list	[inline]
Bedge_list(int n=0)	Bedge_list	[inline, explicit]
Bedge_list(Bedge *e)	Bedge_list	[inline, explicit]
begin_index()	ARRAY< Bedge * >	[inline]
clear()	ARRAY< Bedge * >	[inline, virtual]
clear_bits(uint b) const	SimplexArray< Bedge_list, Bedge * >	[inline]
clear_ele(int)	ARRAY< Bedge * >	[inline, protected, virtual]
clear_flag02() const	Bedge_list	[inline]
clear_flags() const	SimplexArray< Bedge_list, Bedge * >	[inline]
clear_index(const Bedge *&el) const	SimplexArray< Bedge_list, Bedge * >	[inline, protected, virtual]
clear_range(int i, int j)	ARRAY< Bedge * >	[inline, protected, virtual]
clear_vert_flags() const	Bedge_list	[protected]
contains(const Bedge *&el) const	ARRAY< Bedge * >	[inline]
contains_all(const Bedge_list &list) const	SimplexArray< Bedge_list, Bedge * >	[inline]
contains_any(const Bedge_list &list) const	SimplexArray< Bedge_list, Bedge * >	[inline]
dec_crease_vals(ushort max_val=USHRT_MAX) const	Bedge_list	[inline]
delete_all()	SimplexArray< Bedge_list, Bedge * >	[inline]
empty() const	ARRAY< Bedge * >	[inline]
end_index()	ARRAY< Bedge * >	[inline]
extract(int start, int n) const	ARRAY< Bedge * >	[inline]
filter(CSimplexFilter &f) const	SimplexArray< Bedge_list, Bedge * >	[inline]
first() const	ARRAY< Bedge * >	[inline]
first_satisfies(CSimplexFilter &f) const	SimplexArray< Bedge_list, Bedge * >	[inline]
fold_verts() const	Bedge_list
get_faces() const	Bedge_list
get_index(const Bedge *&s) const	SimplexArray< Bedge_list, Bedge * >	[inline, virtual]
get_meshes() const	SimplexArray< Bedge_list, Bedge * >	[inline]
get_primary_faces() const	Bedge_list	[inline]
get_verts() const	Bedge_list
has_duplicates() const	SimplexArray< Bedge_list, Bedge * >	[inline]
inc_crease_vals(ushort max_val=USHRT_MAX) const	Bedge_list	[inline]
inc_flags(uchar b=1) const	SimplexArray< Bedge_list, Bedge * >	[inline]
insert(int ind, int num)	ARRAY< Bedge * >	[inline]
intersect(const Bedge_list &list) const	SimplexArray< Bedge_list, Bedge * >	[inline]
is_indexing() const	ARRAY< Bedge * >	[inline]
is_primary() const	Bedge_list	[inline]
is_secondary() const	Bedge_list	[inline]
is_simple() const	Bedge_list
last() const	ARRAY< Bedge * >	[inline]
lookup_data(const Bedge *&s) const	SimplexArray< Bedge_list, Bedge * >	[inline, protected]
mark_edges() const	Bedge_list	[protected]
mesh() const	SimplexArray< Bedge_list, Bedge * >	[inline]
min_edge_len() const	Bedge_list	[inline]
minus(const Bedge_list &list) const	SimplexArray< Bedge_list, Bedge * >	[inline]
nfaces_is_equal(int num_faces) const	Bedge_list	[inline]
num() const	ARRAY< Bedge * >	[inline]
num_satisfy(CSimplexFilter &f) const	SimplexArray< Bedge_list, Bedge * >	[inline]
operator+(const Bedge_list &list) const	SimplexArray< Bedge_list, Bedge * >	[inline]
operator+=(const Bedge *&el)	ARRAY< Bedge * >	[inline]
operator+=(CARRAY< Bedge * > &b)	ARRAY< Bedge * >	[inline]
operator-=(const Bedge *&el)	ARRAY< Bedge * >	[inline]
operator-=(CARRAY< Bedge * > &l)	ARRAY< Bedge * >	[inline]
operator=(CARRAY< Bedge * > &b)	ARRAY< Bedge * >	[inline]
operator[](int j) const	ARRAY< Bedge * >	[inline]
pop()	ARRAY< Bedge * >	[inline]
primary_edges() const	Bedge_list	[inline]
pull_element(const Bedge *&p)	ARRAY< Bedge * >	[inline]
pull_index(int k)	ARRAY< Bedge * >	[inline]
push(const Bedge *&p)	ARRAY< Bedge * >	[inline]
put_data(const Bedge *&s) const	SimplexArray< Bedge_list, Bedge * >	[inline, protected]
realloc(int new_max=0)	ARRAY< Bedge * >	[inline, virtual]
rem(const Bedge *&p)	ARRAY< Bedge * >	[inline]
remove(int k)	ARRAY< Bedge * >	[inline]
reverse()	ARRAY< Bedge * >	[inline, virtual]
same_elements(const Bedge_list &list) const	SimplexArray< Bedge_list, Bedge * >	[inline]
same_mesh() const	SimplexArray< Bedge_list, Bedge * >	[inline]
secondary_edges() const	Bedge_list	[inline]
selected_elements()	SimplexArray< Bedge_list, Bedge * >	[inline]
set_bits(uint b, int x=1) const	SimplexArray< Bedge_list, Bedge * >	[inline]
set_flags(uchar b=1) const	SimplexArray< Bedge_list, Bedge * >	[inline]
set_index(const Bedge *&el, int i) const	SimplexArray< Bedge_list, Bedge * >	[inline, protected, virtual]
set_unique()	ARRAY< Bedge * >	[inline]
shift(int p)	ARRAY< Bedge * >	[inline, virtual]
SimplexArray(const ARRAY< Bedge * > &list)	SimplexArray< Bedge_list, Bedge * >	[inline]
SimplexArray(int n=0)	SimplexArray< Bedge_list, Bedge * >	[inline, explicit]
SimplexArray(Bedge *s)	SimplexArray< Bedge_list, Bedge * >	[inline, explicit]
sort(compare_func_t compare)	ARRAY< Bedge * >	[inline, virtual]
strong_edges() const	Bedge_list	[inline]
total_length() const	Bedge_list	[inline]
truncate(int n)	ARRAY< Bedge * >	[inline, virtual]
union_no_duplicates(const Bedge_list &list) const	SimplexArray< Bedge_list, Bedge * >	[inline]
unique_elements() const	SimplexArray< Bedge_list, Bedge * >	[inline]
unselected_elements()	SimplexArray< Bedge_list, Bedge * >	[inline]
valid_index(int k) const	ARRAY< Bedge * >	[inline]
weak_edges() const	Bedge_list	[inline]
~ARRAY()	ARRAY< Bedge * >	[inline, virtual]
~SimplexArray()	SimplexArray< Bedge_list, Bedge * >	[inline, virtual]

---