A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://www.playframework.com/documentation/2.5.x/api/scala/play/api/mvc/Cookies.html below:

Cookies - play.api.mvc.Cookies

  • final def !=(arg0: Any): Boolean
  • final def ##(): Int
  • def ++[B >: Cookie, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[Cookie], B, That]): That
  • def ++:[B >: Cookie, That](that: Traversable[B])(implicit bf: CanBuildFrom[Traversable[Cookie], B, That]): That
  • def ++:[B >: Cookie, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[Cookie], B, That]): That
  • def /:[B](z: B)(op: (B, Cookie) ⇒ B): B
  • def :\[B](z: B)(op: (Cookie, 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, Cookie) ⇒ B, combop: (B, B) ⇒ B): B
  • def apply(name: String): Cookie
  • final def asInstanceOf[T0]: T0
  • def clone(): AnyRef
  • def collect[B, That](pf: PartialFunction[Cookie, B])(implicit bf: CanBuildFrom[Traversable[Cookie], B, That]): That
  • def collectFirst[B](pf: PartialFunction[Cookie, B]): Option[B]
  • def companion: GenericCompanion[Traversable]
  • def copyToArray[B >: Cookie](xs: Array[B], start: Int, len: Int): Unit
  • def copyToArray[B >: Cookie](xs: Array[B]): Unit
  • def copyToArray[B >: Cookie](xs: Array[B], start: Int): Unit
  • def copyToBuffer[B >: Cookie](dest: Buffer[B]): Unit
  • def count(p: (Cookie) ⇒ Boolean): Int
  • def drop(n: Int): Traversable[Cookie]
  • def dropWhile(p: (Cookie) ⇒ Boolean): Traversable[Cookie]
  • final def eq(arg0: AnyRef): Boolean
  • def equals(arg0: Any): Boolean
  • def exists(p: (Cookie) ⇒ Boolean): Boolean
  • def filter(p: (Cookie) ⇒ Boolean): Traversable[Cookie]
  • def filterNot(p: (Cookie) ⇒ Boolean): Traversable[Cookie]
  • def finalize(): Unit
  • def find(p: (Cookie) ⇒ Boolean): Option[Cookie]
  • def flatMap[B, That](f: (Cookie) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[Cookie], B, That]): That
  • def flatten[B](implicit asTraversable: (Cookie) ⇒ GenTraversableOnce[B]): Traversable[B]
  • def fold[A1 >: Cookie](z: A1)(op: (A1, A1) ⇒ A1): A1
  • def foldLeft[B](z: B)(op: (B, Cookie) ⇒ B): B
  • def foldRight[B](z: B)(op: (Cookie, B) ⇒ B): B
  • def forall(p: (Cookie) ⇒ Boolean): Boolean
  • def genericBuilder[B]: Builder[B, Traversable[B]]
  • final def getClass(): Class[_]
  • def groupBy[K](f: (Cookie) ⇒ K): Map[K, Traversable[Cookie]]
  • def hasDefiniteSize: Boolean
  • def hashCode(): Int
  • def head: Cookie
  • def headOption: Option[Cookie]
  • def init: Traversable[Cookie]
  • def inits: Iterator[Traversable[Cookie]]
  • def isEmpty: Boolean
  • final def isInstanceOf[T0]: Boolean
  • final def isTraversableAgain: Boolean
  • def last: Cookie
  • def lastOption: Option[Cookie]
  • def map[B, That](f: (Cookie) ⇒ B)(implicit bf: CanBuildFrom[Traversable[Cookie], B, That]): That
  • def max[B >: Cookie](implicit cmp: Ordering[B]): Cookie
  • def maxBy[B](f: (Cookie) ⇒ B)(implicit cmp: Ordering[B]): Cookie
  • def min[B >: Cookie](implicit cmp: Ordering[B]): Cookie
  • def minBy[B](f: (Cookie) ⇒ B)(implicit cmp: Ordering[B]): Cookie
  • 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[Cookie, Traversable[Cookie]]
  • def nonEmpty: Boolean
  • final def notify(): Unit
  • final def notifyAll(): Unit
  • def par: ParIterable[Cookie]
  • def parCombiner: Combiner[Cookie, ParIterable[Cookie]]
  • def partition(p: (Cookie) ⇒ Boolean): (Traversable[Cookie], Traversable[Cookie])
  • def product[B >: Cookie](implicit num: Numeric[B]): B
  • def reduce[A1 >: Cookie](op: (A1, A1) ⇒ A1): A1
  • def reduceLeft[B >: Cookie](op: (B, Cookie) ⇒ B): B
  • def reduceLeftOption[B >: Cookie](op: (B, Cookie) ⇒ B): Option[B]
  • def reduceOption[A1 >: Cookie](op: (A1, A1) ⇒ A1): Option[A1]
  • def reduceRight[B >: Cookie](op: (Cookie, B) ⇒ B): B
  • def reduceRightOption[B >: Cookie](op: (Cookie, B) ⇒ B): Option[B]
  • def repr: Traversable[Cookie]
  • def reversed: List[Cookie]
  • def scan[B >: Cookie, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Traversable[Cookie], B, That]): That
  • def scanLeft[B, That](z: B)(op: (B, Cookie) ⇒ B)(implicit bf: CanBuildFrom[Traversable[Cookie], B, That]): That
  • def scanRight[B, That](z: B)(op: (Cookie, B) ⇒ B)(implicit bf: CanBuildFrom[Traversable[Cookie], B, That]): That
  • def seq: Traversable[Cookie]
  • def size: Int
  • def slice(from: Int, until: Int): Traversable[Cookie]
  • def span(p: (Cookie) ⇒ Boolean): (Traversable[Cookie], Traversable[Cookie])
  • def splitAt(n: Int): (Traversable[Cookie], Traversable[Cookie])
  • def stringPrefix: String
  • def sum[B >: Cookie](implicit num: Numeric[B]): B
  • final def synchronized[T0](arg0: ⇒ T0): T0
  • def tail: Traversable[Cookie]
  • def tails: Iterator[Traversable[Cookie]]
  • def take(n: Int): Traversable[Cookie]
  • def takeWhile(p: (Cookie) ⇒ Boolean): Traversable[Cookie]
  • def thisCollection: Traversable[Cookie]
  • def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Cookie, Col[Cookie]]): Col[Cookie]
  • def toArray[B >: Cookie](implicit arg0: ClassTag[B]): Array[B]
  • def toBuffer[B >: Cookie]: Buffer[B]
  • def toCollection(repr: Traversable[Cookie]): Traversable[Cookie]
  • def toIndexedSeq: IndexedSeq[Cookie]
  • def toIterable: Iterable[Cookie]
  • def toIterator: Iterator[Cookie]
  • def toList: List[Cookie]
  • def toMap[T, U](implicit ev: <:<[Cookie, (T, U)]): Map[T, U]
  • def toSeq: Seq[Cookie]
  • def toSet[B >: Cookie]: Set[B]
  • def toStream: Stream[Cookie]
  • def toString(): String
  • def toTraversable: Traversable[Cookie]
  • def toVector: Vector[Cookie]
  • def transpose[B](implicit asTraversable: (Cookie) ⇒ GenTraversableOnce[B]): Traversable[Traversable[B]]
  • def unzip[A1, A2](implicit asPair: (Cookie) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])
  • def unzip3[A1, A2, A3](implicit asTriple: (Cookie) ⇒ (A1, A2, A3)): (Traversable[A1], Traversable[A2], Traversable[A3])
  • def view(from: Int, until: Int): TraversableView[Cookie, Traversable[Cookie]]
  • def view: TraversableView[Cookie, Traversable[Cookie]]
  • final def wait(): Unit
  • final def wait(arg0: Long, arg1: Int): Unit
  • final def wait(arg0: Long): Unit
  • def withFilter(p: (Cookie) ⇒ Boolean): FilterMonadic[Cookie, Traversable[Cookie]]

  • RetroSearch is an open source project built by @garambo | Open a GitHub Issue

    Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

    HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4