hyper_iterator 0.2.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: f776d5a162fa0d997d516aee5ced0de1d1834297
+  data.tar.gz: 4cfe8ac82bf8931932f886a466fac97bbbeec80c
+SHA512:
+  metadata.gz: 5660248cb7aab3bdf506ed1336e3670e0a22ed9d8e460e7748ea347ed2720b46ba32383eb327f16d7e4f6b23dd734829599c5cc7a37725c3ed3845c7558756aa
+  data.tar.gz: bb43e91db9b085103bc59db9191c6b896d1e8b79c55fc51875a5678c0742e0cc96e5d9e3ec2ad0788e548fdbf45257b43865c65bd619c3859bc102b015b1e938

data/.gitignore

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

data/.travis.yml

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

data/Dockerfile

@@ -0,0 +1,13 @@
+# Pick a version of your choice
+# If you don't see one, please check this page
+# https://hub.docker.com/_/ruby/
+# and add it here
+
+# FROM ruby:2.1.10
+# FROM ruby:2.2.2
+# FROM ruby:2.2.6
+# FROM ruby:2.3.0
+# FROM ruby:2.3.3
+FROM ruby:2.4.0
+RUN ruby -v
+RUN gem install require_all

data/Gemfile

@@ -0,0 +1,8 @@
+source 'https://rubygems.org'
+
+# Specify your gem's dependencies in hyper_iterator.gemspec
+gemspec
+
+group :test do
+  gem 'minitest-reporters'
+end

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2017 Edmund Li
+
+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,184 @@
+[![Build Status](https://travis-ci.org/EdmundLeex/hyper_iterator.svg?branch=master)](https://travis-ci.org/EdmundLeex/hyper_iterator)
+
+# HyperIterator
+
+**Caution: this gem monkey patches Ruby's `Array` class.**
+
+Inspired by [Ruby Performance Optimization](https://media.pragprog.com/titles/adrpo/iterators.pdf), 
+HyperIterator is reimplementation of Ruby iterators in Ruby, designed to address performance 
+drawbacks from native implementations, mainly in memory usage.
+
+The main idea is to remove objects from array during iteration. In iteration of large array, 
+this would allow garbage collection to happen before the iteration finishes, therefore reduce 
+memory usage.
+
+## Installation
+
+*This is in experimental stage. More testing will be conducted.*
+*You can see my [updates in here](UPDATE.md)*
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'hyper_iterator'
+```
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install hyper_iterator
+
+## Available Methods (adding more)
+
+- `each_slice!`
+- `each!`
+
+## Gotcha
+
+These methods work just as the non bang version, except that, it **WILL MUTATE** the original array 
+by **REMOVING ALL** the elements from it.
+
+```ruby
+arr = (1..10).to_a
+arr.each! { |el| ... }
+# After the iteration, the arr is empty!
+# arr => []
+```
+
+## Benchmark
+
+### For basic benchmarks
+```
+rake benchmark
+```
+
+#### Example report
+
+```
+---------------------------------------------------------
+---------------------- each_slice! ----------------------
+---------------------------------------------------------
+------------------ Garbage Collection -------------------
+Array#each_slice
+----------------------
+100 100 100 100 100 100 100 100 100 100 100 100 100
+
+Array#each_slice!
+----------------------
+100 92 84 76 68 60 52 44 36 28 20 12 4
+---------------------------------------------------------
+-------------------- Objects Created --------------------
+Array#each_slice
+----------------------
+# of arrays: 126
+# of nodes: 2
+
+Array#each_slice!
+----------------------
+# of arrays: 125
+# of nodes: 0
+---------------------------------------------------------
+--------------- Execution Time Comparison ---------------
+Rehearsal -----------------------------------------------
+each_slice    0.040000   0.000000   0.040000 (  0.049524)
+each_slice!   0.040000   0.010000   0.050000 (  0.047753)
+-------------------------------------- total: 0.090000sec
+
+                  user     system      total        real
+each_slice    0.040000   0.010000   0.050000 (  0.048487)
+each_slice!   0.040000   0.010000   0.050000 (  0.052009)
+---------------------------------------------------------
+```
+
+### Memory Benchmark
+
+To eliminate the variable of different machines, you will need to install [Docker](https://docs.docker.com/engine/installation/) 
+for this.
+
+1. Go to [Docker](https://docs.docker.com/engine/installation/) to download and install Docker
+2. Go to the `Dockerfile`, and pick a Ruby version of your choice
+3. Run `bin/setup` in your command line
+4. Run `bin/bm` in your command line
+
+#### Methodology
+
+The native implementation (non bang version) retains the entire array. So if we keep on adding objects to 
+memory, it will blow up pretty quickly (given the memory is limited).
+
+While using the bang version in this gem, the refernce to the objects store in the array will be removed. 
+So the Garbage Collector (GC) can see them as removable objects and clean them up.
+
+The test code simply creates duplicate object as it iterates. Since the bang version iterator keeps removing 
+the references, the memory gets to recycle itself. In this repot, it will show as more iterations compare 
+to the non bang version.
+
+This is because as the memory gets freed up, we just have more rooms to store new objects, until the GC is 
+not freeing up memory fast enough.
+
+FYI: In this test, the empty array (created from every iteration to store the new objects) is also otaking 
+up more space. If you pop the empty array off (see [./benchmark/memory_bm/each_bang.rb](./benchmark/memory_bm/each_bang.rb)), 
+you can get a lot more iterations!
+
+#### Example report
+
+- #i is the nth iteration
+- The rest is time spent in execution
+- The last line is empty because memory blew up
+
+```
+----------------- Array#each ------------------
+#i    user      system      total       real
+0   0.010000   0.000000   0.010000 (  0.043329)
+1   0.000000   0.010000   0.010000 (  0.010112)
+2   0.000000   0.000000   0.000000 (  0.025059)
+3   0.000000   0.000000   0.000000 (  0.010436)
+4   0.000000   0.000000   0.000000 (  0.008007)
+5   0.000000   0.010000   0.010000 (  0.009692)
+6   0.000000   0.010000   0.010000 (  0.050283)
+7
+----------------- Array#each! -----------------
+#i    user      system      total       real
+0   0.000000   0.000000   0.000000 (  0.004570)
+1   0.010000   0.000000   0.010000 (  0.006715)
+2   0.000000   0.010000   0.010000 (  0.040050)
+3   0.010000   0.000000   0.010000 (  0.009338)
+4   0.000000   0.000000   0.000000 (  0.006622)
+5   0.000000   0.010000   0.010000 (  0.019370)
+6   0.000000   0.000000   0.000000 (  0.012097)
+7   0.000000   0.010000   0.010000 (  0.025825)
+8   0.000000   0.010000   0.010000 (  0.014587)
+9   0.000000   0.010000   0.010000 (  0.014893)
+10   0.000000   0.000000   0.000000 (  0.026595)
+11   0.000000   0.000000   0.000000 (  0.012371)
+12   0.010000   0.000000   0.010000 (  0.023964)
+13   0.000000   0.000000   0.000000 (  0.007783)
+14   0.000000   0.000000   0.000000 (  0.004344)
+15   0.010000   0.020000   0.030000 (  0.119632)
+16   0.000000   0.010000   0.010000 (  0.010222)
+17   0.000000   0.000000   0.000000 (  0.009091)
+18 %
+```
+
+## 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 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/edmundleex/hyper_iterator. 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.
+
+## TODO
+
+- [ ] `each_slice!` should go to `Enumerable` module
+- [ ] `each!` for `Hash`
+- [ ] More comon iterators...
+
+## 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,14 @@
+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 :benchmark do
+  Dir['./benchmark/*.rb'].each { |f| ruby f }
+end
+
+task :default => :test

data/UPDATE.md

@@ -0,0 +1,21 @@
+### 3/16/17
+
+- Tweak the two benchmark file and made it work
+- This time around, I am dynamically creating new arrays and counting the number of 
+iterations before it blows up. And it's clear that the `each!` can complete more iteration 
+before it uses all the memory
+- Changed `each_slice!` implementation to avoid using `slice!`. The execution time comp 
+looks good (seems even faster than the native `each_slice`). And the memory usage comp 
+looks very good too!
+
+### 3/14/17
+
+- Testing benchmark in containerized environment to simulate limited allocated memory.
+- `each!` seems to be working fine. I can see gradual memory release in docker stat even
+not by a large margin.
+- Next thing to test would be creating more objects within the iteration to use up more 
+memory. Given that with 4MB allocation, the current [./benchmark/each.rb](benchmark/each.rb) 
+and [./benchmark/each_bang.rb](benchmark/each_bang.rb) is running at the edge of using up 
+all memory, creating more objects supposedly would kill the process using `each` while 
+`each!` should survive.
+- `each_slice!` implementation is very slow. Possibly because `slice!` is O(n)?

data/benchmark/each_bang_bm.rb

@@ -0,0 +1,85 @@
+require 'benchmark'
+require_relative '../lib/hyper_iterator'
+
+class Thing; end
+
+puts '---------------------------------------------------------'
+puts '------------------------- each! -------------------------'
+
+puts '---------------------------------------------------------'
+puts '------------------ Garbage Collection -------------------'
+
+puts 'Array#each'
+puts '----------------------'
+
+arr = Array.new(100) { Thing.new }
+line = ''
+
+arr.each do |el|
+  GC.start
+  print ObjectSpace.each_object(Thing).count
+  print ' '
+end
+
+puts
+puts
+
+puts 'Array#each!'
+puts '----------------------'
+
+arr = Array.new(100) { Thing.new }
+
+arr.each! do |el|
+  GC.start
+  print ObjectSpace.each_object(Thing).count
+  print ' '
+end
+
+puts
+
+puts '---------------------------------------------------------'
+puts '-------------------- Objects Created --------------------'
+
+
+GC.disable
+arr = Array.new(1000) { Thing.new }
+
+before = ObjectSpace.count_objects
+arr.each do |el|
+end
+after = ObjectSpace.count_objects
+
+puts 'Array#each'
+puts '----------------------'
+puts "# of arrays: %d" % (after[:T_ARRAY] - before[:T_ARRAY])
+puts "# of nodes: %d" % (after[:T_NODE] - before[:T_NODE])
+
+puts
+
+arr = Array.new(1000) { Thing.new }
+
+before = ObjectSpace.count_objects
+arr.each! do |el|
+end
+after = ObjectSpace.count_objects
+
+puts 'Array#each!'
+puts '----------------------'
+puts "# of arrays: %d" % (after[:T_ARRAY] - before[:T_ARRAY])
+puts "# of nodes: %d" % (after[:T_NODE] - before[:T_NODE])
+
+# puts '---------------------------------------------------------'
+# puts '--------------- Execution Time Comparison ---------------'
+
+# GC.enable
+# n = 10
+# arr = Array.new(1_000_000) { Thing.new }
+
+# Benchmark.bmbm(7) do |x|
+#   x.report('each!') { n.times { arr.each! { |el| nil } } }
+#   x.report('each')  { n.times { arr.each  { |el| nil } } }
+# end
+
+puts '---------------------------------------------------------'
+
+puts

data/benchmark/each_slice_bang_bm.rb

@@ -0,0 +1,99 @@
+require 'benchmark'
+require_relative '../lib/hyper_iterator'
+
+class Thing; end
+
+puts '---------------------------------------------------------'
+puts '---------------------- each_slice! ----------------------'
+
+puts '---------------------------------------------------------'
+puts '------------------ Garbage Collection -------------------'
+
+slize_size = rand(1..10)
+
+puts 'Array#each_slice'
+puts '----------------------'
+
+arr = Array.new(100) { Thing.new }
+line = ''
+
+arr.each_slice(slize_size) do |slice|
+  GC.start
+  print ObjectSpace.each_object(Thing).count
+  print ' '
+end
+
+puts
+puts
+
+puts 'Array#each_slice!'
+puts '----------------------'
+
+arr = Array.new(100) { Thing.new }
+
+arr.each_slice!(slize_size) do |slice|
+  GC.start
+  print ObjectSpace.each_object(Thing).count
+  print ' '
+end
+
+puts
+
+puts '---------------------------------------------------------'
+puts '-------------------- Objects Created --------------------'
+
+
+GC.disable
+arr = Array.new(1000) { Thing.new }
+
+before = ObjectSpace.count_objects
+arr.each_slice(slize_size) do |slice|
+end
+after = ObjectSpace.count_objects
+
+puts 'Array#each_slice'
+puts '----------------------'
+puts "# of arrays: %d" % (after[:T_ARRAY] - before[:T_ARRAY])
+puts "# of nodes: %d" % (after[:T_NODE] - before[:T_NODE])
+
+puts
+
+arr = Array.new(1000) { Thing.new }
+
+before = ObjectSpace.count_objects
+arr.each_slice!(slize_size) do |slice|
+end
+after = ObjectSpace.count_objects
+
+puts 'Array#each_slice!'
+puts '----------------------'
+puts "# of arrays: %d" % (after[:T_ARRAY] - before[:T_ARRAY])
+puts "# of nodes: %d" % (after[:T_NODE] - before[:T_NODE])
+
+puts '---------------------------------------------------------'
+puts '--------------- Execution Time Comparison ---------------'
+
+GC.enable
+n = 10
+arr = Array.new(1_000_000) { Thing.new }
+
+Benchmark.bmbm(7) do |x|
+  x.report('each_slice')  do
+    n.times do
+      arr.each_slice(slize_size) do |slice|
+        slice.each { |el| nil }
+      end
+    end
+  end
+  x.report('each_slice!') do
+    n.times do
+      arr.each_slice!(slize_size) do |slice|
+        slice.each { |el| nil }
+      end
+    end
+  end
+end
+
+puts '---------------------------------------------------------'
+
+puts

data/benchmark/memory_bm/each.rb

@@ -0,0 +1,23 @@
+require 'benchmark'
+require_relative '../../lib/hyper_iterator'
+$stdout.sync = true
+
+puts
+puts '----------------- Array#each ------------------'
+puts '#i    user      system      total       real'
+
+base_arr = Array.new(10000) { '-' * 10 }
+arrs = [base_arr]
+
+i = 0
+while true
+  print "#{i} "
+  arr = []
+  report = Benchmark.measure do
+    arrs[i].each { |el| arr << el.dup }
+  end
+
+  puts report
+  arrs << arr
+  i += 1
+end

data/benchmark/memory_bm/each_bang.rb

@@ -0,0 +1,31 @@
+require 'benchmark'
+require_relative '../../lib/hyper_iterator'
+$stdout.sync = true
+
+puts
+puts '----------------- Array#each! -----------------'
+puts '#i    user      system      total       real'
+
+base_arr = Array.new(10000) { '-' * 10 }
+arrs = [base_arr]
+
+i = 0
+while true
+  print "#{i} "
+  arr = []
+  report = Benchmark.measure do
+    arrs[i].each! { |el| arr << el.dup }
+
+    # Try to use this line and see how many more iterations you can get
+    # Remember to uncomment line#24 as well.
+    # You need to pop the array so the reference goes away.
+    # arrs[0].each! { |el| arr << el.dup }
+  end
+
+  # Uncomment this to use with the above line#22
+  # arrs.pop
+
+  puts report
+  arrs << arr
+  i += 1
+end

data/benchmark/memory_bm/each_slice.rb

@@ -0,0 +1,27 @@
+require 'benchmark'
+require_relative '../../lib/hyper_iterator'
+$stdout.sync = true
+
+puts 'Array#each_slice'
+puts 'creating array'
+base_arr = Array.new(10000) { '-' * 10 }
+arrs = [base_arr]
+puts 'finished creating base array'
+puts 'each iteration begins'
+
+i = 0
+while true
+  print "#{i} "
+  arr = []
+  report = Benchmark.measure do
+    arrs[i].each_slice(100) do |sl|
+      sl.each { |el| arr << el.dup }
+    end
+  end
+
+  puts report
+  arrs << arr
+  i += 1
+end
+
+puts

data/benchmark/memory_bm/each_slice_bang.rb

@@ -0,0 +1,27 @@
+require 'benchmark'
+require_relative '../../lib/hyper_iterator'
+$stdout.sync = true
+
+puts 'Array#each_slice'
+puts 'creating array'
+base_arr = Array.new(10000) { '-' * 10 }
+arrs = [base_arr]
+puts 'finished creating base array'
+puts 'each iteration begins'
+
+i = 0
+while true
+  print "#{i} "
+  arr = []
+  report = Benchmark.measure do
+    arrs[i].each_slice!(100) do |sl|
+      sl.each { |el| arr << el.dup }
+    end
+  end
+
+  puts report
+  arrs << arr
+  i += 1
+end
+
+puts

data/bin/bm

@@ -0,0 +1,14 @@
+#!/usr/bin/env bash
+
+docker_command="docker run -m=4m -v `pwd`:`pwd` -w `pwd` hyper_iterator ruby ./benchmark/memory_bm"
+if [ "$1" = "each" ] || [ "$1" = 1 ]; then
+  eval "$docker_command/each.rb"
+  eval "$docker_command/each_bang.rb"
+elif [ "$1" = "each" ] || [ "$1" = 2 ]; then
+  eval "$docker_command/each_slice.rb"
+  eval "$docker_command/each_slice_bang.rb"
+else
+  echo 'Please specify method for benchmarking. You can choose anyone from below:'
+  echo '1. each!'
+  echo '2. each_slice!'
+fi

data/bin/console

@@ -0,0 +1,14 @@
+#!/usr/bin/env ruby
+
+require "bundler/setup"
+require "hyper_iterator"
+
+# 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,9 @@
+#!/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
+docker build -t hyper_iterator .

data/hyper_iterator.gemspec

@@ -0,0 +1,32 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'hyper_iterator/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "hyper_iterator"
+  spec.version       = HyperIterator::VERSION
+  spec.summary       = "Implementation of Ruby Iterators with High Performance"
+  spec.description   = ""
+
+  spec.required_ruby_version = ">= 2.1.2"
+
+  spec.license = "MIT"
+
+  spec.authors  = ["Edmund Li"]
+  spec.email    = ["edmund.xz.lee@gmail.com"]
+  spec.homepage = "https://github.com/EdmundLeex/hyper_iterator"
+
+  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_dependency 'require_all', '~> 1.4.0'
+
+  spec.add_development_dependency "bundler", "~> 1.14"
+  spec.add_development_dependency "rake", "~> 10.0"
+  spec.add_development_dependency "minitest", "~> 5.0"
+end

data/lib/hyper_iterator/version.rb

@@ -0,0 +1,3 @@
+module HyperIterator
+  VERSION = "0.2.0"
+end

data/lib/hyper_iterator.rb

@@ -0,0 +1,14 @@
+require 'require_all'
+require_relative "./hyper_iterator/version"
+require_all 'lib/iterators/**/*.rb'
+
+module HyperIterator
+  AVAILABLE_METHODS = [
+    :each_slice!,
+    :each!
+  ].freeze
+end
+
+class Array
+  include HyperIterator
+end

data/lib/iterators/each_bang.rb

@@ -0,0 +1,8 @@
+module HyperIterator
+  def each!(&blk)
+    while count > 0
+      blk.call(shift)
+    end
+    nil
+  end
+end

data/lib/iterators/each_slice_bang.rb

@@ -0,0 +1,16 @@
+module HyperIterator
+  def each_slice!(slice_size, &blk)
+    i = 0
+
+    while count > 0
+      current_slice = []
+      while i < slice_size && count > 0
+        current_slice << shift
+        i += 1
+      end
+      blk.call(current_slice)
+      i = 0
+    end
+    nil
+  end
+end

metadata

@@ -0,0 +1,122 @@
+--- !ruby/object:Gem::Specification
+name: hyper_iterator
+version: !ruby/object:Gem::Version
+  version: 0.2.0
+platform: ruby
+authors:
+- Edmund Li
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2017-03-17 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: require_all
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 1.4.0
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 1.4.0
+- !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: minitest
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '5.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '5.0'
+description: ''
+email:
+- edmund.xz.lee@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- ".travis.yml"
+- Dockerfile
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- UPDATE.md
+- benchmark/each_bang_bm.rb
+- benchmark/each_slice_bang_bm.rb
+- benchmark/memory_bm/each.rb
+- benchmark/memory_bm/each_bang.rb
+- benchmark/memory_bm/each_slice.rb
+- benchmark/memory_bm/each_slice_bang.rb
+- bin/bm
+- bin/console
+- bin/setup
+- hyper_iterator.gemspec
+- lib/hyper_iterator.rb
+- lib/hyper_iterator/version.rb
+- lib/iterators/each_bang.rb
+- lib/iterators/each_slice_bang.rb
+homepage: https://github.com/EdmundLeex/hyper_iterator
+licenses:
+- MIT
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: 2.1.2
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.2.2
+signing_key: 
+specification_version: 4
+summary: Implementation of Ruby Iterators with High Performance
+test_files: []