enum_utils 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: 5fa25b37c2507249c0fdc58bc3217845ef9e48540870a0bdcc8039b841197e24
+  data.tar.gz: 2feb7bf6b2885e4de8d7c9d3581e16bb0371db974da4862059a218fd994d4f91
+SHA512:
+  metadata.gz: 5892a6f88b623cdd2fc9d09806a54eedddda69522853849c87e58b57ede91babc71962d2341febb47fda25421c957e367658de4ccce61d7cabdc99a9c9b9b81e
+  data.tar.gz: 78ce23e6434dba7082f131d7a45f616327fd865eb16f5c0893fe4a673af02d8679b99feaa207be0e03047e750fdf5f8ba38e89c0a196114e0736acd38ca9b628

data/.github/workflows/main.yml

@@ -0,0 +1,30 @@
+name: Ruby
+
+on:
+  push:
+    branches:
+      - main
+
+  pull_request:
+
+jobs:
+  build:
+    runs-on: ubuntu-latest
+    name: Ruby ${{ matrix.ruby }}
+    strategy:
+      matrix:
+        ruby:
+          - '2.6.9'
+          - '2.7.5'
+          - '3.0.3'
+          - '3.1.1'
+
+    steps:
+    - uses: actions/checkout@v2
+    - name: Set up Ruby
+      uses: ruby/setup-ruby@v1
+      with:
+        ruby-version: ${{ matrix.ruby }}
+        bundler-cache: true
+    - name: Run the default task
+      run: bundle exec rake

data/.gitignore

@@ -0,0 +1,8 @@
+/.bundle/
+/.yardoc
+/_yardoc/
+/coverage/
+/doc/
+/pkg/
+/spec/reports/
+/tmp/

data/CHANGELOG.md

@@ -0,0 +1,5 @@
+## [Unreleased]
+
+## [0.1.0] - 2022-03-04
+
+- Initial release

data/CODE_OF_CONDUCT.md

@@ -0,0 +1,84 @@
+# Contributor Covenant Code of Conduct
+
+## Our Pledge
+
+We as members, contributors, and leaders pledge to make participation in our community a harassment-free experience for everyone, regardless of age, body size, visible or invisible disability, ethnicity, sex characteristics, gender identity and expression, level of experience, education, socio-economic status, nationality, personal appearance, race, religion, or sexual identity and orientation.
+
+We pledge to act and interact in ways that contribute to an open, welcoming, diverse, inclusive, and healthy community.
+
+## Our Standards
+
+Examples of behavior that contributes to a positive environment for our community include:
+
+* Demonstrating empathy and kindness toward other people
+* Being respectful of differing opinions, viewpoints, and experiences
+* Giving and gracefully accepting constructive feedback
+* Accepting responsibility and apologizing to those affected by our mistakes, and learning from the experience
+* Focusing on what is best not just for us as individuals, but for the overall community
+
+Examples of unacceptable behavior include:
+
+* The use of sexualized language or imagery, and sexual attention or
+  advances of any kind
+* Trolling, insulting or derogatory comments, and personal or political attacks
+* Public or private harassment
+* Publishing others' private information, such as a physical or email
+  address, without their explicit permission
+* Other conduct which could reasonably be considered inappropriate in a
+  professional setting
+
+## Enforcement Responsibilities
+
+Community leaders are responsible for clarifying and enforcing our standards of acceptable behavior and will take appropriate and fair corrective action in response to any behavior that they deem inappropriate, threatening, offensive, or harmful.
+
+Community leaders 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, and will communicate reasons for moderation decisions when appropriate.
+
+## Scope
+
+This Code of Conduct applies within all community spaces, and also applies when an individual is officially representing the community in public spaces. Examples of representing our community include using an official e-mail address, posting via an official social media account, or acting as an appointed representative at an online or offline event.
+
+## Enforcement
+
+Instances of abusive, harassing, or otherwise unacceptable behavior may be reported to the community leaders responsible for enforcement at max@bitsonnet.com. All complaints will be reviewed and investigated promptly and fairly.
+
+All community leaders are obligated to respect the privacy and security of the reporter of any incident.
+
+## Enforcement Guidelines
+
+Community leaders will follow these Community Impact Guidelines in determining the consequences for any action they deem in violation of this Code of Conduct:
+
+### 1. Correction
+
+**Community Impact**: Use of inappropriate language or other behavior deemed unprofessional or unwelcome in the community.
+
+**Consequence**: A private, written warning from community leaders, providing clarity around the nature of the violation and an explanation of why the behavior was inappropriate. A public apology may be requested.
+
+### 2. Warning
+
+**Community Impact**: A violation through a single incident or series of actions.
+
+**Consequence**: A warning with consequences for continued behavior. No interaction with the people involved, including unsolicited interaction with those enforcing the Code of Conduct, for a specified period of time. This includes avoiding interactions in community spaces as well as external channels like social media. Violating these terms may lead to a temporary or permanent ban.
+
+### 3. Temporary Ban
+
+**Community Impact**: A serious violation of community standards, including sustained inappropriate behavior.
+
+**Consequence**: A temporary ban from any sort of interaction or public communication with the community for a specified period of time. No public or private interaction with the people involved, including unsolicited interaction with those enforcing the Code of Conduct, is allowed during this period. Violating these terms may lead to a permanent ban.
+
+### 4. Permanent Ban
+
+**Community Impact**: Demonstrating a pattern of violation of community standards, including sustained inappropriate behavior,  harassment of an individual, or aggression toward or disparagement of classes of individuals.
+
+**Consequence**: A permanent ban from any sort of public interaction within the community.
+
+## Attribution
+
+This Code of Conduct is adapted from the [Contributor Covenant][homepage], version 2.0,
+available at https://www.contributor-covenant.org/version/2/0/code_of_conduct.html.
+
+Community Impact Guidelines were inspired by [Mozilla's code of conduct enforcement ladder](https://github.com/mozilla/diversity).
+
+[homepage]: https://www.contributor-covenant.org
+
+For answers to common questions about this code of conduct, see the FAQ at
+https://www.contributor-covenant.org/faq. Translations are available at https://www.contributor-covenant.org/translations.

data/Gemfile

@@ -0,0 +1,9 @@
+# frozen_string_literal: true
+
+source 'https://rubygems.org'
+
+gemspec
+
+gem 'rake', '~> 13.0'
+gem 'minitest', '~> 5.0'
+gem 'pry'

data/Gemfile.lock

@@ -0,0 +1,27 @@
+PATH
+  remote: .
+  specs:
+    enum_utils (0.1.0)
+
+GEM
+  remote: https://rubygems.org/
+  specs:
+    coderay (1.1.3)
+    method_source (1.0.0)
+    minitest (5.15.0)
+    pry (0.14.1)
+      coderay (~> 1.1)
+      method_source (~> 1.0)
+    rake (13.0.6)
+
+PLATFORMS
+  ruby
+
+DEPENDENCIES
+  enum_utils!
+  minitest (~> 5.0)
+  pry
+  rake (~> 13.0)
+
+BUNDLED WITH
+   2.3.8

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2022 Max Chernyak
+
+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,171 @@
+# EnumUtils
+
+Functions for mixing and matching lazy, potentially infinite enumerables.
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'enum_utils'
+```
+
+And then execute:
+
+    $ bundle install
+
+Or install it yourself as:
+
+    $ gem install enum_utils
+
+## Usage
+
+### EnumUtils.sorted_intersection
+
+Given N consistently-sorted enums, return unique values that appear in at least
+[degree] number of different enums, preserving the global order, until all enums
+are depleted. By default a value must appear in all of them.
+
+```ruby
+# 3 ascending enums
+EnumUtils.sorted_intersection(
+  [1,2].each,
+  [2,3].each,
+  [1,2,5].each
+).to_a # => [2]
+
+# 3 descending enums
+EnumUtils.sorted_intersection(
+  [2,1].each,
+  [3,2].each,
+  [5,2,1].each,
+  compare: -> a, b { b <=> a } # reverse order comparison
+).to_a # => [2]
+
+# 3 ascending enums with degree 2
+EnumUtils.sorted_intersection(
+  [1,2].each,
+  [2,3].each,
+  [1,2,5].each,
+  degree: 2
+).to_a # => [1, 2]
+```
+
+### EnumUtils.sorted_union
+
+Given N consistently-sorted enums, return all their unique values while
+preserving their global order. If `with_index: true` is given, also return index
+of the enum in which the corresponding value was first seen.
+
+```ruby
+# 3 ascending enums
+EnumUtils.sorted_union(
+  [1,2].each,
+  [2,3].each,
+  [1,2,5].each
+).to_a # => [1,2,3,5]
+
+# 3 descending enums
+EnumUtils.sorted_union(
+  [2,1].each,
+  [3,2].each,
+  [5,2,1].each,
+  compare: -> a, b { b <=> a } # reverse order comparison
+).to_a # => [5,3,2,1]
+
+# 3 ascending enums with index
+EnumUtils.sorted_union(
+  [1,2].each,
+  [2,3].each,
+  [1,2,5].each,
+  with_index: true
+).to_a # => [[1,0], [2,0], [3,1], [5,2]]
+```
+
+### EnumUtils.sorted_merge
+
+Given N consistently-sorted enums, return all their values while preserving the
+global order. If `with_index: true` is given, also return index in the enum that
+originated the value.
+
+```ruby
+## 3 ascending enums
+EnumUtils.sorted_merge(
+  [1,2].each,
+  [2,3].each,
+  [1,2,5].each
+).to_a # => [1,1,2,2,2,3,5]
+
+## 3 descending enums
+EnumUtils.sorted_merge(
+  [2,1].each,
+  [3,2].each,
+  [5,2,1].each,
+  compare: -> a, b { b <=> a } # reverse order comparison
+).to_a # => [5,3,2,2,2,1,1]
+
+## 3 ascending enums with index
+EnumUtils.sorted_union(
+  [1,2].each,
+  [2,3].each,
+  [1,2,5].each,
+  with_index: true
+).to_a # => [[1,0], [1,2], [2,0], [2,1], [2,2], [3,1], [5,2]]
+```
+
+### EnumUtils.round_robin
+
+Given N enums, return all their values by taking one value from each enum in
+turn, until all are exhausted. If `with_index: true` is given, also return index
+of the enum that originated the value.
+
+```ruby
+## 3 enums
+EnumUtils.round_robin(
+  [3,2].each,
+  [1,3].each,
+  [5,3,4].each
+).to_a # => [3,1,5,2,3,3,4]
+
+## 3 enums with index
+EnumUtils.round_robin(
+  [3,2].each,
+  [1,3].each,
+  [5,3,4].each,
+  with_index: true
+).to_a # => [[3,0], [1,1], [5,2], [2,0], [3,1], [3,2], [4,2]]
+```
+
+### EnumUtils.concat
+
+Given N enums, return a new enum which lazily exhausts every enum.
+
+## Development
+
+After checking out the repo, run `bin/setup` to install dependencies. Then, run
+`rake test` 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 the created tag, 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/maxim/enum_utils. This project is intended to be a safe,
+welcoming space for collaboration, and contributors are expected to adhere to
+the [code of
+conduct](https://github.com/maxim/enum_utils/blob/master/CODE_OF_CONDUCT.md).
+
+## License
+
+The gem is available as open source under the terms of the [MIT License](https://opensource.org/licenses/MIT).
+
+## Code of Conduct
+
+Everyone interacting in the EnumUtils project's codebases, issue trackers, chat
+rooms and mailing lists is expected to follow the [code of
+conduct](https://github.com/maxim/enum_utils/blob/master/CODE_OF_CONDUCT.md).

data/Rakefile

@@ -0,0 +1,12 @@
+# frozen_string_literal: true
+
+require 'bundler/gem_tasks'
+require 'rake/testtask'
+
+Rake::TestTask.new(:test) do |t|
+  t.libs << 'test'
+  t.libs << 'lib'
+  t.test_files = FileList['test/**/*_test.rb']
+end
+
+task default: :test

data/bin/console

@@ -0,0 +1,11 @@
+#!/usr/bin/env ruby
+# frozen_string_literal: true
+
+require 'bundler/setup'
+require 'enum_utils'
+
+# 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.
+
+require 'pry'
+Pry.start

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/enum_utils.gemspec

@@ -0,0 +1,27 @@
+# frozen_string_literal: true
+
+require_relative 'lib/enum_utils/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = 'enum_utils'
+  spec.version       = EnumUtils::VERSION
+  spec.authors       = ['Max Chernyak']
+  spec.email         = ['hello@max.engineer']
+
+  spec.summary       = 'Write a short summary, because RubyGems requires one.'
+  spec.description   = 'Write a longer description or delete this line.'
+  spec.homepage      = 'https://github.com/maxim/enum_utils'
+  spec.required_ruby_version = Gem::Requirement.new('>= 2.6.9')
+
+  spec.metadata['allowed_push_host'] = 'https://rubygems.org'
+
+  spec.metadata['homepage_uri'] = spec.homepage
+  spec.metadata['source_code_uri'] = spec.homepage
+  spec.metadata['changelog_uri'] = "#{spec.homepage}/blob/main/CHANGELOG.md"
+
+  spec.files = Dir.chdir(File.expand_path(__dir__)) do
+    `git ls-files -z`.split("\x0").reject { |f| f.match(/\Atest\//) }
+  end
+
+  spec.require_paths = ['lib']
+end

data/lib/enum_utils/exhaustible_iter.rb

@@ -0,0 +1,21 @@
+module EnumUtils
+  # This is an enumerator wrapper that always caches 1 item in its buffer, and
+  # provides the ability to check if underlying enumerator is exhausted.
+  class ExhaustibleIter
+    EXHAUSTED = Object.new
+
+    attr_reader :buff_value
+
+    def initialize(source); @source = source; pull   end
+    def exhausted?;         @buff_value == EXHAUSTED end
+    def next;               @buff_value.tap { pull } end
+
+    private
+
+    def pull
+      @buff_value = @source.next
+    rescue StopIteration
+      @buff_value = EXHAUSTED
+    end
+  end
+end

data/lib/enum_utils/version.rb

@@ -0,0 +1,5 @@
+# frozen_string_literal: true
+
+module EnumUtils
+  VERSION = '0.1.0'
+end

data/lib/enum_utils.rb

@@ -0,0 +1,269 @@
+# frozen_string_literal: true
+
+require 'set'
+require_relative 'enum_utils/version'
+require_relative 'enum_utils/exhaustible_iter'
+
+module EnumUtils
+  extend self
+
+  # Given N consistently-sorted enums, return unique values that appear in at
+  # least [degree] number of different enums, preserving the global order, until
+  # all enums are depleted. By default a value must appear in all of them.
+  #
+  # Examples:
+  #
+  #   ## 3 ascending enums:
+  #
+  #   EnumUtils.sorted_intersection(
+  #     [1,2].each,
+  #     [2,3].each,
+  #     [1,2,5].each
+  #   ).to_a # => [2]
+  #
+  #   ## 3 descending enums:
+  #
+  #   EnumUtils.sorted_intersection(
+  #     [2,1].each,
+  #     [3,2].each,
+  #     [5,2,1].each,
+  #     compare: -> a, b { b <=> a } # reverse order comparison
+  #   ).to_a # => [2]
+  #
+  #   ## 3 ascending enums with degree 2:
+  #
+  #   EnumUtils.sorted_intersection(
+  #     [1,2].each,
+  #     [2,3].each,
+  #     [1,2,5].each,
+  #     degree: 2
+  #   ).to_a # => [1, 2]
+  def sorted_intersection *enums,
+    compare: -> a, b { a <=> b },
+    degree: enums.size
+
+    unless block_given?
+      return enum_for(__method__, *enums, compare: compare, degree: degree)
+    end
+
+    active  = prepare_enums(enums)
+    compare = compare_with_error_handling(compare)
+    last_v  = []
+    seen_i  = Set[]
+
+    while active.size >= (degree - seen_i.size)
+      (min_iter, min_iter_i), pos = pick_min(active, compare, demote: seen_i)
+      value = min_iter.next
+
+      if last_v.empty? || compare.(last_v[0], value) != 0
+        last_v.replace [value]
+        seen_i.replace [min_iter_i]
+      else
+        seen_i << min_iter_i
+      end
+
+      if seen_i.size == degree
+        yield(value)
+        last_v.replace []
+        seen_i.replace []
+      end
+
+      active.delete_at(pos) if min_iter.exhausted?
+    end
+  end
+
+  # Given N consistently-sorted enums, return all their unique values while
+  # preserving their global order. If `with_index: true` is given, also return
+  # index of the enum in which the corresponding value was first seen.
+  #
+  # Examples:
+  #
+  #   ## 3 ascending enums:
+  #
+  #   EnumUtils.sorted_union(
+  #     [1,2].each,
+  #     [2,3].each,
+  #     [1,2,5].each
+  #   ).to_a # => [1,2,3,5]
+  #
+  #   ## 3 descending enums:
+  #
+  #   EnumUtils.sorted_union(
+  #     [2,1].each,
+  #     [3,2].each,
+  #     [5,2,1].each,
+  #     compare: -> a, b { b <=> a } # reverse order comparison
+  #   ).to_a # => [5,3,2,1]
+  #
+  #   ## 3 ascending enums with index:
+  #
+  #   EnumUtils.sorted_union(
+  #     [1,2].each,
+  #     [2,3].each,
+  #     [1,2,5].each,
+  #     with_index: true
+  #   ).to_a # => [[1,0], [2,0], [3,1], [5,2]]
+  def sorted_union(*enums, compare: -> a, b { a <=> b }, with_index: false)
+    unless block_given?
+      return \
+        enum_for(__method__, *enums, compare: compare, with_index: with_index)
+    end
+
+    unless with_index
+      return sorted_union(*enums, compare: compare, with_index: true) { |v, _|
+        yield v
+      }
+    end
+
+    last_v = []
+
+    sorted_merge(*enums, compare: compare, with_index: with_index).each { |v, i|
+      if last_v.empty? || v != last_v[0]
+        yield(v, i)
+        last_v.replace([v])
+      end
+    }
+  end
+
+  # Given N consistently-sorted enums, return all their values while preserving
+  # the global order. If `with_index: true` is given, also return index in the
+  # enum that originated the value.
+  #
+  # Examples:
+  #
+  #   ## 3 ascending enums:
+  #
+  #   EnumUtils.sorted_merge(
+  #     [1,2].each,
+  #     [2,3].each,
+  #     [1,2,5].each
+  #   ).to_a # => [1,1,2,2,2,3,5]
+  #
+  #   ## 3 descending enums:
+  #
+  #   EnumUtils.sorted_merge(
+  #     [2,1].each,
+  #     [3,2].each,
+  #     [5,2,1].each,
+  #     compare: -> a, b { b <=> a } # reverse order comparison
+  #   ).to_a # => [5,3,2,2,2,1,1]
+  #
+  #   ## 3 ascending enums with index:
+  #
+  #   EnumUtils.sorted_union(
+  #     [1,2].each,
+  #     [2,3].each,
+  #     [1,2,5].each,
+  #     with_index: true
+  #   ).to_a # => [[1,0], [1,2], [2,0], [2,1], [2,2], [3,1], [5,2]]
+  def sorted_merge(*enums, compare: -> a, b { a <=> b }, with_index: false)
+    unless block_given?
+      return \
+        enum_for(__method__, *enums, compare: compare, with_index: with_index)
+    end
+
+    unless with_index
+      return sorted_merge(*enums, compare: compare, with_index: true) { |v, _|
+        yield v
+      }
+    end
+
+    active  = prepare_enums(enums)
+    compare = compare_with_error_handling(compare)
+
+    while active.any?
+      (min_iter, min_iter_i), pos = pick_min(active, compare)
+      yield(min_iter.next, min_iter_i)
+      active.delete_at(pos) if min_iter.exhausted?
+    end
+  end
+
+  # Given N enums, return all their values by taking one value from each enum in
+  # turn, until all are exhausted. If `with_index: true` is given, also return
+  # index of the enum that originated the value.
+  #
+  # Examples:
+  #
+  #   ## 3 enums:
+  #
+  #   EnumUtils.round_robin(
+  #     [3,2].each,
+  #     [1,3].each,
+  #     [5,3,4].each
+  #   ).to_a # => [3,1,5,2,3,3,4]
+  #
+  #   ## 3 enums with index:
+  #
+  #   EnumUtils.round_robin(
+  #     [3,2].each,
+  #     [1,3].each,
+  #     [5,3,4].each,
+  #     with_index: true
+  #   ).to_a # => [[3,0], [1,1], [5,2], [2,0], [3,1], [3,2], [4,2]]
+  def round_robin(*enums, with_index: false)
+    unless block_given?
+      return enum_for(__method__, *enums, with_index: with_index)
+    end
+
+    unless with_index
+      return round_robin(*enums, with_index: true) { |v, _| yield v }
+    end
+
+    active = prepare_enums(enums)
+
+    while active.any?
+      pos = 0
+
+      while pos < active.size
+        iter, i = active[pos]
+        yield(iter.next, i)
+        iter.exhausted? ? active.delete_at(pos) : pos += 1
+      end
+    end
+  end
+
+  # Given N enums, return a new enum which lazily exhausts every enum.
+  def concat(*enums)
+    return enum_for(__method__, *enums) unless block_given?
+
+    enums
+      .lazy
+      .flat_map(&:lazy)
+      .to_enum { enums.sum(&:size) if enums.all?(&:size) }.each do |v|
+        yield(v)
+      end
+  end
+
+  private
+
+  def pick_min(indexed_enums, compare, demote: Set[])
+    indexed_enums.each.with_index.min { |((a_enum, ai), _), ((b_enum, bi), _)|
+      result = compare.(a_enum.buff_value, b_enum.buff_value)
+
+      if result.nonzero?
+        result
+      elsif demote.include?(bi)
+        -1
+      elsif demote.include?(ai)
+        1
+      else
+        result
+      end
+    }
+  end
+
+  def compare_with_error_handling(compare)
+    -> a, b {
+      result = compare.(a, b)
+      return result unless result.nil?
+      raise ArgumentError, "comparison of #{a.class} with #{b.class} failed"
+    }
+  end
+
+  def prepare_enums(enums)
+    enums
+      .map
+      .with_index { |e, i| [ExhaustibleIter.new(e), i] }
+      .reject { |e, _| e.exhausted? }
+  end
+end

metadata

@@ -0,0 +1,61 @@
+--- !ruby/object:Gem::Specification
+name: enum_utils
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- Max Chernyak
+autorequire:
+bindir: bin
+cert_chain: []
+date: 2022-03-04 00:00:00.000000000 Z
+dependencies: []
+description: Write a longer description or delete this line.
+email:
+- hello@max.engineer
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".github/workflows/main.yml"
+- ".gitignore"
+- CHANGELOG.md
+- CODE_OF_CONDUCT.md
+- Gemfile
+- Gemfile.lock
+- LICENSE.txt
+- README.md
+- Rakefile
+- bin/console
+- bin/setup
+- enum_utils.gemspec
+- lib/enum_utils.rb
+- lib/enum_utils/exhaustible_iter.rb
+- lib/enum_utils/version.rb
+homepage: https://github.com/maxim/enum_utils
+licenses: []
+metadata:
+  allowed_push_host: https://rubygems.org
+  homepage_uri: https://github.com/maxim/enum_utils
+  source_code_uri: https://github.com/maxim/enum_utils
+  changelog_uri: https://github.com/maxim/enum_utils/blob/main/CHANGELOG.md
+post_install_message:
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: 2.6.9
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubygems_version: 3.3.7
+signing_key:
+specification_version: 4
+summary: Write a short summary, because RubyGems requires one.
+test_files: []