resque-queue-priority 0.5.0
Sign up to get free protection for your applications and to get access to all the features.
- data/.gitignore +9 -0
- data/CHANGELOG +4 -0
- data/Gemfile +4 -0
- data/README.md +41 -0
- data/Rakefile +67 -0
- data/config.ru +9 -0
- data/lib/resque-queue-priority-server.rb +4 -0
- data/lib/resque-queue-priority.rb +8 -0
- data/lib/resque/plugins/queue_priority/attributes.rb +28 -0
- data/lib/resque/plugins/queue_priority/priority.rb +56 -0
- data/lib/resque/plugins/queue_priority/server.rb +37 -0
- data/lib/resque/plugins/queue_priority/server/views/priorities.erb +65 -0
- data/lib/resque/plugins/queue_priority/version.rb +7 -0
- data/resque-queue-priority.gemspec +29 -0
- data/spec/priority_spec.rb +167 -0
- data/spec/redis-test.conf +312 -0
- data/spec/server_spec.rb +118 -0
- data/spec/spec_helper.rb +20 -0
- metadata +114 -0
data/.gitignore
ADDED
data/CHANGELOG
ADDED
data/Gemfile
ADDED
data/README.md
ADDED
@@ -0,0 +1,41 @@
|
|
1
|
+
A resque plugin for specifying the order a worker will prioritize queues in.
|
2
|
+
|
3
|
+
Authored against Resque 1.17.1, so it at least works with that - try running the tests if you use a different version of resque
|
4
|
+
|
5
|
+
Usage:
|
6
|
+
|
7
|
+
Start your workers with a QUEUE that contains many queue names - this plugin is most useful when using '\*' or a plugin like resque-dynamic-queues.
|
8
|
+
|
9
|
+
The queue priority web ui is shown as a tab in the resque-web UI, and allows you to define the queue priorities. To activate it, you need to require 'resque-queue-priority-server' in whatever initializer you use to bring up resque-web.
|
10
|
+
|
11
|
+
Then you should set use the web ui to determine the order a worker will pick a queue for processing. The "Fairly" checkbox makes all queues that match that pattern get ordered in a random fashion (i.e. provides the same functionality as resque-fairly).
|
12
|
+
|
13
|
+
For example, say my resque system has the queues:
|
14
|
+
|
15
|
+
low_foo, low_bar, low_baz, high_foo, high_bar, high_baz, otherqueue, somequeue, myqueue
|
16
|
+
|
17
|
+
And I run my worker with QUEUE=\* (Note Resque wildcarding sorts queues)
|
18
|
+
|
19
|
+
If I set my patterns like:
|
20
|
+
|
21
|
+
high\_\* (fairly unchecked)
|
22
|
+
default (fairly unchecked)
|
23
|
+
low\_\* (fairly unchecked)
|
24
|
+
|
25
|
+
Then, the worker will scan the queues for work in this order:
|
26
|
+
high_bar, high_baz, high_foo, myqueue, otherqueue, somequeue, low_bar, low_baz, low_foo
|
27
|
+
|
28
|
+
If I set my patterns like:
|
29
|
+
|
30
|
+
high\_\* (fairly checked)
|
31
|
+
default (fairly checked)
|
32
|
+
low\_\* (fairly checked)
|
33
|
+
|
34
|
+
Then, the worker will scan the queues for work in this order:
|
35
|
+
|
36
|
+
\*[high_bar, high_baz, high_foo].shuffle, \*[myqueue, otherqueue, somequeue].shuffle, \*[low_bar, low_baz, low_foo].shuffle
|
37
|
+
|
38
|
+
|
39
|
+
Contributors:
|
40
|
+
|
41
|
+
Matt Conway ( https://github.com/wr0ngway )
|
data/Rakefile
ADDED
@@ -0,0 +1,67 @@
|
|
1
|
+
require 'bundler'
|
2
|
+
Bundler::GemHelper.install_tasks
|
3
|
+
|
4
|
+
task :my_release => ['changelog', 'release'] do
|
5
|
+
end
|
6
|
+
|
7
|
+
task :changelog do
|
8
|
+
|
9
|
+
helper = Bundler::GemHelper.new(Dir.pwd)
|
10
|
+
version = "v#{helper.gemspec.version}"
|
11
|
+
|
12
|
+
changelog_file = 'CHANGELOG'
|
13
|
+
entries = ""
|
14
|
+
|
15
|
+
# Get a list of current tags
|
16
|
+
tags = `git tag -l`.split
|
17
|
+
tags = tags.sort_by {|t| t[1..-1].split(".").collect {|s| s.to_i } }
|
18
|
+
newest_tag = tags[-1]
|
19
|
+
|
20
|
+
if version == newest_tag
|
21
|
+
puts "You need to update version, same as most recent tag: #{version}"
|
22
|
+
exit
|
23
|
+
end
|
24
|
+
|
25
|
+
# If we already have a changelog, make the last tag be the
|
26
|
+
# last one in the changelog, and the next one be the one
|
27
|
+
# following that in the tag list
|
28
|
+
newest_changelog_version = nil
|
29
|
+
if File.exist?(changelog_file)
|
30
|
+
entries = File.read(changelog_file)
|
31
|
+
head = entries.split.first
|
32
|
+
if head =~ /\d\.\d\.\d/
|
33
|
+
newest_changelog_version = "v#{head}"
|
34
|
+
|
35
|
+
if version == newest_changelog_version
|
36
|
+
puts "You need to update version, same as most recent changelog: #{version}"
|
37
|
+
exit
|
38
|
+
end
|
39
|
+
|
40
|
+
end
|
41
|
+
end
|
42
|
+
|
43
|
+
# Generate changelog from repo
|
44
|
+
log=`git log --pretty='format:%s <%h> [%cn]' #{newest_tag}..HEAD`
|
45
|
+
|
46
|
+
# Strip out maintenance entries
|
47
|
+
log = log.lines.to_a.delete_if do |l|
|
48
|
+
l =~ /^Regenerated? gemspec/ ||
|
49
|
+
l =~ /^version bump/i ||
|
50
|
+
l =~ /^Updated changelog/ ||
|
51
|
+
l =~ /^Merged? branch/
|
52
|
+
end
|
53
|
+
|
54
|
+
# Write out changelog file
|
55
|
+
File.open(changelog_file, 'w') do |out|
|
56
|
+
out.puts version.gsub(/^v/, '')
|
57
|
+
out.puts "-----"
|
58
|
+
out.puts "\n"
|
59
|
+
out.puts log
|
60
|
+
out.puts "\n"
|
61
|
+
out.puts entries
|
62
|
+
end
|
63
|
+
|
64
|
+
# Commit and push
|
65
|
+
sh "git ci -m'Updated changelog' #{changelog_file}"
|
66
|
+
sh "git push"
|
67
|
+
end
|
data/config.ru
ADDED
@@ -0,0 +1,8 @@
|
|
1
|
+
require 'resque'
|
2
|
+
require 'resque/worker'
|
3
|
+
require 'resque/plugins/queue_priority/version'
|
4
|
+
require 'resque/plugins/queue_priority/attributes'
|
5
|
+
require 'resque/plugins/queue_priority/priority'
|
6
|
+
|
7
|
+
Resque.send(:extend, Resque::Plugins::QueuePriority::Attributes)
|
8
|
+
Resque::Worker.send(:include, Resque::Plugins::QueuePriority::Priority)
|
@@ -0,0 +1,28 @@
|
|
1
|
+
module Resque
|
2
|
+
module Plugins
|
3
|
+
module QueuePriority
|
4
|
+
|
5
|
+
PRIORITY_KEY = "queue_priority"
|
6
|
+
|
7
|
+
module Attributes
|
8
|
+
|
9
|
+
def priority_buckets
|
10
|
+
priorities = Array(redis.lrange(PRIORITY_KEY, 0, -1))
|
11
|
+
priorities = priorities.collect {|p| Resque.decode(p) }
|
12
|
+
priorities << {'pattern' => 'default'} unless priorities.find {|b| b['pattern'] == 'default' }
|
13
|
+
return priorities
|
14
|
+
end
|
15
|
+
|
16
|
+
def priority_buckets=(data)
|
17
|
+
redis.multi do
|
18
|
+
redis.del(PRIORITY_KEY)
|
19
|
+
Array(data).each do |v|
|
20
|
+
redis.rpush(PRIORITY_KEY, Resque.encode(v))
|
21
|
+
end
|
22
|
+
end
|
23
|
+
end
|
24
|
+
|
25
|
+
end
|
26
|
+
end
|
27
|
+
end
|
28
|
+
end
|
@@ -0,0 +1,56 @@
|
|
1
|
+
require 'resque/worker'
|
2
|
+
|
3
|
+
module Resque
|
4
|
+
module Plugins
|
5
|
+
module QueuePriority
|
6
|
+
|
7
|
+
module Priority
|
8
|
+
|
9
|
+
def self.included(klass)
|
10
|
+
klass.instance_eval do
|
11
|
+
alias_method :queues_without_priority, :queues
|
12
|
+
alias_method :queues, :queues_with_priority
|
13
|
+
end
|
14
|
+
end
|
15
|
+
|
16
|
+
def queues_with_priority
|
17
|
+
all_queues = queues_without_priority
|
18
|
+
result = []
|
19
|
+
default_idx = -1, default_fairly = false;
|
20
|
+
|
21
|
+
# Walk the priority patterns, extract each into its own bucket
|
22
|
+
buckets = Resque.priority_buckets
|
23
|
+
buckets.each do |bucket|
|
24
|
+
bucket_pattern = bucket['pattern']
|
25
|
+
fairly = bucket['fairly']
|
26
|
+
|
27
|
+
# note the position of the default bucket for inserting the remaining queues at that location
|
28
|
+
if bucket_pattern == 'default'
|
29
|
+
default_idx = result.size
|
30
|
+
default_fairly = fairly
|
31
|
+
next
|
32
|
+
end
|
33
|
+
|
34
|
+
patstr = bucket_pattern.gsub(/\*/, ".*")
|
35
|
+
pattern = /^#{patstr}$/
|
36
|
+
bucket_queues, remaining = all_queues.partition {|q| q =~ pattern }
|
37
|
+
|
38
|
+
bucket_queues.shuffle! if fairly
|
39
|
+
all_queues = remaining
|
40
|
+
|
41
|
+
result << bucket_queues
|
42
|
+
end
|
43
|
+
|
44
|
+
# insert the remaining queues at the position the default item was at (or last)
|
45
|
+
all_queues.shuffle! if default_fairly
|
46
|
+
result.insert(default_idx, all_queues)
|
47
|
+
result.flatten!
|
48
|
+
|
49
|
+
return result
|
50
|
+
end
|
51
|
+
|
52
|
+
end
|
53
|
+
|
54
|
+
end
|
55
|
+
end
|
56
|
+
end
|
@@ -0,0 +1,37 @@
|
|
1
|
+
require 'resque-queue-priority'
|
2
|
+
|
3
|
+
module Resque
|
4
|
+
module Plugins
|
5
|
+
module QueuePriority
|
6
|
+
|
7
|
+
module Server
|
8
|
+
|
9
|
+
VIEW_PATH = File.join(File.dirname(__FILE__), 'server', 'views')
|
10
|
+
|
11
|
+
def self.registered(app)
|
12
|
+
|
13
|
+
app.get "/queuepriority" do
|
14
|
+
@priorities = Resque.priority_buckets
|
15
|
+
plugin_view :priorities
|
16
|
+
end
|
17
|
+
|
18
|
+
app.post "/queuepriority" do
|
19
|
+
priorities = params['priorities']
|
20
|
+
Resque.priority_buckets = priorities
|
21
|
+
redirect url(:queuepriority)
|
22
|
+
end
|
23
|
+
|
24
|
+
app.helpers do
|
25
|
+
def plugin_view(filename, options = {}, locals = {})
|
26
|
+
erb(File.read(File.join(::Resque::Plugins::QueuePriority::Server::VIEW_PATH, "#{filename}.erb")), options, locals)
|
27
|
+
end
|
28
|
+
end
|
29
|
+
|
30
|
+
app.tabs << "QueuePriority"
|
31
|
+
end
|
32
|
+
|
33
|
+
end
|
34
|
+
|
35
|
+
end
|
36
|
+
end
|
37
|
+
end
|
@@ -0,0 +1,65 @@
|
|
1
|
+
<h1>Dynamic Queues</h1>
|
2
|
+
<p class="intro">
|
3
|
+
The list below orders queue name patterns by the priority you wish them to be executed in. The "Fairly" option allows you to indicate you want the queues within that pattern space be selected in a fair (random) manner, i.e. like resque-fairly. The 'default' pattern must always exist, and matches against all queues that aren't in any of the other patterns.
|
4
|
+
</p>
|
5
|
+
|
6
|
+
<form action="/queuepriority" method="POST" style="float:none; margin-top:10px">
|
7
|
+
|
8
|
+
<table class="priorities">
|
9
|
+
<tr>
|
10
|
+
<th>Pattern</th>
|
11
|
+
<th>Fairly</th>
|
12
|
+
<th></th>
|
13
|
+
</tr>
|
14
|
+
<% @priorities.each_with_index do |priority, i| %>
|
15
|
+
<tr class="line">
|
16
|
+
<td><input type="text" id="input-<%= i %>-pattern" name="priorities[][pattern]" value="<%= priority["pattern"] %>" /></td>
|
17
|
+
<td><input type="checkbox" id="input-<%= i %>-fairly" name="priorities[][fairly]" value="true" <%= "checked" if priority["fairly"] %> /></td>
|
18
|
+
<td>
|
19
|
+
<a href="#up" class="up">Up</a> |
|
20
|
+
<a href="#down" class="down">Down</a> |
|
21
|
+
<a href="#remove" class="remove">Remove</a>
|
22
|
+
</td>
|
23
|
+
</tr>
|
24
|
+
<% end %>
|
25
|
+
</table>
|
26
|
+
|
27
|
+
<a href="#add" class="add">Add</a>
|
28
|
+
<input type="submit" value="Save"/>
|
29
|
+
|
30
|
+
</form>
|
31
|
+
|
32
|
+
<script type="text/javascript" charset="utf-8">
|
33
|
+
jQuery(function($) {
|
34
|
+
|
35
|
+
$("a.add").click(function(e) {
|
36
|
+
e.preventDefault();
|
37
|
+
var $table = $("table.priorities");
|
38
|
+
var $newRow = $table.find("tr.line:first").clone();
|
39
|
+
$newRow.find("input[type=text]").attr("value", "");
|
40
|
+
$newRow.find("input[type=checkbox]").attr("checked", false);
|
41
|
+
$newRow.appendTo($table);
|
42
|
+
});
|
43
|
+
|
44
|
+
$("a.remove").click(function(e) {
|
45
|
+
e.preventDefault();
|
46
|
+
var $link = $(this);
|
47
|
+
$link.parents("tr").remove();
|
48
|
+
});
|
49
|
+
|
50
|
+
$("a.up").click(function(e) {
|
51
|
+
e.preventDefault();
|
52
|
+
var $link = $(this);
|
53
|
+
var $row = $link.parents("tr");
|
54
|
+
$row.prev(".line").before($row);
|
55
|
+
});
|
56
|
+
|
57
|
+
$("a.down").click(function(e) {
|
58
|
+
e.preventDefault();
|
59
|
+
var $link = $(this);
|
60
|
+
var $row = $link.parents("tr");
|
61
|
+
$row.next(".line").after($row);
|
62
|
+
});
|
63
|
+
|
64
|
+
});
|
65
|
+
</script>
|
@@ -0,0 +1,29 @@
|
|
1
|
+
# -*- encoding: utf-8 -*-
|
2
|
+
$:.push File.expand_path("../lib", __FILE__)
|
3
|
+
require 'resque/plugins/queue_priority/version'
|
4
|
+
|
5
|
+
|
6
|
+
Gem::Specification.new do |s|
|
7
|
+
s.name = "resque-queue-priority"
|
8
|
+
s.version = Resque::Plugins::QueuePriority::VERSION
|
9
|
+
s.platform = Gem::Platform::RUBY
|
10
|
+
s.authors = ["Matt Conway"]
|
11
|
+
s.email = ["matt@conwaysplace.com"]
|
12
|
+
s.homepage = "http://github.com/wr0ngway/resque-queue-priority"
|
13
|
+
s.summary = %q{A resque plugin for specifying the priority between queues that workers use to determine what to work on next}
|
14
|
+
s.description = %q{A resque plugin for specifying the priority between queues that workers use to determine what to work on next}
|
15
|
+
|
16
|
+
s.rubyforge_project = "resque-queue-priority"
|
17
|
+
|
18
|
+
s.files = `git ls-files`.split("\n")
|
19
|
+
s.test_files = `git ls-files -- {test,spec,features}/*`.split("\n")
|
20
|
+
s.executables = `git ls-files -- bin/*`.split("\n").map{ |f| File.basename(f) }
|
21
|
+
s.require_paths = ["lib"]
|
22
|
+
|
23
|
+
s.add_dependency("resque", '~> 1.10')
|
24
|
+
s.add_development_dependency('rake')
|
25
|
+
s.add_development_dependency('rspec', '~> 2.5')
|
26
|
+
s.add_development_dependency('rack-test', '~> 0.5.4')
|
27
|
+
|
28
|
+
end
|
29
|
+
|
@@ -0,0 +1,167 @@
|
|
1
|
+
require "spec_helper"
|
2
|
+
|
3
|
+
describe "Queue Priority" do
|
4
|
+
|
5
|
+
before(:each) do
|
6
|
+
Resque.redis.flushall
|
7
|
+
end
|
8
|
+
|
9
|
+
context "basic resque behavior still works" do
|
10
|
+
|
11
|
+
it "can work on multiple queues" do
|
12
|
+
Resque::Job.create(:high, SomeJob)
|
13
|
+
Resque::Job.create(:critical, SomeJob)
|
14
|
+
|
15
|
+
worker = Resque::Worker.new(:critical, :high)
|
16
|
+
|
17
|
+
worker.process
|
18
|
+
Resque.size(:high).should == 1
|
19
|
+
Resque.size(:critical).should == 0
|
20
|
+
|
21
|
+
worker.process
|
22
|
+
Resque.size(:high).should == 0
|
23
|
+
end
|
24
|
+
|
25
|
+
it "can work on all queues" do
|
26
|
+
Resque::Job.create(:high, SomeJob)
|
27
|
+
Resque::Job.create(:critical, SomeJob)
|
28
|
+
Resque::Job.create(:blahblah, SomeJob)
|
29
|
+
|
30
|
+
worker = Resque::Worker.new("*")
|
31
|
+
|
32
|
+
worker.work(0)
|
33
|
+
Resque.size(:high).should == 0
|
34
|
+
Resque.size(:critical).should == 0
|
35
|
+
Resque.size(:blahblah).should == 0
|
36
|
+
end
|
37
|
+
|
38
|
+
it "processes * queues in alphabetical order" do
|
39
|
+
Resque::Job.create(:high, SomeJob)
|
40
|
+
Resque::Job.create(:critical, SomeJob)
|
41
|
+
Resque::Job.create(:blahblah, SomeJob)
|
42
|
+
|
43
|
+
worker = Resque::Worker.new("*")
|
44
|
+
|
45
|
+
worker.work(0) do |job|
|
46
|
+
Resque.redis.rpush("processed_queues", job.queue)
|
47
|
+
end
|
48
|
+
|
49
|
+
Resque.redis.lrange("processed_queues", 0, -1).should == %w( high critical blahblah ).sort
|
50
|
+
end
|
51
|
+
|
52
|
+
it "should pass lint" do
|
53
|
+
Resque::Plugin.lint(Resque::Plugins::QueuePriority)
|
54
|
+
end
|
55
|
+
|
56
|
+
end
|
57
|
+
|
58
|
+
context "queue patterns" do
|
59
|
+
|
60
|
+
before(:each) do
|
61
|
+
Resque.watch_queue("high_x")
|
62
|
+
Resque.watch_queue("foo")
|
63
|
+
Resque.watch_queue("high_y")
|
64
|
+
Resque.watch_queue("superhigh_z")
|
65
|
+
end
|
66
|
+
|
67
|
+
it "can specify simple queues" do
|
68
|
+
worker = Resque::Worker.new("foo")
|
69
|
+
worker.queues.should == ["foo"]
|
70
|
+
|
71
|
+
worker = Resque::Worker.new("foo", "bar")
|
72
|
+
worker.queues.should == ["foo", "bar"]
|
73
|
+
end
|
74
|
+
|
75
|
+
it "can specify simple wildcard" do
|
76
|
+
worker = Resque::Worker.new("*")
|
77
|
+
worker.queues.should == ["foo", "high_x", "high_y", "superhigh_z"]
|
78
|
+
end
|
79
|
+
|
80
|
+
it "should pick up all queues with default priority" do
|
81
|
+
Resque.priority_buckets = [{'pattern' => 'default', 'fairly' => false}]
|
82
|
+
worker = Resque::Worker.new("*")
|
83
|
+
worker.queues.should == ["foo", "high_x", "high_y", "superhigh_z"]
|
84
|
+
end
|
85
|
+
|
86
|
+
it "should pick up all queues fairly" do
|
87
|
+
Resque.priority_buckets = [{'pattern' => 'default', 'fairly' => true}]
|
88
|
+
worker = Resque::Worker.new("*")
|
89
|
+
worker.queues.should_not == ["foo", "high_x", "high_y", "superhigh_z"]
|
90
|
+
worker.queues.sort.should == ["foo", "high_x", "high_y", "superhigh_z"]
|
91
|
+
end
|
92
|
+
|
93
|
+
it "should prioritize simple pattern" do
|
94
|
+
Resque.priority_buckets = [{'pattern' => 'superhigh_z', 'fairly' => false},
|
95
|
+
{'pattern' => 'default', 'fairly' => false}]
|
96
|
+
worker = Resque::Worker.new("*")
|
97
|
+
worker.queues.should == ["superhigh_z", "foo", "high_x", "high_y"]
|
98
|
+
end
|
99
|
+
|
100
|
+
it "should prioritize multiple simple patterns" do
|
101
|
+
Resque.priority_buckets = [{'pattern' => 'superhigh_z', 'fairly' => false},
|
102
|
+
{'pattern' => 'default', 'fairly' => false},
|
103
|
+
{'pattern' => 'foo', 'fairly' => false}]
|
104
|
+
worker = Resque::Worker.new("*")
|
105
|
+
worker.queues.should == ["superhigh_z", "high_x", "high_y", "foo"]
|
106
|
+
end
|
107
|
+
|
108
|
+
it "should prioritize simple wildcard pattern" do
|
109
|
+
Resque.priority_buckets = [{'pattern' => 'high*', 'fairly' => false},
|
110
|
+
{'pattern' => 'default', 'fairly' => false}]
|
111
|
+
worker = Resque::Worker.new("*")
|
112
|
+
worker.queues.should == ["high_x", "high_y", "foo", "superhigh_z"]
|
113
|
+
end
|
114
|
+
|
115
|
+
it "should prioritize fully inclusive wildcard pattern" do
|
116
|
+
Resque.priority_buckets = [{'pattern' => '*high*', 'fairly' => false},
|
117
|
+
{'pattern' => 'default', 'fairly' => false}]
|
118
|
+
worker = Resque::Worker.new("*")
|
119
|
+
worker.queues.should == ["high_x", "high_y", "superhigh_z", "foo"]
|
120
|
+
end
|
121
|
+
|
122
|
+
it "should handle empty default match" do
|
123
|
+
Resque.priority_buckets = [{'pattern' => '*', 'fairly' => false},
|
124
|
+
{'pattern' => 'default', 'fairly' => false}]
|
125
|
+
worker = Resque::Worker.new("*")
|
126
|
+
worker.queues.should == ["foo", "high_x", "high_y", "superhigh_z"]
|
127
|
+
end
|
128
|
+
|
129
|
+
it "should pickup wildcard queues fairly" do
|
130
|
+
others = 5.times.collect {|i| "other#{i}" }
|
131
|
+
others.map {|o| Resque.watch_queue(o)}
|
132
|
+
|
133
|
+
Resque.priority_buckets = [{'pattern' => 'other*', 'fairly' => true},
|
134
|
+
{'pattern' => 'default', 'fairly' => false}]
|
135
|
+
worker = Resque::Worker.new("*")
|
136
|
+
worker.queues.size
|
137
|
+
worker.queues[0..4].sort.should == others.sort
|
138
|
+
worker.queues[5..-1].should == ["foo", "high_x", "high_y", "superhigh_z"]
|
139
|
+
worker.queues.should_not == others.sort + ["foo", "high_x", "high_y", "superhigh_z"]
|
140
|
+
end
|
141
|
+
|
142
|
+
end
|
143
|
+
|
144
|
+
context "queue priority accessors" do
|
145
|
+
|
146
|
+
it "can lookup a default priority" do
|
147
|
+
Resque.priority_buckets.should == [{'pattern' => 'default'}]
|
148
|
+
end
|
149
|
+
|
150
|
+
it "can set priorities" do
|
151
|
+
Resque.priority_buckets = [{'pattern' => 'foo', 'fairly' => 'false'}]
|
152
|
+
Resque.priority_buckets.should == [{'pattern' => 'foo', 'fairly' => 'false'},
|
153
|
+
{'pattern' => 'default'}]
|
154
|
+
end
|
155
|
+
|
156
|
+
it "can set priorities including default" do
|
157
|
+
Resque.priority_buckets = [{'pattern' => 'foo', 'fairly' => false},
|
158
|
+
{'pattern' => 'default', 'fairly' => false},
|
159
|
+
{'pattern' => 'bar', 'fairly' => true}]
|
160
|
+
Resque.priority_buckets.should == [{'pattern' => 'foo', 'fairly' => false},
|
161
|
+
{'pattern' => 'default', 'fairly' => false},
|
162
|
+
{'pattern' => 'bar', 'fairly' => true}]
|
163
|
+
end
|
164
|
+
|
165
|
+
end
|
166
|
+
|
167
|
+
end
|
@@ -0,0 +1,312 @@
|
|
1
|
+
# Redis configuration file example
|
2
|
+
|
3
|
+
# Note on units: when memory size is needed, it is possible to specifiy
|
4
|
+
# it in the usual form of 1k 5GB 4M and so forth:
|
5
|
+
#
|
6
|
+
# 1k => 1000 bytes
|
7
|
+
# 1kb => 1024 bytes
|
8
|
+
# 1m => 1000000 bytes
|
9
|
+
# 1mb => 1024*1024 bytes
|
10
|
+
# 1g => 1000000000 bytes
|
11
|
+
# 1gb => 1024*1024*1024 bytes
|
12
|
+
#
|
13
|
+
# units are case insensitive so 1GB 1Gb 1gB are all the same.
|
14
|
+
|
15
|
+
# By default Redis does not run as a daemon. Use 'yes' if you need it.
|
16
|
+
# Note that Redis will write a pid file in ./tmp/run/redis.pid when daemonized.
|
17
|
+
daemonize yes
|
18
|
+
|
19
|
+
# When running daemonized, Redis writes a pid file in ./tmp/run/redis.pid by
|
20
|
+
# default. You can specify a custom pid file location here.
|
21
|
+
pidfile ./redis.pid
|
22
|
+
|
23
|
+
# Accept connections on the specified port, default is 6379
|
24
|
+
port 9736
|
25
|
+
|
26
|
+
# If you want you can bind a single interface, if the bind option is not
|
27
|
+
# specified all the interfaces will listen for incoming connections.
|
28
|
+
#
|
29
|
+
bind 127.0.0.1
|
30
|
+
|
31
|
+
# Close the connection after a client is idle for N seconds (0 to disable)
|
32
|
+
timeout 300
|
33
|
+
|
34
|
+
# Set server verbosity to 'debug'
|
35
|
+
# it can be one of:
|
36
|
+
# debug (a lot of information, useful for development/testing)
|
37
|
+
# verbose (many rarely useful info, but not a mess like the debug level)
|
38
|
+
# notice (moderately verbose, what you want in production probably)
|
39
|
+
# warning (only very important / critical messages are logged)
|
40
|
+
loglevel verbose
|
41
|
+
|
42
|
+
# Specify the log file name. Also 'stdout' can be used to force
|
43
|
+
# Redis to log on the standard output. Note that if you use standard
|
44
|
+
# output for logging but daemonize, logs will be sent to /dev/null
|
45
|
+
logfile ./redis-server.log
|
46
|
+
|
47
|
+
# Set the number of databases. The default database is DB 0, you can select
|
48
|
+
# a different one on a per-connection basis using SELECT <dbid> where
|
49
|
+
# dbid is a number between 0 and 'databases'-1
|
50
|
+
databases 16
|
51
|
+
|
52
|
+
################################ SNAPSHOTTING #################################
|
53
|
+
#
|
54
|
+
# Save the DB on disk:
|
55
|
+
#
|
56
|
+
# save <seconds> <changes>
|
57
|
+
#
|
58
|
+
# Will save the DB if both the given number of seconds and the given
|
59
|
+
# number of write operations against the DB occurred.
|
60
|
+
#
|
61
|
+
# In the example below the behaviour will be to save:
|
62
|
+
# after 900 sec (15 min) if at least 1 key changed
|
63
|
+
# after 300 sec (5 min) if at least 10 keys changed
|
64
|
+
# after 60 sec if at least 10000 keys changed
|
65
|
+
#
|
66
|
+
# Note: you can disable saving at all commenting all the "save" lines.
|
67
|
+
|
68
|
+
save 900 1
|
69
|
+
save 300 10
|
70
|
+
save 60 10000
|
71
|
+
|
72
|
+
# Compress string objects using LZF when dump .rdb databases?
|
73
|
+
# For default that's set to 'yes' as it's almost always a win.
|
74
|
+
# If you want to save some CPU in the saving child set it to 'no' but
|
75
|
+
# the dataset will likely be bigger if you have compressible values or keys.
|
76
|
+
rdbcompression yes
|
77
|
+
|
78
|
+
# The filename where to dump the DB
|
79
|
+
dbfilename dump.rdb
|
80
|
+
|
81
|
+
# The working directory.
|
82
|
+
#
|
83
|
+
# The DB will be written inside this directory, with the filename specified
|
84
|
+
# above using the 'dbfilename' configuration directive.
|
85
|
+
#
|
86
|
+
# Also the Append Only File will be created inside this directory.
|
87
|
+
#
|
88
|
+
# Note that you must specify a directory here, not a file name.
|
89
|
+
dir .
|
90
|
+
|
91
|
+
################################# REPLICATION #################################
|
92
|
+
|
93
|
+
# Master-Slave replication. Use slaveof to make a Redis instance a copy of
|
94
|
+
# another Redis server. Note that the configuration is local to the slave
|
95
|
+
# so for example it is possible to configure the slave to save the DB with a
|
96
|
+
# different interval, or to listen to another port, and so on.
|
97
|
+
#
|
98
|
+
# slaveof <masterip> <masterport>
|
99
|
+
|
100
|
+
# If the master is password protected (using the "requirepass" configuration
|
101
|
+
# directive below) it is possible to tell the slave to authenticate before
|
102
|
+
# starting the replication synchronization process, otherwise the master will
|
103
|
+
# refuse the slave request.
|
104
|
+
#
|
105
|
+
# masterauth <master-password>
|
106
|
+
|
107
|
+
################################## SECURITY ###################################
|
108
|
+
|
109
|
+
# Require clients to issue AUTH <PASSWORD> before processing any other
|
110
|
+
# commands. This might be useful in environments in which you do not trust
|
111
|
+
# others with access to the host running redis-server.
|
112
|
+
#
|
113
|
+
# This should stay commented out for backward compatibility and because most
|
114
|
+
# people do not need auth (e.g. they run their own servers).
|
115
|
+
#
|
116
|
+
# Warning: since Redis is pretty fast an outside user can try up to
|
117
|
+
# 150k passwords per second against a good box. This means that you should
|
118
|
+
# use a very strong password otherwise it will be very easy to break.
|
119
|
+
#
|
120
|
+
# requirepass foobared
|
121
|
+
|
122
|
+
################################### LIMITS ####################################
|
123
|
+
|
124
|
+
# Set the max number of connected clients at the same time. By default there
|
125
|
+
# is no limit, and it's up to the number of file descriptors the Redis process
|
126
|
+
# is able to open. The special value '0' means no limits.
|
127
|
+
# Once the limit is reached Redis will close all the new connections sending
|
128
|
+
# an error 'max number of clients reached'.
|
129
|
+
#
|
130
|
+
# maxclients 128
|
131
|
+
|
132
|
+
# Don't use more memory than the specified amount of bytes.
|
133
|
+
# When the memory limit is reached Redis will try to remove keys with an
|
134
|
+
# EXPIRE set. It will try to start freeing keys that are going to expire
|
135
|
+
# in little time and preserve keys with a longer time to live.
|
136
|
+
# Redis will also try to remove objects from free lists if possible.
|
137
|
+
#
|
138
|
+
# If all this fails, Redis will start to reply with errors to commands
|
139
|
+
# that will use more memory, like SET, LPUSH, and so on, and will continue
|
140
|
+
# to reply to most read-only commands like GET.
|
141
|
+
#
|
142
|
+
# WARNING: maxmemory can be a good idea mainly if you want to use Redis as a
|
143
|
+
# 'state' server or cache, not as a real DB. When Redis is used as a real
|
144
|
+
# database the memory usage will grow over the weeks, it will be obvious if
|
145
|
+
# it is going to use too much memory in the long run, and you'll have the time
|
146
|
+
# to upgrade. With maxmemory after the limit is reached you'll start to get
|
147
|
+
# errors for write operations, and this may even lead to DB inconsistency.
|
148
|
+
#
|
149
|
+
# maxmemory <bytes>
|
150
|
+
|
151
|
+
############################## APPEND ONLY MODE ###############################
|
152
|
+
|
153
|
+
# By default Redis asynchronously dumps the dataset on disk. If you can live
|
154
|
+
# with the idea that the latest records will be lost if something like a crash
|
155
|
+
# happens this is the preferred way to run Redis. If instead you care a lot
|
156
|
+
# about your data and don't want to that a single record can get lost you should
|
157
|
+
# enable the append only mode: when this mode is enabled Redis will append
|
158
|
+
# every write operation received in the file appendonly.aof. This file will
|
159
|
+
# be read on startup in order to rebuild the full dataset in memory.
|
160
|
+
#
|
161
|
+
# Note that you can have both the async dumps and the append only file if you
|
162
|
+
# like (you have to comment the "save" statements above to disable the dumps).
|
163
|
+
# Still if append only mode is enabled Redis will load the data from the
|
164
|
+
# log file at startup ignoring the dump.rdb file.
|
165
|
+
#
|
166
|
+
# IMPORTANT: Check the BGREWRITEAOF to check how to rewrite the append
|
167
|
+
# log file in background when it gets too big.
|
168
|
+
|
169
|
+
appendonly no
|
170
|
+
|
171
|
+
# The name of the append only file (default: "appendonly.aof")
|
172
|
+
# appendfilename appendonly.aof
|
173
|
+
|
174
|
+
# The fsync() call tells the Operating System to actually write data on disk
|
175
|
+
# instead to wait for more data in the output buffer. Some OS will really flush
|
176
|
+
# data on disk, some other OS will just try to do it ASAP.
|
177
|
+
#
|
178
|
+
# Redis supports three different modes:
|
179
|
+
#
|
180
|
+
# no: don't fsync, just let the OS flush the data when it wants. Faster.
|
181
|
+
# always: fsync after every write to the append only log . Slow, Safest.
|
182
|
+
# everysec: fsync only if one second passed since the last fsync. Compromise.
|
183
|
+
#
|
184
|
+
# The default is "everysec" that's usually the right compromise between
|
185
|
+
# speed and data safety. It's up to you to understand if you can relax this to
|
186
|
+
# "no" that will will let the operating system flush the output buffer when
|
187
|
+
# it wants, for better performances (but if you can live with the idea of
|
188
|
+
# some data loss consider the default persistence mode that's snapshotting),
|
189
|
+
# or on the contrary, use "always" that's very slow but a bit safer than
|
190
|
+
# everysec.
|
191
|
+
#
|
192
|
+
# If unsure, use "everysec".
|
193
|
+
|
194
|
+
# appendfsync always
|
195
|
+
appendfsync everysec
|
196
|
+
# appendfsync no
|
197
|
+
|
198
|
+
################################ VIRTUAL MEMORY ###############################
|
199
|
+
|
200
|
+
# Virtual Memory allows Redis to work with datasets bigger than the actual
|
201
|
+
# amount of RAM needed to hold the whole dataset in memory.
|
202
|
+
# In order to do so very used keys are taken in memory while the other keys
|
203
|
+
# are swapped into a swap file, similarly to what operating systems do
|
204
|
+
# with memory pages.
|
205
|
+
#
|
206
|
+
# To enable VM just set 'vm-enabled' to yes, and set the following three
|
207
|
+
# VM parameters accordingly to your needs.
|
208
|
+
|
209
|
+
vm-enabled no
|
210
|
+
# vm-enabled yes
|
211
|
+
|
212
|
+
# This is the path of the Redis swap file. As you can guess, swap files
|
213
|
+
# can't be shared by different Redis instances, so make sure to use a swap
|
214
|
+
# file for every redis process you are running. Redis will complain if the
|
215
|
+
# swap file is already in use.
|
216
|
+
#
|
217
|
+
# The best kind of storage for the Redis swap file (that's accessed at random)
|
218
|
+
# is a Solid State Disk (SSD).
|
219
|
+
#
|
220
|
+
# *** WARNING *** if you are using a shared hosting the default of putting
|
221
|
+
# the swap file under /tmp is not secure. Create a dir with access granted
|
222
|
+
# only to Redis user and configure Redis to create the swap file there.
|
223
|
+
vm-swap-file ./tmp/redis.swap
|
224
|
+
|
225
|
+
# vm-max-memory configures the VM to use at max the specified amount of
|
226
|
+
# RAM. Everything that deos not fit will be swapped on disk *if* possible, that
|
227
|
+
# is, if there is still enough contiguous space in the swap file.
|
228
|
+
#
|
229
|
+
# With vm-max-memory 0 the system will swap everything it can. Not a good
|
230
|
+
# default, just specify the max amount of RAM you can in bytes, but it's
|
231
|
+
# better to leave some margin. For instance specify an amount of RAM
|
232
|
+
# that's more or less between 60 and 80% of your free RAM.
|
233
|
+
vm-max-memory 0
|
234
|
+
|
235
|
+
# Redis swap files is split into pages. An object can be saved using multiple
|
236
|
+
# contiguous pages, but pages can't be shared between different objects.
|
237
|
+
# So if your page is too big, small objects swapped out on disk will waste
|
238
|
+
# a lot of space. If you page is too small, there is less space in the swap
|
239
|
+
# file (assuming you configured the same number of total swap file pages).
|
240
|
+
#
|
241
|
+
# If you use a lot of small objects, use a page size of 64 or 32 bytes.
|
242
|
+
# If you use a lot of big objects, use a bigger page size.
|
243
|
+
# If unsure, use the default :)
|
244
|
+
vm-page-size 32
|
245
|
+
|
246
|
+
# Number of total memory pages in the swap file.
|
247
|
+
# Given that the page table (a bitmap of free/used pages) is taken in memory,
|
248
|
+
# every 8 pages on disk will consume 1 byte of RAM.
|
249
|
+
#
|
250
|
+
# The total swap size is vm-page-size * vm-pages
|
251
|
+
#
|
252
|
+
# With the default of 32-bytes memory pages and 134217728 pages Redis will
|
253
|
+
# use a 4 GB swap file, that will use 16 MB of RAM for the page table.
|
254
|
+
#
|
255
|
+
# It's better to use the smallest acceptable value for your application,
|
256
|
+
# but the default is large in order to work in most conditions.
|
257
|
+
vm-pages 134217728
|
258
|
+
|
259
|
+
# Max number of VM I/O threads running at the same time.
|
260
|
+
# This threads are used to read/write data from/to swap file, since they
|
261
|
+
# also encode and decode objects from disk to memory or the reverse, a bigger
|
262
|
+
# number of threads can help with big objects even if they can't help with
|
263
|
+
# I/O itself as the physical device may not be able to couple with many
|
264
|
+
# reads/writes operations at the same time.
|
265
|
+
#
|
266
|
+
# The special value of 0 turn off threaded I/O and enables the blocking
|
267
|
+
# Virtual Memory implementation.
|
268
|
+
vm-max-threads 4
|
269
|
+
|
270
|
+
############################### ADVANCED CONFIG ###############################
|
271
|
+
|
272
|
+
# Glue small output buffers together in order to send small replies in a
|
273
|
+
# single TCP packet. Uses a bit more CPU but most of the times it is a win
|
274
|
+
# in terms of number of queries per second. Use 'yes' if unsure.
|
275
|
+
glueoutputbuf yes
|
276
|
+
|
277
|
+
# Hashes are encoded in a special way (much more memory efficient) when they
|
278
|
+
# have at max a given numer of elements, and the biggest element does not
|
279
|
+
# exceed a given threshold. You can configure this limits with the following
|
280
|
+
# configuration directives.
|
281
|
+
hash-max-zipmap-entries 64
|
282
|
+
hash-max-zipmap-value 512
|
283
|
+
|
284
|
+
# Active rehashing uses 1 millisecond every 100 milliseconds of CPU time in
|
285
|
+
# order to help rehashing the main Redis hash table (the one mapping top-level
|
286
|
+
# keys to values). The hash table implementation redis uses (see dict.c)
|
287
|
+
# performs a lazy rehashing: the more operation you run into an hash table
|
288
|
+
# that is rhashing, the more rehashing "steps" are performed, so if the
|
289
|
+
# server is idle the rehashing is never complete and some more memory is used
|
290
|
+
# by the hash table.
|
291
|
+
#
|
292
|
+
# The default is to use this millisecond 10 times every second in order to
|
293
|
+
# active rehashing the main dictionaries, freeing memory when possible.
|
294
|
+
#
|
295
|
+
# If unsure:
|
296
|
+
# use "activerehashing no" if you have hard latency requirements and it is
|
297
|
+
# not a good thing in your environment that Redis can reply form time to time
|
298
|
+
# to queries with 2 milliseconds delay.
|
299
|
+
#
|
300
|
+
# use "activerehashing yes" if you don't have such hard requirements but
|
301
|
+
# want to free memory asap when possible.
|
302
|
+
activerehashing yes
|
303
|
+
|
304
|
+
################################## INCLUDES ###################################
|
305
|
+
|
306
|
+
# Include one or more other config files here. This is useful if you
|
307
|
+
# have a standard template that goes to all redis server but also need
|
308
|
+
# to customize a few per-server settings. Include files can include
|
309
|
+
# other files, so use this wisely.
|
310
|
+
#
|
311
|
+
# include /path/to/local.conf
|
312
|
+
# include /path/to/other.conf
|
data/spec/server_spec.rb
ADDED
@@ -0,0 +1,118 @@
|
|
1
|
+
ENV['RACK_ENV'] = 'test'
|
2
|
+
|
3
|
+
require 'spec_helper'
|
4
|
+
require 'rack'
|
5
|
+
require 'rack/test'
|
6
|
+
require 'resque/server'
|
7
|
+
require 'resque-queue-priority-server'
|
8
|
+
|
9
|
+
Sinatra::Base.set :environment, :test
|
10
|
+
# ::Test::Unit::TestCase.send :include, Rack::Test::Methods
|
11
|
+
|
12
|
+
|
13
|
+
describe "Queue Priority pages" do
|
14
|
+
include Rack::Test::Methods
|
15
|
+
|
16
|
+
def app
|
17
|
+
@app ||= Resque::Server.new
|
18
|
+
end
|
19
|
+
|
20
|
+
before(:each) do
|
21
|
+
Resque.redis.flushall
|
22
|
+
end
|
23
|
+
|
24
|
+
context "existence in application" do
|
25
|
+
|
26
|
+
it "should respond to it's url" do
|
27
|
+
get "/queuepriority"
|
28
|
+
last_response.should be_ok
|
29
|
+
end
|
30
|
+
|
31
|
+
it "should display its tab" do
|
32
|
+
get "/overview"
|
33
|
+
last_response.body.should include "<a href='/queuepriority'>QueuePriority</a>"
|
34
|
+
end
|
35
|
+
|
36
|
+
end
|
37
|
+
|
38
|
+
context "show queue priority table" do
|
39
|
+
|
40
|
+
before(:each) do
|
41
|
+
Resque.priority_buckets = [{'pattern' => 'foo', 'fairly' => false},
|
42
|
+
{'pattern' => 'default', 'fairly' => false},
|
43
|
+
{'pattern' => 'bar', 'fairly' => true}]
|
44
|
+
|
45
|
+
end
|
46
|
+
|
47
|
+
it "should shows pattern input fields" do
|
48
|
+
get "/queuepriority"
|
49
|
+
|
50
|
+
last_response.body.should match /<input type="text" id="input-0-pattern" name="priorities\[\]\[pattern\]" value="foo"/
|
51
|
+
last_response.body.should match /<input type="text" id="input-1-pattern" name="priorities\[\]\[pattern\]" value="default"/
|
52
|
+
last_response.body.should match /<input type="text" id="input-2-pattern" name="priorities\[\]\[pattern\]" value="bar"/
|
53
|
+
end
|
54
|
+
|
55
|
+
it "should show fairly checkboxes" do
|
56
|
+
get "/queuepriority"
|
57
|
+
|
58
|
+
last_response.body.should match /<input type="checkbox" id="input-0-fairly" name="priorities\[\]\[fairly\]" value="true" *\/>/
|
59
|
+
last_response.body.should match /<input type="checkbox" id="input-1-fairly" name="priorities\[\]\[fairly\]" value="true" *\/>/
|
60
|
+
last_response.body.should match /<input type="checkbox" id="input-2-fairly" name="priorities\[\]\[fairly\]" value="true" checked *\/>/
|
61
|
+
end
|
62
|
+
|
63
|
+
end
|
64
|
+
|
65
|
+
context "edit links" do
|
66
|
+
|
67
|
+
before(:each) do
|
68
|
+
Resque.priority_buckets = [{'pattern' => 'foo', 'fairly' => false},
|
69
|
+
{'pattern' => 'default', 'fairly' => false},
|
70
|
+
{'pattern' => 'bar', 'fairly' => true}]
|
71
|
+
|
72
|
+
end
|
73
|
+
|
74
|
+
it "should show remove link for queue" do
|
75
|
+
get "/queuepriority"
|
76
|
+
|
77
|
+
last_response.body.should match /<a href="#remove"/
|
78
|
+
end
|
79
|
+
|
80
|
+
it "should show up link for queue" do
|
81
|
+
get "/queuepriority"
|
82
|
+
|
83
|
+
last_response.body.should match /<a href="#up"/
|
84
|
+
end
|
85
|
+
|
86
|
+
it "should show down link for queue" do
|
87
|
+
get "/queuepriority"
|
88
|
+
|
89
|
+
last_response.body.should match /<a href="#down"/
|
90
|
+
end
|
91
|
+
|
92
|
+
end
|
93
|
+
|
94
|
+
context "form to edit queues" do
|
95
|
+
|
96
|
+
it "should have form to edit queues" do
|
97
|
+
get "/queuepriority"
|
98
|
+
|
99
|
+
last_response.body.should match /<form action="\/queuepriority"/
|
100
|
+
end
|
101
|
+
|
102
|
+
it "should update queues" do
|
103
|
+
Resque.priority_buckets.should == [{'pattern' => 'default'}]
|
104
|
+
|
105
|
+
post "/queuepriority", {'priorities' => [{"pattern" => "foo"},
|
106
|
+
{"pattern" => "default"},
|
107
|
+
{"pattern" => "bar", "fairly" => "true"}]}
|
108
|
+
|
109
|
+
last_response.should be_redirect
|
110
|
+
last_response['Location'].should match /queuepriority/
|
111
|
+
Resque.priority_buckets.should == [{"pattern" => "foo"},
|
112
|
+
{"pattern" => "default"},
|
113
|
+
{"pattern" => "bar", "fairly" => "true"}]
|
114
|
+
end
|
115
|
+
|
116
|
+
end
|
117
|
+
|
118
|
+
end
|
data/spec/spec_helper.rb
ADDED
@@ -0,0 +1,20 @@
|
|
1
|
+
require 'rspec'
|
2
|
+
require 'resque-queue-priority'
|
3
|
+
|
4
|
+
spec_dir = File.dirname(File.expand_path(__FILE__))
|
5
|
+
REDIS_CMD = "redis-server #{spec_dir}/redis-test.conf"
|
6
|
+
|
7
|
+
puts "Starting redis for testing at localhost:9736..."
|
8
|
+
puts `cd #{spec_dir}; #{REDIS_CMD}`
|
9
|
+
Resque.redis = 'localhost:9736'
|
10
|
+
|
11
|
+
# Schedule the redis server for shutdown when tests are all finished.
|
12
|
+
at_exit do
|
13
|
+
pid = File.read("#{spec_dir}/redis.pid").to_i rescue nil
|
14
|
+
system ("kill #{pid}") if pid != 0
|
15
|
+
end
|
16
|
+
|
17
|
+
class SomeJob
|
18
|
+
def self.perform(*args)
|
19
|
+
end
|
20
|
+
end
|
metadata
ADDED
@@ -0,0 +1,114 @@
|
|
1
|
+
--- !ruby/object:Gem::Specification
|
2
|
+
name: resque-queue-priority
|
3
|
+
version: !ruby/object:Gem::Version
|
4
|
+
version: 0.5.0
|
5
|
+
prerelease:
|
6
|
+
platform: ruby
|
7
|
+
authors:
|
8
|
+
- Matt Conway
|
9
|
+
autorequire:
|
10
|
+
bindir: bin
|
11
|
+
cert_chain: []
|
12
|
+
date: 2011-12-09 00:00:00.000000000Z
|
13
|
+
dependencies:
|
14
|
+
- !ruby/object:Gem::Dependency
|
15
|
+
name: resque
|
16
|
+
requirement: &2220530200 !ruby/object:Gem::Requirement
|
17
|
+
none: false
|
18
|
+
requirements:
|
19
|
+
- - ~>
|
20
|
+
- !ruby/object:Gem::Version
|
21
|
+
version: '1.10'
|
22
|
+
type: :runtime
|
23
|
+
prerelease: false
|
24
|
+
version_requirements: *2220530200
|
25
|
+
- !ruby/object:Gem::Dependency
|
26
|
+
name: rake
|
27
|
+
requirement: &2220525920 !ruby/object:Gem::Requirement
|
28
|
+
none: false
|
29
|
+
requirements:
|
30
|
+
- - ! '>='
|
31
|
+
- !ruby/object:Gem::Version
|
32
|
+
version: '0'
|
33
|
+
type: :development
|
34
|
+
prerelease: false
|
35
|
+
version_requirements: *2220525920
|
36
|
+
- !ruby/object:Gem::Dependency
|
37
|
+
name: rspec
|
38
|
+
requirement: &2220522620 !ruby/object:Gem::Requirement
|
39
|
+
none: false
|
40
|
+
requirements:
|
41
|
+
- - ~>
|
42
|
+
- !ruby/object:Gem::Version
|
43
|
+
version: '2.5'
|
44
|
+
type: :development
|
45
|
+
prerelease: false
|
46
|
+
version_requirements: *2220522620
|
47
|
+
- !ruby/object:Gem::Dependency
|
48
|
+
name: rack-test
|
49
|
+
requirement: &2222721200 !ruby/object:Gem::Requirement
|
50
|
+
none: false
|
51
|
+
requirements:
|
52
|
+
- - ~>
|
53
|
+
- !ruby/object:Gem::Version
|
54
|
+
version: 0.5.4
|
55
|
+
type: :development
|
56
|
+
prerelease: false
|
57
|
+
version_requirements: *2222721200
|
58
|
+
description: A resque plugin for specifying the priority between queues that workers
|
59
|
+
use to determine what to work on next
|
60
|
+
email:
|
61
|
+
- matt@conwaysplace.com
|
62
|
+
executables: []
|
63
|
+
extensions: []
|
64
|
+
extra_rdoc_files: []
|
65
|
+
files:
|
66
|
+
- .gitignore
|
67
|
+
- CHANGELOG
|
68
|
+
- Gemfile
|
69
|
+
- README.md
|
70
|
+
- Rakefile
|
71
|
+
- config.ru
|
72
|
+
- lib/resque-queue-priority-server.rb
|
73
|
+
- lib/resque-queue-priority.rb
|
74
|
+
- lib/resque/plugins/queue_priority/attributes.rb
|
75
|
+
- lib/resque/plugins/queue_priority/priority.rb
|
76
|
+
- lib/resque/plugins/queue_priority/server.rb
|
77
|
+
- lib/resque/plugins/queue_priority/server/views/priorities.erb
|
78
|
+
- lib/resque/plugins/queue_priority/version.rb
|
79
|
+
- resque-queue-priority.gemspec
|
80
|
+
- spec/priority_spec.rb
|
81
|
+
- spec/redis-test.conf
|
82
|
+
- spec/server_spec.rb
|
83
|
+
- spec/spec_helper.rb
|
84
|
+
homepage: http://github.com/wr0ngway/resque-queue-priority
|
85
|
+
licenses: []
|
86
|
+
post_install_message:
|
87
|
+
rdoc_options: []
|
88
|
+
require_paths:
|
89
|
+
- lib
|
90
|
+
required_ruby_version: !ruby/object:Gem::Requirement
|
91
|
+
none: false
|
92
|
+
requirements:
|
93
|
+
- - ! '>='
|
94
|
+
- !ruby/object:Gem::Version
|
95
|
+
version: '0'
|
96
|
+
required_rubygems_version: !ruby/object:Gem::Requirement
|
97
|
+
none: false
|
98
|
+
requirements:
|
99
|
+
- - ! '>='
|
100
|
+
- !ruby/object:Gem::Version
|
101
|
+
version: '0'
|
102
|
+
requirements: []
|
103
|
+
rubyforge_project: resque-queue-priority
|
104
|
+
rubygems_version: 1.8.10
|
105
|
+
signing_key:
|
106
|
+
specification_version: 3
|
107
|
+
summary: A resque plugin for specifying the priority between queues that workers use
|
108
|
+
to determine what to work on next
|
109
|
+
test_files:
|
110
|
+
- spec/priority_spec.rb
|
111
|
+
- spec/redis-test.conf
|
112
|
+
- spec/server_spec.rb
|
113
|
+
- spec/spec_helper.rb
|
114
|
+
has_rdoc:
|