创建有序的guid

    public static class API
    {
        /// <summary>
        /// 创建有序的 guid。
        /// </summary>
        /// <returns></returns>
        public static Guid NewSequentialGuid()
        {
            Guid result;
            UuidCreateSequential(out result);
            return result;
        }

        /// <summary>
        /// http://stackoverflow.com/questions/211498/is-there-a-net-equalent-to-sql-servers-newsequentialid
        /// </summary>
        /// <param name="guid"></param>
        /// <returns></returns>
        [DllImport("rpcrt4.dll", SetLastError = true)]
        private static extern int UuidCreateSequential(out Guid guid);


        [Obsolete("这个不是有序的,测试未通过。")]
        /// <summary>
        /// http://snipplr.com/view.php?codeview&id=29304
        /// </summary>
        /// <returns></returns>
        public static Guid NewComb()
        {
            byte[] dateBytes = BitConverter.GetBytes(DateTime.Now.Ticks);
            byte[] guidBytes = Guid.NewGuid().ToByteArray();
            // copy the last six bytes from the date to the last six bytes of the GUID
            Array.Copy(dateBytes, dateBytes.Length - 7, guidBytes, guidBytes.Length - 7, 6);
            return new Guid(guidBytes);
        }
    }

  测试

    [TestFixture]
    public class APITest
    {
        [Test]
        public void testUuidCreateSequential()
        {
            List<Guid> list = new List<Guid>();
            for (int i = 0; i < 100; i++)
            {
                Guid id = API.NewSequentialGuid();
                list.Add(id);
                Console.WriteLine(id);
            }
            for (int i = 0; i < list.Count - 1; i++)
            {
                Assert.Less(list[i], list[i + 1]);
            }
        }

        [Test]
        public void testNewComb()
        {
            List<Guid> list = new List<Guid>();
            for (int i = 0; i < 100; i++)
            {
                Guid id = API.NewComb();
                list.Add(id);
                Console.WriteLine(id);
            }
            for (int i = 0; i < list.Count - 1; i++)
            {
                Assert.Less(list[i], list[i + 1]);
            }

        }
    }

  

转载于:https://www.cnblogs.com/illusion/archive/2012/05/26/2519243.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值