分布式雪花算法获取id工具类

package com.thk;

/**
 * 分布式唯一ID 雪花算法实现
 */
public class SnowFlake {
    /**
     * 起始的时间戳  2020-06-30 00:00:00
     */
    private final static long START_TIMESTAMP = 1593446400L;

    /**
     * 每一部分占用的位数
     */
    private final static long SEQUENCE_BIT = 12; //序列号占用的位数
    private final static long MACHINE_BIT = 5;   //机器标识占用的位数
    private final static long DATA_CENTER_BIT = 5;//数据中心占用的位数

    /**
     * 每一部分的最大值
     */
    private final static long MAX_DATA_CENTER_NUM = -1L ^ (-1L << DATA_CENTER_BIT);
    private final static long MAX_MACHINE_NUM = -1L ^ (-1L << MACHINE_BIT);
    private final static long MAX_SEQUENCE = -1L ^ (-1L << SEQUENCE_BIT);

    /**
     * 每一部分向左的位移
     */
    private final static long MACHINE_LEFT = SEQUENCE_BIT;
    private final static long DATA_CENTER_LEFT = SEQUENCE_BIT + MACHINE_BIT;
    private final static long TIMESTAMP_LEFT = DATA_CENTER_LEFT + DATA_CENTER_BIT;

    /**
     * 数据中心编码,初始化后不可修改
     * 最大值: 2^5-1 取值范围: [0,31]
     */
    private long dataCenterId;

    /**
     * 机器或进程编码,初始化后不可修改
     * 最大值: 2^5-1 取值范围: [0,31]
     */
    private long machineId;

    /**
     * 序列号
     * 最大值: 2^12-1 取值范围: [0,4095]
     */
    private long sequence = 0L;

    private long lastStamp = -1L;//上一次时间戳

    public SnowFlake(long dataCenterId, long machineId) {
        if (dataCenterId > MAX_DATA_CENTER_NUM || dataCenterId < 0) {
            throw new IllegalArgumentException("dataCenterId can't be greater than MAX_DATA_CENTER_NUM or less than 0");
        }
        if (machineId > MAX_MACHINE_NUM || machineId < 0) {
            throw new IllegalArgumentException("machineId can't be greater than MAX_MACHINE_NUM or less than 0");
        }
        this.dataCenterId = dataCenterId;
        this.machineId = machineId;
    }

    /**
     * 产生下一个ID
     *
     * @return
     */
    public synchronized long nextId() {
        //获取当前时间戳 可用System.currentTimeMillis(); 方法替换
        long currStamp = getNewStamp();
        //保证当前时间戳不小于最后一次的时间戳
        if (currStamp < lastStamp) {
            throw new RuntimeException("Clock moved backwards.  Refusing to generate id");
        }
        //如果当前时间戳等于最后一次时间戳 就进行序号递增
        if (currStamp == lastStamp) {
            //相同毫秒内,序列号自增
            sequence = (sequence + 1) & MAX_SEQUENCE;
            //同一毫秒的序列数已经达到最大
            if (sequence == 0L) {
                currStamp = getNextMill();
            }
        } else {
            //不同毫秒内,序列号置为0
            sequence = 0L;
        }
        //保存最后一次时间戳
        lastStamp = currStamp;
        //通过位运算,将相应的二进制数值放到对应的位置  41位时间戳 + 5位数据中心 + 5位机器码 + 12位序列号 ,首位没有使用
        return (currStamp - START_TIMESTAMP) << TIMESTAMP_LEFT //时间戳部分
                | dataCenterId << DATA_CENTER_LEFT       //数据中心部分
                | machineId << MACHINE_LEFT             //机器标识部分
                | sequence;                             //序列号部分
    }

    private long getNextMill() {
        //获取当前时间戳
        long mill = getNewStamp();
        //获取大于上一次时间戳的时间戳
        while (mill <= lastStamp) {
            mill = getNewStamp();
        }
        return mill;
    }

    /**
     * 获取当前时间戳
     */
    private long getNewStamp() {
        return System.currentTimeMillis();
    }
//测试 
public static void main(String[] args) {
    SnowFlake snowFlake = new SnowFlake(2, 3);
    long l = snowFlake.nextId();
    String s = String.valueOf(l);
    System.out.println("获取的id是---"+l);
    System.out.println("id的长度是---"+s.length());
}
}

测试结果:

获取的id是---6915710041110884352
id的长度是---19

你可能感兴趣的:(Java工具类,java)