gfx | |
Compare | |
TimSort | |
LibMIA | |
internal | |
data_type< DenseLattice< T > > | |
Data< DenseLattice< T > > | |
index_type< DenseLattice< T > > | |
storage_iterator< DenseLattice< T > > | |
const_storage_iterator< DenseLattice< T > > | |
data_iterator< DenseLattice< T > > | |
const_data_iterator< DenseLattice< T > > | |
data_type< DenseLatticeBase< Derived > > | |
index_type< DenseLatticeBase< Derived > > | |
data_iterator< DenseLatticeBase< Derived > > | |
const_data_iterator< DenseLatticeBase< Derived > > | |
storage_iterator< DenseLatticeBase< Derived > > | |
const_storage_iterator< DenseLatticeBase< Derived > > | |
Data< DenseLatticeBase< Derived > > | |
data_type< DenseMIA< T, _order > > | |
data_type_ref< DenseMIA< T, _order > > | |
const_data_type_ref< DenseMIA< T, _order > > | |
index_type< DenseMIA< T, _order > > | |
order< DenseMIA< T, _order > > | |
data_iterator< DenseMIA< T, _order > > | |
const_data_iterator< DenseMIA< T, _order > > | |
FinalDerived< DenseMIA< T, _order > > | |
data_type< DenseMIABase< Derived > > | |
data_type_ref< DenseMIABase< Derived > > | |
const_data_type_ref< DenseMIABase< Derived > > | |
index_type< DenseMIABase< Derived > > | |
order< DenseMIABase< Derived > > | |
data_iterator< DenseMIABase< Derived > > | |
const_data_iterator< DenseMIABase< Derived > > | |
const_storage_iterator< DenseMIABase< Derived > > | |
FinalDerived< DenseMIABase< Derived > > | |
pull_attract_indices | |
pull_attract_indices< Seq, false, recursive_depth, Pred > | Pulls the MIA indices involved in attract, e.g., a(!i,!j,!i,!j,k) would pull {i,j} |
pull_contract_indices | |
pull_contract_indices< Seq, false, recursive_depth, Pred > | Pulls the MIA indices involved in contraction, e.g., a(i,j,i,j,k) would pull {i,j} |
pull_sequence_from_list | |
pull_sequence_from_list< Seq, indices, false > | Given a Seq of MIA indices and a subset (given in indices parameter) provides a list of index positions of each index found in indices |
pull_left_operand_index_sequence | |
pull_left_operand_index_sequence< LSeq, RSeq, false, recursive_depth, Pred > | |
check_cartesian_product_indices | |
check_cartesian_product_indices< LSeq, RSeq, false, expression_type, Pred > | |
auto_cartesian_product_indices | |
auto_cartesian_product_indices< Seq, false, expression_type, Pred > | |
pull_match_order | |
pull_match_order< Seq, Seq_toMatch, false, Pred > | |
pull_right_index_order | |
pull_right_index_order< LSeq, RSeq, false, Pred > | |
pull_product_indices | |
pull_product_indices< LSeq, RSeq, false > | |
get_decremented_prod_index | |
get_decremented_prod_index< Seq, range_to_decrement, typename boost::enable_if< boost::mpl::greater< boost::mpl::size_t< range_to_decrement >, boost::mpl::size_t< 0 > > >::type > | |
decrement_back_indices | |
decrement_back_indices< Seq, 0 > | |
print_class_name | |
data_type< ImplicitMIA< T, _order, isRef > > | |
data_type_ref< ImplicitMIA< T, _order, false > > | |
const_data_type_ref< ImplicitMIA< T, _order, false > > | |
data_type_ref< ImplicitMIA< T, _order, true > > | |
const_data_type_ref< ImplicitMIA< T, _order, true > > | |
index_type< ImplicitMIA< T, _order, isRef > > | |
order< ImplicitMIA< T, _order, isRef > > | |
data_iterator< ImplicitMIA< T, _order, isRef > > | |
const_data_iterator< ImplicitMIA< T, _order, isRef > > | |
function_type< ImplicitMIA< T, _order, isRef > > | |
FinalDerived< ImplicitMIA< T, _order, isRef > > | |
match_rule | |
match_rule< ProdInd< id, elemval >, product_rule > | |
match_rule< ProdInd< id, 0 >, product_rule > | |
match_rule< ProdInd< id, elemval >, product_rule_different_elem_wise > | |
match_rule< ProdInd< id, elemval >, assign_rule > | |
match_rule< ProdInd< id, elemval >, merge_rule > | |
auto_match_rule | |
auto_match_rule< ProdInd< id, elemval >, binary_rule > | |
FromVariadic | |
FromVariadic< T, Args...> | |
FromVariadic< T > | |
FromVariadic<> | |
Indicial_Sequence | |
same_product_index_id | |
same_product_index_id< ProdInd< id1, elem_val1 >, ProdInd< id2, elem_val2 > > | |
same_product_index_id_different_elem_counters | |
same_product_index_id_different_elem_counters< ProdInd< id1, elem_val1 >, ProdInd< id2, elem_val2 > > | |
static_for | |
static_for< N, N > | |
static_reverse_for | |
static_reverse_for<-1 > | |
index_type< Lattice< Derived > > | |
data_type< Lattice< Derived > > | |
data_iterator< Lattice< Derived > > | |
DualSwapper | |
TripleSwapper | |
RadixShuffle | |
data_type | |
data_type_ref | |
const_data_type_ref | |
order | |
index_type | |
Data | |
Indices | |
full_iterator_tuple | |
const_full_iterator_tuple | |
full_tuple | |
const_full_tuple | |
storage_iterator | |
const_storage_iterator | |
index_iterator | |
const_index_iterator | |
data_iterator | |
const_data_iterator | |
function_type | |
FinalDerived | |
is_MIA | |
is_MIA< MIA< Derived > > | |
is_MIA< DenseMIABase< Derived > > | |
is_MIA< DenseMIA< T, _order > > | |
is_MIA< ImplicitMIA< T, _order, isRef > > | |
is_MIA< SparseMIA< T, _order > > | |
is_MIA< SparseMIABase< Derived > > | |
is_DenseMIA | |
is_DenseMIA< DenseMIA< T, _order > > | |
is_DenseMIA< DenseMIABase< Derived > > | |
is_DenseMIA< ImplicitMIA< T, _order, isRef > > | |
is_DenseMIA< MIA< Derived > > | |
is_SparseMIA | |
is_SparseMIA< SparseMIA< T, _order > > | |
is_SparseMIA< SparseMIABase< Derived > > | |
is_Lattice | |
is_SparseLattice | |
is_DenseLattice | |
is_Lattice< Lattice< Derived > > | |
is_SparseLattice< SparseLatticeBase< Derived > > | |
is_DenseLattice< DenseLatticeBase< Derived > > | |
is_ProdInd | |
is_ProdInd< ProdInd< i, elemval > > | |
is_Range | |
is_Range< Range< index_type > > | |
const_argument_qualifier | |
const_argument_qualifier< T, typename boost::enable_if< is_SparseMIA< T > >::type > | |
const_argument_qualifier< T, typename boost::enable_if< is_SparseLattice< T > >::type > | |
incomplete | |
check_mia_index_args | |
check_mia_index_args<> | |
check_mia_index_args< arg, Args...> | |
check_mia_dim_args | |
check_mia_dim_args< index_type > | |
check_mia_dim_args< index_type, arg, Args...> | |
check_dims_count | |
check_order | |
check_mia_constructor | |
check_mia_indexing | |
check_mia_range_args | |
check_mia_range_args<> | |
check_mia_range_args< range, Ranges...> | |
check_ranges | |
get_range_count | |
check_index_compatibility | |
data_type< MappedDenseLattice< T > > | |
Data< MappedDenseLattice< T > > | |
storage_iterator< MappedDenseLattice< T > > | |
const_storage_iterator< MappedDenseLattice< T > > | |
data_iterator< MappedDenseLattice< T > > | |
const_data_iterator< MappedDenseLattice< T > > | |
index_type< MappedDenseLattice< T > > | |
data_type< MappedSparseLattice< T > > | |
index_type< MappedSparseLattice< T > > | |
Data< MappedSparseLattice< T > > | |
Indices< MappedSparseLattice< T > > | |
index_iterator< MappedSparseLattice< T > > | |
data_iterator< MappedSparseLattice< T > > | |
const_index_iterator< MappedSparseLattice< T > > | |
const_data_iterator< MappedSparseLattice< T > > | |
full_iterator_tuple< MappedSparseLattice< T > > | |
const_full_iterator_tuple< MappedSparseLattice< T > > | |
full_tuple< MappedSparseLattice< T > > | |
const_full_tuple< MappedSparseLattice< T > > | |
storage_iterator< MappedSparseLattice< T > > | |
const_storage_iterator< MappedSparseLattice< T > > | |
data_type_ref< MappedSparseLattice< T > > | |
const_data_type_ref< MappedSparseLattice< T > > | |
data_type< MIA< Derived > > | |
data_type_ref< MIA< Derived > > | |
const_data_type_ref< MIA< Derived > > | |
index_type< MIA< Derived > > | |
order< MIA< Derived > > | |
data_iterator< MIA< Derived > > | |
storage_iterator< MIA< Derived > > | |
const_storage_iterator< MIA< Derived > > | |
FinalDerived< MIA< Derived > > | |
to_std_array | |
data_type< SparseLattice< T > > | |
index_type< SparseLattice< T > > | |
Data< SparseLattice< T > > | |
Indices< SparseLattice< T > > | |
index_iterator< SparseLattice< T > > | |
data_iterator< SparseLattice< T > > | |
const_index_iterator< SparseLattice< T > > | |
const_data_iterator< SparseLattice< T > > | |
full_iterator_tuple< SparseLattice< T > > | |
const_full_iterator_tuple< SparseLattice< T > > | |
full_tuple< SparseLattice< T > > | |
const_full_tuple< SparseLattice< T > > | |
storage_iterator< SparseLattice< T > > | |
const_storage_iterator< SparseLattice< T > > | |
data_type_ref< SparseLattice< T > > | |
const_data_type_ref< SparseLattice< T > > | |
Data< SparseLatticeBase< Derived > > | |
Indices< SparseLatticeBase< Derived > > | |
data_type< SparseLatticeBase< Derived > > | |
data_type_ref< SparseLatticeBase< Derived > > | |
const_data_type_ref< SparseLatticeBase< Derived > > | |
index_type< SparseLatticeBase< Derived > > | |
index_iterator< SparseLatticeBase< Derived > > | |
const_index_iterator< SparseLatticeBase< Derived > > | |
data_iterator< SparseLatticeBase< Derived > > | |
const_data_iterator< SparseLatticeBase< Derived > > | |
full_iterator_tuple< SparseLatticeBase< Derived > > | |
const_full_iterator_tuple< SparseLatticeBase< Derived > > | |
const_full_tuple< SparseLatticeBase< Derived > > | |
full_tuple< SparseLatticeBase< Derived > > | |
storage_iterator< SparseLatticeBase< Derived > > | |
const_storage_iterator< SparseLatticeBase< Derived > > | |
data_type< SparseMIA< T, _order > > | |
data_type_ref< SparseMIA< T, _order > > | |
const_data_type_ref< SparseMIA< T, _order > > | |
index_type< SparseMIA< T, _order > > | |
order< SparseMIA< T, _order > > | |
Data< SparseMIA< T, _order > > | |
Indices< SparseMIA< T, _order > > | |
data_iterator< SparseMIA< T, _order > > | |
index_iterator< SparseMIA< T, _order > > | |
const_index_iterator< SparseMIA< T, _order > > | |
const_data_iterator< SparseMIA< T, _order > > | |
full_iterator_tuple< SparseMIA< T, _order > > | |
const_full_iterator_tuple< SparseMIA< T, _order > > | |
full_tuple< SparseMIA< T, _order > > | |
const_full_tuple< SparseMIA< T, _order > > | |
storage_iterator< SparseMIA< T, _order > > | |
const_storage_iterator< SparseMIA< T, _order > > | |
FinalDerived< SparseMIA< T, _order > > | |
data_type< SparseMIABase< Derived > > | |
data_type_ref< SparseMIABase< Derived > > | |
const_data_type_ref< SparseMIABase< Derived > > | |
index_type< SparseMIABase< Derived > > | |
order< SparseMIABase< Derived > > | |
data_iterator< SparseMIABase< Derived > > | |
const_data_iterator< SparseMIABase< Derived > > | |
index_iterator< SparseMIABase< Derived > > | |
const_index_iterator< SparseMIABase< Derived > > | |
storage_iterator< SparseMIABase< Derived > > | |
const_storage_iterator< SparseMIABase< Derived > > | |
Data< SparseMIABase< Derived > > | |
Indices< SparseMIABase< Derived > > | |
full_tuple< SparseMIABase< Derived > > | |
const_full_tuple< SparseMIABase< Derived > > | |
FinalDerived< SparseMIABase< Derived > > | |
is_MIA< ImplicitMIA< T, _order > > | |
is_DenseMIA< ImplicitMIA< T, _order > > | |
DenseLattice | Lattice class for dense data |
null_deleter | |
DenseLatticeBase | Base class for dense lattice classes |
DenseMIA | MIA class for dense data |
null_deleter | |
DenseMIABase | Base class for dense multi-index array classes |
MIAPullIndicesUtil | |
isPureOuterInterProduct | |
MIAProductUtil | |
MIASolveUtil | |
MIAprint | |
select_first | |
array_converter | |
implicit_iter | Iterator for ImplicitMIAs |
ImplicitMIA | MIA class for implicit MIAs (where values are defined by a function). Can be treated as a read-only type of MIA |
ProdInd | |
Lattice | Base class for lattice classes |
LatticeException | |
LatticeParameterException | |
RankDeficientException | |
DimensionMismatchException | |
MIAException | |
MIAParameterException | |
MIAMemoryException | |
Range | |
Tolerance | |
Tolerance< float > | |
Tolerance< double > | |
SparseTolerance | |
SparseTolerance< float > | |
SparseTolerance< double > | |
SparseLatticeBase | Lattice class for sparse data |
SparseLattice | Lattice class for sparse data |
MappedSparseLattice | |
MappedDenseLattice | Lattice class for dense data. Maps already allocated data to a denselattice |
MIA | Base class for multi-index array classes |
SparseMIABase | Base class for sparse MIA classes |
SparseMIA | MIA class for sparse data |
MIA_Atom | Expression class created whenever an MIA is index by ProdInds. Reponsible for all compile-time delegation of operations |
ScalarPromoteType | |
IndexPromoteType | |
SparseProductReturnType | |
SparseSolveReturnType | |
SparseMergeReturnType | |
DenseMergeReturnType | |
DenseProductReturnType | |
DenseSolveReturnType | |
MIAProductReturnType | |
MIAProductReturnType< L_MIA, R_MIA, order, typename boost::enable_if< boost::mpl::or_< internal::is_SparseMIA< typename std::remove_const< L_MIA >::type >, internal::is_SparseMIA< typename std::remove_const< R_MIA >::type > > >::type > | |
MIAProductReturnType< L_MIA, R_MIA, order, typename boost::enable_if< boost::mpl::and_< internal::is_DenseMIA< typename std::remove_const< L_MIA >::type >, internal::is_DenseMIA< typename std::remove_const< R_MIA >::type > > >::type > | |
MIANoLatticeProductReturnType | |
MIANoLatticeProductReturnType< L_MIA, R_MIA, order, typename boost::enable_if< boost::mpl::and_< internal::is_DenseMIA< typename std::remove_const< L_MIA >::type >, internal::is_DenseMIA< typename std::remove_const< R_MIA >::type > > >::type > | |
MIANoLatticeProductReturnType< L_MIA, R_MIA, order, typename boost::enable_if< boost::mpl::or_< internal::is_SparseMIA< typename std::remove_const< L_MIA >::type >, internal::is_SparseMIA< typename std::remove_const< R_MIA >::type > > >::type > | |
MIASolveReturnType | |
MIASolveReturnType< L_MIA, R_MIA, order, typename boost::enable_if< boost::mpl::and_< internal::is_MIA< typename std::remove_const< L_MIA >::type >, internal::is_MIA< typename std::remove_const< R_MIA >::type > > >::type > | |
MIANonlinearFuncType | |
MIANonlinearFuncType< MIA, typename boost::enable_if< internal::is_DenseMIA< typename std::remove_const< MIA >::type > >::type > | |
MIANonlinearFuncType< MIA, typename boost::enable_if< internal::is_SparseMIA< typename std::remove_const< MIA >::type > >::type > | |
MIAUnaryType | |
MIAUnaryType< MIA, remaining_indices_size, typename boost::enable_if< internal::is_DenseMIA< typename std::remove_const< MIA >::type > >::type > | |
MIAUnaryType< MIA, remaining_indices_size, typename boost::enable_if< internal::is_SparseMIA< typename std::remove_const< MIA >::type > >::type > | |
MIAMergeReturnType | |
MIAMergeReturnType< Lhs, Rhs, typenameboost::enable_if< boost::mpl::and_< internal::is_DenseMIA< typename std::remove_const< Lhs >::type >, internal::is_DenseMIA< typename std::remove_const< Rhs >::type > > >::type > | |
MIAMergeReturnType< Lhs, Rhs, typenameboost::enable_if< boost::mpl::or_< boost::mpl::and_< internal::is_DenseMIA< typename std::remove_const< Lhs >::type >, internal::is_SparseMIA< typename std::remove_const< Rhs >::type > >, boost::mpl::and_< internal::is_SparseMIA< typename std::remove_const< Lhs >::type >, internal::is_DenseMIA< typename std::remove_const< Rhs >::type > > > >::type > | |
MIAMergeReturnType< Lhs, Rhs, typenameboost::enable_if< boost::mpl::and_< internal::is_SparseMIA< typename std::remove_const< Lhs >::type >, internal::is_SparseMIA< typename std::remove_const< Rhs >::type > > >::type > | |
dimsContainer | Helper structure to ensure that anytime dimensions are changed, the dimensionality is automatically recalculated |
perform_cartesian_check | |
perform_auto_check | |
perform_merge | |
perform_merge< l_Seq, r_Seq, typename boost::enable_if< boost::mpl::equal< l_Seq, r_Seq, boost::mpl::quote2< internal::same_product_index_id > > >::type > | |
perform_merge< l_Seq, r_Seq, typename boost::disable_if< boost::mpl::equal< l_Seq, r_Seq, boost::mpl::quote2< internal::same_product_index_id > > >::type > | |
perform_destructive_merge | |
perform_destructive_merge< l_Seq, r_Seq, typename boost::enable_if< boost::mpl::equal< l_Seq, r_Seq, boost::mpl::quote2< internal::same_product_index_id > > >::type > | |
perform_destructive_merge< l_Seq, r_Seq, typename boost::disable_if< boost::mpl::equal< l_Seq, r_Seq, boost::mpl::quote2< internal::same_product_index_id > > >::type > | |
index_decrementer | |
lattice_maker | |
lattice_maker< _MIA, array1Type, array2Type, array3Type, true > | |
lattice_maker< _MIA, array1Type, array2Type, array3Type, false > | |
lattice_permutation_delegator | |
consecutive_sequence_checker | |
solve_product_expr_helper | |
solve_lattice_expr_helper | |
product_lattice_expr_helper | |
lattice_expr_helper | |
contraction_helper | |
attraction_helper | |
unary_helper | |
MultHelper | Data structure, whose ColumnSparse template parameter allows one to choose between different ways to access starting and end positions of a given column |
MultHelper< Derived, false > | |
linIdxContainer | |
MIAProductReturnType< L_MIA, R_MIA, order, typename boost::enable_if< boost::mpl::or_< internal::is_DenseMIA< L_MIA >, internal::is_DenseMIA< R_MIA > > >::type > | |
MIAProductReturnType< L_MIA, R_MIA, order, typename boost::enable_if< boost::mpl::and_< internal::is_SparseMIA< L_MIA >, internal::is_SparseMIA< R_MIA > > >::type > | |
MIANoLatticeProductReturnType< L_MIA, R_MIA, order, typename boost::enable_if< boost::mpl::and_< internal::is_DenseMIA< L_MIA >, internal::is_DenseMIA< R_MIA > > >::type > | |
MIANoLatticeProductReturnType< L_MIA, R_MIA, order, typename boost::enable_if< boost::mpl::or_< internal::is_SparseMIA< L_MIA >, internal::is_SparseMIA< R_MIA > > >::type > | |
MIASolveReturnType< L_MIA, R_MIA, order, typename boost::enable_if< boost::mpl::and_< internal::is_MIA< L_MIA >, internal::is_MIA< R_MIA > > >::type > | |
MIAUnaryType< MIA, remaining_indices_size, typename boost::enable_if< internal::is_DenseMIA< MIA > >::type > | |
MIAUnaryType< MIA, remaining_indices_size, typename boost::enable_if< internal::is_SparseMIA< MIA > >::type > | |
MIAMergeReturnType< Lhs, Rhs, typenameboost::enable_if< boost::mpl::and_< internal::is_DenseMIA< Lhs >, internal::is_DenseMIA< Rhs > > >::type > | |
MIAMergeReturnType< Lhs, Rhs, typenameboost::enable_if< boost::mpl::or_< boost::mpl::and_< internal::is_DenseMIA< Lhs >, internal::is_SparseMIA< Rhs > >, boost::mpl::and_< internal::is_SparseMIA< Lhs >, internal::is_DenseMIA< Rhs > > > >::type > | |
MIAMergeReturnType< Lhs, Rhs, typenameboost::enable_if< boost::mpl::and_< internal::is_SparseMIA< Lhs >, internal::is_SparseMIA< Rhs > > >::type > | |
libdivide_s32_t | |
libdivide_s64_t | |
libdivide_u32_t | |
libdivide_u64_t | |
sort_permute_iter | Iterator that can be used to sort index and data arrays, based on the index array. Can interface with std::sort |
sort_permute_iter_compare | |
sort_permute_iter_helper_type | |