Class: ActiveSupport::Cache::Store
| Relationships & Source Files | |
| Extension / Inclusion / Inheritance Descendants | |
|
Subclasses:
|
|
| Inherits: | Object |
| Defined in: | activesupport/lib/active_support/cache.rb |
Overview
============================
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.
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.
Store can store any Ruby object that is supported
by its coder's dump and load methods.
cache = {ActiveSupport::Cache::MemoryStore.new}
cache.read('city') # => nil
cache.write('city', "Duckburgh") # => true
cache.read('city') # => "Duckburgh"
cache.write('not serializable', {Proc.new} {}) # => TypeError
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
Constant Summary
-
DEFAULT_POOL_OPTIONS =
# File 'activesupport/lib/active_support/cache.rb', line 210
Default
ConnectionPooloptions{ size: 5, timeout: 5 }.freeze -
MAX_KEY_SIZE =
# File 'activesupport/lib/active_support/cache.rb', line 213
Keys are truncated with the Active Support digest if they exceed the limit.
250
Class Attribute Summary
Class Method Summary
-
.new(options = nil) ⇒ Store
constructor
Creates a new cache.
- .retrieve_pool_options(options) private
Instance Attribute Summary
- #logger rw
-
#namespace
rw
Get the current namespace.
-
#namespace=(namespace)
rw
Set the current namespace.
- #options readonly
- #raise_on_invalid_cache_expiration_time rw
-
#silence?
readonly
Alias for #silence.
Instance Method Summary
-
#cleanup(options = nil)
Cleans up the cache by removing expired entries.
-
#clear(options = nil)
Clears the entire cache.
-
#decrement(name, amount = 1, options = nil)
Decrements an integer value in the cache.
-
#delete(name, options = nil)
Deletes an entry in the cache.
-
#delete_matched(matcher, options = nil)
Deletes all entries with keys matching the pattern.
-
#delete_multi(names, options = nil)
Deletes multiple entries in the cache.
-
#exist?(name, options = nil) ⇒ Boolean
Returns
trueif the cache contains an entry for the given key. -
#fetch(name, options = nil, &block)
Fetches data from the cache, using the given key.
-
#fetch_multi(*names)
Fetches data from the cache, using the given keys.
-
#increment(name, amount = 1, options = nil)
Increments an integer value in the cache.
-
#mute
Silences the logger within a block.
-
#read(name, options = nil)
Reads data from the cache, using the given key.
-
#read_counter(name, **options)
Reads a counter that was set by #increment / #decrement.
-
#read_multi(*names)
Reads multiple values at once from the cache.
- #silence (also: #silence?) readonly
-
#silence!
Silences the logger.
-
#write(name, value, options = nil)
Writes the value to the cache with the key.
-
#write_counter(name, value, **options)
Writes a counter that can then be modified by #increment / #decrement.
-
#write_multi(hash, options = nil)
::ActiveSupport::CacheStorage API to write multiple values at once. - #default_serializer private
-
#delete_entry(key, **options)
private
Deletes an entry from the cache implementation.
-
#delete_multi_entries(entries, **options)
private
Deletes multiples entries in the cache implementation.
- #deserialize_entry(payload) private
- #expand_and_namespace_key(key, options = nil) private
-
#expanded_key(key)
private
Expands key to be a consistent string value.
- #expanded_version(key) private
- #get_entry_value(entry, key, options) private
- #handle_expired_entry(entry, key, options) private
- #handle_invalid_expires_in(message) private
- #instrument(operation, key, options = nil, &block) private
- #instrument_multi(operation, keys, options = nil, &block) private
-
#key_matcher(pattern, options)
private
Adds the namespace defined in the options to a pattern designed to match keys.
-
#merged_options(call_options)
private
Merges the default options with ones specific to a method call.
-
#namespace_key(key, call_options = nil)
private
Prefix the key with a namespace string:
-
#normalize_key(key, options = nil)
private
Expands, namespaces and truncates the cache key.
-
#normalize_options(options)
private
Normalize aliased options to their canonical form.
- #normalize_version(key, options = nil) private
-
#read_entry(key, **options)
private
Reads an entry from the cache implementation.
-
#read_multi_entries(names, **options)
private
Reads multiple entries from the cache implementation.
- #save_block_result_to_cache(name, key, options) private
- #serialize_entry(entry, **options) private
- #truncate_key(key) private
- #validate_options(options) private
-
#write_entry(key, entry, **options)
private
Writes an entry to the cache implementation.
-
#write_multi_entries(hash, **options)
private
Writes multiple entries to the cache implementation.
- #new_entry(value, options = nil) Internal use only
Constructor Details
.new(options = nil) ⇒ Store
Creates a new cache.
Options
:namespace
: Sets the namespace for the cache. This option is especially useful if
your application shares a cache with other applications.
:serializer
: The serializer for cached values. Must respond to dump and load.
: The default serializer depends on the cache format version (set via
config.active_support.cache_format_version when using ::Rails). The
default serializer for each format version includes a fallback
mechanism to deserialize values from any format version. This behavior
makes it easy to migrate between format versions without invalidating
the entire cache.
: You can also specify serializer: :message_pack to use a
preconfigured serializer based on ::ActiveSupport::MessagePack. The
:message_pack serializer includes the same deserialization fallback
mechanism, allowing easy migration from (or to) the default
serializer. The :message_pack serializer may improve performance,
but it requires the msgpack gem.
:compressor-
The compressor for serialized cache values. Must respond to
deflateandinflate.The default compressor is
Zlib. To define a new custom compressor that also decompresses old cache entries, you can check compressed values for Zlib's"\x78"signature:module MyCompressor def self.deflate(dumped) # compression logic... (make sure result does not start with "\x78"!) end
<span class="ruby-keyword">def</span> <span class="ruby-keyword">self</span>.<span class="ruby-identifier">inflate</span>(<span class="ruby-identifier">compressed</span>) <span class="ruby-keyword">if</span> <span class="ruby-identifier">compressed</span>.<span class="ruby-identifier">start_with?</span>(<span class="ruby-string">"</span><span class="ruby-string">\x78</span><span class="ruby-string">"</span>) <span class="ruby-constant">Zlib</span>.<span class="ruby-identifier">inflate</span>(<span class="ruby-identifier">compressed</span>) <span class="ruby-keyword">else</span> <span class="ruby-comment"># decompression logic...</span> <span class="ruby-keyword">end</span> <span class="ruby-keyword">end</span>end
ActiveSupport::Cache.lookup_store(:redis_cache_store, compressor: MyCompressor)
:coder
: The coder for serializing and (optionally) compressing cache entries.
Must respond to dump and load.
: The default coder composes the serializer and compressor, and includes
some performance optimizations. If you only need to override the
serializer or compressor, you should specify the :serializer or
:compressor options instead.
: If the store can handle cache entries directly, you may also specify
coder: nil to omit the serializer, compressor, and coder. For
example, if you are using MemoryStore and can
guarantee that cache values will not be mutated, you can specify
coder: nil to avoid the overhead of safeguarding against
mutation.
: The :coder option is mutually exclusive with the :serializer and
:compressor options. Specifying them together will raise an
ArgumentError.
Any other specified options are treated as default options for the relevant cache operations, such as #read, #write, and #fetch.
# File 'activesupport/lib/active_support/cache.rb', line 318
def initialize( = nil) @options = ? (()) : {} @options[:compress] = true unless @options.key?(:compress) @options[:compress_threshold] ||= DEFAULT_COMPRESS_LIMIT @max_key_size = @options.delete(:max_key_size) @max_key_size = MAX_KEY_SIZE if @max_key_size.nil? # allow 'false' as a value @coder = @options.delete(:coder) do legacy_serializer = Cache.format_version < 7.1 && !@options[:serializer] serializer = @options.delete(:serializer) || default_serializer serializer = Cache::SerializerWithFallback[serializer] if serializer.is_a?(Symbol) compressor = @options.delete(:compressor) { Zlib } Cache::Coder.new(serializer, compressor, legacy_serializer: legacy_serializer) end @coder ||= Cache::SerializerWithFallback[:passthrough] @coder_supports_compression = @coder.respond_to?(:dump_compressed) end
Class Attribute Details
.logger (rw)
[ GitHub ]# File 'activesupport/lib/active_support/cache.rb', line 215
class_attribute :logger, instance_predicate: false
.raise_on_invalid_cache_expiration_time (rw)
[ GitHub ]# File 'activesupport/lib/active_support/cache.rb', line 216
class_attribute :raise_on_invalid_cache_expiration_time, instance_predicate: false, default: false
Class Method Details
.retrieve_pool_options(options) (private)
[ GitHub ]# File 'activesupport/lib/active_support/cache.rb', line 223
def () if .key?(:pool) = .delete(:pool) else = true end case when false, nil return false when true = DEFAULT_POOL_OPTIONS when Hash [:size] = Integer([:size]) if .key?(:size) [:timeout] = Float([:timeout]) if .key?(:timeout) = DEFAULT_POOL_OPTIONS.merge() else raise TypeError, "Invalid :pool argument, expected Hash, got: #{.inspect}" end unless .empty? end
Instance Attribute Details
#logger (rw)
[ GitHub ]# File 'activesupport/lib/active_support/cache.rb', line 215
class_attribute :logger, instance_predicate: false
#namespace (rw)
Get the current namespace
# File 'activesupport/lib/active_support/cache.rb', line 830
def namespace @options[:namespace] end
#namespace=(namespace) (rw)
Set the current namespace. Note, this will be ignored if custom options are passed to cache wills with a namespace key.
#options (readonly)
[ GitHub ]# File 'activesupport/lib/active_support/cache.rb', line 218
attr_reader :silence, :
#raise_on_invalid_cache_expiration_time (rw)
[ GitHub ]# File 'activesupport/lib/active_support/cache.rb', line 216
class_attribute :raise_on_invalid_cache_expiration_time, instance_predicate: false, default: false
#silence? (readonly)
Alias for #silence.
# File 'activesupport/lib/active_support/cache.rb', line 219
alias :silence? :silence
Instance Method Details
#cleanup(options = nil)
Cleans up the cache by removing expired entries.
Options are passed to the underlying cache implementation.
Some implementations may not support this method.
# File 'activesupport/lib/active_support/cache.rb', line 815
def cleanup( = nil) raise NotImplementedError.new("#{self.class.name} does not support cleanup") end
#clear(options = nil)
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.
Some implementations may not support this method.
# File 'activesupport/lib/active_support/cache.rb', line 825
def clear( = nil) raise NotImplementedError.new("#{self.class.name} does not support clear") end
#decrement(name, amount = 1, options = nil)
Decrements an integer value in the cache.
Options are passed to the underlying cache implementation.
Some implementations may not support this method.
# File 'activesupport/lib/active_support/cache.rb', line 776
def decrement(name, amount = 1, = nil) raise NotImplementedError.new("#{self.class.name} does not support decrement") end
#default_serializer (private)
[ GitHub ]# File 'activesupport/lib/active_support/cache.rb', line 841
def default_serializer case Cache.format_version when 7.0 Cache::SerializerWithFallback[:marshal_7_0] when 7.1 Cache::SerializerWithFallback[:marshal_7_1] else raise ArgumentError, "Unrecognized ActiveSupport::Cache.format_version: #{Cache.format_version.inspect}" end end
#delete(name, options = nil)
Deletes an entry in the cache. Returns true if an entry is deleted
and false otherwise.
Options are passed to the underlying cache implementation.
# File 'activesupport/lib/active_support/cache.rb', line 712
def delete(name, = nil) = () key = normalize_key(name, ) instrument(:delete, key, ) do delete_entry(key, **) end end
#delete_entry(key, **options) (private)
Deletes an entry from the cache implementation. Subclasses must implement this method.
# File 'activesupport/lib/active_support/cache.rb', line 927
def delete_entry(key, **) raise NotImplementedError.new end
#delete_matched(matcher, options = nil)
Deletes all entries with keys matching the pattern.
Options are passed to the underlying cache implementation.
Some implementations may not support this method.
# File 'activesupport/lib/active_support/cache.rb', line 758
def delete_matched(matcher, = nil) raise NotImplementedError.new("#{self.class.name} does not support delete_matched") end
#delete_multi(names, options = nil)
Deletes multiple entries in the cache. Returns the number of deleted entries.
Options are passed to the underlying cache implementation.
# File 'activesupport/lib/active_support/cache.rb', line 725
def delete_multi(names, = nil) return 0 if names.empty? = () names = names.map { |key| normalize_key(key, ) } instrument_multi(:delete_multi, names, ) do delete_multi_entries(names, **) end end
#delete_multi_entries(entries, **options) (private)
Deletes multiples entries in the cache implementation. Subclasses MAY implement this method.
# File 'activesupport/lib/active_support/cache.rb', line 933
def delete_multi_entries(entries, **) entries.count { |key| delete_entry(key, **) } end
#deserialize_entry(payload) (private)
[ GitHub ]# File 'activesupport/lib/active_support/cache.rb', line 892
def deserialize_entry(payload, **) payload.nil? ? nil : @coder.load(payload) rescue DeserializationError nil end
#exist?(name, options = nil) ⇒ Boolean
Returns true if the cache contains an entry for the given key.
Options are passed to the underlying cache implementation.
# File 'activesupport/lib/active_support/cache.rb', line 739
def exist?(name, = nil) = () key = normalize_key(name, ) instrument(:exist?, key, ) do |payload| entry = read_entry(key, **, event: payload) (entry && !entry.expired? && !entry.mismatched?(normalize_version(name, ))) || false end end
#expand_and_namespace_key(key, options = nil) (private)
# File 'activesupport/lib/active_support/cache.rb', line 1014
def (key, = nil) str_key = key.class == ::String ? key : (key) raise(ArgumentError, "key cannot be blank") if !str_key || str_key.empty? namespace_key str_key, end
#expanded_key(key) (private)
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.
#expanded_version(key) (private)
[ GitHub ]# File 'activesupport/lib/active_support/cache.rb', line 1092
def (key) case when key.respond_to?(:cache_version) then key.cache_version.to_param when key.is_a?(Array) then key.map { |element| (element) }.tap(&:compact!).to_param when key.respond_to?(:to_a) then (key.to_a) end end
#fetch(name, options = nil, &block)
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"
Options
Internally, fetch calls #read_entry, and calls #write_entry on a
cache miss. Thus, fetch supports the same options as #read and #write.
Additionally, fetch supports the following options:
-
force: true- Forces a cache "miss," meaning we treat the cache value as missing even if it's present. Passing a block is required whenforceis 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 toask whether you should force a cache write. Otherwise, it's clearer to just call #write.
-
skip_nil: true- Prevents caching a nil result:cache.fetch('foo') { nil } cache.fetch('bar', skip_nil: true) { nil } cache.exist?('foo') # => true cache.exist?('bar') # => false -
:race_condition_ttl- Specifies the number of seconds during which an expired value can be reused while a new value is being generated. This can be used to prevent race conditions when cache entries expire, by preventing multiple processes from simultaneously regenerating the same entry (also known as the dog pile effect).When a process encounters a cache entry that has expired less than:race_condition_ttlseconds ago, it will bump the expiration time by:race_condition_ttlseconds before generating a new value. During this extended time window, while the process generates a new value, other processes will continue to use the old value. After the first process writes the new value, other processes will then use it.If the first process errors out while a new value, anotherprocess can try to generate a new value after the extended time window has elapsed.
# Set all values to expire after one second. cache = ActiveSupport::Cache::MemoryStore.new(expires_in: 1) cache.write("foo", "original value") val_1 = nil val_2 = nil p cache.read("foo") # => "original value" sleep 1 # wait until the cache expires t1 = Thread.new do # fetch does the following: # 1. gets an recent expired entry # 2. extends the expiry by 2 seconds (race_condition_ttl) # 3. regenerates the new value val_1 = cache.fetch("foo", race_condition_ttl: 2) do sleep 1 "new value 1" end end # Wait until t1 extends the expiry of the entry # but before generating the new value sleep 0.1 val_2 = cache.fetch("foo", race_condition_ttl: 2) do # This block won't be executed because t1 extended the expiry "new value 2" end t1.join p val_1 # => "new value 1" p val_2 # => "original value" p cache.fetch("foo") # => "new value 1" # The entry requires 3 seconds to expire (expires_in + race_condition_ttl) # We have waited 2 seconds already (sleep(1) + t1.join) thus we need to wait 1 # more second to see the entry expire. sleep 1 p cache.fetch("foo") # => nil
Dynamic Options
In some cases it may be necessary to dynamically compute options based
on the cached value. To support this, an WriteOptions
instance is passed as the second argument to the block. For example:
cache.fetch("authentication-token:#{user.id}") do |key, |
token = authenticate_to_service
.expires_at = token.expires_at
token
end
# File 'activesupport/lib/active_support/cache.rb', line 474
def fetch(name, = nil, &block) if block_given? = () key = normalize_key(name, ) entry = nil unless [:force] instrument(:read, key, ) do |payload| cached_entry = read_entry(key, **, event: payload) entry = handle_expired_entry(cached_entry, key, ) if entry if entry.mismatched?(normalize_version(name, )) entry = nil else begin entry.value rescue DeserializationError entry = nil end end end payload[:super_operation] = :fetch if payload payload[:hit] = !!entry if payload end end if entry get_entry_value(entry, key, ) else save_block_result_to_cache(name, key, , &block) end elsif && [:force] raise ArgumentError, "Missing block: Calling `Cache#fetch` with `force: true` requires a block." else read(name, ) end end
#fetch_multi(*names)
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. Therefore, you need to pass a block that returns the data to be written to the cache. If you do not want to write the cache when the cache is not found, use #read_multi.
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" }
You may also specify additional options via the #options argument. See #fetch for details. Other options are passed to the underlying cache implementation. For example:
cache.fetch_multi("fizz", expires_in: 5.seconds) do |key|
"buzz"
end
#### => {"fizz"=>"buzz"}
cache.read("fizz")
#### => "buzz"
sleep(6)
cache.read("fizz")
#### => nil
# File 'activesupport/lib/active_support/cache.rb', line 629
def fetch_multi(*names) raise ArgumentError, "Missing block: `Cache#fetch_multi` requires a block." unless block_given? return {} if names.empty? = names. = () keys = names.map { |name| normalize_key(name, ) } writes = {} ordered = instrument_multi :read_multi, keys, do |payload| if [:force] reads = {} else reads = read_multi_entries(names, **) end ordered = names.index_with do |name| reads.fetch(name) { writes[name] = yield(name) } end writes.compact! if [:skip_nil] payload[:hits] = reads.keys.map { |name| normalize_key(name, ) } payload[:super_operation] = :fetch_multi ordered end write_multi(writes, ) ordered end
#get_entry_value(entry, key, options) (private)
[ GitHub ]# File 'activesupport/lib/active_support/cache.rb', line 1154
def get_entry_value(entry, key, ) instrument(:fetch_hit, key, ) entry.value end
#handle_expired_entry(entry, key, options) (private)
[ GitHub ]# File 'activesupport/lib/active_support/cache.rb', line 1138
def handle_expired_entry(entry, key, ) if entry && entry.expired? race_ttl = [: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.to_f + race_ttl write_entry(key, entry, **, expires_in: race_ttl * 2) else delete_entry(key, **) end entry = nil end entry end
#handle_invalid_expires_in(message) (private)
[ GitHub ]# File 'activesupport/lib/active_support/cache.rb', line 967
def handle_invalid_expires_in() error = ArgumentError.new() if raise_on_invalid_cache_expiration_time raise error else ActiveSupport.error_reporter&.report(error, handled: true, severity: :warning) logger.error("#{error.class}: #{error.}") if logger end end
#increment(name, amount = 1, options = nil)
Increments an integer value in the cache.
Options are passed to the underlying cache implementation.
Some implementations may not support this method.
# File 'activesupport/lib/active_support/cache.rb', line 767
def increment(name, amount = 1, = nil) raise NotImplementedError.new("#{self.class.name} does not support increment") end
#instrument(operation, key, options = nil, &block) (private)
[ GitHub ]# File 'activesupport/lib/active_support/cache.rb', line 1100
def instrument(operation, key, = nil, &block) unless silence? logger&.debug do debug_key = ": #{key}" if key = " (#{.inspect})" unless .blank? "Cache #{operation}#{debug_key}#{}" end end payload = { store: self.class.name, key: key } payload.merge!() if .is_a?(Hash) ActiveSupport::Notifications.instrument("cache_#{operation}.active_support", payload) do block&.call(payload) end end
#instrument_multi(operation, keys, options = nil, &block) (private)
[ GitHub ]# File 'activesupport/lib/active_support/cache.rb', line 1119
def instrument_multi(operation, keys, = nil, &block) unless silence? logger&.debug do debug_key = ": #{keys.size} key(s) specified" = " (#{.inspect})" unless .blank? "Cache #{operation}#{debug_key}#{}" end end payload = { store: self.class.name, key: keys } payload.merge!() if .is_a?(Hash) ActiveSupport::Notifications.instrument("cache_#{operation}.active_support", payload) do block&.call(payload) end end
#key_matcher(pattern, options) (private)
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.
# File 'activesupport/lib/active_support/cache.rb', line 856
def key_matcher(pattern, ) # :doc: prefix = [:namespace].is_a?(Proc) ? [:namespace].call : [: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.) else pattern end end
#merged_options(call_options) (private)
Merges the default options with ones specific to a method call.
# File 'activesupport/lib/active_support/cache.rb', line 938
def () if = () if .key?(:expires_in) && .key?(:expires_at) raise ArgumentError, "Either :expires_in or :expires_at can be supplied, but not both" end expires_at = .delete(:expires_at) [:expires_in] = (expires_at - Time.now) if expires_at if [:expires_in].is_a?(Time) expires_in = [:expires_in] raise ArgumentError.new("expires_in parameter should not be a Time. Did you mean to use expires_at? Got: #{expires_in}") end if [:expires_in]&.negative? expires_in = .delete(:expires_in) handle_invalid_expires_in("Cache expiration time is invalid, cannot be negative: #{expires_in}") end if .empty? else .merge() end else end end
#mute
Silences the logger within a block.
# File 'activesupport/lib/active_support/cache.rb', line 348
def mute previous_silence, @silence = @silence, true yield ensure @silence = previous_silence end
#namespace_key(key, call_options = nil) (private)
Prefix the key with a namespace string:
namespace_key 'foo', namespace: 'cache'
#### => 'cache:foo'
With a namespace block:
namespace_key 'foo', namespace: -> { 'cache' }
#### => 'cache:foo'
# File 'activesupport/lib/active_support/cache.rb', line 1046
def namespace_key(key, = nil) namespace = if &.key?(:namespace) [:namespace] else [:namespace] end if namespace.respond_to?(:call) namespace = namespace.call end if key && key.encoding != Encoding::UTF_8 key = key.dup.force_encoding(Encoding::UTF_8) end if namespace "#{namespace}:#{key}" else key end end
#new_entry(value, options = nil)
#normalize_key(key, options = nil) (private)
Expands, namespaces and truncates the cache key.
Raises an exception when the key is nil or an empty string.
May be overridden by cache stores to do additional normalization.
# File 'activesupport/lib/active_support/cache.rb', line 1009
def normalize_key(key, = nil) key = (key, ) truncate_key(key) end
#normalize_options(options) (private)
Normalize aliased options to their canonical form
# File 'activesupport/lib/active_support/cache.rb', line 978
def () = .dup OPTION_ALIASES.each do |canonical_name, aliases| alias_key = aliases.detect { |key| .key?(key) } [canonical_name] ||= [alias_key] if alias_key .except!(*aliases) end end
#normalize_version(key, options = nil) (private)
[ GitHub ]# File 'activesupport/lib/active_support/cache.rb', line 1088
def normalize_version(key, = nil) ( && [:version].try(:to_param)) || (key) end
#read(name, options = nil)
Reads 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.
Note, if data was written with the :expires_in or
:version options, both of these conditions are applied before
the data is returned.
Options
:namespace- Replace the store namespace for this call.:version- Specifies a version for the cache entry. If the cached version does not match the requested version, the read will be treated as a cache miss. This feature is used to support recyclable cache keys.
Other options will be handled by the specific cache store implementation.
# File 'activesupport/lib/active_support/cache.rb', line 528
def read(name, = nil) = () key = normalize_key(name, ) version = normalize_version(name, ) instrument(:read, key, ) do |payload| entry = read_entry(key, **, event: payload) if entry if entry.expired? delete_entry(key, **) payload[:hit] = false if payload nil elsif entry.mismatched?(version) payload[:hit] = false if payload nil else payload[:hit] = true if payload begin entry.value rescue DeserializationError payload[:hit] = false nil end end else payload[:hit] = false if payload nil end end end
#read_counter(name, **options)
Reads a counter that was set by #increment / #decrement.
cache.write_counter("foo", 1)
cache.read_counter("foo") # => 1
cache.increment("foo")
cache.read_counter("foo") # => 2
Options are passed to the underlying cache implementation.
# File 'activesupport/lib/active_support/cache.rb', line 790
def read_counter(name, **) = ().merge(raw: true) read(name, **)&.to_i end
#read_entry(key, **options) (private)
Reads an entry from the cache implementation. Subclasses must implement this method.
# File 'activesupport/lib/active_support/cache.rb', line 873
def read_entry(key, **) raise NotImplementedError.new end
#read_multi(*names)
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.
# File 'activesupport/lib/active_support/cache.rb', line 566
def read_multi(*names) return {} if names.empty? = names. = () keys = names.map { |name| normalize_key(name, ) } instrument_multi :read_multi, keys, do |payload| read_multi_entries(names, **, event: payload).tap do |results| payload[:hits] = results.keys.map { |name| normalize_key(name, ) } end end end
#read_multi_entries(names, **options) (private)
Reads multiple entries from the cache implementation. Subclasses MAY implement this method.
# File 'activesupport/lib/active_support/cache.rb', line 900
def read_multi_entries(names, **) names.each_with_object({}) do |name, results| key = normalize_key(name, ) entry = read_entry(key, **) next unless entry version = normalize_version(name, ) if entry.expired? delete_entry(key, **) elsif !entry.mismatched?(version) results[name] = entry.value end end end
#save_block_result_to_cache(name, key, options) (private)
[ GitHub ]# File 'activesupport/lib/active_support/cache.rb', line 1159
def save_block_result_to_cache(name, key, ) = .dup result = instrument(:generate, key, ) do yield(name, WriteOptions.new()) end write(name, result, ) unless result.nil? && [:skip_nil] result end
#serialize_entry(entry, **options) (private)
[ GitHub ]# File 'activesupport/lib/active_support/cache.rb', line 883
def serialize_entry(entry, **) = () if @coder_supports_compression && [:compress] @coder.dump_compressed(entry, [:compress_threshold]) else @coder.dump(entry) end end
#silence (readonly) Also known as: #silence?
[ GitHub ]# File 'activesupport/lib/active_support/cache.rb', line 218
attr_reader :silence, :
#silence!
Silences the logger.
# File 'activesupport/lib/active_support/cache.rb', line 342
def silence! @silence = true self end
#truncate_key(key) (private)
[ GitHub ]# File 'activesupport/lib/active_support/cache.rb', line 1021
def truncate_key(key) if key && @max_key_size && key.bytesize > @max_key_size suffix = ":hash:#{ActiveSupport::Digest.hexdigest(key)}" truncate_at = @max_key_size - suffix.bytesize key = key.byteslice(0, truncate_at) key.scrub!("") "#{key}#{suffix}" else key end end
#validate_options(options) (private)
[ GitHub ]# File 'activesupport/lib/active_support/cache.rb', line 989
def () if .key?(:coder) && [:serializer] raise ArgumentError, "Cannot specify :serializer and :coder options together" end if .key?(:coder) && [:compressor] raise ArgumentError, "Cannot specify :compressor and :coder options together" end if Cache.format_version < 7.1 && ![:serializer] && [:compressor] raise ArgumentError, "Cannot specify :compressor option when using" \ " default serializer and cache format version is < 7.1" end end
#write(name, value, options = nil)
Writes the value to the cache with the key. The value must be supported
by the coder's dump and load methods.
Returns true if the write succeeded, nil if there was an error talking
to the cache backend, or false if the write failed for another reason.
By default, cache entries larger than 1kB are compressed. Compression allows more data to be stored in the same memory footprint, leading to fewer cache evictions and higher hit rates.
Options
-
compress: false- Disables compression of the cache entry. -
:compress_threshold- The compression threshold, specified in bytes. Cache entries larger than this threshold will be compressed. Defaults to1.kilobyte. -
:expires_in- Sets a relative expiration time for the cache entry, specified in seconds.:expire_inand:expired_inare aliases for:expires_in.cache = ActiveSupport::Cache::MemoryStore.new(expires_in: 5.minutes) cache.write(key, value, expires_in: 1.minute) # Set a lower value for one entry -
:expires_at- Sets an absolute expiration time for the cache entry.cache = ActiveSupport::Cache::MemoryStore.new cache.write(key, value, expires_at: Time.now.at_end_of_hour) -
:version- Specifies a version for the cache entry. When reading from the cache, if the cached version does not match the requested version, the read will be treated as a cache miss. This feature is used to support recyclable cache keys. -
:unless_exist- Prevents overwriting an existing cache entry.
Other options will be handled by the specific cache store implementation.
# File 'activesupport/lib/active_support/cache.rb', line 698
def write(name, value, = nil) = () key = normalize_key(name, ) instrument(:write, key, ) do entry = Entry.new(value, **, version: normalize_version(name, )) write_entry(key, entry, **) end end
#write_counter(name, value, **options)
Writes a counter that can then be modified by #increment / #decrement.
cache.write_counter("foo", 1)
cache.read_counter("foo") # => 1
cache.increment("foo")
cache.read_counter("foo") # => 2
Options are passed to the underlying cache implementation.
# File 'activesupport/lib/active_support/cache.rb', line 805
def write_counter(name, value, **) = ().merge(raw: true) write(name, value.to_i, **) end
#write_entry(key, entry, **options) (private)
Writes an entry to the cache implementation. Subclasses must implement this method.
# File 'activesupport/lib/active_support/cache.rb', line 879
def write_entry(key, entry, **) raise NotImplementedError.new end
#write_multi(hash, options = nil)
::ActiveSupport::Cache Storage API to write multiple values at once.
# File 'activesupport/lib/active_support/cache.rb', line 581
def write_multi(hash, = nil) return hash if hash.empty? = () normalized_hash = hash.transform_keys { |key| normalize_key(key, ) } instrument_multi :write_multi, normalized_hash, do |payload| entries = hash.each_with_object({}) do |(name, value), memo| memo[normalize_key(name, )] = Entry.new(value, **, version: normalize_version(name, )) end write_multi_entries entries, ** end end
#write_multi_entries(hash, **options) (private)
Writes multiple entries to the cache implementation. Subclasses MAY implement this method.
# File 'activesupport/lib/active_support/cache.rb', line 919
def write_multi_entries(hash, **) hash.each do |key, entry| write_entry key, entry, ** end end