# std: introduce orderedRemoveMany · gitcafe/zig

[View on GitCafe](https://git.cafe/gitcafe/zig/commit/59de7e3a5725f0c4eeb64bc464db85e019af7446)

Repository: [gitcafe/zig](https://git.cafe/gitcafe/zig)

Visibility: public

Requested revision: 59de7e3a5725f0c4eeb64bc464db85e019af7446

Requested commit: 59de7e3a5725f0c4eeb64bc464db85e019af7446

Commit: 59de7e3a5725f0c4eeb64bc464db85e019af7446

Tree: 02f14fd8a1601993ea41473f29ed4ef05f20e122

Author: Andrew Kelley

Committer: Andrew Kelley

## Message

```
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

```

## Parents

- [282c3575b16499518b19ee9b1a8364c9379dab94](https://git.cafe/gitcafe/zig/commit/282c3575b16499518b19ee9b1a8364c9379dab94?format=markdown)

[Source at this commit](https://git.cafe/gitcafe/zig/tree/59de7e3a5725f0c4eeb64bc464db85e019af7446?format=markdown)