logstash-filter-cache-redis 0.1.0 → 0.2.0

data/vendor/bundle/jruby/1.9/gems/concurrent-ruby-1.0.0-java/lib/concurrent/executor/thread_pool_executor.rb

@@ -1,81 +0,0 @@
-require 'concurrent/utility/engine'
-require 'concurrent/executor/ruby_thread_pool_executor'
-
-module Concurrent
-
-  if Concurrent.on_jruby?
-    require 'concurrent/executor/java_thread_pool_executor'
-  end
-
-  ThreadPoolExecutorImplementation = case
-                                     when Concurrent.on_jruby?
-                                       JavaThreadPoolExecutor
-                                     else
-                                       RubyThreadPoolExecutor
-                                     end
-  private_constant :ThreadPoolExecutorImplementation
-
-  # @!macro [attach] thread_pool_executor
-  #
-  #   An abstraction composed of one or more threads and a task queue. Tasks
-  #   (blocks or `proc` objects) are submit to the pool and added to the queue.
-  #   The threads in the pool remove the tasks and execute them in the order
-  #   they were received. When there are more tasks queued than there are
-  #   threads to execute them the pool will create new threads, up to the
-  #   configured maximum. Similarly, threads that are idle for too long will
-  #   be garbage collected, down to the configured minimum options. Should a
-  #   thread crash it, too, will be garbage collected.
-  #
-  #   `ThreadPoolExecutor` is based on the Java class of the same name. From
-  #   the official Java documentationa;
-  #
-  #   > Thread pools address two different problems: they usually provide
-  #   > improved performance when executing large numbers of asynchronous tasks,
-  #   > due to reduced per-task invocation overhead, and they provide a means
-  #   > of bounding and managing the resources, including threads, consumed
-  #   > when executing a collection of tasks. Each ThreadPoolExecutor also
-  #   > maintains some basic statistics, such as the number of completed tasks.
-  #   >
-  #   > To be useful across a wide range of contexts, this class provides many
-  #   > adjustable parameters and extensibility hooks. However, programmers are
-  #   > urged to use the more convenient Executors factory methods
-  #   > [CachedThreadPool] (unbounded thread pool, with automatic thread reclamation),
-  #   > [FixedThreadPool] (fixed size thread pool) and [SingleThreadExecutor] (single
-  #   > background thread), that preconfigure settings for the most common usage
-  #   > scenarios.
-  #
-  # @!macro thread_pool_options
-  #
-  # @!macro thread_pool_executor_public_api
-  class ThreadPoolExecutor < ThreadPoolExecutorImplementation
-
-    # @!macro [new] thread_pool_executor_method_initialize
-    #
-    #   Create a new thread pool.
-    #  
-    #   @param [Hash] opts the options which configure the thread pool.
-    #  
-    #   @option opts [Integer] :max_threads (DEFAULT_MAX_POOL_SIZE) the maximum
-    #     number of threads to be created
-    #   @option opts [Integer] :min_threads (DEFAULT_MIN_POOL_SIZE) the minimum
-    #     number of threads to be retained
-    #   @option opts [Integer] :idletime (DEFAULT_THREAD_IDLETIMEOUT) the maximum
-    #     number of seconds a thread may be idle before being reclaimed
-    #   @option opts [Integer] :max_queue (DEFAULT_MAX_QUEUE_SIZE) the maximum
-    #     number of tasks allowed in the work queue at any one time; a value of
-    #     zero means the queue may grow without bound
-    #   @option opts [Symbol] :fallback_policy (:abort) the policy for handling new
-    #     tasks that are received when the queue size has reached
-    #     `max_queue` or the executor has shut down
-    #  
-    #   @raise [ArgumentError] if `:max_threads` is less than one
-    #   @raise [ArgumentError] if `:min_threads` is less than zero
-    #   @raise [ArgumentError] if `:fallback_policy` is not one of the values specified
-    #     in `FALLBACK_POLICIES`
-    #  
-    #   @see http://docs.oracle.com/javase/7/docs/api/java/util/concurrent/ThreadPoolExecutor.html
-
-    # @!method initialize(opts = {})
-    #   @!macro thread_pool_executor_method_initialize
-  end
-end

data/vendor/bundle/jruby/1.9/gems/concurrent-ruby-1.0.0-java/lib/concurrent/executor/timer_set.rb

@@ -1,164 +0,0 @@
-require 'concurrent/scheduled_task'
-require 'concurrent/atomic/event'
-require 'concurrent/collection/non_concurrent_priority_queue'
-require 'concurrent/executor/executor_service'
-require 'concurrent/executor/single_thread_executor'
-
-module Concurrent
-
-  autoload :Options, 'concurrent/options'
-
-  # Executes a collection of tasks, each after a given delay. A master task
-  # monitors the set and schedules each task for execution at the appropriate
-  # time. Tasks are run on the global thread pool or on the supplied executor.
-  # Each task is represented as a `ScheduledTask`.
-  #
-  # @see Concurrent::ScheduledTask
-  #
-  # @!macro monotonic_clock_warning
-  class TimerSet < RubyExecutorService
-
-    # Create a new set of timed tasks.
-    #
-    # @!macro [attach] executor_options
-    #  
-    #   @param [Hash] opts the options used to specify the executor on which to perform actions
-    #   @option opts [Executor] :executor when set use the given `Executor` instance.
-    #     Three special values are also supported: `:task` returns the global task pool,
-    #     `:operation` returns the global operation pool, and `:immediate` returns a new
-    #     `ImmediateExecutor` object.
-    def initialize(opts = {})
-      super(opts)
-    end
-
-    # Post a task to be execute run after a given delay (in seconds). If the
-    # delay is less than 1/100th of a second the task will be immediately post
-    # to the executor.
-    #
-    # @param [Float] delay the number of seconds to wait for before executing the task.
-    # @param [Array<Object>] args the arguments passed to the task on execution.
-    #
-    # @yield the task to be performed.
-    #
-    # @return [Concurrent::ScheduledTask, false] IVar representing the task if the post
-    #   is successful; false after shutdown.
-    #
-    # @raise [ArgumentError] if the intended execution time is not in the future.
-    # @raise [ArgumentError] if no block is given.
-    def post(delay, *args, &task)
-      raise ArgumentError.new('no block given') unless block_given?
-      return false unless running?
-      opts = {
-        executor: @task_executor,
-        args: args,
-        timer_set: self
-      }
-      task = ScheduledTask.execute(delay, opts, &task) # may raise exception
-      task.unscheduled? ? false : task
-    end
-
-    # Begin an immediate shutdown. In-progress tasks will be allowed to
-    # complete but enqueued tasks will be dismissed and no new tasks
-    # will be accepted. Has no additional effect if the thread pool is
-    # not running.
-    def kill
-      shutdown
-    end
-
-    private :<<
-
-    private
-
-    # Initialize the object.
-    #
-    # @param [Hash] opts the options to create the object with.
-    # @!visibility private
-    def ns_initialize(opts)
-      @queue          = Collection::NonConcurrentPriorityQueue.new(order: :min)
-      @task_executor  = Options.executor_from_options(opts) || Concurrent.global_io_executor
-      @timer_executor = SingleThreadExecutor.new
-      @condition      = Event.new
-      self.auto_terminate = opts.fetch(:auto_terminate, true)
-    end
-
-    # Post the task to the internal queue.
-    #
-    # @note This is intended as a callback method from ScheduledTask
-    #   only. It is not intended to be used directly. Post a task
-    #   by using the `SchedulesTask#execute` method.
-    #
-    # @!visibility private
-    def post_task(task)
-      synchronize{ ns_post_task(task) }
-    end
-
-    # @!visibility private
-    def ns_post_task(task)
-      return false unless ns_running?
-      if (task.initial_delay) <= 0.01
-        task.executor.post{ task.process_task }
-      else
-        @queue.push(task)
-        # only post the process method when the queue is empty
-        @timer_executor.post(&method(:process_tasks)) if @queue.length == 1
-        @condition.set
-      end
-      true
-    end
-
-    # Remove the given task from the queue.
-    #
-    # @note This is intended as a callback method from `ScheduledTask`
-    #   only. It is not intended to be used directly. Cancel a task
-    #   by using the `ScheduledTask#cancel` method.
-    #
-    # @!visibility private
-    def remove_task(task)
-      synchronize{ @queue.delete(task) }
-    end
-
-    # `ExecutorService` callback called during shutdown.
-    #
-    # @!visibility private
-    def ns_shutdown_execution
-      @queue.clear
-      @timer_executor.kill
-      stopped_event.set
-    end
-
-    # Run a loop and execute tasks in the scheduled order and at the approximate
-    # scheduled time. If no tasks remain the thread will exit gracefully so that
-    # garbage collection can occur. If there are no ready tasks it will sleep
-    # for up to 60 seconds waiting for the next scheduled task.
-    #
-    # @!visibility private
-    def process_tasks
-      loop do
-        task = synchronize { @condition.reset; @queue.peek }
-        break unless task
-
-        now = Concurrent.monotonic_time
-        diff = task.schedule_time - now
-
-        if diff <= 0
-          # We need to remove the task from the queue before passing
-          # it to the executor, to avoid race conditions where we pass
-          # the peek'ed task to the executor and then pop a different
-          # one that's been added in the meantime.
-          #
-          # Note that there's no race condition between the peek and
-          # this pop - this pop could retrieve a different task from
-          # the peek, but that task would be due to fire now anyway
-          # (because @queue is a priority queue, and this thread is
-          # the only reader, so whatever timer is at the head of the
-          # queue now must have the same pop time, or a closer one, as
-          # when we peeked).
-          task = synchronize { @queue.pop }
-          task.executor.post{ task.process_task }
-        else
-          @condition.wait([diff, 60].min)
-        end
-      end
-    end
-  end
-end

data/vendor/bundle/jruby/1.9/gems/concurrent-ruby-1.0.0-java/lib/concurrent/future.rb

@@ -1,138 +0,0 @@
-require 'thread'
-require 'concurrent/constants'
-require 'concurrent/errors'
-require 'concurrent/ivar'
-require 'concurrent/executor/safe_task_executor'
-
-module Concurrent
-
-  autoload :Options, 'concurrent/options'
-
-  # {include:file:doc/future.md}
-  #
-  # @!macro copy_options
-  #
-  # @see http://ruby-doc.org/stdlib-2.1.1/libdoc/observer/rdoc/Observable.html Ruby Observable module
-  # @see http://clojuredocs.org/clojure_core/clojure.core/future Clojure's future function
-  # @see http://docs.oracle.com/javase/7/docs/api/java/util/concurrent/Future.html java.util.concurrent.Future
-  class Future < IVar
-
-    # Create a new `Future` in the `:unscheduled` state.
-    #
-    # @yield the asynchronous operation to perform
-    #
-    # @!macro executor_and_deref_options
-    #
-    # @option opts [object, Array] :args zero or more arguments to be passed the task
-    #   block on execution
-    #
-    # @raise [ArgumentError] if no block is given
-    def initialize(opts = {}, &block)
-      raise ArgumentError.new('no block given') unless block_given?
-      super(NULL, opts.merge(__task_from_block__: block), &nil)
-    end
-
-    # Execute an `:unscheduled` `Future`. Immediately sets the state to `:pending` and
-    # passes the block to a new thread/thread pool for eventual execution.
-    # Does nothing if the `Future` is in any state other than `:unscheduled`.
-    #
-    # @return [Future] a reference to `self`
-    #
-    # @example Instance and execute in separate steps
-    #   future = Concurrent::Future.new{ sleep(1); 42 }
-    #   future.state #=> :unscheduled
-    #   future.execute
-    #   future.state #=> :pending
-    #
-    # @example Instance and execute in one line
-    #   future = Concurrent::Future.new{ sleep(1); 42 }.execute
-    #   future.state #=> :pending
-    def execute
-      if compare_and_set_state(:pending, :unscheduled)
-        @executor.post{ safe_execute(@task, @args) }
-        self
-      end
-    end
-
-    # Create a new `Future` object with the given block, execute it, and return the
-    # `:pending` object.
-    #
-    # @yield the asynchronous operation to perform
-    #
-    # @!macro executor_and_deref_options
-    #
-    # @option opts [object, Array] :args zero or more arguments to be passed the task
-    #   block on execution
-    #
-    # @raise [ArgumentError] if no block is given
-    #
-    # @return [Future] the newly created `Future` in the `:pending` state
-    #
-    # @example
-    #   future = Concurrent::Future.execute{ sleep(1); 42 }
-    #   future.state #=> :pending
-    def self.execute(opts = {}, &block)
-      Future.new(opts, &block).execute
-    end
-
-    # @!macro ivar_set_method
-    def set(value = NULL, &block)
-      check_for_block_or_value!(block_given?, value)
-      synchronize do
-        if @state != :unscheduled
-          raise MultipleAssignmentError
-        else
-          @task = block || Proc.new { value }
-        end
-      end
-      execute
-    end
-
-    # Attempt to cancel the operation if it has not already processed.
-    # The operation can only be cancelled while still `pending`. It cannot
-    # be cancelled once it has begun processing or has completed.
-    #
-    # @return [Boolean] was the operation successfully cancelled.
-    def cancel
-      if compare_and_set_state(:cancelled, :pending)
-        complete(false, nil, CancelledOperationError.new)
-        true
-      else
-        false
-      end
-    end
-
-    # Has the operation been successfully cancelled?
-    #
-    # @return [Boolean]
-    def cancelled?
-      state == :cancelled
-    end
-
-    # Wait the given number of seconds for the operation to complete.
-    # On timeout attempt to cancel the operation.
-    #
-    # @param [Numeric] timeout the maximum time in seconds to wait.
-    # @return [Boolean] true if the operation completed before the timeout
-    #   else false
-    def wait_or_cancel(timeout)
-      wait(timeout)
-      if complete?
-        true
-      else
-        cancel
-        false
-      end
-    end
-
-    protected
-
-    def ns_initialize(value, opts)
-      super
-      @state = :unscheduled
-      @task = opts[:__task_from_block__]
-      @executor = Options.executor_from_options(opts) || Concurrent.global_io_executor
-      @args = get_arguments_from(opts)
-    end
-  end
-end

data/vendor/bundle/jruby/1.9/gems/concurrent-ruby-1.0.0-java/lib/concurrent/hash.rb

@@ -1,35 +0,0 @@
-require 'concurrent/utility/engine'
-require 'concurrent/thread_safe/util'
-
-module Concurrent
-  if Concurrent.on_cruby?
-
-    # @!macro [attach] concurrent_hash
-    #
-    #   A thread-safe subclass of Hash. This version locks against the object
-    #   itself for every method call, ensuring only one thread can be reading
-    #   or writing at a time. This includes iteration methods like `#each`.
-    #
-    #   @see http://ruby-doc.org/core-2.2.0/Hash.html Ruby standard library `Hash`
-    class Hash < ::Hash;
-    end
-
-  elsif Concurrent.on_jruby?
-    require 'jruby/synchronized'
-
-    # @!macro concurrent_hash
-    class Hash < ::Hash
-      include JRuby::Synchronized
-    end
-
-  elsif Concurrent.on_rbx?
-    require 'monitor'
-    require 'concurrent/thread_safe/util/array_hash_rbx'
-
-    # @!macro concurrent_hash
-    class Hash < ::Hash
-    end
-
-    ThreadSafe::Util.make_synchronized_on_rbx Hash
-  end
-end

data/vendor/bundle/jruby/1.9/gems/concurrent-ruby-1.0.0-java/lib/concurrent/map.rb

@@ -1,180 +0,0 @@
-require 'thread'
-require 'concurrent/constants'
-require 'concurrent/synchronization'
-
-module Concurrent
-  # @!visibility private
-  module Collection
-
-    # @!visibility private
-    MapImplementation = if Concurrent.java_extensions_loaded?
-                          # noinspection RubyResolve
-                          JRubyMapBackend
-                        elsif defined?(RUBY_ENGINE)
-                          case RUBY_ENGINE
-                          when 'ruby'
-                            require 'concurrent/collection/map/mri_map_backend'
-                            MriMapBackend
-                          when 'rbx'
-                            require 'concurrent/collection/map/atomic_reference_map_backend'
-                            AtomicReferenceMapBackend
-                          else
-                            warn 'Concurrent::Map: unsupported Ruby engine, using a fully synchronized Concurrent::Map implementation' if $VERBOSE
-                            require 'concurrent/collection/map/synchronized_map_backend'
-                            SynchronizedMapBackend
-                          end
-                        else
-                          MriMapBackend
-                        end
-  end
-
-  # `Concurrent::Map` is a hash-like object and should have much better performance
-  # characteristics, especially under high concurrency, than `Concurrent::Hash`.
-  # However, `Concurrent::Map `is not strictly semantically equivalent to a ruby `Hash`
-  # -- for instance, it does not necessarily retain ordering by insertion time as `Hash`
-  # does. For most uses it should do fine though, and we recommend you consider
-  # `Concurrent::Map` instead of `Concurrent::Hash` for your concurrency-safe hash needs.
-  #
-  # > require 'concurrent'
-  # >
-  # > map = Concurrent::Map.new
-
-  class Map < Collection::MapImplementation
-    def initialize(options = nil, &block)
-      if options.kind_of?(::Hash)
-        validate_options_hash!(options)
-      else
-        options = nil
-      end
-
-      super(options)
-      @default_proc = block
-    end
-
-    def [](key)
-      if value = super # non-falsy value is an existing mapping, return it right away
-        value
-        # re-check is done with get_or_default(key, NULL) instead of a simple !key?(key) in order to avoid a race condition, whereby by the time the current thread gets to the key?(key) call
-        # a key => value mapping might have already been created by a different thread (key?(key) would then return true, this elsif branch wouldn't be taken and an incorrent +nil+ value
-        # would be returned)
-        # note: nil == value check is not technically necessary
-      elsif @default_proc && nil == value && NULL == (value = get_or_default(key, NULL))
-        @default_proc.call(self, key)
-      else
-        value
-      end
-    end
-
-    alias_method :get, :[]
-    alias_method :put, :[]=
-
-    def fetch(key, default_value = NULL)
-      if NULL != (value = get_or_default(key, NULL))
-        value
-      elsif block_given?
-        yield key
-      elsif NULL != default_value
-        default_value
-      else
-        raise_fetch_no_key
-      end
-    end
-
-    def fetch_or_store(key, default_value = NULL)
-      fetch(key) do
-        put(key, block_given? ? yield(key) : (NULL == default_value ? raise_fetch_no_key : default_value))
-      end
-    end
-
-    def put_if_absent(key, value)
-      computed = false
-      result = compute_if_absent(key) do
-        computed = true
-        value
-      end
-      computed ? nil : result
-    end unless method_defined?(:put_if_absent)
-
-    def value?(value)
-      each_value do |v|
-        return true if value.equal?(v)
-      end
-      false
-    end unless method_defined?(:value?)
-
-    def keys
-      arr = []
-      each_pair {|k, v| arr << k}
-      arr
-    end unless method_defined?(:keys)
-
-    def values
-      arr = []
-      each_pair {|k, v| arr << v}
-      arr
-    end unless method_defined?(:values)
-
-    def each_key
-      each_pair {|k, v| yield k}
-    end unless method_defined?(:each_key)
-
-    def each_value
-      each_pair {|k, v| yield v}
-    end unless method_defined?(:each_value)
-
-    def key(value)
-      each_pair {|k, v| return k if v == value}
-      nil
-    end unless method_defined?(:key)
-    alias_method :index, :key if RUBY_VERSION < '1.9'
-
-    def empty?
-      each_pair {|k, v| return false}
-      true
-    end unless method_defined?(:empty?)
-
-    def size
-      count = 0
-      each_pair {|k, v| count += 1}
-      count
-    end unless method_defined?(:size)
-
-    def marshal_dump
-      raise TypeError, "can't dump hash with default proc" if @default_proc
-      h = {}
-      each_pair {|k, v| h[k] = v}
-      h
-    end
-
-    def marshal_load(hash)
-      initialize
-      populate_from(hash)
-    end
-
-    undef :freeze
-
-    private
-    def raise_fetch_no_key
-      raise KeyError, 'key not found'
-    end
-
-    def initialize_copy(other)
-      super
-      populate_from(other)
-    end
-
-    def populate_from(hash)
-      hash.each_pair {|k, v| self[k] = v}
-      self
-    end
-
-    def validate_options_hash!(options)
-      if (initial_capacity = options[:initial_capacity]) && (!initial_capacity.kind_of?(Fixnum) || initial_capacity < 0)
-        raise ArgumentError, ":initial_capacity must be a positive Fixnum"
-      end
-      if (load_factor = options[:load_factor]) && (!load_factor.kind_of?(Numeric) || load_factor <= 0 || load_factor > 1)
-        raise ArgumentError, ":load_factor must be a number between 0 and 1"
-      end
-    end
-  end
-end