org.voovan.tools.UniqueId Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of voovan-common Show documentation

Voovan is a java framwork and it not depends on any third-party framework.

There is a newer version: 4.3.8

package org.voovan.tools;

import java.nio.ByteBuffer;
import java.nio.CharBuffer;
import java.nio.charset.Charset;
import java.security.SecureRandom;
import java.util.Arrays;

/**
 * 高速ID生成器
 * 采用 snowflake 算法快速生成 ID
 *
 * @author: helyho
 * Voovan Framework.
 * WebSite: https://github.com/helyho/Voovan
 * Licence: Apache v2 License
 */
public class UniqueId {
    private static final int SEQ_DEFAULT = 0;
    private static final int RADIX = 62;
    private static final int sequenceLeft = 12;
    private static final int signIdLeft = 10;
    private static final int maxsignId = 1 << signIdLeft;

    private Integer orderedIdSequence = SEQ_DEFAULT;
    private Long lastTime = 0L;
    private int workId = 0;

    /**
     * 构造函数
     */
    public UniqueId() {
        int workId = (new SecureRandom()).nextInt(maxsignId);
        if(workId > maxsignId || workId < 0){
            throw new IllegalArgumentException(String.format("worker Id can't be greater than %d or less than 0", maxsignId));
        }
        workId = 0;
    }

    /**
     *  构造函数
     * @param signId 标识 ID
     */
    public UniqueId(int signId) {
        if(workId > signIdLeft || signId < 0){
            throw new IllegalArgumentException(String.format("worker Id can't be greater than %d or less than 0", signIdLeft));
        }
        workId = 0;
    }

    /**
     * 获取下一个 id
     * @return 返回 id
     */
    public long nextInt(){
        return generateId();
    }

    /**
     * 获取下一个 id
     * @return 返回 id
     */
    public String nextString(){
        return TString.radixConvert(generateId(), RADIX);
    }

    /**
     * 生成带顺序的 ID 序列
     * @return ID字符串
     */
    public synchronized long generateId(){
        long currentTime = System.currentTimeMillis();

        if(lastTime < currentTime){
            orderedIdSequence = SEQ_DEFAULT;
        }else if(lastTime > currentTime){
            throw new RuntimeException("Clock moved backwards.");
        }

        long resultId = (currentTime << (sequenceLeft+signIdLeft) ) | (workId << signIdLeft) | orderedIdSequence;

        orderedIdSequence++;

        lastTime = currentTime;
        return resultId;
    }
}