final
class
Tree extends PartialFunction[String, Info]
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
def
ancestors(name: String): List[String]
-
def
andThen[C](k: (Info) ⇒ C): PartialFunction[String, C]
-
def
apply(name: String): Info
-
def
applyOrElse[A1 <: String, B1 >: Info](x: A1, default: (A1) ⇒ B1): B1
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
compose[A](g: (A) ⇒ String): (A) ⇒ Info
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
val
graph: Graph[String, Info]
-
def
hashCode(): Int
-
def
isDefinedAt(name: String): Boolean
-
final
def
isInstanceOf[T0]: Boolean
-
def
lift: (String) ⇒ Option[Info]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
orElse[A1 <: String, B1 >: Info](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
-
def
runWith[U](action: (Info) ⇒ U): (String) ⇒ Boolean
-
def
selection(requirements: Boolean = false, all_sessions: Boolean = false, exclude_session_groups: List[String] = Nil, exclude_sessions: List[String] = Nil, session_groups: List[String] = Nil, sessions: List[String] = Nil): (List[String], Tree)
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
def
topological_order: List[(String, Info)]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from PartialFunction[String, Info]
Inherited from (String) ⇒ Info
Inherited from AnyRef
Inherited from Any
