| /* |
| * Copyright (C) 2015 The Android Open Source Project |
| * |
| * Licensed under the Apache License, Version 2.0 (the "License"); |
| * you may not use this file except in compliance with the License. |
| * You may obtain a copy of the License at |
| * |
| * http://www.apache.org/licenses/LICENSE-2.0 |
| * |
| * Unless required by applicable law or agreed to in writing, software |
| * distributed under the License is distributed on an "AS IS" BASIS, |
| * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| * See the License for the specific language governing permissions and |
| * limitations under the License. |
| */ |
| |
| package android.databinding.tool.writer; |
| |
| import java.util.BitSet; |
| |
| /** |
| * Used for code generation. A BitSet can be converted into a flag set, |
| * which is basically a list of longs that can be divided into pieces. |
| */ |
| public class FlagSet { |
| public static final int sBucketSize = 64;// long |
| public final String type; |
| public final long[] buckets; |
| private String mLocalName; |
| private boolean mIsDynamic = false; |
| |
| public FlagSet(BitSet bitSet, int bucketCount) { |
| buckets = new long[bucketCount]; |
| for (int i = bitSet.nextSetBit(0); |
| i != -1; i = bitSet.nextSetBit(i + 1)) { |
| buckets[i / sBucketSize] |= 1L << (i % sBucketSize); |
| } |
| type = "long"; |
| } |
| |
| public FlagSet(long[] buckets) { |
| this.buckets = new long[buckets.length]; |
| System.arraycopy(buckets, 0, this.buckets, 0, buckets.length); |
| type = "long"; |
| } |
| |
| public FlagSet(long[] buckets, int minBucketCount) { |
| this.buckets = new long[Math.max(buckets.length, minBucketCount)]; |
| System.arraycopy(buckets, 0, this.buckets, 0, buckets.length); |
| type = "long"; |
| } |
| |
| public FlagSet(int... bits) { |
| int max = 0; |
| for (int i = 0 ; i < bits.length; i ++) { |
| max = Math.max(i, bits[i]); |
| } |
| buckets = new long[1 + (max / sBucketSize)]; |
| for (int x = 0 ; x < bits.length; x ++) { |
| final int i = bits[x]; |
| buckets[i / sBucketSize] |= 1L << (i % sBucketSize); |
| } |
| type = "long"; |
| } |
| |
| public boolean intersect(FlagSet other, int bucketIndex) { |
| return (buckets[bucketIndex] & other.buckets[bucketIndex]) != 0; |
| } |
| |
| public String getLocalName() { |
| return mLocalName; |
| } |
| |
| public void setLocalName(String localName) { |
| mLocalName = localName; |
| } |
| |
| public boolean hasLocalName() { |
| return mLocalName != null; |
| } |
| |
| public boolean isDynamic() { |
| return mIsDynamic; |
| } |
| |
| public void setDynamic(boolean isDynamic) { |
| mIsDynamic = isDynamic; |
| } |
| |
| public FlagSet andNot(FlagSet other) { |
| FlagSet result = new FlagSet(buckets); |
| final int min = Math.min(buckets.length, other.buckets.length); |
| for (int i = 0; i < min; i ++) { |
| result.buckets[i] &= ~(other.buckets[i]); |
| } |
| return result; |
| } |
| |
| public FlagSet or(FlagSet other) { |
| final FlagSet result = new FlagSet(buckets, other.buckets.length); |
| for (int i = 0; i < other.buckets.length; i ++) { |
| result.buckets[i] |= other.buckets[i]; |
| } |
| return result; |
| } |
| |
| public boolean isEmpty() { |
| for (int i = 0; i < buckets.length; i ++) { |
| if (buckets[i] != 0) { |
| return false; |
| } |
| } |
| return true; |
| } |
| |
| @Override |
| public String toString() { |
| StringBuilder sb = new StringBuilder(); |
| for (int i = 0; i < buckets.length; i ++) { |
| sb.append(Long.toBinaryString(buckets[i])).append(" "); |
| } |
| return sb.toString(); |
| } |
| |
| private long getBucket(int bucketIndex) { |
| if (bucketIndex >= buckets.length) { |
| return 0; |
| } |
| return buckets[bucketIndex]; |
| } |
| |
| public boolean bitsEqual(FlagSet other) { |
| final int max = Math.max(buckets.length, other.buckets.length); |
| for (int i = 0; i < max; i ++) { |
| if (getBucket(i) != other.getBucket(i)) { |
| return false; |
| } |
| } |
| return true; |
| } |
| |
| @Override |
| public int hashCode() { |
| int hash = 1; |
| for (long bucket : buckets) { |
| hash = (hash * 7) ^ (int)(bucket >>> 32); |
| hash = (hash * 13) ^ (int)(bucket & 0xFFFF); |
| } |
| return hash; |
| } |
| |
| @Override |
| public boolean equals(Object obj) { |
| if (obj instanceof FlagSet) { |
| FlagSet other = (FlagSet) obj; |
| if (other.buckets.length != buckets.length) { |
| return false; |
| } |
| for (int i = 0; i < buckets.length; i++) { |
| if (buckets[i] != other.buckets[i]) { |
| return false; |
| } |
| } |
| return true; |
| } else { |
| return false; |
| } |
| } |
| } |