aproxacs-s3sync 1.3.5 → 1.3.6
Sign up to get free protection for your applications and to get access to all the features.
- data/VERSION +1 -1
- data/bin/s3sync +1 -1
- metadata +3 -5
- data/lib/s3sync/thread_generator.rb +0 -383
- data/lib/version.rb +0 -9
data/VERSION
CHANGED
@@ -1 +1 @@
|
|
1
|
-
1.3.
|
1
|
+
1.3.6
|
data/bin/s3sync
CHANGED
@@ -508,7 +508,7 @@ ENDUSAGE
|
|
508
508
|
headers['Expires'] = $S3syncOptions['--expires'] if $S3syncOptions['--expires']
|
509
509
|
headers['Cache-Control'] = $S3syncOptions['--cache-control'] if $S3syncOptions['--cache-control']
|
510
510
|
fType = @path.split('.').last
|
511
|
-
if $S3syncOptions['--gzip'].split(",").include? fType
|
511
|
+
if ($S3syncOptions['--gzip'] || "gz").split(",").include? fType
|
512
512
|
headers['Content-Encoding'] = "gzip"
|
513
513
|
fType = @path.split('.')[-2]
|
514
514
|
end
|
metadata
CHANGED
@@ -5,8 +5,8 @@ version: !ruby/object:Gem::Version
|
|
5
5
|
segments:
|
6
6
|
- 1
|
7
7
|
- 3
|
8
|
-
-
|
9
|
-
version: 1.3.
|
8
|
+
- 6
|
9
|
+
version: 1.3.6
|
10
10
|
platform: ruby
|
11
11
|
authors:
|
12
12
|
- aproxacs
|
@@ -14,7 +14,7 @@ autorequire:
|
|
14
14
|
bindir: bin
|
15
15
|
cert_chain: []
|
16
16
|
|
17
|
-
date: 2010-
|
17
|
+
date: 2010-12-05 00:00:00 +09:00
|
18
18
|
default_executable:
|
19
19
|
dependencies: []
|
20
20
|
|
@@ -46,8 +46,6 @@ files:
|
|
46
46
|
- lib/s3sync/S3encoder.rb
|
47
47
|
- lib/s3sync/s3config.rb
|
48
48
|
- lib/s3sync/s3try.rb
|
49
|
-
- lib/s3sync/thread_generator.rb
|
50
|
-
- lib/version.rb
|
51
49
|
- script/console
|
52
50
|
- script/destroy
|
53
51
|
- script/generate
|
@@ -1,383 +0,0 @@
|
|
1
|
-
#!/usr/bin/env ruby
|
2
|
-
#--
|
3
|
-
# $Idaemons: /home/cvs/rb/generator.rb,v 1.8 2001/10/03 08:54:32 knu Exp $
|
4
|
-
# $RoughId: generator.rb,v 1.10 2003/10/14 19:36:58 knu Exp $
|
5
|
-
# $Id: generator.rb,v 1.12 2005/12/31 02:56:46 ocean Exp $
|
6
|
-
#++
|
7
|
-
#
|
8
|
-
# = generator.rb: convert an internal iterator to an external one
|
9
|
-
#
|
10
|
-
# Copyright (c) 2001,2003 Akinori MUSHA <knu@iDaemons.org>
|
11
|
-
#
|
12
|
-
# All rights reserved. You can redistribute and/or modify it under
|
13
|
-
# the same terms as Ruby.
|
14
|
-
#
|
15
|
-
# == Overview
|
16
|
-
#
|
17
|
-
# This library provides the Generator class, which converts an
|
18
|
-
# internal iterator (i.e. an Enumerable object) to an external
|
19
|
-
# iterator. In that form, you can roll many iterators independently.
|
20
|
-
#
|
21
|
-
# The SyncEnumerator class, which is implemented using Generator,
|
22
|
-
# makes it easy to roll many Enumerable objects synchronously.
|
23
|
-
#
|
24
|
-
# See the respective classes for examples of usage.
|
25
|
-
|
26
|
-
|
27
|
-
#
|
28
|
-
# Generator converts an internal iterator (i.e. an Enumerable object)
|
29
|
-
# to an external iterator.
|
30
|
-
#
|
31
|
-
# == Example
|
32
|
-
#
|
33
|
-
# require 'generator'
|
34
|
-
#
|
35
|
-
# # Generator from an Enumerable object
|
36
|
-
# g = Generator.new(['A', 'B', 'C', 'Z'])
|
37
|
-
#
|
38
|
-
# while g.next?
|
39
|
-
# puts g.next
|
40
|
-
# end
|
41
|
-
#
|
42
|
-
# # Generator from a block
|
43
|
-
# g = Generator.new { |g|
|
44
|
-
# for i in 'A'..'C'
|
45
|
-
# g.yield i
|
46
|
-
# end
|
47
|
-
#
|
48
|
-
# g.yield 'Z'
|
49
|
-
# }
|
50
|
-
#
|
51
|
-
# # The same result as above
|
52
|
-
# while g.next?
|
53
|
-
# puts g.next
|
54
|
-
# end
|
55
|
-
#
|
56
|
-
class Generator
|
57
|
-
include Enumerable
|
58
|
-
|
59
|
-
# Creates a new generator either from an Enumerable object or from a
|
60
|
-
# block.
|
61
|
-
#
|
62
|
-
# In the former, block is ignored even if given.
|
63
|
-
#
|
64
|
-
# In the latter, the given block is called with the generator
|
65
|
-
# itself, and expected to call the +yield+ method for each element.
|
66
|
-
def initialize(enum = nil, &block)
|
67
|
-
if enum
|
68
|
-
@block = proc{|g| enum.each{|value| g.yield value}}
|
69
|
-
else
|
70
|
-
@block = block
|
71
|
-
end
|
72
|
-
@index = 0
|
73
|
-
@queue = []
|
74
|
-
@main_thread = nil
|
75
|
-
@loop_thread.kill if defined?(@loop_thread)
|
76
|
-
@loop_thread = Thread.new do
|
77
|
-
Thread.stop
|
78
|
-
begin
|
79
|
-
@block.call(self)
|
80
|
-
rescue
|
81
|
-
@main_thread.raise $!
|
82
|
-
ensure
|
83
|
-
@main_thread.wakeup
|
84
|
-
end
|
85
|
-
end
|
86
|
-
Thread.pass until @loop_thread.stop?
|
87
|
-
self
|
88
|
-
end
|
89
|
-
|
90
|
-
# Yields an element to the generator.
|
91
|
-
def yield(value)
|
92
|
-
if Thread.current != @loop_thread
|
93
|
-
raise "should be called in Generator.new{|g| ... }"
|
94
|
-
end
|
95
|
-
Thread.critical = true if Thread.respond_to? :critical
|
96
|
-
begin
|
97
|
-
@queue << value
|
98
|
-
@main_thread.wakeup
|
99
|
-
Thread.stop
|
100
|
-
ensure
|
101
|
-
Thread.critical = true if Thread.respond_to? :critical
|
102
|
-
end
|
103
|
-
self
|
104
|
-
end
|
105
|
-
|
106
|
-
# Returns true if the generator has reached the end.
|
107
|
-
def end?
|
108
|
-
if @queue.empty?
|
109
|
-
if @main_thread
|
110
|
-
raise "should not be called in Generator.new{|g| ... }"
|
111
|
-
end
|
112
|
-
Thread.critical = true if Thread.respond_to? :critical
|
113
|
-
begin
|
114
|
-
@main_thread = Thread.current
|
115
|
-
@loop_thread.wakeup
|
116
|
-
Thread.stop
|
117
|
-
rescue ThreadError
|
118
|
-
# ignore
|
119
|
-
ensure
|
120
|
-
@main_thread = nil
|
121
|
-
Thread.critical = false if Thread.respond_to? :critical
|
122
|
-
end
|
123
|
-
end
|
124
|
-
@queue.empty?
|
125
|
-
end
|
126
|
-
|
127
|
-
# Returns true if the generator has not reached the end yet.
|
128
|
-
def next?
|
129
|
-
!end?
|
130
|
-
end
|
131
|
-
|
132
|
-
# Returns the current index (position) counting from zero.
|
133
|
-
def index
|
134
|
-
@index
|
135
|
-
end
|
136
|
-
|
137
|
-
# Returns the current index (position) counting from zero.
|
138
|
-
def pos
|
139
|
-
@index
|
140
|
-
end
|
141
|
-
|
142
|
-
# Returns the element at the current position and moves forward.
|
143
|
-
def next
|
144
|
-
raise EOFError.new("no more elements available") if end?
|
145
|
-
@index += 1
|
146
|
-
@queue.shift
|
147
|
-
end
|
148
|
-
|
149
|
-
# Returns the element at the current position.
|
150
|
-
def current
|
151
|
-
raise EOFError.new("no more elements available") if end?
|
152
|
-
@queue.first
|
153
|
-
end
|
154
|
-
|
155
|
-
# Rewinds the generator.
|
156
|
-
def rewind
|
157
|
-
initialize(nil, &@block) if @index.nonzero?
|
158
|
-
self
|
159
|
-
end
|
160
|
-
|
161
|
-
# Rewinds the generator and enumerates the elements.
|
162
|
-
def each
|
163
|
-
rewind
|
164
|
-
until end?
|
165
|
-
yield self.next
|
166
|
-
end
|
167
|
-
self
|
168
|
-
end
|
169
|
-
end
|
170
|
-
|
171
|
-
#
|
172
|
-
# SyncEnumerator creates an Enumerable object from multiple Enumerable
|
173
|
-
# objects and enumerates them synchronously.
|
174
|
-
#
|
175
|
-
# == Example
|
176
|
-
#
|
177
|
-
# require 'generator'
|
178
|
-
#
|
179
|
-
# s = SyncEnumerator.new([1,2,3], ['a', 'b', 'c'])
|
180
|
-
#
|
181
|
-
# # Yields [1, 'a'], [2, 'b'], and [3,'c']
|
182
|
-
# s.each { |row| puts row.join(', ') }
|
183
|
-
#
|
184
|
-
class SyncEnumerator
|
185
|
-
include Enumerable
|
186
|
-
|
187
|
-
# Creates a new SyncEnumerator which enumerates rows of given
|
188
|
-
# Enumerable objects.
|
189
|
-
def initialize(*enums)
|
190
|
-
@gens = enums.map { |e| Generator.new(e) }
|
191
|
-
end
|
192
|
-
|
193
|
-
# Returns the number of enumerated Enumerable objects, i.e. the size
|
194
|
-
# of each row.
|
195
|
-
def size
|
196
|
-
@gens.size
|
197
|
-
end
|
198
|
-
|
199
|
-
# Returns the number of enumerated Enumerable objects, i.e. the size
|
200
|
-
# of each row.
|
201
|
-
def length
|
202
|
-
@gens.length
|
203
|
-
end
|
204
|
-
|
205
|
-
# Returns true if the given nth Enumerable object has reached the
|
206
|
-
# end. If no argument is given, returns true if any of the
|
207
|
-
# Enumerable objects has reached the end.
|
208
|
-
def end?(i = nil)
|
209
|
-
if i.nil?
|
210
|
-
@gens.detect { |g| g.end? } ? true : false
|
211
|
-
else
|
212
|
-
@gens[i].end?
|
213
|
-
end
|
214
|
-
end
|
215
|
-
|
216
|
-
# Enumerates rows of the Enumerable objects.
|
217
|
-
def each
|
218
|
-
@gens.each { |g| g.rewind }
|
219
|
-
|
220
|
-
loop do
|
221
|
-
count = 0
|
222
|
-
|
223
|
-
ret = @gens.map { |g|
|
224
|
-
if g.end?
|
225
|
-
count += 1
|
226
|
-
nil
|
227
|
-
else
|
228
|
-
g.next
|
229
|
-
end
|
230
|
-
}
|
231
|
-
|
232
|
-
if count == @gens.size
|
233
|
-
break
|
234
|
-
end
|
235
|
-
|
236
|
-
yield ret
|
237
|
-
end
|
238
|
-
|
239
|
-
self
|
240
|
-
end
|
241
|
-
end
|
242
|
-
|
243
|
-
if $0 == __FILE__
|
244
|
-
eval DATA.read, nil, $0, __LINE__+4
|
245
|
-
end
|
246
|
-
|
247
|
-
__END__
|
248
|
-
|
249
|
-
require 'test/unit'
|
250
|
-
|
251
|
-
class TC_Generator < Test::Unit::TestCase
|
252
|
-
def test_block1
|
253
|
-
g = Generator.new { |g|
|
254
|
-
# no yield's
|
255
|
-
}
|
256
|
-
|
257
|
-
assert_equal(0, g.pos)
|
258
|
-
assert_raises(EOFError) { g.current }
|
259
|
-
end
|
260
|
-
|
261
|
-
def test_block2
|
262
|
-
g = Generator.new { |g|
|
263
|
-
for i in 'A'..'C'
|
264
|
-
g.yield i
|
265
|
-
end
|
266
|
-
|
267
|
-
g.yield 'Z'
|
268
|
-
}
|
269
|
-
|
270
|
-
assert_equal(0, g.pos)
|
271
|
-
assert_equal('A', g.current)
|
272
|
-
|
273
|
-
assert_equal(true, g.next?)
|
274
|
-
assert_equal(0, g.pos)
|
275
|
-
assert_equal('A', g.current)
|
276
|
-
assert_equal(0, g.pos)
|
277
|
-
assert_equal('A', g.next)
|
278
|
-
|
279
|
-
assert_equal(1, g.pos)
|
280
|
-
assert_equal(true, g.next?)
|
281
|
-
assert_equal(1, g.pos)
|
282
|
-
assert_equal('B', g.current)
|
283
|
-
assert_equal(1, g.pos)
|
284
|
-
assert_equal('B', g.next)
|
285
|
-
|
286
|
-
assert_equal(g, g.rewind)
|
287
|
-
|
288
|
-
assert_equal(0, g.pos)
|
289
|
-
assert_equal('A', g.current)
|
290
|
-
|
291
|
-
assert_equal(true, g.next?)
|
292
|
-
assert_equal(0, g.pos)
|
293
|
-
assert_equal('A', g.current)
|
294
|
-
assert_equal(0, g.pos)
|
295
|
-
assert_equal('A', g.next)
|
296
|
-
|
297
|
-
assert_equal(1, g.pos)
|
298
|
-
assert_equal(true, g.next?)
|
299
|
-
assert_equal(1, g.pos)
|
300
|
-
assert_equal('B', g.current)
|
301
|
-
assert_equal(1, g.pos)
|
302
|
-
assert_equal('B', g.next)
|
303
|
-
|
304
|
-
assert_equal(2, g.pos)
|
305
|
-
assert_equal(true, g.next?)
|
306
|
-
assert_equal(2, g.pos)
|
307
|
-
assert_equal('C', g.current)
|
308
|
-
assert_equal(2, g.pos)
|
309
|
-
assert_equal('C', g.next)
|
310
|
-
|
311
|
-
assert_equal(3, g.pos)
|
312
|
-
assert_equal(true, g.next?)
|
313
|
-
assert_equal(3, g.pos)
|
314
|
-
assert_equal('Z', g.current)
|
315
|
-
assert_equal(3, g.pos)
|
316
|
-
assert_equal('Z', g.next)
|
317
|
-
|
318
|
-
assert_equal(4, g.pos)
|
319
|
-
assert_equal(false, g.next?)
|
320
|
-
assert_raises(EOFError) { g.next }
|
321
|
-
end
|
322
|
-
|
323
|
-
def test_each
|
324
|
-
a = [5, 6, 7, 8, 9]
|
325
|
-
|
326
|
-
g = Generator.new(a)
|
327
|
-
|
328
|
-
i = 0
|
329
|
-
|
330
|
-
g.each { |x|
|
331
|
-
assert_equal(a[i], x)
|
332
|
-
|
333
|
-
i += 1
|
334
|
-
|
335
|
-
break if i == 3
|
336
|
-
}
|
337
|
-
|
338
|
-
assert_equal(3, i)
|
339
|
-
|
340
|
-
i = 0
|
341
|
-
|
342
|
-
g.each { |x|
|
343
|
-
assert_equal(a[i], x)
|
344
|
-
|
345
|
-
i += 1
|
346
|
-
}
|
347
|
-
|
348
|
-
assert_equal(5, i)
|
349
|
-
end
|
350
|
-
end
|
351
|
-
|
352
|
-
class TC_SyncEnumerator < Test::Unit::TestCase
|
353
|
-
def test_each
|
354
|
-
r = ['a'..'f', 1..10, 10..20]
|
355
|
-
ra = r.map { |x| x.to_a }
|
356
|
-
|
357
|
-
a = (0...(ra.map {|x| x.size}.max)).map { |i| ra.map { |x| x[i] } }
|
358
|
-
|
359
|
-
s = SyncEnumerator.new(*r)
|
360
|
-
|
361
|
-
i = 0
|
362
|
-
|
363
|
-
s.each { |x|
|
364
|
-
assert_equal(a[i], x)
|
365
|
-
|
366
|
-
i += 1
|
367
|
-
|
368
|
-
break if i == 3
|
369
|
-
}
|
370
|
-
|
371
|
-
assert_equal(3, i)
|
372
|
-
|
373
|
-
i = 0
|
374
|
-
|
375
|
-
s.each { |x|
|
376
|
-
assert_equal(a[i], x)
|
377
|
-
|
378
|
-
i += 1
|
379
|
-
}
|
380
|
-
|
381
|
-
assert_equal(a.size, i)
|
382
|
-
end
|
383
|
-
end
|