class UniqueGraph extends LabeledHashRelation[Term, Term]
A diagram of theories and morphisms with at most one edge between any two nodes. Morph.simplify is used to normalize paths, and equality of paths is checked by comparing normal forms; this criterion is sound and efficient but not complete.
- Source
- ImplicitGraph.scala
- Alphabetic
- By Inheritance
- UniqueGraph
- LabeledHashRelation
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
apply(from: Term, to: Term): Option[Term]
retrieves the label of the pair (from,to), if any
retrieves the label of the pair (from,to), if any
- Definition Classes
- LabeledHashRelation
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clear: Unit
- Definition Classes
- LabeledHashRelation
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
into(to: Term): HashSet[(Term, Term)]
retrieves all pairs (FROM,VALUE) for to
retrieves all pairs (FROM,VALUE) for to
- Definition Classes
- LabeledHashRelation
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
outOf(from: Term): HashSet[(Term, Term)]
retrieves all pairs (TO,VALUE) for from
retrieves all pairs (TO,VALUE) for from
- Definition Classes
- LabeledHashRelation
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- LabeledHashRelation → AnyRef → Any
-
def
update(from: Term, to: Term, morph: Term): Unit
overrides update to check for existing morphisms
overrides update to check for existing morphisms
throws AlreadyDefined if an implicit morphism between the same theories already exists
- Definition Classes
- UniqueGraph → LabeledHashRelation
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()