Buffer

Returns the element at the specified index. Throws if index is < 0 or >= size.

Copies the elements of this chunk in to the specified array at the specified start index.

Drops the first n elements of this chunk.

Splits this chunk in to two chunks at the specified index n, which is guaranteed to be in-bounds.

Takes the first n elements of this chunk.

Copies the elements of this chunk to an array.

Returns a chunk which consists of the elements of this chunk and the elements of the supplied chunk. This operation is amortized O(1).

More efficient version of filter(pf.isDefinedAt).map(pf).

Converts this chunk to a chunk backed by a single array.

Alternatively, call toIndexedChunk to get back a chunk with guaranteed O(1) indexed lookup while also minimizing copying.

Drops the right-most n elements of this chunk queue in a way that preserves chunk structure.

Compares the receiver object (this) with the argument object (that) for equivalence.

Any implementation of this method should be an equivalence relation:

• It is reflexive: for any instance x of type Any, x.equals(x) should return true.
• It is symmetric: for any instances x and y of type Any, x.equals(y) should return true if and only if y.equals(x) returns true.
• It is transitive: for any instances x, y, and z of type Any if x.equals(y) returns true and y.equals(z) returns true, then x.equals(z) should return true.

If you override this method, you should verify that your implementation remains an equivalence relation. Additionally, when overriding this method it is usually necessary to override hashCode to ensure that objects which are "equal" (o1.equals(o2) returns true) hash to the same scala.Int. (o1.hashCode.equals(o2.hashCode)).

Returns a chunk that has only the elements that satisfy the supplied predicate.

Returns the first element for which the predicate returns true or None if no elements satisfy the predicate.

Maps f over the elements of this chunk and concatenates the result.

Left-folds the elements of this chunk.

Returns true if the predicate passes for all elements.

Invokes the supplied function for each element of this chunk.

Like foreach but includes the index of the element.

Calculate a hash code value for the object.

The default hashing algorithm is platform dependent.

Note that it is allowed for two objects to have identical hash codes (o1.hashCode.equals(o2.hashCode)) yet not be equal (o1.equals(o2) returns false). A degenerate implementation could always return 0. However, it is required that if two objects are equal (o1.equals(o2) returns true) that they have identical hash codes (o1.hashCode.equals(o2.hashCode)). Therefore, when overriding this method, be sure to verify that the behavior is consistent with the equals method.

Gets the first element of this chunk.

Returns the index of the first element which passes the specified predicate (i.e., p(i) == true) or None if no elements pass the predicate.

True if size is zero, false otherwise.

Creates an iterator that iterates the elements of this chunk. The returned iterator is not thread safe.

Gets the last element of this chunk.

Creates a new chunk by applying f to each element in this chunk.

Maps the supplied stateful function over each element, outputting the final state and the accumulated outputs. The first invocation of f uses init as the input state value. Each successive invocation uses the output state of the previous invocation.

Maps the supplied function over each element and returns a chunk of just the defined results.

False if size is zero, true otherwise.

Creates an iterator that iterates the elements of this chunk in reverse order. The returned iterator is not thread safe.

Like foldLeft but emits each intermediate result of f.

Like scanLeft except the final element is emitted as a standalone value instead of as the last element of the accumulated chunk.

Equivalent to val b = a.scanLeft(z)(f); val (c, carry) = b.splitAt(b.size - 1).

Splits this chunk in to two chunks at the specified index.

Check to see if this starts with the items in the given seq.

Check to see if this starts with the items in the given chunk.

Takes the right-most n elements of this chunk queue in a way that preserves chunk structure.

Converts this chunk to a new collection using the supplied collector.

Converts this chunk to a Chunk.ArraySlice.

Converts this chunk to a scodec-bits BitVector.

Converts this chunk to a java.nio.ByteBuffer.

Converts this chunk to a scodec-bits ByteVector.

Converts this chunk to a chain.

Converts this chunk to a java.nio.CharBuffer.

Returns a chunk with guaranteed O(1) lookup by index.

Unlike compact, this operation does not copy any elements unless this chunk does not provide O(1) lookup by index -- e.g., a chunk built via 1 or more usages of ++.

Converts this chunk to a list.

Converts this chunk to a NonEmptyList

Returns a string representation of the object.

The default representation is platform dependent.

Converts this chunk to a vector.

Zips this chunk the the supplied chunk, returning a chunk of tuples.

Zips this chunk with the supplied chunk, passing each pair to f, resulting in an output chunk.

Zips the elements of the input chunk with its indices, and returns the new chunk.

Like compact but does not require a ClassTag. Elements are boxed and stored in an Array[Any].

Returns the number of elements in this chunk.