Class/Object

ostrich.proofops

OstrichNielsenSplitter

Related Docs: object OstrichNielsenSplitter | package proofops

Permalink

class OstrichNielsenSplitter extends AnyRef

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. OstrichNielsenSplitter
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new OstrichNielsenSplitter(goal: Goal, theory: OstrichStringTheory, flags: OFlags)

    Permalink

Type Members

  1. type ChooseSplitResult = (Seq[LinearCombination], LinearCombination, LinearCombination, Seq[LinearCombination])

    Permalink

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. val X: ConstantTerm

    Permalink
  5. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  6. def chooseSplit(lit: Atom, splitLen: Int, lengthModel: ReduceWithConjunction, leftTerms: List[LinearCombination], leftLenTerms: List[LinearCombination], rightTerms: List[LinearCombination]): ChooseSplitResult

    Permalink
  7. def chooseSplit(t: LinearCombination, splitLen: Int, lengthModel: ReduceWithConjunction, leftTerms: List[LinearCombination], leftLenTerms: List[LinearCombination], rightTerms: List[LinearCombination]): ChooseSplitResult

    Permalink
  8. def chooseSplit(splitLit1: Atom, splitLit2: Atom, lengthModel: ReduceWithConjunction): ChooseSplitResult

    Permalink
  9. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  10. def concatLeft(decomp: DecompPoint)(implicit builder: FormulaBuilder): Term

    Permalink
  11. val concatLits: IndexedSeq[Atom]

    Permalink
  12. val concatPerRes: Map[LinearCombination, IndexedSeq[Atom]]

    Permalink
  13. def concatRight(decomp: DecompPoint)(implicit builder: FormulaBuilder): Term

    Permalink
  14. def decompEquation(resultTerm: Term, concatLiterals: Seq[Atom]): Seq[Action]

    Permalink
  15. def decompEquations: Seq[Action]

    Permalink

    Decompose equations of the form a.b = c.d if it can be derived that |a| = |c|.

  16. def decompSimpleEquation(lit: Atom): Seq[Action]

    Permalink

    Decompose one equation of the form a.b = w, in which w is some concrete word.

  17. def decompSimpleEquations: Seq[Action]

    Permalink

    Decompose equations of the form a.b = w, in which w is some concrete word.

  18. def decompositionPoints(lit: Atom): Seq[SimpleDecompPoint]

    Permalink

    Compute all prefix/suffix pairs for the given concat term.

  19. def decompositionPointsWithLits(lit: Atom): Seq[DecompPoint]

    Permalink

    Compute all prefix/suffix pairs for the given concat term; also split string literals in the term into prefix/suffix pairs.

  20. def diffLengthFormula(split: ChooseSplitResult, splitLit2: Atom): Conjunction

    Permalink
  21. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  22. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  23. def eval(t: LinearCombination, lengthModel: ReduceWithConjunction): Int

    Permalink
  24. def evalLengthFor(t: LinearCombination, lengthModel: ReduceWithConjunction): Int

    Permalink
  25. val extOrder: TermOrder

    Permalink
  26. val facts: Conjunction

    Permalink
  27. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  28. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  29. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  30. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  31. def lengthFor(t: LinearCombination): LinearCombination

    Permalink
  32. val lengthLits: IndexedSeq[Atom]

    Permalink
  33. val lengthMap: Map[LinearCombination, LinearCombination]

    Permalink
  34. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  35. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  36. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  37. val order: TermOrder

    Permalink
  38. val predConj: PredConj

    Permalink
  39. val rand: Value

    Permalink
  40. def resolveConcat(t: LinearCombination): Option[(LinearCombination, LinearCombination)]

    Permalink
  41. def splitEquation: Seq[Action]

    Permalink

    Apply the Nielsen transformation to some selected equation.

  42. def splittingFormula(split: ChooseSplitResult, splitLit2: Atom): Conjunction

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

    Permalink
    Definition Classes
    AnyRef
  44. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  45. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  46. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  47. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped