ramda-ruby 0.1.0.alpha

data/lib/ramda/math.rb

@@ -0,0 +1,72 @@
+require_relative 'internal/curried_method'
+
+module Ramda
+  # Math functions
+  module Math
+    extend ::Ramda::Internal::CurriedMethod
+
+    # Add two values.
+    #
+    # Number -> Number -> Number
+    #
+    curried_method(:add) do |a, b|
+      a + b
+    end
+
+    # Decrements its argument.
+    #
+    # Number -> Number
+    #
+    curried_method(:dec) do |a|
+      a - 1
+    end
+
+    # Divides two numbers. Equivalent to a / b.
+    #
+    # Number -> Number -> Number
+    #
+    curried_method(:divide) do |a, b|
+      a.to_f / b
+    end
+
+    # Increments its argument.
+    #
+    # Number -> Number
+    #
+    curried_method(:inc) do |a|
+      a + 1
+    end
+
+    # Multiplies two numbers. Equivalent to a * b but curried.
+    #
+    # Number -> Number -> Number
+    #
+    curried_method(:multiply) do |a, b|
+      a * b
+    end
+
+    # Multiplies together all the elements of a list.
+    #
+    # [Number] -> Number
+    #
+    curried_method(:product) do |xs|
+      xs.reduce(:*)
+    end
+
+    # Subtracts its second argument from its first argument.
+    #
+    # Number -> Number -> Number
+    #
+    curried_method(:subtract) do |a, b|
+      a - b
+    end
+
+    # Adds together all the elements of a list.
+    #
+    # [Number] -> Number
+    #
+    curried_method(:sum) do |xs|
+      xs.reduce(:+)
+    end
+  end
+end

data/lib/ramda/object.rb

@@ -0,0 +1,110 @@
+require_relative 'internal/curried_method'
+
+module Ramda
+  # Math functions
+  module Object
+    extend ::Ramda::Internal::CurriedMethod
+
+    # Creates a deep copy of the value which may contain (nested)
+    # Arrays and Objects, Numbers, Strings, Booleans and Dates.
+    # Functions are assigned by reference rather than copied
+    #
+    # {*} -> {*}
+    #
+    curried_method(:clone) do |object|
+      case object
+      when Array
+        object.dup.map(&method(:clone))
+      else
+        object.dup
+      end
+    end
+
+    # Reports whether two objects have the same value, in R.equals terms,
+    # for the specified property. Useful as a curried predicate.
+    #
+    # k -> {k: v} -> {k: v} -> Boolean
+    #
+    curried_method(:eq_props) do |prop, a, b|
+      a[prop] == b[prop]
+    end
+
+    # Returns a list containing the names of all the enumerable own properties
+    # of the supplied object.
+    # Note that the order of the output array is not guaranteed.
+    #
+    # {k: v} -> [k]
+    #
+    curried_method(:keys, &:keys)
+
+    # Create a new object with the own properties of the first object merged
+    # with the own properties of the second object. If a key exists in both
+    # objects, the value from the second object will be used.
+    #
+    # {k: v} -> {k: v} -> {k: v}
+    #
+    curried_method(:merge) do |obj_a, obj_b|
+      obj_a.merge(obj_b)
+    end
+
+    # Returns a partial copy of an object omitting the keys specified.
+    #
+    # [String] -> {String: *} -> {String: *}
+    #
+    curried_method(:omit) do |keys, obj|
+      obj_copy = obj.dup
+      keys.each(&obj_copy.method(:delete))
+      obj_copy
+    end
+
+    # Returns a partial copy of an object containing only the keys specified.
+    # If the key does not exist, the property is ignored.
+    #
+    # [k] -> {k: v} -> {k: v}
+    #
+    curried_method(:pick) do |keys, obj|
+      obj.select { |k, _| keys.include?(k) }
+    end
+
+    # Similar to pick except that this one includes a key: undefined pair for
+    # properties that don't exist.
+    #
+    # [k] -> {k: v} -> {k: v}
+    #
+    curried_method(:pick_all) do |keys, obj|
+      Hash[keys.map { |k| [k, obj.key?(k) ? obj.fetch(k) : nil] }]
+    end
+
+    # Reasonable analog to SQL select statement.
+    #
+    # [k] -> [{k: v}] -> [{k: v}]
+    #
+    curried_method(:project) do |keys, objs|
+      objs.map(&pick_all(keys))
+    end
+
+    # Returns a function that when supplied an object returns the indicated
+    # property of that object, if it exists.
+    #
+    # s -> {s: a} -> a | NilClass
+    #
+    curried_method(:prop) do |key, obj|
+      obj[key]
+    end
+
+    # Acts as multiple prop: array of keys in, array of values out.
+    # Preserves order.
+    #
+    # [k] -> {k: v} -> [v]
+    #
+    curried_method(:props) do |keys, obj|
+      keys.map(&obj.method(:[]))
+    end
+
+    # Returns a list of all the enumerable own properties of the supplied object.
+    #
+    # {k: v} -> [v]
+    #
+    curried_method(:values, &:values)
+  end
+end

data/lib/ramda/relation.rb

@@ -0,0 +1,161 @@
+require_relative 'internal/curried_method'
+
+module Ramda
+  # Relation functions
+  module Relation
+    extend ::Ramda::Internal::CurriedMethod
+
+    # Counts the elements of a list according to how many match each value
+    # of a key generated by the supplied function. Returns an object mapping
+    # the keys produced by fn to the number of occurrences in the list.
+
+    # Acts as a transducer if a transformer is given in list position.
+    #
+    # (a -> String) -> [a] -> {*}
+    #
+    curried_method(:count_by) do |fn, list|
+      list
+        .group_by(&fn)
+        .each_with_object({}) { |(key, value), acc| acc[key] = value.count }
+    end
+
+    # Finds the set (i.e. no duplicates) of all elements in the first list not
+    # contained in the second list. Objects and Arrays are compared in terms
+    # of value equality, not reference equality.
+    #
+    # [*] -> [*] -> [*]
+    #
+    curried_method(:difference) do |list_a, list_b|
+      list_a - list_b
+    end
+
+    # Finds the set (i.e. no duplicates) of all elements in the first list not
+    # contained in the second list. Duplication is determined according to the
+    # value returned by applying the supplied predicate to two list elements.
+    #
+    # ((a, a) -> Boolean) -> [a] -> [a] -> [a]
+    #
+    # TODO: optimize
+    curried_method(:difference_with) do |fn, list_a, list_b|
+      list_a.reject do |el_a|
+        list_b.find { |el_b| fn.call(el_a, el_b) }
+      end
+    end
+
+    # Takes a function and two values in its domain and returns true if the
+    # values map to the same value in the codomain; false otherwise.
+    #
+    # (a -> b) -> a -> a -> Boolean
+    #
+    curried_method(:eq_by) do |fn, a, b|
+      fn.call(a) == fn.call(b)
+    end
+
+    # Returns true if its arguments are equivalent, false otherwise.
+    # Handles cyclical data structures.
+    #
+    # a -> b -> Boolean
+    #
+    curried_method(:equals) do |a, b|
+      a == b
+    end
+
+    # Returns true if the first argument is greater than the second; false otherwise.
+    #
+    # Ord a => a -> a -> Boolean
+    #
+    curried_method(:gt) do |a, b|
+      a > b
+    end
+
+    # Returns true if the first argument is greater than or equal to the second;
+    # false otherwise.
+    #
+    # Ord a => a -> a -> Boolean
+    #
+    curried_method(:gte) do |a, b|
+      a >= b
+    end
+
+    # Combines two lists into a set (i.e. no duplicates) composed of those elements
+    # common to both lists. The order is preserved from the original array.
+    #
+    # [*] -> [*] -> [*]
+    #
+    curried_method(:intersection) do |list_a, list_b|
+      list_a & list_b
+    end
+
+    # Returns true if the first argument is less than the second; false otherwise.
+    #
+    # a -> a -> Boolean
+    #
+    curried_method(:lt) do |a, b|
+      a < b
+    end
+
+    # Returns true if the first argument is less than or equal to the second;
+    # false otherwise.
+    #
+    # a -> a -> Boolean
+    #
+    curried_method(:lte) do |a, b|
+      a <= b
+    end
+
+    # Returns the larger of its two arguments.
+    #
+    # Ord a => a -> a -> a
+    #
+    curried_method(:max) do |a, b|
+      [a, b].max
+    end
+
+    # Returns the smaller of its two arguments.
+    #
+    # Ord a => a -> a -> a
+    #
+    curried_method(:min) do |a, b|
+      [a, b].min
+    end
+
+    # Returns true if the specified object property is equal, in R.equals terms,
+    # to the given value; false otherwise.
+    #
+    # String -> a -> Object -> Boolean
+    #
+    curried_method(:prop_eq) do |prop, value, obj|
+      obj[prop] == value
+    end
+
+    # Sorts the list according to the supplied function.
+    #
+    # Ord b => (a -> b) -> [a] -> [a]
+    #
+    curried_method(:sort_by) do |fn, xs|
+      xs.sort_by(&fn)
+    end
+
+    # Combines two lists into a set (i.e. no duplicates) composed of the
+    # elements of each list.
+    #
+    # [*] -> [*] -> [*]
+    #
+    curried_method(:union) do |xs1, xs2|
+      xs1 | xs2
+    end
+
+    # Combines two lists into a set (i.e. no duplicates) composed of the elements
+    # of each list. Duplication is determined according to the value returned
+    # by applying the supplied predicate to two list elements. Combines two
+    # lists into a set (i.e. no duplicates) composed of the elements of each list.
+    # Duplication is determined according to the value returned by applying
+    # the supplied predicate to two list elements.
+    #
+    # (a -> a -> Boolean) -> [*] -> [*] -> [*]
+    #
+    curried_method(:union_with) do |fn, xs1, xs2|
+      (xs1 + xs2).uniq(&fn)
+    end
+  end
+end

data/lib/ramda/string.rb

@@ -0,0 +1,49 @@
+require_relative 'internal/curried_method'
+
+module Ramda
+  # String functions
+  module String
+    extend ::Ramda::Internal::CurriedMethod
+
+    # Splits a string into an array of strings based on the given separator.
+    #
+    # (String | RegExp) -> String -> [String]
+    #
+    curried_method(:split) do |sep, x|
+      x.split(sep)
+    end
+
+    # The upper case version of a string.
+    #
+    # String -> String
+    #
+    curried_method(:to_upper, &:upcase)
+
+    # The lower case version of a string.
+    #
+    # String -> String
+    #
+    curried_method(:to_lower, &:downcase)
+
+    # Tests a regular expression against a String. Note that this function will
+    # return an empty array when there are no matches. This differs from
+    # String.prototype.match which returns null when there are no matches.
+    #
+    # RegExp -> String -> [String | NilClass]
+    #
+    curried_method(:match) do |exp, x|
+      case x
+      when ::String
+        x[exp]
+        # x.scan(exp).flatten
+      else
+        type_error(x)
+      end
+    end
+
+    # TODO: Extract from this module
+    def self.type_error(object)
+      raise ArgumentError, "Unexpected type #{object.class}"
+    end
+  end
+end

data/lib/ramda/version.rb

@@ -0,0 +1,3 @@
+module Ramda
+  VERSION = '0.1.0.alpha'.freeze
+end

data/ramda-ruby.gemspec

@@ -0,0 +1,24 @@
+# coding: utf-8
+
+$LOAD_PATH << File.expand_path('../lib', __FILE__)
+
+require 'ramda/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = 'ramda-ruby'
+  spec.version       = Ramda::VERSION
+  spec.authors       = ['Vadim Lazebny']
+  spec.email         = ['vadim.lazebny@gmail.com']
+
+  spec.summary       = 'RamdaJs implementation for Ruby.'
+  spec.description   = 'A gem for porting RamdaJs tools for Ruby.'
+  spec.homepage      = 'https://github.com/lazebny/ramda-ruby'
+  spec.license       = 'MIT'
+
+  spec.files = `git ls-files -z`.split("\x0").reject do |f|
+    f.match(%r{^(test|spec|features)/})
+  end
+  spec.bindir        = 'exe'
+  spec.executables   = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
+  spec.require_paths = ['lib']
+end

metadata

@@ -0,0 +1,80 @@
+--- !ruby/object:Gem::Specification
+name: ramda-ruby
+version: !ruby/object:Gem::Version
+  version: 0.1.0.alpha
+platform: ruby
+authors:
+- Vadim Lazebny
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2017-06-16 00:00:00.000000000 Z
+dependencies: []
+description: A gem for porting RamdaJs tools for Ruby.
+email:
+- vadim.lazebny@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".bashrc.docker"
+- ".coveralls.yml"
+- ".gitignore"
+- ".overcommit.yml"
+- ".pryrc.docker"
+- ".rspec"
+- ".rubocop.yml"
+- ".travis.yml"
+- CHANGELOG.md
+- Dockerfile
+- Gemfile
+- Gemfile.dev
+- Gemfile.dev.lock
+- LICENSE.txt
+- README.md
+- ROADMAP.md
+- Rakefile
+- appveyor.yml
+- bin/console
+- bin/setup
+- codeclimate.yml
+- docker-compose.override.yml
+- docker-compose.yml
+- docs/FUNCTIONS.md
+- lib/ramda.rb
+- lib/ramda/function.rb
+- lib/ramda/internal/curried_method.rb
+- lib/ramda/internal/function_with_arity.rb
+- lib/ramda/list.rb
+- lib/ramda/logic.rb
+- lib/ramda/math.rb
+- lib/ramda/object.rb
+- lib/ramda/relation.rb
+- lib/ramda/string.rb
+- lib/ramda/version.rb
+- ramda-ruby.gemspec
+homepage: https://github.com/lazebny/ramda-ruby
+licenses:
+- MIT
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">"
+    - !ruby/object:Gem::Version
+      version: 1.3.1
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.5.1
+signing_key: 
+specification_version: 4
+summary: RamdaJs implementation for Ruby.
+test_files: []