object StrictTree extends StrictTreeInstances with Serializable
- Source
- StrictTree.scala
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- StrictTree
- Serializable
- Serializable
- StrictTreeInstances
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- implicit def ToStrictTreeUnzip[A1, A2](root: StrictTree[(A1, A2)]): StrictTreeUnzip[A1, A2]
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
implicit
val
strictTreeInstance: Traverse1[StrictTree] with Monad[StrictTree] with Comonad[StrictTree] with Align[StrictTree] with Zip[StrictTree]
- Definition Classes
- StrictTreeInstances
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
implicit
def
treeEqual[A](implicit A0: Equal[A]): Equal[StrictTree[A]]
- Definition Classes
- StrictTreeInstances
-
implicit
def
treeOrder[A](implicit A0: Order[A]): Order[StrictTree[A]]
- Definition Classes
- StrictTreeInstances
- def unfoldForest[A, B](s: Vector[A])(f: (A) ⇒ (B, Vector[A])): Vector[StrictTree[B]]
- def unfoldTree[A, B](v: A)(f: (A) ⇒ (B, Vector[A])): StrictTree[B]
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
object
Leaf
Leaf represents a tree node with no children.
Leaf represents a tree node with no children.
You can use Leaf for tree construction or pattern matching.
-
object
Node
Node represents a tree node that may have children.
Node represents a tree node that may have children.
You can use Node for tree construction or pattern matching.