Module: PMap
- Included in:
- Enumerable
- Defined in:
- lib/pmap.rb
Defined Under Namespace
Classes: DummyOutput
Class Method Summary collapse
Class Method Details
.included(base) ⇒ Object
12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 |
# File 'lib/pmap.rb', line 12 def self.included(base) base.class_eval do # Parallel "map" for any Enumerable. # Requires a block of code to run for each Enumerable item. # [thread_count] is number of threads to create. Optional. def pmap(thread_count=nil, &proc) in_array = self.to_a # I'm not sure how expensive this is... out_array = Array.new(in_array.size) process_core(thread_count, in_array, out_array, &proc) out_array end def process_core(thread_count, in_array, out_array, &proc) thread_count = thread_count(thread_count, in_array) size = in_array.size semaphore = Mutex.new index = -1 # Our use of index is protected by semaphore threads = (0...thread_count).map { Thread.new { i = nil while (semaphore.synchronize {i = (index += 1)}; i < size) out_array[i] = yield(in_array[i]) end } } threads.each {|t| t.join} end private :process_core def thread_count(user_requested_count, items) user_requested_count ||= $pmap_default_thread_count raise ArgumentError, "thread_count must be at least one." unless user_requested_count.respond_to?(:>=) && user_requested_count >= 1 [user_requested_count, items.size].min end private :thread_count # Parallel "each" for any Enumerable. # Requires a block of code to run for each Enumerable item. # [thread_count] is number of threads to create. Optional. def peach(thread_count=nil, &proc) process_core(thread_count, self.to_a, DummyOutput.new, &proc) self end end end |