strongman 1.0.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: 329a7cf887ef3a484d31e6c1f943d86857d045cf33daa6862e8c4720366d2273
+  data.tar.gz: 1f4f60aebb814692098f07d5f1b20d520ebd7d6ad897dfec1b541f60b6f4efbc
+SHA512:
+  metadata.gz: 1ca56b74b4bec3f25cfcbd51b5aea8d7eb75725d03ee51adb3e43dd00c01925eeb219b4071c204a61fc7ecad08882410bc466fc80a26bc8de90d70445f8993f2
+  data.tar.gz: 2a986b767a76db4e1a5a087a0e05d9d9f8b632de1c6fd0288e622d2ebd25d926aa897d55ac510e45bf918649e9214611a38cbe895641eea270b1d5dcfcc49372

data/LICENSE

@@ -0,0 +1,23 @@
+Copyright (c) 2017-2019, Adam Stankiewicz
+Copyright (c) 2019-present, Caleb Land
+
+MIT License
+
+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,243 @@
+# ![](http://i.imgur.com/ZdJKtj1.png) Strongman
+
+[![Build Status](https://travis-ci.org/sheerun/dataloader.svg?branch=master)](https://travis-ci.org/sheerun/dataloader) [![codecov](https://codecov.io/gh/sheerun/dataloader/branch/master/graph/badge.svg)](https://codecov.io/gh/sheerun/dataloader)
+
+Strongman is a generic utility based on [Dataloader](https://github.com/sheerun/dataloader), to be used as part of your application's data fetching layer to provide a simplified and consistent API to perform batching and caching within a request. It is heavily inspired by [Facebook's dataloader](https://github.com/facebook/dataloader).
+
+## Getting started
+
+First, install Strongman using bundler:
+
+```ruby
+gem "strongman"
+```
+
+To get started, instantiate `Strongman`. Each `Strongman` instance represents a unique cache. Typically instances are created per request when used within a web-server. To see how to use with GraphQL server, see section below.
+
+Strongman is dependent on [concurrent-ruby](https://github.com/ruby-concurrency/concurrent-ruby) which you can use freely for batch-ready code (e.g. loader can return a `Future` that returns a `Future` that returns a `Future`). Strongman will try to batch most of them.
+
+## Basic usage
+
+```ruby
+# It will be called only once with ids = [0, 1, 2]
+loader = Strongman.new do |ids|
+  User.find(*ids)
+end
+
+# Schedule data to load
+promise_one = loader.load(0)
+promise_two = loader.load_many([1, 2])
+
+# Get promises results
+user0 = promise_one.value!
+user1, user2 = promise_two.value!
+```
+
+## Using with GraphQL
+
+You can pass loaders passed inside [`context`](https://rmosolgo.github.io/graphql-ruby/queries/executing_queries).
+
+```ruby
+UserType = GraphQL::ObjectType.define do
+  field :name, types.String
+end
+
+QueryType = GraphQL::ObjectType.define do
+  name "Query"
+  description "The query root of this schema"
+
+  field :user do
+    type UserType
+    argument :id, !types.ID
+    resolve ->(obj, args, ctx) {
+      ctx[:user_loader].load(args["id"])
+    }
+  end
+end
+
+Schema = GraphQL::Schema.define do
+  lazy_resolve(Concurrent::Promises::Future, :'value!')
+
+  query QueryType
+end
+
+context = {
+  user_loader: Strongman.new do |ids|
+    User.find(*ids)
+  end
+}
+
+Schema.execute("{ user(id: 12) { name } }", context: context)
+```
+
+## Batching
+
+You can create loaders by providing a batch loading function.
+
+```ruby
+user_loader = Strongman.new { |ids| User.find(*ids) }
+```
+
+A batch loading block accepts an Array of keys, and returns a Promise which resolves to an Array or Hash of values.
+
+`Strongman` will coalesce all individual loads which occur until first `#value!` (or `#value`, `#wait`, `#touch` or other `Concurrent::Promises::Future` method that blocks waiting for a result) is called on any promise returned by `#load` or `#load_many`, and then call your batch function with all requested keys.
+
+```ruby
+user_loader.load(1)
+  .then { |user| user_loader.load(user.invited_by_id) }
+  .then { |invited_by| "User 1 was invited by ${invited_by[:name]}" }
+
+# Elsewhere in your backend
+user_loader.load(2)
+  .then { |user| user_loader.load(user.invited_by_id) }
+  .then { |invited_by| "User 2 was invited by ${invited_by[:name]}" }
+```
+
+A naive solution is to issue four SQL queries to get required information, but with `Strongman` this application will make at most two queries (one to load users, and second one to load invites).
+
+`Strongman` allows you to decouple unrelated parts of your application without sacrificing the performance of batch data-loading. While the loader presents an API that loads individual values, all concurrent requests will be coalesced and presented to your batch loading function. This allows your application to safely distribute data fetching requirements throughout your application and maintain minimal outgoing data requests.
+
+### Batch function
+
+A batch loading function accepts an Array of keys, and returns Array of values or Hash that maps from keys to values (or a [Concurrent::Promises::Future](https://github.com/ruby-concurrency/concurrent-ruby) that returns such Array or Hash). There are a few constraints that must be upheld:
+
+* The Array of values must be the same length as the Array of keys.
+* Each index in the Array of values must correspond to the same index in the Array of keys.
+* If Hash is returned, it must include all keys passed to batch loading function
+
+For example, if your batch function was provided the Array of keys: `[ 2, 9, 6 ]`, you could return one of following:
+
+```ruby
+[
+  { id: 2, name: "foo" },
+  { id: 9, name: "bar" },
+  { id: 6, name: "baz" }
+]
+```
+
+```ruby
+{
+  2 => { id: 2, name: "foo" },
+  9 => { id: 9, name: "bar" },
+  6 => { id: 6, name: "baz" }
+}
+```
+
+## Caching
+
+`Strongman` provides a memoization cache for all loads which occur withing single instance of it. After `#load` is called once with a given key, the resulting Promise is cached to eliminate redundant loads.
+
+In addition to relieving pressure on your data storage, caching results per-request also creates fewer objects which may relieve memory pressure on your application:
+
+```
+promise1 = user_loader.load(1)
+promise2 = user_loader.load(1)
+promise1 == promise2 # => true
+```
+
+### Caching per-request
+
+`Strongman` caching does not replace Redis, Memcache, or any other shared application-level cache. `Strongman` is first and foremost a data loading mechanism, and its cache only serves the purpose of not repeatedly loading the same data in the context of a single request to your Application. To do this, it maintains a simple in-memory memoization cache (more accurately: `#load` is a memoized function).
+
+Avoid multiple requests from different users using the same `Strongman` instance, which could result in cached data incorrectly appearing in each request. Typically, `Strongman` instances are created when a request begins, and are not used once the request ends.
+
+See [Using with GraphQL](https://github.com/sheerun/dataloader#using-with-graphql) section to see how you can pass dataloader instances using context.
+
+### Caching errors
+
+If a batch load fails (that is, a batch function throws or returns a rejected Promise), then the requested values will not be cached. However if a batch function returns an Error instance for an individual value, that Error will be cached to avoid frequently loading the same Error.
+
+In some circumstances you may wish to clear the cache for these individual Errors:
+
+```ruby
+user_loader.load(1).rescue do |error|
+  user_loader.cache.delete(1)
+  raise error
+end
+```
+
+### Disabling cache
+
+In certain uncommon cases, a `Strongman` which does not cache may be desirable. Calling `Strongman.new({ cache: nil }) { ... }` will ensure that every call to `#load` will produce a new Promise, and requested keys will not be saved in memory.
+
+However, when the memoization cache is disabled, your batch function will receive an array of keys which may contain duplicates! Each key will be associated with each call to `#load`. Your batch loader should provide a value for each instance of the requested key.
+
+```ruby
+loader = Strongman.new(cache: nil) do |keys|
+  puts keys
+  some_loading_function(keys)
+end
+
+loader.load('A')
+loader.load('B')
+loader.load('A')
+
+// > [ 'A', 'B', 'A' ]
+```
+
+## API
+
+### `Strongman`
+
+`Strongman` is a class for fetching data given unique keys such as the id column (or any other key).
+
+Each `Strongman` instance contains a unique memoized cache. Because of it, it is recommended to use one `Strongman` instance **per web request**. You can use more long-lived instances, but then you need to take care of manually cleaning the cache.
+
+You shouldn't share the same dataloader instance across different threads. This behavior is currently undefined.
+
+### `Strongman.new(**options = {}, &batch_load)`
+
+Create a new `Strongman` given a batch loading function and options.
+
+* `batch_load`: A block which accepts an Array of keys, and returns Array of values or Hash that maps from keys to values (or a [Promise](https://github.com/lgierth/promise.rb) that returns such value).
+* `options`: An optional hash of options:
+  * `:key` **(not implemented yet)** A function to produce a cache key for a given load key. Defaults to function { |key| key }. Useful to provide when objects are keys and two similarly shaped objects should be considered equivalent.
+  * `:cache` An instance of cache used for caching of promies. Defaults to `Concurrent::Map.new`.
+    - The only required API is `#compute_if_absent(key)`).
+    - You can pass `nil` if you want to disable the cache.
+    - You can pass pre-populated cache as well. The values can be Promises.
+  * `:max_batch_size` Limits the number of items that get passed in to the batchLoadFn. Defaults to `INFINITY`. You can pass `1` to disable batching.
+
+### `#load(key)`
+
+**key** [Object] a key to load using `batch_load`
+
+Returns a [Future](https://github.com/ruby-concurrency/concurrent-ruby) of computed value.
+
+You can resolve this promise when you actually need the value with `promise.value!`.
+
+All calls to `#load` are batched until the first `#value!` is encountered. Then is starts batching again, et cetera.
+
+### `#load_many(keys)`
+
+**keys** [Array<Object>] list of keys to load using `batch_load`
+
+Returns a [Future](https://github.com/ruby-concurrency/concurrent-ruby) of array of computed values.
+
+To give an example, to multiple keys:
+
+```ruby
+promise = loader.load_many(['a', 'b'])
+object_a, object_b = promise.value!
+```
+
+This is equivalent to the more verbose:
+
+```ruby
+promise = Concurrent::Promises.zip_futures(loader.load('a'), loader.load('b')).then {|*results| results}
+object_a, object_b = promise.value!
+```
+
+### `#cache`
+
+Returns the internal cache that can be overridden with `:cache` option (see constructor)
+
+This field is writable, so you can reset the cache with something like:
+
+```ruby
+loader.cache = Concurrent::Map.new
+```
+
+## License
+
+MIT

data/lib/strongman.rb

@@ -0,0 +1,274 @@
+require 'concurrent'
+
+class Strongman
+  class NoCache
+    def compute_if_absent(_key)
+      yield
+    end
+  end
+
+  class Batch
+    attr_accessor :parent
+    attr_accessor :name
+    attr_accessor :lock
+    attr_accessor :fulfilled
+    attr_accessor :fulfilling
+
+    def initialize(loader_block, name: nil, parent: nil, max_batch_size: Float::INFINITY)
+      @name = name
+      @queue = Concurrent::Array.new
+      @promise = Concurrent::Promises.resolvable_future
+      @loader_block = loader_block
+      @lock = Concurrent::ReadWriteLock.new
+      @parent = parent
+      @children = Concurrent::Array.new
+      @fulfilling = Concurrent::AtomicBoolean.new(false)
+      @fulfilled = Concurrent::AtomicBoolean.new(false)
+      @max_batch_size = max_batch_size
+
+      @parent.children << self if @parent
+
+      @root = nil
+      @batch_chain = nil
+    end
+
+    def fulfilled?
+      root.fulfilled.true?
+    end
+
+    def fulfilling?
+      root.fulfilling.true?
+    end
+
+    def needs_fulfilling?
+      !fulfilled? && !fulfilling?
+    end
+
+    def queue(key)
+      @queue << key
+
+      future = @promise.then do |results|
+        unless results.key?(key)
+          raise StandardError, "Batch loader didn't resolve a key: #{key}. Resolved keys: #{results.keys}"
+        end
+
+        result = results[key]
+
+        if result.is_a?(Concurrent::Promises::Future)
+          result
+        else
+          Concurrent::Promises.resolvable_future.fulfill(result)
+        end
+      end.flat
+
+      #
+      # If our queue is full, fulfill immediately and return the bare future
+      #
+      if @queue.size >= @max_batch_size
+        root.fulfill_hierarchy
+
+        future
+      else
+        #
+        # If the queue is not full, create a delayed future that fulfills when the value is requested and chains
+        # to the inner future
+        #
+        Concurrent::Promises.delay do
+          # with_lock do
+          root.fulfill_hierarchy if root.needs_fulfilling?
+          # end
+
+          future
+        end.flat
+      end
+    end
+
+    def mark_fulfilled!
+      root.fulfilled.make_true
+      self
+    end
+
+    def mark_fulfilling!
+      root.fulfilling.make_true
+      self
+    end
+
+    def mark_not_fulfilling!
+      root.fulfilling.make_false
+      self
+    end
+
+    def with_lock
+      root.lock.with_write_lock do
+        yield
+      end
+    end
+
+    def root
+      if @root
+        @root
+      else
+        find_top = -> (batch) {
+          if batch.parent
+            find_top.(batch.parent)
+          else
+            batch
+          end
+        }
+
+        @root = find_top.(self)
+      end
+    end
+
+    def batch_chain
+      if @batch_chain
+        @batch_chain
+      else
+        @batch_chain = Concurrent::Array.new
+
+        add_children = -> (batch) {
+          @batch_chain << batch
+          if batch.children.size > 0
+            batch.children.flat_map(&add_children)
+          end
+        }
+        add_children.(root)
+
+        @batch_chain
+      end
+    end
+
+    def fulfill_hierarchy
+      raise Error.new("Only run #fulfill_hierarchy on root batches") if @parent
+
+      with_lock do
+        return if fulfilled?
+
+        mark_fulfilling!
+        batch_chain.reverse.each(&:fulfill!)
+      ensure
+        mark_fulfilled!
+        mark_not_fulfilling!
+      end
+    end
+
+    def fulfill!
+      results = @loader_block.call(@queue)
+
+      if results.is_a?(Concurrent::Promises::Future)
+        # if the strongman loader block returns a promise (e.g. if the block uses another loader),
+        # make sure to touch it to kick off any delayed effects before chaining
+        results.touch.then do |inner_results|
+          @promise.fulfill(normalize_results(inner_results))
+        end.flat
+      else
+        @promise.fulfill(normalize_results(results))
+      end
+
+      self
+    end
+
+    def children
+      @children ||= Concurrent::Array.new
+    end
+
+    private
+
+    def normalize_results(results)
+      unless results.is_a?(Array) || results.is_a?(Hash)
+        raise TypeError, "Batch loader must return an Array or Hash, but returned: #{results.class.name}"
+      end
+
+      if @queue.size != results.size
+        raise StandardError, "Batch loader must be instantiated with function that returns Array or Hash " \
+          "of the same size as provided to it Array of keys" \
+          "\n\nProvided keys:\n#{@queue}" \
+          "\n\nReturned values:\n#{results}"
+      end
+
+      if results.is_a?(Array)
+        Hash[@queue.zip(results)]
+      else
+        results.is_a?(Hash)
+        results
+      end
+    end
+  end
+
+  attr_accessor :cache
+
+  def initialize(**options, &block)
+    unless block_given?
+      raise TypeError, "Dataloader must be constructed with a block which accepts " \
+        "Array and returns either Array or Hash of the same size (or Promise)"
+    end
+
+    @name = options.delete(:name)
+    @parent = options.delete(:parent)
+    @cache = if options.has_key?(:cache)
+               options.delete(:cache) || NoCache.new
+             else
+               Concurrent::Map.new
+             end
+    @max_batch_size = options.fetch(:max_batch_size, Float::INFINITY)
+
+    @interceptor = options.delete(:interceptor) || -> (n) {
+      -> (ids) {
+        n.call(ids)
+      }
+    }
+
+    if @parent
+      @interceptor = @interceptor.call(-> (n) {
+        -> (ids) {
+          n.call(@parent, ids)
+        }
+      })
+    end
+
+    @loader_block = @interceptor.call(block)
+  end
+
+  def depends_on(**options, &block)
+    Strongman.new(**options, parent: self, &block)
+  end
+
+  def load(key)
+    if key.nil?
+      raise TypeError, "#load must be called with a key, but got: nil"
+    end
+
+    result = retrieve_from_cache(key) do
+      batch.queue(key)
+    end
+
+    if result.is_a?(Concurrent::Promises::Future)
+      result
+    else
+      Concurrent::Promises.future {result}
+    end
+  end
+
+  def load_many(keys)
+    unless keys.is_a?(Array)
+      raise TypeError, "#load_many must be called with an Array, but got: #{keys.class.name}"
+    end
+
+    promises = keys.map(&method(:load))
+    Concurrent::Promises.zip_futures(*promises).then {|*results| results}
+  end
+
+  def batch
+    if @batch.nil? || @batch.fulfilled?
+      @batch = Batch.new(@loader_block, name: @name, parent: @parent&.batch, max_batch_size: @max_batch_size)
+    else
+      @batch
+    end
+  end
+
+  def retrieve_from_cache(key)
+    @cache.compute_if_absent(key) do
+      yield
+    end
+  end
+end

data/lib/strongman/version.rb

@@ -0,0 +1,4 @@
+class Strongman
+  # @!visibility private
+  VERSION = "1.0.0".freeze
+end

metadata

@@ -0,0 +1,62 @@
+--- !ruby/object:Gem::Specification
+name: strongman
+version: !ruby/object:Gem::Version
+  version: 1.0.0
+platform: ruby
+authors:
+- Caleb Land
+autorequire:
+bindir: bin
+cert_chain: []
+date: 2020-07-19 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: concurrent-ruby
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.1'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.1'
+description: A data loading utility to batch loading of promises. It can be used with
+  graphql gem.
+email:
+- caleb@land.fm
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- LICENSE
+- README.md
+- lib/strongman.rb
+- lib/strongman/version.rb
+homepage: https://github.com/caleb/strongman
+licenses:
+- MIT
+metadata: {}
+post_install_message:
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubygems_version: 3.1.2
+signing_key:
+specification_version: 4
+summary: Batch data loading, works great with graphql
+test_files: []