雪花算法简单实现

雪花算法简单实现

Snowflake算法是一种分布式系统生成全局唯一ID的算法，主要用于在分布式系统中生成唯一ID，以防止因为多台服务器同时生成ID而产生重复的情况。其主要原理是根据时间戳、数据中心ID和机器ID等信息生成一个64位的唯一ID。

以下是Snowflake算法的主要框架Java源代码示例：

public class LeafIdGenerator {
    // 起始的时间戳
    private final long START_TIMESTAMP = 1614153600000L; // 2021-02-24 00:00:00
    // 每部分占用的位数
    private final long SEQUENCE_BITS = 12; // 序列号位数
    private final long MACHINE_ID_BITS = 5; // 机器id位数
    private final long DATACENTER_ID_BITS = 5; // 数据中心id位数
    // 每部分的最大值
    private final long MAX_MACHINE_ID = -1L ^ (-1L << MACHINE_ID_BITS);
    private final long MAX_DATACENTER_ID = -1L ^ (-1L << DATACENTER_ID_BITS);
    // 每部分向左的位移
    private final long MACHINE_ID_SHIFT = SEQUENCE_BITS; // 机器ID向左移动位数
    private final long DATACENTER_ID_SHIFT = SEQUENCE_BITS + MACHINE_ID_BITS; // 数据中心ID向左移动位数
    private final long TIMESTAMP_SHIFT = SEQUENCE_BITS + MACHINE_ID_BITS + DATACENTER_ID_BITS; // 时间戳向左移动位数
    // 数据中心ID和机器ID
    private long datacenterId;
    private long machineId;
    // 序列号
    private long sequence = 0L;
    private long lastTimestamp = -1L;

    public LeafIdGenerator(long datacenterId, long machineId) {
        if (datacenterId > MAX_DATACENTER_ID || datacenterId < 0) {
            throw new IllegalArgumentException("Datacenter ID can't be greater than " + MAX_DATACENTER_ID + " or less than 0");
        }
        if (machineId > MAX_MACHINE_ID || machineId < 0) {
            throw new IllegalArgumentException("Machine ID can't be greater than " + MAX_MACHINE_ID + " or less than 0");
        }
        this.datacenterId = datacenterId;
        this.machineId = machineId;
    }

    public synchronized long generateId() {
        long timestamp = System.currentTimeMillis();

        if (timestamp < lastTimestamp) {
            throw new RuntimeException("Clock moved backwards. Refusing to generate id");
        }

        if (timestamp == lastTimestamp) {
            sequence = (sequence + 1) & ((1 << SEQUENCE_BITS) - 1);
            if (sequence == 0) {
                timestamp = tilNextMillis(lastTimestamp);
            }
        } else {
            sequence = 0;
        }

        lastTimestamp = timestamp;

        return ((timestamp - START_TIMESTAMP) << TIMESTAMP_SHIFT)
                | (datacenterId << DATACENTER_ID_SHIFT)
                | (machineId << MACHINE_ID_SHIFT)
                | sequence;
    }

    private long tilNextMillis(long lastTimestamp) {
        long timestamp = System.currentTimeMillis();
        while (timestamp <= lastTimestamp) {
            timestamp = System.currentTimeMillis();
        }
        return timestamp;
    }

    public static void main(String[] args) {
        LeafIdGenerator idGenerator = new LeafIdGenerator(1, 1);

        for (int i = 0; i < 10; i++) {
            long id = idGenerator.generateId();
            System.out.println("Generated ID: " + id);
        }
    }
}