Cartesian 0.4.1 → 0.4.2

data/History.txt

@@ -0,0 +1,29 @@
+=== 0.4.2 / 2011-01-12
+
+* gem renamed to cartesian in all lowercase
+* last version under the name Cartesian, includes a dependecy for the new gem
+
+=== 0.4.1 04-11-2008 03:18
+
+* 1 major enhancement:
+  * mainly bugfixes and some refactoring. new features: left_product and non-destructive #product methods
+
+=== 0.3.0 29-10-2007 05:49
+
+[undocumented changes]
+
+=== 0.2.3 13-01-2007 20:50
+
+* 1 minor enhancement:
+  * power! (aliased as "**") method added
+
+=== 0.2.1 13-01-2007 01:44
+
+* 1 major enhancement:
+  * Method ".x(enum)" added, which has constant memory requirements, in contrast with the exponential memory usage of the conventional approach.
+
+=== 0.1.0 24-11-2006 05:35
+
+* 1 major enhancement:
+  * first public release
+

data/Manifest.txt

@@ -0,0 +1,6 @@
+History.txt
+Manifest.txt
+PostInstall.txt
+README.txt
+Rakefile
+lib/cartesian.rb

data/PostInstall.txt

@@ -0,0 +1,9 @@
+
+WARNING: The Cartesian gem has been renamed and it is no
+longer supported or developed under its original name.
+
+The new gem, whose name is cartesian in all lowercase,
+was included as a dependency of this last version of the
+old gem for your convenience, but from now on please
+refer to the gem by its new ortography.
+

data/README.txt

@@ -0,0 +1,37 @@
+= Cartesian
+
+* http://adrianomitre.github.com/cartesian/
+
+== DESCRIPTION:
+
+The Cartesian gem has become obsolete due to renaming.
+Please refer to the new gem: cartesian (in all lowercase).
+
+The new gem was included as a dependency of this last version
+of this old gem, but from now on please refer to the gem by
+its new ortography.
+
+== LICENSE:
+
+(The MIT License)
+
+Copyright (c) 2006-2011 Adriano Mitre
+
+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/Rakefile

@@ -0,0 +1,13 @@
+# -*- ruby -*-
+
+require 'rubygems'
+require 'hoe'
+
+Hoe.spec 'Cartesian' do
+  developer('Adriano Mitre', 'adriano.mitre@gmail.com')
+  self.version              = '0.4.2'
+  self.post_install_message = File.read('PostInstall.txt')
+  self.extra_deps           = [['cartesian', '>= 0.5.0']]
+end
+
+# vim: syntax=ruby

data/lib/cartesian.rb

@@ -1,161 +0,0 @@
-#
-# The CartesianProduct module provide methods for the calculation
-# of the cartesian producted between two enumberable objects.
-#
-# It can also be easily mixed in into any enumberable class,
-# i.e. any class with Enumerable module mixed in.
-# Notice that the names of the methods for mixin are different.
-#
-# Module:
-#   Cartesian::product(foo, bar)
-#
-# Mixin:
-#   foo.cartesian( bar )
-#
-# The module is automatically mixed in Array class.
-#
-# == Author
-# Adriano MITRE <adriano.mitre@gmail.com>
-#
-# == Example
-#
-# as module
-#   require 'cartesian'
-#   foo = [1, 2]
-#   bar = ["a", "b"]
-#   Cartesian::product(foo, bar) #=> [[1, "a"], [1, "b"], [2, "a"], [2, "b"]]
-# as mixin
-#   require 'cartesian'
-#   foo = [1, 2]
-#   bar = ["a", "b"]
-#   foo.cartesian(bar)  #=> [[1, "a"], [1, "b"], [2, "a"], [2, "b"]]
-#
-
-require 'cartesian_iterator'
-
-module Cartesian
-
-  # Produces the cartesian product of self and other.
-  # The result is an array of pairs (i.e. two-element arrays).
-  #
-  #   Cartesian::product( [1,2], %w(A B) ) #=> [[1, "A"], [1, "B"], [2, "A"], [2, "B"]]
-  #
-  # or, if mixed in into Array,
-  #
-  #   [1,2].cartesian %w(A B) #=> [[1, "A"], [1, "B"], [2, "A"], [2, "B"]]
-  #
-  def Cartesian.product(first, second)
-    first.x(second).to_a
-  end
-
-  # Behaves as product, except for the elements are joined.
-  #
-  #   Cartesian::joined_cartesian( [1,2], %w(A B) ) #=> ["1A", "1B", "2A", "2B"]
-  #
-  # or, if mixed in into Array,
-  #
-  #   [1,2].joined_cartesian %w(A B) #=> ["1A", "1B", "2A", "2B"]
-  #
-  def Cartesian.joined_product(first, second)
-    product(first, second).map {|pair| pair.join }
-  end
-
-  # Cartesian.joined_product for mixin.
-  #
-  def joined_cartesian(other)
-    Cartesian.joined_product(self, other)
-  end
-
-  # Convenient way of iterating over the elements.
-  # Preferable when the cartesian product array
-  # is not needed, for the consumption of memory
-  # is fixed and very small, in contrast with the
-  # exponential memory requirements of the
-  # conventional approach.
-  #
-  #   for row, col in (1..10).x(1..30)
-  #     Matrix[row, col] = row**2 + col**3
-  #   end
-  #
-  # Of course, calls can be chained as in
-  #
-  #   for x, y, z in (1..10).x(1..10).x(1..10)
-  #     # ... do something ...
-  #   end
-  #
-  #--
-  #   for letter, number in %w{a b c}.x(1..3)
-  #     ... do something ...
-  #   end
-  #++
-  #
-  # Beware that both +self+ and +other+ must implement
-  # +to_a+, i.e., be convertible to array.
-  #
-  def x(other)
-    case other
-    when CartesianIterator
-      other.left_product(self)
-    else
-      CartesianIterator.new(self, other)
-    end
-  end
-  alias cartesian x
-  alias right_product x
-  
-  def left_product(other)
-    case other
-    when CartesianIterator
-      other.right_product(self)
-    else
-      CartesianIterator.new(other, self)
-    end
-  end
-
-  # Concise way of iterating multi-dimensionally
-  # over the same array or range.
-  #
-  # For instance,
-  #
-  #   for x,y,z in [0,1]**3
-  #     puts [x, y, z].join(',')
-  #   end
-  #
-  # produces the following output
-  #
-  #   0,0,0
-  #   0,0,1
-  #   0,1,0
-  #   0,1,1
-  #   1,0,0
-  #   1,0,1
-  #   1,1,0
-  #   1,1,1
-  #
-  # It also works with Range objects.
-  #
-  def **(fixnum)
-    if fixnum < 0
-      raise ArgumentError, "negative power"
-    elsif fixnum == 0
-      return []
-    elsif fixnum == 1
-      return self
-    else
-      iter = CartesianIterator.new(self, self)
-      (fixnum-2).times do
-        iter.product!(self)
-      end
-      iter
-    end
-  end
-  alias :power! :**
-end
-
-class Array
-  include Cartesian
-end
-
-class Range
-  include Cartesian
-end

metadata

@@ -1,68 +1,115 @@
 --- !ruby/object:Gem::Specification 
 name: Cartesian
 version: !ruby/object:Gem::Version 
-  version: 0.4.1
+  prerelease: false
+  segments: 
+  - 0
+  - 4
+  - 2
+  version: 0.4.2
 platform: ruby
 authors: 
-- Adriano Brito Mitre
-autorequire: cartesian.rb
+- Adriano Mitre
+autorequire: 
 bindir: bin
 cert_chain: []
 
-date: 2008-11-04 00:00:00 -02:00
+date: 2011-01-12 00:00:00 -02:00
 default_executable: 
-dependencies: []
-
-description: 
-email: adriano.mitre@gmail.com
+dependencies: 
+- !ruby/object:Gem::Dependency 
+  name: cartesian
+  prerelease: false
+  requirement: &id001 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        segments: 
+        - 0
+        - 5
+        - 0
+        version: 0.5.0
+  type: :runtime
+  version_requirements: *id001
+- !ruby/object:Gem::Dependency 
+  name: hoe
+  prerelease: false
+  requirement: &id002 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        segments: 
+        - 2
+        - 8
+        - 0
+        version: 2.8.0
+  type: :development
+  version_requirements: *id002
+description: |-
+  The Cartesian gem has become obsolete due to renaming.
+  Please refer to the new gem: cartesian (in all lowercase).
+  
+  The new gem was included as a dependency of this last version
+  of this old gem, but from now on please refer to the gem by
+  its new ortography.
+email: 
+- adriano.mitre@gmail.com
 executables: []
 
 extensions: []
 
-extra_rdoc_files: []
-
+extra_rdoc_files: 
+- History.txt
+- Manifest.txt
+- PostInstall.txt
+- README.txt
 files: 
-- tests/tc_cartesian.rb
-- tests/benchmark.rb
-- tests/tc_extensions.rb
-- tests/tc_grid_search.rb
-- tests/coverage
-- tests/coverage/-home-adriano-software-ruby-Cartesian-lib-cartesian_rb.html
-- tests/coverage/-home-adriano-software-ruby-Cartesian-lib-grid_search_rb.html
-- tests/coverage/index.html
-- tests/coverage/-home-adriano-software-ruby-Cartesian-lib-cartesian_iterator_rb.html
-- tests/coverage/-home-adriano-software-ruby-Cartesian-lib-extensions_rb.html
-- tests/tc_cartesian_iterator.rb
-- lib/recursive.rb
-- lib/cartesian_iterator.rb
+- History.txt
+- Manifest.txt
+- PostInstall.txt
+- README.txt
+- Rakefile
 - lib/cartesian.rb
-- lib/grid_search.rb
-- lib/extensions.rb
 has_rdoc: true
-homepage: http://rubyforge.org/projects/cartesian/
-post_install_message: 
-rdoc_options: []
+homepage: http://adrianomitre.github.com/cartesian/
+licenses: []
 
+post_install_message: "\n\
+  WARNING: The Cartesian gem has been renamed and it is no\n\
+  longer supported or developed under its original name.\n\n\
+  The new gem, whose name is cartesian in all lowercase,\n\
+  was included as a dependency of this last version of the\n\
+  old gem for your convenience, but from now on please\n\
+  refer to the gem by its new ortography.\n\n"
+rdoc_options: 
+- --main
+- README.txt
 require_paths: 
 - lib
 required_ruby_version: !ruby/object:Gem::Requirement 
+  none: false
   requirements: 
   - - ">="
     - !ruby/object:Gem::Version 
+      segments: 
+      - 0
       version: "0"
-  version: 
 required_rubygems_version: !ruby/object:Gem::Requirement 
+  none: false
   requirements: 
   - - ">="
     - !ruby/object:Gem::Version 
+      segments: 
+      - 0
       version: "0"
-  version: 
 requirements: []
 
-rubyforge_project: 
-rubygems_version: 1.0.1
+rubyforge_project: cartesian
+rubygems_version: 1.3.7
 signing_key: 
-specification_version: 2
-summary: The Cartesian module provide methods for the calculation of the cartesian producted between two enumberable objects. It can also be easily mixed in into any enumberable class, i.e. any class with Enumerable module mixed in.
-test_files: 
-- tests/tc_cartesian.rb
+specification_version: 3
+summary: The Cartesian gem has become obsolete due to renaming
+test_files: []
+

data/lib/cartesian_iterator.rb

@@ -1,109 +0,0 @@
-require 'grid_search'
-
-class CartesianIterator
-
-  include GridSearch
-
-  def initialize(foo, bar)
-    @lists = []
-    @tot_iter = 1
-    product!(foo)
-    product!(bar)
-  end
-  
-  def dup
-    Marshal.load(Marshal.dump(self))
-  end
-  
-  def equal(other)
-    self.instance_variables.each do |var_name|
-      return false if self.instance_variable_get(var_name) != other.instance_variable_get(var_name)
-    end
-    true
-  end
-  alias == equal
-
-  def product!(other)
-    @lists << other.to_a.dup
-    @tot_iter *= @lists[-1].size
-    self
-  end
-  alias right_product! product!
-  alias x! product!
-  
-  def left_product!(other)
-    @lists.unshift other.to_a.dup
-    @tot_iter *= @lists[-1].size
-    self
-  end
-  
-  def product(other)
-    (result = self.dup).product!(other)
-    result
-  end
-  alias right_product product
-  alias x product
-
-  def left_product(other)
-    (result = self.dup).left_product!(other)
-    result
-  end
-
-  def each
-    return false if @tot_iter < 1
-
-    elems = []
-    for list in @lists
-      elems << list.restart_and_raw_next
-    end
-    yield *elems
-
-    last_list_index = @lists.size-1
-    n = last_list_index
-    loop do
-      if elems[n] = @lists[n].raw_next
-        yield *elems
-        n = last_list_index
-        next
-      elsif n > 0
-        elems[n] = @lists[n].restart_and_raw_next
-        n -= 1
-      else
-        return true
-      end
-    end
-  end
-
-  def to_a
-    array = []
-    self.each {|*element| array << element }
-    array
-  end
-  alias to_ary to_a
-
-end
-
-module Iterable
-  def restart
-    @next_index = -1
-    true
-  end
-  alias start restart
-
-  def next
-    @next_index or restart
-    raw_next
-  end
-
-  def raw_next
-    self[@next_index += 1]
-  end
-
-  def restart_and_raw_next
-    self[@next_index = 0]
-  end
-end
-
-class Array
-  include Iterable
-end