flor 0.16.1 → 0.16.2

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: flor
 version: !ruby/object:Gem::Version
-  version: 0.16.1
+  version: 0.16.2
 platform: ruby
 authors:
 - John Mettraux
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2019-02-05 00:00:00.000000000 Z
+date: 2019-04-08 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: munemo
@@ -162,6 +162,7 @@ files:
 - lib/flor/migrations/0002_cunit_and_munit.rb
 - lib/flor/migrations/0003_timer_onid_bnid.rb
 - lib/flor/migrations/0004_trap_bnid.rb
+- lib/flor/migrations/0005_pointer_content.rb
 - lib/flor/parser.rb
 - lib/flor/pcore/_apply.rb
 - lib/flor/pcore/_arr.rb
@@ -248,14 +249,18 @@ files:
 - lib/flor/pcore/twig.rb
 - lib/flor/pcore/type_of.rb
 - lib/flor/pcore/until.rb
+- lib/flor/punit/c_collect.rb
+- lib/flor/punit/c_each.rb
+- lib/flor/punit/c_for_each.rb
+- lib/flor/punit/c_iterator.rb
+- lib/flor/punit/c_map.rb
 - lib/flor/punit/cancel.rb
-- lib/flor/punit/ccollect.rb
-- lib/flor/punit/cmap.rb
 - lib/flor/punit/concurrence.rb
 - lib/flor/punit/cron.rb
 - lib/flor/punit/do_trap.rb
 - lib/flor/punit/every.rb
 - lib/flor/punit/graft.rb
+- lib/flor/punit/m_ram.rb
 - lib/flor/punit/on_timeout.rb
 - lib/flor/punit/part.rb
 - lib/flor/punit/schedule.rb
@@ -272,6 +277,7 @@ files:
 - lib/flor/unit/caller.rb
 - lib/flor/unit/executor.rb
 - lib/flor/unit/ganger.rb
+- lib/flor/unit/hloader.rb
 - lib/flor/unit/hook.rb
 - lib/flor/unit/hooker.rb
 - lib/flor/unit/journal.rb

data/lib/flor/punit/cmap.rb

@@ -1,112 +0,0 @@
-
-class Flor::Pro::Cmap < Flor::Procedure
-  #
-  # Concurrent version of "map". Spins a concurrent child for each
-  # element of the incoming/argument collection.
-  #
-  # ```
-  # cmap [ 1 2 3 ]
-  #   def x \ * x 2
-  # # yields: [ 2, 4, 6 ]
-  #
-  # [ 1 2 3 ]
-  # cmap (def x \ * x 2)
-  # # yields: [ 2, 4, 6 ]
-  #
-  # define double x \ * x 2
-  # cmap double [ 1 2 3 ]
-  # # yields: [ 2, 4, 6 ]
-  # ```
-  #
-  # "cmap" is over when all the children have answered. For more complex
-  # concurrent behaviours, look at [concurrence](concurrence.md).
-  #
-  # ## see also
-  #
-  # Map, concurrence.
-
-  name 'cmap'
-
-  def pre_execute
-
-    @node['args'] = []
-    @node['result'] = nil
-
-    unatt_unkeyed_children
-  end
-
-  def receive_non_att
-
-    if @node['result']
-      receive_ret
-    else
-      @node['args'] << payload['ret']
-      super
-    end
-  end
-
-  def receive_last
-
-    if @node['result']
-      super
-    else
-      receive_last_argument
-    end
-  end
-
-  protected
-
-  def receive_last_argument
-
-    col = nil
-    fun = nil
-    @node['args'].each do |a|
-      if Flor.is_func_tree?(a)
-        fun = a
-      elsif Flor.is_collection?(a)
-        col = a
-      end
-    end
-    col ||= node_payload_ret
-
-    fail Flor::FlorError.new("collection not given to #{heap.inspect}", self) \
-      unless Flor.is_collection?(col)
-    return wrap('ret' => col) \
-      unless Flor.is_func_tree?(fun)
-
-    @node['cnt'] = col.size
-    @node['result'] = []
-
-    col
-      .collect
-      .with_index { |e, i|
-        apply(fun, determine_iteration_args(col, i), tree[2]) }
-      .flatten(1)
-  end
-
-  def determine_iteration_args(col, idx)
-
-    args =
-      if col.is_a?(Array)
-        [ [ 'elt', col[idx] ] ]
-      else
-        e = col.to_a[idx]
-        [ [ 'key', e[0] ], [ 'val', e[1] ] ]
-      end
-    args << [ 'idx', idx ]
-    args << [ 'len', col.length ]
-
-    args
-  end
-
-  def receive_ret
-
-    @node['result'] << [ from_sub_nid, payload['ret'] ]
-    @node['cnt'] = @node['cnt'] - 1
-
-    return [] if @node['cnt'] > 0 # still waiting for answers
-
-    wrap('ret' => @node['result'].sort_by(&:first).collect(&:last)) # over
-  end
-end
-