class
DroppedWhile[T] extends Transformed[T, T]
Instance Constructors
-
new
DroppedWhile(parent: DeltaSeq[T], p: (T) ⇒ Boolean)
Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
-
def
++:[B >: T, That](that: Traversable[B])(implicit bf: CanBuildFrom[DeltaSeq[T], B, That]): That
-
-
def
+:[B >: T, That](elem: B)(implicit bf: CanBuildFrom[DeltaSeq[T], B, That]): That
-
def
/:[B](z: B)(op: (B, T) ⇒ B): B
-
def
:+[U >: T, That](elem: U)(implicit bf: CanBuildFrom[DeltaSeq[T], U, That]): That
-
def
:\[B](z: B)(op: (T, B) ⇒ B): B
-
final
def
==(arg0: AnyRef): Boolean
-
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) ⇒ B, combop: (B, B) ⇒ B): B
-
-
def
apply(i: Int): T
-
def
applyOrElse[A1 <: Int, B1 >: T](x: A1, default: (A1) ⇒ B1): B1
-
final
def
asInstanceOf[T0]: T0
-
def
canEqual(that: Any): Boolean
-
def
clone(): AnyRef
-
-
-
-
def
companion: DeltaSeq.type
-
def
compose[A](g: (A) ⇒ Int): (A) ⇒ T
-
def
contains(elem: Any): Boolean
-
def
containsSlice[B](that: GenSeq[B]): Boolean
-
def
copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Unit
-
def
copyToArray[B >: T](xs: Array[B]): Unit
-
def
copyToArray[B >: T](xs: Array[B], start: Int): Unit
-
def
copyToBuffer[B >: T](dest: Buffer[B]): Unit
-
def
corresponds[B](that: GenSeq[B])(p: (T, B) ⇒ Boolean): Boolean
-
def
count(p: (T) ⇒ Boolean): Int
-
def
diff[B >: T](that: GenSeq[B]): DeltaSeq[T]
-
def
distinct: DeltaSeq[T]
-
-
def
dropRight(n: Int): DeltaSeq[T]
-
-
def
endsWith[B](that: GenSeq[B]): Boolean
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(that: Any): Boolean
-
-
-
-
def
finalize(): Unit
-
-
-
def
flatten[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): DeltaSeq[B]
-
def
fold[A1 >: T](z: A1)(op: (A1, A1) ⇒ A1): A1
-
def
foldLeft[B](z: B)(op: (B, T) ⇒ B): B
-
def
foldRight[B](z: B)(op: (T, B) ⇒ B): B
-
-
def
foreach[U](f: (T) ⇒ U): Unit
-
lazy val
fromDelta: SeqDelta[T, T]
-
def
genericBuilder[B]: Builder[B, DeltaSeq[B]]
-
final
def
getClass(): Class[_]
-
def
groupBy[K](f: (T) ⇒ K): Map[K, DeltaSeq[T]]
-
-
def
hasDefiniteSize: Boolean
-
def
hashCode(): Int
-
def
head: T
-
def
headOption: Option[T]
-
def
ifDS[U, That](res: ⇒ DeltaSeq[U], sup: ⇒ That)(implicit bf: CanBuildFrom[DeltaSeq[T], U, That]): That
-
def
indexOf[B >: T](elem: B, from: Int): Int
-
def
indexOf[B >: T](elem: B): Int
-
def
indexOfSlice[B >: T](that: GenSeq[B], from: Int): Int
-
def
indexOfSlice[B >: T](that: GenSeq[B]): Int
-
def
indexWhere(p: (T) ⇒ Boolean, from: Int): Int
-
def
indexWhere(p: (T) ⇒ Boolean): Int
-
def
indices: Range
-
-
-
def
intersect[B >: T](that: GenSeq[B]): DeltaSeq[T]
-
def
isDefinedAt(idx: Int): Boolean
-
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
isTraversableAgain: Boolean
-
def
iterator: Iterator[T]
-
def
last: T
-
def
lastIndexOf[B >: T](elem: B, end: Int): Int
-
def
lastIndexOf[B >: T](elem: B): Int
-
def
lastIndexOfSlice[B >: T](that: GenSeq[B], end: Int): Int
-
def
lastIndexOfSlice[B >: T](that: GenSeq[B]): Int
-
def
lastIndexWhere(p: (T) ⇒ Boolean, end: Int): Int
-
def
lastIndexWhere(p: (T) ⇒ Boolean): Int
-
def
lastOption: Option[T]
-
def
length: Int
-
def
lengthCompare(len: Int): Int
-
-
def
map[U, That](f: (T) ⇒ U)(implicit bf: CanBuildFrom[DeltaSeq[T], U, That]): That
-
def
max[B >: T](implicit cmp: Ordering[B]): T
-
def
maxBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T
-
def
min[B >: T](implicit cmp: Ordering[B]): T
-
def
minBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T
-
def
mkString: String
-
def
mkString(sep: String): String
-
def
mkString(start: String, sep: String, end: String): String
-
final
def
ne(arg0: AnyRef): Boolean
-
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
-
-
def
padTo[B >: T, That](len: Int, elem: B)(implicit bf: CanBuildFrom[DeltaSeq[T], B, That]): That
-
-
def
parCombiner: Combiner[T, ParSeq[T]]
-
-
-
def
patch[B >: T, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[DeltaSeq[T], B, That]): That
-
-
lazy val
predValues: Stream[(T, Boolean)]
-
def
prefixLength(p: (T) ⇒ Boolean): Int
-
def
product[B >: T](implicit num: Numeric[B]): B
-
def
reduce[A1 >: T](op: (A1, A1) ⇒ A1): A1
-
def
reduceLeft[B >: T](op: (B, T) ⇒ B): B
-
def
reduceLeftOption[B >: T](op: (B, T) ⇒ B): Option[B]
-
def
reduceOption[A1 >: T](op: (A1, A1) ⇒ A1): Option[A1]
-
def
reduceRight[B >: T](op: (T, B) ⇒ B): B
-
def
reduceRightOption[B >: T](op: (T, B) ⇒ B): Option[B]
-
-
-
def
reverseIterator: Iterator[T]
-
def
reverseMap[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[DeltaSeq[T], B, That]): That
-
def
reversed: List[T]
-
def
runWith[U](action: (T) ⇒ U): (Int) ⇒ Boolean
-
def
sameElements[B >: T](that: GenIterable[B]): Boolean
-
def
scan[B >: T, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[DeltaSeq[T], B, That]): That
-
def
scanLeft[B, That](z: B)(op: (B, T) ⇒ B)(implicit bf: CanBuildFrom[DeltaSeq[T], B, That]): That
-
def
scanRight[B, That](z: B)(op: (T, B) ⇒ B)(implicit bf: CanBuildFrom[DeltaSeq[T], B, That]): That
-
def
segmentLength(p: (T) ⇒ Boolean, from: Int): Int
-
def
seq: Seq[T]
-
lazy val
signal: SeqSignal[T] { ... /* 3 definitions in type refinement */ }
-
def
size: Int
-
def
slice(from: Int, until: Int): DeltaSeq[T]
-
-
-
def
sortBy[B](f: (T) ⇒ B)(implicit ord: Ordering[B]): DeltaSeq[T]
-
def
sortWith(lt: (T, T) ⇒ Boolean): DeltaSeq[T]
-
def
sorted[B >: T](implicit ord: Ordering[B]): DeltaSeq[T]
-
-
-
def
startsWith[B](that: GenSeq[B], offset: Int): Boolean
-
def
startsWith[B](that: GenSeq[B]): Boolean
-
def
stringPrefix: String
-
def
sum[B >: T](implicit num: Numeric[B]): B
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
-
-
-
def
takeRight(n: Int): DeltaSeq[T]
-
-
def
thisCollection: Seq[T]
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, T, Col[T]]): Col[T]
-
def
toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]
-
def
toBuffer[B >: T]: Buffer[B]
-
def
toCollection(repr: DeltaSeq[T]): Seq[T]
-
def
toIndexedSeq: IndexedSeq[T]
-
def
toIterable: Iterable[T]
-
def
toIterator: Iterator[T]
-
def
toList: List[T]
-
def
toMap[T, U](implicit ev: <:<[T, (T, U)]): Map[T, U]
-
def
toSeq: Seq[T]
-
def
toSet[B >: T]: Set[B]
-
def
toStream: Stream[T]
-
def
toString(): String
-
-
def
toVector: Vector[T]
-
-
lazy val
underlying: Seq[T]
-
def
union[B >: T, That](that: GenSeq[B])(implicit bf: CanBuildFrom[DeltaSeq[T], B, That]): That
-
def
unzip[A1, A2](implicit asPair: (T) ⇒ (A1, A2)): (DeltaSeq[A1], DeltaSeq[A2])
-
def
unzip3[A1, A2, A3](implicit asTriple: (T) ⇒ (A1, A2, A3)): (DeltaSeq[A1], DeltaSeq[A2], DeltaSeq[A3])
-
def
updated[B >: T, That](index: Int, elem: B)(implicit bf: CanBuildFrom[DeltaSeq[T], B, That]): That
-
def
updatedFromParent(parentUpdated: DeltaSeq[T]): DroppedWhile[T]
-
def
view(from: Int, until: Int): SeqView[T, DeltaSeq[T]]
-
def
view: SeqView[T, DeltaSeq[T]]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
-
def
zip[A1 >: T, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[DeltaSeq[T], (A1, B), That]): That
-
def
zipAll[B, A1 >: T, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[DeltaSeq[T], (A1, B), That]): That
-
def
zipWithIndex[A1 >: T, That](implicit bf: CanBuildFrom[DeltaSeq[T], (A1, Int), That]): That
Deprecated Value Members
-
def
/:\[A1 >: T](z: A1)(op: (A1, A1) ⇒ A1): A1
Inherited from AnyRef
Inherited from Any
