Do we have a simple find/remove algorithm?

[Andrei Alexandrescu]

"Find it and kill it" seems rather tedious to do. We have 
https://dlang.org/library/std/algorithm/mutation/remove.html, which 
operates with either indices or predicates. Then we have find and 
findSplitXxx, but neither seems to make it easy to find some element and 
remove it by shifting the range backwards. What am I missing?