Class

com.codahale.jerkson.util.scalax.rules.Rules

DefaultRule

Related Doc: package Rules

Permalink

class DefaultRule[In, Out, A, X] extends Rule[In, Out, A, X]

Linear Supertypes
Rule[In, Out, A, X], (In) ⇒ Result[Out, A, X], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. DefaultRule
  2. Rule
  3. Function1
  4. AnyRef
  5. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new DefaultRule(f: (In) ⇒ Result[Out, A, X])

    Permalink

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  2. def !^[Y](fx2y: (X) ⇒ Y): Rule[In, Out, A, Y]

    Permalink

    Maps an Error

    Maps an Error

    Definition Classes
    Rule

  3. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  4. def -[In2 <: In](exclude: ⇒ Rule[In2, Any, Any, Any]): Rule[In2, Out, A, X]

    Permalink
    Definition Classes
    Rule

  5. def -^[B](b: B): Rule[In, Out, B, X]

    Permalink
    Definition Classes
    Rule

  6. def -~[Out2, B, X2 >: X](next: ⇒ Rule[Out, Out2, B, X2]): Rule[In, Out2, B, X2]

    Permalink
    Definition Classes
    Rule

  7. def -~![Out2, B, X2 >: X](next: ⇒ Rule[Out, Out2, B, X2]): Rule[In, Out2, B, Any]

    Permalink
    Definition Classes
    Rule

  8. def <~:[InPrev, B, X2 >: X](prev: ⇒ Rule[InPrev, In, (A) ⇒ B, X2]): Rule[InPrev, Out, B, X2]

    Permalink

    Apply the result of this rule to the function returned by the previous rule

    Apply the result of this rule to the function returned by the previous rule

    Definition Classes
    Rule

  9. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  10. def >->[Out2, B, X2 >: X](fa2resultb: (A) ⇒ Result[Out2, B, X2]): Rule[In, Out2, B, X2]

    Permalink
    Definition Classes
    Rule

  11. def >>[Out2, B, X2 >: X](fa2ruleb: (A) ⇒ (Out) ⇒ Result[Out2, B, X2]): Rule[In, Out2, B, X2]

    Permalink
    Definition Classes
    Rule

  12. def >>&[B, X2 >: X](fa2ruleb: (A) ⇒ (Out) ⇒ Result[Any, B, X2]): Rule[In, Out, B, X2]

    Permalink
    Definition Classes
    Rule

  13. def >>?[Out2, B, X2 >: X](pf: PartialFunction[A, Rule[Out, Out2, B, X2]]): Rule[In, Out2, B, X2]

    Permalink
    Definition Classes
    Rule

  14. def >~>[Out2, B1, B2, B >: A, C, X2 >: X](f: (B1, B2) ⇒ (Out) ⇒ Result[Out2, C, X2])(implicit arg0: (B) ⇒ ~[B1, B2]): Rule[In, Out2, C, X2]

    Permalink

    >~>(f) is equivalent to >> { case b1 ~ b2 => f(b1, b2) }

    >~>(f) is equivalent to >> { case b1 ~ b2 => f(b1, b2) }

    Definition Classes
    Rule

  15. def ??(pf: PartialFunction[A, Any]): Rule[In, Out, A, X]

    Permalink
    Definition Classes
    Rule

  16. def ^-^[B1, B2 >: A, C](f: (B1, B2) ⇒ C): Rule[In, Out, (B1) ⇒ C, X]

    Permalink

    -(f) is equivalent to ^^ { b2 => b1 => f(b1, b2) }

    -(f) is equivalent to ^^ { b2 => b1 => f(b1, b2) }

    Definition Classes
    Rule

  17. def ^^[B](fa2b: (A) ⇒ B): Rule[In, Out, B, X]

    Permalink
    Definition Classes
    Rule

  18. def ^^?[B](pf: PartialFunction[A, B]): Rule[In, Out, B, X]

    Permalink
    Definition Classes
    Rule

  19. def ^~>~^[B1, B2, B3, B >: A, C](f: (B1, B2, B3) ⇒ C)(implicit arg0: (B) ⇒ ~[B2, B3]): Rule[In, Out, (B1) ⇒ C, X]

    Permalink

    ~>~(f) is equivalent to ^^ { case b2 ~ b3 => b1 => f(b1, b2, b3) }

    ~>~(f) is equivalent to ^^ { case b2 ~ b3 => b1 => f(b1, b2, b3) }

    Definition Classes
    Rule

  20. def ^~^[B1, B2, B >: A, C](f: (B1, B2) ⇒ C)(implicit arg0: (B) ⇒ ~[B1, B2]): Rule[In, Out, C, X]

    Permalink

    ~(f) is equivalent to ^^ { case b1 ~ b2 => f(b1, b2) }

    ~(f) is equivalent to ^^ { case b1 ~ b2 => f(b1, b2) }

    Definition Classes
    Rule

  21. def ^~~^[B1, B2, B3, B >: A, C](f: (B1, B2, B3) ⇒ C)(implicit arg0: (B) ⇒ ~[~[B1, B2], B3]): Rule[In, Out, C, X]

    Permalink

    ~~(f) is equivalent to ^^ { case b1 ~ b2 ~ b3 => f(b1, b2, b3) }

    ~~(f) is equivalent to ^^ { case b1 ~ b2 ~ b3 => f(b1, b2, b3) }

    Definition Classes
    Rule

  22. def ^~~~^[B1, B2, B3, B4, B >: A, C](f: (B1, B2, B3, B4) ⇒ C)(implicit arg0: (B) ⇒ ~[~[~[B1, B2], B3], B4]): Rule[In, Out, C, X]

    Permalink

    ~~~(f) is equivalent to ^^ { case b1 ~ b2 ~ b3 ~ b4 => f(b1, b2, b3, b4) }

    ~~~(f) is equivalent to ^^ { case b1 ~ b2 ~ b3 ~ b4 => f(b1, b2, b3, b4) }

    Definition Classes
    Rule

  23. def ^~~~~^[B1, B2, B3, B4, B5, B >: A, C](f: (B1, B2, B3, B4, B5) ⇒ C)(implicit arg0: (B) ⇒ ~[~[~[~[B1, B2], B3], B4], B5]): Rule[In, Out, C, X]

    Permalink

    ~~~~(f) is equivalent to ^^ { case b1 ~ b2 ~ b3 ~ b4 ~ b5 => f(b1, b2, b3, b4, b5) }

    ~~~~(f) is equivalent to ^^ { case b1 ~ b2 ~ b3 ~ b4 ~ b5 => f(b1, b2, b3, b4, b5) }

    Definition Classes
    Rule

  24. def ^~~~~~^[B1, B2, B3, B4, B5, B6, B >: A, C](f: (B1, B2, B3, B4, B5, B6) ⇒ C)(implicit arg0: (B) ⇒ ~[~[~[~[~[B1, B2], B3], B4], B5], B6]): Rule[In, Out, C, X]

    Permalink

    ~~~~~(f) is equivalent to ^^ { case b1 ~ b2 ~ b3 ~ b4 ~ b5 ~ b6 => f(b1, b2, b3, b4, b5, b6) }

    ~~~~~(f) is equivalent to ^^ { case b1 ~ b2 ~ b3 ~ b4 ~ b5 ~ b6 => f(b1, b2, b3, b4, b5, b6) }

    Definition Classes
    Rule

  25. def ^~~~~~~^[B1, B2, B3, B4, B5, B6, B7, B >: A, C](f: (B1, B2, B3, B4, B5, B6, B7) ⇒ C)(implicit arg0: (B) ⇒ ~[~[~[~[~[~[B1, B2], B3], B4], B5], B6], B7]): Rule[In, Out, C, X]

    Permalink

    ~~~~~~(f) is equivalent to ^^ { case b1 ~ b2 ~ b3 ~ b4 ~ b5 ~ b6 => f(b1, b2, b3, b4, b5, b6) }

    ~~~~~~(f) is equivalent to ^^ { case b1 ~ b2 ~ b3 ~ b4 ~ b5 ~ b6 => f(b1, b2, b3, b4, b5, b6) }

    Definition Classes
    Rule

  26. def andThen[A](g: (Result[Out, A, X]) ⇒ A): (In) ⇒ A

    Permalink
    Definition Classes
    Function1
    Annotations
    @unspecialized()

  27. def apply(in: In): Result[Out, A, X]

    Permalink
    Definition Classes
    DefaultRule → Function1

  28. def as(name: String): Rule[In, Out, A, X] with Name

    Permalink
    Definition Classes
    Rule

  29. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  30. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  31. def compose[A](g: (A) ⇒ In): (A) ⇒ Result[Out, A, X]

    Permalink
    Definition Classes
    Function1
    Annotations
    @unspecialized()

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

    Permalink
    Definition Classes
    AnyRef

  33. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  34. val factory: Rules

    Permalink
    Definition Classes
    DefaultRule → Rule

  35. def filter(f: (A) ⇒ Boolean): Rule[In, Out, A, X]

    Permalink
    Definition Classes
    Rule

  36. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  37. def flatMap[Out2, B, X2 >: X](fa2ruleb: (A) ⇒ (Out) ⇒ Result[Out2, B, X2]): Rule[In, Out2, B, X2]

    Permalink
    Definition Classes
    Rule

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

    Permalink
    Definition Classes
    AnyRef → Any

  39. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  40. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  41. def map[B](fa2b: (A) ⇒ B): Rule[In, Out, B, X]

    Permalink
    Definition Classes
    Rule

  42. def mapResult[Out2, B, Y](f: (Result[Out, A, X]) ⇒ Result[Out2, B, Y]): Rule[In, Out2, B, Y]

    Permalink
    Definition Classes
    Rule

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

    Permalink
    Definition Classes
    AnyRef

  44. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  45. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  46. def orElse[In2 <: In, Out2 >: Out, A2 >: A, X2 >: X](other: ⇒ Rule[In2, Out2, A2, X2]): Rule[In2, Out2, A2, X2]

    Permalink
    Definition Classes
    Rule

  47. def orError[In2 <: In]: Rule[In2, Out, A, Any]

    Permalink
    Definition Classes
    Rule

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

    Permalink
    Definition Classes
    AnyRef

  49. def toString(): String

    Permalink
    Definition Classes
    Function1 → AnyRef → Any

  50. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  53. def |[In2 <: In, Out2 >: Out, A2 >: A, X2 >: X](other: ⇒ Rule[In2, Out2, A2, X2]): Rule[In2, Out2, A2, X2]

    Permalink
    Definition Classes
    Rule

  54. def ~[Out2, B, X2 >: X](next: ⇒ Rule[Out, Out2, B, X2]): Rule[In, Out2, ~[A, B], X2]

    Permalink
    Definition Classes
    Rule

  55. def ~![Out2, B, X2 >: X](next: ⇒ Rule[Out, Out2, B, X2]): Rule[In, Out2, ~[A, B], Any]

    Permalink
    Definition Classes
    Rule

  56. def ~++[Out2, B >: A, X2 >: X](next: ⇒ Rule[Out, Out2, Seq[B], X2]): Rule[In, Out2, List[B], X2]

    Permalink
    Definition Classes
    Rule

  57. def ~-[Out2, B, X2 >: X](next: ⇒ Rule[Out, Out2, B, X2]): Rule[In, Out2, A, X2]

    Permalink
    Definition Classes
    Rule

  58. def ~-![Out2, B, X2 >: X](next: ⇒ Rule[Out, Out2, B, X2]): Rule[In, Out2, A, Any]

    Permalink
    Definition Classes
    Rule

  59. def ~>[Out2, B, X2 >: X](next: ⇒ Rule[Out, Out2, (A) ⇒ B, X2]): Rule[In, Out2, B, X2]

    Permalink

    Apply the result of this rule to the function returned by the next rule

    Apply the result of this rule to the function returned by the next rule

    Definition Classes
    Rule

Inherited from Rule[In, Out, A, X]

Inherited from (In) ⇒ Result[Out, A, X]

Inherited from AnyRef

Inherited from Any

Ungrouped