HandlerEnv

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def +[B1 >: Any](elem1: (String, B1), elem2: (String, B1), elems: (String, B1)*): Map[String, B1]

def +[B1 >: Any](kv: (String, B1)): Map[String, B1]

def ++[B1 >: Any](xs: GenTraversableOnce[(String, B1)]): Map[String, B1]

def ++[B >: (String, Any), That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[HashMap[String, Any], B, That]): That

def ++:[B >: (String, Any), That](that: Traversable[B])(implicit bf: CanBuildFrom[HashMap[String, Any], B, That]): That

def ++:[B >: (String, Any), That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[HashMap[String, Any], B, That]): That

def ++=(xs: TraversableOnce[(String, Any)]): HandlerEnv.this.type

def +=(kv: (String, Any)): HandlerEnv.this.type

def +=(elem1: (String, Any), elem2: (String, Any), elems: (String, Any)*): HandlerEnv.this.type

def -(elem1: String, elem2: String, elems: String*): HashMap[String, Any]

def -(key: String): HashMap[String, Any]

def --(xs: GenTraversableOnce[String]): HashMap[String, Any]

def --=(xs: TraversableOnce[String]): HandlerEnv.this.type

def -=(key: String): HandlerEnv.this.type

def -=(elem1: String, elem2: String, elems: String*): HandlerEnv.this.type

def /:[B](z: B)(op: (B, (String, Any)) ⇒ B): B

def :\[B](z: B)(op: ((String, Any), B) ⇒ B): B

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

var _loadFactor: Int

def addEntry(e: DefaultEntry[String, Any]): Unit

def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

def addString(b: StringBuilder): StringBuilder

def addString(b: StringBuilder, sep: String): StringBuilder

def aggregate[B](z: B)(seqop: (B, (String, Any)) ⇒ B, combop: (B, B) ⇒ B): B

def alwaysInitSizeMap: Boolean

def andThen[C](k: (Any) ⇒ C): PartialFunction[String, C]

def apply(key: String): Any

def applyOrElse[A1 <: String, B1 >: Any](x: A1, default: (A1) ⇒ B1): B1

final def asInstanceOf[T0]: T0

var bodyParams: Params

def calcSizeMapSize(tableLength: Int): Int

def canEqual(that: Any): Boolean

var channel: Channel

def clear(): Unit

def clearTable(): Unit

def clone(): HashMap[String, Any]

def collect[B, That](pf: PartialFunction[(String, Any), B])(implicit bf: CanBuildFrom[HashMap[String, Any], B, That]): That

def collectFirst[B](pf: PartialFunction[(String, Any), B]): Option[B]

def companion: GenericCompanion[Iterable]

def compose[A](g: (A) ⇒ String): (A) ⇒ Any

def contains(key: String): Boolean

def copyToArray[B >: (String, Any)](xs: Array[B], start: Int, len: Int): Unit

def copyToArray[B >: (String, Any)](xs: Array[B]): Unit

def copyToArray[B >: (String, Any)](xs: Array[B], start: Int): Unit

def copyToBuffer[B >: (String, Any)](dest: Buffer[B]): Unit

def count(p: ((String, Any)) ⇒ Boolean): Int

def createNewEntry[B1](key: String, value: B1): Entry

def default(key: String): Any

def drop(n: Int): HashMap[String, Any]

def dropRight(n: Int): HashMap[String, Any]

def dropWhile(p: ((String, Any)) ⇒ Boolean): HashMap[String, Any]

def elemEquals(key1: String, key2: String): Boolean

def elemHashCode(key: String): Int

def empty: HashMap[String, Any]

def entriesIterator: Iterator[DefaultEntry[String, Any]]

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

def exists(p: ((String, Any)) ⇒ Boolean): Boolean

var fileUploadParams: FileUploadParams

def filter(p: ((String, Any)) ⇒ Boolean): HashMap[String, Any]

def filterKeys(p: (String) ⇒ Boolean): Map[String, Any]

def filterNot(p: ((String, Any)) ⇒ Boolean): HashMap[String, Any]

def finalize(): Unit

def find(p: ((String, Any)) ⇒ Boolean): Option[(String, Any)]

def findEntry(key: String): DefaultEntry[String, Any]

def findOrAddEntry[B](key: String, value: B): DefaultEntry[String, Any]

def flatMap[B, That](f: ((String, Any)) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[HashMap[String, Any], B, That]): That

def flatten[B](implicit asTraversable: ((String, Any)) ⇒ GenTraversableOnce[B]): Iterable[B]

def fold[A1 >: (String, Any)](z: A1)(op: (A1, A1) ⇒ A1): A1

def foldLeft[B](z: B)(op: (B, (String, Any)) ⇒ B): B

def foldRight[B](z: B)(op: ((String, Any), B) ⇒ B): B

def forall(p: ((String, Any)) ⇒ Boolean): Boolean

def foreach[C](f: ((String, Any)) ⇒ C): Unit

def foreachEntry[U](f: (DefaultEntry[String, Any]) ⇒ U): Unit

def genericBuilder[B]: Builder[B, Iterable[B]]

def get(key: String): Option[Any]

final def getClass(): Class[_]

def getOrElse[B1 >: Any](key: String, default: ⇒ B1): B1

def getOrElseUpdate(key: String, op: ⇒ Any): Any

def groupBy[K](f: ((String, Any)) ⇒ K): Map[K, HashMap[String, Any]]

def grouped(size: Int): Iterator[HashMap[String, Any]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: (String, Any)

def headOption: Option[(String, Any)]

final def improve(hcode: Int, seed: Int): Int

final def index(hcode: Int): Int

def init: HashMap[String, Any]

def initWithContents(c: Contents[String, DefaultEntry[String, Any]]): Unit

def initialSize: Int

def inits: Iterator[HashMap[String, Any]]

def isDefinedAt(key: String): Boolean

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

def isSizeMapDefined: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[(String, Any)]

def keySet: Set[String]

def keys: Iterable[String]

def keysIterator: Iterator[String]

def last: (String, Any)

def lastOption: Option[(String, Any)]

def lift: (String) ⇒ Option[Any]

def map[B, That](f: ((String, Any)) ⇒ B)(implicit bf: CanBuildFrom[HashMap[String, Any], B, That]): That

def mapResult[NewTo](f: (HashMap[String, Any]) ⇒ NewTo): Builder[(String, Any), NewTo]

def mapValues[C](f: (Any) ⇒ C): Map[String, C]

def max[B >: (String, Any)](implicit cmp: Ordering[B]): (String, Any)

def maxBy[B](f: ((String, Any)) ⇒ B)(implicit cmp: Ordering[B]): (String, Any)

def min[B >: (String, Any)](implicit cmp: Ordering[B]): (String, Any)

def minBy[B](f: ((String, Any)) ⇒ B)(implicit cmp: Ordering[B]): (String, Any)

def mkString: String

def mkString(sep: String): String

def mkString(start: String, sep: String, end: String): String

final def ne(arg0: AnyRef): Boolean

def newBuilder: Builder[(String, Any), HashMap[String, Any]]

def nnSizeMapAdd(h: Int): Unit

def nnSizeMapRemove(h: Int): Unit

def nnSizeMapReset(tableLength: Int): Unit

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def orElse[A1 <: String, B1 >: Any](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

def par: ParHashMap[String, Any]

def parCombiner: Combiner[(String, Any), ParHashMap[String, Any]]

def partition(p: ((String, Any)) ⇒ Boolean): (HashMap[String, Any], HashMap[String, Any])

var pathInfo: PathInfo

var pathParams: Params

def product[B >: (String, Any)](implicit num: Numeric[B]): B

def put(key: String, value: Any): Option[Any]

def reduce[A1 >: (String, Any)](op: (A1, A1) ⇒ A1): A1

def reduceLeft[B >: (String, Any)](op: (B, (String, Any)) ⇒ B): B

def reduceLeftOption[B >: (String, Any)](op: (B, (String, Any)) ⇒ B): Option[B]

def reduceOption[A1 >: (String, Any)](op: (A1, A1) ⇒ A1): Option[A1]

def reduceRight[B >: (String, Any)](op: ((String, Any), B) ⇒ B): B

def reduceRightOption[B >: (String, Any)](op: ((String, Any), B) ⇒ B): Option[B]

def remove(key: String): Option[Any]

def removeEntry(key: String): DefaultEntry[String, Any]

def repr: HashMap[String, Any]

var request: HttpRequest

var response: HttpResponse

def result(): HashMap[String, Any]

def retain(p: (String, Any) ⇒ Boolean): HandlerEnv.this.type

def reversed: List[(String, Any)]

var route: Route

def runWith[U](action: (Any) ⇒ U): (String) ⇒ Boolean

def sameElements[B >: (String, Any)](that: GenIterable[B]): Boolean

def scan[B >: (String, Any), That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[HashMap[String, Any], B, That]): That

def scanLeft[B, That](z: B)(op: (B, (String, Any)) ⇒ B)(implicit bf: CanBuildFrom[HashMap[String, Any], B, That]): That

def scanRight[B, That](z: B)(op: ((String, Any), B) ⇒ B)(implicit bf: CanBuildFrom[HashMap[String, Any], B, That]): That

var seedvalue: Int

def seq: Map[String, Any]

def size: Int

def sizeHint(coll: TraversableLike[_, _], delta: Int): Unit

def sizeHint(coll: TraversableLike[_, _]): Unit

def sizeHint(size: Int): Unit

def sizeHintBounded(size: Int, boundingColl: TraversableLike[_, _]): Unit

final def sizeMapBucketBitSize: Int

final def sizeMapBucketSize: Int

def sizeMapDisable(): Unit

def sizeMapInit(tableLength: Int): Unit

def sizeMapInitAndRebuild(): Unit

var sizemap: Array[Int]

def slice(from: Int, until: Int): HashMap[String, Any]

def sliding(size: Int, step: Int): Iterator[HashMap[String, Any]]

def sliding(size: Int): Iterator[HashMap[String, Any]]

def span(p: ((String, Any)) ⇒ Boolean): (HashMap[String, Any], HashMap[String, Any])

def splitAt(n: Int): (HashMap[String, Any], HashMap[String, Any])

def stringPrefix: String

def sum[B >: (String, Any)](implicit num: Numeric[B]): B

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

var table: Array[HashEntry[String, DefaultEntry[String, Any]]]

var tableSize: Int

def tableSizeSeed: Int

def tail: HashMap[String, Any]

def tails: Iterator[HashMap[String, Any]]

def take(n: Int): HashMap[String, Any]

def takeRight(n: Int): HashMap[String, Any]

def takeWhile(p: ((String, Any)) ⇒ Boolean): HashMap[String, Any]

lazy val textParams: Params

A merge of all text params (uriParams, bodyParams, pathParams), as contrast to file upload (fileParams).

def thisCollection: Iterable[(String, Any)]

var threshold: Int

def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, (String, Any), Col[(String, Any)]]): Col[(String, Any)]

def toArray[B >: (String, Any)](implicit arg0: ClassTag[B]): Array[B]

def toBuffer[C >: (String, Any)]: Buffer[C]

def toCollection(repr: HashMap[String, Any]): Iterable[(String, Any)]

def toIndexedSeq: IndexedSeq[(String, Any)]

def toIterable: Iterable[(String, Any)]

def toIterator: Iterator[(String, Any)]

def toList: List[(String, Any)]

def toMap[T, U](implicit ev: <:<[(String, Any), (T, U)]): Map[T, U]

def toSeq: Seq[(String, Any)]

def toSet[B >: (String, Any)]: Set[B]

def toStream: Stream[(String, Any)]

def toString(): String

def toTraversable: Traversable[(String, Any)]

def toVector: Vector[(String, Any)]

def transform(f: (String, Any) ⇒ Any): HandlerEnv.this.type

def transpose[B](implicit asTraversable: ((String, Any)) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]

def unzip[A1, A2](implicit asPair: ((String, Any)) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

def unzip3[A1, A2, A3](implicit asTriple: ((String, Any)) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

def update(key: String, value: Any): Unit

def updated[B1 >: Any](key: String, value: B1): Map[String, B1]

var uriParams: Params

def useSizeMap(t: Boolean): Unit

def values: Iterable[Any]

def valuesIterator: Iterator[Any]

def view(from: Int, until: Int): IterableView[(String, Any), HashMap[String, Any]]

def view: IterableView[(String, Any), HashMap[String, Any]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withDefault(d: (String) ⇒ Any): Map[String, Any]

def withDefaultValue(d: Any): Map[String, Any]

def withFilter(p: ((String, Any)) ⇒ Boolean): FilterMonadic[(String, Any), HashMap[String, Any]]

def zip[A1 >: (String, Any), B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[HashMap[String, Any], (A1, B), That]): That

def zipAll[B, A1 >: (String, Any), That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[HashMap[String, Any], (A1, B), That]): That

def zipWithIndex[A1 >: (String, Any), That](implicit bf: CanBuildFrom[HashMap[String, Any], (A1, Int), That]): That

def /:\[A1 >: (String, Any)](z: A1)(op: (A1, A1) ⇒ A1): A1