| /external/chromium_org/chrome/browser/history/ |
| visit_filter_unittest.cc | 152 times1.push_back(std::make_pair(t - one_hour, t + one_hour));
153 times1.push_back(std::make_pair(t - one_hour - one_day,
155 times1.push_back(std::make_pair(t - one_hour - one_day * 2,
157 times1.push_back(std::make_pair(t - one_hour - one_day * 3,
162 times2.push_back(std::make_pair(t - one_hour / 2, t + one_hour / 2));
164 times2.push_back(std::make_pair(t + one_hour * 2 - one_day,
167 times2.push_back(std::make_pair(t - one_day * 2,
169 times2.push_back(std::make_pair(t - one_hour * 2 - one_day * 3,
197 times1.push_back(std::make_pair(t - one_hour, t + one_hour));
201 times2.push_back(std::make_pair(t + one_hour * 2
[all...] |
| /external/chromium_org/third_party/tcmalloc/chromium/src/tests/ |
| addressmap_unittest.cc | 46 using std::make_pair;
74 check_set->insert(make_pair(ptr, val->first));
105 map.Insert(p, make_pair(i, ptrs_and_sizes[i].size));
111 map.Insert(p, make_pair(i + N, ptrs_and_sizes[i].size));
133 map.Insert(p, make_pair(i + 2*N, ptrs_and_sizes[i].size));
143 map.Insert(p, make_pair(i + 2*N, ptrs_and_sizes[i].size));
157 check_set.erase(make_pair(p, i + 2*N));
|
| /external/chromium_org/third_party/tcmalloc/vendor/src/tests/ |
| addressmap_unittest.cc | 46 using std::make_pair;
74 check_set->insert(make_pair(ptr, val->first));
105 map.Insert(p, make_pair(i, ptrs_and_sizes[i].size));
111 map.Insert(p, make_pair(i + N, ptrs_and_sizes[i].size));
133 map.Insert(p, make_pair(i + 2*N, ptrs_and_sizes[i].size));
143 map.Insert(p, make_pair(i + 2*N, ptrs_and_sizes[i].size));
157 check_set.erase(make_pair(p, i + 2*N));
|
| /external/libcxx/test/containers/associative/multimap/multimap.ops/ |
| lower_bound.pass.cpp | 194 m.insert ( std::make_pair<PC, double> ( PC::make(5), 1 ));
195 m.insert ( std::make_pair<PC, double> ( PC::make(5), 2 ));
196 m.insert ( std::make_pair<PC, double> ( PC::make(5), 3 ));
197 m.insert ( std::make_pair<PC, double> ( PC::make(7), 1 ));
198 m.insert ( std::make_pair<PC, double> ( PC::make(7), 2 ));
199 m.insert ( std::make_pair<PC, double> ( PC::make(7), 3 ));
200 m.insert ( std::make_pair<PC, double> ( PC::make(9), 1 ));
201 m.insert ( std::make_pair<PC, double> ( PC::make(9), 2 ));
202 m.insert ( std::make_pair<PC, double> ( PC::make(9), 3 ));
|
| upper_bound.pass.cpp | 194 m.insert ( std::make_pair<PC, double> ( PC::make(5), 1 ));
195 m.insert ( std::make_pair<PC, double> ( PC::make(5), 2 ));
196 m.insert ( std::make_pair<PC, double> ( PC::make(5), 3 ));
197 m.insert ( std::make_pair<PC, double> ( PC::make(7), 1 ));
198 m.insert ( std::make_pair<PC, double> ( PC::make(7), 2 ));
199 m.insert ( std::make_pair<PC, double> ( PC::make(7), 3 ));
200 m.insert ( std::make_pair<PC, double> ( PC::make(9), 1 ));
201 m.insert ( std::make_pair<PC, double> ( PC::make(9), 2 ));
202 m.insert ( std::make_pair<PC, double> ( PC::make(9), 3 ));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multimap/multimap.ops/ |
| lower_bound.pass.cpp | 194 m.insert ( std::make_pair<PC, double> ( PC::make(5), 1 ));
195 m.insert ( std::make_pair<PC, double> ( PC::make(5), 2 ));
196 m.insert ( std::make_pair<PC, double> ( PC::make(5), 3 ));
197 m.insert ( std::make_pair<PC, double> ( PC::make(7), 1 ));
198 m.insert ( std::make_pair<PC, double> ( PC::make(7), 2 ));
199 m.insert ( std::make_pair<PC, double> ( PC::make(7), 3 ));
200 m.insert ( std::make_pair<PC, double> ( PC::make(9), 1 ));
201 m.insert ( std::make_pair<PC, double> ( PC::make(9), 2 ));
202 m.insert ( std::make_pair<PC, double> ( PC::make(9), 3 ));
|
| upper_bound.pass.cpp | 194 m.insert ( std::make_pair<PC, double> ( PC::make(5), 1 ));
195 m.insert ( std::make_pair<PC, double> ( PC::make(5), 2 ));
196 m.insert ( std::make_pair<PC, double> ( PC::make(5), 3 ));
197 m.insert ( std::make_pair<PC, double> ( PC::make(7), 1 ));
198 m.insert ( std::make_pair<PC, double> ( PC::make(7), 2 ));
199 m.insert ( std::make_pair<PC, double> ( PC::make(7), 3 ));
200 m.insert ( std::make_pair<PC, double> ( PC::make(9), 1 ));
201 m.insert ( std::make_pair<PC, double> ( PC::make(9), 2 ));
202 m.insert ( std::make_pair<PC, double> ( PC::make(9), 3 ));
|
| /external/chromium_org/cc/resources/ |
| layer_tiling_data.cc | 61 tiles_.add(std::make_pair(i, j), tile.Pass());
65 return tiles_.take_and_erase(std::make_pair(i, j));
69 return tiles_.get(std::make_pair(i, j));
|
| /external/chromium_org/net/quic/ |
| quic_received_packet_manager_test.cc | 15 using std::make_pair;
217 entropies.push_back(make_pair(1, 12));
218 entropies.push_back(make_pair(7, 1));
219 entropies.push_back(make_pair(2, 33));
220 entropies.push_back(make_pair(5, 3));
221 entropies.push_back(make_pair(8, 34));
259 entropies.push_back(make_pair(1, 12));
260 entropies.push_back(make_pair(2, 1));
261 entropies.push_back(make_pair(3, 33));
262 entropies.push_back(make_pair(4, 3))
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/svg/ |
| SVGGradientElement.cpp | 41 entries.append(std::make_pair(SVGSpreadMethodPad, "pad"));
42 entries.append(std::make_pair(SVGSpreadMethodReflect, "reflect"));
43 entries.append(std::make_pair(SVGSpreadMethodRepeat, "repeat"));
|
| /external/pcre/dist/ |
| pcre_stringpiece_unittest.cc | 10 #include <algorithm> // for make_pair
41 map.insert(std::make_pair(p1, 0));
42 map.insert(std::make_pair(p2, 1));
43 map.insert(std::make_pair(p3, 2));
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/ext/pb_ds/detail/trie_policy/ |
| prefix_search_node_update_imp.hpp | 77 return (std::make_pair(
100 return (std::make_pair(end(), end()));
111 return (std::make_pair(ret_b, ++ret_e));
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/trie_policy/ |
| prefix_search_node_update_imp.hpp | 74 return (std::make_pair(const_iterator(non_const_ret.first),
95 return (std::make_pair(end(), end()));
104 return (std::make_pair(ret_b, ++ret_e));
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/parallel/ |
| find_selectors.h | 75 { return std::make_pair(find_if(__begin1, __end1, __pred,
114 return std::make_pair(__spot, __begin2);
190 return std::make_pair(find_first_of(__begin1, __end1,
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/trie_policy/ |
| prefix_search_node_update_imp.hpp | 74 return (std::make_pair(const_iterator(non_const_ret.first),
95 return (std::make_pair(end(), end()));
104 return (std::make_pair(ret_b, ++ret_e));
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/parallel/ |
| find_selectors.h | 75 { return std::make_pair(find_if(__begin1, __end1, __pred,
114 return std::make_pair(__spot, __begin2);
190 return std::make_pair(find_first_of(__begin1, __end1,
|
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/trie_policy/ |
| prefix_search_node_update_imp.hpp | 77 return (std::make_pair(
100 return (std::make_pair(end(), end()));
111 return (std::make_pair(ret_b, ++ret_e));
|
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/trie_policy/ |
| prefix_search_node_update_imp.hpp | 77 return (std::make_pair(
100 return (std::make_pair(end(), end()));
111 return (std::make_pair(ret_b, ++ret_e));
|
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/trie_policy/ |
| prefix_search_node_update_imp.hpp | 77 return (std::make_pair(
100 return (std::make_pair(end(), end()));
111 return (std::make_pair(ret_b, ++ret_e));
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ext/pb_ds/detail/trie_policy/ |
| prefix_search_node_update_imp.hpp | 77 return (std::make_pair(
100 return (std::make_pair(end(), end()));
111 return (std::make_pair(ret_b, ++ret_e));
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/trie_policy/ |
| prefix_search_node_update_imp.hpp | 77 return (std::make_pair(
100 return (std::make_pair(end(), end()));
111 return (std::make_pair(ret_b, ++ret_e));
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/trie_policy/ |
| prefix_search_node_update_imp.hpp | 74 return (std::make_pair(const_iterator(non_const_ret.first),
95 return (std::make_pair(end(), end()));
104 return (std::make_pair(ret_b, ++ret_e));
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/trie_policy/ |
| prefix_search_node_update_imp.hpp | 77 return (std::make_pair(
100 return (std::make_pair(end(), end()));
111 return (std::make_pair(ret_b, ++ret_e));
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/trie_policy/ |
| prefix_search_node_update_imp.hpp | 74 return (std::make_pair(const_iterator(non_const_ret.first),
95 return (std::make_pair(end(), end()));
104 return (std::make_pair(ret_b, ++ret_e));
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/ext/pb_ds/detail/trie_policy/ |
| prefix_search_node_update_imp.hpp | 74 return (std::make_pair(const_iterator(non_const_ret.first),
95 return (std::make_pair(end(), end()));
104 return (std::make_pair(ret_b, ++ret_e));
|
