_ext_x | disarray_rep< T, distributed, A > | mutable |
_ownership | disarray_rep< T, sequential, A > | protected |
_receive | disarray_rep< T, distributed, A > | |
_receive_max_size | disarray_rep< T, distributed, A > | |
_send | disarray_rep< T, distributed, A > | |
_stash | disarray_rep< T, distributed, A > | |
allocator_type typedef | disarray_rep< T, sequential, A > | |
append_dis_entry(const Set &ext_idx_set, Map &ext_idx_map) const | disarray_rep< T, distributed, A > | |
append_dis_entry(const Set &ext_idx_set, Map &ext_idx_map, std::true_type) const | disarray_rep< T, distributed, A > | |
append_dis_entry(const Set &ext_idx_set, Map &ext_idx_map, std::false_type) const | disarray_rep< T, distributed, A > | |
append_dis_indexes(const Set &ext_idx_set) const | disarray_rep< T, distributed, A > | |
base typedef | disarray_rep< T, distributed, A > | |
begin() const | disarray_rep< T, distributed, A > | |
begin() | disarray_rep< T, distributed, A > | |
comm() const | disarray_rep< T, distributed, A > | |
communicator_type typedef | disarray_rep< T, distributed, A > | |
const_iterator typedef | disarray_rep< T, distributed, A > | |
const_reference typedef | disarray_rep< T, distributed, A > | |
difference_type typedef | disarray_rep< T, distributed, A > | |
dis_at(size_type dis_i) const | disarray_rep< T, distributed, A > | |
dis_entry(size_type dis_i) | disarray_rep< T, distributed, A > | |
dis_entry_assembly(SetOp my_set_op=SetOp()) | disarray_rep< T, distributed, A > | |
dis_entry_assembly_begin(SetOp my_set_op=SetOp()) | disarray_rep< T, distributed, A > | |
dis_entry_assembly_end(SetOp my_set_op=SetOp()) | disarray_rep< T, distributed, A > | |
dis_reference typedef | disarray_rep< T, distributed, A > | |
dis_size() const | disarray_rep< T, distributed, A > | |
disarray_rep(const distributor &ownership, const T &init_val=T(), const A &alloc=A()) | disarray_rep< T, distributed, A > | |
disarray_rep(const disarray_rep< T, distributed, A > &x) | disarray_rep< T, distributed, A > | |
rheolef::disarray_rep< T, sequential, A >::disarray_rep(const A &alloc=A()) | disarray_rep< T, sequential, A > | explicit |
rheolef::disarray_rep< T, sequential, A >::disarray_rep(size_type loc_size=0, const T &init_val=T(), const A &alloc=A()) | disarray_rep< T, sequential, A > | |
rheolef::disarray_rep< T, sequential, A >::disarray_rep(const disarray_rep< T, sequential, A > &x) | disarray_rep< T, sequential, A > | |
dump(std::string name) const | disarray_rep< T, distributed, A > | |
end() const | disarray_rep< T, distributed, A > | |
end() | disarray_rep< T, distributed, A > | |
first_index() const | disarray_rep< T, distributed, A > | |
get_allocator() const | disarray_rep< T, distributed, A > | |
get_dis_entry(const Set &ext_idx_set, Map &ext_idx_map) const | disarray_rep< T, distributed, A > | |
get_dis_indexes(std::set< size_type > &ext_idx_set) const | disarray_rep< T, distributed, A > | |
get_dis_map_entries() const | disarray_rep< T, distributed, A > | |
get_values(idiststream &s) | disarray_rep< T, distributed, A > | |
get_values(idiststream &ips, GetFunction get_element) | disarray_rep< T, distributed, A > | |
is_container typedef | disarray_rep< T, distributed, A > | |
iterator typedef | disarray_rep< T, distributed, A > | |
last_index() const | disarray_rep< T, distributed, A > | |
memory_type typedef | disarray_rep< T, distributed, A > | |
operator[](size_type i) | disarray_rep< T, sequential, A > | |
operator[](size_type i) const | disarray_rep< T, sequential, A > | |
ownership() const | disarray_rep< T, distributed, A > | |
permutation_apply(const disarray_rep< size_type, distributed, A2 > &new_numbering, disarray_rep< T, distributed, A > &new_disarray) const | disarray_rep< T, distributed, A > | |
permuted_put_values(odiststream &ops, const disarray_rep< size_type, distributed, A2 > &perm, PutFunction put_element) const | disarray_rep< T, distributed, A > | |
put_matlab(odiststream &s) const | disarray_rep< T, distributed, A > | |
put_values(odiststream &s) const | disarray_rep< T, distributed, A > | |
put_values(odiststream &ops, PutFunction put_element) const | disarray_rep< T, distributed, A > | |
reference typedef | disarray_rep< T, distributed, A > | |
repartition(const disarray_rep< size_type, distributed, A2 > &partition, disarray_rep< T, distributed, A > &new_disarray, disarray_rep< size_type, distributed, A2 > &old_numbering, disarray_rep< size_type, distributed, A2 > &new_numbering) const | disarray_rep< T, distributed, A > | |
rheolef::disarray_rep< T, sequential, A >::repartition(const disarray_rep< size_type, sequential, A > &partition, disarray_rep< T, sequential, A > &new_disarray, disarray_rep< size_type, sequential, A > &old_numbering, disarray_rep< size_type, sequential, A > &new_numbering) const | disarray_rep< T, sequential, A > | |
reset_dis_indexes() const | disarray_rep< T, distributed, A > | |
resize(const distributor &ownership, const T &init_val=T()) | disarray_rep< T, distributed, A > | |
rheolef::disarray_rep< T, sequential, A >::resize(size_type loc_size=0, const T &init_val=T()) | disarray_rep< T, sequential, A > | |
reverse_permutation(disarray_rep< size_type, distributed, A2 > &inew2dis_iold) const | disarray_rep< T, distributed, A > | |
rheolef::disarray_rep< T, sequential, A >::reverse_permutation(disarray_rep< size_type, sequential, A2 > &inew2dis_iold) const | disarray_rep< T, sequential, A > | |
scatter_map_type typedef | disarray_rep< T, distributed, A > | |
set_dis_entry(size_type dis_i, const U &val, const SetOp &set_op) | disarray_rep< T, distributed, A > | |
set_dis_indexes(const Set &ext_idx_set) const | disarray_rep< T, distributed, A > | |
size() const | disarray_rep< T, distributed, A > | |
size_type typedef | disarray_rep< T, distributed, A > | |
stash_map_type typedef | disarray_rep< T, distributed, A > | |
stash_value typedef | disarray_rep< T, distributed, A > | |
value_type typedef | disarray_rep< T, distributed, A > | |