OpenVDB  6.0.0
Class Hierarchy
This inheritance list is sorted roughly, but not completely, alphabetically:
[detail level 123]
 CInternalNode< _ChildNodeType, Log2Dim >::TopologyUnion< OtherInternalNode >::A
 CInternalNode< _ChildNodeType, Log2Dim >::TopologyIntersection< OtherInternalNode >::A
 CInternalNode< _ChildNodeType, Log2Dim >::TopologyDifference< OtherInternalNode >::A
 CABTransformThis class implements the Transformer functor interface (specifically, the isAffine(), transform() and invTransform() methods) for a transform that maps an A grid into a B grid's index space such that, after resampling, A's index space and transform match B's index space and transform
 CAttributeArray::AccessorBaseAccessor base class for AttributeArray storage where type is not available
 CAccessorEval< CodecType, ValueType >Accessor to call unsafe get and set methods based on templated Codec and Value
 CAccessorEval< UnknownCodec, ValueType >Partial specialization when Codec is not known at compile-time to use the supplied functor instead
 CActivationOp< TreeType >
 CAdaptiveLeafNodePointCount< PointIndexLeafNode >
 CAdaptivePrimBuilder
 CAddNodes< TreeType >
 CAdvect
 CAdvectionDeformer< VelGridT, IntegrationOrder, Staggered, FilterT >
 CAdvectionOp< PointDataGridT, VelGridT, AdvectFilterT, FilterT >
 CAlphaMask< GridT, MaskT, SamplerT, FloatT >
 CAppendAttributeOp< PointDataTreeT >
 CAppendAttributeOp< PointDataGridT, ValueT >
 CAppendAttributeOp< PointDataGridT, DummySampleType >
 CArchiveGrid serializer/unserializer
 CArray< T >
 CArrayProcessor< ValueType, OpType >Helper class used internally by processTypedArray()
 CAttributeArrayBase class for storing attribute data
 CAttributeHandle< ValueType, CodecType >
 CAttributeHandle< StringIndexType, openvdb::v6_0::points::StringCodec< false > >
 CAttributeHandlesCache read and write attribute handles to amortize construction cost
 CAttributeHashFilter< RandGenT, IntType >
 CAttributeTypeConversion< ValueType, CodecType >
 CAttributeTypeConversion< Name, CodecType >
 CLevelSetFilter< GridT, MaskT, InterruptT >::Filter::Avg< Axis >
 CInternalNode< _ChildNodeType, Log2Dim >::TopologyDifference< OtherInternalNode >::B
 CBaseCameraAbstract base class for the perspective and orthographic cameras
 CRootNodeMask::BaseIterator
 CBaseMaskIterator< NodeMask >Base class for the bit mask iterators
 CBasePointScatter< PointAccessorType, RandomGenerator, InterruptType >Forward declaration of base class
 CBaseShaderAbstract base class for the shaders
 CBaseStencil< DerivedType, GridT, IsSafe >
 CBaseStencil< BoxStencil< GridT, IsSafe >, GridT, IsSafe >
 CBaseStencil< BoxStencil< GridT, true >, GridT, true >
 CBaseStencil< CurvatureStencil< GridT, IsSafe >, GridT, IsSafe >
 CBaseStencil< DenseStencil< GridT, IsSafe >, GridT, IsSafe >
 CBaseStencil< FourthOrderDenseStencil< GridT, IsSafe >, GridT, IsSafe >
 CBaseStencil< GradStencil< GridT, IsSafe >, GridT, IsSafe >
 CBaseStencil< NineteenPointStencil< GridT, IsSafe >, GridT, IsSafe >
 CBaseStencil< SecondOrderDenseStencil< GridT, IsSafe >, GridT, IsSafe >
 CBaseStencil< SevenPointStencil< GridT, IsSafe >, GridT, IsSafe >
 CBaseStencil< SixthOrderDenseStencil< GridT, IsSafe >, GridT, IsSafe >
 CBaseStencil< ThirteenPointStencil< GridT, IsSafe >, GridT, IsSafe >
 CBaseStencil< WenoStencil< GridT, IsSafe >, GridT, IsSafe >
 CBBox< Vec3T >Axis-aligned bounding box
 CBBox< PosType >
 CBBox< Vec3d >
 CBBoxFilter
 CBBoxFilter< ParticleArrayType, IndexT >
 CBBoxFilter< PointArray, IndexT >
 CBIAS_SCHEME< bgs >
 CBIAS_SCHEME< FIRST_BIAS >
 CBIAS_SCHEME< HJWENO5_BIAS >
 CBIAS_SCHEME< SECOND_BIAS >
 CBIAS_SCHEME< THIRD_BIAS >
 CBIAS_SCHEME< WENO5_BIAS >
 CBinaryFilter< T1, T2, And >
 CBinPointIndicesOp< PointArray, PointIndexType, VoxelOffsetType >
 CGroupHandle::BitMask
 CBoolSampler
 CBoxSampler
 CBuildMoveMapsOp< DeformerT, TreeT, FilterT >
 CBuildPrimarySegment< TreeType, Operation >
 CBuildSecondarySegment< TreeType, Operation >
 CCachedDeformer< T >::Cache
 CCachedDeformer< T >A Deformer that caches the resulting positions from evaluating another Deformer
 CAttributeHandles::CacheHandleOpCreate a handle and reinterpret cast as an int handle to store
 CCacheItem< TreeCacheT, NodeVecT, AtRoot >
 CCacheItem< TreeCacheT, NodeVecT, true >The tail of a compile-time list of cached node pointers, ordered from LeafNode to RootNode
 CCacheItem< ValueAccessor, SubtreeT, boost::mpl::size< SubtreeT >::value==1 >
 CCalculatePositionBounds< PositionArrayT >
 CCanConvertType< FromType, ToType >CanConvertType<FromType, ToType>::value is true if a value of type ToType can be constructed from a value of type FromType
 CCanConvertType< math::Vec2< T >, math::Vec2< T > >
 CCanConvertType< math::Vec3< T >, math::Vec3< T > >
 CCanConvertType< math::Vec4< T >, math::Vec4< T > >
 CCanConvertType< PointDataIndex32, PointIndex32 >
 CCanConvertType< PointIndex32, PointDataIndex32 >
 CCanConvertType< T, math::Vec2< T > >
 CCanConvertType< T, math::Vec3< T > >
 CCanConvertType< T, math::Vec4< T > >
 CCanConvertType< T, ValueMask >
 CCanConvertType< T0, math::Vec2< T1 > >
 CCanConvertType< T0, math::Vec3< T1 > >
 CCanConvertType< T0, math::Vec4< T1 > >
 CCanConvertType< ValueMask, T >
 CChangeBackgroundOp< TreeOrLeafManagerT >
 CChangeLevelSetBackgroundOp< TreeOrLeafManagerT >
 CCheckDivergence< GridT, TreeIterT, DiffScheme >Checks the divergence against a range
 CCheckEikonal< GridT, TreeIterT, StencilT >Checks the norm of the gradient at zero-crossing voxels against a range
 CCheckFinite< GridT, TreeIterT >Checks for both NaN and inf values, i.e. any value that is not finite
 CCheckFogVolume< GridType >Class that performs various types of checks on fog volumes
 CCheckInf< GridT, TreeIterT >Checks for infinite values, e.g. 1/0 or -1/0
 CCheckLevelSet< GridType >Class that performs various types of checks on narrow-band level sets
 CCheckMagnitude< GridT, TreeIterT >Check that the magnitude of a value, a, is close to a fixed magnitude, b, given a fixed tolerance c. That is | |a| - |b| | <= c
 CCheckMax< GridT, TreeIterT >Checks a value against a maximum
 CCheckMin< GridT, TreeIterT >Checks a value against a minimum
 CCheckNan< GridT, TreeIterT >Checks NaN values
 CCheckNormGrad< GridT, TreeIterT, GradScheme >Checks the norm of the gradient against a range, i.e., |∇Φ| ∈ [min, max]
 CCheckRange< GridT, MinInclusive, MaxInclusive, TreeIterT >Checks a value against a range
 CInternalNode< _ChildNodeType, Log2Dim >::ChildAll
 CLeafNode< T, Log2Dim >::ChildAll
 CInternalNode< _ChildNodeType, Log2Dim >::ChildOff
 CLeafNode< T, Log2Dim >::ChildOff
 CInternalNode< _ChildNodeType, Log2Dim >::ChildOn
 CLeafNode< T, Log2Dim >::ChildOn
 CClosestPointDist< Index32LeafT >
 CClosestPointProjector< CptGridT >
 CClosestSurfacePoint< GridT >Accelerated closest surface point queries for narrow band level sets
 CCollapseAttributeOp< ValueType, PointDataTreeT >
 CCollapseAttributeOp< Name, PointDataTreeT >
 CCombineArgs< AValueType, BValueType >This struct collects both input and output arguments to "grid combiner" functors used with the tree::TypedGrid::combineExtended() and combine2Extended() methods. AValueType and BValueType are the value types of the two grids being combined
 CCombineLeafNodes< TreeType >
 CCombineOpAdapter< AValueT, CombineOp, BValueT >Helper class to adapt a three-argument (a, b, result) CombineOp functor into a single-argument functor that accepts a CombineArgs struct
 CRemoveSelfIntersectingSurface< TreeType >::Comp
 CCompactAttributesOp< PointDataTreeT >
 CCompatibleTypes< FromType, ToType >
 CCompatibleTypes< math::Vec2< T >, math::Vec2< T > >
 CCompatibleTypes< math::Vec2< T0 >, math::Vec2< T1 > >
 CCompatibleTypes< math::Vec3< T >, math::Vec3< T > >
 CCompatibleTypes< math::Vec3< T0 >, math::Vec3< T1 > >
 CCompatibleTypes< math::Vec4< T >, math::Vec4< T > >
 CCompatibleTypes< math::Vec4< T0 >, math::Vec4< T1 > >
 CCompatibleTypes< T, math::Vec2< T > >
 CCompatibleTypes< T, math::Vec3< T > >
 CCompatibleTypes< T, math::Vec4< T > >
 CCompatibleTypes< T, T >
 CCompatibleTypes< ValueMask, T >
 CCompositeFunctorTranslator< OP, ValueT >Translator that converts an enum to compositing functor types
 CCompositeFunctorTranslator< DS_ADD, ValueT >
 CCompositeFunctorTranslator< DS_MAX, ValueT >
 CCompositeFunctorTranslator< DS_MIN, ValueT >
 CCompositeFunctorTranslator< DS_MULT, ValueT >
 CCompositeFunctorTranslator< DS_OVER, ValueT >
 CCompositeFunctorTranslator< DS_SUB, ValueT >
 CCompoundMap< FirstMapType, SecondMapType >Creates the composition of two maps, each of which could be a composition. In the case that each component of the composition classified as linear an acceleration AffineMap is stored
 CCompReplaceOp< TreeT >
 CComputeActiveVoxelCount< VolumePtrType >
 CComputeAuxiliaryData< InputTreeType >
 CComputeExtremas< ParticleArrayT >
 CComputeIntersectingVoxelSign< TreeType, MeshDataAdapter >
 CComputeNeumannVelocityOp< Vec3GridT, GradientT >
 CComputeNodeConnectivity< TreeType >
 CComputePointOrderOp< PointIndexType >
 CComputePoints< InputTreeType >
 CComputePolygons< TreeType, PrimBuilder >
 CConnectNodeMaskSegments< TreeType, NodeType >
 CConstrainedPointAdvect< GridT, PointListT, StaggeredVelocity, CptGridType, InterrupterType >
 CSparseStencilMatrix< ValueType_, STENCIL_SIZE >::ConstRowRead-only accessor to a row of this matrix
 CConstructVoxelMask< TreeType >
 CSparseStencilMatrix< ValueType_, STENCIL_SIZE >::ConstValueIterIterator over the stored values in a row of this matrix
 CContainer
 CContiguousOp< ValueT, PointWiseOp >Wrapper struct used to avoid unnecessary computation of memory access from Coord when all offsets are guaranteed to be within the dense grid
 CConversionDummy class for tag dispatch of conversion constructors
 CConversionTraits< T >
 CConversionTraits< openvdb::Name >
 CConvertGrid< FromGridT, ToGridT >
 CConvertGrid< GridT, GridT >
 CConvertPointDataGridAttributeOp< PointDataTreeType, Attribute, FilterT >
 CConvertPointDataGridGroupOp< PointDataTreeType, Group, FilterT >
 CConvertPointDataGridPositionOp< PointDataTreeType, Attribute, FilterT >
 CCoordSigned (x, y, z) 32-bit integer coordinates
 CCoordBBoxAxis-aligned bounding box of signed integer coordinates
 CCopyableOpApplier< IterT, OpT >
 CCopyableOpTransformer< InIterT, OutTreeT, OpT >
 CCopyArray< T >
 CCopyConstness< FromType, ToType >
 CCopyConstness< const FromType, ToType >
 CCopyFromDense< _TreeT, _DenseT >Copy the values from a dense grid into an OpenVDB tree
 CCopyFromVecOp< TreeValueType, VIndexTreeType, VectorValueType >Functor for use with LeafManager::foreach() to populate a tree with values from a vector
 CCopyGroupOp< PointDataTreeType >Copy a group attribute value from one group offset to another
 CCopyLeafNodes< TreeT >
 CMorphology< TreeType >::CopyMasks
 CCopyOp< T >
 CCopyToDense< _TreeT, _DenseT >Copy an OpenVDB tree into an existing dense grid
 CCopyToVecOp< VectorValueType, SourceTreeType >Functor for use with LeafManager::foreach() to populate a vector with the values of a tree's active voxels
 CCopyTraits< T >
 CCopyTraits< math::Coord >
 CCopyTraits< math::Vec2< T > >
 CCopyTraits< math::Vec3< T > >
 CCopyTraits< math::Vec4< T > >
 CCpt< InGridT, MaskGridType, InterruptT >Compute the closest-point transform of a scalar grid
 CCPT< MapType, DiffScheme >Compute the closest-point transform to a level set
 CCPT_RANGE< MapType, DiffScheme >Compute the closest-point transform to a level set
 CCpuTimerSimple timer for basic profiling
 CCreateOrderedPointIndexArrayOp< PointIndexType >
 CCsgVisitorBase< TreeType >
 CCurl< GridT, MaskGridType, InterruptT >Compute the curl of a vector grid
 CCurl< MapType, DiffScheme >Compute the curl of a vector-valued grid using differencing of various orders in the space defined by the range of the map
 CCurl< UniformScaleMap, CD_2ND >Full template specialization of Curl
 CCurl< UniformScaleMap, DiffScheme >Partial template specialization of Curl
 CCurl< UniformScaleTranslateMap, CD_2ND >Full template specialization of Curl
 CCurl< UniformScaleTranslateMap, DiffScheme >Partial template specialization of Curl
 CD1< DiffScheme >
 CD1< BD_1ST >
 CD1< BD_2ND >
 CD1< BD_3RD >
 CD1< BD_HJWENO5 >
 CD1< BD_WENO5 >
 CD1< CD_2ND >
 CD1< CD_2NDT >
 CD1< CD_4TH >
 CD1< CD_6TH >
 CD1< FD_1ST >
 CD1< FD_2ND >
 CD1< FD_3RD >
 CD1< FD_HJWENO5 >
 CD1< FD_WENO5 >
 CD1Vec< DiffScheme >
 CD1Vec< CD_2ND >
 CD1Vec< CD_2NDT >
 CD1Vec< CD_4TH >
 CD1Vec< CD_6TH >
 CD2< DiffScheme >
 CD2< CD_FOURTH >
 CD2< CD_SECOND >
 CD2< CD_SIXTH >
 CDDA< RayT, Log2Dim >A Digital Differential Analyzer specialized for OpenVDB grids
 CDDA< RayT, LeafT::TOTAL >
 CDDA< RayT, NodeT::TOTAL >
 CDDA< RayType, NodeT::TOTAL >
 CTree< _RootNodeType >::DeallocateNodes< NodeType >
 CInternalNode< _ChildNodeType, Log2Dim >::DeepCopy< OtherInternalNode >
 CDefault< ValueType >
 CDeformerTraits< DeformerT >Deformer Traits for optionally configuring deformers to be applied in index-space. The default is world-space
 CDeleteByFilterOp< PointDataTreeT, FilterT >
 CDelta< T >Delta for small floating-point offsets
 CDelta< double >
 CDelta< float >
 CDenseBase< ValueT, Layout >Base class for Dense which is defined below
 CDenseBase< ValueT, LayoutXYZ >Partial template specialization of DenseBase
 CDenseBase< ValueT, LayoutZYX >Partial template specialization of DenseBase
 CDenseTransformer< _ValueT, OpType >Class that applies a functor to the index space intersection of a prescribed bounding box and the dense grid. NB: This class only supports DenseGrids with ZYX memory layout
 CDescriptor
 CVector< T >::DeterministicDotProductOp
 CDiagnose< GridT >Performs multithreaded diagnostics of a grid
 CDiagnose< GridType >
 CDiffLeafNodeMask< TreeType >
 CDilateOp< TreeT >
 CDilationOp< TreeT >Class that performs multi-threaded dilation with support for active tiles
 CDimToWord< Log2Dim >Mapping from a Log2Dim to a data type of size 2^Log2Dim bits
 CDimToWord< 3 >
 CDimToWord< 4 >
 CDimToWord< 5 >
 CDimToWord< 6 >
 CDimToWord< LEAF_LOG2DIM >
 CDiracDelta< RealT >Smeared-out and continuous Dirac Delta function
 CDirichletBoundaryOp< ValueType >Dirichlet boundary condition functor
 CDiscreteField< VelGridT, Interpolator >Thin wrapper class for a velocity grid
 CDivergence< InGridT, MaskGridType, InterruptT >Compute the divergence of a vector grid
 CDivergence< MapType, DiffScheme >Compute the divergence of a vector-valued grid using differencing of various orders, the result defined with respect to the range-space of the map
 CDivergence< ScaleMap, CD_2ND >
 CDivergence< ScaleMap, DiffScheme >
 CDivergence< ScaleTranslateMap, CD_2ND >
 CDivergence< ScaleTranslateMap, DiffScheme >
 CDivergence< TranslationMap, DiffScheme >
 CDivergence< UniformScaleMap, CD_2ND >
 CDivergence< UniformScaleMap, DiffScheme >
 CDivergence< UniformScaleTranslateMap, CD_2ND >
 CDivergence< UniformScaleTranslateMap, DiffScheme >
 CDropAttributesOp< PointDataTreeT >
 CDSConverter< DenseType, TreeType >
 CDualGridSampler< GridOrTreeT, SamplerT >This is a simple convenience class that allows for sampling from a source grid into the index space of a target grid. At construction the source and target grids are checked for alignment which potentially renders interpolation unnecessary. Else interpolation is performed according to the templated Sampler type
 CDualGridSampler< AccT, SamplerT >
 CDualGridSampler< tree::ValueAccessor< TreeT >, SamplerT >Specialization of DualGridSampler for construction from a ValueAccessor type
 CDummySampleType
 CMeshToVoxelEdgeData::EdgeDataInternal edge data type
 CEnrightField< ScalarT >Analytical, divergence-free and periodic velocity field
 CErodeOp< TreeT >
 CMorphology< TreeType >::ErodeVoxelsOp
 Cexception
 CExpandLeafNodeRegion< TreeType >
 CExpandNarrowband< TreeType, MeshDataAdapter >
 CExpandNarrowbandMask< TreeType >
 CExtractAll< _ResultTreeType, DenseValueType >Simple utility class used by extractSparseTreeWithMask
 CExtremaThis class computes the minimum and maximum values of a population of floating-point values
 CLeafBuffer< T, Log2Dim >::FileInfo
 CFillArray< ValueType >
 CFillArray< ValueType >
 CFillLeafNodeVoxels< TreeType >
 CFillMaskBoundary< TreeType >
 CFillOp< T >
 CFilmA simple class that allows for concurrent writes to pixels in an image, background initialization of the image, and PPM or EXR file output
 CFilter< GridT, MaskT, InterruptT >Volume filtering (e.g., diffusion) with optional alpha masking
 CFilterTraits< T >
 CFilterTraits< BBoxFilter >
 CFilterTraits< BinaryFilter< T0, T1, And > >
 CFilterTraits< LevelSetFilter< T > >
 CFilterTypeSelectively extract and filter point data using a custom filter operator
 CFindMinMaxVoxelValue< LeafNodeType >
 CFindMinTileValue< InternalNodeType >
 CFindMinVoxelValue< LeafNodeType >
 CFixedPointCodec< OneByte, Range >
 CFlagAndCountQuadsToSubdivide
 CFlipRegionSign< LeafNodeType >
 CFloodFillSign< TreeType >
 CFormattedInt< IntT >I/O manipulator that formats integer values with thousands separators
 CExpandNarrowband< TreeType, MeshDataAdapter >::Fragment
 CDivergence< InGridT, MaskGridType, InterruptT >::Functor< DiffScheme >
 CGradient< InGridT, MaskGridType, InterruptT >::Functor
 CLaplacian< GridT, MaskGridType, InterruptT >::Functor
 CMeanCurvature< GridT, MaskGridType, InterruptT >::Functor
 CMagnitude< InGridT, MaskGridType, InterruptT >::Functor
 CNormalize< GridT, MaskGridType, InterruptT >::Functor
 CMeshToVoxelEdgeData::GenEdgeData
 CGenericMapA wrapper that holds a MapBase::ConstPtr and exposes a reduced set of functionality needed by the mathematical operators
 CGetVal< IterT, StatsT >
 CGetValImpl< T, IsVector >
 CGetValImpl< T, false >
 CGetValImpl< T, true >
 CGlobalMovePointsOp< TreeT >
 CGradient< InGridT, MaskGridType, InterruptT >Compute the gradient of a scalar grid
 CGradient< MapType, DiffScheme >Center difference gradient operators, defined with respect to the range-space of the map
 CGradient< ScaleMap, CD_2ND >
 CGradient< ScaleTranslateMap, CD_2ND >
 CGradient< TranslationMap, DiffScheme >
 CGradient< UniformScaleMap, CD_2ND >
 CGradient< UniformScaleTranslateMap, CD_2ND >
 CGradientBiased< MapType, GradScheme >Biased gradient operators, defined with respect to the range-space of the map
 CGradientNormSqrd< MapType, GradScheme >
 CGradientNormSqrd< UniformScaleMap, GradScheme >Partial template specialization of GradientNormSqrd
 CGradientNormSqrd< UniformScaleTranslateMap, GradScheme >Partial template specialization of GradientNormSqrd
 CGreaterCount
 CGridCombinerOp< GridT >Combines multiple grids into one by stealing leaf nodes and summing voxel values This class is designed to work with thread local storage containers such as tbb::combinable
 CGridDescriptor
 CGridNamePredPredicate functor that returns true for grids that have a specified name
 CGridOperator< InGridT, MaskGridType, OutGridT, MapT, OperatorT, InterruptT >Apply an operator to an input grid to produce an output grid with the same active voxel topology but a potentially different value type
 CGridOrTreeConstructor< TreeType >
 CGridOrTreeConstructor< TreeType >
 CGridOrTreeConstructor< Grid< TreeType > >
 CGridOrTreeConstructor< Grid< TreeType > >
 CGridResampler
 CGridSampler< GridOrTreeType, SamplerType >Class that provides the interface for continuous sampling of values in a tree
 CGridSampler< tree::ValueAccessor< TreeT >, SamplerType >Specialization of GridSampler for construction from a ValueAccessor type
 CGroupCodec
 CGroupFilterIndex filtering on group membership
 CGroupHandle
 CGroupInfoConvenience class with methods for analyzing group data
 CHalfReader< IsReal, T >
 CHalfReader< false, T >Partial specialization for non-floating-point types (no half to float promotion)
 CHalfReader< true, T >Partial specialization for floating-point types
 CHalfWriter< IsReal, T >
 CHalfWriter< false, T >Partial specialization for non-floating-point types (no float to half quantization)
 CHalfWriter< true, T >Partial specialization for floating-point types
 CHasMultiPassIO< LeafNodeType >Metafunction that specifies whether a given leaf node, tree, or grid type requires multiple passes to read and write voxel data
 CHasMultiPassIO< Grid< TreeType > >
 CHasMultiPassIO< tree::Tree< RootNodeType > >
 CHistogramThis class computes a histogram, with a fixed interval width, of a population of floating-point values
 CHistOp< IterT, ValueOp >
 CHomogeneousMatMul
 CIdentifyIntersectingVoxels< InputTreeType >
 CInactivateValues< TreeType >
 CInactivePruneOp< TreeT, TerminationLevel >
 CInactiveTileValues< TreeType >
 CInactiveVoxelValues< TreeType >
 CIndexIter< IteratorT, FilterT >A forward iterator over array indices with filtering IteratorT can be either IndexIter or ValueIndexIter (or some custom index iterator) FilterT should be a struct or class with a valid() method than can be evaluated per index Here's a simple filter example that only accepts even indices:
 CPointPartitioner< PointIndexType, BucketLog2Dim >::IndexIterator
 CVector< T >::InfNormOp
 CInitialiseAttributesOp< PointDataTreeType, PointIndexTreeType >
 CAttributeSet::InserterUtility method to construct a NameAndType sequence
 CInternalNode< _ChildNodeType, Log2Dim >
 CInvertedTree< HeadT, HeadLevel >
 CInvertedTree< HeadT, 1 >
 Cis_diagonal_jacobian< T >
 Cis_double< T >
 Cis_double< double >
 Cis_linear< T >Map traits
 Cis_linear< AffineMap >
 Cis_linear< CompoundMap< T1, T2 > >
 Cis_linear< ScaleMap >
 Cis_linear< ScaleTranslateMap >
 Cis_linear< TranslationMap >
 Cis_linear< UniformScaleMap >
 Cis_linear< UniformScaleTranslateMap >
 Cis_linear< UnitaryMap >
 Cis_scale< T >
 Cis_scale< ScaleMap >
 Cis_scale_translate< T >
 Cis_scale_translate< ScaleTranslateMap >
 Cis_uniform_diagonal_jacobian< T >
 Cis_uniform_scale< T >
 Cis_uniform_scale< UniformScaleMap >
 Cis_uniform_scale_translate< T >
 Cis_uniform_scale_translate< TranslationMap >
 Cis_uniform_scale_translate< UniformScaleTranslateMap >
 Cis_vec3d< Vec3T >
 Cis_vec3d< Vec3d >
 CISCurl< DiffScheme >Curl operator defined in index space using various first derivative schemes
 CISDivergence< DiffScheme >Divergence operator defined in index space using various first derivative schemes
 CVector< T >::IsFiniteOp
 CSparseStencilMatrix< ValueType_, STENCIL_SIZE >::IsFiniteOp
 CISGradient< DiffScheme >Gradient operators defined in index space of various orders
 CISGradientBiased< GradScheme, Vec3Bias >Biased Gradient Operators, using upwinding defined by the Vec3Bias input
 CISGradientNormSqrd< GradScheme >
 CISLaplacian< DiffScheme >Laplacian defined in index space, using various center-difference stencils
 CISLaplacian< CD_FOURTH >
 CISLaplacian< CD_SECOND >
 CISLaplacian< CD_SIXTH >
 CISLaplacianOp< VIdxTreeT, BoundaryOp >Functor for use with LeafManager::foreach() to populate a sparse Laplacian matrix
 CISMeanCurvature< DiffScheme2, DiffScheme1 >Compute the mean curvature in index space
 CValidateIntersectingVoxels< TreeType >::IsNegative
 CISOpMagnitude< OpType >Adapter for vector-valued index-space operators to return the vector magnitude
 CISStaggeredLaplacianOp< BoolTreeType, BoundaryOp >Functor for use with LeafManager::foreach() to populate a sparse Laplacian matrix
 CBIAS_SCHEME< bgs >::ISStencil< GridType, IsSafe >
 CBIAS_SCHEME< FIRST_BIAS >::ISStencil< GridType, IsSafe >
 CBIAS_SCHEME< SECOND_BIAS >::ISStencil< GridType, IsSafe >
 CBIAS_SCHEME< THIRD_BIAS >::ISStencil< GridType, IsSafe >
 CBIAS_SCHEME< WENO5_BIAS >::ISStencil< GridType, IsSafe >
 CBIAS_SCHEME< HJWENO5_BIAS >::ISStencil< GridType, IsSafe >
 CLeafManager< TreeT >::LeafRange::Iterator
 CNodeList< NodeT >::NodeRange::Iterator
 Citerator
 CCoordBBox::Iterator< ZYXOrder >Iterator over the Coord domain covered by a CoordBBox
 CParticleAtlas< PointIndexGridType >::IteratorProvides accelerated range and nearest-neighbor searches for particles that are partitioned using the ParticleAtlas
 CIteratorBase< MaskIterT, NodeT >Base class for iterators over internal and leaf nodes
 CIteratorBase< MaskDenseIter, NodeT >
 CIteratorBase< MaskDenseIterator, NodeT >
 CIteratorRange< IterT >
 CIterListItem< PrevItemT, NodeVecT, VecSize, _Level >An IterListItem is an element of a compile-time linked list of iterators to nodes of different types
 CIterListItem< IterListItem, RestT, VecSize-1, 1 >
 CIterListItem< PrevChildItem, InvTreeT, ROOT_LEVEL+1, 0 >
 CIterListItem< PrevItem, InvTreeT, ROOT_LEVEL+1, LEAF_LEVEL >
 CIterListItem< PrevItemT, NodeVecT, 1, _Level >The final element of a compile-time linked list of iterators to nodes of different types
 CIterListItem< PrevItemT, NodeVecT, VecSize, 0U >The initial element of a compile-time linked list of iterators to nodes of different types
 CIterListItem< PrevValueItem, InvTreeT, ROOT_LEVEL+1, 0 >
 CIterTraits< NodeT, IterT >
 CIterTraits< IterT, AuxT >
 CIterTraits< NodeT, typename NodeT::ChildAllCIter >
 CIterTraits< NodeT, typename NodeT::ChildAllIter >
 CIterTraits< NodeT, typename NodeT::ChildOffCIter >
 CIterTraits< NodeT, typename NodeT::ChildOffIter >
 CIterTraits< NodeT, typename NodeT::ChildOnCIter >
 CIterTraits< NodeT, typename NodeT::ChildOnIter >
 CIterTraits< NodeT, typename NodeT::ValueAllCIter >
 CIterTraits< NodeT, typename NodeT::ValueAllIter >
 CIterTraits< NodeT, typename NodeT::ValueOffCIter >
 CIterTraits< NodeT, typename NodeT::ValueOffIter >
 CIterTraits< NodeT, typename NodeT::ValueOnCIter >
 CIterTraits< NodeT, typename NodeT::ValueOnIter >
 CIterTraits< tree::TreeValueIteratorBase< TreeT, ValueIterT > >
 CIterTraits< typename PrevIterT::NonConstNodeType, PrevIterT >
 CLabelBoundaryVoxels< LeafNodeType >Negative active values are set 0, everything else is set to 1
 CLaplacian< GridT, MaskGridType, InterruptT >
 CLaplacian< MapType, DiffScheme >Compute the Laplacian at a given location in a grid using finite differencing of various orders. The result is defined in the range of the map
 CLaplacian< ScaleMap, DiffScheme >
 CLaplacian< ScaleTranslateMap, DiffScheme >
 CLaplacian< TranslationMap, DiffScheme >
 CLaplacian< UniformScaleMap, DiffScheme >
 CLaplacian< UniformScaleTranslateMap, DiffScheme >
 CLaplacian< UnitaryMap, DiffScheme >
 CCachedDeformer< T >::Cache::Leaf
 CLeafBuffer< T, Log2Dim >Array of fixed size 23Log2Dim that stores the voxel values of a LeafNode
 CLeafBuffer< bool, Log2Dim >
 CLeafBuffer< ValueType, Log2Dim >
 CLeafBufferFlags< T >
 CLeafBufferFlags< ValueType >
 CMorphology< TreeType >::LeafCache
 CLeafCountOp< LeafType >Functor for use with LeafManager::foreach() to populate an array with per-leaf active voxel counts
 CLeafIndexOp< LeafType >Functor for use with LeafManager::foreach() to populate active leaf voxels with sequential indices
 CLeafIteratorBase< TreeT, RootChildOnIterT >Base class for tree-traversal iterators over all leaf nodes (but not leaf voxels)
 CLeafManager< TreeT >This class manages a linear array of pointers to a given tree's leaf nodes, as well as optional auxiliary buffers (one or more per leaf) that can be swapped with the leaf nodes' voxel data buffers
 CLeafManagerImpl< ManagerT >
 CLeafManagerImpl< LeafManager< const TreeT > >
 CLeafNode< T, Log2Dim >Templated block class to hold specific data types and a fixed number of values determined by Log2Dim. The actual coordinate dimension of the block is 2^Log2Dim, i.e. Log2Dim=3 corresponds to a LeafNode that spans a 8^3 block
 CLeafNode< bool, Log2Dim >LeafNode specialization for values of type bool that stores both the active states and the values of (2^Log2Dim)^3 voxels as bit masks
 CLeafNode< ValueMask, Log2Dim >LeafNode specialization for values of type ValueMask that encodes both the active states and the boolean values of (2^Log2Dim)^3 voxels in a single bit mask, i.e. voxel values and states are indistinguishable!
 CLeafNodeConnectivityTable< TreeType >
 CLeafNodeOriginOp< PointArray, PointIndexType >
 CLeafNodePointCount< LeafNodeLog2Dim >
 CLeafNodeVoxelOffsets
 CLeafOp< Index32LeafT >
 CLeafManager< TreeT >::LeafRange
 CLeafTopologyDiffOp< TreeType1, TreeType2 >Functor for use with tools::foreach() to compute the boolean difference between the value masks of corresponding leaf nodes in two trees
 CLeafTopologyIntOp< TreeType1, TreeType2 >Functor for use with tools::foreach() to compute the boolean intersection between the value masks of corresponding leaf nodes in two trees
 CLegacyFrustumLegacyFrustum class used at DreamWorks for converting old vdb files
 CLevelScopeA LevelScope object sets the logging level to a given level and restores it to the current level when the object goes out of scope
 CLevelSetAdvection< GridT, FieldT, InterruptT >Hyperbolic advection of narrow-band level sets in an external velocity field
 CLevelSetFilter< LevelSetGridT >
 CLevelSetFracture< GridType, InterruptType >Level set fracturing
 CLevelSetHDDA< TreeT, NodeLevel >Helper class that implements Hierarchical Digital Differential Analyzers and is specialized for ray intersections with level sets
 CLevelSetHDDA< TreeT,-1 >Specialization of Hierarchical Digital Differential Analyzer class that intersects a ray against the voxels of a level set
 CLevelSetMeasure< GridT, InterruptT >Multi-threaded computation of surface area, volume and average mean-curvature for narrow band level sets
 CLevelSetMorphing< GridT, InterruptT >Shape morphology of level sets. Morphing from a source narrow-band level sets to a target narrow-band level set
 CLevelSetPruneOp< TreeT, TerminationLevel >
 CLevelSetRayIntersector< GridT, SearchImplT, NodeLevel, RayT >This class provides the public API for intersecting a ray with a narrow-band level set
 CLevelSetRayTracer< GridT, IntersectorT >A (very) simple multithreaded ray tracer specifically for narrow-band level sets
 CLevelSetSphere< GridT, InterruptT >Generates a signed distance field (or narrow band level set) to a single sphere
 CLevelSetTracker< GridT, InterruptT >Performs multi-threaded interface tracking of narrow band level sets
 CLinearOp< T >
 CLinearSearchImpl< GridT, Iterations, RealT >Implements linear iterative search for an iso-value of the level set along the direction of the ray
 CLocalMovePointsOp< TreeT >
 CMagnitude< InGridT, MaskGridType, InterruptT >
 CMapAdapter< MapType, OpType, ResultType >Adapter to associate a map with a world-space operator, giving it the same call signature as an index-space operator
 CMapBaseAbstract base class for maps
 CMappedFileHandle to control the lifetime of a memory-mapped .vdb file
 CMapPoints< PointIndexLeafNode >
 CMapRegistryThreadsafe singleton object for accessing the map type-name dictionary. Associates a map type-name with a factory function
 CMaskBorderVoxels< BoolTreeType >
 CMaskDisorientedTrianglePoints< InputTreeType >
 CMaskedCopy< TreeType >
 CMaskInteriorTiles< TreeType, InternalNodeType >
 CMaskInteriorVoxels< TreeT >
 CMaskInteriorVoxels< LeafNodeType >
 CMaskIntersectingVoxels< InputTreeType >
 CMaskIsovalueCrossingVoxels< InputTreeType >
 CMorphology< TreeType >::MaskManager
 CMultiResGrid< TreeType >::MaskOp
 CMaskSeamLineVoxels< TreeType >
 CMaskSegmentGroup< TreeType >
 CMaskSurface< BoolTreeType >
 CMaskTileBorders< InputTreeType >
 CMat< SIZE, T >
 CMat2< T >
 CMat< 3, T >
 CMat< 4, double >
 CMat< 4, Real >
 CMat< 4, T >
 CMathOp< IterT, OpT, StatsT >
 CMatMul
 CMatMulNormalize
 CSparseStencilMatrix< ValueType_, STENCIL_SIZE >::MatrixCopyOp
 CGridTransformer::MatrixTransform
 CMaxOp< ValueType >
 CMeanCurvature< GridT, MaskGridType, InterruptT >
 CMeanCurvature< MapType, DiffScheme2, DiffScheme1 >Compute the mean curvature
 CMeanCurvature< TranslationMap, DiffScheme2, DiffScheme1 >
 CMeanCurvature< UniformScaleMap, DiffScheme2, DiffScheme1 >
 CMeanCurvature< UniformScaleTranslateMap, DiffScheme2, DiffScheme1 >
 CMergeBinsOp< PointIndexType >
 CMergeVoxelRegions< InputGridType >
 CMeshDataAdapterConvert polygonal meshes that consist of quads and/or triangles into signed or unsigned distance field volumes
 CMeshToVoxelEdgeDataExtracts and stores voxel edge intersection data from a mesh
 CMetadataBase class for storing metadata information in a grid
 CMetadataStorage< PointDataTreeT, ValueType >
 CMetadataStorage< PointDataTreeT, Name >
 CMetaMapContainer that maps names (strings) to values of arbitrary types
 CMinCombine< TreeType >
 CMinMax< ValueType, Less >Templated class to compute the minimum and maximum values
 CMinOp< ValueType >
 CMorphology< TreeType >
 CMoveSegmentDataOp< PointIndexType >
 CMultiGroupFilter
 CMultiPassLeaf nodes that require multi-pass I/O must inherit from this struct
 CMultOp< ValueType >
 CAttributeSet::Util::NameAndTypeAttribute and type name pair
 CFile::NameIterator
 CMorphology< TreeType >::Neighbor
 CNodeChain< HeadT, HeadLevel >NodeChain<RootNodeType, RootNodeType::LEVEL>::Type is a boost::mpl::vector that lists the types of the nodes of the tree rooted at RootNodeType in reverse order, from LeafNode to RootNode
 CNodeChain< HeadT, 1 >Specialization to terminate NodeChain
 CIterTraits< NodeT, typename NodeT::ChildOffCIter >::NodeConverter< OtherNodeT >
 CIterTraits< NodeT, typename NodeT::ChildAllCIter >::NodeConverter< OtherNodeT >
 CIterTraits< NodeT, typename NodeT::ValueOffIter >::NodeConverter< OtherNodeT >
 CIterTraits< NodeT, typename NodeT::ValueAllIter >::NodeConverter< OtherNodeT >
 CIterTraits< NodeT, typename NodeT::ValueAllCIter >::NodeConverter< OtherNodeT >
 CIterTraits< NodeT, typename NodeT::ValueOnIter >::NodeConverter< OtherNodeT >
 CIterTraits< NodeT, typename NodeT::ValueOffCIter >::NodeConverter< OtherNodeT >
 CIterTraits< NodeT, typename NodeT::ValueOnCIter >::NodeConverter< OtherNodeT >
 CIterTraits< NodeT, typename NodeT::ChildOnCIter >::NodeConverter< OtherNodeT >
 CIterTraits< NodeT, typename NodeT::ChildOffIter >::NodeConverter< OtherNodeT >
 CIterTraits< NodeT, typename NodeT::ChildOnIter >::NodeConverter< OtherNodeT >
 CIterTraits< NodeT, typename NodeT::ChildAllIter >::NodeConverter< OtherNodeT >
 CNodeIteratorBase< _TreeT, RootChildOnIterT >Base class for tree-traversal iterators over all nodes
 CNodeList< NodeT >This class caches tree nodes of a specific type in a linear array
 CNodeList< NodeT0 >
 CNodeList< NodeT1 >
 CNodeList< NodeT2 >
 CNodeList< NodeT3 >
 CNodeList< typename RootNodeType::ChildNodeType >
 CNodeManager< TreeOrLeafManagerT, _LEVELS >To facilitate threading over the nodes of a tree, cache node pointers in linear arrays, one for each level of the tree
 CNodeManagerLink< NodeT, LEVEL >This class is a link in a chain that each caches tree nodes of a specific type in a linear array
 CNodeManagerLink< typename RootNodeType::ChildNodeType, LEVELS-1 >
 CNodeMask< Log2Dim >Bit mask for the internal and leaf nodes of VDB. This is a 64-bit implementation
 CNodeMask< 1 >Template specialization of NodeMask for Log2Dim=1, i.e. 2^3 nodes
 CNodeMask< 2 >Template specialization of NodeMask for Log2Dim=2, i.e. 4^3 nodes
 CNodeMaskSegment< NodeType >
 CNodeOp
 CNodeList< NodeT >::NodeRange
 CNodeUnion< ValueT, ChildT, Enable >
 CNodeUnion< ValueT, ChildT, typename std::enable_if< CopyTraits< ValueT >::IsCopyable >::type >
 CNodeUnion< ValueT, ChildT, typename std::enable_if< openvdb::v6_0::tree::CopyTraits< ValueT >::IsCopyable >::type >
 CNodeUnion< ValueT, ChildT, typename std::enable_if< std::is_pod< ValueT >::value >::type >
 CNodeUnion< ValueType, ChildNodeType >
 CNormalize< GridT, MaskGridType, InterruptT >
 CNullCodec
 CNullDeformerNo-op deformer (adheres to the deformer interface documented in PointMove.h)
 CNullFilterA no-op filter that can be used when iterating over all indices
 CNullInterrupterDummy NOOP interrupter class defining interface
 COffsetAndMinComp< TreeType >
 COffsetValues< TreeType >
 COpAccumulator< IterT, OpT >
 COpAdd< ValueT >
 COpMagnitude< OpType, MapT >Adapter for vector-valued world-space operators to return the vector magnitude
 COpMax< ValueT >
 COpMin< ValueT >
 COpMult< ValueT >
 COpOver< ValueT >Point wise methods used to apply various compositing operations
 COpSub< ValueT >
 CMagnitude< InGridT, MaskGridType, InterruptT >::OpT
 CNormalize< GridT, MaskGridType, InterruptT >::OpT
 COrderSegmentsOp< PointIndexType >
 Costream
 CPageStores a variable-size, compressed, delayed-load Page of data that is loaded into memory when accessed. Access to the Page is thread-safe as loading and decompressing the data is protected by a mutex
 CPagedArray< ValueT, Log2PageSize, TableT >::Page
 CPagedArray< ValueT, Log2PageSize, TableT >Concurrent, page-based, dynamically-sized linear data structure with O(1) random access and STL-compliant iterators. It is primarily intended for applications that concurrently insert (a possibly unkown number of) elements into a dynamically growing linear array, and fast random access to said elements
 CPagedInputStreamA Paging wrapper to std::istream that is responsible for reading from a given input stream and creating Page objects and PageHandles that reference those pages for delayed reading
 CPagedOutputStreamA Paging wrapper to std::ostream that is responsible for writing from a given output stream at intervals set by the PageSize. As Pages are variable in size, they are flushed to disk as soon as sufficiently large
 CPageHandleA PageHandle holds a unique ptr to a Page and a specific stream pointer to a point within the decompressed Page buffer
 CValueVoxelCIter::Parent
 CPartialCreateTag dispatch class that distinguishes constructors during file input
 CParticleArrayPartition particles and performs range and nearest-neighbor searches
 CParticleAtlas< PointIndexGridType >
 CParticlesToLevelSet< SdfGridT, AttributeT, InterrupterT >
 CPatternLayout
 CGlobalMovePointsOp< TreeT >::PerformTypedMoveOp
 CLocalMovePointsOp< TreeT >::PerformTypedMoveOp
 CPointAccessor
 CPointAdvect< GridT, PointListT, StaggeredVelocity, InterrupterType >
 CPointArray
 CPointArrayPartitions points into BucketLog2Dim aligned buckets using a parallel radix-based sorting algorithm
 CPointAttributeVector< ValueType >Point-partitioner compatible STL vector attribute wrapper for convenience
 CPointDataNodeChain< HeadT, HeadLevel >Recursive node chain which generates a boost::mpl::vector listing value converted types of nodes to PointDataGrid nodes of the same configuration, rooted at RootNodeType in reverse order, from LeafNode to RootNode. See also TreeConverter<>
 CPointDataNodeChain< tree::InternalNode< ChildT, Log2Dim >, 1 >
 CPointDataNodeChain< tree::InternalNode< ChildT, Log2Dim >, HeadLevel >
 CPointDataSampler< PointDataGridT, SamplerT, FilterT, InterrupterT >
 CPointIndex< IntType_, Kind >Integer wrapper, required to distinguish PointIndexGrid and PointDataGrid from Int32Grid and Int64Grid
 CPointIndexFilter< PointArray, TreeType >
 CPointIndexIterator< TreeType >Accelerated range and nearest-neighbor searches for point index grids
 CPointListCopy
 CPointListTransform
 CPointPartitioner< PointIndexType, BucketLog2Dim >
 CPointSampler
 CPointsToMask< GridT, InterrupterT >Makes every voxel of a grid active if it contains a point
 CPointsToScalarOp< GridT, PointDataGridT, FilterT >Compute scalar grid from PointDataGrid while evaluating the point filter
 CPointsToTransformedScalarOp< GridT, PointDataGridT, FilterT, DeformerT >Compute scalar grid from PointDataGrid using a different transform and while evaluating the point filter
 CPolygonPoolCollection of quads and triangles
 CPopulateAttributeOp< PointDataTreeType, PointIndexTreeType, AttributeListType >
 CPopulateLeafNodesOp< LeafNodeT >
 CPopulatePositionAttributeOp< PointDataTreeType, PointIndexTreeType, PositionListType >
 CPopulateTree< TreeType >
 CPositionRange
 CPreconditioner< T >Base class for conjugate gradient preconditioners
 CPreconditioner< MatrixType::ValueType >
 CPrimCpy
 CMultiResGrid< TreeType >::ProlongateOp
 Cpromote< S, T >
 CQuadAndTriangleDataAdapter< PointType, PolygonType >Contiguous quad and triangle data adapter class
 CQuadraticSampler
 CQuantizedUnitVecUnit vector occupying only 16 bits
 CQuat< T >
 CQueueQueue for asynchronous output of grids to files or streams
 CRadialRangeFilter< ParticleArrayType, IndexT >
 CRadialRangeFilter< PointArray, IndexT >
 CRand01< FloatType, EngineType >Simple generator of random numbers over the range [0, 1)
 CRand01< double, RandomGenerator >
 CRandInt< IntType, EngineType >Simple random integer generator
 CRandomLeafFilter< PointDataTreeT, RandGenT >
 CRay< RealT >
 CRay< double >
 CRealToHalf< T >RealToHalf and its specializations define a mapping from floating-point data types to analogous half float types
 CRealToHalf< double >
 CRealToHalf< float >
 CRealToHalf< Vec2d >
 CRealToHalf< Vec2s >
 CRealToHalf< Vec3d >
 CRealToHalf< Vec3s >
 CPointsToMask< GridT, InterrupterT >::ReducePool
 CReleaseChildNodes< NodeType >
 CRemapIndices< ParticleArrayType, PointIndexLeafNodeType >
 CRemoveSelfIntersectingSurface< TreeType >
 CRenormalize< TreeType >
 CRestoreOrigin< TreeType >
 CMultiResGrid< TreeType >::RestrictOp
 CReturnValue< T >
 CReviseSeamLineFlags
 CFilm::RGBAFloating-point RGBA components in the range [0, 1]
 CRootNode< ChildType >
 CRootNodeCombineHelper< CombineOp, RootT, OtherRootT, Compatible >
 CRootNodeCombineHelper< CombineOp, RootT, OtherRootT, true >
 CRootNodeCopyHelper< RootT, OtherRootT, Compatible >
 CRootNodeCopyHelper< RootT, OtherRootT, true >
 CRootNodeMask
 CSparseStencilMatrix< ValueType_, STENCIL_SIZE >::RowEditorRead/write accessor to a row of this matrix
 CInternalNode< _ChildNodeType, Log2Dim >::SameConfiguration< OtherNodeType >SameConfiguration<OtherNodeType>::value is true if and only if OtherNodeType is the type of an InternalNode with the same dimensions as this node and whose ChildNodeType has the same configuration as this node's ChildNodeType
 CLeafNode< T, Log2Dim >::SameConfiguration< OtherNodeType >SameConfiguration<OtherNodeType>::value is true if and only if OtherNodeType is the type of a LeafNode with the same dimensions as this node
 CLeafNode< bool, Log2Dim >::SameConfiguration< OtherNodeType >SameConfiguration<OtherNodeType>::value is true if and only if OtherNodeType is the type of a LeafNode with the same dimensions as this node
 CLeafNode< ValueMask, Log2Dim >::SameConfiguration< OtherNodeType >SameConfiguration<OtherNodeType>::value is true if and only if OtherNodeType is the type of a LeafNode with the same dimensions as this node
 CRootNode< ChildType >::SameConfiguration< OtherNodeType >SameConfiguration<OtherNodeType>::value is true if and only if OtherNodeType is the type of a RootNode whose ChildNodeType has the same configuration as this node's ChildNodeType
 CSameInternalConfig< ChildT1, Dim1, NodeT2 >
 CSameInternalConfig< ChildT1, Dim1, InternalNode< ChildT2, Dim1 > >
 CSameLeafConfig< Dim1, NodeT2 >
 CSameLeafConfig< Dim1, LeafNode< T2, Dim1 > >
 CSameLeafConfig< Dim1, openvdb::tools::PointIndexLeafNode< T2, Dim1 > >
 CSameLeafConfig< Dim1, points::PointDataLeafNode< T2, Dim1 > >
 CSameRootConfig< ChildT1, NodeT2 >
 CSameRootConfig< ChildT1, RootNode< ChildT2 > >
 CSampler< Order, Staggered >Provises a unified interface for sampling, i.e. interpolation
 CSamplerTraits< T >
 CSamplerTraits< tools::Sampler< T0, T1 > >
 CSampleWithRounding
 CSampleWithRoundingOp< ValueT, SamplerT, AccessorT, Round, Compatible >
 CSampleWithRoundingOp< ValueT, SamplerT, AccessorT, false, true >
 CSampleWithRoundingOp< ValueT, SamplerT, AccessorT, true, true >
 CScalarToVectorConverter< ScalarGridType >ScalarToVectorConverter<ScalarGridType>::Type is the type of a grid having the same tree configuration as ScalarGridType but value type Vec3<T> where T is ScalarGridType::ValueType
 CSDFTilesToFogVolume< TreeType, InternalNodeType >
 CSDFVoxelsToFogVolume< LeafNodeType >
 CSeamLineWeights< InputTreeType >
 CSeedFillExteriorSign< TreeType >
 CSeedPoints< TreeType >
 CSegmentNodeMask< NodeType >
 CSetGroupByFilterOp< PointDataTree, FilterT, IterT >
 CSetGroupFromIndexOp< PointDataTree, PointIndexTree, Remove >
 CSetGroupOp< PointDataTree, Member >Set membership on or off for the specified group
 CSetSeamLineFlags< TreeType >
 CShallowCopyTag dispatch class that distinguishes shallow copy constructors from deep copy constructors
 CSharedOpApplier< IterT, OpT >
 CSharedOpTransformer< InIterT, OutTreeT, OpT >
 CSignedFloodFillOp< TreeOrLeafManagerT >
 CSolveBoundaryOp< Vec3GridT, MaskT >
 CSparseExtractor< OpType, DenseType >Functor-based class used to extract data that satisfies some criteria defined by the embedded OpType functor. The extractSparseTree function wraps this class
 CSparseMaskedExtractor< DenseType, MaskTreeType >Functor-based class used to extract data from a dense grid, at the index-space intersection with a supplied mask in the form of a sparse tree. The extractSparseTreeWithMask function wraps this class
 CSparseStencilMatrix< ValueType_, STENCIL_SIZE >Sparse, square matrix representing a 3D stencil operator of size STENCIL_SIZE
 CSparseStencilMatrix< OtherValueType, STENCIL_SIZE >
 CSparseStencilMatrix< ValueType, 4 >
 CSparseToDenseCompositor< CompositeMethod, _TreeT >
 CSplittableParticleArray< ParticleArrayT, PointIndex >
 CStaggeredBoxSampler
 CStaggeredPointSampler
 CStaggeredQuadraticSampler
 CStashOriginAndStoreOffset< TreeType >
 CStateInformation about the state of a conjugate gradient solution
 CLevelSetTracker< GridT, InterruptT >::StateLightweight struct that stores the state of the LevelSetTracker
 CStatsOp< IterT, ValueOp, StatsT >
 CStealUniqueLeafNodes< TreeType >
 CGroupCodec::Storage< T >
 CTruncateCodec::Storage< T >
 CNullCodec::Storage< T >
 CFixedPointCodec< OneByte, Range >::Storage< T >
 CUnitVecCodec::Storage< T >
 CStringCodec< Truncate >::Storage< T >
 CStreamMetadataContainer for metadata describing how to unserialize grids from and/or serialize grids to a stream (which file format, compression scheme, etc. to use)
 CStringAttributeHandle
 CStringCodec< Truncate >
 CStringMetaInserter
 CStringTypeTrait< Truncate >
 CStringTypeTrait< true >
 CSubdivideQuads
 CSumOp< ValueType >
 CSwappedCombineOp< ValueType, CombineOp >
 CSweepExteriorSign< TreeType >
 CSyncMaskValues< BoolTreeType >
 CSyncVoxelMask< TreeType >
 CTestLeafIO< typename >
 CRay< RealT >::TimeSpan
 CTolerance< ValueType >
 CTolerance< T >Tolerance for floating-point comparison
 CTolerance< double >
 CTolerance< float >
 CTolerancePruneOp< TreeT, TerminationLevel >
 CToMaskGrid< GridType >ToMaskGrid<T>::Type is the type of a grid having the same tree hierarchy as grid type T but a value equal to its active state
 CTopologyCopyTag dispatch class that distinguishes topology copy constructors from deep copy constructors
 CInternalNode< _ChildNodeType, Log2Dim >::TopologyCopy1< OtherInternalNode >
 CInternalNode< _ChildNodeType, Log2Dim >::TopologyCopy2< OtherInternalNode >
 CInternalNode< _ChildNodeType, Log2Dim >::TopologyDifference< OtherInternalNode >
 CInternalNode< _ChildNodeType, Log2Dim >::TopologyIntersection< OtherInternalNode >
 CInternalNode< _ChildNodeType, Log2Dim >::TopologyUnion< OtherInternalNode >
 CTransferSeamLineFlags< BoolTreeType, SignDataType >
 CTransform
 CTransformPoints< PointType >
 CTransformValues< TreeType >
 CTree3< T, N1, N2 >Tree3<T, N1, N2>::Type is the type of a three-level tree (Root, Internal, Leaf) with value type T and internal and leaf node log dimensions N1 and N2, respectively
 CTree4< T, N1, N2, N3 >Tree4<T, N1, N2, N3>::Type is the type of a four-level tree (Root, Internal, Internal, Leaf) with value type T and internal and leaf node log dimensions N1, N2 and N3, respectively
 CTree4< EdgeData, 5, 4, 3 >
 CTree5< T, N1, N2, N3, N4 >Tree5<T, N1, N2, N3, N4>::Type is the type of a five-level tree (Root, Internal, Internal, Internal, Leaf) with value type T and internal and leaf node log dimensions N1, N2, N3 and N4, respectively
 CTreeAdapter< _TreeType >This adapter allows code that is templated on a Tree type to accept either a Tree type or a Grid type
 CTreeAdapter< Grid< _TreeType > >Partial specialization for Grid types
 CTreeAdapter< tree::ValueAccessor< _TreeType > >Partial specialization for ValueAccessor types
 CTreeBaseBase class for typed trees
 CTreeConverter< TreeType >Similiar to ValueConverter, but allows for tree configuration conversion to a PointDataTree. ValueConverter<PointDataIndex32> cannot be used as a PointDataLeafNode is not a specialization of LeafNode
 CTreeIterTraits< TreeT, IterT >TreeIterTraits provides, for all tree iterators, a begin(tree) function that returns an iterator over a tree of arbitrary type
 CTreeIterTraits< TreeT, typename TreeT::LeafCIter >
 CTreeIterTraits< TreeT, typename TreeT::LeafIter >
 CTreeIterTraits< TreeT, typename TreeT::NodeCIter >
 CTreeIterTraits< TreeT, typename TreeT::NodeIter >
 CTreeIterTraits< TreeT, typename TreeT::RootNodeType::ChildAllCIter >
 CTreeIterTraits< TreeT, typename TreeT::RootNodeType::ChildAllIter >
 CTreeIterTraits< TreeT, typename TreeT::RootNodeType::ChildOffCIter >
 CTreeIterTraits< TreeT, typename TreeT::RootNodeType::ChildOffIter >
 CTreeIterTraits< TreeT, typename TreeT::RootNodeType::ChildOnCIter >
 CTreeIterTraits< TreeT, typename TreeT::RootNodeType::ChildOnIter >
 CTreeIterTraits< TreeT, typename TreeT::ValueAllCIter >
 CTreeIterTraits< TreeT, typename TreeT::ValueAllIter >
 CTreeIterTraits< TreeT, typename TreeT::ValueOffCIter >
 CTreeIterTraits< TreeT, typename TreeT::ValueOffIter >
 CTreeIterTraits< TreeT, typename TreeT::ValueOnCIter >
 CTreeIterTraits< TreeT, typename TreeT::ValueOnIter >
 CTreeTraits< TreeT >Useful traits for Tree types
 CTreeTraits< const TreeT >
 CTreeValueIteratorBase< _TreeT, _ValueIterT >Base class for tree-traversal iterators over tile and voxel values
 CTruncateCodec
 CTruncateTrait< T >
 CTruncateTrait< float >
 CTruncateTrait< int >
 CTruncateTrait< math::Vec3< T > >
 CTuple< SIZE, T >
 CTuple< 2, T >
 CTuple< 3, double >
 CTuple< 3, Real >
 CTuple< 3, T >
 CTuple< 4, T >
 CUIntTypeTrait< OneByte, T >
 CUIntTypeTrait< false, math::Vec3< T > >
 CUIntTypeTrait< false, T >
 CUIntTypeTrait< true, math::Vec3< T > >
 CUIntTypeTrait< true, T >
 CUniformPrimBuilder
 CUnionValueMasks< LeafNodeTypeA, LeafNodeTypeB >
 CUnitRange
 CUnitVecCodec
 CUnknownCodec
 CMorphology< TreeType >::UpdateMasks
 CUpdatePoints
 CAttributeSet::Util
 CValidateIntersectingVoxels< TreeType >
 CValidPartitioningOp< PointArrayT >
 CValueAccessorBase< TreeType, IsSafe >This base class for ValueAccessors manages registration of an accessor with a tree so that the tree can automatically clear the accessor whenever one of its nodes is deleted
 CValueAccessorBase< _TreeType, IsSafe >
 CValueAccessorBase< BoolTreeType, true >
 CValueAccessorBase< const InputTreeType, true >
 CValueAccessorBase< const TreeT, IsSafe >
 CValueAccessorBase< const TreeT, true >
 CValueAccessorBase< const TreeType, IsSafe >
 CValueAccessorBase< const TreeType, true >
 CValueAccessorBase< Index32TreeType, true >
 CValueAccessorBase< Int16TreeType, true >
 CValueAccessorBase< Int32TreeType, true >
 CValueAccessorBase< IntTreeT, true >
 CValueAccessorBase< TreeT, true >
 CValueAccessorBase< TreeType, true >
 CValueAccessorBase< UCharTreeType, true >
 CInternalNode< _ChildNodeType, Log2Dim >::ValueAll
 CLeafNode< T, Log2Dim >::ValueAll
 CPagedArray< ValueT, Log2PageSize, TableT >::ValueBuffer
 CLeafNode< bool, Log2Dim >::ValueConverter< ValueType >ValueConverter<T>::Type is the type of a LeafNode having the same dimensions as this node but a different value type, T
 CLeafNode< ValueMask, Log2Dim >::ValueConverter< OtherValueType >ValueConverter<T>::Type is the type of a LeafNode having the same dimensions as this node but a different value type, T
 CInternalNode< _ChildNodeType, Log2Dim >::ValueConverter< OtherValueType >ValueConverter<T>::Type is the type of an InternalNode having the same child hierarchy and dimensions as this node but a different value type, T
 CRootNode< ChildType >::ValueConverter< OtherValueType >ValueConverter<T>::Type is the type of a RootNode having the same child hierarchy as this node but a different value type, T
 CGrid< _TreeType >::ValueConverter< OtherValueType >ValueConverter<T>::Type is the type of a grid having the same hierarchy as this grid but a different value type, T
 CTree< _RootNodeType >::ValueConverter< OtherValueType >ValueConverter<T>::Type is the type of a tree having the same hierarchy as this tree but a different value type, T
 CLeafNode< T, Log2Dim >::ValueConverter< OtherValueType >ValueConverter<T>::Type is the type of a LeafNode having the same dimensions as this node but a different value type, T
 CTree< _RootNodeType >::ValueConverter< Int32 >
 CIndexIter< IteratorT, FilterT >::ValueIndexIterA forward iterator over array indices from a value iterator (such as ValueOnCIter)
 CValueMask
 CValueMaskFilter< On >Index filtering on active / inactive state of host voxel
 CLeafNode< T, Log2Dim >::ValueOff
 CInternalNode< _ChildNodeType, Log2Dim >::ValueOff
 CInternalNode< _ChildNodeType, Log2Dim >::ValueOn
 CLeafNode< T, Log2Dim >::ValueOn
 CValueVoxelCIterA forward iterator over array indices in a single voxel
 CVector< T >Lightweight, variable-length vector
 CVector< ValueType >
 CVectorToScalarConverter< VectorGridType >VectorToScalarConverter<VectorGridType>::Type is the type of a grid having the same tree configuration as VectorGridType but a scalar value type, T, where T is the type of the original vector components
 CVectorToScalarGrid< VecGridT >Metafunction to convert a vector-valued grid type to a scalar grid type
 CVectorWrapper
 CVecTraits< T >
 CVecTraits< math::Vec2< T > >
 CVecTraits< math::Vec3< T > >
 CVecTraits< math::Vec4< T > >
 CVelocityIntegrator< GridT, Staggered, SampleOrder >Performs Runge-Kutta time integration of variable order in a static velocity field
 CVelocitySampler< GridT, Staggered, Order >
 CVelocitySampler< GridT, Staggered, SampleOrder >
 CVersionId
 CVolumeAdvection< VelocityGridT, StaggeredVelocity, InterrupterType >Performs advections of an arbitrary type of volume in a static velocity field. The advections are performed by means of various derivatives of Semi-Lagrangian integration, i.e. backwards tracking along the hyperbolic characteristics followed by interpolation
 CVolumeHDDA< TreeT, RayT, ChildNodeLevel >Helper class that implements Hierarchical Digital Differential Analyzers for ray intersections against a generic volume
 CVolumeHDDA< openvdb::v6_0::tree::Tree, RayType, NodeLevel >
 CVolumeHDDA< TreeT, RayT, 0 >Specialization of Hierarchical Digital Differential Analyzer class that intersects against the leafs or tiles of a generic volume
 CVolumeRayIntersector< GridT, NodeLevel, RayT >This class provides the public API for intersecting a ray with a generic (e.g. density) volume
 CVolumeRender< IntersectorT, SamplerT >A (very) simple multithreaded volume render specifically for scalar density
 CVolumeToMeshMesh any scalar grid that has a continuous isosurface
 CVoxelEdgeAccessor< AccessorT, _AXIS >Utility method to marks all voxels that share an edge
 CVoxelizationData< TreeType >TBB body object to voxelize a mesh of triangles and/or quads into a collection of VDB grids, namely a squared distance grid, a closest primitive grid and an intersecting voxels grid (masks the mesh intersecting voxels)
 CInternalNode< _ChildNodeType, Log2Dim >::VoxelizeActiveTiles
 CVoxelizePolygons< TreeType, MeshDataAdapter, Interrupter >
 CVoxelOrderOp< PointIndexType, BucketLog2Dim >