Struct GroupGraph 

pub struct GroupGraph { /* private fields */ }

A loaded, in-memory snapshot of the groups/group_members tables, and the closure resolver over it. Sync and infallible once built: every method here is a walk over an already-loaded snapshot, never a query.

Implementations

impl GroupGraph

pub fn from_rows( groups: impl IntoIterator<Item = String>, members: impl IntoIterator<Item = (String, String)>, ) -> Result<GroupGraph, Error>

Builds a graph from (name) rows out of groups and (group_name, member) rows out of group_members. Re-runs the name charset and valid_selector checks the way AudienceGrants::from_rows does, so a row that slipped past the tables’ own CHECK constraints (e.g. via a direct psql session) fails the snapshot load rather than reaching a decision.

pub fn group_names(&self) -> impl Iterator<Item = &String>

Every known group name, sorted.

pub fn contains_group(&self, name: &str) -> bool

Whether name is a known group.

pub fn closure(&self, email: Option<&str>) -> Vec<String>

The caller’s resolved, transitive group membership: a breadth-first walk upward from the caller, seeded at the groups listed under the selectors * and user:<email> (when email is Some). Returned sorted, deduplicated. Sync and infallible: the graph is an already-loaded snapshot.

pub fn has_wildcard_admin(&self) -> bool

true when the wildcard selector * reaches ADMINS_GROUP – directly (('admins', '*')) or through nesting. Reuses the same upward walk as Self::closure, seeded at * alone (no caller email).

pub fn any_principal_reaches(&self, target: &str) -> bool

true when target is reachable from some principal – the wildcard * selector or any user:<email> selector present in the snapshot – directly or through nesting. Generalizes Self::has_wildcard_admin (which seeds the walk from * alone) to seed from every base selector on record, so a caller can check “would target still be reachable by anyone” rather than “by * specifically” – e.g. before removing a membership that would strand ADMINS_GROUP behind a user-only or nested-only path.

pub fn nesting_would_cycle(&self, group: &str, nested: &str) -> bool

Whether adding group:nested as a member of group would create a cycle: nested == group, or nested is already reachable upward from group (a walk seeded at group reaches it – i.e. group is already, directly or transitively, nested into nested).

Trait Implementations

impl Clone for GroupGraph

fn clone(&self) -> GroupGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GroupGraph

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

Formats the value using the given formatter.

impl Default for GroupGraph

fn default() -> GroupGraph

Returns the “default value” for a type.