Struct ResourceKey 

pub struct ResourceKey {
    pub adapter: String,
    pub fields: BTreeMap<String, String>,
}

Structural value identity for a shared resource.

Two adapters that build equal ResourceKeys receive the same instance under Shared policy. The internal BTreeMap is sorted so equality is deterministic, and Hash is derived structurally for HashMap lookup. The pool never asks adapters to produce a “key digest”; the contract is value equality on the public type.

Adapters populate fields with only the params that distinguish one instance from another. Per-statement and per-phase shaping (timeouts, trace rates, dynamic controls) MUST NOT appear in the key — see SRD-35 §“Instance-shaping vs shell-shaping params”.

Fields

adapter: String

Adapter name ("cql", "http", …) — the adapter-name surface, not the engine-specific driver identifier (which the adapter folds into the fields when meaningful).

fields: BTreeMap<String, String>

Identity-bearing param values, sorted so equality is independent of insertion order.

Implementations

impl ResourceKey

pub fn new(adapter: impl Into<String>) -> Self

Construct a key for the given adapter with no fields yet. Chain Self::with to populate.

pub fn with(self, key: impl Into<String>, value: impl Into<String>) -> Self

Set or replace the value for one identity-bearing field, returning self for chaining.

pub fn fmt_for_log(&self) -> String

Render the key for a single line of log output (adapter{k1=v1,k2=v2}). Stable shape — the lifecycle-event surface relies on this format being consistent across log consumers.

pub fn render_key(&self) -> String

SRD-104 — the canonical fingerprint rendering of this key to a stable string, used as the accessor lookup key (polydat::ResourceAccessor::lookup). Unlike Self::fmt_for_log this rendering is identity-preserving: two keys that differ only in an identity-bearing field (e.g. password) MUST render to different strings or they would collide in the accessor. A secret field (password, _secret_*) contributes a SHA-256 digest of its value rather than the value itself, so the fingerprint keeps its identity without ever carrying the cleartext into a kernel binding or a diagnostic. The BTreeMap makes the field order deterministic, so equal keys always render identically.

This is the single rendering shared by both sides of the SRD-104 bridge: the resource pool renders each live entry’s key with it when resolving a lookup, and a consumer node builds the same string from the fingerprint in scope. Shape: adapter{k1=v1,k2=v2}.

Trait Implementations

impl Clone for ResourceKey

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ResourceKey

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

Formats the value using the given formatter.

impl Default for ResourceKey

fn default() -> Self

Returns the “default value” for a type.

impl Eq for ResourceKey

impl Hash for ResourceKey

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

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 ResourceKey

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for ResourceKey