src/main/java/org/thegalactic/lattice/ConceptLattice.java
public boolean initialiseSetBForMeet() {
        if (!this.containsConcepts()) {
            return false;
        }
        TreeSet<Node> meetIrr = this.meetIrreducibles();
        for (Object node : this.getNodes()) {
            Concept c = (Concept) node;
            if (!c.hasSetB() && meetIrr.contains(c)) {
                ComparableSet setX = new ComparableSet();
                setX.add(Integer.valueOf(c.getIdentifier()));
                c.putSetB(setX);
            }
        }
        return true;
    }
/**
     * Replace null set B in each meet irreducible concept with a set containing
     * node ident.
     *
     * @return a boolean
     *
     * @todo Comment the return
     */
Replace null set B in each meet irreducible concept with a set containing
node ident.

@return a boolean

@todo Comment the return
Replace null set B in each meet irreducible concept with a set containing node ident . @return a boolean @todo Comment the return
public boolean initialiseSetBForMeet() {
        if (!this.containsConcepts()) {
            return false;
        }
        TreeSet<Node> meetIrr = this.meetIrreducibles();
        for (Object node : this.getNodes()) {
            Concept c = (Concept) node;
            if (!c.hasSetB() && meetIrr.contains(c)) {
                ComparableSet setX = new ComparableSet();
                setX.add(Integer.valueOf(c.getIdentifier()));
                c.putSetB(setX);
            }
        }
        return true;
    }
public boolean initialiseSetBForMeet ( ) { if ( ! this . containsConcepts ( ) ) { return false ; } TreeSet < Node > meetIrr = this . meetIrreducibles ( ) ; for ( Object node : this . getNodes ( ) ) { Concept c = ( Concept ) node ; if ( ! c . hasSetB ( ) && meetIrr . contains ( c ) ) { ComparableSet setX = new ComparableSet ( ) ; setX . add ( Integer . valueOf ( c . getIdentifier ( ) ) ) ; c . putSetB ( setX ) ; } } return true ; }
Replace null set B in each meet irreducible concept with a set containing
 node ident.
Replace null set B in each meet irreducible concept with a set containing node ident .