lar::sparse_vector< T > Member List

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

abs(value_type v)	lar::sparse_vector< T >	inlinestatic
add_range(size_type offset, ITER first, ITER last)	lar::sparse_vector< T >
add_range(size_type offset, const CONT &new_data)	lar::sparse_vector< T >	inline
add_range(size_type offset, vector_t &&new_data)	lar::sparse_vector< T >
add_range(size_type offset, ITER first, ITER last)	lar::sparse_vector< T >
append(ITER first, ITER last)	lar::sparse_vector< T >	inline
append(const CONT &range_data)	lar::sparse_vector< T >	inline
append(vector_t &&range_data)	lar::sparse_vector< T >	inline
assign(ITER first, ITER last)	lar::sparse_vector< T >	inline
assign(const CONT &new_data)	lar::sparse_vector< T >	inline
assign(vector_t &&new_data)	lar::sparse_vector< T >	inline
back_is_void() const	lar::sparse_vector< T >	inline
begin()	lar::sparse_vector< T >	inline
begin() const	lar::sparse_vector< T >	inline
begin_range() const	lar::sparse_vector< T >	inline
capacity() const	lar::sparse_vector< T >	inline
cbegin() const	lar::sparse_vector< T >	inline
cend() const	lar::sparse_vector< T >	inline
clear()	lar::sparse_vector< T >	inline
combine_range(size_type offset, ITER first, ITER last, OP &&op, value_type void_value=value_zero)	lar::sparse_vector< T >
combine_range(size_type offset, const CONT &other, OP &&op, value_type void_value=value_zero)	lar::sparse_vector< T >	inline
combine_range(size_type offset, ITER first, ITER last, OP &&op, value_type void_value) -> const datarange_t &	lar::sparse_vector< T >
const_pointer typedef	lar::sparse_vector< T >
count() const	lar::sparse_vector< T >	inline
difference_type typedef	lar::sparse_vector< T >
eat_range_head(range_iterator iRange, size_t index)	lar::sparse_vector< T >	protected
empty() const	lar::sparse_vector< T >	inline
end()	lar::sparse_vector< T >	inline
end() const	lar::sparse_vector< T >	inline
end_range() const	lar::sparse_vector< T >	inline
expected_vector_size(size_t size)	lar::sparse_vector< T >	inlinestatic
find_extending_range_iter(size_type index)	lar::sparse_vector< T >	inlineprotected
find_extending_range_iter(size_type index) const	lar::sparse_vector< T >	inlineprotected
find_extending_range_iter(size_type index, range_iterator rbegin)	lar::sparse_vector< T >	protected
find_extending_range_iter(size_type index, range_const_iterator rbegin) const	lar::sparse_vector< T >	protected
find_next_range_iter(size_type index)	lar::sparse_vector< T >	inlineprotected
find_next_range_iter(size_type index) const	lar::sparse_vector< T >	inlineprotected
find_next_range_iter(size_type index, range_iterator rbegin)	lar::sparse_vector< T >	protected
find_next_range_iter(size_type index, range_const_iterator rbegin) const	lar::sparse_vector< T >	protected
find_range(size_type index) const	lar::sparse_vector< T >
find_range(size_type index)	lar::sparse_vector< T >	inline
find_range_iterator(size_type index) const	lar::sparse_vector< T >
find_range_iterator(size_type index)	lar::sparse_vector< T >	inline
fix_size()	lar::sparse_vector< T >	protected
get_ranges() const	lar::sparse_vector< T >	inline
insert_range(range_iterator iInsert, const datarange_t &data)	lar::sparse_vector< T >	inlineprotected
insert_range(range_iterator iInsert, datarange_t &&data)	lar::sparse_vector< T >	inlineprotected
is_equal(value_type a, value_type b)	lar::sparse_vector< T >	inlinestatic
is_equal(value_type a, value_type b, value_type thr)	lar::sparse_vector< T >	inlinestatic
is_valid() const	lar::sparse_vector< T >
is_void(size_type index) const	lar::sparse_vector< T >
is_zero(value_type v)	lar::sparse_vector< T >	inlinestatic
is_zero(value_type v, value_type thr)	lar::sparse_vector< T >	inlinestatic
make_void(iterator first, iterator last)	lar::sparse_vector< T >
make_void_around(size_type index)	lar::sparse_vector< T >
merge_ranges(range_iterator iRange)	lar::sparse_vector< T >	protected
min_gap()	lar::sparse_vector< T >	inlinestatic
minimum_size() const	lar::sparse_vector< T >	inlineprotected
n_ranges() const	lar::sparse_vector< T >	inline
nominal_size	lar::sparse_vector< T >	protected
operator=(sparse_vector const &)=default	lar::sparse_vector< T >
operator=(sparse_vector &&from)	lar::sparse_vector< T >	inline
operator[](size_type index) const	lar::sparse_vector< T >
operator[](size_type index)	lar::sparse_vector< T >
optimize()	lar::sparse_vector< T >	inline
optimize(size_t)	lar::sparse_vector< T >	inline
pointer typedef	lar::sparse_vector< T >
push_back(value_type value)	lar::sparse_vector< T >	inline
push_back(value_type value, value_type thr)	lar::sparse_vector< T >	inline
range(size_t i) const	lar::sparse_vector< T >	inline
range_const_iterator typedef	lar::sparse_vector< T >
range_iterator typedef	lar::sparse_vector< T >
range_list_t typedef	lar::sparse_vector< T >
ranges	lar::sparse_vector< T >	protected
resize(size_type new_size)	lar::sparse_vector< T >
resize(size_type new_size, value_type def_value)	lar::sparse_vector< T >
set_at(size_type index, value_type value)	lar::sparse_vector< T >
should_merge(const typename datarange_t::base_t &a, const typename datarange_t::base_t &b)	lar::sparse_vector< T >	inlinestatic
size() const	lar::sparse_vector< T >	inline
size_type typedef	lar::sparse_vector< T >
sparse_vector()	lar::sparse_vector< T >	inline
sparse_vector(size_type new_size)	lar::sparse_vector< T >	inline
sparse_vector(const vector_t &from, size_type offset=0)	lar::sparse_vector< T >	inline
sparse_vector(sparse_vector const &)=default	lar::sparse_vector< T >
sparse_vector(sparse_vector &&from)	lar::sparse_vector< T >	inline
sparse_vector(vector_t &&from, size_type offset=0)	lar::sparse_vector< T >	inline
this_t typedef	lar::sparse_vector< T >	private
unset_at(size_type index)	lar::sparse_vector< T >
value_type typedef	lar::sparse_vector< T >
value_zero	lar::sparse_vector< T >	static
vector_t typedef	lar::sparse_vector< T >
void_range(range_iterator iRange)	lar::sparse_vector< T >	inline
void_range(size_t iRange)	lar::sparse_vector< T >	inline
~sparse_vector()=default	lar::sparse_vector< T >