Home
last modified time | relevance | path

Searched refs:Key (Results 1 – 25 of 280) sorted by relevance

12345678910>>...12

/minix3/external/bsd/libc++/dist/libcxx/test/containers/unord/unord.map/
H A Dcompare.pass.cpp21 struct Key { struct
22 template <typename T> Key(const T&) {} in Key() argument
23 bool operator== (const Key&) const { return true; } in operator ==() argument
29 struct hash<Key>
31 size_t operator()(Key const &) const {return 0;} in operator ()()
38 std::unordered_map<Key, int>::iterator it = in main()
39 std::unordered_map<Key, int>().find(Key(0)); in main()
40 std::pair<std::unordered_map<Key, int>::iterator, bool> result = in main()
41 std::unordered_map<Key, int>().insert(std::make_pair(Key(0), 0)); in main()
/minix3/external/bsd/libc++/dist/libcxx/test/containers/associative/map/
H A Dcompare.pass.cpp21 struct Key { struct
22 template <typename T> Key(const T&) {} in Key() function
23 bool operator< (const Key&) const { return false; } in operator <() argument
29 std::map<Key, int>::iterator it = std::map<Key, int>().find(Key(0)); in main()
30 std::pair<std::map<Key, int>::iterator, bool> result = in main()
31 std::map<Key, int>().insert(std::make_pair(Key(0), 0)); in main()
/minix3/external/bsd/libc++/dist/libcxx/test/std/containers/associative/map/
H A Dcompare.pass.cpp23 struct Key { struct
24 template <typename T> Key(const T&) {} in Key() function
25 bool operator< (const Key&) const { return false; } in operator <() argument
30 typedef std::map<Key, int> MapT; in main()
36 m_contains[Key(0)] = 42; in main()
38 Iter it = m_empty.find(Key(0)); in main()
40 it = m_contains.find(Key(0)); in main()
45 IterBool result = map.insert(std::make_pair(Key(0), 42)); in main()
48 IterBool result2 = map.insert(std::make_pair(Key(0), 43)); in main()
50 assert(map[Key(0)] == 42); in main()
/minix3/external/bsd/libc++/dist/libcxx/test/std/containers/unord/unord.map/
H A Dcompare.pass.cpp22 struct Key { struct
23 template <typename T> Key(const T&) {} in Key() argument
24 bool operator== (const Key&) const { return true; } in operator ==() argument
30 struct hash<Key>
32 size_t operator()(Key const &) const {return 0;} in operator ()()
39 typedef std::unordered_map<Key, int> MapT; in main()
42 Iter it = map.find(Key(0)); in main()
44 std::pair<Iter, bool> result = map.insert(std::make_pair(Key(0), 42)); in main()
/minix3/external/bsd/tcpdump/dist/tests/
H A Dlacp-ev.out3 System 00:13:c4:12:0f:00, System Priority 32768, Key 13, Port 22, Port Priority 32768
6 System 00:0e:83:16:f5:00, System Priority 32768, Key 13, Port 25, Port Priority 32768
13 System 00:13:c4:12:0f:00, System Priority 32768, Key 13, Port 22, Port Priority 32768
16 System 00:0e:83:16:f5:00, System Priority 32768, Key 13, Port 25, Port Priority 32768
23 System 00:13:c4:12:0f:00, System Priority 32768, Key 13, Port 22, Port Priority 32768
26 System 00:0e:83:16:f5:00, System Priority 32768, Key 13, Port 25, Port Priority 32768
33 System 00:13:c4:12:0f:00, System Priority 32768, Key 13, Port 22, Port Priority 32768
36 System 00:00:00:00:00:00, System Priority 0, Key 0, Port 0, Port Priority 0
43 System 00:13:c4:12:0f:00, System Priority 32768, Key 13, Port 22, Port Priority 32768
46 System 00:00:00:00:00:00, System Priority 0, Key 0, Port 0, Port Priority 0
[all …]
/minix3/external/bsd/llvm/dist/llvm/include/llvm/ADT/
H A DSparseSet.h74 unsigned operator()(const KeyT &Key) const {
75 return KeyFunctorT()(Key);
224 iterator find(const KeyT &Key) {
225 return findIndex(KeyIndexOf(Key));
228 const_iterator find(const KeyT &Key) const {
229 return const_cast<SparseSet*>(this)->findIndex(KeyIndexOf(Key));
235 size_type count(const KeyT &Key) const {
236 return find(Key) == end() ? 0 : 1;
262 ValueT &operator[](const KeyT &Key) {
263 return *insert(ValueT(Key)).first;
[all …]
H A DStringMap.h74 unsigned LookupBucketFor(StringRef Key);
79 int FindKey(StringRef Key) const;
87 StringMapEntryBase *RemoveKey(StringRef Key);
143 static StringMapEntry *Create(StringRef Key, AllocatorTy &Allocator, in Create() argument
145 unsigned KeyLength = Key.size(); in Create()
161 memcpy(StrBuffer, Key.data(), KeyLength); in Create()
167 static StringMapEntry *Create(StringRef Key, AllocatorTy &Allocator) { in Create() argument
168 return Create(Key, Allocator, ValueTy()); in Create()
173 static StringMapEntry *Create(StringRef Key, InitType &&InitVal) { in Create() argument
175 return Create(Key, A, std::forward<InitType>(InitVal)); in Create()
[all …]
H A DMapVector.h70 ValueT &operator[](const KeyT &Key) {
71 std::pair<KeyT, unsigned> Pair = std::make_pair(Key, 0);
75 Vector.push_back(std::make_pair(Key, ValueT()));
81 ValueT lookup(const KeyT &Key) const { in lookup() argument
82 typename MapType::const_iterator Pos = Map.find(Key); in lookup()
98 size_type count(const KeyT &Key) const { in count() argument
99 typename MapType::const_iterator Pos = Map.find(Key); in count()
103 iterator find(const KeyT &Key) { in find() argument
104 typename MapType::const_iterator Pos = Map.find(Key); in find()
109 const_iterator find(const KeyT &Key) const { in find() argument
[all …]
H A DScopedHashTable.h47 K Key; variable
49 ScopedHashTableVal(const K &key, const V &val) : Key(key), Val(val) {} in ScopedHashTableVal()
52 const K &getKey() const { return Key; } in getKey()
175 size_type count(const K &Key) const { in count() argument
176 return TopLevelMap.count(Key); in count()
179 V lookup(const K &Key) { in lookup() argument
180 typename DenseMap<K, ValTy*, KInfo>::iterator I = TopLevelMap.find(Key); in lookup()
187 void insert(const K &Key, const V &Val) { in insert() argument
188 insertIntoScope(CurScope, Key, Val); in insert()
195 iterator begin(const K &Key) { in begin() argument
[all …]
H A DSparseMultiSet.h371 iterator find(const KeyT &Key) { in find() argument
372 return findIndex(KeyIndexOf(Key)); in find()
375 const_iterator find(const KeyT &Key) const { in find() argument
376 iterator I = const_cast<SparseMultiSet*>(this)->findIndex(KeyIndexOf(Key)); in find()
377 return const_iterator(I.SMS, I.Idx, KeyIndexOf(Key)); in find()
382 size_type count(const KeyT &Key) const { in count() argument
384 for (const_iterator It = find(Key); It != end(); ++It) in count()
391 bool contains(const KeyT &Key) const { in contains() argument
392 return find(Key) != end(); in contains()
396 iterator getHead(const KeyT &Key) { return find(Key); } in getHead() argument
[all …]
/minix3/external/bsd/llvm/dist/llvm/lib/IR/
H A DLLVMContextImpl.h59 static unsigned getHashValue(const APInt &Key) { in getHashValue()
60 return static_cast<unsigned>(hash_value(Key)); in getHashValue()
70 static unsigned getHashValue(const APFloat &Key) { in getHashValue()
71 return static_cast<unsigned>(hash_value(Key)); in getHashValue()
103 static unsigned getHashValue(const KeyTy& Key) { in getHashValue()
104 return hash_combine(hash_combine_range(Key.ETypes.begin(), in getHashValue()
105 Key.ETypes.end()), in getHashValue()
106 Key.isPacked); in getHashValue()
150 static unsigned getHashValue(const KeyTy& Key) { in getHashValue()
151 return hash_combine(Key.ReturnType, in getHashValue()
[all …]
/minix3/crypto/external/bsd/heimdal/include/
H A Dhdb-protos.h96 Key **/*key*/);
200 hdb_free_key (Key */*key*/);
206 Key */*keys*/);
217 Key **/*ret_key_set*/,
226 Key **/*keys*/,
290 Key **/*key*/);
329 Key */*k*/);
334 Key */*k*/,
374 Key */*k*/);
379 Key */*k*/,
/minix3/external/bsd/llvm/dist/clang/lib/Lex/
H A DHeaderMap.cpp38 uint32_t Key; // Offset (into strings) of key. member
136 Result.Key = HMAP_EmptyBucketKey; in getBucket()
150 Result.Key = getEndianAdjustedWord(BucketPtr->Key); in getBucket()
187 if (B.Key == HMAP_EmptyBucketKey) continue; in dump()
189 const char *Key = getString(B.Key); in dump() local
192 fprintf(stderr, " %d. %s -> '%s' '%s'\n", i, Key, Prefix, Suffix); in dump()
222 if (B.Key == HMAP_EmptyBucketKey) return StringRef(); // Hash miss. in lookupFilename()
225 if (!Filename.equals_lower(getString(B.Key))) in lookupFilename()
/minix3/external/bsd/llvm/dist/clang/test/SemaCXX/
H A Dflexible-array-test.cpp4 template <class Key, class T> struct QMap
6 void insert(const Key &, const T &);
11 template <class Key, class T>
12 void QMap<Key, T>::insert(const Key &, const T &avalue) in insert() argument
/minix3/external/bsd/llvm/dist/llvm/test/Transforms/InstCombine/
H A D2009-01-08-AlignAlloca.ll7 %struct.Key = type { { i32, i32 } }
12 %iospec = alloca %struct.Key ; <%struct.Key*> [#uses=3]
15 %0 = getelementptr %struct.Key* %iospec, i32 0, i32 0 ; <{ i32, i32 }*> [#uses=2]
20 %3 = getelementptr %struct.Key* %iospec, i32 0, i32 0 ; <{ i32, i32 }*> [#uses=1]
23 …%5 = call i32 (...)* @foo(%struct.Key* byval align 4 %iospec, i32* %ret) nounwind ; <i32> [#uses=…
/minix3/external/mit/xorg/bin/xdm/config/
H A DXresources.cpp12 Ctrl<Key>R: abort-display()NLBS
13 <Key>F1: set-session-argument(failsafe) finish-field()NLBS
14 <Key>Delete: delete-character()NLBS
15 <Key>Left: move-backward-character()NLBS
16 <Key>Right: move-forward-character()NLBS
17 <Key>Home: move-to-begining()NLBS
18 <Key>End: move-to-end()NLBS
19 Ctrl<Key>KP_Enter: set-session-argument(failsafe) finish-field()NLBS
20 <Key>KP_Enter: set-session-argument() finish-field()NLBS
21 Ctrl<Key>Return: set-session-argument(failsafe) finish-field()NLBS
[all …]
/minix3/external/bsd/llvm/dist/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DProgramStateTrait.h58 template <typename Key, typename Data, typename Info>
59 struct ProgramStatePartialTrait< llvm::ImmutableMap<Key,Data,Info> > {
60 typedef llvm::ImmutableMap<Key,Data,Info> data_type;
62 typedef Key key_type;
104 #define CLANG_ENTO_PROGRAMSTATE_MAP(Key, Value) llvm::ImmutableMap<Key, Value>
109 template <typename Key, typename Info>
110 struct ProgramStatePartialTrait< llvm::ImmutableSet<Key,Info> > {
111 typedef llvm::ImmutableSet<Key,Info> data_type;
113 typedef Key key_type;
/minix3/external/bsd/llvm/dist/llvm/lib/Transforms/Utils/
H A DSymbolRewriter.cpp273 yaml::ScalarNode *Key; in parseEntry() local
278 Key = dyn_cast<yaml::ScalarNode>(Entry.getKey()); in parseEntry()
279 if (!Key) { in parseEntry()
290 RewriteType = Key->getValue(KeyStorage); in parseEntry()
292 return parseRewriteFunctionDescriptor(YS, Key, Value, DL); in parseEntry()
294 return parseRewriteGlobalVariableDescriptor(YS, Key, Value, DL); in parseEntry()
296 return parseRewriteGlobalAliasDescriptor(YS, Key, Value, DL); in parseEntry()
312 yaml::ScalarNode *Key; in parseRewriteFunctionDescriptor() local
318 Key = dyn_cast<yaml::ScalarNode>(Field.getKey()); in parseRewriteFunctionDescriptor()
319 if (!Key) { in parseRewriteFunctionDescriptor()
[all …]
/minix3/external/bsd/llvm/dist/llvm/unittests/ADT/
H A DDenseMapTest.cpp214 for (int Key = 0; Key < 5; ++Key) in TYPED_TEST() local
215 this->Map[this->getKey(Key)] = this->getValue(Key); in TYPED_TEST()
219 for (int Key = 0; Key < 5; ++Key) in TYPED_TEST() local
220 EXPECT_EQ(this->getValue(Key), copyMap[this->getKey(Key)]); in TYPED_TEST()
232 for (int Key = 0; Key < 5; ++Key) in TYPED_TEST() local
233 this->Map[this->getKey(Key)] = this->getValue(Key); in TYPED_TEST()
/minix3/external/bsd/llvm/dist/llvm/include/llvm/Support/
H A DOnDiskHashTable.h62 typename Info::key_type Key;
67 Item(typename Info::key_type_ref Key, typename Info::data_type_ref Data, in Item() argument
69 : Key(Key), Data(Data), Next(nullptr), Hash(InfoObj.ComputeHash(Key)) {} in Item()
117 void insert(typename Info::key_type_ref Key, in insert() argument
120 insert(Key, Data, InfoObj); in insert()
126 void insert(typename Info::key_type_ref Key, in insert() argument
132 insert(Buckets, NumBuckets, new (BA.Allocate()) Item(Key, Data, InfoObj)); in insert()
166 InfoObj.EmitKeyDataLength(Out, I->Key, I->Data); in Emit()
167 InfoObj.EmitKey(Out, I->Key, Len.first); in Emit()
168 InfoObj.EmitData(Out, I->Key, I->Data, Len.second); in Emit()
[all …]
/minix3/external/bsd/llvm/dist/llvm/include/llvm/MC/
H A DSubtargetFeature.h35 const char *Key; // K-V key string member
42 return StringRef(Key) < S;
52 const char *Key; // K-V key string member
57 return StringRef(Key) < S;
/minix3/crypto/external/bsd/heimdal/dist/lib/hx509/data/
H A Dkdc.crt11 Subject Public Key Info:
12 Public Key Algorithm: rsaEncryption
13 Public-Key: (1024 bit)
28 X509v3 Key Usage:
29 Digital Signature, Non Repudiation, Key Encipherment
30 X509v3 Extended Key Usage:
32 X509v3 Subject Key Identifier:
H A Docsp-responder.crt11 Subject Public Key Info:
12 Public Key Algorithm: rsaEncryption
13 Public-Key: (1024 bit)
28 X509v3 Key Usage:
29 Digital Signature, Non Repudiation, Key Encipherment
30 X509v3 Extended Key Usage:
32 X509v3 Subject Key Identifier:
H A Dsub-ca.crt11 Subject Public Key Info:
12 Public Key Algorithm: rsaEncryption
13 Public-Key: (1024 bit)
26 X509v3 Subject Key Identifier:
28 X509v3 Authority Key Identifier:
35 X509v3 Key Usage:
36 Digital Signature, Non Repudiation, Key Encipherment, Certificate Sign, CRL Sign
/minix3/crypto/external/bsd/openssl/dist/doc/
H A Dfingerprints.txt14 Key fingerprint = C4CA B749 C34F 7F4C C04F DAC9 A7AF 9E78 F709 453B
20 Key fingerprint = D0 5D 8C 61 6E 27 E6 60 41 EC B1 B8 D5 7E E5 97
24 Key fingerprint = 6260 5AA4 334A F9F0 DDE5 D349 D357 7507 FA40 E9E2
31 Key fingerprint = 7B 79 19 FA 71 6B 87 25 0E 77 21 E5 52 D9 83 BF
37 Key fingerprint = 13 D0 B8 9D 37 30 C3 ED AC 9C 24 7D 45 8C 17 67
42 Key fingerprint = 7656 55DE 62E3 96FF 2587 EB6C 4F6D E156 2118 CF83
49 Key fingerprint = C7 AC 7E AD 56 6A 65 EC F6 16 66 83 7E 86 68 28
61 Key fingerprint = 8657 ABB2 60F0 56B1 E519 0839 D9C4 D26D 0E60 4491

12345678910>>...12