Directive

abstract def tapply(f: (L) ⇒ Route): Route

Calls the inner route with a tuple of extracted values of type L.

final def !=(arg0: Any): Boolean

final def ##(): Int

def &(magnet: ConjunctionMagnet[L]): Out

Joins two directives into one which extracts the concatenation of its base directive extractions.

def +(other: String): String

def ->[B](y: B): (Directive[L], B)

final def ==(arg0: Any): Boolean

def apply(v1: ⇒ Route): Route

def apply(v1: In): Route

def as[A](constructor: ConstructFromTuple[L, A]): Directive1[A]

Converts this directive into one which, instead of a tuple of type L, creates an instance of type A (which is usually a case class).

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def compose[A](g: (A) ⇒ ⇒ Route): (A) ⇒ Route

def compose[A](g: (A) ⇒ In): (A) ⇒ Route

def ensuring(cond: (Directive[L]) ⇒ Boolean, msg: ⇒ Any): Directive[L]

def ensuring(cond: (Directive[L]) ⇒ Boolean): Directive[L]

def ensuring(cond: Boolean, msg: ⇒ Any): Directive[L]

def ensuring(cond: Boolean): Directive[L]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

implicit val ev: Tuple[L]

def filter(predicate: (T) ⇒ Boolean, rejections: Rejection*): Directive1[T]

def finalize(): Unit

def flatMap[R](f: (T) ⇒ Directive[R])(implicit arg0: Tuple[R]): Directive[R]

def formatted(fmtstr: String): String

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def map[R](f: (T) ⇒ R)(implicit tupler: Tupler[R]): Directive[Out]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def recover[R >: L](recovery: (Seq[Rejection]) ⇒ Directive[R])(implicit arg0: Tuple[R]): Directive[R]

Creates a new directive that is able to recover from rejections that were produced by this Directive **before the inner route was applied**.

def recoverPF[R >: L](recovery: PartialFunction[Seq[Rejection], Directive[R]])(implicit arg0: Tuple[R]): Directive[R]

Variant of recover that only recovers from rejections handled by the given PartialFunction.

def require(predicate: (T) ⇒ Boolean, rejections: Rejection*): Directive0

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

def tfilter(predicate: (L) ⇒ Boolean, rejections: Rejection*): Directive[L]

Creates a new directive of the same type, which passes if the given predicate matches the current extractions or rejects with the given rejections.

def tflatMap[R](f: (L) ⇒ Directive[R])(implicit arg0: Tuple[R]): Directive[R]

Flatmaps this directive using the given function.

def tmap[R](f: (L) ⇒ R)(implicit tupler: Tupler[R]): Directive[Out]

Maps over this directive using the given function, which can produce either a tuple or any other value (which will then we wrapped into a scala.Tuple1).

def toString(): String

def trequire(predicate: (L) ⇒ Boolean, rejections: Rejection*): Directive0

Creates a new akka.http.scaladsl.server.Directive0, which passes if the given predicate matches the current extractions or rejects with the given rejections.

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def |[R >: L](that: Directive[R]): Directive[R]

Joins two directives into one which runs the second directive if the first one rejects.

def →[B](y: B): (Directive[L], B)

def andThen[A](g: (Route) ⇒ A): (⇒ Route) ⇒ A

def andThen[A](g: (Route) ⇒ A): (In) ⇒ A

def toString(): String

def toString(): String