/external/openssh/ |
D | key.h | 31 typedef struct sshkey Key; typedef 63 void key_add_private(Key *); 64 Key *key_new_private(int); 65 void key_free(Key *); 66 Key *key_demote(const Key *); 67 int key_write(const Key *, FILE *); 68 int key_read(Key *, char **); 70 Key *key_generate(int, u_int); 71 Key *key_from_private(const Key *); 72 int key_to_certified(Key *, int); [all …]
|
D | key.c | 24 key_add_private(Key *k) in key_add_private() 32 Key * 35 Key *ret = NULL; in key_new_private() 43 key_read(Key *ret, char **cpp) in key_read() 49 key_write(const Key *key, FILE *f) in key_write() 54 Key * 58 Key *ret = NULL; in key_generate() 66 key_cert_copy(const Key *from_key, Key *to_key) in key_cert_copy() 74 Key * 75 key_from_private(const Key *k) in key_from_private() [all …]
|
D | auth.h | 119 int auth_rhosts_rsa(Authctxt *, char *, Key *); 122 int auth_rsa_challenge_dialog(Key *); 123 BIGNUM *auth_rsa_generate_challenge(Key *); 124 int auth_rsa_verify_response(Key *, BIGNUM *, u_char[]); 125 int auth_rsa_key_allowed(struct passwd *, BIGNUM *, Key **); 127 int auth_rhosts_rsa_key_allowed(struct passwd *, char *, char *, Key *); 128 int hostbased_key_allowed(struct passwd *, const char *, char *, Key *); 129 int user_key_allowed(struct passwd *, Key *); 130 void pubkey_auth_info(Authctxt *, const Key *, const char *, ...) 198 int auth_key_is_revoked(Key *); [all …]
|
/external/google-breakpad/src/processor/ |
D | static_map_iterator-inl.h | 44 template<typename Key, typename Value, typename Compare> 45 StaticMapIterator<Key, Value, Compare>::StaticMapIterator(const char* base, in StaticMapIterator() 52 keys_ = reinterpret_cast<const Key*>( in StaticMapIterator() 57 template<typename Key, typename Value, typename Compare> 58 StaticMapIterator<Key, Value, Compare>& 59 StaticMapIterator<Key, Value, Compare>::operator++() { 68 template<typename Key, typename Value, typename Compare> 69 StaticMapIterator<Key, Value, Compare> 70 StaticMapIterator<Key, Value, Compare>::operator++(int postfix_operator) { 75 StaticMapIterator<Key, Value, Compare> tmp = *this; [all …]
|
D | static_map-inl.h | 45 template<typename Key, typename Value, typename Compare> 46 StaticMap<Key, Value, Compare>::StaticMap(const char* raw_data) in StaticMap() 55 keys_ = reinterpret_cast<const Key*>( in StaticMap() 60 template<typename Key, typename Value, typename Compare> 61 StaticMapIterator<Key, Value, Compare> 62 StaticMap<Key, Value, Compare>::find(const Key &key) const { in find() 81 template<typename Key, typename Value, typename Compare> 82 StaticMapIterator<Key, Value, Compare> 83 StaticMap<Key, Value, Compare>::lower_bound(const Key &key) const { in lower_bound() 102 template<typename Key, typename Value, typename Compare> [all …]
|
D | static_map.h | 72 template<typename Key> 75 int operator()(const Key &k1, const Key &k2) const { in operator() 82 template<typename Key, typename Value, typename Compare = DefaultCompare<Key> > 85 typedef StaticMapIterator<Key, Value, Compare> iterator; 86 typedef StaticMapIterator<Key, Value, Compare> const_iterator; 107 iterator find(const Key &k) const; 111 iterator lower_bound(const Key &k) const; 115 iterator upper_bound(const Key &k) const; 123 const Key GetKeyAtIndex(int i) const; 137 const Key* keys_;
|
/external/protobuf/src/google/protobuf/stubs/ |
D | hash.h | 62 template <typename Key> 65 int operator()(const Key& key) { in operator() 70 inline bool operator()(const Key& a, const Key& b) const { in operator() 89 template <typename Key, typename Data, 90 typename HashFcn = hash<Key>, 92 class hash_map : public std::map<Key, Data, HashFcn> { 97 template <typename Key, 98 typename HashFcn = hash<Key>, 100 class hash_set : public std::set<Key, HashFcn> { 107 template <typename Key> [all …]
|
/external/boringssl/src/crypto/cipher/test/ |
D | cipher_test.txt | 3 Key = 0123456789abcdef0123456789abcdef 8 Key = 0123456789abcdef0123456789abcdef 13 Key = 00000000000000000000000000000000 18 Key = ef012345ef012345ef012345ef012345 23 Key = 0123456789abcdef0123456789abcdef 28 Key = ef012345ef012345ef012345ef012345 35 Key = 0123456789abcdeff1e0d3c2b5a49786fedcba9876543210 43 Key = 000102030405060708090A0B0C0D0E0F 51 Key = 000102030405060708090A0B0C0D0E0F101112131415161718191A1B1C1D1E1F 62 Key = 2B7E151628AED2A6ABF7158809CF4F3C [all …]
|
/external/boringssl/src/crypto/hmac/ |
D | hmac_tests.txt | 7 Key = 13 Key = 0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b 18 Key = "Jefe" 23 Key = AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA 31 Key = 000102030405060708090A0B0C0D0E0F101112131415161718191A1B1C1D1E1F202122232425262728292A2B2C2D2… 36 Key = 000102030405060708090A0B0C0D0E0F10111213 41 Key = 000102030405060708090A0B0C0D0E0F101112131415161718191A1B1C1D1E1F202122232425262728292A2B2C2D2… 46 Key = 000102030405060708090A0B0C0D0E0F101112131415161718191A1B1C1D1E1F202122232425262728292A2B2C2D2… 51 Key = 000102030405060708090A0B0C0D0E0F101112131415161718191A1B 56 Key = 000102030405060708090A0B0C0D0E0F101112131415161718191A1B1C1D1E1F202122232425262728292A2B2C2D2… [all …]
|
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/ |
D | Antlr.Runtime.Collections.pas | 104 function GetItem(const Key: TKey): TValue; in GetItem() 105 procedure SetItem(const Key: TKey; const Value: TValue); 108 procedure Add(const Key: TKey; const Value: TValue); 109 procedure Remove(const Key: TKey); 112 function TryGetValue(const Key: TKey; out Value: TValue): Boolean; in TryGetValue() 113 procedure AddOrSetValue(const Key: TKey; const Value: TValue); 114 function ContainsKey(const Key: TKey): Boolean; in ContainsKey() 121 property Items[const Key: TKey]: TValue read GetItem write SetItem; default; 168 procedure THashList<TKey, TValue>.Add(const Key: TKey; const Value: TValue); 170 FDictionary.Add(Key, Value); [all …]
|
D | Antlr.Runtime.Tools.pas | 189 function GetItem(const Key: TKey): TValue; 190 procedure SetItem(const Key: TKey; const Value: TValue); 194 procedure Add(const Key: TKey; const Value: TValue); 195 procedure Remove(const Key: TKey); 198 function TryGetValue(const Key: TKey; out Value: TValue): Boolean; 199 procedure AddOrSetValue(const Key: TKey; const Value: TValue); 200 function ContainsKey(const Key: TKey): Boolean; 205 property Items[const Key: TKey]: TValue read GetItem write SetItem; default; 243 Key: TKey; 256 function GetBucketIndex(const Key: TKey; HashCode: Integer): Integer; [all …]
|
/external/libcxx/test/std/containers/unord/unord.map/ |
D | compare.pass.cpp | 21 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()
|
/external/guava/guava-tests/test/com/google/common/cache/ |
D | CacheReferencesTest.java | 39 private static final CacheLoader<Key,String> KEY_TO_STRING_LOADER = 40 new CacheLoader<Key, String>() { 41 @Override public String load(Key key) { 52 private Iterable<LoadingCache<Key, String>> caches() { in caches() 55 new Function<CacheBuilder<Object, Object>, LoadingCache<Key, String>>() { in caches() 56 @Override public LoadingCache<Key, String> apply(CacheBuilder<Object, Object> builder) { in caches() 63 for (LoadingCache<Key, String> cache : caches()) { 65 Key key = new Key(1); 75 for (LoadingCache<Key, String> cache : caches()) { 76 Key key = new Key(1); [all …]
|
/external/smali/dexlib2/src/main/java/org/jf/dexlib2/writer/builder/ |
D | BuilderMapEntryCollection.java | 40 public abstract class BuilderMapEntryCollection<Key> extends AbstractCollection<Map.Entry<Key, Inte… 41 @Nonnull private final Collection<Key> keys; 43 public BuilderMapEntryCollection(@Nonnull Collection<Key> keys) { in BuilderMapEntryCollection() 47 private class MapEntry implements Map.Entry<Key, Integer> { 48 @Nonnull private Key key; 50 @Nonnull @Override public Key getKey() { in getKey() 63 @Nonnull @Override public Iterator<Map.Entry<Key, Integer>> iterator() { in iterator() 64 final Iterator<Key> iter = keys.iterator(); in iterator() 66 return new Iterator<Map.Entry<Key, Integer>>() { in iterator() 71 @Override public Map.Entry<Key, Integer> next() { in iterator() [all …]
|
/external/smali/dexlib2/src/main/java/org/jf/dexlib2/writer/pool/ |
D | ProtoPool.java | 37 import org.jf.dexlib2.writer.pool.ProtoPool.Key; 47 public class ProtoPool extends BaseIndexPool<Key> 48 …implements ProtoSection<CharSequence, CharSequence, Key, TypeListPool.Key<? extends Collection<? e… 63 Key key = new Key(method); in intern() 72 @Nonnull @Override public CharSequence getShorty(@Nonnull Key key) { in getShorty() 76 @Nonnull @Override public CharSequence getReturnType(@Nonnull Key key) { in getReturnType() 80 …@Nullable @Override public TypeListPool.Key<List<? extends CharSequence>> getParameters(@Nonnull K… in getParameters() 81 return new TypeListPool.Key<List<? extends CharSequence>>(key.getParameters()); in getParameters() 84 public static class Key implements Comparable<Key> { class in ProtoPool 87 public Key(@Nonnull MethodReference method) { in Key() method in ProtoPool.Key [all …]
|
D | TypeListPool.java | 37 import org.jf.dexlib2.writer.pool.TypeListPool.Key; 44 public class TypeListPool extends BaseNullableOffsetPool<Key<? extends Collection<? extends CharSeq… 45 … implements TypeListSection<CharSequence, Key<? extends Collection<? extends CharSequence>>> { 54 …Key<? extends Collection<? extends CharSequence>> key = new Key<Collection<? extends CharSequence>… in intern() 65 …public Collection<? extends CharSequence> getTypes(Key<? extends Collection<? extends CharSequence… in getTypes() 72 …@Override public int getNullableItemOffset(@Nullable Key<? extends Collection<? extends CharSequen… in getNullableItemOffset() 80 public static class Key<TypeCollection extends Collection<? extends CharSequence>> class in TypeListPool 81 implements Comparable<Key<? extends Collection<? extends CharSequence>>> { 84 public Key(@Nonnull TypeCollection types) { in Key() method in TypeListPool.Key 99 if (o instanceof Key) { in equals() [all …]
|
/external/libcxx/test/std/containers/associative/map/ |
D | compare.pass.cpp | 21 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()
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/locale/ |
D | BaseLocale.java | 58 Key key = new Key(language, script, region, variant); in getInstance() 145 private static class Key implements Comparable<Key> { class in BaseLocale 153 public Key(String language, String script, String region, String variant) { in Key() method in BaseLocale.Key 171 (obj instanceof Key) in equals() 172 && AsciiUtil.caseIgnoreMatch(((Key)obj)._lang, this._lang) in equals() 173 && AsciiUtil.caseIgnoreMatch(((Key)obj)._scrt, this._scrt) in equals() 174 && AsciiUtil.caseIgnoreMatch(((Key)obj)._regn, this._regn) in equals() 175 && ((Key)obj)._vart.equals(_vart); // variant is case sensitive in JDK! in equals() 178 (obj instanceof Key) in equals() 179 && AsciiUtil.caseIgnoreMatch(((Key)obj)._lang, this._lang) in equals() [all …]
|
/external/v8/src/ |
D | splay-tree.h | 33 typedef typename Config::Key Key; typedef 57 bool Contains(const Key& key); 62 bool Insert(const Key& key, Locator* locator); 67 bool Find(const Key& key, Locator* locator); 71 bool FindGreatestLessThan(const Key& key, Locator* locator); 78 bool FindLeastGreaterThan(const Key& key, Locator* locator); 84 bool Move(const Key& old_key, const Key& new_key); 87 bool Remove(const Key& key); 98 void Splay(const Key& key); 102 Node(const Key& key, const Value& value) in Node() [all …]
|
/external/bison/src/ |
D | muscle-tab.h | 38 #define MUSCLE_INSERT_BOOL(Key, Value) \ argument 41 MUSCLE_INSERT_INT (Key, v); \ 44 #define MUSCLE_INSERT_INT(Key, Value) \ argument 48 muscle_insert (Key, obstack_finish (&muscle_obstack)); \ 51 #define MUSCLE_INSERT_LONG_INT(Key, Value) \ argument 55 muscle_insert (Key, obstack_finish (&muscle_obstack)); \ 58 #define MUSCLE_INSERT_STRING_RAW(Key, Value) \ argument 62 muscle_insert (Key, obstack_finish (&muscle_obstack)); \ 65 #define MUSCLE_INSERT_STRING(Key, Value) \ argument 69 muscle_insert (Key, obstack_finish (&muscle_obstack)); \ [all …]
|
/external/glide/library/src/main/java/com/bumptech/glide/load/engine/bitmap_recycle/ |
D | AttributeStrategy.java | 12 private final GroupedLinkedMap<Key, Bitmap> groupedMap = new GroupedLinkedMap<Key, Bitmap>(); 15 final Key key = keyPool.get(bitmap.getWidth(), bitmap.getHeight(), bitmap.getConfig()); in put() 22 final Key key = keyPool.get(width, height, config); in get() 61 static class KeyPool extends BaseKeyPool<Key> { 62 public Key get(int width, int height, Bitmap.Config config) { in get() 63 Key result = get(); in get() 69 protected Key create() { in create() 70 return new Key(this); in create() 75 static class Key implements Poolable { class in AttributeStrategy 82 public Key(KeyPool pool) { in Key() method in AttributeStrategy.Key [all …]
|
D | SizeStrategy.java | 19 private final GroupedLinkedMap<Key, Bitmap> groupedMap = new GroupedLinkedMap<Key, Bitmap>(); 25 final Key key = keyPool.get(size); in put() 36 Key key = keyPool.get(size); in get() 124 static class KeyPool extends BaseKeyPool<Key> { 126 public Key get(int size) { in get() 127 Key result = get(); in get() 133 protected Key create() { in create() 134 return new Key(this); in create() 139 static final class Key implements Poolable { class in SizeStrategy 143 Key(KeyPool pool) { in Key() method in SizeStrategy.Key [all …]
|
/external/lzma/CS/7zip/Compress/LzmaAlone/ |
D | LzmaAlone.cs | 62 enum Key enum in SevenZip.LzmaAlone 156 if (parser[(int)Key.Help1].ThereIs || parser[(int)Key.Help2].ThereIs) in Main2() 172 if (parser[(int)Key.Dictionary].ThereIs) in Main2() 175 if (!GetNumber((string)parser[(int)Key.Dictionary].PostStrings[0], out dicLog)) in Main2() 181 if (parser[(int)Key.MatchFinder].ThereIs) in Main2() 182 mf = (string)parser[(int)Key.MatchFinder].PostStrings[0]; in Main2() 196 if (parser[(int)Key.Train].ThereIs) in Main2() 197 train = (string)parser[(int)Key.Train].PostStrings[0]; in Main2() 207 bool stdInMode = parser[(int)Key.StdIn].ThereIs; in Main2() 208 bool stdOutMode = parser[(int)Key.StdOut].ThereIs; in Main2() [all …]
|
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime.Tests/ |
D | Antlr.Runtime.Tools.Tests.pas | 445 Key: String; 447 Key := 'Baz'; 448 ReturnValue := FIDictionary.GetItem(Key); 455 Key: String; 457 Key := 'Bar'; 459 FIDictionary.SetItem(Key, Value); 474 Key: String; 476 Key := 'Key'; 478 FIDictionary.Add(Key, Value); 484 Key: String; [all …]
|
/external/llvm/include/llvm/ADT/ |
D | StringMap.h | 74 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 …]
|