Lines Matching refs:buckets
28 public final long[] buckets;
33 buckets = new long[bucketCount];
36 buckets[i / sBucketSize] |= 1L << (i % sBucketSize);
41 public FlagSet(long[] buckets) {
42 this.buckets = new long[buckets.length];
43 System.arraycopy(buckets, 0, this.buckets, 0, buckets.length);
47 public FlagSet(long[] buckets, int minBucketCount) {
48 this.buckets = new long[Math.max(buckets.length, minBucketCount)];
49 System.arraycopy(buckets, 0, this.buckets, 0, buckets.length);
58 buckets = new long[1 + (max / sBucketSize)];
61 buckets[i / sBucketSize] |= 1L << (i % sBucketSize);
67 return (buckets[bucketIndex] & other.buckets[bucketIndex]) != 0;
91 FlagSet result = new FlagSet(buckets);
92 final int min = Math.min(buckets.length, other.buckets.length);
94 result.buckets[i] &= ~(other.buckets[i]);
100 final FlagSet result = new FlagSet(buckets, other.buckets.length);
101 for (int i = 0; i < other.buckets.length; i ++) {
102 result.buckets[i] |= other.buckets[i];
108 for (int i = 0; i < buckets.length; i ++) {
109 if (buckets[i] != 0) {
119 for (int i = 0; i < buckets.length; i ++) {
120 sb.append(Long.toBinaryString(buckets[i])).append(" ");
126 if (bucketIndex >= buckets.length) {
129 return buckets[bucketIndex];
133 final int max = Math.max(buckets.length, other.buckets.length);
145 for (long bucket : buckets) {
156 if (other.buckets.length != buckets.length) {
159 for (int i = 0; i < buckets.length; i++) {
160 if (buckets[i] != other.buckets[i]) {
