ludy 0.0.9 → 0.1.0

data/test/test_class.rb

@@ -0,0 +1,13 @@
+
+require File.join(File.dirname(__FILE__), '..', 'lib', 'ludy/test/helper')
+require 'ludy/class/undef_all_methods'
+
+class TestClass < Test::Unit::TestCase
+  class C; end
+  def test_undef_all_methods
+    c = C.new
+    assert c.respond_to?(:to_s)
+    C.undef_all_methods
+    # then? how to test?
+  end
+end

data/test/test_defun.rb

@@ -0,0 +1,37 @@
+
+require File.join(File.dirname(__FILE__), '..', 'lib', 'ludy/test/helper')
+require 'ludy/kernel/defun'
+
+class TestDefun < Test::Unit::TestCase
+  def test_fact
+    defun :fact, 0 do |n|
+      1
+    end
+
+    defun :fact, Integer do |n|
+      n * fact(n-1)
+    end
+
+    assert_equal 3628800, fact(10)
+  end
+
+  def test_overloading
+    defun :f, Integer do |n| 1; end
+    defun :f, String do |n| '2'; end
+    defun(:f, Integer, Integer) do |n,g| 3; end
+
+    assert_equal 1, f(10)
+    assert_equal '2', f('')
+    assert_equal 3, f(1,1)
+    assert_raise NoMethodError do f('1', 2); end
+  end
+
+  def test_more
+    defun(:more, 3, Object){3}
+    defun(:more, Object, String){|o,s|s}
+    assert_equal 'a', more(1,'a')
+    # because [3, '2'] matches [3, Object]
+    assert_equal 3, more(3,'2')
+    assert_equal 3, more(3,nil)
+  end
+end

data/test/test_dices.rb

@@ -0,0 +1,32 @@
+
+require File.join(File.dirname(__FILE__), '..', 'lib', 'ludy/test/helper')
+require 'ludy/dices'
+
+class TestDices < Test::Unit::TestCase
+  include Ludy
+  def test_dices
+    50.times{ assert((1..20).include?(1.roll)) }
+    50.times{ assert((2..40).include?(2.roll)) }
+    50.times{ assert((3..18).include?(3.roll(6))) }
+
+    _4d20 = 4.dices
+    assert_equal 4, _4d20.min
+    assert_equal 4*20, _4d20.max
+    50.times{ assert((4..80).include?(_4d20.roll)) }
+
+    _5d12 = 5.dices 12
+    assert_equal 5, _5d12.min
+    assert_equal 5*12, _5d12.max
+    50.times{ assert((5..60).include?(_5d12.roll)) }
+
+    ds = DiceSet.new _4d20, _5d12
+    assert_equal _4d20.min+_5d12.min, ds.min
+    assert_equal _4d20.max+_5d12.max, ds.max
+    50.times{ assert((ds.min..ds.max).include?(ds.roll)) }
+
+    du = DiceSet.new ds, 6.dices(6)
+    assert_equal ds.min+6, du.min
+    assert_equal ds.max+36, du.max
+    50.times{ assert((du.min..du.max).include?(du.roll)) }
+  end
+end

data/test/test_kernel.rb

@@ -0,0 +1,36 @@
+
+require File.join(File.dirname(__FILE__), '..', 'lib', 'ludy/test/helper')
+require 'ludy/kernel'
+
+class TestKernel < Test::Unit::TestCase
+  class C
+    def pub; 'pub'; end
+    def method_missing msg, *args, &block; args.unshift(msg.to_s.upcase).join(' '); end
+    private; def pri; 'pri'; end
+  end
+  def test_public_send
+    c = C.new
+    assert_equal 'pub', c.public_send(:pub)
+    assert_equal 'PRI', c.public_send(:pri)
+    assert_equal 'XD', c.public_send(:xd)
+  end
+  def test_tap
+    assert_equal '11', 10.tap{|i| assert_equal '10', i.to_s}.succ.to_s
+  end
+  def test_if
+    assert_equal  "XD", (true ).if{"XD"}
+    assert false.if{"XD"}.nil?
+    assert_equal "Orz", (false).if{"XD"}.else{"Orz"}
+    assert_equal  "XD", (true ).if{"XD"}.else{"Orz"}
+    assert_equal  "XD", (true ).if{"xd"}.upcase
+    assert false.if{"xd"}.upcase.nil?
+    assert_equal "OTL", (false).if{"xd"}.else{"otl"}.upcase
+    assert_equal  "XD", (true ).if{"xd"}.else{"otl"}.upcase
+  end
+  def test_id_and_m
+    assert_equal 'XD', id('XD')
+    assert_equal 'Orz', 'Orz'.id
+    assert_equal [1,3], [1,3].map(&m(:id))
+    assert_equal [2,4], [2,4].map(&:id)
+  end
+end

data/test/test_lazy.rb

@@ -0,0 +1,18 @@
+
+require File.join(File.dirname(__FILE__), '..', 'lib', 'ludy/test/helper')
+require 'ludy/lazy'
+
+class TestLazy < Test::Unit::TestCase
+  include Ludy
+  def setup; @data = 0; end
+  def get; @data += 1; end
+  def test_lazy
+    assert_equal 0, @data
+    v = lazy{get}
+    assert_equal 0, @data
+    assert_equal 1, v
+    assert_equal '1', v.to_s
+    assert_equal 1, v
+    assert_equal '1', v.to_s
+  end
+end

data/test/test_proc.rb

@@ -0,0 +1,57 @@
+
+require File.join(File.dirname(__FILE__), '..', 'lib', 'ludy/test/helper')
+require 'ludy/proc'
+
+class TestProc < Test::Unit::TestCase
+  def test_bind
+    assert_equal [9,8,7], ([1,2,3].map(&lambda{|lhs, rhs| lhs-rhs}.bind(10, :_1)))
+    assert_equal [3,2,1], (lambda{|a,b,c| [a,b,c]}.bind :_3, :_2, :_1)[1,2,3]
+    assert_equal [1,9,3], (lambda{|a,b,c| [a,b,c]}.bind :_1, 9, :_3)[1,2,3]
+    assert_equal [9,2,3], (lambda{|a,b,c| [a,b,c]}.bind 9)[2,3]
+    assert_equal [9,4,2], (lambda{|a,b,c| [a,b,c]}.bind 9, :_3)[2,3,4]
+  end
+  def test_curry
+    multiply = lambda{|l,r| l*r}
+
+    double = multiply.curry[2]
+    assert_equal 8, double[4]
+    assert_equal 6, double[3]
+
+    xd = multiply['XD', 5]
+    assert_equal 'XDXDXDXDXD', xd
+
+    assert_equal 29, :+.to_proc.curry[18][11]
+    assert_equal((0..4).to_a, lambda{|a,b,c,d,e|[a,b,c,d,e]}.curry[0][1][2][3][4])
+  end
+  def test_compose
+    f1 = lambda{|v| v+1}
+    f2 = lambda{|v| v*2}
+    f3 = f1.compose f2
+    assert_equal 21, f3[10]
+
+    f4 = lambda{|a,b| a*b}
+    f5 = lambda{|a,b| [a*b, a-b]}
+    f6 = f4.compose f5
+    assert_equal(-30, f6[3,5])
+
+    f7 = lambda{|a| a*2}.compose f6.compose{|a,b| [b,a]}
+    assert_equal 60, f7[3,5]
+  end
+  def test_chain
+    f1 = lambda{|v| v+1}
+    assert_equal 5, f1[4]
+
+    f2 = lambda{|v| v+2}
+    assert_equal 6, f2[4]
+
+    f3 = f1.chain f2
+    assert_equal [6,7], f3[5]
+
+    f4 = f3.chain f1
+    assert_equal [2,3,2], f4[1]
+
+    f5 = f4.chain{|v|[10,11,v]}
+    assert_equal [1,2,1,10,11,0], f5[0]
+  end
+end
+

data/test/test_symbol.rb

@@ -0,0 +1,15 @@
+
+require File.join(File.dirname(__FILE__), '..', 'lib', 'ludy/test/helper')
+require 'ludy/symbol'
+
+class TestSymbol < Test::Unit::TestCase
+  def test_curry
+    a = [1,2,3]
+    assert_equal nil, a.find(&:==.curry[0])
+    assert_equal 2, a.find(&:==.curry[2])
+  end
+  def test_to_msg
+    assert_equal [3, 7], [[1,2],[3,4]].map(&:'inject(&:+)'.to_msg)
+    assert_equal 29, :'to_i*2+9'.to_msg['10']
+  end
+end

data/test/test_variable.rb

@@ -0,0 +1,29 @@
+
+require File.join(File.dirname(__FILE__), '..', 'lib', 'ludy/test/helper')
+require 'ludy/variable'
+
+class TestVariable < Test::Unit::TestCase
+  include Ludy
+  class Qoo
+    def cool
+      'cool ~~~~'
+    end
+  end
+
+  def test_variable
+    x = var Qoo.new
+    y = x
+
+    assert_equal x.__obj__, y.__obj__
+    assert_equal Qoo, x.__obj__.class
+    assert_equal Qoo, x.class
+
+    assert_equal 'cool ~~~~', x.cool
+    assert_equal 'cool ~~~~', y.cool
+
+    x.__obj__ = nil
+
+    assert x.nil?
+    assert y.nil?
+  end
+end

data/test/test_y_combinator.rb

@@ -0,0 +1,21 @@
+
+require File.join(File.dirname(__FILE__), '..', 'lib', 'ludy/test/helper')
+require 'ludy/y_combinator'
+
+include Ludy # why should this be here?
+
+class TestYCombinator < Test::Unit::TestCase
+  def test_y_combinator
+    fact_ = lambda{|this|
+      lambda{|n| n==1 ? 1 : n*this[n-1]}
+    }
+    fact = Y[fact_]
+    assert_equal(3628800, fact[10])
+
+    fib_ = lambda{|this|
+      lambda{|n| n<=1 ? 1 : this[n-2]+this[n-1]}
+    }
+    fib = Y[fib_]
+    assert_equal([1,1,2,3,5,8,13,21,34,55], (0...10).map(&fib))
+  end
+end

data/test/test_z_combinator.rb

@@ -0,0 +1,20 @@
+
+require File.join(File.dirname(__FILE__), '..', 'lib', 'ludy/test/helper')
+require 'ludy/z_combinator'
+
+class TestZCombinator < Test::Unit::TestCase
+  include Ludy
+  def test_z_combinator
+    fact_ = lambda{|this|
+      lambda{|n| n==1 ? 1 : n*this[n-1]}
+    }
+    fact = Z[fact_]
+    assert_equal(3628800, fact[10])
+
+    fib_ = lambda{|this|
+      lambda{|n| n<=1 ? 1 : this[n-2]+this[n-1]}
+    }
+    fib = Z[fib_]
+    assert_equal([1,1,2,3,5,8,13,21,34,55], (0...10).map(&fib))
+  end
+end

metadata

@@ -1,78 +1,150 @@
 --- !ruby/object:Gem::Specification 
 name: ludy
 version: !ruby/object:Gem::Version 
-  version: 0.0.9
+  version: 0.1.0
 platform: ruby
 authors: 
-- Lin Jen-Shin(a.k.a. godfat)
+- "Lin Jen-Shin (a.k.a. godfat \xE7\x9C\x9F\xE5\xB8\xB8)"
 autorequire: 
 bindir: bin
 cert_chain: []
 
-date: 2008-01-07 00:00:00 +08:00
+date: 2008-01-09 00:00:00 +08:00
 default_executable: 
-dependencies: []
-
-description: 
-email: "strip number: 135godfat7911@246godfat.890org"
-executables: []
-
+dependencies: 
+- !ruby/object:Gem::Dependency 
+  name: rake
+  version_requirement: 
+  version_requirements: !ruby/object:Gem::Requirement 
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        version: "0"
+    version: 
+description: "== DESCRIPTION:  Aims to extend Ruby standard library, providing some useful tools that's not existed in the standard library."
+email: "strip any number: 18god29fat7029 (at] godfat32 -dooot- 20org"
+executables: 
+- ludy
 extensions: []
 
-extra_rdoc_files: []
-
+extra_rdoc_files: 
+- CHANGES
+- LICENSE
+- NOTICE
+- README
+- TODO
+- bin/ludy
+- tasks/annotations.rake
+- tasks/doc.rake
+- tasks/gem.rake
+- tasks/manifest.rake
+- tasks/rubyforge.rake
+- tasks/spec.rake
+- tasks/svn.rake
+- tasks/test.rake
 files: 
-- lib/lib
-- lib/lib/amulti.rb
-- lib/lib/multi.rb
-- lib/lib/smulti.rb
-- lib/ludy
-- lib/ludy/aspect.rb
-- lib/ludy/bind.rb
-- lib/ludy/callstack.rb
-- lib/ludy/curry.rb
-- lib/ludy/dice.rb
+- CHANGES
+- LICENSE
+- Manifest.txt
+- NOTICE
+- README
+- Rakefile
+- TODO
+- bin/ludy
+- lib/ludy.rb
+- lib/ludy/all.rb
+- lib/ludy/array.rb
+- lib/ludy/array/body.rb
+- lib/ludy/array/combine.rb
+- lib/ludy/array/combos.rb
+- lib/ludy/array/filter.rb
+- lib/ludy/array/foldl.rb
+- lib/ludy/array/foldr.rb
+- lib/ludy/array/reverse_map.rb
+- lib/ludy/array/rotate.rb
+- lib/ludy/blackhole.rb
+- lib/ludy/class.rb
+- lib/ludy/class/undef_all_methods.rb
+- lib/ludy/deprecated/aspect.rb
+- lib/ludy/deprecated/callstack.rb
+- lib/ludy/deprecated/curry.rb
+- lib/ludy/deprecated/rambda.rb
+- lib/ludy/deprecated/this.rb
+- lib/ludy/deprecated/untranspose.rb
+- lib/ludy/deprecated/unzip.rb
+- lib/ludy/dices.rb
+- lib/ludy/kernel.rb
+- lib/ludy/kernel/defun.rb
+- lib/ludy/kernel/ergo.rb
+- lib/ludy/kernel/id.rb
+- lib/ludy/kernel/if_else.rb
+- lib/ludy/kernel/m.rb
+- lib/ludy/kernel/public_send.rb
+- lib/ludy/kernel/singleton_method.rb
+- lib/ludy/kernel/tap.rb
 - lib/ludy/lazy.rb
-- lib/ludy/ludy_ext.rb
-- lib/ludy/rambda.rb
-- lib/ludy/this.rb
+- lib/ludy/message_dispatcher.rb
+- lib/ludy/pattern_matcher.rb
+- lib/ludy/proc.rb
+- lib/ludy/proc/bind.rb
+- lib/ludy/proc/chain.rb
+- lib/ludy/proc/compose.rb
+- lib/ludy/proc/curry.rb
+- lib/ludy/symbol.rb
+- lib/ludy/symbol/curry.rb
+- lib/ludy/symbol/to_msg.rb
+- lib/ludy/symbol/to_proc.rb
+- lib/ludy/tasks.rb
+- lib/ludy/tasks/erb_cpp.rb
+- lib/ludy/tasks/erb_cpp/attr_builder.rb
+- lib/ludy/tasks/erb_cpp/header_guard.rb
+- lib/ludy/tasks/erb_cpp/template_forward_parameters.rb
+- lib/ludy/test/helper.rb
 - lib/ludy/variable.rb
 - lib/ludy/y_combinator.rb
 - lib/ludy/z_combinator.rb
-- lib/ludy.rb
-- lib/puzzle_generator
+- lib/puzzle_generator.rb
 - lib/puzzle_generator/chain.rb
 - lib/puzzle_generator/chained_map.rb
 - lib/puzzle_generator/colored_map.rb
 - lib/puzzle_generator/map.rb
 - lib/puzzle_generator/misc.rb
 - lib/puzzle_generator/puzzle.rb
-- lib/puzzle_generator.rb
-- test/tc_bind.rb
-- test/tc_callstack.rb
-- test/tc_curry.rb
-- test/tc_dice.rb
-- test/tc_lazy.rb
-- test/tc_ludy_ext.rb
-- test/tc_rambda.rb
-- test/tc_this.rb
-- test/tc_variable.rb
-- test/tc_y_combinator.rb
-- test/tc_z_combinator.rb
-- test/test_puzzle.rb
-- test/ts_ludy.rb
-- CHANGES
-- lib
-- LICENSE
-- ludy.gemspec
-- NOTICE
-- README
-- test
-has_rdoc: false
+- spec/ludy_spec.rb
+- tasks/annotations.rake
+- tasks/doc.rake
+- tasks/gem.rake
+- tasks/manifest.rake
+- tasks/rubyforge.rake
+- tasks/setup.rb
+- tasks/spec.rake
+- tasks/svn.rake
+- tasks/test.rake
+- test/deprecated/callstack.rb
+- test/deprecated/curry.rb
+- test/deprecated/rambda.rb
+- test/deprecated/this.rb
+- test/deprecated/ts_ludy.rb
+- test/deprecated/unzip_and_untranspose.rb
+- test/example_puzzle.rb
+- test/test_all.rb
+- test/test_array.rb
+- test/test_class.rb
+- test/test_defun.rb
+- test/test_dices.rb
+- test/test_kernel.rb
+- test/test_lazy.rb
+- test/test_proc.rb
+- test/test_symbol.rb
+- test/test_variable.rb
+- test/test_y_combinator.rb
+- test/test_z_combinator.rb
+has_rdoc: true
 homepage: http://ludy.rubyforge.org/
 post_install_message: 
-rdoc_options: []
-
+rdoc_options: 
+- --main
+- README
 require_paths: 
 - lib
 required_ruby_version: !ruby/object:Gem::Requirement 
@@ -95,4 +167,15 @@ signing_key:
 specification_version: 2
 summary: Aims to extend Ruby standard library, providing some useful tools that's not existed in the standard library.
 test_files: 
-- test/ts_ludy.rb
+- test/test_all.rb
+- test/test_array.rb
+- test/test_class.rb
+- test/test_defun.rb
+- test/test_dices.rb
+- test/test_kernel.rb
+- test/test_lazy.rb
+- test/test_proc.rb
+- test/test_symbol.rb
+- test/test_variable.rb
+- test/test_y_combinator.rb
+- test/test_z_combinator.rb

data/lib/lib/amulti.rb

@@ -1,40 +0,0 @@
-# = amulti.rb - Array destructuring multiple dispatch for Ruby
-#
-#  Copyright 2005, Christopher Cyll
-#  mailto: christopher at gmail dot com
-#
-# == Example
-#
-# === Array Dispatch (using 'amulti') ===
-# 
-
-require 'multi'
-
-def amulti(method_name, *patterns, &body)
-  Multi::DISPATCHER.add(Multi::ArrayDispatch, self, method_name, patterns, body)
-end
-
-module Multi
-  class ArrayDispatch < Dispatch
-    def initialize(patterns, body)
-      @count = patterns.size
-      super(patterns, body)
-    end
-
-    def match?(params)
-      return false if params.size != 1
-      # Call .to_a here?
-      array = params.first
-      return false if ! array.kind_of?(Array)
-      return false if array.size < @count
-      return super(array[0, @count])
-    end
-    
-    def call(params, block)
-      array = params.first
-      use = array[0, @count]
-      use.push(array[@count..-1])
-      super(use, block)
-    end
-  end
-end

data/lib/lib/multi.rb

@@ -1,139 +0,0 @@
-# = multi.rb - Multiple Dispatch and Pattern Matching for Ruby
-#
-#  Copyright 2005, Christopher Cyll
-#  mailto: christopher at gmail dot com
-#
-# == Example
-#
-# === Factorial Function
-# 
-#  require 'multi'
-#  multi(:fac, 0)       { 1 }
-#  multi(:fac, Integer) {|x| x * fac(x-1)}
-#  fac(5) ==> 120
-#
-# === List Reversal Function
-#
-#  require 'multi'
-#  multi(:reverse, []) { [] }
-#  multi(:reverse, Array) {|list| [list.pop] + reverse(list) }
-#  reverse([1,2,3]) ==> [3,2,1]
-#
-# === Method Dispatch
-#
-#  require 'multi'
-#  class Foo
-#    multi(:hiya, 0)       {|x| "Zero: #{x}" }
-#    multi(:hiya, Integer) {|x| "Int: #{x}" }
-#    multi(:hiya, String)  {|x| "Str: #{x}" }
-#  end
-#
-#  f = Foo.new()
-#  f.hiya(0)         ==> "Zero: 0"
-#  f.hiya(5)         ==> "Int: 5"
-#  f.hiya("hello")   ==> "Str: hello"
-#
-# === Match Any ( _ in Haskell/ML) using Object
-#
-#  require 'multi'
-#  multi(:baz, 3, Object) { 3 }
-#  multi(:baz, Object, String) {|o, str| str }
-#  baz(3, "three") ==> 3
-#  baz(2, "two")   ==> "two"
-#
-# === Guards Using lambda/Proc
-#
-#  multi(:gt2, lambda {|x| x > 2 }) {|x| x }
-#  multi(:gt2, Object)              {    0 }
-#  gt2(1) ==> 0
-#  gt2(4) ==> 4
-#
-# === Returning Values From Multimethods
-#
-#  multi(:evenify, Integer) do |x|
-#    next x if x % 2 == 0 # Return x using 'next'
-#    x += 1
-#    next x
-#  end
-#  evenify(4) ==> 4
-#  evenify(5) ==> 6
-#
-# === Declare a clause of a multimethod
-#
-#  multi(:method_name, types_literals_or_guards) do |parameter1, parameter2|
-#    # code here!
-#  end
-
-def multi(method_name, *patterns, &body)
-  Multi::DISPATCHER.add(Multi::Dispatch, self, method_name, patterns, body)
-end
-
-module Multi
-  class Dispatch
-    def initialize(patterns, body)
-      @patterns = patterns
-      @body = body
-    end
-    
-    def match?(params)
-      pairs = params.zip(@patterns)
-      return pairs.all? do |param, pattern|
-        if pattern.kind_of?(Class)
-          param.kind_of?(pattern)
-        elsif pattern.instance_of?(Proc)
-          begin
-            pattern.call(param)
-          rescue
-            false
-          end
-        elsif pattern.instance_of?(Regexp)
-          pattern.match(param)
-        else
-          param == pattern
-        end
-      end
-    end
-    
-    def call(params, block)
-      @body.call(*params, &block)
-    end
-  end
-
-  class Dispatcher
-    def initialize
-      @map = {}
-    end
-
-    def add(type, obj, method_name, patterns, body)
-      method_name = method_name.id2name if method_name.kind_of?(Symbol)
-      body = patterns.pop if body.nil?
-
-      # Using the object_id() is pretty sleazy, but it gives us faster
-      # lookup than object.equal? and searching
-      key = [obj.object_id(), method_name]
-      @map[key] ||= []
-      @map[key].push(type.new(patterns, body))
-
-      # Tried to use send(:define, ...) but Procs can't have &blocks
-      if ! obj.methods.include?(method_name)
-        obj.instance_eval <<-"DONE"
-          def #{method_name}(*params, &block)
-            Multi::DISPATCHER.call(self, \"#{method_name}\", params, block)
-          end
-        DONE
-      end
-    end
-
-    def call(obj, method_name, params, block)
-      dispatches = @map[[obj.object_id, method_name]]
-      dispatch = dispatches.find{|dispatch| dispatch.match?(params) }
-      if dispatch.nil?
-        printed_params = params.map{|param| param.inspect}.join(', ')
-        raise "No match for #{obj}.#{method_name}(#{printed_params})"
-      end
-      dispatch.call(params, block)
-    end
-  end
-
-  DISPATCHER = Dispatcher.new()
-end