Instance Constructors
-
new
PairIndex(tIndex: Index[T], uIndex: Index[U])
Value Members
-
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
-
def
++:[B >: (T, U), That](that: Traversable[B])(implicit bf: CanBuildFrom[Iterable[(T, U)], B, That]): That
-
def
++:[B >: (T, U), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[(T, U)], B, That]): That
-
def
/:[B](z: B)(op: (B, (T, U)) ⇒ B): B
-
def
:\[B](z: B)(op: ((T, U), B) ⇒ B): B
-
-
final
def
==(arg0: Any): Boolean
-
def
addString(b: StringBuilder): StringBuilder
-
def
addString(b: StringBuilder, sep: String): StringBuilder
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
-
def
aggregate[B](z: B)(seqop: (B, (T, U)) ⇒ B, combop: (B, B) ⇒ B): B
-
def
andThen[A](g: (Int) ⇒ A): ((T, U)) ⇒ A
-
def
apply(t: (T, U)): Int
-
final
def
asInstanceOf[T0]: T0
-
def
canEqual(that: Any): Boolean
-
def
clone(): AnyRef
-
def
collect[B, That](pf: PartialFunction[(T, U), B])(implicit bf: CanBuildFrom[Iterable[(T, U)], B, That]): That
-
-
-
def
compose[A](g: (A) ⇒ (T, U)): (A) ⇒ Int
-
def
contains(t: (T, U)): Boolean
-
def
copyToArray[B >: (T, U)](xs: Array[B], start: Int, len: Int): Unit
-
def
copyToArray[B >: (T, U)](xs: Array[B]): Unit
-
def
copyToArray[B >: (T, U)](xs: Array[B], start: Int): Unit
-
def
copyToBuffer[B >: (T, U)](dest: Buffer[B]): Unit
-
def
count(p: ((T, U)) ⇒ Boolean): Int
-
lazy val
defaultHashCode: Int
-
def
drop(n: Int): Iterable[(T, U)]
-
def
dropRight(n: Int): Iterable[(T, U)]
-
def
dropWhile(p: ((T, U)) ⇒ Boolean): Iterable[(T, U)]
-
-
def
equals(other: Any): Boolean
-
-
def
filter(p: ((T, U)) ⇒ Boolean): Iterable[(T, U)]
-
def
filterNot(p: ((T, U)) ⇒ Boolean): Iterable[(T, U)]
-
def
finalize(): Unit
-
def
find(p: ((T, U)) ⇒ Boolean): Option[(T, U)]
-
def
flatMap[B, That](f: ((T, U)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[(T, U)], B, That]): That
-
def
flatten[B](implicit asTraversable: ((T, U)) ⇒ GenTraversableOnce[B]): Iterable[B]
-
def
fold[A1 >: (T, U)](z: A1)(op: (A1, A1) ⇒ A1): A1
-
def
foldLeft[B](z: B)(op: (B, (T, U)) ⇒ B): B
-
def
foldRight[B](z: B)(op: ((T, U), B) ⇒ B): B
-
-
def
foreach[U](f: ((T, U)) ⇒ U): Unit
-
def
genericBuilder[B]: Builder[B, Iterable[B]]
-
def
get(i: Int): (T, U)
-
final
def
getClass(): Class[_]
-
def
groupBy[K](f: ((T, U)) ⇒ K): Map[K, Iterable[(T, U)]]
-
-
def
hasDefiniteSize: Boolean
-
def
hashCode(): Int
-
def
head: (T, U)
-
def
headOption: Option[(T, U)]
-
def
indexOf(t: (T, U)): Int
-
def
indexOpt(t: (T, U)): Option[Int]
-
def
init: Iterable[(T, U)]
-
-
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
isTraversableAgain: Boolean
-
def
iterator: Iterator[(T, U)]
-
def
last: (T, U)
-
def
lastOption: Option[(T, U)]
-
def
map[B, That](f: ((T, U)) ⇒ B)(implicit bf: CanBuildFrom[Iterable[(T, U)], B, That]): That
-
def
mapIndex(indexInT: Int, indexInU: Int): Int
-
def
max[B >: (T, U)](implicit cmp: Ordering[B]): (T, U)
-
def
maxBy[B](f: ((T, U)) ⇒ B)(implicit cmp: Ordering[B]): (T, U)
-
def
min[B >: (T, U)](implicit cmp: Ordering[B]): (T, U)
-
def
minBy[B](f: ((T, U)) ⇒ B)(implicit cmp: Ordering[B]): (T, U)
-
def
mkString: String
-
def
mkString(sep: String): String
-
def
mkString(start: String, sep: String, end: String): String
-
-
def
newBuilder: Builder[(T, U), Iterable[(T, U)]]
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
pairs: Iterator[((T, U), Int)]
-
-
def
parCombiner: Combiner[(T, U), ParIterable[(T, U)]]
-
def
partition(p: ((T, U)) ⇒ Boolean): (Iterable[(T, U)], Iterable[(T, U)])
-
def
product[B >: (T, U)](implicit num: Numeric[B]): B
-
def
reduce[A1 >: (T, U)](op: (A1, A1) ⇒ A1): A1
-
def
reduceLeft[B >: (T, U)](op: (B, (T, U)) ⇒ B): B
-
def
reduceLeftOption[B >: (T, U)](op: (B, (T, U)) ⇒ B): Option[B]
-
def
reduceOption[A1 >: (T, U)](op: (A1, A1) ⇒ A1): Option[A1]
-
def
reduceRight[B >: (T, U)](op: ((T, U), B) ⇒ B): B
-
def
reduceRightOption[B >: (T, U)](op: ((T, U), B) ⇒ B): Option[B]
-
def
repr: Iterable[(T, U)]
-
def
reversed: List[(T, U)]
-
def
sameElements[B >: (T, U)](that: GenIterable[B]): Boolean
-
def
scan[B >: (T, U), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Iterable[(T, U)], B, That]): That
-
def
scanLeft[B, That](z: B)(op: (B, (T, U)) ⇒ B)(implicit bf: CanBuildFrom[Iterable[(T, U)], B, That]): That
-
def
scanRight[B, That](z: B)(op: ((T, U), B) ⇒ B)(implicit bf: CanBuildFrom[Iterable[(T, U)], B, That]): That
-
def
seq: Iterable[(T, U)]
-
def
size: Int
-
def
slice(from: Int, until: Int): Iterable[(T, U)]
-
-
-
-
-
def
stringPrefix: String
-
def
sum[B >: (T, U)](implicit num: Numeric[B]): B
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
tail: Iterable[(T, U)]
-
-
def
take(n: Int): Iterable[(T, U)]
-
def
takeRight(n: Int): Iterable[(T, U)]
-
def
takeWhile(p: ((T, U)) ⇒ Boolean): Iterable[(T, U)]
-
def
thisCollection: Iterable[(T, U)]
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (T, U), Col[(T, U)]]): Col[(T, U)]
-
def
toArray[B >: (T, U)](implicit arg0: ClassTag[B]): Array[B]
-
def
toBuffer[B >: (T, U)]: Buffer[B]
-
def
toCollection(repr: Iterable[(T, U)]): Iterable[(T, U)]
-
def
toIndexedSeq: IndexedSeq[(T, U)]
-
def
toIterable: Iterable[(T, U)]
-
def
toIterator: Iterator[(T, U)]
-
def
toList: List[(T, U)]
-
def
toMap[T, U](implicit ev: <:<[(T, U), (T, U)]): Map[T, U]
-
def
toSeq: Seq[(T, U)]
-
def
toSet[B >: (T, U)]: Set[B]
-
def
toStream: Stream[(T, U)]
-
def
toString(): String
-
def
toTraversable: Traversable[(T, U)]
-
def
toVector: Vector[(T, U)]
-
-
def
unapply(i: Int): Option[(T, U)]
-
def
unzip[A1, A2](implicit asPair: ((T, U)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])
-
def
unzip3[A1, A2, A3](implicit asTriple: ((T, U)) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
-
-
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
-
def
zip[A1 >: (T, U), B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[(T, U)], (A1, B), That]): That
-
def
zipAll[B, A1 >: (T, U), That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Iterable[(T, U)], (A1, B), That]): That
-
def
zipWithIndex[A1 >: (T, U), That](implicit bf: CanBuildFrom[Iterable[(T, U)], (A1, Int), That]): That
-
def
|[U](right: Index[U]): EitherIndex[(T, U), U]
Deprecated Value Members
-
def
/:\[A1 >: (T, U)](z: A1)(op: (A1, A1) ⇒ A1): A1
Inherited from Index[(T, U)]
Inherited from Serializable
Inherited from ((T, U)) ⇒ Int
An index over pairs from a pair of indexes