diff options
| author | Andrew Kelley <andrew@ziglang.org> | 2025-05-18 12:45:30 -0700 |
|---|---|---|
| committer | Andrew Kelley <andrew@ziglang.org> | 2025-08-11 13:32:12 -0700 |
| commit | 59de7e3a5725f0c4eeb64bc464db85e019af7446 (patch) | |
| tree | 02f14fd8a1601993ea41473f29ed4ef05f20e122 /lib/std/debug | |
| parent | 282c3575b16499518b19ee9b1a8364c9379dab94 (diff) | |
| download | zig-59de7e3a5725f0c4eeb64bc464db85e019af7446.tar.gz zig-59de7e3a5725f0c4eeb64bc464db85e019af7446.zip | |
std: introduce orderedRemoveMany
This algorithm is non-trivial and makes sense for any data structure
that acts as an array list, so I thought it would make sense as a
method.
I have a real world case for this in a music player application
(deleting queue items).
Adds the method to:
* ArrayList
* ArrayHashMap
* MultiArrayList
Diffstat (limited to 'lib/std/debug')
0 files changed, 0 insertions, 0 deletions