strawman.collections.CollectionStrawMan6
LazyList
Related Docs:
object LazyList
| package CollectionStrawMan6
strawman.collections.CollectionStrawMan6
Concatenation
Concatenation
apply is defined in terms of drop, which is in turn defined in
terms of tail.
The class name of this collection.
The class name of this collection. To be used for converting to string. Collections generally print like this:
<className>(elem_1, ..., elem_n)
The collection itself
The collection itself
Copy all elements of this collection to array xs, starting at start.
Copy all elements of this collection to array xs, starting at start.
Optimized version of drop that avoids copying
Note: drop is defined here, rather than in a trait like LinearSeqMonoTransforms,
because the ...MonoTransforms traits make no assumption about the type of Repr
whereas we need to assume here that Repr is the same as the underlying
collection type.
Optimized version of drop that avoids copying
Note: drop is defined here, rather than in a trait like LinearSeqMonoTransforms,
because the ...MonoTransforms traits make no assumption about the type of Repr
whereas we need to assume here that Repr is the same as the underlying
collection type.
All elements satisfying predicate p
All elements satisfying predicate p
Flatmap
Flatmap
Fold left
Fold left
Fold right
Fold right
Apply f to each element for tis side effects
Apply f to each element for tis side effects
Create a collection of type C[A] from the elements of coll, which has
the same element type as this collection.
Create a collection of type C[A] from the elements of coll, which has
the same element type as this collection. Overridden in StringOps and ArrayOps.
The first element of the collection.
The first element of the collection.
The index of the first element in this collection for which p holds.
The index of the first element in this collection for which p holds.
To be overridden in implementations:
To be overridden in implementations:
iterator is overridden in terms of head and tail
iterator is overridden in terms of head and tail
The number of elements in this collection, if it can be cheaply computed, -1 otherwise.
The number of elements in this collection, if it can be cheaply computed, -1 otherwise. Cheaply usually means: Not requiring a collection traversal.
length is defined in terms of iterator
Map
Map
A string showing all elements of this collection, separated by string sep.
A string showing all elements of this collection, separated by string sep.
A pair of, first, all elements that satisfy prediacte p and, second,
all elements that do not.
A pair of, first, all elements that satisfy prediacte p and, second,
all elements that do not. Interesting because it splits a collection in two.
The default implementation provided here needs to traverse the collection twice.
Strict collections have an overridden version of partition in Buildable,
which requires only a single traversal.
The number of elements in this collection.
The number of elements in this collection. Does not terminate for infinite collections.
The rest of the collection without its first element.
The rest of the collection without its first element.
A collection containing the first n elements of this collection.
A collection containing the first n elements of this collection.
Given a collection factory fi for collections of type constructor C,
convert this collection to one of type C[A].
Given a collection factory fi for collections of type constructor C,
convert this collection to one of type C[A]. Example uses:
xs.to(List) xs.to(ArrayBuffer)
Convert collection to array.
Convert collection to array.
A view representing the elements of this collection.
A view representing the elements of this collection.
Zip.
Zip. Interesting because it requires to align to source collections.