分布式ID生成器

1.自定义算法 

package com.roger;

import java.net.Inet4Address;
import java.net.InetAddress;
import java.net.NetworkInterface;
import java.text.SimpleDateFormat;
import java.util.Date;
import java.util.Enumeration;

public class DistrIdGenerator {

    public static String LOCAL_IP = null;

    private static String LOCAL_IP_Q4 = null;

    private static Integer index = 0;  // 当前的序号

    static {
        // 获取本机ip
        LOCAL_IP = initLocalAddress();
        // 获取本机ip第四位
        LOCAL_IP_Q4 = formatNumber(Integer.valueOf(LOCAL_IP.split("\\.")[3]), 3);
    }

    /**
     * 获取服务器IP地址
     *
     * @return
     */
    private static String initLocalAddress() {
        try {
            Enumeration<NetworkInterface> allNetInterfaces = NetworkInterface.getNetworkInterfaces();
            InetAddress ip = null;
            while (allNetInterfaces.hasMoreElements()) {
                NetworkInterface netInterface = (NetworkInterface) allNetInterfaces.nextElement();
                Enumeration<InetAddress> addresses = netInterface.getInetAddresses();
                while (addresses.hasMoreElements()) {
                    ip = (InetAddress) addresses.nextElement();
                    if ((ip != null) && ((ip instanceof Inet4Address))) {
                        return ip.getHostAddress();
                    }
                }
            }
            if (ip == null) {
                ip = InetAddress.getLocalHost();
            }
            return ip.getHostAddress();
        } catch (Exception e) {

        }
        return "000.000.000.000";
    }

    /**
     * 格式化数字,前置位不够补0
     *
     * @param num : 数值
     * @param p   :位数,最多支持6位
     * @return
     */
    private static String formatNumber(int num, int p) {
        StringBuffer result = new StringBuffer();

        int value = num;
        for (int i = 0; i < p; i++) {
            result.insert(0, value % 10);
            value = value / 10;
        }
        return result.toString();
    }


    /**
     * 生成随机ID入口方法
     * 规则:年月日时分秒毫秒(去掉前两位)+服务器IP(第四位,长度为三位,若不足三位,则在前面补0)+4位递增序列数(1—9999,若不足4位,后面补0)
     * 特征:共22位,满足分布式,线程安全,不会重复
     *
     * @return
     */
    public synchronized static String createRandomId() {
        Date date = new Date();
        SimpleDateFormat sdf = new SimpleDateFormat("yyyyMMddHHmmssSSS");
        String formDate = sdf.format(date);
        String dateStr = formDate.substring(2);
        if (index >= 9999) {
            index = 1;
        } else {
            index++;
        }
        String id = dateStr + LOCAL_IP_Q4 + formatNumber(index, 4);
        return id;
    }

    /**
     * 获取随机数,若不够位数,则在末尾补0
     *
     * @param min
     * @param max
     * @param n
     * @return
     */
    public static int randomCommon(int min, int max, int n) {
        int num = (int) (Math.random() * (max - min)) + min;
        if ((n - String.valueOf(num).length()) > 0) {
            int base = (int) Math.pow(10, (n - String.valueOf(num).length()));
            int numNew = num * base;
            return numNew;
        }
        return num;
    }
}

2.雪花算法

package com.roger.quartz.core.utils;

public class SnowflakeIdWorker {
    private static SnowflakeIdWorker SnowflakeIdWorker=new SnowflakeIdWorker();
    //声明私有构造函数
    private SnowflakeIdWorker(){

    }
    // ==============================Fields===========================================
    /** 开始时间截 (2015-01-01) */
    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;

    //==============================Constructors=====================================
    /**
     * 构造函数
     * @param workerId 工作ID (0~31)
     * @param datacenterId 数据中心ID (0~31)
     */
    public SnowflakeIdWorker(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;
    }

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

        //如果当前时间小于上一次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;

        //移位并通过或运算拼到一起组成64位的ID
        return ((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();
    }

    public static SnowflakeIdWorker getInstance() {
        return SnowflakeIdWorker;
    }
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值