rudash 2.8.3 → 2.9.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: dc7aaeca7e82e07a1facc3dad834177b254a6d2e56d1b494855c1922e4ec48d3
-  data.tar.gz: 0f7aa124d2b72b1c12ec77f3c942f7c4315d6f19d5c91460ddd5d55056bf9d20
+  metadata.gz: 533e5c283a3565293e86f436ad14c5c31130a6e87ec4a604e2247dc8b33969c4
+  data.tar.gz: 7d5f63bdfac9d6b7759f99ca35e9be4ea07e0d7280bbc43f559c565fb7769810
 SHA512:
-  metadata.gz: 77a0eb97316bb07b9703b7d3659a139834ab79483ecf225b68e089646e93ee267d7d5357653bbb6ba981557ae65c964eca482ab4eeb5172ca958ba120df6ad31
-  data.tar.gz: d3b83b741229716e0dc356610564773d818169371dcf0b866d7db098c804f72782e34a3d44de04567011d7e8fece2176dfb638fff3a9c4271b672ddd201cc8ee
+  metadata.gz: 453931f3c25a2d5b7a2d6e86a71eeed859c1556cfd8006ad89e7d1876c0d0b0f8c1a90b62beacbe1ae98227efee6cca9a0149eb9a527ce6045afd1602d4d0a73
+  data.tar.gz: d86479387726933384808b41a435176eb271ec17fbab369e58ec6d71d9c8256a1986804a0271637d29b4336baf1da31ec0cd6051e1d4b037c635807b18a5809f

data/lib/rudash/filter.rb

@@ -22,12 +22,12 @@ module Rudash
                 end
             elsif collection.is_a?(Hash)
                 begin
-                    return collection.select { |k, v| filter.(v, k) }
+                    return collection.select { |k, v| filter.(v, k) }.values
                 rescue ArgumentError => e
                     begin
-                        return collection.select { |k, v| filter.(v) }
+                        return collection.select { |k, v| filter.(v) }.values
                     rescue ArgumentError => e
-                        return collection.select { filter.() }
+                        return collection.select { filter.() }.values
                     end
                 end
             else

data/lib/rudash/reject.rb

@@ -0,0 +1,18 @@
+require_relative '../utils/subset_deep_match.rb'
+
+module Rudash
+    module Reject
+        def reject(collection, *rest_args)
+            filter = self.head(rest_args) || self.method(:identity).to_proc
+
+            if filter.is_a?(Hash)
+                slice_matcher = Rudash::SubsetDeepMatch.subset_deep_match?.(filter)
+                return self.filter(collection, self.negate(slice_matcher)) 
+            elsif filter.is_a?(Proc)
+                return self.filter(collection, self.negate(filter))
+            else
+                return []
+            end
+        end
+    end
+end

data/lib/rudash.rb

@@ -44,7 +44,11 @@ require_relative './rudash/update.rb'
 require_relative './rudash/slice.rb'
 require_relative './rudash/remove.rb'
 require_relative './rudash/union.rb'
+require_relative './rudash/reject.rb'
 
+# This is the exposed Gem class that contains all Rudash methods.
+# New methods can use already implemented methods in the library by refering to "self"
+# in the method if and only if the method get extended into the R_ class.
 class R_
     extend Rudash::Map
     extend Rudash::IsNil
@@ -92,4 +96,5 @@ class R_
     extend Rudash::Slice
     extend Rudash::Remove
     extend Rudash::Union
+    extend Rudash::Reject
 end

data/lib/utils/index.rb

@@ -1,3 +1,5 @@
+# This module will contain tiny general utilities
+
 module Rudash
     module Utils
         def self.match_number?(str)

data/lib/utils/nested_path_creator.rb

@@ -1,6 +1,10 @@
 require_relative '../rudash'
 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.
+
 module Rudash
     module NestedPathCreator
         def self.create_path_if_not_exist(object, resolved_path)
@@ -13,13 +17,15 @@ module Rudash
             value = R_.get(object, path)
     
             if R_.is_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
             end
-    
+            
+            # Do the same recursively for next path until getting to the last path item
             self.create_path_if_not_exist(
                 R_.get(object, path),
                 rest_paths

data/lib/utils/path_resolver.rb

@@ -1,5 +1,10 @@
 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.
+
 module Rudash
     module PathResolver
         def self.resolve(path)

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 filter, some?, every? and find the ability to deep match with complex hash queries.
+# in order to give R_.filter, R_.some?, R_.every? and R_.find the ability to deep match with complex hash queries.
 # See test_filter_hashes_by_deep_hash (test/filter.rb)
 
 module Rudash

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: rudash
 version: !ruby/object:Gem::Version
-  version: 2.8.3
+  version: 2.9.0
 platform: ruby
 authors:
 - Islam Attrash
@@ -52,6 +52,7 @@ files:
 - lib/rudash/pick.rb
 - lib/rudash/reduce.rb
 - lib/rudash/reduce_right.rb
+- lib/rudash/reject.rb
 - lib/rudash/remove.rb
 - lib/rudash/reverse.rb
 - lib/rudash/set.rb