java 编写序列_java如何编写类似oracle自增序列的算法?

如果你的这个值是用来做数据库的表数据唯一标识的话,建议可以用twitter idworker的算法,支持分布式部署生成,性能极高,也是支持排序的。package com.idworker;

public class IdWorker {

private final long workerId;

private final static long twepoch = 1288834974657L;

private long sequence = 0L;

private final static long workerIdBits = 4L;

public final static long maxWorkerId = -1L ^ -1L << workerIdBits;

private final static long sequenceBits = 10L;

private final static long workerIdShift = sequenceBits;

private final static long timestampLeftShift = sequenceBits + workerIdBits;

public final static long sequenceMask = -1L ^ -1L << sequenceBits;

private long lastTimestamp = -1L;

public IdWorker(final long workerId) {

super();

if (workerId > this.maxWorkerId || workerId < 0) {

throw new IllegalArgumentException(String.format(

"worker Id can't be greater than %d or less than 0",

this.maxWorkerId));

}

this.workerId = workerId;

}

public synchronized long nextId() {

long timestamp = this.timeGen();

if (this.lastTimestamp == timestamp) {

this.sequence = (this.sequence + 1) & this.sequenceMask;

if (this.sequence == 0) {

System.out.println("###########" + sequenceMask);

timestamp = this.tilNextMillis(this.lastTimestamp);

}

} else {

this.sequence = 0;

}

if (timestamp < this.lastTimestamp) {

try {

throw new Exception(

String.format(

"Clock moved backwards. Refusing to generate id for %d milliseconds",

this.lastTimestamp - timestamp));

} catch (Exception e) {

e.printStackTrace();

}

}

this.lastTimestamp = timestamp;

long nextId = ((timestamp - twepoch << timestampLeftShift))

| (this.workerId << this.workerIdShift) | (this.sequence);

System.out.println("timestamp:" + timestamp + ",timestampLeftShift:"

+ timestampLeftShift + ",nextId:" + nextId + ",workerId:"

+ workerId + ",sequence:" + sequence);

return nextId;

}

private long tilNextMillis(final long lastTimestamp) {

long timestamp = this.timeGen();

while (timestamp <= lastTimestamp) {

timestamp = this.timeGen();

}

return timestamp;

}

private long timeGen() {

return System.currentTimeMillis();

}

public static void main(String[] args){

IdWorker worker2 = new IdWorker(2);

System.out.println(worker2.nextId());

}

}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值