totally_lazy 0.1.55 → 0.1.56

checksums.yaml

@@ -1,15 +1,15 @@
 ---
 !binary "U0hBMQ==":
   metadata.gz: !binary |-
-    MGFjNjY5NzI0NjAzMDgyZThjYTA3MTUxYWI0YTBiNzk0ZmZkMDA5ZQ==
+    MmQyN2I0MzM0NzY5NjEyZGM4NDJmMzAwNzMwY2JiZjM2ZGY5ZThmOQ==
   data.tar.gz: !binary |-
-    YmU1MjQ0YzVmOThmMjYzMTVlODlmODY3Yzc4OWE0OWUxMzc5YTI0Mg==
+    NDFhNDU0YzYxNjcwMjdlNmZmZjhlZTllYTIzNTAyMzZmMDMyYmZkZQ==
 SHA512:
   metadata.gz: !binary |-
-    M2ZiYzJjOTZlNjZlN2Y5NmJkNDM5ZmNmYTY1MThiODQyYzgyNGU0OTkwOWJk
-    ODk3ZjhmNDJjNGVhZmZhYTRmNGMzMjQyMjJmYjdmYzI2MDAyNTIyYzdkOTRi
-    MTU1ZWIxYmUxYjQwZmEzZTlmOTE2YTkyNjRjMjNkNzhkNDliNmE=
+    ZGY0ZDg4NTE0M2Q5YmM0YmJlM2I1N2YxNmIxNzJiMTRmOTE2YjViMmRjMzc2
+    NjMxYmFmMWUwYmViNTllMTIzMWM2ZGFjYjU5NzI2YjYxZGIyNTI3OWJjMjMz
+    YjRmMGE5NDhlODg2ZTVlMDdjYTk1OTgyOGMyOTEwMzQyNzE1NGY=
   data.tar.gz: !binary |-
-    YTNkYWNmODE3OTVjY2QzZWRmM2UyMWFmZDZlODM4N2M4OTY3MTk1MTJkMDI0
-    ZGFhOTAxZDRjZDdiYzg5MTc3MDdmZDZkMDViOWZiNjY1ZDhhYTMwZDA3YTVk
-    OGNmNjhjMTZkYjA2ZjAzMWU1YmFjMmVkY2RhNGNmYTFhMDA1OTM=
+    NjkxMTNhMDlmMWNmZjI5MmNkODE3YjY0YWM1ZmRmYmFlNzE0YWM1MzYyM2Yx
+    Y2M1ZDYwYmQzZDE5NGQ0MTE2YzliYWI3YzBlYWU5YmQxNTg5OTRhYjVkYzQz
+    NDZlZGVhMGFkOGI3MjcwNzViMmRhOGRkYWI3NGMyMjNiMjRkY2Y=

data/readme.md

@@ -36,15 +36,23 @@ The following are some simple examples of the currently implemented functionalit
 ```ruby
 require 'totally_lazy'
 
-sequence(1,2,3,4).filter(even) # lazily returns 2,4
-sequence(1,2).map(to_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(greater_than(2).and(odd)) # lazily returns 3,5
-sequence(pair(1, 2), pair(3, 4)).filter(where(first, equal_to?(3))) # lazily returns pair(3,4)
+sequence(1, 2, 3, 4).filter(even)           # lazily returns 2,4
+sequence(1, 3, 5).find(even)                # eagerly returns none()
+sequence(1, 2, 3).contains?(2)              # eagerly returns true
+sequence(1, 2, 3).exists?(even)             # eagerly return true
+sequence(1, 2).map(to_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).reduce(sum)               # eagerly return 6
+sequence(1, 2, 3).for_all(odd)              # eagerly returns false;
+sequence(1, 2, 3).fold_left(0, add)         # eagerly returns 6
+some(sequence(1, 2, 3)).get_or_else(empty)  # eagerly returns value or else empty sequence
+sequence(1, 2, 3, 4, 5).filter(greater_than(2).and(odd))
+                                            # lazily returns 3,5
+sequence(pair(1, 2), pair(3, 4)).filter(where(first, equal_to?(3))) 
+                                            # lazily returns pair(3,4)
+sequence(1, 2, 3).to_s                      # eagerly returns "[1,2,3]"
 ```

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: totally_lazy
 version: !ruby/object:Gem::Version
-  version: 0.1.55
+  version: 0.1.56
 platform: ruby
 authors:
 - Raymond Barlow