trait TreesAndTypesDomain extends PropositionalLogic with CheckableTreeAndTypeAnalysis
- Alphabetic
- By Inheritance
- TreesAndTypesDomain
- CheckableTreeAndTypeAnalysis
- PropositionalLogic
- AnyRef
- Any
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- All
Type Members
-
trait
AbsVar
extends AnyRef
- Definition Classes
- PropositionalLogic
-
final
case class
And
(ops: Set[Prop]) extends Prop with Product with Serializable
- Definition Classes
- PropositionalLogic
-
final
case class
AtMostOne
(ops: List[Sym]) extends Prop with Product with Serializable
- Definition Classes
- PropositionalLogic
-
final
case class
Eq
(p: Var, q: Const) extends Prop with Product with Serializable
- Definition Classes
- PropositionalLogic
-
final
case class
Not
(a: Prop) extends Prop with Product with Serializable
- Definition Classes
- PropositionalLogic
-
final
case class
Or
(ops: Set[Prop]) extends Prop with Product with Serializable
- Definition Classes
- PropositionalLogic
-
class
Prop
extends AnyRef
- Definition Classes
- PropositionalLogic
-
trait
PropMap
extends AnyRef
- Definition Classes
- PropositionalLogic
-
trait
PropTraverser
extends AnyRef
- Definition Classes
- PropositionalLogic
-
final
case class
Solution
(model: Model, unassigned: List[Sym]) extends Product with Serializable
- Definition Classes
- PropositionalLogic
-
final
class
Sym
extends Prop
- Definition Classes
- PropositionalLogic
-
trait
TypeConstExtractor
extends AnyRef
- Definition Classes
- PropositionalLogic
-
trait
ValueConstExtractor
extends AnyRef
- Definition Classes
- PropositionalLogic
-
trait
VarExtractor
extends AnyRef
- Definition Classes
- PropositionalLogic
- sealed abstract class Const extends AnyRef
-
type
Model = Map[Sym, Boolean]
- Definition Classes
- PropositionalLogic
-
abstract
type
Solvable
- Definition Classes
- PropositionalLogic
-
type
Tree = Global.Tree
- Definition Classes
- TreesAndTypesDomain → PropositionalLogic
-
type
Type = Global.Type
- Definition Classes
- TreesAndTypesDomain → PropositionalLogic
- sealed class TypeConst extends Const
- sealed class ValueConst extends Const
- class Var extends AbsVar
Abstract Value Members
-
abstract
val
EmptyModel: Model
- Definition Classes
- PropositionalLogic
-
abstract
val
NoModel: Model
- Definition Classes
- PropositionalLogic
-
abstract
def
eqFreePropToSolvable(f: Prop): Solvable
- Definition Classes
- PropositionalLogic
-
abstract
def
findAllModelsFor(solvable: Solvable, pos: Position = NoPosition): List[Solution]
- Definition Classes
- PropositionalLogic
-
abstract
def
findModelFor(solvable: Solvable): Model
- Definition Classes
- PropositionalLogic
-
abstract
def
reportWarning(message: String): Unit
- Definition Classes
- PropositionalLogic
-
abstract
val
typer: (analyzer)#Typer
- Definition Classes
- CheckableTreeAndTypeAnalysis
-
abstract
def
uncheckedWarning(pos: Position, msg: String): Unit
- Definition Classes
- PropositionalLogic
Concrete Value Members
-
object
AnalysisBudget
- Definition Classes
- PropositionalLogic
-
object
And
extends Serializable
- Definition Classes
- PropositionalLogic
-
object
False
extends Prop with Product with Serializable
- Definition Classes
- PropositionalLogic
-
object
Or
extends Serializable
- Definition Classes
- PropositionalLogic
-
object
Sym
- Definition Classes
- PropositionalLogic
-
object
True
extends Prop with Product with Serializable
- Definition Classes
- PropositionalLogic
-
final
def
!=(arg0: Any): Boolean
Test two objects for inequality.
Test two objects for inequality.
- returns
true
if !(this == that), false otherwise.
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
Equivalent to
x.hashCode
except for boxed numeric types andnull
.Equivalent to
x.hashCode
except for boxed numeric types andnull
. For numerics, it returns a hash value which is consistent with value equality: if two value type instances compare as true, then ## will produce the same hash value for each of them. Fornull
returns a hashcode wherenull.hashCode
throws aNullPointerException
.- returns
a hash value consistent with ==
- Definition Classes
- AnyRef → Any
-
def
+(other: String): String
- Implicit
- This member is added by an implicit conversion from TreesAndTypesDomain to any2stringadd[TreesAndTypesDomain] performed by method any2stringadd in scala.Predef.
- Definition Classes
- any2stringadd
-
def
->[B](y: B): (TreesAndTypesDomain, B)
- Implicit
- This member is added by an implicit conversion from TreesAndTypesDomain to ArrowAssoc[TreesAndTypesDomain] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @inline()
-
def
/\(props: Iterable[Prop]): Serializable with Product with Prop
- Definition Classes
- PropositionalLogic
-
final
def
==(arg0: Any): Boolean
The expression
x == that
is equivalent toif (x eq null) that eq null else x.equals(that)
.The expression
x == that
is equivalent toif (x eq null) that eq null else x.equals(that)
.- returns
true
if the receiver object is equivalent to the argument;false
otherwise.
- Definition Classes
- AnyRef → Any
-
def
\/(props: Iterable[Prop]): Serializable with Product with Prop
- Definition Classes
- PropositionalLogic
-
final
def
asInstanceOf[T0]: T0
Cast the receiver object to be of type
T0
.Cast the receiver object to be of type
T0
.Note that the success of a cast at runtime is modulo Scala's erasure semantics. Therefore the expression
1.asInstanceOf[String]
will throw aClassCastException
at runtime, while the expressionList(1).asInstanceOf[List[String]]
will not. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested type.- returns
the receiver object.
- Definition Classes
- Any
- Exceptions thrown
ClassCastException
if the receiver object is not an instance of the erasure of typeT0
.
-
val
budgetProp: sys.Prop[String]
- Definition Classes
- PropositionalLogic
-
def
checkableType(tp: Global.Type): Global.Type
- Definition Classes
- CheckableTreeAndTypeAnalysis
-
def
clone(): AnyRef
Create a copy of the receiver object.
Create a copy of the receiver object.
The default implementation of the
clone
method is platform dependent.- returns
a copy of the receiver object.
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
- Note
not specified by SLS as a member of AnyRef
-
def
ensuring(cond: (TreesAndTypesDomain) ⇒ Boolean, msg: ⇒ Any): TreesAndTypesDomain
- Implicit
- This member is added by an implicit conversion from TreesAndTypesDomain to Ensuring[TreesAndTypesDomain] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: (TreesAndTypesDomain) ⇒ Boolean): TreesAndTypesDomain
- Implicit
- This member is added by an implicit conversion from TreesAndTypesDomain to Ensuring[TreesAndTypesDomain] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: Boolean, msg: ⇒ Any): TreesAndTypesDomain
- Implicit
- This member is added by an implicit conversion from TreesAndTypesDomain to Ensuring[TreesAndTypesDomain] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
ensuring(cond: Boolean): TreesAndTypesDomain
- Implicit
- This member is added by an implicit conversion from TreesAndTypesDomain to Ensuring[TreesAndTypesDomain] performed by method Ensuring in scala.Predef.
- Definition Classes
- Ensuring
-
def
enumerateSubtypes(tp: Global.Type, grouped: Boolean): List[List[Global.Type]]
- Definition Classes
- CheckableTreeAndTypeAnalysis
-
final
def
eq(arg0: AnyRef): Boolean
Tests whether the argument (
that
) is a reference to the receiver object (this
).Tests whether the argument (
that
) is a reference to the receiver object (this
).The
eq
method implements an equivalence relation on non-null instances ofAnyRef
, and has three additional properties:- It is consistent: for any non-null instances
x
andy
of typeAnyRef
, multiple invocations ofx.eq(y)
consistently returnstrue
or consistently returnsfalse
. - For any non-null instance
x
of typeAnyRef
,x.eq(null)
andnull.eq(x)
returnsfalse
. null.eq(null)
returnstrue
.
When overriding the
equals
orhashCode
methods, it is important to ensure that their behavior is consistent with reference equality. Therefore, if two objects are references to each other (o1 eq o2
), they should be equal to each other (o1 == o2
) and they should hash to the same value (o1.hashCode == o2.hashCode
).- returns
true
if the argument is a reference to the receiver object;false
otherwise.
- Definition Classes
- AnyRef
- It is consistent: for any non-null instances
-
def
equals(arg0: Any): Boolean
The equality method for reference types.
-
def
finalize(): Unit
Called by the garbage collector on the receiver object when there are no more references to the object.
Called by the garbage collector on the receiver object when there are no more references to the object.
The details of when and if the
finalize
method is invoked, as well as the interaction betweenfinalize
and non-local returns and exceptions, are all platform dependent.- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
- Note
not specified by SLS as a member of AnyRef
-
def
formatted(fmtstr: String): String
- Implicit
- This member is added by an implicit conversion from TreesAndTypesDomain to StringFormat[TreesAndTypesDomain] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @inline()
-
def
gatherSymbols(p: Prop): Set[Sym]
- Definition Classes
- PropositionalLogic
-
def
gatherVariables(p: Prop): Set[Var]
- Definition Classes
- PropositionalLogic
-
final
def
getClass(): Class[_]
Returns the runtime class representation of the object.
Returns the runtime class representation of the object.
- returns
a class object corresponding to the runtime type of the receiver.
- Definition Classes
- AnyRef → Any
-
def
hashCode(): Int
The hashCode method for reference types.
-
final
def
isInstanceOf[T0]: Boolean
Test whether the dynamic type of the receiver object is
T0
.Test whether the dynamic type of the receiver object is
T0
.Note that the result of the test is modulo Scala's erasure semantics. Therefore the expression
1.isInstanceOf[String]
will returnfalse
, while the expressionList(1).isInstanceOf[List[String]]
will returntrue
. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the specified type.- returns
true
if the receiver object is an instance of erasure of typeT0
;false
otherwise.
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
Equivalent to
!(this eq that)
.Equivalent to
!(this eq that)
.- returns
true
if the argument is not a reference to the receiver object;false
otherwise.
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
Wakes up a single thread that is waiting on the receiver object's monitor.
Wakes up a single thread that is waiting on the receiver object's monitor.
- Definition Classes
- AnyRef
- Note
not specified by SLS as a member of AnyRef
-
final
def
notifyAll(): Unit
Wakes up all threads that are waiting on the receiver object's monitor.
Wakes up all threads that are waiting on the receiver object's monitor.
- Definition Classes
- AnyRef
- Note
not specified by SLS as a member of AnyRef
-
def
prepareNewAnalysis(): Unit
- Definition Classes
- TreesAndTypesDomain → PropositionalLogic
-
def
propToSolvable(p: Prop): Solvable
- Definition Classes
- PropositionalLogic
-
def
removeVarEq(props: List[Prop], modelNull: Boolean = false): (Prop, List[Prop])
- Definition Classes
- PropositionalLogic
-
def
simplify(f: Prop): Prop
Simplifies propositional formula according to the following rules: - eliminate double negation (avoids unnecessary Tseitin variables) - flatten trees of same connectives (avoids unnecessary Tseitin variables) - removes constants and connectives that are in fact constant because of their operands - eliminates duplicate operands - convert formula into NNF: all sub-expressions have a positive polarity which makes them amenable for the subsequent Plaisted transformation and increases chances to figure out that the formula is already in CNF
Simplifies propositional formula according to the following rules: - eliminate double negation (avoids unnecessary Tseitin variables) - flatten trees of same connectives (avoids unnecessary Tseitin variables) - removes constants and connectives that are in fact constant because of their operands - eliminates duplicate operands - convert formula into NNF: all sub-expressions have a positive polarity which makes them amenable for the subsequent Plaisted transformation and increases chances to figure out that the formula is already in CNF
Complexity: DFS over formula tree
See http://www.decision-procedures.org/slides/propositional_logic-2x3.pdf
- Definition Classes
- PropositionalLogic
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
Creates a String representation of this object.
Creates a String representation of this object. The default representation is platform dependent. On the java platform it is the concatenation of the class name, "@", and the object's hashcode in hexadecimal.
- returns
a String representation of the object.
- Definition Classes
- AnyRef → Any
-
def
uncheckableType(tp: Global.Type): Boolean
- Definition Classes
- CheckableTreeAndTypeAnalysis
-
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( ... )
-
def
→[B](y: B): (TreesAndTypesDomain, B)
- Implicit
- This member is added by an implicit conversion from TreesAndTypesDomain to ArrowAssoc[TreesAndTypesDomain] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- object Const
-
object
NullConst
extends Const with Product with Serializable
- Definition Classes
- TreesAndTypesDomain → PropositionalLogic
-
object
TypeConst
extends TypeConstExtractor
- Definition Classes
- TreesAndTypesDomain → PropositionalLogic
-
object
ValueConst
extends ValueConstExtractor
- Definition Classes
- TreesAndTypesDomain → PropositionalLogic
-
object
Var
extends VarExtractor
- Definition Classes
- TreesAndTypesDomain → PropositionalLogic
The Scala compiler API.
The following resources are useful for Scala plugin/compiler development: