TreeRelation

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. def apply(t: T): Vector[T]

   

   The image of a value of the relation's domain is a set of the values in the range that are related to that domain value.

   The image of a value of the relation's domain is a set of the values in the range that are related to that domain value.

   Definition Classes

   TreeRelation → Relation

5. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

6. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

7. def containsInDomain(t: T): Boolean

   

   Does the domain of this relation contain the value t?

   Does the domain of this relation contain the value t?

   Definition Classes

   Relation

8. def domain: Vector[T]

   

   The domain of this relation.

   The domain of this relation.

   Definition Classes

   Relation

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

   

   Definition Classes

   AnyRef

10. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

11. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    

    Definition Classes

    AnyRef → Any

13. def getGraph: Memoiser[T, Vector[T]]

    

    An accessor for the graph field for those rare cases where a client needs to get to it.

    An accessor for the graph field for those rare cases where a client needs to get to it.

    Definition Classes

    Relation

14. val graph: Memoiser[T, Vector[T]]

    

    Definition Classes

    TreeRelation → Relation

15. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

16. lazy val inverse: TreeRelation[T]

    

    Return a relation that is the inverse of this one.

    Return a relation that is the inverse of this one. In other words, if (t,u) is in the relation, then (u,t) is in the inverted relation.

    Definition Classes

    TreeRelation → Relation

17. val inverseGraph: Memoiser[T, Vector[T]]

    

    Definition Classes

    TreeRelation → Relation

18. def isEmpty: Boolean

    

    Is this relation empty (i.e., contains no pairs)?

    Is this relation empty (i.e., contains no pairs)?

    Definition Classes

    Relation

19. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

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

    

    Definition Classes

    AnyRef

21. final def notify(): Unit

    

    Definition Classes

    AnyRef

22. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

23. object pair

    

    An auxiliary extractor for this relation that returns the matched value t and its image as a sequence.

    An auxiliary extractor for this relation that returns the matched value t and its image as a sequence.

    Definition Classes

    Relation

24. def pairs: Vector[(T, T)]

    

    Return pairs that describe the mappings in this relation.

    Return pairs that describe the mappings in this relation. I.e., the pair (t,u) will be included if t is related to u.

    Definition Classes

    Relation

25. def put(t: T, u: T): Unit

    

    Add the pair (t,u) to the relation and the pair (u,t) to its inverse.

    Add the pair (t,u) to the relation and the pair (u,t) to its inverse.

    Definition Classes

    Relation

26. def putAll(t: T, us: Vector[T]): Unit

    

    For each u taken from us add the pair (t,u) to the relation and the pair (u,t) to its inverse.

    For each u taken from us add the pair (t,u) to the relation and the pair (u,t) to its inverse.

    Definition Classes

    Relation

27. def range: Vector[T]

    

    The range of this relation.

    The range of this relation.

    Definition Classes

    Relation

28. def set(t: T, us: Vector[T]): Unit

    

    Set the image of the relation for t to us.

    Set the image of the relation for t to us. Takes care to make sure that all mentioned nodes are present in the graph and the inverse graph.

29. def size: Long

    

    The size of this relation.

    The size of this relation.

    Definition Classes

    Relation

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

    

    Definition Classes

    AnyRef

31. def toString(): String

    

    Definition Classes

    AnyRef → Any

32. def unapplySeq(t: T): Option[Vector[T]]

    

    A relation can be used as an extractor that matches the image of the matched value t.

    A relation can be used as an extractor that matches the image of the matched value t. E.g., the pattern relation(a,b) succeeds if and only if the image of the matched value contains exactly two elements, which are then bound to a and b, respectively. Normal sequence matching works, such as case relation(a, _*) to match if there is at least one element in the image and bind the first element to a.

    Definition Classes

    Relation

33. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )