CASM::PolyTrie< T > Member List

This is the complete list of members for CASM::PolyTrie< T >, including all inherited members.

all_in(const Array &superset) const	CASM::Array< PTNode< T > * >	protected
almost_contains(const PTNode< T > * &test_elem, double tol_val=TOL) const	CASM::Array< PTNode< T > * >	inlineprotected
almost_find(const PTNode< T > * &test_elem, double tol_val=TOL) const	CASM::Array< PTNode< T > * >	protected
almost_reverse_find(const PTNode< T > * &test_elem, double tol_val=TOL) const	CASM::Array< PTNode< T > * >	protected
almost_zero(double tol=2 *PTNode< T >::PT_TOL()) const	CASM::PolyTrie< T >
append(const Array &new_tail)	CASM::Array< PTNode< T > * >	protected
append_unique(const Array &new_tail)	CASM::Array< PTNode< T > * >	protected
Array()	CASM::Array< PTNode< T > * >	inlineprotected
Array(Index init_N)	CASM::Array< PTNode< T > * >	inlineprotected
Array(Index init_N, const PTNode< T > * &init_val)	CASM::Array< PTNode< T > * >	inlineprotected
Array(const Array &RHS)	CASM::Array< PTNode< T > * >	inlineprotected
Array(Iterator begin, Iterator end)	CASM::Array< PTNode< T > * >	inlineprotected
Array(std::initializer_list< PTNode< T > * > in)	CASM::Array< PTNode< T > * >	inlineprotected
Array(ReturnArray< PTNode< T > * > &RHS)	CASM::Array< PTNode< T > * >	protected
ARRAY_EXTENSION_FACTOR()	CASM::Array< PTNode< T > * >	inlineprivatestatic
ARRAY_MIN_EXTRA_SPACE()	CASM::Array< PTNode< T > * >	inlineprivatestatic
as_perm_inverse() const	CASM::Array< PTNode< T > * >	protected
as_perm_transform_by(const Array< Index > &trans_perm) const	CASM::Array< PTNode< T > * >	protected
at(const Array< Index > &ind)	CASM::PolyTrie< T >
CASM::PTNode::at(Index ind)	CASM::Array< PTNode< T > * >	inline
CASM::PTNode::at(Index ind) const	CASM::Array< PTNode< T > * >	inline
back()	CASM::Array< PTNode< T > * >	inlineprotected
back() const	CASM::Array< PTNode< T > * >	inlineprotected
begin()	CASM::PolyTrie< T >	inline
begin() const	CASM::PolyTrie< T >	inline
begin_ptr()	CASM::PolyTrie< T >	inline
begin_ptr() const	CASM::PolyTrie< T >	inline
cbegin() const	CASM::Array< PTNode< T > * >	inlineprotected
cend() const	CASM::Array< PTNode< T > * >	inlineprotected
clear()	CASM::PolyTrie< T >
coincidence(const Array &superset) const	CASM::Array< PTNode< T > * >	protected
compare(const PolyTrie< T > &RHS, double tol=2 *PTNode< T >::PT_TOL()) const	CASM::PolyTrie< T >
const_iterator typedef	CASM::PolyTrie< T >
contains(const PTNode< T > * &test_elem) const	CASM::Array< PTNode< T > * >	inlineprotected
depth() const	CASM::PolyTrie< T >	inline
end()	CASM::PolyTrie< T >	inline
end() const	CASM::PolyTrie< T >	inline
find(const PTNode< T > * &test_elem) const	CASM::Array< PTNode< T > * >	protected
get(const Array< Index > &ind) const	CASM::PolyTrie< T >
has_fixed_points() const	CASM::Array< PTNode< T > * >	protected
incidences(const PTNode< T > * &test_elem) const	CASM::Array< PTNode< T > * >	protected
ipermute(const Array< Index > &perm_array)	CASM::Array< PTNode< T > * >	protected
is_ascending() const	CASM::Array< PTNode< T > * >	protected
is_constant() const	CASM::Array< PTNode< T > * >	protected
is_descending() const	CASM::Array< PTNode< T > * >	protected
is_permute() const	CASM::Array< PTNode< T > * >	protected
iterator typedef	CASM::PolyTrie< T >
leaf_type typedef	CASM::PolyTrie< T >
list_leaf(PTLeaf< T > *new_leaf)	CASM::PolyTrie< T >
m_depth	CASM::PolyTrie< T >	private
m_leaf_list	CASM::PolyTrie< T >	private
m_val	CASM::PTNode< T >	protected
max() const	CASM::Array< PTNode< T > * >	protected
min() const	CASM::Array< PTNode< T > * >	protected
N	CASM::Array< PTNode< T > * >	private
next_permute()	CASM::Array< PTNode< T > * >	protected
NMax	CASM::Array< PTNode< T > * >	private
num_nonzero() const	CASM::PolyTrie< T >	private
operator!=(const Array< PTNode< T > * > &RHS) const	CASM::Array< PTNode< T > * >	inlineprotected
operator()(const Array< Index > &ind)	CASM::PolyTrie< T >
operator()(const Array< Index > &ind) const	CASM::PolyTrie< T >
operator*=(const T &scale)	CASM::PolyTrie< T >
operator+(const PolyTrie< T > &RHS) const	CASM::PolyTrie< T >
operator+=(const PolyTrie< T > &RHS)	CASM::PolyTrie< T >
operator-(const PolyTrie< T > &RHS) const	CASM::PolyTrie< T >
operator-=(const PolyTrie< T > &RHS)	CASM::PolyTrie< T >
operator<(const Array< PTNode< T > * > &RHS) const	CASM::Array< PTNode< T > * >	protected
operator<=(const Array< PTNode< T > * > &RHS) const	CASM::Array< PTNode< T > * >	inlineprotected
operator=(const Array &RHS)	CASM::Array< PTNode< T > * >	protected
operator=(ReturnArray< PTNode< T > * > &RHS)	CASM::Array< PTNode< T > * >	protected
operator==(const PolyTrie< T > &RHS) const	CASM::PolyTrie< T >
CASM::PTNode::operator==(const Array< PTNode< T > * > &RHS) const	CASM::Array< PTNode< T > * >
operator>(const Array< PTNode< T > * > &RHS) const	CASM::Array< PTNode< T > * >	protected
operator>=(const Array< PTNode< T > * > &RHS) const	CASM::Array< PTNode< T > * >	inlineprotected
operator[](Index ind) const	CASM::Array< PTNode< T > * >	inlineprotected
operator[](Index ind)	CASM::Array< PTNode< T > * >	inlineprotected
permute(const Array< Index > &perm_array)	CASM::Array< PTNode< T > * >	protected
PolyTrie(Index _depth)	CASM::PolyTrie< T >	inline
PolyTrie(const PolyTrie< T > &orig)	CASM::PolyTrie< T >
pop_back()	CASM::Array< PTNode< T > * >	inlineprotected
print_column(std::ostream &stream, const std::string &indent="") const	CASM::Array< PTNode< T > * >	protected
print_sparse(std::ostream &out) const	CASM::PolyTrie< T >
prune_zeros(double tol=PTNode< T >::PT_TOL())	CASM::PolyTrie< T >
PT_TOL()	CASM::PTNode< T >	inlineprotectedstatic
PTNode(PTNode< T > *_up, const T &_val=0)	CASM::PTNode< T >	inline
push_back(const PTNode< T > * &toPush)	CASM::Array< PTNode< T > * >	protected
redefine(Index new_depth)	CASM::PolyTrie< T >
remove()	CASM::PolyTrie< T >	inlinevirtual
remove(const Array< Index > &ind)	CASM::PolyTrie< T >
Array< PTNode< T > * >::remove(Index ind)	CASM::Array< PTNode< T > * >
reserve(Index new_max)	CASM::Array< PTNode< T > * >	protected
resize(Index new_N)	CASM::Array< PTNode< T > * >	protected
resize(Index new_N, const PTNode< T > * &fill_val)	CASM::Array< PTNode< T > * >	protected
reverse_find(const PTNode< T > * &test_elem) const	CASM::Array< PTNode< T > * >	protected
sequence(const PTNode< T > * &initial, const PTNode< T > * &final)	CASM::Array< PTNode< T > * >	protectedstatic
sequence(const PTNode< T > * &initial, const PTNode< T > * &increment, const PTNode< T > * &final)	CASM::Array< PTNode< T > * >	protectedstatic
set(const Array< Index > &ind, const T &_val)	CASM::PolyTrie< T >
size() const	CASM::Array< PTNode< T > * >	inlineprotected
size_type typedef	CASM::Array< PTNode< T > * >	protected
sort(const CompareType &comp)	CASM::Array< PTNode< T > * >	protected
sort(Array< Index > &ind_order)	CASM::Array< PTNode< T > * >	protected
sort()	CASM::Array< PTNode< T > * >	protected
sort_leaves(const CompareType &compare)	CASM::PolyTrie< T >
sub_array(Index ind_begin, Index ind_end) const	CASM::Array< PTNode< T > * >	protected
sum() const	CASM::Array< PTNode< T > * >	protected
swap(PolyTrie< T > &other)	CASM::PolyTrie< T >
CASM::PTNode::swap(Array< PTNode< T > * > &RHS)	CASM::Array< PTNode< T > * >
swap_elem(Index i, Index j)	CASM::Array< PTNode< T > * >	inlineprotected
up_node	CASM::PTNode< T >	protected
val() const	CASM::PTNode< T >	inline
valid_leaf_at(PolyTrie< T > &home_trie, const Array< Index > &ind)	CASM::PTNode< T >	protected
valid_node_at(Index i)	CASM::PTNode< T >	protected
Vals	CASM::Array< PTNode< T > * >	private
value_type typedef	CASM::PolyTrie< T >
X1 typedef	CASM::Array< PTNode< T > * >	protected
X2 typedef	CASM::Array< PTNode< T > * >	protected
X3 typedef	CASM::Array< PTNode< T > * >	protected
X4 typedef	CASM::Array< PTNode< T > * >	protected
X5 typedef	CASM::Array< PTNode< T > * >	protected
X6 typedef	CASM::Array< PTNode< T > * >	protected
X7 typedef	CASM::Array< PTNode< T > * >	protected
X8 typedef	CASM::Array< PTNode< T > * >	protected
X9 typedef	CASM::Array< PTNode< T > * >	protected
~Array()	CASM::Array< PTNode< T > * >	inlineprotected
~PolyTrie()	CASM::PolyTrie< T >
~PTNode()	CASM::PTNode< T >	virtual