| Carpack_wrapper< Scalar, RealScalar > | |
| Carpack_wrapper< double, double > | |
| Carpack_wrapper< float, float > | |
| CArpackGeneralizedSelfAdjointEigenSolver< LMatrixType, RMatrixType, MatrixOperation, BisSPD > | |
| CBatchCallbackTraits< Callback > | |
| CCallbacksInitializedState< KernelCallback, DistanceCallback, FeaturesCallback > | |
| CCell | |
| CCheckedParameter | |
| ▼CCheckerPolicyBase | |
| CPointerCheckerPolicyImpl< T > | |
| CPointerCheckerPolicyImpl< double > | |
| CPointerCheckerPolicyImpl< float > | |
| CPointerCheckerPolicyImpl< int > | |
| Ccompare_impl< Type, RandomAccessIterator, DistanceCallback > | |
| Ccompare_impl< DistanceType, RandomAccessIterator, DistanceCallback > | |
| Ccompare_impl< KernelType, RandomAccessIterator, DistanceCallback > | |
| Cconditional_select< bool, T > | |
| Cconditional_select< false, T > | |
| Cconditional_select< true, T > | |
| CContext | |
| CCoverTreePoint< RandomAccessIterator > | Class Point to use with John Langford's CoverTree. This class must have some associated functions defined (distance, and print, see below) so it can be used with the CoverTree implementation |
| Cd_node< P > | |
| CDataForErrorFunc | Data needed to compute error function |
| CDataPoint | |
| CDefaultValue | |
| CDenseImplicitSquareMatrixOperation | Matrix-matrix operation used to compute largest eigenvalues and associated eigenvectors of X*X^T like matrix implicitly. Essentially computes matrix product with provided right-hand side part twice |
| CDenseImplicitSquareSymmetricMatrixOperation | Matrix-matrix operation used to compute largest eigenvalues and associated eigenvectors of X*X^T like matrix implicitly. Essentially computes matrix product with provided right-hand side part twice |
| CDenseInverseMatrixOperation | Matrix-matrix operation used to compute smallest eigenvalues and associated eigenvectors of a dense matrix Essentially solves linear system with provided right-hand side part |
| CDenseMatrixOperation | Matrix-matrix operation used to compute largest eigenvalues and associated eigenvectors. Essentially computes matrix product with provided right-hand side part |
| Cdistance_impl< Type, RandomAccessIterator, Callback > | |
| Cdistance_impl< DistanceType, RandomAccessIterator, Callback > | |
| Cdistance_impl< KernelType, RandomAccessIterator, Callback > | |
| CDistanceAndFeaturesInitializedState< DistanceCallback, FeaturesCallback > | |
| CVpTree< T, distance >::DistanceComparator | |
| CDistanceComparator< RandomAccessIterator, DistanceCallback > | |
| CDistanceFirstInitializedState< DistanceCallback > | |
| Cdistances_comparator< DistanceRecord > | |
| CDistanceType | |
| Cds_node< P > | |
| Cdummy_distance_callback< Data > | |
| Cdummy_features_callback< Data > | |
| Cdummy_kernel_callback< Data > | |
| Ceigen_distance_callback | |
| Ceigen_features_callback | |
| Ceigen_kernel_callback | |
| CEmptyType | |
| ▼Cexception | STL class |
| ►Clogic_error | STL class |
| Cmissed_parameter_error | An exception type that is thrown in case of missed parameter, i.e. when some required parameter is not set |
| Cunsupported_method_error | An exception type that is thrown when unsupported method is called |
| Cwrong_parameter_error | An exception type that is thrown in case if wrong parameter value is passed |
| Cwrong_parameter_type_error | An exception type that is thrown in case if wrong parameter value is passed |
| ►Cruntime_error | STL class |
| Ceigendecomposition_error | An exception type that is thrown when eigendecomposition is failed |
| Cmultiple_parameter_error | An exception type that is thrown when some parameter is passed more than once |
| Cnot_enough_memory_error | An exception type that is thrown when the library can't get enough memory |
| Ccancelled_exception | An exception type that is thrown when computations were cancelled |
| CFeaturesFirstInitializedState< FeaturesCallback > | |
| Cfibonacci_heap | Class fibonacci_heap, a fibonacci heap. Generally used by Isomap for Dijkstra heap algorithm |
| Cfibonacci_heap_node | |
| CVpTree< T, distance >::HeapItem | |
| CVantagePointTree< RandomAccessIterator, DistanceCallback >::HeapItem | |
| CImplementationBase< RandomAccessIterator, KernelCallback, DistanceCallback, FeaturesCallback > | |
| Cinitialize | |
| Cis_dummy< T > | |
| CKernelAndDistanceInitializedState< KernelCallback, DistanceCallback > | |
| CKernelAndFeaturesInitializedState< KernelCallback, FeaturesCallback > | |
| CKernelDistance< RandomAccessIterator, Callback > | |
| CKernelDistance< RandomAccessIterator, KernelCallback > | |
| CKernelFirstInitializedState< KernelCallback > | |
| CKernelType | |
| ▼CLoggerImplementation | A base class for logger required by the library |
| CDefaultLoggerImplementation | Default std::cout implementation of LoggerImplementation |
| CLoggingSingleton | Main logging singleton used by the library. Can use provided LoggerImplementation if necessary. By default uses DefaultLoggerImplementation |
| CMessage | |
| CMethodTraits< method > | Traits used to obtain information about dimension reduction methods compile-time |
| Cneighbors_finder< RandomAccessIterator > | |
| CVpTree< T, distance >::Node | |
| CVantagePointTree< RandomAccessIterator, DistanceCallback >::Node | |
| Cnode< P > | |
| CParameter | |
| CParameterKeyword< T > | |
| CParametersInitializedState | |
| CParametersSet | |
| Cpimpl_distance_callback< Implementation > | |
| Cpimpl_kernel_callback< Implementation > | |
| CPlainDistance< RandomAccessIterator, Callback > | |
| CPlainDistance< RandomAccessIterator, DistanceCallback > | |
| Cprecomputed_distance_callback | |
| Cprecomputed_kernel_callback | |
| ▼Cpriority_queue< T > | STL class |
| Creservable_priority_queue< T, Comparator > | |
| CProjectingFunction | A pimpl wrapper for projecting function |
| ▼CProjectionImplementation | A base class for implementation of projecting |
| CMatrixProjectionImplementation | Basic ProjectionImplementation that subtracts mean from the vector and multiplies projecting matrix with it |
| CQuadTree | |
| CSparseInverseMatrixOperation | Matrix-matrix operation used to compute smallest eigenvalues and associated eigenvectors of a sparse matrix Essentially solves linear system with provided right-hand side part |
| CTapkeeOutput | Return result of the library - a pair of DenseMatrix (embedding) and ProjectingFunction |
| Ctimed_context | |
| CTSNE | |
| ▼CTypePolicyBase | |
| CPointerTypePolicyImpl< T > | |
| Cv_array< T > | Class v_array taken directly from JL's implementation |
| Cv_array< ScalarType > | |
| CValueKeeper | |
| CVantagePointTree< RandomAccessIterator, DistanceCallback > | |
| CVpTree< T, distance > | |
1.8.11 
