cw_sort_order 1.0.1 → 1.0.2

data/LICENSE

@@ -0,0 +1,8 @@
+Copyright 2011 Christopher Richard Wojno. All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+
+	1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+	2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY CHRISTOPHER WOJNO ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL CHRISTOPHER WOJNO OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

data/Rakefile

@@ -0,0 +1,7 @@
+require 'rake/testtask'
+Rake::TestTask.new do |t|
+	t.libs << 'test'
+end
+
+desc "Run Tests"
+task :default => :test

data/test/test_sort_order.rb

@@ -0,0 +1,108 @@
+require 'test/unit'
+require 'cw_sort_order'
+
+class PaginationOrderTest < Test::Unit::TestCase
+
+	def test_basic_creation
+		o = CW::SortOrder.asc('1').desc('2').desc('3').asc('4')
+		assert_equal 4, o.size
+		v = o.at(0)
+		assert_equal '1', v.first
+		assert_equal :asc, v.last
+		v = o.at(1)
+		assert_equal '2', v.first
+		assert_equal :desc, v.last
+		v = o.at(2)
+		assert_equal '3', v.first
+		assert_equal :desc, v.last
+		v = o.at(3)
+		assert_equal '4', v.first
+		assert_equal :asc, v.last
+	end
+
+	def test_short_hand_creation
+		o = CW::SortOrder.up('1').dn('2').dn('3').up('4')
+		assert_equal 4, o.size
+		v = o.at(0)
+		assert_equal '1', v.first
+		assert_equal :asc, v.last
+		v = o.at(1)
+		assert_equal '2', v.first
+		assert_equal :desc, v.last
+		v = o.at(2)
+		assert_equal '3', v.first
+		assert_equal :desc, v.last
+		v = o.at(3)
+		assert_equal '4', v.first
+		assert_equal :asc, v.last
+	end
+
+	def test_operator_creation
+		o = CW::SortOrder.new + '1' - '2' - '3' + '4'
+		assert_equal 4, o.size
+		v = o.at(0)
+		assert_equal '1', v.first
+		assert_equal :asc, v.last
+		v = o.at(1)
+		assert_equal '2', v.first
+		assert_equal :desc, v.last
+		v = o.at(2)
+		assert_equal '3', v.first
+		assert_equal :desc, v.last
+		v = o.at(3)
+		assert_equal '4', v.first
+		assert_equal :asc, v.last
+	end
+
+
+
+	def test_basic_columns_and_directions
+		o = CW::SortOrder.new + '1' - '2' - '3' + '4'
+		assert_equal %w(1 2 3 4), o.columns
+		assert_equal [:asc,:desc,:desc,:asc], o.directions
+	end
+
+	def test_basic_reverse_columns
+		o = CW::SortOrder.new + '1' - '2' - '3' - '4'
+		o = o.reverse
+		assert_equal %w(1 2 3 4).reverse, o.columns
+		assert_equal [:asc,:desc,:desc,:desc].reverse, o.directions
+	end
+
+	def test_basic_invert
+		o = CW::SortOrder.new + '1' - '2' - '3' + '4'
+		o = o.invert
+		assert_equal %w(1 2 3 4), o.columns
+		assert_equal [:desc,:asc,:asc,:desc], o.directions
+	end
+
+	def test_basic_select
+		o = CW::SortOrder.new + '1' - '2' - '3' + '4'
+		o = o.select{|col,dir| dir.eql?(:asc) }
+		assert_equal %w(1 4), o.columns
+	end
+	def test_basic_reject
+		o = CW::SortOrder.new + '1' - '2' - '3' + '4'
+		o = o.reject{|col,dir| dir.eql?(:asc) }
+		assert_equal %w(2 3), o.columns
+	end
+
+	def test_concat
+		a = CW::SortOrder.new + '1' - '2' - '3' + '4'
+		b = CW::SortOrder.new + '5' + '6' + '7' - '8'
+		c = CW::SortOrder.new - '9' - '10' + '11' + '12'
+		o = a.concat( b ).concat( c )
+		assert_equal %w(1 2 3 4 5 6 7 8 9 10 11 12), o.columns
+		assert_equal [:asc,:desc,:desc,:asc,:asc,:asc,:asc,:desc,:desc,:desc,:asc,:asc], o.directions
+	end
+
+	def test_shift
+		a = CW::SortOrder.new + '1' - '2' - '3' + '4'
+		assert_equal ['1',:asc], a.shift
+		assert_equal ['2',:desc], a.shift
+		assert_equal ['3',:desc], a.shift
+		assert_equal ['4',:asc], a.shift
+		assert_nil a.shift
+	end
+
+end

metadata

@@ -1,13 +1,13 @@
 --- !ruby/object:Gem::Specification 
 name: cw_sort_order
 version: !ruby/object:Gem::Version 
-  hash: 21
+  hash: 19
   prerelease: 
   segments: 
   - 1
   - 0
-  - 1
-  version: 1.0.1
+  - 2
+  version: 1.0.2
 platform: ruby
 authors: 
 - Christopher Wojno
@@ -29,6 +29,9 @@ extra_rdoc_files: []
 files: 
 - lib/cw_sort_order.rb
 - .gemtest
+- LICENSE
+- Rakefile
+- test/test_sort_order.rb
 homepage: http://www.wojnosystems.com
 licenses: []