Home
last modified time | relevance | path

Searched defs:Key (Results 1 – 25 of 3019) sorted by relevance

12345678910>>...121

/aosp_15_r20/external/cronet/third_party/rust/chromium_crates_io/vendor/log-0.4.21/src/kv/
H A Dkey.rs9 fn to_key(&self) -> Key; in to_key()
16 fn to_key(&self) -> Key { in to_key()
21 impl<'k> ToKey for Key<'k> { implementation
22 fn to_key(&self) -> Key { in to_key()
28 fn to_key(&self) -> Key { in to_key()
37 pub struct Key<'k> { struct
41 impl<'k> Key<'k> { argument
53 impl<'k> fmt::Display for Key<'k> { implementation
59 impl<'k> AsRef<str> for Key<'k> { implementation
65 impl<'k> Borrow<str> for Key<'k> { implementation
[all …]
/aosp_15_r20/external/rust/android-crates-io/crates/log/src/kv/
Dkey.rs9 fn to_key(&self) -> Key; in to_key()
16 fn to_key(&self) -> Key { in to_key()
21 impl<'k> ToKey for Key<'k> { implementation
22 fn to_key(&self) -> Key { in to_key()
28 fn to_key(&self) -> Key { in to_key()
37 pub struct Key<'k> { struct
41 impl<'k> Key<'k> { implementation
53 impl<'k> fmt::Display for Key<'k> { implementation
59 impl<'k> AsRef<str> for Key<'k> { implementation
65 impl<'k> Borrow<str> for Key<'k> { implementation
[all …]
/aosp_15_r20/external/rust/android-crates-io/crates/toml_edit/src/
Dkey.rs30 pub struct Key { struct
37 impl Key { implementation
169 fn try_parse_simple(s: &str) -> Result<Key, crate::TomlError> { in try_parse_simple()
176 fn try_parse_path(s: &str) -> Result<Vec<Key>, crate::TomlError> { in try_parse_path()
185 impl Clone for Key { implementation
197 impl std::ops::Deref for Key { implementation
205 impl std::hash::Hash for Key { implementation
211 impl Ord for Key { implementation
217 impl PartialOrd for Key { implementation
223 impl Eq for Key {} implementation
[all …]
/aosp_15_r20/external/skia/src/text/gpu/
H A DTextBlob.h58 struct Key { struct
81 bool operator==(const Key& other) const; argument
/aosp_15_r20/external/skia/src/core/
H A DSkResourceCache.h33 struct Key { struct
53 bool operator==(const Key& other) const { argument
77 typedef SkResourceCache::Key Key; argument
/aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r530567b/include/clang/Basic/
DTypeTraits.h22 #define TYPE_TRAIT_1(Spelling, Name, Key) UTT_##Name, argument
25 #define TYPE_TRAIT_1(Spelling, Name, Key) +1 argument
28 #define TYPE_TRAIT_2(Spelling, Name, Key) BTT_##Name, argument
31 #define TYPE_TRAIT_2(Spelling, Name, Key) +1 argument
34 #define TYPE_TRAIT_N(Spelling, Name, Key) TT_##Name, argument
37 #define TYPE_TRAIT_N(Spelling, Name, Key) +1 argument
43 #define ARRAY_TYPE_TRAIT(Spelling, Name, Key) ATT_##Name, argument
46 #define ARRAY_TYPE_TRAIT(Spelling, Name, Key) +1 argument
52 #define UNARY_EXPR_OR_TYPE_TRAIT(Spelling, Name, Key) UETT_##Name, argument
53 #define CXX11_UNARY_EXPR_OR_TYPE_TRAIT(Spelling, Name, Key) UETT_##Name, argument
[all …]
/aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r536225/include/clang/Basic/
DTypeTraits.h22 #define TYPE_TRAIT_1(Spelling, Name, Key) UTT_##Name, argument
25 #define TYPE_TRAIT_1(Spelling, Name, Key) +1 argument
28 #define TYPE_TRAIT_2(Spelling, Name, Key) BTT_##Name, argument
31 #define TYPE_TRAIT_2(Spelling, Name, Key) +1 argument
34 #define TYPE_TRAIT_N(Spelling, Name, Key) TT_##Name, argument
37 #define TYPE_TRAIT_N(Spelling, Name, Key) +1 argument
43 #define ARRAY_TYPE_TRAIT(Spelling, Name, Key) ATT_##Name, argument
46 #define ARRAY_TYPE_TRAIT(Spelling, Name, Key) +1 argument
52 #define UNARY_EXPR_OR_TYPE_TRAIT(Spelling, Name, Key) UETT_##Name, argument
53 #define CXX11_UNARY_EXPR_OR_TYPE_TRAIT(Spelling, Name, Key) UETT_##Name, argument
[all …]
/aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r522817/include/clang/Basic/
DTypeTraits.h22 #define TYPE_TRAIT_1(Spelling, Name, Key) UTT_##Name, argument
25 #define TYPE_TRAIT_1(Spelling, Name, Key) +1 argument
28 #define TYPE_TRAIT_2(Spelling, Name, Key) BTT_##Name, argument
31 #define TYPE_TRAIT_2(Spelling, Name, Key) +1 argument
34 #define TYPE_TRAIT_N(Spelling, Name, Key) TT_##Name, argument
37 #define TYPE_TRAIT_N(Spelling, Name, Key) +1 argument
43 #define ARRAY_TYPE_TRAIT(Spelling, Name, Key) ATT_##Name, argument
46 #define ARRAY_TYPE_TRAIT(Spelling, Name, Key) +1 argument
52 #define UNARY_EXPR_OR_TYPE_TRAIT(Spelling, Name, Key) UETT_##Name, argument
53 #define CXX11_UNARY_EXPR_OR_TYPE_TRAIT(Spelling, Name, Key) UETT_##Name, argument
[all …]
/aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r530567/include/clang/Basic/
DTypeTraits.h22 #define TYPE_TRAIT_1(Spelling, Name, Key) UTT_##Name, argument
25 #define TYPE_TRAIT_1(Spelling, Name, Key) +1 argument
28 #define TYPE_TRAIT_2(Spelling, Name, Key) BTT_##Name, argument
31 #define TYPE_TRAIT_2(Spelling, Name, Key) +1 argument
34 #define TYPE_TRAIT_N(Spelling, Name, Key) TT_##Name, argument
37 #define TYPE_TRAIT_N(Spelling, Name, Key) +1 argument
43 #define ARRAY_TYPE_TRAIT(Spelling, Name, Key) ATT_##Name, argument
46 #define ARRAY_TYPE_TRAIT(Spelling, Name, Key) +1 argument
52 #define UNARY_EXPR_OR_TYPE_TRAIT(Spelling, Name, Key) UETT_##Name, argument
53 #define CXX11_UNARY_EXPR_OR_TYPE_TRAIT(Spelling, Name, Key) UETT_##Name, argument
[all …]
/aosp_15_r20/external/rust/android-crates-io/crates/h2/src/proto/streams/
Dstream.rs376 fn next(stream: &Stream) -> Option<store::Key> { in next()
380 fn set_next(stream: &mut Stream, key: Option<store::Key>) { in set_next()
384 fn take_next(stream: &mut Stream) -> Option<store::Key> { in take_next()
398 fn next(stream: &Stream) -> Option<store::Key> { in next()
402 fn set_next(stream: &mut Stream, key: Option<store::Key>) { in set_next()
406 fn take_next(stream: &mut Stream) -> Option<store::Key> { in take_next()
425 fn next(stream: &Stream) -> Option<store::Key> { in next()
429 fn set_next(stream: &mut Stream, key: Option<store::Key>) { in set_next()
433 fn take_next(stream: &mut Stream) -> Option<store::Key> { in take_next()
447 fn next(stream: &Stream) -> Option<store::Key> { in next()
[all …]
/aosp_15_r20/external/skia/src/pdf/
H A DSkPDFGradientShader.h33 struct Key { struct
45 uint32_t operator()(const Key& k) const { return k.fHash; } in operator() argument
/aosp_15_r20/frameworks/minikin/include/minikin/
H A DLayoutPieces.h31 struct Key { struct
32 Key(const Range& range, HyphenEdit hyphenEdit, bool dir, uint32_t paintId) in Key() function
39 Range range;
40 HyphenEdit hyphenEdit;
41 bool dir;
42 uint32_t paintId;
43 uint32_t hash;
45 uint32_t calcHash() const { in calcHash()
60 uint32_t getMemoryUsage() const { in getMemoryUsage()
/aosp_15_r20/frameworks/native/include/input/
H A DInputTransport.h93 struct Key { struct
94 int32_t eventId;
95 uint32_t empty1;
96 nsecs_t eventTime __attribute__((aligned(8)));
97 int32_t deviceId;
98 int32_t source;
99 int32_t displayId;
100 std::array<uint8_t, 32> hmac;
101 int32_t action;
102 int32_t flags;
[all …]
/aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r530567/include/llvm/ADT/
DStringMap.h64 unsigned LookupBucketFor(StringRef Key) { in LookupBucketFor()
74 int FindKey(StringRef Key) const { return FindKey(Key, hash(Key)); } in FindKey()
234 iterator find(StringRef Key) { return find(Key, hash(Key)); } in find()
236 iterator find(StringRef Key, uint32_t FullHashValue) { in find()
243 const_iterator find(StringRef Key) const { return find(Key, hash(Key)); } in find()
245 const_iterator find(StringRef Key, uint32_t FullHashValue) const { in find()
254 ValueTy lookup(StringRef Key) const { in lookup()
274 bool contains(StringRef Key) const { return find(Key) != end(); } in contains()
277 size_type count(StringRef Key) const { return contains(Key) ? 1 : 0; } in count()
355 std::pair<iterator, bool> insert_or_assign(StringRef Key, V &&Val) { in insert_or_assign()
[all …]
DMapVector.h110 ValueT lookup(const KeyT &Key) const { in lookup()
118 std::pair<iterator, bool> try_emplace(const KeyT &Key, Ts &&...Args) { in try_emplace()
129 std::pair<iterator, bool> try_emplace(KeyT &&Key, Ts &&...Args) { in try_emplace()
149 std::pair<iterator, bool> insert_or_assign(const KeyT &Key, V &&Val) { in insert_or_assign()
156 std::pair<iterator, bool> insert_or_assign(KeyT &&Key, V &&Val) { in insert_or_assign()
163 bool contains(const KeyT &Key) const { return Map.find(Key) != Map.end(); } in contains()
165 size_type count(const KeyT &Key) const { return contains(Key) ? 1 : 0; } in count()
167 iterator find(const KeyT &Key) { in find()
173 const_iterator find(const KeyT &Key) const { in find()
212 size_type erase(const KeyT &Key) { in erase()
/aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r536225/include/llvm/ADT/
DStringMap.h63 unsigned LookupBucketFor(StringRef Key) { in LookupBucketFor()
73 int FindKey(StringRef Key) const { return FindKey(Key, hash(Key)); } in FindKey()
233 iterator find(StringRef Key) { return find(Key, hash(Key)); } in find()
235 iterator find(StringRef Key, uint32_t FullHashValue) { in find()
242 const_iterator find(StringRef Key) const { return find(Key, hash(Key)); } in find()
244 const_iterator find(StringRef Key, uint32_t FullHashValue) const { in find()
253 ValueTy lookup(StringRef Key) const { in lookup()
273 bool contains(StringRef Key) const { return find(Key) != end(); } in contains()
276 size_type count(StringRef Key) const { return contains(Key) ? 1 : 0; } in count()
356 std::pair<iterator, bool> insert_or_assign(StringRef Key, V &&Val) { in insert_or_assign()
[all …]
DMapVector.h110 ValueT lookup(const KeyT &Key) const { in lookup()
118 std::pair<iterator, bool> try_emplace(const KeyT &Key, Ts &&...Args) { in try_emplace()
129 std::pair<iterator, bool> try_emplace(KeyT &&Key, Ts &&...Args) { in try_emplace()
149 std::pair<iterator, bool> insert_or_assign(const KeyT &Key, V &&Val) { in insert_or_assign()
156 std::pair<iterator, bool> insert_or_assign(KeyT &&Key, V &&Val) { in insert_or_assign()
163 bool contains(const KeyT &Key) const { return Map.find(Key) != Map.end(); } in contains()
165 size_type count(const KeyT &Key) const { return contains(Key) ? 1 : 0; } in count()
167 iterator find(const KeyT &Key) { in find()
173 const_iterator find(const KeyT &Key) const { in find()
212 size_type erase(const KeyT &Key) { in erase()
/aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r530567b/include/llvm/ADT/
DStringMap.h64 unsigned LookupBucketFor(StringRef Key) { in LookupBucketFor()
74 int FindKey(StringRef Key) const { return FindKey(Key, hash(Key)); } in FindKey()
234 iterator find(StringRef Key) { return find(Key, hash(Key)); } in find()
236 iterator find(StringRef Key, uint32_t FullHashValue) { in find()
243 const_iterator find(StringRef Key) const { return find(Key, hash(Key)); } in find()
245 const_iterator find(StringRef Key, uint32_t FullHashValue) const { in find()
254 ValueTy lookup(StringRef Key) const { in lookup()
274 bool contains(StringRef Key) const { return find(Key) != end(); } in contains()
277 size_type count(StringRef Key) const { return contains(Key) ? 1 : 0; } in count()
355 std::pair<iterator, bool> insert_or_assign(StringRef Key, V &&Val) { in insert_or_assign()
[all …]
DMapVector.h110 ValueT lookup(const KeyT &Key) const { in lookup()
118 std::pair<iterator, bool> try_emplace(const KeyT &Key, Ts &&...Args) { in try_emplace()
129 std::pair<iterator, bool> try_emplace(KeyT &&Key, Ts &&...Args) { in try_emplace()
149 std::pair<iterator, bool> insert_or_assign(const KeyT &Key, V &&Val) { in insert_or_assign()
156 std::pair<iterator, bool> insert_or_assign(KeyT &&Key, V &&Val) { in insert_or_assign()
163 bool contains(const KeyT &Key) const { return Map.find(Key) != Map.end(); } in contains()
165 size_type count(const KeyT &Key) const { return contains(Key) ? 1 : 0; } in count()
167 iterator find(const KeyT &Key) { in find()
173 const_iterator find(const KeyT &Key) const { in find()
212 size_type erase(const KeyT &Key) { in erase()
/aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r522817/include/llvm/ADT/
DMapVector.h110 ValueT lookup(const KeyT &Key) const { in lookup()
118 std::pair<iterator, bool> try_emplace(const KeyT &Key, Ts &&...Args) { in try_emplace()
129 std::pair<iterator, bool> try_emplace(KeyT &&Key, Ts &&...Args) { in try_emplace()
149 std::pair<iterator, bool> insert_or_assign(const KeyT &Key, V &&Val) { in insert_or_assign()
156 std::pair<iterator, bool> insert_or_assign(KeyT &&Key, V &&Val) { in insert_or_assign()
163 bool contains(const KeyT &Key) const { return Map.find(Key) != Map.end(); } in contains()
165 size_type count(const KeyT &Key) const { return contains(Key) ? 1 : 0; } in count()
167 iterator find(const KeyT &Key) { in find()
173 const_iterator find(const KeyT &Key) const { in find()
212 size_type erase(const KeyT &Key) { in erase()
/aosp_15_r20/external/rust/beto-rust/nearby/crypto/crypto_provider_test/src/aes/
Dmod.rs26 pub fn aes_128_test_encrypt<A: AesEncryptCipher<Key = Aes128Key>>(_marker: marker::PhantomData<A>) { in aes_128_test_encrypt()
50 pub fn aes_128_test_decrypt<A: AesDecryptCipher<Key = Aes128Key>>(_marker: marker::PhantomData<A>) { in aes_128_test_decrypt()
74 pub fn aes_256_test_encrypt<A: AesEncryptCipher<Key = Aes256Key>>(_marker: marker::PhantomData<A>) { in aes_256_test_encrypt()
99 pub fn aes_256_test_decrypt<A: AesDecryptCipher<Key = Aes256Key>>(_marker: marker::PhantomData<A>) { in aes_256_test_decrypt()
140 fn aes_128_encrypt_test_cases<A: AesFactory<Key = Aes128Key>>( in aes_128_encrypt_test_cases()
162 fn aes_128_decrypt_test_cases<F: AesFactory<Key = Aes128Key>>( in aes_128_decrypt_test_cases()
184 fn aes_256_encrypt_test_cases<F: AesFactory<Key = Aes256Key>>( in aes_256_encrypt_test_cases()
206 fn aes_256_decrypt_test_cases<F: AesFactory<Key = Aes256Key>>( in aes_256_decrypt_test_cases()
/aosp_15_r20/external/rust/android-crates-io/crates/ring/src/aead/
Dchacha.rs33 pub struct Key { struct
38 impl Key { argument
52 impl Key { impl
106 key: &Key, in encrypt_less_safe()
260 f: impl for<'k, 'i> Fn(&'k Key, Counter, &'i mut [u8], RangeFrom<usize>), in chacha20_test()
298 key: &Key, in chacha20_test_case_inner()
305 f: &impl for<'k, 'i> Fn(&'k Key, Counter, &'i mut [u8], RangeFrom<usize>), in chacha20_test_case_inner()
/aosp_15_r20/prebuilts/go/linux-x86/src/internal/syscall/windows/registry/
Dregistry_test.go161 func setValues(t *testing.T, k registry.Key) {
192 func enumerateValues(t *testing.T, k registry.Key) {
246 func testGetStringValue(t *testing.T, k registry.Key, test ValueTest) {
269 func testGetIntegerValue(t *testing.T, k registry.Key, test ValueTest) {
285 func testGetBinaryValue(t *testing.T, k registry.Key, test ValueTest) {
301 func testGetStringsValue(t *testing.T, k registry.Key, test ValueTest) {
317 func testGetValue(t *testing.T, k registry.Key, test ValueTest, size int) {
379 func testValues(t *testing.T, k registry.Key) {
440 func testStat(t *testing.T, k registry.Key) {
472 func deleteValues(t *testing.T, k registry.Key) {
/aosp_15_r20/external/rust/android-crates-io/crates/tokio-util/src/time/
Ddelay_queue.rs186 pub(crate) fn insert(&mut self, val: Data<T>) -> Key { in insert()
391 pub struct Key { struct
395 // Whereas `Key` is given out to users that use `DelayQueue`, internally we use argument
533 pub fn insert_at(&mut self, value: T, when: Instant) -> Key { in insert_at()
652 pub fn insert(&mut self, value: T, timeout: Duration) -> Key { in insert()
657 fn insert_idx(&mut self, when: u64, key: Key) { in insert_idx()
712 fn remove_key(&mut self, key: &Key) { in remove_key()
852 pub fn reset_at(&mut self, key: &Key, when: Instant) { in reset_at()
943 pub fn peek(&self) -> Option<Key> { in peek()
994 pub fn reset(&mut self, key: &Key, timeout: Duration) { in reset()
[all …]
/aosp_15_r20/external/cronet/third_party/boringssl/src/rust/bssl-crypto/src/cipher/
H A Dmod.rs36 type Key: AsRef<[u8]>; typedef
43 fn new(key: &Self::Key, iv: &Self::Nonce) -> Self; in new()
53 type Key: AsRef<[u8]>; typedef
60 fn new_encrypt(key: &Self::Key, iv: &Self::Nonce) -> Self; in new_encrypt()
63 fn new_decrypt(key: &Self::Key, iv: &Self::Nonce) -> Self; in new_decrypt()
78 type Key: AsRef<[u8]>; typedef
85 type Key = [u8; 16]; typedef
96 type Key = [u8; 32]; typedef
107 type Key = [u8; 16]; typedef
118 type Key = [u8; 32]; typedef
[all …]

12345678910>>...121