burtpath 1.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 5bfa4c5a420e8defde2a70bdbf2de5a8b4376576
+  data.tar.gz: 2ddf695b4cccd57b2e0b93735f89fdeec5878509
+SHA512:
+  metadata.gz: b4611855c33f0104c78aa2cebef3a0ef308091f86ba63c04ca66406fa38bbccd513ed9382f551a10c33a192f00d11fb2966e2997b1ba3221ebbbc961924e7996
+  data.tar.gz: 4bfd2c5588811ad86348e80ec2fde8ef200eebce105ba58c1b7dcf5566fbedd4dc618e259f84405800ca6b6bcc43d71a893253631273776926dfd3ec4f89567d

data/LICENSE.txt

@@ -0,0 +1,174 @@
+                              Apache License
+                        Version 2.0, January 2004
+                     http://www.apache.org/licenses/
+
+TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+1. Definitions.
+
+   "License" shall mean the terms and conditions for use, reproduction,
+   and distribution as defined by Sections 1 through 9 of this document.
+
+   "Licensor" shall mean the copyright owner or entity authorized by
+   the copyright owner that is granting the License.
+
+   "Legal Entity" shall mean the union of the acting entity and all
+   other entities that control, are controlled by, or are under common
+   control with that entity. For the purposes of this definition,
+   "control" means (i) the power, direct or indirect, to cause the
+   direction or management of such entity, whether by contract or
+   otherwise, or (ii) ownership of fifty percent (50%) or more of the
+   outstanding shares, or (iii) beneficial ownership of such entity.
+
+   "You" (or "Your") shall mean an individual or Legal Entity
+   exercising permissions granted by this License.
+
+   "Source" form shall mean the preferred form for making modifications,
+   including but not limited to software source code, documentation
+   source, and configuration files.
+
+   "Object" form shall mean any form resulting from mechanical
+   transformation or translation of a Source form, including but
+   not limited to compiled object code, generated documentation,
+   and conversions to other media types.
+
+   "Work" shall mean the work of authorship, whether in Source or
+   Object form, made available under the License, as indicated by a
+   copyright notice that is included in or attached to the work
+   (an example is provided in the Appendix below).
+
+   "Derivative Works" shall mean any work, whether in Source or Object
+   form, that is based on (or derived from) the Work and for which the
+   editorial revisions, annotations, elaborations, or other modifications
+   represent, as a whole, an original work of authorship. For the purposes
+   of this License, Derivative Works shall not include works that remain
+   separable from, or merely link (or bind by name) to the interfaces of,
+   the Work and Derivative Works thereof.
+
+   "Contribution" shall mean any work of authorship, including
+   the original version of the Work and any modifications or additions
+   to that Work or Derivative Works thereof, that is intentionally
+   submitted to Licensor for inclusion in the Work by the copyright owner
+   or by an individual or Legal Entity authorized to submit on behalf of
+   the copyright owner. For the purposes of this definition, "submitted"
+   means any form of electronic, verbal, or written communication sent
+   to the Licensor or its representatives, including but not limited to
+   communication on electronic mailing lists, source code control systems,
+   and issue tracking systems that are managed by, or on behalf of, the
+   Licensor for the purpose of discussing and improving the Work, but
+   excluding communication that is conspicuously marked or otherwise
+   designated in writing by the copyright owner as "Not a Contribution."
+
+   "Contributor" shall mean Licensor and any individual or Legal Entity
+   on behalf of whom a Contribution has been received by Licensor and
+   subsequently incorporated within the Work.
+
+2. Grant of Copyright License. Subject to the terms and conditions of
+   this License, each Contributor hereby grants to You a perpetual,
+   worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+   copyright license to reproduce, prepare Derivative Works of,
+   publicly display, publicly perform, sublicense, and distribute the
+   Work and such Derivative Works in Source or Object form.
+
+3. Grant of Patent License. Subject to the terms and conditions of
+   this License, each Contributor hereby grants to You a perpetual,
+   worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+   (except as stated in this section) patent license to make, have made,
+   use, offer to sell, sell, import, and otherwise transfer the Work,
+   where such license applies only to those patent claims licensable
+   by such Contributor that are necessarily infringed by their
+   Contribution(s) alone or by combination of their Contribution(s)
+   with the Work to which such Contribution(s) was submitted. If You
+   institute patent litigation against any entity (including a
+   cross-claim or counterclaim in a lawsuit) alleging that the Work
+   or a Contribution incorporated within the Work constitutes direct
+   or contributory patent infringement, then any patent licenses
+   granted to You under this License for that Work shall terminate
+   as of the date such litigation is filed.
+
+4. Redistribution. You may reproduce and distribute copies of the
+   Work or Derivative Works thereof in any medium, with or without
+   modifications, and in Source or Object form, provided that You
+   meet the following conditions:
+
+   (a) You must give any other recipients of the Work or
+       Derivative Works a copy of this License; and
+
+   (b) You must cause any modified files to carry prominent notices
+       stating that You changed the files; and
+
+   (c) You must retain, in the Source form of any Derivative Works
+       that You distribute, all copyright, patent, trademark, and
+       attribution notices from the Source form of the Work,
+       excluding those notices that do not pertain to any part of
+       the Derivative Works; and
+
+   (d) If the Work includes a "NOTICE" text file as part of its
+       distribution, then any Derivative Works that You distribute must
+       include a readable copy of the attribution notices contained
+       within such NOTICE file, excluding those notices that do not
+       pertain to any part of the Derivative Works, in at least one
+       of the following places: within a NOTICE text file distributed
+       as part of the Derivative Works; within the Source form or
+       documentation, if provided along with the Derivative Works; or,
+       within a display generated by the Derivative Works, if and
+       wherever such third-party notices normally appear. The contents
+       of the NOTICE file are for informational purposes only and
+       do not modify the License. You may add Your own attribution
+       notices within Derivative Works that You distribute, alongside
+       or as an addendum to the NOTICE text from the Work, provided
+       that such additional attribution notices cannot be construed
+       as modifying the License.
+
+   You may add Your own copyright statement to Your modifications and
+   may provide additional or different license terms and conditions
+   for use, reproduction, or distribution of Your modifications, or
+   for any such Derivative Works as a whole, provided Your use,
+   reproduction, and distribution of the Work otherwise complies with
+   the conditions stated in this License.
+
+5. Submission of Contributions. Unless You explicitly state otherwise,
+   any Contribution intentionally submitted for inclusion in the Work
+   by You to the Licensor shall be under the terms and conditions of
+   this License, without any additional terms or conditions.
+   Notwithstanding the above, nothing herein shall supersede or modify
+   the terms of any separate license agreement you may have executed
+   with Licensor regarding such Contributions.
+
+6. Trademarks. This License does not grant permission to use the trade
+   names, trademarks, service marks, or product names of the Licensor,
+   except as required for reasonable and customary use in describing the
+   origin of the Work and reproducing the content of the NOTICE file.
+
+7. Disclaimer of Warranty. Unless required by applicable law or
+   agreed to in writing, Licensor provides the Work (and each
+   Contributor provides its Contributions) on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+   implied, including, without limitation, any warranties or conditions
+   of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+   PARTICULAR PURPOSE. You are solely responsible for determining the
+   appropriateness of using or redistributing the Work and assume any
+   risks associated with Your exercise of permissions under this License.
+
+8. Limitation of Liability. In no event and under no legal theory,
+   whether in tort (including negligence), contract, or otherwise,
+   unless required by applicable law (such as deliberate and grossly
+   negligent acts) or agreed to in writing, shall any Contributor be
+   liable to You for damages, including any direct, indirect, special,
+   incidental, or consequential damages of any character arising as a
+   result of this License or out of the use or inability to use the
+   Work (including but not limited to damages for loss of goodwill,
+   work stoppage, computer failure or malfunction, or any and all
+   other commercial damages or losses), even if such Contributor
+   has been advised of the possibility of such damages.
+
+9. Accepting Warranty or Additional Liability. While redistributing
+   the Work or Derivative Works thereof, You may choose to offer,
+   and charge a fee for, acceptance of support, warranty, indemnity,
+   or other liability obligations and/or rights consistent with this
+   License. However, in accepting such obligations, You may act only
+   on Your own behalf and on Your sole responsibility, not on behalf
+   of any other Contributor, and only if You agree to indemnify,
+   defend, and hold each Contributor harmless for any liability
+   incurred by, or claims asserted against, such Contributor by reason
+   of your accepting any such warranty or additional liability.

data/lib/burtpath.rb

@@ -0,0 +1,3 @@
+require 'jmespath'
+
+BurtPath = JMESPath

data/lib/jmespath/caching_parser.rb

@@ -0,0 +1,30 @@
+require 'thread'
+
+module JMESPath
+  class CachingParser
+
+    def initialize(parser)
+      @parser = parser
+      @mutex = Mutex.new
+      @cache = {}
+    end
+
+    def parse(expression)
+      if cached = @cache[expression]
+        cached
+      else
+        cache_expression(expression)
+      end
+    end
+
+    private
+
+    def cache_expression(expression)
+      @mutex.synchronize do
+        @cache.clear if @cache.size > 1000
+        @cache[expression] = @parser.parse(expression)
+      end
+    end
+
+  end
+end

data/lib/jmespath/errors.rb

@@ -0,0 +1,17 @@
+module JMESPath
+  module Errors
+
+    class Error < StandardError; end
+
+    class RuntimeError < Error; end
+
+    class SyntaxError < Error; end
+
+    class InvalidTypeError < Error; end
+
+    class InvalidArityError < Error; end
+
+    class UnknownFunctionError < Error; end
+
+  end
+end

data/lib/jmespath/lexer.rb

@@ -0,0 +1,118 @@
+require 'json'
+
+module JMESPath
+  # @api private
+  class Lexer
+
+    # @api private
+    TOKEN_PATTERNS = {}
+
+    # @api private
+    TOKEN_TYPES = {}
+
+    {
+      '[a-zA-Z_][a-zA-Z_0-9]*'     => :identifier,
+      '\.'                         => :dot,
+      '\*'                         => :star,
+      '\[\]'                       => :flatten,
+      '-?\d+'                      => :number,
+      '\|\|'                       => :or,
+      '\|'                         => :pipe,
+      '\[\?'                       => :filter,
+      '\['                         => :lbracket,
+      '\]'                         => :rbracket,
+      '"(?:\\\\\\\\|\\\\"|[^"])*"' => :quoted_identifier,
+      '`(?:\\\\\\\\|\\\\`|[^`])*`' => :literal,
+      ','                          => :comma,
+      ':'                          => :colon,
+      '@'                          => :current,
+      '&'                          => :expref,
+      '\('                         => :lparen,
+      '\)'                         => :rparen,
+      '\{'                         => :lbrace,
+      '\}'                         => :rbrace,
+      '!='                         => :comparator,
+      '=='                         => :comparator,
+      '<='                         => :comparator,
+      '>='                         => :comparator,
+      '<'                          => :comparator,
+      '>'                          => :comparator,
+      '[ \t]'                      => :skip,
+    }.each.with_index do |(pattern, type), n|
+      TOKEN_PATTERNS[n] = pattern
+      TOKEN_TYPES[n] = type
+    end
+
+    # @api private
+    TOKEN_REGEX = /(#{TOKEN_PATTERNS.values.join(')|(')})/
+
+    # @api private
+    JSON_VALUE = /^[\["{]/
+
+    # @api private
+    JSON_NUMBER = /^\-?[0-9]*(\.[0-9]+)?([e|E][+|\-][0-9]+)?$/
+
+    # @param [String<JMESPath>] expression
+    # @return [Array<Hash>]
+    def tokenize(expression)
+      offset = 0
+      tokens = []
+      expression.scan(TOKEN_REGEX).each do |match|
+        match_index = match.find_index { |token| !token.nil? }
+        match_value = match[match_index]
+        type = TOKEN_TYPES[match_index]
+        token = Token.new(type, match_value, offset)
+        if token.type != :skip
+          case token.type
+          when :number then token_number(token, expression, offset)
+          when :literal then token_literal(token, expression, offset)
+          when :quoted_identifier
+            token_quoted_identifier(token, expression, offset)
+          end
+          tokens << token
+        end
+        offset += match_value.size
+      end
+      tokens << Token.new(:eof, nil, offset)
+      unless expression.size == offset
+        syntax_error('invalid expression', expression, offset)
+      end
+      tokens
+    end
+
+    private
+
+    def token_number(token, expression, offset)
+      token[:value] = token[:value].to_i
+    end
+
+    def token_literal(token, expression, offset)
+      token[:value] = token[:value][1..-2].lstrip.gsub('\`', '`')
+      token[:value] =
+        case token[:value]
+        when 'true', 'false' then token[:value] == 'true'
+        when 'null' then nil
+        when '' then syntax_error("empty json literal", expression, offset)
+        when JSON_VALUE then decode_json(token[:value], expression, offset)
+        when JSON_NUMBER then decode_json(token[:value], expression, offset)
+        else decode_json('"' + token[:value] + '"', expression, offset)
+        end
+    end
+
+    def token_quoted_identifier(token, expression, offset)
+      token[:value] = decode_json(token[:value], expression, offset)
+    end
+
+    def decode_json(json, expression, offset)
+      JSON.load(json)
+    rescue JSON::ParserError => e
+      syntax_error(e.message, expression, offset)
+    end
+
+    def syntax_error(message, expression, offset)
+      msg = message + "in #{expression.inspect} at #{offset}"
+      raise Errors::SyntaxError.new(msg)
+    end
+
+  end
+end

data/lib/jmespath/nodes/comparator.rb

@@ -0,0 +1,77 @@
+module JMESPath
+  # @api private
+  module Nodes
+    class Comparator < Node
+      attr_reader :left, :right
+
+      def initialize(left, right)
+        @left = left
+        @right = right
+      end
+
+      def self.create(relation, left, right)
+        type = begin
+          case relation
+          when '==' then EqComparator
+          when '!=' then NeqComparator
+          when '>' then GtComparator
+          when '>=' then GteComparator
+          when '<' then LtComparator
+          when '<=' then LteComparator
+          end
+        end
+        type.new(left, right)
+      end
+
+      def visit(value)
+        check(@left.visit(value), @right.visit(value))
+      end
+
+      def optimize
+        self.class.new(@left.optimize, @right.optimize)
+      end
+
+      private
+
+      def check(left_value, right_value)
+        nil
+      end
+    end
+
+    class EqComparator < Comparator
+      def check(left_value, right_value)
+        left_value == right_value
+      end
+    end
+
+    class NeqComparator < Comparator
+      def check(left_value, right_value)
+        left_value != right_value
+      end
+    end
+
+    class GtComparator < Comparator
+      def check(left_value, right_value)
+        left_value.is_a?(Integer) && right_value.is_a?(Integer) && left_value > right_value
+      end
+    end
+
+    class GteComparator < Comparator
+      def check(left_value, right_value)
+        left_value.is_a?(Integer) && right_value.is_a?(Integer) && left_value >= right_value
+      end
+    end
+
+    class LtComparator < Comparator
+      def check(left_value, right_value)
+        left_value.is_a?(Integer) && right_value.is_a?(Integer) && left_value < right_value
+      end
+    end
+
+    class LteComparator < Comparator
+      def check(left_value, right_value)
+        left_value.is_a?(Integer) && right_value.is_a?(Integer) && left_value <= right_value
+      end
+    end
+  end
+end

data/lib/jmespath/nodes/condition.rb

@@ -0,0 +1,136 @@
+module JMESPath
+  # @api private
+  module Nodes
+    class Condition < Node
+      def initialize(test, child)
+        @test = test
+        @child = child
+      end
+
+      def visit(value)
+        if @test.visit(value)
+          @child.visit(value)
+        else
+          nil
+        end
+      end
+
+      def optimize
+        test = @test.optimize
+        if (new_type = ComparatorCondition::COMPARATOR_TO_CONDITION[@test.class])
+          new_type.new(test.left, test.right, @child).optimize
+        else
+          self.class.new(test, @child.optimize)
+        end
+      end
+    end
+
+    class ComparatorCondition < Node
+      COMPARATOR_TO_CONDITION = {}
+
+      def initialize(left, right, child)
+        @left = left
+        @right = right
+        @child = child
+      end
+
+      def visit(value)
+        nil
+      end
+    end
+
+    class EqCondition < ComparatorCondition
+      COMPARATOR_TO_CONDITION[EqComparator] = self
+
+      def visit(value)
+        @left.visit(value) == @right.visit(value) ? @child.visit(value) : nil
+      end
+
+      def optimize
+        if @right.is_a?(Literal)
+          LiteralRightEqCondition.new(@left, @right, @child)
+        else
+          self
+        end
+      end
+    end
+
+    class LiteralRightEqCondition < EqCondition
+      def initialize(left, right, child)
+        super
+        @right = @right.value
+      end
+
+      def visit(value)
+        @left.visit(value) == @right ? @child.visit(value) : nil
+      end
+    end
+
+    class NeqCondition < ComparatorCondition
+      COMPARATOR_TO_CONDITION[NeqComparator] = self
+
+      def visit(value)
+        @left.visit(value) != @right.visit(value) ? @child.visit(value) : nil
+      end
+
+      def optimize
+        if @right.is_a?(Literal)
+          LiteralRightNeqCondition.new(@left, @right, @child)
+        else
+          self
+        end
+      end
+    end
+
+    class LiteralRightNeqCondition < NeqCondition
+      def initialize(left, right, child)
+        super
+        @right = @right.value
+      end
+
+      def visit(value)
+        @left.visit(value) != @right ? @child.visit(value) : nil
+      end
+    end
+
+    class GtCondition < ComparatorCondition
+      COMPARATOR_TO_CONDITION[GtComparator] = self
+
+      def visit(value)
+        left_value = @left.visit(value)
+        right_value = @right.visit(value)
+        left_value.is_a?(Integer) && right_value.is_a?(Integer) && left_value > right_value ? @child.visit(value) : nil
+      end
+    end
+
+    class GteCondition < ComparatorCondition
+      COMPARATOR_TO_CONDITION[GteComparator] = self
+
+      def visit(value)
+        left_value = @left.visit(value)
+        right_value = @right.visit(value)
+        left_value.is_a?(Integer) && right_value.is_a?(Integer) && left_value >= right_value ? @child.visit(value) : nil
+      end
+    end
+
+    class LtCondition < ComparatorCondition
+      COMPARATOR_TO_CONDITION[LtComparator] = self
+
+      def visit(value)
+        left_value = @left.visit(value)
+        right_value = @right.visit(value)
+        left_value.is_a?(Integer) && right_value.is_a?(Integer) && left_value < right_value ? @child.visit(value) : nil
+      end
+    end
+
+    class LteCondition < ComparatorCondition
+      COMPARATOR_TO_CONDITION[LteComparator] = self
+
+      def visit(value)
+        left_value = @left.visit(value)
+        right_value = @right.visit(value)
+        left_value.is_a?(Integer) && right_value.is_a?(Integer) && left_value <= right_value ? @child.visit(value) : nil
+      end
+    end
+  end
+end

data/lib/jmespath/nodes/current.rb

@@ -0,0 +1,10 @@
+module JMESPath
+  # @api private
+  module Nodes
+    class Current < Node
+      def visit(value)
+        value
+      end
+    end
+  end
+end

data/lib/jmespath/nodes/expression.rb

@@ -0,0 +1,25 @@
+module JMESPath
+  # @api private
+  module Nodes
+    class Expression < Node
+      attr_reader :expression
+
+      def initialize(expression)
+        @expression = expression
+      end
+
+      def visit(value)
+        self
+      end
+
+      def eval(value)
+        @expression.visit(value)
+      end
+
+      def optimize
+        self.class.new(@expression.optimize)
+      end
+    end
+  end
+end
+

data/lib/jmespath/nodes/field.rb

@@ -0,0 +1,63 @@
+module JMESPath
+  # @api private
+  module Nodes
+    class Field < Node
+      def initialize(key)
+        @key = key
+        @keys = [key]
+        @key_sym = key.respond_to?(:to_sym) ? key.to_sym : nil
+      end
+
+      def visit(value)
+        if value.is_a?(Hash)
+          if !(v = value[@key]).nil?
+            v
+          elsif @key_sym && !(v = value[@key_sym]).nil?
+            v
+          end
+        elsif value.is_a?(Struct) && value.respond_to?(@key)
+          value[@key]
+        end
+      end
+
+      def chains_with?(other)
+        other.is_a?(Field)
+      end
+
+      def chain(other)
+        ChainedField.new([*keys, *other.keys])
+      end
+
+      protected
+
+      attr_reader :keys
+    end
+
+    class ChainedField < Field
+      def initialize(keys)
+        @keys = keys
+        @key_syms = keys.each_with_object({}) do |k, syms|
+          if k.respond_to?(:to_sym)
+            syms[k] = k.to_sym
+          end
+        end
+      end
+
+      def visit(value)
+        @keys.reduce(value) do |value, key|
+          if value.is_a?(Array) && key.is_a?(Integer)
+            value[key]
+          elsif value.is_a?(Hash)
+            if !(v = value[key]).nil?
+              v
+            elsif (sym = @key_syms[key]) && !(v = value[sym]).nil?
+              v
+            end
+          elsif value.is_a?(Struct) && value.respond_to?(key)
+            value[key]
+          end
+        end
+      end
+    end
+  end
+end