package kdtree
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- kdtree
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Type Members
- sealed trait Adjacency extends AnyRef
- case class AdjacencyDirection (coordinate: Int, relation: Adjacency) extends Product with Serializable
- trait ContainsLabel [T] extends Serializable
- type ContentReduction[CONTENT] = (Leaf[CONTENT], Leaf[CONTENT]) ⇒ Option[CONTENT]
- sealed trait Descendant extends AnyRef
- case class Direction (coordinate: Int, sign: Sign) extends Product with Serializable
- type Distance = (Vector[Double], Vector[Double]) ⇒ Double
- case class EmptyTree [T](zone: Zone) extends Tree[T] with Product with Serializable
- trait Fork [T] extends Node[T]
- case class Interval (min: Double, max: Double) extends Product with Serializable
- trait Leaf [T] extends Node[T]
- implicit class LeafDecorator [T] extends AnyRef
- sealed trait Node [T] extends AnyRef
- implicit class NodeDecorator [T] extends AnyRef
- case class NonEmptyTree [T](root: Node[T], depth: Int) extends Tree[T] with Product with Serializable
- implicit class NonEmptyTreeDecorator [T] extends AnyRef
- type Path = List[PathElement]
- case class PathElement (coordinate: Int, descendant: Descendant) extends Product with Serializable
- sealed trait Sign extends AnyRef
- sealed trait Tree [T] extends AnyRef
- implicit class TreeDecorator [T] extends AnyRef
- trait Zone extends AnyRef
Value Members
- def equivalence(a: Double, b: Double): Boolean
- def euclidianDistance: Distance
- def includes(a: Interval, b: Interval): Boolean
- implicit def intervalsToZone(intervals: Vector[(Double, Double)]): Zone
- def leaves[T](n: Node[T]): Vector[Leaf[T]]
- def maximalReduction[T](criticalLeaves: Vector[Zone], testPoint: (T) ⇒ Vector[Double]): ContentReduction[T]
- def pairsBetweenNodes[T](node1: Node[T], node2: Node[T], label: (T) ⇒ Boolean): Iterable[(Leaf[T], Leaf[T], Int)]
- def pairsToSet[T](pairs: Iterable[(Leaf[T], Leaf[T], Int)]): Iterable[(Leaf[T], Int)]
- def projection(point: Vector[Double], zone: Zone): Vector[Double]
- implicit def treeToNode[T](t: NonEmptyTree[T]): Node[T]
- object ContainsLabel extends Serializable
- object Descendant
- object EmptyTree extends Serializable
- object Fork
- object HelperFunctions
- object Interval extends Serializable
- object Leaf
- object LeftIsHigh extends Adjacency with Product with Serializable
- object LeftIsLow extends Adjacency with Product with Serializable
- object Negative extends Sign with Product with Serializable
- object NonEmptyTree extends Serializable
- object Path
- object Positive extends Sign with Product with Serializable
- object Tree
- object Zone
- object mutable