Project

torid

0.02
No release in over 3 years
Low commit activity in last 3 years
toridcopiousfreetime/toridHomepageDocumentationSource CodeBug TrackerWiki
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.
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
 Popularity
Downloads
333,615
Stars
27
Forks
1
Watchers
2
 Releases
Current version
1.3.0
Total releases
9
First release
2014-07-08
Latest release
2017-02-17
 Issues
Open Issues
1
Closed Issues
3
Total Issues
4
Issue Closure Rate
75%
 Pull Requests
Open Pull Requests
1
Closed Pull Requests
0
Merged Pull Requests
1
Pull Request Acceptance Rate
50%
 Development
Primary Language
Ruby
Licenses
ISC
Average date of last 50 commits
2017-08-21
Reverse Dependencies
0

 Dependencies

Development

minitest
~> 5.0
rake
~> 11.3
rdoc
~> 4.0
simplecov
~> 0.9

Runtime

fnv
~> 0.2
 Project Readme

Torid

Build Status

DESCRIPTION

Temporally Ordered IDs. Generate universally unique identifiers (UUID) that sort lexically in time order.

DETAILS

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.

EXAMPLES

Using the defaults

require 'torid'

uuid = Torid.uuid
uuid.to_s         # => "0004fda4-318e-f380-5a45-5321cd065b02"
uuid.bytes        # => "\x00\x04\xFD\xA41\x8E\xF3\x80ZES!\xCD\x06[\x02"

Using your own instance of a Generator

require 'torid'

generator = Torid::Generator.new
uuid      = generator.next

uuid.to_s        # => "0004fda4-3f42-3d01-4731-5a4aa8ddd6c3"
uuid.bytes       # => "\x00\x04\xFD\xA4?B=\x01G1ZJ\xA8\xDD\xD6\xC3"

CREDITS / RESOURCES

The vast majority of the credit and research stems from:

You could consider Torid to be a reimplementation of lexical_uuid. It definately steals some code from it and simple_uuid

Blog posts around ID generation:

Libraries implementing similar approaches:

ISC LICENSE

http://opensource.org/licenses/isc-license.txt

Copyright (c) 2014 Jeremy Hinegardner

Permission to use, copy, modify, and/or distribute this software for any purpose with or without fee is hereby granted, provided that the above copyright notice and this permission notice appear in all copies.

THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.