cheshire

package cheshire

Members list

Concise view

Type members

Classlikes

sealed abstract class GenTree[+N, +L]

Attributes

Companion:
object
Source:
Tree.scala
Graph
Supertypes
class Object
trait Matchable
class Any
Known subtypes
class Leaf[L]
class Node[N, L]
object GenTree

Attributes

Companion:
class
Source:
Tree.scala
Graph
Supertypes
trait Sum
trait Mirror
class Object
trait Matchable
class Any
Self type
GenTree.type
object ZipTree

Attributes

Source:
Tree.scala
Graph
Supertypes
class Object
trait Matchable
class Any
Self type
ZipTree.type

Types

type Tree[A] = GenTree[A, A]

Attributes

Source:
Tree.scala
opaque type ZipTree[+A]

Attributes

Source:
Tree.scala

Extensions

Extensions

extension [A](tree: Tree[A])
def coflatMap[B](f: Tree[A] => B): Tree[B]

Attributes

Source:
Tree.scala
def coflatTraverse[F[_], B](f: Tree[A] => F[B])(using evidence$6: Apply[F]): F[Tree[B]]

Attributes

Source:
Tree.scala
def flatMap[B](f: A => Tree[B]): Tree[B]

Attributes

Source:
Tree.scala
def flatTraverse[F[_], B](f: A => F[Tree[B]])(using evidence$5: Apply[F]): F[Tree[B]]

Attributes

Source:
Tree.scala
def map[B](f: A => B): Tree[B]

Attributes

Source:
Tree.scala
def mapWithButton[B](f: Button[A, A] => B): Tree[B]

Attributes

Source:
Tree.scala
def mapWithChildren[B](f: A => B)(g: (A, A, A) => B): Tree[B]

Attributes

Source:
Tree.scala
def mapWithOrientedParent[B](f: A => B)(g: (Oriented[A], A) => B): Tree[B]

Attributes

Source:
Tree.scala
def mapWithParent[B](f: A => B)(g: (A, A) => B): Tree[B]

Attributes

Source:
Tree.scala
def scanPreOrder[B](f: A => B)(g: (B, A) => B): Tree[B]

Attributes

Source:
Tree.scala
def scanPreOrderM[F[_], B](f: A => F[B])(g: (B, A) => F[B])(using evidence$8: Monad[F]): F[Tree[B]]

Attributes

Source:
Tree.scala
def scanPreOrderOriented[B](f: A => B)(g: (Oriented[B], A) => B): Tree[B]

Attributes

Source:
Tree.scala
def scanPreOrderOrientedM[F[_], B](f: A => F[B])(g: (Oriented[B], A) => F[B])(using evidence$9: Monad[F]): F[Tree[B]]

Attributes

Source:
Tree.scala
def traverse[F[_], B](f: A => F[B])(using evidence$1: Apply[F]): F[Tree[B]]

Attributes

Source:
Tree.scala
def traverseWithButton[F[_], B](f: Button[A, A] => F[B])(using evidence$7: Monad[F]): F[Tree[B]]

Attributes

Source:
Tree.scala
def traverseWithChildren[F[_], B](f: A => F[B])(g: (A, A, A) => F[B])(using evidence$4: Apply[F]): F[Tree[B]]

Attributes

Source:
Tree.scala
def traverseWithOrientedParent[F[_], B](f: A => F[B])(g: (Oriented[A], A) => F[B])(using evidence$3: Apply[F]): F[Tree[B]]

Attributes

Source:
Tree.scala
def traverseWithParent[F[_], B](f: A => F[B])(g: (A, A) => F[B])(using evidence$2: Applicative[F]): F[Tree[B]]

Attributes

Source:
Tree.scala
def value: A

Attributes

Source:
Tree.scala
def zip[B](that: Tree[B]): Tree[(A, B)]

Attributes

Source:
Tree.scala
def zipWith[B, Z](that: Tree[B])(f: (A, B) => Z): Tree[Z]

Attributes

Source:
Tree.scala
def zipWithM[F[_], B, Z](that: Tree[B])(f: (A, B) => F[Z])(using evidence$10: Monad[F]): F[Tree[Z]]

Attributes

Source:
Tree.scala