Erik JohnstonandClaude Fable 5.1 e1df32f1ea Weigh Rust cache entries, and let callers fill a cache directly ...

The Rust `Cache` bounded itself by entry count, through `lru`'s capacity.
The state resolution caches need a bound on the sum of what their values
weigh: a state map counts for its entries, a chain's links for each link,
as Python's `size_callback` caches do. So the bound is now a weight, with
a `Weigher` chosen at construction and the default weighing every value
as one, and the cache enforces it itself over an unbounded `lru`.

Those caches are also filled by readers that load a batch of keys in one
statement rather than through `get_or_load`, so `Cache::insert` is now
public, with `prefill` semantics: it leaves any in-flight load for the
key to answer its waiters and cache what it found.

A cache key that is a single string or integer now decodes from Python,
as the keys of the caches moving here are event IDs and group IDs.

Co-Authored-By: Claude Fable 5.1 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_0194eNQP5weBtVMg8NKtc6VU

2026-10-14 12:52:37 +00:00

..

benches

Add push rules for MSC4075: MatrixRTC invites and notifications (#20227)

2026-09-25 10:40:24 +00:00

src

Weigh Rust cache entries, and let callers fill a cache directly

2026-10-14 12:52:37 +00:00

build.rs

resolves #19403 Report the rust compiler version used in the prometheus metrics (#19643)

2026-04-03 11:21:23 +02:00

Cargo.toml

Add a cache for database functions that live in Rust

2026-10-14 12:41:47 +00:00

clippy.toml

Move per-homeserver Rust state into a RustRuntime object on the HomeServer (#20011)

2026-09-21 18:48:37 +01:00