MapHeaderMap

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

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

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

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

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

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

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

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

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

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

def -(elem1: String, elem2: String, elems: String*): HeaderMap

def -(key: String): HeaderMap

def --(xs: GenTraversableOnce[String]): HeaderMap

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

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

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

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

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

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

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def add(k: String, v: String): Unit

Add a header but don't replace existing header(s).

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, String)) ⇒ B, combop: (B, B) ⇒ B): B

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

def apply(key: String): String

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def clear(): Unit

def clone(): HeaderMap

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

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

def companion: GenericCompanion[Iterable]

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

def contains(key: String): 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 count(p: ((String, String)) ⇒ Boolean): Int

def default(key: String): String

def drop(n: Int): HeaderMap

def dropRight(n: Int): HeaderMap

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

def empty: HeaderMap

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

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

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

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

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

def finalize(): Unit

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

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

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, Iterable[B]]

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

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

final def getClass(): java.lang.Class[_]

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

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

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

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

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: (String, String)

def headOption: Option[(String, String)]

def init: HeaderMap

def inits: Iterator[HeaderMap]

def isDefinedAt(key: String): Boolean

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[(String, String)]

def keySet: Set[String]

def keys: Iterable[String]

def keysIterator: Iterator[String]

def last: (String, String)

def lastOption: Option[(String, String)]

def lift: (String) ⇒ Option[String]

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

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

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

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

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def par: ParMap[String, String]

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

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

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

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

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(key: String): Option[String]

def repr: HeaderMap

def result(): HeaderMap

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

def reversed: List[(String, String)]

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

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

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

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

def seq: Map[String, String]

def size: Int

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

def sizeHint(size: Int): Unit

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

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

def sliding[B >: (String, String)](size: Int, step: Int): Iterator[HeaderMap]

def sliding[B >: (String, String)](size: Int): Iterator[HeaderMap]

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

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

def stringPrefix: String

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

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

def tail: HeaderMap

def tails: Iterator[HeaderMap]

def take(n: Int): HeaderMap

def takeRight(n: Int): HeaderMap

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

def thisCollection: Iterable[(String, String)]

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

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

def toCollection(repr: HeaderMap): Iterable[(String, String)]

def toIndexedSeq[B >: (String, String)]: IndexedSeq[B]

def toIterable: Iterable[(String, String)]

def toIterator: Iterator[(String, String)]

def toList: List[(String, String)]

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

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 transform(f: (String, String) ⇒ String): MapHeaderMap.this.type

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

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

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

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

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

def values: Iterable[String]

def valuesIterator: Iterator[String]

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

def view: IterableView[(String, String), HeaderMap]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

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

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

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

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

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

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

def elements: Iterator[(String, String)]

def first: (String, String)

def firstOption: Option[(String, String)]

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

def projection: IterableView[(String, String), HeaderMap]

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