frequency_enumerator 1.1.0 → 1.1.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 70333e9841e3e2cec403ba98ab23602e68f22f93
+  data.tar.gz: c2fc706f5f18564adbc91207950963b44a991ebb
+SHA512:
+  metadata.gz: a1b0a5a0cb89e078418d0dfbec5e8ee3d81f625d629189fa9af23f04c4dba2d31dfd94168bb7187abc4ffff2a34d393f84a2ac2c2da53d79f846668cf71cfd05
+  data.tar.gz: 353786051ff5f008a37694b9521cb73cd6bccefcfc8695e326580375f0298cb43b5c1c6a5d8cbd10ed041234746705a148e425d891046e5e92efd0e5a6bea836

data/README.md

@@ -18,7 +18,7 @@ We could use *maths* to solve this problem. Or we could brute-force it.
 
 For the latter, you'd go through every combination of these items and see which totalled £2.00. In this example, that'd take no time at all, but what if we're dealing with huge sums of money, or there are dozens of items? What if we're brute-forcing passwords?
 
-It helps to do some [frequency analysis](https://github.com/cpatuzzo/frequency_analyser) first.
+It helps to do some [frequency analysis](https://github.com/tuzz/frequency_analyser) first.
 
 You might discover, that in fact, almost no one drinks tea and everyone loves biscuits. You might ask a couple of hundred people and end up with a frequency distribution like this:
 

metadata

@@ -1,84 +1,62 @@
---- !ruby/object:Gem::Specification 
+--- !ruby/object:Gem::Specification
 name: frequency_enumerator
-version: !ruby/object:Gem::Version 
-  hash: 19
-  prerelease: 
-  segments: 
-  - 1
-  - 1
-  - 0
-  version: 1.1.0
+version: !ruby/object:Gem::Version
+  version: 1.1.1
 platform: ruby
-authors: 
-- Christopher Patuzzo
+authors:
+- Chris Patuzzo
 autorequire: 
 bindir: bin
 cert_chain: []
-
-date: 2012-10-20 00:00:00 Z
-dependencies: 
-- !ruby/object:Gem::Dependency 
+date: 2013-03-23 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
   name: rspec
-  prerelease: false
-  requirement: &id001 !ruby/object:Gem::Requirement 
-    none: false
-    requirements: 
-    - - ">="
-      - !ruby/object:Gem::Version 
-        hash: 3
-        segments: 
-        - 0
-        version: "0"
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
   type: :development
-  version_requirements: *id001
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
 description: Yields hashes that correlate with the given frequency distribution.
 email: chris@patuzzo.co.uk
 executables: []
-
 extensions: []
-
 extra_rdoc_files: []
-
-files: 
+files:
 - README.md
 - lib/frequency_enumerator/base.rb
 - lib/frequency_enumerator/composer.rb
 - lib/frequency_enumerator/decomposer.rb
 - lib/frequency_enumerator/sorter.rb
 - lib/frequency_enumerator.rb
-homepage: https://github.com/cpatuzzo/frequency_enumerator
+homepage: https://github.com/tuzz/frequency_enumerator
 licenses: []
-
+metadata: {}
 post_install_message: 
 rdoc_options: []
-
-require_paths: 
+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"
+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: 1.8.24
+rubygems_version: 2.0.0
 signing_key: 
-specification_version: 3
+specification_version: 4
 summary: Frequency Enumerator
 test_files: []
-
-has_rdoc: