Skip to content

Commit

Permalink
version bump and history update
Browse files Browse the repository at this point in the history
  • Loading branch information
copiousfreetime committed Feb 17, 2017
1 parent 6a0d45b commit 39b44c0
Show file tree
Hide file tree
Showing 3 changed files with 10 additions and 5 deletions.
5 changes: 5 additions & 0 deletions HISTORY.md
Original file line number Diff line number Diff line change
@@ -1,4 +1,9 @@
# Torid Changelog
## Version 1.3.0 - 2017-02-17

* Add Torid::UUID#node_id_s to allow access to just the node portion
of the UUID as a string.

## Version 1.2.4 - 2015-02-18

* Fix a failing test case on jruby. Only affected running tests.
Expand Down
2 changes: 1 addition & 1 deletion lib/torid.rb
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@
# that sort lexically in time order.
module Torid
# Public: The Version of the Torid library as a String
VERSION = "1.2.5"
VERSION = "1.3.0"

# Public: return the next Torid::UUID from the default Generator
#
Expand Down
8 changes: 4 additions & 4 deletions torid.gemspec
Original file line number Diff line number Diff line change
@@ -1,16 +1,16 @@
# DO NOT EDIT - This file is automatically generated
# Make changes to Manifest.txt and/or Rakefile and regenerate
# -*- encoding: utf-8 -*-
# stub: torid 1.2.5 ruby lib
# stub: torid 1.3.0 ruby lib

Gem::Specification.new do |s|
s.name = "torid".freeze
s.version = "1.2.5"
s.version = "1.3.0"

s.required_rubygems_version = Gem::Requirement.new(">= 0".freeze) if s.respond_to? :required_rubygems_version=
s.require_paths = ["lib".freeze]
s.authors = ["Jeremy Hinegardner".freeze]
s.date = "2016-12-01"
s.date = "2017-02-17"
s.description = "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.".freeze
s.email = "[email protected]".freeze
s.extra_rdoc_files = ["CONTRIBUTING.md".freeze, "HISTORY.md".freeze, "Manifest.txt".freeze, "README.md".freeze]
Expand All @@ -19,7 +19,7 @@ Gem::Specification.new do |s|
s.licenses = ["ISC".freeze]
s.rdoc_options = ["--main".freeze, "README.md".freeze, "--markup".freeze, "tomdoc".freeze]
s.required_ruby_version = Gem::Requirement.new(">= 1.9.3".freeze)
s.rubygems_version = "2.6.4".freeze
s.rubygems_version = "2.6.10".freeze
s.summary = "Temporally Ordered IDs. Generate universally unique identifiers (UUID) that sort lexically in time order.".freeze

if s.respond_to? :specification_version then
Expand Down

0 comments on commit 39b44c0

Please sign in to comment.