mll 2.3.0 → 2.4.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: d67aa2bc083ee5926dba5e8ab794ec81579c3d94
-  data.tar.gz: 54b82009ff7fced4eadbdb48c663e9b046ae368d
+  metadata.gz: 4578ca0a16a98bc1a8ab3336d073e3520b85cdc9
+  data.tar.gz: 78ef02a3c5081a97b4bf7fa7278d0da84d2e4f3a
 SHA512:
-  metadata.gz: fdc4e70514e2e323f53cda619ce8b16b4a05f672c05666a1062fb43a53c86d9169df93c0100599fd2725a4802fc5686816160396388ef619a8995bf2b4cef8f4
-  data.tar.gz: 1e977a6fad2adf25434f6f899b919b71b6df0300032c4029ce8147c00429111e3e06c31972ea60d04726bfc7483bf975c721adec07deda72b9a790efbb67ad31
+  metadata.gz: b24b4691ada481ae2150e7f073b5e77f151d38d823a76743dc4bfcd1b0e52b55da52e61b5fdb9855108a6b2e9de3d04a563e9a9b8f1309ae414c88aac267d8db
+  data.tar.gz: 4972ad59f90b6cddfd2c000144960a8850571682661037aed329923c21da3325450be4032586816b7462fa10c5f3fbd240d4a7dbd3463876883042b233adf0ce

data/.rspec

@@ -1,2 +1 @@
---format documentation
 --color

data/Gemfile.lock

@@ -1,32 +1,30 @@
 PATH
   remote: .
   specs:
-    mll (2.2.1)
+    mll (2.4.1)
 
 GEM
   remote: https://rubygems.org/
   specs:
     diff-lcs (1.2.5)
-    rspec (3.1.0)
-      rspec-core (~> 3.1.0)
-      rspec-expectations (~> 3.1.0)
-      rspec-mocks (~> 3.1.0)
-    rspec-core (3.1.7)
-      rspec-support (~> 3.1.0)
-    rspec-expectations (3.1.2)
+    rspec (3.3.0)
+      rspec-core (~> 3.3.0)
+      rspec-expectations (~> 3.3.0)
+      rspec-mocks (~> 3.3.0)
+    rspec-core (3.3.2)
+      rspec-support (~> 3.3.0)
+    rspec-expectations (3.3.1)
       diff-lcs (>= 1.2.0, < 2.0)
-      rspec-support (~> 3.1.0)
-    rspec-mocks (3.1.3)
-      rspec-support (~> 3.1.0)
-    rspec-support (3.1.2)
+      rspec-support (~> 3.3.0)
+    rspec-mocks (3.3.2)
+      diff-lcs (>= 1.2.0, < 2.0)
+      rspec-support (~> 3.3.0)
+    rspec-support (3.3.0)
 
 PLATFORMS
   ruby
 
 DEPENDENCIES
-  bundler (~> 1.7)
+  bundler (~> 1.7.0)
   mll!
-  rspec (~> 3.1.0)
-
-BUNDLED WITH
-   1.11.2
+  rspec (~> 3.3.0)

data/README.md

@@ -18,6 +18,7 @@ The main goal is to make Ruby more powerful by including the most used functions
 4. `::fold_list` was wanted [here](http://stackoverflow.com/q/1475808/322020) in Ruby while being already implemented as [FoldList[]](http://reference.wolfram.com/language/ref/FoldList.html) in Mathematica and [scanl](http://hackage.haskell.org/package/base-4.8.0.0/docs/Prelude.html#v:scanl) in Haskell
 5. `::nest` (n times) and `::nest_list` for repetitive applying the same function -- `::nest_while` and `::nest_while_list` are going to be implemented later
 6. `::tally` -- shortcut to a probably the most common usage of `#group_by` -- calculating total occurences.
+7. TODO write smth about `::riffle`, `::subdivide`, `::grid`
 
 ### How
 
@@ -25,56 +26,82 @@ The main goal is to make Ruby more powerful by including the most used functions
     MLL::range[[2, 3]] # => [1..2, 1..3]
     MLL::range[ 1..3 ] # => [1..1, 1..2, 1..3]
 
+    MLL::table[ MLL::times, 9, 9 ]
+                       # => [[1,  2,  3,  4,  5,  6,  7,  8,  9],
+                             [2,  4,  6,  8, 10, 12, 14, 16, 18],
+                             [3,  6,  9, 12, 15, 18, 21, 24, 27],
+                             [4,  8, 12, 16, 20, 24, 28, 32, 36],
+                             [5, 10, 15, 20, 25, 30, 35, 40, 45],
+                             [6, 12, 18, 24, 30, 36, 42, 48, 54],
+                             [7, 14, 21, 28, 35, 42, 49, 56, 63],
+                             [8, 16, 24, 32, 40, 48, 56, 64, 72],
+                             [9, 18, 27, 36, 45, 54, 63, 72, 81]]
+
+    # similar to Ruby's #product with #map...
     t = MLL::table[ ->(i,j){ i+j }, [[1, 0, 1]], [[0, 2, 0]] ]
                        # => [[1, 3, 1],
                              [0, 2, 0],
                              [1, 3, 1]]
+    # ... but our #map...
     t = MLL::map[ ->(i){ [i] }, t, [2] ]
                        # => [[ [1], [3], [1] ],
                              [ [0], [2], [0] ],
                              [ [1], [3], [1] ]]
+    # ... can go deeper
     MLL::map[ ->(i){ -i }, t, [3] ]
                        # => [[ [-1], [-3], [-1] ],
                              [ [ 0], [-2], [ 0] ],
                              [ [-1], [-3], [-1] ]]
 
-    MLL::table[ MLL::times, 9, 9 ]
-                       # => [[1,  2,  3,  4,  5,  6,  7,  8,  9],
-                             [2,  4,  6,  8, 10, 12, 14, 16, 18],
-                             [3,  6,  9, 12, 15, 18, 21, 24, 27],
-                             [4,  8, 12, 16, 20, 24, 28, 32, 36],
-                             [5, 10, 15, 20, 25, 30, 35, 40, 45],
-                             [6, 12, 18, 24, 30, 36, 42, 48, 54],
-                             [7, 14, 21, 28, 35, 42, 49, 56, 63],
-                             [8, 16, 24, 32, 40, 48, 56, 64, 72],
-                             [9, 18, 27, 36, 45, 54, 63, 72, 81]]
     # ::times     means  *
     # ::divide    means  /
     # ::subtract  means  -
     # ::plus      means  +
 
-    MLL::fold_list[ MLL::times, MLL::range[10] ]
-                       # => [1,2,6,24,120,720,5040,40320,362880,3628800]
-
-    # here is `Listable' magic, allowing to zip arrays
+    # here is another `Listable' magic, allowing to zip arrays
     #   even of different dimensions with basic operations
     MLL::times[ [[1,2],[3,4]], [5,6] ]
                        # => [[5,10], [18,24]]
+
+    # listing factorials # http://stackoverflow.com/a/3590520/322020
+    MLL::fold_list[ MLL::times, MLL::range[8] ]
+                       # => [1, 2, 6, 24, 120, 720, 5040, 40320]
     
+    MLL::fold_list[ ->(a,b){ 10*a + b }, 0, [4,5,1,6,7,8] ]
+                       # => [0, 4, 45, 451, 4516, 45167, 451678]
+
     # http://en.wikipedia.org/wiki/Collatz_conjecture
     MLL::nest_list[ ->(i){ i.even? ? i/2 : (i*3+1)/2 }, 20, 10 ]
                        # => [20, 10, 5, 8, 4, 2, 1, 2, 1, 2, 1]
 
-    MLL::fold_list[ ->(a,b){ 10*a + b }, 0, [4,5,1,6,7,8] ]
-                       # => [0,4,45,451,4516,45167,451678]
+    # counting characters and nice printing the resulting table
+    MLL::grid[ MLL::tally[ "the quick brown fox jumps over the lazy dog".chars ].
+                 sort_by(&:last).reverse.take(10),
+               frame: :all, spacings: [2, 0] ]
+                       # => ┏━━━┳━━━┓
+                            ┃   ┃ 8 ┃
+                            ┃ o ┃ 4 ┃
+                            ┃ e ┃ 3 ┃
+                            ┃ u ┃ 2 ┃
+                            ┃ h ┃ 2 ┃
+                            ┃ r ┃ 2 ┃
+                            ┃ t ┃ 2 ┃
+                            ┃ n ┃ 1 ┃
+                            ┃ p ┃ 1 ┃
+                            ┃ m ┃ 1 ┃
+                            ┗━━━┻━━━┛
+    # current implementation of #grid sucks and needs your help ,.)
+
+    MLL::riffle[ "4345252523535".chars, ",", [-4,1,-4] ]
+                       # => "4,345,252,523,535"
 
     MLL::subdivide[ 5, 10, 4 ]
                        # => [5.0, 6.25, 7.5, 8.75, 10.0]
-    
-    MLL::tally[ "the quick brown fox jumps over the lazy dog".chars ]
-    # => {"t"=>2, "h"=>2, "e"=>3, " "=>8, "q"=>1, "u"=>2, "i"=>1, "c"=>1, "k"=>1,
-          "b"=>1, "r"=>2, "o"=>4, "w"=>1, "n"=>1, "f"=>1, "x"=>1, "j"=>1, "m"=>1,
-          "p"=>1, "s"=>1, "v"=>1, "l"=>1, "a"=>1, "z"=>1, "y"=>1, "d"=>1, "g"=>1}
+
+    MLL::most[ [1, 2, 3, 4] ]  # => [1, 2, 3]
+    # now it's possible to extend core classes with some of those methods
+    require "mll/core_ext"
+    [1, 2, 3, 4].most          # => [1, 2, 3]
 
 Note that to see some of above examples working in the same way you need `.to_a`, `.map(&:to_a)` or even `.to_a.map(&:to_a)` since lazyness is intensively used.
 
@@ -90,6 +117,10 @@ or
 
     rake spec
 
+or
+
+    rake    # to implicitly run 'rake todo'
+
 ### TODO (this section is filled automatically by `rake todo` task -- do not remove)
 
 #### lib/mll.rb
@@ -121,6 +152,13 @@ module MLL
         # TODO negative spacings?
         # TODO smth with this #.all?
         # TODO https://reference.wolfram.com/language/ref/Alignment.html
+    def riffle
+      lambda do |*args|
+        case args.size
+          when 3
+            Enumerator.new do |e|
+              args[0].each_with_index do |x, i|
+                # TODO make it not destructive
   # TODO not sure if we need any other kind of Listability except of #range[[Array]]
   # TODO #power[]
 ```
@@ -145,6 +183,11 @@ describe MLL do
           # TODO: "Make a triangular array:"
       describe "#range" do
         # TODO take from docs more examples that involve other functions
+    describe "Rearranging & Restructuring Lists" do
+      describe "#riffle" do
+        describe "Scope:" do
+          example "intersperse two lists" do
+            # TODO check how it works for list2.size == list1.size + 1 in Mathematica
     describe "Applying Functions to Lists" do
       describe "#fold_list" do
         describe "Applications:" do
@@ -164,6 +207,8 @@ describe MLL do
           # TODO #mapthread ?
           # TODO #mapindexed ?
           # TODO "negative levels"
+    describe "Elements of Lists" do
+      # TODO #rest
     # TODO http://reference.wolfram.com/language/guide/RearrangingAndRestructuringLists.html
     # TODO http://reference.wolfram.com/language/guide/MathematicalAndCountingOperationsOnLists.html
   describe "Functional Programming" do

data/core_ext.rb

@@ -0,0 +1,7 @@
+require_relative "lib/mll"
+
+class Array
+  def most
+    MLL::most[self]
+  end
+end

data/lib/mll.rb

@@ -1,5 +1,7 @@
 module MLL
 
+  VERSION = "2.4.1"
+
   class << self
 
     def dimensions
@@ -203,23 +205,30 @@ module MLL
       end
     end
 
-    def define_listable_function name, &block
-      (class << self; self end).class_eval do
-        define_method name do
-          lambda do |*args|
-            case args.map{ |i| i.respond_to? :map }
-              when [true] ; args.first.lazy.map &method(name).call
-              when [true, true] ; args.first.lazy.zip(args.last).map{ |i, j| send(name)[i, j] }
-              when [true, false] ; args.first.lazy.map{ |i| send(name)[i, args.last] }
-              when [false, true] ; args.last.lazy.map{ |i| send(name)[args.first, i] }
-            else
-              block.call *args
-            end
+    def most
+      # not Enumerator because if the end is invisible we can't stop at -2
+      lambda do |list|
+        list[0..-2]
+      end
+    end
+
+  end
+
+  def self.define_listable_function name, &block
+    (class << self; self end).class_eval do
+      define_method name do
+        lambda do |*args|
+          case args.map{ |i| i.respond_to? :map }
+            when [true] ; args.first.lazy.map &method(name).call
+            when [true, true] ; args.first.lazy.zip(args.last).map{ |i, j| send(name)[i, j] }
+            when [true, false] ; args.first.lazy.map{ |i| send(name)[i, args.last] }
+            when [false, true] ; args.last.lazy.map{ |i| send(name)[args.first, i] }
+          else
+            block.call *args
           end
         end
       end
     end
-
   end
 
   # TODO not sure if we need any other kind of Listability except of #range[[Array]]
@@ -269,7 +278,7 @@ module MLL
 
   define_orderless_function(:plus,  0) { |a, b| _plus.call  a, b }
   define_orderless_function(:times, 1) { |a, b| _times.call a, b }
-  
+
   def self.mean
     lambda do |list|
       divide[times[plus[*list], 1.0], list.size]

data/mll.gemspec

@@ -1,6 +1,6 @@
 Gem::Specification.new do |spec|
   spec.name          = "mll"
-  spec.version       = "2.3.0"
+  spec.version       = (require_relative "lib/mll"; MLL::VERSION)
   spec.authors       = ["Victor Maslov"]
   spec.email         = ["nakilon@gmail.com"]
   spec.summary       = "Mathematica Language Library in Ruby"
@@ -13,9 +13,9 @@ Gem::Specification.new do |spec|
   spec.test_files    = ["spec/"]
   # spec.require_paths = ["lib"]
 
-  spec.add_development_dependency "bundler", "~> 1.7"
+  spec.add_development_dependency "bundler", "~> 1.7.0"
   # spec.add_development_dependency "rake", "~> 10.0"
-  spec.add_development_dependency "rspec", "~> 3.1.0"
+  spec.add_development_dependency "rspec", "~> 3.3.0"
 
   spec.required_ruby_version = ">= 2.0.0"
   # spec.post_install_message = ""

data/spec/_spec.rb

@@ -1,5 +1,4 @@
-require_relative File.join "..", "lib", "mll"
-
+require_relative "../lib/mll"
 
 # PERMATODO test all implemented exceptions
 # PERMATODO test all types returned (not actually all but about lazyness)
@@ -183,7 +182,7 @@ describe MLL do
             expect(fold_list[0, [1,2,3], plus]).to be_a Enumerator
             expect(fold_list[0, [1,2,3], plus].to_a).to eq [0,1,3,6]
           end
-          
+
         end
 
       end
@@ -798,6 +797,34 @@ describe MLL do
     # http://reference.wolfram.com/language/guide/ElementsOfLists.html
     describe "Elements of Lists" do
 
+      # https://reference.wolfram.com/language/ref/Most.html
+      describe "#most" do
+
+        example "#most[expr] is equivalent to Array#[](0..-2)" do
+          expect(most[[1,2,3,4]].to_a).to eq [1,2,3,4][0..-2]
+        end
+
+        describe "Basic Examples:" do
+
+          example "???" do
+            expect(most[[1,2,3,4]].to_a).to eq [1,2,3]
+          end
+
+        end
+
+        describe "Applications:" do
+
+          example "nest the operation of finding most of a list" do
+            expect(nest_list[[1,2,3,4], 3, most].to_a).to eq [[1,2,3,4], [1,2,3], [1,2], [1]]
+          end
+
+        end
+
+      end
+
+      # TODO #rest
+
+      # https://reference.wolfram.com/language/ref/Dimensions.html
       describe "#dimensions" do
 
         describe "Basic Examples:" do
@@ -959,7 +986,7 @@ describe MLL do
     describe "#tally" do
 
       describe "Details:" do
-        
+
         example "#tally[list] is equivalent to #tally[list,#sameq]" do
           skip "#sameq is yet to be implemented"
         end
@@ -1218,7 +1245,7 @@ describe MLL do
           end
 
         end
-        
+
       end
 
       describe "Options:" do
@@ -1272,6 +1299,24 @@ end
 # TODO http://reference.wolfram.com/language/guide/HandlingArraysOfData.html
 # TODO http://reference.wolfram.com/language/guide/ComputationWithStructuredDatasets.html
 
+
+describe "core_ext" do
+
+  example "by default core classes are not patched" do
+    expect{ [1,2,3,4].most }.to raise_error NoMethodError
+  end
+
+  example "after core_ext required" do
+    require_relative "../core_ext"
+    aggregate_failures "everything is fine" do
+      expect([1,2,3,4].most).to eq [1,2,3]
+
+    end
+  end
+
+end
+
+
 __END__
 
 Table     Array

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: mll
 version: !ruby/object:Gem::Version
-  version: 2.3.0
+  version: 2.4.1
 platform: ruby
 authors:
 - Victor Maslov
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2016-02-06 00:00:00.000000000 Z
+date: 2016-05-07 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
@@ -16,28 +16,28 @@ dependencies:
     requirements:
     - - ~>
       - !ruby/object:Gem::Version
-        version: '1.7'
+        version: 1.7.0
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - ~>
       - !ruby/object:Gem::Version
-        version: '1.7'
+        version: 1.7.0
 - !ruby/object:Gem::Dependency
   name: rspec
   requirement: !ruby/object:Gem::Requirement
     requirements:
     - - ~>
       - !ruby/object:Gem::Version
-        version: 3.1.0
+        version: 3.3.0
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - ~>
       - !ruby/object:Gem::Version
-        version: 3.1.0
+        version: 3.3.0
 description: ''
 email:
 - nakilon@gmail.com
@@ -51,6 +51,7 @@ files:
 - Gemfile.lock
 - README.md
 - Rakefile
+- core_ext.rb
 - lib/mll.rb
 - mll.gemspec
 - spec/_spec.rb