| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.apache.ant_1.7.1.v20090120-1145/lib/ |
| ant-apache-bcel.jar | |
| /frameworks/compile/mclinker/include/mcld/ADT/ |
| HashTable.h | 1 //===- HashTable.h ---------------------------------------------------------===//
25 /** \class HashTable
26 * \brief HashTable is a hash table which follows boost::unordered_map, but it
29 * mcld::HashTable is a linear probing hash table. It does not allocate
36 class HashTable : public HashTableImpl<HashEntryTy, HashFunctionTy>,
64 explicit HashTable(size_type pSize=3);
65 ~HashTable();
120 #include "HashTable.tcc"
|
| HashEntry.h | 25 * mcld::HashEntry illustrates the demand from mcld::HashTable.
26 * Since HashTable can change the definition of the HashEntry by changing
28 * basic interfaces that HashTable requests. You can define your own entry
|
| /frameworks/compile/mclinker/unittests/ |
| HashTableTest.h | 19 * \brief Testcase for HashTable
21 * \see HashTable
|
| /bootable/recovery/minzip/ |
| Hash.c | 51 HashTable* mzHashTableCreate(size_t initialSize, HashFreeFunc freeFunc)
53 HashTable* pHashTable;
57 pHashTable = (HashTable*) malloc(sizeof(*pHashTable));
65 (HashEntry*) calloc((size_t)pHashTable->tableSize, sizeof(HashTable));
77 void mzHashTableClear(HashTable* pHashTable)
102 void mzHashTableFree(HashTable* pHashTable)
115 static int countTombStones(HashTable* pHashTable)
137 static bool resizeHash(HashTable* pHashTable, int newSize)
145 pNewEntries = (HashEntry*) calloc(newSize, sizeof(HashTable));
179 void* mzHashTableLookup(HashTable* pHashTable, unsigned int itemHash, void* item
[all...] |
| /external/chromium_org/third_party/icu/source/common/ |
| servlkf.cpp | 60 const Hashtable* supported = getSupportedIDs(status);
70 LocaleKeyFactory::updateVisibleIDs(Hashtable& result, UErrorCode& status) const {
71 const Hashtable* supported = getSupportedIDs(status);
116 // const Hashtable* ids = getSupportedIDs(status);
120 const Hashtable*
|
| /external/icu4c/common/ |
| servlkf.cpp | 60 const Hashtable* supported = getSupportedIDs(status);
70 LocaleKeyFactory::updateVisibleIDs(Hashtable& result, UErrorCode& status) const {
71 const Hashtable* supported = getSupportedIDs(status);
116 // const Hashtable* ids = getSupportedIDs(status);
120 const Hashtable*
|
| uhash.h | 7 * 03/22/00 aliu Adapted from original C++ ICU Hashtable.
41 * then keys passed to uhash_put() are owned by the hashtable and will
45 * other than uhash_put() are never owned by the hashtable.
54 * To see everything in a hashtable, use uhash_nextElement() to
65 * By default, the hashtable grows when necessary, but never shrinks,
100 * @param key A key stored in a hashtable
268 * NULL, this hashtable does not delete keys. If it is non-NULL, this
269 * hashtable does delete keys. This function should be set once
270 * before any elements are added to the hashtable and should not be
281 * is NULL, this hashtable does not delete values. If it is non-NULL
[all...] |
| /libcore/luni/src/main/java/org/apache/harmony/security/ |
| SystemScope.java | 30 import java.util.Hashtable;
44 private Hashtable names = new Hashtable();
47 private Hashtable keys = new Hashtable();
|
| /external/stlport/stlport/stl/ |
| _hashtable.h | 58 * Hashtable class, used to implement the hashed associative containers
66 //Export of the classes used to represent buckets in the hashtable implementation.
94 # define hashtable _STLP_NON_DBG_NAME(hashtable) macro
101 class hashtable;
194 //Returns the maximum number of buckets handled by the hashtable implementation
216 * do. If we're using standard-conforming allocators, then a hashtable
225 class hashtable { class
226 typedef hashtable<_Val, _Key, _HF, _Traits, _ExK, _EqK, _All> _Self;
262 * - limit code bloat, all hashtable instanciation use the same buckets representation
303 hashtable(size_type __n, function in class:hashtable
332 hashtable(const _Self& __ht) function in class:hashtable
342 hashtable(__move_source<_Self> src) function in class:hashtable
619 # undef hashtable macro
[all...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _hashtable.h | 58 * Hashtable class, used to implement the hashed associative containers
66 //Export of the classes used to represent buckets in the hashtable implementation.
94 # define hashtable _STLP_NON_DBG_NAME(hashtable) macro
101 class hashtable;
194 //Returns the maximum number of buckets handled by the hashtable implementation
216 * do. If we're using standard-conforming allocators, then a hashtable
225 class hashtable { class
226 typedef hashtable<_Val, _Key, _HF, _Traits, _ExK, _EqK, _All> _Self;
262 * - limit code bloat, all hashtable instanciation use the same buckets representation
303 hashtable(size_type __n, function in class:hashtable
332 hashtable(const _Self& __ht) function in class:hashtable
342 hashtable(__move_source<_Self> src) function in class:hashtable
619 # undef hashtable macro
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
| _hashtable.h | 58 * Hashtable class, used to implement the hashed associative containers
66 //Export of the classes used to represent buckets in the hashtable implementation.
94 # define hashtable _STLP_NON_DBG_NAME(hashtable) macro
101 class hashtable;
194 //Returns the maximum number of buckets handled by the hashtable implementation
216 * do. If we're using standard-conforming allocators, then a hashtable
225 class hashtable { class
226 typedef hashtable<_Val, _Key, _HF, _Traits, _ExK, _EqK, _All> _Self;
262 * - limit code bloat, all hashtable instanciation use the same buckets representation
303 hashtable(size_type __n, function in class:hashtable
332 hashtable(const _Self& __ht) function in class:hashtable
342 hashtable(__move_source<_Self> src) function in class:hashtable
619 # undef hashtable macro
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
| _hashtable.h | 58 * Hashtable class, used to implement the hashed associative containers
66 //Export of the classes used to represent buckets in the hashtable implementation.
94 # define hashtable _STLP_NON_DBG_NAME(hashtable) macro
101 class hashtable;
194 //Returns the maximum number of buckets handled by the hashtable implementation
216 * do. If we're using standard-conforming allocators, then a hashtable
225 class hashtable { class
226 typedef hashtable<_Val, _Key, _HF, _Traits, _ExK, _EqK, _All> _Self;
262 * - limit code bloat, all hashtable instanciation use the same buckets representation
303 hashtable(size_type __n, function in class:hashtable
332 hashtable(const _Self& __ht) function in class:hashtable
342 hashtable(__move_source<_Self> src) function in class:hashtable
619 # undef hashtable macro
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
| _hashtable.h | 58 * Hashtable class, used to implement the hashed associative containers
66 //Export of the classes used to represent buckets in the hashtable implementation.
94 # define hashtable _STLP_NON_DBG_NAME(hashtable) macro
101 class hashtable;
194 //Returns the maximum number of buckets handled by the hashtable implementation
216 * do. If we're using standard-conforming allocators, then a hashtable
225 class hashtable { class
226 typedef hashtable<_Val, _Key, _HF, _Traits, _ExK, _EqK, _All> _Self;
262 * - limit code bloat, all hashtable instanciation use the same buckets representation
303 hashtable(size_type __n, function in class:hashtable
332 hashtable(const _Self& __ht) function in class:hashtable
342 hashtable(__move_source<_Self> src) function in class:hashtable
619 # undef hashtable macro
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/ |
| _hashtable.h | 58 * Hashtable class, used to implement the hashed associative containers
66 //Export of the classes used to represent buckets in the hashtable implementation.
94 # define hashtable _STLP_NON_DBG_NAME(hashtable) macro
101 class hashtable;
194 //Returns the maximum number of buckets handled by the hashtable implementation
216 * do. If we're using standard-conforming allocators, then a hashtable
225 class hashtable { class
226 typedef hashtable<_Val, _Key, _HF, _Traits, _ExK, _EqK, _All> _Self;
262 * - limit code bloat, all hashtable instanciation use the same buckets representation
303 hashtable(size_type __n, function in class:hashtable
332 hashtable(const _Self& __ht) function in class:hashtable
342 hashtable(__move_source<_Self> src) function in class:hashtable
619 # undef hashtable macro
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/ |
| _hashtable.h | 58 * Hashtable class, used to implement the hashed associative containers
66 //Export of the classes used to represent buckets in the hashtable implementation.
94 # define hashtable _STLP_NON_DBG_NAME(hashtable) macro
101 class hashtable;
194 //Returns the maximum number of buckets handled by the hashtable implementation
216 * do. If we're using standard-conforming allocators, then a hashtable
225 class hashtable { class
226 typedef hashtable<_Val, _Key, _HF, _Traits, _ExK, _EqK, _All> _Self;
262 * - limit code bloat, all hashtable instanciation use the same buckets representation
303 hashtable(size_type __n, function in class:hashtable
332 hashtable(const _Self& __ht) function in class:hashtable
342 hashtable(__move_source<_Self> src) function in class:hashtable
619 # undef hashtable macro
[all...] |
| /dalvik/vm/ |
| Hash.cpp | 44 HashTable* dvmHashTableCreate(size_t initialSize, HashFreeFunc freeFunc)
46 HashTable* pHashTable;
50 pHashTable = (HashTable*) malloc(sizeof(*pHashTable));
72 void dvmHashTableClear(HashTable* pHashTable)
97 void dvmHashTableFree(HashTable* pHashTable)
110 static int countTombStones(HashTable* pHashTable)
132 static bool resizeHash(HashTable* pHashTable, int newSize)
174 void* dvmHashTableLookup(HashTable* pHashTable, u4 itemHash, void* item,
250 bool dvmHashTableRemove(HashTable* pHashTable, u4 itemHash, void* item)
291 int dvmHashForeachRemove(HashTable* pHashTable, HashForeachRemoveFunc func
[all...] |
| /external/javassist/src/main/javassist/ |
| ClassMap.java | 23 * <p>This hashtable is used for replacing class names in a class
58 * Maps a class name to another name in this hashtable.
62 * the hashtable.
72 * Maps a class name to another name in this hashtable.
73 * If the hashtable contains another mapping from the same
77 * the hashtable.
101 * the given mapping is not recorded into the hashtable
|
| /frameworks/compile/mclinker/include/mcld/Fragment/ |
| FragmentGraph.h | 17 #include <mcld/ADT/HashTable.h>
97 /// HashTable for Fragment* to Node*
99 typedef HashTable<FragHashEntryType,
103 /// HashTable for ResolveInfo* to Node*
105 typedef HashTable<SymHashEntryType,
157 /// m_pFragNodeMap - HashTable to map the fragment to the node it belongs to
160 /// m_pSymNodeMap - HashTable to map the ResolveInfo to the node. The node is
|
| /external/apache-xml/src/main/java/org/apache/xpath/compiler/ |
| Keywords.java | 23 import java.util.Hashtable;
33 private static Hashtable m_keywords = new Hashtable();
36 private static Hashtable m_axisnames = new Hashtable();
39 private static Hashtable m_nodetests = new Hashtable();
42 private static Hashtable m_nodetypes = new Hashtable();
|
| /external/chromium_org/base/ |
| id_map.h | 37 typedef base::hash_map<KeyType, T*> HashTable;
81 typename HashTable::iterator i = data_.find(id);
100 for (typename HashTable::iterator i = data_.begin();
113 typename HashTable::const_iterator i = data_.find(id);
202 typename HashTable::const_iterator iter_;
214 static inline void release_all(HashTable* table) {}
219 static inline void release_all(HashTable* table) {
220 for (typename HashTable::iterator i = table->begin();
249 HashTable data_;
|
| /external/apache-xml/src/main/java/org/apache/xalan/xslt/ |
| EnvironmentCheck.java | 29 import java.util.Hashtable;
169 Hashtable hash = getEnvironmentHash();
171 // Check for ERROR keys in the hashtable, and print report
212 * @return Hashtable full of useful environment info about Xalan
215 public Hashtable getEnvironmentHash()
218 Hashtable hash = new Hashtable();
238 * the Hashtable to our PrintWriter; it does special processing
241 * @param h Hashtable of items to report on; presumably
245 * @see #appendEnvironmentReport(Node, Document, Hashtable)
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x509/ |
| CRLReason.java | 4 import java.util.Hashtable;
91 private static final Hashtable table = new Hashtable();
|
| ExtendedKeyUsage.java | 4 import java.util.Hashtable;
25 Hashtable usageTable = new Hashtable();
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jcajce/provider/asymmetric/dh/ |
| KeyPairGeneratorSpi.java | 7 import java.util.Hashtable;
24 private static Hashtable params = new Hashtable();
|
