java实现BitMap

package bitmap;

public class BitMap {
	private byte[] bytes;

	public BitMap(byte[] bytes) {
		super();
		this.bytes = bytes;
	}

	public BitMap() {
		super();
	}

	public BitMap(int size) {
		super();
		int number = size / 8 + 1;// may waste a byte, which does not matter
		bytes = new byte[number];
	}

	/**
	 * 
	 * @param n
	 *            n>=1
	 */
	public void setBit(int n) {
		if (n <= 0)
			return;
		int index = -1;
		int offset = -1;
		if (0 == n % 8) {
			index = n / 8 - 1;
			offset = 7;
		} else {
			index = n / 8;
			offset = n % 8 - 1;
		}
		switch (offset) {
			case 0:
				bytes[index] = (byte)(bytes[index]|0x01);
				break;
			case 1:
				bytes[index] = (byte)(bytes[index]|0x02);
				break;
			case 2:
				bytes[index] = (byte)(bytes[index]|0x04);
				break;
			case 3:
				bytes[index] = (byte)(bytes[index]|0x08);
				break;
			case 4:
				bytes[index] = (byte)(bytes[index]|0x10);
				break;
			case 5:
				bytes[index] = (byte)(bytes[index]|0x20);
				break;
			case 6:
				bytes[index] = (byte)(bytes[index]|0x40);
				break;
			case 7:
				bytes[index] = (byte)(bytes[index]|0x80);
				break;
		}
	}
	
	public boolean get(int n){
		if (n <= 0)
			return false;
		int index = -1;
		int offset = -1;
		if (0 == n % 8) {
			index = n / 8 - 1;
			offset = 7;
		} else {
			index = n / 8;
			offset = n % 8 - 1;
		}
		switch (offset) {
			case 0:
				return (byte)(bytes[index]&0x01)!=0;//2^0
			case 1:
				return (byte)(bytes[index]&0x02)!=0;
			case 2:
				return (byte)(bytes[index]&0x04)!=0;
			case 3:
				return (byte)(bytes[index]&0x08)!=0;
			case 4:
				return (byte)(bytes[index]&0x10)!=0;
			case 5:
				return (byte)(bytes[index]&0x20)!=0;
			case 6:
				return (byte)(bytes[index]&0x40)!=0;
			case 7:
				return (byte)(bytes[index]&0x80)!=0;
		}
		return false;
	}

	public static void main(String[] args) {
		BitMap bMap = new BitMap(60);
		bMap.setBit(59);
		bMap.setBit(20);
		bMap.setBit(21);
		for(int i=1;i<=60;i++){
			if(bMap.get(i)==true)
				System.out.println(i);
		}
	}

}

转载于:https://www.cnblogs.com/bingtel/p/4194450.html

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

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值