Uses of Interface
elki.database.ids.DoubleDBIDListMIter

Packages that use DoubleDBIDListMIter

Package	Description
elki.database.ids	Database object identification and ID group handling API.
elki.database.ids.integer	Integer-based DBID implementation -- do not use directly - always use DBIDUtil.
elki.index.laesa	Linear Approximating and Eliminating Search Algorithm (LAESA).
elki.index.tree.metrical.vptree
elki.index.tree.spatial.kd	K-d-tree and variants.

Uses of DoubleDBIDListMIter in elki.database.ids

Methods in elki.database.ids that return DoubleDBIDListMIter

Modifier and Type	Method	Description
DoubleDBIDListMIter	ModifiableDoubleDBIDList.iter()
DoubleDBIDListMIter	DoubleDBIDListMIter.seek(int off)

Uses of DoubleDBIDListMIter in elki.database.ids.integer

Subinterfaces of DoubleDBIDListMIter in elki.database.ids.integer

Modifier and Type	Interface	Description
(package private) interface	DoubleIntegerDBIDListMIter	Combination interface for modifiable iterators.

Classes in elki.database.ids.integer that implement DoubleDBIDListMIter

Modifier and Type	Class	Description
private class	DoubleIntegerDBIDArrayList.Itr	List iterator.

Uses of DoubleDBIDListMIter in elki.index.laesa

Methods in elki.index.laesa with parameters of type DoubleDBIDListMIter

Modifier and Type	Method	Description
private int	LAESA.LAESAKNNSearcher.processPoints(ModifiableDoubleDBIDList cands, DoubleDBIDListMIter iter, double threshold, double dxs, DoubleDataStore rdists, int nc)	Process a set of points

Uses of DoubleDBIDListMIter in elki.index.tree.metrical.vptree

Fields in elki.index.tree.metrical.vptree declared as DoubleDBIDListMIter

Modifier and Type	Field	Description
(package private) DoubleDBIDListMIter	VPTree.Builder.scratchit	Scratch iterator

Uses of DoubleDBIDListMIter in elki.index.tree.spatial.kd

Methods in elki.index.tree.spatial.kd with parameters of type DoubleDBIDListMIter

Modifier and Type	Method	Description
private void	SmallMemoryKDTree.buildTree(int left, int right, int axis, DoubleDBIDListMIter iter)	Recursively build the tree by partial sorting.