Vec's (so as
swap_remove return an element, and will panic when index is out of bound; while
swap_remove_front) return an
Another observation is that when it comes to reference based removing
Vec indeed returns Option. This is consistent with other removals like in
So can we say
Vec's position based removal merely results from certain performance considerations?
Side question: is there an efficient data structure for pure FIFO queue operation (rather than
VecDeque)? This crate is inefficient since
dequeue is O(n).