| OVERVIEW | PACKAGE | CONSTR | FIELDS | METHODS | FRAMES NO FRAMES | INHERITED |
class DefaultRule[In, Out, A, X](f : (In) => Result[Out, A, X])
extends
Rule[In, Out, A, X]
def this(f : (In) => Result[Out, A, X])
|
| factory |
val factory
|
Rules | |
| orError |
def orError
|
Rule[In, Out, A, Any] | Rule |
| != |
final def !=(arg0 : Object)
|
Boolean | AnyRef |
| != |
final def !=(arg0 : Any)
|
Boolean | Any |
| !^ |
def !^[Y](fx2y : (X) => Y)
Maps an Error
|
Rule[In, Out, A, Y] | Rule |
| - |
def -[In2 <: In](exclude : => Rule[In2, Any, Any, Any])
|
Rule[In2, Out, A, X] | Rule |
| -^ |
def -^[B](b : B)
|
Rule[In, Out, B, X] | Rule |
| -~ |
def -~[Out2, B, X2 >: X](next : => Rule[Out, Out2, B, X2])
|
Rule[In, Out2, B, X2] | Rule |
| -~! |
def -~
|
Rule[In, Out2, B, Any] | Rule |
| <~: |
def <~:[InPrev, B, X2 >: X](prev : => Rule[InPrev, In, (A) => B, X2])
Apply the result of this rule to the function returned by the previous rule
|
Rule[InPrev, Out, B, X2] | Rule |
| == |
final def ==(arg0 : Any)
|
Boolean | Any |
| == |
final def ==(arg0 : Object)
|
Boolean | AnyRef |
| >-> |
def >->[Out2, B, X2 >: X](fa2resultb : (A) => Result[Out2, B, X2])
|
Rule[In, Out2, B, X2] | Rule |
| >> |
def >>[Out2, B, X2 >: X](fa2ruleb : (A) => (Out) => Result[Out2, B, X2])
|
Rule[In, Out2, B, X2] | Rule |
| >>& |
def >>&[B, X2 >: X](fa2ruleb : (A) => (Out) => Result[Any, B, X2])
|
Rule[In, Out, B, X2] | Rule |
| >>? |
def >>?[Out2, B, X2 >: X](pf : PartialFunction[A, Rule[Out, Out2, B, X2]])
|
Rule[In, Out2, B, X2] | Rule |
| >~> |
def >~>[Out2, B1, B2, B >: A, C, X2 >: X](f : (B1, B2) => (Out) => Result[Out2, C, X2])(implicit view$7 : (B) => ~[B1, B2])
>~>(f) is equivalent to >> { case b1 ~ b2 => f(b1, b2) }
|
Rule[In, Out2, C, X2] | Rule |
| ?? |
def ??(pf : PartialFunction[A, Any])
|
Rule[In, Out, A, X] | Rule |
| ^-^ |
def ^-^[B1, B2 >: A, C](f : (B1, B2) => C)
^-^(f) is equivalent to ^^ { b2 => b1 => f(b1, b2) }
|
Rule[In, Out, (B1) => C, X] | Rule |
| ^^ |
def ^^[B](fa2b : (A) => B)
|
Rule[In, Out, B, X] | Rule |
| ^^? |
def ^^?[B](pf : PartialFunction[A, B])
|
Rule[In, Out, B, X] | Rule |
| ^~>~^ |
def ^~>~^[B1, B2, B3, B >: A, C](f : (B1, B2, B3) => C)(implicit view$8 : (B) => ~[B2, B3])
^~>~^(f) is equivalent to ^^ { case b2 ~ b3 => b1 => f(b1, b2, b3) }
|
Rule[In, Out, (B1) => C, X] | Rule |
| ^~^ |
def ^~^[B1, B2, B >: A, C](f : (B1, B2) => C)(implicit view$1 : (B) => ~[B1, B2])
^~^(f) is equivalent to ^^ { case b1 ~ b2 => f(b1, b2) }
|
Rule[In, Out, C, X] | Rule |
| ^~~^ |
def ^~~^[B1, B2, B3, B >: A, C](f : (B1, B2, B3) => C)(implicit view$2 : (B) => ~[~[B1, B2], B3])
^~~^(f) is equivalent to ^^ { case b1 ~ b2 ~ b3 => f(b1, b2, b3) }
|
Rule[In, Out, C, X] | Rule |
| ^~~~^ |
def ^~~~^[B1, B2, B3, B4, B >: A, C](f : (B1, B2, B3, B4) => C)(implicit view$3 : (B) => ~[~[~[B1, B2], B3], B4])
^~~~^(f) is equivalent to ^^ { case b1 ~ b2 ~ b3 ~ b4 => f(b1, b2, b3, b4) }
|
Rule[In, Out, C, X] | Rule |
| ^~~~~^ |
def ^~~~~^[B1, B2, B3, B4, B5, B >: A, C](f : (B1, B2, B3, B4, B5) => C)(implicit view$4 : (B) => ~[~[~[~[B1, B2], B3], B4], B5])
^~~~~^(f) is equivalent to ^^ { case b1 ~ b2 ~ b3 ~ b4 ~ b5 => f(b1, b2, b3, b4, b5) }
|
Rule[In, Out, C, X] | Rule |
| ^~~~~~^ |
def ^~~~~~^[B1, B2, B3, B4, B5, B6, B >: A, C](f : (B1, B2, B3, B4, B5, B6) => C)(implicit view$5 : (B) => ~[~[~[~[~[B1, B2], B3], B4], B5], B6])
^~~~~~^(f) is equivalent to ^^ { case b1 ~ b2 ~ b3 ~ b4 ~ b5 ~ b6 => f(b1, b2, b3, b4, b5, b6) }
|
Rule[In, Out, C, X] | Rule |
| ^~~~~~~^ |
def ^~~~~~~^[B1, B2, B3, B4, B5, B6, B7, B >: A, C](f : (B1, B2, B3, B4, B5, B6, B7) => C)(implicit view$6 : (B) => ~[~[~[~[~[~[B1, B2], B3], B4], B5], B6], B7])
^~~~~~~^(f) is equivalent to ^^ { case b1 ~ b2 ~ b3 ~ b4 ~ b5 ~ b6 => f(b1, b2, b3, b4, b5, b6) }
|
Rule[In, Out, C, X] | Rule |
| andThen |
def andThen[A](arg0 : (R) => A)
|
(T1) => A | Function1 |
| apply |
def apply(in : In)
|
Result[Out, A, X] | |
| as |
def as(name : String)
|
Rule[In, Out, A, X] with Name |
Rule |
| asInstanceOf |
final def asInstanceOf[T0]
|
T0 | Any |
| clone |
protected def clone
|
Object | AnyRef |
| compose |
def compose[A](arg0 : (A) => T1)
|
(A) => R | Function1 |
| eq |
final def eq(arg0 : Object)
|
Boolean | AnyRef |
| equals |
def equals(arg0 : Any)
|
Boolean | AnyRef |
| filter |
def filter(f : (A) => Boolean)
|
Rule[In, Out, A, X] | Rule |
| finalize |
protected def finalize
|
Unit | AnyRef |
| flatMap |
def flatMap[Out2, B, X2 >: X](fa2ruleb : (A) => (Out) => Result[Out2, B, X2])
|
Rule[In, Out2, B, X2] | Rule |
| getClass |
final def getClass
|
Class[Any] | AnyRef |
| hashCode |
def hashCode
|
Int | AnyRef |
| isInstanceOf |
final def isInstanceOf[T0]
|
Boolean | Any |
| map |
def map[B](fa2b : (A) => B)
|
Rule[In, Out, B, X] | Rule |
| mapResult |
def mapResult[Out2, B, Y](f : (Result[Out, A, X]) => Result[Out2, B, Y])
|
Rule[In, Out2, B, Y] | Rule |
| ne |
final def ne(arg0 : Object)
|
Boolean | AnyRef |
| notify |
final def notify
|
Unit | AnyRef |
| notifyAll |
final def notifyAll
|
Unit | AnyRef |
| synchronized |
final def synchronized[T0](arg0 : T0)
|
T0 | AnyRef |
| thunk |
def thunk(in : In)
|
Thunk[In, Out, A, X] | Rule |
| toString |
override def toString
|
String | Function1 |
| wait |
final def wait(arg0 : Long, arg1 : Int)
|
Unit | AnyRef |
| wait |
final def wait
|
Unit | AnyRef |
| wait |
final def wait(arg0 : Long)
|
Unit | AnyRef |
| ~ |
def ~[Out2, B, X2 >: X](next : => Rule[Out, Out2, B, X2])
|
Rule[In, Out2, ~[A, B], X2] | Rule |
| ~! |
def ~
|
Rule[In, Out2, ~[A, B], Any] | Rule |
| ~++ |
def ~++[Out2, B >: A, X2 >: X](next : => Rule[Out, Out2, Seq[B], X2])
|
Rule[In, Out2, List[B], X2] | Rule |
| ~- |
def ~-[Out2, B, X2 >: X](next : => Rule[Out, Out2, B, X2])
|
Rule[In, Out2, A, X2] | Rule |
| ~-! |
def ~-
|
Rule[In, Out2, A, Any] | Rule |
| ~> |
def ~>[Out2, B, X2 >: X](next : => Rule[Out, Out2, (A) => B, X2])
Apply the result of this rule to the function returned by the next rule
|
Rule[In, Out2, B, X2] | Rule |
| OVERVIEW | PACKAGE | CONSTR | FIELDS | METHODS | FRAMES NO FRAMES | INHERITED |