Class

xerial.larray.LIterable

SlidingIterator

Related Doc: package LIterable

Permalink

class SlidingIterator extends AbstractLIterator[LSeq.Repr]

Source
LIterable.scala
Linear Supertypes
AbstractLIterator[LSeq.Repr], LIterator[LSeq.Repr], AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. SlidingIterator
  2. AbstractLIterator
  3. LIterator
  4. AnyRef
  5. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new SlidingIterator(size: Long, step: Long)

    Permalink

Value Members

  1. final def !=(arg0: Any): Boolean

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  4. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Permalink
    Definition Classes
    LIterator
  5. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  6. def buffered: BufferedLIterator[LSeq.Repr]

    Permalink
    Definition Classes
    LIterator
  7. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  8. def collect[B](pf: PartialFunction[LSeq.Repr, B]): LIterator[B]

    Permalink
    Definition Classes
    LIterator
  9. def contains(elem: Any): Boolean

    Permalink
    Definition Classes
    LIterator
  10. def drop(n: Long): LIterator[LSeq.Repr]

    Permalink

    Advances this iterator past the first n elements, or the length of the iterator, whichever is smaller.

    Advances this iterator past the first n elements, or the length of the iterator, whichever is smaller.

    n

    the number of elements to drop

    returns

    an iterator which produces all values of the current iterator, except it omits the first n values.

    Definition Classes
    LIterator
  11. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  12. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  13. def exists(p: (LSeq.Repr) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    LIterator
  14. def filter(pred: (LSeq.Repr) ⇒ Boolean): LIterator[LSeq.Repr]

    Permalink
    Definition Classes
    LIterator
  15. def filterNot(p: (LSeq.Repr) ⇒ Boolean): LIterator[LSeq.Repr]

    Permalink
    Definition Classes
    LIterator
  16. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  17. def find(p: (LSeq.Repr) ⇒ Boolean): Option[LSeq.Repr]

    Permalink
    Definition Classes
    LIterator
  18. def flatMap[B](f: (LSeq.Repr) ⇒ LIterator[B]): LIterator[B]

    Permalink
    Definition Classes
    LIterator
  19. def forall(pred: (LSeq.Repr) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    LIterator
  20. def foreach[U](f: (LSeq.Repr) ⇒ U): Unit

    Permalink
    Definition Classes
    LIterator
  21. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  22. def hasNext: Boolean

    Permalink
    Definition Classes
    SlidingIteratorLIterator
  23. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  24. def indexOf[B >: LSeq.Repr](elem: B): Long

    Permalink

    Returns the index of the first occurrence of the specified object in this iterable object.

    Returns the index of the first occurrence of the specified object in this iterable object.

    elem

    element to search for.

    returns

    the index of the first occurrence of elem in the values produced by this iterator, or -1 if such an element does not exist until the end of the iterator is reached.

    Definition Classes
    LIterator
  25. def indexWhere(p: (LSeq.Repr) ⇒ Boolean): Long

    Permalink

    Returns the index of the first produced value satisfying a predicate, or -1.

    Returns the index of the first produced value satisfying a predicate, or -1.

    p

    the predicate to test values

    returns

    the index of the first produced value satisfying p, or -1 if such an element does not exist until the end of the iterator is reached.

    Definition Classes
    LIterator
  26. def isEmpty: Boolean

    Permalink

    Tests whether this iterator is empty.

    Tests whether this iterator is empty.

    returns

    true if hasNext is false, false otherwise.

    Definition Classes
    LIterator
  27. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  28. def map[B](f: (LSeq.Repr) ⇒ B): LIterator[B]

    Permalink
    Definition Classes
    LIterator
  29. def mkString: String

    Permalink
    Definition Classes
    LIterator
  30. def mkString(sep: String): String

    Permalink
    Definition Classes
    LIterator
  31. def mkString(start: String, sep: String, end: String): String

    Permalink
    Definition Classes
    LIterator
  32. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  33. def next(): LSeq.Repr

    Permalink
    Definition Classes
    SlidingIteratorLIterator
  34. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  35. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  36. def partition(p: (LSeq.Repr) ⇒ Boolean): (LIterator[LSeq.Repr], LIterator[LSeq.Repr])

    Permalink

    Partitions this iterator in two iterators according to a predicate.

    Partitions this iterator in two iterators according to a predicate.

    p

    the predicate on which to partition

    returns

    a pair of iterators: the iterator that satisfies the predicate p and the iterator that does not. The relative order of the elements in the resulting iterators is the same as in the original iterator.

    Definition Classes
    LIterator
  37. def reduceLeft[B >: LSeq.Repr](op: (B, LSeq.Repr) ⇒ B): B

    Permalink
    Definition Classes
    LIterator
  38. def sameElements(that: LIterator[_]): Boolean

    Permalink
    Definition Classes
    LIterator
  39. def scanLeft[B](z: B)(op: (B, LSeq.Repr) ⇒ B): LIterator[B]

    Permalink
    Definition Classes
    LIterator
  40. def size: Long

    Permalink
    Definition Classes
    LIterator
  41. def slice(from: Long, until: Long): LIterator[LSeq.Repr]

    Permalink
    Definition Classes
    LIterator
  42. def span(p: (LSeq.Repr) ⇒ Boolean): (LIterator[LSeq.Repr], LIterator[LSeq.Repr])

    Permalink

    Splits this Iterator into a prefix/suffix pair according to a predicate.

    Splits this Iterator into a prefix/suffix pair according to a predicate.

    p

    the test predicate

    returns

    a pair of Iterators consisting of the longest prefix of this whose elements all satisfy p, and the rest of the Iterator.

    Definition Classes
    LIterator
  43. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  44. def take(n: Long): LIterator[LSeq.Repr]

    Permalink

    Selects first n values of this iterator.

    Selects first n values of this iterator.

    n

    the number of values to take

    returns

    an iterator producing only of the first n values of this iterator, or else the whole iterator, if it produces fewer than n values.

    Definition Classes
    LIterator
  45. def takeWhile(p: (LSeq.Repr) ⇒ Boolean): LIterator[LSeq.Repr]

    Permalink

    Takes longest prefix of values produced by this iterator that satisfy a predicate.

    Takes longest prefix of values produced by this iterator that satisfy a predicate.

    p

    The predicate used to test elements.

    returns

    An iterator returning the values produced by this iterator, until this iterator produces a value that does not satisfy the predicate p.

    Definition Classes
    LIterator
  46. def toArray[A1 >: LSeq.Repr](implicit arg0: ClassTag[A1]): Array[A1]

    Permalink
    Definition Classes
    LIterator
  47. def toLArray[B >: LSeq.Repr](implicit arg0: ClassTag[B]): LArray[B]

    Permalink
    Definition Classes
    LIterator
  48. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  49. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  50. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  51. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  52. def withFilter(p: (LSeq.Repr) ⇒ Boolean): LIterator[LSeq.Repr]

    Permalink
    Definition Classes
    LIterator
  53. def zip[B](that: LIterator[B]): LIterator[(LSeq.Repr, B)]

    Permalink
    Definition Classes
    LIterator
  54. def zipAll[B, A1 >: LSeq.Repr, B1 >: B](that: LIterator[B], thisElem: A1, thatElem: B1): LIterator[(A1, B1)]

    Permalink
    Definition Classes
    LIterator
  55. def zipWithIndex: LIterator[(LSeq.Repr, Long)]

    Permalink
    Definition Classes
    LIterator

Inherited from AbstractLIterator[LSeq.Repr]

Inherited from LIterator[LSeq.Repr]

Inherited from AnyRef

Inherited from Any

Ungrouped