Lines Matching refs:_map

28   * Generally avoid **std::unordered\_set** and **std::unordered\_map**. In the
35     moved efficiently. In this case, consider **base::flat\_map** and
46   * **base::small\_map** has better runtime memory usage without the poor
47     mutation performance of large containers that base::flat\_map has. But this
62 | std::unordered\_map, std::unordered\_set | 128 bytes             | 16-24 bytes       | No        …
63 | base::flat\_map and base::flat\_set      | 24 bytes              | 0 (see notes)     | No        …
64 | base::small\_map                         | 24 bytes (see notes)  | 32 bytes          | No        …
66 **Takeaways:** std::unordered\_map and std::unordered\_map have high
74 | std::unordered\_map | 1646 bytes |
76 | base::flat\_map     | 1872 bytes |
77 | base::small\_map    | 2410 bytes |
79 **Takeaways:** base::small\_map generates more code because of the inlining of
91 ### std::unordered\_map and std::unordered\_set
99 The empty size is sizeof(std::unordered\_map) = 64 +
113 ### base::flat\_map and base::flat\_set
128 flat\_set/flat\_map support a notion of transparent comparisons. Therefore you
177 ### base::small\_map
180 std::map or std::unordered\_map. This gives the memory benefit of
181 base::flat\_map for small data sizes without the degenerate insertion