/external/openfst/src/include/fst/ |
factor-weight.h | 30 using std::pair; using std::make_pair; 91 pair<W, W> Value() const { return make_pair(W::One(), W::One()); } // unused 113 return make_pair(w1, w2); 139 return make_pair(w1, w2);
|
replace-util.h | 464 fst_pairs.push_back(make_pair(label, fst)); 470 fst_pairs.push_back(make_pair(label, fst)); 530 fst_pairs->push_back(make_pair(label, fst)); 544 mutable_fst_pairs->push_back(make_pair(label, fst->Copy()));
|
/external/oprofile/libutil++/tests/ |
file_manip_tests.cpp | 140 #define MAKE_PAIR(a, b) make_pair(string(a), string(b)) 141 { MAKE_PAIR(__FILE__, __FILE__), true }, 142 { MAKE_PAIR(__FILE__, "not_existing"), false }, 143 { MAKE_PAIR("not_exisiting", __FILE__), false }, 144 { MAKE_PAIR("not_exisiting", "not_existing"), false }, 145 { MAKE_PAIR("", ""), false } 146 #undef MAKE_PAIR
|
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
register.h | 68 fst_table_.insert(make_pair(type, entry));
|
/frameworks/compile/libbcc/lib/ExecutionEngine/ |
GDBJITRegistrar.cpp | 170 ObjectBufferMap[Object] = std::make_pair(Size, JITCodeEntry);
|
/frameworks/compile/mclinker/lib/LD/ |
EhFrameHdr.cpp | 93 search_table.push_back(std::make_pair(fde_pc, fde_addr));
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/ext/pb_ds/detail/resize_policy/ |
hash_load_check_resize_trigger_imp.hpp | 236 return std::make_pair(m_load_min, m_load_max);
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/tr1/ |
hashtable_policy.h | 400 // increase bucket count? If so, return make_pair(true, n), where n 401 // is the new bucket count. If not, return make_pair(false, 0). 445 // If p > __n_bkt, return make_pair(true, p); otherwise return 446 // make_pair(false, 0). In principle this isn't very different from 470 return std::make_pair(true, *__p); 476 return std::make_pair(false, 0); 480 return std::make_pair(false, 0); 530 return __h->_M_insert_bucket(std::make_pair(__k, mapped_type()),
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/tr1/ |
hashtable_policy.h | 400 // increase bucket count? If so, return make_pair(true, n), where n 401 // is the new bucket count. If not, return make_pair(false, 0). 445 // If p > __n_bkt, return make_pair(true, p); otherwise return 446 // make_pair(false, 0). In principle this isn't very different from 470 return std::make_pair(true, *__p); 476 return std::make_pair(false, 0); 480 return std::make_pair(false, 0); 530 return __h->_M_insert_bucket(std::make_pair(__k, mapped_type()),
|
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/tr1/ |
hashtable_policy.h | 400 // increase bucket count? If so, return make_pair(true, n), where n 401 // is the new bucket count. If not, return make_pair(false, 0). 445 // If p > __n_bkt, return make_pair(true, p); otherwise return 446 // make_pair(false, 0). In principle this isn't very different from 470 return std::make_pair(true, *__p); 476 return std::make_pair(false, 0); 480 return std::make_pair(false, 0); 530 return __h->_M_insert_bucket(std::make_pair(__k, mapped_type()),
|
/prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/resize_policy/ |
hash_load_check_resize_trigger_imp.hpp | 241 return std::make_pair(m_load_min, m_load_max);
|
/prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/resize_policy/ |
hash_load_check_resize_trigger_imp.hpp | 241 return std::make_pair(m_load_min, m_load_max);
|
/prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/resize_policy/ |
hash_load_check_resize_trigger_imp.hpp | 241 return std::make_pair(m_load_min, m_load_max);
|
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ext/pb_ds/detail/resize_policy/ |
hash_load_check_resize_trigger_imp.hpp | 241 return std::make_pair(m_load_min, m_load_max);
|
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/resize_policy/ |
hash_load_check_resize_trigger_imp.hpp | 236 return std::make_pair(m_load_min, m_load_max);
|
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/tr1/ |
hashtable_policy.h | 400 // increase bucket count? If so, return make_pair(true, n), where n 401 // is the new bucket count. If not, return make_pair(false, 0). 445 // If p > __n_bkt, return make_pair(true, p); otherwise return 446 // make_pair(false, 0). In principle this isn't very different from 470 return std::make_pair(true, *__p); 476 return std::make_pair(false, 0); 480 return std::make_pair(false, 0); 530 return __h->_M_insert_bucket(std::make_pair(__k, mapped_type()),
|
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/tr1/ |
hashtable_policy.h | 400 // increase bucket count? If so, return make_pair(true, n), where n 401 // is the new bucket count. If not, return make_pair(false, 0). 445 // If p > __n_bkt, return make_pair(true, p); otherwise return 446 // make_pair(false, 0). In principle this isn't very different from 470 return std::make_pair(true, *__p); 476 return std::make_pair(false, 0); 480 return std::make_pair(false, 0); 530 return __h->_M_insert_bucket(std::make_pair(__k, mapped_type()),
|
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/resize_policy/ |
hash_load_check_resize_trigger_imp.hpp | 236 return std::make_pair(m_load_min, m_load_max);
|
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/tr1/ |
hashtable_policy.h | 400 // increase bucket count? If so, return make_pair(true, n), where n 401 // is the new bucket count. If not, return make_pair(false, 0). 445 // If p > __n_bkt, return make_pair(true, p); otherwise return 446 // make_pair(false, 0). In principle this isn't very different from 470 return std::make_pair(true, *__p); 476 return std::make_pair(false, 0); 480 return std::make_pair(false, 0); 530 return __h->_M_insert_bucket(std::make_pair(__k, mapped_type()),
|
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/tr1/ |
hashtable_policy.h | 400 // increase bucket count? If so, return make_pair(true, n), where n 401 // is the new bucket count. If not, return make_pair(false, 0). 445 // If p > __n_bkt, return make_pair(true, p); otherwise return 446 // make_pair(false, 0). In principle this isn't very different from 470 return std::make_pair(true, *__p); 476 return std::make_pair(false, 0); 480 return std::make_pair(false, 0); 530 return __h->_M_insert_bucket(std::make_pair(__k, mapped_type()),
|
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/tr1/ |
hashtable_policy.h | 400 // increase bucket count? If so, return make_pair(true, n), where n 401 // is the new bucket count. If not, return make_pair(false, 0). 445 // If p > __n_bkt, return make_pair(true, p); otherwise return 446 // make_pair(false, 0). In principle this isn't very different from 470 return std::make_pair(true, *__p); 476 return std::make_pair(false, 0); 480 return std::make_pair(false, 0); 530 return __h->_M_insert_bucket(std::make_pair(__k, mapped_type()),
|
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/ |
throw_allocator.h | 147 log_to_string(error, std::make_pair(p, get_label())); 152 map_construct().insert(std::make_pair(p, get_label())); 267 log_to_string(error, std::make_pair(p, get_label())); 309 { return std::make_pair(p, data_type(get_label(), size)); }
|
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/include/tr1/ |
hashtable_policy.h | 400 // increase bucket count? If so, return make_pair(true, n), where n 401 // is the new bucket count. If not, return make_pair(false, 0). 445 // If p > __n_bkt, return make_pair(true, p); otherwise return 446 // make_pair(false, 0). In principle this isn't very different from 470 return std::make_pair(true, *__p); 476 return std::make_pair(false, 0); 480 return std::make_pair(false, 0); 530 return __h->_M_insert_bucket(std::make_pair(__k, mapped_type()),
|
/external/ceres-solver/internal/ceres/ |
graph_algorithms.h | 304 weighted_edges.push_back(make_pair(weight, make_pair(vertex1, vertex2)));
|
/external/chromium_org/ash/display/ |
display_change_observer_chromeos.cc | 127 display_mode_map.insert(std::make_pair(size, display_mode)); 167 DisplayIdPair pair = std::make_pair(display_ids[0], display_ids[1]);
|