Instance Constructors
-
new
Leaf(value: V, canBeSequence: Boolean = true)
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
-
-
-
def
bimap[K2, V2](f: (Nothing) ⇒ K2, g: (V) ⇒ V2): PropertyTree[K2, V2]
-
val
canBeSequence: Boolean
-
def
clone(): AnyRef
-
-
def
finalize(): Unit
-
-
final
def
flatten[K1 >: Nothing, V1 >: V]: Map[Vector[K1], ::[V1]]
-
final
def
flattenKeyAndValue[K1 >: Nothing, V1 >: V](pathDelimiter: String = ".", valueDelimiter: String = ":")(implicit KS: =:=[K1, String]): Map[String, String]
-
final
def
flattenKeyWith[K1 >: Nothing, V1 >: V](f: (K1) ⇒ String)(appendPath: String): Map[String, ::[V1]]
-
final
def
flattenString[K1 >: Nothing, V1 >: V](pathDelimiter: String = ".")(implicit KS: =:=[K1, String]): Map[String, ::[V1]]
-
final
def
getClass(): Class[_]
-
final
def
getOrElse[K1 >: Nothing, V1 >: V](tree: ⇒ PropertyTree[K1, V1]): PropertyTree[K1, V1]
-
-
final
def
isEmpty: Boolean
-
final
def
isInstanceOf[T0]: Boolean
-
-
-
-
final
def
mapKey[K2](f: (Nothing) ⇒ K2): PropertyTree[K2, V]
-
-
-
final
def
nonEmpty: Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
val
value: V
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-