Packages

object Queue extends StrictOptimizedSeqFactory[Queue]

This object provides a set of operations to create Queue values.

Annotations
@SerialVersionUID()
Source
Queue.scala
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Queue
  2. StrictOptimizedSeqFactory
  3. SeqFactory
  4. IterableFactory
  5. Serializable
  6. AnyRef
  7. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Value Members

  1. def apply[A](elems: A*): Queue[A]

    Creates a queue with the specified elements.

    Creates a queue with the specified elements.

    A

    the type of the queue's elements

    elems

    the elements of the created queue

    returns

    a new queue with elements elems

    Definition Classes
    IterableFactory
  2. def concat[A](xss: collection.Iterable[A]*): Queue[A]

    Concatenates all argument collections into a single queue.

    Concatenates all argument collections into a single queue.

    xss

    the collections that are to be concatenated.

    returns

    the concatenation of all the collections.

    Definition Classes
    StrictOptimizedSeqFactoryIterableFactory
  3. def empty[A]: Queue[A]

    An empty collection

    An empty collection

    A

    the type of the queue's elements

    Definition Classes
    QueueIterableFactory
  4. def fill[A](n: Int)(elem: => A): Queue[A]

    Produces a queue containing the results of some element computation a number of times.

    Produces a queue containing the results of some element computation a number of times.

    n

    the number of elements contained in the queue.

    elem

    the element computation

    returns

    A queue that contains the results of n evaluations of elem.

    Definition Classes
    StrictOptimizedSeqFactoryIterableFactory
  5. def fill[A](n1: Int, n2: Int, n3: Int, n4: Int, n5: Int)(elem: => A): Queue[Queue[Queue[Queue[Queue[A]]]]]

    Produces a five-dimensional queue containing the results of some element computation a number of times.

    Produces a five-dimensional queue containing the results of some element computation a number of times.

    n1

    the number of elements in the 1st dimension

    n2

    the number of elements in the 2nd dimension

    n3

    the number of elements in the 3rd dimension

    n4

    the number of elements in the 4th dimension

    n5

    the number of elements in the 5th dimension

    elem

    the element computation

    returns

    A queue that contains the results of n1 x n2 x n3 x n4 x n5 evaluations of elem.

    Definition Classes
    IterableFactory
  6. def fill[A](n1: Int, n2: Int, n3: Int, n4: Int)(elem: => A): Queue[Queue[Queue[Queue[A]]]]

    Produces a four-dimensional queue containing the results of some element computation a number of times.

    Produces a four-dimensional queue containing the results of some element computation a number of times.

    n1

    the number of elements in the 1st dimension

    n2

    the number of elements in the 2nd dimension

    n3

    the number of elements in the 3rd dimension

    n4

    the number of elements in the 4th dimension

    elem

    the element computation

    returns

    A queue that contains the results of n1 x n2 x n3 x n4 evaluations of elem.

    Definition Classes
    IterableFactory
  7. def fill[A](n1: Int, n2: Int, n3: Int)(elem: => A): Queue[Queue[Queue[A]]]

    Produces a three-dimensional queue containing the results of some element computation a number of times.

    Produces a three-dimensional queue containing the results of some element computation a number of times.

    n1

    the number of elements in the 1st dimension

    n2

    the number of elements in the 2nd dimension

    n3

    the number of elements in the 3rd dimension

    elem

    the element computation

    returns

    A queue that contains the results of n1 x n2 x n3 evaluations of elem.

    Definition Classes
    IterableFactory
  8. def fill[A](n1: Int, n2: Int)(elem: => A): Queue[Queue[A]]

    Produces a two-dimensional queue containing the results of some element computation a number of times.

    Produces a two-dimensional queue containing the results of some element computation a number of times.

    n1

    the number of elements in the 1st dimension

    n2

    the number of elements in the 2nd dimension

    elem

    the element computation

    returns

    A queue that contains the results of n1 x n2 evaluations of elem.

    Definition Classes
    IterableFactory
  9. def from[A](source: IterableOnce[A]): Queue[A]

    Creates a target queue from an existing source collection

    Creates a target queue from an existing source collection

    A

    the type of the collection’s elements

    source

    Source collection

    returns

    a new queue with the elements of source

    Definition Classes
    QueueIterableFactory
  10. implicit def iterableFactory[A]: Factory[A, Queue[A]]
    Definition Classes
    IterableFactory
  11. def iterate[A](start: A, len: Int)(f: (A) => A): Queue[A]

    Produces a queue containing repeated applications of a function to a start value.

    Produces a queue containing repeated applications of a function to a start value.

    start

    the start value of the queue

    len

    the number of elements contained in the queue

    f

    the function that's repeatedly applied

    returns

    a queue with len values in the sequence start, f(start), f(f(start)), ...

    Definition Classes
    IterableFactory
  12. def newBuilder[A]: Builder[A, Queue[A]]

    A

    the type of the queue’s elements

    returns

    A builder for Queue objects.

    Definition Classes
    QueueIterableFactory
  13. def range[A](start: A, end: A, step: A)(implicit arg0: Integral[A]): Queue[A]

    Produces a queue containing equally spaced values in some integer interval.

    Produces a queue containing equally spaced values in some integer interval.

    start

    the start value of the queue

    end

    the end value of the queue (the first value NOT contained)

    step

    the difference between successive elements of the queue (must be positive or negative)

    returns

    a queue with values start, start + step, ... up to, but excluding end

    Definition Classes
    IterableFactory
  14. def range[A](start: A, end: A)(implicit arg0: Integral[A]): Queue[A]

    Produces a queue containing a sequence of increasing of integers.

    Produces a queue containing a sequence of increasing of integers.

    start

    the first element of the queue

    end

    the end value of the queue (the first value NOT contained)

    returns

    a queue with values start, start + 1, ..., end - 1

    Definition Classes
    IterableFactory
  15. def tabulate[A](n: Int)(f: (Int) => A): Queue[A]

    Produces a queue containing values of a given function over a range of integer values starting from 0.

    Produces a queue containing values of a given function over a range of integer values starting from 0.

    n

    The number of elements in the queue

    f

    The function computing element values

    returns

    A queue consisting of elements f(0), ..., f(n -1)

    Definition Classes
    StrictOptimizedSeqFactoryIterableFactory
  16. def tabulate[A](n1: Int, n2: Int, n3: Int, n4: Int, n5: Int)(f: (Int, Int, Int, Int, Int) => A): Queue[Queue[Queue[Queue[Queue[A]]]]]

    Produces a five-dimensional queue containing values of a given function over ranges of integer values starting from 0.

    Produces a five-dimensional queue containing values of a given function over ranges of integer values starting from 0.

    n1

    the number of elements in the 1st dimension

    n2

    the number of elements in the 2nd dimension

    n3

    the number of elements in the 3rd dimension

    n4

    the number of elements in the 4th dimension

    n5

    the number of elements in the 5th dimension

    f

    The function computing element values

    returns

    A queue consisting of elements f(i1, i2, i3, i4, i5) for 0 <= i1 < n1, 0 <= i2 < n2, 0 <= i3 < n3, 0 <= i4 < n4, and 0 <= i5 < n5.

    Definition Classes
    IterableFactory
  17. def tabulate[A](n1: Int, n2: Int, n3: Int, n4: Int)(f: (Int, Int, Int, Int) => A): Queue[Queue[Queue[Queue[A]]]]

    Produces a four-dimensional queue containing values of a given function over ranges of integer values starting from 0.

    Produces a four-dimensional queue containing values of a given function over ranges of integer values starting from 0.

    n1

    the number of elements in the 1st dimension

    n2

    the number of elements in the 2nd dimension

    n3

    the number of elements in the 3rd dimension

    n4

    the number of elements in the 4th dimension

    f

    The function computing element values

    returns

    A queue consisting of elements f(i1, i2, i3, i4) for 0 <= i1 < n1, 0 <= i2 < n2, 0 <= i3 < n3, and 0 <= i4 < n4.

    Definition Classes
    IterableFactory
  18. def tabulate[A](n1: Int, n2: Int, n3: Int)(f: (Int, Int, Int) => A): Queue[Queue[Queue[A]]]

    Produces a three-dimensional queue containing values of a given function over ranges of integer values starting from 0.

    Produces a three-dimensional queue containing values of a given function over ranges of integer values starting from 0.

    n1

    the number of elements in the 1st dimension

    n2

    the number of elements in the 2nd dimension

    n3

    the number of elements in the 3rd dimension

    f

    The function computing element values

    returns

    A queue consisting of elements f(i1, i2, i3) for 0 <= i1 < n1, 0 <= i2 < n2, and 0 <= i3 < n3.

    Definition Classes
    IterableFactory
  19. def tabulate[A](n1: Int, n2: Int)(f: (Int, Int) => A): Queue[Queue[A]]

    Produces a two-dimensional queue containing values of a given function over ranges of integer values starting from 0.

    Produces a two-dimensional queue containing values of a given function over ranges of integer values starting from 0.

    n1

    the number of elements in the 1st dimension

    n2

    the number of elements in the 2nd dimension

    f

    The function computing element values

    returns

    A queue consisting of elements f(i1, i2) for 0 <= i1 < n1 and 0 <= i2 < n2.

    Definition Classes
    IterableFactory
  20. final def unapplySeq[A](x: Queue[A]): UnapplySeqWrapper[A]
    Definition Classes
    SeqFactory
  21. def unfold[A, S](init: S)(f: (S) => Option[(A, S)]): Queue[A]

    Produces a queue that uses a function f to produce elements of type A and update an internal state of type S.

    Produces a queue that uses a function f to produce elements of type A and update an internal state of type S.

    A

    Type of the elements

    S

    Type of the internal state

    init

    State initial value

    f

    Computes the next element (or returns None to signal the end of the collection)

    returns

    a queue that produces elements using f until f returns None

    Definition Classes
    IterableFactory