hash_helper 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: e0460b7d22c2c95b723f38f0ccf08230d10162b2ca9b55f50c84a109fd6991bd
+  data.tar.gz: ff11482c043c447f6c67786e5430188aa3f9c90adaa6ad9b901e3aad860da556
+SHA512:
+  metadata.gz: de1087e25f9ea6aaa315d7c087683d4e2b8a9d5e4ace4abac428f5f519762a0fb1d55fbe28f763c28420731d880433bb5c885ebfa56d67afb756ef822945130e
+  data.tar.gz: a408206902cfe0c1e56722f6aa7cb3e375531b7f02ebb4814b9af44fe4d37cdba387a59550266dd012fedb9df813d2f63ee000cc5201f7fbae78c76774730e72

data/.rspec

@@ -0,0 +1,3 @@
+--format documentation
+--color
+--require spec_helper

data/CHANGELOG.md

@@ -0,0 +1,5 @@
+## [Unreleased]
+
+## [0.1.0] - 2024-12-17
+
+- Initial release

data/CODE_OF_CONDUCT.md

@@ -0,0 +1,84 @@
+# Contributor Covenant Code of Conduct
+
+## Our Pledge
+
+We as members, contributors, and leaders pledge to make participation in our community a harassment-free experience for everyone, regardless of age, body size, visible or invisible disability, ethnicity, sex characteristics, gender identity and expression, level of experience, education, socio-economic status, nationality, personal appearance, race, religion, or sexual identity and orientation.
+
+We pledge to act and interact in ways that contribute to an open, welcoming, diverse, inclusive, and healthy community.
+
+## Our Standards
+
+Examples of behavior that contributes to a positive environment for our community include:
+
+* Demonstrating empathy and kindness toward other people
+* Being respectful of differing opinions, viewpoints, and experiences
+* Giving and gracefully accepting constructive feedback
+* Accepting responsibility and apologizing to those affected by our mistakes, and learning from the experience
+* Focusing on what is best not just for us as individuals, but for the overall community
+
+Examples of unacceptable behavior include:
+
+* The use of sexualized language or imagery, and sexual attention or
+  advances of any kind
+* Trolling, insulting or derogatory comments, and personal or political attacks
+* Public or private harassment
+* Publishing others' private information, such as a physical or email
+  address, without their explicit permission
+* Other conduct which could reasonably be considered inappropriate in a
+  professional setting
+
+## Enforcement Responsibilities
+
+Community leaders are responsible for clarifying and enforcing our standards of acceptable behavior and will take appropriate and fair corrective action in response to any behavior that they deem inappropriate, threatening, offensive, or harmful.
+
+Community leaders have the right and responsibility to remove, edit, or reject comments, commits, code, wiki edits, issues, and other contributions that are not aligned to this Code of Conduct, and will communicate reasons for moderation decisions when appropriate.
+
+## Scope
+
+This Code of Conduct applies within all community spaces, and also applies when an individual is officially representing the community in public spaces. Examples of representing our community include using an official e-mail address, posting via an official social media account, or acting as an appointed representative at an online or offline event.
+
+## Enforcement
+
+Instances of abusive, harassing, or otherwise unacceptable behavior may be reported to the community leaders responsible for enforcement at tobias.knudsen@gmail.com. All complaints will be reviewed and investigated promptly and fairly.
+
+All community leaders are obligated to respect the privacy and security of the reporter of any incident.
+
+## Enforcement Guidelines
+
+Community leaders will follow these Community Impact Guidelines in determining the consequences for any action they deem in violation of this Code of Conduct:
+
+### 1. Correction
+
+**Community Impact**: Use of inappropriate language or other behavior deemed unprofessional or unwelcome in the community.
+
+**Consequence**: A private, written warning from community leaders, providing clarity around the nature of the violation and an explanation of why the behavior was inappropriate. A public apology may be requested.
+
+### 2. Warning
+
+**Community Impact**: A violation through a single incident or series of actions.
+
+**Consequence**: A warning with consequences for continued behavior. No interaction with the people involved, including unsolicited interaction with those enforcing the Code of Conduct, for a specified period of time. This includes avoiding interactions in community spaces as well as external channels like social media. Violating these terms may lead to a temporary or permanent ban.
+
+### 3. Temporary Ban
+
+**Community Impact**: A serious violation of community standards, including sustained inappropriate behavior.
+
+**Consequence**: A temporary ban from any sort of interaction or public communication with the community for a specified period of time. No public or private interaction with the people involved, including unsolicited interaction with those enforcing the Code of Conduct, is allowed during this period. Violating these terms may lead to a permanent ban.
+
+### 4. Permanent Ban
+
+**Community Impact**: Demonstrating a pattern of violation of community standards, including sustained inappropriate behavior,  harassment of an individual, or aggression toward or disparagement of classes of individuals.
+
+**Consequence**: A permanent ban from any sort of public interaction within the community.
+
+## Attribution
+
+This Code of Conduct is adapted from the [Contributor Covenant][homepage], version 2.0,
+available at https://www.contributor-covenant.org/version/2/0/code_of_conduct.html.
+
+Community Impact Guidelines were inspired by [Mozilla's code of conduct enforcement ladder](https://github.com/mozilla/diversity).
+
+[homepage]: https://www.contributor-covenant.org
+
+For answers to common questions about this code of conduct, see the FAQ at
+https://www.contributor-covenant.org/faq. Translations are available at https://www.contributor-covenant.org/translations.

data/Gemfile

@@ -0,0 +1,12 @@
+# frozen_string_literal: true
+
+source "https://rubygems.org"
+
+# Specify your gem's dependencies in hash_helper.gemspec
+gemspec
+
+gem "rake", "~> 13.0"
+
+gem "rspec", "~> 3.0"
+
+gem 'activesupport', '>= 6.0'

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2024 Tobias Knudsen
+
+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,126 @@
+# HashHelper Gem
+
+`HashHelper` is a versatile Ruby gem providing powerful utility modules for deeply nested hashes. It simplifies common operations such as deep inversion, normalization, summation, percentage calculations, and converting arrays into nested hash structures. This gem automatically extends `Hash` and `Array` with the provided methods, allowing you to seamlessly manipulate nested data.
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'hash_helper'
+```
+
+And then execute:
+
+```bash
+$ bundle install
+```
+
+Or install it yourself as:
+
+```bash
+$ gem install hash_helper
+```
+
+## Features
+
+### 1. DeepInvert
+
+Deeply inverts a hash, reversing the nesting structure.
+
+**Example:**
+
+```ruby
+hash = { a: { b: { c: 1 } }, d: { e: 2 } }
+inverted = hash.deep_invert
+# Result: { c: { b: { a: 1 } }, e: { d: 2 } }
+```
+
+---
+
+### 2. DeepNormalize
+
+Recursively normalizes a hash by ensuring all layers in the nested structure contain the same keys, merging it with a default structure to fill in any missing keys or values.
+
+**Example:**
+
+```ruby
+hash = { a: { x: 1, y: 2 }, b: { z: 3 } }
+normalized = hash.deep_normalize(default_value: 0)
+# Result: { a: { x: 1, y: 2, z: 0 }, b: { x: 0, y: 0, z: 3 } }
+```
+
+---
+
+### 3. DeepSum
+
+Calculates the sum of all numeric values in a nested hash or array.
+
+**Example:**
+
+```ruby
+hash = {
+  a: 1,
+  b: { c: 2, d: { e: 3, f: 4 } },
+  g: [5, { h: 6, i: { j: 7 } }]
+}
+result = hash.deep_sum
+# Result: 28
+```
+
+---
+
+### 4. Percentage
+
+Transforms numeric values in a hash into percentages relative to a layer or the entire structure.
+
+**Example:**
+
+```ruby
+hash = { a: 50, b: { c: 30, d: 20 }, e: 100 }
+
+# Global percentages
+percentages = hash.deep_transform_values_to_percentages(relative: false)
+# Result: { a: 25.0, b: { c: 15.0, d: 10.0 }, e: 50.0 }
+
+# Relative percentages
+relative_percentages = hash.deep_transform_values_to_percentages(relative: true)
+# Result: { a: 25.0, b: { c: 60.0, d: 40.0 }, e: 50.0 }
+```
+
+---
+
+### 5. ToNestedH
+
+Converts a nested array into a nested hash with a default value at leaf nodes.
+
+**Example:**
+
+```ruby
+nested_array = [[:a, :b], [:x, :y], [:m, :n]]
+nested_hash = nested_array.to_nested_h(value: "leaf")
+# Result:
+# {
+#   a: { x: { m: "leaf", n: "leaf" }, y: { m: "leaf", n: "leaf" } },
+#   b: { x: { m: "leaf", n: "leaf" }, y: { m: "leaf", n: "leaf" } }
+# }
+```
+
+## Usage
+
+The gem automatically extends `Hash` and `Array` with the provided methods. You can use them directly:
+
+```ruby
+require 'hash_helper'
+
+hash = { a: { b: { c: 1 } } }
+puts hash.deep_invert
+```
+
+## Contributing
+
+Bug reports and pull requests are welcome on GitHub at [https://github.com/Synsbasen/hash\_helper](https://github.com/Synsbasen/hash_helper).
+
+## License
+
+The gem is available as open-source under the terms of the [MIT License](https://opensource.org/licenses/MIT).

data/Rakefile

@@ -0,0 +1,8 @@
+# frozen_string_literal: true
+
+require "bundler/gem_tasks"
+require "rspec/core/rake_task"
+
+RSpec::Core::RakeTask.new(:spec)
+
+task default: :spec

data/lib/hash_helper/deep_invert.rb

@@ -0,0 +1,59 @@
+module HashHelper
+  module DeepInvert
+    # Deeply inverts a hash, creating a new structure where the values in the original
+    # hash are moved outward, and the keys are reversed in the nesting.
+    #
+    # @return [Hash] A new hash with the keys and values deeply inverted.
+    #
+    # @example Deeply invert a nested hash
+    #   hash = { a: { b: { c: 1 } }, d: { e: 2 } }
+    #   hash.extend(HashHelper::DeepInvert)
+    #   inverted = hash.deep_invert
+    #   # Result: { c: { b: { a: 1 } }, e: { d: 2 } }
+    def deep_invert
+      each_with_object({}) do |(outer_key, outer_value), result|
+        traverse_and_invert(outer_value, [outer_key], result)
+      end
+    end
+
+    private
+
+    # Recursively traverses and inverts a nested hash, tracking the full key path.
+    #
+    # This method traverses through the current hash and builds an inverted structure
+    # in the result hash. It uses the key path to reverse the nesting and assign values.
+    #
+    # @param [Hash] current_hash The hash being traversed.
+    # @param [Array] path The path of keys leading to the current value.
+    # @param [Hash] result The hash being built with the inverted structure.    def traverse_and_invert(current_hash, path, result)
+    def traverse_and_invert(current_hash, path, result)
+      current_hash.each do |key, value|
+        if value.is_a?(Hash)
+          traverse_and_invert(value, path + [key], result)
+        else
+          insert_inverted_path(result, path + [key], value)
+        end
+      end
+    end
+
+    # Inserts a value into the inverted structure at the specified key path.
+    #
+    # This method traverses the `result` hash using the reversed key path,
+    # creating nested structures as necessary, and assigns the value to the outermost key.
+    #
+    # @param [Hash] result The hash where the inverted structure is being built.
+    # @param [Array] keys The reversed key path to the value.
+    # @param [Object] value The value to assign at the end of the key path.
+    def insert_inverted_path(result, keys, value)
+      current = result
+
+      # Last key (leaf) holds the outer key and value
+      keys[1..-1].reverse.each do |key|
+        current[key] ||= {}
+        current = current[key]
+      end
+
+      current[keys.first] = value
+    end
+  end
+end

data/lib/hash_helper/deep_normalize.rb

@@ -0,0 +1,52 @@
+require "active_support/core_ext/hash/deep_merge"
+
+module HashHelper
+  module DeepNormalize
+    # Recursively normalizes the hash by merging it with a default structure.
+    #
+    # This method creates a nested default structure based on the keys of the hash,
+    # assigning each key a specified default value. The resulting structure is then
+    # deeply merged with the original hash.
+    #
+    # @param [Object] default_value The value to assign as the default for all keys
+    #   in the normalized structure. Defaults to `nil`.
+    # @return [Hash] A new hash that combines the default structure and the original hash.
+    #
+    # @example Normalize a hash with default values
+    #   hash = { a: { x: 1, y: 2 }, b: { z: 3 } }
+    #   hash.extend(HashHelper::DeepNormalize)
+    #   normalized = hash.deep_normalize(default_value: 0)
+    #   # Result: { a: { x: 1, y: 2, z: 0 }, b: { x: 0, y: 0, z: 3 } }
+    def deep_normalize(default_value: nil)
+      build_default(self, default_value: default_value).deep_merge(self)
+    end
+
+    private
+
+    # Builds a default hash structure recursively based on the given hash's keys.
+    #
+    # This method traverses the nested structure of the hash, constructing a new
+    # hash where each key is assigned the specified default value. If the original
+    # hash contains nested hashes, the method merges those nested hashes to create
+    # a template for the default structure.
+    #
+    # @param [Hash] obj The hash for which to create a default structure.
+    # @param [Object] default_value The value to assign as the default for all keys
+    #   in the default structure. Defaults to `nil`.
+    # @return [Hash] A new hash with the default structure.
+    #
+    # @example Build a default structure
+    #   hash = { a: { x: 1, y: 2 }, b: { z: 3 } }
+    #   build_default(hash, default_value: 0)
+    #   # Result: { a: { x: 0, y: 0, z: 0 }, b: { x: 0, y: 0, z: 0 } }
+    def build_default(obj, default_value: nil)
+      return obj.transform_values { default_value } unless obj.values.first.is_a?(Hash)
+
+      # Merge all nested hashes into a single "template"
+      merged_template = obj.values.reduce(&:deep_merge)
+
+      # Recursively build the default hash for all keys
+      obj.keys.product([build_default(merged_template, default_value: default_value)]).to_h
+    end
+  end
+end

data/lib/hash_helper/deep_sort.rb

@@ -0,0 +1,45 @@
+module HashHelper
+  module DeepSort
+    # Recursively sorts the hash by keys in lexicographic order.
+    #
+    # @return [Hash] A new hash with keys sorted lexicographically.
+    #
+    # @example Sort a flat hash
+    #   { "b" => 1, "a" => 2, "c" => 3 }.deep_sort
+    #   # => { "a" => 2, "b" => 1, "c" => 3 }
+    #
+    # @example Sort a nested hash
+    #   { "b" => { "d" => 2, "c" => 1 }, "a" => { "e" => 3, "f" => 4 } }.deep_sort
+    #   # => { "a" => { "e" => 3, "f" => 4 }, "b" => { "c" => 1, "d" => 2 } }
+    def deep_sort
+      deep_sort_by { |key, _value| key }
+    end
+    
+    # Recursively sorts the hash by a custom block.
+    #
+    # @yieldparam [String, Symbol] key The current key being evaluated for sorting.
+    # @yieldparam [Object] value The current value associated with the key.
+    # @return [Hash] A new hash with keys sorted based on the provided block.
+    #
+    # @example Sort by key length
+    #   { "apple" => 1, "pear" => 2 }.deep_sort_by { |key, _value| key.length }
+    #   # => { "pear" => 2, "apple" => 1 }
+    #
+    # @example Sort by value
+    #   { "a" => 3, "b" => 1 }.deep_sort_by { |_key, value| value }
+    #   # => { "b" => 1, "a" => 3 }
+    #
+    # @example Place 'null' at the end
+    #   { "b" => 1, "a" => 2, "null" => 3 }.deep_sort_by { |key, _value| key == "null" ? 1 : 0 }
+    #   # => { "a" => 2, "b" => 1, "null" => 3 }
+    def deep_sort_by(&block)
+      sorted_pairs = sort_by do |key, value|
+        block.call(key, value.is_a?(Hash) ? nil : value)
+      end
+  
+      sorted_pairs.each_with_object({}) do |(key, value), result|
+        result[key] = value.is_a?(Hash) ? value.deep_sort_by(&block) : value
+      end
+    end
+  end
+end

data/lib/hash_helper/deep_sum.rb

@@ -0,0 +1,26 @@
+module HashHelper
+  module DeepSum
+    # This method calculates the sum of all numeric values in a nested Hash or Array.
+    # It recursively traverses the data structure to find and sum up all numbers.
+    #
+    # @example Example with nested hashes and arrays:
+    #   hash = {
+    #     a: 1,
+    #     b: { c: 2, d: { e: 3, f: 4 } },
+    #     g: [5, { h: 6, i: { j: 7 } }]
+    #   }
+    #   hash.deep_sum # => 28
+    def deep_sum
+      sum do |_, value|
+        case value
+        when Hash
+          value.deep_sum
+        when Array
+          value.sum { |v| v.is_a?(Hash) ? v.deep_sum : v.to_f }
+        else
+          value.to_f
+        end
+      end
+    end
+  end
+end

data/lib/hash_helper/percentage.rb

@@ -0,0 +1,47 @@
+require 'active_support/core_ext/hash/deep_transform_values'
+require_relative "deep_sum"
+
+module HashHelper
+  module Percentage
+    include HashHelper::DeepSum
+
+    # Transforms all numeric values in the hash into percentages.
+    #
+    # @param [Boolean] relative If `true`, calculates percentages relative to the current layer.
+    #   If `false`, calculates percentages relative to the entire hash. Defaults to `true`.
+    # @param [Integer, nil] precision The number of decimal places to round the percentages to. Defaults to no rounding.
+    # @return [Hash] A new hash with numeric values transformed into percentages.
+    #
+    # @example Global percentages (relative: false)
+    #   { a: 50, b: { c: 30, d: 20 }, e: 100 }.deep_transform_values_to_percentages
+    #   # => { a: 25.0, b: { c: 15.0, d: 10.0 }, e: 50.0 }
+    #
+    # @example Relative percentages for each layer (relative: true)
+    #   { a: 50, b: { c: 30, d: 20 }, e: 100 }.deep_transform_values_to_percentages(relative: true)
+    #   # => { a: 50.0, b: { c: 60.0, d: 40.0 }, e: 100.0 }
+    def deep_transform_values_to_percentages(relative: true, precision: nil)
+      total_sum = deep_sum
+
+      calculate_percentage = lambda do |value|
+        return value unless value.is_a?(Numeric)
+        return value unless total_sum.positive?
+
+        percentage = (value / total_sum.to_f * 100)
+        precision ? percentage.round(precision) : percentage
+      end
+
+      unless relative
+        return deep_transform_values { |value| calculate_percentage.call(value) }
+      end
+
+      transform_values do |value|
+        case value
+        when Hash
+          value.deep_transform_values_to_percentages(relative: relative, precision: precision)
+        else
+          calculate_percentage.call(value)
+        end
+      end
+    end
+  end
+end

data/lib/hash_helper/to_nested_h.rb

@@ -0,0 +1,32 @@
+module HashHelper
+  module ToNestedH
+    # Converts a nested array into a nested hash with a default value at leaf nodes.
+    # Each array in the input represents a level of keys in the resulting hash.
+    #
+    # @param [Object] value The default value to assign to the leaf nodes (default: nil).
+    # @return [Hash] A nested hash structure with the specified default value at the leaves.
+    #
+    # @example Single level array
+    #   [[:a, :b]].to_nested_h
+    #   # => {:a => nil, :b => nil}
+    #
+    # @example Two levels of nesting
+    #   [[:a, :b], [:x, :y]].to_nested_h(value: 0)
+    #   # => {:a => {:x => 0, :y => 0}, :b => {:x => 0, :y => 0}}
+    #
+    # @example Multiple levels of nesting
+    #   [[:a, :b], [:x, :y], [:m, :n]].to_nested_h(value: "leaf")
+    #   # => {
+    #   #   :a => { :x => { :m => "leaf", :n => "leaf" }, :y => { :m => "leaf", :n => "leaf" } },
+    #   #   :b => { :x => { :m => "leaf", :n => "leaf" }, :y => { :m => "leaf", :n => "leaf" } }
+    #   # }
+    def to_nested_h(value: nil)
+      return {} if empty?
+      return first.product([value]).to_h if size == 1
+
+      first.map do |key|
+        [key, self[1..].to_nested_h(value: value)]
+      end.to_h
+    end
+  end
+end

data/lib/hash_helper/version.rb

@@ -0,0 +1,5 @@
+# frozen_string_literal: true
+
+module HashHelper
+  VERSION = "0.1.0"
+end

data/lib/hash_helper.rb

@@ -0,0 +1,24 @@
+# frozen_string_literal: true
+
+require_relative "hash_helper/version"
+require_relative "hash_helper/deep_sum"
+require_relative "hash_helper/deep_invert"
+require_relative "hash_helper/deep_normalize"
+require_relative "hash_helper/percentage"
+require_relative "hash_helper/to_nested_h"
+require_relative "hash_helper/deep_sort"
+
+module HashHelper
+end
+
+class Hash
+  include HashHelper::DeepSum
+  include HashHelper::DeepInvert
+  include HashHelper::DeepNormalize
+  include HashHelper::Percentage
+  include HashHelper::DeepSort
+end
+
+class Array
+  include HashHelper::ToNestedH
+end

data/sig/hash_helper.rbs

@@ -0,0 +1,4 @@
+module HashHelper
+  VERSION: String
+  # See the writing guide of rbs: https://github.com/ruby/rbs#guides
+end

metadata

@@ -0,0 +1,82 @@
+--- !ruby/object:Gem::Specification
+name: hash_helper
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- Jimmy Poulsen
+- Tobias Knudsen
+autorequire:
+bindir: exe
+cert_chain: []
+date: 2024-12-18 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: activesupport
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '7.0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '7.0'
+description: HashHelper is a collection of advanced helper methods for Ruby hashes.
+  It provides tools for deep inversion, normalization, percentage calculations, recursive
+  operations, sorting, validation, linear regression, and much more. HashHelper is
+  designed to simplify complex hash manipulations with clean, reusable methods. Extend
+  the power of the Hash class seamlessly!
+email:
+- jimmypoulsen96@gmail.com
+- tobias.knudsen@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".rspec"
+- CHANGELOG.md
+- CODE_OF_CONDUCT.md
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- lib/hash_helper.rb
+- lib/hash_helper/deep_invert.rb
+- lib/hash_helper/deep_normalize.rb
+- lib/hash_helper/deep_sort.rb
+- lib/hash_helper/deep_sum.rb
+- lib/hash_helper/percentage.rb
+- lib/hash_helper/to_nested_h.rb
+- lib/hash_helper/version.rb
+- sig/hash_helper.rbs
+homepage: https://github.com/Synsbasen/hash_helper
+licenses:
+- MIT
+metadata:
+  homepage_uri: https://github.com/Synsbasen/hash_helper
+  source_code_uri: https://github.com/Synsbasen/hash_helper
+  changelog_uri: https://github.com/Synsbasen/hash_helper
+post_install_message:
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: 2.6.0
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubygems_version: 3.4.6
+signing_key:
+specification_version: 4
+summary: Advanced utility methods for working with nested and complex hashes in Ruby.
+test_files: []