core/com.babylonhealth.lit.core/NonEmptyLitSeq

NonEmptyLitSeq

class NonEmptyLitSeq[+T] extends LitSeq[T]
class LitSeq[T]
trait List[T]
trait Collection[T]
trait Iterable[T]
trait PartialFunction[Int, T]
trait Int => T
trait IterableOps[T, LitSeq, LitSeq[T]]
trait IterableOnceOps[T, LitSeq, LitSeq[T]]
trait IterableOnce[T]
class Object
trait Matchable
class Any

Value members

Constructors

def this(initial: Collection[T])
def this(initial: Iterable[T])

Concrete methods

override def ++[T1 >: T](suffix: Iterable[T1]): NonEmptyLitSeq[T1]
Definition Classes
def ++[T1 >: T](suffix: LitSeq[T1]): NonEmptyLitSeq[T1]
override def asNonEmpty: NonEmptyLitSeq[T]
Definition Classes
def concat(nonEmpty: LitSeq[T]): NonEmptyLitSeq[T]
override def concat(that: Collection[T]): NonEmptyLitSeq[T]
Definition Classes
override def map[B](f: T => B): NonEmptyLitSeq[B]
Definition Classes
IterableOps -> IterableOnceOps
override def refine: NonEmptyLitSeq[T]
Definition Classes
def zip[B](that: NonEmptyLitSeq[B]): NonEmptyLitSeq[(T, B)]

Inherited methods

def ++[T1 >: T](suffix: NonEmptyLitSeq[T1]): NonEmptyLitSeq[T1]
Inherited from:
LitSeq
final def ++[B >: T](suffix: IterableOnce[B]): CC[B]
Inherited from:
IterableOps
def +:[T1 >: T](elem: T1): NonEmptyLitSeq[T1]
Inherited from:
LitSeq
def :+[T1 >: T](elem: T1): NonEmptyLitSeq[T1]
Inherited from:
LitSeq
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[T, C]): PartialFunction[A, C]
Inherited from:
PartialFunction
override def andThen[C](k: T => C): PartialFunction[A, C]
Definition Classes
PartialFunction -> Function1
Inherited from:
PartialFunction
def append(elem: T): NonEmptyLitSeq[T]
Inherited from:
LitSeq
def apply(i: Int): T
Inherited from:
LitSeq
def applyOrElse[A1 <: Int, B1 >: T](x: A1, default: A1 => B1): B1
Inherited from:
PartialFunction
def collect[B](pf: PartialFunction[T, B]): CC[B]
Inherited from:
IterableOps
def collectFirst[B](pf: PartialFunction[T, B]): Option[B]
Inherited from:
IterableOnceOps
def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, B]
Inherited from:
PartialFunction
def compose[A](g: A => Int): A => R
Inherited from:
Function1
def concat(nonEmpty: NonEmptyLitSeq[T]): NonEmptyLitSeq[T]
Inherited from:
LitSeq
def concat[B >: T](suffix: IterableOnce[B]): CC[B]
Inherited from:
IterableOps
override def contains(o: Object): Boolean
Definition Classes
LitSeq -> List -> Collection
Inherited from:
LitSeq
override def containsAll(collection: Collection[_]): Boolean
Definition Classes
LitSeq -> List -> Collection
Inherited from:
LitSeq
def copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Int
Inherited from:
IterableOnceOps
def copyToArray[B >: T](xs: Array[B], start: Int): Int
Inherited from:
IterableOnceOps
def copyToArray[B >: T](xs: Array[B]): Int
Inherited from:
IterableOnceOps
def corresponds[B](that: Seq[B])(p: (T, B) => Boolean): Boolean
Inherited from:
LitSeq
def corresponds[B](that: IterableOnce[B])(p: (T, B) => Boolean): Boolean
Inherited from:
IterableOnceOps
def count(p: T => Boolean): Int
Inherited from:
IterableOnceOps
def distinct: LitSeq[T]
Inherited from:
LitSeq
def distinctBy[B](f: T => B): LitSeq[T]
Inherited from:
LitSeq
def drop(n: Int): C
Inherited from:
IterableOps
def dropRight(n: Int): C
Inherited from:
IterableOps
def dropWhile(p: T => Boolean): C
Inherited from:
IterableOps
def elementWise: ElementWiseExtractor[A, B]
Inherited from:
PartialFunction
def empty: C
Inherited from:
IterableOps
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
LitSeq -> List -> Collection -> Any
Inherited from:
LitSeq
def exists(p: T => Boolean): Boolean
Inherited from:
IterableOnceOps
def filter(pred: T => Boolean): C
Inherited from:
IterableOps
def filterNot(pred: T => Boolean): C
Inherited from:
IterableOps
def find(p: T => Boolean): Option[A]
Inherited from:
IterableOnceOps
def flatMap[B](f: T => IterableOnce[B]): CC[B]
Inherited from:
IterableOps
def flatten[B](implicit asIterable: T => IterableOnce[B]): CC[B]
Inherited from:
IterableOps
def fold[A1 >: T](z: A1)(op: (A1, A1) => A1): A1
Inherited from:
IterableOnceOps
def foldLeft[B](z: B)(op: (B, T) => B): B
Inherited from:
IterableOnceOps
def foldRight[B](z: B)(op: (T, B) => B): B
Inherited from:
IterableOnceOps
def forEach(x$0: Consumer[_ >: T <: <FromJavaObject>]): Unit
Inherited from:
Iterable
def forall(p: T => Boolean): Boolean
Inherited from:
IterableOnceOps
def foreach[U](f: T => U): Unit
Inherited from:
IterableOnceOps
def get(i: Int): T
Inherited from:
LitSeq
def groupBy[K](f: T => K): Map[K, C]
Inherited from:
IterableOps
def groupMap[K, B](key: T => K)(f: T => B): Map[K, CC[B]]
Inherited from:
IterableOps
def groupMapReduce[K, B](key: T => K)(f: T => 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
LitSeq -> List -> Collection -> Any
Inherited from:
LitSeq
def head: A
Inherited from:
IterableOps
def headOption: Option[A]
Inherited from:
IterableOps
def indexOf(x: Object): Int
Inherited from:
LitSeq
def init: C
Inherited from:
IterableOps
def inits: Iterator[C]
Inherited from:
IterableOps
def isDefinedAt(x: Int): Boolean
Inherited from:
LitSeq
def isEmpty: Boolean
Inherited from:
IterableOnceOps
override def isTraversableAgain: Boolean
Definition Classes
IterableOps -> IterableOnceOps
Inherited from:
IterableOps
def iterableFactory: IterableFactory[LitSeq]
Inherited from:
LitSeq
override def iterator(): LitSeqIterator[T]
Definition Classes
LitSeq -> List -> Collection -> Iterable -> IterableOnce
Inherited from:
LitSeq
def knownSize: Int
Inherited from:
IterableOnce
def last: A
Inherited from:
IterableOps
def lastIndexOf(x: Object): Int
Inherited from:
LitSeq
def lastOption: Option[A]
Inherited from:
IterableOps
def length: Int
Inherited from:
LitSeq
def lift: A => Option[B]
Inherited from:
PartialFunction
def listIterator(): LitSeqIterator[T]
Inherited from:
LitSeq
def listIterator(index: Int): LitSeqIterator[T]
Inherited from:
LitSeq
def max[B >: T](implicit ord: Ordering[B]): A
Inherited from:
IterableOnceOps
def maxBy[B](f: T => B)(implicit cmp: Ordering[B]): A
Inherited from:
IterableOnceOps
def maxByOption[B](f: T => B)(implicit cmp: Ordering[B]): Option[A]
Inherited from:
IterableOnceOps
def maxOption[B >: T](implicit ord: Ordering[B]): Option[A]
Inherited from:
IterableOnceOps
def min[B >: T](implicit ord: Ordering[B]): A
Inherited from:
IterableOnceOps
def minBy[B](f: T => B)(implicit cmp: Ordering[B]): A
Inherited from:
IterableOnceOps
def minByOption[B](f: T => B)(implicit cmp: Ordering[B]): Option[A]
Inherited from:
IterableOnceOps
def minOption[B >: T](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
def nonEmpty: Boolean
Inherited from:
IterableOnceOps
def orElse[A1 <: Int, B1 >: T](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
Inherited from:
PartialFunction
def parallelStream(): Stream[E]
Inherited from:
Collection
def partition(p: T => Boolean): (C, C)
Inherited from:
IterableOps
def partitionMap[A1, A2](f: T => Either[A1, A2]): (CC[A1], CC[A2])
Inherited from:
IterableOps
def prepend(elem: T): NonEmptyLitSeq[T]
Inherited from:
LitSeq
def product[B >: T](implicit num: Numeric[B]): B
Inherited from:
IterableOnceOps
def reduce[B >: T](op: (B, B) => B): B
Inherited from:
IterableOnceOps
def reduceLeft[B >: T](op: (B, T) => B): B
Inherited from:
IterableOnceOps
def reduceLeftOption[B >: T](op: (B, T) => B): Option[B]
Inherited from:
IterableOnceOps
def reduceOption[B >: T](op: (B, B) => B): Option[B]
Inherited from:
IterableOnceOps
def reduceRight[B >: T](op: (T, B) => B): B
Inherited from:
IterableOnceOps
def reduceRightOption[B >: T](op: (T, B) => B): Option[B]
Inherited from:
IterableOnceOps
def removeIf(x$0: Predicate[_ >: T <: <FromJavaObject>]): Boolean
Inherited from:
Collection
def replaceAll(x$0: UnaryOperator[T]): Unit
Inherited from:
List
def reverse: LitSeq[T]
Inherited from:
LitSeq
protected def reversed: Iterable[A]
Inherited from:
IterableOnceOps
def runWith[U](action: T => U): A => Boolean
Inherited from:
PartialFunction
def scan[B >: T](z: B)(op: (B, B) => B): CC[B]
Inherited from:
IterableOps
def scanLeft[B](z: B)(op: (B, T) => B): CC[B]
Inherited from:
IterableOps
def scanRight[B](z: B)(op: (T, B) => B): CC[B]
Inherited from:
IterableOps
def size: Int
Inherited from:
IterableOnceOps
def sizeCompare(that: Iterable[_]): Int
Inherited from:
IterableOps
def sizeCompare(otherSize: Int): Int
Inherited from:
IterableOps
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 sort(x$0: Comparator[_ >: T <: <FromJavaObject>]): Unit
Inherited from:
List
def sortBy[B](f: T => B)(implicit ord: Ordering[B]): LitSeq[T]
Inherited from:
LitSeq
def sortWith(lt: (T, T) => Boolean): LitSeq[T]
Inherited from:
LitSeq
def sorted[B >: T](implicit ord: Ordering[B]): LitSeq[T]
Inherited from:
LitSeq
def span(p: T => Boolean): (C, C)
Inherited from:
IterableOps
override def splitAt(n: Int): (C, C)
Definition Classes
IterableOps -> IterableOnceOps
Inherited from:
IterableOps
def spliterator(): Spliterator[E]
Inherited from:
List
def stepper[S <: Stepper[_]](implicit shape: StepperShape[T, S]): S
Inherited from:
IterableOnce
def stream(): Stream[E]
Inherited from:
Collection
def subList(from: Int, until: Int): LitSeq[T]
Inherited from:
LitSeq
def sum[B >: T](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: T => Boolean): C
Inherited from:
IterableOps
override def tapEach[U](f: T => U): C
Definition Classes
IterableOps -> IterableOnceOps
Inherited from:
IterableOps
def to[C1](factory: Factory[T, C1]): C1
Inherited from:
IterableOnceOps
override def toArray[T1](xs: Array[T1 & Object]): Array[T1 & Object]
Definition Classes
LitSeq -> List -> Collection
Inherited from:
LitSeq
override def toArray: Array[AnyRef]
Definition Classes
Inherited from:
LitSeq
def toArray[T <: <FromJavaObject>](x$0: IntFunction[Array[Object & T]]): Array[Object & T]
Inherited from:
Collection
def toArray[B >: T : ClassTag]: Array[B]
Inherited from:
IterableOnceOps
final def toBuffer[B >: T]: Buffer[B]
Inherited from:
IterableOnceOps
def toIndexedSeq: IndexedSeq[A]
Inherited from:
IterableOnceOps
def toIterable: Iterable[T]
Inherited from:
LitSeq
def toList: List[A]
Inherited from:
IterableOnceOps
def toMap[K, V](implicit ev: T <:< (K, V)): Map[K, V]
Inherited from:
IterableOnceOps
final override def toSeq: Seq[T]
Definition Classes
LitSeq -> IterableOnceOps
Inherited from:
LitSeq
def toSet[B >: T]: 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
LitSeq -> Function1 -> Any
Inherited from:
LitSeq
def toVector: Vector[A]
Inherited from:
IterableOnceOps
def transpose[B](implicit asIterable: T => Iterable[B]): CC[CC[B]]
Inherited from:
IterableOps
def unapply(a: Int): Option[B]
Inherited from:
PartialFunction
def unzip[A1, A2](implicit asPair: T => (A1, A2)): (CC[A1], CC[A2])
Inherited from:
IterableOps
def unzip3[A1, A2, A3](implicit asTriple: T => (A1, A2, A3)): (CC[A1], CC[A2], CC[A3])
Inherited from:
IterableOps
def view: View[A]
Inherited from:
IterableOps
def withFilter(p: T => Boolean): WithFilter[A, CC]
Inherited from:
IterableOps
def zip[B](that: IterableOnce[B]): CC[(A, B)]
Inherited from:
IterableOps
def zipAll[A1 >: T, 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

def ++:[B >: T](that: IterableOnce[B]): CC[B]
Deprecated
[Since version 2.13.0] Use ++ instead of ++: for collections of type Iterable
Inherited from:
IterableOps
final def /:[B](z: B)(op: (B, T) => B): B
Deprecated
[Since version 2.13.0] Use foldLeft instead of /:
Inherited from:
IterableOnceOps
final def :\[B](z: B)(op: (T, B) => B): B
Deprecated
[Since version 2.13.0] Use foldRight instead of :\\
Inherited from:
IterableOnceOps
def add(x$1: Int, x$2: T): Unit
Deprecated
Inherited from:
LitSeq
override def add(e: T): Boolean
Deprecated
Definition Classes
LitSeq -> List -> Collection
Inherited from:
LitSeq
def addAll(x$1: Int, x$2: Collection[_ <: T]): Boolean
Deprecated
Inherited from:
LitSeq
override def addAll(collection: Collection[_ <: T]): Boolean
Deprecated
Definition Classes
LitSeq -> List -> Collection
Inherited from:
LitSeq
def aggregate[B](z: => B)(seqop: (B, T) => 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
override def clear(): Unit
Deprecated
Definition Classes
LitSeq -> List -> Collection
Inherited from:
LitSeq
def companion: IterableFactory[CC]
Deprecated
[Since version 2.13.0] Use iterableFactory instead
Inherited from:
IterableOps
final def copyToBuffer[B >: T](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
def remove(x$1: Int): T
Deprecated
Inherited from:
LitSeq
override def remove(o: Any): Boolean
Deprecated
Definition Classes
LitSeq -> List -> Collection
Inherited from:
LitSeq
override def removeAll(collection: Collection[_]): Boolean
Deprecated
Definition Classes
LitSeq -> List -> Collection
Inherited from:
LitSeq
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
override def retainAll(collection: Collection[_]): Boolean
Deprecated
Definition Classes
LitSeq -> List -> Collection
Inherited from:
LitSeq
def set(x$1: Int, x$2: T): T
Deprecated
Inherited from:
LitSeq
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
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