functions 0.0.2 → 0.0.3

data/README.md

@@ -24,8 +24,58 @@ The lambda style is a bit more pure but is currently just a bit slower in perfor
 
 ### Lambda Style
 
+The lambda style allows you to write functions like this
+
+    require 'functions'
+
+    module PreludeLambdaUsage
+
+      include Functions::Prelude
+
+      Power = ->(p,x) { x**p }.curry
+      Square = Power.(2)
+      Squares = Map.(Square)
+      Sum_Of_Squares2 = Sum < Squares
+
+      Average = After.( [Sum,Length] ).( Divide )
+
+      Gcd = ->(a,b) { (Divisors.(a) & Divisors.(b)).max }
+
+      # Gcd of an array
+      GcdA1 = Max < Intersect < Map.(Divisors) # litteral translation of the definition
+      GcdA2 = ReduceLeft.(Gcd) # faster
+
+      # Lcm of an array in function of Lcm of a pair
+      LcmA = ReduceLeft.(Lcm) # the same but without arguments
+
+    end
+
 ### Meta Style
 
+The meta style allows you to write functions like this
+
+    require 'functions'
+
+    module PreludeMetaUsage
+
+      include Functions::PreludeMeta
+
+      def power(x, p) x ** p end
+
+      def square(x) power(x, 2) end
+
+      define :squares, as: { map: :square }
+
+      define :evens, as: { filter: :even? }
+
+      define :sum_of_squares_tris, as: { compose: [:sum, :squares] }
+
+      define :average, as: { :after => [ :sum_length, :divide ] }
+
+      define :sum, as: { foldl: [:add, 0]}
+
+    end
+
 ## Contributing
 
 1. Fork it

data/functions.gemspec

@@ -8,8 +8,8 @@ Gem::Specification.new do |gem|
   gem.version       = Functions::VERSION
   gem.authors       = ["Koen Handekyn"]
   gem.email         = ["koen.handekyn@up-nxt.com"]
-  gem.description   = %q{functions programming in ruby}
-  gem.summary       = %q{functions programming in ruby}
+  gem.description   = %q{functional programming in ruby}
+  gem.summary       = %q{functional programming in ruby}
   gem.homepage      = "https://github.com/koenhandekyn/functions"
 
   gem.files         = `git ls-files`.split($/)

data/lib/functions/prelude_meta.rb

@@ -246,9 +246,7 @@ module Functions
       foldl(f(f), i, a.reverse)
     end
 
-    def zip(a, b)
-      a.zip(b)
-    end
+    def zip(a, b) a.zip(b) end
 
     def map(a, f)
       a.map { |x| f(f).(x) }

data/lib/functions/version.rb

@@ -1,3 +1,3 @@
 module Functions
-  VERSION = "0.0.2"
+  VERSION = "0.0.3"
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: functions
 version: !ruby/object:Gem::Version
-  version: 0.0.2
+  version: 0.0.3
   prerelease: 
 platform: ruby
 authors:
@@ -11,7 +11,7 @@ bindir: bin
 cert_chain: []
 date: 2013-04-10 00:00:00.000000000 Z
 dependencies: []
-description: functions programming in ruby
+description: functional programming in ruby
 email:
 - koen.handekyn@up-nxt.com
 executables: []
@@ -67,7 +67,7 @@ rubyforge_project:
 rubygems_version: 1.8.24
 signing_key: 
 specification_version: 3
-summary: functions programming in ruby
+summary: functional programming in ruby
 test_files:
 - spec/prelude_lambda_math_spec.rb
 - spec/prelude_lambda_spec.rb