OpenFPM_pdata  1.0.0
Project that contain the implementation of distributed structures
 All Data Structures Functions Variables Typedefs Enumerations Friends Pages
Class Hierarchy
This inheritance list is sorted roughly, but not completely, alphabetically:
[detail level 123]
oCAdaptiveCylinderCone< dim, T >This class represent an Adaptive cylinder cone
oCadd_< Tdst, Tsrc >This structure define the operation add to use with copy general
oCopenfpm::add_prp_impl< objv, vect_dst >Struct to merge two vectors
oCadd_prp_impl< objv, vect_dst >Struct to merge two vectors
oCopenfpm::add_prp_impl< OBJECT_ADD, vect_dst >Struct to merge two vectors
oCadd_prp_impl< OBJECT_ADD, vect_dst >Struct to merge two vectors
oCAexampleExample structure
oCagg_arr< n_ele >It store the offsets of the interpolation points
oCaggregate< list >Aggregate of properties, from a list of object if create a struct that follow the OPENFPM native structure
oCallocate< S >This class is a functor for "for_each" algorithm
oCAMG_time_err_coarsIt contain information about the performance of the AMG
oCanyname_field[Constant fields struct definition]
oCanyname_field_with_posDefine a non-constant (in space) field
oCapply_kernel_is_number_or_expression< T, vector, exp, NN_type, Kernel, rtype, is_exp >Apply the kernel to particle differently that is a number or is an expression
oCapply_kernel_is_number_or_expression_gen< T, vector, exp, NN_type, Kernel, rtype, is_exp >Apply the kernel to particle differently that is a number or is an expression
oCapply_kernel_is_number_or_expression_sim< vector, exp, NN_type, Kernel, rtype >Apply the kernel to particle differently that is a number or is an expression
oCapply_kernel_rtype< exp, is_exp >It give the return type of the expression if applicable
oCapply_kernel_rtype< exp, false >It give the return type of the expression if applicable
oCarray_extents< T >Struct that give functionalities on array extensions
oCarray_extents< T[N1]>Struct that give functionalities on array extensions
oCarray_extents< T[N1][N2]>Struct that give functionalities on array extensions
oCarray_extents< T[N1][N2][N3]>Struct that give functionalities on array extensions
oCArrayHolder< T, args >Array itself
oCArrayHolder_constexpr< T, args >Array itself
oCArrayHolder_indexes< T, args >Array itself
oCmemory_c< multi_array< T >, D >::ascending< index, N >In combination with generate_array is used to produce array at compile-time
oCnm_part_v::attributesAttributes name
oCtest_has_attributes::attributesDefine attribute names
oCnm_e::attributesAttributes name
oCnm_part_e::attributesAttributes name
oCnode_cp::attributesAttributes name
oCPoint_test_scal< T >::attributesAttributes name
oCnm_v::attributesAttributes name
oCPoint_test_prp< T >::attributesAttributes name
oCne_cp::attributesDefine attributes names
oCvx::attributesAttributes name
oCed::attributesAttributes name
oCvertex::attributesAttributes name
oCvertex2::attributesAttributes name
oCvertex3::attributesAttributes name
oCAvg< d, Field, Sys_eqs, impl >Average
oCAvg< d, arg, Sys_eqs, BACKWARD >First order BACKWARD derivative on direction i
oCAvg< d, arg, Sys_eqs, CENTRAL >Central average scheme on direction i
oCAvg< d, arg, Sys_eqs, FORWARD >FORWARD average on direction i
oCbase_copy< has_base, base_obj, v_obj >
oCbase_copy< true, base_obj, v_obj >
oCVcluster::base_infoBase info
oCbisect_unroll< dim, ORB >This class is a functor for "for_each" algorithm
oCBox< dim, T >This class represent an N-dimensional box
oCBox< 3, float >
oCBox< dim, dT >
oCBox< dim, long int >
oCBox< dim, size_t >
oCBox< dim, St >
oCBox< dim, typename last::stype >
oCBox< dim, typename Sys_eqs::stype >
oCBox< Grid::dims, size_t >
oCBox< N, size_t >
oCBox< vector::dims, size_t >
oCBox_dom< dim, T >Case for external ghost box
oCBox_fix< dim >Internal ghost box sent to construct external ghost box into the other processors
oCCartDecomposition< dim, T, Memory, Distribution >::box_idClass to select the returned id by ghost_processorID
oCBox_loc_sub< dim, T >For each sub-domain box sub contain the real the sub-domain id
oCBox_proc< dim, T >Case for local external ghost box
oCBox_sub< dim, T >
oCBox_sub_k< dim, T >Particular case for local internal ghost boxes
oCinterpolate< vector, grid, kernel >::Box_vol
oCbrt_test
oCcalculate_aint< dims, vector, np >Calculate aint
oCcalculate_aint< 2, vector, np >Calculate aint 2D
oCcalculate_aint< 3, vector, np >Calculate aint
oCcall_aggregatePack< obj_type, Mem, prp >Calls a packer in nested way
oCcall_aggregatePackRequest< obj_type, Mem, prp >
oCcall_aggregateUnpack< obj_type, Mem, prp >Calls an unpacker in nested way
oCcall_encapPack< encap, Mem, prp >
oCcall_encapPackRequest< encap, Mem, prp >
oCcall_encapUnpack< encap, Mem, prp >
oCcall_init_if_needed< T, has_init >Call the init function if a type T has the function init
oCcall_init_if_needed< T, false >Call the init function if a type T has the function init
oCcall_pack_agg_functor< obj_type, Mem >
oCcall_pack_enc_functor< encap, Mem >
oCcall_packRequest_agg_functor< obj_type, Mem >
oCcall_packRequest_enc_functor< encap, Mem >
oCcall_serialize_variadic< T >
oCcall_serialize_variadic< index_tuple< prp...> >
oCcall_unpack_agg_functor< obj_type, Mem >
oCcall_unpack_encap_functor< encap, Mem, prp >
oCCartesianGraphFactory< dim, Graph >This class construct a cartesian graph
oCcell_grid< Grid >For each combination in the cell grid you can have different grids
oCCellBase
oCCellDecomposer_sm
oCCellIterator< Cell >It iterate through the elements of a cell
oCCellNNIterator< dim, Cell, NNc_size, impl >Iterator for the neighborhood of the cell structures
oCCellNNIterator< dim, Cell, RUNTIME, impl >Iterator for the neighborhood of the cell structures
oCCellNNIteratorRadius< dim, Cell, impl >Iterator for the neighborhood of the cell structures with free radius
oCcheck_no_pointers< T >This class check if the type T has pointers inside
oCcheck_no_pointers_impl< T, has_pointer >Check if the type T has pointers inside
oCcheck_no_pointers_impl< T, false >Check if the type T has pointers inside
oCcheck_types< v >Functor for for_each algorithm
oCCheckExistenceClass to check if the edge can be created or not
oCcomb< dim >Position of the element of dimension d in the hyper-cube of dimension dim
oCcomb< 0 >
oCcomb< Grid::dims >
oCcomb< Sys_eqs::dims >
oCcompare_aggregate< S >Structure to copy aggregates applying an operation limited to some properties
oCcompare_cpu_encap_encap< e_src, e_dst >This class is a functor for "for_each" algorithm
oCcompare_fusion_vector< bfv >This class is a functor for "for_each" algorithm
oCcompare_general< T, agg >Structure to copy aggregates
oCcompare_general< T, 0 >
oCcompare_general< T, 2 >
oCconditional_push< v, p_ele, to_push >Push p_ele into v only of to_push is true
oCconditional_push< v, p_ele, false >Push p_ele into v only of to_push is true
oCconst_mul_functor_value< v_expr >Multiplication expression
oCFDScheme< Sys_eqs >::constant_bEncapsulation of the b term as constant
oCConstField
oCconstruct_expression< T >
oCconstruct_expression< double >Construct a vector expression from a double
oCconstruct_expression< float >Construct a vector expression from a float
oCconvert< A >Set a conversion map between A and B
oCconvert< std::string >Partial specialization when A is a string
oCcopy_acc< S >This class is a functor for "for_each" algorithm
oCcopy_aggregate< S >Structure to copy aggregates
oCcopy_aggregate_op< op, S >Structure to copy aggregates applying an operation
oCcopy_cpu_encap< dim, S, Memory >This class is a functor for "for_each" algorithm
oCcopy_cpu_encap_encap< e_src, e_dst >This class is a functor for "for_each" algorithm
oCcopy_cpu_encap_encap_op_prp< op, e_src, e_dst, prp >It copy two encap object
oCcopy_ele< Eqs_sys, S, Ev >This class is a functor for "for_each" algorithm
oCcopy_ele_sca_array< copy_type, T, Ev, Eqs_sys, sa >Copy scalar elements
oCcopy_ele_sca_array< copy_type, T, Ev, Eqs_sys, 1 >Copy 1D array elements
oCcopy_fusion_vector< bfv >This class is a functor for "for_each" algorithm
oCcopy_fusion_vector_encap< bfv, enc >This class is a functor for "for_each" algorithm
oCcopy_general< T, agg >Structure to copy aggregates
oCcopy_general< T, 1 >Specialization for if dst type is copy assignable from src type
oCcopy_general< T, 2 >Specialization for aggregate type object
oCcopy_general< T, 3 >Specialization for aggregate type object that define an operator=
oCcopy_general_op< op, T, agg >Structure to copy aggregates applying an operation
oCcopy_general_op< op, T, 1 >Specialization for object that can be assigned with an operator copy
oCcopy_general_op< op, T, 2 >Specialization for aggregate type objects
oCcopy_general_op< op, T, 3 >Specialization for aggregate type object that define an operator=
oCcsv_col< Tobj, attr >This class is a functor for "for_each" algorithm
oCcsv_col< Tobj, false >This class is a functor for "for_each" algorithm
oCcsv_col_str< T >This class is an helper to produce csv headers from multi-array
oCcsv_col_str< T[N1]>Partial specialization for N=1 1D-Array
oCcsv_col_str< T[N1][N2]>Partial specialization for N=2 2D-Array
oCcsv_col_str< T[N1][N2][N3]>Partial specialization for N=3
oCcsv_col_str< T[N1][N2][N3][N4]>Partial specialization for N=4
oCcsv_prp< Tobj >This class is a functor for "for_each" algorithm
oCcsv_value_str< T, is_writable >This class is an helper to produce csv data from multi-array
oCcsv_value_str< T, false >Partial specialization for unknown property
oCcsv_value_str< T[N1], is_writable >Partial specialization for N=1 1D-Array
oCcsv_value_str< T[N1][N2], is_writable >Partial specialization for N=2 2D-Array
oCcsv_value_str< T[N1][N2][N3], is_writable >Partial specialization for N=3
oCcsv_value_str< T[N1][N2][N3][N4], is_writable >Partial specialization for N=4
oCCSVWriter< v_pos, v_prp, impl >CSV Writer
oCcval< T >It store the non zero elements of the matrix
oCD< d, Field, Sys_eqs, impl >Derivative second order on h (spacing)
oCD< d, arg, Sys_eqs, BACKWARD >First order BACKWARD derivative on direction i
oCD< d, arg, Sys_eqs, CENTRAL >Second order central Derivative scheme on direction i
oCD< d, arg, Sys_eqs, CENTRAL_B_ONE_SIDE >Second order one sided Derivative scheme on direction i
oCD< d, arg, Sys_eqs, FORWARD >First order FORWARD derivative on direction i
oCdataDiv< T >Class that store Internal part external and border part of a dataset
oCdec_optimizer< dim, Graph >This class take a graph representing the space decomposition and produce a simplified version
oCDecomposition< T, S >This class define the domain decomposition interface
oCdist_prop_out_edge< Graph >This class is a functor for "for_each" algorithm
oCdist_prop_out_vertex< Graph >This class is a functor for "for_each" algorithm
oCdist_prop_output< has_attributes, Graph, i >This class specialize functions in the case the type T has or not defined attributes
oCdist_prop_output< false, Graph, i >This class specialize functions in the case the type T has not defined attributes
oCdist_prop_output_array_scalar_selector_edge< is_array >Property writer for scalar and vector
oCdist_prop_output_array_scalar_selector_edge< true >Property writer for vector
oCdist_prop_output_array_scalar_selector_edge_fill_vertex< is_array >Property writer for scalar and vector, it fill the vertex data (needed for edge representation in vtk)
oCdist_prop_output_array_scalar_selector_edge_fill_vertex< true >Property writer for vector
oCdist_prop_output_array_scalar_selector_vertex< is_array >Property writer for scalar and vector
oCdist_prop_output_array_scalar_selector_vertex< true >Property writer for vector
oCDistGraph_constr_impl< dim, Graph, se, T, dim_c, pos >Graph constructor function specialization
oCDistGraph_constr_impl< dim, Graph, NO_EDGE, T, dim_c, pos...>Graph constructor function specialization
oCDistGraph_CSR< V, E, Memory, layout_v, layout_e, layout_v_base, layout_e_base, grow_p >Structure that store a graph in CSR format or basically in compressed adjacency matrix format
oCDistGraph_CSR< nm_v, nm_e >
oCDistGraph_CSR< V, E >
oCDistGraphFactory< dim, Graph >This class construct a cartesian graph
oCDistParmetis< Graph >Helper class to define Metis graph
oCDistParmetis< DistGraph_CSR< nm_v, nm_e > >
oCDistParMetisDistribution< dim, T >
oCDLB
oCdo_not_print_warning_on_adjustment< dim >
oCdo_when_dim_gr_i< dim, i, ORB, Enable >This structure use SFINAE to avoid instantiation of invalid code
oCdomain_nn_calculator_cart< dim >This class calculate processor domains and neighborhood of each processor domain
oCDrawParticlesA class to draw/create particles based on simple shaped
oCe_box_id< dim >It store the information about the external ghost box
oCe_info
oCe_lbox_grid< dim >Per-processor external ghost box
oCe_lbox_id< dim >It store the information about the local external ghost box
oCe_mapStructure used inside GraphCSR an edge
oCE_p< T >Edge class that encapsulate an object T
oCed
oCedge_iterator< Graph >Graph edge iterator
oCedge_key
oCedge_node< G >This class is a functor for "for_each" algorithm
oCedge_prop< G >This class is a functor for "for_each" algorithm
oCDistGraph_CSR< V, E, Memory, layout_v, layout_e, layout_v_base, layout_e_base, grow_p >::EdgeReqStructure to store a add request of an edge
oCele_g< Grid, St >It store one grid
oCele_g_st< Grid, St >Convert a staggered element into a string for vtk write
oCele_vpp< Vpp >Store a reference to the vector properties
oCele_vps< Vps >Store a reference to the vector position
oCencapc< dim, T, layout >
oCencapc< 1, obj_type, Memory >
oCencapc< dim, T, typename memory_traits_inte< T >::type >This structure encapsulate an object of the grid
oCencapc< dim, T, typename memory_traits_lin< T >::type >This structure encapsulate an object of the grid
oCencapc< dim, void, Mem >This structure specialize the class for a void object or null
oCep_box_grid< dim >Per-processor external ghost box
oCEq< expr1, expr2, Sys_eqs >Equation
oCequal_to
oCErrorOut-of-bound policy kill the program
oCeta[Definition of the system]
oCexp_kernelExponential kernel
oCextends< T >Classes to get the number of components of the properties
oCextends< T[N1]>Partial specialization for N=1 1D-Array
oCextends< T[N1][N2]>Partial specialization for N=2 2D-Array
oCextends< T[N1][N2][N3]>Partial specialization for N=3
oCextends< T[N1][N2][N3][N4]>Partial specialization for N=4
oCextends< T[N1][N2][N3][N4][N5]>Partial specialization for N=5
oCextends< T[N1][N2][N3][N4][N5][N6]>Partial specialization for N=6
oCextends< T[N1][N2][N3][N4][N5][N6][N7]>Partial specialization for N=7
oCextends< T[N1][N2][N3][N4][N5][N6][N7][N8]>Partial specialization for N=8
oCextends< T[N1][N2][N3][N4][N5][N6][N7][N8][N9]>Partial specialization for N=9
oCextends< T[N1][N2][N3][N4][N5][N6][N7][N8][N9][N10]>Partial specialization for N=10
oCF< T >[v_transform metafunction]
oCfalse_type
oCFDScheme< Sys_eqs >Finite Differences
oCField< f, Sys_eqs >
oCfill_id< dim, G_v, prp >Operator to fill the property 'prp' with the linearization of indexes
oCfill_id< dim, G_v, NO_VERTEX_ID >Operator to fill the property in case there are no properties
oCFill_one< index, N >{1,1,1,1,....}
oCfill_prop< dim, lin_id, dT, G_v, v, impl >This class work as a functor
oCfill_prop< dim, lin_id, dT, G_v, v, 0 >This class work as a functor
oCfill_prop< dim, lin_id, dT, G_v, v, 2 >This class work as a functor
oCfill_prop_by_type< i, p, Graph, pos >Operator for vector and scalar property
oCfill_prop_by_type< 0, p, Graph, pos...>Operator for vector and scalar property in the case there are no properties
oCfill_prop_v< dim, dT, G_v, v, impl >This class work as a functor
oCfill_prop_v< dim, dT, G_v, v, 0 >This class work as a functor
oCfill_prop_v< dim, dT, G_v, v, 2 >This class work as a functor
oCfill_prop_v_by_type< i, p, Graph, pos >Operator for vector and scalar property
oCfill_prop_v_by_type< 0, p, Graph, pos...>Operator for vector and scalar property in the case there are no properties
oCFill_three< index, N >Compile time array functor needed to generate array at compile-time of type
oCFill_two< index, N >{2,2,2,2,....}
oCFill_zero< index, N >{0,0,0,0,....}
oCboost::mpl::aux::for_each_ref_impl< done >
oCboost::mpl::aux::for_each_ref_impl< false >
oCfrswap< s_m >This class is a functor for "for_each" algorithm
oCFtwo< arg0, T >[v_transform metafunction]
oCGBoxes< dim >This structure store the Box that define the domain inside the Ghost + domain box
oCgcl< dim, St, CellL, Vector >General function t get a cell-list
oCgcl< dim, St, CellList_gen< dim, St, Process_keys_hilb, Mem_type, shift< dim, St > >, Vector >General function t get a cell-list
oCGCoptionsGoogle chart options
oCgenerate_array< T, N, F >Main class to generate compile-time array
oCgenerate_array_constexpr< T, N, F >Main class to generate constexpr compile-time array
oCgenerate_array_constexpr_impl< T, N, orig_N, F, args >Recursive meta-function to generate compile-time array
oCgenerate_array_constexpr_impl< T, 0, orig_N, F, args...>Terminator of the variadic template
oCgenerate_array_impl< T, N, orig_N, F, args >Generate the array specializing ArrayHolder
oCgenerate_array_impl< T, 0, orig_N, F, args...>Terminator of the variadic template
oCgenerate_array_vector< T, F >Main class to generate an array from a boost::mpl::vector of numbers
oCgenerate_array_vector_impl< T, N, F, args >Generate the array specializing ArrayHolder
oCgenerate_array_vector_impl< T, 1, F, args...>Terminator of the variadic template
oCgenerate_indexes< T, N, F >Main class to generate indexes data structure
oCgenerate_indexes_impl< T, N, orig_N, F, args >Generate compile time index array
oCgenerate_indexes_impl< T, 0, orig_N, F, args...>Terminator of the variadic template
oCgenerate_indexes_impl< T,-1, orig_N, F, args...>In case of an empty list
oCgetAttrName< ele_g, has_attributes >Return the Attributes name from the type
oCgetAttrName< ele_g, false >Return the Attributes name from the type
oCGGraphGoogle Graph
oCgid
oCDistGraph_CSR< V, E, Memory, layout_v, layout_e, layout_v_base, layout_e_base, grow_p >::GlobalVInfoStructure needed to get vertex position by global id
oCGoogleChartSmall class to produce graph with Google chart in HTML
oCgrid_dist_id_iterator_dec_skin< Decomposition >::gp_subInternal struct
oCGraph_constructor_impl< dim, lin_id, Graph, se, T, dim_c, pos >Graph constructor function specialization
oCGraph_constructor_impl< dim, lin_id, Graph, NO_EDGE, T, dim_c, pos...>Graph constructor function specialization
oCGraph_CSR< V, E, Memory, layout_v, layout_e, layout_v_base, layout_e_base, grow_p >Structure that store a graph in CSR format or basically in compressed adjacency matrix format
oCGraph_CSR< nm_v, nm_e >
oCGraph_CSR< V, E >
oCGraphMLWriter< Graph >
oCgrid< T >
oCFDScheme< Sys_eqs >::grid_b< grid, prp >Encapsulation of the b term as grid
oCgrid_base_impl< dim, T, S, layout_, layout_base >Implementation of a N-dimensional grid
oCgrid_base_impl< dim, T, S, memory_traits_inte< T >::type, memory_traits_inte >
oCgrid_base_impl< dim, T, S, memory_traits_lin< T >::type, memory_traits_lin >
oCgrid_call_serialize_variadic< device_grid, Memory, T >Unpack selector
oCgrid_call_serialize_variadic< device_grid, Memory, index_tuple< prp...> >Unpack selector
oCgrid_cpu< dim, T, S, layout >
oCgrid_cpu< 1, T, Memory, layout >
oCgrid_cpu< dim, scalar< size_t > >
oCgrid_cpu< dim, Tg >
oCgrid_dist_id_comm< dim, St, T, Decomposition, Memory, device_grid >This class is an helper for the communication of grid_dist_id
oCgrid_dist_id_comm< dim, typename last::stype, scalar< size_t >, typename last::b_grid::decomposition::extended_type, HeapMemory, grid_cpu< dim, scalar< size_t > > >
oCgrid_dist_id_comm< dim, typename Sys_eqs::stype, scalar< size_t >, typename Sys_eqs::b_grid::decomposition::extended_type, HeapMemory, grid_cpu< dim, scalar< size_t > > >
oCgrid_dist_id_iterator_dec< Decomposition >Given the decomposition it create an iterator
oCgrid_dist_iterator< dim, device_grid, impl, stencil >Distributed grid iterator
oCgrid_dist_iterator< dim, device_grid, FIXED, stencil >Distributed grid iterator
oCgrid_dist_iterator< dim, device_grid, FREE, stencil >Distributed grid iterator
oCgrid_dist_iterator_sub< dim, device_grid >Distributed grid iterator
oCgrid_dist_key_dx< dim >Grid key for a distributed grid
oCgrid_dist_key_dx< Eqs_sys::dims >
oCgrid_dist_key_dx< Grid_dst::dims >
oCgrid_dist_key_dx< last::dims >
oCgrid_dist_lin_dxDistributed linearized key
oCgrid_dist_testing< dim >
oCgrid_key< p >
oCgrid_key_1< p >
oCgrid_key_2< p >
oCgrid_key_3< p >
oCgrid_key_4< p >
oCgrid_key_c3< p >
oCgrid_key_d< dim, p >Grid_key_d is the key to access any element in the grid
oCgrid_key_dx< dim >Grid_key_dx is the key to access any element in the grid
oCgrid_key_dx< Decomposition::dims >
oCgrid_key_dx< Sys_eqs::dims >
oCgrid_key_dx_expression< dim, exp >Expression template for grid_key_dx
oCgrid_key_dx_expression< dim, grid_key_dx_sub< dim, exp1, exp2 > >
oCgrid_key_dx_expression< dim, grid_key_dx_sum< dim, exp1, exp2 > >
oCgrid_key_dx_iterator< dim, stencil >
oCgrid_key_dx_iterator< dim >
oCgrid_key_dx_iterator< dim, no_stencil >
oCgrid_key_dx_iterator_hilbert< dim >
oCgrid_key_dx_iterator_stencil< dim, Np >
oCgrid_key_dx_iterator_sub< 0, warn >
oCgrid_key_dx_rEmulate grid_key_dx with runtime dimensionality
oCgrid_skin_iterator_bc< dim >
oCgrid_skin_iterator_bc< Decomposition::dims >
oCgrid_sm< N, T >Declaration grid_sm
oCgrid_sm< dim, scalar< size_t > >
oCgrid_sm< dim, T >
oCgrid_sm< dim, void >
oCgrid_sm< last::dims, void >
oCgrid_sm< Sys_eqs::dims, void >
oCgrid_unpack_selector_with_prp< result, T, device_grid, Memory >Unpack selector
oCgrid_unpack_selector_with_prp< true, T, device_grid, Memory >Unpack selector
oCgrid_unpack_with_prp< op, T, device_grid, Memory >Unpack selector
oCGridRawReader< dim, T, idx_type >
oCopenfpm::grow_policy_doubleGrow policy define how the vector should grow every time we exceed the size
oCopenfpm::grow_policy_identityGrow policy define how the vector should grow every time we exceed the size
oCopenfpm::grow_policy_pageGrow policy define how the vector should grow every time we exceed the size
oCH5_prop_out< ele_v, has_name >This class is a functor for "for_each" algorithm
oCH5_prop_out< ele_v, false >This class is a functor for "for_each" algorithm
oCH5_write< T, pid, V >Write an HDF5 dataset in case of scalars and vectors
oCH5_write< T[N1], pid, V >Partial specialization for N=1 1D-Array
oCH5_write< T[N1][N2], pid, V >Partial specialization for N=2 2D-Array
oCH5_write< T[N1][N2][N3], pid, V >Partial specialization for N=3
oCH5_write< T[N1][N2][N3][N4], pid, V >Partial specialization for N=4
oChas_max_prop< T, hvt >
oChas_max_prop< T, false >
oChas_pack_agg< T, prp >Return if true the aggregate type T has a property that has a complex packing(serialization) method
oChas_pack_agg_impl< T, N, result_p, vprp >These set of classes generate an array definition at compile-time
oChas_pack_agg_impl< T, 0, result_p, vprp >Terminator of the variadic template
oChas_pack_encap< T, prp >
oChas_pack_gen< T, sel >It return true if the object T require complex serialization
oChas_pack_gen< T, false >It return true if the object T require complex serialization
oChas_val< int, T >Evaluate the constant field function
oChas_val< HAS_VAL, T >Evaluate the constant field function
oCstd::hash< gid >
oCstd::hash< lid >
oCstd::hash< rid >
oCHDF5_reader< type >
oCHDF5_reader< GRID_DIST >
oCHDF5_reader< VECTOR_DIST >
oCHDF5_writer< type >
oCHDF5_writer< GRID_DIST >
oCHDF5_writer< VECTOR_DIST >
oCHDF5_XdmfWriter< imp >
oCHDF5_XdmfWriter< H5_POINTSET >HDF5 writer for a point set
oCHyperCube< dim >This class calculate elements of the hyper-cube
oCHyperCube< subdim >
oCi_box_id< dim >It store a box, its unique id and the sub-domain from where it come from
oCi_lbox_grid< dim >Local Internal ghost box
oCi_lbox_id< dim >It store an internal ghost box, the linked external ghost box and the sub-domain from where it come from as internal ghost box
oCie_ghost< dim, T >Structure that store and compute the internal and external local ghost box
oCie_loc_ghost< dim, T >Structure that store and compute the internal and external local ghost box
oCVcluster::index_gen< T >
oCVcluster::index_gen< index_tuple< prp...> >Process the receive buffer using the specified properties (meta-function)
oCindex_tuple<>These set of classes generate an array definition at compile-time
oCinit_prop< Np, vector >This class is a functor for "for_each" algorithm
oCinte_calc_impl< vector, kernel >Calculate the interpolation for one point
oCinte_template< np, prp_g, prp_v, m2p_or_p2m >Class that select the operation to do differently if we are doing Mesh to particle (m2p) or particle to mesh (p2m)
oCinte_template< np, prp_g, prp_v, inte_m2p >Class that select the operation to do differently if we are doing Mesh to particle (m2p) or particle to mesh (p2m)
oCinter_memc< Seq >This class convert a boost::mpl::fusion/vector to a boost::mpl::fusion/vector with memory_c interleaved
oCinterp_ele< Tdst, Grid_dst, Grid_src, nst_pos >This class is a functor for "for_each" algorithm
oCinterp_ele_sca_array< copy_type, Tsrc, Tdst, Grid_src, Grid_dst, sa >Add scalar elements
oCinterp_ele_sca_array< copy_type, Tsrc, Tdst, Grid_src, Grid_dst, 1 >Add 1D array elements
oCinterp_points< dim, v_prp_id, v_prp_type >This class is a functor for "for_each" algorithm
oCinterpolate< vector, grid, kernel >Main class for interpolation Particle to mest p2m and Mesh to particle m2p
oCip_box_grid< dim >Per-processor Internal ghost box
oCis_csv_writable< T >Indicate if the property T is writable in CSV
oCis_csv_writable< bool >Indicate if the property T is writable in CSV
oCis_csv_writable< char >Indicate if the property T is writable in CSV
oCis_csv_writable< double >Indicate if the property T is writable in CSV
oCis_csv_writable< float >Indicate if the property T is writable in CSV
oCis_csv_writable< int >Indicate if the property T is writable in CSV
oCis_csv_writable< long int >Indicate if the property T is writable in CSV
oCis_csv_writable< short >Indicate if the property T is writable in CSV
oCis_csv_writable< unsigned char >Indicate if the property T is writable in CSV
oCis_csv_writable< unsigned int >Indicate if the property T is writable in CSV
oCis_csv_writable< unsigned long int >Indicate if the property T is writable in CSV
oCis_csv_writable< unsigned short >Indicate if the property T is writable in CSV
oCis_grid_staggered< T, has_gt >Is_grid_staggered analyse T if it has a property grid_type defined and indicate that the grid is staggered
oCis_grid_staggered< T, false >Is_grid_staggered analyse T if it has a property that define the type of grid
oCis_initialized< T >
oCis_initialized< openfpm::vector< T > >
oCis_typedef_and_data_same< cond, T >Check if T::type and T.data has the same type
oCis_typedef_and_data_same< false, T >
oCis_vtk_writable< T >Check for T to be writable
oCis_vtk_writable< bool >Check bool
oCis_vtk_writable< char >Check char
oCis_vtk_writable< double >Check double
oCis_vtk_writable< float >Check float
oCis_vtk_writable< int >Check int
oCis_vtk_writable< long int >Check long int
oCis_vtk_writable< short >Check short
oCis_vtk_writable< unsigned char >Check unsigned char
oCis_vtk_writable< unsigned int >Check unsigned int
oCis_vtk_writable< unsigned long int >Check unsigned long int
oCis_vtk_writable< unsigned short >Check unsigned short
oCIterator_g_const
oCpetsc_solver< double >::itErrorContain the infinity norm of the residual at each iteration
oCkey< T >This class is a trick to indicate the compiler a specific specialization pattern
oCFDScheme< Sys_eqs >::key_and_eqEquation id + space position
oCKillParticleOut of bound policy it detect out of bound particles and decide what to do
oCKillParticleWithWarningOut-of-bound policy kill the particle but print a warning
oCLap< arg, Sys_eqs, impl >Laplacian second order on h (spacing)
oCLap< arg, Sys_eqs, CENTRAL >Laplacian second order approximation CENTRAL Scheme
oCLap< arg, Sys_eqs, CENTRAL_SYM >Laplacian second order approximation CENTRAL Scheme (with central derivative in the single)
oCLap_PSE< dim, T, ord, impl >Implementation of the Laplacian kernels for PSE
oCLap_PSE< 1, T, 2, KER_GAUSSIAN >
oCLap_PSE< 1, T, 4, KER_GAUSSIAN >
oCLap_PSE< 1, T, 6, KER_GAUSSIAN >
oCLap_PSE< 1, T, 8, KER_GAUSSIAN >
oClBox_dom< dim, T >Case for local ghost box
oCCartDecomposition< dim, T, Memory, Distribution >::lc_processor_idClass to select the returned id by ghost_processorID
oClid
oClid_nn[Definition of the system]
oClid_nn_3d_eigenSpecify the general caratteristic of system to solve
oClid_nn_3d_petsc
oCln_force
oCln_potential
oCMatLabWriter< dim, T >This class is able to save grid into tiff files
oCMatrix< dim, T >This class implement an NxN (dense) matrix
oCmax_prop_nn< T, has_max_prop >
oCmax_prop_nn< T, false >
oCMem_balClass for BALANCED cell list implementation
oCMem_fastIt is a class that work like a vector of vector
oCmem_get< p, layout, data_type, g1_type, key_type, sel >Case memory_traits_lin
oCmem_get< p, layout, data_type, g1_type, key_type, 1 >Case memory_traits_inte
oCmem_geto< dim, T, layout, data_type, g1_type, key_type, sel >Case memory_traits_lin
oCmem_geto< dim, T, layout, data_type, g1_type, key_type, 1 >Case memory_traits_inte
oCMem_mwClass for MEMORY-WISE cell list implementation
oCmem_reference< T >Metafunction take T and return a reference
oCmem_setext< grid_type, S, layout, data_type, sel >Case memory_traits_lin
oCmem_setext< grid_type, S, layout, data_type, 1 >Case memory_traits_inte
oCmem_setm< S, layout, data_type, g1_type, sel >Case memory_traits_lin
oCmem_setm< S, layout, data_type, g1_type, 1 >Case memory_traits_inte
oCmem_swap< T, layout, data_type, grid_type, sel >Case memory_traits_lin
oCmem_swap< T, layout, data_type, grid_type, 1 >Case memory_traits_inte
oCmemory
oCmemory_array< T >This class give a representation to a chunk or memory
oCmemory_c< T, D >This class is a container for the memory interface like HeapMemory CudaMemory
oCmemory_c< multi_array< T >, D >Specialization of memory_c for multi_array
oCmemory_thrust_c< T >This class is a container for the memory interface
oCmemory_traits_inte< T >Transform the boost::fusion::vector into memory specification (memory_traits)
oCmemory_traits_lin< T >Transform the boost::fusion::vector into memory specification (memory_traits)
oCmemory_traits_lin_type< T, is_agg >Small meta-function to get the type of the memory
oCmemory_traits_lin_type< T, false >Small meta-function to get the type of the memory
oCmerge_< Tdst, Tsrc >This structure define the operation add to use with copy general
oCMetisDistribution< dim, T >::met_sub_wSub-domain list and weight
oCmeta_compare< T >This class compare general objects
oCmeta_compare< T[N1]>Partial specialization for N=1 1D-Array
oCmeta_compare< T[N1][N2]>Partial specialization for N=2 2D-Array
oCmeta_compare< T[N1][N2][N3]>Partial specialization for N=3
oCmeta_copy< T >This class copy general objects
oCmeta_copy< T[N1]>Partial specialization for N=1 1D-Array
oCmeta_copy< T[N1][N2]>Partial specialization for N=2 2D-Array
oCmeta_copy< T[N1][N2][N3]>Partial specialization for N=3
oCmeta_copy< T[N1][N2][N3][N4]>Partial specialization for N=4
oCmeta_copy< T[N1][N2][N3][N4][N5]>Partial specialization for N=5
oCmeta_copy< T[N1][N2][N3][N4][N5][N6]>Partial specialization for N=6
oCmeta_copy< T[N1][N2][N3][N4][N5][N6][N7]>Partial specialization for N=7
oCmeta_copy< T[N1][N2][N3][N4][N5][N6][N7][N8]>Partial specialization for N=8
oCmeta_copy< T[N1][N2][N3][N4][N5][N6][N7][N8][N9]>Partial specialization for N=9
oCmeta_copy< T[N1][N2][N3][N4][N5][N6][N7][N8][N9][N10]>Partial specialization for N=10
oCmeta_copy_d< Tsrc, Tdst >Copy for a source object to a destination
oCmeta_copy_d< Tsrc[N1], Tdst >Partial specialization for N=1 1D-Array
oCmeta_copy_d< Tsrc[N1][N2], Tdst >Partial specialization for N=2 2D-Array
oCmeta_copy_op< op, T >This class copy general objects applying an operation
oCmeta_copy_op< op, T[N1]>Partial specialization for N=1 1D-Array
oCmeta_copy_op< op, T[N1][N2]>Partial specialization for N=2 2D-Array
oCmeta_copy_op< op, T[N1][N2][N3]>Partial specialization for N=3
oCmeta_prop< I, ele_g, St, T, is_writable >This class is an helper to create properties output from scalar and compile-time array elements
oCmeta_prop< I, ele_g, St, T, false >Specialication when is not writable
oCmeta_prop< I, ele_g, St, T[N1], is_writable >Partial specialization for N=1 1D-Array
oCmeta_prop< I, ele_g, St, T[N1][N2], is_writable >Partial specialization for N=2 2D-Array
oCmeta_raw_read< dim, Tg, Tr, i >This is the scalar case
oCmeta_raw_read< dim, Tg, Tr[nv], i >This is the vector case
oCMetaFunc< index, N >[Metafunction definition]
oCVcluster::MetaFuncOrd< index, N >Metafunction
oCMetaFuncOrd< index, N >
oCMetis< Graph >Helper class to define Metis graph
oCMetis< Graph_CSR< nm_v, nm_e > >
oCMetis_graphMetis graph structure
oCMetisDistribution< dim, T >Class that distribute sub-sub-domains across processors using Metis Library
oCminus< arg, Sys_eqs >It ancapsulate the minus operation
oCModelCustomModel for Dynamic load balancing
oCModelCustom2Second model for dynamic load balancing
oCModelLinLinear model
oCModelSquareLinear model
oCmp4_kernel< st >
oCMPI_IAllGatherW< T >General recv for vector of
oCMPI_IAllGatherW< char >Specialization for vector of char
oCMPI_IAllGatherW< double >Specialization for vector of double
oCMPI_IAllGatherW< float >Specialization for vector of float
oCMPI_IAllGatherW< int >Specialization for vector of integer
oCMPI_IAllGatherW< long int >Specialization for vector of long int
oCMPI_IAllGatherW< short >Specialization for vector of short
oCMPI_IAllGatherW< size_t >Specialization for vector of size_t
oCMPI_IAllGatherW< unsigned char >Specialization for vector of unsigned char
oCMPI_IAllGatherW< unsigned int >Specialization for vector of unsigned integer
oCMPI_IAllGatherW< unsigned short >Specialization for vector of short
oCMPI_IAllGatherWBSet of wrapping classing for MPI_Irecv
oCMPI_IallreduceW< T >Set of wrapping classing for MPI_Iallreduce
oCMPI_IallreduceW< char >Specialization for char
oCMPI_IallreduceW< double >Specialization for double
oCMPI_IallreduceW< float >Specialization for float
oCMPI_IallreduceW< int >Specialization for integer
oCMPI_IallreduceW< long int >Specialization for size_t
oCMPI_IallreduceW< short >Specialization for short
oCMPI_IallreduceW< size_t >Specialization for size_t
oCMPI_IallreduceW< unsigned char >Specialization for char
oCMPI_IallreduceW< unsigned int >Specialization for unsigned integer
oCMPI_IallreduceW< unsigned short >Specialization for short
oCMPI_IBcastW< T >General recv for vector of
oCMPI_IBcastW< char >Specialization for char
oCMPI_IBcastW< double >Specialization for double
oCMPI_IBcastW< float >Specialization for float
oCMPI_IBcastW< int >Specialization for vector of integer
oCMPI_IBcastW< long int >Specialization for size_t
oCMPI_IBcastW< short >Specialization for short
oCMPI_IBcastW< size_t >Specialization for size_t
oCMPI_IBcastW< unsigned char >Specialization for char
oCMPI_IBcastW< unsigned int >Specialization for unsigned integer
oCMPI_IBcastW< unsigned short >Specialization for short
oCMPI_IBcastWBSet of wrapping classing for MPI_Irecv
oCMPI_IrecvW< T >General recv for vector of
oCMPI_IrecvW< char >Specialization for char
oCMPI_IrecvW< double >Specialization for double
oCMPI_IrecvW< float >Specialization for float
oCMPI_IrecvW< int >Specialization for vector of integer
oCMPI_IrecvW< long int >Specialization for size_t
oCMPI_IrecvW< short >Specialization for short
oCMPI_IrecvW< size_t >Specialization for size_t
oCMPI_IrecvW< unsigned char >Specialization for char
oCMPI_IrecvW< unsigned int >Specialization for unsigned integer
oCMPI_IrecvW< unsigned short >Specialization for short
oCMPI_IrecvWBSet of wrapping classing for MPI_Irecv
oCMPI_IsendW< T, Mem, gr >General send for a vector of any type
oCMPI_IsendW< char, Mem, gr >Specialization for char
oCMPI_IsendW< double, Mem, gr >Specialization for double
oCMPI_IsendW< float, Mem, gr >Specialization for float
oCMPI_IsendW< int, Mem, gr >Specialization for vector of integer
oCMPI_IsendW< long int, Mem, gr >Specialization for size_t
oCMPI_IsendW< short, Mem, gr >Specialization for short
oCMPI_IsendW< size_t, Mem, gr >Specialization for size_t
oCMPI_IsendW< unsigned char, Mem, gr >Specialization for char
oCMPI_IsendW< unsigned int, Mem, gr >Specialization for unsigned integer
oCMPI_IsendW< unsigned short, Mem, gr >Specialization for short
oCMPI_IsendWBSet of wrapping classing for MPI_Isend
oCmul< expr >It model an expression expr1 * expr2
oCmul_inte< T >Multiply the src by coeff for several types T
oCmul_inte< T[N1]>Multiply the src by coeff for several types T
oCmul_inte< T[N1][N2]>Multiply the src by coeff for several types T
oCmult< T, N >This class multiply all the elements in a boost::mpl::vector excluding the first element
oCmult< T, 1 >
oCmulti_array< T >This class is a trick to indicate the compiler a specific specialization pattern
oCmy_struct
oCN_box< dim, T >
oCne_cp
oCnm_eSub-domain edge graph node
oCnm_part_eReduced edge graph node
oCnm_part_vReduced sub-domain vertex graph node
oCnm_v
oCnn_prcs< dim, T >This class store the adjacent processors and the adjacent sub_domains
oCNNType< dim, T, CellListImpl, PartIt, type, local_index >Get the neighborhood iterator based on type
oCNNType< dim, T, CellListImpl, PartIt, VL_CRS_SYMMETRIC, local_index >Get the neighborhood iterator based on type
oCNNType< dim, T, CellListImpl, PartIt, VL_SYMMETRIC, local_index >Get the neighborhood iterator based on type
oCNNType< dim, T, CellListImpl, PartIt, WITH_RADIUS, local_index >Get the neighborhood iterator based on type
oCNNTypeM< dim, T, CellListImpl, PartIt, type >Get the neighborhood iterator based on type
oCNNTypeM< dim, T, CellListImpl, PartIt, VL_CRS_SYMMETRIC >Get the neighborhood iterator based on type
oCNNTypeM< dim, T, CellListImpl, PartIt, VL_SYMMETRIC >Get the neighborhood iterator based on type
oCno_edgeClass with no edge
oCno_fieldStub field
oCno_stencilNo stencil
oCno_transform< dim, T >No transformation
oCNoCheckClass to check if the edge can be created or not
oCnode_cp
oCnoPointers_sequence< v, prp >It return a boost::mpl::vector of integers where each integer identify one object without the method "noPointers"
oCnoPointers_sequence_impl< v, p1, prp >Implementation of noPointer_sequence_impl
oCnoPointers_sequence_impl< v, p1 >Implementation of noPointer_sequence_impl
oCnot_on_testNot on testing mode
oCNothingOut-of-bound policy do nothing
oCnumber_prop< T, np >
oCnumber_prop< T, 0 >Return the number of properties the type T has
oCobject< v >This is a container to create a general object
oCobject_creator< v, prp >It create a boost::fusion vector with the selected properties
oCobject_creator< v >Specialization when no properties are passed
oCobject_creator_impl< v, vc, prp >Implementation of object creator
oCobject_creator_impl< v, vc, p1, prp...>Implementation of object creator
oCobject_creator_impl< v, vc, prp >Implementation of object creator
oCobject_s_di< v_src, v_dst, type_copy, prp >It copy the properties from one object to another
oCobject_s_di< v_src, v_dst, OBJ_ENCAP, prp...>It copy the properties from one object to another
oCobject_s_di< v_src, v_dst, OBJ_NORMAL, prp...>Given a set of properties for the destination (0,1,3,5) it copy the source properties (0,1,2,3)
oCobject_s_di_e< v_src, v_dst, prp >This class is a functor for "for_each" algorithm
oCobject_s_di_e_op< op, v_src, v_dst, prp >This class is a functor for "for_each" algorithm
oCobject_s_di_f< v_src, v_dst, prp >This class is a functor for "for_each" algorithm
oCobject_s_di_f_op< op, v_src, v_dst, prp >This class is a functor for "for_each" algorithm
oCobject_s_di_op< op, v_src, v_dst, type_copy, prp >It copy the properties from one object to another applying an operation
oCobject_s_di_op< op, v_src, v_dst, OBJ_ENCAP, prp...>It copy the properties from one object to another applying an operation
oCobject_s_di_op< op, v_src, v_dst, OBJ_NORMAL, prp...>Given a set of properties for the destination (0,1,3,5) it copy the source properties (0,1,2,3) applying an operation
oCobject_si_d< v_src, v_dst, type_copy, prp >It copy the properties from one object to another
oCobject_si_d< v_src, v_dst, OBJ_ENCAP >
oCobject_si_d< v_src, v_dst, OBJ_ENCAP, prp...>It copy the properties from one object to another
oCobject_si_d< v_src, v_dst, OBJ_NORMAL, prp...>It copy the properties from one object to another
oCobject_si_d_e< v_src, v_dst, prp >This class is a functor for "for_each" algorithm
oCobject_si_d_f< v_src, v_dst, prp >This class is a functor for "for_each" algorithm
oCon_test[Constant fields struct definition]
oCop_ssend_gg_recv_mergeHelper class to merge data
oCop_ssend_gg_recv_merge_impl< sr >Helper class to merge data without serialization
oCop_ssend_gg_recv_merge_impl< true >Helper class to merge data with serialization
oCop_ssend_recv_add< op >Helper class to add data
oCop_ssend_recv_add_sr< sr >Helper class to add data without serialization
oCop_ssend_recv_add_sr< true >Helper class to add data with serialization
oCop_ssend_recv_merge< op >Helper class to merge data
oCop_ssend_recv_merge_impl< sr, op >Helper class to merge data without serialization
oCop_ssend_recv_merge_impl< true, op >Helper class to merge data with serialization
oCmemory_c< multi_array< T >, D >::ordering< index, N >In combination with generate_array is used to produce array at compile-time
oCp_box< dim, T >It store all the boxes of the near processors in a linear array
oCopenfpm::vector< T, HeapMemory, typename memory_traits_lin< T >::type, memory_traits_lin, grow_policy_double, STD_VECTOR >::pack_cond< cond, T1, Memory1, prp >Structures that do a nested packing, depending on the existence of 'pack' function inside of the object
oCopenfpm::vector< T, Memory, layout, layout_base, grow_p, OPENFPM_NATIVE >::pack_cond< cond, T1, Memory1, prp >Structures that do a nested packing, depending on the existence of 'pack()' function inside the object
oCvector< T, HeapMemory, typename memory_traits_lin< T >::type, memory_traits_lin, grow_policy_double, STD_VECTOR >::pack_cond< cond, T1, Memory1, prp >Structures that do a nested packing, depending on the existence of 'pack' function inside of the object
oCopenfpm::vector< T, HeapMemory, typename memory_traits_lin< T >::type, memory_traits_lin, grow_policy_double, STD_VECTOR >::pack_cond< true, T1, Memory1, prp...>Structures that do a nested packing, depending on the existence of 'pack' function inside of the object
oCopenfpm::vector< T, Memory, layout, layout_base, grow_p, OPENFPM_NATIVE >::pack_cond< true, T1, Memory1, prp...>Structures that do a nested packing, depending on the existence of 'pack()' function inside the object
oCvector< T, HeapMemory, typename memory_traits_lin< T >::type, memory_traits_lin, grow_policy_double, STD_VECTOR >::pack_cond< true, T1, Memory1, prp...>Structures that do a nested packing, depending on the existence of 'pack' function inside of the object
oCPack_selector< T >Pack selector
oCPack_selector_impl< T, is_foundamental >It is not a fundamental type
oCPack_selector_impl< T, true >Select the primitive packing
oCPack_selector_known_type_impl< T, known_type >Pack selector for unknown type
oCPack_selector_known_type_impl< T, HAS_PACKER >
oCPack_selector_known_type_impl< T, IS_ENCAP >
oCPack_selector_known_type_impl< T, IS_GRID >
oCPack_selector_unknown_type_impl< T, has_noPointers >Pack selector for unknown type
oCPack_selector_unknown_type_impl< T, false >
oCopenfpm::vector< T, Memory, layout, layout_base, grow_p, OPENFPM_NATIVE >::pack_simple_cond< sel, prp >These structures serialize a simple (no "pack()" inside) object
oCgrid_base_impl< dim, T, S, layout_, layout_base >::pack_simple_cond< sel, prp >
oCgrid_base_impl< dim, T, S, layout_, layout_base >::pack_simple_cond< true, prp...>
oCopenfpm::vector< T, Memory, layout, layout_base, grow_p, OPENFPM_NATIVE >::pack_simple_cond< true, prp...>These structures serialize a simple (no "pack()" inside) object
oCPack_statPacking status object
oCpack_unpack_cond_with_prp< cond, op, T, S, prp >There is max_prop inside
oCPacker< T, Mem, pack_type >Packing class
oCPacker< T, Mem, PACKER_ARRAY_PRIMITIVE >Packer for primitives
oCPacker< T, Mem, PACKER_ENCAP_OBJECTS >
oCPacker< T, Mem, PACKER_GENERAL >Packer class for vectors
oCPacker< T, Mem, PACKER_GRID >Packer for grids and sub-grids
oCPacker< T, Mem, PACKER_OBJECTS_WITH_POINTER_CHECK >Packer class for objects
oCPacker< T, Mem, PACKER_OBJECTS_WITH_WARNING_POINTERS >Packer for objects, with impossibility to check for internal pointers
oCPacker< T, Mem, PACKER_PRIMITIVE >Packer for primitives
oCopenfpm::vector< T, HeapMemory, typename memory_traits_lin< T >::type, memory_traits_lin, grow_policy_double, STD_VECTOR >::packMem_cond< cond, T1, prp >Structures that calculate memory for an object, depending on the existence of 'packMem' function inside the object
oCvector< T, HeapMemory, typename memory_traits_lin< T >::type, memory_traits_lin, grow_policy_double, STD_VECTOR >::packMem_cond< cond, T1, prp >Structures that calculate memory for an object, depending on the existence of 'packMem' function inside the object
oCopenfpm::vector< T, Memory, layout, layout_base, grow_p, OPENFPM_NATIVE >::packMem_cond< cond, T1 >Structures that calculate how many bytes are required to serialize an object
oCopenfpm::vector< T, Memory, layout, layout_base, grow_p, OPENFPM_NATIVE >::packMem_cond< true, T1 >Structures that calculate memory for an object, depending on the existence of 'packMem()'
oCopenfpm::vector< T, HeapMemory, typename memory_traits_lin< T >::type, memory_traits_lin, grow_policy_double, STD_VECTOR >::packMem_cond< true, T1, prp...>Structures that calculate memory for an object, depending on the existence of 'packMem' function inside the object
oCvector< T, HeapMemory, typename memory_traits_lin< T >::type, memory_traits_lin, grow_policy_double, STD_VECTOR >::packMem_cond< true, T1, prp...>Structures that calculate memory for an object, depending on the existence of 'packMem' function inside the object
oCopenfpm::vector< T, HeapMemory, typename memory_traits_lin< T >::type, memory_traits_lin, grow_policy_double, STD_VECTOR >::packRequest_cond< cond, T1, prp >Structures that do a pack request, depending on the existence of 'packRequest' function inside of the object
oCvector< T, HeapMemory, typename memory_traits_lin< T >::type, memory_traits_lin, grow_policy_double, STD_VECTOR >::packRequest_cond< cond, T1, prp >Structures that do a pack request, depending on the existence of 'packRequest' function inside of the object
oCvector< T, HeapMemory, typename memory_traits_lin< T >::type, memory_traits_lin, grow_policy_double, STD_VECTOR >::packRequest_cond< true, T1, prp...>Structures that do a pack request, depending on the existence of 'packRequest' function inside of the object
oCopenfpm::vector< T, HeapMemory, typename memory_traits_lin< T >::type, memory_traits_lin, grow_policy_double, STD_VECTOR >::packRequest_cond< true, T1, prp...>Structures that do a pack request, depending on the existence of 'packRequest' function inside of the object
oCParmetis< Graph >Helper class to define Metis graph
oCParmetis< Graph_CSR< nm_v, nm_e > >
oCParmetis_dist_graphMetis graph structure
oCParmetis_graphMetis graph structure
oCParMetisDistribution< dim, T >Class that distribute sub-sub-domains across processors using ParMetis Library
oCParticleIt_CellP< T >
oCParticleIt_Cells< dim, CellListType >This iterator iterate across the particles of a Cell-list following the Cell structure
oCParticleItCRS_Cells< dim, CellListType >This iterator iterate across the particles of a Cell-list following the Cell structure
oCPartItNN< type, dim, vector, CellList >In general different NN scheme like full symmetric or CRS require different iterators over particles this class select the proper one
oCPartItNN< VL_CRS_SYMMETRIC, dim, vector, CellList >In general different NN scheme like full symmetric or CRS require different iterators over particles this class select the proper one
oCperiodicity< dim >
oCpetsc_AMG_reportClass to test AMG solvers
oCpetsc_solver< T >In case T does not match the PETSC precision compilation create a stub structure
oCpetsc_solver< double >This class is able to do Matrix inversion in parallel with PETSC solvers
oCPoint< dim, T >This class implement the point shape in an N-dimensional space
oCPoint2D_test< T >Test structure used for several test
oCPoint< dim, long int >
oCPoint< Grid::dims, St >
oCpoint_expression< T >Main class that encapsulate a constant number used in a point expression
oCpoint_expression< const T[dim]>Specialization for a const array of dimension dim
oCpoint_expression< T[dim]>Specialization for an array of dimension dim as expression
oCpoint_expression_op< orig, exp1, exp2, op >Unknown operation specialization
oCpoint_expression_op< orig, exp1, exp2, POINT_DIV >Division operation
oCpoint_expression_op< orig, exp1, exp2, POINT_MUL >Multiplication operation
oCpoint_expression_op< orig, exp1, exp2, POINT_MUL_POINT >Multiplication operation
oCpoint_expression_op< orig, exp1, exp2, POINT_NORM >Point norm operation
oCpoint_expression_op< orig, exp1, exp2, POINT_NORM2 >Point square norm operation
oCpoint_expression_op< orig, exp1, exp2, POINT_SUB >Subtraction operation
oCpoint_expression_op< orig, exp1, exp2, POINT_SUB_UNI >Expression that subtract two points
oCpoint_expression_op< orig, exp1, exp2, POINT_SUM >Sum operation
oCPoint_orig< T >Definition of a class Point in plain C++ and boost::vector for testing purpose
oCPoint_test< T >Test structure used for several test
oCPoint_test_prp< T >Test structure used for several test
oCPoint_test_scal< T >Point test with only scalar properties
oCpoisson_nn_helm
oCpos_or_propL< vector, prp >Selector for position or properties left side expression
oCpos_or_propL< vector, PROP_POS >Selector for position or properties left side
oCpos_or_propR< vector, prp >Selector for position or properties right side position
oCpos_or_propR< vector, PROP_POS >Selector for position or properties right side
oCpos_v< dim, T >Structure that contain a reference to a vector of particles
oCpos_val< dim, T >
oCprint_warning_on_adjustment< dim >Declaration print_warning_on_adjustment
oCvector_dist_comm< dim, St, prop, Decomposition, Memory >::proc_with_prp< prp_object, prp >Process the particle with properties
oCvector_dist_comm< dim, St, prop, Decomposition, Memory >::proc_without_prpProcess the particle without properties
oCProcess_keys_hilb< dim, CellList >Class for an hilbert order processing of cell keys for CellList_gen implementation
oCProcess_keys_lin< dim, CellList >
oCCartDecomposition< dim, T, Memory, Distribution >::processor_idClass to select the returned id by ghost_processorID
oCprop_out_edge< Graph >This class is a functor for "for_each" algorithm
oCprop_out_g< ele_g, St >This class is a functor for "for_each" algorithm
oCprop_out_v< ele_v, St >This class is a functor for "for_each" algorithm
oCprop_out_vertex< Graph >This class is a functor for "for_each" algorithm
oCprop_output< has_attributes, Graph, i >This class specialize functions in the case the type T has or not defined attributes
oCprop_output< false, Graph, i >This class specialize functions in the case the type T has not defined attributes
oCprop_output_array_scalar_selector_edge< is_array >Property writer for scalar and vector
oCprop_output_array_scalar_selector_edge< true >Property writer for vector
oCprop_output_array_scalar_selector_edge_fill_vertex< is_array >Property writer for scalar and vector, it fill the vertex data (needed for edge representation in vtk)
oCprop_output_array_scalar_selector_edge_fill_vertex< true >Property writer for vector
oCprop_output_array_scalar_selector_vertex< is_array >Property writer for scalar and vector
oCprop_output_array_scalar_selector_vertex< true >Property writer for vector
oCprop_write_out< dim, T >Write the vectror property
oCprop_write_out< 1, T >Write the scalar property
oCpropCheckINF< vector >This class is a functor for "for_each" algorithm
oCpropCheckNAN< vector >This class is a functor for "for_each" algorithm
oCprp_all_zero< T, is_zero, prp >Structure to convert a variadic template into boost::mpl::vector
oCprp_all_zero< T, true, prp... >
oCPSEError
oCptr_info
oCpush_back_op< is_t, is_s, T, S >
oCpush_back_op< false, false, T, S >
oCpush_back_op< false, true, T, S >
oCpush_back_op< true, true, T, S >
oCpush_back_op_neste< bool, T, S >Pack/add function selector
oCpush_back_op_neste< true, T, S >Pack/add function selector
oCpush_back_std_op_neste< bool, T, S >Pack/add function selector
oCpush_back_std_op_neste< true, T, S >
oCPV_cl
oCr_type_dim< op1_dim, op2_dim, op >It return the dimansionality of the operation given the dimensionality of the 2 operators
oCr_type_dim< 1, 1, POINT_DIV >Scalar / scalar = scalar
oCr_type_dim< 1, 1, POINT_MUL >Scalar * scalar = scalar
oCr_type_dim< 1, 1, POINT_SUB >Scalar - scalar = scalar
oCr_type_dim< 1, 1, POINT_SUM >Scalar + scalar = scalar
oCr_type_dim< op1_dim, op2_dim, POINT_MUL_POINT >Point * Point = scalar
oCr_type_p< r, orig >Return type of the expression
oCr_type_p< 1, orig >Return type of the expression
oCraw_read< dim, Tg >This class is a functor for "for_each" algorithm
oCredTemporal buffer for reductions
oCreduce_type< T >In general a reduction of a type T produce a type T
oCreduce_type< double[]>A reduction operation on an array of double is a double
oCreduce_type< float[]>A reduction operation on an array of float is a float
oCreduce_type< int[]>A reduction operation on an array of int is an int
oCremove_attributes_const_ref< T >T_to_memory_c is a metafunction that given T it convert it into
oCreplace_< Tdst, Tsrc >This structure define the operation add to use with copy general
oCRGBRGB color struct
oCrid
oCrval< T, impl >It store one row value of a vector
oCrval< T, EIGEN_RVAL >It store one row value of a vector
oCrval< T, PETSC_RVAL >It store one row value of a vector
oCscalar< T >It define a scalar value compatible with grid_cpu , grid_gpu, vector, graph ..
oCse_class3_vector< Np, dim, T, Decomposition, vector >This class check for inconsistency access
oCDistGraph_CSR< V, E, Memory, layout_v, layout_e, layout_v_base, layout_e_base, grow_p >::SendGraphPackStruct containing the (sub)graph to send
oCseq_traits_impl< Seq >Implementation of seq_traits
oCset_zero< rtype >Meta-function to return a compatible zero-element
oCset_zero< Point< dim, T > >Create a point with all compunent set to zero
oCshift< dim, T >
oCCartDecomposition< dim, T, Memory, Distribution >::shift_idClass to select the returned id by ghost_processorID
oCSimpleRNGSimpleRNG is a simple random number generator based on George Marsaglia's MWC (multiply with carry) generator. Although it is very simple, it passes Marsaglia's DIEHARD series of random number generator tests
oCsolErrorIt contain statistic of the error of the calculated solution
oCpetsc_solver< double >::solv_bench_infoIt contain the benchmark information for each solver
oCspace_key_dx< dim, T >Grid_key_dx is the key to access any element in the grid
oCSpaceDistribution< dim, T >Class that distribute sub-sub-domains across processors using an hilbert curve to divide the space
oCSparseMatrix< T, id_t, DEFAULT_MATRIX >Sparse Matrix implementation
oCSparseMatrix< T, id_t, EIGEN_BASE >
oCSparseMatrix< T, id_t, PETSC_BASE >Sparse Matrix implementation, that map over Eigen
oCSphere< dim, T >This class implement the Sphere concept in an N-dimensional space
oCstag_create_and_add_grid< dim, st_grid, St >It create separated grid for each properties to write them into a file
oCstag_set_position< dim, v, has_pM >This class is a functor for "for_each" algorithm
oCstag_set_position< dim, v, false >This class is a functor for "for_each" algorithm
oCstencil_offset_compute< dim, Np >Structure for stencil iterator
oCstub_or_real< T, dims, stype, decomposition, stub >In case of testing return a stub grid
oCstub_or_real< last, last::dims, typename last::stype, typename last::b_grid::decomposition::extended_type >
oCstub_or_real< T, dims, stype, decomposition, false >Case when we are not on testing
oCgrid_dist_iterator_sub< dim, device_grid >::sub_set
oCsubsub< dim >Sub-sub-domain
oCsubsub_lin< dim >Linearized version of subsub
oCsum< expr >It model an expression expr1 + ... exprn
oCsum_functor_value< v_expr >Sum functor value
oCsys_nn
oCsys_pp
oCsyss_nn
oCsyss_pp
oCSystem< dim, nvf, ncf, eqs >System of equations
oCt_to_memory_c< T >Meta-function t_to_memory_c
oCt_to_memory_c_impl< T >Partial specialization for scalar N=0
oCt_to_memory_c_impl< T[N1]>Partial specialization for N=1
oCt_to_memory_c_impl< T[N1][N2]>Partial specialization for N=2
oCt_to_memory_c_impl< T[N1][N2][N3]>Partial specialization for N=3
oCt_to_memory_c_impl< T[N1][N2][N3][N4]>Partial specialization for N=4
oCt_to_memory_c_impl< T[N1][N2][N3][N4][N5]>Partial specialization for N=5
oCt_to_memory_c_impl< T[N1][N2][N3][N4][N5][N6]>Partial specialization for N=6
oCt_to_memory_c_impl< T[N1][N2][N3][N4][N5][N6][N7]>Partial specialization for N=7
oCt_to_memory_c_impl< T[N1][N2][N3][N4][N5][N6][N7][N8]>Partial specialization for N=8
oCt_to_memory_c_impl< T[N1][N2][N3][N4][N5][N6][N7][N8][N9]>Partial specialization for N=9
oCt_to_memory_c_impl< T[N1][N2][N3][N4][N5][N6][N7][N8][N9][N10]>Partial specialization for N=10
oCtensor< T, s1, s2, s3 >
oCtensor< int, s1, s2, s3 >
oCtest_box_vpack
oCtest_grid_type_no_def
oCtest_grid_type_normal
oCtest_grid_type_staggered[Define structures]
oCtest_has_attributes[Check has_posMask struct definition]
oCtest_has_max_propTest type for has_max_prop
oCtest_has_no_max_propTest type for has_max_prop
oCtest_has_posMask[Check has_posMask struct definition]
oCtest_no_attributes
oCtest_no_has_posMaskTest type for has_posMask
oCTiffWriter< dim, T >This class is able to save grid into tiff files
oCtimerClass for cpu time benchmarking
oCTimesTime structure for statistical purposes
oCto_boost_vmpl< id >
oCto_boost_vmpl<>Terminator for to_boost_mpl with last parameter
oCto_boost_vmpl_impl< a, id >Implementation of to_boost_vmpl
oCto_boost_vmpl_impl< a >Terminator for to_boost_mpl with last parameter
oCto_int_sequence< N, M >
oCto_variadic_impl< H, c, end, exit >Recursive specialization of to_variadic
oCto_variadic_impl< H, F, L, true >Terminator of to_variadic
oCtoPoint< dim, St >
oCtriplet< T, impl >It store the non zero elements of the matrix
oCtriplet< T, EIGEN_TRIPLET >It store one non-zero element in the sparse matrix
oCtriplet< T, PETSC_BASE >It store one non-zero element in the sparse matrix
oCtrue_type
oCtype_gpu_prop< p, Mem >This class is an helper to get the return type of get for each property
oCtypeCheck< tcheck, foundamental >
oCtypeCheck< tcheck, true >
oCtypeCheck< tcheck[N1], foundamental >
oCtypeCheck< tcheck[N1][N2], foundamental >
oCumfpack_solver< T >Stub when library compiled without eigen
oCumfpack_solver< double >Stub when library compiled without eigen
oCunordered_map
oCopenfpm::vector< T, HeapMemory, typename memory_traits_lin< T >::type, memory_traits_lin, grow_policy_double, STD_VECTOR >::unpack_cond< cond, T1, Memory1, prp >Structures that do a nested unpacking, depending on the existence of 'pack' function inside the object
oCvector< T, HeapMemory, typename memory_traits_lin< T >::type, memory_traits_lin, grow_policy_double, STD_VECTOR >::unpack_cond< cond, T1, Memory1, prp >Structures that do a nested unpacking, depending on the existence of 'pack' function inside the object
oCopenfpm::vector< T, HeapMemory, typename memory_traits_lin< T >::type, memory_traits_lin, grow_policy_double, STD_VECTOR >::unpack_cond< true, T1, Memory1, prp...>Structures that do a nested unpacking, depending on the existence of 'pack' function inside the object
oCvector< T, HeapMemory, typename memory_traits_lin< T >::type, memory_traits_lin, grow_policy_double, STD_VECTOR >::unpack_cond< true, T1, Memory1, prp...>Structures that do a nested unpacking, depending on the existence of 'pack' function inside the object
oCunpack_selector_with_prp< result, T, S >
oCunpack_selector_with_prp< true, T, S >
oCopenfpm::vector< T, Memory, layout, layout_base, grow_p, OPENFPM_NATIVE >::unpack_simple_cond< sel, prp >These structures do an de-serialize a simple object (no pack() inside)
oCgrid_base_impl< dim, T, S, layout_, layout_base >::unpack_simple_cond< sel, prp >
oCgrid_base_impl< dim, T, S, layout_, layout_base >::unpack_simple_cond< true, prp...>
oCopenfpm::vector< T, Memory, layout, layout_base, grow_p, OPENFPM_NATIVE >::unpack_simple_cond< true, prp...>
oCUnpack_statUnpacking status object
oCUnpacker< T, Mem, pack_type >Unpacker class
oCUnpacker< T, Mem, PACKER_ARRAY_PRIMITIVE >
oCUnpacker< T, Mem, PACKER_ENCAP_OBJECTS >Unpacker for encapsulated objects
oCUnpacker< T, Mem, PACKER_GENERAL >Unpacker for vectors
oCUnpacker< T, Mem, PACKER_GRID >Unpacker for grids
oCUnpacker< T, Mem, PACKER_OBJECTS_WITH_POINTER_CHECK >Unpacker class for objects
oCUnpacker< T, Mem, PACKER_OBJECTS_WITH_WARNING_POINTERS >Unpacker for objects with no possibility to check for internal pointers
oCUnpacker< T, Mem, PACKER_PRIMITIVE >Unpacker for primitives
oCut_startBoost unit test fixation (start procedure to call before testing)
oCv_box< vector >
oCv_info
oCV_p< T >Vertex class that encapsulate an object T
oCv_transform< H, L >
oCv_transform_impl< H, F, L, exit, Args >Recursive specialization of v_transform
oCv_transform_impl< H, F, L, true, Args...>Terminator of to_variadic
oCv_transform_two< H, arg0, L >
oCv_transform_two_impl< H, arg0, F, L, exit, Args >Recursive specialization of v_transform in case of metafunction with 2 argument
oCv_transform_two_impl< H, arg0, F, L, true, Args...>Terminator of to_variadic
oCVcluster_baseThis class virtualize the cluster of PC as a set of processes that communicate
oCVcluster_logVcluster log
oCvect_dist_key_dxGrid key for a distributed grid
oCopenfpm::vect_isel< T >It analyze the type given and it select correctly the implementation for vector
oCopenfpm::vector< T, Memory, layout, layout_base, grow_p, impl >Implementation of 1-D std::vector like structure
oCVector< T, DEFAULT_VECTOR >Sparse Matrix implementation stub object when OpenFPM is compiled with no linear algebra support
oCopenfpm::vector< aggregate< size_t, size_t > >
oCopenfpm::vector< aggregate< size_t, size_t, size_t > >
oCopenfpm::vector< AMG_time_err_coars >
oCopenfpm::vector< BHeapMemory >
oCopenfpm::vector< Box< dim, T > >
oCopenfpm::vector< Box_dom< dim, T > >
oCopenfpm::vector< Box_loc_sub< dim, T > >
oCopenfpm::vector< Box_sub< dim, T > >
oCopenfpm::vector< Box_sub_k< dim, T > >
oCopenfpm::vector< cell_grid< Grid > >
oCstd::vector< comb< 0 > >Stub vector specialization
oCopenfpm::vector< comb< dim > >
oCopenfpm::vector< const Grid * >
oCopenfpm::vector< device_grid >
oCopenfpm::vector< DistGraph_CSR::EdgeReq >
oCopenfpm::vector< DistGraph_CSR::SendGraphPack >
oCopenfpm::vector< E >
oCopenfpm::vector< E, Memory, layout_e, layout_e_base, grow_p, openfpm::vect_isel< E >::value >
oCopenfpm::vector< e_box_id< dim > >
oCopenfpm::vector< e_info >
oCopenfpm::vector< e_info, Memory, typename layout_e_base< e_info >::type, layout_e_base, grow_p, openfpm::vect_isel< e_info >::value >
oCopenfpm::vector< e_lbox_grid< dim > >
oCopenfpm::vector< e_lbox_id< dim > >
oCopenfpm::vector< e_map, Memory, typename layout_e_base< e_map >::type, layout_e_base, grow_p, openfpm::vect_isel< e_map >::value >
oCopenfpm::vector< e_map, Memory, typename memory_traits_lin< e_map >::type, layout_e_base, grow_p, openfpm::vect_isel< e_map >::value >
oCopenfpm::vector< ele_g >
oCopenfpm::vector< ele_g< typename pair::first, typename pair::second > >
oCopenfpm::vector< ele_g_st< typename pair::first, typename pair::second > >
oCopenfpm::vector< ele_v >
oCopenfpm::vector< ele_vpp< typename pair::second > >
oCopenfpm::vector< ele_vps< typename pair::first > >
oCopenfpm::vector< ep_box_grid< dim > >
oCopenfpm::vector< GBoxes< Decomposition::dims > >
oCopenfpm::vector< GBoxes< device_grid::dims > >
oCopenfpm::vector< GBoxes< grid_cpu< dim, scalar< size_t > >::dims > >
oCopenfpm::vector< GGraph >
oCopenfpm::vector< grid_cpu< dim, scalar< size_t > > >
oCopenfpm::vector< grid_dist_id_iterator_dec_skin::gp_sub >
oCopenfpm::vector< grid_key_dx< dim > >
oCopenfpm::vector< HeapMemory >
oCopenfpm::vector< i_box_id< dim > >
oCopenfpm::vector< i_lbox_grid< dim > >
oCopenfpm::vector< i_lbox_id< dim > >
oCopenfpm::vector< idx_t >
oCopenfpm::vector< int >
oCopenfpm::vector< ip_box_grid< dim > >
oCopenfpm::vector< itError >
oCopenfpm::vector< lBox_dom< dim, T > >
oCopenfpm::vector< lid >
oCopenfpm::vector< local_index >
oCopenfpm::vector< long >
oCopenfpm::vector< long int >
oCopenfpm::vector< MetisDistribution::met_sub_w >
oCopenfpm::vector< MPI_Request >
oCopenfpm::vector< MPI_Status >
oCopenfpm::vector< nm_e, Memory, layout_e, layout_e_base, grow_p, openfpm::vect_isel< nm_e >::value >
oCopenfpm::vector< nm_v, Memory, layout_v, layout_v_base, grow_p, openfpm::vect_isel< nm_v >::value >
oCopenfpm::vector< openfpm::vector< ::SpaceBox< dim, T > > >
oCopenfpm::vector< openfpm::vector< aggregate< device_grid, SpaceBox< dim, long int > > > >
oCopenfpm::vector< openfpm::vector< aggregate< grid_cpu< dim, scalar< size_t > >, SpaceBox< dim, long int > > > >
oCopenfpm::vector< openfpm::vector< aggregate< size_t, size_t > > >
oCopenfpm::vector< openfpm::vector< Box_proc< dim, T > > >
oCopenfpm::vector< openfpm::vector< gid > >
oCopenfpm::vector< openfpm::vector< idx_t > >
oCopenfpm::vector< openfpm::vector< long unsigned int > >
oCopenfpm::vector< openfpm::vector< size_t > >
oCopenfpm::vector< openfpm::vector< SpaceBox< dim, T > > >
oCopenfpm::vector< openfpm::vector_std< Box< dim, St > > >
oCopenfpm::vector< p_box< dim, T > >
oCopenfpm::vector< PetscInt >
oCopenfpm::vector< PetscScalar >
oCopenfpm::vector< Point< dim, St > >
oCopenfpm::vector< Point< dim, T > >
oCopenfpm::vector< Point< dim, typename Cell::stype > >
oCopenfpm::vector< pos_v< dim, typename Cell::stype > >
oCopenfpm::vector< prop >
oCopenfpm::vector< rid >
oCopenfpm::vector< rval< PetscScalar, PETSC_RVAL >, HeapMemory, typename memory_traits_inte< rval< PetscScalar, PETSC_RVAL > >::type >
oCopenfpm::vector< rval< T, EIGEN_RVAL > >
oCopenfpm::vector< size_t >
oCopenfpm::vector< size_t, Memory, typename layout_v_base< size_t >::type, layout_v_base, grow_p, openfpm::vect_isel< size_t >::value >
oCopenfpm::vector< solv_bench_info >
oCopenfpm::vector< SpaceBox< dim, T > >
oCopenfpm::vector< std::pair< size_t, size_t > >
oCopenfpm::vector< std::string >
oCopenfpm::vector< std::unordered_map< size_t, size_t > >
oCopenfpm::vector< subsub< dim > >
oCopenfpm::vector< subsub_lin< dim > >
oCVector< T, EIGEN_BASE >
oCopenfpm::vector< T, HeapMemory, typename memory_traits_lin< T >::type, memory_traits_lin, grow_policy_double, STD_VECTOR >Implementation of 1-D std::vector like structure
oCvector< T, HeapMemory, typename memory_traits_lin< T >::type, memory_traits_lin, grow_policy_double, STD_VECTOR >Implementation of 1-D std::vector like structure
oCopenfpm::vector< T, Memory, layout, layout_base, grow_p, OPENFPM_NATIVE >Implementation of 1-D std::vector like structure
oCVector< T, PETSC_BASE >PETSC vector for linear algebra
oCopenfpm::vector< T, PtrMemory, typename memory_traits_lin< T >::type, memory_traits_lin, gp, STD_VECTOR >
oCvector< T, PtrMemory, typename memory_traits_lin< T >::type, memory_traits_lin, gp, STD_VECTOR >
oCopenfpm::vector< triplet >
oCopenfpm::vector< triplet< T, PETSC_BASE > >
oCopenfpm::vector< V >
oCopenfpm::vector< V, Memory, layout_v, layout_v_base, grow_p, openfpm::vect_isel< V >::value >
oCopenfpm::vector< v_box< vector > >
oCopenfpm::vector< v_info >
oCopenfpm::vector< v_info, Memory, typename memory_traits_lin< v_info >::type, memory_traits_lin, grow_p, openfpm::vect_isel< v_info >::value >
oCopenfpm::vector< vector< size_t > >
oCopenfpm::vector< void * >
oCopenfpm::vector<::Box< dim, T > >
oCopenfpm::vector<::SpaceBox< dim, size_t > >
oCvector_dist_comm< dim, St, prop, Decomposition, Memory >This class is an helper for the communication of vector_dist
oCvector_dist_expression< prp, vector >Main class that encapsulate a vector properties operand to be used for expressions construction
oCvector_dist_expression< 16384, point >This class represent a constant parameter in a vector expression
oCvector_dist_expression< prp, double >Main class that encapsulate a double constant
oCvector_dist_expression< prp, float >Main class that encapsulate a float constant
oCvector_dist_expression_op< exp1, exp2, op >Unknown operation specialization
oCvector_dist_expression_op< exp1, exp2, VECT_DIV >Division operation
oCvector_dist_expression_op< exp1, exp2, VECT_MUL >Multiplication operation
oCvector_dist_expression_op< exp1, exp2, VECT_SUB >Subtraction operation
oCvector_dist_expression_op< exp1, exp2, VECT_SUM >Sum operation
oCvector_dist_expression_op< exp1, vector_type, VECT_APPLYKER_IN >Apply kernel operation
oCvector_dist_expression_op< exp1, vector_type, VECT_APPLYKER_IN_GEN >Apply kernel operation
oCvector_dist_expression_op< exp1, vector_type, VECT_APPLYKER_IN_SIM >Apply kernel operation
oCvector_dist_expression_op< exp1, vector_type, VECT_SUM_REDUCE >Expression that encapsulate a vector reduction expression
oCvector_dist_expression_op< exp1, void, VECT_SUB_UNI >It take an expression and create the negatove of this expression
oCvector_dist_iteratorIterator that Iterate across particle indexes
oCopenfpm::vector_key_iteratorVector iterator
oCopenfpm::vector_key_iterator_seq< lid >Vector iterator
oCVerletBase
oCVerletList< dim, T, impl, transform, local_index, CellListImpl >Cell list structure
oCVerletList< dim, T, FAST, transform, local_index, CellListImpl >Class for Verlet list implementation
oCVerletNNIterator< dim, Ver >Iterator for the neighborhood of the cell structures
oCvertexSub-domain vertex graph node
oCvertex2
oCvertex3
oCvertex_node< G >This class is a functor for "for_each" algorithm
oCvertex_prop< G >This class is a functor for "for_each" algorithm
oCVoid< typename >Void structure
oCvtk_dims< ObjType, has_dims >If it has not dims property defined the object is considered scalar
oCvtk_dims< ObjType, true >Return the dimansionality of the object
oCvtk_dist_edge_node< G >This class is a functor for "for_each" algorithm
oCvtk_dist_vertex_node< G, attr >This class is a functor for "for_each" algorithm
oCvtk_dist_vertex_node< G, false >This class is a functor for "for_each" algorithm
oCvtk_dist_vertex_node_array_scalar_selector< is_array >
oCvtk_dist_vertex_node_array_scalar_selector< true >
oCvtk_edge_node< G >This class is a functor for "for_each" algorithm
oCvtk_type< T, is_w >Vtk type
oCvtk_type< T, false >Vtk type
oCvtk_vertex_node< G, attr >This class is a functor for "for_each" algorithm
oCvtk_vertex_node< G, false >This class is a functor for "for_each" algorithm
oCvtk_vertex_node_array_scalar_selector< is_array >
oCvtk_vertex_node_array_scalar_selector< true >
oCvtk_write< ele, vtk, has_attributes >Write a property that has attributes
oCvtk_write< ele, vtk, false >Add to the vtk writer the key
oCVTKWriter< Object, imp >
oCVTKWriter< Graph, DIST_GRAPH >
oCVTKWriter< Graph, VTK_GRAPH >
oCVTKWriter< pair, VECTOR_GRIDS >
oCVTKWriter< pair, VECTOR_POINTS >
oCVTKWriter< pair, VECTOR_ST_GRIDS >
oCVTKWriter< vector, VECTOR_BOX >
oCvx
oCwrite_stag< T >Classes to copy each component into a grid and add to the VTKWriter the grid
oCwrite_stag< T[N1]>For each component add a grid fill it, and add to the VTK writer
oCwrite_stag< T[N1][N2]>Partial specialization for N=2 2D-Array
oCz_kernel< st, ord >
oCz_kernel< st, 1 >
oCz_kernel< st, 3 >
oCz_kernel< st, 4 >
\CMem_type