A RetroSearch Logo

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

Search Query:

Showing content from https://www.scala-lang.org/api/2.13.10/scala/collection/mutable/TreeMap.html below:

Scala Standard Library 2.13.10 - scala.collection.mutable.TreeMap

sealed class TreeMap[K, V] extends AbstractMap[K, V] with SortedMap[K, V] with SortedMapOps[K, V, TreeMap, TreeMap[K, V]] with StrictOptimizedIterableOps[(K, V), Iterable, TreeMap[K, V]] with StrictOptimizedMapOps[K, V, Map, TreeMap[K, V]] with StrictOptimizedSortedMapOps[K, V, TreeMap, TreeMap[K, V]] with SortedMapFactoryDefaults[K, V, TreeMap, Iterable, Map] with DefaultSerializable



Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. TreeMap
  2. DefaultSerializable
  3. Serializable
  4. StrictOptimizedSortedMapOps
  5. StrictOptimizedMapOps
  6. StrictOptimizedIterableOps
  7. SortedMap
  8. SortedMapOps
  9. SortedMap
  10. SortedMapFactoryDefaults
  11. SortedMapOps
  12. SortedOps
  13. AbstractMap
  14. Map
  15. MapOps
  16. Shrinkable
  17. Builder
  18. Growable
  19. Clearable
  20. Cloneable
  21. Cloneable
  22. Iterable
  23. AbstractMap
  24. Map
  25. Equals
  26. MapFactoryDefaults
  27. MapOps
  28. PartialFunction
  29. Function1
  30. AbstractIterable
  31. Iterable
  32. IterableFactoryDefaults
  33. IterableOps
  34. IterableOnceOps
  35. IterableOnce
  36. AnyRef
  37. Any
Implicitly
  1. by UnliftOps
  2. by iterableOnceExtensionMethods
  3. by any2stringadd
  4. by StringFormat
  5. by Ensuring
  6. by ArrowAssoc
Visibility
  1. Public
  2. Protected
Instance Constructors
  1.  new TreeMap()(implicit ord: Ordering[K])
Value Members
  1.  final def !=(arg0: Any): Boolean
  2.  final def ##: Int
  3.  final def ++[V2 >: V](xs: IterableOnce[(K, V2)]): TreeMap[K, V2]
  4.  final def ++[B >: (K, V)](suffix: IterableOnce[B]): Iterable[B]
  5.  final def ++=(xs: IterableOnce[(K, V)]): TreeMap.this.type
  6.  final def +=(elem: (K, V)): TreeMap.this.type
  7.  final def --=(xs: IterableOnce[K]): TreeMap.this.type
  8.  final def -=(elem: K): TreeMap.this.type
  9.  def ->[B](y: B): (TreeMap[K, V], B)
  10.  final def ==(arg0: Any): Boolean
  11.  def addAll(xs: IterableOnce[(K, V)]): TreeMap.this.type
  12.  def addOne(elem: (K, V)): TreeMap.this.type
  13.  def addString(sb: StringBuilder, start: String, sep: String, end: String): sb.type
  14.  final def addString(b: StringBuilder): b.type
  15.  final def addString(b: StringBuilder, sep: String): b.type
  16.  def andThen[C](k: PartialFunction[V, C]): PartialFunction[K, C]
  17.  def andThen[C](k: (V) => C): PartialFunction[K, C]
  18.  def apply(key: K): V
  19.  def applyOrElse[K1 <: K, V1 >: V](x: K1, default: (K1) => V1): V1
  20.  final def asInstanceOf[T0]: T0
  21.  def canEqual(that: Any): Boolean
  22.  def className: String
  23.  def clear(): Unit
  24.  def clone(): TreeMap[K, V]
  25.  final def coll: TreeMap.this.type
  26.  def collect[K2, V2](pf: PartialFunction[(K, V), (K2, V2)])(implicit ordering: Ordering[K2]): TreeMap[K2, V2]
  27.  def collect[K2, V2](pf: PartialFunction[(K, V), (K2, V2)]): Map[K2, V2]
  28.  def collect[B](pf: PartialFunction[(K, V), B]): Iterable[B]
  29.  def collectFirst[B](pf: PartialFunction[(K, V), B]): Option[B]
  30.  def compose[R](k: PartialFunction[R, K]): PartialFunction[R, V]
  31.  def compose[A](g: (A) => K): (A) => V
  32.  def concat[V2 >: V](xs: IterableOnce[(K, V2)]): TreeMap[K, V2]
  33.  def concat[B >: (K, V)](suffix: IterableOnce[B]): Iterable[B]
  34.  def contains(key: K): Boolean
  35.  def copyToArray[B >: (K, V)](xs: Array[B], start: Int, len: Int): Int
  36.  def copyToArray[B >: (K, V)](xs: Array[B], start: Int): Int
  37.  def copyToArray[B >: (K, V)](xs: Array[B]): Int
  38.  def corresponds[B](that: IterableOnce[B])(p: ((K, V), B) => Boolean): Boolean
  39.  def count(p: ((K, V)) => Boolean): Int
  40.  def default(key: K): V
  41.  def drop(n: Int): TreeMap[K, V]
  42.  def dropRight(n: Int): TreeMap[K, V]
  43.  def dropWhile(p: ((K, V)) => Boolean): TreeMap[K, V]
  44.  def elementWise: ElementWiseExtractor[K, V]
  45.  def empty: TreeMap[K, V]
  46.  def ensuring(cond: (TreeMap[K, V]) => Boolean, msg: => Any): TreeMap[K, V]
  47.  def ensuring(cond: (TreeMap[K, V]) => Boolean): TreeMap[K, V]
  48.  def ensuring(cond: Boolean, msg: => Any): TreeMap[K, V]
  49.  def ensuring(cond: Boolean): TreeMap[K, V]
  50.  final def eq(arg0: AnyRef): Boolean
  51.  def equals(that: Any): Boolean
  52.  def exists(p: ((K, V)) => Boolean): Boolean
  53.  def filter(pred: ((K, V)) => Boolean): TreeMap[K, V]
  54.  def filterImpl(pred: ((K, V)) => Boolean, isFlipped: Boolean): TreeMap[K, V]
  55.  def filterInPlace(p: (K, V) => Boolean): TreeMap.this.type
  56.  def filterNot(pred: ((K, V)) => Boolean): TreeMap[K, V]
  57.  def finalize(): Unit
  58.  def find(p: ((K, V)) => Boolean): Option[(K, V)]
  59.  def firstKey: K
  60.  def flatMap[K2, V2](f: ((K, V)) => IterableOnce[(K2, V2)])(implicit ordering: Ordering[K2]): TreeMap[K2, V2]
  61.  def flatMap[K2, V2](f: ((K, V)) => IterableOnce[(K2, V2)]): Map[K2, V2]
  62.  def flatMap[B](f: ((K, V)) => IterableOnce[B]): Iterable[B]
  63.  def flatten[B](implicit toIterableOnce: ((K, V)) => IterableOnce[B]): Iterable[B]
  64.  def fold[A1 >: (K, V)](z: A1)(op: (A1, A1) => A1): A1
  65.  def foldLeft[B](z: B)(op: (B, (K, V)) => B): B
  66.  def foldRight[B](z: B)(op: ((K, V), B) => B): B
  67.  def forall(p: ((K, V)) => Boolean): Boolean
  68.  def foreach[U](f: ((K, V)) => U): Unit
  69.  def foreachEntry[U](f: (K, V) => U): Unit
  70.  def fromSpecific(coll: IterableOnce[(K, V)]): TreeMap[K, V]
  71.  def get(key: K): Option[V]
  72.  final def getClass(): Class[_ <: AnyRef]
  73.  def getOrElse[V1 >: V](key: K, default: => V1): V1
  74.  def getOrElseUpdate(key: K, op: => V): V
  75.  def groupBy[K](f: ((K, V)) => K): immutable.Map[K, TreeMap[K, V]]
  76.  def groupMap[K, B](key: ((K, V)) => K)(f: ((K, V)) => B): immutable.Map[K, Iterable[B]]
  77.  def groupMapReduce[K, B](key: ((K, V)) => K)(f: ((K, V)) => B)(reduce: (B, B) => B): immutable.Map[K, B]
  78.  def grouped(size: Int): Iterator[TreeMap[K, V]]
  79.  def hashCode(): Int
  80.  def head: (K, V)
  81.  def headOption: Option[(K, V)]
  82.  def init: TreeMap[K, V]
  83.  def inits: Iterator[TreeMap[K, V]]
  84.  def isDefinedAt(key: K): Boolean
  85.  def isEmpty: Boolean
  86.  final def isInstanceOf[T0]: Boolean
  87.  def isTraversableAgain: Boolean
  88.  def iterableFactory: IterableFactory[Iterable]
  89.  def iterator: Iterator[(K, V)]
  90.  def iteratorFrom(start: K): Iterator[(K, V)]
  91.  def keySet: collection.SortedSet[K]
  92.  def keyStepper[S <: Stepper[_]](implicit shape: StepperShape[K, S]): S with EfficientSplit
  93.  def keys: collection.Iterable[K]
  94.  def keysIterator: Iterator[K]
  95.  def keysIteratorFrom(start: K): Iterator[K]
  96.  def knownSize: Int
  97.  def last: (K, V)
  98.  def lastKey: K
  99.  def lastOption: Option[(K, V)]
  100.  def lazyZip[B](that: collection.Iterable[B]): LazyZip2[(K, V), B, TreeMap.this.type]
  101.  def lift: (K) => Option[V]
  102.  def map[K2, V2](f: ((K, V)) => (K2, V2))(implicit ordering: Ordering[K2]): TreeMap[K2, V2]
  103.  def map[K2, V2](f: ((K, V)) => (K2, V2)): Map[K2, V2]
  104.  def map[B](f: ((K, V)) => B): Iterable[B]
  105.  def mapFactory: MapFactory[Map]
  106.  final def mapFromIterable[K2, V2](it: collection.Iterable[(K2, V2)]): Map[K2, V2]
  107.  def mapResult[NewTo](f: (TreeMap[K, V]) => NewTo): Builder[(K, V), NewTo]
  108.  def mapValuesInPlace(f: (K, V) => V): TreeMap.this.type
  109.  def max[B >: (K, V)](implicit ord: math.Ordering[B]): (K, V)
  110.  def maxBefore(key: K): Option[(K, V)]
  111.  def maxBy[B](f: ((K, V)) => B)(implicit cmp: math.Ordering[B]): (K, V)
  112.  def maxByOption[B](f: ((K, V)) => B)(implicit cmp: math.Ordering[B]): Option[(K, V)]
  113.  def maxOption[B >: (K, V)](implicit ord: math.Ordering[B]): Option[(K, V)]
  114.  def min[B >: (K, V)](implicit ord: math.Ordering[B]): (K, V)
  115.  def minAfter(key: K): Option[(K, V)]
  116.  def minBy[B](f: ((K, V)) => B)(implicit cmp: math.Ordering[B]): (K, V)
  117.  def minByOption[B](f: ((K, V)) => B)(implicit cmp: math.Ordering[B]): Option[(K, V)]
  118.  def minOption[B >: (K, V)](implicit ord: math.Ordering[B]): Option[(K, V)]
  119.  final def mkString: String
  120.  final def mkString(sep: String): String
  121.  final def mkString(start: String, sep: String, end: String): String
  122.  final def ne(arg0: AnyRef): Boolean
  123.  def newSpecificBuilder: Builder[(K, V), TreeMap[K, V]]
  124.  def nonEmpty: Boolean
  125.  final def notify(): Unit
  126.  final def notifyAll(): Unit
  127.  def orElse[A1 <: K, B1 >: V](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
  128.  implicit val ordering: Ordering[K]
  129.  def partition(p: ((K, V)) => Boolean): (TreeMap[K, V], TreeMap[K, V])
  130.  def partitionMap[A1, A2](f: ((K, V)) => Either[A1, A2]): (Iterable[A1], Iterable[A2])
  131.  def product[B >: (K, V)](implicit num: math.Numeric[B]): B
  132.  def put(key: K, value: V): Option[V]
  133.  def range(from: K, until: K): TreeMap[K, V]
  134.  def rangeFrom(from: K): TreeMap[K, V]
  135.  def rangeImpl(from: Option[K], until: Option[K]): TreeMap[K, V]
  136.  def rangeTo(to: K): TreeMap[K, V]
  137.  def rangeUntil(until: K): TreeMap[K, V]
  138.  def reduce[B >: (K, V)](op: (B, B) => B): B
  139.  def reduceLeft[B >: (K, V)](op: (B, (K, V)) => B): B
  140.  def reduceLeftOption[B >: (K, V)](op: (B, (K, V)) => B): Option[B]
  141.  def reduceOption[B >: (K, V)](op: (B, B) => B): Option[B]
  142.  def reduceRight[B >: (K, V)](op: ((K, V), B) => B): B
  143.  def reduceRightOption[B >: (K, V)](op: ((K, V), B) => B): Option[B]
  144.  def remove(key: K): Option[V]
  145.  def result(): TreeMap[K, V]
  146.  def reversed: collection.Iterable[(K, V)]
  147.  def runWith[U](action: (V) => U): (K) => Boolean
  148.  def scan[B >: (K, V)](z: B)(op: (B, B) => B): Iterable[B]
  149.  def scanLeft[B](z: B)(op: (B, (K, V)) => B): Iterable[B]
  150.  def scanRight[B](z: B)(op: ((K, V), B) => B): Iterable[B]
  151.  def size: Int
  152.  def sizeCompare(that: collection.Iterable[_]): Int
  153.  def sizeCompare(otherSize: Int): Int
  154.  final def sizeHint(coll: IterableOnce[_], delta: Int = 0): Unit
  155.  def sizeHint(size: Int): Unit
  156.  final def sizeHintBounded(size: Int, boundingColl: collection.Iterable[_]): Unit
  157.  final def sizeIs: SizeCompareOps
  158.  def slice(from: Int, until: Int): TreeMap[K, V]
  159.  def sliding(size: Int, step: Int): Iterator[TreeMap[K, V]]
  160.  def sliding(size: Int): Iterator[TreeMap[K, V]]
  161.  def sortedMapFactory: TreeMap
  162.  final def sortedMapFromIterable[K2, V2](it: collection.Iterable[(K2, V2)])(implicit ordering: Ordering[K2]): TreeMap[K2, V2]
  163.  def span(p: ((K, V)) => Boolean): (TreeMap[K, V], TreeMap[K, V])
  164.  def splitAt(n: Int): (TreeMap[K, V], TreeMap[K, V])
  165.  def stepper[S <: Stepper[_]](implicit shape: StepperShape[(K, V), S]): S with EfficientSplit
  166.  final def strictOptimizedCollect[B, C2](b: Builder[B, C2], pf: PartialFunction[(K, V), B]): C2
  167.  final def strictOptimizedConcat[B >: (K, V), C2](that: IterableOnce[B], b: Builder[B, C2]): C2
  168.  final def strictOptimizedFlatMap[B, C2](b: Builder[B, C2], f: ((K, V)) => IterableOnce[B]): C2
  169.  final def strictOptimizedFlatten[B, C2](b: Builder[B, C2])(implicit toIterableOnce: ((K, V)) => IterableOnce[B]): C2
  170.  final def strictOptimizedMap[B, C2](b: Builder[B, C2], f: ((K, V)) => B): C2
  171.  final def strictOptimizedZip[B, C2](that: IterableOnce[B], b: Builder[((K, V), B), C2]): C2
  172.  def stringPrefix: String
  173.  def subtractAll(xs: IterableOnce[K]): TreeMap.this.type
  174.  def subtractOne(elem: K): TreeMap.this.type
  175.  def sum[B >: (K, V)](implicit num: math.Numeric[B]): B
  176.  final def synchronized[T0](arg0: => T0): T0
  177.  def tail: TreeMap[K, V]
  178.  def tails: Iterator[TreeMap[K, V]]
  179.  def take(n: Int): TreeMap[K, V]
  180.  def takeRight(n: Int): TreeMap[K, V]
  181.  def takeWhile(p: ((K, V)) => Boolean): TreeMap[K, V]
  182.  def tapEach[U](f: ((K, V)) => U): TreeMap[K, V]
  183.  def to[C1](factory: Factory[(K, V), C1]): C1
  184.  def toArray[B >: (K, V)](implicit arg0: ClassTag[B]): Array[B]
  185.  final def toBuffer[B >: (K, V)]: Buffer[B]
  186.  def toIndexedSeq: immutable.IndexedSeq[(K, V)]
  187.  def toList: immutable.List[(K, V)]
  188.  def toMap[K, V](implicit ev: <:<[(K, V), (K, V)]): immutable.Map[K, V]
  189.  def toSeq: immutable.Seq[(K, V)]
  190.  def toSet[B >: (K, V)]: immutable.Set[B]
  191.  def toString(): String
  192.  def toVector: immutable.Vector[(K, V)]
  193.  def transpose[B](implicit asIterable: ((K, V)) => collection.Iterable[B]): Iterable[Iterable[B]]
  194.  def unapply(a: K): Option[V]
  195.  def unlift: PartialFunction[K, B]
  196.  def unsorted: Map[K, V]
  197.  def unzip[A1, A2](implicit asPair: ((K, V)) => (A1, A2)): (Iterable[A1], Iterable[A2])
  198.  def unzip3[A1, A2, A3](implicit asTriple: ((K, V)) => (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])
  199.  def update(key: K, value: V): Unit
  200.  def updateWith(key: K)(remappingFunction: (Option[V]) => Option[V]): Option[V]
  201.  def valueStepper[S <: Stepper[_]](implicit shape: StepperShape[V, S]): S with EfficientSplit
  202.  def values: collection.Iterable[V]
  203.  def valuesIterator: Iterator[V]
  204.  def valuesIteratorFrom(start: K): Iterator[V]
  205.  def view: MapView[K, V]
  206.  final def wait(): Unit
  207.  final def wait(arg0: Long, arg1: Int): Unit
  208.  final def wait(arg0: Long): Unit
  209.  def withDefault(d: (K) => V): SortedMap[K, V]
  210.  def withDefaultValue(d: V): SortedMap[K, V]
  211.  def withFilter(p: ((K, V)) => Boolean): SortedMapOps.WithFilter[K, V, [x]Iterable[x], [x, y]Map[x, y], [x, y]TreeMap[x, y]]
  212.  def writeReplace(): AnyRef
  213.  def zip[B](that: IterableOnce[B]): Iterable[((K, V), B)]
  214.  def zipAll[A1 >: (K, V), B](that: collection.Iterable[B], thisElem: A1, thatElem: B): Iterable[(A1, B)]
  215.  def zipWithIndex: Iterable[((K, V), Int)]
Deprecated Value Members
  1.  def +[V1 >: V](elem1: (K, V1), elem2: (K, V1), elems: (K, V1)*): TreeMap[K, V1]
  2.  def +[V1 >: V](kv: (K, V1)): TreeMap[K, V1]
  3.  def ++:[V1 >: V](that: IterableOnce[(K, V1)]): Map[K, V1]
  4.  def ++:[B >: (K, V)](that: IterableOnce[B]): Iterable[B]
  5.  final def +=(elem1: (K, V), elem2: (K, V), elems: (K, V)*): TreeMap.this.type
  6.  final def -(key1: K, key2: K, keys: K*): TreeMap[K, V]
  7.  final def -(key: K): TreeMap[K, V]
  8.  def --(keys: IterableOnce[K]): TreeMap[K, V]
  9.  def -=(elem1: K, elem2: K, elems: K*): TreeMap.this.type
  10.  def /:[B](z: B)(op: (B, (K, V)) => B): B
  11.  final def /:[B](z: B)(op: (B, (K, V)) => B): B
  12.  def :\[B](z: B)(op: ((K, V), B) => B): B
  13.  final def :\[B](z: B)(op: ((K, V), B) => B): B
  14.  def aggregate[B](z: => B)(seqop: (B, (K, V)) => B, combop: (B, B) => B): B
  15.  def collectFirst[B](f: PartialFunction[(K, V), B]): Option[B]
  16.  def companion: IterableFactory[[_]Iterable[_]]
  17.  def compare(k0: K, k1: K): Int
  18.  def copyToBuffer(dest: Buffer[(K, V)]): Unit
  19.  final def copyToBuffer[B >: (K, V)](dest: Buffer[B]): Unit
  20.  def count(f: ((K, V)) => Boolean): Int
  21.  def exists(f: ((K, V)) => Boolean): Boolean
  22.  def filter(f: ((K, V)) => Boolean): Iterator[(K, V)]
  23.  def filterKeys(p: (K) => Boolean): MapView[K, V]
  24.  def find(p: ((K, V)) => Boolean): Option[(K, V)]
  25.  def flatMap[B](f: ((K, V)) => IterableOnce[B]): IterableOnce[B]
  26.  def fold[A1 >: A](z: A1)(op: (A1, A1) => A1): A1
  27.  def foldLeft[B](z: B)(op: (B, (K, V)) => B): B
  28.  def foldRight[B](z: B)(op: ((K, V), B) => B): B
  29.  def forall(f: ((K, V)) => Boolean): Boolean
  30.  def foreach[U](f: ((K, V)) => U): Unit
  31.  def formatted(fmtstr: String): String
  32.  final def from(from: K): TreeMap[K, V]
  33.  def hasDefiniteSize: Boolean
  34.  def isEmpty: Boolean
  35.  def map[B](f: ((K, V)) => B): IterableOnce[B]
  36.  def mapValues[W](f: (V) => W): MapView[K, W]
  37.  def max(implicit ord: math.Ordering[(K, V)]): (K, V)
  38.  def maxBy[B](f: ((K, V)) => B)(implicit cmp: math.Ordering[B]): (K, V)
  39.  def min(implicit ord: math.Ordering[(K, V)]): (K, V)
  40.  def minBy[B](f: ((K, V)) => B)(implicit cmp: math.Ordering[B]): (K, V)
  41.  def mkString: String
  42.  def mkString(sep: String): String
  43.  def mkString(start: String, sep: String, end: String): String
  44.  def nonEmpty: Boolean
  45.  def product(implicit num: math.Numeric[(K, V)]): (K, V)
  46.  def reduce(f: ((K, V), (K, V)) => (K, V)): (K, V)
  47.  def reduceLeft(f: ((K, V), (K, V)) => (K, V)): (K, V)
  48.  def reduceLeftOption(f: ((K, V), (K, V)) => (K, V)): Option[(K, V)]
  49.  def reduceOption(f: ((K, V), (K, V)) => (K, V)): Option[(K, V)]
  50.  def reduceRight(f: ((K, V), (K, V)) => (K, V)): (K, V)
  51.  def reduceRightOption(f: ((K, V), (K, V)) => (K, V)): Option[(K, V)]
  52.  final def repr: TreeMap[K, V]
  53.  final def retain(p: (K, V) => Boolean): TreeMap.this.type
  54.  def sameElements[B >: A](that: IterableOnce[B]): Boolean
  55.  def seq: TreeMap.this.type
  56.  def size: Int
  57.  def sum(implicit num: math.Numeric[(K, V)]): (K, V)
  58.  def to[C1](factory: Factory[(K, V), C1]): C1
  59.  final def to(to: K): TreeMap[K, V]
  60.  def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]
  61.  def toBuffer[B >: A]: Buffer[B]
  62.  def toIndexedSeq: collection.IndexedSeq[(K, V)]
  63.  final def toIterable: collection.Iterable[(K, V)]
  64.  final def toIterable: TreeMap.this.type
  65.  def toIterator: Iterator[(K, V)]
  66.  final def toIterator: Iterator[(K, V)]
  67.  def toList: immutable.List[(K, V)]
  68.  def toMap[K, V](implicit ev: <:<[(K, V), (K, V)]): immutable.Map[K, V]
  69.  def toSeq: immutable.Seq[(K, V)]
  70.  def toSet[B >: A]: immutable.Set[B]
  71.  def toStream: immutable.Stream[(K, V)]
  72.  final def toStream: immutable.Stream[(K, V)]
  73.  final def toTraversable: collection.Traversable[(K, V)]
  74.  final def toTraversable: collection.Traversable[(K, V)]
  75.  def toVector: immutable.Vector[(K, V)]
  76.  final def transform(f: (K, V) => V): TreeMap.this.type
  77.  final def until(until: K): TreeMap[K, V]
  78.  def updated[V1 >: V](key: K, value: V1): TreeMap[K, V1]
  79.  def view(from: Int, until: Int): View[(K, V)]
  80.  def withFilter(f: ((K, V)) => Boolean): Iterator[(K, V)]
  81.  def →[B](y: B): (TreeMap[K, V], B)

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