src/main/java/org/thegalactic/lattice/ConceptLattice.java
public boolean makeIrreduciblesReduction() {
        // make inclusion reduction
        if (this.makeInclusionReduction()) {
            // check if not set A reduced concepts are join irreducibles
            // and if not set B reduced concepts are meet irreducibles
            TreeSet<Node> joinIrr = this.joinIrreducibles();
            TreeSet<Node> meetIrr = this.meetIrreducibles();
            for (Object node : this.getNodes()) {
                Concept c = (Concept) node;
                if (c.hasSetA() && !c.getSetA().isEmpty() && !joinIrr.contains(c)) {
                    c.putSetA(new ComparableSet());
                }
                if (c.hasSetB() && !c.getSetB().isEmpty() && !meetIrr.contains(c)) {
                    c.putSetB(new ComparableSet());
                }
            }
        }
        return true;
    }
/**
     * Replaces set A of each join irreducible node by the difference between
     * itself and set A of the unique predecessor.
     *
     * Others closed sets are replaced by an emptyset.
     *
     * @return a boolean
     *
     * @todo Comment the return
     */
Replaces set A of each join irreducible node by the difference between
itself and set A of the unique predecessor.

Others closed sets are replaced by an emptyset.

@return a boolean

@todo Comment the return
Replaces set A of each join irreducible node by the difference between itself and set A of the unique predecessor . Others closed sets are replaced by an emptyset . @return a boolean @todo Comment the return
public boolean makeIrreduciblesReduction() {
        if (this.makeInclusionReduction()) {
            TreeSet<Node> joinIrr = this.joinIrreducibles();
            TreeSet<Node> meetIrr = this.meetIrreducibles();
            for (Object node : this.getNodes()) {
                Concept c = (Concept) node;
                if (c.hasSetA() && !c.getSetA().isEmpty() && !joinIrr.contains(c)) {
                    c.putSetA(new ComparableSet());
                }
                if (c.hasSetB() && !c.getSetB().isEmpty() && !meetIrr.contains(c)) {
                    c.putSetB(new ComparableSet());
                }
            }
        }
        return true;
    }
public boolean makeIrreduciblesReduction ( ) { if ( this . makeInclusionReduction ( ) ) { TreeSet < Node > joinIrr = this . joinIrreducibles ( ) ; TreeSet < Node > meetIrr = this . meetIrreducibles ( ) ; for ( Object node : this . getNodes ( ) ) { Concept c = ( Concept ) node ; if ( c . hasSetA ( ) && ! c . getSetA ( ) . isEmpty ( ) && ! joinIrr . contains ( c ) ) { c . putSetA ( new ComparableSet ( ) ) ; } if ( c . hasSetB ( ) && ! c . getSetB ( ) . isEmpty ( ) && ! meetIrr . contains ( c ) ) { c . putSetB ( new ComparableSet ( ) ) ; } } } return true ; }
Replaces set A of each join irreducible node by the difference between
 itself and set A of the unique predecessor.
Replaces set A of each join irreducible node by the difference between itself and set A of the unique predecessor .
// make inclusion reduction // check if not set A reduced concepts are join irreducibles // and if not set B reduced concepts are meet irreducibles