HomeSort by relevance Sort by last modified time
    Searched refs:KV (Results 1 - 25 of 127) sorted by null

1 2 3 4 5 6

  /external/libcxx/test/std/containers/associative/map/map.access/
max_size.pass.cpp 26 typedef std::pair<const int, int> KV;
28 typedef limited_allocator<KV, 10> A;
35 typedef limited_allocator<KV, (size_t)-1> A;
  /external/libcxx/test/std/containers/associative/multimap/
max_size.pass.cpp 26 typedef std::pair<const int, int> KV;
28 typedef limited_allocator<KV, 10> A;
35 typedef limited_allocator<KV, (size_t)-1> A;
  /external/libcxx/test/std/containers/unord/unord.map/
max_size.pass.cpp 26 typedef std::pair<const int, int> KV;
28 typedef limited_allocator<KV, 10> A;
36 typedef limited_allocator<KV, (size_t)-1> A;
  /external/libcxx/test/std/containers/unord/unord.multimap/
max_size.pass.cpp 26 typedef std::pair<const int, int> KV;
28 typedef limited_allocator<KV, 10> A;
37 typedef limited_allocator<KV, (size_t)-1> A;
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/map/map.access/
max_size.pass.cpp 26 typedef std::pair<const int, int> KV;
28 typedef limited_allocator<KV, 10> A;
35 typedef limited_allocator<KV, (size_t)-1> A;
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/multimap/
max_size.pass.cpp 26 typedef std::pair<const int, int> KV;
28 typedef limited_allocator<KV, 10> A;
35 typedef limited_allocator<KV, (size_t)-1> A;
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.map/
max_size.pass.cpp 26 typedef std::pair<const int, int> KV;
28 typedef limited_allocator<KV, 10> A;
36 typedef limited_allocator<KV, (size_t)-1> A;
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.multimap/
max_size.pass.cpp 26 typedef std::pair<const int, int> KV;
28 typedef limited_allocator<KV, 10> A;
37 typedef limited_allocator<KV, (size_t)-1> A;
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/utils/google-benchmark/test/
output_test_helper.cc 56 for (auto const& KV : subs) {
59 while ((pos = source.find(KV.first, next_start)) != std::string::npos) {
60 next_start = pos + KV.second.size();
61 source.replace(pos, KV.first.size(), KV.second);
171 for (auto KV : il) {
173 KV.second = internal::PerformSubstitutions(KV.second);
175 if (EKV.first == KV.first) {
176 EKV.second = std::move(KV.second)
    [all...]
  /external/swiftshader/third_party/LLVM/lib/MC/
MCSubtargetInfo.cpp 83 SubtargetInfoKV KV;
84 KV.Key = CPU.data();
86 std::lower_bound(ProcItins, ProcItins+NumProcs, KV);
  /external/llvm/lib/Transforms/IPO/
ForceFunctionAttrs.cpp 67 auto KV = StringRef(S).split(':');
68 if (KV.first != F.getName())
71 auto Kind = parseAttrKind(KV.second);
73 DEBUG(dbgs() << "ForcedAttribute: " << KV.second
  /external/llvm/lib/Target/
TargetRecip.cpp 99 for (auto &KV : RecipMap)
100 KV.second.Enabled = Enable;
104 for (auto &KV : RecipMap)
105 KV.second.RefinementSteps = RefSteps;
198 for (auto &KV : RecipMap) {
199 RecipParams &RP = KV.second;
215 for (const auto &KV : RecipMap) {
216 StringRef Op = KV.first;
217 const RecipParams &RP = KV.second;
  /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/accessibility/
KeyboardAccessibilityDelegate.java 43 * @param <KV> The keyboard view class type.
45 public class KeyboardAccessibilityDelegate<KV extends KeyboardView>
50 protected final KV mKeyboardView;
53 private KeyboardAccessibilityNodeProvider<KV> mAccessibilityNodeProvider;
58 public KeyboardAccessibilityDelegate(final KV keyboardView, final KeyDetector keyDetector) {
136 public KeyboardAccessibilityNodeProvider<KV> getAccessibilityNodeProvider(final View host) {
143 protected KeyboardAccessibilityNodeProvider<KV> getAccessibilityNodeProvider() {
292 final KeyboardAccessibilityNodeProvider<KV> provider = getAccessibilityNodeProvider();
315 final KeyboardAccessibilityNodeProvider<KV> provider = getAccessibilityNodeProvider();
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/
MapVector.h 101 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) {
102 std::pair<KeyT, unsigned> Pair = std::make_pair(KV.first, 0);
106 Vector.push_back(std::make_pair(KV.first, KV.second));
113 std::pair<iterator, bool> insert(std::pair<KeyT, ValueT> &&KV) {
114 // Copy KV.first into the map, then move it into the vector.
115 std::pair<KeyT, unsigned> Pair = std::make_pair(KV.first, 0);
119 Vector.push_back(std::move(KV));
  /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/ADT/
MapVector.h 107 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) {
108 std::pair<KeyT, unsigned> Pair = std::make_pair(KV.first, 0);
112 Vector.push_back(std::make_pair(KV.first, KV.second));
119 std::pair<iterator, bool> insert(std::pair<KeyT, ValueT> &&KV) {
120 // Copy KV.first into the map, then move it into the vector.
121 std::pair<KeyT, unsigned> Pair = std::make_pair(KV.first, 0);
125 Vector.push_back(std::move(KV));
  /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/ADT/
MapVector.h 107 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) {
108 std::pair<KeyT, unsigned> Pair = std::make_pair(KV.first, 0);
112 Vector.push_back(std::make_pair(KV.first, KV.second));
119 std::pair<iterator, bool> insert(std::pair<KeyT, ValueT> &&KV) {
120 // Copy KV.first into the map, then move it into the vector.
121 std::pair<KeyT, unsigned> Pair = std::make_pair(KV.first, 0);
125 Vector.push_back(std::move(KV));
  /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/ADT/
MapVector.h 107 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) {
108 std::pair<KeyT, unsigned> Pair = std::make_pair(KV.first, 0);
112 Vector.push_back(std::make_pair(KV.first, KV.second));
119 std::pair<iterator, bool> insert(std::pair<KeyT, ValueT> &&KV) {
120 // Copy KV.first into the map, then move it into the vector.
121 std::pair<KeyT, unsigned> Pair = std::make_pair(KV.first, 0);
125 Vector.push_back(std::move(KV));
  /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/ADT/
MapVector.h 107 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) {
108 std::pair<KeyT, unsigned> Pair = std::make_pair(KV.first, 0);
112 Vector.push_back(std::make_pair(KV.first, KV.second));
119 std::pair<iterator, bool> insert(std::pair<KeyT, ValueT> &&KV) {
120 // Copy KV.first into the map, then move it into the vector.
121 std::pair<KeyT, unsigned> Pair = std::make_pair(KV.first, 0);
125 Vector.push_back(std::move(KV));
  /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/ADT/
MapVector.h 107 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) {
108 std::pair<KeyT, unsigned> Pair = std::make_pair(KV.first, 0);
112 Vector.push_back(std::make_pair(KV.first, KV.second));
119 std::pair<iterator, bool> insert(std::pair<KeyT, ValueT> &&KV) {
120 // Copy KV.first into the map, then move it into the vector.
121 std::pair<KeyT, unsigned> Pair = std::make_pair(KV.first, 0);
125 Vector.push_back(std::move(KV));
  /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/ADT/
MapVector.h 107 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) {
108 std::pair<KeyT, unsigned> Pair = std::make_pair(KV.first, 0);
112 Vector.push_back(std::make_pair(KV.first, KV.second));
119 std::pair<iterator, bool> insert(std::pair<KeyT, ValueT> &&KV) {
120 // Copy KV.first into the map, then move it into the vector.
121 std::pair<KeyT, unsigned> Pair = std::make_pair(KV.first, 0);
125 Vector.push_back(std::move(KV));
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/
MapVector.h 101 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) {
102 std::pair<KeyT, unsigned> Pair = std::make_pair(KV.first, 0);
106 Vector.push_back(std::make_pair(KV.first, KV.second));
113 std::pair<iterator, bool> insert(std::pair<KeyT, ValueT> &&KV) {
114 // Copy KV.first into the map, then move it into the vector.
115 std::pair<KeyT, unsigned> Pair = std::make_pair(KV.first, 0);
119 Vector.push_back(std::move(KV));
  /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/ADT/
MapVector.h 107 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) {
108 std::pair<KeyT, unsigned> Pair = std::make_pair(KV.first, 0);
112 Vector.push_back(std::make_pair(KV.first, KV.second));
119 std::pair<iterator, bool> insert(std::pair<KeyT, ValueT> &&KV) {
120 // Copy KV.first into the map, then move it into the vector.
121 std::pair<KeyT, unsigned> Pair = std::make_pair(KV.first, 0);
125 Vector.push_back(std::move(KV));
  /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/ADT/
MapVector.h 107 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) {
108 std::pair<KeyT, unsigned> Pair = std::make_pair(KV.first, 0);
112 Vector.push_back(std::make_pair(KV.first, KV.second));
119 std::pair<iterator, bool> insert(std::pair<KeyT, ValueT> &&KV) {
120 // Copy KV.first into the map, then move it into the vector.
121 std::pair<KeyT, unsigned> Pair = std::make_pair(KV.first, 0);
125 Vector.push_back(std::move(KV));
  /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/ADT/
MapVector.h 107 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) {
108 std::pair<KeyT, unsigned> Pair = std::make_pair(KV.first, 0);
112 Vector.push_back(std::make_pair(KV.first, KV.second));
119 std::pair<iterator, bool> insert(std::pair<KeyT, ValueT> &&KV) {
120 // Copy KV.first into the map, then move it into the vector.
121 std::pair<KeyT, unsigned> Pair = std::make_pair(KV.first, 0);
125 Vector.push_back(std::move(KV));
  /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/ADT/
MapVector.h 107 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) {
108 std::pair<KeyT, unsigned> Pair = std::make_pair(KV.first, 0);
112 Vector.push_back(std::make_pair(KV.first, KV.second));
119 std::pair<iterator, bool> insert(std::pair<KeyT, ValueT> &&KV) {
120 // Copy KV.first into the map, then move it into the vector.
121 std::pair<KeyT, unsigned> Pair = std::make_pair(KV.first, 0);
125 Vector.push_back(std::move(KV));

Completed in 1664 milliseconds

1 2 3 4 5 6