GenericRules

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. implicit def arrayR[I, O](implicit arg0: ClassTag[O], r: RuleLike[I, O]): Rule[Seq[I], Array[O]]

   

   lift a Rule[I, O] to a Rule of Rule[Seq[I], Array[O]]

   lift a Rule[I, O] to a Rule of Rule[Seq[I], Array[O]]

   (Path \ "foo").read(array(notEmpty)) // create a Rules validating that an Array contains non-empty Strings

   r

   A Rule[I, O] to lift

   returns

   A new Rule

5. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

6. def checked[I](implicit b: RuleLike[I, Boolean]): Rule[I, Boolean]

   

   A Rule for HTML checkboxes

7. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

8. def email: Rule[String, String]

   

   Validate that a String is a valid email

   Validate that a String is a valid email

   (Path \ "email").read(email) // This String is an email

9. final def eq(arg0: AnyRef): Boolean

   

   Definition Classes

   AnyRef

10. def equalTo[T](t: T): Rule[T, T]

    

    Create a Rule of equality

    Create a Rule of equality

    (Path \ "foo").read(equalTo("bar"))

11. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

12. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

13. final def getClass(): Class[_]

    

    Definition Classes

    AnyRef → Any

14. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

15. def ignored[I, O](o: O): (Path) ⇒ Rule[I, O]

    

    Create a "constant" Rule which is always a success returning value o (Path \ "x").read(ignored(42))

16. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

17. implicit def listR[I, O](implicit r: RuleLike[I, O]): Rule[Seq[I], List[O]]

    

    lift a Rule[I, O] to a Rule of Rule[Seq[I], List[O]]

    lift a Rule[I, O] to a Rule of Rule[Seq[I], List[O]]

    (Path \ "foo").read(list(notEmpty)) // create a Rules validating that an List contains non-empty Strings

    r

    A Rule[I, O] to lift

    returns

    A new Rule

18. def max[T](m: T)(implicit o: Ordering[T]): Rule[T, T]

    

    (Path \ "foo").read(max(0)) // validate that there's a negative int at (Path \ "foo")

19. def maxLength(l: Int): Rule[String, String]

    

    (Path \ "foo").read(maxLength(5)) // The length of this String must be <= 5

20. def min[T](m: T)(implicit o: Ordering[T]): Rule[T, T]

    

    (Path \ "foo").read(min(0)) // validate that there's a positive int at (Path \ "foo")

21. def minLength(l: Int): Rule[String, String]

    

    (Path \ "foo").read(minLength(5)) // The length of this String must be >= 5

22. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

23. def noConstraint[F]: Constraint[F]

    

    A Rule that always succeed

24. def not[I, O](r: RuleLike[I, O]): Rule[I, I]

    

25. def notEmpty: Rule[String, String]

    

    a Rule validating that a String is not empty.

    a Rule validating that a String is not empty.

    Note

    This Rule does NOT trim the String beforehand

    (Path \ "foo").read(notEmpty)

26. final def notify(): Unit

    

    Definition Classes

    AnyRef

27. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

28. def pattern(regex: Regex): Rule[String, String]

    

    Validate that a String matches the provided regex

    Validate that a String matches the provided regex

    (Path \ "foo").read(pattern("[a-z]".r)) // This String contains only letters

29. implicit def seqR[I, O](implicit r: RuleLike[I, O]): Rule[Seq[I], Seq[O]]

    

    lift a Rule[I, O] to a Rule of Rule[Seq[I], Seq[O]]

    lift a Rule[I, O] to a Rule of Rule[Seq[I], Seq[O]]

    (Path \ "foo").read(seq(notEmpty)) // create a Rules validating that an Seq contains non-empty Strings

    r

    A Rule[I, O] to lift

    returns

    A new Rule

30. implicit def setR[I, O](implicit r: RuleLike[I, O]): Rule[Seq[I], Set[O]]

    

    lift a Rule[I, O] to a Rule of Rule[Seq[I], Set[O]]

    lift a Rule[I, O] to a Rule of Rule[Seq[I], Set[O]]

    (Path \ "foo").read(set(notEmpty)) // create a Rules validating that a Set contains non-empty Strings

    r

    A Rule[I, O] to lift

    returns

    A new Rule

31. final def synchronized[T0](arg0: ⇒ T0): T0

    

    Definition Classes

    AnyRef

32. def toString(): String

    

    Definition Classes

    AnyRef → Any

33. implicit def traversableR[I, O](implicit r: RuleLike[I, O]): Rule[Seq[I], Traversable[O]]

    

    lift a Rule[I, O] to a Rule of Rule[Seq[I], Traversable[O]]

    lift a Rule[I, O] to a Rule of Rule[Seq[I], Traversable[O]]

    (Path \ "foo").read(traversable(notEmpty)) // create a Rules validating that an Traversable contains non-empty Strings

    r

    A Rule[I, O] to lift

    returns

    A new Rule

34. object unsafeImplicits

    

35. def validateWith[I](msg: String, args: Any*)(pred: (I) ⇒ Boolean): Rule[I, I]

    

    Create a new constraint, verifying that the provided predicate is satisfied.

    Create a new constraint, verifying that the provided predicate is satisfied.

    def notEmpty = validateWith[String]("validation.nonemptytext"){ !_.isEmpty }

    msg

    The error message to return if predicate pred is not satisfied

    args

    Arguments for the ValidationError

    pred

    A predicate to satify

    returns

    A new Rule validating data of type I against a predicate p

36. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

37. final def wait(arg0: Long, arg1: Int): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

38. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )