expertsort 0.0.1 → 0.0.3

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 5aadeb57bd061e576f10de0e93903a96c65347d7
+  data.tar.gz: 2b9f4129264205584044ecd568008e5cc59a982b
+SHA512:
+  metadata.gz: f032d46951090d48765ec43e3d37036c219662fa31a327141af1f5a6acd9c4e7794bafe077a8c60f8d3bbea14d855e94717d8201f4d9d1ac015318ed83aa5003
+  data.tar.gz: cf5812e933a2436e259de2baa6ae482d5ff3739c2caf7b3c0dae7614756b574db4fa9f25c14905ceb90fc66c54d5c20fc4861b368036101dfd875374c8580db4

data/README.md

@@ -2,7 +2,7 @@
 
 Expertsort (stylised EXPERTSORT) is a collection of EXPERT PROGRAMMER sorting algorithms.
 
-Ever felt that sorting in Ruby is too fast?
+Ever felt that sorting in Ruby is efficient?
 
 Need a slow algorithm for v0.0.1 of your application?
 
@@ -28,6 +28,8 @@ Or install it yourself as:
 
 ## Usage
 
+    require 'expertsort'
+
     [5, 4, 3, 1, 2].bogosort
     => [1, 2, 3, 4, 5]
 

data/lib/expertsort/sorts/bogobogosort.rb

@@ -0,0 +1,19 @@
+module Expertsort
+  module BogoBogoSort
+    def bogobogosort
+      self.dup.bogobogosort!
+    end
+
+    def bogobogosort!(*arr)
+      arr = (arr.length == 1) ? arr[0] : self
+      is_sorted = -> (arr) { arr.each_cons(2).all? { |a, b| (a <=> b) <= 0 } }
+
+      while !is_sorted.call(arr)
+        arr.shuffle!
+        arr.bogobogosort!(dup[0..-2])
+      end
+
+      arr
+    end
+  end
+end

data/lib/expertsort/sorts/sleepsort.rb

@@ -10,7 +10,7 @@ module Expertsort
         raise RangeError, "Cannot sleep sort an array with negative elements: #{e}" if e.to_i < 0
         threads << Thread.new do
           sleep e.to_i
-          semaphore.synchronize { sorted << e.to_i }
+          semaphore.synchronize { sorted << e }
         end
       end
 
@@ -22,4 +22,4 @@ module Expertsort
       self.replace(sleepsort)
     end
   end
-end
+end

data/lib/expertsort/version.rb

@@ -1,3 +1,3 @@
-module Expertsort
-  VERSION = "0.0.1"
-end
+module Expertsort
+  VERSION = "0.0.3"
+end

data/lib/expertsort.rb

@@ -1,12 +1,14 @@
 require "expertsort/version"
 
 require 'expertsort/sorts/bogosort'
+require 'expertsort/sorts/bogobogosort'
 require 'expertsort/sorts/sleepsort'
 require 'expertsort/sorts/slowestsort'
 require 'expertsort/sorts/stoogesort'
 
 class Array
   include Expertsort::BogoSort
+  include Expertsort::BogoBogoSort
   include Expertsort::SleepSort
   include Expertsort::SlowestSort
   include Expertsort::StoogeSort

data/spec/expertsort/expertsort_spec.rb

@@ -75,4 +75,23 @@ describe Array do
       expect(Time.now).to be > start_time + 1
     end
   end
+
+  describe 'BogoBogoSort' do
+    it 'sorts' do
+      expect([4, 3, 1, 2].bogobogosort).to eq([1, 2, 3, 4])
+    end
+
+    it 'has a destructive method' do
+      array = [4, 3, 1, 2].dup
+      old_object_id = array.object_id
+      array.bogobogosort!
+      expect(old_object_id).to eq(array.object_id)
+    end
+
+    it 'takes a very long time' do
+      start_time = Time.now
+      @unsorted.bogobogosort
+      expect(Time.now).to be > start_time + 3
+    end
+  end
 end

metadata

@@ -1,33 +1,35 @@
 --- !ruby/object:Gem::Specification
 name: expertsort
 version: !ruby/object:Gem::Version
-  version: 0.0.1
-  prerelease: 
+  version: 0.0.3
 platform: ruby
 authors:
 - Ng Guoyou
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2013-08-15 00:00:00.000000000 Z
+date: 2013-12-30 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rspec
-  requirement: &25494828 !ruby/object:Gem::Requirement
-    none: false
+  requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - '>='
       - !ruby/object:Gem::Version
         version: '0'
   type: :development
   prerelease: false
-  version_requirements: *25494828
-description: ! "Expertsort (stylised EXPERTSORT) is a collection of EXPERT PROGRAMMER
-  sorting algorithms.\n                     Ever felt that sorting in Ruby is too
-  fast?\n                     Need a slow algorithm for v0.0.1 of your application?
-  (So you can show your boss that you, programmer extraordinaire, significantly improved
-  performance in v0.0.2)\n                     Want to prove that sorting in Ruby
-  is slow as balls?\n                     EXPERTSORT is here to help."
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+description: |-
+  Expertsort (stylised EXPERTSORT) is a collection of EXPERT PROGRAMMER sorting algorithms.
+                       Ever felt that sorting in Ruby is too fast?
+                       Need a slow algorithm for v0.0.1 of your application? (So you can show your boss that you, programmer extraordinaire, significantly improved performance in v0.0.2)
+                       Want to prove that sorting in Ruby is slow as balls?
+                       EXPERTSORT is here to help.
 email:
 - fauxface+github@gmail.com
 executables: []
@@ -41,6 +43,7 @@ files:
 - Rakefile
 - expertsort.gemspec
 - lib/expertsort.rb
+- lib/expertsort/sorts/bogobogosort.rb
 - lib/expertsort/sorts/bogosort.rb
 - lib/expertsort/sorts/sleepsort.rb
 - lib/expertsort/sorts/slowestsort.rb
@@ -50,26 +53,25 @@ files:
 homepage: https://github.com/gyng/expertsort
 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'
 required_rubygems_version: !ruby/object:Gem::Requirement
-  none: false
   requirements:
-  - - ! '>='
+  - - '>='
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
 rubyforge_project: expertsort
-rubygems_version: 1.8.16
+rubygems_version: 2.0.3
 signing_key: 
-specification_version: 3
+specification_version: 4
 summary: A collection of EXPERT PROGRAMMER sorting algorithms.
 test_files: []