philiprehberger-cache_kit 0.2.2 → 0.3.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: b4acd246ec80526d77eb23a49ecac10bcb00cbeaed209e279381099b14346f19
-  data.tar.gz: de8a6c3c962e0836c859dd97042b1885cc553e2edb41ee633707e431d3f73480
+  metadata.gz: 8b515b534e67af3974fd473015800fb3ca7ba58ed55d77039d26a8a20b43e1c7
+  data.tar.gz: c01e6bdee343e524f3abdc75585286a0bc75cc99c2f7fbfb61206e65ed5fb69c
 SHA512:
-  metadata.gz: 9b3269a4eeebbb1b2020b421b8288e45a2aa78f48f61d55cc4fbf470b052137f85fea597ae215b83ea68ae862c8da326bbd6b4a82238d81511ce5a9f5a190572
-  data.tar.gz: '08dbc8a4505fbf216efede795a81ea828eb16e5f7a8a27793f8022225508ed58d8a11fbe68eeaae60212a0dbbb88136c087c538a2ef24bea82358063720de955'
+  metadata.gz: 369ba8aa6cc57b595cec309c0a01bba8d95b1c88c6311d38951f225a96cc37c9925297573499ac54d6a05029e731afe17b3d393cff568a9a472497cd45045da3
+  data.tar.gz: 545cb36af1792619ce4cc440de72a5f1bd7814d39c5db0de751f33d2b99fe5296708d4cc8de87ef8be1cb7d2a4cfb56b88ccce845b9c09f84475e76b50a42c8b

data/CHANGELOG.md

@@ -1,16 +1,30 @@
 # Changelog
 
-## 0.2.2
-
-- Add License badge to README
-- Add bug_tracker_uri to gemspec
-
 All notable changes to this gem will be documented in this file.
 
 The format is based on [Keep a Changelog](https://keepachangelog.com/en/1.0.0/),
 and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.html).
 
 ## [Unreleased]
+n## [0.3.1] - 2026-03-22
+
+### Changed
+- Update rubocop configuration for Windows compatibility
+
+## [0.3.0] - 2026-03-17
+
+### Added
+- Thread-safe `fetch` — compute-on-miss now holds the lock for the entire operation, preventing duplicate computation
+- Eviction callbacks via `on_evict { |key, value| ... }` — fires on LRU eviction and TTL expiry
+- Per-tag statistics via `stats(tag: :name)` — returns `{ hits:, misses:, evictions: }` for a specific tag
+- Batch retrieval via `get_many(keys)` — fetch multiple keys in a single lock acquisition, returns a hash
+- Snapshot and restore via `snapshot` / `restore(data)` — serialize and deserialize cache state for warm restarts
+
+## [0.2.2] - 2026-03-16
+
+### Changed
+- Add License badge to README
+- Add bug_tracker_uri to gemspec
 
 ## [0.2.1] - 2026-03-13
 

data/README.md

@@ -18,12 +18,6 @@ Add to your Gemfile:
 gem "philiprehberger-cache_kit"
 ```
 
-Then run:
-
-```bash
-bundle install
-```
-
 Or install directly:
 
 ```bash
@@ -42,11 +36,13 @@ cache.set("user:1", { name: "Alice" }, ttl: 300)
 cache.get("user:1") # => { name: "Alice" }
 ```
 
-### Fetch (get or compute)
+### Fetch (compute-on-miss)
+
+Thread-safe get-or-compute. The block is only called if the key is missing or expired, and the entire operation holds the lock to prevent duplicate computation.
 
 ```ruby
 user = cache.fetch("user:1", ttl: 300) do
-  User.find(1)
+  User.find(1) # only called on cache miss
 end
 ```
 
@@ -69,6 +65,34 @@ cache.set("post:1", data3, tags: ["posts"])
 cache.invalidate_tag("users") # removes user:1 and user:2, keeps post:1
 ```
 
+### Eviction Callback
+
+Register hooks that fire when entries are evicted by LRU pressure or TTL expiry.
+
+```ruby
+cache.on_evict do |key, value|
+  logger.info("Evicted #{key}")
+end
+
+# Fires on LRU eviction
+cache.set("overflow", "data") # triggers callback if cache is full
+
+# Fires on TTL expiry (during get or prune)
+cache.prune
+```
+
+### Batch Get
+
+Retrieve multiple keys in a single lock acquisition. Returns a hash mapping each key to its value (or nil if missing/expired).
+
+```ruby
+cache.set("a", 1)
+cache.set("b", 2)
+
+cache.get_many(["a", "b", "missing"])
+# => { "a" => 1, "b" => 2, "missing" => nil }
+```
+
 ### Hash-like Access
 
 ```ruby
@@ -111,6 +135,36 @@ cache.stats
 # => { size: 1, hits: 1, misses: 1, evictions: 0 }
 ```
 
+### Stats by Tag
+
+Track per-tag hit, miss, and eviction counters.
+
+```ruby
+cache.set("user:1", data, tags: ["users"])
+cache.set("post:1", data, tags: ["posts"])
+cache.get("user:1") # hit on "users" tag
+
+cache.stats(tag: "users")
+# => { hits: 1, misses: 0, evictions: 0 }
+
+cache.stats(tag: "posts")
+# => { hits: 0, misses: 0, evictions: 0 }
+```
+
+### Snapshot and Restore
+
+Serialize cache state for warm restarts. The snapshot captures all entries with their remaining TTL, tags, and LRU order.
+
+```ruby
+# Save state before shutdown
+data = cache.snapshot
+File.write("cache.bin", Marshal.dump(data))
+
+# Restore on startup
+new_cache = Philiprehberger::CacheKit::Store.new(max_size: 500)
+new_cache.restore(Marshal.load(File.read("cache.bin")))
+```
+
 ## API
 
 | Method | Description |
@@ -118,7 +172,7 @@ cache.stats
 | `Store.new(max_size: 1000)` | Create a cache with max entries |
 | `Store#get(key)` | Get a value (nil if missing/expired) |
 | `Store#set(key, value, ttl:, tags:)` | Store a value |
-| `Store#fetch(key, ttl:, tags:, &block)` | Get or compute a value |
+| `Store#fetch(key, ttl:, tags:, &block)` | Get or compute a value (thread-safe) |
 | `Store#delete(key)` | Delete a key |
 | `Store#invalidate_tag(tag)` | Remove all entries with a tag |
 | `Store#clear` | Remove all entries |
@@ -128,7 +182,12 @@ cache.stats
 | `Store#[](key)` | Hash-like read (alias for `get`) |
 | `Store#[]=(key, value)` | Hash-like write (alias for `set` without TTL/tags) |
 | `Store#stats` | Returns `{ size:, hits:, misses:, evictions: }` |
+| `Store#stats(tag: name)` | Returns `{ hits:, misses:, evictions: }` for a tag |
 | `Store#prune` | Remove all expired entries, returns count removed |
+| `Store#on_evict { \|key, value\| }` | Register eviction callback |
+| `Store#get_many(keys)` | Batch get, returns `{ key => value }` hash |
+| `Store#snapshot` | Serialize cache state to a hash |
+| `Store#restore(data)` | Restore cache state from a snapshot |
 
 ## Development
 

data/lib/philiprehberger/cache_kit/batch.rb

@@ -0,0 +1,20 @@
+# frozen_string_literal: true
+
+module Philiprehberger
+  module CacheKit
+    # Batch operations for Store.
+    module Batch
+      # Retrieve multiple keys in a single lock acquisition.
+      #
+      # @param keys [Array<String>] cache keys to retrieve
+      # @return [Hash] key => value pairs (missing/expired keys map to nil)
+      def get_many(keys)
+        @mutex.synchronize do
+          keys.to_h do |key|
+            [key, fetch_entry(key)]
+          end
+        end
+      end
+    end
+  end
+end

data/lib/philiprehberger/cache_kit/callbacks.rb

@@ -0,0 +1,26 @@
+# frozen_string_literal: true
+
+module Philiprehberger
+  module CacheKit
+    # Eviction callback support for Store.
+    module Callbacks
+      # Register a callback invoked when entries are evicted.
+      #
+      # @yield [key, value] called on eviction (LRU or TTL expiry)
+      # @return [void]
+      def on_evict(&block)
+        @mutex.synchronize { @evict_callbacks << block }
+      end
+
+      private
+
+      def init_callbacks
+        @evict_callbacks = []
+      end
+
+      def fire_evict(key, value)
+        @evict_callbacks.each { |cb| cb.call(key, value) }
+      end
+    end
+  end
+end

data/lib/philiprehberger/cache_kit/eviction.rb

@@ -0,0 +1,60 @@
+# frozen_string_literal: true
+
+module Philiprehberger
+  module CacheKit
+    # Internal eviction and entry management for Store.
+    module Eviction
+      private
+
+      def touch(key)
+        @order.delete(key)
+        @order.push(key)
+      end
+
+      def fetch_entry(key)
+        entry = @data[key]
+        return record_miss(key) unless entry
+        return expire_and_miss(key) if entry.expired?
+
+        @hits += 1
+        record_tag_hit(entry)
+        touch(key)
+        entry.value
+      end
+
+      def record_miss(key)
+        @misses += 1
+        record_tag_miss_for(key)
+        nil
+      end
+
+      def expire_and_miss(key)
+        evict_entry(key)
+        @misses += 1
+        nil
+      end
+
+      def evict
+        oldest = @order.first
+        return unless oldest
+
+        evict_entry(oldest)
+      end
+
+      def evict_entry(key)
+        entry = @data[key]
+        return unless entry
+
+        fire_evict(key, entry.value)
+        record_tag_eviction(entry)
+        @evictions += 1
+        remove_entry(key)
+      end
+
+      def remove_entry(key)
+        @data.delete(key)
+        @order.delete(key)
+      end
+    end
+  end
+end

data/lib/philiprehberger/cache_kit/serializable.rb

@@ -0,0 +1,57 @@
+# frozen_string_literal: true
+
+module Philiprehberger
+  module CacheKit
+    # Snapshot and restore support for Store.
+    module Serializable
+      # Serialize current cache state for persistence.
+      #
+      # @return [Hash] serialized cache data
+      def snapshot
+        @mutex.synchronize { build_snapshot }
+      end
+
+      # Restore cache state from a previous snapshot.
+      #
+      # @param data [Hash] snapshot data from #snapshot
+      # @return [void]
+      def restore(data)
+        @mutex.synchronize { apply_snapshot(data) }
+      end
+
+      private
+
+      def build_snapshot
+        entries = @data.transform_values { |e| serialize_entry(e) }
+        { entries: entries, order: @order.dup }
+      end
+
+      def serialize_entry(entry)
+        { value: entry.value, ttl: remaining_ttl(entry), tags: entry.tags }
+      end
+
+      def remaining_ttl(entry)
+        original = entry.instance_variable_get(:@ttl)
+        return nil if original.nil?
+
+        remaining = original - (Time.now - entry.created_at)
+        remaining.positive? ? remaining : 0
+      end
+
+      def apply_snapshot(data)
+        @data.clear
+        @order.clear
+        restore_entries(data[:entries])
+        @order.replace(data[:order].select { |k| @data.key?(k) })
+      end
+
+      def restore_entries(entries)
+        entries.each do |key, attrs|
+          next if attrs[:ttl]&.zero?
+
+          @data[key] = Entry.new(attrs[:value], ttl: attrs[:ttl], tags: attrs[:tags] || [])
+        end
+      end
+    end
+  end
+end

data/lib/philiprehberger/cache_kit/store.rb

@@ -4,6 +4,12 @@ module Philiprehberger
   module CacheKit
     # Thread-safe in-memory LRU cache with TTL and tag-based invalidation.
     class Store
+      include Callbacks
+      include TagStats
+      include Batch
+      include Serializable
+      include Eviction
+
       # @param max_size [Integer] maximum number of entries (LRU eviction when exceeded)
       def initialize(max_size: 1000)
         @max_size = max_size
@@ -13,151 +19,109 @@ module Philiprehberger
         @hits = 0
         @misses = 0
         @evictions = 0
+        init_callbacks
+        init_tag_stats
       end
 
       # Get a value by key. Returns nil if missing or expired.
-      #
-      # @param key [String] the cache key
-      # @return the cached value, or nil
       def get(key)
         @mutex.synchronize { fetch_entry(key) }
       end
 
-      # Store a value.
-      #
-      # @param key [String] the cache key
-      # @param value the value to cache
-      # @param ttl [Numeric, nil] time-to-live in seconds
-      # @param tags [Array<String>] tags for bulk invalidation
-      # @return the stored value
+      # Store a value with optional TTL and tags.
       def set(key, value, ttl: nil, tags: [])
-        @mutex.synchronize do
-          remove_entry(key) if @data.key?(key)
-          evict if @data.size >= @max_size
-
-          @data[key] = Entry.new(value, ttl: ttl, tags: tags)
-          @order.push(key)
-          value
-        end
-      end
-
-      # Get or compute a value.
-      #
-      # @param key [String] the cache key
-      # @param ttl [Numeric, nil] TTL for newly computed values
-      # @param tags [Array<String>] tags for newly computed values
-      # @yield computes the value if not cached
-      # @return the cached or computed value
-      def fetch(key, ttl: nil, tags: [], &block)
-        value = get(key)
-        return value unless value.nil?
+        @mutex.synchronize { store_entry(key, value, ttl: ttl, tags: tags) }
+      end
 
-        computed = block.call
-        set(key, computed, ttl: ttl, tags: tags)
-        computed
+      # Get or compute a value (thread-safe).
+      def fetch(key, ttl: nil, tags: [], &block)
+        @mutex.synchronize { fetch_or_compute(key, ttl: ttl, tags: tags, &block) }
       end
 
       # @return [Boolean] true if the key existed
       def delete(key)
-        @mutex.synchronize { @data.key?(key).tap { remove_entry(key) } }
+        @mutex.synchronize { delete_entry(key) }
       end
 
       # Invalidate all entries with a given tag.
-      #
-      # @param tag [String] the tag to invalidate
-      # @return [Integer] number of entries removed
       def invalidate_tag(tag)
-        @mutex.synchronize do
-          tag_s = tag.to_s
-          keys = @data.select { |_, entry| entry.tags.include?(tag_s) }.keys
-          keys.each { |k| remove_entry(k) }
-          keys.size
-        end
+        @mutex.synchronize { invalidate_by_tag(tag) }
       end
 
-      # @return [void]
       def clear
         @mutex.synchronize { @data.clear && @order.clear }
       end
 
-      # @return [Integer] number of entries (including expired ones not yet evicted)
       def size
         @mutex.synchronize { @data.size }
       end
 
-      # @return [Boolean] true if the key exists and is not expired
       def key?(key)
-        @mutex.synchronize do
-          entry = @data[key]
-          entry ? !entry.expired? : false
-        end
+        @mutex.synchronize { key_present?(key) }
       end
 
-      # @return [Array<String>] list of valid keys
       def keys
-        @mutex.synchronize { @data.reject { |_, entry| entry.expired? }.keys }
+        @mutex.synchronize { @data.reject { |_, e| e.expired? }.keys }
       end
 
-      # @param key [String]
       def [](key) = get(key)
 
-      # @param key [String]
-      # @param value the value to cache
       def []=(key, value)
         set(key, value)
       end
 
-      # @return [Hash] stats with :size, :hits, :misses, :evictions
-      def stats
-        @mutex.synchronize { { size: @data.size, hits: @hits, misses: @misses, evictions: @evictions } }
+      # @return [Hash] cache statistics, optionally filtered by tag
+      def stats(tag: nil)
+        @mutex.synchronize { tag ? tag_stats_for(tag) : global_stats }
       end
 
-      # @return [Integer] number of entries removed
       def prune
-        @mutex.synchronize do
-          expired_keys = @data.select { |_, entry| entry.expired? }.keys
-          expired_keys.each { |k| remove_entry(k) }
-          expired_keys.size
-        end
+        @mutex.synchronize { prune_expired }
       end
 
       private
 
-      def touch(key)
-        @order.delete(key)
-        @order.push(key)
+      def global_stats
+        { size: @data.size, hits: @hits, misses: @misses, evictions: @evictions }
       end
 
-      def fetch_entry(key)
-        entry = @data[key]
-        return record_miss unless entry
+      def store_entry(key, value, ttl: nil, tags: [])
+        remove_entry(key) if @data.key?(key)
+        evict if @data.size >= @max_size
+        @data[key] = Entry.new(value, ttl: ttl, tags: tags)
+        @order.push(key)
+        value
+      end
 
-        if entry.expired?
-          remove_entry(key)
-          return record_miss
-        end
+      def fetch_or_compute(key, ttl: nil, tags: [], &block)
+        value = fetch_entry(key)
+        return value unless value.nil?
 
-        @hits += 1
-        touch(key)
-        entry.value
+        computed = block.call
+        store_entry(key, computed, ttl: ttl, tags: tags)
+        computed
       end
 
-      def record_miss
-        @misses += 1
-        nil
+      def delete_entry(key)
+        @data.key?(key).tap { remove_entry(key) }
       end
 
-      def evict
-        oldest = @order.first
-        return unless oldest
+      def invalidate_by_tag(tag)
+        tag_s = tag.to_s
+        matched = @data.select { |_, e| e.tags.include?(tag_s) }.keys
+        matched.each { |k| remove_entry(k) }
+        matched.size
+      end
 
-        remove_entry(oldest)
-        @evictions += 1
+      def key_present?(key)
+        entry = @data[key]
+        entry ? !entry.expired? : false
       end
 
-      def remove_entry(key)
-        @data.delete(key)
-        @order.delete(key)
+      def prune_expired
+        expired = @data.select { |_, e| e.expired? }.keys
+        expired.each { |k| evict_entry(k) }
+        expired.size
       end
     end
   end

data/lib/philiprehberger/cache_kit/tag_stats.rb

@@ -0,0 +1,42 @@
+# frozen_string_literal: true
+
+module Philiprehberger
+  module CacheKit
+    # Per-tag hit/miss/eviction tracking for Store.
+    module TagStats
+      private
+
+      def init_tag_stats
+        @tag_hits = Hash.new(0)
+        @tag_misses = Hash.new(0)
+        @tag_evictions = Hash.new(0)
+      end
+
+      def record_tag_hit(entry)
+        entry.tags.each { |t| @tag_hits[t] += 1 }
+      end
+
+      def record_tag_miss_for(key)
+        find_tags_for_key(key).each { |t| @tag_misses[t] += 1 }
+      end
+
+      def record_tag_eviction(entry)
+        entry.tags.each { |t| @tag_evictions[t] += 1 }
+      end
+
+      def find_tags_for_key(key)
+        entry = @data[key]
+        entry ? entry.tags : []
+      end
+
+      def tag_stats_for(tag)
+        tag_s = tag.to_s
+        {
+          hits: @tag_hits[tag_s],
+          misses: @tag_misses[tag_s],
+          evictions: @tag_evictions[tag_s]
+        }
+      end
+    end
+  end
+end

data/lib/philiprehberger/cache_kit/version.rb

@@ -2,6 +2,6 @@
 
 module Philiprehberger
   module CacheKit
-    VERSION = "0.2.2"
+    VERSION = "0.3.1"
   end
 end

data/lib/philiprehberger/cache_kit.rb

@@ -2,6 +2,11 @@
 
 require_relative "cache_kit/version"
 require_relative "cache_kit/entry"
+require_relative "cache_kit/callbacks"
+require_relative "cache_kit/tag_stats"
+require_relative "cache_kit/batch"
+require_relative "cache_kit/serializable"
+require_relative "cache_kit/eviction"
 require_relative "cache_kit/store"
 
 module Philiprehberger

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: philiprehberger-cache_kit
 version: !ruby/object:Gem::Version
-  version: 0.2.2
+  version: 0.3.1
 platform: ruby
 authors:
 - Philip Rehberger
 autorequire:
 bindir: bin
 cert_chain: []
-date: 2026-03-16 00:00:00.000000000 Z
+date: 2026-03-22 00:00:00.000000000 Z
 dependencies: []
 description: A lightweight, thread-safe in-memory LRU cache with TTL expiration and
   tag-based bulk invalidation for Ruby applications.
@@ -22,8 +22,13 @@ files:
 - LICENSE
 - README.md
 - lib/philiprehberger/cache_kit.rb
+- lib/philiprehberger/cache_kit/batch.rb
+- lib/philiprehberger/cache_kit/callbacks.rb
 - lib/philiprehberger/cache_kit/entry.rb
+- lib/philiprehberger/cache_kit/eviction.rb
+- lib/philiprehberger/cache_kit/serializable.rb
 - lib/philiprehberger/cache_kit/store.rb
+- lib/philiprehberger/cache_kit/tag_stats.rb
 - lib/philiprehberger/cache_kit/version.rb
 homepage: https://github.com/philiprehberger/rb-cache-kit
 licenses:
@@ -32,6 +37,7 @@ metadata:
   homepage_uri: https://github.com/philiprehberger/rb-cache-kit
   source_code_uri: https://github.com/philiprehberger/rb-cache-kit
   changelog_uri: https://github.com/philiprehberger/rb-cache-kit/blob/main/CHANGELOG.md
+  bug_tracker_uri: https://github.com/philiprehberger/rb-cache-kit/issues
   rubygems_mfa_required: 'true'
 post_install_message:
 rdoc_options: []