huge_enumerable 0.1.0 → 0.1.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 24da8d4e8288431fd7c8b9c59a59bf1dce237f17e7e6f14445e06dcfd3131207
-  data.tar.gz: 8ab8fffbb899039ddacc3115908c18529eb9743a18a2db311670462f48ca7369
+  metadata.gz: 89d12cc6df8a801fac7ebc11ca0bbbfb8b4878a5966ad861c8ffcf7599256169
+  data.tar.gz: 7a99114124361f229c7c75f01fe1afa694620a9bccab5fcb28d39045e2b3d957
 SHA512:
-  metadata.gz: 045a5d7a9789e496eac4e3ebaf30e7d3407acbfe4fe837ab25ae1e52d8471865ba579bebe01c0357c88bebc4b552a882d11b6c69d426b87b94ca7476f3a8d4af
-  data.tar.gz: 9fda898074669e730b2f993a74e3dae21e349102d2af651ea99adfa49b41f51261a23845cdd0a3ca03a379fc451fa55429756c6e90010ec22f18d4e60bed9cf7
+  metadata.gz: 1e39021c74162b81d22e6ae66264dccef760106e5ffe43a7d16c030806d4d42269ad78320ebd404cbb7bd125d86956fd7af6ddde20b599541a8d2cd3b0eed22f
+  data.tar.gz: cc95c24b43c8ed59221a546bbfa24d1511593eb78432e39faf9bc3317b8300baf2d968865033fabb38a25fd6b1043e3ec5bc3ff741c5ec4a50797fd5f049518e

data/lib/huge_enumerable/version.rb

@@ -1,3 +1,3 @@
 class HugeEnumerable
-  VERSION = "0.1.0"
+  VERSION = "0.1.2"
 end

data/lib/huge_enumerable.rb

@@ -106,11 +106,13 @@ class HugeEnumerable
   # If no block is given, an HugeCombination is returned instead.
   # === Caveat
   # max_array_size is currently inherited by the generated HugeCombination. This may change in the future.
-  def combination(n) # :yields: element
-    random_number_generator = rng != self.method(:rand) ? rng : nil
-    combo = HugeCombination.new(self.dup.reset!, n, max_array_size, random_number_generator)
-    if block_given?
-      combo.each { |x| yield x }
+  def combination(n, &block) # :yields: element
+    # Check to see if we have a specific random number generator to use.
+    # Using hash comparison as dups, clones, and other actions can make == and eql? return false when it is actually the same method
+    random_number_generator = rng.hash != method(:rand).hash ? rng : nil
+    combo = HugeCombination.new(self.clone.reset!, n, max_array_size, random_number_generator)
+    if block
+      combo.each(&block)
       self
     else
       combo
@@ -118,9 +120,15 @@ class HugeEnumerable
   end
 
   # Calls the given block once for each element in the next array of the collection, passing that element as a parameter.
-  def each # :yields: element
+  def each(&block) # :yields: element
     # TODO: Return an Enumerator if no block is given
-    remaining_or(max_array_size).times { |i| yield _fetch(i) }
+    remaining_or(max_array_size).times(&(block << method(:_fetch)))
+    # remaining_or(max_array_size).times { |i| yield _fetch(i) }
+  end
+
+  def initialize_copy(orig)
+    super
+    @rng = @rng.unbind.bind(self) if @rng.respond_to?(:unbind) # Make sure this is bound to self if it is a method
   end
 
   def max_array_size #:nodoc:
@@ -142,11 +150,13 @@ class HugeEnumerable
   # If no block is given, a HugePermutation is returned instead.
   # === Caveat
   # max_array_size is currently inherited by the generated HugePermutation. This may change in the future.
-  def permutation(n) # :yields: element
-    random_number_generator = rng != self.method(:rand) ? rng : nil
-    perm = HugePermutation.new(self.dup.reset!, n, max_array_size, random_number_generator)
-    if block_given?
-      perm.each { |x| yield x }
+  def permutation(n, &block) # :yields: element
+    # Check to see if we have a specific random number generator to use.
+    # Using hash comparison as dups, clones, and other actions can make == and eql? return false when it is actually the same method
+    random_number_generator = rng.hash != method(:rand).hash ? rng : nil
+    perm = HugePermutation.new(self.clone.reset!, n, max_array_size, random_number_generator)
+    if block
+      perm.each(&block)
       self
     else
       perm
@@ -165,12 +175,14 @@ class HugeEnumerable
   # === Caveat
   # max_array_size is currently inherited by the generated HugeProduct. This may change in the future.
   # other_enumerable is duped and reset if it is a HugeEnumerable. This may change in the future.
-  def product(other_enumerable) # :yields: element
-    other_enumerable = other_enumerable.dup.reset! if other_enumerable.is_a?(HugeEnumerable)
-    random_number_generator = rng != self.method(:rand) ? rng : nil
-    prod = HugeProduct.new(self.dup.reset!, other_enumerable, max_array_size, random_number_generator)
-    if block_given?
-      prod.each { |x| yield x }
+  def product(other_enumerable, &block) # :yields: element
+    other_enumerable = other_enumerable.clone.reset! if other_enumerable.is_a?(HugeEnumerable)
+    # Check to see if we have a specific random number generator to use.
+    # Using hash comparison as dups, clones, and other actions can make == and eql? return false when it is actually the same method
+    random_number_generator = rng.hash != method(:rand).hash ? rng : nil
+    prod = HugeProduct.new(self.clone.reset!, other_enumerable, max_array_size, random_number_generator)
+    if block
+      prod.each(&block)
       self
     else
       prod
@@ -221,7 +233,7 @@ class HugeEnumerable
   # ==== Side Effects
   # The new collection is reset to the current collection's original size and elements before shuffling.
   def shuffle(rng=nil)
-    self.dup.shuffle!(rng)
+    self.clone.shuffle!(rng)
   end
 
   # Randomly reorders the elements of the collection.

metadata

@@ -1,19 +1,22 @@
 --- !ruby/object:Gem::Specification
 name: huge_enumerable
 version: !ruby/object:Gem::Version
-  version: 0.1.0
+  version: 0.1.2
 platform: ruby
 authors:
 - Frank Hall
 autorequire:
 bindir: exe
 cert_chain: []
-date: 2022-07-08 00:00:00.000000000 Z
+date: 2024-06-20 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: prime_miller_rabin
   requirement: !ruby/object:Gem::Requirement
     requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.1'
     - - ">="
       - !ruby/object:Gem::Version
         version: 0.1.0
@@ -21,6 +24,9 @@ dependencies:
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.1'
     - - ">="
       - !ruby/object:Gem::Version
         version: 0.1.0
@@ -103,7 +109,7 @@ licenses:
 - MIT
 metadata:
   homepage_uri: https://github.com/ChapterHouse/huge_enumerable
-  source_code_uri: https://github.com/ChapterHouse/huge_enumerable/tree/v0.1.0
+  source_code_uri: https://github.com/ChapterHouse/huge_enumerable/tree/v0.1.2
 post_install_message:
 rdoc_options: []
 require_paths:
@@ -119,7 +125,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 3.2.32
+rubygems_version: 3.2.33
 signing_key:
 specification_version: 4
 summary: Enumerate, sample, shuffle, combine, permutate, and create products of massive