Searched defs:Key (Results 1 - 25 of 120) sorted by relevance

12345

/external/libcxx/test/std/containers/associative/map/
H A Dcompare.pass.cpp12 // template <class Key, class T, class Compare = less<Key>,
13 // class Allocator = allocator<pair<const Key, T>>>
21 struct Key { struct
22 template <typename T> Key(const T&) {} function in struct:Key
23 bool operator< (const Key&) const { return false; }
29 std::map<Key, int>::iterator it = std::map<Key, int>().find(Key(0));
30 std::pair<std::map<Key, in
[all...]
/external/llvm/include/llvm/ADT/
H A DStringSet.h27 std::pair<typename base::iterator, bool> insert(StringRef Key) { argument
28 assert(!Key.empty());
29 return base::insert(std::make_pair(Key, '\0'));
/external/llvm/lib/Support/
H A DOptions.cpp25 void OptionRegistry::addOption(void *Key, cl::Option *O) { argument
26 assert(Options.find(Key) == Options.end() &&
28 Options.insert(std::make_pair(Key, O));
H A DStringPool.cpp25 PooledStringPtr StringPool::intern(StringRef Key) { argument
26 table_t::iterator I = InternTable.find(Key);
30 entry_t *S = entry_t::Create(Key);
/external/libcxx/test/std/containers/unord/unord.map/
H A Dcompare.pass.cpp12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
13 // class Alloc = allocator<pair<const Key, T>>>
21 struct Key { struct
22 template <typename T> Key(const T&) {} function in struct:Key
23 bool operator== (const Key&) const { return true; }
29 struct hash<Key>
31 size_t operator()(Key const &) const {return 0;}
38 std::unordered_map<Key, in
[all...]
/external/llvm/lib/IR/
H A DMetadataImpl.h24 const typename InfoT::KeyTy &Key) {
25 auto I = Store.find_as(Key);
23 getUniqued(DenseSet<T *, InfoT> &Store, const typename InfoT::KeyTy &Key) argument
/external/mockito/cglib-and-asm/src/org/mockito/cglib/core/
H A DClassesKey.java19 private static final Key FACTORY = (Key)KeyFactory.create(Key.class, KeyFactory.OBJECT_BY_CLASS);
21 interface Key { interface in class:ClassesKey
/external/giflib/
H A Dgif_hash.c63 void _InsertHashTable(GifHashTableType *HashTable, uint32_t Key, int Code) argument
65 int HKey = KeyItem(Key);
79 HTable[HKey] = HT_PUT_KEY(Key) | HT_PUT_CODE(Code);
83 Routine to test if given Key exists in HashTable and if so returns its code *
86 int _ExistsHashTable(GifHashTableType *HashTable, uint32_t Key) argument
88 int HKey = KeyItem(Key);
100 if (Key == HTKey) return HT_GET_CODE(HTable[HKey]);
109 The given Key is assumed to be 20 bits as follows: lower 8 bits are the *
/external/glide/library/src/main/java/com/bumptech/glide/load/
H A DKey.java13 public interface Key { interface
/external/llvm/include/llvm/MC/
H A DSubtargetFeature.h35 const char *Key; // K-V key string member in struct:llvm::SubtargetFeatureKV
42 return StringRef(Key) < S;
52 const char *Key; // K-V key string member in struct:llvm::SubtargetInfoKV
57 return StringRef(Key) < S;
/external/guava/guava-tests/test/com/google/common/cache/
H A DCacheReferencesTest.java39 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() {
55 new Function<CacheBuilder<Object, Object>, LoadingCache<Key, String>>() {
56 @Override public LoadingCache<Key, String> apply(CacheBuilder<Object, Object> builder) {
63 for (LoadingCache<Key, String> cache : caches()) {
65 Key key = new Key(1);
75 for (LoadingCache<Key, Strin
156 static class Key { class in class:CacheReferencesTest
160 Key(int value) { method in class:CacheReferencesTest.Key
[all...]
/external/marisa-trie/lib/marisa/
H A Dkey.h7 class Key { class in namespace:marisa
9 Key() : str_(), weight_(0.0), id_(0), terminal_(0) {} function in class:marisa::Key
45 inline bool operator<(const Key<T> &lhs, const T &rhs) {
50 inline bool operator<(const T &lhs, const Key<T> &rhs) {
55 inline bool operator<(const Key<T> &lhs, const Key<T> &rhs) {
60 inline bool operator==(const Key<T> &lhs, const Key<T> &rhs) {
/external/marisa-trie/v0_1_5/lib/marisa_alpha/
H A Dkey.h9 class Key { class in namespace:marisa_alpha
11 Key() : str_(), weight_(0.0), id_(0), terminal_(0) {} function in class:marisa_alpha::Key
47 inline bool operator<(const Key<T> &lhs, const T &rhs) {
52 inline bool operator<(const T &lhs, const Key<T> &rhs) {
57 inline bool operator<(const Key<T> &lhs, const Key<T> &rhs) {
62 inline bool operator==(const Key<T> &lhs, const Key<T> &rhs) {
/external/smali/dexlib2/src/main/java/org/jf/dexlib2/writer/pool/
H A DTypeListPool.java37 import org.jf.dexlib2.writer.pool.TypeListPool.Key;
44 public class TypeListPool extends BaseNullableOffsetPool<Key<? extends Collection<? extends CharSequence>>>
45 implements TypeListSection<CharSequence, Key<? extends Collection<? extends CharSequence>>> {
54 Key<? extends Collection<? extends CharSequence>> key = new Key<Collection<? extends CharSequence>>(types);
65 public Collection<? extends CharSequence> getTypes(Key<? extends Collection<? extends CharSequence>> typesKey) {
72 @Override public int getNullableItemOffset(@Nullable Key<? extends Collection<? extends CharSequence>> key) {
80 public static class Key<TypeCollection extends Collection<? extends CharSequence>> class in class:TypeListPool
81 implements Comparable<Key<? extends Collection<? extends CharSequence>>> {
84 public Key( method in class:TypeListPool.Key
[all...]
H A DProtoPool.java37 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<? extends CharSequence>>> {
63 Key key = new Key(method);
72 @Nonnull @Override public CharSequence getShorty(@Nonnull Key key) {
76 @Nonnull @Override public CharSequence getReturnType(@Nonnull Key key) {
80 @Nullable @Override public TypeListPool.Key<List<? extends CharSequence>> getParameters(@Nonnull Key ke
84 public static class Key implements Comparable<Key> { class in class:ProtoPool
87 public Key(@Nonnull MethodReference method) { method in class:ProtoPool.Key
[all...]
/external/clang/lib/AST/
H A DItaniumCXXABI.cpp66 QualType Key = variable
69 Key = Context.getCanonicalType(Key);
70 return ++ManglingNumbers[Key->castAs<FunctionProtoType>()];
/external/clang/tools/diagtool/
H A DDiagnosticNames.cpp53 DiagnosticRecord Key = {nullptr, DiagID, 0}; local
58 Key, orderByID);
/external/eigen/demos/opengl/
H A Dicosphere.cpp63 typedef unsigned long long Key; typedef
64 std::map<Key,int> edgeMap;
81 Key edgeKey = Key(e0) | (Key(e1)<<32);
82 std::map<Key,int>::iterator it = edgeMap.find(edgeKey);
/external/llvm/lib/Transforms/ObjCARC/
H A DBlotMapVector.h73 iterator find(const KeyT &Key) { argument
74 typename MapTy::iterator It = Map.find(Key);
80 const_iterator find(const KeyT &Key) const {
81 typename MapTy::const_iterator It = Map.find(Key);
90 void blot(const KeyT &Key) { argument
91 typename MapTy::iterator It = Map.find(Key);
/external/marisa-trie/tools/
H A Dmarisa-build.cc15 typedef std::pair<std::string, double> Key; typedef in namespace:__anon11595
40 void read_keys(std::istream *input, std::vector<Key> *keys) {
41 Key key;
62 std::vector<Key> keys;
/external/marisa-trie/v0_1_5/tools/
H A Dmarisa_alpha-build.cc15 typedef std::pair<std::string, double> Key; typedef in namespace:__anon11608
40 void read_keys(std::istream *input, std::vector<Key> *keys) {
41 Key key;
62 std::vector<Key> keys;
/external/openfst/src/include/fst/
H A Dgeneric-register.h43 typedef KeyType Key; typedef in class:fst::GenericRegister
141 // given RegisterType template parameter. This type must define types Key
148 typedef typename RegisterType::Key Key; typedef in class:fst::GenericRegisterer
151 GenericRegisterer(Key key, Entry entry) {
/external/openssh/
H A Dkey.h31 typedef struct sshkey Key; typedef in typeref:struct:sshkey
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_privat
[all...]
/external/skia/src/gpu/
H A DGrAADistanceFieldPathRenderer.h49 struct Key { struct in struct:GrAADistanceFieldPathRenderer::PathData
53 bool operator==(const Key& other) const {
57 Key fKey;
64 static inline const Key& GetKey(const PathData& data) {
68 static inline uint32_t Hash(Key key) {
75 typedef SkTDynamicHash<PathData, PathData::Key> PathCache;
/external/smali/dexlib2/src/main/java/org/jf/dexlib2/writer/builder/
H A DBuilderProtoPool.java59 ProtoKey key = new Key(parameters, returnType);
114 private static class Key implements ProtoKey { class in class:BuilderProtoPool
118 public Key(@Nonnull List<? extends CharSequence> parameters, @Nonnull String returnType) { method in class:BuilderProtoPool.Key

Completed in 640 milliseconds

12345