tidy: "ue2::flat_set/map" -> "flat_set/map"

src/util/graph.h

@@ -146,7 +146,7 @@ void find_unreachable(const Graph &g, const SourceCont &sources, OutCont *out) {
 }
 
 template <class Graph>
-ue2::flat_set<typename Graph::vertex_descriptor>
+flat_set<typename Graph::vertex_descriptor>
 find_vertices_in_cycles(const Graph &g) {
     using vertex_descriptor = typename Graph::vertex_descriptor;
 
@@ -160,7 +160,7 @@ find_vertices_in_cycles(const Graph &g) {
         comps[e.second].push_back(e.first);
     }
 
-    ue2::flat_set<vertex_descriptor> rv;
+    flat_set<vertex_descriptor> rv;
 
     for (const auto &comp : comps | boost::adaptors::map_values) {
         /* every vertex in a strongly connected component is reachable from

src/util/partitioned_set.h

@@ -98,8 +98,7 @@ public:
      * If the set was not split (due to there being no overlap with splitter or
      * being a complete subset), INVALID_SUBSET is returned.
      */
-    size_t split(size_t subset_index,
-                 const typename ue2::flat_set<T> &splitter) {
+    size_t split(size_t subset_index, const flat_set<T> &splitter) {
         assert(!splitter.empty());
         if (splitter.empty()) {
             return INVALID_SUBSET;
@@ -193,7 +192,7 @@ public:
     /**
      * Returns all subsets which have a member in keys.
      */
-    void find_overlapping(const typename ue2::flat_set<T> &keys,
+    void find_overlapping(const flat_set<T> &keys,
                           std::vector<size_t> *containing) const {
         boost::dynamic_bitset<> seen(subsets.size()); // all zero by default.
 

src/util/report_manager.cpp

@@ -133,7 +133,7 @@ vector<ReportID> ReportManager::getDkeyToReportTable() const {
 void ReportManager::assignDkeys(const RoseBuild *rose) {
     DEBUG_PRINTF("assigning...\n");
 
-    map<u32, ue2::flat_set<ReportID>> ext_to_int;
+    map<u32, flat_set<ReportID>> ext_to_int;
 
     for (u32 i = 0; i < reportIds.size(); i++) {
         const Report &ir = reportIds[i];