Class

ostrich.preop

ReplaceAllPreOpChar

Related Doc: package preop

Permalink

class ReplaceAllPreOpChar extends PreOp

Representation of x = replaceall(y, a, z) where a is a single character.

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

Instance Constructors

  1. new ReplaceAllPreOpChar(a: Char)

    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. def apply(argumentConstraints: Seq[Seq[Automaton]], resultConstraint: Automaton): (Iterator[Seq[Automaton]], Seq[Seq[Automaton]])

    Permalink

    Given known regex constraints for function arguments and function result, derive a sequence of regex constraints for the arguments such that

    Given known regex constraints for function arguments and function result, derive a sequence of regex constraints for the arguments such that

    • returned constraints are contained in the pre-image: any word tuple accepted by any of the returned automata tuples is mapped by the function to a word accepted by the result constraint
    • returned constraints subsume the pre-image intersected with the existing argument constraints: whenever a word tuple is accepted by the given argument constraints, and is mapped by the function to a word accepted by the result constraint, then the word tuple is also accepted by one of the returned constraints

    If the result depends on the given argumentConstraints, then the used constraints also have to be returned as second result component.

    Definition Classes
    ReplaceAllPreOpCharPreOp
  5. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  6. def charCountApproximation(char: Int, arguments: Seq[Term], result: Term, order: TermOrder): Formula

    Permalink

    Generate a formula that approximates the character count (= Parikh) relationship between arguments and result, for one particular letter char.

    Generate a formula that approximates the character count (= Parikh) relationship between arguments and result, for one particular letter char. It is sound to just return true. The parameters arguments and result are terms representing the length of the string arguments.

    Definition Classes
    PreOp
  7. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  8. final def eq(arg0: AnyRef): Boolean

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

    Permalink
    Definition Classes
    AnyRef → Any
  10. def eval(arguments: Seq[Seq[Int]]): Option[Seq[Int]]

    Permalink

    Evaluate the described function; return None if the function is not defined for the given arguments.

    Evaluate the described function; return None if the function is not defined for the given arguments.

    Definition Classes
    ReplaceAllPreOpCharPreOp
  11. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  12. def forwardApprox(argumentConstraints: Seq[Seq[Automaton]]): Automaton

    Permalink

    Given constraints on the input variables, produce an over-approximation constraint on the output.

    Given constraints on the input variables, produce an over-approximation constraint on the output.

    Definition Classes
    ReplaceAllPreOpCharPreOp
  13. final def getClass(): Class[_]

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

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

    Permalink
    Definition Classes
    Any
  16. def lengthApproximation(arguments: Seq[Term], result: Term, order: TermOrder): Formula

    Permalink

    Generate a formula that approximates the length relationship between arguments and result.

    Generate a formula that approximates the length relationship between arguments and result. It is sound to just return true. The parameters arguments and result are terms representing the length of the string arguments.

    Definition Classes
    ReplaceAllPreOpCharPreOp
  17. final def ne(arg0: AnyRef): Boolean

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

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

    Permalink
    Definition Classes
    AnyRef
  20. final def synchronized[T0](arg0: ⇒ T0): T0

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

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

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

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

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

Inherited from PreOp

Inherited from AnyRef

Inherited from Any

Ungrouped