sixarm_ruby_array_slice 2.1.4 → 2.1.6

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: ff77a74133d4988170b58c17c27bea75378c1a89
+  data.tar.gz: 6fce1f9f68829d45c509d9380b724f8aee24667b
+SHA512:
+  metadata.gz: e5e11679627e98867a0c33f75559b0ea4e7786f1dd391706ac29a88de33f9600dde05f61547aee98eb424c8bf8e05d6d4686196414b035508e7a047db359839d
+  data.tar.gz: 542f529026779212f8fbf1137b54f9f3e9554062ff2ee72f302951aacd69f77d39ad5fb163dcedfb90a0fab3dd50c6acdf3602ff8e36ba8ed0c9595878a5b4e5

data/Rakefile

@@ -1,8 +1,8 @@
 # -*- coding: utf-8 -*-
-require 'rake'
-require 'rake/testtask'
+require "rake"
+require "rake/testtask"
 
 Rake::TestTask.new(:test) do |t|
-  t.libs << 'lib' << 'test'
-  t.pattern = 'test/*.rb'
+  t.libs.push("lib", "test")
+  t.pattern = "test/**/*.rb"
 end

data/lib/sixarm_ruby_array_slice.rb

@@ -3,68 +3,4 @@
 Please see README
 =end
 
-
-class Array
-
-
-  # Slice the array into sub-arrays of size _n_.
-  #
-  # @return [Array<Array<Object>>] slices where each slice has approximately _n_ items
-  #
-  # If the array divides evenly then each slice has _n_ items:
-  #
-  #    [1,2,3,4,5,6,7,8].slice_by_size(2) => [[1,2],[3,4],[5,6],[7,8]]
-  #    [1,2,3,4,5,6,7,8].slice_by_size(4) => [[1,2,3,4],[5,6,7,8]]
-  #
-  # If the array does not divide evenly then the last slice will be smaller:
-  #
-  #    [1,2,3,4,5,6,7,8].slice_by_size(3) => [[1,2,3],[4,5,6],[7,8]]
-  #
-  # If the array size is small compared to _n_ then the results will be best-attempt:
-  #
-  #    [1,2,3,4,5,6,7,8].slice_by_size(7) => [[1,2,3,4,5,6,7],[8]]
-  #
-  # Compare #slice_by_share
-
-  def slice_by_size(size)
-    (size.is_a? Integer) or (raise ArgumentError, "size must be an integer")
-    (size > 0) or (raise ArgumentError, "size must be > 0")
-    arr=[]
-    index=0
-    while index<length
-      arr.push self[index...(index+size)]
-      index+=size
-    end
-    return arr
-  end
-
-
-  # Slice the array into _n_ sub-arrays of the same size.
-  #
-  # @return [Array<Array<Object>>] _n_ slices where each slice is approximately the same size.
-  #
-  # If the array divides evenly, then each slice has size/n items:
-  #
-  #     [1,2,3,4,5,6,7,8].slice_by_share(2) => [[1,2,3,4],[5,6,7,8]]
-  #     [1,2,3,4,5,6,7,8].slice_by_share(4) => [[1,2],[3,4],[5,6],[7,8]]
-  #
-  # If the array does not divide evenly then the latter slices will be smaller:
-  #
-  #     [1,2,3,4,5,6,7,8].slice_by_share(3) => [[1,2,3],[4,5,6],[7,8]] 
-  #
-  # If the array size is small compared to _n_ then the results will be best-attempt:
-  #
-  #     [1,2,3,4,5,6,7,8].slice_by_share(7) => [[1,2],[3,4],[5,6],[7,8],[],[],[]]
-  #
-  # Compare #slice_by_size
-
-  def slice_by_share(share)
-    (share.is_a? Integer) or (raise ArgumentError, "share must be an integer")
-    (share > 0) or (raise ArgumentError, "share must be > 0")
-    arr = slice_by_size((length.to_f/share.to_f).ceil)
-    while arr.size < share do arr << [] end
-    return arr
-  end
-
-
-end
+require_relative "sixarm_ruby_array_slice/array"

data/lib/sixarm_ruby_array_slice/array.rb

@@ -0,0 +1,66 @@
+# -*- coding: utf-8 -*-
+=begin rdoc
+Array extentions.
+=end
+
+class Array
+
+  # Slice the array into sub-arrays of size _n_.
+  #
+  # @return [Array<Array<Object>>] slices where each slice has approximately _n_ items
+  #
+  # If the array divides evenly then each slice has _n_ items:
+  #
+  #    [1,2,3,4,5,6,7,8].slice_by_size(2) => [[1,2],[3,4],[5,6],[7,8]]
+  #    [1,2,3,4,5,6,7,8].slice_by_size(4) => [[1,2,3,4],[5,6,7,8]]
+  #
+  # If the array does not divide evenly then the last slice will be smaller:
+  #
+  #    [1,2,3,4,5,6,7,8].slice_by_size(3) => [[1,2,3],[4,5,6],[7,8]]
+  #
+  # If the array size is small compared to _n_ then the results will be best-attempt:
+  #
+  #    [1,2,3,4,5,6,7,8].slice_by_size(7) => [[1,2,3,4,5,6,7],[8]]
+  #
+  # Compare #slice_by_share
+
+  def slice_by_size(size)
+    (size.is_a? Integer) or (raise ArgumentError, "size must be an integer")
+    (size > 0) or (raise ArgumentError, "size must be > 0")
+    arr=[]
+    index=0
+    while index<length
+      arr.push self[index...(index+size)]
+      index+=size
+    end
+    return arr
+  end
+
+  # Slice the array into _n_ sub-arrays of the same size.
+  #
+  # @return [Array<Array<Object>>] _n_ slices where each slice is approximately the same size.
+  #
+  # If the array divides evenly, then each slice has size/n items:
+  #
+  #     [1,2,3,4,5,6,7,8].slice_by_share(2) => [[1,2,3,4],[5,6,7,8]]
+  #     [1,2,3,4,5,6,7,8].slice_by_share(4) => [[1,2],[3,4],[5,6],[7,8]]
+  #
+  # If the array does not divide evenly then the latter slices will be smaller:
+  #
+  #     [1,2,3,4,5,6,7,8].slice_by_share(3) => [[1,2,3],[4,5,6],[7,8]] 
+  #
+  # If the array size is small compared to _n_ then the results will be best-attempt:
+  #
+  #     [1,2,3,4,5,6,7,8].slice_by_share(7) => [[1,2],[3,4],[5,6],[7,8],[],[],[]]
+  #
+  # Compare #slice_by_size
+
+  def slice_by_share(share)
+    (share.is_a? Integer) or (raise ArgumentError, "share must be an integer")
+    (share > 0) or (raise ArgumentError, "share must be > 0")
+    arr = slice_by_size((length.to_f/share.to_f).ceil)
+    while arr.size < share do arr << [] end
+    return arr
+  end
+
+end

data/test/sixarm_ruby_array_slice_test.rb

@@ -1,107 +1,11 @@
 # -*- coding: utf-8 -*-
-require 'minitest/autorun'
-require 'simplecov'
+require "minitest/autorun"
+require "coveralls"
+require "simplecov"
+Coveralls.wear!
+SimpleCov.formatter = SimpleCov::Formatter::MultiFormatter[
+  SimpleCov::Formatter::HTMLFormatter,
+  Coveralls::SimpleCov::Formatter
+]
 SimpleCov.start
-require 'sixarm_ruby_array_slice'
-
-describe Array do
-
-  before do
-    A ||= [1,2,3,4,5,6,7,8]
-  end
-
-  describe "#slice_by_size" do
-
-    it "with 1 count" do
-      A.slice_by_size(1).must_equal [[1],[2],[3],[4],[5],[6],[7],[8]]
-    end
-
-    it "with balanced results" do
-      A.slice_by_size(2).must_equal [[1,2],[3,4],[5,6],[7,8]]
-      A.slice_by_size(4).must_equal [[1,2,3,4],[5,6,7,8]]
-    end
-
-    it "with unbalanced results" do
-      A.slice_by_size(3).must_equal [[1,2,3],[4,5,6],[7,8]]
-    end
-
-    it "with very unbalanced results" do
-      A.slice_by_size(7).must_equal [[1,2,3,4,5,6,7],[8]]
-    end
-
-    it "with empty input" do
-      [].slice_by_size(1).must_equal []
-    end
-
-    it "with 0 count" do
-      assert_raise ArgumentError do
-        A.slice_by_size(0)
-      end
-    end
-
-    it "with negative count" do
-      assert_raise ArgumentError do
-        A.slice_by_size(-1)
-      end
-    end
-
-    it "with float count" do
-      assert_raise ArgumentError do
-        A.slice_by_size(1.234)
-      end
-    end
-
-    it "with non numeric count" do
-      assert_raise ArgumentError do
-        A.slice_by_size(1.234)
-      end
-    end
-
-  end
-
-  describe "#slice_by_share" do
-
-    it "with 1 count" do
-      A.slice_by_share(1).must_equal [[1,2,3,4,5,6,7,8]]
-    end
-
-    it "with balanced results" do
-      A.slice_by_share(2).must_equal [[1,2,3,4],[5,6,7,8]]
-      A.slice_by_share(4).must_equal [[1,2],[3,4],[5,6],[7,8]]
-    end
-
-    it "with unbalanced results" do
-      A.slice_by_share(3).must_equal [[1,2,3],[4,5,6],[7,8]]
-    end
-
-    it "with very unbalanced results" do
-      A.slice_by_share(7).must_equal [[1,2],[3,4],[5,6],[7,8],[],[],[]]
-    end
-
-    it "with zero count" do
-      assert_raise ArgumentError do
-        A.slice_by_share(0)
-      end
-    end
-
-    it "with negative count" do
-      assert_raise ArgumentError do
-        A.slice_by_share(-1)
-      end
-    end
-
-    it "with float count" do
-      assert_raise ArgumentError do
-        A.slice_by_share(1.234)
-      end
-    end
-
-    it "with non numeric count" do
-      assert_raise ArgumentError do
-        A.slice_by_share("")
-      end
-    end
-
-  end
-
-end
+require "sixarm_ruby_array_slice"

data/test/sixarm_ruby_array_slice_test/array_test.rb

@@ -0,0 +1,104 @@
+# -*- coding: utf-8 -*-
+require "sixarm_ruby_array_slice_test"
+
+describe Array do
+
+  before do
+    A ||= [1,2,3,4,5,6,7,8]
+  end
+
+  describe "#slice_by_size" do
+
+    it "with 1 count" do
+      A.slice_by_size(1).must_equal [[1],[2],[3],[4],[5],[6],[7],[8]]
+    end
+
+    it "with balanced results" do
+      A.slice_by_size(2).must_equal [[1,2],[3,4],[5,6],[7,8]]
+      A.slice_by_size(4).must_equal [[1,2,3,4],[5,6,7,8]]
+    end
+
+    it "with unbalanced results" do
+      A.slice_by_size(3).must_equal [[1,2,3],[4,5,6],[7,8]]
+    end
+
+    it "with very unbalanced results" do
+      A.slice_by_size(7).must_equal [[1,2,3,4,5,6,7],[8]]
+    end
+
+    it "with empty input" do
+      [].slice_by_size(1).must_equal []
+    end
+
+    it "with 0 count" do
+      assert_raise ArgumentError do
+        A.slice_by_size(0)
+      end
+    end
+
+    it "with negative count" do
+      assert_raise ArgumentError do
+        A.slice_by_size(-1)
+      end
+    end
+
+    it "with float count" do
+      assert_raise ArgumentError do
+        A.slice_by_size(1.234)
+      end
+    end
+
+    it "with non numeric count" do
+      assert_raise ArgumentError do
+        A.slice_by_size(1.234)
+      end
+    end
+
+  end
+
+  describe "#slice_by_share" do
+
+    it "with 1 count" do
+      A.slice_by_share(1).must_equal [[1,2,3,4,5,6,7,8]]
+    end
+
+    it "with balanced results" do
+      A.slice_by_share(2).must_equal [[1,2,3,4],[5,6,7,8]]
+      A.slice_by_share(4).must_equal [[1,2],[3,4],[5,6],[7,8]]
+    end
+
+    it "with unbalanced results" do
+      A.slice_by_share(3).must_equal [[1,2,3],[4,5,6],[7,8]]
+    end
+
+    it "with very unbalanced results" do
+      A.slice_by_share(7).must_equal [[1,2],[3,4],[5,6],[7,8],[],[],[]]
+    end
+
+    it "with zero count" do
+      assert_raise ArgumentError do
+        A.slice_by_share(0)
+      end
+    end
+
+    it "with negative count" do
+      assert_raise ArgumentError do
+        A.slice_by_share(-1)
+      end
+    end
+
+    it "with float count" do
+      assert_raise ArgumentError do
+        A.slice_by_share(1.234)
+      end
+    end
+
+    it "with non numeric count" do
+      assert_raise ArgumentError do
+        A.slice_by_share("")
+      end
+    end
+
+  end
+
+end

metadata

@@ -1,78 +1,171 @@
 --- !ruby/object:Gem::Specification
 name: sixarm_ruby_array_slice
 version: !ruby/object:Gem::Version
-  version: 2.1.4
-  prerelease: 
+  version: 2.1.6
 platform: ruby
 authors:
 - SixArm
 autorequire: 
 bindir: bin
 cert_chain:
-- !binary |-
-  LS0tLS1CRUdJTiBDRVJUSUZJQ0FURS0tLS0tCk1JSURCRENDQW0yZ0F3SUJB
-  Z0lKQUtQd0VFVFU1YkhvTUEwR0NTcUdTSWIzRFFFQkJRVUFNR0F4Q3pBSkJn
-  TlYKQkFZVEFsVlRNUk13RVFZRFZRUUlFd3BEWVd4cFptOXlibWxoTVJZd0ZB
-  WURWUVFIRXcxVFlXNGdSbkpoYm1OcApjMk52TVE4d0RRWURWUVFLRXdaVGFY
-  aEJjbTB4RXpBUkJnTlZCQU1UQ25OcGVHRnliUzVqYjIwd0hoY05NVEF4Ck1q
-  RXpNak15TnpFeldoY05NVE13T1RBNE1qTXlOekV6V2pCZ01Rc3dDUVlEVlFR
-  R0V3SlZVekVUTUJFR0ExVUUKQ0JNS1EyRnNhV1p2Y201cFlURVdNQlFHQTFV
-  RUJ4TU5VMkZ1SUVaeVlXNWphWE5qYnpFUE1BMEdBMVVFQ2hNRwpVMmw0UVhK
-  dE1STXdFUVlEVlFRREV3cHphWGhoY20wdVkyOXRNSUdmTUEwR0NTcUdTSWIz
-  RFFFQkFRVUFBNEdOCkFEQ0JpUUtCZ1FDOTRtRDlKRHdCc3Vuc09JMFZSM0NY
-  WGJPV2c5Y1dhV2Npd0Z5Sk5GaU03QTlJOEtQTGZYVXcKUUM0Y3pVZTVadUc0
-  V0h2aW5yV2hrckNLKzFkV0Jxb0VDbHhkRi9Gb0tPNWErdG9uR0Nqam1meTgx
-  Sm1Gamp5eAplVHNqc0h5dncrUWlrOWtwZjlhajYrcG5rTnJWc3dnTkhWZWEy
-  bzl5YWJiRWlTNlZTZUpXb1FJREFRQUJvNEhGCk1JSENNQjBHQTFVZERnUVdC
-  QlF6UEp0cW1TZ2M1M2VETjdhU3pEUXdyOVRBTERDQmtnWURWUjBqQklHS01J
-  R0gKZ0JRelBKdHFtU2djNTNlRE43YVN6RFF3cjlUQUxLRmtwR0l3WURFTE1B
-  a0dBMVVFQmhNQ1ZWTXhFekFSQmdOVgpCQWdUQ2tOaGJHbG1iM0p1YVdFeEZq
-  QVVCZ05WQkFjVERWTmhiaUJHY21GdVkybHpZMjh4RHpBTkJnTlZCQW9UCkJs
-  TnBlRUZ5YlRFVE1CRUdBMVVFQXhNS2MybDRZWEp0TG1OdmJZSUpBS1B3RUVU
-  VTViSG9NQXdHQTFVZEV3UUYKTUFNQkFmOHdEUVlKS29aSWh2Y05BUUVGQlFB
-  RGdZRUFvb0VleFAvb1BhbTFUUDcxU3l1aHhNYit1VHJaYlNRZQpqVkIrRXhS
-  d1dhZEd3YU5QVUE1NmQzOXF3YXZ3UCtpdSszSnBlb25OTVZ2YldYRjVuYUNY
-  L2RORkllUkVIekVSClpEUlFZTXFydTlURU1uYTZIRDl6cGNzdEY3dndUaEdv
-  dmxPUSszWTZwbFE0bk16aXBYY1o5VEhxczY1UElMMHEKZWFid3BDYkFvcG89
-  Ci0tLS0tRU5EIENFUlRJRklDQVRFLS0tLS0K
-date: 2012-03-16 00:00:00.000000000 Z
-dependencies: []
-description: 
+- |
+  -----BEGIN CERTIFICATE-----
+  MIIGCTCCA/GgAwIBAgIJAK3igyLv2hNNMA0GCSqGSIb3DQEBBQUAMGAxCzAJBgNV
+  BAYTAlVTMRMwEQYDVQQIEwpDYWxpZm9ybmlhMRYwFAYDVQQHEw1TYW4gRnJhbmNp
+  c2NvMQ8wDQYDVQQKEwZTaXhBcm0xEzARBgNVBAMTCnNpeGFybS5jb20wHhcNMTUw
+  MzE0MjA0MTE5WhcNMTcxMjA4MjA0MTE5WjBgMQswCQYDVQQGEwJVUzETMBEGA1UE
+  CBMKQ2FsaWZvcm5pYTEWMBQGA1UEBxMNU2FuIEZyYW5jaXNjbzEPMA0GA1UEChMG
+  U2l4QXJtMRMwEQYDVQQDEwpzaXhhcm0uY29tMIICIjANBgkqhkiG9w0BAQEFAAOC
+  Ag8AMIICCgKCAgEA4et7SlePzuE46eK5BAVVGg+yWt6FkX7xcLt3Uun9RntKPSuR
+  TbS/+KBqbja5reZD64hdQ9npxpQPKafxUm+RlCd9F5KFxwi8G9usKzCTPOwUeDI2
+  TNEfC+1eRU19QuEW58ZC0pC/bx5Zmp6/DTD6VV+qxKEE9U1M5P85LNkwnxqmRIMR
+  AN8VKOG+GRGOMNDGZ8Kp4h5V3Wyu0N7anY8AUveIx1SyLrEbAhcWp1asLs+/H22q
+  92YFgnwTtnDpZsAmNgZrVw9xY0v79BXqPoyKIl2psPfZi2mOIWi/N+cx6LGF1G+B
+  b+NZdAgwuLyFOoVknkTqsuYEsFhxz0dqDUgM/RvGrADxZk6yUD/1lBNTWnIDVKaN
+  Onu08gOb1lfn21Sbd5r/K32hngasiEuDvh61pJVwszBuFv3v++hVlvNzHw9oT7wc
+  W0z258Qw6fkPhozF5l+zaR+xPZG/4Kk4vc3D4mnw5MEHna6Q9rVsVktqGuIOie8Q
+  5MQAyjdNxywnl7GDllX97oVN+35JbyTePeUyZZnk5tb4p6BlYrd3rtQ2Te7tkQRz
+  8T4Scy5THaPvxf8SsfDGSj3AVPARvSX//hSFFxJM+up+S1jsquU0RjBU52nCdh7p
+  1hBZ1nqfVPeSktx3F+R2RZBPA692UKjpSA7r2vOEfoh3rUTEsNUBQGpPg2MCAwEA
+  AaOBxTCBwjAdBgNVHQ4EFgQUHnpLsysq561sVXhWi+3NoSb9n94wgZIGA1UdIwSB
+  ijCBh4AUHnpLsysq561sVXhWi+3NoSb9n96hZKRiMGAxCzAJBgNVBAYTAlVTMRMw
+  EQYDVQQIEwpDYWxpZm9ybmlhMRYwFAYDVQQHEw1TYW4gRnJhbmNpc2NvMQ8wDQYD
+  VQQKEwZTaXhBcm0xEzARBgNVBAMTCnNpeGFybS5jb22CCQCt4oMi79oTTTAMBgNV
+  HRMEBTADAQH/MA0GCSqGSIb3DQEBBQUAA4ICAQCYcCnvJpEhpo5mdVM8JDUuUZFt
+  qP2Kvj9J6tqugO+cuUF2S/ro4gdEQhl7Gv6+DCWHd0FQWJBSXMsZ9a6RhFGAcE5C
+  egK706Gh40yNeobd1aoUh+Pn17kYH2WSBRC+KsIvhZaAnra/1JPZItoge64GS+lM
+  PJJbVrtSati++s39wnss1QlMy9TXoesmR8vqsOU0XdCnK5hOun5RA8SYDWLffsfG
+  E3hvCg4C5viEkPY0YdC0KMSqs5kIA2nCUiqpkwIOa36rVEwiKiU7OCfE3u3baDpL
+  FlfMBznZKOdxDFAmNaxvXBe2XeTzrZPvJtnNLWL6K4LaBHhq3bBdh1Hge0iMkpQ7
+  RTIGlfhlIFkMV3wT0LTsNznUPsoo6e+IW/tDrk23mrNRY6QynTETb+QVIevuzD9m
+  Drcxp/zlVhud+a0ezdnyNvF520arJWvqA4GrOo8F+TT2vVrjscgYjiVGdSq+8wQv
+  Efa5jhe8QwG7R1rdpMMP5yBSAqWuFBczMveX5j4rp9Ifw5/XsZbgwcmdm26bjhzh
+  w2grAHIhvR9mztm6uXQlZhv1fu3P+RWHDSYhnZSCJSCdxPzQJ1mG5T5ahiL3HvCZ
+  2AC9FOGkybW6DJEFSFFMlNk0IILsa/gNp8ufGuTVLWF9FUUdMNK+TMbghnifT8/1
+  n+ES/gQPOnvmVkLDGw==
+  -----END CERTIFICATE-----
+date: 2015-07-19 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: minitest
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 5.7.0
+    - - "<"
+      - !ruby/object:Gem::Version
+        version: '6'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 5.7.0
+    - - "<"
+      - !ruby/object:Gem::Version
+        version: '6'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">"
+      - !ruby/object:Gem::Version
+        version: 10.4.2
+    - - "<"
+      - !ruby/object:Gem::Version
+        version: '11'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">"
+      - !ruby/object:Gem::Version
+        version: 10.4.2
+    - - "<"
+      - !ruby/object:Gem::Version
+        version: '11'
+- !ruby/object:Gem::Dependency
+  name: simplecov
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 0.10.0
+    - - "<"
+      - !ruby/object:Gem::Version
+        version: '2'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 0.10.0
+    - - "<"
+      - !ruby/object:Gem::Version
+        version: '2'
+- !ruby/object:Gem::Dependency
+  name: coveralls
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 0.8.2
+    - - "<"
+      - !ruby/object:Gem::Version
+        version: '2'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 0.8.2
+    - - "<"
+      - !ruby/object:Gem::Version
+        version: '2'
+description: 'Provide Array #slice_by_share, #slice_by_size'
 email: sixarm@sixarm.com
 executables: []
 extensions: []
 extra_rdoc_files: []
 files:
-- .gemtest
 - Rakefile
-- README.md
-- VERSION
 - lib/sixarm_ruby_array_slice.rb
+- lib/sixarm_ruby_array_slice/array.rb
 - test/sixarm_ruby_array_slice_test.rb
+- test/sixarm_ruby_array_slice_test/array_test.rb
 homepage: http://sixarm.com/
-licenses: []
+licenses:
+- BSD
+- GPL
+- MIT
+- PAL
+- Various
+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: 
-rubygems_version: 1.8.11
+rubygems_version: 2.4.8
 signing_key: 
-specification_version: 3
+specification_version: 4
 summary: SixArm.com » Ruby » Array slice methods
 test_files:
 - test/sixarm_ruby_array_slice_test.rb
+- test/sixarm_ruby_array_slice_test/array_test.rb
 has_rdoc: true

data/README.md

@@ -1,78 +0,0 @@
-# SixArm.com » Ruby » <br> Array slice methods by size and share
-
-* Docs: <http://sixarm.com/sixarm_ruby_array_slice/doc>
-* Repo: <http://github.com/sixarm/sixarm_ruby_array_slice>
-* Email: Joel Parker Henderson, <joel@sixarm.com>
-
-
-## Introduction
-
-Array slice methods:
-
-* #slice_by_share: divides an array into a given number of slices
-* #slice_by_size: divides an array into a slices of a given size
-
-For docs go to <http://sixarm.com/sixarm_ruby_array_slice/doc>
-
-Want to help? We're happy to get pull requests.
-
-
-## Quickstart
-
-Install:
-
-    gem install sixarm_ruby_array_slice
-
-Bundler:
-
-    gem "sixarm_ruby_array_slice", "=2.1.4"
-
-Require:
-
-    require "sixarm_ruby_array_slice"
-
-
-## Example
-
-Example of both ways to slice:
-
-    [1,2,3,4,5,6,7,8].slice_by_size(2) 
-    => [[1,2],[3,4],[5,6],[7,8]]
-
-    [1,2,3,4,5,6,7,8].slice_by_share(2) 
-    => [[1,2,3,4],[5,6,7,8]] 
-
-
-## Changes
-
-* 2012-03-16 2.1.4 1.9.3; minitest/spec; update docs, tests.
-* 2012-02-01 1.0.0 Publish.
-
-
-## License
-
-You may choose any of these open source licenses:
-
-  * Apache License
-  * BSD License
-  * CreativeCommons License, Non-commercial Share Alike
-  * GNU General Public License Version 2 (GPL 2)
-  * GNU Lesser General Public License (LGPL)
-  * MIT License
-  * Perl Artistic License
-  * Ruby License
-
-The software is provided "as is", without warranty of any kind, 
-express or implied, including but not limited to the warranties of 
-merchantability, fitness for a particular purpose and noninfringement. 
-
-In no event shall the authors or copyright holders be liable for any 
-claim, damages or other liability, whether in an action of contract, 
-tort or otherwise, arising from, out of or in connection with the 
-software or the use or other dealings in the software.
-
-This license is for the included software that is created by SixArm;
-some of the included software may have its own licenses, copyrights, 
-authors, etc. and these do take precedence over the SixArm license.
-
-Copyright (c) 2005-2013 Joel Parker Henderson

data/VERSION

@@ -1 +0,0 @@
-2.1.4