Enum IdKind 

pub enum IdKind {
    Process,
    Block,
    ProcessOrStream,
}

Which table resolves the id to its owning process. Also the cache’s key discriminator: the same Uuid can legitimately be a process_id in one audience and a stream_id/block_id in another (all three are client-supplied at ingestion, with no cross-table uniqueness constraint), so caching by kind keeps those disjoint instead of relying on downstream emptiness to make a wrong-kind hit harmless.

Variants

Process

processes.process_id.

Block

blocks.block_id -> blocks.process_id -> processes.

ProcessOrStream

list_partitions’ view_instance_id: either a process_id or a stream_id, resolved in one round trip. Cached under its own key rather than reusing Process/Block entries or a separate streams kind, so the UNION ALL result – fail-closed on a collision between the two arms, see merge_owner_rows – is what actually gets cached. A second consumer, AudienceGuard::authorize_view_instance’s scan-time check on view_instance(...), resolves its view_instance_id argument through the same kind, sharing cache entries with list_partitions’ row filter over the same id.

Trait Implementations

impl Clone for IdKind

fn clone(&self) -> IdKind

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Copy for IdKind

impl Debug for IdKind

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl Eq for IdKind

impl Hash for IdKind

fn hash<__H>(&self, state: &mut __H)

where __H: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for IdKind

fn eq(&self, other: &IdKind) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for IdKind