rudash 2.17.4 → 3.0.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 3d799e40ff80455b2ed477fc110aa72a0cac0ebf1f3523e0bcb9faebabff0e93
-  data.tar.gz: 7e3d4c6be34feb99a7791bce6482a685d9b9944f4b59b0d21f6c8af9ba376d54
+  metadata.gz: 010e99090c5a7822aed08f891f2c1619f0fa7a4375236138cc1964085e56e4c3
+  data.tar.gz: 285bb203659eff8822da94e78e881f0288a5fb64545c8b549208391e085eae33
 SHA512:
-  metadata.gz: 2b58b76b34470accda8d425d539d1a90414df30fd58bd2f226b152ea73afa92cbd2116eb010b1434d7026a7f57c98f7155e9bfff98ae5046ae1d7e8854751cc7
-  data.tar.gz: b4eb8d6c1577c3ed0243066f16434e35d111aa74c00abbfb22a15ef1a1611dcb587f82f1fca571dfb3581406fc24184017c51aeb7e19d96abf33ea73bc1a00df
+  metadata.gz: 6eb6463f8b89b738c486aa04f4be34388765b2a17a0732a520eb49698d1575380e0484d7886772d5ea229348fef03bfe614ea1de1749db646c4ac4bb7b478460
+  data.tar.gz: cb38153995314e82750e09245286e5c8fdc38b4b2d16fb28f63677f6730160db2a1c908985895683824cc850fb8aa6b3389a8544d7b65295cd186fb112d23ea1

data/lib/rudash/{is_array.rb → array.rb}

@@ -1,6 +1,6 @@
 module Rudash
   module IsArray
-    def is_array?(value)
+    def array?(value)
       value.is_a?(Array)
     end
   end

data/lib/rudash/drop_right.rb

@@ -1,7 +1,7 @@
 module Rudash
   module DropRight
     def drop_right(array, *rest_args)
-      return [] unless self.is_array?(array)
+      return [] unless self.array?(array)
 
       n = self.head(rest_args) || 1
       return array if n <= 0

data/lib/rudash/{is_empty.rb → empty.rb}

@@ -1,6 +1,6 @@
 module Rudash
   module IsEmpty
-    def is_empty?(value)
+    def empty?(value)
       case value
       when Hash, Array
         value.empty?

data/lib/rudash/{is_equal.rb → equal.rb}

@@ -1,6 +1,6 @@
 module Rudash
   module IsEqual
-    def is_equal?(value, other)
+    def equal?(value, other)
       value == other
     end
   end

data/lib/rudash/filter.rb

@@ -8,7 +8,7 @@ module Rudash
         return self.filter(collection, slice_matcher)
       end
 
-      return [] unless Rudash::Utils.is_function?(predicate_fn)
+      return [] unless Rudash::Utils.function?(predicate_fn)
 
       if collection.is_a?(Array)
         return collection.select.with_index do |x, idx|

data/lib/rudash/flip.rb

@@ -1,12 +1,12 @@
 module Rudash
   module Flip
     def flip(a_proc)
-      raise 'Expected a Proc/Method' unless Rudash::Utils.is_function?(a_proc)
+      raise 'Expected a Proc/Method' unless Rudash::Utils.function?(a_proc)
 
       ->(*args) {
         reveresed_args = args.reverse
 
-        a_proc.(*reveresed_args)
+        a_proc.call(*reveresed_args)
       }
     end
   end

data/lib/rudash/get.rb

@@ -16,7 +16,7 @@ module Rudash
         elsif acc.is_a?(Hash)
           acc[current.to_sym] || acc[current]
         else
-          nil
+          return nil
         end
       }
 

data/lib/rudash/{is_hash.rb → hash.rb}

@@ -1,6 +1,6 @@
 module Rudash
   module IsHash
-    def is_hash?(value)
+    def hash?(value)
       value.is_a?(Hash)
     end
   end

data/lib/rudash/map.rb

@@ -4,12 +4,12 @@ module Rudash
       iteratee_fn = self.head(rest_args) || self.method(:identity)
       col = collection.is_a?(String) ? collection.split('') : collection
 
-      return self.map(collection, ->() { nil }) unless Rudash::Utils.is_function?(iteratee_fn)
+      return self.map(collection, -> { nil }) unless Rudash::Utils.function?(iteratee_fn)
 
       if col.is_a?(Array)
-        return col.map.with_index { |value, index|
+        return col.map.with_index do |value, index|
           Rudash::DynamicArgsCount.call(iteratee_fn, value, index)
-        }
+        end
       elsif col.is_a?(Hash)
         return col.map do |k, v|
           Rudash::DynamicArgsCount.call(iteratee_fn, v, k)

data/lib/rudash/negate.rb

@@ -1,7 +1,7 @@
 module Rudash
   module Negate
     def negate(a_proc)
-      raise 'Expected a Proc/Method' unless Rudash::Utils.is_function?(a_proc)
+      raise 'Expected a Proc/Method' unless Rudash::Utils.function?(a_proc)
 
       ->(*args) { !a_proc.call(*args) }
     end

data/lib/rudash/{is_nil.rb → nil.rb}

@@ -1,6 +1,6 @@
 module Rudash
   module IsNil
-    def is_nil?(object)
+    def nil?(object)
       object.nil?
     end
   end

data/lib/rudash/{is_number.rb → number.rb}

@@ -1,6 +1,6 @@
 module Rudash
   module IsNumber
-    def is_number?(value)
+    def number?(value)
       value.is_a?(Numeric)
     end
   end

data/lib/rudash/reduce.rb

@@ -5,7 +5,7 @@ module Rudash
       initial_state = rest_args[1]
       col = collection.is_a?(String) ? collection.split('') : collection
 
-      return self.reduce(collection, -> () { nil }) unless Rudash::Utils.is_function?(reducer)
+      return self.reduce(collection, -> { nil }) unless Rudash::Utils.function?(reducer)
 
       case rest_args.size
       when 1
@@ -17,13 +17,13 @@ module Rudash
           end
         end
       when 2
-        return col.reduce(initial_state) { |acc, current|
+        return col.reduce(initial_state) do |acc, current|
           if col.is_a?(Hash)
             Rudash::DynamicArgsCount.call(reducer, acc, current[1], current[0])
           else
             Rudash::DynamicArgsCount.call(reducer, acc, current)
           end
-        }
+        end
       else
         return nil
       end

data/lib/rudash/reject.rb

@@ -6,7 +6,7 @@ module Rudash
       if filter.is_a?(Hash)
         slice_matcher = Rudash::SubsetDeepMatch.subset_deep_match?.call(filter)
         return self.filter(collection, self.negate(slice_matcher))
-      elsif Rudash::Utils.is_function?(filter)
+      elsif Rudash::Utils.function?(filter)
         return self.filter(collection, self.negate(filter))
       else
         return []

data/lib/rudash/size.rb

@@ -1,7 +1,7 @@
 module Rudash
   module Size
     def size(something)
-      return 0 if self.is_nil?(something)
+      return 0 if self.nil?(something)
 
       something.size
     end

data/lib/rudash/{is_string.rb → string.rb}

@@ -1,6 +1,6 @@
 module Rudash
   module IsString
-    def is_string?(object)
+    def string?(object)
       object.is_a?(String)
     end
   end

data/lib/rudash/take.rb

@@ -1,7 +1,7 @@
 module Rudash
   module Take
     def take(array, *rest_args)
-      return [] unless self.is_array?(array)
+      return [] unless self.array?(array)
 
       count = self.head(rest_args) || 1
 

data/lib/rudash/union.rb

@@ -1,7 +1,6 @@
 module Rudash
   module Union
     def union(*values)
-
       union_reducer = ->(acc, current) {
         return acc if !current.is_a?(Array) || !acc.is_a?(Array)
 

data/lib/rudash/update.rb

@@ -2,10 +2,14 @@ module Rudash
   module Update
     def update(object, path, *rest_args)
       updater_fn = self.head(rest_args) || self.method(:identity)
-      return object unless Rudash::Utils.is_function?(updater_fn)
+      return object unless Rudash::Utils.function?(updater_fn)
 
       current_value = self.get(object, path)
-      self.set(object, path, Rudash::DynamicArgsCount.call(updater_fn, current_value))
+      self.set(
+        object,
+        path,
+        Rudash::DynamicArgsCount.call(updater_fn, current_value)
+      )
       object
     end
   end

data/lib/rudash.rb

@@ -1,5 +1,5 @@
 require_relative './rudash/map.rb'
-require_relative './rudash/is_nil.rb'
+require_relative './rudash/nil.rb'
 require_relative './rudash/filter.rb'
 require_relative './rudash/some.rb'
 require_relative './rudash/every.rb'
@@ -16,18 +16,18 @@ require_relative './rudash/size.rb'
 require_relative './rudash/flip.rb'
 require_relative './rudash/identity.rb'
 require_relative './rudash/get.rb'
-require_relative './rudash/is_array.rb'
-require_relative './rudash/is_equal.rb'
-require_relative './rudash/is_hash.rb'
-require_relative './rudash/is_empty.rb'
+require_relative './rudash/array.rb'
+require_relative './rudash/equal.rb'
+require_relative './rudash/hash.rb'
+require_relative './rudash/empty.rb'
 require_relative './rudash/reverse.rb'
 require_relative './rudash/curry.rb'
-require_relative './rudash/is_number.rb'
+require_relative './rudash/number.rb'
 require_relative './rudash/keys.rb'
 require_relative './rudash/each.rb'
 require_relative './rudash/uniq.rb'
 require_relative './rudash/difference.rb'
-require_relative './rudash/is_string.rb'
+require_relative './rudash/string.rb'
 require_relative './rudash/eq.rb'
 require_relative './rudash/each_right.rb'
 require_relative './rudash/at.rb'
@@ -64,6 +64,8 @@ require_relative './utils/chain_wrapper.rb'
 # This is the exposed Gem class that contains all Rudash methods.
 # New methods can use already implemented methods by refering to "self"
 # in the method if and only if the method get extended into the R_ class.
+
+# rubocop:disable Naming/ClassAndModuleCamelCase
 class R_
   extend Rudash::Map
   extend Rudash::IsNil
@@ -120,3 +122,5 @@ class R_
   extend Rudash::FlowRight
   extend Rudash::Unset
 end
+
+# rubocop:enable Naming/ClassAndModuleCamelCase

data/lib/utils/chain_wrapper.rb

@@ -3,16 +3,16 @@ module Rudash
     class ChainWrapper
       attr_reader :value
 
-      def initialize(value, r_)
+      def initialize(value, ru_)
         @value = value
-        @r_ = r_
+        @ru_ = ru_
       end
 
       def method_missing(method_name, *args, &_block)
-        result = @r_.public_send(method_name, @value, *args)
-        self.class.new(result, @r_)
+        result = @ru_.public_send(method_name, @value, *args)
+        self.class.new(result, @ru_)
       rescue NameError
-        raise NameError.new("\"#{method_name}\" doesn't exist in Rudash")
+        raise NameError, "\"#{method_name}\" doesn't exist in Rudash"
       end
     end
   end

data/lib/utils/dynamic_args_count.rb

@@ -1,16 +1,17 @@
-# This module was written in order to give the predicate functions for R_.filter, R_.map, R_.each, etc..
-# to be called with any dynamic arguments as it can. What differante JavaScript from Ruby is that once you configured a function
-# with a specific set of arguments then you must call it with that set or else you will get an exception.
-# That is so useful for predicate functions that developer define out of the library scope. We send all the arguments
-# to the developer defined Proc and if it's failed because of ArgumentError we call it recursively with less argument until success.
+# This module was written in order to give the predicate functions for R_.filter, R_.map, R_.each.
+# to be called with any dynamic arguments as it can. What differante JavaScript from Ruby is that
+# once you configured a function with a specific set of arguments then you must call it with that
+# set or else you will get an exception.
+# That is so useful for predicate functions that developer define out of the library scope.
+# We send all the arguments to the developer defined Proc and if it's failed
+# because of ArgumentError we call it recursively with less argument until success.
 
 module Rudash
   module DynamicArgsCount
     def self.call(func, *args)
       func.call(*args)
-
     rescue ArgumentError
-      raise ArgumentError.new('Argument Error') if args.size.zero?
+      raise ArgumentError, 'Argument Error' if args.size.zero?
 
       *initial, _last = args
       self.call(func, *initial)

data/lib/utils/index.rb

@@ -8,7 +8,7 @@ module Rudash
       str.match(/^(\d)+$/)
     end
 
-    def self.is_function?(func)
+    def self.function?(func)
       func.is_a?(Proc) || func.is_a?(Method)
     end
 

data/lib/utils/nested_path_creator.rb

@@ -3,27 +3,24 @@ require_relative './index.rb'
 
 # This module will create the nested path when using R_.set on not existing paths
 # If we've a hash as { a: 1 } and we run R_.set(hash, 'a.b.c.d', 5) then we want to create the whole
-# path ['a', 'b', 'c', 'd'] as embedded hashes. If we have some string that matches a number then we create an array.
+# path ['a', 'b', 'c', 'd'] as embedded hashes.
+# If we have some string that matches a number then we create an array.
 
 module Rudash
   module NestedPathCreator
     def self.create_path_if_not_exist(object, resolved_path)
       path = R_.head(resolved_path)
-      return nil if !resolved_path.is_a?(Array) || R_.is_nil?(path)
+      return nil if !resolved_path.is_a?(Array) || R_.nil?(path)
 
       path_key = Utils.match_number?(path) ? path.to_i : path.to_sym
       rest_paths = R_.tail(resolved_path)
       next_path = R_.head(rest_paths)
       value = R_.get(object, path)
 
-      if R_.is_nil?(value) || (!value.is_a?(Hash) && !value.is_a?(Array))
+      if R_.nil?(value) || (!value.is_a?(Hash) && !value.is_a?(Array))
         # If the next path item is numeric (index)
         # then we want to create an array otherwise we create a hash
-        if next_path && Utils.match_number?(next_path)
-          object[path_key] = []
-        else
-          object[path_key] = {}
-        end
+        object[path_key] = next_path && Utils.match_number?(next_path) ? [] : {}
       end
 
       # Do the same recursively for next path

data/lib/utils/path_resolver.rb

@@ -2,17 +2,16 @@ require_relative '../rudash'
 
 # This module have the logic of resolving the paths for R_.get, R_.set and R_.update.
 # The resolve method will transform the path 'a.b.c.d[0]' to ['a', 'b', 'c', 'd', '0'].
-# The mentioned functions above can get the path in either way but we want to normilize the string path
-# to the array shape in order to make the logic related only to one data structure.
+# The mentioned functions above can get the path in either way
+# but we want to normilize the string path to the array shape in order to
+# make the logic related only to one data structure.
 
 module Rudash
   module PathResolver
     def self.resolve(path)
       normalized_path = path
 
-      if normalized_path.is_a?(Array)
-        normalized_path = normalized_path.join('.')
-      end
+      normalized_path = normalized_path.join('.') if normalized_path.is_a?(Array)
 
       filter_not_empty = ->(value) {
         value != ''

data/lib/utils/subset_deep_match.rb

@@ -1,7 +1,7 @@
 require_relative '../rudash'
 
 # This module was written to supply complex subset deep hash and array matching
-# in order to give R_.filter, R_.some?, R_.every? and R_.find the ability to deep match with complex hash queries.
+# in order to give filter, some?, every? and find the ability to deep match with complex hash query.
 # See test_filter_hashes_by_deep_hash (test/filter.rb)
 
 module Rudash
@@ -14,9 +14,9 @@ module Rudash
         # check if every "slice" items exist somehow in the collection
         # without any order consideration.
         if slice.is_a?(Array) && collection.is_a?(Array)
-          return R_.every?(slice, ->(sliceVal) {
-            R_.some?(collection, ->(collectionVal) {
-              self.subset_deep_match?.call(sliceVal, collectionVal)
+          return R_.every?(slice, ->(slice_val) {
+            R_.some?(collection, ->(collection_val) {
+              self.subset_deep_match?.call(slice_val, collection_val)
             })
           })
         end
@@ -39,7 +39,7 @@ module Rudash
             # It's the same hack for JavaScript forEach function.
             raise if match == false
           })
-        rescue
+        rescue StandardError
           return false
         end
 

data/lib/version.rb

@@ -1,3 +1,3 @@
 module Rudash
-  VERSION = '2.17.4'.freeze
+  VERSION = '3.0.0'.freeze
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: rudash
 version: !ruby/object:Gem::Version
-  version: 2.17.4
+  version: 3.0.0
 platform: ruby
 authors:
 - Islam Attrash
@@ -17,6 +17,7 @@ extensions: []
 extra_rdoc_files: []
 files:
 - lib/rudash.rb
+- lib/rudash/array.rb
 - lib/rudash/at.rb
 - lib/rudash/capitalize.rb
 - lib/rudash/chain.rb
@@ -27,7 +28,9 @@ files:
 - lib/rudash/drop_right.rb
 - lib/rudash/each.rb
 - lib/rudash/each_right.rb
+- lib/rudash/empty.rb
 - lib/rudash/eq.rb
+- lib/rudash/equal.rb
 - lib/rudash/every.rb
 - lib/rudash/filter.rb
 - lib/rudash/find.rb
@@ -37,22 +40,18 @@ files:
 - lib/rudash/flow_right.rb
 - lib/rudash/get.rb
 - lib/rudash/group_by.rb
+- lib/rudash/hash.rb
 - lib/rudash/head.rb
 - lib/rudash/identity.rb
 - lib/rudash/initial.rb
 - lib/rudash/intersection.rb
-- lib/rudash/is_array.rb
-- lib/rudash/is_empty.rb
-- lib/rudash/is_equal.rb
-- lib/rudash/is_hash.rb
-- lib/rudash/is_nil.rb
-- lib/rudash/is_number.rb
-- lib/rudash/is_string.rb
 - lib/rudash/join.rb
 - lib/rudash/keys.rb
 - lib/rudash/last.rb
 - lib/rudash/map.rb
 - lib/rudash/negate.rb
+- lib/rudash/nil.rb
+- lib/rudash/number.rb
 - lib/rudash/pick.rb
 - lib/rudash/range.rb
 - lib/rudash/reduce.rb
@@ -64,6 +63,7 @@ files:
 - lib/rudash/size.rb
 - lib/rudash/slice.rb
 - lib/rudash/some.rb
+- lib/rudash/string.rb
 - lib/rudash/tail.rb
 - lib/rudash/take.rb
 - lib/rudash/union.rb