|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectedu.toronto.cs.tlq.UpSetAlgebra
public class UpSetAlgebra
class UpSetAlgebra
represents a large lattice of upsets
Each element is encoded as an ordered list of integers, each integer
corresponding to a minimal element of some lattice.
Constructor Summary | |
---|---|
UpSetAlgebra()
UpSetAlgebra
Constructs an UpSet lattice with _mintermSize minterm elements |
Method Summary | |
---|---|
AlgebraValue |
bot()
|
java.util.Collection |
carrierSet()
|
IntIterator |
carrierSetId()
|
AlgebraValue |
eq(AlgebraValue v1,
AlgebraValue v2)
|
AlgebraValue |
geq(AlgebraValue v1,
AlgebraValue v2)
|
java.util.Set |
getJoinIrredundant(java.util.BitSet values)
|
java.util.Set |
getMeetIrredundant(java.util.BitSet values)
|
edu.toronto.cs.tlq.UpSetAlgebra.UpSetValue |
getUpMinTerm(int a)
|
edu.toronto.cs.tlq.UpSetAlgebra.UpSetValue |
getUpSetElement(int a)
|
AlgebraValue |
getValue(int id)
|
AlgebraValue |
getValue(java.lang.String name)
|
AlgebraValue |
impl(AlgebraValue v1,
AlgebraValue v2)
|
AlgebraValue |
join(AlgebraValue _v1,
AlgebraValue _v2)
|
AlgebraValue[] |
joinDecomposition(AlgebraValue v)
|
AlgebraValue |
leq(AlgebraValue _v1,
AlgebraValue _v2)
|
edu.toronto.cs.tlq.UpSetAlgebra.UpSetValue |
leq(int[] a,
int[] b)
if a[i] | b[j] == a [i] then every bit that a has off, b has off as well thus if b has a bit on, then a has the same bit on that means that (a | b = a) -> a >= b and so if a < b -> (a | b != a) |
static void |
main(java.lang.String[] args)
Some tester methods |
AlgebraValue |
meet(AlgebraValue _v1,
AlgebraValue _v2)
|
AlgebraValue |
neg(AlgebraValue v)
|
AlgebraValue |
noValue()
DeMorganAlgebra interface |
void |
renew()
|
int |
size()
|
AlgebraValue |
top()
|
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public UpSetAlgebra()
UpSetAlgebra
Constructs an UpSet lattice with _mintermSize minterm elements
Method Detail |
---|
public AlgebraValue noValue()
noValue
in interface IAlgebra
public AlgebraValue getValue(java.lang.String name)
getValue
in interface IAlgebra
public AlgebraValue getValue(int id)
getValue
in interface IAlgebra
public AlgebraValue meet(AlgebraValue _v1, AlgebraValue _v2)
meet
in interface IAlgebra
public AlgebraValue join(AlgebraValue _v1, AlgebraValue _v2)
join
in interface IAlgebra
public AlgebraValue neg(AlgebraValue v)
neg
in interface IAlgebra
public AlgebraValue impl(AlgebraValue v1, AlgebraValue v2)
impl
in interface IAlgebra
public AlgebraValue top()
top
in interface IAlgebra
public AlgebraValue bot()
bot
in interface IAlgebra
public AlgebraValue eq(AlgebraValue v1, AlgebraValue v2)
eq
in interface IAlgebra
public AlgebraValue leq(AlgebraValue _v1, AlgebraValue _v2)
leq
in interface IAlgebra
public AlgebraValue geq(AlgebraValue v1, AlgebraValue v2)
geq
in interface IAlgebra
public int size()
size
in interface IAlgebra
public IntIterator carrierSetId()
carrierSetId
in interface IAlgebra
public java.util.Collection carrierSet()
carrierSet
in interface IAlgebra
public AlgebraValue[] joinDecomposition(AlgebraValue v)
joinDecomposition
in interface IAlgebra
public void renew()
public edu.toronto.cs.tlq.UpSetAlgebra.UpSetValue getUpMinTerm(int a)
public edu.toronto.cs.tlq.UpSetAlgebra.UpSetValue getUpSetElement(int a)
public edu.toronto.cs.tlq.UpSetAlgebra.UpSetValue leq(int[] a, int[] b)
public java.util.Set getJoinIrredundant(java.util.BitSet values)
getJoinIrredundant
in interface IAlgebra
public java.util.Set getMeetIrredundant(java.util.BitSet values)
getMeetIrredundant
in interface IAlgebra
public static void main(java.lang.String[] args)
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |