Type Members
-
implicit
class
AnyRuleOps[A] extends AnyRef
-
implicit
class
Rule1Ops[A] extends AnyRef
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
def
apply[A]: Rule[A, A]
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
containedIn[A](values: Seq[A], messages: Messages): Rule[A, A]
-
def
containedIn[A](values: Seq[A]): Rule[A, A]
-
final
def
eq(arg0: AnyRef): Boolean
-
def
eql[A](comp: A, messages: Messages): Rule[A, A]
-
def
eql[A](comp: A): Rule[A, A]
-
def
equals(arg0: Any): Boolean
-
def
fail[A](messages: Messages): Rule[A, A]
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
gt[A](comp: A, messages: Messages)(implicit ord: Ordering[_ >: A]): Rule[A, A]
-
def
gt[A](comp: A)(implicit ord: Ordering[A]): Rule[A, A]
-
def
gte[A](comp: A, messages: Messages)(implicit ord: Ordering[_ >: A]): Rule[A, A]
-
def
gte[A](comp: A)(implicit ord: Ordering[_ >: A]): Rule[A, A]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
lengthGt[S](comp: Int, messages: Messages)(implicit arg0: (S) ⇒ Seq[_]): Rule[S, S]
-
def
lengthGt[S](comp: Int)(implicit arg0: (S) ⇒ Seq[_]): Rule[S, S]
-
def
lengthGte[S](comp: Int, messages: Messages)(implicit arg0: (S) ⇒ Seq[_]): Rule[S, S]
-
def
lengthGte[S](comp: Int)(implicit arg0: (S) ⇒ Seq[_]): Rule[S, S]
-
def
lengthLt[S](comp: Int, messages: Messages)(implicit arg0: (S) ⇒ Seq[_]): Rule[S, S]
-
def
lengthLt[S](comp: Int)(implicit arg0: (S) ⇒ Seq[_]): Rule[S, S]
-
def
lengthLte[S](comp: Int, messages: Messages)(implicit arg0: (S) ⇒ Seq[_]): Rule[S, S]
-
def
lengthLte[S](comp: Int)(implicit arg0: (S) ⇒ Seq[_]): Rule[S, S]
-
def
lt[A](comp: A, messages: Messages)(implicit ord: Ordering[_ >: A]): Rule[A, A]
-
def
lt[A](comp: A)(implicit ord: Ordering[_ >: A]): Rule[A, A]
-
def
lte[A](comp: A, messages: Messages)(implicit ord: Ordering[_ >: A]): Rule[A, A]
-
def
lte[A](comp: A)(implicit ord: Ordering[_ >: A]): Rule[A, A]
-
def
mapValue[A, B](key: A, messages: Messages)(implicit arg0: PathPrefix[A]): Rule[Map[A, B], B]
-
def
mapValue[A, B](key: A)(implicit arg0: PathPrefix[A]): Rule[Map[A, B], B]
-
def
mapValues[A, B, C](rule: Rule[B, C])(implicit arg0: PathPrefix[A]): Rule[Map[A, B], Map[A, C]]
-
def
matchesRegex(regex: Regex, messages: Messages): Rule[String, String]
-
def
matchesRegex(regex: Regex): Rule[String, String]
-
final
def
ne(arg0: AnyRef): Boolean
-
def
neq[A](comp: A, messages: Messages): Rule[A, A]
-
def
neq[A](comp: A): Rule[A, A]
-
def
nonEmpty[S](messages: Messages)(implicit arg0: (S) ⇒ Seq[_]): Rule[S, S]
-
def
nonEmpty[S](implicit arg0: (S) ⇒ Seq[_]): Rule[S, S]
-
def
notContainedIn[A](values: Seq[A], messages: Messages): Rule[A, A]
-
def
notContainedIn[A](values: Seq[A]): Rule[A, A]
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
optional[A, B](rule: Rule[A, B]): Rule[Option[A], Option[B]]
-
def
parseDouble(messages: Messages): Rule[String, Double]
-
val
parseDouble: Rule[String, Double]
-
def
parseInt(messages: Messages): Rule[String, Int]
-
val
parseInt: Rule[String, Int]
-
def
pass[A]: Rule[A, A]
-
def
pure[A, B](func: (A) ⇒ Checked[B]): Rule[A, B]
-
def
required[A, B](rule: Rule[A, B], messages: Messages): Rule[Option[A], B]
-
def
required[A, B](rule: Rule[A, B]): Rule[Option[A], B]
-
implicit
def
ruleApplicative[A]: Applicative[[β$0$]Rule[A, β$0$]]
-
def
sequence[S[_], A, B](rule: Rule[A, B])(implicit arg0: Indexable[S], arg1: Traverse[S]): Rule[S[A], S[B]]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
test[A](messages: ⇒ Messages)(func: (A) ⇒ Boolean): Rule[A, A]
-
def
toString(): String
-
val
trimString: Rule[String, String]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from AnyRef
Inherited from Any
