p
axle
package axle
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- axle
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Value Members
- def applyForever[N](f: (N) => N, x0: N): Iterator[N]
- def applyK[N](f: (N) => N, x0: N, k: Int): N
- def dummy[T]: T
- implicit def enrichArray[T](arr: Array[T])(implicit arg0: ClassTag[T]): EnrichedArray[T]
- implicit def enrichByteArray(barr: Array[Byte]): EnrichedByteArray
- implicit def enrichIndexedSeq[T](is: IndexedSeq[T]): EnrichedIndexedSeq[T]
- implicit def enrichInt(n: Int): EnrichedInt
- implicit def enrichIterable[T](ita: Iterable[T]): EnrichedIterable[T]
- implicit def enrichIterator[T](it: Iterator[T]): EnrichedIterator[T]
- implicit def enrichMutableBuffer[T](buffer: Buffer[T]): EnrichedMutableBuffer[T]
- implicit def eqIterable[T](implicit eqT: Eq[T]): Eq[Iterable[T]]
- implicit def eqSeq[T](implicit eqT: Eq[T]): Eq[Seq[T]]
- implicit val eqSymbol: Eq[Symbol]
- implicit def eqTreeMap[K, V](implicit eqK: Eq[K], eqV: Eq[V]): Eq[TreeMap[K, V]]
- def filterOut[T](stream: LazyList[T], toRemove: LazyList[T])(implicit orderT: Order[T]): LazyList[T]
- def gaps[T](xs: Seq[T])(implicit ringT: Ring[T]): Seq[(T, T)]
- def id[A](x: A): A
- def ignore[T]: (T) => Unit
- def intersperse[T](d: T)(l: List[T]): List[T]
- def lazyListsFrom[N](n: N)(implicit orderN: Order[N], ringN: Ring[N]): LazyList[N]
- def mergeStreams[T](streams: Seq[LazyList[T]])(implicit orderT: Order[T]): LazyList[T]
- def orbit[N](f: (N) => N, x0: N, close: (N) => (N) => Boolean): List[N]
- def print[T](t: T)(implicit arg0: Show[T]): Unit
- def replicate[T](n: Int)(v: T): List[T]
- def reverse[T](l: List[T]): List[T]
- def runs[T](xs: Seq[T])(implicit ringT: Ring[T], orderT: Order[T]): Seq[(T, T)]
- def runs[T](xs: Seq[T], breaks: Set[T]): Seq[(T, T)]
- implicit val showChar: Show[Char]
- def showDoubleWithPrecision(p: Int): Show[Double]
- implicit val showNode: Show[Node]
- implicit val showRational: Show[Rational]
- implicit def showSymbol: Show[Symbol]
- def shuffle[T](xs: List[T])(gen: Generator): List[T]
- def trace[N](f: (N) => N, x0: N): Iterator[(N, Set[N])]
- val ∀: forall.type
- val ∃: thereexists.type