ulid-ruby 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: f27c1f9f3fee9102f8c53b8ba84a345ddc549c09
+  data.tar.gz: 53310f5d7c8704de8655f05adb40b42ca59e3215
+SHA512:
+  metadata.gz: 6ea6845c4f1acd02f8252dd3e1918bc5d08039a0c44a923a6675ab096c5d800cda8e295383d81dc777d51645897754fb40e42d6be9a9744a9fe993ac555cf273
+  data.tar.gz: 8789d36731cddf75cdeb30c5c6176ef6f2b1c770c026c2019b2fcc747529c0cc38be89ca54ba3d7e1c7db1ed5bbe847004fd3db963737668618ab06090183f37

data/.gitignore

@@ -0,0 +1,12 @@
+/.bundle/
+/.yardoc
+/Gemfile.lock
+/_yardoc/
+/coverage/
+/doc/
+/pkg/
+/spec/reports/
+/tmp/
+
+# rspec failure tracking
+.rspec_status

data/.rspec

@@ -0,0 +1,2 @@
+--format documentation
+--color

data/.ruby-version

@@ -0,0 +1 @@
+2.4.0

data/.travis.yml

@@ -0,0 +1,5 @@
+sudo: false
+language: ruby
+rvm:
+  - 2.4.0
+before_install: gem install bundler -v 1.14.6

data/CODE_OF_CONDUCT.md

@@ -0,0 +1,74 @@
+# Contributor Covenant Code of Conduct
+
+## Our Pledge
+
+In the interest of fostering an open and welcoming environment, we as
+contributors and maintainers pledge to making participation in our project and
+our community a harassment-free experience for everyone, regardless of age, body
+size, disability, ethnicity, gender identity and expression, level of experience,
+nationality, personal appearance, race, religion, or sexual identity and
+orientation.
+
+## Our Standards
+
+Examples of behavior that contributes to creating a positive environment
+include:
+
+* Using welcoming and inclusive language
+* Being respectful of differing viewpoints and experiences
+* Gracefully accepting constructive criticism
+* Focusing on what is best for the community
+* Showing empathy towards other community members
+
+Examples of unacceptable behavior by participants include:
+
+* The use of sexualized language or imagery and unwelcome sexual attention or
+advances
+* Trolling, insulting/derogatory comments, and personal or political attacks
+* Public or private harassment
+* Publishing others' private information, such as a physical or electronic
+  address, without explicit permission
+* Other conduct which could reasonably be considered inappropriate in a
+  professional setting
+
+## Our Responsibilities
+
+Project maintainers are responsible for clarifying the standards of acceptable
+behavior and are expected to take appropriate and fair corrective action in
+response to any instances of unacceptable behavior.
+
+Project maintainers have the right and responsibility to remove, edit, or
+reject comments, commits, code, wiki edits, issues, and other contributions
+that are not aligned to this Code of Conduct, or to ban temporarily or
+permanently any contributor for other behaviors that they deem inappropriate,
+threatening, offensive, or harmful.
+
+## Scope
+
+This Code of Conduct applies both within project spaces and in public spaces
+when an individual is representing the project or its community. Examples of
+representing a project or community include using an official project e-mail
+address, posting via an official social media account, or acting as an appointed
+representative at an online or offline event. Representation of a project may be
+further defined and clarified by project maintainers.
+
+## Enforcement
+
+Instances of abusive, harassing, or otherwise unacceptable behavior may be
+reported by contacting the project team at adam.bachman@gmail.com. All
+complaints will be reviewed and investigated and will result in a response that
+is deemed necessary and appropriate to the circumstances. The project team is
+obligated to maintain confidentiality with regard to the reporter of an incident.
+Further details of specific enforcement policies may be posted separately.
+
+Project maintainers who do not follow or enforce the Code of Conduct in good
+faith may face temporary or permanent repercussions as determined by other
+members of the project's leadership.
+
+## Attribution
+
+This Code of Conduct is adapted from the [Contributor Covenant][homepage], version 1.4,
+available at [http://contributor-covenant.org/version/1/4][version]
+
+[homepage]: http://contributor-covenant.org
+[version]: http://contributor-covenant.org/version/1/4/

data/Gemfile

@@ -0,0 +1,4 @@
+source 'https://rubygems.org'
+
+# Specify your gem's dependencies in ulid-ruby.gemspec
+gemspec

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2017 Adam Bachman
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.

data/README.md

@@ -0,0 +1,89 @@
+<h1 align="center">
+    <br>
+    <br>
+    <img width="360" src="logo.png" alt="ulid">
+    <br>
+    <br>
+    <br>
+</h1>
+
+## -- unofficial --
+
+# ULID
+
+A ULID is a "Universally Unique Lexicographically-sortable Identifier." This is a thin Ruby library for generating and parsing ULID values. This code is based on the original concept presented at https://github.com/alizain/ulid and in part based on code from the C# and Go projects at https://github.com/RobThree/NUlid and https://github.com/oklog/ulid  respectively.
+
+**NOTE:** while the ULID values generated are compatible with the existing Ruby ULID library located at https://github.com/rafaelsales/ulid, this library is not code-compatible. I needed some additional features for a project and it was easier to just rebuild the functionality. May not be useful for anyone else but it's working for us in production at https://io.adafruit.com.
+
+In its string representation, it's a compact, URL-friendly, Base32, unique ID string that encodes its time of creation and sorts according the time value it encodes.
+
+A ULID string looks like this:
+
+```ruby
+require 'ulid'
+ULID.generate #=> "0DHWZV7PGEAFYDYH04X7Y468GQ"
+```
+
+## Short Explanation
+
+The two parts of a ULID are **Timestamp** and **Entropy**.
+
+     0DHWZV7PGE      AFYDYH04X7Y468GQ
+    |----------|    |----------------|
+     Timestamp            Entropy
+       48bits             80bits
+
+### Timestamp
+
+- Encoded in first 48 bits of ULID. In Base32 it's the first 10 ASCII characters.
+- UNIX-time with a precision of milliseconds.
+- Won't run out of space till the year 10895 AD.
+
+### Entropy
+
+- Encoded in last 80 bits of ULID. In Base32 it's the last 16 ASCII characters.
+- Should use cryptographically secure source of randomness (this library uses the Ruby Standard Library's `SecureRandom` class)
+- Unlikely to duplicate even with millions of IDs at the same millisecond
+
+### Sorting
+
+The left-most character must be sorted first, and the right-most character sorted last (lexical order). The default ASCII character set must be used. Within the same millisecond, sort order is not guaranteed.
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'ulid-ruby', require: 'ulid'
+```
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install ulid-ruby
+
+And require from your project with:
+
+```ruby
+require 'rubygems'
+require 'ulid'
+```
+
+## Development
+
+After checking out the repo, run `bin/setup` to install dependencies. Then, run `rake spec` to run the tests. You can also run `bin/console` for an interactive prompt that will allow you to experiment.
+
+To install this gem onto your local machine, run `bundle exec rake install`. To release a new version, update the version number in `version.rb`, and then run `bundle exec rake release`, which will create a git tag for the version, push git commits and tags, and push the `.gem` file to [rubygems.org](https://rubygems.org).
+
+## Contributing
+
+Bug reports and pull requests are welcome on GitHub at https://github.com/abachman/ulid-ruby. This project is intended to be a safe, welcoming space for collaboration, and contributors are expected to adhere to the [Contributor Covenant](http://contributor-covenant.org) code of conduct.
+
+
+## License
+
+The gem is available as open source under the terms of the [MIT License](http://opensource.org/licenses/MIT).
+

data/Rakefile

@@ -0,0 +1,13 @@
+require "bundler/gem_tasks"
+require "rspec/core/rake_task"
+require 'yard'
+
+YARD::Rake::YardocTask.new do |t|
+ t.files   = ['lib/**/*.rb']   # optional
+ t.options = ['--any', '--extra', '--opts'] # optional
+ t.stats_options = ['--list-undoc']         # optional
+end
+
+RSpec::Core::RakeTask.new(:spec)
+
+task :default => :spec

data/bin/console

@@ -0,0 +1,14 @@
+#!/usr/bin/env ruby
+
+require "bundler/setup"
+require "ulid"
+
+# You can add fixtures and/or initialization code here to make experimenting
+# with your gem easier. You can also use a different console, if you like.
+
+# (If you use this, don't forget to add pry to your Gemfile!)
+# require "pry"
+# Pry.start
+
+require "irb"
+IRB.start(__FILE__)

data/bin/setup

@@ -0,0 +1,8 @@
+#!/usr/bin/env bash
+set -euo pipefail
+IFS=$'\n\t'
+set -vx
+
+bundle install
+
+# Do any other automated setup that you need to do here

data/lib/ulid.rb

@@ -0,0 +1,86 @@
+
+require 'time'
+require 'securerandom'
+
+require 'ulid/version'
+require 'ulid/constants'
+require 'ulid/identifier'
+require 'ulid/generate'
+require 'ulid/parse'
+require 'ulid/compare'
+
+module ULID
+  include Constants
+
+  # Get a new, randomized ULID::Identifier instance at the current time.
+  #
+  # @return [ULID::Identifier] new ULID::Identifier instance for the current system time
+  #
+  # @example Generate a ULID
+  #   ULID.new #=> #<ULID::Identifier:0x007f83f90aecc0 ....>
+  #
+  def self.new
+    Identifier.new
+  end
+
+  # Get a new, randomized ULID string at the current time.
+  #
+  # @return [String] 26 character ULID value for the current system time
+  #
+  # @example Generate a ULID string
+  #   ULID.generate #=> 0DHWZV7PGEAFYDYH04X7Y468GQ
+  #
+  def self.generate
+    Identifier.new.ulid
+  end
+
+  # Get a string ULID encoding the given time.
+  #
+  # @param at_time [Time] the time to encode
+  # @return [String] new ULID string encoding the given time
+  #
+  # @example Generate a ULID string for a given time
+  #   ULID.at(Time.at(1_000_000)) #=> 0009A0QS00SGEFTGMFFEAS6B9A
+  #
+  def self.at(at_time)
+    Identifier.new(at_time).ulid
+  end
+
+  # Get the Time value encoded by the given ULID string.
+  #
+  # @param ulid [String or ULID::Identifier]
+  # @return [Time] UTC time value encoded by the ULID
+  #
+  # @example Parse a ULID string and get a time value
+  #   ULID.time '0009A0QS00SGEFTGMFFEAS6B9A' #=> 1970-01-12 13:46:40 UTC
+  #
+  def self.time(ulid)
+    Identifier.new(ulid).time.utc
+  end
+
+  # Get the first possible ULID string for the given time in sort order ascending.
+  #
+  # @param at_time [Time] a Time value to encode in the ULID
+  # @return [String] the lexicographically minimum ULID value for the given time
+  #
+  # @example Get minimal ULID at time
+  #   ULID.min_ulid_at Time.at(1_000_000) #=> "0009A0QS000000000000000000"
+  #
+  def self.min_ulid_at(at_time)
+    Identifier.new(at_time, MIN_ENTROPY).ulid
+  end
+
+  # Get the first possible ULID string for the given time in sort order descending.
+  #
+  # @param at_time [Time] a Time value to encode in the ULID
+  # @return [String] the lexicographically maximum ULID value for the given time
+  #
+  # @example Get minimal ULID at time
+  #   ULID.max_ulid_at Time.at(1_000_000) #=> "0009A0QS00ZZZZZZZZZZZZZZZZ"
+  #
+  def self.max_ulid_at(at_time)
+    Identifier.new(at_time, MAX_ENTROPY).ulid
+  end
+
+end
+

data/lib/ulid/compare.rb

@@ -0,0 +1,36 @@
+module ULID
+  module Compare
+    def >(other)
+      case other
+      when self.class
+        self.ulid > other.ulid
+      when Time
+        self.time > other
+      when String
+        self.ulid > other
+      end
+    end
+
+    def <(other)
+      case other
+      when self.class
+        self.ulid < other.ulid
+      when Time
+        self.time < other
+      when String
+        self.ulid < other
+      end
+    end
+
+    def <=>(other)
+      case other
+      when self.class
+        self.ulid <=> other.ulid
+      when Time
+        self.time <=> other
+      when String
+        self.ulid <=> other
+      end
+    end
+  end
+end

data/lib/ulid/constants.rb

@@ -0,0 +1,21 @@
+module ULID
+  module Constants
+    # smallest representable time
+    MIN_TIME = ([0] * 6).pack('C' * 6)
+    # largest representable time
+    MAX_TIME = ([255] * 6).pack('C' * 6)
+
+    # smallest possible seed value
+    MIN_ENTROPY = ([0] * 10).pack('C' * 10)
+    # largest possible seed value
+    MAX_ENTROPY = ([255] * 10).pack('C' * 10)
+
+    # Crockford's Base32. Alphabet portion is missing I, L, O, and U.
+    ENCODING = "0123456789ABCDEFGHJKMNPQRSTVWXYZ"
+
+    # Byte to index table for O(1) lookups when unmarshaling.
+    # We rely on nil as sentinel value for invalid indexes.
+    B32REF = Hash[ ENCODING.split('').each_with_index.to_a ]
+  end
+end
+

data/lib/ulid/generate.rb

@@ -0,0 +1,71 @@
+require 'securerandom'
+require 'ulid/constants'
+
+module ULID
+
+  module Generate
+    include Constants
+
+    # returns the binary ULID as Base32 encoded string.
+    def encode32
+      # Optimized unrolled loop ahead.
+      # From https://github.com/RobThree/NUlid
+      # via https://github.com/oklog/ulid/blob/c3c01856f7e43fa64133819126887124d5f05e39/ulid.go#L154
+
+      id = @bytes.bytes
+
+      output = ''
+
+      # Base32 encodes 5 bits of each byte of the input in each byte of the
+      # output. That means each input byte produces >1 output byte and some
+      # output bytes encode parts of multiple input bytes.
+      #
+      # The end result is a human / URL friendly output string that can be
+      # decoded into the original bytes.
+
+      # 10 byte timestamp
+      output << ENCODING[(id[0]&224)>>5]
+      output << ENCODING[id[0]&31]
+      output << ENCODING[(id[1]&248)>>3]
+      output << ENCODING[((id[1]&7)<<2)|((id[2]&192)>>6)]
+      output << ENCODING[(id[2]&62)>>1]
+      output << ENCODING[((id[2]&1)<<4)|((id[3]&240)>>4)]
+      output << ENCODING[((id[3]&15)<<1)|((id[4]&128)>>7)]
+      output << ENCODING[(id[4]&124)>>2]
+      output << ENCODING[((id[4]&3)<<3)|((id[5]&224)>>5)]
+      output << ENCODING[id[5]&31]
+
+      # 16 bytes of entropy
+      output << ENCODING[(id[6]&248)>>3]
+      output << ENCODING[((id[6]&7)<<2)|((id[7]&192)>>6)]
+      output << ENCODING[(id[7]&62)>>1]
+      output << ENCODING[((id[7]&1)<<4)|((id[8]&240)>>4)]
+      output << ENCODING[((id[8]&15)<<1)|((id[9]&128)>>7)]
+      output << ENCODING[(id[9]&124)>>2]
+      output << ENCODING[((id[9]&3)<<3)|((id[10]&224)>>5)]
+      output << ENCODING[id[10]&31]
+      output << ENCODING[(id[11]&248)>>3]
+      output << ENCODING[((id[11]&7)<<2)|((id[12]&192)>>6)]
+      output << ENCODING[(id[12]&62)>>1]
+      output << ENCODING[((id[12]&1)<<4)|((id[13]&240)>>4)]
+      output << ENCODING[((id[13]&15)<<1)|((id[14]&128)>>7)]
+      output << ENCODING[(id[14]&124)>>2]
+      output << ENCODING[((id[14]&3)<<3)|((id[15]&224)>>5)]
+      output << ENCODING[id[15]&31]
+
+      output
+    end
+
+    def random_bytes
+      SecureRandom.random_bytes(10)
+    end
+
+    def hundred_micro_time
+      (@time.to_f * 10_000).to_i
+    end
+
+    def time_48bit
+      [hundred_micro_time].pack("Q>")[2..-1]
+    end
+  end
+end

data/lib/ulid/identifier.rb

@@ -0,0 +1,64 @@
+require 'ulid/parse'
+require 'ulid/generate'
+require 'ulid/compare'
+
+module ULID
+  class Identifier
+    include Parse
+    include Generate
+    include Compare
+
+    attr_reader :seed, :bytes, :time, :ulid
+
+    # Create a new instance of a ULID::Identifier.
+    #
+    # @param start [ULID::Instance, String, Time, or nil] if ULID instance or
+    #   string is given, initialize to the exact same value. If Time is given,
+    #   generate a new ULID for that time, if no argument is given, generate a
+    #   new ULID at the current system time.
+    # @param seed [String or nil] a 10-byte, Encoding::ASCII_8BIT encoded string.
+    #   The easiest way to generate a seed is to call SecureRandom.random_bytes(10)
+    # @return [ULID::Identifier]
+    def initialize(start = nil, seed = nil)
+      case start
+      when self.class
+        @time = start.time
+        @seed = start.seed
+      when NilClass, Time
+        @time = (start || Time.now).utc
+        if seed == nil
+          @seed = random_bytes
+        else
+          if seed.size != 10 || seed.encoding != Encoding::ASCII_8BIT
+            raise ArgumentError.new("seed error, seed value must be 10 bytes encoded as Encoding::ASCII_8BIT")
+          end
+          @seed = seed
+        end
+      when String
+        if start.size != 26
+          raise ArgumentError.new("invalid ULID string, must be 26 characters")
+        end
+
+        # parse string into bytes
+        @ulid = start.upcase
+        @bytes = decode(@ulid)
+
+        @time, @seed = unpack_decoded_bytes(@bytes)
+      else
+        # unrecognized initial values type given, just generate fresh ULID
+        @time = Time.now.utc
+        @seed = random_bytes
+      end
+
+      if @bytes.nil?
+        # an ASCII_8BIT encoded string, should be 16 bytes
+        @bytes = time_48bit + @seed
+      end
+
+      if @ulid.nil?
+        # the lexically sortable Base32 string we actually care about
+        @ulid = encode32
+      end
+    end
+  end
+end

data/lib/ulid/parse.rb

@@ -0,0 +1,52 @@
+require 'ulid/constants'
+
+module ULID
+  module Parse
+    include Constants
+
+    # v should be a Base32 encoded ULID string. This method decodes it into a
+    # 16 byte raw ULID with 48 bit time and 64 bit random parts.
+    def decode(v)
+      out = []
+
+      # hand optimized, unrolled ULID-Base32 format decoder based on
+      # https://github.com/oklog/ulid/blob/c3c01856f7e43fa64133819126887124d5f05e39/ulid.go#L234
+
+      # 6 bytes timestamp (48 bits)
+      out << ((B32REF[v[0]] << 5) |  B32REF[v[1]])
+      out << ((B32REF[v[2]] << 3) | (B32REF[v[3]] >> 2))
+      out << ((B32REF[v[3]] << 6) | (B32REF[v[4]] << 1) | (B32REF[v[5]] >> 4))
+      out << ((B32REF[v[5]] << 4) | (B32REF[v[6]] >> 1))
+      out << ((B32REF[v[6]] << 7) | (B32REF[v[7]] << 2) | (B32REF[v[8]] >> 3))
+      out << ((B32REF[v[8]] << 5) |  B32REF[v[9]])
+
+      # 10 bytes of entropy (80 bits)
+      out << ((B32REF[v[10]] << 3) | (B32REF[v[11]] >> 2))
+      out << ((B32REF[v[11]] << 6) | (B32REF[v[12]] << 1) | (B32REF[v[13]] >> 4))
+      out << ((B32REF[v[13]] << 4) | (B32REF[v[14]] >> 1))
+      out << ((B32REF[v[14]] << 7) | (B32REF[v[15]] << 2) | (B32REF[v[16]] >> 3))
+      out << ((B32REF[v[16]] << 5) | B32REF[v[17]])
+      out << ((B32REF[v[18]] << 3) | B32REF[v[19]]>>2)
+      out << ((B32REF[v[19]] << 6) | (B32REF[v[20]] << 1) | (B32REF[v[21]] >> 4))
+      out << ((B32REF[v[21]] << 4) | (B32REF[v[22]] >> 1))
+      out << ((B32REF[v[22]] << 7) | (B32REF[v[23]] << 2) | (B32REF[v[24]] >> 3))
+      out << ((B32REF[v[24]] << 5) | B32REF[v[25]])
+
+      # get the array as a string, coercing each value to a single byte
+      out = out.pack('C' * 16)
+
+      out
+    end
+
+    def unpack_decoded_bytes(packed_bytes)
+      time_bytes = packed_bytes[0..5]
+      seed = packed_bytes[6..-1]
+
+      # and unpack it immedieately into the original milliseconds timestamp
+      time_int = ("\x00\x00" + time_bytes).unpack('Q>')[0]
+
+      [ Time.at( time_int / 10_000.0 ).utc, seed ]
+    end
+
+  end
+end

data/lib/ulid/version.rb

@@ -0,0 +1,4 @@
+module ULID
+  VERSION = "0.1.0"
+end
+

data/ulid-ruby.gemspec

@@ -0,0 +1,28 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'ulid/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "ulid-ruby"
+  spec.version       = ULID::VERSION
+  spec.authors       = ["adam bachman"]
+  spec.email         = ["adam.bachman@gmail.com"]
+
+  spec.summary       = %q{ruby library providing support for universally unique lexicographically sortable identifiers}
+  spec.description   = %q{todo: write a longer description or delete this line.}
+  spec.homepage      = "https://github.com/abachman/ulid-ruby"
+  spec.license       = "mit"
+
+  spec.files         = `git ls-files -z`.split("\x0").reject do |f|
+    f.match(%r{^(test|spec|features)/})
+  end
+  spec.bindir        = "exe"
+  spec.executables   = spec.files.grep(%r{^exe/}) { |f| file.basename(f) }
+  spec.require_paths = ["lib"]
+
+  spec.add_development_dependency "bundler", "~> 1.14"
+  spec.add_development_dependency "rake", "~> 10.0"
+  spec.add_development_dependency "rspec", "~> 3.0"
+  spec.add_development_dependency "yard", "~> 0.9"
+end

metadata

@@ -0,0 +1,121 @@
+--- !ruby/object:Gem::Specification
+name: ulid-ruby
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- adam bachman
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2017-05-05 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.14'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.14'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.0'
+- !ruby/object:Gem::Dependency
+  name: yard
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.9'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.9'
+description: 'todo: write a longer description or delete this line.'
+email:
+- adam.bachman@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- ".rspec"
+- ".ruby-version"
+- ".travis.yml"
+- CODE_OF_CONDUCT.md
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- bin/console
+- bin/setup
+- lib/ulid.rb
+- lib/ulid/compare.rb
+- lib/ulid/constants.rb
+- lib/ulid/generate.rb
+- lib/ulid/identifier.rb
+- lib/ulid/parse.rb
+- lib/ulid/version.rb
+- logo.png
+- ulid-ruby.gemspec
+homepage: https://github.com/abachman/ulid-ruby
+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.6.8
+signing_key: 
+specification_version: 4
+summary: ruby library providing support for universally unique lexicographically sortable
+  identifiers
+test_files: []