# Struct CursorMut

Source

    pub struct CursorMut<'a, K: 'a, V: 'a, A = Global> { /* private fields */ }

🔬This is a nightly-only experimental API. (`btree_cursors` #107540)
Expand description

A cursor over a `BTreeMap` with editing operations.

A `Cursor` is like an iterator, except that it can freely seek back-and-forth, and can safely mutate the map during iteration. This is because the lifetime of its yielded references is tied to its own lifetime, instead of just the underlying map. This means cursors cannot yield multiple elements at once.

Cursors always point to a gap between two elements in the map, and can operate on the two immediately adjacent elements.

A `CursorMut` is created with the `BTreeMap::lower_bound_mut` and `BTreeMap::upper_bound_mut` methods.

## Implementations§

Source§

### impl<'a, K, V, A> CursorMut<'a, K, V, A>

Source

#### pub fn next(&mut self) -> Option<(&K, &mut V)>

🔬This is a nightly-only experimental API. (`btree_cursors` #107540)

Advances the cursor to the next gap, returning the key and value of the element that it moved over.

If the cursor is already at the end of the map then `None` is returned and the cursor is not moved.

Source

#### pub fn prev(&mut self) -> Option<(&K, &mut V)>

🔬This is a nightly-only experimental API. (`btree_cursors` #107540)

Advances the cursor to the previous gap, returning the key and value of the element that it moved over.

If the cursor is already at the start of the map then `None` is returned and the cursor is not moved.

Source

#### pub fn peek_next(&mut self) -> Option<(&K, &mut V)>

🔬This is a nightly-only experimental API. (`btree_cursors` #107540)

Returns a reference to the key and value of the next element without moving the cursor.

If the cursor is at the end of the map then `None` is returned.

Source

#### pub fn peek_prev(&mut self) -> Option<(&K, &mut V)>

🔬This is a nightly-only experimental API. (`btree_cursors` #107540)

Returns a reference to the key and value of the previous element without moving the cursor.

If the cursor is at the start of the map then `None` is returned.

Source

#### pub fn as_cursor(&self) -> Cursor<'_, K, V>

🔬This is a nightly-only experimental API. (`btree_cursors` #107540)

Returns a read-only cursor pointing to the same location as the `CursorMut`.

The lifetime of the returned `Cursor` is bound to that of the `CursorMut`, which means it cannot outlive the `CursorMut` and that the `CursorMut` is frozen for the lifetime of the `Cursor`.

Source

#### pub unsafe fn with_mutable_key(self) -> CursorMutKey<'a, K, V, A>

🔬This is a nightly-only experimental API. (`btree_cursors` #107540)

Converts the cursor into a `CursorMutKey`, which allows mutating the key of elements in the tree.

##### §Safety

Since this cursor allows mutating keys, you must ensure that the `BTreeMap` invariants are maintained. Specifically:

- The key of the newly inserted element must be unique in the tree.
- All keys in the tree must remain in sorted order.

Source§

### impl<'a, K: Ord, V, A: Allocator + Clone> CursorMut<'a, K, V, A>

Source

#### pub unsafe fn insert_after_unchecked(&mut self, key: K, value: V)

🔬This is a nightly-only experimental API. (`btree_cursors` #107540)

Inserts a new key-value pair into the map in the gap that the cursor is currently pointing to.

After the insertion the cursor will be pointing at the gap after the newly inserted element.

##### §Safety

You must ensure that the `BTreeMap` invariants are maintained. Specifically:

- The key of the newly inserted element must be unique in the tree.
- All keys in the tree must remain in sorted order.

Source

#### pub unsafe fn insert_before_unchecked(&mut self, key: K, value: V)

🔬This is a nightly-only experimental API. (`btree_cursors` #107540)

Inserts a new key-value pair into the map in the gap that the cursor is currently pointing to.

After the insertion the cursor will be pointing at the gap after the newly inserted element.

##### §Safety

You must ensure that the `BTreeMap` invariants are maintained. Specifically:

- The key of the newly inserted element must be unique in the tree.
- All keys in the tree must remain in sorted order.

Source

#### pub fn insert_after( &mut self, key: K, value: V, ) -> Result<(), UnorderedKeyError>

🔬This is a nightly-only experimental API. (`btree_cursors` #107540)

Inserts a new key-value pair into the map in the gap that the cursor is currently pointing to.

After the insertion the cursor will be pointing at the gap before the newly inserted element.

If the inserted key is not greater than the key before the cursor (if any), or if it not less than the key after the cursor (if any), then an `UnorderedKeyError` is returned since this would invalidate the `Ord` invariant between the keys of the map.

Source

#### pub fn insert_before( &mut self, key: K, value: V, ) -> Result<(), UnorderedKeyError>

🔬This is a nightly-only experimental API. (`btree_cursors` #107540)

Inserts a new key-value pair into the map in the gap that the cursor is currently pointing to.

After the insertion the cursor will be pointing at the gap after the newly inserted element.

If the inserted key is not greater than the key before the cursor (if any), or if it not less than the key after the cursor (if any), then an `UnorderedKeyError` is returned since this would invalidate the `Ord` invariant between the keys of the map.

Source

#### pub fn remove_next(&mut self) -> Option<(K, V)>

🔬This is a nightly-only experimental API. (`btree_cursors` #107540)

Removes the next element from the `BTreeMap`.

The element that was removed is returned. The cursor position is unchanged (before the removed element).

Source

#### pub fn remove_prev(&mut self) -> Option<(K, V)>

🔬This is a nightly-only experimental API. (`btree_cursors` #107540)

Removes the preceding element from the `BTreeMap`.

The element that was removed is returned. The cursor position is unchanged (after the removed element).

## Trait Implementations§

Source§

### impl<K: Debug, V: Debug, A> Debug for CursorMut<'_, K, V, A>

Source§

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

Formats the value using the given formatter. Read more

## Auto Trait Implementations§

§

### impl<'a, K, V, A> Freeze for CursorMut<'a, K, V, A>

§

### impl<'a, K, V, A> RefUnwindSafe for CursorMut<'a, K, V, A>
where A: RefUnwindSafe, K: RefUnwindSafe, V: RefUnwindSafe,

§

### impl<'a, K, V, A> Send for CursorMut<'a, K, V, A>
where A: Send, K: Send, V: Send,

§

### impl<'a, K, V, A> Sync for CursorMut<'a, K, V, A>
where A: Sync, K: Sync, V: Sync,

§

### impl<'a, K, V, A> Unpin for CursorMut<'a, K, V, A>

§

### impl<'a, K, V, A = Global> !UnwindSafe for CursorMut<'a, K, V, A>

## Blanket Implementations§

Source§

### impl<T> Any for T
where T: 'static + ?Sized,

Source§

#### fn type_id(&self) -> TypeId

Gets the `TypeId` of `self`. Read more
Source§

### impl<T> Borrow<T> for T
where T: ?Sized,

Source§

#### fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

### impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

#### fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

### impl<T> From<T> for T

Source§

#### fn from(t: T) -> T

Returns the argument unchanged.

Source§

### impl<T, U> Into<U> for T
where U: From<T>,

Source§

#### fn into(self) -> U

Calls `U::from(self)`.

That is, this conversion is whatever the implementation of `From<T> for U` chooses to do.

Source§

### impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

#### type Error = Infallible

The type returned in the event of a conversion error.
Source§

#### fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

### impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

#### type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

#### fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.