deeper_hash 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: 5d1ef6b02dd166070be15cb75cad60aa6a613d310f1e64638b9bace1c540f7f1
+  data.tar.gz: 4cad788494e23a76d79dce3d0e5e437cb58bfad322acfdd066d0a4eee792e7bb
+SHA512:
+  metadata.gz: 58f67f87bfa15f38274caed83a85af1a8f688f6b2ef24d0d2e37cc27bd6598bbf6b6977fd978950178c4a8e6f5e2d3ddea046226e85ab74d521c35316e7e81a5
+  data.tar.gz: ae2664777bfcb82adbc83f5053792810d2448f83e861aae5126d96af2ab8cd4a0d1a0a98d7af77e41a9550c7bf34200a66fb313ca0b9157ef7cc9e301c0b8d47

data/CHANGELOG.md

@@ -0,0 +1,5 @@
+## [Unreleased]
+
+## [0.1.0] - 2022-10-04
+
+- 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 dominik.sito@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,8 @@
+# frozen_string_literal: true
+
+source "https://rubygems.org"
+
+# Specify your gem's dependencies in deephash.gemspec
+gemspec
+
+gem "rake", "~> 13.0"

data/Gemfile.lock

@@ -0,0 +1,34 @@
+PATH
+  remote: .
+  specs:
+    deeper_hash (0.1.0)
+      ttyhue (~> 0.1.2)
+
+GEM
+  remote: https://rubygems.org/
+  specs:
+    ansi (1.5.0)
+    builder (3.2.4)
+    minitest (5.16.3)
+    minitest-reporters (1.5.0)
+      ansi
+      builder
+      minitest (>= 5.0)
+      ruby-progressbar
+    rake (13.0.6)
+    ruby-progressbar (1.11.0)
+    shoulda-context (2.0.0)
+    ttyhue (0.1.2)
+
+PLATFORMS
+  x86_64-linux
+
+DEPENDENCIES
+  deeper_hash!
+  minitest (= 5.16.3)
+  minitest-reporters (= 1.5.0)
+  rake (~> 13.0)
+  shoulda-context (= 2.0.0)
+
+BUNDLED WITH
+   2.3.22

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2022 Dominik Sito
+
+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,336 @@
+# DeepHash
+
+Set of utility methods for vanilia ruby `Hash` providing a way of handling, transforming, diffing it in a Tree-like manner. 
+
+## Installation
+
+Install the gem and add to the application's Gemfile by executing:
+
+    $ bundle add deeper_hash
+
+If bundler is not being used to manage dependencies, install the gem by executing:
+
+    $ gem install deeper_hash
+
+## Usage
+
+```ruby
+require 'deeper_hash'
+```
+
+## Methods
+
+### #deep_include?
+
+Same as `Hash#include?` but fully recursive:
+
+```ruby
+hash = {
+  a: 1,
+  b: {
+    c: 1,
+    d: 2
+  }
+}
+
+hash.deep_include?(a: 1, b: { c: 1 }) #=> true
+hash.deep_include?(a: 1, b: { c: 2 }) #=> false
+
+```
+
+### #deep_merge
+
+Adding or replacing both root and nested values:
+
+```ruby
+hash = {
+  a: 1,
+  b: 2,
+  c: {
+    d: 1,
+    e: 2
+  }
+}
+
+hash.deep_merge(
+  b: 3,
+  c: {
+    e: 4,
+    f: 5
+  }
+)
+#  #=> {
+#    a: 1,
+#    b: 3,
+#    c: {
+#      d: 1,
+#      e: 4,
+#      f: 5
+#    }
+#  }
+```
+
+### #deep_select
+
+Filtering `Hash` based on key/value pairs with non-hash values:
+
+```ruby
+hash = {
+  a: 1,
+  b: 10,
+  c: {
+    d: 11,
+    e: 2,
+    f: {
+      g: 12,
+      h: 4
+    },
+    i: {
+      j: 15
+    }
+  }
+}
+
+hash.deep_select { |k,v| [:a, :e, :h].include?(k) }
+#  #=> {
+#    a: 1,
+#    c: {
+#      e: 2,
+#      f: {
+#        h: 4
+#      }
+#    }
+#  }
+
+hash.deep_select { |k,v| v > 9 }
+#  #=> {
+#    b: 10,
+#    c: {
+#      d: 11,
+#      f: { 
+#        g: 12
+#      },
+#      i: {
+#        j: 15
+#      }
+#    }
+#  }
+```
+
+### #deep_reject
+
+Inverse of `#deep_select`
+
+### #deep_transform_keys
+
+Same as `Hash#transform_keys` but fully recursive:
+
+```ruby
+hash = {
+  a: 1,
+  b: {
+    c: 2,
+    d: 3
+  }
+}
+
+hash.deep_transform_keys { |k| "prefix_#{k}".to_sym }
+#  #=> {
+#    prefix_a: 1,
+#    prefix_b: {
+#      prefix_c: 2,
+#      prefix_d: 3
+#    }
+#  }
+```
+
+### #deep_transform_values
+
+Same as `Hash#transform_values` but fully recursive:
+
+```ruby
+hash = {
+  a: 1,
+  b: {
+    c: 2,
+    d: 3
+  }
+}
+
+hash.deep_transform_values { |k,v| v + 10 }
+#  #=> {
+#    a: 10,
+#    b: {
+#      c: 12,
+#      d: 13
+#    }
+#  }
+```
+
+## Diffing
+
+### #diff
+
+Presents difference between two hashes at any level returning `Hash` object with all changes.
+
+### #draw_diff
+
+Returns the diff as git-like colored string.
+
+```ruby
+hash1 = {
+  foo: "bar",
+  fiz: "biz",
+  fez: "cez",
+  a: {
+    b: 10,
+    c: 2
+  }
+}
+
+hash2 = {
+  foo: "bar",
+  fiz: "biz",
+  faz: "caz",
+  a: {
+    b: 1,
+    c: 2,
+    d: 12
+  }
+}
+
+hash1.diff(hash2)
+#  #=> {
+#    :removed_key=>[[:fez, "cez"]],
+#    :added_key=>[[:faz, "caz"]],
+#    :a=>{
+#      :b=>{ :updated_val=>{:from=>10, :to=>1} },
+#      :added_key=>[[:d, 12]]
+#    }
+#  }
+
+puts hash1.draw_diff(hash2)
+```
+![screenshot](https://raw.githubusercontent.com/railis/deeper_hash/master/examples/example1.png)
+
+Also works with `Array` values:
+
+```ruby
+hash1 = {
+  foo: "bar",
+  fiz: [1, 2, 3]
+}
+
+hash2 = {
+  foo: "bar",
+  fiz: [2, 2, 3, 4]
+}
+
+hash1.diff(hash2)
+#  #=> {
+#    :fiz=>{
+#      :updated_arr=>{
+#        :arr=>[1, 2, 3],
+#        :appended=>[4],
+#        :changed_el=>[{:from=>1, :to=>2, :index=>0}]
+#      }
+#    }
+#  }
+
+puts hash1.draw_diff(hash2)
+```
+![screenshot](https://raw.githubusercontent.com/railis/deeper_hash/master/examples/example2.png)
+
+The diff can traverse across entire `Hash` until reaching deepest level. Eg: `Array` values with `Hash` elements, containing other `Arrays` and `Hashes`:
+
+```ruby
+hash1 = {
+  foo: "bar",
+  fiz: [
+    1,
+    {
+      a: 1,
+      b: [
+        "alpha",
+        "beta"
+      ]
+    },
+    3
+  ]
+}
+
+hash2 = {
+  foo: "bar",
+  fiz: [
+    2,
+    {
+      a: 2,
+      b: [
+        "alpha",
+        "betav2",
+        "gamma"
+      ]
+    },
+    3
+  ]
+}
+
+hash1.diff(hash2)
+#  #=> {
+#    :fiz=>{
+#      :updated_arr=>{
+#        :arr=>[1,{:a=>1,:b=>["alpha","beta"]}, 3],
+#        :changed_el=>[
+#          {
+#            :from=>1,
+#            :to=>2,
+#            :index=>0
+#          },
+#          {
+#            :updated_hash=>{
+#              :a=>{:updated_val=>{:from=>1, :to=>2}},
+#              :b=>{
+#                :updated_arr=>{
+#                  :arr=>["alpha", "beta"],
+#                  :appended=>["gamma"],
+#                  :changed_el=>[
+#                    {:from=>"beta", :to=>"betav2", :index=>1}
+#                  ]
+#                }
+#              }
+#            },
+#            :index=>1
+#          }
+#        ]
+#      }
+#    }
+#  }
+
+puts hash1.draw_diff(hash2)
+```
+![screenshot](https://raw.githubusercontent.com/railis/deeper_hash/master/examples/example3.png)
+
+Diff output color can be formatted by overwriting styles: `content` `added` `removed` `changed`, eg:
+```ruby
+puts hash1.draw_diff(hash2, content: { fg: :white }, added: { fg: :lblue })
+```
+
+For more information about using styles and available color options, see [TTYHue](https://github.com/railis/ttyhue) ruby gem.
+
+## Development
+
+After checking out the repo, run `bin/setup` to install dependencies. 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`.
+
+## Contributing
+
+Bug reports and pull requests are welcome on [GitHub](https://github.com/railis/deeper_hash). This project is intended to be a safe, welcoming space for collaboration, and contributors are expected to adhere to the [code of conduct](https://github.com/[USERNAME]/deephash/blob/master/CODE_OF_CONDUCT.md).
+
+## License
+
+The gem is available as open source under the terms of the [MIT License](https://opensource.org/licenses/MIT).
+
+## Code of Conduct
+
+Everyone interacting in the Deephash project's codebases, issue trackers, chat rooms and mailing lists is expected to follow the [code of conduct](https://github.com/[USERNAME]/deeper_hash/blob/master/CODE_OF_CONDUCT.md).

data/Rakefile

@@ -0,0 +1,10 @@
+# frozen_string_literal: true
+
+require "rake/testtask"
+require "bundler/gem_tasks"
+
+task default: %i[]
+
+Rake::TestTask.new do |task|
+  task.pattern = "test/*_test.rb"
+end

data/deephash.gemspec

@@ -0,0 +1,32 @@
+# frozen_string_literal: true
+
+require_relative "lib/deeper_hash/version"
+
+Gem::Specification.new do |spec|
+  spec.name = "deeper_hash"
+  spec.version = DeeperHash::VERSION
+  spec.authors = ["Dominik Sito"]
+  spec.email = ["dominik.sito@gmail.com"]
+
+  spec.summary = "Set of utility methods for vanilia ruby Hash providing a way of handling, transforming, diffing it in a Tree-like manner."
+  spec.description = "Set of utility methods for vanilia ruby Hash providing a way of handling, transforming, diffing it in a Tree-like manner."
+  spec.homepage = "https://github.com/railis/deephash"
+  spec.license = "MIT"
+  spec.required_ruby_version = ">= 2.6.0"
+
+  spec.metadata["homepage_uri"] = spec.homepage
+  spec.metadata["source_code_uri"] = spec.homepage
+  spec.metadata["changelog_uri"] = "https://raw.githubusercontent.com/railis/deephash/master/CHANGELOG.md"
+
+  spec.files = Dir.chdir(__dir__) do
+    `git ls-files -z`.split("\x0").reject do |f|
+      (f == __FILE__) || f.match(%r{\A(?:(?:bin|test|spec|features)/|\.(?:git|travis|circleci)|appveyor)})
+    end
+  end
+  spec.require_paths = ["lib"]
+
+  spec.add_dependency "ttyhue", "~> 0.1.2"
+  spec.add_development_dependency "minitest", "5.16.3"
+  spec.add_development_dependency "minitest-reporters", "1.5.0"
+  spec.add_development_dependency "shoulda-context", "2.0.0"
+end

data/lib/deeper_hash/color_diff.rb

@@ -0,0 +1,134 @@
+require "ttyhue"
+
+module DeeperHash
+  class ColorDiff
+
+    INDENT_SIZE = 2
+
+    def initialize(h1, h2)
+      @diff = Diff.new(h1, h2).diff
+    end
+
+    def draw(color_opts = {})
+      @color_opts = {
+        added: { fg: :gui114 },
+        removed: { fg: :gui161 },
+        changed: { fg: :gui105 },
+        content: { fg: :gui241 }
+      }.merge(color_opts)
+      @use_indent = true
+      @indent = 0
+      @result_str = ""
+      draw_hash_diff(@diff)
+      @indent = 0
+      @result_str
+    end
+
+    private
+
+    def draw_added_key(k, v)
+      @result_str << color_f("{added}#{k}: #{v.inspect}\n", :add)
+    end
+
+    def draw_removed_key(k, v)
+      @result_str << color_f("{removed}#{k}: #{v.inspect}\n", :delete)
+    end
+
+    def draw_updated_value(from, to)
+      @result_str << color_f("{removed}#{from.inspect}{/removed} {changed}->{/changed} {added}#{to.inspect}{/added}\n", :change)
+    end
+
+    def draw_hash_diff(diff)
+      dup_diff = diff.dup
+      deleted = dup_diff.delete(:removed_key)
+      added = dup_diff.delete(:added_key)
+      if changed = dup_diff.delete(:updated_val)
+        draw_updated_value(changed[:from], changed[:to])
+        @use_indent = true
+      end
+      if updated_arr = dup_diff.delete(:updated_arr)
+        draw_array_diff(updated_arr)
+      end
+      unless @use_indent
+        @result_str << "\n"
+        @use_indent = true
+      end
+      dup_diff.each do |k, v|
+        if v[:updated_val] || v[:updated_arr]
+          @result_str << color_f("{content}#{k}: ", (:change if v[:updated_val]))
+          @use_indent = false
+          draw_hash_diff(v)
+        else
+          @result_str << color_f("{content}#{k}:\n")
+          @indent += 1
+          draw_hash_diff(v)
+          @indent -= 1
+        end
+      end
+      deleted.to_a.each do |k,v|
+        draw_removed_key(k, v)
+      end
+      added.to_a.each do |k,v|
+        draw_added_key(k, v)
+      end
+    end
+
+    def draw_array_diff(updated_arr)
+      base_arr =
+        if updated_arr[:detached]
+          updated_arr[:arr][0..-(updated_arr[:detached].size + 1)]
+        else
+          updated_arr[:arr]
+        end
+      @result_str << color_f("{content}[\n")
+      @use_indent = true
+      @indent += 1
+      base_arr.each_with_index do |e, idx|
+        change_on_index = updated_arr[:changed_el].to_a.select {|c| c[:index] == idx}.first
+        if change_on_index
+          if change_on_index[:updated_arr]
+            draw_array_diff(change_on_index[:updated_arr])
+          elsif change_on_index[:updated_hash]
+            @result_str << color_f("{content}{\n")
+            @indent += 1
+            draw_hash_diff(change_on_index[:updated_hash])
+            @indent -= 1
+            @result_str << color_f("{content}}\n")
+          else
+            draw_updated_value(change_on_index[:from], change_on_index[:to])
+          end
+        else
+          @result_str << color_f("{content}#{e.inspect}\n")
+        end
+      end
+      updated_arr[:detached].to_a.each { |e| @result_str << color_f("{removed}#{e.inspect}\n", :delete) }
+      updated_arr[:appended].to_a.each { |e| @result_str << color_f("{added}#{e.inspect}\n", :add) }
+      @indent -= 1
+      @result_str << color_f("{content}]\n")
+    end
+
+    def color_f(str, icon = nil)
+      icon_str =
+        case icon
+        when :add
+          colorize("{added}+ ")
+        when :delete
+          colorize("{removed}- ")
+        when :change
+          colorize("{changed}~ ")
+        else
+          colorize("{content}. ")
+        end
+      if @use_indent
+        icon_str + (" " * (@indent.to_i * INDENT_SIZE)) + colorize(str)
+      else
+        colorize(str)
+      end
+    end
+
+    def colorize(str)
+      TTYHue.c(str, @color_opts)
+    end
+
+  end
+end

data/lib/deeper_hash/diff.rb

@@ -0,0 +1,120 @@
+require "ttyhue"
+
+module DeeperHash
+  class Diff
+    class Stack
+      def initialize
+        @stack = []
+      end
+
+      def push(value)
+        @stack << value
+      end
+
+      def pop
+        return if @stack.empty?
+
+        @stack = @stack[0..-2]
+      end
+
+      def to_a
+        @stack
+      end
+    end
+
+    def initialize(h1, h2)
+      @h1 = h1
+      @h2 = h2
+    end
+
+    def diff
+      @diff_stack = Stack.new
+      @result = {}
+      @attr_change_log = []
+      process_diff(@h1, @h2)
+      @result
+    end
+
+    def process_diff(h1, h2)
+      process_diff_pair(h1, h2, :removed_key)
+      process_diff_pair(h2, h1, :added_key)
+    end
+
+    def process_diff_pair(h1, h2, action)
+      h1.each do |k,v|
+        next if attribute_change_logged?(k)
+
+        if h2[k]
+          if v != h2[k]
+            if v.is_a?(Hash) && h2[k].is_a?(Hash)
+              @diff_stack.push(k)
+              process_diff(v, h2[k])
+              @diff_stack.pop
+            else
+              if v.is_a?(Array) && h2[k].is_a?(Array)
+                @result.deep_set(arr_diff(v, h2[k]), *(@diff_stack.to_a + [k, :updated_arr]))
+              else
+                @result.deep_set({from: v, to: h2[k]}, *(@diff_stack.to_a + [k, :updated_val]))
+              end
+              log_attribute_change(k)
+            end
+          end
+        else
+          dir = @diff_stack.to_a + [action]
+          val = (@result.dig(*dir).is_a?(Array) ? @result.dig(*dir) : [])
+          val << [k, v]
+          @result.deep_set(val, *dir)
+          log_attribute_change(k)
+        end
+      end
+    end
+
+    def arr_diff(a1, a2)
+      if a1.size == a2.size
+        common_1 = a1; common_2 = a2; appended = []; detached = []
+      elsif a1.size > a2.size
+        if a2.size == 0
+          common_1 = []; common_2 = []; appended = []; detached = a1
+        else
+          common_1 = a1[0..(a2.size-1)]; common_2 = a2; appended = []; detached = a1[a2.size..-1]
+        end
+      else
+        if a1.size == 0
+          common_1 = []; common_2 = []; appended = a2; detached = []
+        else
+          common_1 = a1; common_2 = a2[0..(a1.size-1)]; appended = a2[a1.size..-1]; detached = []
+        end
+      end
+      {}.tap do |res|
+        res[:arr] = a1
+        res[:appended] = appended unless appended.empty?
+        res[:detached] = detached unless detached.empty?
+        unless common_1.empty?
+          common_1.each_with_index do |v, i|
+            val_1 = v
+            val_2 = common_2[i]
+            if val_1 != val_2
+              res[:changed_el] ||= []
+              if val_1.is_a?(Array) && val_2.is_a?(Array)
+                res[:changed_el] << {updated_arr: arr_diff(val_1, val_2), index: i}
+              elsif val_1.is_a?(Hash) && val_2.is_a?(Hash)
+                res[:changed_el] << {updated_hash: Diff.new(val_1, val_2).diff, index: i} 
+              else
+                res[:changed_el] << {from: val_1, to: val_2, index: i}
+              end
+            end
+          end
+        end
+      end
+    end
+
+    def log_attribute_change(attr)
+      @attr_change_log << @diff_stack.to_a + [attr]
+    end
+
+    def attribute_change_logged?(attr)
+      @attr_change_log.include?(@diff_stack.to_a + [attr])
+    end
+
+  end
+end

data/lib/deeper_hash/meta.rb

@@ -0,0 +1,84 @@
+module DeeperHash
+  class Meta
+
+    class << self
+
+      def transform_keys(hash, &block)
+        transform(hash, include_hash_values: true) do |k, v, h|
+          h[block.call(k)] = v
+        end
+      end
+
+      def transform_values(hash, &block)
+        transform(hash) do |k, v, h|
+          h[k] = block.call(v) unless v.is_a?(Hash)
+        end
+      end
+
+      def select(hash, &block)
+        transform(hash) do |k, v, h|
+          h[k] = v if block.call(k,v)
+        end
+      end
+
+      def reject(hash, &block)
+        transform(hash) do |k, v, h|
+          h[k] = v unless block.call(k,v)
+        end
+      end
+
+      def merge(hash, other_hash)
+        hash.dup.tap do |h|
+          other_hash.each do |k, v|
+            if h[k].is_a?(Hash) && v.is_a?(Hash)
+              h[k] = merge(h[k], v)
+            else
+              h[k] = v
+            end
+          end
+        end
+      end
+
+      def include?(hash, other_hash)
+        return true if hash == other_hash
+
+        other_hash.each do |k, v|
+          if hash[k].is_a?(Hash) && v.is_a?(Hash)
+            return false unless include?(hash[k], v)
+          else
+            return false unless hash[k] == v
+          end
+        end
+        true
+      end
+
+      def set(hash, value, keys)
+        keys[0..-2].inject(hash) do |acc, e|
+          acc[e] ||= {}
+        end[keys.last] = value
+      end
+
+      private
+
+      def transform(hash, opts = {}, &block)
+        {}.tap do |new_hash|
+          hash.each do |k,v|
+            case v
+            when Hash
+              nested_hash = transform(v, opts, &block)
+              if opts[:include_hash_values]
+                block.call(k, nested_hash, new_hash)
+              else
+                new_hash[k] = nested_hash unless nested_hash.empty?
+              end
+            else
+              block.call(k, v, new_hash)
+            end
+          end
+        end
+      end
+
+    end
+
+  end
+end

data/lib/deeper_hash/version.rb

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

data/lib/deeper_hash.rb

@@ -0,0 +1,44 @@
+# frozen_string_literal: true
+
+require_relative "deeper_hash/version"
+require_relative "deeper_hash/meta"
+require_relative "deeper_hash/diff"
+require_relative "deeper_hash/color_diff"
+
+module DeeperHash
+
+  %w[
+    transform_keys
+    transform_values
+    select
+    reject
+  ].each do |method|
+    define_method "deep_#{method}" do |&block|
+      Meta.send(method, self, &block)
+    end
+  end
+
+  %w[
+    merge
+    include?
+  ].each do |method|
+    define_method "deep_#{method}" do |value|
+      Meta.send(method, self, value)
+    end
+  end
+
+  def deep_set(value, *keys)
+    Meta.set(self, value, keys)
+  end
+
+  def diff(other_hash)
+    Diff.new(self, other_hash).diff
+  end
+
+  def draw_diff(other_hash, styles = {})
+    ColorDiff.new(self, other_hash).draw(styles)
+  end
+
+end
+
+Hash.send :include, DeeperHash

metadata

@@ -0,0 +1,120 @@
+--- !ruby/object:Gem::Specification
+name: deeper_hash
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- Dominik Sito
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2022-10-06 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: ttyhue
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 0.1.2
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 0.1.2
+- !ruby/object:Gem::Dependency
+  name: minitest
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - '='
+      - !ruby/object:Gem::Version
+        version: 5.16.3
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - '='
+      - !ruby/object:Gem::Version
+        version: 5.16.3
+- !ruby/object:Gem::Dependency
+  name: minitest-reporters
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - '='
+      - !ruby/object:Gem::Version
+        version: 1.5.0
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - '='
+      - !ruby/object:Gem::Version
+        version: 1.5.0
+- !ruby/object:Gem::Dependency
+  name: shoulda-context
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - '='
+      - !ruby/object:Gem::Version
+        version: 2.0.0
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - '='
+      - !ruby/object:Gem::Version
+        version: 2.0.0
+description: Set of utility methods for vanilia ruby Hash providing a way of handling,
+  transforming, diffing it in a Tree-like manner.
+email:
+- dominik.sito@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- CHANGELOG.md
+- CODE_OF_CONDUCT.md
+- Gemfile
+- Gemfile.lock
+- LICENSE.txt
+- README.md
+- Rakefile
+- deephash.gemspec
+- examples/example1.png
+- examples/example2.png
+- examples/example3.png
+- lib/deeper_hash.rb
+- lib/deeper_hash/color_diff.rb
+- lib/deeper_hash/diff.rb
+- lib/deeper_hash/meta.rb
+- lib/deeper_hash/version.rb
+homepage: https://github.com/railis/deephash
+licenses:
+- MIT
+metadata:
+  homepage_uri: https://github.com/railis/deephash
+  source_code_uri: https://github.com/railis/deephash
+  changelog_uri: https://raw.githubusercontent.com/railis/deephash/master/CHANGELOG.md
+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.3.22
+signing_key: 
+specification_version: 4
+summary: Set of utility methods for vanilia ruby Hash providing a way of handling,
+  transforming, diffing it in a Tree-like manner.
+test_files: []