Tapkee
Class Hierarchy
This inheritance list is sorted roughly, but not completely, alphabetically:
[detail level 123]
 Cany_wrapper
 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
 Ccompare_impl< Type, RandomAccessIterator, DistanceCallback >
 Ccompare_impl< DistanceType, RandomAccessIterator, DistanceCallback >
 Ccompare_impl< KernelType, RandomAccessIterator, DistanceCallback >
 Ccompile_time_assert< bool >
 Ccompile_time_assert< std::numeric_limits< T >::is_integer >
 Ccompile_time_assert< std::numeric_limits< T >::is_specialized >
 Ccompile_time_assert< true >
 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 >
 CDataForErrorFuncData needed to compute error function
 CDataPoint
 CDefaultValue
 CDenseImplicitSquareMatrixOperationMatrix-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
 CDenseImplicitSquareSymmetricMatrixOperationMatrix-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
 CDenseInverseMatrixOperationMatrix-matrix operation used to compute smallest eigenvalues and associated eigenvectors of a dense matrix Essentially solves linear system with provided right-hand side part
 CDenseMatrixOperationMatrix-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
 Ceigendecomposition_impl< MatrixType >
 Ceigendecomposition_impl< DenseMatrix >
 Ceigendecomposition_impl< SparseWeightMatrix >
 CEmptyType
 CexceptionSTL class
 CFeaturesFirstInitializedState< FeaturesCallback >
 Cfibonacci_heapClass fibonacci_heap, a fibonacci heap. Generally used by Isomap for Dijkstra heap algorithm
 Cfibonacci_heap_node
 Cgeneralized_eigendecomposition_impl< LMatrixType, RMatrixType >
 Cgeneralized_eigendecomposition_impl< DenseMatrix, DenseMatrix >
 Cgeneralized_eigendecomposition_impl< SparseWeightMatrix, DenseDiagonalMatrix >
 CVpTree< T, distance >::HeapItem
 CVantagePointTree< RandomAccessIterator, DistanceCallback >::HeapItem
 CHexWrapper< T >
 CImplementationBase< RandomAccessIterator, KernelCallback, DistanceCallback, FeaturesCallback >
 CInClosedRange< T >
 Cinitialize
 CInRange< T >
 Cis_dummy< T >
 CKernelAndDistanceInitializedState< KernelCallback, DistanceCallback >
 CKernelAndFeaturesInitializedState< KernelCallback, FeaturesCallback >
 CKernelDistance< RandomAccessIterator, Callback >
 CKernelDistance< RandomAccessIterator, KernelCallback >
 CKernelFirstInitializedState< KernelCallback >
 CKernelType
 CLoggerImplementationA base class for logger required by the library
 CLoggingSingletonMain logging singleton used by the library. Can use provided LoggerImplementation if necessary. By default uses DefaultLoggerImplementation
 CMethod< M >
 CMethod< ComputationStrategy >
 CMethod< EigendecompositionStrategy >
 CMethod< EigenMethod >
 CMethod< NeighborsMethod >
 CMethodTraits< method >Traits used to obtain information about dimension reduction methods compile-time
 Cneighbors_finder< RandomAccessIterator >
 CVpTree< T, distance >::Node
 Cnode< P >
 CVantagePointTree< RandomAccessIterator, DistanceCallback >::Node
 CNonNegativity< T >
 COctWrapper< T >
 CParameter
 CParameterKeyword< T >
 CParametersForwarder
 CParametersInitializedState
 CParametersSet
 Cpimpl_distance_callback< Implementation >
 Cpimpl_kernel_callback< Implementation >
 CPlainDistance< RandomAccessIterator, Callback >
 CPlainDistance< RandomAccessIterator, DistanceCallback >
 CPositivity< T >
 CPrecisionWrapper< T >
 CPrecisionWrapperBuilder
 CPrecisionWrapperBuilderHelper
 Cprecomputed_distance_callback
 Cprecomputed_kernel_callback
 Cpriority_queue< T >STL class
 CProjectingFunctionA pimpl wrapper for projecting function
 CProjectionImplementationA base class for implementation of projecting
 CQuadTree
 Crepr_impl_if_streaming_supported< T, bool >
 Crepr_impl_if_streaming_supported< T, false >
 Crepr_impl_if_streaming_supported< T, true >
 CSparseInverseMatrixOperationMatrix-matrix operation used to compute smallest eigenvalues and associated eigenvectors of a sparse matrix Essentially solves linear system with provided right-hand side part
 Csupports_saving< S, T >
 CTapkeeOutputReturn result of the library - a pair of DenseMatrix (embedding) and ProjectingFunction
 Ctimed_context
 CTSNE
 CTypePolicyBase
 Cv_array< T >Class v_array taken directly from JL's implementation
 Cv_array< ScalarType >
 CValueKeeper
 CValueWrapper
 CValueWrapperImplementationBase
 CVantagePointTree< RandomAccessIterator, DistanceCallback >
 CVpTree< T, distance >
 CWidthWrapper< T >
 CWidthWrapperBuilder
 CWidthWrapperBuilderHelper