Packages

  • package root
    Definition Classes
    root
  • package info
    Definition Classes
    root
  • package kwarc
    Definition Classes
    info
  • package mmt
    Definition Classes
    kwarc
  • package api

    This is the main package of the MMT API.

    This is the main package of the MMT API.

    It holds subpackages for all data structures, data containers, and the central algorithms and services.

    Classes directly defined in the package

    Some minor classes that are used throughout MMT are defined in this package, in particular:

    • MMT URIs in the class Path and Namespace
    • processing and content errors in the class Error

    The package also contains root classes for certain types that are subclassed throughout the package. Most importantly:

    • StructuralElement: structure-level (= named) parts in the data structures for the MMT language: documents, theories, constants, ...
    • MMTTask: tasks for a single object: parsing, checking, ...
    • Rule: object-level part of the MMT language that is written in Scala

    Subpackages

    Data structures for the MMT language

    The data structures for the MMT languages are defined in 4 packages corresponding to the 4 levels: - documents: Documents and all other NarrativeElements - modules: Modules (= the toplevel declarations), in particular Theorys and Views - symbols: all Declarations inside modules, in particular Constants - objects: all anonymous Objects (e.g., formulas, functions, etc.), in particular Contexts and Terms

    The former 3 levels are jointly called 'structural' levels. All elements subclass StructuralElement, have an MMT URI, and carry an MMT URI referring to their parent in the MMT abstract syntax tree.

    Structural elements are extensible (via DerivedModules and DerivedDeclarations), and the package patterns defines declaration patterns as a built-in extension.

    All structural elements are mutable and implement the ContainerElement interface for changing their children. Objects, by contrast, are represented as immutable inductive types.(except for carrying metadata.Metadata and objects.ClientProperties). The boundary between structural elements and objects is mediated by ComponentContainers: these are mutable, owned by structural elements, and maintain objects.

    A few auxiliary data structures shifted to separate packages: - opaque: external (i.e., informal, computation) content - informal: partially outdated informal data structures - metadata: metadata annotations to all structural elements or objects

    The MMT main class and its internal state

    The package frontend contains the class Controller, which owns all state relevant for running MMT. Typically, each application creates a single instance of this class. The package also defines several other essential classes, most importantly MMT's extension (=plug-in, add-on) interfaces via the Extension class.

    The package libraries maintains the instances of MMT language data structures, in particular the Library class. Controller owns a Library, which stores all structural elements that have been loaded into memory.

    User interfaces

    The package frontend also contains the main executable classes, in particular the Shell class.

    The package gui collects all classes for building graphical user interfaces. This includes auxiliary classes for use in IDE plugins.

    The package web collects all classes for the HTTP interface of MMT.

    Physical storage of the MMT language files

    The package archives defines MMT Archives (= projects) as well as classes for building and working with archives. The latter include in particular the BuildManager and BuildTarget. Build targets include Importers and [Exporter]]s that translate between MMT and other formats.

    The package backend defines classes for maintaining archives and translating between the MMT URIs of structural elements and their physical storage locations.

    The central algorithms for processing MMT content

    The processing model of MMT consists of several major algorithms. - parser: read strings into MMT data structures - checking: check and refine MMT data structures - uom: pure computation on MMT data structures - proving: theorem proving on MMT data structures (in very early state)) - execution: imperative computation (in very, very early state) - presentation: rendering MMT data structures in user-facing formats (including HTML+presentation MathML)

    All algorithms are defined in Extensions coupled with default implementations. Moreover, all algorithms are split into two separate levels, one for structural elements and objects. See LeveledExtension.

    The package notations maintains the common code for parsing and presentation.

    The package valuebases maintains mathematical databases as a part of MMT.

    Other algorithms on the MMT data structures

    The package ontology contains a relational, semantic web-style ontology and query engine for it.

    The package moc contains change management.

    The package refactoring contains refactoring principles.

    General purpose utility functions

    The package utils defines general purpose APIs for files, URIs, HTML building, etc.

    Definition Classes
    mmt
  • package refactoring
    Definition Classes
    api
  • package linkinversion
    Definition Classes
    refactoring
  • AcrossLibraryTranslation
  • AcrossLibraryTranslator
  • AlignmentTranslation
  • Application
  • ArchiveStore
  • ArchiveTarget
  • ClusteringFactory
  • Consthash
  • CovariantParameterPreprocessor
  • DefinitionExpander
  • FinderConfig
  • FindingProcess
  • FullArchive
  • Hasher
  • HashesNormal
  • LinkTranslation
  • Map
  • NotDone
  • OMApplication
  • Preprocessor
  • RefactorPanel
  • SimpleParameterPreprocessor
  • StandardCluster
  • SymbolApplication
  • Theoryhash
  • Translate
  • TranslationGroup
  • TranslationTarget
  • ViewFinder
c

info.kwarc.mmt.api.refactoring

FindingProcess

class FindingProcess extends MMTTask with Logger

Source
ViewFinder.scala
Linear Supertypes
Logger, MMTTask, Killable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. FindingProcess
  2. Logger
  3. MMTTask
  4. Killable
  5. AnyRef
  6. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new FindingProcess(report: Report, hash: Hasher)

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 addListener(l: MMTTaskProgressListener): Unit
    Definition Classes
    MMTTask
  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  7. def diesWith(implicit that: Killable): FindingProcess.this.type

    gives a killable object the same kill button as one that is already around

    gives a killable object the same kill button as one that is already around

    For example, when processing a task, generates a subtask, this should be called on the subtask to ensure killing the overall task also kills the subtask.

    Definition Classes
    Killable
  8. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  9. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  10. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  11. def findViews(th1: Theoryhash, th2: Theoryhash): Set[List[Map]]
    Attributes
    protected
  12. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  13. def getReports: List[MMTTaskProgress]

    get all reports in reverse chronological order

    get all reports in reverse chronological order

    Definition Classes
    MMTTask
  14. def getStartingPoints(implicit allpairs: List[(Consthash, Consthash)]): List[(Consthash, Consthash)]
    Attributes
    protected
  15. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  16. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  17. def isKilled: Boolean

    processing should be aborted gracefully if true

    processing should be aborted gracefully if true

    Definition Classes
    Killable
  18. def kill: Unit

    signals aborting of processing

    signals aborting of processing

    Definition Classes
    Killable
  19. def log(e: Error): Unit

    logs an error - always logged

    logs an error - always logged

    Attributes
    protected
    Definition Classes
    Logger
  20. def log(s: ⇒ String, subgroup: Option[String] = None): Unit

    logs a message with this logger's logprefix

    logs a message with this logger's logprefix

    Attributes
    protected
    Definition Classes
    Logger
  21. def logError(s: ⇒ String): Unit

    log as an error message

    log as an error message

    Attributes
    protected
    Definition Classes
    Logger
  22. def logGroup[A](a: ⇒ A): A

    wraps around a group to create nested logging

    wraps around a group to create nested logging

    Attributes
    protected
    Definition Classes
    Logger
  23. def logPrefix: String
    Definition Classes
    FindingProcess → Logger
  24. def logTemp(s: ⇒ String): Unit

    temporary logging - always logged

    temporary logging - always logged

    Attributes
    protected
    Definition Classes
    Logger
  25. def makeviews(path: MPath, omaps: List[Map]): List[View]
  26. def matches(c: Consthash, d: Consthash)(l: List[(GlobalName, GlobalName)]): Boolean
    Attributes
    protected
  27. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  28. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  29. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  30. def postProcess(views: Set[List[Map]]): List[Map]
    Attributes
    protected
  31. def potentialMatches(t1: List[Consthash], t2: List[Consthash]): List[(Consthash, Consthash)]
    Attributes
    protected
  32. def removeListener(l: MMTTaskProgressListener): Unit
    Definition Classes
    MMTTask
  33. val report: Report
    Definition Classes
    FindingProcess → Logger
  34. def reportProgress(a: MMTTaskProgress): Unit

    adds a report and forwards it to all listeners

    adds a report and forwards it to all listeners

    Definition Classes
    MMTTask
  35. def run(from: List[Theoryhash] = Nil, to: List[Theoryhash] = Nil): List[Map]
  36. def setTimeout[A](millisec: Int)(f: () ⇒ Unit): FindingProcess.this.type

    presses the kill button after the specified number of milli seconds

    presses the kill button after the specified number of milli seconds

    Definition Classes
    Killable
  37. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  38. def toString(): String
    Definition Classes
    AnyRef → Any
  39. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  40. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  41. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()

Inherited from Logger

Inherited from MMTTask

Inherited from Killable

Inherited from AnyRef

Inherited from Any

Ungrouped