cheshire/cheshire/GenTree/Node

Node

final case
class Node[+N, +L](value: N, left: GenTree[N, L], right: GenTree[N, L]) extends GenTree[N, L]
trait Serializable
trait Product
trait Equals
class GenTree[N, L]
class Object
trait Matchable
class Any

Value members

Concrete methods

override
def isLeaf: Boolean
Definition Classes
override
def leftOption: Option[GenTree[N, L]]
Definition Classes
override
def rightOption: Option[GenTree[N, L]]
Definition Classes
override
def valueEither: Either[N, L]
Definition Classes

Inherited methods

final
def ===[N1 >: N, L1 >: L](that: GenTree[N1, L1])(using evidence$30: Eq[N1], evidence$31: Eq[L1]): Boolean
Inherited from
GenTree
final
def bimap[N1, L1](f: N => N1, g: L => L1): GenTree[N1, L1]
Inherited from
GenTree
final
def bitraverse[F[_], N1, L1](f: N => F[N1], g: L => F[L1])(using evidence$25: Apply[F]): F[GenTree[N1, L1]]
Inherited from
GenTree
final
def button: Button[N, L]
Inherited from
GenTree
final
def isLeft[N1 >: N, L1 >: L](that: GenTree[N1, L1])(using evidence$15: Eq[N1], evidence$16: Eq[L1]): Boolean
Inherited from
GenTree
final
def isLeftOf[N1 >: N, L1 >: L](that: GenTree[N1, L1])(using evidence$17: Eq[N1], evidence$18: Eq[L1]): Boolean
Inherited from
GenTree
final
def isRight[N1 >: N, L1 >: L](that: GenTree[N1, L1])(using evidence$19: Eq[N1], evidence$20: Eq[L1]): Boolean
Inherited from
GenTree
final
def isRightOf[N1 >: N, L1 >: L](that: GenTree[N1, L1])(using evidence$21: Eq[N1], evidence$22: Eq[L1]): Boolean
Inherited from
GenTree
final
def leafCount: Int
Inherited from
GenTree
final
def nodeCount: Int
Inherited from
GenTree
final
def postOrder[F[_]](f: Button[N, L] => F[Unit])(using evidence$29: Monad[F]): F[Unit]
Inherited from
GenTree
final
def preOrder[F[_]](f: Button[N, L] => F[Unit])(using evidence$28: Monad[F]): F[Unit]
Inherited from
GenTree
def productElementNames: Iterator[String]
Inherited from
Product
def productIterator: Iterator[Any]
Inherited from
Product
final
def reducePostOrder[Z](f: L => Z)(g: (Z, Z, N) => Z): Z
Inherited from
GenTree
final
def reducePostOrderM[F[_], Z](f: L => F[Z])(g: (Z, Z, N) => F[Z])(using evidence$26: Monad[F]): F[Z]
Inherited from
GenTree
final
def scanPostOrder[Z](f: L => Z)(g: (Z, Z, N) => Z): GenTree[Z, Z]
Inherited from
GenTree
final
def scanPostOrderM[F[_], Z](f: L => F[Z])(g: (Z, Z, N) => F[Z])(using evidence$27: Monad[F]): F[GenTree[Z, Z]]
Inherited from
GenTree
final
def show[N1 >: N, L1 >: L](using evidence$32: Show[N1], evidence$33: Show[L1]): String
Inherited from
GenTree
final
def sibling[N1 >: N, L1 >: L](that: GenTree[N1, L1])(using evidence$23: Eq[N1], evidence$24: Eq[L1]): Option[GenTree[N1, L1]]
Inherited from
GenTree
final
def size: Int
Inherited from
GenTree
final
def startPostOrder: Button[N, L]
Inherited from
GenTree
final
def startPreOrder: Button[N, L]
Inherited from
GenTree