wrapper_based 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: faf4cdd4a94e4efb43510aebec002dbddaf36862
+  data.tar.gz: 99b700d370a49024855173211a64f0927720ed26
+SHA512:
+  metadata.gz: ea3a2475aa844cc8f7d59bff32343d73652a6d3a47aaf6d045e5834a704b25a35a7db9a8f010436a092c3a4688d02fa29e51b769c42dce88945f9b30ff0be8b3
+  data.tar.gz: cda1f749d20f6af2f787a4c3c34d1a53f0cc5e6f225a48282b5736cda892d9b11a1e02498ffe8b0dc367ebce3dcc8f115bf2247ca74b9785d27c565f5c90a2ca

data/.gitignore

@@ -0,0 +1,10 @@
+/.bundle/
+/.yardoc
+/Gemfile.lock
+/_yardoc/
+/coverage/
+/doc/
+/pkg/
+/spec/reports/
+/tmp/
+*.gem

data/.travis.yml

@@ -0,0 +1,5 @@
+sudo: false
+language: ruby
+rvm:
+  - 2.4.0
+before_install: gem install bundler -v 1.15.0

data/Gemfile

@@ -0,0 +1,4 @@
+source "https://rubygems.org"
+
+# Specify your gem's dependencies in wrapper_based.gemspec
+gemspec

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2017 Ritchie Paul Buitre
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.

data/README.md

@@ -0,0 +1,107 @@
+# WrapperBased
+
+Wrapper Based DCI implementation in Ruby.
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'wrapper_based'
+```
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install wrapper_based
+
+## Usage
+
+```ruby
+require_relative 'dijkstra/data'
+# See https://github.com/RichOrElse/wrapper-based/blob/master/test/dijkstra_test.rb
+
+# Behaviors
+
+module Map
+  def distance_between(a, b)
+    @distances[Edge.new(a, b)]
+  end
+
+  def distance_of(path)
+    Distance[within: self].of(path)
+  end
+end
+
+module CurrentIntersection
+  def neighbors(nearest:)
+    east_neighbor = nearest.east_neighbor_of(self)
+    south_neighbor = nearest.south_neighbor_of(self)
+    [south_neighbor, east_neighbor].compact
+  end
+end
+
+module DestinationNode
+  def shortest_path(from:, within:)
+    return [self] if equal? from
+    Shortest[to: self, from: from, city: within].path
+  end
+end
+
+# Contexts
+
+DCI = WrapperBased::DCI.new unless defined? DCI
+
+class Distance < DCI::Context(:within)
+  within.as Map
+
+  def between(a, b)
+    within.distance_between(a, b)
+  end
+
+  def of(path)
+    path.reverse.each_cons(2).inject(0) { |total, pair| total + between(*pair) }
+  end
+end
+
+class Shortest < DCI::Context(:from, :to, :city)
+  from.as CurrentIntersection
+  to.as DestinationNode
+  city.as Map
+
+  def distance
+    city.distance_of path
+  end
+
+  def path
+    _shortest_path + [@from]
+  end
+
+  private
+
+  def _shortest_path
+    from.
+      neighbors(nearest: @city).
+      map { |neighbor| to.shortest_path from: neighbor, within: @city }.
+      min_by { |path| city.distance_of path }
+  end
+end
+```
+[View more examples](https://github.com/RichOrElse/wrapper-based/tree/master/examples)
+
+## Development
+
+After checking out the repo, run `bin/setup` to install dependencies. Then, run `rake test` to run the tests. You can also run `bin/console` for an interactive prompt that will allow you to experiment.
+
+To install this gem onto your local machine, run `bundle exec rake install`. To release a new version, update the version number in `version.rb`, and then run `bundle exec rake release`, which will create a git tag for the version, push git commits and tags, and push the `.gem` file to [rubygems.org](https://rubygems.org).
+
+## Contributing
+
+Bug reports and pull requests are welcome on GitHub at https://github.com/RichOrElse/wrapper-based.
+
+## License
+
+The gem is available as open source under the terms of the [MIT License](http://opensource.org/licenses/MIT).

data/Rakefile

@@ -0,0 +1,10 @@
+require "bundler/gem_tasks"
+require "rake/testtask"
+
+Rake::TestTask.new(:test) do |t|
+  t.libs << "test"
+  t.libs << "lib"
+  t.test_files = FileList["test/**/*_test.rb"]
+end
+
+task :default => :test

data/bin/console

@@ -0,0 +1,14 @@
+#!/usr/bin/env ruby
+
+require "bundler/setup"
+require "wrapper_based"
+
+# You can add fixtures and/or initialization code here to make experimenting
+# with your gem easier. You can also use a different console, if you like.
+
+# (If you use this, don't forget to add pry to your Gemfile!)
+# require "pry"
+# Pry.start
+
+require "irb"
+IRB.start(__FILE__)

data/bin/setup

@@ -0,0 +1,8 @@
+#!/usr/bin/env bash
+set -euo pipefail
+IFS=$'\n\t'
+set -vx
+
+bundle install
+
+# Do any other automated setup that you need to do here

data/examples/dijkstra/data.rb

@@ -0,0 +1,223 @@
+# Source: http://fulloo.info/Examples/RubyExamples/Dijkstra/DijkstraListing.html
+
+def infinity
+  2**(0.size * 8 -2) -1
+end
+
+#
+# Consider street corners on a Manhattan grid. We want to find the
+# minimal path from the most northeast city to the most
+# southeast city. Use Dijstra's algorithm
+#
+
+# Data classes
+
+Edge = Struct.new :from, :to
+
+class Node
+  attr_reader :name
+
+  def initialize(name)
+    @name = name
+  end
+
+  def eql?(another_node)
+    # Nodes are == equal if they have the same name. This is explicitly
+    # defined here to call out the importance of the difference between
+    # object equality and identity
+    name == another_node.name
+  end
+
+  def ==(another_node)
+    # Equality used in the Map algorithms is object identity
+    super
+  end
+end
+
+#
+# --- Geometry is the interface to the data class that has all
+# --- the information about the map. This is kind of silly in Ruby
+#
+
+# In the domain model we have a general model of streets and avenues. The notions of
+# an east and south neighbor are not part of the domain model, but are germane to
+# the Dijkstra problem. Though they evaluate to the same thing we use different
+# names to reflect these two different (mental) models of Manhattan streets.
+class ManhattanGeometry
+  def east_neighbor_of(a) end
+  def south_neighbor_of(a) end
+  def root; end
+  def destination; end
+  def nodes; @nodes end
+end
+
+class ManhattanGeometry1 < ManhattanGeometry
+  def initialize
+    super
+
+    @nodes, @distances = [], {}
+
+    names = %w(a b c d a b g h i)
+
+    3.times do |i|
+      3.times do |j|
+        @nodes << Node.new(names[(i*3)+j])
+      end
+    end
+
+    # Aliases to help set up the grid. Grid is of Manhattan form:
+    #
+    #    a - 2 - b - 3 - c
+    #    |       |       |
+    #    1       2       1
+    #    |       |       |
+    #    d - 1 - e - 1 - f
+    #    |               |
+    #    2               4
+    #    |               |
+    #    g - 1 - h - 2 - i
+    #
+
+    %w(a b c d e f g h i).each_with_index do |name, index|
+      instance_variable_set :"@#{name}", @nodes[index]
+    end
+
+    9.times do |i|
+      9.times do |j|
+        @distances[Edge.new(@nodes[i], @nodes[j])] = infinity
+      end
+    end
+
+    @distances[Edge.new(@a, @b)] = 2
+    @distances[Edge.new(@b, @c)] = 3
+    @distances[Edge.new(@c, @f)] = 1
+    @distances[Edge.new(@f, @i)] = 4
+    @distances[Edge.new(@b, @e)] = 2
+    @distances[Edge.new(@e, @f)] = 1
+    @distances[Edge.new(@a, @d)] = 1
+    @distances[Edge.new(@d, @g)] = 2
+    @distances[Edge.new(@g, @h)] = 1
+    @distances[Edge.new(@h, @i)] = 2
+    @distances[Edge.new(@d, @e)] = 1
+    @distances.freeze
+
+    @next_down_the_street_from = {}
+    @next_down_the_street_from[@a] = @b
+    @next_down_the_street_from[@b] = @c
+    @next_down_the_street_from[@d] = @e
+    @next_down_the_street_from[@e] = @f
+    @next_down_the_street_from[@g] = @h
+    @next_down_the_street_from[@h] = @i
+    @next_down_the_street_from.freeze
+
+    @next_along_the_avenue_from = Hash.new
+    @next_along_the_avenue_from[@a] = @d
+    @next_along_the_avenue_from[@b] = @e
+    @next_along_the_avenue_from[@c] = @f
+    @next_along_the_avenue_from[@d] = @g
+    @next_along_the_avenue_from[@f] = @i
+    @next_along_the_avenue_from.freeze
+  end
+
+  def east_neighbor_of(a)
+    @next_down_the_street_from[a]
+  end
+
+  def south_neighbor_of(a)
+    @next_along_the_avenue_from[a]
+  end
+
+  def root; @a end
+  def destination; @i end
+end
+
+class ManhattanGeometry2 < ManhattanGeometry
+  def initialize
+    super
+
+    @nodes = %w(a b c d a b g h i j k).map { |name| Node.new name }
+
+    # Aliases to help set up the grid. Grid is of Manhattan form:
+    #
+    #    a - 2 - b - 3 - c - 1 - j
+    #    |       |       |       |
+    #    1       2       1       |
+    #    |       |       |       |
+    #    d - 1 - e - 1 - f       1
+    #    |               |       |
+    #    2               4       |
+    #    |               |       |
+    #    g - 1 - h - 2 - i - 2 - k
+
+    @a = @nodes[0]
+    @b = @nodes[1]
+    @c = @nodes[2]
+    @d = @nodes[3]
+    @e = @nodes[4]
+    @f = @nodes[5]
+    @g = @nodes[6]
+    @h = @nodes[7]
+    @i = @nodes[8]
+    @j = @nodes[9]
+    @k = @nodes[10]
+
+    @distances = {}
+    @nodes.each do |i|
+      @nodes.each do |j|
+        @distances[Edge.new(i, j)] = infinity
+      end
+    end
+
+    @distances[Edge.new(@a, @b)] = 2
+    @distances[Edge.new(@b, @c)] = 3
+    @distances[Edge.new(@c, @f)] = 1
+    @distances[Edge.new(@f, @i)] = 4
+    @distances[Edge.new(@b, @e)] = 2
+    @distances[Edge.new(@e, @f)] = 1
+    @distances[Edge.new(@a, @d)] = 1
+    @distances[Edge.new(@d, @g)] = 2
+    @distances[Edge.new(@g, @h)] = 1
+    @distances[Edge.new(@h, @i)] = 2
+    @distances[Edge.new(@d, @e)] = 1
+    @distances[Edge.new(@c, @j)] = 1
+    @distances[Edge.new(@j, @k)] = 1
+    @distances[Edge.new(@i, @k)] = 2
+    @distances.freeze
+
+    @next_down_the_street_from = {}
+    @next_down_the_street_from[@a] = @b
+    @next_down_the_street_from[@b] = @c
+    @next_down_the_street_from[@c] = @j
+    @next_down_the_street_from[@d] = @e
+    @next_down_the_street_from[@e] = @f
+    @next_down_the_street_from[@g] = @h
+    @next_down_the_street_from[@h] = @i
+    @next_down_the_street_from[@i] = @k
+    @next_down_the_street_from.freeze
+
+    @next_along_the_avenue_from = {}
+    @next_along_the_avenue_from[@a] = @d
+    @next_along_the_avenue_from[@b] = @e
+    @next_along_the_avenue_from[@c] = @f
+    @next_along_the_avenue_from[@d] = @g
+    @next_along_the_avenue_from[@f] = @i
+    @next_along_the_avenue_from[@j] = @k
+    @next_along_the_avenue_from.freeze
+  end
+
+  def east_neighbor_of(a)
+    @next_down_the_street_from[a]
+  end
+
+  def south_neighbor_of(a)
+    @next_along_the_avenue_from[a]
+  end
+
+  def root
+    @a
+  end
+
+  def destination
+    @k
+  end
+end

data/examples/dijkstra.rb

@@ -0,0 +1,68 @@
+require_relative 'dijkstra/data'
+# See https://github.com/RichOrElse/wrapper-based/blob/master/test/dijkstra_test.rb
+
+# Behaviors
+
+module Map
+  def distance_between(a, b)
+    @distances[Edge.new(a, b)]
+  end
+
+  def distance_of(path)
+    Distance[within: self].of(path)
+  end
+end
+
+module CurrentIntersection
+  def neighbors(nearest:)
+    east_neighbor = nearest.east_neighbor_of(self)
+    south_neighbor = nearest.south_neighbor_of(self)
+    [south_neighbor, east_neighbor].compact
+  end
+end
+
+module DestinationNode
+  def shortest_path(from:, within:)
+    return [self] if equal? from
+    Shortest[to: self, from: from, city: within].path
+  end
+end
+
+# Contexts
+
+DCI = WrapperBased::DCI.new unless defined? DCI
+
+class Distance < DCI::Context(:within)
+  within.as Map
+
+  def between(a, b)
+    within.distance_between(a, b)
+  end
+
+  def of(path)
+    path.reverse.each_cons(2).inject(0) { |total, pair| total + between(*pair) }
+  end
+end
+
+class Shortest < DCI::Context(:from, :to, :city)
+  from.as CurrentIntersection
+  to.as DestinationNode
+  city.as Map
+
+  def distance
+    city.distance_of path
+  end
+
+  def path
+    _shortest_path + [@from]
+  end
+
+  private
+
+  def _shortest_path
+    from.
+      neighbors(nearest: @city).
+      map { |neighbor| to.shortest_path from: neighbor, within: @city }.
+      min_by { |path| city.distance_of path }
+  end
+end

data/examples/money_transfer.rb

@@ -0,0 +1,38 @@
+Log = method(:puts)
+Account = Struct.new(:number, :balance)
+NotEnoughFund = Class.new(StandardError)
+
+module SourceAccount
+  def decrease_balance_by(amount)
+    raise NotEnoughFund, "Balance is below amount.", caller if balance < amount
+    self.balance -= amount
+  end
+end
+
+module DestinationAccount
+  def increase_balance_by(amount)
+    self.balance += amount
+  end
+end
+
+DCI = WrapperBased::DCI.new unless defined? DCI
+
+class TransferMoney < DCI::Context(:from, :to)
+  from.as SourceAccount
+  to.as DestinationAccount
+
+  def withdraw(amount)
+    from.decrease_balance_by(amount)
+    Log["Withdraw", amount, from]
+  end
+
+  def deposit(amount)
+    to.increase_balance_by(amount)
+    Log["Deposit", amount, to]
+  end
+
+  def call(amount:)
+    withdraw(amount)
+    deposit(amount)
+  end
+end

data/examples/toy_shop.rb

@@ -0,0 +1,53 @@
+require_relative '../lib/wrapper_based'
+
+# Data
+
+Purchase = Struct.new(:toy, :buyer)
+Deliver = Struct.new(:toy, :recipient, :purchase, :status)
+
+# Behaviors
+
+module Buyer
+  def buy(toy)
+    Purchase.new toy, self
+  end
+end
+
+module Recipient
+  def receive(purchased)
+    Deliver.new purchased.toy, self, purchased, :pending
+  end
+end
+
+# Contexts
+DCI = WrapperBased::DCI.new unless defined? DCI
+
+class PurchaseToy < DCI::Context(:purchaser)
+  purchaser.as Buyer
+  purchaser.as Recipient
+
+  def call(toy)
+    purchased = purchaser.buy toy
+    purchaser.receive purchased
+  end
+end
+
+
+class GiftToy < DCI::Context(:gifter, :giftee)
+  gifter.as Buyer
+  giftee.as Recipient
+
+  def call(toy)
+    gift = gifter.buy toy
+    giftee.receive gift
+  end
+end
+
+# Interactions
+
+finn_purchase_toy = PurchaseToy[purchaser: 'Finn']
+finn_purchase_toy.call 'Rusty sword'
+finn_purchase_toy.('Armor of Zeldron')
+finn_purchase_toy['The Enchiridion']
+
+['Card Wars', 'Ice Ninja Manual', 'Bacon'].each &GiftToy[gifter: 'Jake', giftee: 'Finn']

data/lib/wrapper_based/cast.rb

@@ -0,0 +1,27 @@
+require 'set'
+
+module WrapperBased
+  class Cast
+    attr_reader :name, :dci
+
+    def initialize(name, dci)
+      @name = name.to_sym
+      @casting = Set.new
+      @dci = dci
+    end
+
+    def as(extention)
+      @casting << extention
+      self
+    end
+
+    def cast_type(type)
+      @dci.wrapper_for type, *@casting
+    end
+
+    def typecast(actor)
+      return actor if @casting.empty?
+      cast_type(actor.class).new actor
+    end
+  end
+end

data/lib/wrapper_based/context.rb

@@ -0,0 +1,35 @@
+module WrapperBased
+  class Context
+    def initialize(**where)
+      where.each { |role, player| instance_variable_set :"@#{role}", player }
+    end
+
+    class << self
+      def [](**role_cast, &block)
+        context_class = Class.new(self, &block)
+
+        context_class.class_eval do
+          role_cast.each do |role, cast|
+            class_variable_set :"@@#{role}", cast
+            define_method(role) do
+              self.class.class_variable_get(:"@@#{role}").
+                typecast instance_variable_get(:"@#{role}")
+            end
+          end
+        end
+
+        context_class.singleton_class.class_eval do
+          role_cast.each do |role, _|
+            define_method(role) do
+              class_variable_get :"@@#{role}"
+            end
+          end
+
+          alias_method :[], :new
+        end
+
+        context_class
+      end # [] method
+    end # singleton class
+  end # Context class
+end # WrapperBased module

data/lib/wrapper_based/dci.rb

@@ -0,0 +1,19 @@
+module WrapperBased
+  class DCI < Module
+    def initialize(wrapper_for = FORWARDING)
+      @@wrapper_for = Hash.new do |cache, type_casting|
+        cache[type_casting] = wrapper_for[*type_casting]
+      end unless defined? @@wrapper_for
+
+      def wrapper_for(*type_casting)
+        @@wrapper_for[type_casting]
+      end unless defined? self.wrapper_for
+
+      def Context(*roles, &block)
+        dci = self
+        cast = roles.inject({}) { |table, role| table[role.to_sym] = WrapperBased::Cast.new(role, dci); table }
+        WrapperBased::Context[**cast, &block]
+      end unless defined? self.Context
+    end # initialize method
+  end # DCI class
+end # WrapperBased module

data/lib/wrapper_based/decorator.rb

@@ -0,0 +1,13 @@
+require 'delegate'
+
+module WrapperBased
+  class Decorator < Delegator
+    alias_method :initialize, def __setobj__(obj)
+                                @delegate_sd_obj = obj # change delegation object
+                              end
+
+    alias_method :~@,         def __getobj__
+                                @delegate_sd_obj # return object we are delegating to
+                              end
+  end
+end

data/lib/wrapper_based/version.rb

@@ -0,0 +1,3 @@
+module WrapperBased
+  VERSION = "0.1.0"
+end

data/lib/wrapper_based.rb

@@ -0,0 +1,17 @@
+require "wrapper_based/version"
+require "wrapper_based/cast"
+require "wrapper_based/context"
+require "wrapper_based/dci"
+require "wrapper_based/decorator"
+
+module WrapperBased
+  FORWARDING = -> type, *behaviors do
+                Class.new(Decorator) do
+                  using Module.new { refine(type) { prepend(*behaviors.reverse) } }
+
+                  def method_missing(meth, *args, &block)
+                    __getobj__.send(meth, *args, &block)
+                  end
+                end
+              end
+end

data/wrapper_based.gemspec

@@ -0,0 +1,27 @@
+# coding: utf-8
+lib = File.expand_path("../lib", __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require "wrapper_based/version"
+
+Gem::Specification.new do |spec|
+  spec.name          = "wrapper_based"
+  spec.version       = WrapperBased::VERSION
+  spec.authors       = ["Ritchie Paul Buitre"]
+  spec.email         = ["ritchie@richorelse.com"]
+
+  spec.summary       = "Wrapper Based DCI implementation in Ruby."
+  spec.homepage      = "https://github.com/RichOrElse/wrapper-based/"
+  spec.license       = "MIT"
+
+  spec.files         = `git ls-files -z`.split("\x0").reject do |f|
+    f.match(%r{^(test|spec|features)/})
+  end
+  spec.bindir        = "exe"
+  spec.executables   = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
+  spec.require_paths = ["lib"]
+  spec.required_ruby_version = ">= 2.4.0"
+
+  spec.add_development_dependency "bundler", "~> 1.15"
+  spec.add_development_dependency "rake", "~> 10.0"
+  spec.add_development_dependency "minitest", "~> 5.0"
+end

metadata

@@ -0,0 +1,105 @@
+--- !ruby/object:Gem::Specification
+name: wrapper_based
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- Ritchie Paul Buitre
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2017-06-16 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.15'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.15'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+- !ruby/object:Gem::Dependency
+  name: minitest
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '5.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '5.0'
+description: 
+email:
+- ritchie@richorelse.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- ".travis.yml"
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- bin/console
+- bin/setup
+- examples/dijkstra.rb
+- examples/dijkstra/data.rb
+- examples/money_transfer.rb
+- examples/toy_shop.rb
+- lib/wrapper_based.rb
+- lib/wrapper_based/cast.rb
+- lib/wrapper_based/context.rb
+- lib/wrapper_based/dci.rb
+- lib/wrapper_based/decorator.rb
+- lib/wrapper_based/version.rb
+- wrapper_based.gemspec
+homepage: https://github.com/RichOrElse/wrapper-based/
+licenses:
+- MIT
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: 2.4.0
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.6.8
+signing_key: 
+specification_version: 4
+summary: Wrapper Based DCI implementation in Ruby.
+test_files: []