| /external/clang/test/SemaCXX/ |
| libstdcxx_pointer_return_false_hack.cpp | 4 // an issue with libstdc++-4.2's <tr1/hashtable> implementation.
14 template<typename T> struct hashtable { struct in namespace:std::tr1
30 auto *test1 = std::tr1::hashtable<int>().find_node();
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/backward/ |
| hashtable.h | 0 // Hashtable implementation used by containers -*- C++ -*-
51 /** @file backward/hashtable.h
59 // Hashtable class, used to implement the hashed associative containers
92 class hashtable;
106 typedef hashtable<_Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc>
157 typedef hashtable<_Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc>
249 class hashtable;
254 operator==(const hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>& __ht1,
255 const hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>& __ht2);
259 // a hashtable unconditionally has a member variable to hold it
267 class hashtable class
337 hashtable(size_type __n, const _HashFcn& __hf, function in class:hashtable
344 hashtable(size_type __n, const _HashFcn& __hf, function in class:hashtable
351 hashtable(const hashtable& __ht) function in class:hashtable
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/backward/ |
| hashtable.h | 0 // Hashtable implementation used by containers -*- C++ -*-
51 /** @file backward/hashtable.h
59 // Hashtable class, used to implement the hashed associative containers
92 class hashtable;
106 typedef hashtable<_Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc>
157 typedef hashtable<_Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc>
249 class hashtable;
254 operator==(const hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>& __ht1,
255 const hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>& __ht2);
259 // a hashtable unconditionally has a member variable to hold it
267 class hashtable class
337 hashtable(size_type __n, const _HashFcn& __hf, function in class:hashtable
344 hashtable(size_type __n, const _HashFcn& __hf, function in class:hashtable
351 hashtable(const hashtable& __ht) function in class:hashtable
[all...] |
| /toolchain/binutils/binutils-2.27/gas/ |
| hash.c | 429 char *hashtable[TABLES];
468 for (pp = hashtable; pp < hashtable + TABLES; pp++)
471 pp - hashtable, *pp);
487 printf ("? display all hashtable control block addresses\n");
489 printf ("d die: destroy hashtable\n");
494 printf ("n new hashtable\n");
516 h = hashtable[number] = (char *) hash_new ();
582 h = hashtable[number];
428 char *hashtable[TABLES]; variable
|
| /external/libnl/lib/ |
| cache.c | 56 #include <netlink/hashtable.h>
209 cache->hashtable = nl_hash_table_alloc(hashtable_size);
380 if (cache->hashtable)
381 nl_hash_table_free(cache->hashtable);
440 if (cache->hashtable) {
441 ret = nl_hash_table_add(cache->hashtable, obj);
559 if (cache->hashtable) {
560 ret = nl_hash_table_del(cache->hashtable, obj);
1009 obj = nl_hash_table_lookup(cache->hashtable, needle);
1038 if (cache->hashtable)
[all...] |
| hashtable.c | 2 * netlink/hashtable.c Netlink hashtable Utilities
15 #include <netlink/hashtable.h>
19 * @defgroup hashtable Hashtable
24 * Allocate hashtable
25 * @arg size Size of hashtable in number of elements
27 * @return Allocated hashtable or NULL.
51 * Free hashtable including all nodes
52 * @arg ht Hashtable
[all...] |
| /prebuilts/misc/common/swig/include/2.0.11/tcl/ |
| tclinit.swg | 81 Tcl_InitHashTable(&(klass->hashtable), TCL_STRING_KEYS);
84 Tcl_HashEntry* hashentry = Tcl_CreateHashEntry(&(klass->hashtable), meth->name, &newEntry);
|
| tclapi.swg | 52 Tcl_HashTable hashtable;
|
| /external/opencv/cxcore/src/ |
| cxcopy.cpp | 317 CV_CALL( cvFree( &dst1->hashtable ));
319 CV_CALL( dst1->hashtable =
320 (void**)cvAlloc( dst1->hashsize*sizeof(dst1->hashtable[0])));
323 memset( dst1->hashtable, 0, dst1->hashsize*sizeof(dst1->hashtable[0]));
331 node_copy->next = (CvSparseNode*)dst1->hashtable[tabidx];
332 dst1->hashtable[tabidx] = node_copy;
714 if( mat1->hashtable )
715 memset( mat1->hashtable, 0, mat1->hashsize*sizeof(mat1->hashtable[0]))
[all...] |
| cxarray.cpp | 684 size = arr->hashsize*sizeof(arr->hashtable[0]);
686 CV_CALL( arr->hashtable = (void**)cvAlloc( size ));
687 memset( arr->hashtable, 0, size );
719 cvFree( &arr->hashtable );
773 if( mat->hashtable[idx] )
775 node = iterator->node = (CvSparseNode*)mat->hashtable[idx];
821 for( node = (CvSparseNode*)mat->hashtable[tabidx];
863 cvFree( &mat->hashtable );
864 mat->hashtable = newtable;
871 node->next = (CvSparseNode*)mat->hashtable[tabidx]
[all...] |
| /external/clang/test/CodeGenCXX/ |
| debug-info-use-after-free.cpp | 191 hashtable { class in namespace:__gnu_cxx
207 hashtable <
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
| HashtableTest.java | 28 import java.util.Hashtable;
38 private Hashtable ht10;
40 private Hashtable ht100;
42 private Hashtable htfull;
51 * java.util.Hashtable#Hashtable()
54 // Test for method java.util.Hashtable()
55 new Support_MapTest2(new Hashtable()).runTest();
57 Hashtable h = new Hashtable();
777 Hashtable<String, String> hashtable = new Hashtable<String, String>(); local
[all...] |
| /external/python/cpython3/Python/ |
| marshal.c | 15 #include "../Modules/hashtable.h"
72 _Py_hashtable_t *hashtable; member in struct:__anon33605
259 if (p->version < 3 || p->hashtable == NULL)
266 entry = _Py_HASHTABLE_GET_ENTRY(p->hashtable, v);
269 _Py_HASHTABLE_ENTRY_READ_DATA(p->hashtable, entry, w);
276 size_t s = p->hashtable->entries;
284 if (_Py_HASHTABLE_SET(p->hashtable, v, w) < 0) {
574 wf->hashtable = _Py_hashtable_new(sizeof(PyObject *), sizeof(int),
577 if (wf->hashtable == NULL) {
599 if (wf->hashtable != NULL)
[all...] |
| /prebuilts/gdb/darwin-x86/share/pretty-printers/libstdcxx/gcc-4.9/ |
| printers.py | 741 def hashtable (self): member in class:Tr1UnorderedSetPrinter
747 return '%s with %d elements' % (self.typename, self.hashtable()['_M_element_count'])
756 return izip (counter, Tr1HashtableIterator (self.hashtable()))
757 return izip (counter, StdHashtableIterator (self.hashtable()))
766 def hashtable (self): member in class:Tr1UnorderedMapPrinter
772 return '%s with %d elements' % (self.typename, self.hashtable()['_M_element_count'])
792 data = self.flatten (imap (self.format_one, Tr1HashtableIterator (self.hashtable())))
795 data = self.flatten (imap (self.format_one, StdHashtableIterator (self.hashtable())))
[all...] |
| /prebuilts/gdb/linux-x86/share/pretty-printers/libstdcxx/gcc-4.9/ |
| printers.py | 741 def hashtable (self): member in class:Tr1UnorderedSetPrinter
747 return '%s with %d elements' % (self.typename, self.hashtable()['_M_element_count'])
756 return izip (counter, Tr1HashtableIterator (self.hashtable()))
757 return izip (counter, StdHashtableIterator (self.hashtable()))
766 def hashtable (self): member in class:Tr1UnorderedMapPrinter
772 return '%s with %d elements' % (self.typename, self.hashtable()['_M_element_count'])
792 data = self.flatten (imap (self.format_one, Tr1HashtableIterator (self.hashtable())))
795 data = self.flatten (imap (self.format_one, StdHashtableIterator (self.hashtable())))
[all...] |
| /external/mesa3d/src/gallium/drivers/r600/sb/ |
| sb_valtable.cpp | 142 vt_item & vti = hashtable[hash & size_mask];
209 for(vt_table::iterator I = hashtable.begin(), E = hashtable.end();
|
| sb_ir.h | 641 vt_table hashtable; member in class:r600_sb::value_table
649 size_mask(size - 1), hashtable(size), cnt() {}
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/share/gcc-4.8.3/python/libstdcxx/v6/ |
| printers.py | 645 def hashtable (self): member in class:Tr1UnorderedSetPrinter
651 return '%s with %d elements' % (self.typename, self.hashtable()['_M_element_count'])
659 return itertools.izip (counter, Tr1HashtableIterator (self.hashtable()))
668 def hashtable (self): member in class:Tr1UnorderedMapPrinter
674 return '%s with %d elements' % (self.typename, self.hashtable()['_M_element_count'])
693 data = self.flatten (itertools.imap (self.format_one, Tr1HashtableIterator (self.hashtable())))
[all...] |
| /prebuilts/gdb/darwin-x86/share/pretty-printers/libstdcxx/gcc-4.8.3/ |
| printers.py | 645 def hashtable (self): member in class:Tr1UnorderedSetPrinter
651 return '%s with %d elements' % (self.typename, self.hashtable()['_M_element_count'])
659 return itertools.izip (counter, Tr1HashtableIterator (self.hashtable()))
668 def hashtable (self): member in class:Tr1UnorderedMapPrinter
674 return '%s with %d elements' % (self.typename, self.hashtable()['_M_element_count'])
693 data = self.flatten (itertools.imap (self.format_one, Tr1HashtableIterator (self.hashtable())))
[all...] |
| /prebuilts/gdb/linux-x86/share/pretty-printers/libstdcxx/gcc-4.8.3/ |
| printers.py | 645 def hashtable (self): member in class:Tr1UnorderedSetPrinter
651 return '%s with %d elements' % (self.typename, self.hashtable()['_M_element_count'])
659 return itertools.izip (counter, Tr1HashtableIterator (self.hashtable()))
668 def hashtable (self): member in class:Tr1UnorderedMapPrinter
674 return '%s with %d elements' % (self.typename, self.hashtable()['_M_element_count'])
693 data = self.flatten (itertools.imap (self.format_one, Tr1HashtableIterator (self.hashtable())))
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/share/pretty-printers/libstdcxx/gcc-4.8/ |
| printers.py | 645 def hashtable (self): member in class:Tr1UnorderedSetPrinter
651 return '%s with %d elements' % (self.typename, self.hashtable()['_M_element_count'])
659 return itertools.izip (counter, Tr1HashtableIterator (self.hashtable()))
668 def hashtable (self): member in class:Tr1UnorderedMapPrinter
674 return '%s with %d elements' % (self.typename, self.hashtable()['_M_element_count'])
693 data = self.flatten (itertools.imap (self.format_one, Tr1HashtableIterator (self.hashtable())))
[all...] |
| /prebuilts/python/linux-x86/2.7.5/share/pretty-printers/libstdcxx/gcc-4.8/ |
| printers.py | 645 def hashtable (self): member in class:Tr1UnorderedSetPrinter
651 return '%s with %d elements' % (self.typename, self.hashtable()['_M_element_count'])
659 return itertools.izip (counter, Tr1HashtableIterator (self.hashtable()))
668 def hashtable (self): member in class:Tr1UnorderedMapPrinter
674 return '%s with %d elements' % (self.typename, self.hashtable()['_M_element_count'])
693 data = self.flatten (itertools.imap (self.format_one, Tr1HashtableIterator (self.hashtable())))
[all...] |
| /toolchain/binutils/binutils-2.27/opcodes/ |
| m88k-dis.c | 521 HASHTAB *hashtable[HASHVAL] = {0}; variable
[all...] |
| /toolchain/binutils/binutils-2.27/bfd/ |
| ecoff.c | 3052 bfd_byte *hashtable; local
3571 const bfd_byte *hashtable; local
[all...] |
| /external/libnl/lib/route/ |
| neigh.c | 154 #include <netlink/hashtable.h>
158 #include <netlink/hashtable.h>
|
