array-sorted-unique 1.0.0

data/CHANGELOG.rdoc

@@ -0,0 +1,8 @@
+
+== 6/14/2012
+
+Initial release - split from compositing-unique-array.
+
+== 6/30/2012
+
+Renamed from sorted-unique-array to array-sorted-unique. File schema updated to reflect gem name.

data/README.md

@@ -0,0 +1,44 @@
+# Sorted Unique Array #
+
+http://rubygems.org/gems/array-sorted-unique
+
+# Description #
+
+A subclass of Array::Sorted and Array::Unique (and therefore also Array::Hooked).
+
+# Summary #
+
+Provides Array::Sorted::Unique and its alias Array::Unique::Sorted as well as UniqueSortedArray and its alias SortedUniqueArray.
+
+# Install #
+
+* sudo gem install array-sorted-unique
+
+# Usage #
+
+Just like Array::Sorted and Array::Unique (provided by sorted-array and unique-array), which are subclasses of Array (and Array::Hooked, provided by hooked_array)!
+
+# License #
+
+  (The MIT License)
+
+  Copyright (c) Asher
+
+  Permission is hereby granted, free of charge, to any person obtaining
+  a copy of this software and associated documentation files (the
+  'Software'), to deal in the Software without restriction, including
+  without limitation the rights to use, copy, modify, merge, publish,
+  distribute, sublicense, and/or sell copies of the Software, and to
+  permit persons to whom the Software is furnished to do so, subject to
+  the following conditions:
+
+  The above copyright notice and this permission notice shall be
+  included in all copies or substantial portions of the Software.
+
+  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.

data/lib/array-sorted-unique.rb

@@ -0,0 +1,2 @@
+
+require_relative 'array/sorted/unique.rb'

data/lib/array/hooked/sorted/unique.rb

@@ -0,0 +1,2 @@
+
+require_relative '../../sorted/unique.rb'

data/lib/array/hooked/unique/sorted.rb

@@ -0,0 +1,2 @@
+
+require_relative '../../sorted/unique.rb'

data/lib/array/sorted/namespaces.rb

@@ -0,0 +1,10 @@
+
+class ::Array::Sorted::Unique < ::Array::Unique
+end
+
+class ::UniqueArray::Sorted < ::Array::Sorted::Unique
+end
+
+::Array::Unique::Sorted = ::Array::Sorted::Unique
+
+::SortedArray::Unique = ::UniqueArray::Sorted

data/lib/array/sorted/requires.rb

@@ -0,0 +1,27 @@
+
+basepath = 'unique'
+
+files = [
+  
+  'array_interface'
+  
+]
+
+second_basepath = '../../sorted_array/unique'
+
+second_files = [
+  
+  'array_interface'
+  
+]
+
+files.each do |this_file|
+  require_relative( File.join( basepath, this_file ) + '.rb' )
+end
+second_files.each do |this_file|
+  require_relative( File.join( second_basepath, this_file ) + '.rb' )
+end
+
+require_relative( basepath + '.rb' )
+require_relative( second_basepath + '.rb' )
+

data/lib/array/sorted/unique.rb

@@ -0,0 +1,15 @@
+
+require 'array/sorted'
+require 'array/unique'
+
+# namespaces that have to be declared ahead of time for proper load order
+require_relative './namespaces'
+
+# source file requires
+require_relative './requires.rb'
+
+class ::Array::Sorted::Unique < ::Array::Unique
+  
+  include ::Array::Sorted::Unique::ArrayInterface
+    
+end

data/lib/array/sorted/unique/array_interface.rb

@@ -0,0 +1,10 @@
+
+module ::Array::Sorted::Unique::ArrayInterface
+  
+  include ::Array::Unique::ArrayInterface
+  include ::Array::Sorted::ArrayInterface
+  
+  instances_identify_as!( ::Array::Sorted::Unique )
+  instances_identify_as!( ::Array::Unique::Sorted )
+  
+end

data/lib/array/unique/sorted.rb

@@ -0,0 +1,2 @@
+
+require_relative '../sorted/unique.rb'

data/lib/sorted_array/unique.rb

@@ -0,0 +1,6 @@
+
+class ::SortedArray::Unique < ::Array::Sorted::Unique
+  
+  include ::SortedArray::Unique::ArrayInterface
+  
+end

data/lib/sorted_array/unique/array_interface.rb

@@ -0,0 +1,10 @@
+
+module ::SortedArray::Unique::ArrayInterface
+
+  include ::UniqueArray::Interface
+  include ::SortedArray::Interface
+  
+  instances_identify_as!( ::UniqueArray::Sorted )
+  instances_identify_as!( ::SortedArray::Unique )
+
+end

data/spec/array/sorted/unique_spec.rb

@@ -0,0 +1,669 @@
+
+require_relative '../../../lib/array-sorted-unique.rb'
+
+describe ::Array::Sorted::Unique do
+
+  ################
+  #  initialize  #
+  ################
+
+  it 'can add initialize with an ancestor, inheriting its values and linking to it as a child' do
+  
+    sorted_unique_array = ::Array::Sorted::Unique.new
+
+    sorted_unique_array.instance_variable_get( :@parent_composite_object ).should == nil
+    sorted_unique_array.should == []
+    sorted_unique_array.push( :A, :B, :C, :D )
+
+  end
+
+  #########
+  #  []=  #
+  #########
+
+  it 'can add elements' do
+  
+    sorted_unique_array = ::Array::Sorted::Unique.new
+
+    sorted_unique_array[ 0 ] = :A
+    sorted_unique_array.should == [ :A ]
+
+    sorted_unique_array[ 1 ] = :B
+    sorted_unique_array.should == [ :A, :B ]
+
+    sorted_unique_array[ 0 ] = :D
+    sorted_unique_array.should == [ :B, :D ]
+
+  end
+  
+  ############
+  #  insert  #
+  ############
+
+  it 'can insert elements' do
+  
+    sorted_unique_array = ::Array::Sorted::Unique.new
+
+    sorted_unique_array.insert( 3, :D )
+    sorted_unique_array.should == [ nil, :D ]
+
+    sorted_unique_array.insert( 1, :B )
+    sorted_unique_array.should == [ nil, :B, :D ]
+
+    sorted_unique_array.insert( 2, :C )
+    sorted_unique_array.should == [ nil, :B, :C, :D ]
+
+  end
+  
+  ##########
+  #  push  #
+  #  <<    #
+  ##########
+  
+  it 'can add elements' do
+
+    sorted_unique_array = ::Array::Sorted::Unique.new
+
+    sorted_unique_array << :A
+    sorted_unique_array.should == [ :A ]
+
+    sorted_unique_array << :B
+    sorted_unique_array.should == [ :A, :B ]
+
+  end
+  
+  ############
+  #  concat  #
+  #  +       #
+  ############
+
+  it 'can add elements' do
+
+    # NOTE: this breaks + by causing it to modify the array like +=
+    # The alternative was worse.
+
+    sorted_unique_array = ::Array::Sorted::Unique.new
+
+    sorted_unique_array.concat( [ :A ] )
+    sorted_unique_array.should == [ :A ]
+
+    sorted_unique_array += [ :B ]
+    sorted_unique_array.should == [ :A, :B ]
+
+  end
+
+  ####################
+  #  delete_objects  #
+  ####################
+
+  it 'can delete multiple elements' do
+
+    sorted_unique_array = ::Array::Sorted::Unique.new
+
+    sorted_unique_array += [ :A, :B ]
+    sorted_unique_array.should == [ :A, :B ]
+
+    sorted_unique_array.delete_objects( :A, :B )
+    sorted_unique_array.should == [ ]
+
+  end
+
+  #######
+  #  -  #
+  #######
+  
+  it 'can exclude elements' do
+
+    sorted_unique_array = ::Array::Sorted::Unique.new
+
+    sorted_unique_array.push( :A )
+    sorted_unique_array.should == [ :A ]
+
+    sorted_unique_array -= [ :A ]
+    sorted_unique_array.should == [ ]
+
+    sorted_unique_array.push( :B )
+    sorted_unique_array.should == [ :B ]
+
+  end
+
+  ############
+  #  delete  #
+  ############
+  
+  it 'can delete elements' do
+
+    sorted_unique_array = ::Array::Sorted::Unique.new
+
+    sorted_unique_array.push( :A )
+    sorted_unique_array.should == [ :A ]
+
+    sorted_unique_array.delete( :A )
+    sorted_unique_array.should == [ ]
+
+    sorted_unique_array.push( :B )
+    sorted_unique_array.should == [ :B ]
+
+  end
+
+  ###############
+  #  delete_at  #
+  ###############
+
+  it 'can delete by indexes' do
+
+    sorted_unique_array = ::Array::Sorted::Unique.new
+
+    sorted_unique_array.push( :A )
+    sorted_unique_array.should == [ :A ]
+    
+    sorted_unique_array.delete_at( 0 )
+    sorted_unique_array.should == [ ]
+
+    sorted_unique_array.push( :B )
+    sorted_unique_array.should == [ :B ]
+
+  end
+
+  #######################
+  #  delete_at_indexes  #
+  #######################
+
+  it 'can delete by indexes' do
+
+    sorted_unique_array = ::Array::Sorted::Unique.new
+
+    sorted_unique_array.push( :A, :B, :C )
+    sorted_unique_array.should == [ :A, :B, :C ]
+
+    sorted_unique_array.delete_at_indexes( 0, 1 )
+    sorted_unique_array.should == [ :C ]
+
+  end
+
+  ###############
+  #  delete_if  #
+  ###############
+
+  it 'can delete by block' do
+
+    sorted_unique_array = ::Array::Sorted::Unique.new
+
+    sorted_unique_array.push( :A, :B, :C )
+    sorted_unique_array.should == [ :A, :B, :C ]
+    sorted_unique_array.delete_if do |object|
+      object != :C
+    end
+    sorted_unique_array.should == [ :C ]
+
+    sorted_unique_array.delete_if.is_a?( Enumerator ).should == true
+
+  end
+
+  #############
+  #  keep_if  #
+  #############
+
+  it 'can keep by block' do
+
+    sorted_unique_array = ::Array::Sorted::Unique.new
+
+    sorted_unique_array.push( :A, :B, :C )
+    sorted_unique_array.should == [ :A, :B, :C ]
+    sorted_unique_array.keep_if do |object|
+      object == :C
+    end
+    sorted_unique_array.should == [ :C ]
+
+  end
+
+  ##############
+  #  compact!  #
+  ##############
+
+  it 'can compact' do
+
+    sorted_unique_array = ::Array::Sorted::Unique.new
+
+    sorted_unique_array.push( :A, nil, :B, nil, :C, nil )
+    sorted_unique_array.should == [ nil, :A, :B, :C ]
+    sorted_unique_array.compact!
+    sorted_unique_array.should == [ :A, :B, :C ]
+
+  end
+
+  ##############
+  #  flatten!  #
+  ##############
+
+  it 'can flatten' do
+
+    sorted_unique_array = ::Array::Sorted::Unique.new
+
+    sorted_unique_array.push( :A, [ :F_A, :F_B ], :B, [ :F_C ], :C, [ :F_D ], [ :F_E ] )
+    sorted_unique_array.should == [ :A, [ :F_A, :F_B ], :B, [ :F_C ], :C, [ :F_D ], [ :F_E ] ]
+    sorted_unique_array.flatten!
+    sorted_unique_array.should == [ :A, :B, :C, :F_A, :F_B, :F_C, :F_D, :F_E ]
+
+  end
+
+  #############
+  #  reject!  #
+  #############
+
+  it 'can reject' do
+
+    sorted_unique_array = ::Array::Sorted::Unique.new
+
+    sorted_unique_array.push( :A, :B, :C )
+    sorted_unique_array.should == [ :A, :B, :C ]
+    sorted_unique_array.reject! do |object|
+      object != :C
+    end
+    sorted_unique_array.should == [ :C ]
+
+    sorted_unique_array.reject!.is_a?( Enumerator ).should == true
+
+  end
+
+  #############
+  #  replace  #
+  #############
+
+  it 'can replace self' do
+
+    sorted_unique_array = ::Array::Sorted::Unique.new
+
+    sorted_unique_array.push( :A, :B, :C )
+    sorted_unique_array.should == [ :A, :B, :C ]
+    sorted_unique_array.replace( [ :D, :E, :F ] )
+    sorted_unique_array.should == [ :D, :E, :F ]
+
+  end
+
+  ##############
+  #  reverse!  #
+  ##############
+
+  it 'can reverse self' do
+
+    sorted_unique_array = ::Array::Sorted::Unique.new
+
+    sorted_unique_array.push( :A, :B, :C )
+    sorted_unique_array.should == [ :A, :B, :C ]
+    sorted_unique_array.reverse!
+    sorted_unique_array.should == [ :C, :B, :A ]
+
+  end
+
+  #############
+  #  rotate!  #
+  #############
+
+  it 'can rotate self' do
+
+    sorted_unique_array = ::Array::Sorted::Unique.new
+
+    sorted_unique_array.push( :A, :B, :C )
+    sorted_unique_array.should == [ :A, :B, :C ]
+
+    sorted_unique_array.rotate!
+    sorted_unique_array.should == [ :A, :B, :C ]
+
+    sorted_unique_array.rotate!( -1 )
+    sorted_unique_array.should == [ :A, :B, :C ]
+
+  end
+
+  #############
+  #  select!  #
+  #############
+
+  it 'can keep by select' do
+
+    sorted_unique_array = ::Array::Sorted::Unique.new
+
+    sorted_unique_array.push( :A, :B, :C )
+    sorted_unique_array.should == [ :A, :B, :C ]
+    sorted_unique_array.select! do |object|
+      object == :C
+    end
+    sorted_unique_array.should == [ :C ]
+
+    sorted_unique_array.select!.is_a?( Enumerator ).should == true
+
+  end
+
+  ##############
+  #  shuffle!  #
+  ##############
+
+  it 'can shuffle self' do
+
+    sorted_unique_array = ::Array::Sorted::Unique.new
+
+    sorted_unique_array.push( :A, :B, :C )
+    sorted_unique_array.should == [ :A, :B, :C ]
+
+    first_shuffle_version = sorted_unique_array.dup
+    sorted_unique_array.shuffle!
+    sorted_unique_array.should == first_shuffle_version
+
+  end
+
+  ##############
+  #  collect!  #
+  #  map!      #
+  ##############
+
+  it 'can replace by collect/map' do
+
+    sorted_unique_array = ::Array::Sorted::Unique.new
+
+    sorted_unique_array.push( :A, :B, :C )
+    sorted_unique_array.should == [ :A, :B, :C ]
+    sorted_unique_array.collect! do |object|
+      :C
+    end
+    sorted_unique_array.should == [ :C, ]
+
+    sorted_unique_array.collect!.is_a?( Enumerator ).should == true
+
+  end
+
+  ###########
+  #  sort!  #
+  ###########
+
+  it 'can replace by collect/map' do
+
+    sorted_unique_array = ::Array::Sorted::Unique.new
+
+    sorted_unique_array.push( :A, :B, :C )
+    sorted_unique_array.should == [ :A, :B, :C ]
+    sorted_unique_array.sort! do |a, b|
+      if a < b
+        1
+      elsif a > b
+        -1
+      elsif a == b
+        0
+      end
+    end
+    sorted_unique_array.should == [ :A, :B, :C ]
+
+    sorted_unique_array.sort!
+    sorted_unique_array.should == [ :A, :B, :C ]
+
+  end
+
+  ##############
+  #  sort_by!  #
+  ##############
+
+  it 'can replace by collect/map' do
+
+    sorted_unique_array = ::Array::Sorted::Unique.new
+
+    sorted_unique_array.push( :A, :B, :C )
+    sorted_unique_array.should == [ :A, :B, :C ]
+    sorted_unique_array.sort_by! do |object|
+      case object
+      when :A
+        :B
+      when :B
+        :A
+      when :C
+        :C
+      end
+    end
+    sorted_unique_array.should == [ :A, :B, :C ]
+
+    sorted_unique_array.sort_by!.is_a?( Enumerator ).should == true
+
+  end
+
+  ###########
+  #  uniq!  #
+  ###########
+
+  it 'can remove non-unique elements' do
+
+    sorted_unique_array = ::Array::Sorted::Unique.new
+
+    sorted_unique_array.push( :A, :B, :C, :C, :C, :B, :A )
+    sorted_unique_array.should == [ :A, :B, :C ]
+    sorted_unique_array.uniq!
+    sorted_unique_array.should == [ :A, :B, :C ]
+
+  end
+
+  #############
+  #  unshift  #
+  #############
+
+  it 'can unshift onto the first element' do
+
+    sorted_unique_array = ::Array::Sorted::Unique.new
+
+    sorted_unique_array += :A
+    sorted_unique_array.should == [ :A ]
+
+    sorted_unique_array.unshift( :B )
+    sorted_unique_array.should == [ :A, :B ]
+
+  end
+
+  #########
+  #  pop  #
+  #########
+  
+  it 'can pop the final element' do
+
+    sorted_unique_array = ::Array::Sorted::Unique.new
+
+    sorted_unique_array += :A
+    sorted_unique_array.should == [ :A ]
+
+    sorted_unique_array.pop.should == :A
+    sorted_unique_array.should == [ ]
+
+    sorted_unique_array += :B
+    sorted_unique_array.should == [ :B ]
+
+  end
+
+  ###########
+  #  shift  #
+  ###########
+  
+  it 'can shift the first element' do
+
+    sorted_unique_array = ::Array::Sorted::Unique.new
+
+    sorted_unique_array += :A
+    sorted_unique_array.should == [ :A ]
+
+    sorted_unique_array.shift.should == :A
+    sorted_unique_array.should == [ ]
+
+    sorted_unique_array += :B
+    sorted_unique_array.should == [ :B ]
+
+  end
+
+  ############
+  #  slice!  #
+  ############
+  
+  it 'can slice elements' do
+
+    sorted_unique_array = ::Array::Sorted::Unique.new
+
+    sorted_unique_array += :A
+    sorted_unique_array.should == [ :A ]
+
+    sorted_unique_array.slice!( 0, 1 ).should == [ :A ]
+    sorted_unique_array.should == [ ]
+
+    sorted_unique_array += :B
+    sorted_unique_array.should == [ :B ]
+
+  end
+  
+  ###########
+  #  clear  #
+  ###########
+
+  it 'can clear, causing present elements to be excluded' do
+
+    sorted_unique_array = ::Array::Sorted::Unique.new
+
+    sorted_unique_array += :A
+    sorted_unique_array.should == [ :A ]
+
+    sorted_unique_array.clear
+    sorted_unique_array.should == [ ]
+
+    sorted_unique_array += :B
+    sorted_unique_array.should == [ :B ]
+
+  end
+
+  ##################
+  #  pre_set_hook  #
+  ##################
+
+  it 'has a hook that is called before setting a value; return value is used in place of object' do
+    
+    class ::Array::Sorted::Unique::SubMockPreSet < ::Array::Sorted::Unique
+      
+      def pre_set_hook( index, object, is_insert = false )
+        return :some_other_value
+      end
+      
+    end
+    
+    sorted_unique_array = ::Array::Sorted::Unique::SubMockPreSet.new
+
+    sorted_unique_array.push( :some_value )
+    
+    sorted_unique_array.should == [ :some_other_value ]
+    
+  end
+
+  ###################
+  #  post_set_hook  #
+  ###################
+
+  it 'has a hook that is called after setting a value' do
+
+    class ::Array::Sorted::Unique::SubMockPostSet < ::Array::Sorted::Unique
+      
+      def post_set_hook( index, object, is_insert = false )
+        return :some_other_value
+      end
+      
+    end
+    
+    sorted_unique_array = ::Array::Sorted::Unique::SubMockPostSet.new
+
+    sorted_unique_array.push( :some_value ).should == [ :some_other_value ]
+    
+    sorted_unique_array.should == [ :some_value ]
+    
+  end
+
+  ##################
+  #  pre_get_hook  #
+  ##################
+
+  it 'has a hook that is called before getting a value; if return value is false, get does not occur' do
+    
+    class ::Array::Sorted::Unique::SubMockPreGet < ::Array::Sorted::Unique
+      
+      def pre_get_hook( index )
+        return false
+      end
+      
+    end
+    
+    sorted_unique_array = ::Array::Sorted::Unique::SubMockPreGet.new
+    
+    sorted_unique_array.push( :some_value )
+    sorted_unique_array[ 0 ].should == nil
+    
+    sorted_unique_array.should == [ :some_value ]
+    
+  end
+
+  ###################
+  #  post_get_hook  #
+  ###################
+
+  it 'has a hook that is called after getting a value' do
+
+    class ::Array::Sorted::Unique::SubMockPostGet < ::Array::Sorted::Unique
+      
+      def post_get_hook( index, object )
+        return :some_other_value
+      end
+      
+    end
+    
+    sorted_unique_array = ::Array::Sorted::Unique::SubMockPostGet.new
+    
+    sorted_unique_array.push( :some_value )
+    sorted_unique_array[ 0 ].should == :some_other_value
+    
+    sorted_unique_array.should == [ :some_value ]
+    
+  end
+
+  #####################
+  #  pre_delete_hook  #
+  #####################
+
+  it 'has a hook that is called before deleting an index; if return value is false, delete does not occur' do
+    
+    class ::Array::Sorted::Unique::SubMockPreDelete < ::Array::Sorted::Unique
+      
+      def pre_delete_hook( index )
+        return false
+      end
+      
+    end
+    
+    sorted_unique_array = ::Array::Sorted::Unique::SubMockPreDelete.new
+    
+    sorted_unique_array.push( :some_value )
+    sorted_unique_array.delete_at( 0 )
+    
+    sorted_unique_array.should == [ :some_value ]
+    
+  end
+
+  ######################
+  #  post_delete_hook  #
+  ######################
+
+  it 'has a hook that is called after deleting an index' do
+    
+    class ::Array::Sorted::Unique::SubMockPostDelete < ::Array::Sorted::Unique
+      
+      def post_delete_hook( index, object )
+        return :some_other_value
+      end
+      
+    end
+    
+    sorted_unique_array = ::Array::Sorted::Unique::SubMockPostDelete.new
+    
+    sorted_unique_array.push( :some_value )
+    sorted_unique_array.delete_at( 0 ).should == :some_other_value
+    
+    sorted_unique_array.should == [ ]
+    
+  end
+
+end

metadata

@@ -0,0 +1,91 @@
+--- !ruby/object:Gem::Specification
+name: array-sorted-unique
+version: !ruby/object:Gem::Version
+  version: 1.0.0
+  prerelease: 
+platform: ruby
+authors:
+- Asher
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2012-06-30 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: array-sorted
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: array-unique
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+description: A subclass of Array::Sorted and Array::Unique (and therefore also Array::Hooked).
+email: asher@ridiculouspower.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/array/hooked/sorted/unique.rb
+- lib/array/hooked/unique/sorted.rb
+- lib/array/sorted/namespaces.rb
+- lib/array/sorted/requires.rb
+- lib/array/sorted/unique/array_interface.rb
+- lib/array/sorted/unique.rb
+- lib/array/unique/sorted.rb
+- lib/array-sorted-unique.rb
+- lib/sorted_array/unique/array_interface.rb
+- lib/sorted_array/unique.rb
+- spec/array/sorted/unique_spec.rb
+- README.md
+- CHANGELOG.rdoc
+homepage: http://rubygems.org/gems/array-sorted-unique
+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: array-sorted-unique
+rubygems_version: 1.8.23
+signing_key: 
+specification_version: 3
+summary: Provides Array::Sorted::Unique and its alias Array::Unique::Sorted as well
+  as UniqueSortedArray and its alias SortedUniqueArray.
+test_files: []
+has_rdoc: