springcloud使用雪花算法生成唯一ID

• 针对每个公司，随着服务化演进，单个服务越来越多，数据库分的越来越细，有的时候一个业务需要分成好几个库，这时候自增主键或者序列之类的主键id生成方式已经不再满足需求，分布式系统中需要的是一个全局唯一的id生成规则。既然号称在全局分布式系统中唯一，那么主键的生成规则必然要复杂一些

• 雪花算法代码

/**
 * twitter 的分布式环境全局唯一id算法
 */
public class IdGenerateUtil {
    private long workerId;
    private long datacenterId;
    private long sequence = 0L;
    private long twepoch            = 1288834974657L;
    private long workerIdBits       = 5L;
    private long datacenterIdBits   = 5L;
    private long maxWorkerId        = -1L ^ (-1L << workerIdBits);
    private long maxDatacenterId    = -1L ^ (-1L << datacenterIdBits);
    private long sequenceBits       = 12L;
    private long workerIdShift      = sequenceBits;
    private long datacenterIdShift  = sequenceBits + workerIdBits;
    private long timestampLeftShift = sequenceBits + workerIdBits + datacenterIdBits;
    private long sequenceMask       = -1L ^ (-1L << sequenceBits); //4095
    private long lastTimestamp      = -1L;

    private static class IdGenHolder {
        private static final IdGenerateUtil instance = new IdGenerateUtil();
    }

    public static IdGenerateUtil get() {
        return IdGenHolder.instance;
    }

    public IdGenerateUtil() {
        this(0L, 0L);
    }

    public IdGenerateUtil(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;
    }

    public synchronized long nextId() {
        long timestamp = timeGen();
        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;
        }
        lastTimestamp = timestamp;
        return ((timestamp - twepoch) << timestampLeftShift) | (datacenterId << datacenterIdShift)
                | (workerId << workerIdShift) | sequence;
    }

    protected long tilNextMillis(long lastTimestamp) {
        long timestamp = timeGen();
        while (timestamp <= lastTimestamp) {
            timestamp = timeGen();
        }
        return timestamp;
    }

    protected long timeGen() {
        return System.currentTimeMillis();
    }
    
}

• 演示生成订单时所生成的订单id