tree_structure_digest 0.0.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 41d5a4f7e0d216beb3825460ec803daba17e58ce
+  data.tar.gz: 951b266f1b45e3205a8904b1f5485efc1e7ba559
+SHA512:
+  metadata.gz: eaa75ee033f765b0826264b7d917de6b92e1c6eb6153f062e6155211368c86510c1c445e62c9e29db440400aa0b1fb94b58650a09040c857ce3aba0deaf551b6
+  data.tar.gz: be606e2835481fc87331df89b2b4b62a84f6e27dae7b57d6af4c76b4c4024b5d9bd8c319fed8dee96008bc623f1dd27395feb36958e55105d1d31165453234c5

data/.gitignore

@@ -0,0 +1,17 @@
+*.gem
+*.rbc
+.bundle
+.config
+.yardoc
+Gemfile.lock
+InstalledFiles
+_yardoc
+coverage
+doc/
+lib/bundler/man
+pkg
+rdoc
+spec/reports
+test/tmp
+test/version_tmp
+tmp

data/Gemfile

@@ -0,0 +1,4 @@
+source 'https://rubygems.org'
+
+# Specify your gem's dependencies in tree_structure_digest.gemspec
+gemspec

data/LICENSE.txt

@@ -0,0 +1,22 @@
+Copyright (c) 2014 Mike Grafton and Sara Tansey
+
+MIT License
+
+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,32 @@
+# TreeStructureDigest
+
+Run the binary with one or more YAML files to find out what it does
+
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+    gem 'tree_structure_digest'
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install tree_structure_digest
+
+## Usage
+
+`tree_structure_digest example.yml`
+
+## Contributing
+
+Could use a shorter name maybe
+
+1. Fork it
+2. Create your feature branch (`git checkout -b my-new-feature`)
+3. Commit your changes (`git commit -am 'Add some feature'`)
+4. Push to the branch (`git push origin my-new-feature`)
+5. Create new Pull Request

data/Rakefile

@@ -0,0 +1 @@
+require "bundler/gem_tasks"

data/bin/tree_structure_digest

@@ -0,0 +1,10 @@
+#!/usr/bin/env ruby
+begin
+    require 'tree_structure_digest'
+rescue LoadError
+    require 'rubygems'
+    require 'tree_structure_digest'
+end
+
+$h = TreeStructureDigest::Digest.new.injest_yml_files(ARGV)
+puts $h.shorthand

data/lib/tree_structure_digest/abstract_array_dereference.rb

@@ -0,0 +1,16 @@
+module TreeStructureDigest
+  module SchemaParts
+    class AbstractArrayDereference
+      def ==(other)
+        self.class == other.class
+      end
+
+      def serialize
+        "[]"
+      end
+
+      alias :eql? :==
+      def hash; [].hash; end
+    end
+  end
+end

data/lib/tree_structure_digest/abstract_path.rb

@@ -0,0 +1,45 @@
+module TreeStructureDigest
+  module SchemaParts
+    class AbstractPath
+      def initialize(abstract_parts)
+        @parts = abstract_parts
+      end
+
+      def serialize
+        @parts.map(&:serialize).join
+      end
+
+      def accepts(path)
+        self == path.abstract
+      end
+
+      def add_part(part)
+        AbstractPath.new(@parts + [part])
+      end
+
+      def self.from_shorthand(shorthand)
+        shorthand = orig_shorthand.clone
+        abstract_path = AbstractPath.new
+        while !shorthand.empty?
+          if key = shorthand[/^\.(\w+)/, 1]
+            abstract_path = abstract_path.add_part(HashDereference.new(key))
+            shorthand.sub!(/^\.\w+/, '')
+          elsif shorthand[/^\[\]/]
+            abstract_path = abstract_path.add_part(AbstractArrayDereference.new)
+            shorthand.sub!("[]", '')
+          else
+            raise "shorthand #{shorthand} isn't a valid path shorthand"
+          end
+        end
+        abstract_path
+      end
+
+      attr_reader :parts
+      def ==(other)
+        self.class == other.class && @parts == other.parts
+      end
+      alias :eql? :==
+      def hash; [@parts].hash; end
+    end
+  end
+end

data/lib/tree_structure_digest/array_dereference.rb

@@ -0,0 +1,20 @@
+module TreeStructureDigest
+  module SchemaParts
+    class ArrayDereference
+      attr_reader :index
+      def initialize(index)
+        @index = index
+      end
+
+      def ==(other)
+        self.class == other.class && @index == other.index
+      end
+
+      alias :eql? :==
+      def hash; [@index].hash; end
+      def abstract
+        AbstractArrayDereference.new
+      end
+    end
+  end
+end

data/lib/tree_structure_digest/digest.rb

@@ -0,0 +1,69 @@
+require 'yaml'
+
+module TreeStructureDigest
+  class Digest
+    def injest_yml_files(file_paths)
+      file_paths.each do |p|
+        y = YAML.load_file(p)
+        gather_paths(y, paths)
+      end
+      @abstract_paths = paths.map(&:abstract).uniq
+      self
+    end
+
+    def add_validation(shorthand, &validateFn)
+      raise "isn't applicable for core paths of schema" unless @abstract_paths.include? SchemaParts::AbstractPath.from_shorthand(shorthand)
+      validators[shorthand] ||= []
+      validators[shorthand] << validateFn
+    end
+
+    def validate(hash)
+      paths = []
+      gather_paths(hash, paths)
+      paths.all? do |p|
+        print '.'
+        @abstract_paths.any?{|my_p| my_p.accepts(p) } && validators_for(p).all?{|v| v.call(p.last[:value]) }
+      end.tap do
+        puts
+      end
+    end
+
+    def validators_for(p)
+      validators[p.abstract.serialize] || []
+    end
+
+    def shorthand
+      @abstract_paths.map(&:serialize).uniq
+    end
+
+    private
+
+    def paths
+      @paths ||= []
+    end
+
+    def validators
+      @validators ||= {}
+      @validators
+    end
+
+    def gather_paths(node, solutions=[], partial_solution=SchemaParts::Path.new)
+      if Array === node
+        node.each.with_index do |e, i|
+          gather_paths(e, solutions, partial_solution.add_part(SchemaParts::ArrayDereference.new(i)))
+        end
+      elsif Hash === node
+        node.each do |k,v|
+          gather_paths(v, solutions, partial_solution.add_part(SchemaParts::HashDereference.new(k)))
+        end
+      else
+        solutions << (partial_solution.add_part(SchemaParts::Value.new(node)))
+      end
+      self
+    end
+
+    def deserialize(orig_shorthand)
+      SchemaParts::AbstractPath.from_shorthand(orig_shorthand)
+    end
+  end
+end

data/lib/tree_structure_digest/hash_dereference.rb

@@ -0,0 +1,23 @@
+module TreeStructureDigest
+  module SchemaParts
+    class HashDereference
+      def initialize(key)
+        @key = key
+      end
+
+      def serialize
+        ".#{key}"
+      end
+
+      def abstract
+        self
+      end
+      attr_reader :key
+      def ==(other)
+        self.class == other.class && @key == other.key
+      end
+      alias :eql? :==
+      def hash; [@key].hash; end
+    end
+  end
+end

data/lib/tree_structure_digest/path.rb

@@ -0,0 +1,24 @@
+module TreeStructureDigest
+  module SchemaParts
+    class Path
+      def initialize(parts=[])
+        @parts = parts
+      end
+
+      def abstract
+        AbstractPath.new(@parts.map(&:abstract).compact)
+      end
+
+      def add_part(part)
+        Path.new(@parts + [part])
+      end
+
+      attr_reader :parts
+      def ==(other)
+        self.class == other.class && @parts == other.parts
+      end
+      alias :eql? :==
+      def hash; [@parts].hash; end
+    end
+  end
+end

data/lib/tree_structure_digest/value.rb

@@ -0,0 +1,20 @@
+module TreeStructureDigest
+  module SchemaParts
+    class Value
+      def initialize(val)
+        @value = val
+      end
+
+      def abstract
+        nil
+      end
+
+      attr_reader :value
+      def ==(other)
+        self.class == other.class && @value == other.value
+      end
+      alias :eql? :==
+      def hash; [@value].hash; end
+    end
+  end
+end

data/lib/tree_structure_digest/version.rb

@@ -0,0 +1,3 @@
+module TreeStructureDigest
+  VERSION = "0.0.1"
+end

data/lib/tree_structure_digest.rb

@@ -0,0 +1,5 @@
+require "tree_structure_digest/version"
+Dir[File.dirname(__FILE__) + '/tree_structure_digest/*.rb'].each {|file| require file }
+
+module TreeStructureDigest
+end

data/tree_structure_digest.gemspec

@@ -0,0 +1,23 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'tree_structure_digest/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "tree_structure_digest"
+  spec.version       = TreeStructureDigest::VERSION
+  spec.authors       = ["Serguei Filimonov"]
+  spec.email         = ["serguei.filimonov@gmail.com"]
+  spec.description   = %q{Digests and lists all the paths through a nested dictionary}
+  spec.summary       = %q{run the binary on YAML files to check it out}
+  spec.homepage      = ""
+  spec.license       = "MIT"
+
+  spec.files         = `git ls-files`.split($/)
+  spec.executables   = spec.files.grep(%r{^bin/}) { |f| File.basename(f) }
+  spec.test_files    = spec.files.grep(%r{^(test|spec|features)/})
+  spec.require_paths = ["lib"]
+
+  spec.add_development_dependency "bundler", "~> 1.3"
+  spec.add_development_dependency "rake"
+end

metadata

@@ -0,0 +1,90 @@
+--- !ruby/object:Gem::Specification
+name: tree_structure_digest
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+platform: ruby
+authors:
+- Serguei Filimonov
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2014-01-08 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.3'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.3'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+description: Digests and lists all the paths through a nested dictionary
+email:
+- serguei.filimonov@gmail.com
+executables:
+- tree_structure_digest
+extensions: []
+extra_rdoc_files: []
+files:
+- .gitignore
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- bin/tree_structure_digest
+- lib/tree_structure_digest.rb
+- lib/tree_structure_digest/abstract_array_dereference.rb
+- lib/tree_structure_digest/abstract_path.rb
+- lib/tree_structure_digest/array_dereference.rb
+- lib/tree_structure_digest/digest.rb
+- lib/tree_structure_digest/hash_dereference.rb
+- lib/tree_structure_digest/path.rb
+- lib/tree_structure_digest/value.rb
+- lib/tree_structure_digest/version.rb
+- tree_structure_digest.gemspec
+homepage: ''
+licenses:
+- MIT
+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.1.5
+signing_key: 
+specification_version: 4
+summary: run the binary on YAML files to check it out
+test_files: []
+has_rdoc: