QueryParams

final def !=(arg0: Any): Boolean

final def ##(): Int

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

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

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

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

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

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

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

final def ==(arg0: Any): Boolean

def add(other: QueryParams): QueryParams

Add multiple key/value pairs

def add(kvPairs: (String, String)*): QueryParams

Add multiple key/value pairs

def add(key: String, value: String): QueryParams

Add a key/value pair

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 allKeys: Set[String]

The unique set of keys with or without values

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

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

def apply(key: String): Seq[String]

Returns all values for the given key or throws a NoSuchElementException if the key doesn't exists.

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[QueryParams, B, That]): That

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

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

def companion: GenericCompanion[Seq]

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

def contains(elem: (String, String)): Boolean

Check for key/value pair existence

def contains(key: String, value: String): Boolean

Check for key/value pair existence

def contains(key: String): Boolean

Check for key existence

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

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]): QueryParams

def distinct: QueryParams

def drop(n: Int): QueryParams

def dropRight(n: Int): QueryParams

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

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

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

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

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

def filterKeys(f: (String) ⇒ Boolean): QueryParams

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

def filterValues(f: (String) ⇒ Boolean): QueryParams

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

def first(key: String): String

Returns the first non-null value for the given key or throws a NoSuchElementException if none exists.

def firstNonBlank(key: String): String

Returns the first non-blank value for the given key or throws a NoSuchElementException if none exists.

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

def flatten[B](implicit asTraversable: ((String, String)) ⇒ GenTraversableOnce[B]): Seq[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 genericBuilder[B]: Builder[B, Seq[B]]

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

Returns all values for the given key.

final def getClass(): Class[_]

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

Optionally Returns the first non-null value for the given key

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

Optionally Returns the first non-blank value for the given key

def getNonBlank(key: String): Seq[String]

Returns all non-blank values for the given key.

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

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

def hasDefiniteSize: Boolean

def hasKey(key: String): Boolean

Returns true if there is a matching key (which doesn't need to have a value)

def hasKeyWithNonBlankValue(key: String): Boolean

Returns true if there is a matching key (which also has a non-blank value)

def hasKeyWithValue(key: String, value: String): Boolean

Returns true if there is a matching key which has the given value

def hasKeyWithValue(key: String): Boolean

Returns true if there is a matching key (which also has a value)

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: QueryParams

def inits: Iterator[QueryParams]

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

def isDefinedAt(idx: Int): Boolean

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[(String, String)]

def keysWithNonBlankValues: Set[String]

The unique set of keys with non-blank values

def keysWithValues: Set[String]

The unique set of keys with non-null values (blank is a valid value)

def keysWithoutValues: Set[String]

The unique set of keys without values

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[QueryParams, B, That]): That

def mapKeys(f: (String) ⇒ String): QueryParams

def mapValues(f: (String) ⇒ String): QueryParams

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), QueryParams]

def nonBlank(key: String): Seq[String]

Returns all non-blank values for the given key or throws a NoSuchElementException if the key doesn't have non-null values.

def nonEmpty: Boolean

def nonNull(key: String): Seq[String]

Returns all non-null values for the given key or throws a NoSuchElementException if the key doesn't have non-null values.

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[QueryParams, B, That]): That

def par: ParSeq[(String, String)]

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

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

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

def permutations: Iterator[QueryParams]

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

def prettyString: String

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)](op: (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 remove(keys: String*): QueryParams

Remove a key/value pair based on the key

def replace(key: String, value: String): QueryParams

Replaces the entry for the given key only if it was previously mapped to some value.

def repr: QueryParams

def reverse: QueryParams

def reverseIterator: Iterator[(String, String)]

def reverseMap[B, That](f: ((String, String)) ⇒ B)(implicit bf: CanBuildFrom[QueryParams, 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[QueryParams, B, That]): That

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

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

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

def seq: Seq[(String, String)]

def size: Int

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

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

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

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

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

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

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

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

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

def tail: QueryParams

def tails: Iterator[QueryParams]

def take(n: Int): QueryParams

def takeRight(n: Int): QueryParams

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

def thisCollection: Seq[(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: QueryParams): Seq[(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, Seq[String]]

Convert to a Map[String, Seq[String]]

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

def toQueryString(): String

Create a valid query string using the current parameters (everything after the ?).

def toSeq: Seq[(String, String)]

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

def toStream: Stream[(String, String)]

def toString(): String

An alias for toQueryString

def toTraversable: Traversable[(String, String)]

def toVector: Vector[(String, String)]

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

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

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

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

def updated(kvPairs: (String, String)*): QueryParams

Update multiple key/value pairs

def updated(other: QueryParams): QueryParams

Update multiple key/value pairs

def updated(key: String, value: String): QueryParams

If the key doesn't exist then add it, otherwise replace the first occurance of the key with the new value and remove any other values.

def updated(key: String): QueryParams

Make sure the key (without a value) exists

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

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

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

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

final def wait(arg0: Long): Unit

final def wait(): Unit

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

def withLowerKeys: QueryParams

Convert all keys to lower case

def withPrefixedKeys(prefix: String): QueryParams

Add a prefix to each key

def withoutBlankValues(): QueryParams

Remove any params with blank values

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

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

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

def finalize(): Unit