Collection<H> gcs( BitSet key, boolean includeEquals ) {

        List<H> vals = new LinkedList<H>();
        List<J> border = gcsBorderNodes( key, includeEquals );

        for ( int j = 0; j < border.size(); j++ ) {
            J node = border.get( j );
            if ( node != null ) {
                vals.add( node.getValue() );
            }
        }

        return vals;

    }
Collection < H > gcs ( BitSet key , boolean includeEquals ) { List < H > vals = new LinkedList < H > ( ) ; List < J > border = gcsBorderNodes ( key , includeEquals ) ; for ( int j = 0 ; j < border . size ( ) ; j ++ ) { J node = border . get ( j ) ; if ( node != null ) { vals . add ( node . getValue ( ) ) ; } } return vals ; }
@param key a key, possibly the meet of a number of member keys
@return