sealed trait RangedSeq[Elem, P] extends FingerTreeLike[Option[(P, P)], Elem, RangedSeq[Elem, P]]

Linear Supertypes
FingerTreeLike[Option[(P, P)], Elem, RangedSeq[Elem, P]], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. RangedSeq
  2. FingerTreeLike
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def +(elem: Elem): RangedSeq[Elem, P]

    Adds a new element to the tree.

  2. abstract def -(elem: Elem): RangedSeq[Elem, P]

    Removes an element from the tree.

  3. abstract def filterIncludes(interval: (P, P)): Iterator[Elem]

    Filters the tree to contain only those elements that are completely contained within a given interval.

    Filters the tree to contain only those elements that are completely contained within a given interval. Containment means that found_start <= query_start &&

    interval

    the query interval

    returns

    the filtered tree whose elements are contained within the query interval

  4. abstract def filterOverlaps(interval: (P, P)): Iterator[Elem]

    Filters the tree to contain only those elements that overlap a given interval.

    Filters the tree to contain only those elements that overlap a given interval. An overlap occurs if the intersection between query interval and found interval is non-empty. In other words, found_start < query_stop && found_stop > query_start.

    interval

    the query interval

    returns

    the filtered tree whose elements overlap the query interval

  5. abstract def find(point: P): Option[Elem]

    Find an element that contains a given point.

    Find an element that contains a given point. A point is contained in if found_start <= point && found_stop > point. Elements with empty intervals will thus not be detected (the interval version of this method can)

    point

    the query point

    returns

    the element containing the point, or None if such an element does not exist.

  6. abstract def findOverlaps(interval: (P, P)): Option[Elem]

    Finds an element that overlaps a given interval.

    Finds an element that overlaps a given interval. An overlap occurs if the intersection between query interval and found interval is non-empty. In other words, found_start < query_stop && found_stop > query_start. Of the candidates, returns the one with the lowest start point.

    interval

    the query interval

    returns

    the element which overlaps the query interval, or None if there is none.

  7. abstract def includes(interval: (P, P)): Boolean
  8. abstract def includes(point: P): Boolean
  9. abstract def intersect(point: P): Iterator[Elem]

    Filters the tree to contain only those elements that contain a given point.

    Filters the tree to contain only those elements that contain a given point. An element contains the point if its interval start is less than or equal to that point and its interval stop is greater than that point.

    point

    the intersection point

    returns

    the filtered tree having only elements which contain the point

  10. abstract def interval: Option[(P, P)]

    Returns the total interval covered by the sequence, or None if the range is empty

  11. implicit abstract def m: Measure[Elem, Option[(P, P)]]
    Attributes
    protected
    Definition Classes
    FingerTreeLike
  12. abstract def overlaps(interval: (P, P)): Boolean
  13. abstract def tree: FingerTree[Option[(P, P)], Elem]
    Attributes
    protected
    Definition Classes
    FingerTreeLike
  14. abstract def wrap(tree: FingerTree[Option[(P, P)], Elem]): RangedSeq[Elem, P]
    Attributes
    protected
    Definition Classes
    FingerTreeLike

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  6. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  7. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  8. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  9. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  10. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  11. final def head: Elem
    Definition Classes
    FingerTreeLike
  12. final def headOption: Option[Elem]
    Definition Classes
    FingerTreeLike
  13. final def init: RangedSeq[Elem, P]
    Definition Classes
    FingerTreeLike
  14. final def isEmpty: Boolean
    Definition Classes
    FingerTreeLike
  15. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  16. final def iterator: Iterator[Elem]
    Definition Classes
    FingerTreeLike
  17. final def last: Elem
    Definition Classes
    FingerTreeLike
  18. final def lastOption: Option[Elem]
    Definition Classes
    FingerTreeLike
  19. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  20. final def nonEmpty: Boolean
    Definition Classes
    FingerTreeLike
  21. final def notify(): Unit
    Definition Classes
    AnyRef
  22. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  23. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  24. final def tail: RangedSeq[Elem, P]
    Definition Classes
    FingerTreeLike
  25. final def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Elem, Col[Elem]]): Col[Elem]
    Definition Classes
    FingerTreeLike
  26. final def toList: List[Elem]
    Definition Classes
    FingerTreeLike
  27. def toString(): String
    Definition Classes
    AnyRef → Any
  28. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  29. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  30. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from FingerTreeLike[Option[(P, P)], Elem, RangedSeq[Elem, P]]

Inherited from AnyRef

Inherited from Any

Ungrouped