class ThinGeneratedCategory extends AnyRef
maintains a thin diagram of theories This is the category generated by some edges that is guaranteed to be thin (i.e., at most one morphism between any two objects) i.e., all paths between two nodes must be equal. UniqueGraph is used to maintain the generated category, see its description for the treatment of equality. The generated category is precomputed so that retrieval of morphisms takes constant and insertion up to quadratic time.
- Source
- ImplicitGraph.scala
- Alphabetic
- By Inheritance
- ThinGeneratedCategory
- 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 implicit morphism between two theories (if any)
retrieves the implicit morphism between two theories (if any)
- from
domain
- to
codomain
- returns
the implicit morphism if one exists
- def applyAtomic(from: MPath, to: MPath): Option[Term]
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clear: Unit
-
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,morph) for to
-
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,morph) for from
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
def
update(from: Term, to: Term, morph: Term): Unit
adds an implicit morphism
adds an implicit morphism
- from
domain
- to
codomain
- morph
the morphism throws AlreadyDefined if an implicit morphism m between the same theories already exists
-
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()