class PeanoTreeQueue[Discr, V] extends PeanoQueue[Counter[Discr], V]

Implementation of PeanoQueue for Counter keys based on a tree map.

This implementation is not thread safe.

Annotations
@SuppressWarnings()
Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. PeanoTreeQueue
  2. PeanoQueue
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new PeanoTreeQueue(initHead: Counter[Discr])

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. def alreadyInserted(key: Counter[Discr]): Boolean

    Whether the key key has already been insert-ed to the PeanoQueue.

    Whether the key key has already been insert-ed to the PeanoQueue. All values below the PeanoQueue.front are considered to have been inserted to the PeanoQueue, even if they are below the initial PeanoQueue.head.

    Definition Classes
    PeanoTreeQueuePeanoQueue
  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
  7. def dropUntilFront(): Option[(Counter[Discr], V)]

    Drops all elements from the PeanoQueue below the front and sets head to front.

    Drops all elements from the PeanoQueue below the front and sets head to front.

    returns

    scala.None$ if the head already was at the front or the value associated with the last value before head otherwise.

    Definition Classes
    PeanoQueue
  8. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  9. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  10. def front: Counter[Discr]

    Returns the front of the PeanoQueue.

    Returns the front of the PeanoQueue.

    The front is defined as the least key that is at least PeanoQueue.head and that has not yet been inserted into the PeanoQueue.

    Definition Classes
    PeanoTreeQueuePeanoQueue
  11. def get(key: Counter[Discr]): AssociatedValue[V]

    Returns the value associated with the given key.

    Returns the value associated with the given key.

    Definition Classes
    PeanoTreeQueuePeanoQueue
  12. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  13. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  14. def head: Counter[Discr]

    Returns the head of the PeanoQueue.

    Returns the head of the PeanoQueue.

    The head denotes the next key to be pulled. The head key need not yet have been inserted into the PeanoQueue.

    Definition Classes
    PeanoTreeQueuePeanoQueue
  15. def insert(key: Counter[Discr], value: V): Boolean

    Inserts the key-value pair (key, value) to the PeanoQueue.

    Inserts the key-value pair (key, value) to the PeanoQueue. This may change the value for PeanoQueue.front

    Inserting a key-value pair is idempotent. If the keys are bounded from above, then the maximal value must not be inserted.

    key

    The key to be inserted. If the key has been added previously, then the following applies:

    value

    The value associated with the key.

    returns

    whether the key is at least PeanoQueue.head

    Definition Classes
    PeanoTreeQueuePeanoQueue
    Exceptions thrown

    java.lang.IllegalArgumentException if the keys are bounded from above and key is the maximal value, or if the key is above PeanoQueue.head and has been added with a different value.

  16. def invariant: Boolean
    Annotations
    @VisibleForTesting()
  17. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  18. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  19. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  20. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  21. def poll(): Option[(Counter[Discr], V)]

    Returns and drops the key at PeanoQueue.head and its associated value, if present.

    Returns and drops the key at PeanoQueue.head and its associated value, if present. If so, this also increments PeanoQueue.head. Returns scala.None to indicate that the key PeanoQueue.head has not yet been inserted.

    Definition Classes
    PeanoTreeQueuePeanoQueue
  22. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  23. def toString(): String
    Definition Classes
    PeanoTreeQueue → AnyRef → Any
  24. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  25. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  26. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated

Inherited from PeanoQueue[Counter[Discr], V]

Inherited from AnyRef

Inherited from Any

Ungrouped