object
ParikhUtil
Type Members
-
type
State = dk.brics.automaton.State
-
type
TLabel = (Char, Char)
-
type
Transition = (dk.brics.automaton.State, (Char, Char), dk.brics.automaton.State, Seq[Int])
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
val
MAX_DETERMIN_EXPAND: Double
-
val
MAX_MINIMIZE_SIZE: Int
-
val
MIN_COUNTING_SIZE_APPROX: Int
-
val
MIN_LOG_REG_SUM_PARIKH: Int
-
final
def
asInstanceOf[T0]: T0
-
def
bug(s: Any): Unit
-
def
clone(): AnyRef
-
var
debugOpt: Boolean
-
def
debugPrintln(s: Any): Unit
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
def
findAcceptedWord(auts: Seq[CostEnrichedAutomatonBase], registersModel: Map[ITerm, IdealInt], flags: OFlags): Option[Seq[Int]]
-
def
findAcceptedWordByRegistersComplete(aut: CostEnrichedAutomatonBase, registersModel: Map[ITerm, IdealInt], flags: OFlags): Option[Seq[Int]]
-
def
findAcceptedWordByTransTimesComplete(aut: CostEnrichedAutomatonBase, registersModel: Map[ITerm, IdealInt], flags: OFlags): Option[Seq[Int]]
-
final
def
getClass(): Class[_]
-
-
def
hashCode(): Int
-
-
final
def
isInstanceOf[T0]: Boolean
-
def
log(s: Any): Unit
-
var
logOpt: Boolean
-
def
measure[A](op: String)(comp: ⇒ A)(implicit manualFlag: Boolean = true): A
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
parikhImage(aut: CostEnrichedAutomatonBase, explicitTrans2Term: Map[(dk.brics.automaton.State, (Char, Char), dk.brics.automaton.State, Seq[Int]), ITerm] = Map()): IFormula
-
-
def
sumVec(v1: Seq[Int], v2: Seq[Int]): Seq[Int]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
throwWithStackTrace(e: Throwable): Nothing
-
def
toString(): String
-
def
todo(s: Any, urgency: Int): Unit
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from AnyRef
Inherited from Any