trait PairColl[L, R] extends Coll[(L, R)]
Base trait for specialized (Structure-Of-Arrays) representation of collection of pairs
(i.e. Coll[(A, B)]).
Some instances of Coll[(A, B)] may be instances of this trait, but it is NOT guaranteed,
since some of them may be instances of CollOverArray[(A, B)].
- Alphabetic
- By Inheritance
- PairColl
- Coll
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Abstract Value Members
- abstract def append(other: Coll[(L, R)]): Coll[(L, R)]
Puts the elements of other collection after the elements of this collection (concatenation of 2 collections)
Puts the elements of other collection after the elements of this collection (concatenation of 2 collections)
- Definition Classes
- Coll
- abstract def apply(i: Int): (L, R)
The element at given index.
The element at given index. Indices start at
0;xs.apply(0)is the first element of collectionxs. Note the indexing syntaxxs(i)is a shorthand forxs.apply(i).- i
the index
- returns
the element at the given index
- Definition Classes
- Coll
- Exceptions thrown
ArrayIndexOutOfBoundsExceptionifi < 0orlength <= i
- abstract def builder: CollBuilder
- Definition Classes
- Coll
- abstract def exists(p: ((L, R)) => Boolean): Boolean
Tests whether a predicate holds for at least one element of this collection.
Tests whether a predicate holds for at least one element of this collection.
- p
the predicate used to test elements.
- returns
trueif the given predicatepis satisfied by at least one element of this collection, otherwisefalse
- Definition Classes
- Coll
- abstract def filter(p: ((L, R)) => Boolean): Coll[(L, R)]
Selects all elements of this collection which satisfy a predicate.
Selects all elements of this collection which satisfy a predicate.
- p
the predicate used to test elements.
- returns
a new collection consisting of all elements of this collection that satisfy the given predicate
p. The order of the elements is preserved.
- Definition Classes
- Coll
- Since
2.0
- abstract def flatMap[B](f: ((L, R)) => Coll[B])(implicit arg0: RType[B]): Coll[B]
Builds a new collection by applying a function to all elements of this collection and using the elements of the resulting collections.
Builds a new collection by applying a function to all elements of this collection and using the elements of the resulting collections.
Function
fis constrained to be of the formx => x.someProperty, otherwise it is illegal.- B
the element type of the returned collection.
- f
the function to apply to each element.
- returns
a new collection of type
Coll[B]resulting from applying the given collection-valued functionfto each element of this collection and concatenating the results.
- Definition Classes
- Coll
- Since
2.0
- abstract def foldLeft[B](zero: B, op: ((B, (L, R))) => B): B
Applies a binary operator to a start value and all elements of this collection, going left to right.
Applies a binary operator to a start value and all elements of this collection, going left to right.
- B
the result type of the binary operator.
- zero
the start value.
- op
the binary operator.
- returns
the result of inserting
opbetween consecutive elements of this collection, going left to right with the start valuezon the left:op(...op(z, x_1), x_2, ..., x_n)
where
x_1, ..., x_nare the elements of this collection. Returnszif this collection is empty.
- Definition Classes
- Coll
- abstract def forall(p: ((L, R)) => Boolean): Boolean
Tests whether a predicate holds for all elements of this collection.
Tests whether a predicate holds for all elements of this collection.
- p
the predicate used to test elements.
- returns
trueif this collection is empty or the given predicatepholds for all elements of this collection, otherwisefalse.
- Definition Classes
- Coll
- abstract def getOrElse(index: Int, default: (L, R)): (L, R)
The element of the collection or default value.
The element of the collection or default value. If an index is out of bounds (
i < 0 || i >= length) thendefaultvalue is returned.- returns
the element at the given index or default value if index is out or bounds
- Definition Classes
- Coll
- Since
2.0
- abstract def indexWhere(p: ((L, R)) => Boolean, from: Int): Int
Finds index of the first element satisfying some predicate after or at some start index.
Finds index of the first element satisfying some predicate after or at some start index.
- p
the predicate used to test elements.
- from
the start index
- returns
the index
>= fromof the first element of this collection that satisfies the predicatep, or-1, if none exists.
- Definition Classes
- Coll
- Since
2.0
- abstract def indices: Coll[Int]
Produces the range of all indices of this collection as a new collection containing [0 ..
Produces the range of all indices of this collection as a new collection containing [0 .. length-1] values.
- Definition Classes
- Coll
- Since
2.0
- abstract def isDefinedAt(idx: Int): Boolean
Tests whether this collection contains given index.
Tests whether this collection contains given index.
The implementations of methods
applyandisDefinedAtturn aColl[A]into aPartialFunction[Int, A].- idx
the index to test
- returns
trueif this collection contains an element at positionidx,falseotherwise.
- Definition Classes
- Coll
- abstract def isEmpty: Boolean
Tests whether the collection is empty.
Tests whether the collection is empty.
- returns
trueif the collection contains no elements,falseotherwise.
- Definition Classes
- Coll
- abstract def lastIndexWhere(p: ((L, R)) => Boolean, end: Int): Int
Finds index of last element satisfying some predicate before or at given end index.
Finds index of last element satisfying some predicate before or at given end index.
- p
the predicate used to test elements.
- returns
the index
<= endof the last element of this collection that satisfies the predicatep, or-1, if none exists.
- Definition Classes
- Coll
- Since
2.0
- abstract def length: Int
The length of the collection.
The length of the collection.
- Definition Classes
- Coll
- abstract def ls: Coll[L]
- abstract def map[B](f: ((L, R)) => B)(implicit arg0: RType[B]): Coll[B]
Builds a new collection by applying a function to all elements of this collection.
Builds a new collection by applying a function to all elements of this collection.
- B
the element type of the returned collection.
- f
the function to apply to each element.
- returns
a new collection of type
Coll[B]resulting from applying the given functionfto each element of this collection and collecting the results.
- Definition Classes
- Coll
- abstract def mapFirst[T1](f: (L) => T1)(implicit arg0: RType[T1]): Coll[(T1, R)]
- abstract def mapSecond[T1](f: (R) => T1)(implicit arg0: RType[T1]): Coll[(L, T1)]
- abstract def nonEmpty: Boolean
Tests whether the collection is not empty.
Tests whether the collection is not empty.
- returns
trueif the collection contains at least one element,falseotherwise.
- Definition Classes
- Coll
- abstract def patch(from: Int, patch: Coll[(L, R)], replaced: Int): Coll[(L, R)]
Produces a new collection where a slice of elements in this collection is replaced by another sequence.
Produces a new collection where a slice of elements in this collection is replaced by another sequence.
- from
the index of the first replaced element
- patch
the replacement sequence
- replaced
the number of elements to drop in the original collection
- returns
a new collection consisting of all elements of this collection except that
replacedelements starting fromfromare replaced bypatch.
- Definition Classes
- Coll
- Since
2.0
- abstract def reverse: Coll[(L, R)]
Returns new collection with elements in reversed order.
Returns new collection with elements in reversed order.
- returns
A new collection with all elements of this collection in reversed order.
- Definition Classes
- Coll
- abstract def rs: Coll[R]
- abstract def segmentLength(p: ((L, R)) => Boolean, from: Int): Int
Computes length of longest segment whose elements all satisfy some predicate.
Computes length of longest segment whose elements all satisfy some predicate.
- p
the predicate used to test elements.
- from
the index where the search starts.
- returns
the length of the longest segment of this collection starting from index
fromsuch that every element of the segment satisfies the predicatep.
- Definition Classes
- Coll
- Since
2.0
- abstract def slice(from: Int, until: Int): Coll[(L, R)]
Selects an interval of elements.
Selects an interval of elements. The returned collection is made up of all elements
xwhich satisfy the invariant:from <= indexOf(x) < until
- from
the lowest index to include from this collection.
- until
the lowest index to EXCLUDE from this collection.
- Definition Classes
- Coll
- implicit abstract def tItem: RType[(L, R)]
- Definition Classes
- Coll
- abstract def take(n: Int): Coll[(L, R)]
Selects first n elements.
Selects first n elements.
- n
the number of elements to take from this collection.
- returns
a collection consisting only of the first
nelements of this collection, or else the whole collection, if it has less thannelements. Ifnis negative, returns an empty collection.
- Definition Classes
- Coll
- abstract def toArray: Array[(L, R)]
- Definition Classes
- Coll
- abstract def unionSet(that: Coll[(L, R)]): Coll[(L, R)]
Produces a new collection which contains all distinct elements of this collection and also all elements of a given collection that are not in this collection.
Produces a new collection which contains all distinct elements of this collection and also all elements of a given collection that are not in this collection. This is order preserving operation considering only first occurrences of each distinct elements. Any collection
xscan be transformed to a sequence with distinct elements by using xs.unionSet(Col()).NOTE: Use append if you don't need set semantics.
- that
the collection to add.
- Definition Classes
- Coll
- Since
2.0
- abstract def updateMany(indexes: Coll[Int], values: Coll[(L, R)]): Coll[(L, R)]
Returns a copy of this collection where elements at
indexesare replaced withvalues.Returns a copy of this collection where elements at
indexesare replaced withvalues.- Definition Classes
- Coll
- Since
2.0
- abstract def updated(index: Int, elem: (L, R)): Coll[(L, R)]
A copy of this collection with one single replaced element.
A copy of this collection with one single replaced element.
- index
the position of the replacement
- elem
the replacing element
- returns
a new collection which is a copy of this collection with the element at position
indexreplaced byelem.
- Definition Classes
- Coll
- Since
2.0
- Exceptions thrown
IndexOutOfBoundsExceptionifindexdoes not satisfy0 <= index < length.
- abstract def zip[B](ys: Coll[B]): Coll[((L, R), B)]
For this collection (x0, ..., xN) and other collection (y0, ..., yM) produces a collection ((x0, y0), ..., (xK, yK)) where K = min(N, M)
For this collection (x0, ..., xN) and other collection (y0, ..., yM) produces a collection ((x0, y0), ..., (xK, yK)) where K = min(N, M)
- Definition Classes
- Coll
Concrete Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- def diff(that: Coll[(L, R)]): Coll[(L, R)]
Computes the multiset difference between this collection and another sequence.
Computes the multiset difference between this collection and another sequence.
- that
the sequence of elements to remove
- returns
a new collection which contains all elements of this collection except some of occurrences of elements that also appear in
that. If an element valuexappears n times inthat, then the first n occurrences ofxwill not form part of the result, but any following occurrences will.
- Definition Classes
- Coll
- Since
2.0
- def distinct: Coll[(L, R)]
Builds a new collection from this collection without any duplicate elements.
Builds a new collection from this collection without any duplicate elements.
- returns
A new collection which contains the first occurrence of every element of this collection.
- Definition Classes
- Coll
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- def find(p: ((L, R)) => Boolean): Option[(L, R)]
Finds the first element of the collection satisfying a predicate, if any.
Finds the first element of the collection satisfying a predicate, if any.
- p
the predicate used to test elements.
- returns
an option value containing the first element in the collection that satisfies
p, orNoneif none exists.
- Definition Classes
- Coll
- Since
2.0
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def indexOf(elem: (L, R), from: Int): Int
Finds index of first occurrence of some value in this collection after or at some start index.
Finds index of first occurrence of some value in this collection after or at some start index.
- elem
the element value to search for.
- from
the start index
- returns
the index
>= fromof the first element of this collection that is equal (as determined by==) toelem, or-1, if none exists.
- Definition Classes
- Coll
- Since
2.0
- def intersect(that: Coll[(L, R)]): Coll[(L, R)]
Computes the multiset intersection between this collection and another sequence.
Computes the multiset intersection between this collection and another sequence.
- that
the sequence of elements to intersect with.
- returns
a new collection which contains all elements of this collection which also appear in
that. If an element valuexappears n times inthat, then the first n occurrences ofxwill be retained in the result, but any following occurrences will be omitted.
- Definition Classes
- Coll
- Since
2.0
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def isValidIndex(i: Int): Boolean
Returns true if the index in the valid range.
Returns true if the index in the valid range.
- i
index of an element of this collection
- Definition Classes
- Coll
- 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()
- def size: Int
The size of the collection in elements.
The size of the collection in elements.
- Definition Classes
- Coll
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- Coll → AnyRef → Any
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()