| /libcore/luni/src/main/java/java/security/ |
| Key.java | 23 * {@code Key} is the common interface for all keys.
28 public interface Key extends Serializable {
36 * Returns the name of the algorithm of this key. If the algorithm is
39 * @return the name of the algorithm of this key or {@code null} if the
45 * Returns the name of the format used to encode this key, or {@code null}
48 * @return the name of the format used to encode this key, or {@code null}
54 * Returns the encoded form of this key, or {@code null} if encoding is not
55 * supported by this key.
57 * @return the encoded form of this key, or {@code null} if encoding is not
58 * supported by this key
[all...] |
| /external/chromium/base/ |
| global_descriptors_posix.h | 33 // It maps from an abstract key to a descriptor. If independent modules each
38 typedef uint32_t Key;
39 // Often we want a canonical descriptor for a given Key. In this case, we add
40 // the following constant to the key value:
43 // Get a descriptor given a key. It is a fatal error if the key is not known.
44 int Get(Key key) const;
45 // Get a descriptor give a key. Returns -1 on error.
46 int MaybeGet(Key key) const
[all...] |
| /frameworks/base/libs/ui/ |
| KeyLayoutMap.h | 20 struct Key {
26 KeyedVector<int32_t,Key> m_keys;
|
| /frameworks/base/include/ui/ |
| KeyCharacterMap.h | 54 struct Key
64 Key* find_key(int keycode);
65 bool find_char(uint16_t c, uint32_t* key, uint32_t* mods);
69 Key* m_keys;
|
| /external/chromium/net/base/ |
| host_cache_unittest.cc | 21 // Builds a key for |hostname|, defaulting the address family to unspecified.
22 HostCache::Key Key(const std::string& hostname) {
23 return HostCache::Key(hostname, ADDRESS_FAMILY_UNSPECIFIED);
40 EXPECT_TRUE(cache.Lookup(Key("foobar.com"), base::TimeTicks()) == NULL);
41 cache.Set(Key("foobar.com"), OK, AddressList(), now);
42 entry1 = cache.Lookup(Key("foobar.com"), base::TimeTicks());
50 EXPECT_TRUE(cache.Lookup(Key("foobar2.com"), base::TimeTicks()) == NULL);
51 cache.Set(Key("foobar2.com"), OK, AddressList(), now);
52 entry2 = cache.Lookup(Key("foobar2.com"), base::TimeTicks())
[all...] |
| host_cache.h | 39 struct Key {
40 Key(const std::string& hostname, AddressFamily address_family)
43 bool operator==(const Key& other) const {
48 bool operator<(const Key& other) const {
58 typedef std::map<Key, scoped_refptr<Entry> > EntryMap;
69 // Returns a pointer to the entry for |key|, which is valid at time
71 const Entry* Lookup(const Key& key, base::TimeTicks now) const;
73 // Overwrites or creates an entry for |key|. Returns the pointer to the
77 Entry* Set(const Key& key
[all...] |
| host_resolver_impl.h | 135 typedef HostCache::Key Key;
136 typedef std::map<Key, scoped_refptr<Job> > JobMap;
153 // Returns the outstanding job for |key|, or NULL if there is none.
154 Job* FindOutstandingJob(const Key& key);
|
| /external/dropbear/libtomcrypt/ |
| crypt.tex | 121 public key cryptography (via PKCS \#1 RSA, DH or ECCDH), and a plethora of support routines.
172 that for the PRNG needs within the library (\textit{e.g. making a RSA key}). All the developer has to do
183 the key setup, ECB decrypt and encrypt and test vector routines. After that all five chaining mode routines
254 related issue is if you use the same symmetric cipher, hash or public key state data in multiple threads. Normally
326 rsa_key key;
331 /* ... Make up the RSA key somehow ... */
333 /* lets export the key, set x to the size of the
336 if ((err = rsa_export(buffer, &x, PK_PUBLIC, &key)) != CRYPT_OK) {
343 printf("RSA exported key takes %d bytes\n", x);
351 In the above example if the size of the RSA public key was more than 1024 bytes this function would return an error cod
[all...] |
| /external/stlport/test/unit/ |
| find_test.cpp | 51 struct Key
90 Key keys[10] = { {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0} };
91 Key const* k = find(keys + 0, keys + 10, 5);
|
| map_test.cpp | 303 struct Key
305 Key() : m_data(0) {}
306 explicit Key(int data) : m_data(data) {}
313 bool operator () (Key lhs, Key rhs) const
316 bool operator () (Key lhs, int rhs) const
319 bool operator () (int lhs, Key rhs) const
325 bool operator () (Key const volatile *lhs, Key const volatile *rhs) const
328 bool operator () (Key const volatile *lhs, int rhs) cons
[all...] |
| set_test.cpp | 360 struct Key
362 Key() : m_data(0) {}
363 explicit Key(int data) : m_data(data) {}
370 bool operator () (Key lhs, Key rhs) const
373 bool operator () (Key lhs, int rhs) const
376 bool operator () (int lhs, Key rhs) const
382 bool operator () (Key const volatile *lhs, Key const volatile *rhs) const
385 bool operator () (Key const volatile *lhs, int rhs) cons
[all...] |
| unordered_test.cpp | 514 struct Key
516 Key() : m_data(0) {}
517 explicit Key(int data) : m_data(data) {}
522 bool operator==(const Key&) const;
528 size_t operator () (Key key) const
529 { return (size_t)key.m_data; }
537 bool operator () (Key lhs, Key rhs) const
540 bool operator () (Key lhs, int rhs) cons
[all...] |
| /external/v8/src/ |
| scopeinfo.h | 199 struct Key {
229 static Key keys_[kLength];
|
| heap-profiler.h | 115 typedef JSObjectsCluster Key;
117 static const Key kNoKey;
119 static int Compare(const Key& a, const Key& b) {
120 return Key::Compare(a, b);
155 typedef JSObjectsCluster Key;
157 static const Key kNoKey;
159 static int Compare(const Key& a, const Key& b) {
160 return Key::Compare(a, b)
[all...] |
| zone.h | 210 // typedef Key: the key type
212 // static const kNoKey: the dummy key used when no key is set
214 // int (Compare)(Key& a, Key& b) -> {-1, 0, 1}: comparison function
219 typedef typename Config::Key Key;
226 // Inserts the given key in this tree with the given value. Returns
228 // is enabled and provides access to the mapping for the key
268 Key key() { return key_; } function in class:v8::internal::ZoneSplayTree::Node
287 const Key& key() { return node_->key_; } function in class:v8::internal::ZoneSplayTree::Locator
[all...] |
| heap.h | 1367 Key& key = keys_[index]; local
1377 Key& key = keys_[index]; local
[all...] |
| /external/webkit/JavaScriptCore/runtime/ |
| StructureTransitionTable.h | 42 typedef std::pair<RefPtr<UString::Rep>, unsigned> Key;
43 static unsigned hash(const Key& p)
48 static bool equal(const Key& a, const Key& b)
72 typedef HashMap<StructureTransitionTableHash::Key, Transition, StructureTransitionTableHash, StructureTransitionTableHashTraits> TransitionTable;
85 // for the given key they will consider that transition to be a match. If a specialised transition
87 inline bool contains(const StructureTransitionTableHash::Key&, JSCell* specificValue);
88 inline Structure* get(const StructureTransitionTableHash::Key&, JSCell* specificValue) const;
89 inline bool hasTransition(const StructureTransitionTableHash::Key& key) const
[all...] |
| /ndk/sources/android/stlport/test/unit/ |
| find_test.cpp | 51 struct Key
90 Key keys[10] = { {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0} };
91 Key const* k = find(keys + 0, keys + 10, 5);
|
| map_test.cpp | 303 struct Key
305 Key() : m_data(0) {}
306 explicit Key(int data) : m_data(data) {}
313 bool operator () (Key lhs, Key rhs) const
316 bool operator () (Key lhs, int rhs) const
319 bool operator () (int lhs, Key rhs) const
325 bool operator () (Key const volatile *lhs, Key const volatile *rhs) const
328 bool operator () (Key const volatile *lhs, int rhs) cons
[all...] |
| set_test.cpp | 360 struct Key
362 Key() : m_data(0) {}
363 explicit Key(int data) : m_data(data) {}
370 bool operator () (Key lhs, Key rhs) const
373 bool operator () (Key lhs, int rhs) const
376 bool operator () (int lhs, Key rhs) const
382 bool operator () (Key const volatile *lhs, Key const volatile *rhs) const
385 bool operator () (Key const volatile *lhs, int rhs) cons
[all...] |
| unordered_test.cpp | 514 struct Key
516 Key() : m_data(0) {}
517 explicit Key(int data) : m_data(data) {}
522 bool operator==(const Key&) const;
528 size_t operator () (Key key) const
529 { return (size_t)key.m_data; }
537 bool operator () (Key lhs, Key rhs) const
540 bool operator () (Key lhs, int rhs) cons
[all...] |
| /external/skia/src/gl/ |
| SkTextureCache.h | 29 class Key {
31 Key(const SkBitmap& bm) {
40 friend bool operator==(const Key& a, const Key& b) {
47 friend bool operator<(const Key& a, const Key& b) {
90 const Key& getKey() const { return fKey; }
112 Key fKey;
153 /* If we find the key, return the entry and ignore index. If we don't,
156 Entry* find(const Key&, int* index) const
[all...] |
| /frameworks/base/services/java/com/android/server/am/ |
| PendingIntentRecord.java | 34 final Key key; field in class:PendingIntentRecord
42 final static class Key {
55 Key(int _t, String _p, ActivityRecord _a, String _w,
93 Key other = (Key)otherObj;
147 return "Key{" + typeName() + " pkg=" + packageName
168 PendingIntentRecord(ActivityManagerService _owner, Key _k, int _u) {
170 key = _k;
188 if ((key.flags&PendingIntent.FLAG_ONE_SHOT) != 0)
[all...] |
| /external/v8/test/cctest/ |
| test-regexp.cc | 503 typedef int Key;
545 CHECK_EQ(next, loc.key());
555 CHECK_EQ(next, loc.key());
564 CHECK_EQ(loc.key(), val);
571 CHECK_EQ(loc.key(), val);
[all...] |
| /frameworks/base/core/java/android/inputmethodservice/ |
| Keyboard.java | 49 * <Key android:keyLabel="A" />
67 private static final String TAG_KEY = "Key";
87 /** Default key width */
90 /** Default key height */
99 /** Key instance for the shift key, if present */
100 private Key mShiftKey;
102 /** Key index for the shift key, if present */
105 /** Current key width, while loading the keyboard *
568 final Key key = new Key(row); local
666 final Key key = mKeys.get(i); local
716 Key key = null; local
[all...] |
