cheshire
0.0-a15137f
API
Generated with
© 2002-2021 · LAMP/EPFL
© 2002-2021 · LAMP/EPFL
cheshire/cheshire/GenTree

GenTree

cheshire.GenTree
See theGenTree companion object
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]

Members list

Concise view

Value members

Abstract methods

def isLeaf: Boolean

Attributes

Source:
Tree.scala
def leftOption: Option[GenTree[N, L]]

Attributes

Source:
Tree.scala
def rightOption: Option[GenTree[N, L]]

Attributes

Source:
Tree.scala
def valueEither: Either[N, L]

Attributes

Source:
Tree.scala

Concrete methods

final def ===[N1 >: N, L1 >: L](that: GenTree[N1, L1])(using evidence$30: Eq[N1], evidence$31: Eq[L1]): Boolean

Attributes

Source:
Tree.scala
final def bimap[N1, L1](f: N => N1, g: L => L1): GenTree[N1, L1]

Attributes

Source:
Tree.scala
final def bitraverse[F[_], N1, L1](f: N => F[N1], g: L => F[L1])(using evidence$25: Apply[F]): F[GenTree[N1, L1]]

Attributes

Source:
Tree.scala
final def button: Button[N, L]

Attributes

Source:
Tree.scala
final def isLeft[N1 >: N, L1 >: L](that: GenTree[N1, L1])(using evidence$15: Eq[N1], evidence$16: Eq[L1]): Boolean

Attributes

Source:
Tree.scala
final def isLeftOf[N1 >: N, L1 >: L](that: GenTree[N1, L1])(using evidence$17: Eq[N1], evidence$18: Eq[L1]): Boolean

Attributes

Source:
Tree.scala
final def isRight[N1 >: N, L1 >: L](that: GenTree[N1, L1])(using evidence$19: Eq[N1], evidence$20: Eq[L1]): Boolean

Attributes

Source:
Tree.scala
final def isRightOf[N1 >: N, L1 >: L](that: GenTree[N1, L1])(using evidence$21: Eq[N1], evidence$22: Eq[L1]): Boolean

Attributes

Source:
Tree.scala
final def leafCount: Int

Attributes

Source:
Tree.scala
final def nodeCount: Int

Attributes

Source:
Tree.scala
final def postOrder[F[_]](f: Button[N, L] => F[Unit])(using evidence$29: Monad[F]): F[Unit]

Attributes

Source:
Tree.scala
final def preOrder[F[_]](f: Button[N, L] => F[Unit])(using evidence$28: Monad[F]): F[Unit]

Attributes

Source:
Tree.scala
final def reducePostOrder[Z](f: L => Z)(g: (Z, Z, N) => Z): Z

Attributes

Source:
Tree.scala
final def reducePostOrderM[F[_], Z](f: L => F[Z])(g: (Z, Z, N) => F[Z])(using evidence$26: Monad[F]): F[Z]

Attributes

Source:
Tree.scala
final def scanPostOrder[Z](f: L => Z)(g: (Z, Z, N) => Z): GenTree[Z, Z]

Attributes

Source:
Tree.scala
final def scanPostOrderM[F[_], Z](f: L => F[Z])(g: (Z, Z, N) => F[Z])(using evidence$27: Monad[F]): F[GenTree[Z, Z]]

Attributes

Source:
Tree.scala
final def show[N1 >: N, L1 >: L](using evidence$32: Show[N1], evidence$33: Show[L1]): String

Attributes

Source:
Tree.scala
final def sibling[N1 >: N, L1 >: L](that: GenTree[N1, L1])(using evidence$23: Eq[N1], evidence$24: Eq[L1]): Option[GenTree[N1, L1]]

Attributes

Source:
Tree.scala
final def size: Int

Attributes

Source:
Tree.scala
final def startPostOrder: Button[N, L]

Attributes

Source:
Tree.scala
final def startPreOrder: Button[N, L]

Attributes

Source:
Tree.scala
Generated with
© 2002-2021 · LAMP/EPFL
© 2002-2021 · LAMP/EPFL