►Nboost | |
►Nmpl | |
►Naux | |
Cfor_each_ref_cpu_impl | |
Cfor_each_ref_cpu_impl< false > | |
Cfor_each_ref_host_impl | |
Cfor_each_ref_host_impl< false > | |
Cfor_each_ref_impl | |
Cfor_each_ref_impl< false > | |
►Nnumeric | |
►Nodeint | |
Cfor_each_prop1 | |
Cfor_each_prop10 | |
Cfor_each_prop11 | |
Cfor_each_prop12 | |
Cfor_each_prop13 | |
Cfor_each_prop14 | |
Cfor_each_prop15 | |
Cfor_each_prop2 | |
Cfor_each_prop3 | |
Cfor_each_prop4 | |
Cfor_each_prop5 | |
Cfor_each_prop6 | |
Cfor_each_prop7 | |
Cfor_each_prop8 | |
Cfor_each_prop9 | |
Cfor_each_prop_resize | |
Cis_resizeable< state_type_1d_ofp > | |
Cis_resizeable< state_type_2d_ofp > | |
Cis_resizeable< state_type_3d_ofp > | |
Cis_resizeable< state_type_4d_ofp > | |
Cis_resizeable< state_type_5d_ofp > | |
Cis_resizeable< state_type_ofpm_impl< 1, state_type > > | |
Cis_resizeable< state_type_ofpm_impl< 2, state_type > > | |
Cis_resizeable< state_type_ofpm_impl< 3, state_type > > | |
Cis_resizeable< state_type_ofpm_impl< 4, state_type > > | |
Cis_resizeable< state_type_ofpm_impl< 5, state_type > > | |
Cis_resizeable< vector_dist_expression< 0, openfpm::vector< aggregate< T > > > > | |
►Cofp_operations | |
Cdefault_rel_error | |
Cmaximum | |
Crel_error | |
Crel_error_l2 | |
Crel_error_l2_2 | |
Crel_error_max | |
Crel_error_max2 | |
Cscale | |
Cscale_sum1 | |
Cscale_sum10 | |
Cscale_sum11 | |
Cscale_sum12 | |
Cscale_sum13 | |
Cscale_sum14 | |
Cscale_sum2 | |
Cscale_sum3 | |
Cscale_sum4 | |
Cscale_sum5 | |
Cscale_sum6 | |
Cscale_sum7 | |
Cscale_sum8 | |
Cscale_sum9 | |
Cscale_sum_swap2 | |
►Cvector_space_algebra_ofp | |
Cfor_each_norm | |
►Cvector_space_algebra_ofp_gpu | |
Cfor_each_norm | |
Cvector_space_norm_inf< state_type_1d_ofp > | |
Cvector_space_norm_inf< state_type_2d_ofp > | |
Cvector_space_norm_inf< state_type_3d_ofp > | |
Cvector_space_norm_inf< state_type_4d_ofp > | |
Cvector_space_norm_inf< state_type_5d_ofp > | |
Cvector_space_norm_inf< state_type_ofpm_impl< 1, state_type > > | |
Cvector_space_norm_inf< state_type_ofpm_impl< 2, state_type > > | |
Cvector_space_norm_inf< state_type_ofpm_impl< 3, state_type > > | |
Cvector_space_norm_inf< state_type_ofpm_impl< 4, state_type > > | |
Cvector_space_norm_inf< state_type_ofpm_impl< 5, state_type > > | |
Carray_openfpm | |
Carray_openfpm< T, 0 > | |
►Ncub | Optional outer namespace(s) |
►CAgentHistogram | AgentHistogram implements a stateful abstraction of CUDA thread blocks for participating in device-wide histogram |
►C_TempStorage | Shared memory type required by this thread block |
CAliasable | |
CTempStorage | Temporary storage type (unionable) |
CAgentHistogramPolicy | < Whether to dequeue tiles from a global work queue |
►CAgentRadixSortDownsweep | AgentRadixSortDownsweep implements a stateful abstraction of CUDA thread blocks for participating in device-wide radix sort downsweep |
CTempStorage | Alias wrapper allowing storage to be unioned |
CAgentRadixSortDownsweepPolicy | < The number of radix bits, i.e., log2(bins) |
►CAgentRadixSortUpsweep | AgentRadixSortUpsweep implements a stateful abstraction of CUDA thread blocks for participating in device-wide radix sort upsweep |
CIterate | |
CIterate< MAX, MAX > | |
CTempStorage | Alias wrapper allowing storage to be unioned |
CAgentRadixSortUpsweepPolicy | < The number of radix bits, i.e., log2(bins) |
►CAgentReduce | AgentReduce implements a stateful abstraction of CUDA thread blocks for participating in device-wide reduction |
C_TempStorage | Shared memory type required by this thread block |
CTempStorage | Alias wrapper allowing storage to be unioned |
►CAgentReduceByKey | AgentReduceByKey implements a stateful abstraction of CUDA thread blocks for participating in device-wide reduce-value-by-key |
C_TempStorage | |
CGuardedInequalityWrapper | |
CTempStorage | |
CAgentReduceByKeyPolicy | < The BlockScan algorithm to use |
CAgentReducePolicy | < Cache load modifier for reading input elements |
►CAgentRle | AgentRle implements a stateful abstraction of CUDA thread blocks for participating in device-wide run-length-encode |
►C_TempStorage | |
►CAliasable | |
CScatterAliasable | |
COobInequalityOp | |
CTempStorage | |
CAgentRlePolicy | < The BlockScan algorithm to use |
►CAgentScan | AgentScan implements a stateful abstraction of CUDA thread blocks for participating in device-wide prefix scan |
C_TempStorage | |
CTempStorage | |
CAgentScanPolicy | < The BlockScan algorithm to use |
►CAgentSegmentFixup | AgentSegmentFixup implements a stateful abstraction of CUDA thread blocks for participating in device-wide reduce-value-by-key |
C_TempStorage | |
CTempStorage | |
CAgentSegmentFixupPolicy | < The BlockScan algorithm to use |
►CAgentSelectIf | AgentSelectIf implements a stateful abstraction of CUDA thread blocks for participating in device-wide selection |
C_TempStorage | |
CTempStorage | |
CAgentSelectIfPolicy | < The BlockScan algorithm to use |
►CAgentSpmv | AgentSpmv implements a stateful abstraction of CUDA thread blocks for participating in device-wide SpMV |
►C_TempStorage | Shared memory type required by this thread block |
CAliasable | |
CMergeItem | Merge item type (either a non-zero value or a row-end offset) |
CTempStorage | Temporary storage type (unionable) |
CAgentSpmvPolicy | < The BlockScan algorithm to use |
►CAlignBytes | Structure alignment |
CPad | |
CAlignBytes< const T > | |
CAlignBytes< const volatile T > | |
CAlignBytes< volatile T > | |
CArgIndexInputIterator | A random-access input wrapper for pairing dereferenced values with their corresponding indices (forming KeyValuePair tuples) |
CArgMax | Arg max functor (keeps the value and offset of the first occurrence of the larger item) |
CArgMin | Arg min functor (keeps the value and offset of the first occurrence of the smallest item) |
CArrayWrapper | A wrapper for passing simple static arrays as kernel parameters |
CBaseTraits | Basic type traits |
CBaseTraits< FLOATING_POINT, true, false, _UnsignedBits, T > | |
CBaseTraits< SIGNED_INTEGER, true, false, _UnsignedBits, T > | |
CBaseTraits< UNSIGNED_INTEGER, true, false, _UnsignedBits, T > | |
►CBinaryOpHasIdxParam | Determine whether or not BinaryOp's functor is of the form bool operator()(const T& a, const T&b) or bool operator()(const T& a, const T&b, unsigned int idx) |
CSFINAE5 | |
CSFINAE6 | |
CSFINAE7 | |
CSFINAE8 | |
►CBlockAdjacentDifference | |
C_TempStorage | Shared memory storage layout type (last element from each thread's input) |
CApplyOp | Specialization for when FlagOp has third index param |
CApplyOp< FlagOp, false > | Specialization for when FlagOp does not have a third index param |
CIterate | Templated unrolling of item comparison (inductive case) |
CIterate< MAX_ITERATIONS, MAX_ITERATIONS > | Templated unrolling of item comparison (termination case) |
CTempStorage | \smemstorage{BlockDiscontinuity} |
►CBlockDiscontinuity | The BlockDiscontinuity class provides collective methods for flagging discontinuities within an ordered set of items partitioned across a CUDA thread block |
C_TempStorage | Shared memory storage layout type (last element from each thread's input) |
CApplyOp | Specialization for when FlagOp has third index param |
CApplyOp< FlagOp, false > | Specialization for when FlagOp does not have a third index param |
CIterate | Templated unrolling of item comparison (inductive case) |
CIterate< MAX_ITERATIONS, MAX_ITERATIONS > | Templated unrolling of item comparison (termination case) |
CTempStorage | \smemstorage{BlockDiscontinuity} |
►CBlockExchange | The BlockExchange class provides collective methods for rearranging data partitioned across a CUDA thread block |
CTempStorage | \smemstorage{BlockExchange} |
►CBlockHistogram | The BlockHistogram class provides collective methods for constructing block-wide histograms from data samples partitioned across a CUDA thread block |
CTempStorage | \smemstorage{BlockHistogram} |
►CBlockHistogramAtomic | The BlockHistogramAtomic class provides atomic-based methods for constructing block-wide histograms from data samples partitioned across a CUDA thread block |
CTempStorage | Shared memory storage layout type |
►CBlockHistogramSort | The BlockHistogramSort class provides sorting-based methods for constructing block-wide histograms from data samples partitioned across a CUDA thread block |
C_TempStorage | Shared memory |
CDiscontinuityOp | |
CTempStorage | Alias wrapper allowing storage to be unioned |
►CBlockLoad | The BlockLoad class provides collective data movement methods for loading a linear segment of items from memory into a blocked arrangement across a CUDA thread block |
CLoadInternal | Load helper |
CLoadInternal< BLOCK_LOAD_DIRECT, DUMMY > | |
►CLoadInternal< BLOCK_LOAD_TRANSPOSE, DUMMY > | |
C_TempStorage | Shared memory storage layout type |
CTempStorage | Alias wrapper allowing storage to be unioned |
CLoadInternal< BLOCK_LOAD_VECTORIZE, DUMMY > | |
►CLoadInternal< BLOCK_LOAD_WARP_TRANSPOSE, DUMMY > | |
C_TempStorage | Shared memory storage layout type |
CTempStorage | Alias wrapper allowing storage to be unioned |
►CLoadInternal< BLOCK_LOAD_WARP_TRANSPOSE_TIMESLICED, DUMMY > | |
C_TempStorage | Shared memory storage layout type |
CTempStorage | Alias wrapper allowing storage to be unioned |
CTempStorage | \smemstorage{BlockLoad} |
►CBlockRadixRank | BlockRadixRank provides operations for ranking unsigned integer types within a CUDA thread block |
CPrefixCallBack | |
CTempStorage | \smemstorage{BlockScan} |
►CBlockRadixRankMatch | |
CTempStorage | \smemstorage{BlockScan} |
►CBlockRadixSort | The BlockRadixSort class provides collective methods for sorting items partitioned across a CUDA thread block using a radix sorting method |
C_TempStorage | Shared memory storage layout type |
CTempStorage | \smemstorage{BlockRadixSort} |
►CBlockRakingLayout | BlockRakingLayout provides a conflict-free shared memory layout abstraction for 1D raking across thread block data |
CTempStorage | Alias wrapper allowing storage to be unioned |
►CBlockReduce | The BlockReduce class provides collective methods for computing a parallel reduction of items partitioned across a CUDA thread block |
CTempStorage | \smemstorage{BlockReduce} |
►CBlockReduceRaking | BlockReduceRaking provides raking-based methods of parallel reduction across a CUDA thread block. Supports non-commutative reduction operators |
C_TempStorage | Shared memory storage layout type |
CTempStorage | Alias wrapper allowing storage to be unioned |
►CBlockReduceRakingCommutativeOnly | BlockReduceRakingCommutativeOnly provides raking-based methods of parallel reduction across a CUDA thread block. Does not support non-commutative reduction operators. Does not support block sizes that are not a multiple of the warp size |
C_TempStorage | Shared memory storage layout type |
CTempStorage | Alias wrapper allowing storage to be unioned |
►CBlockReduceWarpReductions | BlockReduceWarpReductions provides variants of warp-reduction-based parallel reduction across a CUDA thread block. Supports non-commutative reduction operators |
C_TempStorage | Shared memory storage layout type |
CTempStorage | Alias wrapper allowing storage to be unioned |
►CBlockScan | The BlockScan class provides collective methods for computing a parallel prefix sum/scan of items partitioned across a CUDA thread block |
CTempStorage | \smemstorage{BlockScan} |
►CBlockScanRaking | BlockScanRaking provides variants of raking-based parallel prefix scan across a CUDA thread block |
C_TempStorage | Shared memory storage layout type |
CTempStorage | Alias wrapper allowing storage to be unioned |
CBlockScanRunningPrefixOp | < Wrapped scan operator type |
►CBlockScanWarpScans | BlockScanWarpScans provides warpscan-based variants of parallel prefix scan across a CUDA thread block |
►C_TempStorage | Shared memory storage layout type |
CAliasable | |
CTempStorage | Alias wrapper allowing storage to be unioned |
►CBlockShuffle | The BlockShuffle class provides collective methods for shuffling data partitioned across a CUDA thread block |
C_TempStorage | Shared memory storage layout type (last element from each thread's input) |
CTempStorage | \smemstorage{BlockShuffle} |
►CBlockStore | The BlockStore class provides collective data movement methods for writing a blocked arrangement of items partitioned across a CUDA thread block to a linear segment of memory |
CStoreInternal | Store helper |
CStoreInternal< BLOCK_STORE_DIRECT, DUMMY > | |
►CStoreInternal< BLOCK_STORE_TRANSPOSE, DUMMY > | |
C_TempStorage | Shared memory storage layout type |
CTempStorage | Alias wrapper allowing storage to be unioned |
CStoreInternal< BLOCK_STORE_VECTORIZE, DUMMY > | |
►CStoreInternal< BLOCK_STORE_WARP_TRANSPOSE, DUMMY > | |
C_TempStorage | Shared memory storage layout type |
CTempStorage | Alias wrapper allowing storage to be unioned |
►CStoreInternal< BLOCK_STORE_WARP_TRANSPOSE_TIMESLICED, DUMMY > | |
C_TempStorage | Shared memory storage layout type |
CTempStorage | Alias wrapper allowing storage to be unioned |
CTempStorage | \smemstorage{BlockStore} |
CCacheModifiedInputIterator | A random-access input wrapper for dereferencing array values using a PTX cache load modifier |
►CCacheModifiedOutputIterator | A random-access output wrapper for storing array values using a PTX cache-modifier |
CReference | |
►CCachingDeviceAllocator | A simple caching allocator for device memory allocations |
CBlockDescriptor | |
CTotalBytes | |
CCastOp | Default cast functor |
CChainedPolicy | Helper for dispatching into a policy chain |
CChainedPolicy< PTX_VERSION, PolicyT, PolicyT > | Helper for dispatching into a policy chain (end-of-chain specialization) |
CConstantInputIterator | A random-access input generator for dereferencing a sequence of homogeneous values |
CCountingInputIterator | A random-access input generator for dereferencing a sequence of incrementing integer values |
CCubVector | Exposes a member typedef Type that names the corresponding CUDA vector type if one exists. Otherwise Type refers to the CubVector structure itself, which will wrap the corresponding x , y , etc. vector fields |
CCubVector< T, 1 > | |
CCubVector< T, 2 > | |
CCubVector< T, 3 > | |
CCubVector< T, 4 > | |
CDeviceHistogram | DeviceHistogram provides device-wide parallel operations for constructing histogram(s) from a sequence of samples data residing within device-accessible memory |
CDevicePartition | DevicePartition provides device-wide, parallel operations for partitioning sequences of data items residing within device-accessible memory |
CDeviceRadixSort | DeviceRadixSort provides device-wide, parallel operations for computing a radix sort across a sequence of data items residing within device-accessible memory |
►CDeviceRadixSortPolicy | < Signed integer type for global offsets |
CPolicy200 | SM20 |
CPolicy300 | SM30 |
CPolicy350 | SM35 |
CPolicy500 | SM50 |
CPolicy600 | SM60 (GP100) |
CPolicy610 | SM61 (GP104) |
CPolicy620 | SM62 (Tegra, less RF) |
CPolicy700 | SM70 (GV100) |
CDeviceReduce | DeviceReduce provides device-wide, parallel operations for computing a reduction across a sequence of data items residing within device-accessible memory |
►CDeviceReducePolicy | < Binary reduction functor type having member T operator()(const T &a, const T &b) |
CPolicy130 | SM13 |
CPolicy200 | SM20 |
CPolicy300 | SM30 |
CPolicy350 | SM35 |
CPolicy600 | SM60 |
►CDeviceRleDispatch | < Signed integer type for global offsets |
CKernelConfig | |
CPolicy100 | SM10 |
CPolicy130 | SM13 |
CPolicy200 | SM20 |
CPolicy300 | SM30 |
CPolicy350 | SM35 |
CPtxRleSweepPolicy | |
CDeviceRunLengthEncode | DeviceRunLengthEncode provides device-wide, parallel operations for demarcating "runs" of same-valued items within a sequence residing within device-accessible memory |
CDeviceScan | DeviceScan provides device-wide, parallel operations for computing a prefix scan across a sequence of data items residing within device-accessible memory |
CDeviceSegmentedRadixSort | DeviceSegmentedRadixSort provides device-wide, parallel operations for computing a batched radix sort across multiple, non-overlapping sequences of data items residing within device-accessible memory |
CDeviceSegmentedReduce | DeviceSegmentedReduce provides device-wide, parallel operations for computing a reduction across multiple sequences of data items residing within device-accessible memory |
CDeviceSelect | DeviceSelect provides device-wide, parallel operations for compacting selected items from sequences of data items residing within device-accessible memory |
CDeviceSpmv | DeviceSpmv provides device-wide parallel operations for performing sparse-matrix * dense-vector multiplication (SpMV) |
►CDipatchHistogram | < Signed integer type for global offsets |
CKernelConfig | |
CPassThruTransform | |
CPolicy110 | SM11 |
CPolicy200 | SM20 |
CPolicy300 | SM30 |
CPolicy350 | SM35 |
CPolicy500 | SM50 |
CPtxHistogramSweepPolicy | |
CScaleTransform | |
CSearchTransform | |
CTScale | |
CDiscardOutputIterator | A discard iterator |
►CDispatchRadixSort | < Signed integer type for global offsets |
CPassConfig | Pass configuration structure |
CDispatchReduce | < Binary reduction functor type having member T operator()(const T &a, const T &b) |
►CDispatchReduceByKey | < Signed integer type for global offsets |
CKernelConfig | |
CPolicy110 | SM11 |
CPolicy130 | SM13 |
CPolicy200 | SM20 |
CPolicy300 | SM30 |
CPolicy350 | SM35 |
CPtxReduceByKeyPolicy | |
►CDispatchScan | < Signed integer type for global offsets |
CKernelConfig | |
CPolicy100 | SM10 |
CPolicy130 | SM13 |
CPolicy200 | SM20 |
CPolicy300 | SM30 |
CPolicy350 | SM35 |
CPolicy520 | SM520 |
CPolicy600 | SM600 |
CPtxAgentScanPolicy | |
►CDispatchSegmentedRadixSort | < Signed integer type for global offsets |
CPassConfig | PassConfig data structure |
CDispatchSegmentedReduce | < Binary reduction functor type having member T operator()(const T &a, const T &b) |
►CDispatchSelectIf | < Whether or not we push rejected items to the back of the output |
CKernelConfig | |
CPolicy100 | SM10 |
CPolicy130 | SM13 |
CPolicy200 | SM20 |
CPolicy300 | SM30 |
CPolicy350 | SM35 |
CPtxSelectIfPolicyT | |
►CDispatchSpmv | < Signed integer type for global offsets |
CKernelConfig | |
CPolicy110 | SM11 |
CPolicy200 | SM20 |
CPolicy300 | SM30 |
CPolicy350 | SM35 |
CPolicy370 | SM37 |
CPolicy500 | SM50 |
CPolicy600 | SM60 |
CPtxSegmentFixupPolicy | |
CPtxSpmvPolicyT | |
CDoubleBuffer | Double-buffer storage wrapper for multi-pass stream transformations that require more than one storage array for streaming intermediate results back and forth |
CEnableIf | Simple enable-if (similar to Boost) |
CEnableIf< false, T > | |
CEquality | Default equality functor |
CEquals | Type equality test |
CEquals< A, A > | |
CFpLimits | |
CFpLimits< double > | |
CFpLimits< float > | |
CGridBarrier | GridBarrier implements a software global barrier among thread blocks within a CUDA grid |
CGridBarrierLifetime | GridBarrierLifetime extends GridBarrier to provide lifetime management of the temporary device storage needed for cooperation |
CGridEvenShare | GridEvenShare is a descriptor utility for distributing input among CUDA thread blocks in an "even-share" fashion. Each thread block gets roughly the same number of input tiles |
CGridQueue | GridQueue is a descriptor utility for dynamic queue management |
CIf | Type selection (IF ? ThenType : ElseType ) |
CIf< false, ThenType, ElseType > | |
CInequality | Default inequality functor |
CInequalityWrapper | Inequality functor (wraps equality functor) |
CInt2Type | Allows for the treatment of an integral constant as a type at compile-time (e.g., to achieve static call dispatch based on constant integral values) |
CIsPointer | Pointer vs. iterator |
CIsPointer< Tp * > | |
CIsVolatile | Volatile modifier test |
CIsVolatile< Tp volatile > | |
CIterateThreadLoad | Helper structure for templated load iteration (inductive case) |
CIterateThreadLoad< MAX, MAX > | Helper structure for templated load iteration (termination case) |
CIterateThreadStore | Helper structure for templated store iteration (inductive case) |
CIterateThreadStore< MAX, MAX > | Helper structure for templated store iteration (termination case) |
CKernelConfig | |
CKeyValuePair | A key identifier paired with a corresponding value |
CLog2 | Statically determine log2(N), rounded up |
CLog2< N, 0, COUNT > | |
CMax | Default max functor |
CMin | Default min functor |
CMutex | |
CNullType | A simple "NULL" marker type |
CNumericTraits | Numeric type traits |
CNumericTraits< bool > | |
CNumericTraits< char > | |
CNumericTraits< double > | |
CNumericTraits< float > | |
CNumericTraits< int > | |
CNumericTraits< long > | |
CNumericTraits< long long > | |
CNumericTraits< NullType > | |
CNumericTraits< short > | |
CNumericTraits< signed char > | |
CNumericTraits< unsigned char > | |
CNumericTraits< unsigned int > | |
CNumericTraits< unsigned long > | |
CNumericTraits< unsigned long long > | |
CNumericTraits< unsigned short > | |
CPowerOfTwo | Statically determine if N is a power-of-two |
CReduceByKeyOp | < Binary reduction operator to apply to values |
CReduceByKeyScanTileState | |
CReduceByKeyScanTileState< ValueT, KeyT, false > | |
►CReduceByKeyScanTileState< ValueT, KeyT, true > | |
CTileDescriptorBigStatus | |
CTileDescriptorLittleStatus | |
CReduceBySegmentOp | Reduce-by-segment functor |
CRemoveQualifiers | Removes const and volatile qualifiers from type Tp |
CRemoveQualifiers< Tp, const Up > | |
CRemoveQualifiers< Tp, const volatile Up > | |
CRemoveQualifiers< Tp, volatile Up > | |
CScanTileState | |
CScanTileState< T, false > | |
►CScanTileState< T, true > | |
CTileDescriptor | |
CSpmvParams | < Signed integer type for sequence offsets |
CSum | Default sum functor |
CSwizzleScanOp | Binary operator wrapper for switching non-commutative scan arguments |
CTempStorage | |
CTexObjInputIterator | A random-access input wrapper for dereferencing array values through texture cache. Uses newer Kepler-style texture objects |
►CTilePrefixCallbackOp | |
C_TempStorage | |
CTempStorage | |
CTraits | Type traits |
CTransformInputIterator | A random-access input wrapper for transforming dereferenced values |
CUninitialized | A storage-backing wrapper that allows types with non-trivial constructors to be aliased in unions |
►CUnitWord | Unit-words of data movement |
CIsMultiple | |
CUnitWord< char2 > | |
CUnitWord< const T > | |
CUnitWord< const volatile T > | |
CUnitWord< float2 > | |
CUnitWord< float4 > | |
CUnitWord< volatile T > | |
►CWarpExchange | |
C_TempStorage | Shared memory storage layout type |
CTempStorage | \smemstorage{WarpExchange} |
►CWarpReduce | The WarpReduce class provides collective methods for computing a parallel reduction of items partitioned across a CUDA thread warp |
CTempStorage | \smemstorage{WarpReduce} |
►CWarpReduceShfl | WarpReduceShfl provides SHFL-based variants of parallel reduction of items partitioned across a CUDA thread warp |
CIsInteger | |
►CWarpReduceSmem | WarpReduceSmem provides smem-based variants of parallel reduction of items partitioned across a CUDA thread warp |
C_TempStorage | Shared memory storage layout type (1.5 warps-worth of elements for each warp) |
CTempStorage | |
►CWarpScan | The WarpScan class provides collective methods for computing a parallel prefix scan of items partitioned across a CUDA thread warp |
CTempStorage | \smemstorage{WarpScan} |
►CWarpScanShfl | WarpScanShfl provides SHFL-based variants of parallel prefix scan of items partitioned across a CUDA thread warp |
CIntegerTraits | |
CTempStorage | Shared memory storage layout type |
►CWarpScanSmem | WarpScanSmem provides smem-based variants of parallel prefix scan of items partitioned across a CUDA thread warp |
CTempStorage | |
►NFD | |
CDerivative | |
CDerivative_impl | |
CDerivative_impl< dir, 1, 2, CENTRAL > | |
CDerivative_impl< dir, 1, 2, CENTRAL_ONE_SIDE_BACKWARD > | |
CDerivative_impl< dir, 1, 2, CENTRAL_ONE_SIDE_FORWARD > | |
CDerivative_impl< dir, 1, 2, CENTRAL_STAG > | |
CDerivative_impl< dir, 1, 2, CENTRAL_STAG_ONE_SIDE_BACKWARD > | |
CDerivative_impl< dir, 1, 2, CENTRAL_STAG_ONE_SIDE_FORWARD > | |
CDerivative_impl< dir, 2, 2, CENTRAL > | |
CDerivative_impl< dir, 2, 2, CENTRAL_ONE_SIDE_BACKWARD > | |
CDerivative_impl< dir, 2, 2, CENTRAL_ONE_SIDE_FORWARD > | |
Cfirst_or_second | |
Cfirst_or_second< true, exp1, exp2 > | |
Cg_comp | |
Cgdb_ext_plus_g_info | |
Cget_grid_dist_expression_op | |
Cget_grid_dist_expression_op< 1, false > | |
Cget_grid_dist_expression_op< 1, true > | |
Cget_grid_dist_expression_op< 2, false > | |
Cget_grid_dist_expression_op< 2, true > | |
Cget_grid_dist_expression_op< 3, true > | |
CGRID_DERIVATIVE | |
Cgrid_dist_expression | |
Cgrid_dist_expression< 0, grid_patches< grid_cpu< dim, aggregate< double > > >, NORM_EXPRESSION > | Main class that encapsulate a grid properties operand to be used for expressions construction |
Cgrid_dist_expression< dim, double, NORM_EXPRESSION > | Main class that encapsulate a double constant |
Cgrid_dist_expression< dim, double, STAG_EXPRESSION > | Main class that encapsulate a double constant |
Cgrid_dist_expression< dim, float, impl > | Main class that encapsulate a float constant |
Cgrid_dist_expression< prp, grid, NORM_EXPRESSION > | Main class that encapsulate a grid properties operand to be used for expressions construction |
Cgrid_dist_expression< prp, grid, STAG_EXPRESSION > | |
Cgrid_dist_expression_iterator_to_make_algebra_work | |
Cgrid_dist_expression_op | |
Cgrid_dist_expression_op< exp1, boost::mpl::int_< n >, g_comp > | It take an expression and create the negatove of this expression |
Cgrid_dist_expression_op< exp1, exp2, mul > | |
Cgrid_dist_expression_op< exp1, exp2, sub > | |
Cgrid_dist_expression_op< exp1, exp2, sum > | |
Cgrid_dist_expression_op< exp1, void, GRID_DERIVATIVE< dir, ord_d, ord, impl > > | |
Cgrid_dist_expression_op< exp1, void, subuni > | |
Cgrid_dist_expression_value_impl | |
Cgrid_dist_expression_value_impl< base_type[N1]> | |
Cgrid_dist_expression_value_impl< base_type[N1][N2]> | |
Cgrid_dist_expression_value_impl< base_type[N1][N2][N3]> | |
Cgrid_dist_expression_value_impl< Point< N1, base_type > > | |
Cgrid_dist_expression_value_impl_func_scal | |
Cgrid_dist_expression_value_impl_func_scal< 0 > | |
Cgrid_dist_expression_value_impl_func_vec | |
Cgrid_dist_expression_value_impl_func_vec< 0 > | |
Cgrid_dist_expression_value_impl_vnz | |
Cgrid_dist_expression_value_impl_vnz< 0 > | |
Cgrid_patches | |
CL2Error | |
CLaplacian | |
CLInfError | |
Cmul | |
Cpos_or_propL | Selector for position or properties left side expression |
Csub | |
Csubuni | |
Csum | |
►Ngpu | |
Ccontext_t | |
Ccuda_exception_t | |
Cequal_to_t | |
Cgreater_equal_t | |
Cgreater_t | |
Cless_equal_t | |
Cless_t | |
Cmaximum_t | |
Cminimum_t | |
Cminus_t | |
Cmultiplies_t | |
Cnot_equal_to_t | |
Cofp_context_t | |
Cplus_t | |
►Nopenfpm | Convert a type into constant type |
►Ndetail | |
►Nmulti_array | |
Carray_iterator_openfpm | |
Cassociated_types_openfpm | |
Cchoose_value_accessor_n_openfpm | |
Cchoose_value_accessor_one_openfpm | |
►Cconst_multi_array_view_openfpm | |
Carray_view_openfpm | |
Cconst_array_view_openfpm | |
►Cconst_sub_array_openfpm | |
Carray_view | |
Cconst_array_view | |
Cmulti_array_base_openfpm | |
►Cmulti_array_impl_base_openfpm | |
Carray_view_openfpm | |
Cconst_array_view_openfpm | |
Cconst_subarray | |
Csubarray | |
►Cmulti_array_view_openfpm | |
Carray_view_openfpm | |
Cconst_array_view_openfpm | |
Coperator_arrow_proxy_openfpm | |
►Csub_array_openfpm | |
Carray_view | |
Cconst_array_view | |
Cvalue_accessor_generator_openfpm | |
Cvalue_accessor_n_openfpm | |
Cvalue_accessor_one_openfpm | |
Cadd_prp_device_impl | |
Cadd_prp_device_impl< true, T, Memory, layout_base, grow_p > | |
Carray | |
Carray< T, 0 > | |
Carray_view_gen_openfpm | |
Cc_storage_order | |
Cconst_array_view_gen_openfpm | |
Cconst_multi_array_ref_openfpm | |
Cconst_subarray_gen_openfpm | |
Ccopy_two_vectors_activate_impl | |
Ccopy_two_vectors_activate_impl< true > | |
Ccpu_block_process | |
Ccpu_block_process< reduction_type, 3 > | |
Ccpu_block_process< reduction_type, VECTOR_SPARSE_BLOCK > | |
CDebug | |
Cfortran_storage_order | |
Cgeneral_storage_order | |
Cgrow_policy_double | Grow policy define how the vector should grow every time we exceed the size |
Cgrow_policy_identity | Grow policy define how the vector should grow every time we exceed the size |
Cgrow_policy_page | Grow policy define how the vector should grow every time we exceed the size |
ChtoD | |
Cis_multi_array | |
Cis_multi_array< T, typename Void< typename T::yes_is_multi_array >::type > | Has_noPointers check if a type has defined a method called noPointers |
Cmerge_prp_device_impl | |
Cmerge_prp_device_impl< true, T, Memory, layout_base, grow_p > | |
Cmulti_array_ref_openfpm | |
Cofp_storage_order | |
Creorder | |
Cscalar_block_implementation_switch | Functor switch to select the vector sparse for standars scalar and blocked implementation |
Cscalar_block_implementation_switch< 2, block_functor > | |
Csparse_index | |
Csparse_vector_reduction | This class is a functor for "for_each" algorithm |
Csparse_vector_reduction_cpu | This class is a functor for "for_each" algorithm |
Csparse_vector_reduction_cpu_impl | |
Csparse_vector_reduction_cpu_impl< reduction_type, vector_reduction, T, impl, red_type[N1]> | |
Csparse_vector_reduction_solve_conflict_assign_cpu | This class is a functor for "for_each" algorithm |
Csparse_vector_reduction_solve_conflict_reduce_cpu | This class is a functor for "for_each" algorithm |
Csparse_vector_reduction_solve_conflict_reduce_cpu_impl | |
Csparse_vector_reduction_solve_conflict_reduce_cpu_impl< impl, vector_reduction, T, red_type[N1]> | |
Csparse_vector_special | This class is a functor for "for_each" algorithm |
Cstub_block_functor | |
Csubarray_gen_openfpm | |
Cvect_isel | It analyze the type given and it select correctly the implementation for vector |
Cvector | Implementation of 1-D std::vector like structure |
►Cvector< T, Memory, layout_base, grow_p, OPENFPM_NATIVE > | Implementation of 1-D std::vector like structure |
Clayout_base__ | |
Cvector_gpu_ker | Grid interface available when on gpu |
Cvector_gpu_ker_ref | Grid interface available when on gpu |
Cvector_key_iterator | Vector iterator |
Cvector_key_iterator_ele | Vector iterator |
Cvector_key_iterator_seq | Vector iterator |
Cvector_sparse | |
Cvector_sparse_gpu_ker | |
Cvector_subset_ker | |
►NSparseGridGpuKernels | |
Cstencil_conv_func_impl | |
Cstencil_conv_func_impl< 2 > | |
Cstencil_conv_func_impl< 3 > | |
Cstencil_cross_func | |
Cstencil_cross_func_conv | |
Cstencil_cross_func_conv_block_read | |
Cstencil_cross_func_impl | |
Cstencil_func_conv2 | |
Cstencil_func_conv2_b | |
Cstencil_func_conv3_b | |
►Nstd | |
Chash< gid > | |
Chash< lid > | |
Chash< rid > | |
Cvector< comb< 0 > > | Stub vector specialization |
►Ntsl | |
►Ndetail_hopscotch_hash | |
Chas_is_transparent | |
Chas_is_transparent< T, typename make_void< typename T::is_transparent >::type > | |
Chas_key_compare | |
Chas_key_compare< T, typename make_void< typename T::key_compare >::type > | |
Chopscotch_bucket | |
Chopscotch_bucket_hash | |
Chopscotch_bucket_hash< true > | |
►Chopscotch_hash | |
Chopscotch_iterator | |
Cmake_void | |
Csmallest_type_for_min_bits | |
Csmallest_type_for_min_bits< MinBits, typename std::enable_if<(MinBits > 0) &&(MinBits<=8)>::type > | |
Csmallest_type_for_min_bits< MinBits, typename std::enable_if<(MinBits > 16) &&(MinBits<=32)>::type > | |
Csmallest_type_for_min_bits< MinBits, typename std::enable_if<(MinBits > 32) &&(MinBits<=64)>::type > | |
Csmallest_type_for_min_bits< MinBits, typename std::enable_if<(MinBits > 8) &&(MinBits<=16)>::type > | |
►Chopscotch_map | |
CKeySelect | |
CValueSelect | |
►Chopscotch_sc_map | |
CKeySelect | |
CValueSelect | |
►Chopscotch_sc_set | |
CKeySelect | |
►Chopscotch_set | |
CKeySelect | |
Cmod_growth_policy | |
Cpower_of_two_growth_policy | |
Cprime_growth_policy | |
C_add_ | |
C_max_ | |
CAdaptiveCylinderCone | This class represent an Adaptive cylinder cone |
Cadd_ | This structure define the operation add to use with copy general |
Cadd_atomic_ | This structure define the operation add to use with copy general |
Cadd_const_reference | |
Cadd_const_reference< T, true > | |
Cadd_prp_impl | Struct to merge two vectors |
Cadd_prp_impl< OBJECT_ADD, vect_dst > | Struct to merge two vectors |
CAexample | Example structure |
Cagg_arr | It store the offsets of the interpolation points |
Caggregate | Aggregate of properties, from a list of object if create a struct that follow the OPENFPM native structure |
Caggregate_add | |
Caggregate_add< aggregate< types ... > > | |
Caggregate_bfv | An aggregate that accept a boost fusion vector as type |
Caggregate_convert | |
Caggregate_convert< dim, blockEdgeSize, aggregate< types ... > > | |
Caggregate_or_known_type | |
Caggregate_or_known_type< layout_base, T, 2, args ... > | |
Caggregate_or_known_type< layout_base, T, 4, args ... > | |
Caggregate_transform_datablock_impl | |
CAggregateAppend | |
CAggregateAppend< BlockT, aggregate< list ... > > | |
CAlgoimWrapper | |
CAlgoimWrapper< wrapping_field, grid_type, wrapping_field_type[N1]> | |
CAlgoimWrapper< wrapping_field, grid_type, wrapping_field_type[N1][N2]> | |
CAlgoimWrapper< wrapping_field, grid_type, wrapping_field_type[N1][N2][N3]> | |
Callocate | This class is a functor for "for_each" algorithm |
Calpa_base_structs | |
CAMG_time_err_coars | It contain information about the performance of the AMG |
Camr_launch_sparse | |
Canyname_field | [Constant fields struct definition] |
Canyname_field_with_pos | Define a non-constant (in space) field |
Capply_kernel_is_number_or_expression | Apply the kernel to particle differently that is a number or is an expression |
Capply_kernel_is_number_or_expression_gen | Apply the kernel to particle differently that is a number or is an expression |
Capply_kernel_is_number_or_expression_sim | Apply the kernel to particle differently that is a number or is an expression |
Capply_kernel_rtype | It give the return type of the expression if applicable |
Capply_kernel_rtype< exp, false > | It give the return type of the expression if applicable |
Capply_transform | |
Capply_trasform_impl | |
Capply_trasform_impl< layout_base, T, boost::fusion::vector< args... > > | |
Carr_arr_ptr | |
Carr_ptr | |
Carray_asc | |
Carray_asc< 2 > | |
Carray_asc< 3 > | |
Carray_asc< 4 > | |
Carray_extents | Struct that give functionalities on array extensions |
Carray_extents< T[N1]> | Struct that give functionalities on array extensions |
Carray_extents< T[N1][N2]> | Struct that give functionalities on array extensions |
Carray_extents< T[N1][N2][N3]> | Struct that give functionalities on array extensions |
Carray_ord | |
Carray_ord< 2, size_type > | |
Carray_ord< 3, size_type > | |
Carray_ord< 4, size_type > | |
Carray_to_vmpl | Partial specialization for scalar N=0 |
Carray_to_vmpl< T[N1]> | Partial specialization for N=1 |
Carray_to_vmpl< T[N1][N2]> | Partial specialization for N=2 |
CArrayHolder | Array itself |
CArrayHolder_constexpr | Array itself |
CArrayHolder_indexes | Array itself |
CArrayWrapper | |
CArrayWrapper< BaseType[N1]> | |
CArrayWrapper< BaseType[N1][N2]> | |
Cas_array_nnc | Set a dimension threshold |
Cat_impl | |
Cat_impl< vector, p, true > | |
CAvg | Average |
CAvg< d, arg, Sys_eqs, BACKWARD > | First order BACKWARD derivative on direction i |
CAvg< d, arg, Sys_eqs, CENTRAL > | Central average scheme on direction i |
CAvg< d, arg, Sys_eqs, FORWARD > | FORWARD average on direction i |
Cb_cast_helper | |
Cb_cast_helper< false > | |
Cbase_copy | |
Cbase_copy< true, base_obj, v_obj > | |
Cbcast_inte_impl | This class is a functor for "for_each" algorithm |
Cbest_conv | |
Cbest_conv_impl | |
Cbest_conv_impl< int, source2 > | |
Cbest_conv_impl< long int, source2 > | |
Cbest_conv_impl< source1, int > | |
Cbest_conv_impl< source1, long int > | |
Cbest_conv_impl< source1, unsigned int > | |
Cbest_conv_impl< source1, unsigned long int > | |
Cbest_conv_impl< unsigned int, source2 > | |
Cbest_conv_impl< unsigned long int, source2 > | |
Cbisect_unroll | This class is a functor for "for_each" algorithm |
Cblock_offset | |
CBlockMapGpu | |
CBlockMapGpu_ker | |
CBMemory | It override the behavior if size() |
CBoundaryStencilSetX | |
CBoundaryStencilSetXRescaled | |
CBox | This class represent an N-dimensional box |
CBox_check | |
CBox_dom | Case for external ghost box |
CBox_fix | Internal ghost box sent to construct external ghost box into the other processors |
CBox_loc_sub | For each sub-domain box sub contain the real the sub-domain id |
CBox_proc | Case for local external ghost box |
CBox_sub | |
CBox_sub_k | Particular case for local internal ghost boxes |
CBoxDistribution | Class that distribute sub-sub-domains across processors using Metis Library |
Cbrt_test | |
Cbump | |
Ccalculate_aint | Calculate aint |
Ccalculate_aint< 2, vector, np > | Calculate aint 2D |
Ccalculate_aint< 3, vector, np > | Calculate aint |
CCalcVelocity | |
Ccall_aggregatePack | Calls a packer in nested way |
Ccall_aggregatePackRequest | |
Ccall_aggregatePackRequestChunking | |
Ccall_aggregateUnpack | Calls an unpacker in nested way |
Ccall_encapPack | |
Ccall_encapPackChunking | |
Ccall_encapPackRequest | |
Ccall_encapUnpack | |
Ccall_encapUnpackChunking | |
Ccall_init_if_needed | Call the init function if a type T has the function init |
Ccall_init_if_needed< T, false > | Call the init function if a type T has the function init |
Ccall_pack_agg_functor | |
Ccall_pack_enc_functor | |
Ccall_pack_enc_functor_chunking | |
Ccall_pack_enc_functor_chunking_impl_arr | |
Ccall_pack_enc_functor_chunking_impl_arr< Timp[N1]> | |
Ccall_packRequest_agg_functor | |
Ccall_packRequest_agg_functor_cnk | |
Ccall_packRequest_enc_functor | |
Ccall_recursive_destructor_if_vector | |
Ccall_recursive_destructor_if_vector< T, T_ker, type_prp, layout_base, 0 > | |
Ccall_recursive_destructor_if_vector< T, T_ker, type_prp, layout_base, 3 > | |
Ccall_recursive_destructor_if_vector< T, T_ker, type_prp, layout_base, 4 > | |
Ccall_recursive_host_device_if_vector | |
Ccall_recursive_host_device_if_vector< T, T_ker, type_prp, layout_base, 0 > | |
Ccall_recursive_host_device_if_vector< T, T_ker, type_prp, layout_base, 3 > | |
Ccall_recursive_host_device_if_vector< T, T_ker, type_prp, layout_base, 4 > | |
Ccall_serialize_variadic | |
Ccall_serialize_variadic< index_tuple< prp... > > | |
Ccall_unpack_agg_functor | |
Ccall_unpack_encap_functor | |
Ccall_unpack_encap_functor_chunking | |
Ccall_unpack_encap_functor_chunking_array_selector | |
Ccall_unpack_encap_functor_chunking_array_selector< T[N1]> | |
►CCartDecomposition | This class decompose a space into sub-sub-domains and distribute them across processors |
Cbox_id | Class to select the returned id by ghost_processorID |
Clc_processor_id | Class to select the returned id by ghost_processorID |
Cprocessor_id | Class to select the returned id by ghost_processorID |
Cshift_id | Class to select the returned id by ghost_processorID |
CCartDecomposition_ext | This class decompose a space into sub-sub-domains and distribute them across processors |
CCartDecomposition_gpu | |
CCartesianGraphFactory | This class construct a cartesian graph |
Ccell_grid | For each combination in the cell grid you can have different grids |
Ccell_list_selector | |
Ccell_list_selector< vector, comp_host > | |
CCellDecomposer_gpu_ker | |
CCellIterator | It iterate through the elements of a cell |
CCellIteratorM | It iterate through the elements of a cell |
CCellList | Class for FAST cell list implementation |
CCellList_cpu_ker | |
CCellList_gen | |
CCellList_gpu_ker | |
CCellList_gpu_ker< dim, T, cnt_type, ids_type, transform, true > | |
CCellListM | Class for Multi-Phase cell-list |
CCellNNIterator | Iterator for the neighborhood of the cell structures |
CCellNNIterator< dim, Cell, RUNTIME, impl > | Iterator for the neighborhood of the cell structures |
CCellNNIteratorM | Iterator for the neighborhood of the cell structures |
CCellNNIteratorM< dim, Cell, sh_byte, RUNTIME, impl > | Iterator for the neighborhood of the cell structures |
CCellNNIteratorRadius | Iterator for the neighborhood of the cell structures with free radius |
CCellNNIteratorSym | Symmetric iterator for the neighborhood of the cell structures |
CCellNNIteratorSym< dim, Cell, vector_pos_type, RUNTIME, impl > | Symmetric iterator for the neighborhood of the cell structures |
CCellNNIteratorSymM | Iterator for the neighborhood of the cell structures |
CCellNNIteratorSymM< dim, Cell, sh_byte, RUNTIME, impl > | Symmetric iterator for the neighborhood of the cell structures |
CCellNNIteratorSymMP | Symmetric iterator for the neighborhood of the cell structures |
Ccheader | This structure contain the information of a chunk |
Ccheck_all_apply_ker | |
Ccheck_all_apply_ker< comp_dev > | |
Ccheck_all_apply_ker_sort | |
Ccheck_all_expressions | |
Ccheck_all_expressions< comp_dev > | |
Ccheck_device_ptr | This class is a functor for "for_each" algorithm |
Ccheck_nan | |
Ccheck_nan< double > | |
Ccheck_nan< float > | |
Ccheck_no_pointers | This class check if the type T has pointers inside |
Ccheck_no_pointers_impl | Check if the type T has pointers inside |
Ccheck_no_pointers_impl< T, false > | Check if the type T has pointers inside |
Ccheck_type | |
Ccheck_type< T, 1 > | |
Ccheck_types | Functor for for_each algorithm |
CCheckExistence | Class to check if the edge can be created or not |
Ccid_ | |
Ccid_< 1, cnt_type, ids_type, transform > | |
Ccid_< 2, cnt_type, ids_type, transform > | |
Ccid_< 3, cnt_type, ids_type, transform > | |
Ccl_selector_impl | |
Ccl_selector_impl< cl_type, 1 > | |
Ccl_selector_impl< cl_type, 2 > | |
Ccomb | Position of the element of dimension d in the hyper-cube of dimension dim |
Ccomb< 0 > | |
Ccompare_aggregate | Structure to compare aggregates |
Ccompare_cpu_encap_encap | This class is a functor for "for_each" algorithm |
Ccompare_fusion_vector | This class is a functor for "for_each" algorithm |
Ccompare_general | Structure to copy aggregates |
Ccompare_general< T, 0 > | |
Ccompare_general< T, 2 > | |
Ccompare_host_device | |
Ccompare_host_device< base_type[N1], prp > | |
Ccompare_host_device< base_type[N1][N2], prp > | |
Ccompare_host_device< Point< N1, base_type >, prp > | |
CComposeArrayType | |
CComposeArrayType< BaseType[N1]> | |
CComposeArrayType< BaseType[N1][N2]> | |
Cconditional_push | Push p_ele into v only of to_push is true |
Cconditional_push< v, p_ele, false > | Push p_ele into v only of to_push is true |
Cconst_mul_functor_value | Multiplication expression |
CConstField | |
Cconstruct_expression | |
Cconstruct_expression< double > | Construct a vector expression from a double |
Cconstruct_expression< float > | Construct a vector expression from a float |
CConv3x3x3 | |
CConv3x3x3_noshared | |
Cconv_coeff | |
Cconv_impl | |
Cconv_impl< 3 > | |
CConv_tol_change | Optional convergence criterium checking the total change |
CConv_tol_residual | Optional convergence criterium checking the residual |
Cconvert | Set a conversion map between A and B |
Cconvert< std::string > | Partial specialization when A is a string |
Ccopy_acc | This class is a functor for "for_each" algorithm |
Ccopy_aggregate | Structure to copy aggregates |
Ccopy_aggregate_dual | Structure to copy aggregates |
Ccopy_aggregate_op | Structure to copy aggregates applying an operation |
Ccopy_all_prop_sparse | |
Ccopy_bck | |
Ccopy_corner_3 | Copy point in 3D |
Ccopy_corner_3< layout_type, prop, 1, chunking, is_cross > | Copy point in 3D |
Ccopy_corner_3< layout_type, prop, stencil_size, chunking, true > | Copy point in 3D |
Ccopy_cpu_encap | This class is a functor for "for_each" algorithm |
Ccopy_cpu_encap_encap | This class is a functor for "for_each" algorithm |
Ccopy_cpu_encap_encap_general | This class is a functor for "for_each" algorithm |
Ccopy_cpu_encap_encap_op_prp | It copy two encap object |
Ccopy_cpu_encap_encap_prp | This class is a functor for "for_each" algorithm |
Ccopy_cpu_encap_single | This class is a functor for "for_each" algorithm |
Ccopy_ele | This class is a functor for "for_each" algorithm |
Ccopy_ele_sca_array | Copy scalar elements |
Ccopy_ele_sca_array< copy_type, T, Ev, Eqs_sys, 1 > | Copy 1D array elements |
Ccopy_encap_vector_fusion | This class is a functor for "for_each" algorithm |
Ccopy_fast_1d_device_memory | This class is a functor for "for_each" algorithm |
Ccopy_fast_1d_device_memory< true, data_type, S > | This class is a functor for "for_each" algorithm |
Ccopy_fusion_vector | This class is a functor for "for_each" algorithm |
Ccopy_fusion_vector_encap | This class is a functor for "for_each" algorithm |
Ccopy_general | Structure to copy aggregates |
Ccopy_general< T, 1 > | Specialization for if dst type is copy assignable from src type |
Ccopy_general< T, 2 > | Specialization for aggregate type object |
Ccopy_general< T, 3 > | Specialization for aggregate type object that define an operator= |
Ccopy_general_op | Structure to copy aggregates applying an operation |
Ccopy_general_op< op, T, 1 > | Specialization for object that can be assigned with an operator copy |
Ccopy_general_op< op, T, 3 > | Specialization for aggregate type objects |
Ccopy_grid_fast | This is a way to quickly copy a grid into another grid |
Ccopy_grid_fast< false, 2, grid, ginfo > | This is a way to quickly copy a grid into another grid |
Ccopy_grid_fast< false, 3, grid, ginfo > | This is a way to quickly copy a grid into another grid |
Ccopy_grid_fast< true, 1, grid, ginfo > | This is a way to quickly copy a grid into another grid |
Ccopy_grid_fast< true, 2, grid, ginfo > | This is a way to quickly copy a grid into another grid |
Ccopy_grid_fast< true, 3, grid, ginfo > | This is a way to quickly copy a grid into another grid |
Ccopy_grid_fast_caller | |
Ccopy_grid_fast_caller< index_tuple_sq< prp ... > > | |
Ccopy_grid_fast_layout_switch | |
Ccopy_grid_fast_layout_switch< true, dim, grid, ginfo > | |
Ccopy_ndim_fast_selector | |
Ccopy_ndim_fast_selector< 2 > | |
Ccopy_ndim_fast_selector< 3 > | |
Ccopy_packer_chunk | It copy one element of the chunk for each property |
Ccopy_packer_chunk_arr_impl | |
Ccopy_packer_chunk_arr_impl< Timpl[N1]> | |
Ccopy_prop_to_vector | |
Ccopy_prop_to_vector_block | |
Ccopy_prop_to_vector_block_impl | |
Ccopy_prop_to_vector_block_impl< copy_type[N1]> | |
Ccopy_sparse_to_sparse | |
Ccopy_sparse_to_sparse_bb | |
Ccopy_sparse_to_sparse_bb_impl | |
Ccopy_sparse_to_sparse_bb_impl< T[N1]> | |
Ccopy_sparse_to_sparse_bb_impl< T[N1][N2]> | |
Ccopy_sparse_to_sparse_op | |
Ccopy_switch_memory_c_no_cpy | This class is a functor for "for_each" algorithm |
Ccopy_sz | This class is a functor for "for_each" algorithm |
Ccopy_unpacker_chunk | It copy one element of the chunk for each property |
Ccopy_x_3 | Copy x edge in 3D |
Ccopy_x_3< layout_type, prop, 1, chunking, is_cross > | Copy x edge in 3D |
Ccopy_x_3< layout_type, prop, stencil_size, chunking, true > | Copy x edge in 3D |
Ccopy_xy_3 | Copy XY surface in 3D |
Ccopy_xy_3< 1, prop, stencil_size, chunking, is_cross > | Copy XY surface in 3D |
Ccopy_xyz | Copy block in 3D |
Ccopy_xyz< 1, prop, stencil_size, chunking, is_cross > | Copy block in 3D vectorized |
Ccopy_xz_3 | Copy XZ surface in 3D |
Ccopy_xz_3< layout_type, prop, 1, chunking, is_cross > | Copy XZ surface in 3D |
Ccopy_y_3 | Copy y edge in 3D |
Ccopy_y_3< layout_type, prop, 1, chunking, is_cross > | Copy y edge in 3D |
Ccopy_y_3< layout_type, prop, stencil_size, chunking, true > | Copy y edge in 3D |
Ccopy_yz_3 | Copy YZ surface in 3D |
Ccopy_yz_3< layout_type, prop, 1, chunking, is_cross > | Copy YZ surface in 3D |
Ccopy_z_3 | Copy z edge in 3D |
Ccopy_z_3< layout_type, prop, 1, chunking, is_cross > | Copy z edge in 3D |
Ccopy_z_3< layout_type, prop, stencil_size, chunking, true > | Copy z edge in 3D |
Ccp_block | |
Ccp_block< T, stencil_size, vector_vmpl, 2 > | |
Ccp_block< T, stencil_size, vector_vmpl, 3 > | |
Ccp_block_base | |
Ccross_stencil | |
Ccross_stencil_v | |
Ccsv_col | This class is a functor for "for_each" algorithm |
Ccsv_col< Tobj, false > | This class is a functor for "for_each" algorithm |
Ccsv_col_str | This class is an helper to produce csv headers from multi-array |
Ccsv_col_str< T[N1]> | Partial specialization for N=1 1D-Array |
Ccsv_col_str< T[N1][N2]> | Partial specialization for N=2 2D-Array |
Ccsv_col_str< T[N1][N2][N3]> | Partial specialization for N=3 |
Ccsv_col_str< T[N1][N2][N3][N4]> | Partial specialization for N=4 |
Ccsv_prp | This class is a functor for "for_each" algorithm |
Ccsv_value_str | This class is an helper to produce csv data from multi-array |
Ccsv_value_str< T, false > | Partial specialization for unknown property |
Ccsv_value_str< T[N1], is_writable > | Partial specialization for N=1 1D-Array |
Ccsv_value_str< T[N1][N2], is_writable > | Partial specialization for N=2 2D-Array |
Ccsv_value_str< T[N1][N2][N3], is_writable > | Partial specialization for N=3 |
Ccsv_value_str< T[N1][N2][N3][N4], is_writable > | Partial specialization for N=4 |
CCSVWriter | CSV Writer |
Cct_par | |
CCudaMemory | |
Ccval | It store the non zero elements of the matrix |
CD | Derivative second order on h (spacing) |
CD< d, arg, Sys_eqs, BACKWARD > | First order BACKWARD derivative on direction i |
CD< d, arg, Sys_eqs, CENTRAL > | Second order central Derivative scheme on direction i |
CD< d, arg, Sys_eqs, CENTRAL_B_ONE_SIDE > | Second order one sided Derivative scheme on direction i |
CD< d, arg, Sys_eqs, FORWARD > | First order FORWARD derivative on direction i |
Cdata_il | |
Cdata_il< 1 > | |
Cdata_il< 2 > | |
Cdata_il< 4 > | |
Cdata_il< 8 > | |
Cdata_ptr_fill | |
CDataBlock | |
CdataDiv | Class that store Internal part external and border part of a dataset |
CDcpseDiagonalScalingMatrix | |
CDcpseRhs | |
CDEBUG | |
CDebug | |
CDEBUG< float & > | |
Cdec_optimizer | This class take a graph representing the space decomposition and produce a simplified version |
CDecomposition | This class define the domain decomposition interface |
CDecomposition_encap | |
Cdeconstruct_impl | This class is a functor for "for_each" algorithm |
Cdecrement_memory | |
Cdefault_chunking | |
Cdefault_chunking< 1 > | |
Cdefault_chunking< 2 > | |
Cdefault_chunking< 3 > | |
Cdefault_chunking< 4 > | |
Cdefault_chunking< 5 > | |
Cdefault_chunking< 6 > | |
Cdefault_chunking< 7 > | |
Cdefault_chunking< 8 > | |
Cdefault_edge | |
Cdefault_edge< 1 > | |
Cdefault_edge< 2 > | |
Cdefault_edge< 3 > | |
Cdevice_grid | |
Cdevice_grid_copy | |
Cdevice_grid_copy< true > | |
Cdevice_to_host_impl | This class is a functor for "for_each" algorithm |
Cdevice_to_host_start_stop_impl | This class is a functor for "for_each" algorithm |
Cdim3_ | |
Cdist_prop_out_edge | This class is a functor for "for_each" algorithm |
Cdist_prop_out_vertex | This class is a functor for "for_each" algorithm |
Cdist_prop_output | This class specialize functions in the case the type T has or not defined attributes |
Cdist_prop_output< false, Graph, i > | This class specialize functions in the case the type T has not defined attributes |
Cdist_prop_output_array_scalar_selector_edge | Property writer for scalar and vector |
Cdist_prop_output_array_scalar_selector_edge< true > | Property writer for vector |
Cdist_prop_output_array_scalar_selector_edge_fill_vertex | Property writer for scalar and vector, it fill the vertex data (needed for edge representation in vtk) |
Cdist_prop_output_array_scalar_selector_edge_fill_vertex< true > | Property writer for vector |
Cdist_prop_output_array_scalar_selector_vertex | Property writer for scalar and vector |
Cdist_prop_output_array_scalar_selector_vertex< true > | Property writer for vector |
CDistFromSol | Bundles total residual and total change over all the grid points |
CDistGraph_constr_impl | Graph constructor function specialization |
CDistGraph_constr_impl< dim, Graph, NO_EDGE, T, dim_c, pos... > | Graph constructor function specialization |
►CDistGraph_CSR | Structure that store a graph in CSR format or basically in compressed adjacency matrix format |
CEdgeReq | Structure to store a add request of an edge |
CGlobalVInfo | Structure needed to get vertex position by global id |
CSendGraphPack | Struct containing the (sub)graph to send |
CDistGraph_CSR_s | Simplified implementation of DistGraph_CSR |
CDistGraphFactory | This class construct a cartesian graph |
CDistParmetis | Helper class to define Metis graph |
CDistParMetisDistribution | |
CDLB | |
Cdo_not_print_warning_on_adjustment | |
Cdo_when_dim_gr_i | This structure use SFINAE to avoid instantiation of invalid code |
Cdo_when_dim_gr_i< dim, i, ORB, typename boost::enable_if< boost::mpl::bool_<(i< dim)> >::type > | |
Cdomain_icell_calculator | |
Cdomain_nn_calculator_cart | This class calculate processor domains and neighborhood of each processor domain |
CDrawParticles | A class to draw/create particles based on simple shaped |
Ce_box_id | It store the information about the external ghost box |
Ce_box_multi | For each external ghost id, it contain a set of sub-domain at which this external box is linked |
Ce_info | |
Ce_lbox_grid | Per-processor external ghost box |
Ce_lbox_id | It store the information about the local external ghost box |
Ce_map | Structure used inside GraphCSR an edge |
CE_p | Edge class that encapsulate an object T |
►Ced | |
Cattributes | Attributes name |
Cedge_iterator | Graph edge iterator |
Cedge_key | |
Cedge_node | This class is a functor for "for_each" algorithm |
Cedge_prop | This class is a functor for "for_each" algorithm |
Cele | |
Cele_g | It store one grid |
Cele_g_st | Convert a staggered element into a string for vtk write |
Cele_vpp | Store a reference to the vector properties |
Cele_vps | Store a reference to the vector position |
CEllipseParameters | |
Cenc_num | |
Cencap_data_block | |
Cencap_shmem | Memcpy it split the copy across threads |
Cencapc | |
Cencapc< dim, T, typename memory_traits_inte< T >::type > | This structure encapsulate an object of the grid |
Cencapc< dim, T, typename memory_traits_lin< T >::type > | This structure encapsulate an object of the grid |
Cencapc< dim, void, Mem > | This structure specialize the class for a void object or null |
Cencapsulated_type | |
Cep_box_grid | Per-processor external ghost box |
CEq | Equation |
Ceq_id | |
Cequations2d1 | Specify the general characteristic of system to solve |
Cequations2d1_stag | Specify the general characteristic of system to solve |
Cequations2d1E | Specify the general characteristic of system to solve |
Cequations2d1p | |
Cequations2d1pE | |
Cequations2d2 | |
Cequations2d2E | |
Cequations2d2p | |
Cequations2d2pE | |
Cequations2d3 | |
Cequations2d3E | |
Cequations2d3p | |
Cequations2d3pE | |
Cequations2d4 | |
Cequations2d4E | |
Cequations3d1 | |
Cequations3d1E | |
Cequations3d1EPxy | |
Cequations3d1Pxy | |
Cequations3d1Pz | |
Cequations3d3 | |
Cequations3d3E | |
Cequations3d3EPxz | |
Cequations3d3EPz | |
Cequations3d3Pxz | |
Cequations3d3Pyz | |
Cequations3d3Pz | |
CError | Out-of-bound policy kill the program |
Ceta | [Definition of the system] |
Cexecute_cl_test | |
Cexecute_cl_test< 1 > | |
Cexecute_cl_test< 2 > | |
Cexist_sub_v_impl | |
Cexist_sub_v_impl< 2 > | |
Cexist_sub_v_impl< 4 > | |
Cexist_sub_v_impl< 8 > | |
Cexit_impl | Exit condition |
Cexit_impl_sq | Exit condition |
Cexp_kernel | Exponential kernel |
Cextends | Classes to get the number of components of the properties |
Cextends< T[N1]> | Partial specialization for N=1 1D-Array |
Cextends< T[N1][N2]> | Partial specialization for N=2 2D-Array |
Cextends< T[N1][N2][N3]> | Partial specialization for N=3 |
Cextends< T[N1][N2][N3][N4]> | Partial specialization for N=4 |
Cextends< T[N1][N2][N3][N4][N5]> | Partial specialization for N=5 |
Cextends< T[N1][N2][N3][N4][N5][N6]> | Partial specialization for N=6 |
Cextends< T[N1][N2][N3][N4][N5][N6][N7]> | Partial specialization for N=7 |
Cextends< T[N1][N2][N3][N4][N5][N6][N7][N8]> | Partial specialization for N=8 |
Cextends< T[N1][N2][N3][N4][N5][N6][N7][N8][N9]> | Partial specialization for N=9 |
Cextends< T[N1][N2][N3][N4][N5][N6][N7][N8][N9][N10]> | Partial specialization for N=10 |
CExtPreAlloc | |
CF | [v_transform metafunction] |
►CFD_scheme | Finite Differences |
Cconstant_b | Encapsulation of the b term as constant |
Cfunction_b | Encapsulation of the b term as a function |
Ckey_and_eq | Equation id + space position |
Cvariable_b | Encapsulation of the b term as constant |
►CFDScheme | Finite Differences |
Cconstant_b | Encapsulation of the b term as constant |
Cgrid_b | Encapsulation of the b term as grid |
Ckey_and_eq | Equation id + space position |
CField | |
Cfill_id | Operator to fill the property 'prp' with the linearization of indexes |
Cfill_id< dim, G_v, NO_VERTEX_ID > | Operator to fill the property in case there are no properties |
CFill_one | {1,1,1,1,....} |
Cfill_prop | This class work as a functor |
Cfill_prop< dim, lin_id, dT, G_v, v, 0 > | This class work as a functor |
Cfill_prop< dim, lin_id, dT, G_v, v, 2 > | This class work as a functor |
Cfill_prop_by_type | Operator for vector and scalar property |
Cfill_prop_by_type< dim, 0, p, Graph, pos... > | Operator for vector and scalar property in the case there are no properties |
Cfill_prop_v | This class work as a functor |
Cfill_prop_v< dim, dT, G_v, v, 0 > | This class work as a functor |
Cfill_prop_v< dim, dT, G_v, v, 2 > | This class work as a functor |
Cfill_prop_v_by_type | Operator for vector and scalar property |
Cfill_prop_v_by_type< 0, p, Graph, pos... > | Operator for vector and scalar property in the case there are no properties |
CFill_three | Compile time array functor needed to generate array at compile-time of type |
CFill_two | {2,2,2,2,....} |
CFill_zero | {0,0,0,0,....} |
Cfirst_or_second | |
Cfirst_or_second< true, exp1, exp2 > | |
Cfirst_or_second_pt | |
Cfirst_or_second_pt< true, exp1, exp2 > | |
Cfirst_variadic | |
CFitz | |
Cfrswap | This class is a functor for "for_each" algorithm |
Cfrswap_nomode | This class is a functor for "for_each" algorithm |
CFt_chunk | Transform T=aggregate<float,double,int> into aggregate<std::array<float,n_ele>,std::array<double,n_ele>,std::array<int,n_ele>> |
CFt_chunk< n_ele, const T(&)[N1]> | Special case for vector |
CFtwo | [v_transform metafunction] |
Cfunction | |
CGaussianDLB | |
CGBoxes | This structure store the Box that define the domain inside the Ghost + domain box |
Cgcl | General function t get a cell-list |
Cgcl< dim, St, CellL, Vector, GCL_HILBERT > | General function t get a cell-list |
Cgcl< dim, St, CellL, Vector, GCL_SYMMETRIC > | General function t get a cell-list |
Cgcl_An | General function t get a cell-list |
Cgcl_standard_no_symmetric_impl | |
Cgcl_standard_no_symmetric_impl< true, prp... > | |
CGCoptions | Google chart options |
CgeneralDimensionFunctor | |
CgeneralDimensionFunctor< T1[N1]> | |
Cgenerate_array | Main class to generate compile-time array |
Cgenerate_array_constexpr | Main class to generate constexpr compile-time array |
Cgenerate_array_constexpr_impl | Recursive meta-function to generate compile-time array |
Cgenerate_array_constexpr_impl< T, 0, orig_N, F, args... > | Terminator of the variadic template |
Cgenerate_array_impl | Generate the array specializing ArrayHolder |
Cgenerate_array_impl< T, 0, orig_N, F, args... > | Terminator of the variadic template |
Cgenerate_array_vector | Main class to generate an array from a boost::mpl::vector of numbers |
Cgenerate_array_vector_impl | Generate the array specializing ArrayHolder |
Cgenerate_array_vector_impl< T, 0, F, args... > | Terminator of the variadic template |
Cgenerate_indexes | Main class to generate indexes data structure |
Cgenerate_indexes_impl | Generate compile time index array |
Cgenerate_indexes_impl< T, 0, orig_N, F, args... > | Terminator of the variadic template |
Cgenerate_indexes_impl< T,-1, orig_N, F, args... > | In case of an empty list |
Cger | |
Cget_base_type_for_object_creator_chunking | |
Cget_base_type_for_object_creator_chunking< std::array< T, N2 >[N1] > | |
Cget_block_sizes | This class is a functor for "for_each" algorithm |
Cget_pointer | |
Cget_pointer< 1, prp, grid_type > | |
Cget_pointer< 2, prp, grid_type > | |
Cget_pointer_unpack | |
Cget_pointer_unpack< T, true > | |
Cget_selector | |
Cget_selector< T[N1]> | |
Cget_striding | |
Cget_vcl | |
Cget_vcl< CudaMemory > | |
Cget_vector_dist_expression_op | |
Cget_vector_dist_expression_op< 1, false > | |
Cget_vector_dist_expression_op< 1, true > | |
Cget_vector_dist_expression_op< 2, true > | |
CGetAddBlockType | Get the type of the insertBlock |
CgetAttrName | Return the Attributes name from the type |
CgetAttrName< ele_g, false > | Return the Attributes name from the type |
CGetCpBlockType | Get the type of the block |
CGetSetBlockType | Get the type of the SetBlock |
CGGraph | Google Graph |
CGhost | |
Cghost_exchange_comm_impl | Template selector for asynchronous or not asynchronous |
Cghost_exchange_comm_impl< GHOST_ASYNC, layout_base, prp ... > | |
Cgid | |
►CGoogleChart | Small class to produce graph with Google chart in HTML |
Cget_value_type | |
CGraph_constructor_impl | Graph constructor function specialization |
CGraph_constructor_impl< dim, lin_id, Graph, NO_EDGE, T, dim_c, pos... > | Graph constructor function specialization |
CGraph_CSR | Structure that store a graph in CSR format or basically in compressed adjacency matrix format |
CGraph_CSR_s | Simplified implementation of Graph_CSR |
CGraphMLWriter | |
Cgrid | |
Cgrid_base | |
Cgrid_base< dim, T, S, typename memory_traits_inte< T >::type, linearizer > | This is an N-dimensional grid or an N-dimensional array with memory_traits_inte layout |
Cgrid_base< dim, T, S, typename memory_traits_lin< T >::type, linearizer > | This is an N-dimensional grid or an N-dimensional array with memory_traits_lin layout |
Cgrid_base_impl | Implementation of a N-dimensional grid |
Cgrid_call_serialize_variadic | Unpack selector |
Cgrid_call_serialize_variadic< device_grid, Memory, index_tuple< prp... > > | Unpack selector |
Cgrid_dist_amr | |
Cgrid_dist_amr< dim, St, T, AMR_IMPL_TRIVIAL, Decomposition, Memory, device_grid > | AMR Adaptive Multi Resolution Grid |
Cgrid_dist_amr_key | Amr grid distributed key |
►Cgrid_dist_amr_key_iterator | |
Cactual_it | Actual it type |
Cgrid_dist_g_dx | Distributed linearized key |
Cgrid_dist_id | This is a distributed grid |
►Cgrid_dist_id_comm | This class is an helper for the communication of grid_dist_id |
Crp_id | |
Cgrid_dist_id_iterator_dec | Given the decomposition it create an iterator |
►Cgrid_dist_id_iterator_dec_skin | Given the decomposition it create an iterator |
Cgp_sub | Internal struct |
Cgrid_dist_id_iterator_gpu | Given the decomposition it create an iterator |
Cgrid_dist_iterator | Distributed grid iterator |
►Cgrid_dist_iterator_sub | Distributed grid iterator |
Csub_set | |
Cgrid_dist_key_dx | Grid key for a distributed grid |
Cgrid_dist_lin_dx | Distributed linearized key |
Cgrid_dist_testing | |
Cgrid_gpu_ker | Grid interface available when on gpu |
Cgrid_gpu_ker_constructor_impl | |
Cgrid_gpu_ker_constructor_impl< false, T > | |
Cgrid_gpu_ker_ref | |
Cgrid_key | |
Cgrid_key_1 | |
Cgrid_key_2 | |
Cgrid_key_3 | |
Cgrid_key_4 | |
Cgrid_key_c3 | |
Cgrid_key_d | Grid_key_d is the key to access any element in the grid |
Cgrid_key_dx | Grid_key_dx is the key to access any element in the grid |
Cgrid_key_dx_expression | Expression template for grid_key_dx |
Cgrid_key_dx_iterator | |
Cgrid_key_dx_iterator_hilbert | |
Cgrid_key_dx_iterator_sp | |
Cgrid_key_dx_iterator_sub | Declaration grid_key_dx_iterator_sub |
Cgrid_key_dx_iterator_sub< 0, warn > | |
Cgrid_key_dx_iterator_sub_bc | The same as grid_key_dx_iterator_sub_p but with periodic boundary |
Cgrid_key_dx_r | Emulate grid_key_dx with runtime dimensionality |
Cgrid_key_dx_sub | Main class that encapsulate a sub expression |
Cgrid_key_dx_sum | Main class that encapsulate a sum expression |
Cgrid_key_sparse_dx_iterator | Grid key sparse iterator |
Cgrid_key_sparse_dx_iterator_sub | Grid key sparse iterator on a sub-part of the domain |
Cgrid_key_sparse_lin_dx | It store the position in space of the sparse grid |
Cgrid_skin_iterator_bc | |
Cgrid_sm | Declaration grid_sm |
Cgrid_smb | |
Cgrid_toKernelImpl | |
Cgrid_toKernelImpl< true, base_grid, dim, T > | |
Cgrid_unpack_selector_with_prp | Unpack selector |
Cgrid_unpack_selector_with_prp< true, T, device_grid, Memory > | Unpack selector |
Cgrid_unpack_with_prp | Unpack selector |
Cgrid_zm | Class that store the information of the grid like number of point on each direction and define the index linearization by stride |
Cgrid_zmb | |
CGridRawReader | |
CH5_prop_out | This class is a functor for "for_each" algorithm |
CH5_prop_out< ele_v, false > | This class is a functor for "for_each" algorithm |
CH5_write | Write an HDF5 dataset in case of scalars and vectors |
CH5_write< T[N1], pid, V > | Partial specialization for N=1 1D-Array |
CH5_write< T[N1][N2], pid, V > | Partial specialization for N=2 2D-Array |
CH5_write< T[N1][N2][N3], pid, V > | Partial specialization for N=3 |
CH5_write< T[N1][N2][N3][N4], pid, V > | Partial specialization for N=4 |
Chas_attributes | |
Chas_attributes< T, typename Void< decltype(T::attributes::name[0])>::type > | Has_attributes check if a type has defined an internal structure with attributes |
Chas_base_to_copy | |
Chas_base_to_copy< T, typename Void< typename T::base_to_copy >::type > | Has_data check if a type has defined a member data |
Chas_check_device_pointer | |
Chas_check_device_pointer< T, typename Void_dev< typename T::yes_has_check_device_pointer >::type > | Has_check_device_pointer check if a type has defined a member yes_has_check_device_pointer |
Chas_coordtype | |
Chas_coordtype< T, typename Void< typename T::coord_type >::type > | Has_data check if a type has defined a member data |
Chas_data | |
Chas_data< T, typename Void< decltype(T::data)>::type > | Has_data check if a type has defined a member data |
Chas_getGrid | |
Chas_getGrid< T, typename Void< decltype(std::declval< T >().getGrid())>::type > | |
Chas_grid_type | |
Chas_grid_type< T, typename Void< decltype(T::grid_type)>::type > | Has_grid_type check if T has defined the member grid_type |
Chas_init | Has_init check if a type has defined a method called init |
Chas_init< ObjType, typename Void< typename ObjType::has_init >::type > | |
Chas_max_prop | |
Chas_max_prop< T, false > | |
Chas_max_prop_nn | |
Chas_max_prop_nn< T, typename Void< decltype(T::max_prop)>::type > | Has_max_prop check if a type has defined a member max_prop |
Chas_noPointers | |
Chas_noPointers< T, typename Void< decltype(T::noPointers())>::type > | Has_noPointers check if a type has defined a method called noPointers |
Chas_pack | Has_Pack check if a type has defined a method called Pack |
Chas_pack< ObjType, typename Void< decltype(ObjType::pack())>::type > | |
Chas_pack_agg | Return if true the aggregate type T has a property that has a complex packing(serialization) method |
Chas_pack_agg_impl | Generate the array specializing ArrayHolder |
Chas_pack_agg_impl< T, 0, result_p, vprp > | Terminator of the variadic template |
Chas_pack_encap | |
Chas_pack_gen | It return true if the object T require complex serialization |
Chas_pack_gen< T, false > | It return true if the object T require complex serialization |
Chas_packMem | Has_calculateMem check if a type has defined a method called calculateMem |
Chas_packMem< ObjType, typename Void< decltype(ObjType::packMem())>::type > | Has_PackMem check if a type has packMem() member function |
Chas_packRequest | Has_packRequest check if a type has defined a method called packRequest |
Chas_packRequest< ObjType, typename Void< decltype(ObjType::packRequest())>::type > | |
Chas_posMask | |
Chas_posMask< T, typename Void< decltype(T::stag_mask)>::type > | Has_posMask check if a type has defined a member stag_mask |
Chas_set_d | |
Chas_set_d< T, typename Void< decltype(std::declval< T >().set_d(0, 0))>::type > | Has_move check if a type has defined a method function move |
Chas_state_vector | |
Chas_state_vector< T, typename Void< typename T::is_state_vector >::type > | |
Chas_toKernel | Has_toKernel check if a type has defined a method called toKernel |
Chas_toKernel< ObjType, typename Void< decltype(std::declval< ObjType >().toKernel())>::type > | |
Chas_typedef_type | |
Chas_typedef_type< T, typename Void< typename T::type >::type > | Has_typedef_type check if a typedef ... type inside the structure is defined |
Chas_val | Evaluate the constant field function |
Chas_val< HAS_VAL, T > | Evaluate the constant field function |
Chas_val_pos | |
Chas_val_pos< T, typename Void< typename T::with_position >::type > | Has_attributes check if a type has defined an internal structure with attributes |
Chas_value_type_ofp | |
Chas_value_type_ofp< T, typename Void< typename T::value_type >::type > | Has_value_type_ofp check if a type has defined a member value_type |
Chas_vector_kernel | |
Chas_vector_kernel< T, typename Void< typename T::vector_kernel >::type > | Has_vector_kernel check if a type has defined a member data |
Chas_vtype | |
Chas_vtype< T, typename Void< typename T::vtype >::type > | Has_data check if a type has defined a member data |
CHDF5_reader | |
CHDF5_reader< GRID_DIST > | |
CHDF5_reader< VECTOR_DIST > | |
CHDF5_writer | |
CHDF5_writer< GRID_DIST > | |
CHDF5_writer< VECTOR_DIST > | |
CHDF5_XdmfWriter | |
CHDF5_XdmfWriter< H5_POINTSET > | HDF5 writer for a point set |
CHeapMemory | This class allocate, and destroy CPU memory |
CHeatStencil | |
CHeatStencilGet | |
Chost_to_dev_all_prp | This class is a functor for "for_each" algorithm |
Chost_to_device_impl | This class is a functor for "for_each" algorithm |
CHyperCube | This class calculate elements of the hyper-cube |
Ci_box_id | It store a box, its unique id and the sub-domain from where it come from |
Ci_lbox_grid | Local Internal ghost box |
Ci_lbox_id | It store an internal ghost box, the linked external ghost box and the sub-domain from where it come from as internal ghost box |
Cibox_send | Set of internal ghost box to send |
CID_operation | |
Cids_crs | |
Cids_pl | |
Cie_ghost | Structure that store and compute the internal and external local ghost box |
Cie_ghost_gpu | Structure that store and compute the internal and external local ghost box. Version usable in kernel |
Cie_loc_ghost | Structure that store and compute the internal and external local ghost box |
Cindex_tuple | These set of classes generate an array definition at compile-time |
Cindex_tuple_sq | |
Cinit_prop | This class is a functor for "for_each" algorithm |
Cinsert_kernel2D | |
Cinsert_kernel3D | |
CInsertBlockWrapper | |
Cinte_calc_impl | Calculate the interpolation for one point |
Cinte_template | Class that select the operation to do differently if we are doing Mesh to particle (m2p) or particle to mesh (p2m) |
Cinte_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) |
Cinter_memc | This class convert a boost::mpl::fusion/vector to a boost::mpl::fusion/vector with memory_c interleaved |
Cinter_memc_red | This class convert a boost::mpl::fusion/vector to a boost::mpl::fusion/vector with memory_c<.....,MEMORY_C_REDUCED> interleaved |
Cinterp_ele | This class is a functor for "for_each" algorithm |
Cinterp_ele_sca_array | Add scalar elements |
Cinterp_ele_sca_array< copy_type, Tsrc, Tdst, Grid_src, Grid_dst, 1 > | Add 1D array elements |
Cinterp_points | This class is a functor for "for_each" algorithm |
►Cinterpolate | Main class for interpolation Particle to mest p2m and Mesh to particle m2p |
CBox_vol | |
CIntPow | |
CIntPow< base, 0 > | |
Cip_box_grid | Per-processor Internal ghost box |
Cis_aggregate | |
Cis_aggregate< T, typename Void< typename T::yes_is_aggregate >::type > | Check if a type T is an aggregate |
Cis_Box | |
Cis_Box< T, typename Void< typename T::yes_is_box >::type > | Check if a type T is an aggregate |
Cis_complex_agg | Return if true the aggregate type T has a property that has a complex packing(serialization) method |
Cis_complex_agg_impl | These set of classes generate an array definition at compile-time |
Cis_complex_agg_impl< T, 0, result_p, vprp > | Terminator of the variadic template |
Cis_const_field | |
Cis_const_field< T, typename Void< typename T::const_field >::type > | Is_constant check if a type define a constant field |
Cis_contiguos | |
Cis_csv_writable | Indicate if the property T is writable in CSV |
Cis_csv_writable< bool > | Indicate if the property T is writable in CSV |
Cis_csv_writable< char > | Indicate if the property T is writable in CSV |
Cis_csv_writable< double > | Indicate if the property T is writable in CSV |
Cis_csv_writable< float > | Indicate if the property T is writable in CSV |
Cis_csv_writable< int > | Indicate if the property T is writable in CSV |
Cis_csv_writable< long int > | Indicate if the property T is writable in CSV |
Cis_csv_writable< short > | Indicate if the property T is writable in CSV |
Cis_csv_writable< T[N1]> | Indicate if the property T is writable in CSV |
Cis_csv_writable< T[N1][N2]> | Indicate if the property T is writable in CSV |
Cis_csv_writable< T[N1][N2][N3]> | Indicate if the property T is writable in CSV |
Cis_csv_writable< unsigned char > | Indicate if the property T is writable in CSV |
Cis_csv_writable< unsigned int > | Indicate if the property T is writable in CSV |
Cis_csv_writable< unsigned long int > | Indicate if the property T is writable in CSV |
Cis_csv_writable< unsigned short > | Indicate if the property T is writable in CSV |
Cis_custom_vtk_writable | It check if the type is vtk writable |
Cis_custom_vtk_writable< ObjType, typename Void< typename ObjType::is_vtk_writable >::type > | It check if the type is vtk writable |
Cis_encap | |
Cis_encap< T, typename Void< typename T::yes_i_am_encap >::type > | Is_encap check if the type is an encap type |
Cis_expression | Is_expression check if a type is simple a type or is just an encapsulation of an expression |
Cis_expression< ObjType, typename Void< typename ObjType::is_expression >::type > | |
Cis_gpu_celllist | Check this is a gpu or cpu type cell-list |
Cis_gpu_celllist< T, typename Void< typename T::yes_is_gpu_celllist >::type > | |
Cis_gpu_ker_celllist | Check this is a gpu or cpu type cell-list |
Cis_gpu_ker_celllist< T, typename Void< typename T::yes_is_gpu_ker_celllist >::type > | |
Cis_grid | |
Cis_grid< T, typename Void< typename T::yes_i_am_grid >::type > | Is_grid check if the type is a grid |
Cis_grid_staggered | Is_grid_staggered analyse T if it has a property grid_type defined and indicate that the grid is staggered |
Cis_grid_staggered< T, false > | Is_grid_staggered analyse T if it has a property that define the type of grid |
Cis_initialized | Initialized |
Cis_initialized< openfpm::vector< T > > | Initialized |
Cis_layout_inte | |
Cis_layout_inte< T, typename Void< typename T::yes_is_inte >::type > | Is_layout_inte |
Cis_layout_mlin | |
Cis_layout_mlin< T, typename Void< typename T::yes_is_tlin >::type > | Is_layout_mlin |
Cis_multiple_buffer_each_prp | Is_multiple_buffer_each_prp |
Cis_multiple_buffer_each_prp< T, true > | |
Cis_openfpm_native | Is_openfpm_native check if a type is an openfpm native structure type |
Cis_openfpm_native< T, true > | |
Cis_Point | |
Cis_Point< T, typename Void< typename T::yes_is_point >::type > | Check if a type T is an aggregate |
Cis_testing | |
Cis_testing< T, typename Void< typename T::testing >::type > | Is_testing check if a struct T has testing member defined |
Cis_typedef_and_data_same | Check if T::type and T.data has the same type |
Cis_typedef_and_data_same< false, T > | |
Cis_typedef_and_data_same< true, SpaceBox< dim, St > > | |
Cis_typedef_and_data_same< true, wavefront< dim > > | |
Cis_vector | |
Cis_vector< T, typename Void< typename T::yes_i_am_vector >::type > | Is_grid check if the type is a vector |
Cis_vector_dist | |
Cis_vector_dist< T, typename Void< typename T::yes_i_am_vector_dist >::type > | Is_grid check if the type is a vector |
Cis_vector_native | |
Cis_vector_native< T, typename Void< typename std::remove_reference< T >::type::yes_i_am_vector_native >::type > | Is_grid check if the type is a vector |
Cis_vtk_vector_dims | It check if the type is vtk writable |
Cis_vtk_vector_dims< ObjType, typename Void< decltype(ObjType::dims) >::type > | It check if the type is vtk writable |
Cis_vtk_writable | Check for T to be writable |
Cis_vtk_writable< bool > | Check bool |
Cis_vtk_writable< char > | Check char |
Cis_vtk_writable< double > | Check double |
Cis_vtk_writable< float > | Check float |
Cis_vtk_writable< int > | Check int |
Cis_vtk_writable< long int > | Check long int |
Cis_vtk_writable< short > | Check short |
Cis_vtk_writable< unsigned char > | Check unsigned char |
Cis_vtk_writable< unsigned int > | Check unsigned int |
Cis_vtk_writable< unsigned long int > | Check unsigned long int |
Cis_vtk_writable< unsigned short > | Check unsigned short |
CisDynStruct | |
CisDynStruct< ObjType, typename Void< decltype(ObjType::isCompressed())>::type > | |
Cite_g | |
Cite_gpu | |
CIterator_g_const | |
Ckey_equal | Structure required for the Sph Harmonic amplitude dictionary arguments |
Ckey_hash | Structure required for the Sph Harmonic amplitude dictionary arguments |
Ckey_int | |
Ckey_shift | |
Ckey_shift< 1, chunk > | |
Ckey_shift< 2, chunk > | |
Ckey_shift< 3, chunk > | |
Ckey_shift< 4, chunk > | |
Ckey_shift< 5, chunk > | |
Ckey_shift< 6, chunk > | |
Ckey_shift< 7, chunk > | |
Ckey_shift< 8, chunk > | |
CKillParticle | Out of bound policy it detect out of bound particles and decide what to do |
CKillParticleWithWarning | Out-of-bound policy kill the particle but print a warning |
Ckl_selector_impl | |
Ckl_selector_impl< kl_type, cl_type, 1 > | |
Ckl_selector_impl< kl_type, cl_type, 2 > | |
CL_norms | |
ClabelParticlesGhost_impl | |
ClabelParticlesGhost_impl< dim, St, prop, Memory, layout_base, Decomposition, true > | |
Clambda2_2kernel | |
Clambda4_4kernel | |
CLap | Laplacian second order on h (spacing) |
CLap< arg, Sys_eqs, CENTRAL > | Laplacian second order approximation CENTRAL Scheme |
CLap< arg, Sys_eqs, CENTRAL_SYM > | Laplacian second order approximation CENTRAL Scheme (with central derivative in the single) |
CLap_PSE | Implementation of the Laplacian kernels for PSE |
CLap_PSE< 1, T, 2, KER_GAUSSIAN > | |
CLap_PSE< 1, T, 4, KER_GAUSSIAN > | |
CLap_PSE< 1, T, 6, KER_GAUSSIAN > | |
CLap_PSE< 1, T, 8, KER_GAUSSIAN > | |
CLaplacianStencil | |
Clast_variadic | |
Clast_variadic< T1 > | |
CLastPOf | |
Claunch_call_impl | |
Claunch_call_impl< 1 > | |
Claunch_insert_sparse | |
Claunch_insert_sparse_lambda_call | |
Claunch_insert_sparse_lambda_call< 2 > | |
Claunch_insert_sparse_lambda_call< 3 > | |
Claunch_set_dense | |
Claunch_set_dense< 2 > | |
Claunch_set_dense< 3 > | |
ClBox_dom | Case for local ghost box |
CleftOperand_t | |
Clid | |
Clid_nn | [Definition of the system] |
Clid_nn_3d_eigen | Specify the general caratteristic of system to solve |
Clid_nn_3d_petsc | |
Climit_max_t | |
Cln_force | |
Cln_potential | |
CLNorms | Class for computing the l2/l_infinity norm for distributed grids and vectors based on given errors |
Cload_mask_impl | |
Cload_mask_impl< 1 > | |
Cload_mask_impl< 16 > | |
Cload_mask_impl< 2 > | |
Cload_mask_impl< 4 > | |
Cload_mask_impl< 8 > | |
CloadGhostBlock_impl | |
CloadGhostBlock_impl< 1, dim, AggregateBlockT, pMask, p, ct_params, blockEdgeSize > | |
CloadGhostBlock_impl< 2, dim, AggregateBlockT, pMask, p, ct_params, blockEdgeSize > | |
CloadGhostBlock_impl< 3, dim, AggregateBlockT, pMask, p, ct_params, blockEdgeSize > | |
CloadGhostBlock_impl< 7, dim, AggregateBlockT, pMask, p, ct_params, blockEdgeSize > | |
Clocal_ghost_from_dec_impl | |
Clocal_ghost_from_dec_impl< dim, St, prop, Memory, layout_base, true > | |
Clocal_ghost_from_opart_impl | |
Clocal_ghost_from_opart_impl< with_pos, dim, St, prop, Memory, layout_base, true > | |
CMatLabWriter | This class is able to save grid into tiff files |
CMatrix | This class implement an NxN (dense) matrix |
Cmax_ | This structure define the operation add to use with copy general |
Cmax_prop_nn | |
Cmax_prop_nn< T, false > | |
CMem_bal | Class for BALANCED cell list implementation |
CMem_fast | It is a class that work like a vector of vector |
CMem_fast_ker | |
Cmem_geto | Case memory_traits_lin |
Cmem_geto< dim, T, layout, data_type, g1_type, key_type, 1 > | Case memory_traits_inte |
Cmem_getpointer | |
Cmem_getpointer< data_type, layout, 1 > | |
CMem_mw | Class for MEMORY-WISE cell list implementation |
Cmem_reference | Metafunction take T and return a reference |
Cmem_setarray | This class is a functor for "for_each" algorithm |
Cmem_setext | Case memory_traits_lin |
Cmem_setext< grid_type, S, layout, data_type, 1 > | Case memory_traits_inte |
Cmem_setext_prp | This class is a functor for "for_each" algorithm |
Cmem_setm | Case memory_traits_lin |
Cmem_setm< S, layout, data_type, g1_type, 1 > | Case memory_traits_inte |
Cmem_setmemory | |
Cmem_setmemory< data_type, Mem_type, layout, 1 > | |
Cmem_swap | Case memory_traits_lin |
Cmem_swap< T, layout, data_type, grid_type, 1 > | Case memory_traits_inte |
Cmemory | |
Cmemory_array | This class give a representation to a chunk or memory |
Cmemory_c | |
►Cmemory_c< multi_array< T >, MEMORY_C_STANDARD, D > | Specialization of memory_c for multi_array |
Cascending | In combination with generate_array is used to produce array at compile-time |
Cmemory_c< T, MEMORY_C_STANDARD, D > | This class is a container for the memory interface like HeapMemory CudaMemory |
Cmemory_thrust_c | This class is a container for the memory interface |
Cmemory_traits_inte | Transform the boost::fusion::vector into memory specification (memory_traits) |
Cmemory_traits_lin | Transform the boost::fusion::vector into memory specification (memory_traits) |
Cmemory_traits_lin_type | Transform the boost::fusion::vector into memory specification (memory_traits) |
Cmemory_traits_lin_type< T, false > | Small meta-function to get the type of the memory |
Cmerge_ | This structure define the operation add to use with copy general |
Cmet_sub_w | Sub-domain list and weight |
Cmeta_compare | This class compare general objects |
Cmeta_compare< T[N1]> | Partial specialization for N=1 1D-Array |
Cmeta_compare< T[N1][N2]> | Partial specialization for N=2 2D-Array |
Cmeta_compare< T[N1][N2][N3]> | Partial specialization for N=3 |
Cmeta_copy | This class copy general objects |
Cmeta_copy< T[N1]> | Partial specialization for N=1 1D-Array |
Cmeta_copy< T[N1][N2]> | Partial specialization for N=2 2D-Array |
Cmeta_copy< T[N1][N2][N3]> | Partial specialization for N=3 |
Cmeta_copy< T[N1][N2][N3][N4]> | Partial specialization for N=4 |
Cmeta_copy< T[N1][N2][N3][N4][N5]> | Partial specialization for N=5 |
Cmeta_copy< T[N1][N2][N3][N4][N5][N6]> | Partial specialization for N=6 |
Cmeta_copy< T[N1][N2][N3][N4][N5][N6][N7]> | Partial specialization for N=7 |
Cmeta_copy< T[N1][N2][N3][N4][N5][N6][N7][N8]> | Partial specialization for N=8 |
Cmeta_copy< T[N1][N2][N3][N4][N5][N6][N7][N8][N9]> | Partial specialization for N=9 |
Cmeta_copy< T[N1][N2][N3][N4][N5][N6][N7][N8][N9][N10]> | Partial specialization for N=10 |
Cmeta_copy_block | |
Cmeta_copy_block< copy_type[N1], nprp, prp_val, prp_id > | |
Cmeta_copy_block< copy_type[N1][N2], nprp, prp_val, prp_id > | |
Cmeta_copy_d | Copy for a source object to a destination |
Cmeta_copy_d< Tsrc, Tdst[N1]> | Partial specialization for N=1 1D-Array |
Cmeta_copy_d< Tsrc, Tdst[N1][N2]> | Partial specialization for N=2 2D-Array |
Cmeta_copy_d< Tsrc[N1], Tdst > | Partial specialization for N=1 1D-Array |
Cmeta_copy_d< Tsrc[N1], Tdst[N1]> | Partial specialization for N=1 1D-Array |
Cmeta_copy_d< Tsrc[N1][N2], Tdst > | Partial specialization for N=2 2D-Array |
Cmeta_copy_d< Tsrc[N1][N2], Tdst[N1][N2]> | Partial specialization for N=1 1D-Array |
Cmeta_copy_op | This class copy general objects applying an operation |
Cmeta_copy_op< op, openfpm::detail::multi_array::sub_array_openfpm< T, 1, vmpl > > | Partial specialization for N=1 1D-Array |
Cmeta_copy_op< op, openfpm::detail::multi_array::sub_array_openfpm< T, 2, vmpl > > | Partial specialization for N=2 2D-Array |
Cmeta_copy_op< op, T[N1]> | Partial specialization for N=1 1D-Array |
Cmeta_copy_op< op, T[N1][N2]> | Partial specialization for N=2 2D-Array |
Cmeta_copy_op< op, T[N1][N2][N3]> | Partial specialization for N=3 |
Cmeta_copy_op_d | |
Cmeta_copy_op_d< op, openfpm::detail::multi_array::sub_array_openfpm< Tsrc, 1, vmpl >, openfpm::detail::multi_array::sub_array_openfpm< Tdst, 1, vmpl > > | Partial specialization for N=2 2D-Array |
Cmeta_copy_op_d< op, openfpm::detail::multi_array::sub_array_openfpm< Tsrc, 2, vmpl >, openfpm::detail::multi_array::sub_array_openfpm< Tdst, 2, vmpl > > | Partial specialization for N=2 2D-Array |
Cmeta_copy_op_d< op, Tsrc, Tdst[N1]> | Partial specialization for N=1 1D-Array |
Cmeta_copy_op_d< op, Tsrc[N1], Tdst > | Partial specialization for N=1 1D-Array |
Cmeta_copy_op_d< op, Tsrc[N1], Tdst[N1]> | Partial specialization for N=1 1D-Array |
Cmeta_copy_op_d< op, Tsrc[N1][N2], Tdst[N1][N2]> | Partial specialization for N=2 2D-Array |
Cmeta_copy_set_bck | |
Cmeta_copy_set_bck< T[N]> | |
Cmeta_prop | This class is an helper to create properties output from scalar and compile-time array elements |
Cmeta_prop< I, ele_g, St, T, false > | Specialication when is not writable |
Cmeta_prop< I, ele_g, St, T[N1], is_writable > | Partial specialization for N=1 1D-Array |
Cmeta_prop< I, ele_g, St, T[N1][N2], is_writable > | Partial specialization for N=2 2D-Array |
Cmeta_prop< I, ele_g, St, T[N1][N2][N3], is_writable > | Partial specialization for N=3 3D-Array |
Cmeta_prop_new | This class is an helper to create properties output from scalar and compile-time array elements |
Cmeta_prop_new< I, ele_g, St, T, false > | Specialication when is not writable |
Cmeta_prop_new< I, ele_g, St, T[N1], is_writable > | Partial specialization for N=1 1D-Array |
Cmeta_prop_new< I, ele_g, St, T[N1][N2], is_writable > | Partial specialization for N=2 2D-Array |
Cmeta_prop_new< I, ele_g, St, T[N1][N2][N3], is_writable > | Partial specialization for N=3 3D-Array |
Cmeta_raw_read | This is the scalar case |
Cmeta_raw_read< dim, Tg, Tr[nv], i > | This is the vector case |
CMetaFunc | [Metafunction definition] |
CMetaFuncOrd | |
CMetaParser | |
CMethodOfImages | Class for getting mirror particles to impose Neumann BCs |
CMetis | Helper class to define Metis graph |
CMetis_graph | Metis graph structure |
CMetisDistribution | Class that distribute sub-sub-domains across processors using Metis Library |
Cmheader | This structure contain the information of a chunk |
Cmin_ | This structure define the operation add to use with copy general |
Cminus | It ancapsulate the minus operation |
CModelCustom | Model for Dynamic load balancing |
CModelCustom2 | Second model for dynamic load balancing |
CModelLin | Linear model |
CModelSquare | Linear model |
CMonomial | |
CMonomial_gpu | |
CMonomialBasis | |
Cmove_impl | |
Cmove_impl< false, grid_key_base, dim > | |
Cmp4_kernel | |
Cmp_funct | |
Cmp_funct_impl | |
Cmp_funct_impl< dim, T[N1]> | |
Cmp_funct_impl< dim, T[N1][N2]> | |
CMPI_IAllGatherW | General recv for vector of |
CMPI_IAllGatherW< char > | Specialization for vector of char |
CMPI_IAllGatherW< double > | Specialization for vector of double |
CMPI_IAllGatherW< float > | Specialization for vector of float |
CMPI_IAllGatherW< int > | Specialization for vector of integer |
CMPI_IAllGatherW< long int > | Specialization for vector of long int |
CMPI_IAllGatherW< short > | Specialization for vector of short |
CMPI_IAllGatherW< size_t > | Specialization for vector of size_t |
CMPI_IAllGatherW< unsigned char > | Specialization for vector of unsigned char |
CMPI_IAllGatherW< unsigned int > | Specialization for vector of unsigned integer |
CMPI_IAllGatherW< unsigned short > | Specialization for vector of short |
CMPI_IAllGatherWB | Set of wrapping classing for MPI_Irecv |
CMPI_IallreduceW | Set of wrapping classing for MPI_Iallreduce |
CMPI_IallreduceW< char > | Specialization for char |
CMPI_IallreduceW< double > | Specialization for double |
CMPI_IallreduceW< float > | Specialization for float |
CMPI_IallreduceW< int > | Specialization for integer |
CMPI_IallreduceW< long int > | Specialization for size_t |
CMPI_IallreduceW< short > | Specialization for short |
CMPI_IallreduceW< size_t > | Specialization for size_t |
CMPI_IallreduceW< unsigned char > | Specialization for char |
CMPI_IallreduceW< unsigned int > | Specialization for unsigned integer |
CMPI_IallreduceW< unsigned short > | Specialization for short |
CMPI_IBcastW | General recv for vector of |
CMPI_IBcastW< char > | Specialization for char |
CMPI_IBcastW< double > | Specialization for double |
CMPI_IBcastW< float > | Specialization for float |
CMPI_IBcastW< int > | Specialization for vector of integer |
CMPI_IBcastW< long int > | Specialization for size_t |
CMPI_IBcastW< short > | Specialization for short |
CMPI_IBcastW< size_t > | Specialization for size_t |
CMPI_IBcastW< unsigned char > | Specialization for char |
CMPI_IBcastW< unsigned int > | Specialization for unsigned integer |
CMPI_IBcastW< unsigned short > | Specialization for short |
CMPI_IBcastWB | Set of wrapping classing for MPI_Irecv |
CMPI_IrecvW | General recv for vector of |
CMPI_IrecvW< char > | Specialization for char |
CMPI_IrecvW< double > | Specialization for double |
CMPI_IrecvW< float > | Specialization for float |
CMPI_IrecvW< int > | Specialization for vector of integer |
CMPI_IrecvW< long int > | Specialization for size_t |
CMPI_IrecvW< short > | Specialization for short |
CMPI_IrecvW< size_t > | Specialization for size_t |
CMPI_IrecvW< unsigned char > | Specialization for char |
CMPI_IrecvW< unsigned int > | Specialization for unsigned integer |
CMPI_IrecvW< unsigned short > | Specialization for short |
CMPI_IrecvWB | Set of wrapping classing for MPI_Irecv |
CMPI_IsendW | General send for a vector of any type |
CMPI_IsendW< char, Mem, gr > | Specialization for char |
CMPI_IsendW< double, Mem, gr > | Specialization for double |
CMPI_IsendW< float, Mem, gr > | Specialization for float |
CMPI_IsendW< int, Mem, gr > | Specialization for vector of integer |
CMPI_IsendW< long int, Mem, gr > | Specialization for size_t |
CMPI_IsendW< short, Mem, gr > | Specialization for short |
CMPI_IsendW< size_t, Mem, gr > | Specialization for size_t |
CMPI_IsendW< unsigned char, Mem, gr > | Specialization for char |
CMPI_IsendW< unsigned int, Mem, gr > | Specialization for unsigned integer |
CMPI_IsendW< unsigned short, Mem, gr > | Specialization for short |
CMPI_IsendWB | Set of wrapping classing for MPI_Isend |
Cmul | It model an expression expr1 * expr2 |
Cmul_inte | Multiply the src by coeff for several types T |
Cmul_inte< T[N1]> | Multiply the src by coeff for several types T |
Cmul_inte< T[N1][N2]> | Multiply the src by coeff for several types T |
Cmult | This class multiply all the elements in a boost::mpl::vector excluding the first element |
Cmult< T, 1 > | |
Cmulti_array | This class is a trick to indicate the compiler a specific specialization pattern |
Cmulti_mask | |
Cmulti_mask< 1 > | |
Cmulti_mask< 16 > | |
Cmulti_mask< 2 > | |
Cmulti_mask< 4 > | |
Cmulti_mask< 8 > | |
CMultiArrayViewGpu | |
CMultiArrayViewGpu< BaseT, Nup, 0 > | |
Cmutable_or_not | |
Cmutable_or_not< T, true > | |
Cmy_particle | |
Cmy_struct | |
CN_box | |
CN_operation | |
CNarrowBand | Class for getting the narrow band around the interface |
Cnative_encapsulated_type | |
Cnb_f | |
►Cne_cp | |
Cattributes | Define attributes names |
►Cnm_e | Sub-domain edge graph node |
Cattributes | Attributes name |
►Cnm_part_e | Reduced edge graph node |
Cattributes | Attributes name |
►Cnm_part_v | Reduced sub-domain vertex graph node |
Cattributes | Attributes name |
►Cnm_v | |
Cattributes | Attributes name |
CNN_gpu_int_base | |
CNN_gpu_int_base_hr_impl | |
CNN_gpu_it | |
CNN_gpu_it< dim, cnt_type, ids_type, r_int, true > | |
CNN_gpu_it_radius | |
CNN_gpu_selector | |
CNN_gpu_selector< dim, cnt_type, ids_type, true > | |
CNN_index | |
CNN_index< NN_index_sort > | |
Cnn_prcs | This class store the adjacent processors and the adjacent sub_domains |
Cnn_type_result | |
Cnn_type_result< void, NN2_type > | |
CNNc_array | |
CNNc_array< dim, size, false > | |
CNNFull | |
CNNfull_is_padding_impl | Check if is padding |
CNNfull_is_padding_impl< 2 > | Check if is padding |
CNNfull_is_padding_impl< 3 > | Check if is padding |
CNNStar | |
CNNStar_c | |
CNNType | Get the neighborhood iterator based on type |
CNNType< dim, T, CellListImpl, PartIt, VL_CRS_SYMMETRIC, local_index > | Get the neighborhood iterator based on type |
CNNType< dim, T, CellListImpl, PartIt, VL_SYMMETRIC, local_index > | Get the neighborhood iterator based on type |
CNNType< dim, T, CellListImpl, PartIt, WITH_RADIUS, local_index > | Get the neighborhood iterator based on type |
CNNTypeM | Get the neighborhood iterator based on type |
CNNTypeM< dim, T, CellListImpl, PartIt, VL_CRS_SYMMETRIC > | Get the neighborhood iterator based on type |
CNNTypeM< dim, T, CellListImpl, PartIt, VL_SYMMETRIC > | Get the neighborhood iterator based on type |
CNo_check | |
Cno_edge | Class with no edge |
Cno_equation | Specify the general characteristic of system to solve |
Cno_field | Stub field |
Cno_stencil | No stencil |
Cno_transform | No transformation |
Cno_transform_only | No transformation |
CNoCheck | Class to check if the edge can be created or not |
►Cnode_cp | |
Cattributes | Attributes name |
CnoPointers_sequence | It return a boost::mpl::vector of integers where each integer identify one object without the method "noPointers" |
CnoPointers_sequence_impl | Implementation of noPointer_sequence_impl |
CnoPointers_sequence_impl< v, p1 > | Implementation of noPointer_sequence_impl |
Cnot_on_test | Not on testing mode |
CNothing | Out-of-bound policy do nothing |
Cnumber_prop | |
Cnumber_prop< T, 0 > | Return the number of properties the type T has |
Cobject | This is a container to create a general object |
Cobject_creator | It create a boost::fusion vector with the selected properties |
Cobject_creator< v > | Specialization when no properties are passed |
Cobject_creator_chunking | |
Cobject_creator_chunking< v > | Specialization when no properties are passed |
Cobject_creator_chunking_encapsulator | |
Cobject_creator_chunking_impl | Implementation of object creator |
Cobject_creator_chunking_impl< v, vc, p1, prp... > | Implementation of object creator |
Cobject_creator_chunking_impl< v, vc, prp > | Implementation of object creator |
Cobject_creator_impl | Implementation of object creator |
Cobject_creator_impl< v, vc, p1, prp... > | Implementation of object creator |
Cobject_creator_impl< v, vc, prp > | Implementation of object creator |
Cobject_s_di | It copy the properties from one object to another |
Cobject_s_di< v_src, v_dst, OBJ_ENCAP, prp... > | It copy the properties from one object to another |
Cobject_s_di< v_src, v_dst, OBJ_ENCAP_CHUNKING, prp... > | |
Cobject_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) |
Cobject_s_di_e | This class is a functor for "for_each" algorithm |
Cobject_s_di_e_cnk | This class is a functor for "for_each" algorithm |
Cobject_s_di_e_cnk_meta_copy_selector | |
Cobject_s_di_e_cnk_meta_copy_selector< T[N1]> | |
Cobject_s_di_e_op | This class is a functor for "for_each" algorithm |
Cobject_s_di_e_op_cnk | This class is a functor for "for_each" algorithm |
Cobject_s_di_f | This class is a functor for "for_each" algorithm |
Cobject_s_di_f_op | This class is a functor for "for_each" algorithm |
Cobject_s_di_op | It copy the properties from one object to another applying an operation |
Cobject_s_di_op< op, v_src, v_dst, OBJ_ENCAP, prp... > | It copy the properties from one object to another applying an operation |
Cobject_s_di_op< op, v_src, v_dst, OBJ_ENCAP_CHUNKING, prp... > | It copy the properties from one object to another applying an operation |
Cobject_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 |
Cobject_si_d | It copy the properties from one object to another |
Cobject_si_d< v_src, v_dst, OBJ_ENCAP > | |
Cobject_si_d< v_src, v_dst, OBJ_ENCAP, prp... > | It copy the properties from one object to another |
Cobject_si_d< v_src, v_dst, OBJ_ENCAP_CHUNKING, prp... > | It copy the properties from one object to another |
Cobject_si_d< v_src, v_dst, OBJ_NORMAL, prp... > | It copy the properties from one object to another |
Cobject_si_d_e | This class is a functor for "for_each" algorithm |
Cobject_si_d_e_cnk | This class is a functor for "for_each" algorithm |
Cobject_si_d_e_cnk_meta_copy_selector | |
Cobject_si_d_e_cnk_meta_copy_selector< T[N1]> | |
Cobject_si_d_f | This class is a functor for "for_each" algorithm |
Cobject_si_di | It copy the properties from one object to another applying an operation |
Cobject_si_di< v_src, v_dst, OBJ_ENCAP, prp... > | It copy the properties from one object to another applying an operation |
Cobject_si_di_e | |
Cobject_si_di_e_op | This class is a functor for "for_each" algorithm |
Cobject_si_di_op | It copy the properties from one object to another applying an operation |
Cobject_si_di_op< op, v_src, v_dst, OBJ_ENCAP, prp... > | It copy the properties from one object to another applying an operation |
CObserverFunctor | |
Coffset_mv | It contain the offset necessary to move to coarser and finer level grids |
Con_test | [Constant fields struct definition] |
Cop_ssend_gg_recv_merge | Helper class to merge data |
Cop_ssend_gg_recv_merge_impl | Helper class to merge data without serialization |
Cop_ssend_gg_recv_merge_impl< true > | Helper class to merge data with serialization |
Cop_ssend_gg_recv_merge_impl_run_device | Helper class to merge data without serialization, using host memory |
Cop_ssend_gg_recv_merge_impl_run_device_direct | Helper class to merge data without serialization direct transfer to CUDA buffer |
Cop_ssend_gg_recv_merge_run_device | Helper class to merge data |
Cop_ssend_recv_add | Helper class to add data |
Cop_ssend_recv_add_sr | Helper class to add data without serialization |
Cop_ssend_recv_add_sr< true > | Helper class to add data with serialization |
Cop_ssend_recv_merge | Helper class to merge data |
Cop_ssend_recv_merge_gpu | Helper class to merge data |
Cop_ssend_recv_merge_gpu_impl | Helper class to merge data without serialization |
Cop_ssend_recv_merge_gpu_impl< true, op, vector_type_opart, vector_type_prc_offset > | Helper class to merge data with serialization |
Cop_ssend_recv_merge_impl | Helper class to merge data without serialization |
Cop_ssend_recv_merge_impl< true, op, vector_type_opart > | Helper class to merge data with serialization |
CORB | This class implement orthogonal recursive bisection |
CORB_node | ORB node |
Cp_box | It store all the boxes of the near processors in a linear array |
Cpack_pack_op | |
Cpack_request_op | |
Cpack_request_op< true, obj_type, Mem > | |
CPack_selector | Pack selector |
CPack_selector_array_prim | |
CPack_selector_array_prim< T, true > | |
CPack_selector_impl | It is not a fundamental type |
CPack_selector_impl< T, true > | Select the primitive packing |
CPack_selector_known_type_impl | Pack selector for unknown type |
CPack_selector_known_type_impl< T, HAS_PACKER > | |
CPack_selector_known_type_impl< T, IS_ENCAP > | |
CPack_selector_known_type_impl< T, IS_GRID > | |
CPack_selector_unknown_type_impl | Pack selector for unknown type |
CPack_selector_unknown_type_impl< T, 0 > | |
CPack_selector_unknown_type_impl< T, 2 > | Pack selector for unknown type |
CPack_selector_unknown_type_impl< T, 3 > | |
CPack_stat | Packing status object |
Cpack_unpack_cond_with_prp | There is max_prop inside |
Cpack_unpack_cond_with_prp_inte_lin | |
Cpack_unpack_cond_with_prp_inte_lin< T, true > | |
Cpack_with_iterator | Pack an N-dimensional grid into a vector like structure B given an iterator of the grid |
Cpack_with_iterator< false, dim, grid, encap_src, encap_dst, boost_vct, it, dtype, prp... > | Pack an N-dimensional grid into a vector like structure B given an iterator of the grid |
Cpack_with_iterator< true, 1, grid, encap_src, encap_dst, boost_vct, it, dtype, prp... > | Pack an N-dimensional grid into a vector like structure B given an iterator of the grid |
Cpack_with_iterator< true, 2, grid, encap_src, encap_dst, boost_vct, it, dtype, prp... > | Pack an N-dimensional grid into a vector like structure B given an iterator of the grid |
Cpack_with_iterator< true, 3, grid, encap_src, encap_dst, boost_vct, it, dtype, prp... > | Pack an N-dimensional grid into a vector like structure B given an iterator of the grid |
Cpack_with_iterator_longx | |
Cpack_with_iterator_longx< 2, obj_byte, git, grid > | |
Cpack_with_iterator_longx< 3, obj_byte, git, grid > | |
Cpack_with_iterator_shortx | |
Cpack_with_iterator_shortx< 2, n_cpy, obj_byte, git, grid > | |
Cpack_with_iterator_shortx< 3, n_cpy, obj_byte, git, grid > | |
CPacker | Packing class |
CPacker< T, Mem, PACKER_ARRAY_CP_PRIMITIVE > | |
CPacker< T, Mem, PACKER_ARRAY_PRIMITIVE > | Packer for primitives |
CPacker< T, Mem, PACKER_ENCAP_OBJECTS > | |
CPacker< T, Mem, PACKER_ENCAP_OBJECTS_CHUNKING > | |
CPacker< T, Mem, PACKER_GENERAL > | Packer class for vectors |
CPacker< T, Mem, PACKER_GRID > | Packer for grids and sub-grids |
CPacker< T, Mem, PACKER_OBJECTS_WITH_POINTER_CHECK > | Packer class for objects |
CPacker< T, Mem, PACKER_OBJECTS_WITH_WARNING_POINTERS > | Packer for objects, with impossibility to check for internal pointers |
CPacker< T, Mem, PACKER_PRIMITIVE > | Packer for primitives |
CPadding | Class that contain Padding information on each direction positive and Negative direction |
Cpar_struct | |
CParmetis | Helper class to define Metis graph |
CParmetis_dist_graph | Metis graph structure |
CParmetis_graph | Metis graph structure |
CParMetisDistribution | Class that distribute sub-sub-domains across processors using ParMetis Library |
CParticleIt_CellP | |
CParticleIt_Cells | This iterator iterate across the particles of a Cell-list following the Cell structure |
CParticleItCRS_Cells | This iterator iterate across the particles of a Cell-list following the Cell structure |
CPartItNN | In general different NN scheme like full symmetric or CRS require different iterators over particles this class select the proper one |
CPartItNN< 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 |
Cperiodicity | Boundary conditions |
Cperiodicity_int | Boundary conditions |
Cpetsc_AMG_report | Class to test AMG solvers |
Cpetsc_solver | In case T does not match the PETSC precision compilation create a stub structure |
►Cpetsc_solver< double > | This class is able to do Matrix inversion in parallel with PETSC solvers |
CitError | Contain the infinity norm of the residual at each iteration |
Csolv_bench_info | It contain the benchmark information for each solver |
CPoint | This class implement the point shape in an N-dimensional space |
CPoint2D_test | Test structure used for several test |
Cpoint_and_gid | |
Cpoint_expression | Main class that encapsulate a constant number used in a point expression |
Cpoint_expression< const T[dim]> | Specialization for a const array of dimension dim |
Cpoint_expression< openfpm::detail::multi_array::sub_array_openfpm< T, 1, vmpl > > | Specialization for views |
Cpoint_expression< T[dim]> | Specialization for an array of dimension dim as expression |
Cpoint_expression_op | Unknown operation specialization |
Cpoint_expression_op< orig, exp1, exp2, POINT_DIV > | Division operation |
Cpoint_expression_op< orig, exp1, exp2, POINT_MUL > | Multiplication operation |
Cpoint_expression_op< orig, exp1, exp2, POINT_MUL_POINT > | Multiplication operation |
Cpoint_expression_op< orig, exp1, exp2, POINT_NORM > | Point norm operation |
Cpoint_expression_op< orig, exp1, exp2, POINT_NORM2 > | Point square norm operation |
Cpoint_expression_op< orig, exp1, exp2, POINT_NORM_INF > | Point norm Infinity operation |
Cpoint_expression_op< orig, exp1, exp2, POINT_SUB > | Subtraction operation |
Cpoint_expression_op< orig, exp1, exp2, POINT_SUB_UNI > | Expression that subtract two points |
Cpoint_expression_op< orig, exp1, exp2, POINT_SUM > | Sum operation |
CPoint_orig | Definition of a class Point in plain C++ and boost::vector for testing purpose |
Cpoint_scalar_process | |
Cpoint_scalar_process< val_type, is_sort, true > | |
CPoint_test | Test structure used for several test |
►CPoint_test_prp | Test structure used for several test |
Cattributes | Attributes name |
►CPoint_test_scal | Point test with only scalar properties |
Cattributes | Attributes name |
Cpointer_check | |
CPointIterator | This class draw particles on subset of grid-like position |
CPointIteratorSkin | This class draw particles on subset of grid-like position |
Cpoisson_nn_helm | |
CPolarEv | |
Cpopulate_cell_list_no_sym_impl | |
Cpopulate_cell_list_no_sym_impl< true > | |
Cpopulate_cell_list_sym_impl | |
Cpopulate_cell_list_sym_impl< true > | |
Cpos_or_propL | Selector for position or properties left side expression |
Cpos_or_propL< vector, PROP_POS > | Selector for position or properties left side |
Cpos_or_propL_ker | Selector for position or properties left side expression |
Cpos_or_propL_ker< vector, PROP_POS > | Selector for position or properties left side |
Cpos_or_propR | Selector for position or properties right side position |
Cpos_or_propR< vector, PROP_POS > | Selector for position or properties right side |
Cpos_pc | |
Cpos_v | Structure that contain a reference to a vector of particles |
Cpos_val | |
Cpost_increment_sub_impl | |
CPPInterpolation | Class for Creating the DCPSE Operator For the function approximation objects and computes DCPSE Kernels |
Cprint_warning_on_adjustment | Declaration print_warning_on_adjustment |
Cproc_box_id | Processor id and box id |
Cproc_without_prp | Process the particle without properties |
Cproc_without_prp_device | Process the particle without properties |
Cprocess_data_block | |
Cprocess_data_block< T[N1], dim, blockEdgeSize > | |
CProcess_keys_grid | Class for an hilbert order processing of cell keys for CellList_gen implementation |
CProcess_keys_hilb | Class for an hilbert order processing of cell keys for CellList_gen implementation |
CProcess_keys_lin | |
Cprocess_receive_mem_traits_inte | This class is a functor for "for_each" algorithm |
Cprop_id | |
Cprop_out_edge | This class is a functor for "for_each" algorithm |
Cprop_out_g | This class is a functor for "for_each" algorithm |
Cprop_out_v | This class is a functor for "for_each" algorithm |
Cprop_out_v_pvtp | This class is a functor for "for_each" algorithm |
Cprop_out_vertex | This class is a functor for "for_each" algorithm |
Cprop_output | This class specialize functions in the case the type T has or not defined attributes |
Cprop_output< false, Graph, i > | This class specialize functions in the case the type T has not defined attributes |
Cprop_output_array_scalar_selector_edge | Property writer for scalar and vector |
Cprop_output_array_scalar_selector_edge< true > | Property writer for vector |
Cprop_output_array_scalar_selector_edge_fill_vertex | Property writer for scalar and vector, it fill the vertex data (needed for edge representation in vtk) |
Cprop_output_array_scalar_selector_edge_fill_vertex< true > | Property writer for vector |
Cprop_output_array_scalar_selector_vertex | Property writer for scalar and vector |
Cprop_output_array_scalar_selector_vertex< true > | Property writer for vector |
Cprop_write_out | Write the vectror property |
Cprop_write_out< 1, T > | Write the scalar property |
Cprop_write_out_new | Write the vectror property |
Cprop_write_out_new< 1, T > | Write the scalar property |
CpropCheckINF | This class is a functor for "for_each" algorithm |
CpropCheckNAN | This class is a functor for "for_each" algorithm |
Cprp_all_zero | Structure to convert a variadic template into boost::mpl::vector |
Cprp_all_zero< T, true, prp ... > | |
CPSEError | |
Cptr_info | |
CPtrMemory | This class give memory from a preallocated memory, memory destruction is not performed |
Cpush_back_op | |
Cpush_back_op< false, false, T, S > | |
Cpush_back_op< false, true, T, S > | |
Cpush_back_op< true, true, T, S > | |
Cpush_back_op_neste | Pack/add function selector |
Cpush_back_op_neste< true, T, S > | Pack/add function selector |
Cpush_back_std_op_neste | Pack/add function selector |
Cpush_back_std_op_neste< true, T, S > | |
CPV_cl | |
Cr_type_dim | It return the dimansionality of the operation given the dimensionality of the 2 operators |
Cr_type_dim< 1, 1, POINT_DIV > | Scalar / scalar = scalar |
Cr_type_dim< 1, 1, POINT_MUL > | Scalar * scalar = scalar |
Cr_type_dim< 1, 1, POINT_SUB > | Scalar - scalar = scalar |
Cr_type_dim< 1, 1, POINT_SUM > | Scalar + scalar = scalar |
Cr_type_dim< op1_dim, op2_dim, POINT_MUL_POINT > | Point * Point = scalar |
Cr_type_p | Return type of the expression |
Cr_type_p< 1, orig > | Return type of the expression |
Crank_gen | Like std::rank but it also work for openfpm structures like Point where it return 1 |
Crank_gen< T, true > | |
Craw_read | This class is a functor for "for_each" algorithm |
Crcv_rm | |
Cred | Temporal buffer for reductions |
Cred_max | Get the reference of the selected element |
Cred_min | |
Cred_sum | |
CRedist_options | Structure to bundle options for redistancing |
CRedistancingSussman | Class for reinitializing a level-set function into a signed distance function using Sussman redistancing |
Creduce_op | This class is a functor for "for_each" algorithm |
Creduce_op_final | This class is a functor for "for_each" algorithm |
Creduce_type | In general a reduction of a type T produce a type T |
Creduce_type< double[]> | A reduction operation on an array of double is a double |
Creduce_type< float[]> | A reduction operation on an array of float is a float |
Creduce_type< int[]> | A reduction operation on an array of int is an int |
Cref_wrap | |
Cremove_attributes_const_ref | T_to_memory_c is a metafunction that given T it convert it into |
Creplace_ | This structure define the operation add to use with copy general |
Creport_cell_list_func_tests | |
Creport_cell_list_preord_tests | |
Creport_grid_copy_func_tests | |
Creport_grid_iterator_test | |
Creport_sparse_grid_tests | |
Creport_vector_func_tests | |
Creport_vector_gg_map_tests | |
Creport_verlet_tests | |
Cresult_box | Result of the itersection of a box with an array of boxes |
CRGB | RGB color struct |
CRhsBlockWrapper | |
CRhsBlockWrapper< BlockT[N1][N2]> | |
CRhsBlockWrapper< BlockT[N]> | |
CRHSFunctor | |
Crid | |
CrightOperand_t | |
Crval | It store one row value of a vector |
Crval< T, EIGEN_RVAL > | It store one row value of a vector |
Crval< T, PETSC_RVAL > | It store one row value of a vector |
Csadd_ | |
Csadd_block_ | |
Cse_class3_vector | This class check for inconsistency access |
Cselector_chunking_prp_has_zero_size | |
Cselector_chunking_prp_has_zero_size< true, T, T_nc, prp... > | |
Cselvg | |
Cselvg< false > | |
Cseq_traits_impl | Implementation of seq_traits |
Cset_buf_pointer_for_each_prop | This class is a functor for "for_each" algorithm |
Cset_buf_size_for_each_prop | This class is a functor for "for_each" algorithm |
Cset_compile_condition | |
Cset_compile_condition< false > | |
Cset_zero | Meta-function to return a compatible zero-element |
Cset_zero< Point< dim, T > > | Create a point with all compunent set to zero |
CsetBackground_impl | This class is a functor for "for_each" algorithm |
Csgrid_cpu | |
Cshift | |
Cshift_only | |
Cshift_ph | |
Cshift_vect_converter | In case of high dimensions shift vector converter |
CSimpleRNG | SimpleRNG 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 |
CSkeletonStencil | |
Cskip_init | |
Cskip_init< true, T > | |
CsLeft_ | |
Csmax_ | |
Csmax_block_ | |
Csmin_ | |
Csmin_block_ | |
CsolError | It contain statistic of the error of the calculated solution |
Cspace_key_dx | Grid_key_dx is the key to access any element in the grid |
CSpaceBox | This class represent an N-dimensional box |
CSpaceDistribution | Class that distribute sub-sub-domains across processors using an hilbert curve to divide the space |
Csparse_grid_bck_value | |
Csparse_grid_bck_wrapper_impl | |
Csparse_grid_bck_wrapper_impl< openfpm::detail::multi_array::sub_array_openfpm< T, 1, vmpl > > | |
Csparse_grid_gpu_index | Element index contain a data chunk index and a point index |
Csparse_grid_section | |
CSparseGridGpu | |
CSparseGridGpu_iterator | |
CSparseGridGpu_iterator_sub | |
CSparseGridGpu_ker | |
Csparsegridgpu_pack_impl | This class is a functor for "for_each" algorithm |
Csparsegridgpu_pack_request | This class is a functor for "for_each" algorithm |
Csparsegridgpu_unpack_impl | This class is a functor for "for_each" algorithm |
CSparseMatrix | Sparse Matrix implementation |
CSparseMatrix< T, id_t, EIGEN_BASE > | |
CSparseMatrix< T, id_t, PETSC_BASE > | Sparse Matrix implementation, that map over Eigen |
CSphere | This class implement the Sphere concept in an N-dimensional space |
CsRight_ | |
Cstag_create_and_add_grid | It create separated grid for each properties to write them into a file |
Cstag_set_position | This class is a functor for "for_each" algorithm |
Cstag_set_position< dim, v, false > | This class is a functor for "for_each" algorithm |
Cstaggered_grid_dist | Implementation of the staggered grid |
Cstate_type_1d_ofp | A 1d Odeint and Openfpm compatible structure |
Cstate_type_2d_ofp | A 2d Odeint and Openfpm compatible structure |
Cstate_type_3d_ofp | A 3d Odeint and Openfpm compatible structure |
Cstate_type_4d_ofp | A 4d Odeint and Openfpm compatible structure |
Cstate_type_5d_ofp | A 5d Odeint and Openfpm compatible structure |
Cstate_type_ofpm_add_elements | |
Cstate_type_ofpm_add_elements< 0, state_type, list ... > | |
Cstate_type_ofpm_impl | |
Cstatic_array | |
Cstd_array_copy_chunks | |
Cstd_array_copy_chunks< prop, T[N1]> | |
Cstd_array_vector_view | |
Cstencil_offset_compute | Structure for stencil iterator |
Cstore_reduce_op_final | This class is a functor for "for_each" algorithm |
Cstriding | |
Cstub_or_real | In case of testing return a stub grid |
Cstub_or_real< T, dims, stype, decomposition, false > | Case when we are not on testing |
Csubar_dim | Return the dimension of the sub_array |
CSubHyperCube | This represent a sub-hyper-cube of an hyper-cube like a face or an edge of a cube |
Csublin | |
Csublin< 1, chunk > | |
Csublin< 2, chunk > | |
Csublin< 3, chunk > | |
Csublin< 4, chunk > | |
Csublin< 5, chunk > | |
Csublin< 6, chunk > | |
Csublin< 7, chunk > | |
Csublin< 8, chunk > | |
Csubsub | Sub-sub-domain |
Csubsub_lin | Linearized version of subsub |
Csum | It model an expression expr1 + ... exprn |
Csum_ele | |
Csum_ele< boost::mpl::int_< op1 >, ele > | |
Csum_ele< boost::mpl::na, ele > | |
Csum_functor_value | Sum functor value |
CSupport | |
CSupportBuilder | |
CSupportBuilderGPU | |
Cswitch_copy_host_to_device | This class is a functor for "for_each" algorithm |
Cswitcher_get_v | |
Cswitcher_get_v< vector, comp_dev > | |
Csys_nn | |
Csys_pp | |
Csyss_nn | |
Csyss_pp | |
CSystem | System of equations |
Ct_to_memory_c | Meta-function t_to_memory_c |
Ct_to_memory_c_impl | Partial specialization for scalar N=0 |
Ct_to_memory_c_impl< T[N1]> | Partial specialization for N=1 |
Ct_to_memory_c_impl< T[N1][N2]> | Partial specialization for N=2 |
Ct_to_memory_c_impl< T[N1][N2][N3]> | Partial specialization for N=3 |
Ct_to_memory_c_impl< T[N1][N2][N3][N4]> | Partial specialization for N=4 |
Ct_to_memory_c_impl< T[N1][N2][N3][N4][N5]> | Partial specialization for N=5 |
Ct_to_memory_c_impl< T[N1][N2][N3][N4][N5][N6]> | Partial specialization for N=6 |
Ct_to_memory_c_impl< T[N1][N2][N3][N4][N5][N6][N7]> | Partial specialization for N=7 |
Ct_to_memory_c_impl< T[N1][N2][N3][N4][N5][N6][N7][N8]> | Partial specialization for N=8 |
Ct_to_memory_c_impl< T[N1][N2][N3][N4][N5][N6][N7][N8][N9]> | Partial specialization for N=9 |
Ct_to_memory_c_impl< T[N1][N2][N3][N4][N5][N6][N7][N8][N9][N10]> | Partial specialization for N=10 |
Ct_to_memory_c_red | Meta-function t_to_memory_c_red |
Ct_to_memory_c_red_impl | Partial specialization for scalar N=0 |
Ct_to_memory_c_red_impl< T[N1]> | Partial specialization for N=1 |
Ct_to_memory_c_red_impl< T[N1][N2]> | Partial specialization for N=2 |
Ct_to_memory_c_red_impl< T[N1][N2][N3]> | Partial specialization for N=3 |
Ct_to_memory_c_red_impl< T[N1][N2][N3][N4]> | Partial specialization for N=4 |
Ct_to_memory_c_red_impl< T[N1][N2][N3][N4][N5]> | Partial specialization for N=5 |
Ctensor | |
Ctensor< int, s1, s2, s3 > | |
Ctest_box_vpack | |
Ctest_chunking3 | |
Ctest_grid_type_no_def | |
Ctest_grid_type_normal | |
Ctest_grid_type_staggered | [Define structures] |
►Ctest_has_attributes | [Check has_posMask struct definition] |
Cattributes | Define attribute names |
Ctest_has_max_prop | Test type for has_max_prop |
Ctest_has_no_max_prop | Test type for has_max_prop |
Ctest_has_posMask | [Check has_posMask struct definition] |
Ctest_no_attributes | |
Ctest_no_has_posMask | Test type for has_posMask |
CTiffWriter | This class is able to save grid into tiff files |
Ctimer | Class for cpu time benchmarking |
CTimes | Time structure for statistical purposes |
Cto_boost_vmpl | |
Cto_int_sequence | |
Cto_memory_multi_array_ref_view | OpenFPM use memory_c<multi_array<T> ..... > to implement the structure of array layout |
Cto_variadic_const_impl | Recursive specialization of to_variadic |
Cto_variadic_const_impl< c, end, ele, true, vars ... > | Terminator of to_variadic |
Cto_variadic_impl | Recursive specialization of to_variadic |
Cto_variadic_impl< c, end, true, vars ... > | Terminator of to_variadic |
CtoKernel_transform | |
CtoKernel_transform< layout_base, T, 0 > | |
CtoKernel_transform< layout_base, T, 1 > | |
CtoPoint | |
Ctransform_if_temporal | |
Ctransform_if_temporal< vector_dist_expression< 0, openfpm::vector_gpu< aggregate< T > > > > | |
Ctriplet | It store the non zero elements of the matrix |
Ctriplet< T, EIGEN_TRIPLET > | It store one non-zero element in the sparse matrix |
Ctriplet< T, PETSC_BASE > | It store one non-zero element in the sparse matrix |
Ctype_identity | |
Ctype_is_one | |
CtypeCheck | Type check in case of unknown type |
CtypeCheck< tcheck, true > | Type check in case of supported type |
CtypeCheck< tcheck[N1], foundamental > | Type check in case of supported array type |
CtypeCheck< tcheck[N1][N2], foundamental > | Type check in case of supported 2D array type |
CUIntDivCeil | |
Cumfpack_solver | Stub when library compiled without eigen |
Cumfpack_solver< double > | Stub when library compiled without eigen |
Cunpack_each_prop_buffer | |
Cunpack_selector_with_prp | |
Cunpack_selector_with_prp< true, T, S, layout_base, Memory > | |
Cunpack_selector_with_prp_lin | |
Cunpack_selector_with_prp_lin< true, T, S, layout_base, Memory > | |
CUnpack_stat | Unpacking status object |
Cunpack_with_iterator | Pack an N-dimensional grid into a vector like structure B given an iterator of the grid |
Cunpack_with_iterator< 3, grid, encap_src, encap_dst, boost_vct, it, stype, prp ... > | Pack an N-dimensional grid into a vector like structure B given an iterator of the grid |
CUnpacker | Unpacker class |
CUnpacker< T, Mem, PACKER_ARRAY_CP_PRIMITIVE > | |
CUnpacker< T, Mem, PACKER_ARRAY_PRIMITIVE > | |
CUnpacker< T, Mem, PACKER_ENCAP_OBJECTS_CHUNKING > | Unpacker for encapsulated objects |
CUnpacker< T, Mem, PACKER_GENERAL > | Unpacker for vectors |
CUnpacker< T, Mem, PACKER_GRID > | Unpacker for grids |
CUnpacker< T, Mem, PACKER_OBJECTS_WITH_POINTER_CHECK > | Unpacker class for objects |
CUnpacker< T, Mem, PACKER_OBJECTS_WITH_WARNING_POINTERS > | Unpacker for objects with no possibility to check for internal pointers |
CUnpacker< T, Mem, PACKER_PRIMITIVE > | Unpacker for primitives |
Cunroll_with_to_kernel | |
Cunroll_with_to_kernel< false, true, T > | |
Cunroll_with_to_kernel< true, true, T > | |
Cut_start | Boost unit test fixation (start procedure to call before testing) |
Cv_box | |
Cv_info | |
Cv_mem_mutable | |
CV_p | Vertex class that encapsulate an object T |
Cv_transform | |
Cv_transform_impl | Recursive specialization of v_transform |
Cv_transform_impl< H, F, L, true, Args... > | Terminator of to_variadic |
Cv_transform_two | |
Cv_transform_two_impl | Recursive specialization of v_transform in case of metafunction with 2 argument |
Cv_transform_two_impl< H, arg0, F, L, true, Args... > | Terminator of to_variadic |
Cv_transform_two_v2 | |
Cv_transform_two_v2_impl | Recursive specialization of v_transform in case of metafunction with 2 argument |
Cv_transform_two_v2_impl< H, arg0, F, L, true, Args... > | Terminator of to_variadic |
Cvalue_function | |
CVandermonde | |
CVandermondeRowBuilder | |
Cvariadic_caller | |
Cvariadic_caller< index_tuple_sq< prp ... > > | |
►CVcluster | Implementation of VCluster class |
Cbase_info | Base info |
Cindex_gen | |
Cindex_gen< index_tuple< prp... > > | Process the receive buffer using the specified properties (meta-function) |
CMetaFuncOrd | Metafunction |
CVcluster_base | This class virtualize the cluster of PC as a set of processes that communicate |
CVcluster_log | Vcluster log |
Cvect_dist_key_dx | Grid key for a distributed grid |
CVector | Sparse Matrix implementation stub object when OpenFPM is compiled with no linear algebra support |
►Cvector< T, CudaMemory, memory_traits_inte, grow_policy_double, STD_VECTOR > | Implementation of 1-D std::vector like structure |
Clayout_base__ | |
CVector< T, EIGEN_BASE > | |
►Cvector< T, HeapMemory, memory_traits_lin, grow_p, STD_VECTOR > | Implementation of 1-D std::vector like structure |
Clayout_base__ | |
CVector< T, PETSC_BASE > | PETSC vector for linear algebra |
Cvector< T, PtrMemory, memory_traits_lin, gp, STD_VECTOR > | |
Cvector_custd_ker | Grid interface available when on gpu |
Cvector_dist | Distributed vector |
►Cvector_dist_comm | This class is an helper for the communication of vector_dist |
Cproc_with_prp | Process the particle with properties |
Cset_mem_retained_buffers | |
Cset_mem_retained_buffers< true, send_vector, v_mpl > | |
Cset_mem_retained_buffers_inte | Set the buffer for each property |
Cvector_dist_expression | Main class that encapsulate a vector properties operand to be used for expressions construction |
Cvector_dist_expression< 0, openfpm::vector< aggregate< T >, memory, layout_base > > | Sub class that encapsulate a vector properties operand to be used for expressions construction Temporal Expressions |
Cvector_dist_expression< 0, openfpm::vector_gpu< aggregate< T > > > | Sub class that encapsulate a GPU vector properties operand to be used for expressions construction Temporal Expressions |
Cvector_dist_expression< 16384, point > | This class represent a constant parameter in a vector expression |
Cvector_dist_expression< prp, double > | Main class that encapsulate a double constant |
Cvector_dist_expression< prp, float > | Main class that encapsulate a float constant |
Cvector_dist_expression_comp_proxy_sel | Expression implementation computation selector |
Cvector_dist_expression_comp_proxy_sel< false > | |
Cvector_dist_expression_comp_sel | Expression implementation computation selector |
Cvector_dist_expression_comp_sel< comp_dev, false > | |
Cvector_dist_expression_comp_sel< comp_host, true > | |
Cvector_dist_expression_impl | Main class that encapsulate a vector properties operand to be used for expressions construction Temporal Expressions |
Cvector_dist_expression_op | Unknown operation specialization |
Cvector_dist_expression_op< exp1, boost::mpl::int_< n >, VECT_COMP > | It take an expression and take the component |
Cvector_dist_expression_op< exp1, exp2, VECT_DIV > | Division operation |
Cvector_dist_expression_op< exp1, exp2, VECT_MUL > | Multiplication operation |
Cvector_dist_expression_op< exp1, exp2, VECT_SUB > | Subtraction operation |
Cvector_dist_expression_op< exp1, exp2, VECT_SUM > | Sum operation |
Cvector_dist_expression_op< exp1, vector_type, VECT_APPLYKER_IN > | Apply kernel operation |
Cvector_dist_expression_op< exp1, vector_type, VECT_APPLYKER_IN_GEN > | Apply kernel operation |
Cvector_dist_expression_op< exp1, vector_type, VECT_APPLYKER_IN_GEN_SORT > | Apply kernel operation |
Cvector_dist_expression_op< exp1, vector_type, VECT_APPLYKER_IN_SIM > | Apply kernel operation |
Cvector_dist_expression_op< exp1, vector_type, VECT_APPLYKER_IN_SIM_SORT > | Apply kernel operation |
Cvector_dist_expression_op< exp1, vector_type, VECT_APPLYKER_IN_SORT > | Apply kernel operation |
Cvector_dist_expression_op< exp1, void, VECT_NORM_INF > | Expression that encapsulate a vector Norm INF expression |
Cvector_dist_expression_op< exp1, void, VECT_SUB_UNI > | It take an expression and create the negatove of this expression |
Cvector_dist_expression_op< exp1, void, VECT_SUM_REDUCE > | Expression that encapsulate a vector reduction expression |
Cvector_dist_iterator | Iterator that Iterate across particle indexes |
Cvector_dist_iterator_subset | Iterator that Iterate across particle indexes |
Cvector_dist_ker_list | This class contain a list of all tracked vector_dist_ker around |
Cvector_dist_op_compute_op | |
Cvector_dist_op_compute_op< prp, false, comp_host > | |
Cvector_dist_subset | |
Cvector_dist_ws | |
Cvector_expression_transform | |
Cvector_expression_transform< vector, true > | |
Cvector_fr | Implementation of 1-D std::vector like structure |
Cvector_is_sort_result | |
Cvector_printer | This class is a functor for "for_each" algorithm |
Cvector_reduce_selector | |
Cvector_reduce_selector< false > | |
Cvector_result | |
Cvector_result< void, v2_type > | |
CVerletList | Class for Verlet list implementation |
CVerletListM | Class for Verlet list implementation with Multiphase |
CVerletNNIterator | Iterator for the neighborhood of the cell structures |
CVerletNNIteratorM | Iterator for the neighborhood of the cell structures |
►Cvertex | Sub-domain vertex graph node |
Cattributes | Attributes name |
►Cvertex2 | |
Cattributes | Attributes name |
►Cvertex3 | |
Cattributes | Attributes name |
Cvertex_node | This class is a functor for "for_each" algorithm |
Cvertex_prop | This class is a functor for "for_each" algorithm |
Cvl_selector_impl | |
Cvl_selector_impl< false, vl_type, cl_type, 2 > | |
Cvl_selector_impl< is_sorted, vl_type, cl_type, 1 > | |
Cvl_selector_impl< true, vl_type, cl_type, 2 > | |
Cvmpl_create_constant | |
Cvmpl_reduce_prod | |
Cvmpl_reduce_prod_impl | |
Cvmpl_reduce_prod_impl< c, accu, stop, vmpl, true > | Terminator of to_variadic |
Cvmpl_reduce_prod_stop | |
Cvmpl_reduce_prod_stop< vmpl,-1 > | |
Cvmpl_sum_constant | |
Cvmpl_sum_constant< ele, boost::mpl::vector< vars ... > > | |
Cvmpl_sum_constant_impl | |
CVoid | Void structure |
CVoid_dev | Void structure |
Cvtk_dims | If it has not dims property defined the object is considered scalar |
Cvtk_dims< ObjType, true > | Return the dimansionality of the object |
Cvtk_dist_edge_node | This class is a functor for "for_each" algorithm |
Cvtk_dist_vertex_node | This class is a functor for "for_each" algorithm |
Cvtk_dist_vertex_node< G, false > | This class is a functor for "for_each" algorithm |
Cvtk_dist_vertex_node_array_scalar_selector | |
Cvtk_dist_vertex_node_array_scalar_selector< true > | |
Cvtk_edge_node | This class is a functor for "for_each" algorithm |
Cvtk_type | Vtk type |
Cvtk_type< T, false > | Vtk type |
Cvtk_vertex_node | This class is a functor for "for_each" algorithm |
Cvtk_vertex_node< G, false > | This class is a functor for "for_each" algorithm |
Cvtk_vertex_node_array_scalar_selector | |
Cvtk_vertex_node_array_scalar_selector< true > | |
Cvtk_write | Write a property that has attributes |
Cvtk_write< ele, vtk, false > | Add to the vtk writer the key |
CVTKWriter | |
CVTKWriter< Graph, DIST_GRAPH > | |
CVTKWriter< Graph, VTK_GRAPH > | |
CVTKWriter< pair, VECTOR_GRIDS > | |
►CVTKWriter< pair, VECTOR_POINTS > | |
Cdoubleint | |
CVTKWriter< pair, VECTOR_ST_GRIDS > | |
CVTKWriter< vector, VECTOR_BOX > | |
►Cvx | |
Cattributes | Attributes name |
Cwavefront | This class represent a wavefront of dimension dim |
Cwrap_unordered_map | Wrapper of the unordered map |
Cwrite_stag | Classes to copy each component into a grid and add to the VTKWriter the grid |
Cwrite_stag< T[N1]> | For each component add a grid fill it, and add to the VTK writer |
Cwrite_stag< T[N1][N2]> | Partial specialization for N=2 2D-Array |
Cz_kernel | |
Cz_kernel< st, 1 > | |
Cz_kernel< st, 2 > | |
Cz_kernel< st, 3 > | |
Cz_kernel< st, 4 > | |
Czero_t | |