RubyGems Navigation menu

torid 1.3.0

Temporally Ordered IDs. Generate universally unique identifiers (UUID) that sort lexically in time order. Torid exists to solve the problem of generating UUIDs that when ordered lexically, they are also ordered temporally. I needed a way to generate ids for events that are entering a system with the following criteria: 1. Fast ID generation 2. No central coordinating server/system 3. No local storage 4. Library code, that is multiple apps on the same machine can use the same code and they will not generate duplicate ids 5. Eventually stored in a UUID field in a database. So 128bit ids are totally fine. The IDs that Torid generates are 128bit IDs made up of 2, 64bit parts. * 64bit microsecond level UNIX timestamp * 64bit hash of the system hostname, process id and a random value.

Versions:

  1. 1.3.0 - February 17, 2017 (17 KB)
  2. 1.2.5 - December 01, 2016 (17 KB)
  3. 1.2.4 - February 18, 2015 (17 KB)
  4. 1.2.3 - September 21, 2014 (17.5 KB)
  5. 1.2.2 - September 15, 2014 (17.5 KB)
Show all versions (9 total)

Runtime Dependencies (1):

  • fnv ~> 0.2
  • Development Dependencies (4):

  • minitest ~> 5.0
  • rake ~> 11.3
  • rdoc ~> 4.0
  • simplecov ~> 0.9
  • Owners:

    Authors:

    • Jeremy Hinegardner

    SHA 256 checksum:

    f24b8a6a99833d6879d40d485ac099d96b9ef8d29a333504d1732ec1e5c50892

    Total downloads 229,045

    For this version 66,413

    Gemfile:
    = Copy to clipboard Copied!

    install:
    =

    License:

    ISC

    Required Ruby Version: >= 1.9.3

    Links: