pub struct Cursor<'txn, K>where
K: TransactionKind,{ /* private fields */ }Expand description
A cursor for navigating the items within a table.
Implementations§
source§impl<'txn, K> Cursor<'txn, K>where
K: TransactionKind,
impl<'txn, K> Cursor<'txn, K>where
K: TransactionKind,
sourcepub fn cursor(&self) -> CursorPtr
pub fn cursor(&self) -> CursorPtr
Returns a raw pointer to the underlying MDBX cursor.
The caller must ensure that the pointer is not used after the lifetime of the cursor.
sourcepub fn first<Key, Value>(&mut self) -> Result<Option<(Key, Value)>>
pub fn first<Key, Value>(&mut self) -> Result<Option<(Key, Value)>>
Position at first key/data item.
sourcepub fn first_dup<Value>(&mut self) -> Result<Option<Value>>where
Value: Decodable<'txn>,
pub fn first_dup<Value>(&mut self) -> Result<Option<Value>>where
Value: Decodable<'txn>,
TableFlags::DUP_SORT-only: Position at first data item of current key.
sourcepub fn get_both<Value>(&mut self, k: &[u8], v: &[u8]) -> Result<Option<Value>>where
Value: Decodable<'txn>,
pub fn get_both<Value>(&mut self, k: &[u8], v: &[u8]) -> Result<Option<Value>>where
Value: Decodable<'txn>,
TableFlags::DUP_SORT-only: Position at key/data pair.
sourcepub fn get_both_range<Value>(
&mut self,
k: &[u8],
v: &[u8]
) -> Result<Option<Value>>where
Value: Decodable<'txn>,
pub fn get_both_range<Value>(
&mut self,
k: &[u8],
v: &[u8]
) -> Result<Option<Value>>where
Value: Decodable<'txn>,
TableFlags::DUP_SORT-only: Position at given key and at first data greater than or equal to specified data.
sourcepub fn get_current<Key, Value>(&mut self) -> Result<Option<(Key, Value)>>
pub fn get_current<Key, Value>(&mut self) -> Result<Option<(Key, Value)>>
Return key/data at current cursor position.
sourcepub fn get_multiple<Value>(&mut self) -> Result<Option<Value>>where
Value: Decodable<'txn>,
pub fn get_multiple<Value>(&mut self) -> Result<Option<Value>>where
Value: Decodable<'txn>,
DupFixed-only: Return up to a page of duplicate data items from current cursor position. Move cursor to prepare for Self::next_multiple().
sourcepub fn last<Key, Value>(&mut self) -> Result<Option<(Key, Value)>>
pub fn last<Key, Value>(&mut self) -> Result<Option<(Key, Value)>>
Position at last key/data item.
sourcepub fn last_dup<Value>(&mut self) -> Result<Option<Value>>where
Value: Decodable<'txn>,
pub fn last_dup<Value>(&mut self) -> Result<Option<Value>>where
Value: Decodable<'txn>,
DupSort-only: Position at last data item of current key.
sourcepub fn next<Key, Value>(&mut self) -> Result<Option<(Key, Value)>>
pub fn next<Key, Value>(&mut self) -> Result<Option<(Key, Value)>>
Position at next data item
sourcepub fn next_dup<Key, Value>(&mut self) -> Result<Option<(Key, Value)>>
pub fn next_dup<Key, Value>(&mut self) -> Result<Option<(Key, Value)>>
TableFlags::DUP_SORT-only: Position at next data item of current key.
sourcepub fn next_multiple<Key, Value>(&mut self) -> Result<Option<(Key, Value)>>
pub fn next_multiple<Key, Value>(&mut self) -> Result<Option<(Key, Value)>>
TableFlags::DUP_FIXED-only: Return up to a page of duplicate data items from next cursor position. Move cursor to prepare for MDBX_NEXT_MULTIPLE.
sourcepub fn next_nodup<Key, Value>(&mut self) -> Result<Option<(Key, Value)>>
pub fn next_nodup<Key, Value>(&mut self) -> Result<Option<(Key, Value)>>
Position at first data item of next key.
sourcepub fn prev<Key, Value>(&mut self) -> Result<Option<(Key, Value)>>
pub fn prev<Key, Value>(&mut self) -> Result<Option<(Key, Value)>>
Position at previous data item.
sourcepub fn prev_dup<Key, Value>(&mut self) -> Result<Option<(Key, Value)>>
pub fn prev_dup<Key, Value>(&mut self) -> Result<Option<(Key, Value)>>
TableFlags::DUP_SORT-only: Position at previous data item of current key.
sourcepub fn prev_nodup<Key, Value>(&mut self) -> Result<Option<(Key, Value)>>
pub fn prev_nodup<Key, Value>(&mut self) -> Result<Option<(Key, Value)>>
Position at last data item of previous key.
sourcepub fn set<Value>(&mut self, key: &[u8]) -> Result<Option<Value>>where
Value: Decodable<'txn>,
pub fn set<Value>(&mut self, key: &[u8]) -> Result<Option<Value>>where
Value: Decodable<'txn>,
Position at specified key.
sourcepub fn set_key<Key, Value>(
&mut self,
key: &[u8]
) -> Result<Option<(Key, Value)>>
pub fn set_key<Key, Value>( &mut self, key: &[u8] ) -> Result<Option<(Key, Value)>>
Position at specified key, return both key and data.
sourcepub fn set_range<Key, Value>(
&mut self,
key: &[u8]
) -> Result<Option<(Key, Value)>>
pub fn set_range<Key, Value>( &mut self, key: &[u8] ) -> Result<Option<(Key, Value)>>
Position at first key greater than or equal to specified key.
sourcepub fn prev_multiple<Key, Value>(&mut self) -> Result<Option<(Key, Value)>>
pub fn prev_multiple<Key, Value>(&mut self) -> Result<Option<(Key, Value)>>
TableFlags::DUP_FIXED-only: Position at previous page and return up to a page of duplicate data items.
sourcepub fn set_lowerbound<Key, Value>(
&mut self,
key: &[u8],
value: Option<&[u8]>
) -> Result<Option<(bool, Key, Value)>>
pub fn set_lowerbound<Key, Value>( &mut self, key: &[u8], value: Option<&[u8]> ) -> Result<Option<(bool, Key, Value)>>
Position at first key-value pair greater than or equal to specified, return both key and data, and the return code depends on a exact match.
For non DupSort-ed collections this works the same as Self::set_range(), but returns false if key found exactly and true if greater key was found.
For DupSort-ed a data value is taken into account for duplicates, i.e. for a pairs/tuples of a key and an each data value of duplicates. Returns false if key-value pair found exactly and true if the next pair was returned.
sourcepub fn iter<Key, Value>(&mut self) -> Iter<'txn, '_, K, Key, Value> ⓘ
pub fn iter<Key, Value>(&mut self) -> Iter<'txn, '_, K, Key, Value> ⓘ
Iterate over table items. The iterator will begin with item next after the cursor, and continue until the end of the table. For new cursors, the iterator will begin with the first item in the table.
For tables with duplicate data items (TableFlags::DUP_SORT), the duplicate data items of each key will be returned before moving on to the next key.
sourcepub fn iter_start<Key, Value>(&mut self) -> Iter<'txn, '_, K, Key, Value> ⓘ
pub fn iter_start<Key, Value>(&mut self) -> Iter<'txn, '_, K, Key, Value> ⓘ
Iterate over table items starting from the beginning of the table.
For tables with duplicate data items (TableFlags::DUP_SORT), the duplicate data items of each key will be returned before moving on to the next key.
sourcepub fn into_iter_start<Key, Value>(self) -> IntoIter<'txn, K, Key, Value> ⓘ
pub fn into_iter_start<Key, Value>(self) -> IntoIter<'txn, K, Key, Value> ⓘ
Iterate over table items starting from the beginning of the table.
For tables with duplicate data items (TableFlags::DUP_SORT), the duplicate data items of each key will be returned before moving on to the next key.
sourcepub fn iter_from<Key, Value>(
&mut self,
key: &[u8]
) -> Iter<'txn, '_, K, Key, Value> ⓘ
pub fn iter_from<Key, Value>( &mut self, key: &[u8] ) -> Iter<'txn, '_, K, Key, Value> ⓘ
Iterate over table items starting from the given key.
For tables with duplicate data items (TableFlags::DUP_SORT), the duplicate data items of each key will be returned before moving on to the next key.
sourcepub fn into_iter_from<Key, Value>(
self,
key: &[u8]
) -> IntoIter<'txn, K, Key, Value> ⓘ
pub fn into_iter_from<Key, Value>( self, key: &[u8] ) -> IntoIter<'txn, K, Key, Value> ⓘ
Iterate over table items starting from the given key.
For tables with duplicate data items (TableFlags::DUP_SORT), the duplicate data items of each key will be returned before moving on to the next key.
sourcepub fn iter_dup<Key, Value>(&mut self) -> IterDup<'txn, '_, K, Key, Value> ⓘ
pub fn iter_dup<Key, Value>(&mut self) -> IterDup<'txn, '_, K, Key, Value> ⓘ
Iterate over duplicate table items. The iterator will begin with the item next after the cursor, and continue until the end of the table. Each item will be returned as an iterator of its duplicates.
sourcepub fn iter_dup_start<Key, Value>(&mut self) -> IterDup<'txn, '_, K, Key, Value> ⓘ
pub fn iter_dup_start<Key, Value>(&mut self) -> IterDup<'txn, '_, K, Key, Value> ⓘ
Iterate over duplicate table items starting from the beginning of the table. Each item will be returned as an iterator of its duplicates.
sourcepub fn iter_dup_from<Key, Value>(
&mut self,
key: &[u8]
) -> IterDup<'txn, '_, K, Key, Value> ⓘ
pub fn iter_dup_from<Key, Value>( &mut self, key: &[u8] ) -> IterDup<'txn, '_, K, Key, Value> ⓘ
Iterate over duplicate items in the table starting from the given key. Each item will be returned as an iterator of its duplicates.
sourcepub fn iter_dup_of<Key, Value>(
&mut self,
key: &[u8]
) -> Iter<'txn, '_, K, Key, Value> ⓘ
pub fn iter_dup_of<Key, Value>( &mut self, key: &[u8] ) -> Iter<'txn, '_, K, Key, Value> ⓘ
Iterate over the duplicates of the item in the table with the given key.
source§impl<'txn> Cursor<'txn, RW>
impl<'txn> Cursor<'txn, RW>
sourcepub fn put(&mut self, key: &[u8], data: &[u8], flags: WriteFlags) -> Result<()>
pub fn put(&mut self, key: &[u8], data: &[u8], flags: WriteFlags) -> Result<()>
Puts a key/data pair into the table. The cursor will be positioned at the new data item, or on failure usually near it.
sourcepub fn del(&mut self, flags: WriteFlags) -> Result<()>
pub fn del(&mut self, flags: WriteFlags) -> Result<()>
Deletes the current key/data pair.
§Flags
WriteFlags::NO_DUP_DATA may be used to delete all data items for the current key, if the table was opened with TableFlags::DUP_SORT.