Packages

  • package root
    Definition Classes
    root
  • package strawman
    Definition Classes
    root
  • package collection

    A strawman architecture for new collections.

    A strawman architecture for new collections. It contains some example collection classes and methods with the intent to expose some key issues. It would be good to compare this to odether implementations of the same functionality, to get an idea of the strengths and weaknesses of different collection architectures.

    For a test file, see tests/run/CollectionTests.scala.

    Strawman6 is like strawman5, and adds lazy lists (i.e. lazie streams), arrays and some utilitity methods (take, tail, mkString, toArray). Also, systematically uses builders for all strict collections.

    Types covered in this strawman:

    1. Collection base types:

    IterableOnce, Iterable, Seq, LinearSeq, View, IndexedView

    2. Collection creator base types:

    FromIterable, IterableFactory, Buildable, Builder

    3. Types that bundle operations:

    IterableOps, IterableMonoTransforms, IterablePolyTransforms, IterableLike SeqMonoTransforms, SeqLike

    4. Concrete collection types:

    List, LazyList, ListBuffer, ArrayBuffer, ArrayBufferView, StringView, ArrayView

    5. Decorators for existing types

    StringOps, ArrayOps

    6. Related non collection types:

    Iterator, StringBuilder

    Operations covered in this strawman:

    1. Abstract operations, or expected to be overridden:

    For iterables:

    iterator, fromIterable, fromIterableWithSameElemType, knownLength, className

    For sequences:

    apply, length

    For buildables:

    newBuilder

    For builders:

    +=, result

    2. Utility methods, might be overridden for performance:

    Operations returning not necessarily a collection:

    foreach, foldLeft, foldRight, indexWhere, isEmpty, head, size, mkString

    Operations returning a collection of a fixed type constructor:

    view, to, toArray, copyToArray

    Type-preserving generic transforms:

    filter, partition, take, drop, tail, reverse

    Generic transforms returning collections of different element types:

    map, flatMap, ++, zip

    Definition Classes
    strawman
  • package immutable
    Definition Classes
    collection
  • ::
  • BitSet
  • HashSet
  • Iterable
  • LazyList
  • List
  • Map
  • MapLike
  • MapMonoTransforms
  • Nil
  • Seq
  • Set
  • SetLike
  • SetMonoTransforms
  • SortedMap
  • SortedMapFactories
  • SortedMapLike
  • SortedMapPolyTransforms
  • SortedSet
  • SortedSetLike
  • TreeMap
  • TreeSet

class LazyList[+A] extends Seq[A] with SeqLike[A, LazyList] with LinearSeq[A]

Linear Supertypes
LinearSeq[A], LinearSeqLike[A, LinearSeq], Seq[A], Iterable[A], collection.Seq[A], ArrayLike[A], SeqLike[A, LazyList], Equals, SeqMonoTransforms[A, LazyList[A @scala.annotation.unchecked.uncheckedVariance]], collection.Iterable[A], IterableLike[A, LazyList], IterablePolyTransforms[A, LazyList], IterableMonoTransforms[A, LazyList[A @scala.annotation.unchecked.uncheckedVariance]], IterableOps[A], FromIterable[LazyList], IterableOnce[A], AnyRef, Any
Known Subclasses
Empty
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. LazyList
  2. LinearSeq
  3. LinearSeqLike
  4. Seq
  5. Iterable
  6. Seq
  7. ArrayLike
  8. SeqLike
  9. Equals
  10. SeqMonoTransforms
  11. Iterable
  12. IterableLike
  13. IterablePolyTransforms
  14. IterableMonoTransforms
  15. IterableOps
  16. FromIterable
  17. IterableOnce
  18. AnyRef
  19. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new LazyList(expr: ⇒ Evaluated[A])

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def #::[B >: A](elem: ⇒ B): LazyList[B]
  4. def ++[B >: A](xs: IterableOnce[B]): LazyList[B]

    Concatenation

    Concatenation

    Definition Classes
    IterablePolyTransforms
  5. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  6. def apply(n: Int): A

    apply is defined in terms of drop, which is in turn defined in terms of tail.

    apply is defined in terms of drop, which is in turn defined in terms of tail.

    Definition Classes
    LinearSeq → ArrayLike
  7. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  8. def canEqual(that: Any): Boolean

    Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.

    Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.

    that

    The object with which this $coll should be compared

    returns

    true, if this $coll can possibly equal that, false otherwise. The test takes into consideration only the run-time types of objects but ignores their elements.

    Definition Classes
    SeqLike → Equals
  9. def className: String

    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)

    Definition Classes
    LazyList → IterableOps
  10. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  11. def coll: LazyList.this.type

    The collection itself

    The collection itself

    Attributes
    protected
    Definition Classes
    Iterable → IterablePolyTransforms → IterableMonoTransforms → IterableOps
  12. def copyToArray[B >: A](xs: Array[B], start: Int = 0): xs.type

    Copy all elements of this collection to array xs, starting at start.

    Copy all elements of this collection to array xs, starting at start.

    Definition Classes
    IterableOps
  13. def drop(n: Int): LinearSeq[A]

    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.

    Definition Classes
    LinearSeqLike → IterableMonoTransforms
  14. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  15. def equals(o: Any): Boolean
    Definition Classes
    SeqLike → Equals → AnyRef → Any
  16. def filter(p: (A) ⇒ Boolean): LazyList[A @scala.annotation.unchecked.uncheckedVariance]

    All elements satisfying predicate p

    All elements satisfying predicate p

    Definition Classes
    IterableMonoTransforms
  17. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  18. def flatMap[B](f: (A) ⇒ IterableOnce[B]): LazyList[B]

    Flatmap

    Flatmap

    Definition Classes
    IterablePolyTransforms
  19. def foldLeft[B](z: B)(op: (B, A) ⇒ B): B

    Fold left

    Fold left

    Definition Classes
    IterableOps
  20. def foldRight[B](z: B)(op: (A, B) ⇒ B): B

    Fold right

    Fold right

    Definition Classes
    IterableOps
  21. def force: Evaluated[A]
  22. def foreach[U](f: (A) ⇒ U): Unit

    Apply f to each element for its side effects Note: [U] parameter needed to help scalac's type inference.

    Apply f to each element for its side effects Note: [U] parameter needed to help scalac's type inference.

    Definition Classes
    IterableOps
  23. def fromIterable[B](c: collection.Iterable[B]): LazyList[B]
    Definition Classes
    LazyList → IterablePolyTransforms → FromIterable
  24. def fromIterableWithSameElemType(coll: collection.Iterable[A]): LazyList[A]

    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.

    Attributes
    protected[this]
    Definition Classes
    SeqLike → IterableLike → IterableMonoTransforms
  25. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  26. def hashCode(): Int
    Definition Classes
    SeqLike → AnyRef → Any
  27. def head: A

    The first element of the collection.

    The first element of the collection.

    Definition Classes
    LazyList → LinearSeq → IterableOps
  28. def indexWhere(p: (A) ⇒ Boolean): Int

    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.

    Definition Classes
    IterableOps
  29. def isEmpty: Boolean

    To be overridden in implementations:

    To be overridden in implementations:

    Definition Classes
    LazyList → LinearSeq → IterableOps
  30. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  31. def iterator(): Iterator[A]

    iterator is overridden in terms of head and tail

    iterator is overridden in terms of head and tail

    Definition Classes
    LinearSeq → IterableOnce
  32. def knownSize: Int

    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.

    Definition Classes
    IterableOps
  33. def length: Int

    length is defined in terms of iterator

    length is defined in terms of iterator

    Definition Classes
    LinearSeq → ArrayLike
  34. def map[B](f: (A) ⇒ B): LazyList[B]

    Map

    Map

    Definition Classes
    IterablePolyTransforms
  35. def mkString(sep: String): String

    A string showing all elements of this collection, separated by string sep.

    A string showing all elements of this collection, separated by string sep.

    Definition Classes
    IterableOps
  36. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  37. def nonEmpty: Boolean

    Is the collection not empty?

    Is the collection not empty?

    Definition Classes
    LazyList → IterableOps
  38. final def notify(): Unit
    Definition Classes
    AnyRef
  39. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  40. def partition(p: (A) ⇒ Boolean): (LazyList[A @scala.annotation.unchecked.uncheckedVariance], LazyList[A @scala.annotation.unchecked.uncheckedVariance])

    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.

    Definition Classes
    IterableMonoTransforms
  41. def reverse: LazyList[A @scala.annotation.unchecked.uncheckedVariance]
    Definition Classes
    SeqMonoTransforms
  42. def sameElements[B >: A](that: IterableOnce[B]): Boolean

    Do the elements of this collection are the same (and in the same order) as those of that?

    Do the elements of this collection are the same (and in the same order) as those of that?

    Definition Classes
    SeqLike
  43. def size: Int

    The number of elements in this collection.

    The number of elements in this collection. Does not terminate for infinite collections.

    Definition Classes
    IterableOps
  44. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  45. def tail: LazyList[A]

    The rest of the collection without its first element.

    The rest of the collection without its first element.

    Definition Classes
    LazyList → LinearSeq → IterableMonoTransforms
  46. def take(n: Int): LazyList[A @scala.annotation.unchecked.uncheckedVariance]

    A collection containing the first n elements of this collection.

    A collection containing the first n elements of this collection.

    Definition Classes
    IterableMonoTransforms
  47. def to[C[X] <: collection.Iterable[X]](fi: FromIterable[C]): C[A]

    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)

    Definition Classes
    IterableOps
  48. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]

    Convert collection to array.

    Convert collection to array.

    Definition Classes
    IterableOps
  49. def toString(): String
    Definition Classes
    LazyList → IterableOps → AnyRef → Any
  50. def view: View[A]

    A view representing the elements of this collection.

    A view representing the elements of this collection.

    Definition Classes
    IterableOps
  51. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  52. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  53. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  54. def zip[B](xs: IterableOnce[B]): LazyList[(A, B)]

    Zip.

    Zip. Interesting because it requires to align to source collections.

    Definition Classes
    IterablePolyTransforms

Inherited from LinearSeq[A]

Inherited from LinearSeqLike[A, LinearSeq]

Inherited from Seq[A]

Inherited from Iterable[A]

Inherited from collection.Seq[A]

Inherited from ArrayLike[A]

Inherited from SeqLike[A, LazyList]

Inherited from Equals

Inherited from SeqMonoTransforms[A, LazyList[A @scala.annotation.unchecked.uncheckedVariance]]

Inherited from collection.Iterable[A]

Inherited from IterableLike[A, LazyList]

Inherited from IterablePolyTransforms[A, LazyList]

Inherited from IterableMonoTransforms[A, LazyList[A @scala.annotation.unchecked.uncheckedVariance]]

Inherited from IterableOps[A]

Inherited from FromIterable[LazyList]

Inherited from IterableOnce[A]

Inherited from AnyRef

Inherited from Any

Ungrouped