Implementing erase/erase_if functions from library fundamentals ts:

base/containers/flat_set.h

 // Copyright 2017 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #ifndef BASE_CONTAINERS_FLAT_SET_H_
 #define BASE_CONTAINERS_FLAT_SET_H_
 
 #include <algorithm>
 #include <functional>
 #include <utility>
 #include <vector>
 
+#include "base/stl_util.h"
+
 namespace base {
 
 // Overview:
 // This file implements flat_set container. It is an alternative to standard
 // sorted containers that stores it's elements in contiguous memory (current
 // version uses sorted std::vector).
 // Discussion that preceded introduction of this container can be found here:
 // https://groups.google.com/a/chromium.org/forum/#!searchin/chromium-dev/vector$20based/chromium-dev/4uQMma9vj9w/HaQ-WvMOAwAJ
 //
 // Motivation:
@@ skipping 627 matching lines @@
 }
 
 // ----------------------------------------------------------------------------
 // General operations.
 
 template <class Key, class Compare>
 void flat_set<Key, Compare>::swap(flat_set& other) {
   std::swap(impl_, other.impl_);
 }
 
+// ----------------------------------------------------------------------------
+// Free functions.
+
+template <typename Key, typename Compare, typename Predicate>

[danakj, 2017/03/03 20:11:49]

Please describe the complexity of this method, there are no standard docs to
lean on here.

+void STLEraseIf(base::flat_set<Key, Compare>& container, Predicate pred) {
+  STLEraseRemoveIf(container, pred);
+}
+
 }  // namespace  base
 
 #endif  // BASE_CONTAINERS_FLAT_SET_H_