onliest 0.0.2

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 231435f376731f8c8e9ea57de9c5fa72c93584f6
+  data.tar.gz: fae174999ac03c89d9847efc9f26687cd1b9336a
+SHA512:
+  metadata.gz: 75b616b372f8431dbbebd7395fefb3c0ab8737672568f931585cb25e0d2ff7973d23ccd1cfb5d8610a9868bb80d107dc197d5a756d8a95189ab1784aee0c7b9d
+  data.tar.gz: 7a55e1ee34960ce44e98dc0ce63c00a9cfd03462dd8b96b9c68ad1de3dede8da9619c6392acd92fd2d88a5eeaa11e4251826d032bb7acf0f09a08ccc018e6ffa

data/bin/onliest

@@ -0,0 +1,5 @@
+#!/usr/bin/env ruby
+
+require 'onliest'
+
+puts Onliest.value

data/lib/onliest.rb

@@ -0,0 +1,46 @@
+require 'securerandom'
+
+# Onliest generates unique numbers for use as database keys in
+# distributed applications. The values are composed of the rightmost
+# 25 bits of a POSIX timestamp and 47 random bits.
+
+# It uses the method described by Zack Bloom
+# (https://eager.io/blog/how-long-does-an-id-need-to-be/).
+class Onliest
+  RANDOM_BITS = 47
+  TIME_BITS = 25
+  RANDOM_BITMASK = (2**RANDOM_BITS) - 1
+  TIME_BITMASK = (2**TIME_BITS) - 1
+
+  DEFAULT_RNG = SecureRandom
+
+  # Return a new unique value, using the default random number
+  # generator
+  def self.value
+    new.value
+  end
+
+  # Create a new unique value generator.  +rng+ defaults to
+  # +SecureRandom+. An object that implements +:random_number+
+  # returning a random integer >= 0 and less than value provided as
+  # the first argument.
+  def initialize(rng = DEFAULT_RNG)
+    @rng = rng
+  end
+
+  # Return the unique 72-bit value
+  def value
+    (some_time_bits << RANDOM_BITS) +
+      some_random_bits
+  end
+
+  private
+
+  def some_random_bits
+    @rng.random_number(RANDOM_BITMASK + 1)
+  end
+
+  def some_time_bits
+    Time.now.to_i & TIME_BITMASK
+  end
+end

data/test/test_onliest.rb

@@ -0,0 +1,46 @@
+require 'minitest/autorun'
+
+require 'onliest'
+
+class OnliestTest < Minitest::Unit::TestCase
+  def test_generates_a_number
+    assert_kind_of(Integer, Onliest.value)
+  end
+
+  def test_values_are_different
+    refute_equal(Onliest.value, Onliest.value)
+  end
+
+  def fake_prng(value = 1)
+    fake_prng = Minitest::Mock.new
+    fake_prng.expect(:random_number, value, [2**47])
+  end
+
+  def at(value)
+    Time.stub(:now, Time.at(value)) do
+      yield
+    end
+  end
+
+  def test_with_a_time_and_a_prng
+    at((2**25) + 1) do
+      random_value = 2
+      gen = Onliest.new(fake_prng(random_value))
+      assert_equal(gen.value, (1 << 47) + random_value)
+    end
+  end
+
+  def test_the_littlest_onliest
+    at(0) do
+      gen = Onliest.new(fake_prng(0))
+      assert_equal(gen.value, 0)
+    end
+  end
+
+  def test_the_largest_onliest
+    at(2**25 - 1) do
+      gen = Onliest.new(fake_prng(2**47 - 1))
+      assert_equal(gen.value, 2**72 - 1)
+    end
+  end
+end

data.tar.gz.sig

@@ -0,0 +1,4 @@
+����o�����0�%�.��I	���?�Ү}7��
+�<胧�H�8�;{�,p䰰N�s��k�?���L���A_6��>����6"���+]��۸����w�#���s$=��_ܪRNj8�M)���`O��
+
+���
���j�B�R\i$���vG�
Ŀ�1�hLP�Ys}�*��{�|���F�Rv`�h�U�11D��6e�s%�r��U�9η�o��.�0fm�J��P��/�0�oQ��$�

metadata

@@ -0,0 +1,71 @@
+--- !ruby/object:Gem::Specification
+name: onliest
+version: !ruby/object:Gem::Version
+  version: 0.0.2
+platform: ruby
+authors:
+- Robert Church
+autorequire: 
+bindir: bin
+cert_chain:
+- |
+  -----BEGIN CERTIFICATE-----
+  MIIDaDCCAlCgAwIBAgIBATANBgkqhkiG9w0BAQUFADA9MQ8wDQYDVQQDDAZjaHJj
+  aHIxFTATBgoJkiaJk/IsZAEZFgVnbWFpbDETMBEGCgmSJomT8ixkARkWA2NvbTAe
+  Fw0xNDExMTcwMzU0NDZaFw0xNTExMTcwMzU0NDZaMD0xDzANBgNVBAMMBmNocmNo
+  cjEVMBMGCgmSJomT8ixkARkWBWdtYWlsMRMwEQYKCZImiZPyLGQBGRYDY29tMIIB
+  IjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAxYcGTCEi6hbbKJf8NtH1UIGg
+  OFlMQjzp/QgN4IQV8wJbePzkm9Zfy0I19u/0Q+WmepkpwGLwEb84yiInpHpYKhVW
+  7MQOekiS+JxfGgXfAUtUZLLeeCe+R5IO9mZx+8PmA+S/WWaZngGuJE9vAi0Cobr7
+  dKpsSeavB/mkE0V0jGnaUc6rJeO8sB/nzOeJ9OqxgUUI4698POpGLknhq9of//Yx
+  51WwQul6sItx/AELZKEM/Zuu+nvMCYFU0oM0OHMYaN5EDERjLGVXAYBTyKuUq0js
+  kAydz6hfkrTBw8Aa/2s7w12EFq5jTBPS8fhvTFdGbveoF8HZuYV0PNEnSbhRpQID
+  AQABo3MwcTAJBgNVHRMEAjAAMAsGA1UdDwQEAwIEsDAdBgNVHQ4EFgQUQT0zqrtG
+  cFXJ2o4qWOe8Rq2FsEEwGwYDVR0RBBQwEoEQY2hyY2hyQGdtYWlsLmNvbTAbBgNV
+  HRIEFDASgRBjaHJjaHJAZ21haWwuY29tMA0GCSqGSIb3DQEBBQUAA4IBAQBRdlDl
+  dXzKVcuK/w1EwgfPlI3BVMbSBGx9evofmH8pSWOV7Pqu3ZU9u91SGzMtMULVj+03
+  SJRx2pS3sVfzTt+jPfIqQk37rfc9iYLPCwM5G5RypT3iAIM/V/rJv5+z9lYwE/76
+  8ZrYVUK9zx91u/xkFseEig5ZqCCZIiBGKleos2uruy+eG5On1w5ShGqIaoxQvCa0
+  W6y4KVKgJJKunt/R+DNGrFnPFkd+gzWOyinOhQoVeHvyhslkA+ptgJSk2Q/KwTXO
+  3TLzfUddZ0/HMBNYO9OALcF70YnWb/usnr4lwVfhbJ+fcejAsp5Seurmhw7FeMoZ
+  f4Rtc1iUIHYWfDpz
+  -----END CERTIFICATE-----
+date: 2014-11-15 00:00:00.000000000 Z
+dependencies: []
+description: Generate unique values with numeric locality.
+email: chrchr@gmail.com
+executables:
+- onliest
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/onliest.rb
+- bin/onliest
+- test/test_onliest.rb
+homepage: https://github.com/chrchr/onliest
+licenses:
+- MIT
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.0.14
+signing_key: 
+specification_version: 4
+summary: 'Onliest: generate unique values with numeric locality'
+test_files:
+- test/test_onliest.rb
+has_rdoc: 

metadata.gz.sig

@@ -0,0 +1,2 @@
+U�`@
+hг*��Fs>��