Packages

implicit object Input extends MapTree[String, List[String]]

Linear Supertypes
uniform.MapTree[String, List[String]], TreeLike[Map[List[String], List[String]]], Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Input
  2. MapTree
  3. TreeLike
  4. Serializable
  5. AnyRef
  6. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Type Members

  1. type Key = String
    Definition Classes
    MapTree → TreeLike
  2. type T = Map[List[String], List[String]]
    Definition Classes
    MapTree
  3. type Value = List[String]
    Definition Classes
    MapTree → TreeLike

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. def /(a: Map[List[String], List[String]], key: Key): Map[List[String], List[String]]

    gives the subtree at a given key

    gives the subtree at a given key

    Definition Classes
    TreeLike
  4. def /?(a: Map[List[String], List[String]], key: Key): Option[Map[List[String], List[String]]]
    Definition Classes
    TreeLike
  5. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  6. def appendWith(a: T, key: Key): T
    Definition Classes
    MapTree → TreeLike
  7. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  8. def atPath(a: Map[List[String], List[String]], path: List[Key]): Map[List[String], List[String]]

    gives the subtree at a given path

    gives the subtree at a given path

    Definition Classes
    TreeLike
  9. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
  10. def definedAt(a: Map[List[String], List[String]], key: Key): Boolean

    returns 'true' if there is a subtree at the given key

    returns 'true' if there is a subtree at the given key

    Definition Classes
    TreeLike
  11. def definedAtPath(a: Map[List[String], List[String]], key: List[Key]): Boolean

    returns 'true' if there is a subtree at the given path

    returns 'true' if there is a subtree at the given path

    Definition Classes
    TreeLike
  12. def definedAtRoot(a: Map[List[String], List[String]]): Boolean

    returns 'true' if there is a subtree at the given path

    returns 'true' if there is a subtree at the given path

    Definition Classes
    TreeLike
  13. val empty: Map[List[String], List[String]]

    a null-graph (no verticies/K0)

    a null-graph (no verticies/K0)

    Definition Classes
    MapTree → TreeLike
  14. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  15. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  16. def fromUrlEncodedString(in: String): Either[ErrorTree, Input]

    Extract an Input from a UTF-8 URL encoded String.

  17. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  18. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  19. def isEmpty(a: Map[List[String], List[String]]): Boolean
    Definition Classes
    TreeLike
  20. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  21. def isNonEmpty(a: Map[List[String], List[String]]): Boolean
    Definition Classes
    TreeLike
  22. def listSubtrees(a: T): List[Key]
    Definition Classes
    MapTree → TreeLike
  23. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  24. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  25. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  26. def one(in: Value): T

    create a tree with a single vertex (a singleton graph)

    create a tree with a single vertex (a singleton graph)

    Definition Classes
    MapTree → TreeLike
  27. def prefixWith(a: T, key: Key): T

    Add an key to the start of each existing key, effectively creating a new tree with the existing tree as a single subtree

    Add an key to the start of each existing key, effectively creating a new tree with the existing tree as a single subtree

    Definition Classes
    MapTree → TreeLike
  28. def prefixWithMany(value: Map[List[String], List[String]], key: List[Key]): Map[List[String], List[String]]
    Definition Classes
    TreeLike
  29. def subTree(a: T, key: Key): T

    gives the subtree at a given key

    gives the subtree at a given key

    Definition Classes
    MapTree → TreeLike
  30. def subTreeOpt(a: T, key: Key): Option[T]
    Definition Classes
    MapTree → TreeLike
  31. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  32. def toString(): String
    Definition Classes
    AnyRef → Any
  33. def valueAt(a: Map[List[String], List[String]], key: Key): Option[Value]
    Definition Classes
    TreeLike
  34. def valueAtPath(a: Map[List[String], List[String]], key: List[Key]): Option[Value]
    Definition Classes
    TreeLike
  35. def valueAtRoot(a: T): Option[Value]
    Definition Classes
    MapTree → TreeLike
  36. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  37. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  38. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated

Inherited from uniform.MapTree[String, List[String]]

Inherited from TreeLike[Map[List[String], List[String]]]

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped