雪花算法生成唯一ID

根据雪花算法生成唯一分布式ID。

创建雪花算法类

public class SnowFlakeGenerateIdWorker {

    /**
     * 开始时间截
     */
    private final long twepoch = 1420041600000L;

    /**
     * 机器id所占的位数
     */
    private final long workerIdBits = 5L;

    /**
     * 数据标识id所占的位数
     */
    private final long datacenterIdBits = 5L;

    /**
     * 支持的最大机器id,结果是31 (这个移位算法可以很快的计算出几位二进制数所能表示的最大十进制数)
     */
    private final long maxWorkerId = -1L ^ (-1L << workerIdBits);

    /**
     * 支持的最大数据标识id,结果是31
     */
    private final long maxDatacenterId = -1L ^ (-1L << datacenterIdBits);

    /**
     * 序列在id中占的位数
     */
    private final long sequenceBits = 12L;

    /**
     * 机器ID向左移12位
     */
    private final long workerIdShift = sequenceBits;

    /**
     * 数据标识id向左移17位(12+5)
     */
    private final long datacenterIdShift = sequenceBits + workerIdBits;

    /**
     * 时间截向左移22位(5+5+12)
     */
    private final long timestampLeftShift = sequenceBits + workerIdBits + datacenterIdBits;

    /**
     * 生成序列的掩码,这里为4095 (0b111111111111=0xfff=4095)
     */
    private final long sequenceMask = -1L ^ (-1L << sequenceBits);

    /**
     * 工作机器ID(0~31)
     */
    private long workerId;

    /**
     * 数据中心ID(0~31)
     */
    private long datacenterId;

    /**
     * 毫秒内序列(0~4095)
     */
    private long sequence = 0L;

    /**
     * 上次生成ID的时间截
     */
    private long lastTimestamp = -1L;


    /**
     * 构造函数
     *
     * @param workerId     工作ID (0~31)
     * @param datacenterId 数据中心ID (0~31)
     */
    public SnowFlakeGenerateIdWorker(long workerId, long datacenterId) {
        if (workerId > maxWorkerId || workerId < 0) {
            throw new IllegalArgumentException(String.format("worker Id can't be greater than %d or less than 0", maxWorkerId));
        }
        if (datacenterId > maxDatacenterId || datacenterId < 0) {
            throw new IllegalArgumentException(String.format("datacenter Id can't be greater than %d or less than 0", maxDatacenterId));
        }
        this.workerId = workerId;
        this.datacenterId = datacenterId;
    }


    /**
     * 获得下一个ID (该方法是线程安全的)
     *
     * @return long
     */
    public synchronized long nextId() {

        long timestamp = timeGen();
        timestamp = generateId(timestamp);
        return ((timestamp - twepoch) << timestampLeftShift) //
                | (datacenterId << datacenterIdShift) //
                | (workerId << workerIdShift) //
                | sequence;
    }

    private long generateId(long timestamp){
        //如果当前时间小于上一次ID生成的时间戳,说明系统时钟回退过这个时候应当抛出异常
        if(timestamp < lastTimestamp){
            throw new RuntimeException(
                    String.format("Clock moved backwards.  Refusing to generate id for %d milliseconds", lastTimestamp - timestamp));
        }
        //如果是同一时间生成的,则进行毫秒内序列
        if(lastTimestamp == timestamp)
        {
            sequence = (sequence + 1) & sequenceMask;
            //毫秒内序列溢出
            if(sequence == 0)
                //阻塞到下一个毫秒,获得新的时间戳
                timestamp = tilNextMillis(lastTimestamp);
        }
        else//时间戳改变,毫秒内序列重置
        {
            sequence = 0L;
        }
        //上次生成ID的时间截
        lastTimestamp = timestamp;
        return timestamp;
    }
    /**
     *获得下一个ID (string)
     **/
    public synchronized String generateNextId() {
        long timestamp = timeGen();
        timestamp = generateId(timestamp);
        //移位并通过或运算拼到一起组成64位的ID
        return String.valueOf(((timestamp - twepoch) << timestampLeftShift)
                | (datacenterId << datacenterIdShift)
                | (workerId << workerIdShift)
                | sequence);
    }



    /**
     * 阻塞到下一个毫秒,直到获得新的时间戳
     *
     * @param lastTimestamp 上次生成ID的时间截
     * @return 当前时间戳
     */
    protected long tilNextMillis(long lastTimestamp) {
        long timestamp = timeGen();
        while (timestamp <= lastTimestamp) {
            timestamp = timeGen();
        }
        return timestamp;
    }

    /**
     * 返回以毫秒为单位的当前时间
     *
     * @return 当前时间(毫秒)
     */
    protected long timeGen() {
        return System.currentTimeMillis();
    }

}

调用该类生产ID

public static void main(String[] args){
      SnowFlakeGenerateIdWorker worker = new SnowFlakeGenerateIdWorker(0,0);
      String id = worker.generateNextId();
      System.out.println("分布式ID:" + id);
}

### Java 实现雪花算法生成唯一ID #### 1. 雪花算法简介 雪花算法是一种用于分布式系统中高效生成全局唯一ID的方法。该方法由Twitter开源,能够生成不重复的、有序的64位整数型ID,在高并发场景下依然保持良好的性能[^3]。 #### 2. Snowflake ID结构解析 一个标准的Snowflake ID是由多个部分组成: - **时间戳(41 bit)**:记录的是从纪元(通常是2022年1月1日)到当前时刻经过了多少毫秒; - **数据中心ID (5 bit)**:用来区分不同的数据中心; - **机器节点ID (5 bit)**:在同一数据中心内进一步细分不同服务器实例; - **序列号(12 bit)** :同一台机器上每毫秒内的计数值; 这种设计使得即使在网络分区的情况下也能保证全球范围内的唯一性[^1]。 #### 3. Java代码实现 下面是一个简单的Java版本的SnowFlake类定义及其使用方式: ```java public class SnowflakeIdWorker { private final long workerId; private final long datacenterId; // 时间偏移量,默认设置为2022-01-01 private static final long twepoch = 1640995200000L; // 各个字段所占bit数 private static final int WORKER_ID_BITS = 5; private static final int DATACENTER_ID_BITS = 5; private static final int SEQUENCE_BITS = 12; // 最大支持machine数量=31, 即允许的最大dataCenter数量也是31 public static final long MAX_WORKER_ID = ~(-1L << WORKER_ID_BITS); public static final long MAX_DATACENTER_ID = ~(-1L << DATACENTER_ID_BITS); // 移动位置计算 private static final long WORKER_ID_SHIFT = SEQUENCE_BITS; private static final long DATACENTER_ID_SHIFT = SEQUENCE_BITS + WORKER_ID_BITS; private static final long TIMESTAMP_LEFT_SHIFT = SEQUENCE_BITS + WORKER_ID_BITS + DATACENTER_ID_BITS; private static final long SEQUENCE_MASK = ~(-1L << SEQUENCE_BITS); private long sequence = 0L; private long lastTimestamp = -1L; /** * 构造函数初始化worker id 和 data center id. */ public SnowflakeIdWorker(long workerId,long datacenterId){ if(workerId > MAX_WORKER_ID || workerId < 0){ throw new IllegalArgumentException(String.format("worker Id can't be greater than %d or less than 0",MAX_WORKER_ID)); } if(datacenterId > MAX_DATACENTER_ID || datacenterId < 0){ throw new IllegalArgumentException(String.format("datacenter Id can't be greater than %d or less than 0",MAX_DATACENTER_ID)); } this.workerId = workerId; this.datacenterId = datacenterId; } /** * 获取下一个ID */ synchronized public long nextId() { long timestamp = timeGen(); if(timestamp < lastTimestamp){ try{ throw new Exception("Clock moved backwards.Refusing to generate id for "+ (lastTimestamp-timestamp)+" milliseconds"); }catch(Exception e){ System.err.println(e.getMessage()); } } if(lastTimestamp == timestamp){ sequence = (sequence + 1) & SEQUENCE_MASK; if(sequence == 0){ timestamp = tilNextMillis(lastTimestamp); } }else{ sequence = 0L; } lastTimestamp = timestamp; return ((timestamp - twepoch) << TIMESTAMP_LEFT_SHIFT)| (datacenterId << DATACENTER_ID_SHIFT) | (workerId << WORKER_ID_SHIFT) | sequence; } protected long tilNextMillis(final long lastTimestamp) throws InterruptedException { long timestamp = timeGen(); while (timestamp <= lastTimestamp) { Thread.sleep(1); timestamp = timeGen(); } return timestamp; } protected long timeGen(){ return System.currentTimeMillis(); } } ``` 此段程序展示了如何创建`SnowflakeIdWorker`对象并调用其`nextId()`方法来获取新的唯一ID
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值