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 apply(hub: LongMap[String], max: Int, poolName: String): GenericPool

   Overloaded constructor that assigns a "numerical first discovery" function for number selection.

   Overloaded constructor that assigns a "numerical first discovery" function for number selection.

   hub

   na

   max

   na

   poolName

   na

   returns

   a GenericPool entity

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()

7.  final def eq(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

8.  def equals(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef → Any

9.  def finalize(): Unit

   Attributes

   protected[lang]

   Definition Classes

   AnyRef

   Annotations

   @throws(classOf[java.lang.Throwable])

10.  def first(list: List[Long], domainSize: Int): Int

    Get some number that is not accounted for in any other fixed pool, making it available in this generic one.
    
    Returns the first number that is detected as available between two sorted numbers.

    Get some number that is not accounted for in any other fixed pool, making it available in this generic one.
    
    Returns the first number that is detected as available between two sorted numbers.

    list

    all of the non-repeating numbers to be compared

    domainSize

    how many numbers can be supported

    returns

    the next available number, or -1

11.  final def getClass(): Class[_ <: AnyRef]

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

12.  def hashCode(): Int

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

13.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

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

    Definition Classes

    AnyRef

15.  final def notify(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

16.  final def notifyAll(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

17.  def rand(list: List[Long], domainSize: Int): Int

    Get some number that is not accounted for in any other fixed pool, making it available in this generic one.
    
    Although called "rand," this algorithm is not actually random.

    Get some number that is not accounted for in any other fixed pool, making it available in this generic one.
    
    Although called "rand," this algorithm is not actually random. From a sorted list of numbers, with a minimum and a maximum value appended, it finds the two adjacent numbers that are the most distant. It finds an average whole integer number between the two.
    
    This solution gets expensive as the count of numbers in list increases.

    list

    all of the non-repeating numbers to be compared

    domainSize

    how many numbers can be supported

    returns

    midpoint of the largest distance between any two of the existing numbers, or -1

18.  final def synchronized[T0](arg0: => T0): T0

    Definition Classes

    AnyRef

19.  def toString(): String

    Definition Classes

    AnyRef → Any

20.  final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.InterruptedException])

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

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.InterruptedException])

22.  final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.InterruptedException]) @native()