src/main/java/org/thegalactic/lattice/ClosureSystem.java
public Vector<Concept> allClosures() {
        Vector<Concept> allclosure = new Vector<Concept>();
        // first closure: closure of the empty set
        allclosure.add(new Concept(this.closure(new ComparableSet()), false));
        Concept cl = allclosure.firstElement();
        // next closures in lectically order
        boolean continu = true;
        do {
            cl = this.nextClosure(cl);
            if (allclosure.contains(cl)) {
                continu = false;
            } else {
                allclosure.add(cl);
            }
        } while (continu);

        return allclosure;
    }
/**
     * Returns all the closed sets of the specified closure system (that can be
     * an IS or a context).
     *
     * Closed sets are generated in lecticaly order, with the emptyset's closure
     * as first closed set, using the Ganter's Next Closure algorithm.
     *
     * Therefore, closed sets have to be comparable using `ComparableSet` class.
     * This treatment is performed in O(cCl|S|^3) where S is the initial set of
     * elements, c is the number of closed sets that could be exponential in the
     * worst case, and Cl is the closure computation complexity.
     *
     * @return all the closeds set in the lectically order.
     */
Returns all the closed sets of the specified closure system (that can be
an IS or a context).

Closed sets are generated in lecticaly order, with the emptyset's closure
as first closed set, using the Ganter's Next Closure algorithm.

Therefore, closed sets have to be comparable using `ComparableSet` class.
This treatment is performed in O(cCl|S|^3) where S is the initial set of
elements, c is the number of closed sets that could be exponential in the
worst case, and Cl is the closure computation complexity.

@return all the closeds set in the lectically order.
Returns all the closed sets of the specified closure system ( that can be an IS or a context ) . Closed sets are generated in lecticaly order with the emptyset ' s closure as first closed set using the Ganter ' s Next Closure algorithm . Therefore closed sets have to be comparable using ` ComparableSet ` class . This treatment is performed in O ( cCl|S|^3 ) where S is the initial set of elements c is the number of closed sets that could be exponential in the worst case and Cl is the closure computation complexity . @return all the closeds set in the lectically order .
public Vector<Concept> allClosures() {
        Vector<Concept> allclosure = new Vector<Concept>();
        allclosure.add(new Concept(this.closure(new ComparableSet()), false));
        Concept cl = allclosure.firstElement();
        boolean continu = true;
        do {
            cl = this.nextClosure(cl);
            if (allclosure.contains(cl)) {
                continu = false;
            } else {
                allclosure.add(cl);
            }
        } while (continu);
        return allclosure;
    }
public Vector < Concept > allClosures ( ) { Vector < Concept > allclosure = new Vector < Concept > ( ) ; allclosure . add ( new Concept ( this . closure ( new ComparableSet ( ) ) , false ) ) ; Concept cl = allclosure . firstElement ( ) ; boolean continu = true ; do { cl = this . nextClosure ( cl ) ; if ( allclosure . contains ( cl ) ) { continu = false ; } else { allclosure . add ( cl ) ; } } while ( continu ) ; return allclosure ; }
Returns all the closed sets of the specified closure system (that can be
 an IS or a context).
Returns all the closed sets of the specified closure system ( that can be an IS or a context ) .
// first closure: closure of the empty set // next closures in lectically order