unique_permutation 1.0.1 → 1.0.2

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: 44423676ed73ec4103c5f6cfefe5f3727938c2b2cd55535a158a00fd08088691
+  data.tar.gz: 0b1770be1d694c8003b641103e80e33fc1bb161f82a41a6e00bc6e410e59d980
+SHA512:
+  metadata.gz: 84358188c1c306e031f83dd0aaa11a24cc6d12dc850828d653f8779fd9e408cf0ce8fc6fa235727dddfb40c6f47f25740200802fbf1261b17096537610f5df66
+  data.tar.gz: c2b1a296f976ef0141da685310a43779a06d583580124b166ce7387e4a977a4c37af5b849e94c596c74f0fe2a88e59dee78f575a7e5db629212f34e3db42fcf2

data/lib/unique_permutation.rb

@@ -2,31 +2,28 @@
 # This is incredibly more efficient that the built in permutation method as duplicate elements will yield
 # identical permutations.
 
+# Based off of Algorithm L (Donald Knuth)
+
 class Array
-  def unique_permutation(&block)
+  def unique_permutation # rubocop:disable Metrics/AbcSize, Metrics/MethodLength
     return enum_for(:unique_permutation) unless block_given?
 
-    array_copy = self.sort
+    array_copy = sort
     yield array_copy.dup
-    return if size < 2
-
-    while true
-      # Based off of Algorithm L (Donald Knuth)
-      j = size - 2;
-      j -= 1 while j > 0 && array_copy[j] >= array_copy[j+1]
+    return if size <= 1
 
-      if array_copy[j] < array_copy[j+1]
-        l = size - 1
-        l -= 1 while array_copy[j] >= array_copy[l] 
+    loop do
+      j = size - 2
+      j -= 1 while j > 0 && array_copy[j] >= array_copy[j + 1]
+      break unless array_copy[j] < array_copy[j + 1]
 
-        array_copy[j] , array_copy[l] = array_copy[l] , array_copy[j]
-        array_copy[j+1..-1] = array_copy[j+1..-1].reverse
+      l = size - 1
+      l -= 1 while array_copy[j] >= array_copy[l]
 
-        yield array_copy.dup
+      array_copy[j], array_copy[l] = array_copy[l], array_copy[j]
+      array_copy[(j + 1)..] = array_copy[(j + 1)..].reverse
 
-      else
-        break
-      end
+      yield array_copy.dup
     end
   end
-end
+end

metadata

@@ -1,45 +1,43 @@
 --- !ruby/object:Gem::Specification
 name: unique_permutation
 version: !ruby/object:Gem::Version
-  version: 1.0.1
-  prerelease: 
+  version: 1.0.2
 platform: ruby
 authors:
 - Aaron Rosenberg
-autorequire: 
+autorequire:
 bindir: bin
 cert_chain: []
-date: 2012-03-19 00:00:00.000000000 Z
+date: 2020-09-07 00:00:00.000000000 Z
 dependencies: []
-description: Adds the unique_permutation method to the array class.
+description: Adds `Array#unique_permutation` method.
 email: aarongrosenberg@gmail.com
 executables: []
 extensions: []
 extra_rdoc_files: []
 files:
 - lib/unique_permutation.rb
-homepage: https://github.com/LtCmdDudefellah/unique_permutation
-licenses: []
-post_install_message: 
+homepage: https://github.com/agrberg/unique_permutation
+licenses:
+- MIT
+metadata: {}
+post_install_message:
 rdoc_options: []
 require_paths:
 - lib
 required_ruby_version: !ruby/object:Gem::Requirement
-  none: false
   requirements:
-  - - ! '>='
+  - - "~>"
     - !ruby/object:Gem::Version
-      version: '0'
+      version: '2.6'
 required_rubygems_version: !ruby/object:Gem::Requirement
-  none: false
   requirements:
-  - - ! '>='
+  - - ">="
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubyforge_project: 
-rubygems_version: 1.8.17
-signing_key: 
-specification_version: 3
-summary: Create unique permutations from an array
+rubygems_version: 3.1.2
+signing_key:
+specification_version: 4
+summary: Find unique permutations from an array
 test_files: []