abstractivator 0.8.0 → 0.10.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: f2cea52cc38ca98adfa7d74c52cf4ba4f7092199
-  data.tar.gz: 312ae9d15598a24323ad84d5bf5ce504a15bc4a0
+  metadata.gz: 413e31fbc814244921a102a044f460d5dd92b0f0
+  data.tar.gz: 3e52b17c3bf512aa585312ffecb7bd47696f353f
 SHA512:
-  metadata.gz: 8915f8bc9b77a6e3fba1bed0578b28d4a08e7bf99d7e96eff0698268c6e43dba869ea40a334646e38c670e094fcf42fe403f105f12016287c79c852a256ba984
-  data.tar.gz: 9b040c5a59386fc9ff8b10e484eb9fb0ad71c354378a61afe5a815973f69fe041469d28aebbda95517fd93444b93e98b86760bfae35105b0d9d8ef9cb10b8ddc
+  metadata.gz: 90d0f8db5373e3ca4f99f8523f6669566288189380a6c236a52453a08a7b572bc76b7eb3fa3b2cb8449a1e6a3dec42c050df5aa411026ad7730e5e007f2859f6
+  data.tar.gz: b8f04a86e473dd03ccb10a280dfa93d64359b7e512fb5120e3c41a47e6f033e08aa929fada5e033826c92e4f6ea967fa5ac2672fa69d2b7c9b453182c2c22f57

data/lib/abstractivator/cons.rb

@@ -1,6 +1,7 @@
 module Abstractivator
   module Cons
     Nil = Object.new
+    Nil.define_singleton_method(:empty?) { true }
 
     def empty_list
       Nil
@@ -55,4 +56,4 @@ module Abstractivator
 
     extend self
   end
-end
+end

data/lib/abstractivator/enumerable_ext.rb

@@ -102,4 +102,50 @@ module Enumerable
     end
     sorted.map(&:first)
   end
+
+  def select_map(&block)
+    self.map(&block).select { |x| x }
+  end
+
+  def single
+    if size != 1
+      raise ArgumentError, "expected a single element but was: #{inspect}"
+    end
+    self.first
+  end
+
+  def unique_by(&block)
+    self.group_by(&block).map { |_, vs| vs.first }
+  end
+
+  def duplicates(&block)
+    group_by(&block)
+      .select { |_, vs| vs.size > 1 }
+      .map { |k, _| k }
+  end
+
+  # Folds over a cyclic graph. 'self' is the root node set.
+  # Each node is visited once, in an unspecified order.
+  # Node identity is determined by #object_id
+  # @param init [Object] the initial accumulator
+  # @param get_children_proc [Proc] takes a node and returns its children (or neighbors)
+  # @yieldparam acc [Object] the accumulator
+  # @yieldparam node [Object] the current node
+  # @yieldreturn [Object] the accumulator, after visiting all nodes once
+  def cyclic_fold(init, get_children_proc, &block)
+    xs = self.dup
+    seen = Set.new
+    acc = init
+    while xs.any?
+      x = xs.shift
+      if seen.include?(x.object_id)
+        next
+      else
+        seen.add(x.object_id)
+        acc = block.call(acc, x)
+        xs.concat(get_children_proc.call(x))
+      end
+    end
+    acc
+  end
 end

data/lib/abstractivator/module_ext.rb

@@ -0,0 +1,9 @@
+class Module
+  # useful in the following scenario:
+  #   things.select(&:Array.type?)
+  # instead of:
+  #   things.select { |x| x.is_a?(Array) }
+  def type?
+    proc { |x| x.is_a?(self) }
+  end
+end

data/lib/abstractivator/proc_ext.rb

@@ -97,6 +97,15 @@ class Proc
       x.call(*args, &block)
     end
   end
+
+  def self.loosen_varargs!(args)
+    if args.size == 1 && args.first.is_a?(Array)
+      real_args = args.first
+      args.clear
+      args.concat(real_args)
+      nil
+    end
+  end
 end
 
 class Method

data/lib/abstractivator/sort.rb

@@ -3,7 +3,7 @@ module Abstractivator
     def deep_sort_hash(obj)
       case obj
       when Hash
-        obj.sort.to_h.each_with_object({}) do |(k, v), a|
+        obj.sort.each_with_object({}) do |(k, v), a|
           a[k] = deep_sort_hash(v)
         end
       when Array

data/lib/abstractivator/value_map.rb

@@ -0,0 +1,24 @@
+# like Enumerable#map, except if the receiver is not enumerable,
+# i.e., a single value, then it transforms the single value.
+
+module Enumerable
+  alias_method :value_map, :map
+end
+
+class NilClass
+  def value_map
+    nil
+  end
+end
+
+class Object
+  def value_map
+    yield self
+  end
+end
+
+class Struct
+  def value_map
+    yield self
+  end
+end

data/lib/abstractivator/version.rb

@@ -1,3 +1,3 @@
 module Abstractivator
-  VERSION = '0.8.0'
+  VERSION = '0.10.0'
 end

data/spec/lib/abstractivator/cons_spec.rb

@@ -45,4 +45,11 @@ describe Abstractivator::Cons do
     end
   end
 
-end
+  describe '#empty?' do
+    it 'determines whether or not the list is empty' do
+      expect(enum_to_list([1]).empty?).to be false
+      expect(empty_list.empty?).to be true
+    end
+  end
+
+end

data/spec/lib/abstractivator/enumerable_ext_spec.rb

@@ -161,4 +161,60 @@ describe Enumerable do
       expect(result).to eql({ 'Object' => Object, 'Hash' => Hash, 'Array' => Array })
     end
   end
+
+  describe '#select_map' do
+    it 'maps, then rejects falsey values' do
+      result = [1,2,3].select_map do |x|
+        if x == 2
+          nil
+        else
+          -x
+        end
+      end
+      expect(result).to eql [-1, -3]
+    end
+    it 'invokes the block only once per item' do
+      count = 0
+      [1,2,3].select_map { count += 1 }
+      expect(count).to eql 3
+    end
+  end
+
+  describe '#single' do
+    it 'when there is exactly one value, returns the value' do
+      expect([34].single).to eql 34
+    end
+    it 'otherwise, raises an error' do
+      expect { [].single }.to raise_error ArgumentError
+      expect { [34, 5].single }.to raise_error ArgumentError
+    end
+  end
+
+  describe '#unique_by' do
+    it 'returns the unique set, where identity is established by the transformer block' do
+      expect(['a', 'aa', 'bb', 'b', 'c'].unique_by { |x| x[0] }).to eql ['a', 'bb', 'c']
+    end
+  end
+
+  describe '#duplicates' do
+    it 'returns the set of duplicate identities, where identity is established by the transformer block' do
+      expect(['a', 'aa', 'bb', 'b', 'c'].duplicates { |x| x[0] }).to eql ['a', 'b']
+    end
+  end
+
+  describe '#cyclic_fold' do
+    it 'Folds over a cyclic graph' do
+      a = {}
+      b = {}
+      g = {}
+      a.merge!(g: g)
+      b.merge!(g: g)
+      g.merge!(a: a, b: b)
+
+      result = [g].cyclic_fold([], :values.to_proc) do |acc, x|
+        acc + [x]
+      end
+      expect(result).to eql [g, a, b]
+    end
+  end
 end

data/spec/lib/abstractivator/module_ext_spec.rb

@@ -0,0 +1,14 @@
+require 'rspec'
+require 'abstractivator/module_ext'
+
+describe 'module extensions' do
+  describe '#type' do
+    it 'returns a predicate that evaluates whether a value is_a? <this type>' do
+      p = Enumerable.type?
+      expect(p.call([])).to be true
+      expect(p.call({})).to be true
+      expect(p.call(nil)).to be false
+      expect(p.call(1)).to be false
+    end
+  end
+end

data/spec/lib/abstractivator/proc_ext_spec.rb

@@ -172,6 +172,19 @@ context 'in the world of functional programming' do
       expect(without_kws.proxy_call(1, a: 2, &block)).to eql [1, {a: 2}, nil, block]
     end
   end
+
+  describe 'Proc#loosen_varargs!' do
+    it 'allows varargs functions to receive explicit arrays' do
+      args = [1, 2]
+      expect(foo(*args)).to eql args
+      expect(foo(args)).to eql args
+    end
+
+    def foo(*args)
+      Proc.loosen_varargs!(args)
+      args
+    end
+  end
 end
 
 describe 'UnboundMethod#explicit_receiver' do

data/spec/lib/abstractivator/value_map_spec.rb

@@ -0,0 +1,28 @@
+require 'rspec'
+require 'abstractivator/value_map'
+
+describe '#value_map' do
+
+  Foo = Struct.new(:a)
+
+  it 'maps enumerables' do
+    expect([[:a, 1], [:b, 2]].value_map(&:reverse)).to eql [[1, :a], [2, :b]]
+    expect({a: 1, b: 2}.value_map(&:reverse)).to eql [[1, :a], [2, :b]]
+  end
+
+  it 'maps single values' do
+    expect(3.value_map(&method(:square))).to eql 9
+  end
+
+  it 'structs are treated as single values' do
+    expect(Foo.new(42).value_map { |x| x.a }).to eql 42
+  end
+
+  it 'maps nil' do
+    expect(nil.value_map(&method(:square))).to be nil
+  end
+
+  def square(x)
+    x * x
+  end
+end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: abstractivator
 version: !ruby/object:Gem::Version
-  version: 0.8.0
+  version: 0.10.0
 platform: ruby
 authors:
 - Peter Winton
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2016-11-08 00:00:00.000000000 Z
+date: 2017-02-07 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
@@ -126,6 +126,7 @@ files:
 - lib/abstractivator/event.rb
 - lib/abstractivator/fiber_defer.rb
 - lib/abstractivator/lazy.rb
+- lib/abstractivator/module_ext.rb
 - lib/abstractivator/numbers.rb
 - lib/abstractivator/proc_ext.rb
 - lib/abstractivator/schedule.rb
@@ -137,6 +138,7 @@ files:
 - lib/abstractivator/trees/recursive_delete.rb
 - lib/abstractivator/trees/tree_compare.rb
 - lib/abstractivator/trees/tree_map.rb
+- lib/abstractivator/value_map.rb
 - lib/abstractivator/version.rb
 - lib/enumerable_ext.rb
 - spec/lib/abstractivator/array_ext_spec.rb
@@ -148,6 +150,7 @@ files:
 - spec/lib/abstractivator/event_spec.rb
 - spec/lib/abstractivator/fiber_defer_spec.rb
 - spec/lib/abstractivator/lazy_spec.rb
+- spec/lib/abstractivator/module_ext_spec.rb
 - spec/lib/abstractivator/numbers_spec.rb
 - spec/lib/abstractivator/proc_ext_spec.rb
 - spec/lib/abstractivator/schedule/em_util.rb
@@ -157,6 +160,7 @@ files:
 - spec/lib/abstractivator/trees/recursive_delete_spec.rb
 - spec/lib/abstractivator/trees/tree_compare_spec.rb
 - spec/lib/abstractivator/trees/tree_map_spec.rb
+- spec/lib/abstractivator/value_map_spec.rb
 - spec/lib/enumerable_ext_spec.rb
 - update_version.sh
 homepage: ''
@@ -193,6 +197,7 @@ test_files:
 - spec/lib/abstractivator/event_spec.rb
 - spec/lib/abstractivator/fiber_defer_spec.rb
 - spec/lib/abstractivator/lazy_spec.rb
+- spec/lib/abstractivator/module_ext_spec.rb
 - spec/lib/abstractivator/numbers_spec.rb
 - spec/lib/abstractivator/proc_ext_spec.rb
 - spec/lib/abstractivator/schedule/em_util.rb
@@ -202,5 +207,6 @@ test_files:
 - spec/lib/abstractivator/trees/recursive_delete_spec.rb
 - spec/lib/abstractivator/trees/tree_compare_spec.rb
 - spec/lib/abstractivator/trees/tree_map_spec.rb
+- spec/lib/abstractivator/value_map_spec.rb
 - spec/lib/enumerable_ext_spec.rb
 has_rdoc: