Headers

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

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

Concatenate the two collections If the resulting collection is of Headers type, duplicate Singleton headers will be removed from this Headers collection.

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

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

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

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

final def ==(arg0: AnyRef): Boolean

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

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def clone(): AnyRef

def collect[B, That](pf: PartialFunction[Header, B])(implicit bf: CanBuildFrom[Headers, B, That]): That

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

def companion: GenericCompanion[Iterable]

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

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

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

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

def count(p: (Header) ⇒ Boolean): Int

def drop(n: Int): Headers

def dropRight(n: Int): Headers

def dropWhile(p: (Header) ⇒ Boolean): Headers

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def exists(p: (Header) ⇒ Boolean): Boolean

def filter(p: (Header) ⇒ Boolean): Headers

def filterNot(p: (Header) ⇒ Boolean): Headers

def finalize(): Unit

def find(p: (Header) ⇒ Boolean): Option[Header]

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

def flatten[B](implicit asTraversable: (Header) ⇒ GenTraversableOnce[B]): Iterable[B]

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

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

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

def forall(p: (Header) ⇒ Boolean): Boolean

def foreach[B](f: (Header) ⇒ B): Unit

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

def get(key: CaseInsensitiveString): Option[Header]

Attempt to get a org.http4s.Header from this collection of headers

def get(key: Extractable): Option[HeaderKey.Extractable.HeaderT]

Attempt to get a org.http4s.Header of type key.

final def getClass(): Class[_]

def groupBy[K](f: (Header) ⇒ K): Map[K, Headers]

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

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: Header

def headOption: Option[Header]

def init: Headers

def inits: Iterator[Headers]

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[Header]

def last: Header

def lastOption: Option[Header]

def map[B, That](f: (Header) ⇒ B)(implicit bf: CanBuildFrom[Headers, B, That]): That

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

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

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

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

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[Header, Headers]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def par: ParIterable[Header]

def parCombiner: Combiner[Header, ParIterable[Header]]

def partition(p: (Header) ⇒ Boolean): (Headers, Headers)

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

def put(in: Header*): Headers

Make a new collection adding the specified headers, replacing existing headers of singleton type The passed headers are assumed to contain no duplicate Singleton headers.

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

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

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

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

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

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

def repr: Headers

def reversed: List[Header]

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

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

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

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

def seq: Iterable[Header]

def size: Int

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

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

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

def span(p: (Header) ⇒ Boolean): (Headers, Headers)

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

def stringPrefix: String

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

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

def tail: Headers

def tails: Iterator[Headers]

def take(n: Int): Headers

def takeRight(n: Int): Headers

def takeWhile(p: (Header) ⇒ Boolean): Headers

def thisCollection: Iterable[Header]

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

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

def toBuffer[B >: Header]: Buffer[B]

def toCollection(repr: Headers): Iterable[Header]

def toIndexedSeq: IndexedSeq[Header]

def toIterable: Iterable[Header]

def toIterator: Iterator[Header]

def toList: List[Header]

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

def toSeq: Seq[Header]

def toSet[B >: Header]: Set[B]

def toStream: Stream[Header]

def toString(): String

def toTraversable: Traversable[Header]

def toVector: Vector[Header]

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

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

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

def view(from: Int, until: Int): IterableView[Header, Headers]

def view: IterableView[Header, Headers]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withFilter(p: (Header) ⇒ Boolean): FilterMonadic[Header, Headers]

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

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

def zipWithIndex[A1 >: Header, That](implicit bf: CanBuildFrom[Headers, (A1, Int), That]): That

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