chronoscala/io.github.chronoscala/DateInterval

DateInterval

case class DateInterval(startDate: LocalDate, endDate: LocalDate, step: Period) extends Seq[LocalDate]

Represents an immutable date interval

Source:
DateInterval.scala
trait Serializable
trait Product
trait Seq[LocalDate]
trait SeqOps[LocalDate, Seq, Seq[LocalDate]]
trait Seq[LocalDate]
trait Equals
trait SeqOps[LocalDate, Seq, Seq[LocalDate]]
trait PartialFunction[Int, LocalDate]
trait Int => LocalDate
trait Iterable[LocalDate]
trait Iterable[LocalDate]
trait IterableFactoryDefaults[LocalDate, Seq]
trait IterableOps[LocalDate, Seq, Seq[LocalDate]]
trait IterableOnceOps[LocalDate, Seq, Seq[LocalDate]]
trait IterableOnce[LocalDate]
class Object
trait Matchable
class Any

Value members

Concrete methods

def apply(idx: Int): LocalDate
def by(step: Period): DateInterval
def iterator: Iterator[LocalDate]
def length: Int

Inherited methods

final def ++[B >: LocalDate](suffix: IterableOnce[B]): CC[B]
Inherited from:
IterableOps
final override def ++:[B >: LocalDate](prefix: IterableOnce[B]): CC[B]
Definition Classes
SeqOps -> IterableOps
Inherited from:
SeqOps
final def +:[B >: LocalDate](elem: B): CC[B]
Inherited from:
SeqOps
final def :+[B >: LocalDate](elem: B): CC[B]
Inherited from:
SeqOps
final def :++[B >: LocalDate](suffix: IterableOnce[B]): CC[B]
Inherited from:
SeqOps
final def addString(b: StringBuilder): StringBuilder
Inherited from:
IterableOnceOps
final def addString(b: StringBuilder, sep: String): StringBuilder
Inherited from:
IterableOnceOps
def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
Inherited from:
IterableOnceOps
def andThen[C](k: PartialFunction[LocalDate, C]): PartialFunction[A, C]
Inherited from:
PartialFunction
override def andThen[C](k: LocalDate => C): PartialFunction[A, C]
Definition Classes
PartialFunction -> Function1
Inherited from:
PartialFunction
def appended[B >: LocalDate](elem: B): CC[B]
Inherited from:
SeqOps
def appendedAll[B >: LocalDate](suffix: IterableOnce[B]): CC[B]
Inherited from:
SeqOps
def applyOrElse[A1 <: Int, B1 >: LocalDate](x: A1, default: A1 => B1): B1
Inherited from:
PartialFunction
def canEqual(that: Any): Boolean
Inherited from:
Seq
def collect[B](pf: PartialFunction[LocalDate, B]): CC[B]
Inherited from:
IterableOps
def collectFirst[B](pf: PartialFunction[LocalDate, B]): Option[B]
Inherited from:
IterableOnceOps
def combinations(n: Int): Iterator[C]
Inherited from:
SeqOps
def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, B]
Inherited from:
PartialFunction
def compose[A](g: A => Int): A => R
Inherited from:
Function1
final override def concat[B >: LocalDate](suffix: IterableOnce[B]): CC[B]
Definition Classes
SeqOps -> IterableOps
Inherited from:
SeqOps
def contains[A1 >: LocalDate](elem: A1): Boolean
Inherited from:
SeqOps
def containsSlice[B >: LocalDate](that: Seq[B]): Boolean
Inherited from:
SeqOps
def copyToArray[B >: LocalDate](xs: Array[B], start: Int, len: Int): Int
Inherited from:
IterableOnceOps
def copyToArray[B >: LocalDate](xs: Array[B], start: Int): Int
Inherited from:
IterableOnceOps
def copyToArray[B >: LocalDate](xs: Array[B]): Int
Inherited from:
IterableOnceOps
def corresponds[B](that: IterableOnce[B])(p: (LocalDate, B) => Boolean): Boolean
Inherited from:
IterableOnceOps
def corresponds[B](that: Seq[B])(p: (LocalDate, B) => Boolean): Boolean
Inherited from:
SeqOps
def count(p: LocalDate => Boolean): Int
Inherited from:
IterableOnceOps
def diff[B >: LocalDate](that: Seq[B]): C
Inherited from:
SeqOps
def distinct: C
Inherited from:
SeqOps
def distinctBy[B](f: LocalDate => B): C
Inherited from:
SeqOps
def drop(n: Int): C
Inherited from:
IterableOps
def dropRight(n: Int): C
Inherited from:
IterableOps
def dropWhile(p: LocalDate => Boolean): C
Inherited from:
IterableOps
def elementWise: ElementWiseExtractor[A, B]
Inherited from:
PartialFunction
override def empty: CC[A]
Definition Classes
IterableFactoryDefaults -> IterableOps
Inherited from:
IterableFactoryDefaults
def endsWith[B >: LocalDate](that: Iterable[B]): Boolean
Inherited from:
SeqOps
override def equals(o: Any): Boolean

Compares the receiver object (this) with the argument object (that) for equivalence.

Compares the receiver object (this) with the argument object (that) for equivalence.

Any implementation of this method should be an equivalence relation:

  • It is reflexive: for any instance x of type Any, x.equals(x) should return true.
  • It is symmetric: for any instances x and y of type Any, x.equals(y) should return true if and only if y.equals(x) returns true.
  • It is transitive: for any instances x, y, and z of type Any if x.equals(y) returns true and y.equals(z) returns true, then x.equals(z) should return true.

If you override this method, you should verify that your implementation remains an equivalence relation. Additionally, when overriding this method it is usually necessary to override hashCode to ensure that objects which are "equal" (o1.equals(o2) returns true) hash to the same scala.Int. (o1.hashCode.equals(o2.hashCode)).

Value parameters:
that

the object to compare against this object for equality.

Returns:

true if the receiver object is equivalent to the argument; false otherwise.

Definition Classes
Seq -> Equals -> Any
Inherited from:
Seq
def exists(p: LocalDate => Boolean): Boolean
Inherited from:
IterableOnceOps
def filter(pred: LocalDate => Boolean): C
Inherited from:
IterableOps
def filterNot(pred: LocalDate => Boolean): C
Inherited from:
IterableOps
def find(p: LocalDate => Boolean): Option[A]
Inherited from:
IterableOnceOps
def findLast(p: LocalDate => Boolean): Option[A]
Inherited from:
SeqOps
def flatMap[B](f: LocalDate => IterableOnce[B]): CC[B]
Inherited from:
IterableOps
def flatten[B](implicit asIterable: LocalDate => IterableOnce[B]): CC[B]
Inherited from:
IterableOps
def fold[A1 >: LocalDate](z: A1)(op: (A1, A1) => A1): A1
Inherited from:
IterableOnceOps
def foldLeft[B](z: B)(op: (B, LocalDate) => B): B
Inherited from:
IterableOnceOps
def foldRight[B](z: B)(op: (LocalDate, B) => B): B
Inherited from:
IterableOnceOps
def forall(p: LocalDate => Boolean): Boolean
Inherited from:
IterableOnceOps
def foreach[U](f: LocalDate => U): Unit
Inherited from:
IterableOnceOps
protected def fromSpecific(coll: IterableOnce[LocalDate]): CC[A]
Inherited from:
IterableFactoryDefaults
def groupBy[K](f: LocalDate => K): Map[K, C]
Inherited from:
IterableOps
def groupMap[K, B](key: LocalDate => K)(f: LocalDate => B): Map[K, CC[B]]
Inherited from:
IterableOps
def groupMapReduce[K, B](key: LocalDate => K)(f: LocalDate => B)(reduce: (B, B) => B): Map[K, B]
Inherited from:
IterableOps
def grouped(size: Int): Iterator[C]
Inherited from:
IterableOps
override def hashCode(): Int

Calculate a hash code value for the object.

Calculate a hash code value for the object.

The default hashing algorithm is platform dependent.

Note that it is allowed for two objects to have identical hash codes (o1.hashCode.equals(o2.hashCode)) yet not be equal (o1.equals(o2) returns false). A degenerate implementation could always return 0. However, it is required that if two objects are equal (o1.equals(o2) returns true) that they have identical hash codes (o1.hashCode.equals(o2.hashCode)). Therefore, when overriding this method, be sure to verify that the behavior is consistent with the equals method.

Returns:

the hash code value for this object.

Definition Classes
Seq -> Any
Inherited from:
Seq
def head: A
Inherited from:
IterableOps
def headOption: Option[A]
Inherited from:
IterableOps
def indexOf[B >: LocalDate](elem: B): Int
Inherited from:
SeqOps
def indexOf[B >: LocalDate](elem: B, from: Int): Int
Inherited from:
SeqOps
def indexOfSlice[B >: LocalDate](that: Seq[B]): Int
Inherited from:
SeqOps
def indexOfSlice[B >: LocalDate](that: Seq[B], from: Int): Int
Inherited from:
SeqOps
def indexWhere(p: LocalDate => Boolean): Int
Inherited from:
SeqOps
def indexWhere(p: LocalDate => Boolean, from: Int): Int
Inherited from:
SeqOps
def indices: Range
Inherited from:
SeqOps
def init: C
Inherited from:
IterableOps
def inits: Iterator[C]
Inherited from:
IterableOps
def intersect[B >: LocalDate](that: Seq[B]): C
Inherited from:
SeqOps
def isDefinedAt(idx: Int): Boolean
Inherited from:
SeqOps
override def isEmpty: Boolean
Definition Classes
SeqOps -> IterableOnceOps
Inherited from:
SeqOps
override def isTraversableAgain: Boolean
Definition Classes
IterableOps -> IterableOnceOps
Inherited from:
IterableOps
override def iterableFactory: SeqFactory[Seq]
Definition Classes
Seq -> Seq -> Iterable -> Iterable -> IterableOps
Inherited from:
Seq
def knownSize: Int
Inherited from:
IterableOnce
def last: A
Inherited from:
IterableOps
def lastIndexOf[B >: LocalDate](elem: B, end: Int): Int
Inherited from:
SeqOps
def lastIndexOfSlice[B >: LocalDate](that: Seq[B]): Int
Inherited from:
SeqOps
def lastIndexOfSlice[B >: LocalDate](that: Seq[B], end: Int): Int
Inherited from:
SeqOps
def lastIndexWhere(p: LocalDate => Boolean): Int
Inherited from:
SeqOps
def lastIndexWhere(p: LocalDate => Boolean, end: Int): Int
Inherited from:
SeqOps
def lastOption: Option[A]
Inherited from:
IterableOps
def lazyZip[B](that: Iterable[B]): LazyZip2[A, B, Iterable]
Inherited from:
Iterable
def lengthCompare(that: Iterable[_]): Int
Inherited from:
SeqOps
def lengthCompare(len: Int): Int
Inherited from:
SeqOps
final def lengthIs: SizeCompareOps
Inherited from:
SeqOps
def lift: A => Option[B]
Inherited from:
PartialFunction
def map[B](f: LocalDate => B): CC[B]
Inherited from:
IterableOps
def max[B >: LocalDate](implicit ord: Ordering[B]): A
Inherited from:
IterableOnceOps
def maxBy[B](f: LocalDate => B)(implicit cmp: Ordering[B]): A
Inherited from:
IterableOnceOps
def maxByOption[B](f: LocalDate => B)(implicit cmp: Ordering[B]): Option[A]
Inherited from:
IterableOnceOps
def maxOption[B >: LocalDate](implicit ord: Ordering[B]): Option[A]
Inherited from:
IterableOnceOps
def min[B >: LocalDate](implicit ord: Ordering[B]): A
Inherited from:
IterableOnceOps
def minBy[B](f: LocalDate => B)(implicit cmp: Ordering[B]): A
Inherited from:
IterableOnceOps
def minByOption[B](f: LocalDate => B)(implicit cmp: Ordering[B]): Option[A]
Inherited from:
IterableOnceOps
def minOption[B >: LocalDate](implicit ord: Ordering[B]): Option[A]
Inherited from:
IterableOnceOps
final def mkString: String
Inherited from:
IterableOnceOps
final def mkString(sep: String): String
Inherited from:
IterableOnceOps
final def mkString(start: String, sep: String, end: String): String
Inherited from:
IterableOnceOps
protected def newSpecificBuilder: Builder[A, CC[A]]
Inherited from:
IterableFactoryDefaults
def nonEmpty: Boolean
Inherited from:
IterableOnceOps
def orElse[A1 <: Int, B1 >: LocalDate](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
Inherited from:
PartialFunction
def padTo[B >: LocalDate](len: Int, elem: B): CC[B]
Inherited from:
SeqOps
def partition(p: LocalDate => Boolean): (C, C)
Inherited from:
IterableOps
def partitionMap[A1, A2](f: LocalDate => Either[A1, A2]): (CC[A1], CC[A2])
Inherited from:
IterableOps
def patch[B >: LocalDate](from: Int, other: IterableOnce[B], replaced: Int): CC[B]
Inherited from:
SeqOps
def permutations: Iterator[C]
Inherited from:
SeqOps
def prepended[B >: LocalDate](elem: B): CC[B]
Inherited from:
SeqOps
def prependedAll[B >: LocalDate](prefix: IterableOnce[B]): CC[B]
Inherited from:
SeqOps
def product[B >: LocalDate](implicit num: Numeric[B]): B
Inherited from:
IterableOnceOps
def productElementNames: Iterator[String]
Inherited from:
Product
def productIterator: Iterator[Any]
Inherited from:
Product
def reduce[B >: LocalDate](op: (B, B) => B): B
Inherited from:
IterableOnceOps
def reduceLeft[B >: LocalDate](op: (B, LocalDate) => B): B
Inherited from:
IterableOnceOps
def reduceLeftOption[B >: LocalDate](op: (B, LocalDate) => B): Option[B]
Inherited from:
IterableOnceOps
def reduceOption[B >: LocalDate](op: (B, B) => B): Option[B]
Inherited from:
IterableOnceOps
def reduceRight[B >: LocalDate](op: (LocalDate, B) => B): B
Inherited from:
IterableOnceOps
def reduceRightOption[B >: LocalDate](op: (LocalDate, B) => B): Option[B]
Inherited from:
IterableOnceOps
def reverse: C
Inherited from:
SeqOps
def reverseIterator: Iterator[A]
Inherited from:
SeqOps
protected def reversed: Iterable[A]
Inherited from:
IterableOnceOps
def runWith[U](action: LocalDate => U): A => Boolean
Inherited from:
PartialFunction
def sameElements[B >: LocalDate](that: IterableOnce[B]): Boolean
Inherited from:
SeqOps
def scala$collection$SeqOps$$super$concat[B >: LocalDate](suffix: IterableOnce[B]): CC[B]
Inherited from:
SeqOps
def scala$collection$SeqOps$$super$sizeCompare(that: Iterable[_]): Int
Inherited from:
SeqOps
def scala$collection$SeqOps$$super$sizeCompare(otherSize: Int): Int
Inherited from:
SeqOps
def scan[B >: LocalDate](z: B)(op: (B, B) => B): CC[B]
Inherited from:
IterableOps
def scanLeft[B](z: B)(op: (B, LocalDate) => B): CC[B]
Inherited from:
IterableOps
def scanRight[B](z: B)(op: (LocalDate, B) => B): CC[B]
Inherited from:
IterableOps
def search[B >: LocalDate](elem: B, from: Int, to: Int)(implicit ord: Ordering[B]): SearchResult
Inherited from:
SeqOps
def search[B >: LocalDate](elem: B)(implicit ord: Ordering[B]): SearchResult
Inherited from:
SeqOps
def segmentLength(p: LocalDate => Boolean, from: Int): Int
Inherited from:
SeqOps
final def segmentLength(p: LocalDate => Boolean): Int
Inherited from:
SeqOps
final override def size: Int
Definition Classes
SeqOps -> IterableOnceOps
Inherited from:
SeqOps
final override def sizeCompare(that: Iterable[_]): Int
Definition Classes
SeqOps -> IterableOps
Inherited from:
SeqOps
final override def sizeCompare(otherSize: Int): Int
Definition Classes
SeqOps -> IterableOps
Inherited from:
SeqOps
final def sizeIs: SizeCompareOps
Inherited from:
IterableOps
def slice(from: Int, until: Int): C
Inherited from:
IterableOps
def sliding(size: Int, step: Int): Iterator[C]
Inherited from:
IterableOps
def sliding(size: Int): Iterator[C]
Inherited from:
IterableOps
def sortBy[B](f: LocalDate => B)(implicit ord: Ordering[B]): C
Inherited from:
SeqOps
def sortWith(lt: (LocalDate, LocalDate) => Boolean): C
Inherited from:
SeqOps
def sorted[B >: LocalDate](implicit ord: Ordering[B]): C
Inherited from:
SeqOps
def span(p: LocalDate => Boolean): (C, C)
Inherited from:
IterableOps
override def splitAt(n: Int): (C, C)
Definition Classes
IterableOps -> IterableOnceOps
Inherited from:
IterableOps
def startsWith[B >: LocalDate](that: IterableOnce[B], offset: Int): Boolean
Inherited from:
SeqOps
def stepper[S <: Stepper[_]](implicit shape: StepperShape[LocalDate, S]): S
Inherited from:
IterableOnce
def sum[B >: LocalDate](implicit num: Numeric[B]): B
Inherited from:
IterableOnceOps
def tail: C
Inherited from:
IterableOps
def tails: Iterator[C]
Inherited from:
IterableOps
def take(n: Int): C
Inherited from:
IterableOps
def takeRight(n: Int): C
Inherited from:
IterableOps
def takeWhile(p: LocalDate => Boolean): C
Inherited from:
IterableOps
override def tapEach[U](f: LocalDate => U): C
Definition Classes
IterableOps -> IterableOnceOps
Inherited from:
IterableOps
def to[C1](factory: Factory[LocalDate, C1]): C1
Inherited from:
IterableOnceOps
def toArray[B >: LocalDate : ClassTag]: Array[B]
Inherited from:
IterableOnceOps
final def toBuffer[B >: LocalDate]: Buffer[B]
Inherited from:
IterableOnceOps
def toIndexedSeq: IndexedSeq[A]
Inherited from:
IterableOnceOps
def toList: List[A]
Inherited from:
IterableOnceOps
def toMap[K, V](implicit ev: LocalDate <:< (K, V)): Map[K, V]
Inherited from:
IterableOnceOps
final override def toSeq: Seq.this.type
Definition Classes
Seq -> IterableOnceOps
Inherited from:
Seq
def toSet[B >: LocalDate]: Set[B]
Inherited from:
IterableOnceOps
override def toString(): String

Returns a string representation of the object.

Returns a string representation of the object.

The default representation is platform dependent.

Returns:

a string representation of the object.

Definition Classes
Seq -> Function1 -> Iterable -> Any
Inherited from:
Seq
def toVector: Vector[A]
Inherited from:
IterableOnceOps
def transpose[B](implicit asIterable: LocalDate => Iterable[B]): CC[CC[B]]
Inherited from:
IterableOps
def unapply(a: Int): Option[B]
Inherited from:
PartialFunction
def unzip[A1, A2](implicit asPair: LocalDate => (A1, A2)): (CC[A1], CC[A2])
Inherited from:
IterableOps
def unzip3[A1, A2, A3](implicit asTriple: LocalDate => (A1, A2, A3)): (CC[A1], CC[A2], CC[A3])
Inherited from:
IterableOps
def updated[B >: LocalDate](index: Int, elem: B): CC[B]
Inherited from:
SeqOps
override def view: SeqView[A]
Definition Classes
SeqOps -> IterableOps
Inherited from:
SeqOps
def withFilter(p: LocalDate => Boolean): WithFilter[A, CC]
Inherited from:
IterableOps
def zip[B](that: IterableOnce[B]): CC[(A, B)]
Inherited from:
IterableOps
def zipAll[A1 >: LocalDate, B](that: Iterable[B], thisElem: A1, thatElem: B): CC[(A1, B)]
Inherited from:
IterableOps
def zipWithIndex: CC[(A, Int)]
Inherited from:
IterableOps

Deprecated and Inherited methods

final def /:[B](z: B)(op: (B, LocalDate) => B): B
Deprecated
[Since version 2.13.0] Use foldLeft instead of /:
Inherited from:
IterableOnceOps
final def :\[B](z: B)(op: (LocalDate, B) => B): B
Deprecated
[Since version 2.13.0] Use foldRight instead of :\\
Inherited from:
IterableOnceOps
def aggregate[B](z: => B)(seqop: (B, LocalDate) => B, combop: (B, B) => B): B
Deprecated
[Since version 2.13.0] `aggregate` is not relevant for sequential collections. Use `foldLeft(z)(seqop)` instead.
Inherited from:
IterableOnceOps
def companion: IterableFactory[CC]
Deprecated
[Since version 2.13.0] Use iterableFactory instead
Inherited from:
IterableOps
final def copyToBuffer[B >: LocalDate](dest: Buffer[B]): Unit
Deprecated
[Since version 2.13.0] Use `dest ++= coll` instead
Inherited from:
IterableOnceOps
def hasDefiniteSize: Boolean
Deprecated
[Since version 2.13.0] Check .knownSize instead of .hasDefiniteSize for more actionable information (see scaladoc for details)
Inherited from:
IterableOnceOps
final def prefixLength(p: LocalDate => Boolean): Int
Deprecated
[Since version 2.13.0] Use segmentLength instead of prefixLength
Inherited from:
SeqOps
final def repr: C
Deprecated
[Since version 2.13.0] Use coll instead of repr in a collection implementation, use the collection value itself from the outside
Inherited from:
IterableOps
def reverseMap[B](f: LocalDate => B): CC[B]
Deprecated
[Since version 2.13.0] Use .reverseIterator.map(f).to(...) instead of .reverseMap(f)
Inherited from:
SeqOps
def seq: Iterable.this.type
Deprecated
[Since version 2.13.0] Iterable.seq always returns the iterable itself
Inherited from:
Iterable
final def toIterable: Iterable.this.type
Deprecated
[Since version 2.13.7] toIterable is internal and will be made protected; its name is similar to `toList` or `toSeq`, but it doesn\'t copy non-immutable collections
Inherited from:
Iterable
final def toIterator: Iterator[A]
Deprecated
[Since version 2.13.0] Use .iterator instead of .toIterator
Inherited from:
IterableOnceOps
final def toStream: Stream[A]
Deprecated
[Since version 2.13.0] Use .to(LazyList) instead of .toStream
Inherited from:
IterableOnceOps
final def toTraversable: Iterable[A]
Deprecated
[Since version 2.13.0] toTraversable is internal and will be made protected; its name is similar to `toList` or `toSeq`, but it doesn\'t copy non-immutable collections
Inherited from:
IterableOps
final def union[B >: LocalDate](that: Seq[B]): CC[B]
Deprecated
[Since version 2.13.0] Use `concat` instead
Inherited from:
SeqOps
def view(from: Int, until: Int): View[A]
Deprecated
[Since version 2.13.0] Use .view.slice(from, until) instead of .view(from, until)
Inherited from:
IterableOps