org.thegalactic.lattice

Class Concept

java.lang.Object

org.thegalactic.dgraph.Node

org.thegalactic.lattice.Concept

All Implemented Interfaces:

Cloneable, Comparable

public class Concept
extends Node

This class gives a representation for a concept, i.e. a node of a concept lattice.

A concept extends class Node by providing two comparable sets defined by ComparableSet, namely setA and setB, aiming at storing set of a concepts.

This component can also be used to store a closed set by using only set A.

This class implements class Comparable aiming at sorting concepts by providing the Node.compareTo(org.thegalactic.dgraph.Node) method. Comparison between this component and those in parameter is realised by comparing set A.

To Do#1

Should not inherit from Node since content is not used. Maybe by using interface.

Constructor Summary

Constructors

Constructor and Description
Concept(boolean setA, boolean setB) Constructs a new concept with an empty set of comparableset as setA and set B if the two boolean are true.
Concept(boolean setA, TreeSet<Comparable> setB) Constructs a new concept containing the specified comparables set as setB, and an empty set of comparableset as setA if the boolean is true.
Concept(Concept c) Constructs this component as a copy of the specified ClosedSet.
Concept(TreeSet<Comparable> setA, boolean setB) Constructs a new concept containing the specified comparables set as setA, and an empty set of comparableset as setB if the boolean is true.
Concept(TreeSet<Comparable> setA, TreeSet<Comparable> setB) Constructs a new concept containing the specified comparables set as setA and setB.

Method Summary

Modifier and Type	Method and Description
boolean	addAllToA(TreeSet x) Adds the specified set of comparable to the set A.
boolean	addAllToB(TreeSet x) Adds the specified set of comparable to the set B.
boolean	addToA(Comparable x) Adds a comparable to the set A.
boolean	addToB(Comparable x) Adds a comparable to the set B.
Concept	clone() Returns a clone of this component.
boolean	containsAllInA(TreeSet x) Checks if the set A contains the specified set of comparable.
boolean	containsAllInB(TreeSet x) Checks if the set B contains the specified set of comparable.
boolean	containsInA(Comparable x) Checks if the set A contains the specified comparable.
boolean	containsInB(Comparable x) Checks if the set B contains the specified comparable.
boolean	equals(Object o) Compares this component with the specified one.
TreeSet<Comparable>	getSetA() Returns the set A of this component.
TreeSet<Comparable>	getSetB() Returns the set B of comparable of this component.
int	hashCode() Returns the hash code of this component.
boolean	hasSetA() Checks if the concept has an empty set A.
boolean	hasSetB() Checks if the concept has an empty set B.
ArrayList<TreeSet<Comparable>>	immediateSuccessors(ClosureSystem init) Returns the list of immediate successors of a given node of the lattice.
ArrayList<TreeSet<Comparable>>	immediateSuccessorsLOA(Context init) Computes the immediate successors of this component with the LOA algorithm.
void	putSetA(ComparableSet x) Replaces the set A of this component by the specified one.
void	putSetB(ComparableSet x) Replaces the set A of this component by the specified one.
boolean	removeAllFromA(TreeSet x) Remove a set of comparable from the set A.
boolean	removeAllFromB(TreeSet x) Remove a set of comparable from the set B.
boolean	removeFromA(Comparable x) Remove a comparable from the set A.
boolean	removeFromB(Comparable x) Remove a comparable from the set B.
String	toString() Returns the description of this component in a String without spaces.

Methods inherited from class org.thegalactic.dgraph.Node

compareTo, getContent, getIdentifier, hasContent, setContent

Methods inherited from class java.lang.Object

finalize, getClass, notify, notifyAll, wait, wait, wait

Constructor Detail

Concept

public Concept(TreeSet<Comparable> setA,
               TreeSet<Comparable> setB)

Constructs a new concept containing the specified comparables set as setA and setB.

Parameters:

setA - set of comparable used to initialise setA.

setB - set of comparable used to initialise setB.

Concept

public Concept(boolean setA,
               boolean setB)

Constructs a new concept with an empty set of comparableset as setA and set B if the two boolean are true. False booleans allow to construct a concept with only one of the two sets.

Parameters:

setA - field setA is empty if true, setA is null if false.

setB - field setB is empty if true, setB is null if false.

Concept

public Concept(TreeSet<Comparable> setA,
               boolean setB)

Constructs a new concept containing the specified comparables set as setA, and an empty set of comparableset as setB if the boolean is true. A false boolean allows to construct a concept with the only set A.

Parameters:

setA - set of comparable used to initialise setA.

setB - field setB is empty if true, setB is null if false.

Concept

public Concept(boolean setA,
               TreeSet<Comparable> setB)

Constructs a new concept containing the specified comparables set as setB, and an empty set of comparableset as setA if the boolean is true. A false boolean allows to construct concept with the only set B.

Parameters:

setA - field setA is empty if true, setA is null if false.

setB - set of comparable used to initialise setB.

Concept

public Concept(Concept c)

Constructs this component as a copy of the specified ClosedSet.

Parameters:

c - the closed set to be copied

Method Detail

clone

public Concept clone()

Returns a clone of this component.

Overrides:

clone in class Node

Returns:

a clone of this component

hasSetB

public boolean hasSetB()

Checks if the concept has an empty set B.

Returns:

true if and only if setB is not null

hasSetA

public boolean hasSetA()

Checks if the concept has an empty set A.

Returns:

true if and only if setA is not null

getSetA

public TreeSet<Comparable> getSetA()

Returns the set A of this component.

Returns:

the set A of this component

getSetB

public TreeSet<Comparable> getSetB()

Returns the set B of comparable of this component.

Returns:

the set B of this component.

containsInA

public boolean containsInA(Comparable x)

Checks if the set A contains the specified comparable.

Parameters:

x - comparable to find in setA.

Returns:

true if and only if setA contains x.

containsInB

public boolean containsInB(Comparable x)

Checks if the set B contains the specified comparable.

Parameters:

x - comparable to find in setB.

Returns:

true if and only if setB contains x.

containsAllInA

public boolean containsAllInA(TreeSet x)

Checks if the set A contains the specified set of comparable.

Parameters:

x - set of comparable to find in setA.

Returns:

true if and only if setA contains all elemens of x.

containsAllInB

public boolean containsAllInB(TreeSet x)

Checks if the set B contains the specified set of comparable.

Parameters:

x - set of comparable to find in setB.

Returns:

true if and only if setB contains all elemens of x.

putSetB

public void putSetB(ComparableSet x)

Replaces the set A of this component by the specified one.

Parameters:

x - set of comparable used to replace setB

putSetA

public void putSetA(ComparableSet x)

Replaces the set A of this component by the specified one.

Parameters:

x - set of comparable used to replace setA

addToA

public boolean addToA(Comparable x)

Adds a comparable to the set A.

Parameters:

x - comparable to add to setA

Returns:

true if and only if addition is successful.

addToB

public boolean addToB(Comparable x)

Adds a comparable to the set B.

Parameters:

x - comparable to add to setB

Returns:

true if and only if addition is successful.

addAllToA

public boolean addAllToA(TreeSet x)

Adds the specified set of comparable to the set A.

Parameters:

x - set of comparable to add to setA

Returns:

true if and only if addition is successful.

addAllToB

public boolean addAllToB(TreeSet x)

Adds the specified set of comparable to the set B.

Parameters:

x - set of comparable to add to setB

Returns:

true if and only if addition is successful.

removeFromA

public boolean removeFromA(Comparable x)

Remove a comparable from the set A.

Parameters:

x - comparable to remove from setA

Returns:

true if and only if removal is successful.

removeFromB

public boolean removeFromB(Comparable x)

Remove a comparable from the set B.

Parameters:

x - comparable to remove from setB

Returns:

true if and only if removal is successful.

removeAllFromA

public boolean removeAllFromA(TreeSet x)

Remove a set of comparable from the set A.

Parameters:

x - set to remove from setA

Returns:

true if and only if removal is successful.

removeAllFromB

public boolean removeAllFromB(TreeSet x)

Remove a set of comparable from the set B.

Parameters:

x - set to remove from setB

Returns:

true if and only if removal is successful.

toString

public String toString()

Returns the description of this component in a String without spaces.

Overrides:

toString in class Node

Returns:

the description of this component in a String without spaces.

hashCode

public int hashCode()

Returns the hash code of this component.

Overrides:

hashCode in class Node

Returns:

hash code of this component

equals

public boolean equals(Object o)

Compares this component with the specified one.

Overrides:

equals in class Node

Parameters:

o - object compared to this component.

Returns:

true if and only if o is equals to this component.

immediateSuccessorsLOA

public ArrayList<TreeSet<Comparable>> immediateSuccessorsLOA(Context init)

Computes the immediate successors of this component with the LOA algorithm.

Parameters:

init - context from which successor of this component are computed.

Returns:

immediate successors of this component.

immediateSuccessors

public ArrayList<TreeSet<Comparable>> immediateSuccessors(ClosureSystem init)

Returns the list of immediate successors of a given node of the lattice.

This treatment is an adaptation of Bordat’s theorem stating that there is a bijection between minimal strongly connected component of the precedence subgraph issued from the specified node, and its immediate successors.

This treatment is performed in O(Cl|S|^3log g) where S is the initial set of elements, Cl is the closure computation complexity and g is the number of minimal generators of the lattice.

This treatment is recursively invoked by method recursiveDiagramlattice. In this case, the dependance graph is initialised by method recursiveDiagramMethod, and updated by this method, with addition some news edges and/or new valuations on existing edges. When this treatment is not invoked by method recursiveDiagramLattice, then the dependance graph is initialised, but it may be not complete. It is the case for example for on-line generation of the concept lattice.

cguerin - 2013-04-12 - transfer immedateSuccessors method from ConceptLattice to Concept

Parameters:

init - closure system used to compute immediate successors of this component.

Returns:

the list of immediate successors of this component.