Cons

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(other: String): String

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

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

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

def +:(kvp: (String, String)): Cons

def +:[B >: (String, String), That](elem: B)(implicit bf: CanBuildFrom[Query, B, That]): That

def ->[B](y: B): (Cons, B)

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

def :+[B >: (String, String), That](elem: B)(implicit bf: CanBuildFrom[Query, B, That]): That

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

final def ==(arg0: Any): Boolean

def addString(b: StringBuilder): StringBuilder

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

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

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

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

def apply(n: Int): (String, String)

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

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def clone(): AnyRef

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

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

def combinations(n: Int): Iterator[Query]

def companion: GenericCompanion[LinearSeq]

def compose[A](g: (A) ⇒ Int): (A) ⇒ (String, String)

def contains[A1 >: (String, String)](elem: A1): Boolean

def containsSlice[B](that: GenSeq[B]): Boolean

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

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

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

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

final def corresponds[B](that: GenSeq[B])(p: ((String, String), B) ⇒ Boolean): Boolean

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

def diff[B >: (String, String)](that: GenSeq[B]): Query

def distinct: Query

def drop(n: Int): Query

def dropRight(n: Int): Query

def dropWhile(p: ((String, String)) ⇒ Boolean): Query

def endsWith[B](that: GenSeq[B]): Boolean

def ensuring(cond: (Cons) ⇒ Boolean, msg: ⇒ Any): Cons

def ensuring(cond: (Cons) ⇒ Boolean): Cons

def ensuring(cond: Boolean, msg: ⇒ Any): Cons

def ensuring(cond: Boolean): Cons

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

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

def filter(p: ((String, String)) ⇒ Boolean): Query

def filterNot(p: ((String, String)) ⇒ Boolean): Query

def finalize(): Unit

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

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

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

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

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

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

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

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

def formatted(fmtstr: String): String

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

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

def getAll(key: String): List[String]

final def getClass(): Class[_]

def getOrElse(key: String, default: ⇒ String): String

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

def grouped(size: Int): Iterator[Query]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: (String, String)

def headOption: Option[(String, String)]

def indexOf[B >: (String, String)](elem: B, from: Int): Int

def indexOf[B >: (String, String)](elem: B): Int

def indexOfSlice[B >: (String, String)](that: GenSeq[B], from: Int): Int

def indexOfSlice[B >: (String, String)](that: GenSeq[B]): Int

def indexWhere(p: ((String, String)) ⇒ Boolean, from: Int): Int

def indexWhere(p: ((String, String)) ⇒ Boolean): Int

def indices: Range

def init: Query

def inits: Iterator[Query]

def intersect[B >: (String, String)](that: GenSeq[B]): Query

def isDefinedAt(x: Int): Boolean

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[(String, String)]

val key: String

def last: (String, String)

def lastIndexOf[B >: (String, String)](elem: B, end: Int): Int

def lastIndexOf[B >: (String, String)](elem: B): Int

def lastIndexOfSlice[B >: (String, String)](that: GenSeq[B], end: Int): Int

def lastIndexOfSlice[B >: (String, String)](that: GenSeq[B]): Int

def lastIndexWhere(p: ((String, String)) ⇒ Boolean, end: Int): Int

def lastIndexWhere(p: ((String, String)) ⇒ Boolean): Int

def lastOption: Option[(String, String)]

def length: Int

def lengthCompare(len: Int): Int

def lift: (Int) ⇒ Option[(String, String)]

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

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

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

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

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

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, String), Query]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def padTo[B >: (String, String), That](len: Int, elem: B)(implicit bf: CanBuildFrom[Query, B, That]): That

def par: ParSeq[(String, String)]

def parCombiner: Combiner[(String, String), ParSeq[(String, String)]]

def partition(p: ((String, String)) ⇒ Boolean): (Query, Query)

def patch[B >: (String, String), That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[Query, B, That]): That

def permutations: Iterator[Query]

def prefixLength(p: ((String, String)) ⇒ Boolean): Int

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

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

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

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

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

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

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

def repr: Query

def reverse: Query

def reverseIterator: Iterator[(String, String)]

def reverseMap[B, That](f: ((String, String)) ⇒ B)(implicit bf: CanBuildFrom[Query, B, That]): That

def reversed: List[(String, String)]

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

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

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

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

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

def segmentLength(p: ((String, String)) ⇒ Boolean, from: Int): Int

def seq: LinearSeq[(String, String)]

def size: Int

def slice(from: Int, until: Int): Query

def sliding(size: Int, step: Int): Iterator[Query]

def sliding(size: Int): Iterator[Query]

def sortBy[B](f: ((String, String)) ⇒ B)(implicit ord: Ordering[B]): Query

def sortWith(lt: ((String, String), (String, String)) ⇒ Boolean): Query

def sorted[B >: (String, String)](implicit ord: Ordering[B]): Query

def span(p: ((String, String)) ⇒ Boolean): (Query, Query)

def splitAt(n: Int): (Query, Query)

def startsWith[B](that: GenSeq[B], offset: Int): Boolean

def startsWith[B](that: GenSeq[B]): Boolean

def stringPrefix: String

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

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

val tail: Query

def tails: Iterator[Query]

def take(n: Int): Query

def takeRight(n: Int): Query

def takeWhile(p: ((String, String)) ⇒ Boolean): Query

def thisCollection: LinearSeq[(String, String)]

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

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

def toBuffer[B >: (String, String)]: Buffer[B]

def toCollection(repr: Query): LinearSeq[(String, String)]

def toIndexedSeq: IndexedSeq[(String, String)]

def toIterable: Iterable[(String, String)]

def toIterator: Iterator[(String, String)]

def toList: List[(String, String)]

def toMap: Map[String, String]

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

def toMultiMap: Map[String, List[String]]

Returns this query as a map where keys can have multiple values.

a=1&a=2&a=3&a=4&b=1

"a" -> List(1, 2, 3, 4),
"b" -> List(1)

def toParArray: ParArray[T]

def toSeq: Seq[(String, String)]

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

def toStream: Stream[(String, String)]

def toString(): String

def toTraversable: Traversable[(String, String)]

def toVector: Vector[(String, String)]

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

def union[B >: (String, String), That](that: GenSeq[B])(implicit bf: CanBuildFrom[Query, B, That]): That

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

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

def updated[B >: (String, String), That](index: Int, elem: B)(implicit bf: CanBuildFrom[Query, B, That]): That

val value: String

def view(from: Int, until: Int): SeqView[(String, String), Query]

def view: SeqView[(String, String), Query]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

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

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

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

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

def →[B](y: B): (Cons, B)

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

def flatMap[B](f: ((String, String)) ⇒ GenTraversableOnce[B]): TraversableOnce[B]

def map[B](f: ((String, String)) ⇒ B): TraversableOnce[B]

def withFilter(p: ((String, String)) ⇒ Boolean): Iterator[(String, String)]