Struct TablePerms 

pub struct TablePerms(/* private fields */);

Per-table permission bits.

Bits combine via the BitOr/BitAnd operators provided by [bitflags]. The wire encoding is a single u8, mirrored on the IC canister surface as a Candid nat8.

Implementations

impl TablePerms

pub const READ: TablePerms

Permission to run SELECT / aggregate against the table.

pub const INSERT: TablePerms

Permission to run INSERT against the table.

pub const UPDATE: TablePerms

Permission to run UPDATE against the table.

pub const DELETE: TablePerms

Permission to run DELETE against the table.

impl TablePerms

pub const fn empty() -> TablePerms

Get a flags value with all bits unset.

pub const fn all() -> TablePerms

Get a flags value with all known bits set.

pub const fn bits(&self) -> u8

Get the underlying bits value.

The returned value is exactly the bits set in this flags value.

pub const fn from_bits(bits: u8) -> Option<TablePerms>

Convert from a bits value.

This method will return None if any unknown bits are set.

pub const fn from_bits_truncate(bits: u8) -> TablePerms

Convert from a bits value, unsetting any unknown bits.

pub const fn from_bits_retain(bits: u8) -> TablePerms

Convert from a bits value exactly.

pub fn from_name(name: &str) -> Option<TablePerms>

Get a flags value with the bits of a flag with the given name set.

This method will return None if name is empty or doesn’t correspond to any named flag.

pub const fn is_empty(&self) -> bool

Whether all bits in self are unset.

pub const fn is_all(&self) -> bool

Whether all known bits in this flags value are set.

pub const fn intersects(&self, other: TablePerms) -> bool

Whether any set bits in other are also set in self.

pub const fn contains(&self, other: TablePerms) -> bool

Whether all set bits in other are also set in self.

pub fn insert(&mut self, other: TablePerms)

The bitwise or (|) of the bits in self and other.

pub fn remove(&mut self, other: TablePerms)

The intersection of self with the complement of other (&!).

This method is not equivalent to self & !other when other has unknown bits set. remove won’t truncate other, but the ! operator will.

pub fn toggle(&mut self, other: TablePerms)

The bitwise exclusive-or (^) of the bits in self and other.

pub fn set(&mut self, other: TablePerms, value: bool)

Call insert when value is true or remove when value is false.

pub const fn intersection(self, other: TablePerms) -> TablePerms

The bitwise and (&) of the bits in self and other.

pub const fn union(self, other: TablePerms) -> TablePerms

The bitwise or (|) of the bits in self and other.

pub const fn difference(self, other: TablePerms) -> TablePerms

The intersection of self with the complement of other (&!).

This method is not equivalent to self & !other when other has unknown bits set. difference won’t truncate other, but the ! operator will.

pub const fn symmetric_difference(self, other: TablePerms) -> TablePerms

The bitwise exclusive-or (^) of the bits in self and other.

pub const fn complement(self) -> TablePerms

The bitwise negation (!) of the bits in self, truncating the result.

impl TablePerms

pub const fn iter(&self) -> Iter<TablePerms>

Yield a set of contained flags values.

Each yielded flags value will correspond to a defined named flag. Any unknown bits will be yielded together as a final flags value.

pub const fn iter_names(&self) -> IterNames<TablePerms>

Yield a set of contained named flags values.

This method is like iter, except only yields bits in contained named flags. Any unknown bits, or bits not corresponding to a contained flag will not be yielded.

Trait Implementations

impl Binary for TablePerms

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

Formats the value using the given formatter.

impl BitAnd for TablePerms

fn bitand(self, other: TablePerms) -> TablePerms

The bitwise and (&) of the bits in self and other.

type Output = TablePerms

The resulting type after applying the & operator.

impl BitAndAssign for TablePerms

fn bitand_assign(&mut self, other: TablePerms)

The bitwise and (&) of the bits in self and other.

impl BitOr for TablePerms

fn bitor(self, other: TablePerms) -> TablePerms

The bitwise or (|) of the bits in self and other.

type Output = TablePerms

The resulting type after applying the | operator.

impl BitOrAssign for TablePerms

fn bitor_assign(&mut self, other: TablePerms)

The bitwise or (|) of the bits in self and other.

impl BitXor for TablePerms

fn bitxor(self, other: TablePerms) -> TablePerms

The bitwise exclusive-or (^) of the bits in self and other.

type Output = TablePerms

The resulting type after applying the ^ operator.

impl BitXorAssign for TablePerms

fn bitxor_assign(&mut self, other: TablePerms)

The bitwise exclusive-or (^) of the bits in self and other.

impl CandidType for TablePerms

Available on crate feature candid only.

fn _ty() -> Type

fn idl_serialize<S>( &self, serializer: S, ) -> Result<(), <S as Serializer>::Error>

where S: Serializer,

fn ty() -> Type

fn id() -> TypeId

fn _ty_doc() -> TypeDoc

impl Clone for TablePerms

fn clone(&self) -> TablePerms

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TablePerms

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

Formats the value using the given formatter.

impl Default for TablePerms

fn default() -> TablePerms

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for TablePerms

fn deserialize<__D>( __deserializer: __D, ) -> Result<TablePerms, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Extend<TablePerms> for TablePerms

fn extend<T>(&mut self, iterator: T)

where T: IntoIterator<Item = TablePerms>,

The bitwise or (|) of the bits in each flags value.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl Flags for TablePerms

const FLAGS: &'static [Flag<TablePerms>]

The set of defined flags.

type Bits = u8

The underlying bits type.

fn bits(&self) -> u8

Get the underlying bits value.

fn from_bits_retain(bits: u8) -> TablePerms

Convert from a bits value exactly.

fn empty() -> Self

Get a flags value with all bits unset.

fn all() -> Self

Get a flags value with all known bits set.

fn known_bits(&self) -> Self::Bits

Get the known bits from a flags value.

fn unknown_bits(&self) -> Self::Bits

Get the unknown bits from a flags value.

fn contains_unknown_bits(&self) -> bool

This method will return true if any unknown bits are set.

fn from_bits(bits: Self::Bits) -> Option<Self>

Convert from a bits value.

fn from_bits_truncate(bits: Self::Bits) -> Self

Convert from a bits value, unsetting any unknown bits.

fn from_name(name: &str) -> Option<Self>

Get a flags value with the bits of a flag with the given name set.

fn iter(&self) -> Iter<Self>

Yield a set of contained flags values.

fn iter_names(&self) -> IterNames<Self>

Yield a set of contained named flags values.

fn iter_defined_names() -> IterDefinedNames<Self>

Yield a set of all named flags defined by Self::FLAGS.

fn is_empty(&self) -> bool

Whether all bits in this flags value are unset.

fn is_all(&self) -> bool

Whether all known bits in this flags value are set.

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

where Self: Sized,

Whether any set bits in other are also set in self.

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

where Self: Sized,

Whether all set bits in other are also set in self.

fn truncate(&mut self)

where Self: Sized,

Remove any unknown bits from the flags.

fn insert(&mut self, other: Self)

where Self: Sized,

The bitwise or (|) of the bits in self and other.

fn remove(&mut self, other: Self)

where Self: Sized,

The intersection of self with the complement of other (&!).

fn toggle(&mut self, other: Self)

where Self: Sized,

The bitwise exclusive-or (^) of the bits in self and other.

fn set(&mut self, other: Self, value: bool)

where Self: Sized,

Call Flags::insert when value is true or Flags::remove when value is false.

fn clear(&mut self)

where Self: Sized,

Unsets all bits in the flags.

fn intersection(self, other: Self) -> Self

The bitwise and (&) of the bits in self and other.

fn union(self, other: Self) -> Self

The bitwise or (|) of the bits in self and other.

fn difference(self, other: Self) -> Self

The intersection of self with the complement of other (&!).

fn symmetric_difference(self, other: Self) -> Self

The bitwise exclusive-or (^) of the bits in self and other.

fn complement(self) -> Self

The bitwise negation (!) of the bits in self, truncating the result.

impl FromIterator<TablePerms> for TablePerms

fn from_iter<T>(iterator: T) -> TablePerms

where T: IntoIterator<Item = TablePerms>,

The bitwise or (|) of the bits in each flags value.

impl Hash for TablePerms

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 IntoIterator for TablePerms

type Item = TablePerms

The type of the elements being iterated over.

type IntoIter = Iter<TablePerms>

Which kind of iterator are we turning this into?

fn into_iter(self) -> <TablePerms as IntoIterator>::IntoIter

Creates an iterator from a value.

impl LowerHex for TablePerms

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

Formats the value using the given formatter.

impl Not for TablePerms

fn not(self) -> TablePerms

The bitwise negation (!) of the bits in self, truncating the result.

type Output = TablePerms

The resulting type after applying the ! operator.

impl Octal for TablePerms

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

Formats the value using the given formatter.

impl PartialEq for TablePerms

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for TablePerms

fn serialize<__S>( &self, __serializer: __S, ) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Sub for TablePerms

fn sub(self, other: TablePerms) -> TablePerms

The intersection of self with the complement of other (&!).

This method is not equivalent to self & !other when other has unknown bits set. difference won’t truncate other, but the ! operator will.

type Output = TablePerms

The resulting type after applying the - operator.

impl SubAssign for TablePerms

fn sub_assign(&mut self, other: TablePerms)

The intersection of self with the complement of other (&!).

This method is not equivalent to self & !other when other has unknown bits set. difference won’t truncate other, but the ! operator will.

impl UpperHex for TablePerms

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

Formats the value using the given formatter.

impl Copy for TablePerms

impl Eq for TablePerms

impl StructuralPartialEq for TablePerms