multiples 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: e7edc53b90318e0babfb1c73ecad1b2d09966129
+  data.tar.gz: a3d791a1a8351b9d817e374cb6d8692a6caa7fd2
+SHA512:
+  metadata.gz: 1a447a6aa6fa6d97445eba165033eb4fe7695b6099ef0d35470a9872a8cd38ff18ac668fbe0e8dca01ad584e816b5be8f67b2b4599ff79657ef69c6b1ad50688
+  data.tar.gz: fb11443773d0f4823353d45c8c4528480cf3769fd73ec09225cfee1fb9869ab4bd6d8af152b2284f758ec89f3887fa360fa2df4ef849ee49c41ed8d097df03f0

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.3.1
+before_install: gem install bundler -v 1.13.6

data/Gemfile

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

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2016 Daniel P. Clark
+
+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,95 @@
+# Multiples
+
+Creates enumerators that step through integers from a union of two multiples.
+A pattern from the two numbers is determined (much like two frequencies create
+a pattern) and the resulting palindrome is given to a custom Enumerator for you
+to use.
+
+I've created this gem from a delightful discovery I made.  When going through all
+the numbers that are multiples of two different digits a pattern comes through.
+This pattern is a palindrome.  See for yourself:
+
+```
+For multiples of 3 with 5 we have.
+
+3 5 6 9 10 12 15 18 20 21 24 25 27 30 33 35 36 39 40 42 45
+3 2 1 3 1  2  3  3  2  1  3  1  2  3  3  2  1  3  1  2  3
+```
+
+The palindrome for the above differences example is `3,2,1,3,1,2,3`.  I thought this
+may be true for other numbers as well so lets look at 4 with 5.
+
+```
+4 5 8 10 12 15 16 20 24 25 28 30 32 35 36 40
+4 1 3 2  2  3  1  4  4  1  3  2  2  3  1  4
+```
+
+As you can see from this example another palindrome has arisen `4,1,3,2,2,3,1,4`. Upon
+further study of these patterns I have also found that the palindrome will always be the
+same length as the two numbers added together minus one.  So 3 and 5's palindrome is the
+length `3+5-1=7` and 4 and 5's palindromes length is `4+5-1=8`.  I wrote code that tests
+any two different digits and those are accurate lengths.
+
+So if you'd like an iterator that steps through multiples without calculating every step
+of the way you may use this gem for that.
+
+### NOTES
+
+* If one of the numbers is divisible by the other than this rule doesn't apply.
+* The gem doesn't take into account zero and negative numbers.  If you wanted to you may progress backwards through negative numbers.
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'multiples'
+```
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install multiples
+
+## Usage
+
+```ruby
+x = Multiples.new(3,5)
+x.next
+# => 3
+
+x.each do |val|
+  break val if val > 14
+end
+# => 15
+
+x.lazy.select {|v| v % 10 == 0}.take(2).to_a
+# => [20, 30]
+x.next
+# => 33 
+x.phase
+# => 1
+x.prev
+# => 30
+x.phase
+# => 0
+```
+
+## 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/danielpclark/multiples.
+
+
+## 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,10 @@
+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,14 @@
+#!/usr/bin/env ruby
+
+require "bundler/setup"
+require "multiples"
+
+# 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

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/multiples/multiples_enumerator.rb

@@ -0,0 +1,78 @@
+module Multiples
+  module MultiplesEnumGenerator
+    class << self
+      def new a, b
+        @a, @b = (a..Float::INFINITY).step(a), (b..Float::INFINITY).step(b)
+        @palindrome_length = a + b - 1
+        @stack = [[@a.peek, @b.peek].min.to_i]
+        send :build_palindrome
+        return MultiplesEnumerator.new(@stack)
+      end
+
+      private
+      def build_palindrome
+        until @stack.length == @palindrome_length
+          @stack << step
+        end
+      end
+
+      def step
+        val = [@a.peek, @b.peek].max - [@a.peek, @b.peek].min
+        if val > @stack[0]
+          val = @stack[0]
+        end
+        h = {@a.peek => @a, @b.peek => @b}
+        h[h.keys.min].next
+        val.to_i
+      end
+    end
+  end
+
+  class MultiplesEnumerator
+    attr_reader :palindrome, :phase
+    def initialize palindrome
+      @base = 0
+      @palindrome = palindrome
+      @phase = 0
+    end
+
+    def current
+      @base
+    end
+
+    def each
+      loop do
+        send :next
+        yield @base
+      end
+    end
+
+    def lazy
+      Enumerator::Lazy.new(self) do |yielder, *vals|
+        yielder.<<(*vals)
+      end
+    end
+
+    def next
+      @base += progress_phase
+    end
+
+    def prev
+      @base -= regress_phase
+    end
+
+    private
+    def progress_phase
+      val = @palindrome[@phase]
+      @phase += 1
+      @phase = 0 if @phase > @palindrome.length - 1
+      val
+    end
+
+    def regress_phase
+      @phase -= 1
+      @phase = @palindrome.length - 1 if @phase < 0
+      @palindrome[@phase]
+    end
+  end
+end

data/lib/multiples/version.rb

@@ -0,0 +1,3 @@
+module Multiples
+  VERSION = "0.1.0"
+end

data/lib/multiples.rb

@@ -0,0 +1,8 @@
+require "multiples/version"
+require "multiples/multiples_enumerator"
+
+module Multiples
+  def Multiples.new(*args)
+    MultiplesEnumGenerator.new(*args)
+  end
+end

data/multiples.gemspec

@@ -0,0 +1,25 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'multiples/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "multiples"
+  spec.version       = Multiples::VERSION
+  spec.authors       = ["Daniel P. Clark"]
+  spec.email         = ["6ftdan@gmail.com"]
+  spec.summary       = %q{Creates enumerators that step through integers from a union of two multiples"}
+  spec.description   = %q{Creates enumerators that step through integers from a union of two multiples. A pattern from the two numbers is determined (much like two frequencies create a pattern) and the resulting palindrome is given to a custom Enumerator for you to use."}
+  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.13"
+  spec.add_development_dependency "rake", "~> 10.0"
+  spec.add_development_dependency "minitest", "~> 5.0"
+end

metadata

@@ -0,0 +1,101 @@
+--- !ruby/object:Gem::Specification
+name: multiples
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- Daniel P. Clark
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2016-12-06 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.13'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.13'
+- !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: Creates enumerators that step through integers from a union of two multiples.
+  A pattern from the two numbers is determined (much like two frequencies create a
+  pattern) and the resulting palindrome is given to a custom Enumerator for you to
+  use."
+email:
+- 6ftdan@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- ".travis.yml"
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- bin/console
+- bin/setup
+- lib/multiples.rb
+- lib/multiples/multiples_enumerator.rb
+- lib/multiples/version.rb
+- multiples.gemspec
+homepage: 
+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.4
+signing_key: 
+specification_version: 4
+summary: Creates enumerators that step through integers from a union of two multiples"
+test_files: []