Erase an element preserving order.
std::size_t stable_erase( string_view key);
Remove the element which matches
if it exists. All references and iterators are invalidated. The relative
order of remaining elements is preserved.
The number of elements removed, which will be either 0 or 1.
The key to match.