#[non_exhaustive]#[repr(u8)]pub enum IndexType {
BTree = 0,
Hash = 1,
}Expand description
What strategy does the database index use?
See also: https://www.postgresql.org/docs/current/sql-createindex.html
Variants (Non-exhaustive)§
This enum is marked as non-exhaustive
Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.
BTree = 0
Indexing works by putting the index key into a b-tree.
Hash = 1
Indexing works by hashing the index key.
Auto Trait Implementations§
impl Freeze for IndexType
impl RefUnwindSafe for IndexType
impl Send for IndexType
impl Sync for IndexType
impl Unpin for IndexType
impl UnsafeUnpin for IndexType
impl UnwindSafe for IndexType
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
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more