| /libcore/luni/src/main/java/javax/crypto/ |
| SecretKey.java | 20 import java.security.Key;
23 * A cryptographic secret (symmetric) key.
30 * from {@link java.lang.Object} so comparison is done using the actual key data
33 public interface SecretKey extends Key {
|
| ExemptionMechanismSpi.java | 23 import java.security.Key;
39 * Generates the result key blob for this exemption mechanism.
41 * @return the result key blob for this exemption mechanism.
49 * Generates the result key blob for this exemption mechanism and stores it
53 * the output buffer for the result key blob.
58 * if the provided buffer is too small for the result key blob.
79 * key.
81 * @param key
82 * the key to initialize this instance with.
84 * if the key cannot be used to initialize this mechanism
[all...] |
| NullCipher.java | 26 import java.security.Key;
43 this.init(Cipher.ENCRYPT_MODE, (Key)null, (SecureRandom)null);
|
| KeyAgreementSpi.java | 22 import java.security.Key;
40 * Does the next (or the last) phase of the key agreement, using the
41 * specified key.
43 * @param key
44 * the key received from the other party for this phase.
46 * set to {@code true} if this is the last phase of this key
48 * @return the intermediate key from this phase or null if there is no
49 * intermediate key for this phase.
51 * if the specified key cannot be used in this key agreement o
[all...] |
| /libcore/luni/src/main/java/java/security/ |
| PrivateKey.java | 25 public interface PrivateKey extends Key {
|
| PublicKey.java | 25 public interface PublicKey extends Key {
|
| KeyFactorySpi.java | 32 * Generates a instance of {@code PublicKey} from the given key
36 * the specification of the public key.
37 * @return the public key.
45 * Generates a instance of {@code PrivateKey} from the given key
49 * the specification of the private key.
50 * @return the private key.
58 * Returns the key specification for the specified key.
60 * @param key
61 * the key from which the specification is requested
[all...] |
| 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...] |
| /external/protobuf/src/google/protobuf/stubs/ |
| hash.h | 62 template <typename Key>
65 int operator()(const Key& key) {
70 inline bool operator()(const Key& a, const Key& b) const {
79 int operator()(const char* key) {
89 template <typename Key, typename Data,
90 typename HashFcn = hash<Key>,
92 class hash_map : public std::map<Key, Data, HashFcn> {
95 template <typename Key,
[all...] |
| /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...] |
| /external/bison/src/ |
| muscle_tab.h | 27 void muscle_insert (const char *key, char *value);
28 char *muscle_find (const char *key);
35 #define MUSCLE_INSERT_BOOL(Key, Value) \
38 MUSCLE_INSERT_INT (Key, v); \
41 #define MUSCLE_INSERT_INT(Key, Value) \
45 muscle_insert (Key, obstack_finish (&muscle_obstack)); \
48 #define MUSCLE_INSERT_LONG_INT(Key, Value) \
52 muscle_insert (Key, obstack_finish (&muscle_obstack)); \
55 #define MUSCLE_INSERT_STRING(Key, Value) \
59 muscle_insert (Key, obstack_finish (&muscle_obstack));
[all...] |
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/rb_tree_map_/ |
| traits.hpp | 50 template<typename Key,
60 Key,
66 Key,
72 Key,
77 Key,
86 template<typename Key,
95 Key,
101 Key,
107 Key,
112 Key,
[all...] |
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/splay_tree_/ |
| traits.hpp | 51 template<typename Key,
61 Key,
67 Key,
73 Key,
78 Key,
87 template<typename Key,
95 struct tree_traits<Key, null_mapped_type, Cmp_Fn, Node_Update,
97 : public bin_search_tree_traits<Key, null_mapped_type, Cmp_Fn,
99 splay_tree_node_<typename types_traits<Key, null_mapped_type, Allocator, false>::value_type,
101 Key,
[all...] |
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/eq_fn/ |
| eq_by_less.hpp | 54 template<typename Key, class Cmp_Fn>
58 operator()(const Key& r_lhs, const Key& r_rhs) const
|
| hash_eq_fn.hpp | 52 template<typename Key, class Eq_Fn, class Allocator, bool Store_Hash>
56 template<typename Key, class Eq_Fn, class Allocator>
59 hash_eq_fn<Key, Eq_Fn, Allocator, false>
64 template<typename Key, class Eq_Fn, class Allocator>
65 struct hash_eq_fn<Key, Eq_Fn, Allocator, false> : public Eq_Fn
69 typedef typename Allocator::template rebind<Key>::other key_allocator;
111 template<typename Key, class Eq_Fn, class Allocator>
114 hash_eq_fn<Key, Eq_Fn, Allocator, true>
119 template<typename Key, class Eq_Fn, class Allocator>
120 struct hash_eq_fn<Key, Eq_Fn, Allocator, true>
[all...] |
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/basic_tree_policy/ |
| null_node_metadata.hpp | 50 template<typename Key, class Data, class Allocator>
54 typedef typename types_traits<Key, Data, Allocator, false>::pointer const_iterator;
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/ov_tree_map_/ |
| traits.hpp | 51 template<typename Key,
61 Key,
71 Key,
80 Key,
118 template<typename Key,
127 Key,
137 Key,
146 Key,
|
| /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/ |
| KeyDetector.java | 20 import android.inputmethodservice.Keyboard.Key;
28 private Key[] mKeys;
38 public Key[] setKeyboard(Keyboard keyboard, float correctionX, float correctionY) {
44 List<Key> keys = mKeyboard.getKeys();
45 Key[] array = keys.toArray(new Key[keys.size()]);
58 protected Key[] getKeys() {
78 * Allocates array that can hold all key indices returned by {@link #getKeyIndexAndNearbyCodes}
81 * @return Allocates and returns an array that can hold all key indices returned by
93 * Computes maximum size of the array that can contain all nearby key indices returned b
[all...] |
| /libcore/luni/src/test/java/org/apache/harmony/security/tests/java/security/ |
| KeyTest.java | 30 import java.security.Key;
33 @TestTargetClass(Key.class)
35 * Tests for <code>Key</code> class field
52 assertEquals("Incorrect serialVersionUID", mk.getSerVerUID(), //Key.serialVersionUID,
56 public class checkKey implements Key {
58 return "Key";
|
| /frameworks/base/libs/ui/ |
| KeyLayoutMap.h | 20 struct Key {
26 KeyedVector<int32_t,Key> m_keys;
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/ |
| container_base_dispatch.hpp | 107 template<typename Key, typename Mapped, typename Data_Structure_Taq,
111 template<typename Key, typename Mapped, typename Policy_Tl, typename Alloc>
112 struct container_base_dispatch<Key, Mapped, list_update_tag,
122 typedef lu_map_data_<Key, Mapped, at0t, Alloc, at1t> type;
125 template<typename Key, typename Policy_Tl, typename Alloc>
126 struct container_base_dispatch<Key, null_mapped_type, list_update_tag,
136 typedef lu_map_no_data_<Key, null_mapped_type, at0t, Alloc, at1t> type;
139 template<typename Key, typename Mapped, typename Policy_Tl, typename Alloc>
140 struct container_base_dispatch<Key, Mapped, pat_trie_tag, Policy_Tl, Alloc>
147 typedef pat_trie_data_<Key, Mapped, at1t, Alloc> type
[all...] |
| types_traits.hpp | 52 template<typename Key, typename Mapped, typename Alloc, bool Store_Extra>
55 typedef value_type_base<Key, Mapped, Alloc, Store_Extra> type;
58 template<typename Key, typename Mapped, typename Alloc, bool Store_Extra>
60 : public vt_base_selector<Key, Mapped, Alloc, Store_Extra>::type
62 typedef typename Alloc::template rebind<Key>::other key_allocator;
76 typedef typename no_throw_copies<Key, Mapped>::indicator no_throw_copies;
|
| basic_types.hpp | 53 template<typename Key, typename Mapped, typename Allocator, bool Store_Hash>
60 template<typename Key, typename Mapped, typename Allocator>
61 struct value_type_base<Key, Mapped, Allocator, false>
70 typedef typename Allocator::template rebind<std::pair<const Key, Mapped> >::other value_type_allocator;
87 template<typename Key, typename Mapped, typename Allocator>
88 struct value_type_base<Key, Mapped, Allocator, true>
97 typedef typename Allocator::template rebind<std::pair<const Key, Mapped> >::other value_type_allocator;
112 template<typename Key, typename Allocator>
115 value_type_base<Key, null_mapped_type, Allocator, false>
121 template<typename Key, typename Allocator
[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...] |
