Class List

Here are the classes, structs, unions and interfaces with brief descriptions:

[detail level 1234]

Nclustering
Nhdbscan
CMstEdge	One edge of the minimum spanning tree of mutual-reachability distances
CMstOutput	Frozen output contract of every MST backend
CAutoMstBackend	MST backend that dispatches between Prim, Boruvka, and NN-Descent on input shape
CBoruvkaMstBackend	KDTree-accelerated Boruvka MST backend over mutual-reachability distances
CNnDescentMstConfig	Tuning knobs for the NN-Descent MST backend
CNnDescentMstBackend	Approximate minimum-spanning-tree backend over mutual-reachability distance via an NN-Descent-built kNN graph plus Kruskal, with a connectivity fallback that closes any disconnected components
CPrimMstBackend	Exact minimum-spanning-tree backend over mutual-reachability distance, streaming Prim
Nindex
CAutoRangeIndex	Range-index policy that picks KDTree below a dimension threshold and BruteForcePairwise above it
CNnDescentIndex	Approximate k -nearest-neighbor graph via the NN-Descent algorithm (Dong, Charikar, Li 2011) with random-projection-tree initialization
CKnnEntry	Per-node kNN entry returned by neighbors. Squared Euclidean distance carried as T
Nkmeans
CAfkMc2Seeder	AFK-MC2 seeder (Bachem, Lucic, Hassani, Krause, NeurIPS 2016)
CAutoSeeder	Seeder that picks between greedy k-means++ and AFK-MC2 against workload shape
CGreedyKmppSeeder	Greedy k-means++ seeder
CLloydFusedGemm	Fused-argmin-GEMM Lloyd driver
Nmath
Ndistance
CSqEuclideanTag	Tag selecting the squared Euclidean metric
CCosineTag	Tag selecting the cosine distance metric (1 - cos(angle))
CManhattanTag	Tag selecting the Manhattan (L1) metric: sum of absolute differences
CGemmPlan	Reusable GEMM plan: packs B once at construction, amortizes the packing cost across repeated execute calls with varying A
Cpcg64	128-bit state for the PCG-XSL-RR 64-bit output generator (Melissa O'Neill)
Cxoshiro256ss	256-bit state for Vigna & Blackman's xoshiro256** generator
CPool	Thin injection wrapper around a BS::light_thread_pool
CDBSCAN	Density-based clustering over the eps-neighborhood graph produced by a clustering::index::RangeIndex backend
CHDBSCAN	Hierarchical density-based clustering over mutual-reachability distances
CCondensedTreeView	Read-only view over the condensed-tree result
CBruteForcePairwise	Range-index backend that builds the full eps-neighborhood adjacency in one fused pairwise sweep
CKDTreeNode	Node in a KDTree, sharing the same struct shape between internals and leaves
CKDTree	Implements a KDTree data structure
CKMeans	Lloyd-family k-means
CUnionFind	Disjoint-set-union with iterative path compression and union-by-rank
CBinaryHeap	Binary min-heap of (key, val) pairs ordered on key
CIndexedHeap	Binary min-heap keyed on Key with O(1) handle-to-position lookup
CEntry	One heap entry
CLinearAllocator
CNewAllocator	Thin wrapper over new T / delete that satisfies the library's allocator concept
CNDArray	Represents a multidimensional array (NDArray) of a fixed number of dimensions N and element type T
CBaseAccessor	Inner class providing base functionality for element access in NDArray
CConstAccessor	Provides read-only access to NDArray elements
CAccessor	Provides read-write access to NDArray elements
CRange	Half-open index range with optional positive step for slicing an NDArray axis