Lines Matching defs:add
70 s.add(a);
77 s.add(a,b);
84 public void add(int el) {
85 add(el,el);
88 /** Add interval; i.e., add all integers from a to b to set.
95 public void add(int a, int b) {
96 add(Interval.create(a,b));
100 protected void add(Interval addition) {
101 //System.out.println("add "+addition+" to "+intervals.toString());
132 iter.add(addition);
138 // just add it
139 intervals.add(addition);
143 protected void add(Interval addition) {
144 //System.out.println("add "+addition+" to "+intervals.toString());
176 intervals.add(i, addition);
182 // just add it
183 intervals.add(addition);
192 throw new IllegalArgumentException("can't add non IntSet ("+
197 // walk set and add each interval
201 this.add(I.a,I.b);
232 // add a range from 0 to first.a constrained to vocab
246 // add a range from last.b to maxElement constrained to vocab
302 // add everything in mine to difference since theirs done
303 diff.add(mine);
311 // so we can add to difference; move mine, but not theirs
313 diff.add(mine);
332 // must add two intervals: stuff to left and stuff to right
333 diff.add(mine.a, theirs.a-1);
334 // don't actually add stuff to right yet as next 'theirs'
347 // CASE 3: theirs covers mine; nothing to add to diff
349 // nothing to add, theirs forces removal totally of mine
360 diff.add(mine.differenceNotProperlyContained(theirs));
429 // overlap, add intersection, get next theirs
433 intersection.add(mine.intersection(theirs));
437 // overlap, add intersection, get next mine
441 intersection.add(mine.intersection(theirs));
445 // overlap, add intersection
449 intersection.add(mine.intersection(theirs));
624 values.add(Utils.integer(v));
676 s.add(v);