use ::Array not Concurrent::Array

ruby-concurrency · Jul 7, 2018 · aaeaef9 · aaeaef9
1 parent 141e959
commit aaeaef9
Show file tree

Hide file tree

Showing 3 changed files with 4 additions and 4 deletions.
diff --git a/lib/concurrent/collection/map/atomic_reference_map_backend.rb b/lib/concurrent/collection/map/atomic_reference_map_backend.rb
@@ -831,7 +831,7 @@ def rebuild(table)
             # no lock needed (or available) if bin >= 0, because we're not popping values from locked_indexes until we've run through the whole table
             redo unless (bin >= 0 ? table.cas(i, nil, forwarder) : lock_and_clean_up_reverse_forwarders(table, old_table_size, new_table, i, forwarder))
           elsif Node.locked_hash?(node_hash = node.hash)
-            locked_indexes ||= Array.new
+            locked_indexes ||= ::Array.new
             if bin < 0 && locked_arr_idx > 0
               locked_arr_idx -= 1
               i, locked_indexes[locked_arr_idx] = locked_indexes[locked_arr_idx], i # swap with another bin

diff --git a/lib/concurrent/edge/promises.rb b/lib/concurrent/edge/promises.rb
@@ -1797,8 +1797,8 @@ def process_on_blocker_resolution(future, index)
 
       def on_resolvable(resolved_future, index)
         all_fulfilled = true
-        values        = Array.new(@Resolutions.size)
-        reasons       = Array.new(@Resolutions.size)
+        values        = ::Array.new(@Resolutions.size)
+        reasons       = ::Array.new(@Resolutions.size)
 
         @Resolutions.each_with_index do |internal_state, i|
           fulfilled, values[i], reasons[i] = internal_state.result

diff --git a/lib/concurrent/tuple.rb b/lib/concurrent/tuple.rb
@@ -24,7 +24,7 @@ class Tuple
     attr_reader :size
 
     # @!visibility private
-    Tuple = defined?(Rubinius::Tuple) ? Rubinius::Tuple : Array
+    Tuple = defined?(Rubinius::Tuple) ? Rubinius::Tuple : ::Array
     private_constant :Tuple
 
     # Create a new tuple of the given size.