pub struct DatabaseFlags(/* private fields */);
Expand description
LMDB database flags (see http://www.lmdb.tech/doc/group__mdb__dbi__open.html for more details).
Implementations§
Source§impl DatabaseFlags
impl DatabaseFlags
Sourcepub const REVERSE_KEY: Self = _
pub const REVERSE_KEY: Self = _
Use reverse string keys.
use heed::types::*;
use heed::byteorder::BigEndian;
let mut wtxn = env.write_txn()?;
let db = env.database_options()
.types::<Str, Unit>()
.flags(DatabaseFlags::REVERSE_KEY)
.name("reverse-key")
.create(&mut wtxn)?;
db.put(&mut wtxn, &"bonjour", &())?;
db.put(&mut wtxn, &"hello", &())?;
db.put(&mut wtxn, &"holla", &())?;
let mut iter = db.iter(&wtxn)?;
assert_eq!(iter.next().transpose()?, Some(("holla", ())));
assert_eq!(iter.next().transpose()?, Some(("hello", ())));
assert_eq!(iter.next().transpose()?, Some(("bonjour", ())));
assert_eq!(iter.next().transpose()?, None);
drop(iter);
let mut iter = db.rev_iter(&wtxn)?;
assert_eq!(iter.next().transpose()?, Some(("bonjour", ())));
assert_eq!(iter.next().transpose()?, Some(("hello", ())));
assert_eq!(iter.next().transpose()?, Some(("holla", ())));
assert_eq!(iter.next().transpose()?, None);
drop(iter);
wtxn.commit()?;
Sourcepub const DUP_SORT: Self = _
pub const DUP_SORT: Self = _
Use sorted duplicates.
use heed::types::*;
use heed::byteorder::BigEndian;
type BEI64 = I64<BigEndian>;
let mut wtxn = env.write_txn()?;
let db = env.database_options()
.types::<BEI64, BEI64>()
.flags(DatabaseFlags::DUP_SORT)
.name("dup-sort")
.create(&mut wtxn)?;
db.put(&mut wtxn, &68, &120)?;
db.put(&mut wtxn, &68, &121)?;
db.put(&mut wtxn, &68, &122)?;
db.put(&mut wtxn, &68, &123)?;
db.put(&mut wtxn, &92, &32)?;
db.put(&mut wtxn, &35, &120)?;
db.put(&mut wtxn, &0, &120)?;
db.put(&mut wtxn, &42, &120)?;
let mut iter = db.get_duplicates(&wtxn, &68)?.expect("the key exists");
assert_eq!(iter.next().transpose()?, Some((68, 120)));
assert_eq!(iter.next().transpose()?, Some((68, 121)));
assert_eq!(iter.next().transpose()?, Some((68, 122)));
assert_eq!(iter.next().transpose()?, Some((68, 123)));
assert_eq!(iter.next().transpose()?, None);
drop(iter);
let mut iter = db.get_duplicates(&wtxn, &68)?.expect("the key exists");
assert_eq!(iter.last().transpose()?, Some((68, 123)));
assert!(db.delete_one_duplicate(&mut wtxn, &68, &121)?, "The entry must exist");
let mut iter = db.get_duplicates(&wtxn, &68)?.expect("the key exists");
assert_eq!(iter.next().transpose()?, Some((68, 120)));
// No more (68, 121) returned here!
assert_eq!(iter.next().transpose()?, Some((68, 122)));
assert_eq!(iter.next().transpose()?, Some((68, 123)));
assert_eq!(iter.next().transpose()?, None);
drop(iter);
wtxn.commit()?;
Sourcepub const INTEGER_KEY: Self = _
pub const INTEGER_KEY: Self = _
Numeric keys in native byte order: either u32
or usize
.
The keys must all be of the same size.
use heed::types::*;
use heed::byteorder::BigEndian;
type BEI32 = I32<BigEndian>;
let mut wtxn = env.write_txn()?;
let db = env.database_options()
.types::<BEI32, BEI32>()
.flags(DatabaseFlags::INTEGER_KEY)
.name("integer-key")
.create(&mut wtxn)?;
db.put(&mut wtxn, &68, &120)?;
db.put(&mut wtxn, &92, &32)?;
db.put(&mut wtxn, &35, &120)?;
db.put(&mut wtxn, &0, &120)?;
db.put(&mut wtxn, &42, &120)?;
let mut iter = db.iter(&wtxn)?;
assert_eq!(iter.next().transpose()?, Some((0, 120)));
assert_eq!(iter.next().transpose()?, Some((35, 120)));
assert_eq!(iter.next().transpose()?, Some((42, 120)));
assert_eq!(iter.next().transpose()?, Some((68, 120)));
assert_eq!(iter.next().transpose()?, Some((92, 32)));
assert_eq!(iter.next().transpose()?, None);
drop(iter);
wtxn.commit()?;
Sourcepub const DUP_FIXED: Self = _
pub const DUP_FIXED: Self = _
With DatabaseFlags::DUP_SORT
, sorted dup items have fixed size.
use heed::types::*;
use heed::byteorder::BigEndian;
type BEI64 = I64<BigEndian>;
let mut wtxn = env.write_txn()?;
let db = env.database_options()
.types::<BEI64, BEI64>()
.flags(DatabaseFlags::DUP_SORT | DatabaseFlags::DUP_FIXED)
.name("dup-sort-fixed")
.create(&mut wtxn)?;
db.put(&mut wtxn, &68, &120)?;
db.put(&mut wtxn, &68, &121)?;
db.put(&mut wtxn, &68, &122)?;
db.put(&mut wtxn, &68, &123)?;
db.put(&mut wtxn, &92, &32)?;
db.put(&mut wtxn, &35, &120)?;
db.put(&mut wtxn, &0, &120)?;
db.put(&mut wtxn, &42, &120)?;
let mut iter = db.get_duplicates(&wtxn, &68)?.expect("the key exists");
assert_eq!(iter.next().transpose()?, Some((68, 120)));
assert_eq!(iter.next().transpose()?, Some((68, 121)));
assert_eq!(iter.next().transpose()?, Some((68, 122)));
assert_eq!(iter.next().transpose()?, Some((68, 123)));
assert_eq!(iter.next().transpose()?, None);
drop(iter);
let mut iter = db.get_duplicates(&wtxn, &68)?.expect("the key exists");
assert_eq!(iter.last().transpose()?, Some((68, 123)));
assert!(db.delete_one_duplicate(&mut wtxn, &68, &121)?, "The entry must exist");
let mut iter = db.get_duplicates(&wtxn, &68)?.expect("the key exists");
assert_eq!(iter.next().transpose()?, Some((68, 120)));
// No more (68, 121) returned here!
assert_eq!(iter.next().transpose()?, Some((68, 122)));
assert_eq!(iter.next().transpose()?, Some((68, 123)));
assert_eq!(iter.next().transpose()?, None);
drop(iter);
wtxn.commit()?;
Sourcepub const INTEGER_DUP: Self = _
pub const INTEGER_DUP: Self = _
With [DatabaseKey::DUP_SORT
], dups are [DatabaseKey::INTEGER_KEY
]-style integers.
use heed::types::*;
use heed::byteorder::BigEndian;
type BEI32 = I32<BigEndian>;
let mut wtxn = env.write_txn()?;
let db = env.database_options()
.types::<BEI32, BEI32>()
.flags(DatabaseFlags::DUP_SORT | DatabaseFlags::INTEGER_DUP)
.name("dup-sort-integer-dup")
.create(&mut wtxn)?;
db.put(&mut wtxn, &68, &120)?;
db.put(&mut wtxn, &68, &121)?;
db.put(&mut wtxn, &68, &122)?;
db.put(&mut wtxn, &68, &123)?;
db.put(&mut wtxn, &92, &32)?;
db.put(&mut wtxn, &35, &120)?;
db.put(&mut wtxn, &0, &120)?;
db.put(&mut wtxn, &42, &120)?;
let mut iter = db.get_duplicates(&wtxn, &68)?.expect("the key exists");
assert_eq!(iter.next().transpose()?, Some((68, 120)));
assert_eq!(iter.next().transpose()?, Some((68, 121)));
assert_eq!(iter.next().transpose()?, Some((68, 122)));
assert_eq!(iter.next().transpose()?, Some((68, 123)));
assert_eq!(iter.next().transpose()?, None);
drop(iter);
let mut iter = db.get_duplicates(&wtxn, &68)?.expect("the key exists");
assert_eq!(iter.last().transpose()?, Some((68, 123)));
assert!(db.delete_one_duplicate(&mut wtxn, &68, &121)?, "The entry must exist");
let mut iter = db.get_duplicates(&wtxn, &68)?.expect("the key exists");
assert_eq!(iter.next().transpose()?, Some((68, 120)));
// No more (68, 121) returned here!
assert_eq!(iter.next().transpose()?, Some((68, 122)));
assert_eq!(iter.next().transpose()?, Some((68, 123)));
assert_eq!(iter.next().transpose()?, None);
drop(iter);
wtxn.commit()?;
Sourcepub const REVERSE_DUP: Self = _
pub const REVERSE_DUP: Self = _
With [DatabaseKey::DUP_SORT
], use reverse string dups.
use heed::types::*;
use heed::byteorder::BigEndian;
type BEI64 = I64<BigEndian>;
let mut wtxn = env.write_txn()?;
let db = env.database_options()
.types::<BEI64, Str>()
.flags(DatabaseFlags::DUP_SORT | DatabaseFlags::REVERSE_DUP)
.name("dup-sort")
.create(&mut wtxn)?;
db.put(&mut wtxn, &68, &"bonjour")?;
db.put(&mut wtxn, &68, &"holla")?;
db.put(&mut wtxn, &68, &"hello")?;
db.put(&mut wtxn, &92, &"hallo")?;
let mut iter = db.get_duplicates(&wtxn, &68)?.expect("the key exists");
assert_eq!(iter.next().transpose()?, Some((68, "holla")));
assert_eq!(iter.next().transpose()?, Some((68, "hello")));
assert_eq!(iter.next().transpose()?, Some((68, "bonjour")));
assert_eq!(iter.next().transpose()?, None);
drop(iter);
wtxn.commit()?;
Source§impl DatabaseFlags
impl DatabaseFlags
Sourcepub const fn bits(&self) -> u32
pub const fn bits(&self) -> u32
Get the underlying bits value.
The returned value is exactly the bits set in this flags value.
Sourcepub const fn from_bits(bits: u32) -> Option<Self>
pub const fn from_bits(bits: u32) -> Option<Self>
Convert from a bits value.
This method will return None
if any unknown bits are set.
Sourcepub const fn from_bits_truncate(bits: u32) -> Self
pub const fn from_bits_truncate(bits: u32) -> Self
Convert from a bits value, unsetting any unknown bits.
Sourcepub const fn from_bits_retain(bits: u32) -> Self
pub const fn from_bits_retain(bits: u32) -> Self
Convert from a bits value exactly.
Sourcepub fn from_name(name: &str) -> Option<Self>
pub fn from_name(name: &str) -> Option<Self>
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.
Sourcepub const fn intersects(&self, other: Self) -> bool
pub const fn intersects(&self, other: Self) -> bool
Whether any set bits in a source flags value are also set in a target flags value.
Sourcepub const fn contains(&self, other: Self) -> bool
pub const fn contains(&self, other: Self) -> bool
Whether all set bits in a source flags value are also set in a target flags value.
Sourcepub fn remove(&mut self, other: Self)
pub fn remove(&mut self, other: Self)
The intersection of a source flags value with the complement of a target flags value (&!
).
This method is not equivalent to self & !other
when other
has unknown bits set.
remove
won’t truncate other
, but the !
operator will.
Sourcepub fn toggle(&mut self, other: Self)
pub fn toggle(&mut self, other: Self)
The bitwise exclusive-or (^
) of the bits in two flags values.
Sourcepub fn set(&mut self, other: Self, value: bool)
pub fn set(&mut self, other: Self, value: bool)
Call insert
when value
is true
or remove
when value
is false
.
Sourcepub const fn intersection(self, other: Self) -> Self
pub const fn intersection(self, other: Self) -> Self
The bitwise and (&
) of the bits in two flags values.
Sourcepub const fn union(self, other: Self) -> Self
pub const fn union(self, other: Self) -> Self
The bitwise or (|
) of the bits in two flags values.
Sourcepub const fn difference(self, other: Self) -> Self
pub const fn difference(self, other: Self) -> Self
The intersection of a source flags value with the complement of a target flags value (&!
).
This method is not equivalent to self & !other
when other
has unknown bits set.
difference
won’t truncate other
, but the !
operator will.
Sourcepub const fn symmetric_difference(self, other: Self) -> Self
pub const fn symmetric_difference(self, other: Self) -> Self
The bitwise exclusive-or (^
) of the bits in two flags values.
Sourcepub const fn complement(self) -> Self
pub const fn complement(self) -> Self
The bitwise negation (!
) of the bits in a flags value, truncating the result.
Source§impl DatabaseFlags
impl DatabaseFlags
Sourcepub const fn iter(&self) -> Iter<DatabaseFlags>
pub const fn iter(&self) -> Iter<DatabaseFlags>
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.
Sourcepub const fn iter_names(&self) -> IterNames<DatabaseFlags>
pub const fn iter_names(&self) -> IterNames<DatabaseFlags>
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§
Source§impl Binary for DatabaseFlags
impl Binary for DatabaseFlags
Source§impl BitAnd for DatabaseFlags
impl BitAnd for DatabaseFlags
Source§impl BitAndAssign for DatabaseFlags
impl BitAndAssign for DatabaseFlags
Source§fn bitand_assign(&mut self, other: Self)
fn bitand_assign(&mut self, other: Self)
The bitwise and (&
) of the bits in two flags values.
Source§impl BitOr for DatabaseFlags
impl BitOr for DatabaseFlags
Source§fn bitor(self, other: DatabaseFlags) -> Self
fn bitor(self, other: DatabaseFlags) -> Self
The bitwise or (|
) of the bits in two flags values.
Source§type Output = DatabaseFlags
type Output = DatabaseFlags
|
operator.Source§impl BitOrAssign for DatabaseFlags
impl BitOrAssign for DatabaseFlags
Source§fn bitor_assign(&mut self, other: Self)
fn bitor_assign(&mut self, other: Self)
The bitwise or (|
) of the bits in two flags values.
Source§impl BitXor for DatabaseFlags
impl BitXor for DatabaseFlags
Source§impl BitXorAssign for DatabaseFlags
impl BitXorAssign for DatabaseFlags
Source§fn bitxor_assign(&mut self, other: Self)
fn bitxor_assign(&mut self, other: Self)
The bitwise exclusive-or (^
) of the bits in two flags values.
Source§impl Clone for DatabaseFlags
impl Clone for DatabaseFlags
Source§fn clone(&self) -> DatabaseFlags
fn clone(&self) -> DatabaseFlags
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moreSource§impl Debug for DatabaseFlags
impl Debug for DatabaseFlags
Source§impl Extend<DatabaseFlags> for DatabaseFlags
impl Extend<DatabaseFlags> for DatabaseFlags
Source§fn extend<T: IntoIterator<Item = Self>>(&mut self, iterator: T)
fn extend<T: IntoIterator<Item = Self>>(&mut self, iterator: T)
The bitwise or (|
) of the bits in each flags value.
Source§fn extend_one(&mut self, item: A)
fn extend_one(&mut self, item: A)
extend_one
)Source§fn extend_reserve(&mut self, additional: usize)
fn extend_reserve(&mut self, additional: usize)
extend_one
)Source§impl Flags for DatabaseFlags
impl Flags for DatabaseFlags
Source§const FLAGS: &'static [Flag<DatabaseFlags>] = _
const FLAGS: &'static [Flag<DatabaseFlags>] = _
Source§fn from_bits_retain(bits: u32) -> DatabaseFlags
fn from_bits_retain(bits: u32) -> DatabaseFlags
Source§fn from_bits_truncate(bits: Self::Bits) -> Self
fn from_bits_truncate(bits: Self::Bits) -> Self
Source§fn from_name(name: &str) -> Option<Self>
fn from_name(name: &str) -> Option<Self>
Source§fn iter_names(&self) -> IterNames<Self>
fn iter_names(&self) -> IterNames<Self>
Source§fn intersects(&self, other: Self) -> boolwhere
Self: Sized,
fn intersects(&self, other: Self) -> boolwhere
Self: Sized,
Source§fn contains(&self, other: Self) -> boolwhere
Self: Sized,
fn contains(&self, other: Self) -> boolwhere
Self: Sized,
Source§fn insert(&mut self, other: Self)where
Self: Sized,
fn insert(&mut self, other: Self)where
Self: Sized,
|
) of the bits in two flags values.Source§fn remove(&mut self, other: Self)where
Self: Sized,
fn remove(&mut self, other: Self)where
Self: Sized,
&!
). Read moreSource§fn toggle(&mut self, other: Self)where
Self: Sized,
fn toggle(&mut self, other: Self)where
Self: Sized,
^
) of the bits in two flags values.Source§fn intersection(self, other: Self) -> Self
fn intersection(self, other: Self) -> Self
&
) of the bits in two flags values.Source§fn difference(self, other: Self) -> Self
fn difference(self, other: Self) -> Self
&!
). Read moreSource§fn symmetric_difference(self, other: Self) -> Self
fn symmetric_difference(self, other: Self) -> Self
^
) of the bits in two flags values.Source§fn complement(self) -> Self
fn complement(self) -> Self
!
) of the bits in a flags value, truncating the result.Source§impl FromIterator<DatabaseFlags> for DatabaseFlags
impl FromIterator<DatabaseFlags> for DatabaseFlags
Source§fn from_iter<T: IntoIterator<Item = Self>>(iterator: T) -> Self
fn from_iter<T: IntoIterator<Item = Self>>(iterator: T) -> Self
The bitwise or (|
) of the bits in each flags value.
Source§impl Hash for DatabaseFlags
impl Hash for DatabaseFlags
Source§impl IntoIterator for DatabaseFlags
impl IntoIterator for DatabaseFlags
Source§impl LowerHex for DatabaseFlags
impl LowerHex for DatabaseFlags
Source§impl Not for DatabaseFlags
impl Not for DatabaseFlags
Source§impl Octal for DatabaseFlags
impl Octal for DatabaseFlags
Source§impl Ord for DatabaseFlags
impl Ord for DatabaseFlags
Source§fn cmp(&self, other: &DatabaseFlags) -> Ordering
fn cmp(&self, other: &DatabaseFlags) -> Ordering
1.21.0 · Source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Source§impl PartialEq for DatabaseFlags
impl PartialEq for DatabaseFlags
Source§impl PartialOrd for DatabaseFlags
impl PartialOrd for DatabaseFlags
Source§impl PublicFlags for DatabaseFlags
impl PublicFlags for DatabaseFlags
Source§impl Sub for DatabaseFlags
impl Sub for DatabaseFlags
Source§fn sub(self, other: Self) -> Self
fn sub(self, other: Self) -> Self
The intersection of a source flags value with the complement of a target flags value (&!
).
This method is not equivalent to self & !other
when other
has unknown bits set.
difference
won’t truncate other
, but the !
operator will.
Source§type Output = DatabaseFlags
type Output = DatabaseFlags
-
operator.Source§impl SubAssign for DatabaseFlags
impl SubAssign for DatabaseFlags
Source§fn sub_assign(&mut self, other: Self)
fn sub_assign(&mut self, other: Self)
The intersection of a source flags value with the complement of a target flags value (&!
).
This method is not equivalent to self & !other
when other
has unknown bits set.
difference
won’t truncate other
, but the !
operator will.
Source§impl UpperHex for DatabaseFlags
impl UpperHex for DatabaseFlags
impl Copy for DatabaseFlags
impl Eq for DatabaseFlags
impl StructuralPartialEq for DatabaseFlags
Auto Trait Implementations§
impl Freeze for DatabaseFlags
impl RefUnwindSafe for DatabaseFlags
impl Send for DatabaseFlags
impl Sync for DatabaseFlags
impl Unpin for DatabaseFlags
impl UnwindSafe for DatabaseFlags
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Layout§
Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...)
attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.
Size: 4 bytes