RouteB

final def !=(arg0: Any): Boolean

final def ##(): Int

def /[B](next: RouteB[B])(implicit c: Composition[A, B]): RouteB[C]

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

val build: (A) ⇒ String

macro def caseClass[B]: RouteB[B]

Maps the captures values of the route to a case class.

macro def caseClassDebug[B]: RouteB[B]

Same as caseClass except the code generated by the macro is printed to stdout.

def clone(): AnyRef

final def const[B](b: B)(implicit ev: =:=[A, Unit], ev2: =:=[Unit, A]): RouteB[B]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

final def filter(f: (A) ⇒ Boolean): RouteB[A]

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def mapInput[B >: A](f: (B) ⇒ A): RouteB[B]

final def mapParsed[B <: A](f: (A) ⇒ B): RouteB[B]

val matchGroups: Int

The number of matches that regex will capture.

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def option: RouteB[Option[A]]

val parse: ((Int) ⇒ String) ⇒ Option[A]

def parseThen(f: (Option[A]) ⇒ Option[A]): RouteB[A]

val regex: String

final def route: Route[A]

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def xmap[B](b: (A) ⇒ B)(a: (B) ⇒ A): RouteB[B]

final def xmapI[B](i: scalaz.Isomorphism.<=>[A, B]): RouteB[B]

final def xmapL[B](l: Iso[A, B]): RouteB[B]

def ~[B](next: RouteB[B])(implicit c: Composition[A, B]): RouteB[C]

final def caseclass1[Z](apply: (A) ⇒ Z)(unapply: (Z) ⇒ Option[A]): RouteB[Z]

final def caseclass2[AA, B, Z](apply: (AA, B) ⇒ Z)(unapply: (Z) ⇒ Option[(AA, B)])(implicit ev: =:=[A, (AA, B)], ev2: =:=[(AA, B), A]): RouteB[Z]

final def caseclass3[AA, B, C, Z](apply: (AA, B, C) ⇒ Z)(unapply: (Z) ⇒ Option[(AA, B, C)])(implicit ev: =:=[A, (AA, B, C)], ev2: =:=[(AA, B, C), A]): RouteB[Z]

final def caseclass4[AA, B, C, D, Z](apply: (AA, B, C, D) ⇒ Z)(unapply: (Z) ⇒ Option[(AA, B, C, D)])(implicit ev: =:=[A, (AA, B, C, D)], ev2: =:=[(AA, B, C, D), A]): RouteB[Z]

final def caseclass5[AA, B, C, D, E, Z](apply: (AA, B, C, D, E) ⇒ Z)(unapply: (Z) ⇒ Option[(AA, B, C, D, E)])(implicit ev: =:=[A, (AA, B, C, D, E)], ev2: =:=[(AA, B, C, D, E), A]): RouteB[Z]

final def caseclass6[AA, B, C, D, E, F, Z](apply: (AA, B, C, D, E, F) ⇒ Z)(unapply: (Z) ⇒ Option[(AA, B, C, D, E, F)])(implicit ev: =:=[A, (AA, B, C, D, E, F)], ev2: =:=[(AA, B, C, D, E, F), A]): RouteB[Z]

final def caseclass7[AA, B, C, D, E, F, G, Z](apply: (AA, B, C, D, E, F, G) ⇒ Z)(unapply: (Z) ⇒ Option[(AA, B, C, D, E, F, G)])(implicit ev: =:=[A, (AA, B, C, D, E, F, G)], ev2: =:=[(AA, B, C, D, E, F, G), A]): RouteB[Z]

final def caseclass8[AA, B, C, D, E, F, G, H, Z](apply: (AA, B, C, D, E, F, G, H) ⇒ Z)(unapply: (Z) ⇒ Option[(AA, B, C, D, E, F, G, H)])(implicit ev: =:=[A, (AA, B, C, D, E, F, G, H)], ev2: =:=[(AA, B, C, D, E, F, G, H), A]): RouteB[Z]