mirror of
https://github.com/saymrwulf/xous-core.git
synced 2026-11-16 08:38:26 +00:00
bump release notes and comments
This commit is contained in:
parent
17c009384a
commit
63299c7ca6
2 changed files with 5 additions and 0 deletions
|
|
@ -392,6 +392,7 @@ perform the Xous firmware upgrade. This requires running manual update commands,
|
|||
- #388 via @eupn adds physical address resolution for a remote virtual memory process, allowing for coordination with remote DMA initiators. Does introduce some potential security problems, so gated behind the `v2p` flag.
|
||||
- Fix #339 by adjusting the shellchat API call to match what is done in status bar
|
||||
- Improved wifi scanning (fixes #336) - scans are now sorted by strength; old APs are retired; and the UX will pause while the scan occurs. Repeated scans still require going through the entire menu tree again; this is because modal radio-box lists aren't dynamically updateable.
|
||||
- Improve performance of filtering operations in `vault` by ~100x by refactoring the item cache to work on `Vec` that is repeatedly sorted, instead of on a `BTreeMap` that is referenced. Turns out that sorting is a far cheaper operation than reference-counted shared references, or copying data to the heap (to avoid the shared reference).
|
||||
|
||||
## Roadmap
|
||||
- Lots of testing and bug fixes
|
||||
|
|
|
|||
|
|
@ -171,6 +171,10 @@ impl ListItem {
|
|||
}
|
||||
|
||||
pub struct FilteredListView {
|
||||
// You might be thinking "why use a vec when a BTreeMap can guarantee uniqueness and sorting?"
|
||||
// See PR #389 for an explanation of why that's a terrible idea. The TL;DR is that sorting is cheap
|
||||
// compared to copying data. Or more precisely, sorting is cheap compared to figuring out where
|
||||
// on the heap to copy data.
|
||||
list: Vec<ListItem>,
|
||||
sorted: bool,
|
||||
selection_index: usize,
|
||||
|
|
|
|||
Loading…
Reference in a new issue