分布式ID生成策略Snowflake算法实现

雪花算法实现分布式ID,转载别人博客,主要优化一些代码,符合公司代码审查标准

package com.sy.basis.util;

import java.lang.management.ManagementFactory;
import java.lang.management.RuntimeMXBean;
import java.net.NetworkInterface;
import java.net.SocketException;
import java.time.Clock;
import java.util.Enumeration;

/**
 * snowFlake 算法实现
 * 源https://blog.csdn.net/nsxqf/article/details/85850232
 * @author wangxiao
 * @since 1.1
 */
public class SnowFlakeUtil {
    
    private final static long EPOCH = 12888349746579L;
    /**
     * 机器标识位数
     */
    private final static long WORKER_ID_BITS = 5L;
    /**
     *  数据中心标识位数
     */
    private final static long DATA_CENTER_ID_BITS = 5L;
    /**
     * 毫秒内自增位数
      */
    private final static long SEQUENCE_BITS = 12L;
    /**
     * 机器ID偏左移12位
     */
    private final static long WORKER_ID_SHIFT = SEQUENCE_BITS;
    /**
     * 数据中心ID左移17位
     */
    private final static long DATA_CENTER_ID_SHIFT = SEQUENCE_BITS + WORKER_ID_BITS;
    /**
     * 时间毫秒左移22位
     */
    private final static long TIME_STAMP_LEFT_SHIFT = SEQUENCE_BITS + WORKER_ID_BITS + DATA_CENTER_ID_BITS;
    /**
     * sequence掩码,确保sequnce不会超出上限
     */
    private final static long SEQUENCE_MASK = ~(-1L << SEQUENCE_BITS);
    /**
     * 上次时间戳
     */
    private static long LAST_TIME_STAMP = -1L;
    /**
     * 序列
     */
    private long sequence = 0L;
    /**
     * 服务器ID
     */
    private long workerId = 1L;
    private static long WORKER_MASK = ~(-1L << WORKER_ID_BITS);
    /**
     * 进程编码
     */
    private long processId = 1L;

    private static long PROCESS_MASK = ~(-1L << DATA_CENTER_ID_BITS);

    private static SnowFlakeUtil snowFlake = null;

    static{
        snowFlake = new SnowFlakeUtil();
    }
    public static synchronized long nextId(){
        return snowFlake.getNextId();
    }

    private SnowFlakeUtil() {
        //获取机器编码
        this.workerId=this.getMachineNum();
        //获取进程编码
        RuntimeMXBean runtimeMXBean = ManagementFactory.getRuntimeMXBean();
        this.processId= Long.parseLong(runtimeMXBean.getName().split("@")[0]);

        //避免编码超出最大值
        this.workerId=workerId & WORKER_MASK;
        this.processId=processId & PROCESS_MASK;
    }

    public synchronized long getNextId() {
        //获取时间戳
        long timestamp = timeGen();
        //如果时间戳小于上次时间戳则报错
        if (timestamp < LAST_TIME_STAMP) {
            try {
                throw new Exception("Clock moved backwards.  Refusing to generate id for " + (LAST_TIME_STAMP - timestamp) + " milliseconds");
            } catch (Exception e) {
                e.printStackTrace();
            }
        }
        //如果时间戳与上次时间戳相同
        if (LAST_TIME_STAMP == timestamp) {
            // 当前毫秒内,则+1,与SEQUENCE_MASK确保sequence不会超出上限
            sequence = (sequence + 1) & SEQUENCE_MASK;
            if (sequence == 0) {
                // 当前毫秒内计数满了,则等待下一秒
                timestamp = tilNextMillis(LAST_TIME_STAMP);
            }
        } else {
            sequence = 0;
        }
        LAST_TIME_STAMP = timestamp;
        // ID偏移组合生成最终的ID,并返回ID
        long nextId = ((timestamp - EPOCH) << TIME_STAMP_LEFT_SHIFT) | (processId << DATA_CENTER_ID_SHIFT) | (workerId << WORKER_ID_SHIFT) | sequence;
        return nextId;
    }

    /**
     * 再次获取时间戳直到获取的时间戳与现有的不同
     * @param LAST_TIME_STAMP
     * @return 下一个时间戳
     */
    private long tilNextMillis(final long LAST_TIME_STAMP) {
        long timestamp = this.timeGen();
        while (timestamp <= LAST_TIME_STAMP) {
            timestamp = this.timeGen();
        }
        return timestamp;
    }

    private long timeGen() {
        return Clock.systemUTC().millis();
    }

    /**
     * 获取机器编码
     * @return
     */
    private long getMachineNum(){
        long machinePiece;
        StringBuilder sb = new StringBuilder();
        Enumeration<NetworkInterface> e = null;
        try {
            e = NetworkInterface.getNetworkInterfaces();
        } catch (SocketException e1) {
            e1.printStackTrace();
        }
        while (e.hasMoreElements()) {
            NetworkInterface ni = e.nextElement();
            sb.append(ni.toString());
        }
        machinePiece = sb.toString().hashCode();
        return machinePiece;
    }

    
}

 

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值