Uses of Interface
jsat.linear.vectorcollection.IncrementalCollection

Packages that use IncrementalCollection

Package	Description
jsat.linear.vectorcollection

Uses of IncrementalCollection in jsat.linear.vectorcollection

Classes in jsat.linear.vectorcollection that implement IncrementalCollection

Modifier and Type	Class and Description
class	CoverTree<V extends Vec> This class implements the Cover-tree algorithm for answering nearest neighbor queries.
class	RandomBallCover<V extends Vec> An implementation of the exact search for the Random Ball Cover algorithm.
class	VectorArray<V extends Vec> This is the naive implementation of a Vector collection.
class	VPTree<V extends Vec> Provides an implementation of Vantage Point Trees, as described in "Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces" by Peter N.
class	VPTreeMV<V extends Vec> The VPTreeMV is an extension of the VPTree, the MV meaning "of Minimum Variance".

Methods in jsat.linear.vectorcollection that return IncrementalCollection

Modifier and Type	Method and Description
IncrementalCollection<V>	IncrementalCollection.clone()