Package | Description |
---|---|
org.thegalactic.context |
This package is designed to represent contexts.
|
org.thegalactic.lattice |
This package is designed to represent lattice.
|
org.thegalactic.rule |
This package is designed to represent rules.
|
org.thegalactic.util |
This package is designed to represent utility class.
|
Modifier and Type | Method and Description |
---|---|
ComparableSet |
Context.inverseClosure(ComparableSet set)
Builds the inverse of the closure operator of a set of observations.
|
Modifier and Type | Method and Description |
---|---|
ComparableSet |
Context.inverseClosure(ComparableSet set)
Builds the inverse of the closure operator of a set of observations.
|
Modifier and Type | Method and Description |
---|---|
ComparableSet |
Lattice.fullClosure(ComparableSet s)
Returns the smallest sublattice of this component containing s.
|
ComparableSet |
Lattice.joinClosure(ComparableSet s)
Returns the smallest set of nodes of this component containing S such that if a,b in JS then join(a,b) in JS.
|
ComparableSet |
Lattice.meetClosure(ComparableSet s)
Returns the smallest set of nodes of this component containing S such that if a,b in MS then meet(a,b) in MS.
|
Modifier and Type | Method and Description |
---|---|
TreeSet<ComparableSet> |
BijectiveComponents.getMinimalGenerators()
Returns the minimal generators of this component.
|
TreeSet<ComparableSet> |
Lattice.hybridGenerators()
Returns the list of all sets of nodes that generates all nodes.
|
Modifier and Type | Method and Description |
---|---|
ComparableSet |
Lattice.fullClosure(ComparableSet s)
Returns the smallest sublattice of this component containing s.
|
Concept |
ConceptLattice.getConcept(ComparableSet setA,
ComparableSet setB)
Returns concept defined by setA and setB; null if not found.
|
Concept |
ConceptLattice.getConcept(ComparableSet setA,
ComparableSet setB)
Returns concept defined by setA and setB; null if not found.
|
ComparableSet |
Lattice.joinClosure(ComparableSet s)
Returns the smallest set of nodes of this component containing S such that if a,b in JS then join(a,b) in JS.
|
ComparableSet |
Lattice.meetClosure(ComparableSet s)
Returns the smallest set of nodes of this component containing S such that if a,b in MS then meet(a,b) in MS.
|
void |
Concept.putSetA(ComparableSet x)
Replaces the set A of this component by the specified one.
|
void |
Concept.putSetB(ComparableSet x)
Replaces the set A of this component by the specified one.
|
Modifier and Type | Method and Description |
---|---|
protected BijectiveComponents |
BijectiveComponents.setMinimalGenerators(TreeSet<ComparableSet> minimalGenerators)
Set the minimal generators of this component.
|
Modifier and Type | Method and Description |
---|---|
ComparableSet |
Rule.getConclusion()
Returns a copy of the conclusion of the Rule.
|
ComparableSet |
Rule.getPremise()
Returns a copy of the premise of the Rule.
|
Modifier and Type | Method and Description |
---|---|
ComparableSet |
ComparableSet.clone()
Returns a clone of this component.
|
Modifier and Type | Method and Description |
---|---|
int |
ComparableSet.compareTo(ComparableSet set)
Compares this component with those in parameter according to the lectic order.
|
Copyright © 2010–2016 The Galactic Organization. All rights reserved.