snowflake
为什么用snowflake
数据库自增有自增ID,但是使用起来有以下几个问题:
会依赖于数据库的具体实现,比如,mysql有自增,oracle没有,得用序列,mongo似乎也没有。
自增ID是连续的,它就依赖于数据库自身的锁,所以数据库就有瓶颈。
雪花算法不依赖于数据库本身,是分布式id生成算法中比较经典的一种。整个ID的构成大概分为这么几个部分,时间戳差值,机器编码,进程编码,序列号。
java的long是64位的从左向右依次介绍是:时间戳差值,在我们这里占了42位;机器编码5位;进程编码5位;序列号12位。所有的拼接用位运算拼接起来,于是就基本做到了每个进程中不会重复了。
package exercise20220712;
import java.util.HashSet;
import java.util.Set;
public class SnowflakeUtils {
private static SnowflakeUtils snowflakeUtils = new SnowflakeUtils();
private final static long START_STMP = 1579305600000L;
private final static long SEQUENCE_BIT = 12;
private final static long MACHINE_BIT = 5;
private final static long DATACENTER_BIT = 5;
private final static long MAX_DATACENTER_NUM = -1L ^ (-1L << DATACENTER_BIT);
private final static long MAX_MACHINE_NUM = -1L ^ (-1L << MACHINE_BIT);
private final static long MAX_SEQUENCE = -1L ^ (-1L << SEQUENCE_BIT);
private final static long MACHINE_LEFT = SEQUENCE_BIT;
private final static long DATACENTER_LEFT = SEQUENCE_BIT + MACHINE_BIT;
private final static long TIMESTMP_LEFT = DATACENTER_LEFT + DATACENTER_BIT;
private long datacenterId = 0;
private long machineId = 0;
private long sequence = 0L;
private long lastStmp = -1L;
public SnowflakeUtils() {
}
public SnowflakeUtils(long datacenterId, long machineId) {
if (datacenterId > MAX_DATACENTER_NUM || datacenterId < 0) {
throw new IllegalArgumentException("datacenterId can't be greater than MAX_DATACENTER_NUM or less than 0");
}
if (machineId > MAX_MACHINE_NUM || machineId < 0) {
throw new IllegalArgumentException("machineId can't be greater than MAX_MACHINE_NUM or less than 0");
}
this.datacenterId = datacenterId;
this.machineId = machineId;
}
public String nextStrId() {
return String.valueOf(nextId());
}
public synchronized long nextId() {
long currStmp = getNewstmp();
if (currStmp < lastStmp) {
throw new RuntimeException("Clock moved backwards. Refusing to generate id");
}
if (currStmp == lastStmp) {
sequence = (sequence + 1) & MAX_SEQUENCE;
if (sequence == 0L) {
currStmp = getNextMill();
}
} else {
sequence = 0L;
}
lastStmp = currStmp;
return (currStmp - START_STMP) << TIMESTMP_LEFT
| datacenterId << DATACENTER_LEFT
| machineId << MACHINE_LEFT
| sequence;
}
private long getNextMill() {
long mill = getNewstmp();
while (mill <= lastStmp) {
mill = getNewstmp();
}
return mill;
}
private long getNewstmp() {
return System.currentTimeMillis();
}
public static void main(String[] args) {
Set<Long> set = new HashSet<>();
long st = System.currentTimeMillis();
for (int j = 0; j < 100000; j++) {
long id = snowflakeUtils.nextId();
System.out.println(id);
set.add(id);
}
long ed = System.currentTimeMillis();
System.out.println(set.size() + "time:" + (ed - st));
System.out.println("获取雪花算法:"+snowflakeUtils.nextId());
}
}