second_step 0.1.2 → 0.1.3

data/secondstep-notify-1.0.0-osx/lib/ruby/lib/ruby/gems/2.2.0/gems/activesupport-5.0.0.1/MIT-LICENSE

@@ -1,20 +0,0 @@
-Copyright (c) 2005-2016 David Heinemeier Hansson
-
-Permission is hereby granted, free of charge, to any person obtaining
-a copy of this software and associated documentation files (the
-"Software"), to deal in the Software without restriction, including
-without limitation the rights to use, copy, modify, merge, publish,
-distribute, sublicense, and/or sell copies of the Software, and to
-permit persons to whom the Software is furnished to do so, subject to
-the following conditions:
-
-The above copyright notice and this permission notice shall be
-included in all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
-EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
-MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
-NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
-LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
-OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
-WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

data/secondstep-notify-1.0.0-osx/lib/ruby/lib/ruby/gems/2.2.0/gems/activesupport-5.0.0.1/README.rdoc

@@ -1,39 +0,0 @@
-= Active Support -- Utility classes and Ruby extensions from Rails
-
-Active Support is a collection of utility classes and standard library
-extensions that were found useful for the Rails framework. These additions
-reside in this package so they can be loaded as needed in Ruby projects
-outside of Rails.
-
-
-== Download and installation
-
-The latest version of Active Support can be installed with RubyGems:
-
-  $ gem install activesupport
-
-Source code can be downloaded as part of the Rails project on GitHub:
-
-* https://github.com/rails/rails/tree/master/activesupport
-
-
-== License
-
-Active Support is released under the MIT license:
-
-* http://www.opensource.org/licenses/MIT
-
-
-== Support
-
-API documentation is at:
-
-* http://api.rubyonrails.org
-
-Bug reports can be filed for the Ruby on Rails project here:
-
-* https://github.com/rails/rails/issues
-
-Feature requests should be discussed on the rails-core mailing list here:
-
-* https://groups.google.com/forum/?fromgroups#!forum/rubyonrails-core

data/secondstep-notify-1.0.0-osx/lib/ruby/lib/ruby/gems/2.2.0/gems/activesupport-5.0.0.1/lib/active_support.rb

@@ -1,99 +0,0 @@
-#--
-# Copyright (c) 2005-2016 David Heinemeier Hansson
-#
-# Permission is hereby granted, free of charge, to any person obtaining
-# a copy of this software and associated documentation files (the
-# "Software"), to deal in the Software without restriction, including
-# without limitation the rights to use, copy, modify, merge, publish,
-# distribute, sublicense, and/or sell copies of the Software, and to
-# permit persons to whom the Software is furnished to do so, subject to
-# the following conditions:
-#
-# The above copyright notice and this permission notice shall be
-# included in all copies or substantial portions of the Software.
-#
-# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
-# EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
-# MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
-# NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
-# LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
-# OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
-# WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
-#++
-
-require 'securerandom'
-require "active_support/dependencies/autoload"
-require "active_support/version"
-require "active_support/logger"
-require "active_support/lazy_load_hooks"
-require "active_support/core_ext/date_and_time/compatibility"
-
-module ActiveSupport
-  extend ActiveSupport::Autoload
-
-  autoload :Concern
-  autoload :Dependencies
-  autoload :DescendantsTracker
-  autoload :ExecutionWrapper
-  autoload :Executor
-  autoload :FileUpdateChecker
-  autoload :EventedFileUpdateChecker
-  autoload :LogSubscriber
-  autoload :Notifications
-  autoload :Reloader
-
-  eager_autoload do
-    autoload :BacktraceCleaner
-    autoload :ProxyObject
-    autoload :Benchmarkable
-    autoload :Cache
-    autoload :Callbacks
-    autoload :Configurable
-    autoload :Deprecation
-    autoload :Gzip
-    autoload :Inflector
-    autoload :JSON
-    autoload :KeyGenerator
-    autoload :MessageEncryptor
-    autoload :MessageVerifier
-    autoload :Multibyte
-    autoload :NumberHelper
-    autoload :OptionMerger
-    autoload :OrderedHash
-    autoload :OrderedOptions
-    autoload :StringInquirer
-    autoload :TaggedLogging
-    autoload :XmlMini
-    autoload :ArrayInquirer
-  end
-
-  autoload :Rescuable
-  autoload :SafeBuffer, "active_support/core_ext/string/output_safety"
-  autoload :TestCase
-
-  def self.eager_load!
-    super
-
-    NumberHelper.eager_load!
-  end
-
-  cattr_accessor :test_order # :nodoc:
-
-  def self.halt_callback_chains_on_return_false
-    Callbacks.halt_and_display_warning_on_return_false
-  end
-
-  def self.halt_callback_chains_on_return_false=(value)
-    Callbacks.halt_and_display_warning_on_return_false = value
-  end
-
-  def self.to_time_preserves_timezone
-    DateAndTime::Compatibility.preserve_timezone
-  end
-
-  def self.to_time_preserves_timezone=(value)
-    DateAndTime::Compatibility.preserve_timezone = value
-  end
-end
-
-autoload :I18n, "active_support/i18n"

data/secondstep-notify-1.0.0-osx/lib/ruby/lib/ruby/gems/2.2.0/gems/activesupport-5.0.0.1/lib/active_support/all.rb

@@ -1,3 +0,0 @@
-require 'active_support'
-require 'active_support/time'
-require 'active_support/core_ext'

data/secondstep-notify-1.0.0-osx/lib/ruby/lib/ruby/gems/2.2.0/gems/activesupport-5.0.0.1/lib/active_support/array_inquirer.rb

@@ -1,44 +0,0 @@
-module ActiveSupport
-  # Wrapping an array in an +ArrayInquirer+ gives a friendlier way to check
-  # its string-like contents:
-  #
-  #   variants = ActiveSupport::ArrayInquirer.new([:phone, :tablet])
-  #
-  #   variants.phone?    # => true
-  #   variants.tablet?   # => true
-  #   variants.desktop?  # => false
-  class ArrayInquirer < Array
-    # Passes each element of +candidates+ collection to ArrayInquirer collection.
-    # The method returns true if at least one element is the same. If +candidates+
-    # collection is not given, method returns true.
-    #
-    #   variants = ActiveSupport::ArrayInquirer.new([:phone, :tablet])
-    #
-    #   variants.any?                      # => true
-    #   variants.any?(:phone, :tablet)     # => true
-    #   variants.any?('phone', 'desktop')  # => true
-    #   variants.any?(:desktop, :watch)    # => false
-    def any?(*candidates, &block)
-      if candidates.none?
-        super
-      else
-        candidates.any? do |candidate|
-          include?(candidate.to_sym) || include?(candidate.to_s)
-        end
-      end
-    end
-
-    private
-      def respond_to_missing?(name, include_private = false)
-        name[-1] == '?'
-      end
-
-      def method_missing(name, *args)
-        if name[-1] == '?'
-          any?(name[0..-2])
-        else
-          super
-        end
-      end
-  end
-end

data/secondstep-notify-1.0.0-osx/lib/ruby/lib/ruby/gems/2.2.0/gems/activesupport-5.0.0.1/lib/active_support/backtrace_cleaner.rb

@@ -1,103 +0,0 @@
-module ActiveSupport
-  # Backtraces often include many lines that are not relevant for the context
-  # under review. This makes it hard to find the signal amongst the backtrace
-  # noise, and adds debugging time. With a BacktraceCleaner, filters and
-  # silencers are used to remove the noisy lines, so that only the most relevant
-  # lines remain.
-  #
-  # Filters are used to modify lines of data, while silencers are used to remove
-  # lines entirely. The typical filter use case is to remove lengthy path
-  # information from the start of each line, and view file paths relevant to the
-  # app directory instead of the file system root. The typical silencer use case
-  # is to exclude the output of a noisy library from the backtrace, so that you
-  # can focus on the rest.
-  #
-  #   bc = BacktraceCleaner.new
-  #   bc.add_filter   { |line| line.gsub(Rails.root.to_s, '') } # strip the Rails.root prefix
-  #   bc.add_silencer { |line| line =~ /mongrel|rubygems/ } # skip any lines from mongrel or rubygems
-  #   bc.clean(exception.backtrace) # perform the cleanup
-  #
-  # To reconfigure an existing BacktraceCleaner (like the default one in Rails)
-  # and show as much data as possible, you can always call
-  # <tt>BacktraceCleaner#remove_silencers!</tt>, which will restore the
-  # backtrace to a pristine state. If you need to reconfigure an existing
-  # BacktraceCleaner so that it does not filter or modify the paths of any lines
-  # of the backtrace, you can call <tt>BacktraceCleaner#remove_filters!</tt>
-  # These two methods will give you a completely untouched backtrace.
-  #
-  # Inspired by the Quiet Backtrace gem by thoughtbot.
-  class BacktraceCleaner
-    def initialize
-      @filters, @silencers = [], []
-    end
-
-    # Returns the backtrace after all filters and silencers have been run
-    # against it. Filters run first, then silencers.
-    def clean(backtrace, kind = :silent)
-      filtered = filter_backtrace(backtrace)
-
-      case kind
-      when :silent
-        silence(filtered)
-      when :noise
-        noise(filtered)
-      else
-        filtered
-      end
-    end
-    alias :filter :clean
-
-    # Adds a filter from the block provided. Each line in the backtrace will be
-    # mapped against this filter.
-    #
-    #   # Will turn "/my/rails/root/app/models/person.rb" into "/app/models/person.rb"
-    #   backtrace_cleaner.add_filter { |line| line.gsub(Rails.root, '') }
-    def add_filter(&block)
-      @filters << block
-    end
-
-    # Adds a silencer from the block provided. If the silencer returns +true+
-    # for a given line, it will be excluded from the clean backtrace.
-    #
-    #   # Will reject all lines that include the word "mongrel", like "/gems/mongrel/server.rb" or "/app/my_mongrel_server/rb"
-    #   backtrace_cleaner.add_silencer { |line| line =~ /mongrel/ }
-    def add_silencer(&block)
-      @silencers << block
-    end
-
-    # Removes all silencers, but leaves in the filters. Useful if your
-    # context of debugging suddenly expands as you suspect a bug in one of
-    # the libraries you use.
-    def remove_silencers!
-      @silencers = []
-    end
-
-    # Removes all filters, but leaves in the silencers. Useful if you suddenly
-    # need to see entire filepaths in the backtrace that you had already
-    # filtered out.
-    def remove_filters!
-      @filters = []
-    end
-
-    private
-      def filter_backtrace(backtrace)
-        @filters.each do |f|
-          backtrace = backtrace.map { |line| f.call(line) }
-        end
-
-        backtrace
-      end
-
-      def silence(backtrace)
-        @silencers.each do |s|
-          backtrace = backtrace.reject { |line| s.call(line) }
-        end
-
-        backtrace
-      end
-
-      def noise(backtrace)
-        backtrace - silence(backtrace)
-      end
-  end
-end

data/secondstep-notify-1.0.0-osx/lib/ruby/lib/ruby/gems/2.2.0/gems/activesupport-5.0.0.1/lib/active_support/benchmarkable.rb

@@ -1,49 +0,0 @@
-require 'active_support/core_ext/benchmark'
-require 'active_support/core_ext/hash/keys'
-
-module ActiveSupport
-  module Benchmarkable
-    # Allows you to measure the execution time of a block in a template and
-    # records the result to the log. Wrap this block around expensive operations
-    # or possible bottlenecks to get a time reading for the operation. For
-    # example, let's say you thought your file processing method was taking too
-    # long; you could wrap it in a benchmark block.
-    #
-    #  <% benchmark 'Process data files' do %>
-    #    <%= expensive_files_operation %>
-    #  <% end %>
-    #
-    # That would add something like "Process data files (345.2ms)" to the log,
-    # which you can then use to compare timings when optimizing your code.
-    #
-    # You may give an optional logger level (<tt>:debug</tt>, <tt>:info</tt>,
-    # <tt>:warn</tt>, <tt>:error</tt>) as the <tt>:level</tt> option. The
-    # default logger level value is <tt>:info</tt>.
-    #
-    #  <% benchmark 'Low-level files', level: :debug do %>
-    #    <%= lowlevel_files_operation %>
-    #  <% end %>
-    #
-    # Finally, you can pass true as the third argument to silence all log
-    # activity (other than the timing information) from inside the block. This
-    # is great for boiling down a noisy block to just a single statement that
-    # produces one log line:
-    #
-    #  <% benchmark 'Process data files', level: :info, silence: true do %>
-    #    <%= expensive_and_chatty_files_operation %>
-    #  <% end %>
-    def benchmark(message = "Benchmarking", options = {})
-      if logger
-        options.assert_valid_keys(:level, :silence)
-        options[:level] ||= :info
-
-        result = nil
-        ms = Benchmark.ms { result = options[:silence] ? logger.silence { yield } : yield }
-        logger.send(options[:level], '%s (%.1fms)' % [ message, ms ])
-        result
-      else
-        yield
-      end
-    end
-  end
-end

data/secondstep-notify-1.0.0-osx/lib/ruby/lib/ruby/gems/2.2.0/gems/activesupport-5.0.0.1/lib/active_support/builder.rb

@@ -1,6 +0,0 @@
-begin
-  require 'builder'
-rescue LoadError => e
-  $stderr.puts "You don't have builder installed in your application. Please add it to your Gemfile and run bundle install"
-  raise e
-end

data/secondstep-notify-1.0.0-osx/lib/ruby/lib/ruby/gems/2.2.0/gems/activesupport-5.0.0.1/lib/active_support/cache.rb

@@ -1,701 +0,0 @@
-require 'benchmark'
-require 'zlib'
-require 'active_support/core_ext/array/extract_options'
-require 'active_support/core_ext/array/wrap'
-require 'active_support/core_ext/benchmark'
-require 'active_support/core_ext/module/attribute_accessors'
-require 'active_support/core_ext/numeric/bytes'
-require 'active_support/core_ext/numeric/time'
-require 'active_support/core_ext/object/to_param'
-require 'active_support/core_ext/string/inflections'
-require 'active_support/core_ext/string/strip'
-
-module ActiveSupport
-  # See ActiveSupport::Cache::Store for documentation.
-  module Cache
-    autoload :FileStore,     'active_support/cache/file_store'
-    autoload :MemoryStore,   'active_support/cache/memory_store'
-    autoload :MemCacheStore, 'active_support/cache/mem_cache_store'
-    autoload :NullStore,     'active_support/cache/null_store'
-
-    # These options mean something to all cache implementations. Individual cache
-    # implementations may support additional options.
-    UNIVERSAL_OPTIONS = [:namespace, :compress, :compress_threshold, :expires_in, :race_condition_ttl]
-
-    module Strategy
-      autoload :LocalCache, 'active_support/cache/strategy/local_cache'
-    end
-
-    class << self
-      # Creates a new Store object according to the given options.
-      #
-      # If no arguments are passed to this method, then a new
-      # ActiveSupport::Cache::MemoryStore object will be returned.
-      #
-      # If you pass a Symbol as the first argument, then a corresponding cache
-      # store class under the ActiveSupport::Cache namespace will be created.
-      # For example:
-      #
-      #   ActiveSupport::Cache.lookup_store(:memory_store)
-      #   # => returns a new ActiveSupport::Cache::MemoryStore object
-      #
-      #   ActiveSupport::Cache.lookup_store(:mem_cache_store)
-      #   # => returns a new ActiveSupport::Cache::MemCacheStore object
-      #
-      # Any additional arguments will be passed to the corresponding cache store
-      # class's constructor:
-      #
-      #   ActiveSupport::Cache.lookup_store(:file_store, '/tmp/cache')
-      #   # => same as: ActiveSupport::Cache::FileStore.new('/tmp/cache')
-      #
-      # If the first argument is not a Symbol, then it will simply be returned:
-      #
-      #   ActiveSupport::Cache.lookup_store(MyOwnCacheStore.new)
-      #   # => returns MyOwnCacheStore.new
-      def lookup_store(*store_option)
-        store, *parameters = *Array.wrap(store_option).flatten
-
-        case store
-        when Symbol
-          retrieve_store_class(store).new(*parameters)
-        when nil
-          ActiveSupport::Cache::MemoryStore.new
-        else
-          store
-        end
-      end
-
-      # Expands out the +key+ argument into a key that can be used for the
-      # cache store. Optionally accepts a namespace, and all keys will be
-      # scoped within that namespace.
-      #
-      # If the +key+ argument provided is an array, or responds to +to_a+, then
-      # each of elements in the array will be turned into parameters/keys and
-      # concatenated into a single key. For example:
-      #
-      #   expand_cache_key([:foo, :bar])               # => "foo/bar"
-      #   expand_cache_key([:foo, :bar], "namespace")  # => "namespace/foo/bar"
-      #
-      # The +key+ argument can also respond to +cache_key+ or +to_param+.
-      def expand_cache_key(key, namespace = nil)
-        expanded_cache_key = namespace ? "#{namespace}/" : ""
-
-        if prefix = ENV["RAILS_CACHE_ID"] || ENV["RAILS_APP_VERSION"]
-          expanded_cache_key << "#{prefix}/"
-        end
-
-        expanded_cache_key << retrieve_cache_key(key)
-        expanded_cache_key
-      end
-
-      private
-        def retrieve_cache_key(key)
-          case
-          when key.respond_to?(:cache_key) then key.cache_key
-          when key.is_a?(Array)            then key.map { |element| retrieve_cache_key(element) }.to_param
-          when key.respond_to?(:to_a)      then retrieve_cache_key(key.to_a)
-          else                                  key.to_param
-          end.to_s
-        end
-
-        # Obtains the specified cache store class, given the name of the +store+.
-        # Raises an error when the store class cannot be found.
-        def retrieve_store_class(store)
-          require "active_support/cache/#{store}"
-        rescue LoadError => e
-          raise "Could not find cache store adapter for #{store} (#{e})"
-        else
-          ActiveSupport::Cache.const_get(store.to_s.camelize)
-        end
-    end
-
-    # An abstract cache store class. There are multiple cache store
-    # implementations, each having its own additional features. See the classes
-    # under the ActiveSupport::Cache module, e.g.
-    # ActiveSupport::Cache::MemCacheStore. MemCacheStore is currently the most
-    # popular cache store for large production websites.
-    #
-    # Some implementations may not support all methods beyond the basic cache
-    # methods of +fetch+, +write+, +read+, +exist?+, and +delete+.
-    #
-    # ActiveSupport::Cache::Store can store any serializable Ruby object.
-    #
-    #   cache = ActiveSupport::Cache::MemoryStore.new
-    #
-    #   cache.read('city')   # => nil
-    #   cache.write('city', "Duckburgh")
-    #   cache.read('city')   # => "Duckburgh"
-    #
-    # Keys are always translated into Strings and are case sensitive. When an
-    # object is specified as a key and has a +cache_key+ method defined, this
-    # method will be called to define the key.  Otherwise, the +to_param+
-    # method will be called. Hashes and Arrays can also be used as keys. The
-    # elements will be delimited by slashes, and the elements within a Hash
-    # will be sorted by key so they are consistent.
-    #
-    #   cache.read('city') == cache.read(:city)   # => true
-    #
-    # Nil values can be cached.
-    #
-    # If your cache is on a shared infrastructure, you can define a namespace
-    # for your cache entries. If a namespace is defined, it will be prefixed on
-    # to every key. The namespace can be either a static value or a Proc. If it
-    # is a Proc, it will be invoked when each key is evaluated so that you can
-    # use application logic to invalidate keys.
-    #
-    #   cache.namespace = -> { @last_mod_time }  # Set the namespace to a variable
-    #   @last_mod_time = Time.now  # Invalidate the entire cache by changing namespace
-    #
-    # Caches can also store values in a compressed format to save space and
-    # reduce time spent sending data. Since there is overhead, values must be
-    # large enough to warrant compression. To turn on compression either pass
-    # <tt>compress: true</tt> in the initializer or as an option to +fetch+
-    # or +write+. To specify the threshold at which to compress values, set the
-    # <tt>:compress_threshold</tt> option. The default threshold is 16K.
-    class Store
-      cattr_accessor :logger, :instance_writer => true
-
-      attr_reader :silence, :options
-      alias :silence? :silence
-
-      # Creates a new cache. The options will be passed to any write method calls
-      # except for <tt>:namespace</tt> which can be used to set the global
-      # namespace for the cache.
-      def initialize(options = nil)
-        @options = options ? options.dup : {}
-      end
-
-      # Silences the logger.
-      def silence!
-        @silence = true
-        self
-      end
-
-      # Silences the logger within a block.
-      def mute
-        previous_silence, @silence = defined?(@silence) && @silence, true
-        yield
-      ensure
-        @silence = previous_silence
-      end
-
-      # Fetches data from the cache, using the given key. If there is data in
-      # the cache with the given key, then that data is returned.
-      #
-      # If there is no such data in the cache (a cache miss), then +nil+ will be
-      # returned. However, if a block has been passed, that block will be passed
-      # the key and executed in the event of a cache miss. The return value of the
-      # block will be written to the cache under the given cache key, and that
-      # return value will be returned.
-      #
-      #   cache.write('today', 'Monday')
-      #   cache.fetch('today')  # => "Monday"
-      #
-      #   cache.fetch('city')   # => nil
-      #   cache.fetch('city') do
-      #     'Duckburgh'
-      #   end
-      #   cache.fetch('city')   # => "Duckburgh"
-      #
-      # You may also specify additional options via the +options+ argument.
-      # Setting <tt>force: true</tt> forces a cache "miss," meaning we treat
-      # the cache value as missing even if it's present. Passing a block is
-      # required when `force` is true so this always results in a cache write.
-      #
-      #   cache.write('today', 'Monday')
-      #   cache.fetch('today', force: true) { 'Tuesday' } # => 'Tuesday'
-      #   cache.fetch('today', force: true) # => ArgumentError
-      #
-      # The `:force` option is useful when you're calling some other method to
-      # ask whether you should force a cache write. Otherwise, it's clearer to
-      # just call `Cache#write`.
-      #
-      # Setting <tt>:compress</tt> will store a large cache entry set by the call
-      # in a compressed format.
-      #
-      # Setting <tt>:expires_in</tt> will set an expiration time on the cache.
-      # All caches support auto-expiring content after a specified number of
-      # seconds. This value can be specified as an option to the constructor
-      # (in which case all entries will be affected), or it can be supplied to
-      # the +fetch+ or +write+ method to effect just one entry.
-      #
-      #   cache = ActiveSupport::Cache::MemoryStore.new(expires_in: 5.minutes)
-      #   cache.write(key, value, expires_in: 1.minute) # Set a lower value for one entry
-      #
-      # Setting <tt>:race_condition_ttl</tt> is very useful in situations where
-      # a cache entry is used very frequently and is under heavy load. If a
-      # cache expires and due to heavy load several different processes will try
-      # to read data natively and then they all will try to write to cache. To
-      # avoid that case the first process to find an expired cache entry will
-      # bump the cache expiration time by the value set in <tt>:race_condition_ttl</tt>.
-      # Yes, this process is extending the time for a stale value by another few
-      # seconds. Because of extended life of the previous cache, other processes
-      # will continue to use slightly stale data for a just a bit longer. In the
-      # meantime that first process will go ahead and will write into cache the
-      # new value. After that all the processes will start getting the new value.
-      # The key is to keep <tt>:race_condition_ttl</tt> small.
-      #
-      # If the process regenerating the entry errors out, the entry will be
-      # regenerated after the specified number of seconds. Also note that the
-      # life of stale cache is extended only if it expired recently. Otherwise
-      # a new value is generated and <tt>:race_condition_ttl</tt> does not play
-      # any role.
-      #
-      #   # Set all values to expire after one minute.
-      #   cache = ActiveSupport::Cache::MemoryStore.new(expires_in: 1.minute)
-      #
-      #   cache.write('foo', 'original value')
-      #   val_1 = nil
-      #   val_2 = nil
-      #   sleep 60
-      #
-      #   Thread.new do
-      #     val_1 = cache.fetch('foo', race_condition_ttl: 10) do
-      #       sleep 1
-      #       'new value 1'
-      #     end
-      #   end
-      #
-      #   Thread.new do
-      #     val_2 = cache.fetch('foo', race_condition_ttl: 10) do
-      #       'new value 2'
-      #     end
-      #   end
-      #
-      #   cache.fetch('foo') # => "original value"
-      #   sleep 10 # First thread extended the life of cache by another 10 seconds
-      #   cache.fetch('foo') # => "new value 1"
-      #   val_1 # => "new value 1"
-      #   val_2 # => "original value"
-      #
-      # Other options will be handled by the specific cache store implementation.
-      # Internally, #fetch calls #read_entry, and calls #write_entry on a cache
-      # miss. +options+ will be passed to the #read and #write calls.
-      #
-      # For example, MemCacheStore's #write method supports the +:raw+
-      # option, which tells the memcached server to store all values as strings.
-      # We can use this option with #fetch too:
-      #
-      #   cache = ActiveSupport::Cache::MemCacheStore.new
-      #   cache.fetch("foo", force: true, raw: true) do
-      #     :bar
-      #   end
-      #   cache.fetch('foo') # => "bar"
-      def fetch(name, options = nil)
-        if block_given?
-          options = merged_options(options)
-          key = normalize_key(name, options)
-
-          entry = nil
-          instrument(:read, name, options) do |payload|
-            cached_entry = read_entry(key, options) unless options[:force]
-            entry = handle_expired_entry(cached_entry, key, options)
-            payload[:super_operation] = :fetch if payload
-            payload[:hit] = !!entry if payload
-          end
-
-          if entry
-            get_entry_value(entry, name, options)
-          else
-            save_block_result_to_cache(name, options) { |_name| yield _name }
-          end
-        elsif options && options[:force]
-          raise ArgumentError, 'Missing block: Calling `Cache#fetch` with `force: true` requires a block.'
-        else
-          read(name, options)
-        end
-      end
-
-      # Fetches data from the cache, using the given key. If there is data in
-      # the cache with the given key, then that data is returned. Otherwise,
-      # +nil+ is returned.
-      #
-      # Options are passed to the underlying cache implementation.
-      def read(name, options = nil)
-        options = merged_options(options)
-        key = normalize_key(name, options)
-        instrument(:read, name, options) do |payload|
-          entry = read_entry(key, options)
-          if entry
-            if entry.expired?
-              delete_entry(key, options)
-              payload[:hit] = false if payload
-              nil
-            else
-              payload[:hit] = true if payload
-              entry.value
-            end
-          else
-            payload[:hit] = false if payload
-            nil
-          end
-        end
-      end
-
-      # Reads multiple values at once from the cache. Options can be passed
-      # in the last argument.
-      #
-      # Some cache implementation may optimize this method.
-      #
-      # Returns a hash mapping the names provided to the values found.
-      def read_multi(*names)
-        options = names.extract_options!
-        options = merged_options(options)
-
-        results = {}
-        names.each do |name|
-          key = normalize_key(name, options)
-          entry = read_entry(key, options)
-          if entry
-            if entry.expired?
-              delete_entry(key, options)
-            else
-              results[name] = entry.value
-            end
-          end
-        end
-        results
-      end
-
-      # Fetches data from the cache, using the given keys. If there is data in
-      # the cache with the given keys, then that data is returned. Otherwise,
-      # the supplied block is called for each key for which there was no data,
-      # and the result will be written to the cache and returned.
-      #
-      # Options are passed to the underlying cache implementation.
-      #
-      # Returns a hash with the data for each of the names. For example:
-      #
-      #   cache.write("bim", "bam")
-      #   cache.fetch_multi("bim", "unknown_key") do |key|
-      #     "Fallback value for key: #{key}"
-      #   end
-      #   # => { "bim" => "bam",
-      #   #      "unknown_key" => "Fallback value for key: unknown_key" }
-      #
-      def fetch_multi(*names)
-        options = names.extract_options!
-        options = merged_options(options)
-        results = read_multi(*names, options)
-
-        names.each_with_object({}) do |name, memo|
-          memo[name] = results.fetch(name) do
-            value = yield name
-            write(name, value, options)
-            value
-          end
-        end
-      end
-
-      # Writes the value to the cache, with the key.
-      #
-      # Options are passed to the underlying cache implementation.
-      def write(name, value, options = nil)
-        options = merged_options(options)
-
-        instrument(:write, name, options) do
-          entry = Entry.new(value, options)
-          write_entry(normalize_key(name, options), entry, options)
-        end
-      end
-
-      # Deletes an entry in the cache. Returns +true+ if an entry is deleted.
-      #
-      # Options are passed to the underlying cache implementation.
-      def delete(name, options = nil)
-        options = merged_options(options)
-
-        instrument(:delete, name) do
-          delete_entry(normalize_key(name, options), options)
-        end
-      end
-
-      # Returns +true+ if the cache contains an entry for the given key.
-      #
-      # Options are passed to the underlying cache implementation.
-      def exist?(name, options = nil)
-        options = merged_options(options)
-
-        instrument(:exist?, name) do
-          entry = read_entry(normalize_key(name, options), options)
-          (entry && !entry.expired?) || false
-        end
-      end
-
-      # Deletes all entries with keys matching the pattern.
-      #
-      # Options are passed to the underlying cache implementation.
-      #
-      # All implementations may not support this method.
-      def delete_matched(matcher, options = nil)
-        raise NotImplementedError.new("#{self.class.name} does not support delete_matched")
-      end
-
-      # Increments an integer value in the cache.
-      #
-      # Options are passed to the underlying cache implementation.
-      #
-      # All implementations may not support this method.
-      def increment(name, amount = 1, options = nil)
-        raise NotImplementedError.new("#{self.class.name} does not support increment")
-      end
-
-      # Decrements an integer value in the cache.
-      #
-      # Options are passed to the underlying cache implementation.
-      #
-      # All implementations may not support this method.
-      def decrement(name, amount = 1, options = nil)
-        raise NotImplementedError.new("#{self.class.name} does not support decrement")
-      end
-
-      # Cleanups the cache by removing expired entries.
-      #
-      # Options are passed to the underlying cache implementation.
-      #
-      # All implementations may not support this method.
-      def cleanup(options = nil)
-        raise NotImplementedError.new("#{self.class.name} does not support cleanup")
-      end
-
-      # Clears the entire cache. Be careful with this method since it could
-      # affect other processes if shared cache is being used.
-      #
-      # The options hash is passed to the underlying cache implementation.
-      #
-      # All implementations may not support this method.
-      def clear(options = nil)
-        raise NotImplementedError.new("#{self.class.name} does not support clear")
-      end
-
-      protected
-        # Adds the namespace defined in the options to a pattern designed to
-        # match keys. Implementations that support delete_matched should call
-        # this method to translate a pattern that matches names into one that
-        # matches namespaced keys.
-        def key_matcher(pattern, options)
-          prefix = options[:namespace].is_a?(Proc) ? options[:namespace].call : options[:namespace]
-          if prefix
-            source = pattern.source
-            if source.start_with?('^')
-              source = source[1, source.length]
-            else
-              source = ".*#{source[0, source.length]}"
-            end
-            Regexp.new("^#{Regexp.escape(prefix)}:#{source}", pattern.options)
-          else
-            pattern
-          end
-        end
-
-        # Reads an entry from the cache implementation. Subclasses must implement
-        # this method.
-        def read_entry(key, options) # :nodoc:
-          raise NotImplementedError.new
-        end
-
-        # Writes an entry to the cache implementation. Subclasses must implement
-        # this method.
-        def write_entry(key, entry, options) # :nodoc:
-          raise NotImplementedError.new
-        end
-
-        # Deletes an entry from the cache implementation. Subclasses must
-        # implement this method.
-        def delete_entry(key, options) # :nodoc:
-          raise NotImplementedError.new
-        end
-
-      private
-        # Merges the default options with ones specific to a method call.
-        def merged_options(call_options) # :nodoc:
-          if call_options
-            options.merge(call_options)
-          else
-            options.dup
-          end
-        end
-
-        # Expands key to be a consistent string value. Invokes +cache_key+ if
-        # object responds to +cache_key+. Otherwise, +to_param+ method will be
-        # called. If the key is a Hash, then keys will be sorted alphabetically.
-        def expanded_key(key) # :nodoc:
-          return key.cache_key.to_s if key.respond_to?(:cache_key)
-
-          case key
-          when Array
-            if key.size > 1
-              key = key.collect{|element| expanded_key(element)}
-            else
-              key = key.first
-            end
-          when Hash
-            key = key.sort_by { |k,_| k.to_s }.collect{|k,v| "#{k}=#{v}"}
-          end
-
-          key.to_param
-        end
-
-        # Prefixes a key with the namespace. Namespace and key will be delimited
-        # with a colon.
-        def normalize_key(key, options)
-          key = expanded_key(key)
-          namespace = options[:namespace] if options
-          prefix = namespace.is_a?(Proc) ? namespace.call : namespace
-          key = "#{prefix}:#{key}" if prefix
-          key
-        end
-
-        def namespaced_key(*args)
-          ActiveSupport::Deprecation.warn(<<-MESSAGE.strip_heredoc)
-            `namespaced_key` is deprecated and will be removed from Rails 5.1.
-            Please use `normalize_key` which will return a fully resolved key.
-          MESSAGE
-          normalize_key(*args)
-        end
-
-        def instrument(operation, key, options = nil)
-          log { "Cache #{operation}: #{normalize_key(key, options)}#{options.blank? ? "" : " (#{options.inspect})"}" }
-
-          payload = { :key => key }
-          payload.merge!(options) if options.is_a?(Hash)
-          ActiveSupport::Notifications.instrument("cache_#{operation}.active_support", payload){ yield(payload) }
-        end
-
-        def log
-          return unless logger && logger.debug? && !silence?
-          logger.debug(yield)
-        end
-
-        def handle_expired_entry(entry, key, options)
-          if entry && entry.expired?
-            race_ttl = options[:race_condition_ttl].to_i
-            if (race_ttl > 0) && (Time.now.to_f - entry.expires_at <= race_ttl)
-              # When an entry has a positive :race_condition_ttl defined, put the stale entry back into the cache
-              # for a brief period while the entry is being recalculated.
-              entry.expires_at = Time.now + race_ttl
-              write_entry(key, entry, :expires_in => race_ttl * 2)
-            else
-              delete_entry(key, options)
-            end
-            entry = nil
-          end
-          entry
-        end
-
-        def get_entry_value(entry, name, options)
-          instrument(:fetch_hit, name, options) { }
-          entry.value
-        end
-
-        def save_block_result_to_cache(name, options)
-          result = instrument(:generate, name, options) do
-            yield(name)
-          end
-
-          write(name, result, options)
-          result
-        end
-    end
-
-    # This class is used to represent cache entries. Cache entries have a value and an optional
-    # expiration time. The expiration time is used to support the :race_condition_ttl option
-    # on the cache.
-    #
-    # Since cache entries in most instances will be serialized, the internals of this class are highly optimized
-    # using short instance variable names that are lazily defined.
-    class Entry # :nodoc:
-      DEFAULT_COMPRESS_LIMIT = 16.kilobytes
-
-      # Creates a new cache entry for the specified value. Options supported are
-      # +:compress+, +:compress_threshold+, and +:expires_in+.
-      def initialize(value, options = {})
-        if should_compress?(value, options)
-          @value = compress(value)
-          @compressed = true
-        else
-          @value = value
-        end
-
-        @created_at = Time.now.to_f
-        @expires_in = options[:expires_in]
-        @expires_in = @expires_in.to_f if @expires_in
-      end
-
-      def value
-        compressed? ? uncompress(@value) : @value
-      end
-
-      # Checks if the entry is expired. The +expires_in+ parameter can override
-      # the value set when the entry was created.
-      def expired?
-        @expires_in && @created_at + @expires_in <= Time.now.to_f
-      end
-
-      def expires_at
-        @expires_in ? @created_at + @expires_in : nil
-      end
-
-      def expires_at=(value)
-        if value
-          @expires_in = value.to_f - @created_at
-        else
-          @expires_in = nil
-        end
-      end
-
-      # Returns the size of the cached value. This could be less than
-      # <tt>value.size</tt> if the data is compressed.
-      def size
-        if defined?(@s)
-          @s
-        else
-          case value
-          when NilClass
-            0
-          when String
-            @value.bytesize
-          else
-            @s = Marshal.dump(@value).bytesize
-          end
-        end
-      end
-
-      # Duplicates the value in a class. This is used by cache implementations that don't natively
-      # serialize entries to protect against accidental cache modifications.
-      def dup_value!
-        if @value && !compressed? && !(@value.is_a?(Numeric) || @value == true || @value == false)
-          if @value.is_a?(String)
-            @value = @value.dup
-          else
-            @value = Marshal.load(Marshal.dump(@value))
-          end
-        end
-      end
-
-      private
-        def should_compress?(value, options)
-          if value && options[:compress]
-            compress_threshold = options[:compress_threshold] || DEFAULT_COMPRESS_LIMIT
-            serialized_value_size = (value.is_a?(String) ? value : Marshal.dump(value)).bytesize
-
-            return true if serialized_value_size >= compress_threshold
-          end
-
-          false
-        end
-
-        def compressed?
-          defined?(@compressed) ? @compressed : false
-        end
-
-        def compress(value)
-          Zlib::Deflate.deflate(Marshal.dump(value))
-        end
-
-        def uncompress(value)
-          Marshal.load(Zlib::Inflate.inflate(value))
-        end
-    end
-  end
-end