Class

org.clustering4ever.scala.umap

Heap

Related Doc: package umap

Permalink

final case class Heap(nPoints: Int, size: Int) extends Product with Serializable

Linear Supertypes
Serializable, Serializable, Product, Equals, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Heap
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. AnyRef
  7. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Heap(nPoints: Int, size: Int)

    Permalink

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  5. final def buildCandidates(nVertices: Int, nNeighbors: Int, maxCandidates: Int, rngState: Array[Long]): Heap

    Permalink

    Build a heap of candidate neighbors for nearest neighbor descent.

    Build a heap of candidate neighbors for nearest neighbor descent. For each vertex the candidate neighbors are any current neighbors, and any vertices that have the vertex as one of their nearest neighbors.

    nVertices

    The total number of vertices in the graph.

    nNeighbors

    The number of neighbor edges per node in the current graph.

    maxCandidates

    The maximum number of new candidate neighbors.

    rngState

    The internal state of the rng

    returns

    candidateNeighbors: A heap with an array of (randomly sorted) candidate neighbors for each vertex in the graph.

  6. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate() @throws( ... )

  7. final def deheapSort: (DenseMatrix[Int], DenseMatrix[Double])

    Permalink

    Given an array of heaps (of indices and weights), unpack the heap out to give and array of sorted lists of indices and weights by increasing weight.

    Given an array of heaps (of indices and weights), unpack the heap out to give and array of sorted lists of indices and weights by increasing weight. This is effectively just the second half of heap sort (the first half not being required since we already have the data in a heap).

    returns

    The indices and weights sorted by increasing weight.

  8. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  9. val flags: DenseMatrix[Int]

    Permalink

  10. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
    Annotations
    @HotSpotIntrinsicCandidate()

  11. val indices: DenseMatrix[Int]

    Permalink

  12. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  13. final val nPoints: Int

    Permalink

  14. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  15. final def newBuildCandidates(nVertices: Int, nNeighbors: Int, maxCandidates: Int, rngState: Array[Long], rho: Double = 0.5): (Heap, Heap)

    Permalink

    Build a heap of candidate neighbors for nearest neighbor descent.

    Build a heap of candidate neighbors for nearest neighbor descent. For each vertex the candidate neighbors are any current neighbors, and any vertices that have the vertex as one of their nearest neighbors.

    nVertices

    The total number of vertices in the graph.

    nNeighbors

    The number of neighbor edges per node in the current graph.

    maxCandidates

    The maximum number of new candidate neighbors.

    rngState

    The internal state of the rng

    returns

    A heap with an array of (randomly sorted) candidate neighbors for each vertex in the graph.

  16. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate()

  17. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate()

  18. final def push(row: Int, weight: Double, index: Int, flag: Int): Int

    Permalink

  19. final val size: Int

    Permalink

  20. final def smallestFlagged(row: Int): Int

    Permalink

    Search the heap for the smallest element that is still flagged.

    Search the heap for the smallest element that is still flagged.

    row

    Which of the heaps to search

    returns

    The index of the smallest flagged element of the rowth heap, or -1 if no flagged elements remain in the heap.

  21. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef

  22. def toString(): String

    Permalink
    Definition Classes
    Heap → AnyRef → Any

  23. final def uncheckedPush(row: Int, weight: Double, index: Int, flag: Int): Int

    Permalink

  24. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  25. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  26. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  27. val weights: DenseMatrix[Double]

    Permalink

Deprecated Value Members

  1. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @Deprecated @deprecated @throws( classOf[java.lang.Throwable] )
    Deprecated

    (Since version ) see corresponding Javadoc for more information.

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped