totally_lazy 0.1.57 → 0.1.58

checksums.yaml

@@ -1,15 +1,15 @@
 ---
 !binary "U0hBMQ==":
   metadata.gz: !binary |-
-    ZGU1OTQwMzdjMjU2YmU4NjQ3MGFlZDg4YmJhNjAyODdhOTA5MDIwOA==
+    YzJmZGNkMjM1M2NhMGYwNjc0Y2UyZGQzYmMxOWQzODZjYmM0ZjE2MQ==
   data.tar.gz: !binary |-
-    NzhkMjc2MjVhZTA0MGYzNDcwZTU0MDE5MGQ3NmU3YWVlYTJkZTBlNw==
+    NzI1ZGNmNjRmY2JhNDBjNjMyMjg1MWNkNTkwNWI2MGIzYzI1OGFmNw==
 SHA512:
   metadata.gz: !binary |-
-    MTQ4ZDk2MzRkMzE5NWUwNDMzODIwMzM2MDFkYzRkNzA3Y2I5ODY3ODk3MjQ2
-    ZTUwYTNmYTNkNGY0NzAyNmRjZGY2NjJiZTIwMGFmNWE0YmY2NzFmMDdhYWE0
-    OWMwYTJkYmM4YTA5M2Y0ZGQzOWI4YWIzZWRiY2M2OWYyMGI5ZjY=
+    ODdlMzk3MDE3NTA2YjFkZjJlMWIzZjhhY2UxM2VjZTU0N2U0NjdiMDQwNjlm
+    OTI5OTU5MTVmMGRiMGM5MDJhMTQ3ZDdmOWFjMjAzMWEyOTljMGMxOWIxMzI2
+    MjA5NDZlZjI2NDE0NmE3NmMwNTJhZDM2N2Y0ODllMzUzZGM3MmQ=
   data.tar.gz: !binary |-
-    M2U0N2QyMTIzMGViMTczMmMzYjEyMjcwMGYxZjhhNjdiNThiOWM4YzAyYmVm
-    MDczNzA0ZmQxMzEzMDhlYzYwOGNmNGQ2NDI0OWVhOTYxMTg4YWZlM2E2OWI5
-    YjRjZjhmZjUxZGJjMGIyNWNkMjZjZDcwNTYwZTQ1ZmRlYjU1OGU=
+    MWJhMDFlZTU0ODY5MzBjMThlNzYzMDczOTA2MjYxMThjNWViODUxNWU2ODQw
+    MTg2MzVmOGM4ZTIzYWM1OWNlNzcwMzEyOGNhZWI2OWYyYWY2ZGI0ZTc5ZGIw
+    ZTgzODMzMzM1ZWRkN2I4NTBmNzk1YTUxNDgzNTQ4NWY2MDNlYjI=

data/lib/totally_lazy/enumerators.rb

@@ -73,11 +73,13 @@ module Enumerators
   end
 
   def enumerate(fn, start)
-    current = start
     Enumerator.new do |y|
-      result = current
-      current = fn.(current)
-      y << result
+      current = start
+      loop do
+        result = current
+        current = fn.(current)
+        y << result
+      end
     end.lazy
   end
 

data/lib/totally_lazy/numbers.rb

@@ -47,4 +47,12 @@ module Numbers
   def greater_than(right)
     predicate(->(left) { left > right })
   end
+
+  def multiply(y)
+    monoid(->(x){x * y}, 1)
+  end
+
+  def powers_of(amount)
+    Sequence.new(enumerate(multiply(amount), 1))
+  end
 end

data/spec/totally_lazy/numbers_spec.rb

@@ -0,0 +1,15 @@
+require_relative '../spec_helper'
+
+describe 'Numbers' do
+  it 'should support arbitrary multiply' do
+    expect(sequence(1, 2, 3, 4, 5).map(multiply(5))).to eq(sequence(5, 10, 15, 20, 25))
+  end
+
+  it 'should treat multiply as a monoid' do
+    expect(empty.reduce(multiply(5))).to eq(1)
+  end
+
+  it 'should be able to get powers_of a number' do
+    expect(powers_of(3).take(10)).to eq(sequence(1, 3, 9, 27, 81, 243, 729, 2187, 6561, 19683))
+  end
+end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: totally_lazy
 version: !ruby/object:Gem::Version
-  version: 0.1.57
+  version: 0.1.58
 platform: ruby
 authors:
 - Raymond Barlow
@@ -172,6 +172,7 @@ files:
 - spec/totally_lazy/either_spec.rb
 - spec/totally_lazy/functions_spec.rb
 - spec/totally_lazy/maps_spec.rb
+- spec/totally_lazy/numbers_spec.rb
 - spec/totally_lazy/option_spec.rb
 - spec/totally_lazy/predicates_spec.rb
 - spec/totally_lazy/sequence_spec.rb