sealed trait PropertyTree[+K, +V] extends AnyRef
- Self Type
- PropertyTree[K, V]
- Annotations
- @silent( "Unused import" )
Linear Supertypes
Known Subclasses
Ordering
- Alphabetic
- By Inheritance
Inherited
- PropertyTree
- 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
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
final
def
at[K1 >: K](propertyTreePath: PropertyTreePath[K1]): PropertyTree[K1, V]
atallows us to fetch a sub-tree from property-treeatallows us to fetch a sub-tree from property-treeExample:
Given a config: { x : [ a, b, c ] } at("x") // returns Some([a, b, c]) at("x").atIndex(2) // returns Some(Leaf("c")) at("x").atKey("y") // returns None Similarly, given a more complex config: { x : [ { y1: 1 y2: 2 y3: 3 } { y1: 1 y2: 2 y3: 3 } ] } at("x").atIndex(0).atKey("y1") // returns Some(Leaf(v1) - final def atIndex[K1 >: K](index: Int): Option[PropertyTree[K1, V]]
- final def atKey[K1 >: K](key: K1): Option[PropertyTree[K1, V]]
- def bimap[K2, V2](f: (K) ⇒ K2, g: (V) ⇒ V2): PropertyTree[K2, V2]
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
- def flatMap[K1 >: K, V1](f: (V) ⇒ PropertyTree[K1, V1]): PropertyTree[K1, V1]
- 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[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- 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
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- final def isEmpty: Boolean
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def leafNotASequence: PropertyTree[K, V]
- final def map[V2](f: (V) ⇒ V2): PropertyTree[K, V2]
- final def mapEither[E, V2](f: (V) ⇒ Either[E, V2]): Either[E, PropertyTree[K, V2]]
- final def mapKey[K2](f: (K) ⇒ K2): PropertyTree[K2, V]
- final def merge[K1 >: K, V1 >: V](that: PropertyTree[K1, V1]): List[PropertyTree[K1, V1]]
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def nonEmpty: Boolean
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
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
- @throws( ... ) @native()
- def zip[K1 >: K, V1](that: PropertyTree[K1, V1]): PropertyTree[K1, (V, V1)]