Node

abstract def addNode(n: Node): Node

abstract def clone(paths: List[Node], variadic: Leaf, end: Leaf): Node

abstract def end: Leaf

abstract def matchString(s: String, stack: HList): HList

abstract def paths: List[Node]

abstract def replaceNode(o: Node, n: Node): Node

abstract def variadic: Leaf

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def append(tail: PathRule, action: Leaf): Node

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def replace(o: Node, n: Node): List[Node]

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 walkTree(req: Key): RouteResult[Value]

This function traverses the tree, matching paths in order of priority, provided they path the matches function: 1: exact matches are given priority to wild cards node at a time This means /"foo"/wild has priority over /wild/"bar" for the route "/foo/bar"