package algebra
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- algebra
- 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 bytewise(left: Array[Byte])(right: Array[Byte])(op: (Byte, Byte) => Byte): Array[Byte]
- implicit def catsifyAdditiveGroup[T](ag: AdditiveGroup[T]): Group[T]
- def chain[A, B, M[_], C[_]](a: A, f: (A) => M[Option[B]], g: (B) => A, empty: C[B], combine: (B) => (C[B]) => C[B])(implicit arg0: Monad[M]): M[C[B]]
- def dummy[T]: T
- implicit def enrichMutableBuffer[T](buffer: Buffer[T]): EnrichedMutableBuffer[T]
- def etc[N](n: N)(implicit ringN: Ring[N]): Iterable[N]
- def filterOut[T](xs: Iterator[T], skips: Iterator[T])(implicit orderT: Order[T]): Iterator[T]
- def foled[A, B, M[_]](a: A, f: (A) => M[Option[B]], g: (B) => A)(implicit arg0: Monad[M]): M[Option[B]]
- 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 lastOption[T](it: Iterator[T]): Option[T]
- def lazyListsFrom[N](n: N)(implicit orderN: Order[N], ringN: Ring[N]): LazyList[N]
- def mergeBufferedIterators[T](iterators: Seq[BufferedIterator[T]])(implicit orderT: Order[T]): Iterator[T]
- 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)]
- def skip[T](bufferedXs: BufferedIterator[T], bufferedSkips: BufferedIterator[T])(implicit orderT: Order[T]): Unit
- def tensorProduct[T](xs: Vector[T], ys: Vector[T])(implicit multT: MultiplicativeSemigroup[T]): Vector[T]
- def terminatesWithin[T](it: Iterator[T])(k: Int): Boolean
- def trace[N](f: (N) => N, x0: N): Iterator[(N, Set[N])]
- def ⊕(left: Array[Byte])(right: Array[Byte]): Array[Byte]