object
SimplifiedInstances
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
implicit
def
list[A](implicit arg0: ToRefTree[A]): ToRefTree[List[A]]
-
implicit
def
map[A, B](implicit arg0: ToRefTree[A], arg1: ToRefTree[B]): ToRefTree[Map[A, B]]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
implicit
def
option[A](implicit arg0: ToRefTree[A]): ToRefTree[Option[A]]
-
implicit
def
seq[A](implicit arg0: ToRefTree[A]): ToRefTree[Seq[A]]
-
implicit
def
string: ToRefTree[String]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
This object includes several simplified RefTree representations that can be used for the benefit of visualization:
option
“unboxes” Option, representing None withnull
and Some with its inner value;list
andseq
hide implementation details from Lists and Seqs respectively, as if they were simple Arrays;map
represents a “fictional” high-level map with no internal structure.