eqn 1.6.0 → 1.6.5

checksums.yaml

@@ -1,7 +1,7 @@
 ---
-SHA1:
-  metadata.gz: 4c54bb4df4dbcf3350edbaa0c13994c8372cea5c
-  data.tar.gz: bde508e34f9491145d4c5b7968602a8dd220d5a2
+SHA256:
+  metadata.gz: 807944d76a7626f0a7772757f110600324c9fa63c12aaad04ad68c07c162ea90
+  data.tar.gz: 8debccddd120f9acc3523e6ca8b5a0835823d1c9240177751103b5a886fc7971
 SHA512:
-  metadata.gz: d3f356c8c7eb30b335c972085eaf70e23b30b2611cb46d0857dfad95b4fca6f3a9e8426f9fab50c22b546ca0533335a0421fb0ad358c0e44f3ff2f355367bbf5
-  data.tar.gz: 466d2723c70a6933469d1a3bbfa91affeb64e487edff0aa11525503af7b8c163359ca806b2b5584a4dc6be9c3f355c38fb49c04bdc7b13e3cc5699ae1c290a13
+  metadata.gz: 4b3efde4aa07b6f310bb23085328186253c2874e1cf91d93cc13dc4289d9a8ea903d38052091a3194fedb8e66af2a74945298009fcf436610a011dfadfe84e8c
+  data.tar.gz: 865205a5958a138849e8e254ce3dcf4145fa10f27d8934a2132e710682919f234f0c021ea6b3b43e08a9f1a7172535cca43d6fa9b8b3066bd08cca4befd24d91

data/README.md

@@ -128,7 +128,7 @@ Rounds the number down (i.e. floor function). Optionally, pass a number of decim
 
 After checking out the repo, run `bin/setup` to install dependencies. Then, run `bin/console` for an interactive prompt that will allow you to experiment.
 
-The gem uses rspec for testing; run `rspec` from the application root to execute the tests.
+The gem uses rspec for testing and appraisal to test against multiple versions of treetop (the only runtime dependency). From the command line, run `bundle exec appraisal install` to install gems and `bundle exec appraisal rspec` to run the complete test suite. (You can still run `bundle exec rspec` to only test against the latest version of treetop while developing.)
 
 ## Authorship
 
@@ -136,7 +136,7 @@ Written by Zach Schneider for [Aha!, the world's #1 product roadmap software](ht
 
 ## Contributing
 
-1. Fork it ( https://github.com/schneidmaster/eqn/fork )
+1. Fork it ([https://github.com/schneidmaster/eqn/fork](https://github.com/schneidmaster/eqn/fork))
 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`)

data/eqn.gemspec

@@ -4,7 +4,7 @@ lib = File.expand_path('../lib', __FILE__)
 $LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
 require 'eqn/version'
 
-config_files = %w[.rspec .rubocop.yml .ruby-version Appraisals circle.yml]
+config_files = %w(.rspec .rubocop.yml .ruby-version Appraisals .circleci/config.yml)
 
 Gem::Specification.new do |spec|
   spec.name          = 'eqn'
@@ -12,8 +12,8 @@ Gem::Specification.new do |spec|
   spec.authors       = ['Zach Schneider']
   spec.email         = ['zach@aha.io']
 
-  spec.summary       = 'A gem to evaluate numerical equations.'
-  spec.description   = 'A gem to evaluate numerical equations. Includes support for variables and functions.'
+  spec.summary       = 'A gem to evaluate mathematical equations.'
+  spec.description   = 'A gem to evaluate mathematical equations. Includes support for variables and functions.'
   spec.homepage      = 'https://github.com/schneidmaster/eqn'
   spec.license       = 'MIT'
 
@@ -24,11 +24,12 @@ Gem::Specification.new do |spec|
 
   spec.add_dependency 'treetop', '>= 1.2.0'
 
-  spec.add_development_dependency 'appraisal', '~> 2.1.0'
-  spec.add_development_dependency 'bundler', '~> 1.8'
-  spec.add_development_dependency 'codeclimate-test-reporter', '~> 0.4.7'
-  spec.add_development_dependency 'rake', '~> 10.0'
-  spec.add_development_dependency 'rubocop', '~> 0.42'
-  spec.add_development_dependency 'rspec', '~> 3.2.0'
-  spec.add_development_dependency 'simplecov', '~> 0.10.0'
+  spec.add_development_dependency 'appraisal', '~> 2.2.0'
+  spec.add_development_dependency 'bundler', '>= 1.9'
+  spec.add_development_dependency 'codeclimate-test-reporter', '~> 1.0'
+  spec.add_development_dependency 'rake', '~> 13.0'
+  spec.add_development_dependency 'rubocop', '~> 0.60'
+  spec.add_development_dependency 'rubocop-rspec', '~> 1.30'
+  spec.add_development_dependency 'rspec', '~> 3.5.0'
+  spec.add_development_dependency 'simplecov', '< 0.18'
 end

data/lib/eqn.rb

@@ -1,2 +1,10 @@
 require 'treetop'
-Dir.glob File.join(__dir__, 'eqn', '**', '*.rb'), &method(:require)
+
+# Load the parser from the Treetop grammar.
+Treetop.load(File.join(__dir__, 'eqn.treetop'))
+
+# Load custom eqn syntax node.
+require File.join(__dir__, 'eqn', 'eqn_node')
+
+# Load other eqn classes.
+Dir.glob(File.join(__dir__, 'eqn', '**', '*.rb')).sort.each(&method(:require))

data/lib/eqn.treetop

@@ -40,19 +40,19 @@ grammar Eqn
   end
 
   rule if_func
-    'if' space? '(' comparation ',' expression ',' expression ')' <Eqn::Function::If>
+    ('if' / 'IF') space? '(' comparation ',' expression ',' expression ')' <Eqn::Function::If>
   end
 
   rule round_func
-    'round' space? '(' expression round_group? ')' <Eqn::Function::Round>
+    ('round' / 'ROUND') space? '(' expression round_group? ')' <Eqn::Function::Round>
   end
 
   rule roundup_func
-    'roundup' space? '(' expression round_group? ')' <Eqn::Function::RoundUp>
+    ('roundup' / 'ROUNDUP') space? '(' expression round_group? ')' <Eqn::Function::RoundUp>
   end
 
   rule rounddown_func
-    'rounddown' space? '(' expression round_group? ')' <Eqn::Function::RoundDown>
+    ('rounddown' / 'ROUNDDOWN') space? '(' expression round_group? ')' <Eqn::Function::RoundDown>
   end
 
   rule round_group
@@ -112,7 +112,8 @@ grammar Eqn
   end
 
   rule sign
-    '+' / '-' <Eqn::Terminal::Sign>
+      '+' 
+    / '-' <Eqn::Terminal::UnaryMinus>
   end
 
   rule digits
@@ -126,4 +127,4 @@ grammar Eqn
   rule space
     ("\s" / "\t")*
   end
-end
+end

data/lib/eqn/calculator.rb

@@ -1,4 +1,5 @@
 module Eqn
+  # Primary calculator class used for performing calculations or creating eqn instances.
   class Calculator
     def initialize(eqn, vars = {})
       @eqn = eqn
@@ -9,36 +10,68 @@ module Eqn
       if key_or_hash.is_a?(Hash)
         @vars.merge!(key_or_hash)
       else
-        @vars[key_or_hash.intern] = value
+        @vars[key_or_hash.to_sym] = value
       end
     end
 
     def method_missing(method, *args)
-      if %i[calculate calc valid?].include?(method)
+      if delegated_method?(method)
         self.class.send(method, @eqn, @vars)
-      elsif (match = method.to_s.match(/^[A-Za-z]+=$/))
-        @vars[match.to_s.delete('=').intern] = args.first
-      elsif (var = method.to_s.match(/^[A-Za-z]+$/).to_s.intern) && @vars.key?(var)
-        @vars[var]
+      elsif match_setter?(method)
+        @vars[setter_key(method)] = args.first
+      elsif match_getter?(method)
+        @vars[getter_key(method)]
       else
         super
       end
     end
 
-    def respond_to_missing?(method)
-      %i[calculate calc valid?].include?(method) || method.to_s.match(/^[A-Za-z]+=$/) || (var = method.to_s.match(/^[A-Za-z]+$/).to_s.intern) && @vars.key?(var)
+    def respond_to_missing?(method, _include_private = false)
+      delegated_method?(method) || match_setter?(method) || match_getter?(method) || super
+    end
+
+    private
+
+    def delegated_method?(method)
+      %i(calculate calc valid?).include?(method.to_sym)
+    end
+
+    def setter_key(method)
+      match = method.to_s.match(/^[A-Za-z]+=$/)
+      return unless match
+
+      match.to_s.delete('=').to_sym
+    end
+
+    def match_setter?(method)
+      !setter_key(method).nil?
+    end
+
+    def getter_key(method)
+      match = method.to_s.match(/^[A-Za-z]+$/)
+      return if match.nil?
+
+      key = match.to_s.to_sym
+      return unless @vars.key?(key)
+
+      key
+    end
+
+    def match_getter?(method)
+      !getter_key(method).nil?
     end
 
     class << self
-      def calculate(data, vars = {})
-        result = Parser.parse(data).value(vars)
+      def calculate(equation, vars = {})
+        result = Parser.parse(equation).value(vars)
         raise ZeroDivisionError if result.is_a?(Float) && (result.abs == Float::INFINITY || result.nan?)
+
         result
       end
       alias calc calculate
 
-      def valid?(data, vars = {})
-        calc(data, vars)
+      def valid?(equation, vars = {})
+        calculate(equation, vars)
         true
       rescue EqnError
         false

data/lib/eqn/comparation.rb

@@ -1,15 +1,17 @@
 module Eqn
-  class Comparation < Treetop::Runtime::SyntaxNode
+  # Node class for a comparison between expressions.
+  class Comparation < EqnNode
     def value(vars = {})
       val_one = elements.shift.value(vars)
-      if elements.empty?
+      if term?
         val_one
       else
         val_one.send(*elements.shift.value(vars))
       end
     end
 
-    class CompGroup < Treetop::Runtime::SyntaxNode
+    # Node class for the operator and expression being compared.
+    class CompGroup < EqnNode
       def value(vars = {})
         [elements.shift.value(vars), elements.shift.value(vars)]
       end

data/lib/eqn/eqn_node.rb

@@ -0,0 +1,19 @@
+module Eqn
+  # Eqn parser node with helper methods for cleaning.
+  class EqnNode < Treetop::Runtime::SyntaxNode
+    def term?
+      elements.nil? || elements.empty?
+    end
+
+    def clean_tree!
+      # Return if node is a terminal.
+      return if term?
+
+      # Delete any cruft syntax nodes.
+      elements.delete_if { |node| !node.is_a?(EqnNode) }
+
+      # Recurse over any elements with their own children.
+      elements.each(&:clean_tree!)
+    end
+  end
+end

data/lib/eqn/expression.rb

@@ -1,38 +1,49 @@
 module Eqn
-  class Expression < Treetop::Runtime::SyntaxNode
+  # Node class for an expression.
+  class Expression < EqnNode
     def left_associative?
       elements.any? && elements.last.left_associative?
     end
 
-    def term?
-      elements.empty?
+    def value(vars = {})
+      base = elements.shift.value(vars)
+
+      # Aggressively consume left associative operators to maintain associativity.
+      base = consume_while_left_associative(base, vars)
+
+      # Apply next right-associative operator (if any) or return.
+      apply_next_operator(base, vars)
     end
 
-    def value(vars = {})
-      if elements.count == 1
-        elements.shift.value(vars)
+    private
+
+    def consume_while_left_associative(base, vars)
+      return base unless left_associative?
+
+      base = apply_next_operator(base, vars)
+      consume_while_left_associative(base, vars)
+    end
+
+    def apply_next_operator(base, vars)
+      return base if term?
+
+      left_associative = elements.last.left_associative?
+      op, num_expr = elements.shift.value(vars)
+      if left_associative
+        apply_left_associative(base, vars, op, num_expr)
       else
-        base = elements.shift.value(vars)
-
-        # Aggressively consume left associative operators to maintain associativity.
-        while left_associative?
-          op, num_expr = elements.shift.value(vars)
-          num_expr_operand = num_expr.elements.shift
-          base = base.send(op, num_expr_operand.value(vars))
-          elements.push num_expr.elements.shift unless num_expr.term?
-        end
-
-        # Apply next right-associative operator (if any) or return.
-        if term?
-          base
-        else
-          op, num_expr = elements.shift.value(vars)
-          base.send(op, num_expr.value(vars))
-        end
+        base.send(op, num_expr.value(vars))
       end
     end
 
-    class ExprGroup < Treetop::Runtime::SyntaxNode
+    def apply_left_associative(base, vars, operator, num_expr)
+      num_expr_operand = num_expr.elements.shift
+      elements.push(num_expr.elements.shift) unless num_expr.term?
+      base.send(operator, num_expr_operand.value(vars))
+    end
+
+    # Node class for the operator and latter component of an expression.
+    class ExprGroup < EqnNode
       def left_associative?
         elements.first.left_associative?
       end

data/lib/eqn/function.rb

@@ -1,6 +1,7 @@
 module Eqn
   module Function
-    class If < Treetop::Runtime::SyntaxNode
+    # Node class for the if function.
+    class If < EqnNode
       def value(vars = {})
         comp_val = elements.shift.value(vars)
         ls = elements.shift.value(vars)
@@ -10,35 +11,40 @@ module Eqn
       end
     end
 
-    class RoundBase < Treetop::Runtime::SyntaxNode
-      def value(fn, vars)
+    # Base node class for round functions.
+    class RoundBase < EqnNode
+      def value(vars)
         value = elements.shift.value(vars)
         raise ZeroDivisionError if value.is_a?(Float) && (value.abs == Float::INFINITY || value.nan?)
-        if elements.empty?
-          value.send(fn)
+
+        if term?
+          value.send(self.class::ROUND_METHOD)
         else
-          decimals = elements.shift.value(vars)
-          (value * 10**decimals).send(fn).to_f / 10**decimals
+          round_to_precision(vars, value)
         end
       end
+
+      private
+
+      def round_to_precision(vars, value)
+        decimals = elements.shift.value(vars)
+        (value * 10**decimals).send(self.class::ROUND_METHOD).to_f / 10**decimals
+      end
     end
 
+    # Node class for the round function.
     class Round < RoundBase
-      def value(vars = {})
-        super(:round, vars)
-      end
+      ROUND_METHOD = :round
     end
 
+    # Node class for the roundup function.
     class RoundUp < RoundBase
-      def value(vars = {})
-        super(:ceil, vars)
-      end
+      ROUND_METHOD = :ceil
     end
 
+    # Node class for the rounddown function.
     class RoundDown < RoundBase
-      def value(vars = {})
-        super(:floor, vars)
-      end
+      ROUND_METHOD = :floor
     end
   end
 end

data/lib/eqn/number.rb

@@ -1,43 +1,45 @@
 module Eqn
-  class Number < Treetop::Runtime::SyntaxNode
+  # Node class for a simple number.
+  class Number < EqnNode
     def value(vars = {})
       base = elements.shift.value(vars)
-      # Apply any exponent.
-      base *= elements.shift.value(vars) unless elements.empty?
-      base
-    end
-
-    class SignedNumber < Treetop::Runtime::SyntaxNode
-      def value(vars = {})
-        # Store sign if any.
-        sign_negative = elements.shift.negative? if elements.first.is_a? Terminal::Sign
 
-        # Evaluate float.
-        value = elements.shift.value(vars)
+      return base if term?
 
-        # Apply sign if any.
-        sign_negative ? -value : value
+      if instance_of?(Float)
+        # Apply any decimal if a float.
+        base + elements.shift.value(vars)
+      else
+        # Apply any exponent if a simple number.
+        base * elements.shift.value(vars)
       end
     end
 
-    class Float < Treetop::Runtime::SyntaxNode
-      def value(vars = {})
-        base = elements.shift.value(vars)
-
-        # Add any decimal.
-        base += elements.shift.value(vars) unless elements.empty?
+    class Float < Number; end
 
-        base
+    # Node class for a signed number.
+    class SignedNumber < EqnNode
+      def value(vars = {})
+        first_element = elements.shift
+        # If first element is unary minus, negate the following value.
+        # Otherwise, simply return the positive value.
+        if first_element.is_a?(Terminal::UnaryMinus)
+          -elements.shift.value(vars)
+        else
+          first_element.value(vars)
+        end
       end
     end
 
-    class Decimal < Treetop::Runtime::SyntaxNode
+    # Node class for the decimal part of a non-integer.
+    class Decimal < EqnNode
       def value(_vars = {})
         elements.shift.dec_value
       end
     end
 
-    class Exponent < Treetop::Runtime::SyntaxNode
+    # Node class for the exponent part of a number.
+    class Exponent < EqnNode
       def value(vars = {})
         10**elements.shift.value(vars)
       end

data/lib/eqn/parser.rb

@@ -1,27 +1,19 @@
 module Eqn
+  # Primary parser class to convert a string equation to a tree of nodes.
   class Parser
-    # Load the Treetop grammar from the grammar.
-    Treetop.load(File.join(File.dirname(__dir__), 'eqn.treetop'))
-    @@parser = EqnParser.new
-
     class << self
-      def parse(data)
-        # Pass the data over to the parser instance.
-        tree = @@parser.parse(data.downcase)
+      def parse(equation)
+        parser = EqnParser.new
+
+        # Pass the equation over to the parser instance.
+        root_node = parser.parse(equation)
 
         # Raise any errors.
-        raise ParseError, "Parse error at offset: #{@@parser.index}" + @@parser.failure_reason if tree.nil?
+        raise ParseError, "Parse error at offset: #{parser.index} -- #{parser.failure_reason}" if root_node.nil?
 
         # Remove extraneous nodes and return tree.
-        clean_tree(tree)
-      end
-
-      private
+        root_node.clean_tree!
 
-      def clean_tree(root_node)
-        return if root_node.elements.nil?
-        root_node.elements.delete_if { |node| node.class == Treetop::Runtime::SyntaxNode }
-        root_node.elements.each { |node| clean_tree(node) }
         root_node
       end
     end

data/lib/eqn/terminal.rb

@@ -1,15 +1,18 @@
 module Eqn
   module Terminal
-    class Variable < Treetop::Runtime::SyntaxNode
+    # Node class for a variable.
+    class Variable < EqnNode
       def value(vars = {})
-        val = vars[text_value.intern]
+        val = vars[text_value.to_sym]
         raise NoVariableValueError, "No value given for: #{text_value}" unless val
-        raise NonNumericVariableError, "Variable #{text_value} value is nonnumeric: #{val}" unless val.is_a? Numeric
+        raise NonNumericVariableError, "Variable #{text_value} value is nonnumeric: #{val}" unless val.is_a?(Numeric)
+
         val
       end
     end
 
-    class Digits < Treetop::Runtime::SyntaxNode
+    # Node class for a group of numbers.
+    class Digits < EqnNode
       def dec_value
         ".#{text_value}".to_f
       end
@@ -19,28 +22,27 @@ module Eqn
       end
     end
 
-    class Sign < Treetop::Runtime::SyntaxNode
-      def negative?
-        text_value == '-'
-      end
-    end
+    # Node class for a unary minus.
+    class UnaryMinus < EqnNode; end
 
-    class Op < Treetop::Runtime::SyntaxNode
+    # Node class for an operator.
+    class Op < EqnNode
       def left_associative?
-        is_a? LeftAssociativeOp
+        is_a?(LeftAssociativeOp)
       end
 
       def value(_vars = {})
-        text_value == '^' ? :** : text_value.intern
+        text_value == '^' ? :** : text_value.to_sym
       end
 
       class LeftAssociativeOp < Op; end
       class RightAssociativeOp < Op; end
     end
 
-    class CompOp < Treetop::Runtime::SyntaxNode
+    # Node class for a comparation operator.
+    class CompOp < EqnNode
       def value(_vars = {})
-        text_value == '=' ? :== : text_value.intern
+        text_value == '=' ? :== : text_value.to_sym
       end
     end
   end

data/lib/eqn/version.rb

@@ -1,3 +1,3 @@
 module Eqn
-  VERSION = '1.6.0'.freeze
+  VERSION = '1.6.5'.freeze
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: eqn
 version: !ruby/object:Gem::Version
-  version: 1.6.0
+  version: 1.6.5
 platform: ruby
 authors:
 - Zach Schneider
-autorequire: 
+autorequire:
 bindir: exe
 cert_chain: []
-date: 2017-05-03 00:00:00.000000000 Z
+date: 2021-02-01 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: treetop
@@ -30,99 +30,113 @@ dependencies:
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: 2.1.0
+        version: 2.2.0
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: 2.1.0
+        version: 2.2.0
 - !ruby/object:Gem::Dependency
   name: bundler
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
-        version: '1.8'
+        version: '1.9'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
-        version: '1.8'
+        version: '1.9'
 - !ruby/object:Gem::Dependency
   name: codeclimate-test-reporter
   requirement: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: 0.4.7
+        version: '1.0'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: 0.4.7
+        version: '1.0'
 - !ruby/object:Gem::Dependency
   name: rake
   requirement: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '10.0'
+        version: '13.0'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '10.0'
+        version: '13.0'
 - !ruby/object:Gem::Dependency
   name: rubocop
   requirement: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '0.42'
+        version: '0.60'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '0.42'
+        version: '0.60'
 - !ruby/object:Gem::Dependency
-  name: rspec
+  name: rubocop-rspec
   requirement: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: 3.2.0
+        version: '1.30'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: 3.2.0
+        version: '1.30'
 - !ruby/object:Gem::Dependency
-  name: simplecov
+  name: rspec
   requirement: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: 0.10.0
+        version: 3.5.0
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: 0.10.0
-description: A gem to evaluate numerical equations. Includes support for variables
+        version: 3.5.0
+- !ruby/object:Gem::Dependency
+  name: simplecov
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "<"
+      - !ruby/object:Gem::Version
+        version: '0.18'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "<"
+      - !ruby/object:Gem::Version
+        version: '0.18'
+description: A gem to evaluate mathematical equations. Includes support for variables
   and functions.
 email:
 - zach@aha.io
@@ -142,7 +156,7 @@ files:
 - lib/eqn.treetop
 - lib/eqn/calculator.rb
 - lib/eqn/comparation.rb
-- lib/eqn/engine.rb
+- lib/eqn/eqn_node.rb
 - lib/eqn/errors.rb
 - lib/eqn/expression.rb
 - lib/eqn/function.rb
@@ -154,7 +168,7 @@ homepage: https://github.com/schneidmaster/eqn
 licenses:
 - MIT
 metadata: {}
-post_install_message: 
+post_install_message:
 rdoc_options: []
 require_paths:
 - lib
@@ -169,9 +183,8 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubyforge_project: 
-rubygems_version: 2.5.1
-signing_key: 
+rubygems_version: 3.0.3
+signing_key:
 specification_version: 4
-summary: A gem to evaluate numerical equations.
+summary: A gem to evaluate mathematical equations.
 test_files: []

data/lib/eqn/engine.rb

@@ -1,11 +0,0 @@
-module Eqn
-  if defined? Rails
-    # :nocov:
-    class Engine < ::Rails::Engine
-      initializer 'eqn' do
-        config.autoload_paths += Dir["#{config.root}/lib/**/"]
-      end
-    end
-    # :nocov:
-  end
-end