final class Queue[A] extends AnyRef
A FIFO queue of chunks that provides an O(1) size method and provides the ability to take and drop individual elements while preserving the chunk structure as much as possible.
This is similar to a queue of individual elements but chunk structure is maintained.
- Source
- Chunk.scala
- Alphabetic
- By Inheritance
- Queue
- AnyRef
- Any
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
- def +(other: String): String
-
def
+:(c: Chunk[A]): Queue[A]
Prepends a chunk to the start of this chunk queue.
- def ->[B](y: B): (Queue[A], B)
-
def
:+(c: Chunk[A]): Queue[A]
Appends a chunk to the end of this chunk queue.
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
- val chunks: scala.collection.immutable.Queue[Chunk[A]]
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
drop(n: Int): Queue[A]
Drops the first
n
elements of this chunk queue in a way that preserves chunk structure. -
def
dropRight(n: Int): Queue[A]
Drops the right-most
n
elements of this chunk queue in a way that preserves chunk structure. - def ensuring(cond: (Queue[A]) ⇒ Boolean, msg: ⇒ Any): Queue[A]
- def ensuring(cond: (Queue[A]) ⇒ Boolean): Queue[A]
- def ensuring(cond: Boolean, msg: ⇒ Any): Queue[A]
- def ensuring(cond: Boolean): Queue[A]
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(that: Any): Boolean
- Definition Classes
- Queue → AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
- def formatted(fmtstr: String): String
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- Queue → AnyRef → Any
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def iterator: Iterator[A]
-
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()
- val size: Int
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
take(n: Int): Queue[A]
Takes the first
n
elements of this chunk queue in a way that preserves chunk structure. -
def
takeRight(n: Int): Queue[A]
Takes the right-most
n
elements of this chunk queue in a way that preserves chunk structure. -
def
toChunk: Chunk[A]
Converts this chunk queue to a single chunk, copying all chunks to a single chunk.
-
def
toString(): String
- Definition Classes
- Queue → AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
- def →[B](y: B): (Queue[A], B)