Struct ShardSet 

pub struct ShardSet { /* private fields */ }

The configured set of shards plus the routing strategy.

Cheap to clone (a single Arc). Available from AppState::shards and through the Shards extractor.

Implementations

impl ShardSet

pub fn len(&self) -> usize

Number of configured shards.

pub fn is_empty(&self) -> bool

Whether the set contains no shards.

pub const fn slot_count(&self) -> u16

Number of logical slots — the fixed SLOT_COUNT (16384).

pub fn get(&self, id: ShardId) -> Option<&Shard>

Shard by positional id.

pub fn by_name(&self, name: &str) -> Option<&Shard>

Shard by configured name.

pub fn iter(&self) -> impl Iterator<Item = &Shard>

Iterate shards in declaration order.

pub fn slot_for_key<'k>(&self, key: impl Into<ShardKey<'k>>) -> SlotId

Map a routing key onto its logical slot (deterministic hash; see the module docs for the permanence guarantee).

pub fn shard_for_slot(&self, slot: SlotId) -> Option<&Shard>

Owner of a logical slot per the configured slot map.

pub async fn route<'k>( &self, key: impl Into<ShardKey<'k>>, ) -> Result<&Shard, AutumnError>

Resolve the shard that owns key via the installed ShardRouter.

Errors

Returns the router’s error, or an internal error if the router produced an out-of-range ShardId.

pub fn total_max_connections(&self) -> usize

Total configured max_size across every pool in the set (primaries plus replicas). Logged at startup so N-shard deployments notice multiplied connection counts.

pub fn owns_key<'k>( &self, shard_id: ShardId, key: impl Into<ShardKey<'k>>, ) -> bool

Whether key is owned by the shard at the given index in declaration order.

Uses the hash-based slot assignment, not the installed router (which may override routing for individual tenants via a directory). Use this for tooling / slot-move scripts where you need to verify ownership without issuing an async router call.

pub fn slots_for_shard(&self, shard_id: ShardId) -> Option<&[u16]>

All logical slots assigned to the shard at index shard_id.

Returns None when the id is out of range.

pub fn partition_by_shard<'k>( &self, keys: impl IntoIterator<Item = &'k str>, ) -> HashMap<ShardId, Vec<&'k str>>

Partition string keys by their owning shard based on hash-slot assignment.

Keys are grouped in declaration order; the returned map may have fewer entries than self.len() when some shards own none of the given keys. Useful for slot-move tooling that needs to issue WHERE tenant_id = ANY($1) per destination shard.

Trait Implementations

impl Clone for ShardSet

fn clone(&self) -> ShardSet

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ShardSet

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

Formats the value using the given formatter.