java bitsieve_java.util.BitSet 详细分析 学习笔记

2,2,2,2 };

BitSet bitSet = new BitSet(2 << 13);

// 虽然可以自动扩容,但尽量在构造时指定估算大小,默认为64

System.out.println("BitSet size: " + bitSet.size());

for (int i = 0; i < array.length; i++) {

bitSet.set(array[i]);

}

//剔除重复数字后的元素个数

int bitLen=bitSet.cardinality();

//进行排序,即把bit为true的元素复制到另一个数组

int[] orderedArray = new int[bitLen];

int k = 0;

for (int i = bitSet.nextSetBit(0); i >= 0; i = bitSet.nextSetBit(i + 1)) {

orderedArray[k++] = i;

}

System.out.println("After ordering: ");

for (int i = 0; i < bitLen; i++) {

System.out.print(orderedArray[i] + "\t");

}

System.out.println("iterate over the true bits in a BitSet");

//或直接迭代BitSet中bit为true的元素iterate over the true bits in a BitSet

for (int i = bitSet.nextSetBit(0); i >= 0; i = bitSet.nextSetBit(i + 1)) {

System.out.print(i+"\t");

}

System.out.println("---------------------------");

}

/**

* 将BitSet对象转化为ByteArray

* @param bitSet

* @return

*/

public static byte[] bitSet2ByteArray(BitSet bitSet) {

byte[] bytes = new byte[bitSet.size() / 8];

for (int i = 0; i < bitSet.size(); i++) {

int index = i / 8;

int offset = 7 - i % 8;

bytes[index] |= (bitSet.get(i) ? 1 : 0) << offset;

}

return bytes;

}

/**

* 将ByteArray对象转化为BitSet

* @param bytes

* @return

*/

public static BitSet byteArray2BitSet(byte[] bytes) {

BitSet bitSet = new BitSet(bytes.length * 8);

int index = 0;

for (int i = 0; i < bytes.length; i++) {

for (int j = 7; j >= 0; j--) {

bitSet.set(index++, (bytes[i] & (1 << j)) >> j == 1 ? true

: false);

}

}

return bitSet;

}

/**

* 简单使用示例

*/

public static void simpleExample() {

String names[] = { "Java", "Source", "and", "Support" };

BitSet bits = new BitSet();

for (int i = 0, n = names.length; i < n; i++) {

if ((names[i].length() % 2) == 0) {

bits.set(i);

}

}

System.out.println(bits);

System.out.println("Size : " + bits.size());

System.out.println("Length: " + bits.length());

for (int i = 0, n = names.length; i < n; i++) {

if (!bits.get(i)) {

System.out.println(names[i] + " is odd");

}

}

BitSet bites = new BitSet();

bites.set(0);

bites.set(1);

bites.set(2);

bites.set(3);

bites.andNot(bits);

System.out.println(bites);

}

public static void main(String args[]) {

//BitSet使用示例

BitSetDemo.containChars("How do you do? 你好呀");

BitSetDemo.computePrime();

BitSetDemo.sortArray();

BitSetDemo.simpleExample();

//BitSet与Byte数组互转示例

BitSet bitSet = new BitSet();

bitSet.set(3, true);

bitSet.set(98, true);

System.out.println(bitSet.size()+","+bitSet.cardinality());

//将BitSet对象转成byte数组

byte[] bytes = BitSetDemo.bitSet2ByteArray(bitSet);

System.out.println(Arrays.toString(bytes));

//在将byte数组转回来

bitSet = BitSetDemo.byteArray2BitSet(bytes);

System.out.println(bitSet.size()+","+bitSet.cardinality());

System.out.println(bitSet.get(3));

System.out.println(bitSet.get(98));

for (int i = bitSet.nextSetBit(0); i >= 0; i = bitSet.nextSetBit(i + 1)) {

System.out.print(i+"\t");

}

}

}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值