ruby19_stable_sort 0.0.1

data/.gitignore

@@ -0,0 +1,4 @@
+*.gem
+.bundle
+Gemfile.lock
+pkg/*

data/Gemfile

@@ -0,0 +1,4 @@
+source "http://rubygems.org"
+
+# Specify your gem's dependencies in ruby19_stable_sort.gemspec
+gemspec

data/Rakefile

@@ -0,0 +1,2 @@
+require 'bundler'
+Bundler::GemHelper.install_tasks

data/lib/ruby19_stable_sort.rb

@@ -0,0 +1,5 @@
+module Enumerable
+  def stable_sort_by(&block)
+    sort_by.with_index {|item, index| [block[item], index] }
+  end
+end

data/lib/ruby19_stable_sort/version.rb

@@ -0,0 +1,3 @@
+module Ruby19StableSort
+  VERSION = "0.0.1"
+end

data/ruby19_stable_sort.gemspec

@@ -0,0 +1,24 @@
+# -*- encoding: utf-8 -*-
+$:.push File.expand_path("../lib", __FILE__)
+require "ruby19_stable_sort/version"
+
+Gem::Specification.new do |s|
+  s.name        = "ruby19_stable_sort"
+  s.version     = Ruby19StableSort::VERSION
+  s.platform    = Gem::Platform::RUBY
+  s.authors     = ["Jon Moses"]
+  s.email       = ["jon@burningbush.us"]
+  s.homepage    = ""
+  s.summary     = %q{Implement a stable sort_by method.}
+  s.description = %q{The Ruby 1.8 Enumerable.sort_by method was stable, in that items with matching conditions were
+    preserved in the same order.  That's not the case in Ruby 1.9.  Some of my code depended on this behavior,
+    and I'm sure I'm not the only one.  So here's a stable_sort_by method that preserves the orders of items with
+    matching sort_by values.}
+
+  #s.rubyforge_project = "ruby19_stable_sort"
+
+  s.files         = `git ls-files`.split("\n")
+  s.test_files    = `git ls-files -- {test,spec,features}/*`.split("\n")
+  s.executables   = `git ls-files -- bin/*`.split("\n").map{ |f| File.basename(f) }
+  s.require_paths = ["lib"]
+end

data/test/ruby19_stable_sort_test.rb

@@ -0,0 +1,12 @@
+require 'minitest/autorun'
+require 'ruby19_stable_sort'
+
+class Ruby19StableSortTest < MiniTest::Unit::TestCase
+  def test_that_sort_by_still_works
+    assert_equal [[:a, 0], [:b, 1], [:d, 2], [:c, 2], [:e, 3]], [ [:a, 0], [:b, 1], [:c, 2], [:d, 2], [:e, 3] ].sort_by {|x| x[1] }
+  end
+
+  def test_that_stable_sort_by_is_stable
+    assert_equal [[:a, 0], [:b, 1], [:c, 2], [:d, 2], [:e, 3]], [ [:a, 0], [:b, 1], [:c, 2], [:d, 2], [:e, 3] ].stable_sort_by {|x| x[1] }
+  end
+end

metadata

@@ -0,0 +1,67 @@
+--- !ruby/object:Gem::Specification 
+name: ruby19_stable_sort
+version: !ruby/object:Gem::Version 
+  prerelease: 
+  version: 0.0.1
+platform: ruby
+authors: 
+- Jon Moses
+autorequire: 
+bindir: bin
+cert_chain: []
+
+date: 2011-04-24 00:00:00 -04:00
+default_executable: 
+dependencies: []
+
+description: |-
+  The Ruby 1.8 Enumerable.sort_by method was stable, in that items with matching conditions were
+      preserved in the same order.  That's not the case in Ruby 1.9.  Some of my code depended on this behavior,
+      and I'm sure I'm not the only one.  So here's a stable_sort_by method that preserves the orders of items with
+      matching sort_by values.
+email: 
+- jon@burningbush.us
+executables: []
+
+extensions: []
+
+extra_rdoc_files: []
+
+files: 
+- .gitignore
+- Gemfile
+- Rakefile
+- lib/ruby19_stable_sort.rb
+- lib/ruby19_stable_sort/version.rb
+- ruby19_stable_sort.gemspec
+- test/ruby19_stable_sort_test.rb
+has_rdoc: true
+homepage: ""
+licenses: []
+
+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: 
+rubygems_version: 1.5.2
+signing_key: 
+specification_version: 3
+summary: Implement a stable sort_by method.
+test_files: 
+- test/ruby19_stable_sort_test.rb