PropertyTree

Value Members

1. final def !=(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

4. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

5. final def at[K1 >: K](propertyTreePath: PropertyTreePath[K1]): PropertyTree[K1, V]

   

   at allows us to fetch a sub-tree from property-tree

   at allows us to fetch a sub-tree from property-tree

   Example:

   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)

6. final def atIndex[K1 >: K](index: Int): Option[PropertyTree[K1, V]]

   

7. final def atKey[K1 >: K](key: K1): Option[PropertyTree[K1, V]]

   

8. def bimap[K2, V2](f: (K) ⇒ K2, g: (V) ⇒ V2): PropertyTree[K2, V2]

   

9. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

10. final def eq(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

11. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

12. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

13. def flatMap[K1 >: K, V1](f: (V) ⇒ PropertyTree[K1, V1]): PropertyTree[K1, V1]

    

14. final def flatten[K1 >: K, V1 >: V]: Map[Vector[K1], ::[V1]]

    

15. final def flattenKeyAndValue[K1 >: K, V1 >: V](pathDelimiter: String = ".", valueDelimiter: String = ":")(implicit KS: =:=[K1, String]): Map[String, String]

    

16. final def flattenKeyWith[K1 >: K, V1 >: V](f: (K1) ⇒ String)(appendPath: String): Map[String, ::[V1]]

    

17. final def flattenString[K1 >: K, V1 >: V](pathDelimiter: String = ".")(implicit KS: =:=[K1, String]): Map[String, ::[V1]]

    

18. final def getClass(): Class[_]

    

    Definition Classes

    AnyRef → Any

19. final def getOrElse[K1 >: K, V1 >: V](tree: ⇒ PropertyTree[K1, V1]): PropertyTree[K1, V1]

    

20. final def getPath[K1 >: K](k: List[K1]): PropertyTree[K1, V]

    

21. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

22. final def isEmpty: Boolean

    

23. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

24. def leafNotASequence: PropertyTree[K, V]

    

25. final def map[V2](f: (V) ⇒ V2): PropertyTree[K, V2]

    

26. final def mapEither[E, V2](f: (V) ⇒ Either[E, V2]): Either[E, PropertyTree[K, V2]]

    

27. final def mapKey[K2](f: (K) ⇒ K2): PropertyTree[K2, V]

    

28. final def merge[K1 >: K, V1 >: V](that: PropertyTree[K1, V1]): List[PropertyTree[K1, V1]]

    

29. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

30. final def nonEmpty: Boolean

    

31. final def notify(): Unit

    

    Definition Classes

    AnyRef

32. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

33. final def synchronized[T0](arg0: ⇒ T0): T0

    

    Definition Classes

    AnyRef

34. def toString(): String

    

    Definition Classes

    AnyRef → Any

35. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

36. final def wait(arg0: Long, arg1: Int): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

37. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

38. def zip[K1 >: K, V1](that: PropertyTree[K1, V1]): PropertyTree[K1, (V, V1)]