/external/smali/dexlib2/src/main/java/org/jf/dexlib2/writer/ |
H A D | NullableIndexSection.java | 36 public interface NullableIndexSection<Key> extends IndexSection<Key> { 37 int getNullableItemIndex(@Nullable Key key);
|
H A D | NullableOffsetSection.java | 36 public interface NullableOffsetSection<Key> extends OffsetSection<Key> { 37 int getNullableItemOffset(@Nullable Key key);
|
H A D | IndexSection.java | 38 public interface IndexSection<Key> { 39 int getItemIndex(@Nonnull Key key); 40 @Nonnull Collection<? extends Map.Entry<? extends Key, Integer>> getItems();
|
H A D | OffsetSection.java | 38 public interface OffsetSection<Key> { 39 int getItemOffset(@Nonnull Key key); 40 @Nonnull Collection<? extends Map.Entry<? extends Key, Integer>> getItems();
|
/external/libcxx/test/std/containers/unord/unord.map/ |
H A D | 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 { struct 23 template <typename T> Key(const T&) {} function in struct:Key 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, in [all...] |
/external/clang/test/Modules/Inputs/submodules/ |
H A D | hash_map.h | 1 template<typename Key, typename Data> class hash_map { };
|
/external/glide/library/src/main/java/com/bumptech/glide/load/engine/cache/ |
H A D | DiskCache.java | 3 import com.bumptech.glide.load.Key; 35 File get(Key key); 44 void put(Key key, Writer writer); 51 void delete(Key key);
|
H A D | 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/ |
H A D | 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, Valu [all...] |
/external/libcxx/test/std/containers/associative/map/ |
H A D | compare.pass.cpp | 12 // template <class Key, class T, class Compare = less<Key>, 13 // class Allocator = allocator<pair<const Key, T>>> 23 struct Key { struct 24 template <typename T> Key(const T&) {} function in struct:Key 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( [all...] |
/external/libchrome/base/containers/ |
H A D | 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, [all...] |
/external/parameter-framework/asio/include/asio/detail/ |
H A D | call_stack.hpp | 26 template <typename Key, typename Value = unsigned char> 36 explicit context(Key* k) 38 next_(call_stack<Key, Value>::top_) 41 call_stack<Key, Value>::top_ = this; 45 context(Key* k, Value& v) 48 next_(call_stack<Key, Value>::top_) 50 call_stack<Key, Value>::top_ = this; 56 call_stack<Key, Value>::top_ = next_; 73 friend class call_stack<Key, Value>; 76 Key* key [all...] |
/external/parameter-framework/asio-1.10.6/include/asio/detail/ |
H A D | call_stack.hpp | 26 template <typename Key, typename Value = unsigned char> 36 explicit context(Key* k) 38 next_(call_stack<Key, Value>::top_) 41 call_stack<Key, Value>::top_ = this; 45 context(Key* k, Value& v) 48 next_(call_stack<Key, Value>::top_) 50 call_stack<Key, Value>::top_ = this; 56 call_stack<Key, Value>::top_ = next_; 73 friend class call_stack<Key, Value>; 76 Key* key [all...] |
/external/boringssl/src/crypto/evp/ |
H A D | scrypt_tests.txt | 14 Key = 77d6576238657b203b19ca42c18a0497f16b4844e3074ae8dfdffa3fede21442fcd0069ded0948f8326a753a0fc81f17e8d3e0fb2e0d3628cf35e20c38d18906 21 Key = fdbabe1c9d3472007856e7190d01e9fe7c6ad7cbc8237830e77376634b3731622eaf30d92e22a3886ff109279d9830dac727afb94a83ee6d8360cbdfa2cc0640 28 Key = 7023bdcb3afd7348461c06cd81fd38ebfda8fbba904f8e3ea9b543f6545da1f2d5432955613f0fcf62d49705242a9af9e61e85dc0d651e40dfcf017b45575887 37 # Key = 2101cb9b6a511aaeaddbbe09cf70f881ec568d574a2ffd4dabe5ee9820adaa478e56fd8f4ba5d09ffa1c6d927c40f4c337304049e8a952fbcbf45c6fa77a41a4
|
/external/smali/dexlib2/src/main/java/org/jf/dexlib2/writer/builder/ |
H A D | BuilderMapEntryCollection.java | 40 public abstract class BuilderMapEntryCollection<Key> extends AbstractCollection<Map.Entry<Key, Integer>> { 41 @Nonnull private final Collection<Key> keys; 43 public BuilderMapEntryCollection(@Nonnull Collection<Key> keys) { 47 private class MapEntry implements Map.Entry<Key, Integer> { 48 @Nonnull private Key key; 50 @Nonnull @Override public Key getKey() { 63 @Nonnull @Override public Iterator<Map.Entry<Key, Integer>> iterator() { 64 final Iterator<Key> iter = keys.iterator(); 66 return new Iterator<Map.Entry<Key, Intege [all...] |
/external/guice/core/src/com/google/inject/spi/ |
H A D | LinkedKeyBinding.java | 20 import com.google.inject.Key; 32 * injector using {@link com.google.inject.Injector#getBinding(Key) Injector.getBinding(key)}. 34 Key<? extends T> getLinkedKey();
|
H A D | PrivateElements.java | 20 import com.google.inject.Key; 48 Set<Key<?>> getExposedKeys(); 60 Object getExposedSource(Key<?> key);
|
/external/guice/extensions/assistedinject/src/com/google/inject/assistedinject/ |
H A D | AssistedInjectBinding.java | 19 import com.google.inject.Key; 33 /** Returns the {@link Key} for the factory binding. */ 34 Key<T> getKey();
|
/external/guice/extensions/servlet/src/com/google/inject/servlet/ |
H A D | LinkedFilterBinding.java | 19 import com.google.inject.Key; 32 Key<? extends Filter> getLinkedKey();
|
H A D | LinkedServletBinding.java | 19 import com.google.inject.Key; 32 Key<? extends HttpServlet> getLinkedKey();
|
/external/swiftshader/third_party/LLVM/lib/Support/ |
H A D | StringPool.cpp | 25 PooledStringPtr StringPool::intern(StringRef Key) { argument 26 table_t::iterator I = InternTable.find(Key); 30 entry_t *S = entry_t::Create(Key.begin(), Key.end());
|
/external/glide/library/src/main/java/com/bumptech/glide/load/engine/ |
H A D | EngineJobListener.java | 3 import com.bumptech.glide.load.Key; 7 void onEngineJobComplete(Key key, EngineResource<?> resource); 9 void onEngineJobCancelled(EngineJob engineJob, Key key);
|
/external/google-breakpad/src/processor/ |
H A D | static_map.h | 43 // ************* Key array ************ 55 // REQUIREMENT: Key type MUST be primitive type or pointers so that: 56 // X = sizeof(typename Key); 72 template<typename Key> 75 int operator()(const Key &k1, const Key &k2) const { 82 template<typename Key, typename Value, typename Compare = DefaultCompare<Key> > 85 typedef StaticMapIterator<Key, Value, Compare> iterator; 86 typedef StaticMapIterator<Key, Valu [all...] |
H A D | 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, Valu [all...] |
/external/v8/src/base/ |
H A D | hashmap-entry.h | 16 template <typename Key, typename Value> 18 Key key; 22 TemplateHashMapEntry(Key key, Value value, uint32_t hash) 34 template <typename Key, typename Value> 35 struct TemplateHashMapEntry<Key*, Value> { 36 Key* key; 40 TemplateHashMapEntry(Key* key, Value value, uint32_t hash)
|