import java.util.HashSet;
import java.util.concurrent.atomic.AtomicLong;

public class SnowFlake {

    //時(shí)間 41位
    private static long lastTime = System.currentTimeMillis();

    //數(shù)據(jù)中心ID 5位(默認(rèn)0-31)
    private long datacenterId = 0;
    private long datacenterIdShift = 5;

    //機(jī)房機(jī)器ID 5位(默認(rèn)0-31)
    private long workerId = 0;
    private long workerIdShift = 5;

    //隨機(jī)數(shù) 12位(默認(rèn)0~4095)
    private AtomicLong random = new AtomicLong();
    private long randomShift = 12;
    //隨機(jī)數(shù)的最大值
    private long maxRandom = (long) Math.pow(2, randomShift);

    public SnowFlake() {
    }

    public SnowFlake(long workerIdShift, long datacenterIdShift){
        if (workerIdShift < 0 ||
                datacenterIdShift < 0 ||
                workerIdShift + datacenterIdShift > 22) {
            throw new IllegalArgumentException("參數(shù)不匹配");
        }
        this.workerIdShift = workerIdShift;
        this.datacenterIdShift = datacenterIdShift;
        this.randomShift = 22 - datacenterIdShift - workerIdShift;
        this.maxRandom = (long) Math.pow(2, randomShift);
    }

    //獲取雪花的ID
    private long getId() {
        return lastTime << (workerIdShift + datacenterIdShift + randomShift) |
                workerId << (datacenterIdShift + randomShift) |
                datacenterId << randomShift |
                random.get();
    }

    //生成一個(gè)新的ID
    public synchronized long nextId() {
        long now = System.currentTimeMillis();

        //如果當(dāng)前時(shí)間和上一次時(shí)間不在同一毫秒內(nèi)，直接返回
        if (now > lastTime) {
            lastTime = now;
            random.set(0);
            return getId();
        }

	//將最后的隨機(jī)數(shù)，進(jìn)行+1操作
        if (random.incrementAndGet() < maxRandom) {
            return getId();
        }

        //自選等待下一毫秒
        while (now <= lastTime) {
            now = System.currentTimeMillis();
        }

        lastTime = now;
        random.set(0);
        return getId();

    }

    //測試
    public static void main(String[] args) {
        SnowFlake snowFlake = new SnowFlake();
        HashSet<Long> set = new HashSet<>();
        for (int i = 0; i < 10000; i++) {
            set.add(snowFlake.nextId());
        }
        System.out.println(set.size());
    }

}