IdWorker

Skip to content
Personal Open source Business Explore
Sign upSign inPricingBlogSupport
This repository
Search
 Watch 1  Star 3  Fork 1 SimpleDays/IdWorker
 Code  Issues 0  Pull requests 0  Projects 0  Pulse  Graphs
Branch: master Find file Copy pathIdWorker/IdWorker.cs
705c743  on 15 Apr
@SimpleDays SimpleDays Update IdWorker.cs
1 contributor
RawBlameHistory     
95 lines (81 sloc)  3.73 KB
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace IdWorkerServer
{
    /**
    * tweeter的snowflake 移植到Java翻译成Net:
    *   (a) id构成: 42位的时间前缀 + 10位的节点标识 + 12位的sequence避免并发的数字(12位不够用时强制得到新的时间前缀)
    *       注意这里进行了小改动: snowkflake是5位的datacenter加5位的机器id; 这里变成使用10位的机器id
    *   (b) 对系统时间的依赖性非常强,需关闭ntp的时间同步功能。当检测到ntp时间调整后,将会拒绝分配id
    */

    public class IdWorker
    {
        private long workerId;
        private long epoch = 1403854494756L;   // 时间起始标记点,作为基准,一般取系统的最近时间()
        private static long workerIdBits = 10L;      // 机器标识位数
        private long maxWorkerId = -1L ^ -1L << (int)workerIdBits;// 机器ID最大值: 1023
        private long sequence = 0L;                   // 0,并发控制
        private static long sequenceBits = 12L;      //毫秒内自增位

        private long workerIdShift = sequenceBits;
        private long timestampLeftShift = sequenceBits + workerIdBits;
        private long sequenceMask = -1L ^ -1L << (int)sequenceBits;
        private long lastTimestamp = -1L;
        private static object syncRoot = new object();

        public IdWorker(long workerId)
        {
            if (workerId > maxWorkerId || workerId < 0)
            {
                throw new ArgumentOutOfRangeException(String.Format("worker Id can't be greater than {0} or less than 0", maxWorkerId));
            }

            this.workerId = workerId;
        }

        public long NextId()
        {
            lock (syncRoot)
            {
                long timestamp = this.TimeGen();

                if (this.lastTimestamp == timestamp)
                { 
                    // 如果上一个timestamp与新产生的相等,则sequence加一(0-4095循环); 对新的timestamp,sequence从0开始
                    this.sequence = this.sequence + 1 & this.sequenceMask;
                    if (this.sequence == 0)
                    {
                        timestamp = this.TilNextMillis(this.lastTimestamp);// 重新生成timestamp
                    }
                }
                else {
                    this.sequence = 0;
                }

                if (timestamp < this.lastTimestamp)
                {
                    //Log.E("IdWorker", "127.0.0.1", null,String.Format("clock moved backwards.Refusing to generate id for {0} milliseconds", (this.lastTimestamp - timestamp)));
                    throw new Exception(String.Format("clock moved backwards.Refusing to generate id for {0} milliseconds", (this.lastTimestamp - timestamp)));
                }

                this.lastTimestamp = timestamp;
                return timestamp - this.epoch << (int)this.timestampLeftShift | this.workerId << (int)this.workerIdShift | this.sequence;
            }
        }

        /**
         * 等待下一个毫秒的到来, 保证返回的毫秒数在参数lastTimestamp之后
         */
        private long TilNextMillis(long lastTimestamp)
        {
            long timestamp = this.TimeGen();

            while (timestamp <= lastTimestamp)
            {
                timestamp = this.TimeGen();
            }

            return timestamp;
        }

        /**
         * 获得系统当前毫秒数
         */
        private long TimeGen()
        {
            return (long)(DateTime.UtcNow - new DateTime(1970, 1, 1, 0, 0, 0, DateTimeKind.Utc)).TotalMilliseconds;
        }
    }
}
Contact GitHub API Training Shop Blog About
© 2016 GitHub, Inc. Terms Privacy Security Status Help

  IdWorker idWorker = new IdWorker(1);
  long id = idWorker.NextId();
  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
高并发分布式系统中生成全局唯一Id汇总 数据在分片时,典型的是分库分表,就有一个全局ID生成的问题。 单纯的生成全局ID并不是什么难题,但是生成的ID通常要满足分片的一些要求: 1 不能有单点故障。 2 以时间为序,或者ID里包含时间。这样一是可以少一个索引,二是冷热数据容易分离。 3 可以控制ShardingId。比如某一个用户的文章要放在同一个分片内,这样查询效率高,修改也容易。 4 不要太长,最好64bit。使用long比较好操作,如果是96bit,那就要各种移位相当的不方便,还有可能有些组件不能支持这么大的ID。 一 twitter twitter在把存储系统从MySQL迁移到Cassandra的过程中由于Cassandra没有顺序ID生成机制,于是自己开发了一套全局唯一ID生成服务:Snowflake。 1 41位的时间序列(精确到毫秒,41位的长度可以使用69年) 2 10位的机器标识(10位的长度最多支持部署1024个节点) 3 12位的计数顺序号(12位的计数顺序号支持每个节点每毫秒产生4096个ID序号) 最高位是符号位,始终为0。 优点:高性能,低延迟;独立的应用;按时间有序。 缺点:需要独立的开发和部署。 原理 java 实现代码 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 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 < 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()); } }

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值