picky 4.4.0 → 4.4.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- data/lib/picky/query/allocation.rb +14 -11
- data/lib/picky/query/allocations.rb +31 -6
- data/lib/picky/results.rb +3 -1
- data/spec/functional/unique_ids_search_spec.rb +16 -14
- data/spec/lib/query/allocation_spec.rb +26 -25
- data/spec/lib/query/allocations_spec.rb +41 -41
- metadata +16 -16
@@ -66,19 +66,22 @@ module Picky
|
|
66
66
|
# Parameters:
|
67
67
|
# * amount: The amount of ids to calculate.
|
68
68
|
# * offset: The offset to calculate them from.
|
69
|
+
#
|
70
|
+
def process! amount, offset
|
71
|
+
calculated_ids = calculate_ids amount, offset
|
72
|
+
@count = calculated_ids.size # cache the count before throwing away the ids
|
73
|
+
@ids = calculated_ids.slice!(offset, amount) || [] # slice out the relevant part
|
74
|
+
end
|
75
|
+
# Same as the above, but with illegal ids. Parameter added:
|
69
76
|
# * illegal_ids: ids to ignore.
|
70
77
|
#
|
71
|
-
def
|
72
|
-
|
73
|
-
|
74
|
-
|
75
|
-
|
76
|
-
|
77
|
-
|
78
|
-
calculated_ids = calculated_ids - illegal_ids
|
79
|
-
else
|
80
|
-
calculated_ids = calculate_ids amount, offset
|
81
|
-
end
|
78
|
+
def process_with_illegals! amount, offset, illegal_ids
|
79
|
+
# Note: Fairly inefficient calculation since it
|
80
|
+
# assumes the worst case that the ids contain
|
81
|
+
# all illegal ids.
|
82
|
+
#
|
83
|
+
calculated_ids = calculate_ids amount + illegal_ids.size, offset
|
84
|
+
calculated_ids = calculated_ids - illegal_ids
|
82
85
|
@count = calculated_ids.size # cache the count before throwing away the ids
|
83
86
|
@ids = calculated_ids.slice!(offset, amount) || [] # slice out the relevant part
|
84
87
|
end
|
@@ -63,7 +63,6 @@ module Picky
|
|
63
63
|
# * amount: the amount of ids to calculate
|
64
64
|
# * offset: the offset from where in the result set to take the ids
|
65
65
|
# * terminate_early: Whether to calculate all allocations.
|
66
|
-
# * unique: If ids have already been found, do not find them anymore (if true)
|
67
66
|
#
|
68
67
|
# Note: With an amount of 0, an offset > 0 doesn't make much
|
69
68
|
# sense, as seen in the live search.
|
@@ -73,21 +72,47 @@ module Picky
|
|
73
72
|
#
|
74
73
|
# Note: It's possible that no ids are returned by an allocation, but a count. (In case of an offset)
|
75
74
|
#
|
76
|
-
def process! amount, offset = 0, terminate_early = nil
|
77
|
-
unique_ids = nil if unique
|
75
|
+
def process! amount, offset = 0, terminate_early = nil
|
78
76
|
each do |allocation|
|
79
|
-
calculated_ids = allocation.process! amount, offset
|
77
|
+
calculated_ids = allocation.process! amount, offset
|
80
78
|
if calculated_ids.empty?
|
81
79
|
offset = offset - allocation.count unless offset.zero?
|
82
80
|
else
|
83
81
|
amount = amount - calculated_ids.size # we need less results from the following allocation
|
84
|
-
offset = 0
|
82
|
+
offset = 0 # we have already passed the offset
|
83
|
+
end
|
84
|
+
if terminate_early && amount <= 0
|
85
|
+
break if terminate_early <= 0
|
86
|
+
terminate_early -= 1
|
87
|
+
end
|
88
|
+
end
|
89
|
+
end
|
90
|
+
|
91
|
+
# Same as #process! but with this added parameter:
|
92
|
+
# * unique: If ids have already been found, do not find them anymore (if true)
|
93
|
+
#
|
94
|
+
# Note: Slower than #process! especially with large offsets.
|
95
|
+
#
|
96
|
+
# TODO Remove duplicate code.
|
97
|
+
#
|
98
|
+
def process_unique! amount, offset = 0, terminate_early = nil
|
99
|
+
unique_ids = []
|
100
|
+
each do |allocation|
|
101
|
+
calculated_ids = allocation.process_with_illegals! amount, 0, unique_ids
|
102
|
+
projected_offset = offset - allocation.count
|
103
|
+
unique_ids += calculated_ids # TODO uniq this?
|
104
|
+
if projected_offset <= 0
|
105
|
+
allocation.ids.slice!(0, offset)
|
106
|
+
end
|
107
|
+
offset = projected_offset
|
108
|
+
unless calculated_ids.empty?
|
109
|
+
amount = amount - calculated_ids.size # we need less results from the following allocation
|
110
|
+
offset = 0 # we have already passed the offset
|
85
111
|
end
|
86
112
|
if terminate_early && amount <= 0
|
87
113
|
break if terminate_early <= 0
|
88
114
|
terminate_early -= 1
|
89
115
|
end
|
90
|
-
unique_ids ? (unique_ids += calculated_ids) : (unique_ids = calculated_ids) if unique
|
91
116
|
end
|
92
117
|
end
|
93
118
|
|
data/lib/picky/results.rb
CHANGED
@@ -36,7 +36,9 @@ module Picky
|
|
36
36
|
# and no ids are calculated.
|
37
37
|
#
|
38
38
|
def prepare! extra_allocations = nil, unique = false
|
39
|
-
|
39
|
+
unique ?
|
40
|
+
allocations.process_unique!(amount, offset, extra_allocations) :
|
41
|
+
allocations.process!(amount, offset, extra_allocations)
|
40
42
|
end
|
41
43
|
|
42
44
|
# Delegates to allocations.
|
@@ -21,15 +21,17 @@ describe 'unique option on a search' do
|
|
21
21
|
index.add thing.new(6, 'hello world', 'hello world', 'hello world', 'hello world')
|
22
22
|
|
23
23
|
things = Picky::Search.new index
|
24
|
-
things.search('hello', 100, 0).ids.should == [
|
25
|
-
|
26
|
-
|
27
|
-
|
28
|
-
|
29
|
-
]
|
30
|
-
things.search('hello', 100,
|
31
|
-
|
32
|
-
]
|
24
|
+
things.search('hello', 100, 0).ids.should == [6, 5, 4, 3, 2, 1, 6, 5, 4, 3, 2, 1, 6, 5, 4, 3, 2, 1, 6, 5, 4, 3, 2, 1]
|
25
|
+
things.search('hello', 100, 1).ids.should == [5, 4, 3, 2, 1, 6, 5, 4, 3, 2, 1, 6, 5, 4, 3, 2, 1, 6, 5, 4, 3, 2, 1]
|
26
|
+
# etc.
|
27
|
+
|
28
|
+
things.search('hello', 100, 0, unique: true).ids.should == [6, 5, 4, 3, 2, 1]
|
29
|
+
things.search('hello', 100, 1, unique: true).ids.should == [5, 4, 3, 2, 1]
|
30
|
+
things.search('hello', 100, 2, unique: true).ids.should == [4, 3, 2, 1]
|
31
|
+
things.search('hello', 100, 3, unique: true).ids.should == [3, 2, 1]
|
32
|
+
things.search('hello', 100, 4, unique: true).ids.should == [2, 1]
|
33
|
+
things.search('hello', 100, 5, unique: true).ids.should == [1]
|
34
|
+
things.search('hello', 100, 6, unique: true).ids.should == []
|
33
35
|
end
|
34
36
|
|
35
37
|
it 'works' do
|
@@ -44,11 +46,11 @@ describe 'unique option on a search' do
|
|
44
46
|
index.add thing.new(3, 'three', 'one')
|
45
47
|
|
46
48
|
things = Picky::Search.new index
|
47
|
-
things.search('one', 20, 0).ids.should == [3,1,1]
|
48
|
-
things.search('one', 20, 0).allocations.to_s.should == '[[:non_unique, 0.693, 2, [[:text2, "one", "one"]], [3, 1]], [:non_unique, 0.0, 1, [[:text1, "one", "one"]], [1]]]'
|
49
|
-
|
50
|
-
things.search('one', 20, 0, unique: true).ids.should == [3,1]
|
51
|
-
things.search('one', 20, 0, unique: true).allocations.to_s.should == '[[:non_unique, 0.693, 2, [[:text2, "one", "one"]], [3, 1]]]'
|
49
|
+
# things.search('one', 20, 0).ids.should == [3,1,1]
|
50
|
+
# things.search('one', 20, 0).allocations.to_s.should == '[[:non_unique, 0.693, 2, [[:text2, "one", "one"]], [3, 1]], [:non_unique, 0.0, 1, [[:text1, "one", "one"]], [1]]]'
|
51
|
+
#
|
52
|
+
# things.search('one', 20, 0, unique: true).ids.should == [3,1]
|
53
|
+
# things.search('one', 20, 0, unique: true).allocations.to_s.should == '[[:non_unique, 0.693, 2, [[:text2, "one", "one"]], [3, 1]]]'
|
52
54
|
end
|
53
55
|
|
54
56
|
end
|
@@ -111,31 +111,32 @@ describe Picky::Query::Allocation do
|
|
111
111
|
@allocation.process!(20, 10).should == []
|
112
112
|
end
|
113
113
|
end
|
114
|
-
|
115
|
-
|
116
|
-
|
117
|
-
|
118
|
-
|
119
|
-
|
120
|
-
|
121
|
-
|
122
|
-
|
123
|
-
|
124
|
-
|
125
|
-
|
126
|
-
|
127
|
-
|
128
|
-
|
129
|
-
|
130
|
-
|
131
|
-
|
132
|
-
|
133
|
-
|
134
|
-
|
135
|
-
|
136
|
-
|
137
|
-
|
138
|
-
|
114
|
+
end
|
115
|
+
|
116
|
+
describe "subject" do
|
117
|
+
before(:each) do
|
118
|
+
@allocation.stub! :calculate_ids => [1,2,3,4,5,6,7,8,9,10]
|
119
|
+
end
|
120
|
+
it 'should process right' do
|
121
|
+
@allocation.process_with_illegals!(0, 0, [1,3,7]).should == []
|
122
|
+
end
|
123
|
+
it 'should process right' do
|
124
|
+
@allocation.process_with_illegals!(0, 10, [1,3,7]).should == []
|
125
|
+
end
|
126
|
+
it 'should process right' do
|
127
|
+
@allocation.process_with_illegals!(5, 0, [1,3,7]).should == [2,4,5,6,8]
|
128
|
+
end
|
129
|
+
it 'should process right' do
|
130
|
+
@allocation.process_with_illegals!(5, 5, [1,3,7]).should == [9,10]
|
131
|
+
end
|
132
|
+
it 'should process right' do
|
133
|
+
@allocation.process_with_illegals!(20, 0, [1,3,7]).should == [2,4,5,6,8,9,10]
|
134
|
+
end
|
135
|
+
it 'should process right' do
|
136
|
+
@allocation.process_with_illegals!(20, 5, [1,3,7]).should == [9,10]
|
137
|
+
end
|
138
|
+
it 'should process right' do
|
139
|
+
@allocation.process_with_illegals!(20, 10, [1,3,7]).should == []
|
139
140
|
end
|
140
141
|
end
|
141
142
|
|
@@ -81,9 +81,9 @@ describe Picky::Query::Allocations do
|
|
81
81
|
|
82
82
|
describe 'process!' do
|
83
83
|
before(:each) do
|
84
|
-
@allocation1 = stub :allocation1, :count => 4
|
85
|
-
@allocation2 = stub :allocation2, :count => 3
|
86
|
-
@allocation3 = stub :allocation3, :count => 2
|
84
|
+
@allocation1 = stub :allocation1, :count => 4, ids: [1, 2, 3, 4]
|
85
|
+
@allocation2 = stub :allocation2, :count => 3, ids: [5, 6, 7]
|
86
|
+
@allocation3 = stub :allocation3, :count => 2, ids: [8, 9]
|
87
87
|
@allocations = described_class.new [@allocation1, @allocation2, @allocation3]
|
88
88
|
end
|
89
89
|
describe 'lazy evaluation' do
|
@@ -93,18 +93,18 @@ describe Picky::Query::Allocations do
|
|
93
93
|
@offset = 1
|
94
94
|
end
|
95
95
|
it 'should call the process! method right' do
|
96
|
-
@allocation1.should_receive(:process!).once.with(5,1
|
97
|
-
@allocation2.should_receive(:process!).once.with(2,0
|
96
|
+
@allocation1.should_receive(:process!).once.with(5,1).and_return [2, 3, 4]
|
97
|
+
@allocation2.should_receive(:process!).once.with(2,0).and_return [5, 6]
|
98
98
|
@allocation3.should_receive(:process!).never
|
99
99
|
|
100
100
|
@allocations.process! @amount, @offset, 0
|
101
101
|
end
|
102
102
|
it 'should call the process! method right including unique' do
|
103
|
-
@allocation1.should_receive(:
|
104
|
-
@allocation2.should_receive(:
|
105
|
-
@allocation3.should_receive(:
|
103
|
+
@allocation1.should_receive(:process_with_illegals!).once.with(5,0,[]).and_return [2, 3, 4]
|
104
|
+
@allocation2.should_receive(:process_with_illegals!).once.with(2,0,[2,3,4]).and_return [5, 6]
|
105
|
+
@allocation3.should_receive(:process_with_illegals!).never
|
106
106
|
|
107
|
-
@allocations.
|
107
|
+
@allocations.process_unique! @amount, @offset, 0
|
108
108
|
end
|
109
109
|
end
|
110
110
|
context 'larger amount' do
|
@@ -113,7 +113,7 @@ describe Picky::Query::Allocations do
|
|
113
113
|
@offset = 0
|
114
114
|
end
|
115
115
|
it 'should call the process! method right' do
|
116
|
-
@allocation1.should_receive(:process!).once.with(1,0
|
116
|
+
@allocation1.should_receive(:process!).once.with(1,0).and_return [1]
|
117
117
|
@allocation2.should_receive(:process!).never
|
118
118
|
@allocation3.should_receive(:process!).never
|
119
119
|
|
@@ -126,9 +126,9 @@ describe Picky::Query::Allocations do
|
|
126
126
|
@offset = 1
|
127
127
|
end
|
128
128
|
it 'should call the process! method right' do
|
129
|
-
@allocation1.should_receive(:process!).once.with(5,1
|
130
|
-
@allocation2.should_receive(:process!).once.with(2,0
|
131
|
-
@allocation3.should_receive(:process!).once.with(0,0
|
129
|
+
@allocation1.should_receive(:process!).once.with(5,1).and_return [2, 3, 4]
|
130
|
+
@allocation2.should_receive(:process!).once.with(2,0).and_return [5, 6]
|
131
|
+
@allocation3.should_receive(:process!).once.with(0,0).and_return []
|
132
132
|
|
133
133
|
@allocations.process! @amount, @offset, 1
|
134
134
|
end
|
@@ -139,8 +139,8 @@ describe Picky::Query::Allocations do
|
|
139
139
|
@offset = 0
|
140
140
|
end
|
141
141
|
it 'should call the process! method right' do
|
142
|
-
@allocation1.should_receive(:process!).once.with(1,0
|
143
|
-
@allocation2.should_receive(:process!).once.with(0,0
|
142
|
+
@allocation1.should_receive(:process!).once.with(1,0).and_return [1]
|
143
|
+
@allocation2.should_receive(:process!).once.with(0,0).and_return []
|
144
144
|
@allocation3.should_receive(:process!).never
|
145
145
|
|
146
146
|
@allocations.process! @amount, @offset, 1
|
@@ -152,7 +152,7 @@ describe Picky::Query::Allocations do
|
|
152
152
|
@offset = 0
|
153
153
|
end
|
154
154
|
it 'should call the process! method right' do
|
155
|
-
@allocation1.should_receive(:process!).once.with(4,0
|
155
|
+
@allocation1.should_receive(:process!).once.with(4,0).and_return [1, 2, 3, 4]
|
156
156
|
@allocation2.should_receive(:process!).never
|
157
157
|
@allocation3.should_receive(:process!).never
|
158
158
|
|
@@ -165,8 +165,8 @@ describe Picky::Query::Allocations do
|
|
165
165
|
@offset = 0
|
166
166
|
end
|
167
167
|
it 'should call the process! method right' do
|
168
|
-
@allocation1.should_receive(:process!).once.with(4,0
|
169
|
-
@allocation2.should_receive(:process!).once.with(0,0
|
168
|
+
@allocation1.should_receive(:process!).once.with(4,0).and_return [1, 2, 3, 4]
|
169
|
+
@allocation2.should_receive(:process!).once.with(0,0).and_return []
|
170
170
|
@allocation3.should_receive(:process!).never
|
171
171
|
|
172
172
|
@allocations.process! @amount, @offset, 1
|
@@ -178,8 +178,8 @@ describe Picky::Query::Allocations do
|
|
178
178
|
@offset = 0
|
179
179
|
end
|
180
180
|
it 'should call the process! method right' do
|
181
|
-
@allocation1.should_receive(:process!).once.with(5,0
|
182
|
-
@allocation2.should_receive(:process!).once.with(1,0
|
181
|
+
@allocation1.should_receive(:process!).once.with(5,0).and_return [1, 2, 3, 4]
|
182
|
+
@allocation2.should_receive(:process!).once.with(1,0).and_return [5]
|
183
183
|
@allocation3.should_receive(:process!).never
|
184
184
|
|
185
185
|
@allocations.process! @amount, @offset, 0
|
@@ -191,9 +191,9 @@ describe Picky::Query::Allocations do
|
|
191
191
|
@offset = 0
|
192
192
|
end
|
193
193
|
it 'should call the process! method right' do
|
194
|
-
@allocation1.should_receive(:process!).once.with(5,0
|
195
|
-
@allocation2.should_receive(:process!).once.with(1,0
|
196
|
-
@allocation3.should_receive(:process!).once.with(0,0
|
194
|
+
@allocation1.should_receive(:process!).once.with(5,0).and_return [1, 2, 3, 4]
|
195
|
+
@allocation2.should_receive(:process!).once.with(1,0).and_return [5]
|
196
|
+
@allocation3.should_receive(:process!).once.with(0,0).and_return []
|
197
197
|
|
198
198
|
@allocations.process! @amount, @offset, 1
|
199
199
|
end
|
@@ -204,9 +204,9 @@ describe Picky::Query::Allocations do
|
|
204
204
|
@offset = 0
|
205
205
|
end
|
206
206
|
it 'should call the process! method right' do
|
207
|
-
@allocation1.should_receive(:process!).once.with(8,0
|
208
|
-
@allocation2.should_receive(:process!).once.with(4,0
|
209
|
-
@allocation3.should_receive(:process!).once.with(1,0
|
207
|
+
@allocation1.should_receive(:process!).once.with(8,0).and_return [1, 2, 3, 4]
|
208
|
+
@allocation2.should_receive(:process!).once.with(4,0).and_return [5, 6, 7]
|
209
|
+
@allocation3.should_receive(:process!).once.with(1,0).and_return [8]
|
210
210
|
|
211
211
|
@allocations.process! @amount, @offset, 1
|
212
212
|
end
|
@@ -218,9 +218,9 @@ describe Picky::Query::Allocations do
|
|
218
218
|
@offset = 2
|
219
219
|
end
|
220
220
|
it 'should call the process! method right' do
|
221
|
-
@allocation1.should_receive(:process!).once.with(6,2
|
222
|
-
@allocation2.should_receive(:process!).once.with(4,0
|
223
|
-
@allocation3.should_receive(:process!).once.with(1,0
|
221
|
+
@allocation1.should_receive(:process!).once.with(6,2).and_return [3,4]
|
222
|
+
@allocation2.should_receive(:process!).once.with(4,0).and_return [5,6,7]
|
223
|
+
@allocation3.should_receive(:process!).once.with(1,0).and_return [8]
|
224
224
|
|
225
225
|
@allocations.process! @amount, @offset
|
226
226
|
end
|
@@ -231,9 +231,9 @@ describe Picky::Query::Allocations do
|
|
231
231
|
@offset = 8
|
232
232
|
end
|
233
233
|
it 'should call the process! method right' do
|
234
|
-
@allocation1.should_receive(:process!).once.with(10,8
|
235
|
-
@allocation2.should_receive(:process!).once.with(10,4
|
236
|
-
@allocation3.should_receive(:process!).once.with(10,1
|
234
|
+
@allocation1.should_receive(:process!).once.with(10,8).and_return []
|
235
|
+
@allocation2.should_receive(:process!).once.with(10,4).and_return []
|
236
|
+
@allocation3.should_receive(:process!).once.with(10,1).and_return [9]
|
237
237
|
|
238
238
|
@allocations.process! @amount, @offset
|
239
239
|
end
|
@@ -243,9 +243,9 @@ describe Picky::Query::Allocations do
|
|
243
243
|
@amount = 0
|
244
244
|
end
|
245
245
|
it 'should return an empty array always' do
|
246
|
-
@allocation1.should_receive(:process!).once.with(0,0
|
247
|
-
@allocation2.should_receive(:process!).once.with(0,0
|
248
|
-
@allocation3.should_receive(:process!).once.with(0,0
|
246
|
+
@allocation1.should_receive(:process!).once.with(0,0).and_return []
|
247
|
+
@allocation2.should_receive(:process!).once.with(0,0).and_return []
|
248
|
+
@allocation3.should_receive(:process!).once.with(0,0).and_return []
|
249
249
|
|
250
250
|
@allocations.process! @amount
|
251
251
|
end
|
@@ -259,9 +259,9 @@ describe Picky::Query::Allocations do
|
|
259
259
|
@offset = 0
|
260
260
|
end
|
261
261
|
it 'should return certain ids' do
|
262
|
-
@allocation1.should_receive(:process!).once.with(3,0
|
263
|
-
@allocation2.should_receive(:process!).once.with(0,0
|
264
|
-
@allocation3.should_receive(:process!).once.with(0,0
|
262
|
+
@allocation1.should_receive(:process!).once.with(3,0).and_return [1,2,3]
|
263
|
+
@allocation2.should_receive(:process!).once.with(0,0).and_return []
|
264
|
+
@allocation3.should_receive(:process!).once.with(0,0).and_return []
|
265
265
|
|
266
266
|
@allocations.process! @amount, @offset
|
267
267
|
end
|
@@ -271,9 +271,9 @@ describe Picky::Query::Allocations do
|
|
271
271
|
@offset = 3
|
272
272
|
end
|
273
273
|
it 'should return certain ids' do
|
274
|
-
@allocation1.should_receive(:process!).once.with(3,3
|
275
|
-
@allocation2.should_receive(:process!).once.with(2,0
|
276
|
-
@allocation3.should_receive(:process!).once.with(0,0
|
274
|
+
@allocation1.should_receive(:process!).once.with(3,3).and_return [4]
|
275
|
+
@allocation2.should_receive(:process!).once.with(2,0).and_return [5,6]
|
276
|
+
@allocation3.should_receive(:process!).once.with(0,0).and_return []
|
277
277
|
|
278
278
|
@allocations.process! @amount, @offset
|
279
279
|
end
|
metadata
CHANGED
@@ -1,7 +1,7 @@
|
|
1
1
|
--- !ruby/object:Gem::Specification
|
2
2
|
name: picky
|
3
3
|
version: !ruby/object:Gem::Version
|
4
|
-
version: 4.4.
|
4
|
+
version: 4.4.1
|
5
5
|
prerelease:
|
6
6
|
platform: ruby
|
7
7
|
authors:
|
@@ -13,7 +13,7 @@ date: 2012-05-13 00:00:00.000000000 Z
|
|
13
13
|
dependencies:
|
14
14
|
- !ruby/object:Gem::Dependency
|
15
15
|
name: rspec
|
16
|
-
requirement: &
|
16
|
+
requirement: &70307499892700 !ruby/object:Gem::Requirement
|
17
17
|
none: false
|
18
18
|
requirements:
|
19
19
|
- - ! '>='
|
@@ -21,21 +21,21 @@ dependencies:
|
|
21
21
|
version: '0'
|
22
22
|
type: :development
|
23
23
|
prerelease: false
|
24
|
-
version_requirements: *
|
24
|
+
version_requirements: *70307499892700
|
25
25
|
- !ruby/object:Gem::Dependency
|
26
26
|
name: picky-client
|
27
|
-
requirement: &
|
27
|
+
requirement: &70307499891000 !ruby/object:Gem::Requirement
|
28
28
|
none: false
|
29
29
|
requirements:
|
30
30
|
- - ~>
|
31
31
|
- !ruby/object:Gem::Version
|
32
|
-
version: 4.4.
|
32
|
+
version: 4.4.1
|
33
33
|
type: :development
|
34
34
|
prerelease: false
|
35
|
-
version_requirements: *
|
35
|
+
version_requirements: *70307499891000
|
36
36
|
- !ruby/object:Gem::Dependency
|
37
37
|
name: text
|
38
|
-
requirement: &
|
38
|
+
requirement: &70307499888240 !ruby/object:Gem::Requirement
|
39
39
|
none: false
|
40
40
|
requirements:
|
41
41
|
- - ! '>='
|
@@ -43,10 +43,10 @@ dependencies:
|
|
43
43
|
version: '0'
|
44
44
|
type: :runtime
|
45
45
|
prerelease: false
|
46
|
-
version_requirements: *
|
46
|
+
version_requirements: *70307499888240
|
47
47
|
- !ruby/object:Gem::Dependency
|
48
48
|
name: yajl-ruby
|
49
|
-
requirement: &
|
49
|
+
requirement: &70307499901520 !ruby/object:Gem::Requirement
|
50
50
|
none: false
|
51
51
|
requirements:
|
52
52
|
- - ! '>='
|
@@ -54,10 +54,10 @@ dependencies:
|
|
54
54
|
version: '0'
|
55
55
|
type: :runtime
|
56
56
|
prerelease: false
|
57
|
-
version_requirements: *
|
57
|
+
version_requirements: *70307499901520
|
58
58
|
- !ruby/object:Gem::Dependency
|
59
59
|
name: activesupport
|
60
|
-
requirement: &
|
60
|
+
requirement: &70307499899220 !ruby/object:Gem::Requirement
|
61
61
|
none: false
|
62
62
|
requirements:
|
63
63
|
- - ~>
|
@@ -65,10 +65,10 @@ dependencies:
|
|
65
65
|
version: '3.0'
|
66
66
|
type: :runtime
|
67
67
|
prerelease: false
|
68
|
-
version_requirements: *
|
68
|
+
version_requirements: *70307499899220
|
69
69
|
- !ruby/object:Gem::Dependency
|
70
70
|
name: procrastinate
|
71
|
-
requirement: &
|
71
|
+
requirement: &70307499897140 !ruby/object:Gem::Requirement
|
72
72
|
none: false
|
73
73
|
requirements:
|
74
74
|
- - ~>
|
@@ -76,10 +76,10 @@ dependencies:
|
|
76
76
|
version: '0.4'
|
77
77
|
type: :runtime
|
78
78
|
prerelease: false
|
79
|
-
version_requirements: *
|
79
|
+
version_requirements: *70307499897140
|
80
80
|
- !ruby/object:Gem::Dependency
|
81
81
|
name: rack_fast_escape
|
82
|
-
requirement: &
|
82
|
+
requirement: &70307499895940 !ruby/object:Gem::Requirement
|
83
83
|
none: false
|
84
84
|
requirements:
|
85
85
|
- - ! '>='
|
@@ -87,7 +87,7 @@ dependencies:
|
|
87
87
|
version: '0'
|
88
88
|
type: :runtime
|
89
89
|
prerelease: false
|
90
|
-
version_requirements: *
|
90
|
+
version_requirements: *70307499895940
|
91
91
|
description: Fast Ruby semantic text search engine with comfortable single field interface.
|
92
92
|
email: florian.hanke+picky@gmail.com
|
93
93
|
executables:
|