class BoundablePair extends Comparable[BoundablePair]
- Alphabetic
- By Inheritance
- BoundablePair
- Comparable
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new BoundablePair(boundable1: Boundable, boundable2: Boundable, itemDistance: ItemDistance)
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- var boundable1: Boundable
- var boundable2: Boundable
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- def compareTo(nd: BoundablePair): Int
Compares two pairs based on their minimum distances
Compares two pairs based on their minimum distances
- Definition Classes
- BoundablePair → Comparable
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def expandToQueue(priQ: PriorityQueue, minDistance: Double): Unit
For a pair which is not a leaf (i.e.
For a pair which is not a leaf (i.e. has at least one composite boundable) computes a list of new pairs from the expansion of the larger boundable with distance less than minDistance and adds them to a priority queue.
Note that expanded pairs may contain the same item/node on both sides. This must be allowed to support distance functions which have non-zero distances between the item and itself (non-zero reflexive distance).
- priQ
the priority queue to add the new pairs to
- minDistance
the limit on the distance between added pairs
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- def getBoundable(i: Int): Boundable
Gets one of the member {link Boundable}s in the pair (indexed by [0, 1]).
Gets one of the member {link Boundable}s in the pair (indexed by [0, 1]).
- i
the index of the member to return (0 or 1) return the chosen member
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def getDistance: Double
Gets the minimum possible distance between the Boundables in this pair.
Gets the minimum possible distance between the Boundables in this pair. If the members are both items, this will be the exact distance between them. Otherwise, this distance will be a lower bound on the distances between the items in the members.
return the exact or lower bound distance for this pair
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def isLeaves: Boolean
Tests if both elements of the pair are leaf nodes
Tests if both elements of the pair are leaf nodes
return true if both pair elements are leaf nodes
- var itemDistance: ItemDistance
- def maximumDistance: Double
Computes the maximum distance between any two items in the pair of nodes.
Computes the maximum distance between any two items in the pair of nodes.
return the maximum distance between items in the pair
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()