hash-as-tree 0.0.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 48181687858a679f1ca8ac394e8df9b85d73a8e4
+  data.tar.gz: 2462500e3cebc6a79e3b858ec546ca7fb87a6197
+SHA512:
+  metadata.gz: e662810002cf4c3eaf8a47c048d681ba0b01a8794a9454679f78e4975c41d6b91421042897159b707ccf0239c00a9dc20d70c29b7b3ca8f4583406cc328b9e95
+  data.tar.gz: ece390faebd260ff64aafdad24f414397b17f7e51e7290fe260b730c65d09f5341fb17a3ed09cba94d8d5a529525242f3ee44977c33f8ee09872ab2500a9d693

data/lib/hash/as/tree.rb

@@ -0,0 +1,78 @@
+require 'to_proc/all'
+
+class Hash
+  module As
+    module Tree
+      refine Hash do
+        def traverse
+          return to_enum(__method__) unless block_given?
+
+          nodes = Queue.new
+          nodes.push Node.new value: self
+
+          until nodes.empty?
+            current_node = nodes.pop
+            yield current_node
+            current_node.children.each &[nodes, :push]
+          end
+        end
+
+        def rewrite
+          nodes, root_node = Queue.new, (Node.new value: self)
+          nodes.push root_node
+
+          until nodes.empty?
+            passed_node = nodes.pop
+            returned_node = yield passed_node
+
+            if passed_node == returned_node
+              passed_node.children.each &[nodes, :push]
+            else
+              passed_node.parent.value.delete passed_node.key
+              passed_node.parent.value[returned_node.key] = returned_node.value
+              returned_node.children.each &[nodes, :push]
+            end
+          end
+
+          root_node.to_h
+        end
+      end
+
+      class Node
+        def initialize value: nil, key: nil, parent: nil
+          @value, @key, @parent = value, key, parent
+        end
+        attr_accessor :value, :key, :parent
+
+        def to_h
+          if key
+            if value.is_a? Hash
+              { key => children.map(&:to_h).reduce(&:merge) }
+            else
+              { key => value }
+            end
+          else
+            children.map(&:to_h).reduce(&:merge)
+          end
+        end
+
+        def with **kwargs
+          Node.new \
+            value:  (kwargs[:value] or value),
+            key:    (kwargs[:key] or key),
+            parent: (kwargs[:parent] or parent)
+        end
+
+        def children
+          if value.is_a? Hash
+            value.map do |key, value|
+              Node.new value: value, key: key, parent: self
+            end
+          else
+            []
+          end
+        end
+      end
+    end
+  end
+end

metadata

@@ -0,0 +1,57 @@
+--- !ruby/object:Gem::Specification
+name: hash-as-tree
+version: !ruby/object:Gem::Version
+  version: 0.0.0
+platform: ruby
+authors:
+- Anatoly Chernow
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2017-01-15 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: to_proc
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 0.0.7
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 0.0.7
+description: 
+email: 
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/hash/as/tree.rb
+homepage: 
+licenses: []
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+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: 2.6.8
+signing_key: 
+specification_version: 4
+summary: A refinements for Hash to use it as a tree.
+test_files: []