Insert a new MoqtObject, preserving sorted order (duplicates allowed or replaced impl‑defined).
Remove all cached objects.
Return the object whose Location exactly matches (group & object) or undefined if absent.
Return a shallow copy array of objects whose Location is >= start and < end (end exclusive).
Current number of cached objects.
In‑memory index of MoqtObject instances keyed by their Location (group/subgroup/object), providing ordered insertion and range queries.
Implementations MUST keep objects sorted ascending by (groupId, objectId) so binary searches can locate insertion points / range bounds efficiently. Subgroup ordinality is currently ignored for ordering (adjust if protocol semantics require finer granularity later).
Example: Typical usage
Concurrency: Implementations here are not thread‑safe; callers avoid concurrent mutation from workers.