final case class From(start: Long) extends FromOrAll with HasStart with Product with Serializable
- Alphabetic
- By Inheritance
- From
- Serializable
- Serializable
- Product
- Equals
- HasStart
- HasStartOrVoid
- Bounded
- FromOrAll
- Open
- NonVoid
- SpanLike
- Writable
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
- new From(start: Long)
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
clip(pos: Long): Long
Clips a position to this span's boundary.
Clips a position to this span's boundary. Note that the span's stop position is included. Thus the result is greater than or equal the start, and less than or equal (!) the stop.
For the special cases of
Span.AllandSpan.Void, this method returns the argument unchanged.- pos
the point to clip
- returns
the clipped point
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
def
compareStart(pos: Long): Int
Compares the span's start to a given position
-
def
compareStop(pos: Long): Int
Compares the span's stop to a given position
-
def
contains(that: SpanLike): Boolean
Checks if another span lies within the span.
-
def
contains(pos: Long): Boolean
Checks if a position lies within the span.
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
intersect(that: SpanLike): HasStartOrVoid
Construct the intersection between this and another span.
Construct the intersection between this and another span. If the two spans are disjoint, the result will be empty. An empty result may be a
Spanif the two spans touched each other, orSpan.Voidif they did not touch each other. If either span isSpan.All, the other span is returned. If either span is void,Span.Voidwill be returned.This method is commutative (
a intersect b == b intersect a).- that
the span to form the intersection with
- returns
the intersection span (possibly empty)
- def invert: Until
-
final
def
isEmpty: Boolean
Checks if the span is empty.
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
nonEmpty: Boolean
Checks if the span is non empty.
-
def
nonEmptyOption: Option[From]
- Definition Classes
- From → HasStartOrVoid → FromOrAll → SpanLike
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
overlaps(that: SpanLike): Boolean
Checks if a two spans overlap each other.
Checks if a two spans overlap each other. Two spans overlap if the overlapping area is greater than or equal to 1. This implies that if either span is empty, the result will be
false.This method is commutative (
a overlaps b == b overlaps a).- that
second span
- returns
true, if the spans overlap each other
-
def
shift(delta: Long): From
Shifts the span, that is applies an offset to its start and stop.
Shifts the span, that is applies an offset to its start and stop. For single sided open spans (
Span.FromandSpan.Until) this alters the only bounded value. ForSpan.AllandSpan.Voidthis returns the object unchanged.- delta
the shift amount (the amount to be added to the span's positions)
- returns
the shifted span
- val start: Long
- def startOption: Option[Long]
- def startOrElse(default: ⇒ Long): Long
- def stopOption: Option[Long]
- def stopOrElse(default: ⇒ Long): Long
-
def
subtract(that: SpanLike): IndexedSeq[HasStart]
Subtracts a given span from this span.
Subtracts a given span from this span. Note that an empty span argument "cuts" this span, e.g.
Span.all subtract Span(30,30) == Seq(Span.until(30),Span.from(30))- that
the span to subtract
- returns
a collection of spans after the argument was subtracted. Unlike
intersect, this method filters out empty spans, thus a span subtracted from itself produces an empty collection. ifthatis aSpan, the result might be two disjoint spans.
-
def
subtract(that: Open): HasStartOrVoid
Subtracts a given open span from this span.
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
touches(that: SpanLike): Boolean
Checks if a two spans overlap or touch each other.
Checks if a two spans overlap or touch each other. Two spans touch each other if they either overlap or they share a common point with each other (this span's start or stop is that span's start or stop).
This method is commutative (
a touches b == b touches a).- that
second span
- returns
true, if the spans touch each other
-
def
union(that: SpanLike): FromOrAll
Constructs a single span which contains both
thisandthatspan.Constructs a single span which contains both
thisandthatspan. If the two spans are disjoint, the result will be a span withstart = min(this.start, that.start)andstop = max(this.stop, that.stop). If either span is void, the other span is returned. If either span isSpan.All,Span.Allwill be returned.This method is commutative (
a union b == b union a).- that
the span to form the union with
- returns
the encompassing span
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
- def write(out: DataOutput): Unit