array-sorted-unique-compositing 1.0.0

data/CHANGELOG.rdoc

@@ -0,0 +1,17 @@
+
+== 3/17/12
+
+Initial release.
+
+== 3/18/12
+
+Added hooks for subclassing.
+
+== 6/15/12
+
+Moved hooks out to array-sorted-unique and utilized array-sorted-unique as foundation.
+Added alias from Array::Unique::Compositing::Sorted to Array::Sorted::Unique::Compositing.
+
+== 6/18/12
+
+Fixes for :initialize that required changing module include order and changing subclass inheritance.

data/README.md

@@ -0,0 +1,80 @@
+# Sorted Unique Compositing Array #
+
+http://rubygems.org/gems/array-sorted-unique-compositing
+
+# Description #
+
+Provides Array::Sorted::Unique::Compositing.
+
+# Summary #
+
+An implementation of Array that permits chaining, where children inherit changes to parent and where parent settings can be overridden in children, and that retains sorted order, ensuring inserted values are unique.
+
+# Install #
+
+* sudo gem install array-sorted-unique-compositing
+
+# Usage #
+
+```ruby
+compositing_array = Array::Sorted::Unique::Compositing.new
+sub_compositing_array = Array::Sorted::Unique::Compositing.new( compositing_array )
+
+compositing_array.push( :A )
+# compositing_array
+# => [ :A ]
+# sub_compositing_array
+# => [ :A ]
+compositing_array.push( :C )
+# compositing_array
+# => [ :A, :C ]
+# sub_compositing_array
+# => [ :A, :C ]
+compositing_array.push( :B )
+# compositing_array
+# => [ :A, :B, :C ]
+# sub_compositing_array
+# => [ :A, :B, :C ]
+compositing_array.push( :B )
+# compositing_array
+# => [ :A, :B, :C ]
+# sub_compositing_array
+# => [ :A, :B, :C ]
+
+compositing_array.delete_at( 0 )
+# compositing_array
+# => [ :B, :C ]
+# sub_compositing_array
+# => [ :B, :C ]
+
+sub_compositing_array.push( :A )
+# compositing_array
+# => [ :B, :C ]
+# sub_compositing_array
+# => [ :A, :B, :C ]
+```
+
+# 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-compositing.rb

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

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

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

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

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

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

@@ -0,0 +1,17 @@
+
+require 'array-sorted-compositing'
+require 'array-unique-compositing'
+#require_relative '../../../../../array-sorted-compositing/lib/array-sorted-compositing.rb'
+#require_relative '../../../../../array-unique-compositing/lib/array-unique-compositing.rb'
+
+# 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::Hooked
+  class Compositing < ::Array::Hooked
+    include ::Array::Sorted::Unique::Compositing::ArrayInterface
+  end
+end

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

@@ -0,0 +1,10 @@
+
+module ::Array::Sorted::Unique::Compositing::ArrayInterface
+
+  #include ::Array::Sorted::ArrayInterface
+  #include ::Array::Unique::ArrayInterface
+  #include ::Array::Compositing::ArrayInterface
+  include ::Array::Sorted::Compositing::ArrayInterface
+  include ::Array::Unique::Compositing::ArrayInterface
+
+end

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

@@ -0,0 +1,5 @@
+
+class ::Array::Sorted::Unique < ::Array::Hooked
+  class Compositing < ::Array::Hooked
+  end
+end

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

@@ -0,0 +1,2 @@
+
+require_relative 'compositing/array_interface.rb'

data/spec/array/sorted/unique/compositing_spec.rb

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

metadata

@@ -0,0 +1,90 @@
+--- !ruby/object:Gem::Specification
+name: array-sorted-unique-compositing
+version: !ruby/object:Gem::Version
+  version: 1.0.0
+  prerelease: 
+platform: ruby
+authors:
+- Asher
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2012-07-06 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: array-sorted-compositing
+  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-compositing
+  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: An implementation of Array that permits chaining, where children inherit
+  changes to parent and where parent settings can be overridden in children, and that
+  retains sorted order, ensuring inserted values are unique.
+email: asher@ridiculouspower.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/array/hooked/compositing/sorted/unique.rb
+- lib/array/hooked/compositing/unique/sorted.rb
+- lib/array/sorted/unique/compositing/array_interface.rb
+- lib/array/sorted/unique/compositing.rb
+- lib/array/sorted/unique/namespaces.rb
+- lib/array/sorted/unique/requires.rb
+- lib/array-sorted-unique-compositing.rb
+- spec/array/sorted/unique/compositing_spec.rb
+- README.md
+- README.rdoc
+- CHANGELOG.rdoc
+homepage: http://rubygems.org/gems/array-sorted-unique-compositing
+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-compositing
+rubygems_version: 1.8.23
+signing_key: 
+specification_version: 3
+summary: Provides Array::Sorted::Unique::Compositing.
+test_files: []
+has_rdoc: