Lines Matching defs:set
40 * Primary differences are that most set operators return new sets
45 * Consider defining set degree. Without access to the bits, I must
48 * Also seems like or() from util is wrong when size of incoming set is bigger
84 /** or this element into this set (grow as necessary to accommodate) */
96 public void addAll(IntSet set) {
97 if ( set instanceof BitSet ) {
98 this.orInPlace((BitSet)set);
100 else if ( set instanceof IntervalSet ) {
101 IntervalSet other = (IntervalSet)set;
102 // walk set and add each interval
110 set.getClass().getName()+
252 * Grows the set to a larger number of bits.
253 * @param bit element that must fit in set
293 public IntSet complement(IntSet set) {
294 if ( set==null ) {
297 return set.subtract(this);
341 public static BitSet of(IntSet set) {
342 if ( set==null ) {
346 if ( set instanceof BitSet ) {
347 return (BitSet)set;
349 if ( set instanceof IntervalSet ) {
351 s.addAll(set);
354 throw new IllegalArgumentException("can't create BitSet from "+set.getClass().getName());
370 /** return this | a in a new set */
394 // remove this element from this set
404 * Sets the size of a set.
405 * @param nwords how many words the new set should be
473 /** Transform a bit set into a string by formatting each element as an integer
532 * Dump a comma-separated list of the words making up the bit set.
554 * Dump a comma-separated list of the words making up the bit set.