Struct heapless::sorted_linked_list::FindMut
source · pub struct FindMut<'a, T, Idx, K, const N: usize>{ /* private fields */ }
Expand description
Comes from SortedLinkedList::find_mut
.
Implementations§
source§impl<'a, T, Idx, K, const N: usize> FindMut<'a, T, Idx, K, N>
impl<'a, T, Idx, K, const N: usize> FindMut<'a, T, Idx, K, N>
sourcepub fn pop(self) -> T
pub fn pop(self) -> T
This will pop the element from the list.
Complexity is worst-case O(1)
.
§Example
use heapless::sorted_linked_list::{SortedLinkedList, Max};
let mut ll: SortedLinkedList<_, _, Max, 3> = SortedLinkedList::new_usize();
ll.push(1).unwrap();
ll.push(2).unwrap();
ll.push(3).unwrap();
// Find a value and update it
let mut find = ll.find_mut(|v| *v == 2).unwrap();
find.pop();
assert_eq!(ll.pop(), Ok(3));
assert_eq!(ll.pop(), Ok(1));
assert_eq!(ll.pop(), Err(()));
sourcepub fn finish(self)
pub fn finish(self)
This will resort the element into the correct position in the list if needed. The resorting will only happen if the element has been accessed mutably.
Same as calling drop
.
Complexity is worst-case O(N)
.
§Example
use heapless::sorted_linked_list::{SortedLinkedList, Max};
let mut ll: SortedLinkedList<_, _, Max, 3> = SortedLinkedList::new_usize();
ll.push(1).unwrap();
ll.push(2).unwrap();
ll.push(3).unwrap();
let mut find = ll.find_mut(|v| *v == 2).unwrap();
find.finish(); // No resort, we did not access the value.
let mut find = ll.find_mut(|v| *v == 2).unwrap();
*find += 1000;
find.finish(); // Will resort, we accessed (and updated) the value.
assert_eq!(ll.pop(), Ok(1002));
assert_eq!(ll.pop(), Ok(3));
assert_eq!(ll.pop(), Ok(1));
assert_eq!(ll.pop(), Err(()));
Trait Implementations§
Auto Trait Implementations§
impl<'a, T, Idx, K, const N: usize> Freeze for FindMut<'a, T, Idx, K, N>where
Idx: Freeze,
impl<'a, T, Idx, K, const N: usize> RefUnwindSafe for FindMut<'a, T, Idx, K, N>
impl<'a, T, Idx, K, const N: usize> Send for FindMut<'a, T, Idx, K, N>
impl<'a, T, Idx, K, const N: usize> Sync for FindMut<'a, T, Idx, K, N>
impl<'a, T, Idx, K, const N: usize> Unpin for FindMut<'a, T, Idx, K, N>where
Idx: Unpin,
impl<'a, T, Idx, K, const N: usize> !UnwindSafe for FindMut<'a, T, Idx, K, N>
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