mll 2.6.2 → 2.6.3

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 2f13ebbaab7d74cd58d37678b5f294c7ffc8e499
-  data.tar.gz: e4edd192a82271406e6554bf827f2acfddf3270f
+  metadata.gz: d37431f3cf10477e65f24dfee6b9076fb4969810
+  data.tar.gz: 010efad274ba249ce67ec414748cd7dd356cb659
 SHA512:
-  metadata.gz: b1645e158efb710ce7db7ce75baeda1873b9a5b64e464fb86c58d33e73ed08004db40bd0d7090621a9deb205bd9b6ac595522083642cdd11eb6f24d6c4c7d591
-  data.tar.gz: 9c6a60b447ab61653366bc05b39cbe172a2c18748c5bdf0bee86b2de59a8238e4121a7ca6aeb1e564168e45d9164ac3b803ede593640cdb825ea6e3fa2f1729a
+  metadata.gz: 8636fc22ee9cade5fe9eb39f88526872ed66714fc43fccb26afd169271baa122ce0844e95429402fcbf3a2c847e452f92a27f1e74451494a78546493625e25b8
+  data.tar.gz: 10a02174cac7729d1c42cbe11a30e2fbe8f33b4d162a0ac3be084c669ec8d9df55601b854a34f8843a85fbf1971be954ba008bf5c0ef69541b1b335cb98993f0

data/TODO.md

@@ -8,8 +8,6 @@ module MLL
         enumerator = Enumerator.new do |e|
           while list.all?{ |i| i.respond_to? :each } &&
             # TODO refactor into depth-first yielding
-    def nest_while
-      # TODO finish me
     def fold_list
       lambda do |x, list, f = nil|
         # TODO use Ruby#inject ?
@@ -103,6 +101,15 @@ describe MLL do
           # TODO example "find the next twin prime after 888" do
         describe "Properties & Relations:" do
           # TODO "#nest_while can be expressed in terms of a while loop" do
+      describe "#nest_while_list" do
+        describe "Details:" do
+          # TODO: "NestWhileList[f,expr,test,m] does not start applying test until at least m results have been generated. »"
+          # TODO: "NestWhileList[f,expr,test,m] is equivalent to NestWhileList[f,expr,test,{m,m}]. »"
+          # TODO: "NestWhileList[f,expr,UnsameQ,2] is equivalent to FixedPointList[f,expr]. »"
+          # TODO: "NestWhileList[f,expr,UnsameQ,All] goes on applying f until the same result first appears more than once."
+          # TODO: "NestWhileList[f,expr,test,m,max,n] applies f an extra n times, appending the results to the list generated. »"
+          # TODO: "NestWhileList[f,expr,test,m,max,-n] drops the last n elements from the list generated. »"
+        # TODO A LOT
   describe "Numerical Data" do
     describe "#mean" do
       # TODO examples to README.md

data/lib/mll.rb

@@ -1,6 +1,6 @@
 module MLL
 
-  VERSION = "2.6.2"
+  VERSION = "2.6.3"
 
   class << self
 
@@ -52,13 +52,21 @@ module MLL
     end
 
     def nest_while
-      # TODO finish me
       lambda do |expr, f, test|
-        expr = f[expr] while test[expr]
+        expr = f.call expr while test.call expr
         expr
       end
     end
 
+    def nest_while_list
+      lambda do |expr, f, test|
+        Enumerator.new do |e|
+          e << expr
+          e << expr = f.call(expr) while test.call expr
+        end
+      end
+    end
+
     def fold_list
       lambda do |x, list, f = nil|
         unless f

data/lib/mll/core_ext.rb

@@ -1,5 +1,11 @@
 require_relative "../mll"
 
+class Object
+  def nest_while_list f, test
+    MLL::nest_while_list[self, f, test]
+  end
+end
+
 class Array
   def most
     MLL::most[self]

data/spec/_spec.rb

@@ -1007,6 +1007,33 @@ describe MLL do
 
       end
 
+      # http://reference.wolfram.com/language/ref/NestWhileList.html
+      describe "#nest_while_list" do
+
+        describe "Details:" do
+
+          # TODO: "NestWhileList[f,expr,test,m] does not start applying test until at least m results have been generated. »"
+          # TODO: "NestWhileList[f,expr,test,m] is equivalent to NestWhileList[f,expr,test,{m,m}]. »"
+          # TODO: "NestWhileList[f,expr,UnsameQ,2] is equivalent to FixedPointList[f,expr]. »"
+          # TODO: "NestWhileList[f,expr,UnsameQ,All] goes on applying f until the same result first appears more than once."
+          # TODO: "NestWhileList[f,expr,test,m,max,n] applies f an extra n times, appending the results to the list generated. »"
+          # TODO: "NestWhileList[f,expr,test,m,max,-n] drops the last n elements from the list generated. »"
+
+        end
+
+        describe "Basic Examples:" do
+
+          example "keep dividing by 2 until the result is no longer an even number" do
+            expect(nest_while_list[123456, ->(i){ i / 2 }, ->(i){ i.even? }]).to be_a Enumerator
+            expect(nest_while_list[123456, ->(i){ i / 2 }, ->(i){ i.even? }].to_a).to eq [123456, 61728, 30864, 15432, 7716, 3858, 1929]
+          end
+
+        end
+
+        # TODO A LOT
+
+      end
+
     end
 
   end
@@ -1352,8 +1379,9 @@ describe "core_ext" do
   example "after core_ext required" do
     require_relative "../lib/mll/core_ext"
     aggregate_failures "everything is fine" do
-      expect([1,2,3,4].most).to eq [1,2,3]
-
+      expect( [1,2,3,4].most ).to eq [1,2,3]
+      expect( [1,2,3,4].rest.to_a ).to eq [2,3,4]
+      expect( 123456.nest_while_list(->(i){ i / 2 }, ->(i){ i.even? }).to_a ).to eq [123456, 61728, 30864, 15432, 7716, 3858, 1929]
     end
   end
 

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: mll
 version: !ruby/object:Gem::Version
-  version: 2.6.2
+  version: 2.6.3
 platform: ruby
 authors:
 - Victor Maslov
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2016-07-25 00:00:00.000000000 Z
+date: 2016-12-20 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
@@ -76,9 +76,8 @@ required_rubygems_version: !ruby/object:Gem::Requirement
       version: '0'
 requirements: []
 rubyforge_project: 
-rubygems_version: 2.0.14
+rubygems_version: 2.0.14.1
 signing_key: 
 specification_version: 4
 summary: Mathematica Language Library in Ruby
 test_files: []
-has_rdoc: