public void addAll ( IntBitSet set ) { int i ; if ( set . data . length > data . length ) { resize ( set . data . length ) ; } for ( i = 0 ; i < set . data . length ; i ++ ) { data [ i ] |= set . data [ i ] ; } }
Computes the union . The result is stored in this set .