Use STL containers when requiring pointer/iterator stability

google · Aug 4, 2024 · 148c08d · 148c08d
1 parent ad4bc32
commit 148c08d
Show file tree

Hide file tree

Showing 2 changed files with 3 additions and 3 deletions.
diff --git a/differ.h b/differ.h
@@ -32,7 +32,7 @@ namespace security::bindiff {
 class MatchingContext;
 
 // These need to be sorted
-using Histogram = absl::btree_map<std::string, size_t>;
+using Histogram = std::map<std::string, size_t>;
 using Confidences = absl::btree_map<std::string, double>;
 
 // Main entry point to the differ, runs the core algorithm and produces a

diff --git a/reader.h b/reader.h
@@ -32,7 +32,7 @@ struct FlowGraphInfo {
   int edge_count = 0;
   int instruction_count = 0;
 };
-using FlowGraphInfos = absl::btree_map<Address, FlowGraphInfo>;
+using FlowGraphInfos = std::map<Address, FlowGraphInfo>;
 
 struct FixedPointInfo {
   friend bool operator==(const FixedPointInfo& lhs, const FixedPointInfo& rhs) {
@@ -69,7 +69,7 @@ struct FixedPointInfo {
   bool evaluate;
   bool comments_ported;
 };
-using FixedPointInfos = absl::btree_set<FixedPointInfo>;
+using FixedPointInfos = std::set<FixedPointInfo>;
 
 bool operator<(const FixedPointInfo& one, const FixedPointInfo& two);