HomeSort by: relevance | last modified time | path
    Searched defs:Keys (Results 1 - 8 of 8) sorted by relevancy

  /src/external/apache2/llvm/dist/libcxx/benchmarks/
ordered_set.bench.cpp 36 void sortKeysBy(std::vector<uint64_t>& Keys, AccessPattern AP) {
40 std::shuffle(std::begin(Keys), std::end(Keys), M);
46 std::vector<uint64_t> Keys;
56 R.Keys.push_back(Hit == HitType::Hit ? 2 * I : 2 * I + 1);
59 sortKeysBy(R.Keys, Access);
85 std::vector<uint64_t> Keys(TableSize);
86 std::iota(Keys.begin(), Keys.end(), uint64_t{0});
87 sortKeysBy(Keys, Access())
    [all...]
map.bench.cpp 51 std::vector<uint64_t> Keys;
58 enum class Shuffle { None, Keys, Hints };
71 R.Keys.push_back(mode == Mode::Hit ? 2 * I + 2 : 2 * I + 1);
73 if (shuffle == Shuffle::Keys)
74 std::shuffle(R.Keys.begin(), R.Keys.end(), std::mt19937());
243 Order::value == ::Order::Random ? Shuffle::Keys : Shuffle::None, 1000);
246 for (auto K : Data.Keys) {
264 Order::value == ::Order::Random ? Shuffle::Keys
288 for (auto K : Data.Keys) {
    [all...]
  /src/external/gpl2/gettext/dist/gettext-runtime/intl-csharp/
intl.cs 28 * - In the .NET resource approach, the keys are abstract textual shortcuts.
29 * In the GNU gettext approach, the keys are the English/ASCII version
458 /// Returns the keys of this resource set, i.e. the strings for which
461 public virtual ICollection Keys {
463 return Table.Keys;
  /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/
DebugCheckers.cpp 273 SmallVector<const Table::MapEntryTy *, 32> Keys;
276 Keys.push_back(&*I);
277 llvm::array_pod_sort(Keys.begin(), Keys.end(), compareEntry);
280 for (unsigned I = 0, E = Keys.size(); I != E; ++I)
281 llvm::errs() << Keys[I]->getKey() << " = "
282 << (Keys[I]->second.empty() ? "\"\"" : Keys[I]->second)
  /src/sbin/efi/
showvar.c 236 EFI_INPUT_KEY Keys[3];
285 printf(" {%04x, %04x}", u.ko->Keys[i].ScanCode,
286 u.ko->Keys[i].UnicodeChar);
294 printf(" Keys[%u].ScanCode: 0x%04x\n", i,
295 u.ko->Keys[i].ScanCode);
296 printf(" Keys[%u].UnicodeChar: 0x%04x\n", i,
297 u.ko->Keys[i].UnicodeChar);
  /src/external/apache2/llvm/dist/clang/lib/ASTMatchers/
ASTMatchFinder.cpp 62 // generation of keys for each type.
934 // Memoization keys that can be updated with the result.
937 std::vector<MatchKey> Keys;
940 for (const auto &Key : Keys) {
953 Keys.emplace_back();
954 Keys.back().MatcherID = Matcher.getID();
955 Keys.back().Node = Node;
956 Keys.back().BoundNodes = *Builder;
957 Keys.back().Traversal = Ctx.getParentMapContext().getTraversalKind();
958 Keys.back().Type = MatchType::Ancestors
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
SIMachineFunctionInfo.h 166 auto Keys = YamlIO.keys();
167 if (is_contained(Keys, "reg")) {
170 } else if (is_contained(Keys, "offset"))
  /src/external/apache2/llvm/dist/clang/lib/CodeGen/
CGObjC.cpp 154 Address Keys = Address::invalid();
156 Keys = CreateMemTemp(ElementArrayType, "keys");
158 // In ARC, we may need to do extra work to keep all the keys and
181 LValue KeyLV = MakeAddrLValue(Builder.CreateConstArrayGEP(Keys, i),
208 Args.add(RValue::get(Keys.getPointer()), ArgQT);

Completed in 32 milliseconds