class HexaPDF::Utils::LRUCache


A simple least recently used (LRU) cache.

The cache relies on the fact that Ruby’s Hash class maintains insertion order. So deleting and re-inserting a key-value pair on access moves the key to the last position. When an entry is added and the cache is full, the first entry is removed.

Public Class Methods


Creates a new LRUCache that can hold size entries.

Public Instance Methods


Returns the stored value for key or nil if no value was stored under the key.

[]=(key, value)

Stores the value under the key.