pangrammic_surplus 0.0.1

data/README.md

@@ -0,0 +1,51 @@
+## Pangrammic Surplus
+
+Determines the surplus of characters that satisfies a self-enumerating pangram.
+
+## Concept
+
+When searching for self-enumerating pangrams, you'll often start with some boilerplate text and attempt to satisfy it with a list of numbers, for example:
+
+```This pangram lists one a, two b's, three c's ..... and one z.```
+
+In this case, the boilerplate is ```This pangram lists and```
+
+Pangrammic Surplus turns things the other way around. We give it a list of numbers and it tells us what characters are left to build boilerplate text from.
+
+For example:
+
+```ruby
+  require 'pangrammic_surplus'
+
+  surplus = PangrammicSurplus.for(
+    'a' => 4,  'b' => 1,  'c' => 1, 'd' => 2, 'e' => 29, 'f' => 8,  'g' => 3,
+    'h' => 5,  'i' => 11, 'j' => 1, 'k' => 1, 'l' => 3,  'm' => 2,  'n' => 22,
+    'o' => 15, 'p' => 2,  'q' => 1, 'r' => 7, 's' => 26, 't' => 19, 'u' => 4,
+    'v' => 5,  'w' => 9,  'x' => 2, 'y' => 4, 'z' => 1
+  )
+
+  puts surplus.inspect
+  # 'a' => 3, 'b' => 0, 'c' => 0, 'd' => 1, 'e' => 0, 'f' => 0, 'g' => 1,
+  # 'h' => 1, 'i' => 2, 'j' => 0, 'k' => 0, 'l' => 1, 'm' => 1, 'n' => 2,
+  # 'o' => 0, 'p' => 1, 'q' => 0, 'r' => 1, 's' => 3, 't' => 2, 'u' => 0,
+  # 'v' => 0, 'w' => 0, 'x' => 0, 'y' => 0, 'z' => 0
+
+  non_zero_letters = surplus.reject { |letter, count| count.zero? }
+  puts non_zero_letters.inspect
+  # 'a' => 3, 'd' => 1, 'g' => 1, 'h' => 1, 'i' => 2, 'l' => 1, 'm' => 1,
+  # 'n' => 2, 'p' => 1, 'r' => 1, 's' => 3, 't' => 2
+```
+
+If we can construct boilerplate from an anagram of these letters, we have a true self-enumerating pangram.
+
+```This pangram lists and``` is one possible anagram, in this case.
+
+And therefore, the following is a true self-enumerating pangram:
+
+"This pangram lists four a's, one b, one c, two d's, twenty-nine e's, eight f's, three g's, five h's, eleven i's, one j, one k, three l's, two m's, twenty-two n's, fifteen o's, two p's, one q, seven r's, twenty-six s's, nineteen t's, four u's, five v's, nine w's, two x's, four y's, and one z."
+
+## Contribution
+
+Feel free to contribute. No commit is too small.
+
+You should follow me: [@cpatuzzo](https://twitter.com/cpatuzzo)

data/lib/pangrammic_surplus.rb

@@ -0,0 +1,6 @@
+require 'numbers_and_words'
+
+require 'pangrammic_surplus/base'
+require 'pangrammic_surplus/minimal_count'
+require 'pangrammic_surplus/word_hash'
+require 'pangrammic_surplus/vector'

data/lib/pangrammic_surplus/base.rb

@@ -0,0 +1,9 @@
+class PangrammicSurplus
+  class << self
+
+    def for(input)
+      Vector.subtract(input, MinimalCount.for(input))
+    end
+
+  end
+end

data/lib/pangrammic_surplus/minimal_count.rb

@@ -0,0 +1,21 @@
+class PangrammicSurplus::MinimalCount
+  class << self
+
+    def for(input)
+      terms = input.map { |k, v| term(k, v) }
+      ps::Vector.add(*terms)
+    end
+
+    private
+    def term(character, count)
+      hash = ps::WordHash.for(count)
+      hash[character] += 1
+      hash
+    end
+
+    def ps
+      PangrammicSurplus
+    end
+
+  end
+end

data/lib/pangrammic_surplus/vector.rb

@@ -0,0 +1,18 @@
+class PangrammicSurplus::Vector
+  class << self
+
+    def add(*v)
+      first = v.first
+      first.inject({}) do |hash, (k, _)|
+        sum = v.map { |h| h[k] }.inject(:+)
+        hash.merge(k => sum)
+      end
+    end
+
+    def subtract(a, b)
+      _b = b.inject({}) { |h, (k, v)| h.merge(k => -v) }
+      add(a, _b)
+    end
+
+  end
+end

data/lib/pangrammic_surplus/word_hash.rb

@@ -0,0 +1,21 @@
+class PangrammicSurplus::WordHash
+  class << self
+
+    def for(integer)
+      @memo ||= {}
+      @memo[integer] ||= hash_for(integer)
+      @memo[integer].clone
+    end
+
+    private
+    def hash_for(integer)
+      term = integer.to_words
+      term += 's' if integer > 1
+
+      ('a'..'z').inject({}) do |h, c|
+        h.merge(c => term.count(c))
+      end
+    end
+
+  end
+end

metadata

@@ -0,0 +1,98 @@
+--- !ruby/object:Gem::Specification 
+name: pangrammic_surplus
+version: !ruby/object:Gem::Version 
+  hash: 29
+  prerelease: 
+  segments: 
+  - 0
+  - 0
+  - 1
+  version: 0.0.1
+platform: ruby
+authors: 
+- Christopher Patuzzo
+autorequire: 
+bindir: bin
+cert_chain: []
+
+date: 2012-10-20 00:00:00 Z
+dependencies: 
+- !ruby/object:Gem::Dependency 
+  name: numbers_and_words
+  prerelease: false
+  requirement: &id001 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        hash: 3
+        segments: 
+        - 0
+        version: "0"
+  type: :runtime
+  version_requirements: *id001
+- !ruby/object:Gem::Dependency 
+  name: rspec
+  prerelease: false
+  requirement: &id002 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        hash: 3
+        segments: 
+        - 0
+        version: "0"
+  type: :development
+  version_requirements: *id002
+description: Determines the surplus of characters that satisfies a self-enumerating pangram.
+email: chris@patuzzo.co.uk
+executables: []
+
+extensions: []
+
+extra_rdoc_files: []
+
+files: 
+- README.md
+- lib/pangrammic_surplus/base.rb
+- lib/pangrammic_surplus/minimal_count.rb
+- lib/pangrammic_surplus/vector.rb
+- lib/pangrammic_surplus/word_hash.rb
+- lib/pangrammic_surplus.rb
+homepage: https://github.com/cpatuzzo/pangrammic_surplus
+licenses: []
+
+post_install_message: 
+rdoc_options: []
+
+require_paths: 
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      hash: 3
+      segments: 
+      - 0
+      version: "0"
+required_rubygems_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      hash: 3
+      segments: 
+      - 0
+      version: "0"
+requirements: []
+
+rubyforge_project: 
+rubygems_version: 1.8.24
+signing_key: 
+specification_version: 3
+summary: Pangrammic Surplus
+test_files: []
+
+has_rdoc: