/external/libcxx/test/containers/unord/unord.multimap/unord.multimap.cnstr/ |
size_hash_equal_allocator.pass.cpp | 13 // class Alloc = allocator<pair<const Key, T>>> 33 test_allocator<std::pair<const NotConstructible, 39 test_allocator<std::pair<const NotConstructible, NotConstructible> >(10) 45 (test_allocator<std::pair<const NotConstructible, NotConstructible> >(10))); 57 min_allocator<std::pair<const NotConstructible, 63 min_allocator<std::pair<const NotConstructible, NotConstructible> >() 69 (min_allocator<std::pair<const NotConstructible, NotConstructible> >()));
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/ |
bucket_count.pass.cpp | 13 // class Alloc = allocator<pair<const Key, T>>> 29 typedef std::pair<int, std::string> P; 36 typedef std::pair<int, std::string> P; 54 min_allocator<std::pair<const int, std::string>>> C; 56 typedef std::pair<int, std::string> P; 62 min_allocator<std::pair<const int, std::string>>> C; 64 typedef std::pair<int, std::string> P;
|
equal_range_const.pass.cpp | 13 // class Alloc = allocator<pair<const Key, T>>> 16 // pair<const_iterator, const_iterator> equal_range(const key_type& k) const; 29 typedef std::pair<int, std::string> P; 42 std::pair<I, I> r = c.equal_range(30); 52 min_allocator<std::pair<const int, std::string>>> C; 54 typedef std::pair<int, std::string> P; 67 std::pair<I, I> r = c.equal_range(30);
|
equal_range_non_const.pass.cpp | 13 // class Alloc = allocator<pair<const Key, T>>> 16 // pair<iterator, iterator> equal_range(const key_type& k); 29 typedef std::pair<int, std::string> P; 42 std::pair<I, I> r = c.equal_range(30); 52 min_allocator<std::pair<const int, std::string>>> C; 54 typedef std::pair<int, std::string> P; 67 std::pair<I, I> r = c.equal_range(30);
|
load_factor.pass.cpp | 13 // class Alloc = allocator<pair<const Key, T>>> 29 typedef std::pair<int, std::string> P; 46 typedef std::pair<int, std::string> P; 53 min_allocator<std::pair<const int, std::string>>> C; 54 typedef std::pair<int, std::string> P; 71 min_allocator<std::pair<const int, std::string>>> C; 72 typedef std::pair<int, std::string> P;
|
max_load_factor.pass.cpp | 13 // class Alloc = allocator<pair<const Key, T>>> 33 typedef std::pair<int, std::string> P; 39 typedef std::pair<int, std::string> P; 48 min_allocator<std::pair<const int, std::string>>> C; 49 typedef std::pair<int, std::string> P; 55 min_allocator<std::pair<const int, std::string>>> C; 56 typedef std::pair<int, std::string> P;
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/unord.map.cnstr/ |
size_hash_equal_allocator.pass.cpp | 13 // class Alloc = allocator<pair<const Key, T>>> 33 test_allocator<std::pair<const NotConstructible, 39 test_allocator<std::pair<const NotConstructible, NotConstructible> >(10) 45 (test_allocator<std::pair<const NotConstructible, NotConstructible> >(10))); 57 min_allocator<std::pair<const NotConstructible, 63 min_allocator<std::pair<const NotConstructible, NotConstructible> >() 69 (min_allocator<std::pair<const NotConstructible, NotConstructible> >()));
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/unord.map.elem/ |
index.pass.cpp | 13 // class Alloc = allocator<pair<const Key, T>>> 29 typedef std::pair<int, std::string> P; 50 typedef std::pair<int, std::string> P; 72 min_allocator<std::pair<const int, std::string>>> C; 73 typedef std::pair<int, std::string> P; 94 min_allocator<std::pair<const MoveOnly, std::string>>> C; 95 typedef std::pair<int, std::string> P;
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/unorder.map.modifiers/ |
emplace.pass.cpp | 13 // class Alloc = allocator<pair<const Key, T>>> 17 // pair<iterator, bool> emplace(Args&&... args); 30 typedef std::pair<C::iterator, bool> R; 39 r = c.emplace(std::pair<const int, Emplaceable>(4, Emplaceable(5, 6))); 55 min_allocator<std::pair<const int, Emplaceable>>> C; 56 typedef std::pair<C::iterator, bool> R; 65 r = c.emplace(std::pair<const int, Emplaceable>(4, Emplaceable(5, 6)));
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/ |
load_factor.pass.cpp | 13 // class Alloc = allocator<pair<const Key, T>>> 29 typedef std::pair<int, std::string> P; 46 typedef std::pair<int, std::string> P; 53 min_allocator<std::pair<const int, std::string>>> C; 54 typedef std::pair<int, std::string> P; 71 min_allocator<std::pair<const int, std::string>>> C; 72 typedef std::pair<int, std::string> P;
|
max_load_factor.pass.cpp | 13 // class Alloc = allocator<pair<const Key, T>>> 33 typedef std::pair<int, std::string> P; 39 typedef std::pair<int, std::string> P; 48 min_allocator<std::pair<const int, std::string>>> C; 49 typedef std::pair<int, std::string> P; 55 min_allocator<std::pair<const int, std::string>>> C; 56 typedef std::pair<int, std::string> P;
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/unord.multimap.cnstr/ |
size_hash_equal_allocator.pass.cpp | 13 // class Alloc = allocator<pair<const Key, T>>> 33 test_allocator<std::pair<const NotConstructible, 39 test_allocator<std::pair<const NotConstructible, NotConstructible> >(10) 45 (test_allocator<std::pair<const NotConstructible, NotConstructible> >(10))); 57 min_allocator<std::pair<const NotConstructible, 63 min_allocator<std::pair<const NotConstructible, NotConstructible> >() 69 (min_allocator<std::pair<const NotConstructible, NotConstructible> >()));
|
/prebuilts/clang/linux-x86/host/3.4/bin/ |
tblgen | |
/external/stlport/stlport/stl/debug/ |
_tree.h | 199 pair<iterator,iterator> equal_range(const _KT& __x) { 200 return pair<iterator, iterator>(iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)), 204 pair<const_iterator, const_iterator> equal_range(const _KT& __x) const { 205 return pair<const_iterator,const_iterator>(const_iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)), 210 pair<iterator,iterator> equal_range_unique(const _KT& __x) { 211 _STLP_STD::pair<_Base_iterator, _Base_iterator> __p; 213 return pair<iterator, iterator>(iterator(&_M_iter_list, __p.first), iterator(&_M_iter_list, __p.second)); 216 pair<const_iterator, const_iterator> equal_range_unique(const _KT& __x) const { 217 _STLP_STD::pair<_Base_const_iterator, _Base_const_iterator> __p; 219 return pair<const_iterator, const_iterator>(const_iterator(&_M_iter_list, __p.first) [all...] |
/ndk/sources/cxx-stl/stlport/stlport/stl/debug/ |
_tree.h | 199 pair<iterator,iterator> equal_range(const _KT& __x) { 200 return pair<iterator, iterator>(iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)), 204 pair<const_iterator, const_iterator> equal_range(const _KT& __x) const { 205 return pair<const_iterator,const_iterator>(const_iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)), 210 pair<iterator,iterator> equal_range_unique(const _KT& __x) { 211 _STLP_STD::pair<_Base_iterator, _Base_iterator> __p; 213 return pair<iterator, iterator>(iterator(&_M_iter_list, __p.first), iterator(&_M_iter_list, __p.second)); 216 pair<const_iterator, const_iterator> equal_range_unique(const _KT& __x) const { 217 _STLP_STD::pair<_Base_const_iterator, _Base_const_iterator> __p; 219 return pair<const_iterator, const_iterator>(const_iterator(&_M_iter_list, __p.first) [all...] |
/prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/debug/ |
_tree.h | 199 pair<iterator,iterator> equal_range(const _KT& __x) { 200 return pair<iterator, iterator>(iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)), 204 pair<const_iterator, const_iterator> equal_range(const _KT& __x) const { 205 return pair<const_iterator,const_iterator>(const_iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)), 210 pair<iterator,iterator> equal_range_unique(const _KT& __x) { 211 _STLP_STD::pair<_Base_iterator, _Base_iterator> __p; 213 return pair<iterator, iterator>(iterator(&_M_iter_list, __p.first), iterator(&_M_iter_list, __p.second)); 216 pair<const_iterator, const_iterator> equal_range_unique(const _KT& __x) const { 217 _STLP_STD::pair<_Base_const_iterator, _Base_const_iterator> __p; 219 return pair<const_iterator, const_iterator>(const_iterator(&_M_iter_list, __p.first) [all...] |
/prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/debug/ |
_tree.h | 199 pair<iterator,iterator> equal_range(const _KT& __x) { 200 return pair<iterator, iterator>(iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)), 204 pair<const_iterator, const_iterator> equal_range(const _KT& __x) const { 205 return pair<const_iterator,const_iterator>(const_iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)), 210 pair<iterator,iterator> equal_range_unique(const _KT& __x) { 211 _STLP_STD::pair<_Base_iterator, _Base_iterator> __p; 213 return pair<iterator, iterator>(iterator(&_M_iter_list, __p.first), iterator(&_M_iter_list, __p.second)); 216 pair<const_iterator, const_iterator> equal_range_unique(const _KT& __x) const { 217 _STLP_STD::pair<_Base_const_iterator, _Base_const_iterator> __p; 219 return pair<const_iterator, const_iterator>(const_iterator(&_M_iter_list, __p.first) [all...] |
/prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/debug/ |
_tree.h | 199 pair<iterator,iterator> equal_range(const _KT& __x) { 200 return pair<iterator, iterator>(iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)), 204 pair<const_iterator, const_iterator> equal_range(const _KT& __x) const { 205 return pair<const_iterator,const_iterator>(const_iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)), 210 pair<iterator,iterator> equal_range_unique(const _KT& __x) { 211 _STLP_STD::pair<_Base_iterator, _Base_iterator> __p; 213 return pair<iterator, iterator>(iterator(&_M_iter_list, __p.first), iterator(&_M_iter_list, __p.second)); 216 pair<const_iterator, const_iterator> equal_range_unique(const _KT& __x) const { 217 _STLP_STD::pair<_Base_const_iterator, _Base_const_iterator> __p; 219 return pair<const_iterator, const_iterator>(const_iterator(&_M_iter_list, __p.first) [all...] |
/prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/debug/ |
_tree.h | 199 pair<iterator,iterator> equal_range(const _KT& __x) { 200 return pair<iterator, iterator>(iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)), 204 pair<const_iterator, const_iterator> equal_range(const _KT& __x) const { 205 return pair<const_iterator,const_iterator>(const_iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)), 210 pair<iterator,iterator> equal_range_unique(const _KT& __x) { 211 _STLP_STD::pair<_Base_iterator, _Base_iterator> __p; 213 return pair<iterator, iterator>(iterator(&_M_iter_list, __p.first), iterator(&_M_iter_list, __p.second)); 216 pair<const_iterator, const_iterator> equal_range_unique(const _KT& __x) const { 217 _STLP_STD::pair<_Base_const_iterator, _Base_const_iterator> __p; 219 return pair<const_iterator, const_iterator>(const_iterator(&_M_iter_list, __p.first) [all...] |
/prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/debug/ |
_tree.h | 199 pair<iterator,iterator> equal_range(const _KT& __x) { 200 return pair<iterator, iterator>(iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)), 204 pair<const_iterator, const_iterator> equal_range(const _KT& __x) const { 205 return pair<const_iterator,const_iterator>(const_iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)), 210 pair<iterator,iterator> equal_range_unique(const _KT& __x) { 211 _STLP_STD::pair<_Base_iterator, _Base_iterator> __p; 213 return pair<iterator, iterator>(iterator(&_M_iter_list, __p.first), iterator(&_M_iter_list, __p.second)); 216 pair<const_iterator, const_iterator> equal_range_unique(const _KT& __x) const { 217 _STLP_STD::pair<_Base_const_iterator, _Base_const_iterator> __p; 219 return pair<const_iterator, const_iterator>(const_iterator(&_M_iter_list, __p.first) [all...] |
/external/chromium_org/components/query_parser/ |
snippet.cc | 27 // or touch the pair at offset. 31 Snippet::MatchPosition& pair((*match_positions)[offset]); 34 pair.second >= (*match_positions)[offset].first) { 35 pair.second = std::max(pair.second, (*match_positions)[offset].second); 40 // Makes sure there is a pair in match_positions that contains the specified 48 Snippet::MatchPosition pair(start, end); 50 match_positions->push_back(pair); 57 pair, &PairFirstLessThan); 59 // Match not at the end and there is already a pair with the sam [all...] |
/external/google-tv-pairing-protocol/java/src/com/google/polo/ssl/ |
SslUtil.java | 62 * Generates a new RSA key pair. 90 * @param pair the {@link KeyPair} to be used 97 public static X509Certificate generateX509V1Certificate(KeyPair pair, 117 certGen.setPublicKey(pair.getPublic()); 120 X509Certificate cert = certGen.generate(pair.getPrivate()); 127 * @param pair the {@link KeyPair} to be used 136 public static X509Certificate generateX509V3Certificate(KeyPair pair, 148 certGen.setPublicKey(pair.getPublic()); 176 pair.getPublic(), dnName, serialNumber); 181 new SubjectKeyIdentifierStructure(pair.getPublic())) 328 KeyPair pair = SslUtil.generateRsaKeyPair(); local [all...] |
/external/chromium_org/chrome/browser/resources/options/chromeos/ |
bluetooth_pair_device_overlay.js | 36 'bluetooth-pair-device-connect-button', 37 'bluetooth-pair-device-cancel-button', 38 'bluetooth-pair-device-accept-button', 39 'bluetooth-pair-device-reject-button', 40 'bluetooth-pair-device-dismiss-button']; 75 $('bluetooth-pair-device-cancel-button').onclick = function() { 78 $('bluetooth-pair-device-reject-button').onclick = function() { 84 $('bluetooth-pair-device-connect-button').onclick = function() { 95 $('bluetooth-pair-device-connect-button').disabled = true; 97 $('bluetooth-pair-device-accept-button').onclick = function() [all...] |
/external/chromium_org/chrome/test/android/javatests/src/org/chromium/chrome/test/util/browser/sync/ |
SyncTestUtil.java | 12 import android.util.Pair; 55 public static final Pair<String, String> SYNC_SUMMARY_STATUS = 58 protected static final Pair<String, String> USERNAME_STAT = 69 * Creates a Pair of lowercased and trimmed Strings. Makes it easier to avoid running afoul of 70 * case-sensitive comparison since getAboutInfoStats(), et al, use Pair<String, String> as map 73 private static Pair<String, String> newPair(String first, String second) { 74 return Pair.create(first.toLowerCase(Locale.US).trim(), 79 * Parses raw JSON into a map with keys Pair<String, String>. The first string in each Pair 82 * "Local State" would be a Pair of newPair("Local State", "Syncing") [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/tr1/ |
unordered_map.h | 41 class _Alloc = std::allocator<std::pair<const _Key, _Tp> >, 44 : public _Hashtable<_Key, std::pair<const _Key, _Tp>, _Alloc, 45 std::_Select1st<std::pair<const _Key, _Tp> >, _Pred, 51 typedef _Hashtable<_Key, std::pair<const _Key, _Tp>, _Alloc, 52 std::_Select1st<std::pair<const _Key, _Tp> >, _Pred, 72 __eql, std::_Select1st<std::pair<const _Key, _Tp> >(), __a) 83 __eql, std::_Select1st<std::pair<const _Key, _Tp> >(), __a) 90 class _Alloc = std::allocator<std::pair<const _Key, _Tp> >, 93 : public _Hashtable<_Key, std::pair<const _Key, _Tp>, 95 std::_Select1st<std::pair<const _Key, _Tp> >, _Pred [all...] |