sealed
trait
PropertyTree[+K, +V] extends AnyRef
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
-
-
def
finalize(): Unit
-
final
def
flatten[K1 >: K, V1 >: V]: Map[Vector[K1], ::[V1]]
-
final
def
flattenKeyAndValue[K1 >: K, V1 >: V](pathDelimiter: String = ".", valueDelimiter: String = ":")(implicit KS: =:=[K1, String]): Map[String, String]
-
final
def
flattenKeyWith[K1 >: K, V1 >: V](f: (K1) ⇒ String)(appendPath: String): Map[String, ::[V1]]
-
final
def
flattenString[K1 >: K, V1 >: V](pathDelimiter: String = ".")(implicit KS: =:=[K1, String]): Map[String, ::[V1]]
-
final
def
getClass(): Class[_]
-
final
def
getOrElse[K1 >: K, V1 >: V](tree: ⇒ PropertyTree[K1, V1]): PropertyTree[K1, V1]
-
final
def
getPath[K1 >: K](k: List[K1]): PropertyTree[K1, V]
-
def
hashCode(): Int
-
final
def
isEmpty: Boolean
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
map[V2](f: (V) ⇒ V2): PropertyTree[K, V2]
-
final
def
mapEmpty[K1 >: K, V1 >: V](f: (Vector[Either[Int, K1]]) ⇒ PropertyTree[K1, V1]): PropertyTree[K1, V1]
-
final
def
mapEmptyToError[E, V2](f: ⇒ E): PropertyTree[K, Either[E, V]]
-
final
def
merge[K1 >: K, V1 >: V](that: PropertyTree[K1, V1]): List[PropertyTree[K1, V1]]
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
reduceInner[V1 >: V](f: (V1, V1) ⇒ V1): PropertyTree[K, V1]
-
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
-
final
def
zip[K1 >: K, V2, V3](that: PropertyTree[K1, V2]): PropertyTree[K1, (V, V2)]
-
final
def
zipWith[K1 >: K, V2, V3](that: PropertyTree[K1, V2])(f: (V, V2) ⇒ V3): PropertyTree[K, V3]
