totally_lazy 0.0.20 → 0.1.0

metadata

@@ -1,43 +1,35 @@
 --- !ruby/object:Gem::Specification
 name: totally_lazy
 version: !ruby/object:Gem::Version
-  version: 0.0.20
+  version: 0.1.0
 platform: ruby
 authors:
-- Kingsley Hendrickse
+- Raymond Barlow
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2015-11-09 00:00:00.000000000 Z
+date: 2016-02-25 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rspec
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
-      - !ruby/object:Gem::Version
-        version: 3.0.0
-  type: :development
-  prerelease: false
-  version_requirements: !ruby/object:Gem::Requirement
-    requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
         version: 3.0.0
-- !ruby/object:Gem::Dependency
-  name: rdoc
-  requirement: !ruby/object:Gem::Requirement
-    requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '3.12'
+        version: '3.0'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 3.0.0
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '3.12'
+        version: '3.0'
 - !ruby/object:Gem::Dependency
   name: bundler
   requirement: !ruby/object:Gem::Requirement
@@ -56,16 +48,22 @@ dependencies:
   name: jeweler
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
         version: 2.0.1
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '2.0'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
         version: 2.0.1
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '2.0'
 - !ruby/object:Gem::Dependency
   name: rspec_html_formatter
   requirement: !ruby/object:Gem::Requirement
@@ -84,106 +82,95 @@ dependencies:
   name: rake
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - "~>"
+    - - ">="
       - !ruby/object:Gem::Version
         version: 10.3.2
-  type: :development
-  prerelease: false
-  version_requirements: !ruby/object:Gem::Requirement
-    requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: 10.3.2
-- !ruby/object:Gem::Dependency
-  name: simplecov
-  requirement: !ruby/object:Gem::Requirement
-    requirements:
-    - - ">="
-      - !ruby/object:Gem::Version
-        version: '0'
+        version: '10.3'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - ">="
       - !ruby/object:Gem::Version
-        version: '0'
+        version: 10.3.2
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.3'
 - !ruby/object:Gem::Dependency
-  name: coveralls
+  name: guard-rspec
   requirement: !ruby/object:Gem::Requirement
     requirements:
     - - ">="
       - !ruby/object:Gem::Version
-        version: '0'
+        version: 4.6.4
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '4.6'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - ">="
       - !ruby/object:Gem::Version
-        version: '0'
+        version: 4.6.4
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '4.6'
 - !ruby/object:Gem::Dependency
-  name: guard-rspec
+  name: concurrent-ruby-edge
   requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ">="
+    - - "~>"
       - !ruby/object:Gem::Version
         version: '0'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
-    - - ">="
+    - - "~>"
       - !ruby/object:Gem::Version
         version: '0'
 description: Port of java functional library totally lazy to ruby
-email: kingsleyhendrickse@me.com
+email: rbarlow@raymanoz.com
 executables: []
 extensions: []
 extra_rdoc_files:
-- LICENSE.txt
-- README.md
+- LICENSE
 files:
-- ".document"
-- ".rspec"
+- ".idea/.name"
+- ".idea/.rakeTasks"
+- ".idea/compiler.xml"
+- ".idea/encodings.xml"
+- ".idea/misc.xml"
+- ".idea/modules.xml"
+- ".idea/vcs.xml"
 - ".travis.yml"
 - Gemfile
 - Guardfile
-- LICENSE.txt
-- README.md
+- LICENSE
 - Rakefile
 - VERSION
-- lib/any.rb
-- lib/functor.rb
-- lib/generators.rb
+- contributors.txt
+- lib/comparators.rb
+- lib/enumerators.rb
+- lib/functions.rb
+- lib/numbers.rb
 - lib/option.rb
 - lib/pair.rb
-- lib/parallel/parallel.rb
-- lib/parallel/processor_count.rb
-- lib/predicates/compare.rb
-- lib/predicates/conversions.rb
-- lib/predicates/numbers.rb
-- lib/predicates/predicates.rb
-- lib/predicates/where.rb
-- lib/predicates/where_processor.rb
+- lib/predicates.rb
 - lib/sequence.rb
+- lib/strings.rb
 - lib/totally_lazy.rb
-- lib/type_check.rb
-- lib/utils.rb
-- spec/functor_spec.rb
-- spec/generators_spec.rb
+- readme.md
 - spec/option_spec.rb
-- spec/pair_spec.rb
-- spec/predicate_spec.rb
 - spec/sequence_spec.rb
-- spec/serialization_spec.rb
 - spec/spec_helper.rb
-- spec/type_check_spec.rb
-- spec/util_spec.rb
-- totally_lazy.gemspec
-homepage: http://github.com/kingsleyh/totally_lazy
+- totally_lazy.iml
+homepage: http://github.com/raymanoz/totally_lazy
 licenses:
-- MIT
+- Apache 2.0
 metadata: {}
 post_install_message: 
 rdoc_options: []
@@ -201,8 +188,8 @@ required_rubygems_version: !ruby/object:Gem::Requirement
       version: '0'
 requirements: []
 rubyforge_project: 
-rubygems_version: 2.4.5.1
+rubygems_version: 2.4.6
 signing_key: 
 specification_version: 4
-summary: Port of java functional library totally lazy to ruby
+summary: A lazy FP library for Ruby
 test_files: []

data/.document

@@ -1,5 +0,0 @@
-lib/**/*.rb
-bin/*
-- 
-features/**/*.feature
-LICENSE.txt

data/.rspec

@@ -1 +0,0 @@
---color

data/LICENSE.txt

@@ -1,20 +0,0 @@
-Copyright (c) 2014 Kingsley Hendrickse
-
-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/README.md

@@ -1,173 +0,0 @@
-# PLEASE NOTE - This project is not being actively maintained at the moment - I am taking a break - not sure when I will return.
-
-# Totally Lazy for Ruby
-
-This is a port of the java functional library [Totally Lazy](https://code.google.com/p/totallylazy/) to the ruby language. I've tried to get it as close as I can to the original concepts behind the java version of Totally Lazy but I'm still pretty far away from being happy with it.
-
-### Status
-
-[![Build Status](https://travis-ci.org/kingsleyh/totally_lazy.svg?branch=master)](https://travis-ci.org/kingsleyh/totally_lazy)
-[![Gem Version](https://badge.fury.io/rb/totally_lazy.svg)](http://badge.fury.io/rb/totally_lazy)
-[![Stories in Ready](https://badge.waffle.io/kingsleyh/totally_lazy.svg?label=ready&title=Ready)](http://waffle.io/kingsleyh/totally_lazy)
-[![Coverage Status](https://coveralls.io/repos/kingsleyh/totally_lazy/badge.png?branch=master)](https://coveralls.io/r/kingsleyh/totally_lazy?branch=master)
-[![Inline docs](http://inch-ci.org/github/kingsleyh/totally_lazy.png?branch=master)](http://inch-ci.org/github/kingsleyh/totally_lazy)
-### Summary
-
-* Tries to be as lazy as possible
-* Supports method chaining
-* Is primarily based on ruby Enumerators
-
-### Install
-
-This gem requires ruby 2.x.x
-
-In your bundler Gemfile
-
-```ruby
- gem totally_lazy, '~>0.0.6' 
-```
-
-Or with rubygems
-
-```
- gem install totally_lazy
-```
-
-### Examples
-
-The following are some simple examples of the currently implemented functionality.
-
-```ruby
-require 'totally_lazy'
-
-sequence(1,2,3,4).filter(even) # lazily returns 2,4
-sequence(1,2).map(as_string) # lazily returns "1","2"
-sequence(1, 2).map_concurrently(to_string) # lazily distributes the work to background threads
-sequence(1,2,3).take(2) # lazily returns 1,2
-sequence(1,2,3).drop(2) # lazily returns 3
-sequence(1,2,3).tail # lazily returns 2,3
-sequence(1,2,3).head # eagerly returns 1
-sequence(1,2,3).head_option # eagerly returns an option
-some(sequence(1,2,3)).get_or_else(empty) # eagerly returns value or else empty sequence
-sequence(1, 2, 3, 4, 5).filter(where(is greater_than 2).and(is odd)) # lazily returns 3,5
-sequence(pair(1, 2), pair(3, 4)).filter(where(key:odd)) # lazily returns 1,3
-```
-
-#### Sequences
-
-* sequence wraps whatever is passed without modification - e.g. sequence([1,2,3]).head returns the array [1,2,3]
-* if you have a single array you can [1,2,3].to_seq which returns a flattened sequence - e.g. [1,2,3].to_seq.head returns 1
-* you can also do sequence([1,2,3]).flatten to get sequence([1,2,3]).flatten.head returns 1
-
-#### Generators
-
-There are 2 types of generators:
-
-* Seq - returns a sequence
-* Iter - returns a regular ruby enumerator
-
-```ruby
-Seq.range(1, 4) # lazily returns 1,2,3,4
-Seq.repeat("car") # lazily returns an infinite sequence of "car"s
-Seq.iterate(:+, 1) # lazily returns 1,2,3 ... to infinity
-Seq.range(1, 4).cycle # lazily returns 1,2,3,4,1,2,3,4,1,2,3,4 infinitely
-Seq.primes # lazily returns every prime number
-Seq.fibonacci # lazily returns the fibonacci sequence
-Seq.powers_of(3) # lazily returns the powers of 3 (i.e 1,3,9,27 ...)
-
-Iter.range(1,4) # example with Iter: lazily returns 1,2,3,4 with a regular ruby enumerator
-```
-
-Naturally you can combine these operations together:
-
-```ruby
-option(1).join(sequence(2,3,4)).join(sequence(5,6)).filter(odd).take(2) # lazily returns 1,3
-
-Seq.iterate(:+, 1).filter(even).take(2).reduce(:+) # returns 6
-```
-
-### Predicates
-
-You can supply basic predicates as follows:
-
-##### numbers
-
-    sequence(1,2,3).filter(even) # returns 2
-
-##### conversions
-
-    sequence(1,2,3).map(as_string) # returns ["1","2","3"]
-
-##### comparisons
-
-    sequence(1,2,3).filter(equals(2) # return 2
-
-##### where - for self or objects
-
-**using self**
-
-When the predicate applies to an item in the sequence you use the **is** keyword with *where* to indicate the operation is on *self*
-
-    sequence(1,2,3).filter(where is greater_than 2)
-
-**using objects**
-
-When the predicate applies to a method on an object in the sequence then you supply hashmap of method_name:predicate (without using *is*)
-
-    sequence(pair(1,2),pair(3,4)).filter(where key:greater_than(3))
-
-(pair has methods key and value)
-
-##### Regex
-
-You can use a regex predicate
-
-   sequence("apple","pear").filter(matches(/app/))
-   sequence(pair("apple",1),pair("pear",2)).filter(where(key:matches(/app/)))
-
-#### Custom Transformer
-
-There is a built in helper for a simple transform
-
-* simple_transform
-
-##### simple_transform
-
-For example:
-
-    def as_uppercase
-      simple_transform(:as_uppercase, -> (v) { v.upcase })
-    end
-
-    sequence("apple","pear").map(as_uppercase) # returns ["APPLE","PEAR"]
-
-
-#### Custom Predicates
-
-Writing a custom predicate is very easy and there are 3 built in helpers:
-
-* value predicate
-* self predicate
-
-##### value_predicate
-
-For example:
-
-    def greater_than_or_equal_to(value)
-      value_predicate(:greater_than_or_equal_to,:>=,value)
-    end
-
-    sequence(1,2,3).filter(greater_than_or_equal_to 2)
-    sequence(1,2,3).filter(where is greater_than_or_equal_to 2)
-
-##### self_predicate
-
-For example:
-
-    def is_valid
-      self_predicate(:is_valid, :is_valid)
-    end
-
-    sequence(OpenStruct.new(is_valid:true,name:'apple'),OpenStruct.new(is_valid:false,name:'pear')).filter(is_valid).to_a
-    => [#<OpenStruct is_valid=true, name="apple">]
-

data/lib/any.rb

@@ -1,13 +0,0 @@
-module Any
-
-  module_function
-
-  def string(length=rand(10)+1)
-    Seq.range('a','z').shuffle.take(length).to_a.join
-  end
-
-  def int(length=rand(10)+1)
-    Seq.repeat(-> { rand(9)}).take(length).to_a.join.to_i
-  end
-
-end

data/lib/functor.rb

@@ -1,92 +0,0 @@
-# Functor is Ruby's implementation of a Higher-Order-Message. Essentally,
-# a Functor can vary its behavior accorrding to the operation applied to it.
-#
-# Example
-#
-#   f = Functor.new { |op, x| x.send(op, x) }
-#   (f + 1)  #=> 2
-#   (f + 2)  #=> 4
-#   (f + 3)  #=> 6
-#   (f * 1)  #=> 1
-#   (f * 2)  #=> 4
-#   (f * 3)  #=> 9
-#
-class Functor #< BasicObject
-
-  # Functors can be somewhat inefficient if a new Functor
-  # is frequently recreated for the same use. So this cache
-  # can be used to speed things up.
-  #
-  # The +key+ will always be an array, wich makes it easier
-  # to cache Functor for multiple factors.
-  #
-  def self.cache(*key, &function)
-    @cache ||= {}
-    if function
-      @cache[key] = new(&function)
-    else
-      @cache[key]
-    end
-  end
-
-  EXCEPTIONS = [:binding, :inspect, :object_id]
-  if defined?(::BasicObject)
-    EXCEPTIONS.concat(::BasicObject.instance_methods)
-    EXCEPTIONS.uniq!
-    EXCEPTIONS.map!{ |m| m.to_sym }
-  end
-
-  #
-  alias :__class__ :class
-
-  ## If Functor were built-in to Ruby this would not be
-  ## needed since exceptions could just be added directly.
-  ##$FUNCTOR_EXCEPTIONS ||= [:binding, :undefine_method]
-
-  ## TODO: This will not work when BasicObject is utilized. How to fix?
-  ##def self.honor_exceptions
-  ##  $FUNCTOR_EXCEPTIONS.each{ |name|
-  ##    next if method_defined?(name)
-  ##    eval %{
-  ##      def #{name}(*a,&b)
-  ##        super(*a, &b)
-  ##      end
-  ##    }
-  ##  }
-  ##end
-
-  # Privatize all methods except vital methods and #binding.
-  instance_methods(true).each do |m|
-    next if m.to_s =~ /^__/
-    next if EXCEPTIONS.include?(m.to_sym)
-    undef_method(m)
-  end
-
-  #
-  def initialize(&function)
-    @function = function
-  end
-
-  #
-  def to_proc
-    @function
-  end
-
-  ##def inspect
-  ##  #"#<#{__class__}:#{object_id} #{method_missing(:inspect)}>"    # hex id ?
-  ##  "#{method_missing(:inspect)}"
-  ##end
-
-  ## Needed?
-  ##def send(op, *a, &b)
-  ##  method_missing(op, *a, &b)
-  ##end
-
-  private
-
-  # Any action against the Functor is processesd by the function.
-  def method_missing(op, *args, &blk)
-    @function.call(op, *args, &blk)
-  end
-
-end

data/lib/generators.rb

@@ -1,161 +0,0 @@
-module Generators
-
-  module Seq
-
-    module_function
-
-    def repeat(item)
-      Sequence.new(Sequence::Generator.new do |g|
-        loop { g.yield item.respond_to?(:call) ? item.call : item }
-      end)
-    end
-
-    def range(lower, higher)
-      Sequence.new(Sequence::Generator.new do |g|
-        (lower..higher).each { |item| g.yield item }
-      end)
-    end
-
-    def iterate(operator, item, start=1)
-      Sequence.new(Sequence::Generator.new do |g|
-        value = start
-        loop do
-          g.yield value
-          value = value.send(operator, item)
-        end
-      end)
-    end
-
-    def primes
-      Sequence.new(Sequence::Generator.new do |g|
-        Prime.each { |n| g.yield n }
-      end)
-    end
-
-    def fibonacci
-      Sequence.new(Sequence::Generator.new do |g|
-        i, j = 1, 1
-        loop do
-          g.yield i
-          i, j = j, i + j
-        end
-      end)
-    end
-
-    def powers_of(v)
-      Sequence.new(Sequence::Generator.new do |g|
-        Seq.iterate(:+,1,0).each {|n| g.yield v**n}
-      end)
-    end
-
-
-  end
-
-  module Iter
-
-    module_function
-
-    def repeat(item)
-      Repeater.new(item)
-    end
-
-    def range(lower, higher)
-      Ranger.new(lower, higher)
-    end
-
-    def iterate(operator, item, start=1)
-      Iterate.new(operator, item, start)
-    end
-
-    def primes
-      Primes.new
-    end
-
-    def fibonacci
-      Fibonacci.new
-    end
-
-    def powers_of(v)
-      PowerOf.new(v)
-    end
-
-    class Repeater
-      include Enumerable
-
-      def initialize(item)
-        @item = item
-      end
-
-      def each
-        loop { yield(@item) }
-      end
-    end
-
-    class Ranger
-      include Enumerable
-
-      def initialize(lower, higher)
-        @lower = lower
-        @higher = higher
-      end
-
-      def each
-        (@lower..@higher).each { |i| yield i }
-      end
-    end
-
-    class Iterate
-
-      include Enumerable
-
-      def initialize(operator, item, start)
-        @operator = operator
-        @item = item
-        @start = start
-      end
-
-      def each
-        value = @start
-        loop do
-          yield value
-          value = value.send(@operator, @item)
-        end
-      end
-
-    end
-
-    class Primes
-      include Enumerable
-
-      def each
-        Prime.each { |p| yield p }
-      end
-    end
-
-    class Fibonacci
-      include Enumerable
-
-      def each
-        i, j = 1, 1
-        loop do
-          yield i
-          i, j = j, i + j
-        end
-      end
-    end
-
-    class PowerOf
-      include Enumerable
-
-      def initialize(v)
-        @v = v
-      end
-
-      def each
-        Iter.iterate(:+,1,0).each {|n| yield @v**n}
-      end
-    end
-
-  end
-
-end