LinearSeq

Type Members

type Coll = LinearSeq[_]

The underlying collection type with unknown element type
The underlying collection type with unknown element type

Attributes
protected[this]
Definition Classes
GenericCompanion
class GenericCanBuildFrom[A] extends CanBuildFrom[CC[_], A, CC[A]]

A generic implementation of the CanBuildFrom trait, which forwards all calls to apply(from) to the genericBuilder method of collection from, and which forwards all calls of apply() to the newBuilder method of this factory.
A generic implementation of the CanBuildFrom trait, which forwards all calls to apply(from) to the genericBuilder method of collection from, and which forwards all calls of apply() to the newBuilder method of this factory.

Definition Classes
GenTraversableFactory

Value Members

final def !=(arg0: Any): Boolean

Test two objects for inequality.
Test two objects for inequality.
returns
true if !(this == that), false otherwise.

Definition Classes
AnyRef → Any
final def ##(): Int

Equivalent to x.hashCode except for boxed numeric types and null.
Equivalent to x.hashCode except for boxed numeric types and null. For numerics, it returns a hash value which is consistent with value equality: if two value type instances compare as true, then ## will produce the same hash value for each of them. For null returns a hashcode where null.hashCode throws a NullPointerException.
returns
a hash value consistent with ==

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

The expression x == that is equivalent to if (x eq null) that eq null else x.equals(that).
The expression x == that is equivalent to if (x eq null) that eq null else x.equals(that).
returns
true if the receiver object is equivalent to the argument; false otherwise.

Definition Classes
AnyRef → Any
def ReusableCBF: GenericCanBuildFrom[Nothing]

Definition Classes
GenTraversableFactory
def apply[A](elems: A*): LinearSeq[A]

Creates a collection with the specified elements.
Creates a collection with the specified elements.
A
the type of the collection's elements
elems
the elements of the created collection
returns
a new collection with elements elems

Definition Classes
GenericCompanion
final def asInstanceOf[T0]: T0

Cast the receiver object to be of type T0.
Cast the receiver object to be of type T0.
Note that the success of a cast at runtime is modulo Scala's erasure semantics. Therefore the expression 1.asInstanceOf[String] will throw a ClassCastException at runtime, while the expression List(1).asInstanceOf[List[String]] will not. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested type.
returns
the receiver object.

Definition Classes
Any
Exceptions thrown
ClassCastException if the receiver object is not an instance of the erasure of type T0.
implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, LinearSeq[A]]
def clone(): AnyRef

Create a copy of the receiver object.
Create a copy of the receiver object.
The default implementation of the clone method is platform dependent.
returns
a copy of the receiver object.

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
Note
not specified by SLS as a member of AnyRef
def concat[A](xss: collection.Traversable[A]*): LinearSeq[A]

Concatenates all argument collections into a single collection.
Concatenates all argument collections into a single collection.
xss
the collections that are to be concatenated.
returns
the concatenation of all the collections.

Definition Classes
GenTraversableFactory
def empty[A]: LinearSeq[A]

An empty collection of type CC[A]
An empty collection of type CC[A]
A
the type of the collection's elements

Definition Classes
GenericCompanion
final def eq(arg0: AnyRef): Boolean

Tests whether the argument (that) is a reference to the receiver object (this).
Tests whether the argument (that) is a reference to the receiver object (this).
The eq method implements an equivalence relation on non-null instances of AnyRef, and has three additional properties:
- It is consistent: for any non-null instances x and y of type AnyRef, multiple invocations of x.eq(y) consistently returns true or consistently returns false.
- For any non-null instance x of type AnyRef, x.eq(null) and null.eq(x) returns false.
- null.eq(null) returns true.
When overriding the equals or hashCode methods, it is important to ensure that their behavior is consistent with reference equality. Therefore, if two objects are references to each other (o1 eq o2), they should be equal to each other (o1 == o2) and they should hash to the same value (o1.hashCode == o2.hashCode).
returns
true if the argument is a reference to the receiver object; false otherwise.

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

The equality method for reference types.
The equality method for reference types. Default implementation delegates to eq.
See also equals in scala.Any.
returns
true if the receiver object is equivalent to the argument; false otherwise.

Definition Classes
AnyRef → Any
def fill[A](n1: Int, n2: Int, n3: Int, n4: Int, n5: Int)(elem: ⇒ A): LinearSeq[LinearSeq[LinearSeq[LinearSeq[LinearSeq[A]]]]]

Produces a five-dimensional collection containing the results of some element computation a number of times.
Produces a five-dimensional collection 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 3nd 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 collection that contains the results of n1 x n2 x n3 x n4 x n5 evaluations of elem.

Definition Classes
GenTraversableFactory
def fill[A](n1: Int, n2: Int, n3: Int, n4: Int)(elem: ⇒ A): LinearSeq[LinearSeq[LinearSeq[LinearSeq[A]]]]

Produces a four-dimensional collection containing the results of some element computation a number of times.
Produces a four-dimensional collection 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 3nd dimension
n4
the number of elements in the 4th dimension
elem
the element computation
returns
A collection that contains the results of n1 x n2 x n3 x n4 evaluations of elem.

Definition Classes
GenTraversableFactory
def fill[A](n1: Int, n2: Int, n3: Int)(elem: ⇒ A): LinearSeq[LinearSeq[LinearSeq[A]]]

Produces a three-dimensional collection containing the results of some element computation a number of times.
Produces a three-dimensional collection 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 3nd dimension
elem
the element computation
returns
A collection that contains the results of n1 x n2 x n3 evaluations of elem.

Definition Classes
GenTraversableFactory
def fill[A](n1: Int, n2: Int)(elem: ⇒ A): LinearSeq[LinearSeq[A]]

Produces a two-dimensional collection containing the results of some element computation a number of times.
Produces a two-dimensional collection 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 collection that contains the results of n1 x n2 evaluations of elem.

Definition Classes
GenTraversableFactory
def fill[A](n: Int)(elem: ⇒ A): LinearSeq[A]

Produces a collection containing the results of some element computation a number of times.
Produces a collection containing the results of some element computation a number of times.
n
the number of elements contained in the collection.
elem
the element computation
returns
A collection that contains the results of n evaluations of elem.

Definition Classes
GenTraversableFactory
def finalize(): Unit

Called by the garbage collector on the receiver object when there are no more references to the object.
Called by the garbage collector on the receiver object when there are no more references to the object.
The details of when and if the finalize method is invoked, as well as the interaction between finalize and non-local returns and exceptions, are all platform dependent.

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
Note
not specified by SLS as a member of AnyRef
final def getClass(): Class[_]

A representation that corresponds to the dynamic class of the receiver object.
A representation that corresponds to the dynamic class of the receiver object.
The nature of the representation is platform dependent.
returns
a representation that corresponds to the dynamic class of the receiver object.

Definition Classes
AnyRef → Any
Note
not specified by SLS as a member of AnyRef
def hashCode(): Int

The hashCode method for reference types.
The hashCode method for reference types. See hashCode in scala.Any.
returns
the hash code value for this object.

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Test whether the dynamic type of the receiver object is T0.
Test whether the dynamic type of the receiver object is T0.
Note that the result of the test is modulo Scala's erasure semantics. Therefore the expression 1.isInstanceOf[String] will return false, while the expression List(1).isInstanceOf[List[String]] will return true. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the specified type.
returns
true if the receiver object is an instance of erasure of type T0; false otherwise.

Definition Classes
Any
def iterate[A](start: A, len: Int)(f: (A) ⇒ A): LinearSeq[A]

Produces a collection containing repeated applications of a function to a start value.
Produces a collection containing repeated applications of a function to a start value.
start
the start value of the collection
len
the number of elements contained inthe collection
f
the function that's repeatedly applied
returns
a collection with len values in the sequence start, f(start), f(f(start)), ...

Definition Classes
GenTraversableFactory
final def ne(arg0: AnyRef): Boolean

Equivalent to !(this eq that).
Equivalent to !(this eq that).
returns
true if the argument is not a reference to the receiver object; false otherwise.

Definition Classes
AnyRef
def newBuilder[A]: Builder[A, LinearSeq[A]]

The default builder for immutable.LinearSeq objects.
The default builder for immutable.LinearSeq objects.
A
the type of the immutable linear sequence's elements

Definition Classes
LinearSeq → GenericCompanion
final def notify(): Unit

Wakes up a single thread that is waiting on the receiver object's monitor.
Wakes up a single thread that is waiting on the receiver object's monitor.

Definition Classes
AnyRef
Note
not specified by SLS as a member of AnyRef
final def notifyAll(): Unit

Wakes up all threads that are waiting on the receiver object's monitor.
Wakes up all threads that are waiting on the receiver object's monitor.

Definition Classes
AnyRef
Note
not specified by SLS as a member of AnyRef
def range[T](start: T, end: T, step: T)(implicit arg0: Integral[T]): LinearSeq[T]

Produces a collection containing equally spaced values in some integer interval.
Produces a collection containing equally spaced values in some integer interval.
start
the start value of the collection
end
the end value of the collection (the first value NOT contained)
step
the difference between successive elements of the collection (must be positive or negative)
returns
a collection with values start, start + step, ... up to, but excluding end

Definition Classes
GenTraversableFactory
def range[T](start: T, end: T)(implicit arg0: Integral[T]): LinearSeq[T]

Produces a collection containing a sequence of increasing of integers.
Produces a collection containing a sequence of increasing of integers.
start
the first element of the collection
end
the end value of the collection (the first value NOT contained)
returns
a collection with values start, start + 1, ..., end - 1

Definition Classes
GenTraversableFactory
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def tabulate[A](n1: Int, n2: Int, n3: Int, n4: Int, n5: Int)(f: (Int, Int, Int, Int, Int) ⇒ A): LinearSeq[LinearSeq[LinearSeq[LinearSeq[LinearSeq[A]]]]]

Produces a five-dimensional collection containing values of a given function over ranges of integer values starting from 0.
Produces a five-dimensional collection 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 3nd 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 collection 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
GenTraversableFactory
def tabulate[A](n1: Int, n2: Int, n3: Int, n4: Int)(f: (Int, Int, Int, Int) ⇒ A): LinearSeq[LinearSeq[LinearSeq[LinearSeq[A]]]]

Produces a four-dimensional collection containing values of a given function over ranges of integer values starting from 0.
Produces a four-dimensional collection 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 3nd dimension
n4
the number of elements in the 4th dimension
f
The function computing element values
returns
A collection consisting of elements f(i1, i2, i3, i4) for 0 <= i1 < n1, 0 <= i2 < n2, 0 <= i3 < n3, and 0 <= i4 < n4.

Definition Classes
GenTraversableFactory
def tabulate[A](n1: Int, n2: Int, n3: Int)(f: (Int, Int, Int) ⇒ A): LinearSeq[LinearSeq[LinearSeq[A]]]

Produces a three-dimensional collection containing values of a given function over ranges of integer values starting from 0.
Produces a three-dimensional collection 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 3nd dimension
f
The function computing element values
returns
A collection consisting of elements f(i1, i2, i3) for 0 <= i1 < n1, 0 <= i2 < n2, and 0 <= i3 < n3.

Definition Classes
GenTraversableFactory
def tabulate[A](n1: Int, n2: Int)(f: (Int, Int) ⇒ A): LinearSeq[LinearSeq[A]]

Produces a two-dimensional collection containing values of a given function over ranges of integer values starting from 0.
Produces a two-dimensional collection 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 collection consisting of elements f(i1, i2) for 0 <= i1 < n1 and 0 <= i2 < n2.

Definition Classes
GenTraversableFactory
def tabulate[A](n: Int)(f: (Int) ⇒ A): LinearSeq[A]

Produces a collection containing values of a given function over a range of integer values starting from 0.
Produces a collection containing values of a given function over a range of integer values starting from 0.
n
The number of elements in the collection
f
The function computing element values
returns
A collection consisting of elements f(0), ..., f(n -1)

Definition Classes
GenTraversableFactory
def toString(): String

Creates a String representation of this object.
Creates a String representation of this object. The default representation is platform dependent. On the java platform it is the concatenation of the class name, "@", and the object's hashcode in hexadecimal.
returns
a String representation of the object.

Definition Classes
AnyRef → Any
def unapplySeq[A](x: LinearSeq[A]): Some[LinearSeq[A]]

This method is called in a pattern match { case Seq(...) => }.
This method is called in a pattern match { case Seq(...) => }.
x
the selector value
returns
sequence wrapped in an option, if this is a Seq, otherwise none

Definition Classes
SeqFactory
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
@throws( ... )

Ungrouped

type Coll = LinearSeq[_]

The underlying collection type with unknown element type
The underlying collection type with unknown element type

Attributes
protected[this]
Definition Classes
GenericCompanion
class GenericCanBuildFrom[A] extends CanBuildFrom[CC[_], A, CC[A]]

A generic implementation of the CanBuildFrom trait, which forwards all calls to apply(from) to the genericBuilder method of collection from, and which forwards all calls of apply() to the newBuilder method of this factory.
A generic implementation of the CanBuildFrom trait, which forwards all calls to apply(from) to the genericBuilder method of collection from, and which forwards all calls of apply() to the newBuilder method of this factory.

Definition Classes
GenTraversableFactory

final def !=(arg0: Any): Boolean

Test two objects for inequality.
Test two objects for inequality.
returns
true if !(this == that), false otherwise.

Definition Classes
AnyRef → Any
final def ##(): Int

Equivalent to x.hashCode except for boxed numeric types and null.
Equivalent to x.hashCode except for boxed numeric types and null. For numerics, it returns a hash value which is consistent with value equality: if two value type instances compare as true, then ## will produce the same hash value for each of them. For null returns a hashcode where null.hashCode throws a NullPointerException.
returns
a hash value consistent with ==

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

The expression x == that is equivalent to if (x eq null) that eq null else x.equals(that).
The expression x == that is equivalent to if (x eq null) that eq null else x.equals(that).
returns
true if the receiver object is equivalent to the argument; false otherwise.

Definition Classes
AnyRef → Any
def ReusableCBF: GenericCanBuildFrom[Nothing]

Definition Classes
GenTraversableFactory
def apply[A](elems: A*): LinearSeq[A]

Creates a collection with the specified elements.
Creates a collection with the specified elements.
A
the type of the collection's elements
elems
the elements of the created collection
returns
a new collection with elements elems

Definition Classes
GenericCompanion
final def asInstanceOf[T0]: T0

Cast the receiver object to be of type T0.
Cast the receiver object to be of type T0.
Note that the success of a cast at runtime is modulo Scala's erasure semantics. Therefore the expression 1.asInstanceOf[String] will throw a ClassCastException at runtime, while the expression List(1).asInstanceOf[List[String]] will not. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested type.
returns
the receiver object.

Definition Classes
Any
Exceptions thrown
ClassCastException if the receiver object is not an instance of the erasure of type T0.
implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, LinearSeq[A]]
def clone(): AnyRef

Create a copy of the receiver object.
Create a copy of the receiver object.
The default implementation of the clone method is platform dependent.
returns
a copy of the receiver object.

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
Note
not specified by SLS as a member of AnyRef
def concat[A](xss: collection.Traversable[A]*): LinearSeq[A]

Concatenates all argument collections into a single collection.
Concatenates all argument collections into a single collection.
xss
the collections that are to be concatenated.
returns
the concatenation of all the collections.

Definition Classes
GenTraversableFactory
def empty[A]: LinearSeq[A]

An empty collection of type CC[A]
An empty collection of type CC[A]
A
the type of the collection's elements

Definition Classes
GenericCompanion
final def eq(arg0: AnyRef): Boolean

Tests whether the argument (that) is a reference to the receiver object (this).
Tests whether the argument (that) is a reference to the receiver object (this).
The eq method implements an equivalence relation on non-null instances of AnyRef, and has three additional properties:
- It is consistent: for any non-null instances x and y of type AnyRef, multiple invocations of x.eq(y) consistently returns true or consistently returns false.
- For any non-null instance x of type AnyRef, x.eq(null) and null.eq(x) returns false.
- null.eq(null) returns true.
When overriding the equals or hashCode methods, it is important to ensure that their behavior is consistent with reference equality. Therefore, if two objects are references to each other (o1 eq o2), they should be equal to each other (o1 == o2) and they should hash to the same value (o1.hashCode == o2.hashCode).
returns
true if the argument is a reference to the receiver object; false otherwise.

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

The equality method for reference types.
The equality method for reference types. Default implementation delegates to eq.
See also equals in scala.Any.
returns
true if the receiver object is equivalent to the argument; false otherwise.

Definition Classes
AnyRef → Any
def fill[A](n1: Int, n2: Int, n3: Int, n4: Int, n5: Int)(elem: ⇒ A): LinearSeq[LinearSeq[LinearSeq[LinearSeq[LinearSeq[A]]]]]

Produces a five-dimensional collection containing the results of some element computation a number of times.
Produces a five-dimensional collection 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 3nd 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 collection that contains the results of n1 x n2 x n3 x n4 x n5 evaluations of elem.

Definition Classes
GenTraversableFactory
def fill[A](n1: Int, n2: Int, n3: Int, n4: Int)(elem: ⇒ A): LinearSeq[LinearSeq[LinearSeq[LinearSeq[A]]]]

Produces a four-dimensional collection containing the results of some element computation a number of times.
Produces a four-dimensional collection 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 3nd dimension
n4
the number of elements in the 4th dimension
elem
the element computation
returns
A collection that contains the results of n1 x n2 x n3 x n4 evaluations of elem.

Definition Classes
GenTraversableFactory
def fill[A](n1: Int, n2: Int, n3: Int)(elem: ⇒ A): LinearSeq[LinearSeq[LinearSeq[A]]]

Produces a three-dimensional collection containing the results of some element computation a number of times.
Produces a three-dimensional collection 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 3nd dimension
elem
the element computation
returns
A collection that contains the results of n1 x n2 x n3 evaluations of elem.

Definition Classes
GenTraversableFactory
def fill[A](n1: Int, n2: Int)(elem: ⇒ A): LinearSeq[LinearSeq[A]]

Produces a two-dimensional collection containing the results of some element computation a number of times.
Produces a two-dimensional collection 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 collection that contains the results of n1 x n2 evaluations of elem.

Definition Classes
GenTraversableFactory
def fill[A](n: Int)(elem: ⇒ A): LinearSeq[A]

Produces a collection containing the results of some element computation a number of times.
Produces a collection containing the results of some element computation a number of times.
n
the number of elements contained in the collection.
elem
the element computation
returns
A collection that contains the results of n evaluations of elem.

Definition Classes
GenTraversableFactory
def finalize(): Unit

Called by the garbage collector on the receiver object when there are no more references to the object.
Called by the garbage collector on the receiver object when there are no more references to the object.
The details of when and if the finalize method is invoked, as well as the interaction between finalize and non-local returns and exceptions, are all platform dependent.

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
Note
not specified by SLS as a member of AnyRef
final def getClass(): Class[_]

A representation that corresponds to the dynamic class of the receiver object.
A representation that corresponds to the dynamic class of the receiver object.
The nature of the representation is platform dependent.
returns
a representation that corresponds to the dynamic class of the receiver object.

Definition Classes
AnyRef → Any
Note
not specified by SLS as a member of AnyRef
def hashCode(): Int

The hashCode method for reference types.
The hashCode method for reference types. See hashCode in scala.Any.
returns
the hash code value for this object.

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Test whether the dynamic type of the receiver object is T0.
Test whether the dynamic type of the receiver object is T0.
Note that the result of the test is modulo Scala's erasure semantics. Therefore the expression 1.isInstanceOf[String] will return false, while the expression List(1).isInstanceOf[List[String]] will return true. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the specified type.
returns
true if the receiver object is an instance of erasure of type T0; false otherwise.

Definition Classes
Any
def iterate[A](start: A, len: Int)(f: (A) ⇒ A): LinearSeq[A]

Produces a collection containing repeated applications of a function to a start value.
Produces a collection containing repeated applications of a function to a start value.
start
the start value of the collection
len
the number of elements contained inthe collection
f
the function that's repeatedly applied
returns
a collection with len values in the sequence start, f(start), f(f(start)), ...

Definition Classes
GenTraversableFactory
final def ne(arg0: AnyRef): Boolean

Equivalent to !(this eq that).
Equivalent to !(this eq that).
returns
true if the argument is not a reference to the receiver object; false otherwise.

Definition Classes
AnyRef
def newBuilder[A]: Builder[A, LinearSeq[A]]

The default builder for immutable.LinearSeq objects.
The default builder for immutable.LinearSeq objects.
A
the type of the immutable linear sequence's elements

Definition Classes
LinearSeq → GenericCompanion
final def notify(): Unit

Wakes up a single thread that is waiting on the receiver object's monitor.
Wakes up a single thread that is waiting on the receiver object's monitor.

Definition Classes
AnyRef
Note
not specified by SLS as a member of AnyRef
final def notifyAll(): Unit

Wakes up all threads that are waiting on the receiver object's monitor.
Wakes up all threads that are waiting on the receiver object's monitor.

Definition Classes
AnyRef
Note
not specified by SLS as a member of AnyRef
def range[T](start: T, end: T, step: T)(implicit arg0: Integral[T]): LinearSeq[T]

Produces a collection containing equally spaced values in some integer interval.
Produces a collection containing equally spaced values in some integer interval.
start
the start value of the collection
end
the end value of the collection (the first value NOT contained)
step
the difference between successive elements of the collection (must be positive or negative)
returns
a collection with values start, start + step, ... up to, but excluding end

Definition Classes
GenTraversableFactory
def range[T](start: T, end: T)(implicit arg0: Integral[T]): LinearSeq[T]

Produces a collection containing a sequence of increasing of integers.
Produces a collection containing a sequence of increasing of integers.
start
the first element of the collection
end
the end value of the collection (the first value NOT contained)
returns
a collection with values start, start + 1, ..., end - 1

Definition Classes
GenTraversableFactory
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def tabulate[A](n1: Int, n2: Int, n3: Int, n4: Int, n5: Int)(f: (Int, Int, Int, Int, Int) ⇒ A): LinearSeq[LinearSeq[LinearSeq[LinearSeq[LinearSeq[A]]]]]

Produces a five-dimensional collection containing values of a given function over ranges of integer values starting from 0.
Produces a five-dimensional collection 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 3nd 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 collection 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
GenTraversableFactory
def tabulate[A](n1: Int, n2: Int, n3: Int, n4: Int)(f: (Int, Int, Int, Int) ⇒ A): LinearSeq[LinearSeq[LinearSeq[LinearSeq[A]]]]

Produces a four-dimensional collection containing values of a given function over ranges of integer values starting from 0.
Produces a four-dimensional collection 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 3nd dimension
n4
the number of elements in the 4th dimension
f
The function computing element values
returns
A collection consisting of elements f(i1, i2, i3, i4) for 0 <= i1 < n1, 0 <= i2 < n2, 0 <= i3 < n3, and 0 <= i4 < n4.

Definition Classes
GenTraversableFactory
def tabulate[A](n1: Int, n2: Int, n3: Int)(f: (Int, Int, Int) ⇒ A): LinearSeq[LinearSeq[LinearSeq[A]]]

Produces a three-dimensional collection containing values of a given function over ranges of integer values starting from 0.
Produces a three-dimensional collection 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 3nd dimension
f
The function computing element values
returns
A collection consisting of elements f(i1, i2, i3) for 0 <= i1 < n1, 0 <= i2 < n2, and 0 <= i3 < n3.

Definition Classes
GenTraversableFactory
def tabulate[A](n1: Int, n2: Int)(f: (Int, Int) ⇒ A): LinearSeq[LinearSeq[A]]

Produces a two-dimensional collection containing values of a given function over ranges of integer values starting from 0.
Produces a two-dimensional collection 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 collection consisting of elements f(i1, i2) for 0 <= i1 < n1 and 0 <= i2 < n2.

Definition Classes
GenTraversableFactory
def tabulate[A](n: Int)(f: (Int) ⇒ A): LinearSeq[A]

Produces a collection containing values of a given function over a range of integer values starting from 0.
Produces a collection containing values of a given function over a range of integer values starting from 0.
n
The number of elements in the collection
f
The function computing element values
returns
A collection consisting of elements f(0), ..., f(n -1)

Definition Classes
GenTraversableFactory
def toString(): String

Creates a String representation of this object.
Creates a String representation of this object. The default representation is platform dependent. On the java platform it is the concatenation of the class name, "@", and the object's hashcode in hexadecimal.
returns
a String representation of the object.

Definition Classes
AnyRef → Any
def unapplySeq[A](x: LinearSeq[A]): Some[LinearSeq[A]]

This method is called in a pattern match { case Seq(...) => }.
This method is called in a pattern match { case Seq(...) => }.
x
the selector value
returns
sequence wrapped in an option, if this is a Seq, otherwise none

Definition Classes
SeqFactory
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
@throws( ... )

Related Docs: trait LinearSeq | package immutable

object LinearSeq extends SeqFactory[LinearSeq]

Type Members

type Coll = LinearSeq[_]

class GenericCanBuildFrom[A] extends CanBuildFrom[CC[_], A, CC[A]]

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def ReusableCBF: GenericCanBuildFrom[Nothing]

def apply[A](elems: A*): LinearSeq[A]

final def asInstanceOf[T0]: T0

implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, LinearSeq[A]]

def clone(): AnyRef

def concat[A](xss: collection.Traversable[A]*): LinearSeq[A]

def empty[A]: LinearSeq[A]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def fill[A](n1: Int, n2: Int, n3: Int, n4: Int, n5: Int)(elem: ⇒ A): LinearSeq[LinearSeq[LinearSeq[LinearSeq[LinearSeq[A]]]]]

def fill[A](n1: Int, n2: Int, n3: Int, n4: Int)(elem: ⇒ A): LinearSeq[LinearSeq[LinearSeq[LinearSeq[A]]]]

def fill[A](n1: Int, n2: Int, n3: Int)(elem: ⇒ A): LinearSeq[LinearSeq[LinearSeq[A]]]

def fill[A](n1: Int, n2: Int)(elem: ⇒ A): LinearSeq[LinearSeq[A]]

def fill[A](n: Int)(elem: ⇒ A): LinearSeq[A]

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def iterate[A](start: A, len: Int)(f: (A) ⇒ A): LinearSeq[A]

final def ne(arg0: AnyRef): Boolean

def newBuilder[A]: Builder[A, LinearSeq[A]]

final def notify(): Unit

final def notifyAll(): Unit

def range[T](start: T, end: T, step: T)(implicit arg0: Integral[T]): LinearSeq[T]

def range[T](start: T, end: T)(implicit arg0: Integral[T]): LinearSeq[T]

final def synchronized[T0](arg0: ⇒ T0): T0

def tabulate[A](n1: Int, n2: Int, n3: Int, n4: Int, n5: Int)(f: (Int, Int, Int, Int, Int) ⇒ A): LinearSeq[LinearSeq[LinearSeq[LinearSeq[LinearSeq[A]]]]]

def tabulate[A](n1: Int, n2: Int, n3: Int, n4: Int)(f: (Int, Int, Int, Int) ⇒ A): LinearSeq[LinearSeq[LinearSeq[LinearSeq[A]]]]

def tabulate[A](n1: Int, n2: Int, n3: Int)(f: (Int, Int, Int) ⇒ A): LinearSeq[LinearSeq[LinearSeq[A]]]

def tabulate[A](n1: Int, n2: Int)(f: (Int, Int) ⇒ A): LinearSeq[LinearSeq[A]]

def tabulate[A](n: Int)(f: (Int) ⇒ A): LinearSeq[A]

def toString(): String

def unapplySeq[A](x: LinearSeq[A]): Some[LinearSeq[A]]

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

Inherited from SeqFactory[LinearSeq]

Inherited from TraversableFactory[LinearSeq]

Inherited from GenericSeqCompanion[LinearSeq]

Inherited from GenSeqFactory[LinearSeq]

Inherited from GenTraversableFactory[LinearSeq]

Inherited from GenericCompanion[LinearSeq]

Inherited from AnyRef

Inherited from Any

Ungrouped

type Coll = LinearSeq[_]

class GenericCanBuildFrom[A] extends CanBuildFrom[CC[_], A, CC[A]]

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def ReusableCBF: GenericCanBuildFrom[Nothing]

def apply[A](elems: A*): LinearSeq[A]

final def asInstanceOf[T0]: T0

implicit def canBuildFrom[A]: CanBuildFrom[Coll, A, LinearSeq[A]]

def clone(): AnyRef

def concat[A](xss: collection.Traversable[A]*): LinearSeq[A]

def empty[A]: LinearSeq[A]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def fill[A](n1: Int, n2: Int, n3: Int, n4: Int, n5: Int)(elem: ⇒ A): LinearSeq[LinearSeq[LinearSeq[LinearSeq[LinearSeq[A]]]]]

def fill[A](n1: Int, n2: Int, n3: Int, n4: Int)(elem: ⇒ A): LinearSeq[LinearSeq[LinearSeq[LinearSeq[A]]]]

def fill[A](n1: Int, n2: Int, n3: Int)(elem: ⇒ A): LinearSeq[LinearSeq[LinearSeq[A]]]

def fill[A](n1: Int, n2: Int)(elem: ⇒ A): LinearSeq[LinearSeq[A]]

def fill[A](n: Int)(elem: ⇒ A): LinearSeq[A]

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def iterate[A](start: A, len: Int)(f: (A) ⇒ A): LinearSeq[A]

final def ne(arg0: AnyRef): Boolean