hash_math 1.0.0.pre.alpha → 1.0.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 298a64b54732cd96f7145ecba9b7e3a8e1424e4513609c75269cff8de9ebd039
-  data.tar.gz: 1fa6896667948c39b05169e232fd916d20a35ac6415e068195560a2552c2051d
+  metadata.gz: f7a08cd91f3734e6acb87f0bc2904be2501b6aa0e8ca07ee8d90e5dd8fe8bd17
+  data.tar.gz: 065d4819ce940caa4e7f7a9fb5132a8643bccdc363985292aa0fed5b5e68bf77
 SHA512:
-  metadata.gz: 7867d22fc5bd88a24adb3031706302621e5e3f2c8aae353cfe83e323fd8b7ba0d25afb86f1403c9e796899b90df6789a823a0139d833ed5ac87d899edef11d44
-  data.tar.gz: cc6703151537b76d44bd322e11a4b698e0829de8c250707611475b9959b7a30260c9aee328bedfea956db6142f339e57d5ca790294006378d4d65bd4f293b58f
+  metadata.gz: 9943d5a576a015330cbc315ae84b804f32ad2d24981c6e555e3fd4728000b2731ceedf40075a17de883cefce025e837f3b94e7224f3ac671232b98596d43e044
+  data.tar.gz: 4364b9f176d404f6e0538420c3786a36adb0af260e55ba735e3b4a8aaaa1884dc4e64fc1590b529883278e07c7cebf1a6694047c72b333e79e52df58b0854b03

data/README.md

@@ -5,8 +5,8 @@
 Ruby's Hash data structure is ubiquitous and highly flexible.  This library contains common Hash patterns widely used within our code-base:
 
 * Matrix: build a hash up then expand into hash products
-* Record: define a list of keys and base value to use as a blueprint for hashes
-* Table: key-value pair two-dimensional array of hash builder
+* Record: define a list of keys and a base value (for each key) to use as a blueprint for hashes
+* Table: key-value pair builder for constructing a two-dimensional array (rows by fields)
 
 See examples for more information on each data structure.
 
@@ -147,7 +147,7 @@ Notes:
 
 ### Table: The Double Hash (Hash of Hashes)
 
-HashMath::Table builds on top of HashMath::Record.  It constructs a table data-structure using a key-value pair builder method: `#add(row_id, field_id, key, value)`.  It ultimately outputs an array of Row objects where each Row object has a row_id and fields (field_id => value) hash.  The value proposition here is you can iterate over a key-value pair and construct each row any way you wish.
+HashMath::Table builds on top of HashMath::Record.  It constructs a table data-structure using a key-value pair builder method: `#add(row_id, field_id, value)`.  It ultimately outputs an array of Row objects where each Row object has a row_id and fields (field_id => value) hash.  The value proposition here is you can iterate over a key-value pair and construct each row any way you wish.
 
 Building on our Record example above:
 

data/lib/hash_math/version.rb

@@ -8,5 +8,5 @@
 #
 
 module HashMath
-  VERSION = '1.0.0-alpha'
+  VERSION = '1.0.0'
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: hash_math
 version: !ruby/object:Gem::Version
-  version: 1.0.0.pre.alpha
+  version: 1.0.0
 platform: ruby
 authors:
 - Matthew Ruggio
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2019-09-17 00:00:00.000000000 Z
+date: 2019-09-18 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: guard-rspec
@@ -156,9 +156,9 @@ required_ruby_version: !ruby/object:Gem::Requirement
       version: 2.3.8
 required_rubygems_version: !ruby/object:Gem::Requirement
   requirements:
-  - - ">"
+  - - ">="
     - !ruby/object:Gem::Version
-      version: 1.3.1
+      version: '0'
 requirements: []
 rubygems_version: 3.0.3
 signing_key: