[PATCH] D48504: [WIP] Add InsertionOrderSet, with constant-time insertion and removal.

[Alexandros Lamprineas via Phabricator via llvm-commits]

labrinea added a comment.

Another thing to consider maybe is the complexity of iteration over the vector. Imagine the case where we insert N elements and we erase M with M being almost the size of N. The iteration will be O(N) and not O(N-M).


Repository:
  rL LLVM

https://reviews.llvm.org/D48504