HomeSort by relevance Sort by last modified time
    Searched refs:Key (Results 1 - 25 of 3263) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /packages/inputmethods/LatinIME/tools/dicttool/compat/com/android/inputmethod/keyboard/
Keyboard.java 21 private final Key KEY = new Key();
22 public final Key getKey(final int i) { return KEY; }
  /frameworks/layoutlib/bridge/src/com/android/layoutlib/bridge/android/
RenderParamsFlags.java 21 import com.android.ide.common.rendering.api.SessionParams.Key;
24 * This contains all known keys for the {@link RenderParams#getFlag(Key)}.
32 public static final Key<String> FLAG_KEY_ROOT_TAG =
33 new Key<String>("rootTag", String.class);
34 public static final Key<Boolean> FLAG_KEY_DISABLE_BITMAP_CACHING =
35 new Key<Boolean>("disableBitmapCaching", Boolean.class);
36 public static final Key<Boolean> FLAG_KEY_RENDER_ALL_DRAWABLE_STATES =
37 new Key<Boolean>("renderAllDrawableStates", Boolean.class);
43 public static final Key<Boolean> FLAG_KEY_RECYCLER_VIEW_SUPPORT =
44 new Key<Boolean>("recyclerViewSupport", Boolean.class)
    [all...]
  /frameworks/base/core/java/android/hardware/camera2/
CaptureResult.java 46 * not have every key set. Only {@link TotalCaptureResult total} results are guaranteed to have
47 * every key available that was enabled by the request.</p>
52 public class CaptureResult extends CameraMetadata<CaptureResult.Key<?>> {
58 * A {@code Key} is used to do capture result field lookups with
73 public final static class Key<T> {
74 private final CameraMetadataNative.Key<T> mKey;
81 public Key(String name, Class<T> type, long vendorId) {
82 mKey = new CameraMetadataNative.Key<T>(name, type, vendorId);
90 public Key(String name, String fallbackName, Class<T> type) {
91 mKey = new CameraMetadataNative.Key<T>(name, fallbackName, type)
    [all...]
CameraCharacteristics.java 48 public final class CameraCharacteristics extends CameraMetadata<CameraCharacteristics.Key<?>> {
51 * A {@code Key} is used to do camera characteristics field lookups with
67 public static final class Key<T> {
68 private final CameraMetadataNative.Key<T> mKey;
75 public Key(String name, Class<T> type, long vendorId) {
76 mKey = new CameraMetadataNative.Key<T>(name, type, vendorId);
84 public Key(String name, String fallbackName, Class<T> type) {
85 mKey = new CameraMetadataNative.Key<T>(name, fallbackName, type);
93 public Key(String name, Class<T> type) {
94 mKey = new CameraMetadataNative.Key<T>(name, type)
    [all...]
  /external/smali/dexlib2/src/main/java/org/jf/dexlib2/writer/
NullableIndexSection.java 36 public interface NullableIndexSection<Key> extends IndexSection<Key> {
37 int getNullableItemIndex(@Nullable Key key);
NullableOffsetSection.java 36 public interface NullableOffsetSection<Key> extends OffsetSection<Key> {
37 int getNullableItemOffset(@Nullable Key key);
  /external/libcxx/test/std/containers/unord/unord.map/
compare.pass.cpp 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
13 // class Alloc = allocator<pair<const Key, T>>>
22 struct Key {
23 template <typename T> Key(const T&) {}
24 bool operator== (const Key&) const { return true; }
30 struct hash<Key>
32 size_t operator()(Key const &) const {return 0;}
39 typedef std::unordered_map<Key, int> MapT
    [all...]
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.map/
compare.pass.cpp 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
13 // class Alloc = allocator<pair<const Key, T>>>
22 struct Key {
23 template <typename T> Key(const T&) {}
24 bool operator== (const Key&) const { return true; }
30 struct hash<Key>
32 size_t operator()(Key const &) const {return 0;}
39 typedef std::unordered_map<Key, int> MapT
    [all...]
  /external/google-breakpad/src/processor/
static_map_iterator-inl.h 44 template<typename Key, typename Value, typename Compare>
45 StaticMapIterator<Key, Value, Compare>::StaticMapIterator(const char* base,
52 keys_ = reinterpret_cast<const Key*>(
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...]
  /art/libartbase/base/
tracking_safe_map.h 25 template<class Key, class T, AllocatorTag kTag, class Compare = std::less<Key>>
27 Key, T, Compare, TrackingAllocator<std::pair<const Key, T>, kTag>> {
hash_map.h 30 template <class Key, class Value>
31 size_t operator()(const std::pair<Key, Value>& pair) const {
34 template <class Key>
35 size_t operator()(const Key& key) const {
36 return fn_(key);
38 template <class Key, class Value>
39 bool operator()(const std::pair<Key, Value>& a, const std::pair<Key, Value>& b) const {
42 template <class Key, class Value, class Element
    [all...]
  /external/clang/test/Modules/Inputs/submodules/
hash_map.h 1 template<typename Key, typename Data> class hash_map { };
  /external/glide/library/src/main/java/com/bumptech/glide/load/engine/cache/
DiskCache.java 3 import com.bumptech.glide.load.Key;
12 * An interface to actually write data to a key in the disk cache.
25 * Get the cache for the value at the given key.
32 * @param key The key in the cache.
33 * @return An InputStream representing the data at key at the time get is called.
35 File get(Key key);
38 * Write to a key in the cache. {@link Writer} is used so that the cache implementation can perform actions after
41 * @param key The key to write to
    [all...]
DiskCacheAdapter.java 3 import com.bumptech.glide.load.Key;
12 public File get(Key key) {
18 public void put(Key key, Writer writer) {
23 public void delete(Key key) {
  /external/libmojo/mojo/public/cpp/bindings/
map.h 16 template <typename Key, typename Value>
17 std::unordered_map<Key, Value> MapToUnorderedMap(
18 const std::map<Key, Value>& input) {
19 return std::unordered_map<Key, Value>(input.begin(), input.end());
22 template <typename Key, typename Value>
23 std::unordered_map<Key, Value> MapToUnorderedMap(std::map<Key, Value>&& input) {
24 return std::unordered_map<Key, Value>(std::make_move_iterator(input.begin()),
28 template <typename Key, typename Value>
29 std::map<Key, Value> UnorderedMapToMap
    [all...]
  /frameworks/support/paging/runtime/src/main/java/androidx/paging/
LivePagedListProvider.java 31 public abstract class LivePagedListProvider<Key, Value> extends DataSource.Factory<Key, Value> {
34 public DataSource<Key, Value> create() {
39 protected abstract DataSource<Key, Value> createDataSource();
  /frameworks/support/room/compiler/src/test/data/common/input/
DataSource.java 20 public interface Factory<Key, Value> {
  /libcore/ojluni/src/main/java/java/security/
PublicKey.java 29 * <p>A public key. This interface contains no methods or constants.
30 * It merely serves to group (and provide type safety for) all public key
33 * Note: The specialized public key interfaces extend this interface.
37 * @see Key
46 public interface PublicKey extends Key {
  /external/libchrome/base/posix/
global_descriptors.h 35 // It maps from an abstract key to a descriptor. If independent modules each
44 typedef uint32_t Key;
46 Descriptor(Key key, int fd);
47 Descriptor(Key key, int fd, base::MemoryMappedFile::Region region);
49 // Globally unique key.
50 Key key; member in struct:base::GlobalDescriptors::Descriptor
58 // Often we want a canonical descriptor for a given Key. In this case, we ad
    [all...]
  /external/libcxx/test/std/containers/associative/map/
compare.pass.cpp 12 // template <class Key, class T, class Compare = less<Key>,
13 // class Allocator = allocator<pair<const Key, T>>>
23 struct Key {
24 template <typename T> Key(const T&) {}
25 bool operator< (const Key&) const { return false; }
30 typedef std::map<Key, int> MapT;
36 m_contains[Key(0)] = 42;
38 Iter it = m_empty.find(Key(0));
40 it = m_contains.find(Key(0))
    [all...]
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/associative/map/
compare.pass.cpp 12 // template <class Key, class T, class Compare = less<Key>,
13 // class Allocator = allocator<pair<const Key, T>>>
23 struct Key {
24 template <typename T> Key(const T&) {}
25 bool operator< (const Key&) const { return false; }
30 typedef std::map<Key, int> MapT;
36 m_contains[Key(0)] = 42;
38 Iter it = m_empty.find(Key(0));
40 it = m_contains.find(Key(0))
    [all...]
  /external/libchrome/base/containers/
hash_tables.h 44 template <class Key,
46 class Hash = BASE_HASH_NAMESPACE::hash<Key>,
47 class Pred = std::equal_to<Key>,
48 class Alloc = std::allocator<std::pair<const Key, T>>>
49 using hash_map = std::unordered_map<Key, T, Hash, Pred, Alloc>;
52 template <class Key,
54 class Hash = BASE_HASH_NAMESPACE::hash<Key>,
55 class Pred = std::equal_to<Key>,
56 class Alloc = std::allocator<std::pair<const Key, T>>>
57 using hash_multimap = std::unordered_multimap<Key, T, Hash, Pred, Alloc>
    [all...]
  /device/linaro/bootloader/edk2/BaseTools/Source/Python/Common/
Dictionary.py 37 Key = LineList[0].split()
38 if len(Key) == 1 and Key[0][0] != CommentCharacter and Key[0] not in Keys:
40 Dictionary[Key[0]] = LineList[1].replace('\\', '/').split(ValueSplitCharacter)
42 Dictionary[Key[0]] = LineList[1].strip().replace('\\', '/')
43 Keys += [Key[0]]
59 for Key in KeyList:
60 if Dict[Key] != '':
61 print Key + ' = ' + str(Dict[Key])
    [all...]
  /external/parameter-framework/asio-1.10.6/include/asio/detail/
call_stack.hpp 26 template <typename Key, typename Value = unsigned char>
30 // Context class automatically pushes the key/value pair on to the stack.
35 // Push the key on to the stack.
36 explicit context(Key* k)
38 next_(call_stack<Key, Value>::top_)
41 call_stack<Key, Value>::top_ = this;
44 // Push the key/value pair on to the stack.
45 context(Key* k, Value& v)
48 next_(call_stack<Key, Value>::top_)
50 call_stack<Key, Value>::top_ = this
    [all...]
  /external/boringssl/src/crypto/evp/
scrypt_tests.txt 14 Key = 77d6576238657b203b19ca42c18a0497f16b4844e3074ae8dfdffa3fede21442fcd0069ded0948f8326a753a0fc81f17e8d3e0fb2e0d3628cf35e20c38d18906
21 Key = fdbabe1c9d3472007856e7190d01e9fe7c6ad7cbc8237830e77376634b3731622eaf30d92e22a3886ff109279d9830dac727afb94a83ee6d8360cbdfa2cc0640
28 Key = 7023bdcb3afd7348461c06cd81fd38ebfda8fbba904f8e3ea9b543f6545da1f2d5432955613f0fcf62d49705242a9af9e61e85dc0d651e40dfcf017b45575887
37 # Key = 2101cb9b6a511aaeaddbbe09cf70f881ec568d574a2ffd4dabe5ee9820adaa478e56fd8f4ba5d09ffa1c6d927c40f4c337304049e8a952fbcbf45c6fa77a41a4

Completed in 742 milliseconds

1 2 3 4 5 6 7 8 91011>>