pub struct Gates {
pub tables: HashMap<String, TableGate>,
/* private fields */
}Expand description
The gate model for a database handle, computed from the live schema at open.
Maps each gated-or-inheriting synced table to how it resolves its gate. A synced table absent from this map is ungated and unconditionally shared.
Fields§
§tables: HashMap<String, TableGate>Implementations§
Source§impl Gates
impl Gates
pub fn has_scoped_graph(&self) -> bool
pub fn table_is_scoped(&self, table: &str) -> bool
Sourcepub fn scoped_table_names(&self) -> Vec<String>
pub fn scoped_table_names(&self) -> Vec<String>
Every scoped table, sorted, so a pass over the scoped graph visits them in one order whatever the gate map’s iteration order is.
Sourcepub fn sorted_synced_table_names(&self) -> Vec<String>
pub fn sorted_synced_table_names(&self) -> Vec<String>
Every synced table, sorted.
pub fn is_synced_table(&self, table: &str) -> bool
pub fn synced_table_names(&self) -> impl Iterator<Item = &str>
pub fn row_identity(&self, table: &str) -> Option<RowIdentity>
Auto Trait Implementations§
impl Freeze for Gates
impl RefUnwindSafe for Gates
impl Send for Gates
impl Sync for Gates
impl Unpin for Gates
impl UnsafeUnpin for Gates
impl UnwindSafe for Gates
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more