• Home
  • Raw
  • Download

Lines Matching refs:btree_map

803       sizeof(absl::btree_map<K, K>),  in MapTest()
804 2 * sizeof(void *) + sizeof(typename absl::btree_map<K, K>::size_type)); in MapTest()
805 using BtreeMap = absl::btree_map<K, K>; in MapTest()
807 absl::btree_map<K, K, std::less<K>, in MapTest()
947 TestHeterogeneous(btree_map<std::string, int, CompareIntToString>{ in TEST()
955 btree_map<std::string, int, CompareIntToString> map{ in TEST()
1140 absl::btree_map<std::string, int64_t> my_map; in TEST()
1144 absl::btree_map<std::string, int64_t> my_map_copy(my_map); in TEST()
1178 absl::btree_map<int, int> tmap(imap.begin(), imap.end()); in TEST()
1186 absl::btree_map<std::string, std::unique_ptr<std::string>> m; in TEST()
1205 absl::btree_map<int, int> map({{1, 5}, {2, 10}}); in TEST()
1230 absl::btree_map<int, int> map; in TEST()
1303 absl::btree_map<int, MovableOnlyInstance> map; in TEST()
1493 absl::btree_map<NoDefaultCtor, NoDefaultCtor> m; in TEST()
1544 absl::btree_map<int, int> map = {{1, 2}, {2, 4}}; in TEST()
1548 const absl::btree_map<int, int> &const_map = map; in TEST()
1652 absl::btree_map<int, int> m1; in TEST()
1657 absl::btree_map<std::string, int> m2; in TEST()
1668 absl::btree_map<int, int> m; in TEST()
1711 using map = absl::btree_map<int, int>; in TEST()
1770 absl::btree_map<int, int> s1 = {{1, 2}}; in TEST()
1771 absl::btree_map<int, int> s2 = {{2, 3}}; in TEST()
1908 absl::btree_map<CopyableMovableInstance, MovableOnlyInstance>>(); in TEST()
1931 absl::btree_map<int, int> src1 = {{1, 2}, {3, 4}, {5, 6}}; in TEST()
1934 absl::btree_map<int, int> other; in TEST()
1935 absl::btree_map<int, int>::insert_return_type res = in TEST()
1942 absl::btree_map<int, int> src2 = {{3, 6}}; in TEST()
2098 absl::btree_map<int, int, IntCompareToCmp> src1 = {{1, 1}, {2, 2}, {3, 3}}; in TEST()
2141 absl::btree_map<int, std::string> m; in TEST()
2166 absl::btree_map<int, int, Cmp> m(cmp); in TEST()
2218 absl::btree_map<int, int> m = {{1, 1}, {9, 9}}; in TEST()
2234 absl::btree_map<int, std::string> m; in TEST()
2251 absl::btree_map<int, int> m; in TEST()
2257 absl::btree_map<int, std::string> m; in TEST()
2330 absl::btree_map<int, int> m = {{1, 1}, {3, 3}, {6, 6}, {100, 100}}; in TEST()
2357 absl::btree_map<int, int> m = {{1, 1}, {3, 3}}; in TEST()
2380 absl::btree_map<int, MovableOnlyInstance> m; in TEST()
2401 absl::btree_map<int, int> m; in TEST()
2482 absl::btree_map<std::string, int> name_map1{std::begin(names), in TEST()
2486 absl::btree_map<std::string, int> name_map2; in TEST()
2496 absl::btree_map<ConstructorCounted, int, ConstructorCountedCompare> map{ in TEST()
2510 absl::btree_map<std::vector<void *>, int> m1{std::begin(i), std::end(i)}; in TEST()
2514 absl::btree_map<std::vector<void *>, int> m2; in TEST()
2521 absl::btree_map<std::string, int> m; in TEST()
2532 absl::btree_map<std::string, int> m; in TEST()
2543 absl::btree_map<std::string, int> m; in TEST()
2558 absl::btree_map<std::string, std::string> map; in TEST()