diff options
| author | Simon Glass <sjg@chromium.org> | 2024-10-19 09:21:47 -0600 |
|---|---|---|
| committer | Tom Rini <trini@konsulko.com> | 2024-11-03 21:27:12 -0600 |
| commit | 5dfc1c8078572436fc68817d22d9e046eaa01398 (patch) | |
| tree | 5cdd37adeb5fd8ebfc90588a3399694e85ec0ebe /lib/mbedtls/rsa_helper.c | |
| parent | 5bd4ead8bd76c85aa599c44e8bfb12f512d8ed09 (diff) | |
alist: Add a way to efficiently filter an alist
Unlike linked lists, it is inefficient to remove items from an alist,
particularly if it is large. If most items need to be removed, then the
time-complexity approaches O(n2).
Provide a way to do this efficiently, by working through the alist once
and copying elements down.
Signed-off-by: Simon Glass <sjg@chromium.org>
Diffstat (limited to 'lib/mbedtls/rsa_helper.c')
0 files changed, 0 insertions, 0 deletions