Packages

o

eu.timepit.refined

collection

object collection extends CollectionValidate with CollectionInference

Module for collection predicates.

Source
collection.scala
Linear Supertypes
CollectionInference, CollectionValidate, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. collection
  2. CollectionInference
  3. CollectionValidate
  4. AnyRef
  5. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. type Contains[U] = Not[Forall[Not[Equal[U]]]]

    Predicate that checks if a Traversable contains a value equal to U.

  2. final case class Count [PA, PC](pa: PA, pc: PC) extends Product with Serializable

    Predicate that counts the number of elements in a Traversable which satisfy the predicate PA and passes the result to the numeric predicate PC.

  3. final case class Empty () extends Product with Serializable

    Predicate that checks if a Traversable is empty.

  4. type Exists[P] = Not[Forall[Not[P]]]

    Predicate that checks if the predicate P holds for some elements of a Traversable.

  5. final case class Forall [P](p: P) extends Product with Serializable

    Predicate that checks if the predicate P holds for all elements of a Traversable.

  6. final case class Head [P](p: P) extends Product with Serializable

    Predicate that checks if the predicate P holds for the first element of a Traversable.

  7. final case class Index [N, P](n: N, p: P) extends Product with Serializable

    Predicate that checks if the predicate P holds for the element at index N of a sequence.

  8. final case class Init [P](p: P) extends Product with Serializable

    Predicate that checks if the predicate P holds for all but the last element of a Traversable.

  9. final case class Last [P](p: P) extends Product with Serializable

    Predicate that checks if the predicate P holds for the last element of a Traversable.

  10. type MaxSize[N] = Size[LessEqual[N]]

    Predicate that checks if the size of a Traversable is less than or equal to N.

  11. type MinSize[N] = Size[GreaterEqual[N]]

    Predicate that checks if the size of a Traversable is greater than or equal to N.

  12. type NonEmpty = Not[Empty]

    Predicate that checks if a Traversable is not empty.

  13. final case class Size [P](p: P) extends Product with Serializable

    Predicate that checks if the size of a Traversable satisfies the predicate P.

  14. final case class Tail [P](p: P) extends Product with Serializable

    Predicate that checks if the predicate P holds for all but the first element of a Traversable.

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. implicit def countValidate[A, PA, RA, PC, RC, T](implicit va: Aux[A, PA, RA], vc: Aux[Int, PC, RC], ev: (T) ⇒ Traversable[A]): Aux[T, Count[PA, PC], Count[List[(va)#Res], (vc)#Res]]
    Definition Classes
    CollectionValidate
  7. implicit def emptyValidate[T](implicit ev: (T) ⇒ Traversable[_]): Plain[T, Empty]
    Definition Classes
    CollectionValidate
  8. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  9. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  10. implicit def existsInference[A, B](implicit p1: ==>[A, B]): ==>[Exists[A], Exists[B]]
    Definition Classes
    CollectionInference
  11. implicit def existsNonEmptyInference[P]: ==>[Exists[P], NonEmpty]
    Definition Classes
    CollectionInference
  12. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  13. implicit def forallValidate[A, P, R, T[a] <: Traversable[a]](implicit v: Aux[A, P, R]): Aux[T[A], Forall[P], Forall[List[(v)#Res]]]
    Definition Classes
    CollectionValidate
  14. implicit def forallValidateView[A, P, R, T](implicit v: Aux[A, P, R], ev: (T) ⇒ Traversable[A]): Aux[T, Forall[P], Forall[List[(v)#Res]]]
    Definition Classes
    CollectionValidate
  15. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  16. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  17. implicit def headExistsInference[P]: ==>[Head[P], Exists[P]]
    Definition Classes
    CollectionInference
  18. implicit def headInference[A, B](implicit p1: ==>[A, B]): ==>[Head[A], Head[B]]
    Definition Classes
    CollectionInference
  19. implicit def headValidate[A, P, R, T[a] <: Traversable[a]](implicit v: Aux[A, P, R]): Aux[T[A], Head[P], Head[Option[(v)#Res]]]
    Definition Classes
    CollectionValidate
  20. implicit def headValidateView[A, P, R, T](implicit v: Aux[A, P, R], ev: (T) ⇒ Traversable[A]): Aux[T, Head[P], Head[Option[(v)#Res]]]
    Definition Classes
    CollectionValidate
  21. implicit def indexExistsInference[N, P]: ==>[Index[N, P], Exists[P]]
    Definition Classes
    CollectionInference
  22. implicit def indexInference[N, A, B](implicit p1: ==>[A, B]): ==>[Index[N, A], Index[N, B]]
    Definition Classes
    CollectionInference
  23. implicit def indexValidate[A, P, R, N <: Int, T](implicit v: Aux[A, P, R], ev: (T) ⇒ PartialFunction[Int, A], wn: Aux[N]): Aux[T, Index[N, P], Index[N, Option[(v)#Res]]]
    Definition Classes
    CollectionValidate
  24. implicit def initValidate[A, P, R, T[a] <: Traversable[a]](implicit v: Aux[A, P, R]): Aux[T[A], Init[P], Init[List[(v)#Res]]]
    Definition Classes
    CollectionValidate
  25. implicit def initValidateView[A, P, R, T](implicit v: Aux[A, P, R], ev: (T) ⇒ Traversable[A]): Aux[T, Init[P], Init[List[(v)#Res]]]
    Definition Classes
    CollectionValidate
  26. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  27. implicit def lastExistsInference[P]: ==>[Last[P], Exists[P]]
    Definition Classes
    CollectionInference
  28. implicit def lastInference[A, B](implicit p1: ==>[A, B]): ==>[Last[A], Last[B]]
    Definition Classes
    CollectionInference
  29. implicit def lastValidate[A, P, R, T[a] <: Traversable[a]](implicit v: Aux[A, P, R]): Aux[T[A], Last[P], Last[Option[(v)#Res]]]
    Definition Classes
    CollectionValidate
  30. implicit def lastValidateView[A, P, R, T](implicit v: Aux[A, P, R], ev: (T) ⇒ Traversable[A]): Aux[T, Last[P], Last[Option[(v)#Res]]]
    Definition Classes
    CollectionValidate
  31. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  32. final def notify(): Unit
    Definition Classes
    AnyRef
  33. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  34. implicit def sizeInference[A, B](implicit p1: ==>[A, B]): ==>[Size[A], Size[B]]
    Definition Classes
    CollectionInference
  35. implicit def sizeValidate[T, P, RP](implicit v: Aux[Int, P, RP], ev: (T) ⇒ Traversable[_]): Aux[T, Size[P], Size[(v)#Res]]
    Definition Classes
    CollectionValidate
  36. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  37. implicit def tailValidate[A, P, R, T[a] <: Traversable[a]](implicit v: Aux[A, P, R]): Aux[T[A], Tail[P], Tail[List[(v)#Res]]]
    Definition Classes
    CollectionValidate
  38. implicit def tailValidateView[A, P, R, T](implicit v: Aux[A, P, R], ev: (T) ⇒ Traversable[A]): Aux[T, Tail[P], Tail[List[(v)#Res]]]
    Definition Classes
    CollectionValidate
  39. def toString(): String
    Definition Classes
    AnyRef → Any
  40. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  41. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  42. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from CollectionInference

Inherited from CollectionValidate

Inherited from AnyRef

Inherited from Any

Ungrouped