resque-roulette 0.0.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: 05cc1d80c24b00965ae14a24f8b78e73ea9008e6826026405be6cd163818b537
+  data.tar.gz: 81caf598215dedef4040e3a2defe01c43b4a90dd905c75bbad90a46cc8c1a50d
+SHA512:
+  metadata.gz: '0319ef58c6365f05fe8658e3879bb31d56140ee96b8ef259a7f29b9068623b8781bf2f134c52a5a519042e1958fd9d14f118b653e1dcea706795d655037fc339'
+  data.tar.gz: 3398fb601d49ec79ae2e34dd5eff07d5c7c4b9d5cbbce5e9ef7f5692746b5e8198ca9a725715cad5ca2e6b0a4ad0e934f502e333ce86fcb2fec41b64b4fc2312

data/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2019 RA Trustvox
+
+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,35 @@
+resque-roulette
+===============
+
+### Why?
+
+I've many resque workers created in the same way using splat operator to run for every queue (QUEUE=*), but to don't wait a given queue process all your jobs, 
+I've been looking for a plugin to make that shuffle to me, and then I've found this magic plugin [resque-unfairly](https://github.com/seomoz/resque-unfairly) 
+but this is a old project and it's not in published at rubygems, so I've forked the repo and make some changes to could be published and used from rubygems instead of git directly.
+
+Thanks for the awesome job Evan! :beers: 
+
+Usually Resque workers work on queues in the given order (if there is something in the first, work it, otherwise if the there is something in the second, work on it, and
+so on). This plugin randomizes the order of the queues based on weights, so that a given queue will be the first queue to try based on a probability weight. Given queues A, B, C, D and
+weights 4, 3, 2, 1, repsectively, A will be first 40% of the time, B 30%, C 20%, and D 10%. In addition, when B is first, A will be second 4/7ths of the time (4 / [4+2+1]), and so on. The
+project is inspired by [resque-fairly](https://github.com/pezra/resque-fairly) by Peter Williams, which unfortunately mathematically does not give you this control over the weights.
+
+### Example usage
+
+``` ruby
+require 'resque'
+require 'resque/plugins/roulette'
+
+Resque::Plugins::Roulette.prioritize('myqueue' 1)
+Resque::Plugins::Roulette.prioritize('myotherqueue', 3)
+Resque::Plugins::Roulette.prioritize('someotherqueue', 6)
+```
+
+Now, workers processing all three queues will (assuming all queues have jobs) take jobs from someotherqueue 60% of the time, myotherqueue 30% of the time, and myqueue 10% of the time. This is achieved
+by reordering the queues, so if someotherqueue is empty, the workers will take jobs from myotherqueue 75% (3/4) of the time.
+
+
+### Authors
+
+- **Mantainer** - Bruno Casali @brunoocasali
+- **Creator**   - Evan Battaglia @evanbattaglia

data/lib/resque-roulette.rb

@@ -0,0 +1,2 @@
+require 'resque'
+require File.expand_path('resque/plugins/roulette', File.dirname(__FILE__))

data/lib/resque/plugins/roulette.rb

@@ -0,0 +1,67 @@
+require 'resque/worker'
+
+module Resque::Plugins
+  module Roulette
+    # Define an 'unfair' priority multiplier to queues
+    def self.prioritize(queue, value)
+      priorities[queue] = value
+    end
+
+    def self.priorities
+      @priorities ||= {}
+    end
+
+    # Returns a list of queues to use when searching for a job. A
+    # splat ("*") means you want every queue
+    #
+    # The queues will be ordered randomly and the order will change
+    # with every call. This prevents any particular queue for being
+    # starved. Workers will process queues in a random order each
+    # time the poll for new work.
+    #
+    # If priorities have been established, the randomness of the order
+    # will be weighted according to the multipliers
+    def queues_randomly_ordered
+      queue_priorities = queues_orig_ordered.map { |q| Roulette.priorities[q] }
+      if queue_priorities.compact.any?
+        weighted_order(queues_orig_ordered, queue_priorities.map { |p| p || 1 })
+      else
+        queues_orig_ordered
+      end
+    end
+
+    def self.included(klass)
+      klass.instance_eval do
+        alias queues_orig_ordered queues
+        alias queues queues_randomly_ordered
+      end
+    end
+
+    private
+
+    # Give the index of an item in weights based on the weights
+    def weighted_rand_index(weights)
+      rand_val = rand * weights.inject(&:+)
+      weights.each_with_index do |weight, index|
+        return index if (rand_val -= weight).negative?
+      end
+      0
+    end
+
+    def weighted_order(vals, weights)
+      vals = vals.dup
+      weights = weights.dup
+
+      [].tap do |results|
+        until vals.empty?
+          val_index = weighted_rand_index(weights)
+          results << vals[val_index]
+          vals.delete_at val_index
+          weights.delete_at val_index
+        end
+      end
+    end
+  end
+
+  Resque::Worker.send(:include, Roulette)
+end

data/lib/resque/plugins/roulette/version.rb

@@ -0,0 +1,8 @@
+module Resque
+  module Plugins
+    module Roulette
+      VERSION = '0.0.1'
+    end
+  end
+end
+

metadata

@@ -0,0 +1,99 @@
+--- !ruby/object:Gem::Specification
+name: resque-roulette
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+platform: ruby
+authors:
+- Evan Battaglia
+- Bruno Casali
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2019-01-25 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: resque
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.0'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '12.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '12.0'
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '3.8'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '3.8'
+description: Usually Resque workers work on queues in the given order (if there is
+  something in the first, work it, otherwise if the there is something in the second,
+  work on it, and so on). This plugin randomizes the order of the queues based on
+  weights, so that a given queue will be the first queue to try based on a probability
+  weight. Given queues A, B, C, D and weights 4, 3, 2, 1, repsectively, A will be
+  first 40% of the time, B 30%, C 20%, and D 10%. In addition, when B is first, A
+  will be second 4/7ths of the time (4 / [4+2+1]), and so on. The project is inspired
+  by resque-fairly, which unfortunately mathematically does not give you this control
+  over the weights.
+email:
+- evan@seomoz.org
+- bruno@trustvox.com.br
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- LICENSE
+- README.md
+- lib/resque-roulette.rb
+- lib/resque/plugins/roulette.rb
+- lib/resque/plugins/roulette/version.rb
+homepage: https://github.com/trustvox/resque-roulette
+licenses: []
+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.0.1
+signing_key: 
+specification_version: 4
+summary: Order Resque queues probabilistically given a list of weights
+test_files: []