| /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();
|
| /toolchain/binutils/binutils-2.25/opcodes/ |
| m88k-dis.c | 521 HASHTAB *hashtable[HASHVAL] = {0}; variable
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-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-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...] |
| /prebuilts/ndk/r10/sources/cxx-stl/gnu-libstdc++/4.9/include/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>
158 typedef hashtable<_Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc>
250 class hashtable;
255 operator==(const hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>& __ht1,
256 const hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>& __ht2);
260 // a hashtable unconditionally has a member variable to hold it
268 class hashtable class
338 hashtable(size_type __n, const _HashFcn& __hf, function in class:hashtable
345 hashtable(size_type __n, const _HashFcn& __hf, function in class:hashtable
352 hashtable(const hashtable& __ht) function in class:hashtable
[all...] |
| /prebuilts/ndk/r10/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...] |
| _hashtable.c | 102 # define hashtable _STLP_NON_DBG_NAME(hashtable) macro
121 # define __size_type__ _STLP_TYPENAME_ON_RETURN_TYPE hashtable<_Val, _Key, _HF, _Traits, _ExK, _EqK, _All>::size_type
122 # define __reference__ _STLP_TYPENAME_ON_RETURN_TYPE hashtable<_Val, _Key, _HF, _Traits, _ExK, _EqK, _All>::reference
123 # define __iterator__ _STLP_TYPENAME_ON_RETURN_TYPE hashtable<_Val, _Key, _HF, _Traits, _ExK, _EqK, _All>::iterator
124 # define __const_iterator__ _STLP_TYPENAME_ON_RETURN_TYPE hashtable<_Val, _Key, _HF, _Traits, _ExK, _EqK, _All>::const_iterator
128 * This method is too difficult to implement for hashtable that do not
132 bool hashtable<_Val,_Key,_HF,_Traits,_ExK,_EqK,_All>::_M_equal(
133 const hashtable<_Val,_Key,_HF,_Traits,_ExK,_EqK,_All>& __ht1,
134 const hashtable<_Val,_Key,_HF,_Traits,_ExK,_EqK,_All>& __ht2)
543 # undef hashtable macro
[all...] |
| /prebuilts/ndk/r11/sources/cxx-stl/gnu-libstdc++/4.9/include/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>
158 typedef hashtable<_Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc>
250 class hashtable;
255 operator==(const hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>& __ht1,
256 const hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>& __ht2);
260 // a hashtable unconditionally has a member variable to hold it
268 class hashtable class
338 hashtable(size_type __n, const _HashFcn& __hf, function in class:hashtable
345 hashtable(size_type __n, const _HashFcn& __hf, function in class:hashtable
352 hashtable(const hashtable& __ht) function in class:hashtable
[all...] |
| /prebuilts/ndk/r11/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...] |
| _hashtable.c | 102 # define hashtable _STLP_NON_DBG_NAME(hashtable) macro
121 # define __size_type__ _STLP_TYPENAME_ON_RETURN_TYPE hashtable<_Val, _Key, _HF, _Traits, _ExK, _EqK, _All>::size_type
122 # define __reference__ _STLP_TYPENAME_ON_RETURN_TYPE hashtable<_Val, _Key, _HF, _Traits, _ExK, _EqK, _All>::reference
123 # define __iterator__ _STLP_TYPENAME_ON_RETURN_TYPE hashtable<_Val, _Key, _HF, _Traits, _ExK, _EqK, _All>::iterator
124 # define __const_iterator__ _STLP_TYPENAME_ON_RETURN_TYPE hashtable<_Val, _Key, _HF, _Traits, _ExK, _EqK, _All>::const_iterator
128 * This method is too difficult to implement for hashtable that do not
132 bool hashtable<_Val,_Key,_HF,_Traits,_ExK,_EqK,_All>::_M_equal(
133 const hashtable<_Val,_Key,_HF,_Traits,_ExK,_EqK,_All>& __ht1,
134 const hashtable<_Val,_Key,_HF,_Traits,_ExK,_EqK,_All>& __ht2)
543 # undef hashtable macro
[all...] |
| /prebuilts/ndk/r13/sources/cxx-stl/gnu-libstdc++/4.9/include/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>
158 typedef hashtable<_Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc>
250 class hashtable;
255 operator==(const hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>& __ht1,
256 const hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>& __ht2);
260 // a hashtable unconditionally has a member variable to hold it
268 class hashtable class
338 hashtable(size_type __n, const _HashFcn& __hf, function in class:hashtable
345 hashtable(size_type __n, const _HashFcn& __hf, function in class:hashtable
352 hashtable(const hashtable& __ht) function in class:hashtable
[all...] |
| /prebuilts/ndk/r13/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...] |
| _hashtable.c | 102 # define hashtable _STLP_NON_DBG_NAME(hashtable) macro
121 # define __size_type__ _STLP_TYPENAME_ON_RETURN_TYPE hashtable<_Val, _Key, _HF, _Traits, _ExK, _EqK, _All>::size_type
122 # define __reference__ _STLP_TYPENAME_ON_RETURN_TYPE hashtable<_Val, _Key, _HF, _Traits, _ExK, _EqK, _All>::reference
123 # define __iterator__ _STLP_TYPENAME_ON_RETURN_TYPE hashtable<_Val, _Key, _HF, _Traits, _ExK, _EqK, _All>::iterator
124 # define __const_iterator__ _STLP_TYPENAME_ON_RETURN_TYPE hashtable<_Val, _Key, _HF, _Traits, _ExK, _EqK, _All>::const_iterator
128 * This method is too difficult to implement for hashtable that do not
132 bool hashtable<_Val,_Key,_HF,_Traits,_ExK,_EqK,_All>::_M_equal(
133 const hashtable<_Val,_Key,_HF,_Traits,_ExK,_EqK,_All>& __ht1,
134 const hashtable<_Val,_Key,_HF,_Traits,_ExK,_EqK,_All>& __ht2)
543 # undef hashtable macro
[all...] |
| /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/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.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.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/ndk/r10/sources/cxx-stl/stlport/stlport/stl/debug/ |
| _hashtable.h | 33 // Hashtable class, used to implement the hashed associative containers
73 _STLP_PRIV _STLP_NON_DBG_NAME(hashtable) <_Val, _Key, _HF, _Traits, _ExK, _STLP_PRIV _DbgEqual<_Key, _EqK>, _All>
91 class hashtable { class
92 typedef hashtable<_Val, _Key, _HF, _Traits, _ExK, _EqK, _All> _Self;
134 hashtable(size_type __n, function in class:hashtable
142 hashtable(size_type __n, function in class:hashtable
149 hashtable(const _Self& __ht) function in class:hashtable
154 hashtable(__move_source<_Self> src) function in class:hashtable
|
| /prebuilts/ndk/r11/sources/cxx-stl/stlport/stlport/stl/debug/ |
| _hashtable.h | 33 // Hashtable class, used to implement the hashed associative containers
73 _STLP_PRIV _STLP_NON_DBG_NAME(hashtable) <_Val, _Key, _HF, _Traits, _ExK, _STLP_PRIV _DbgEqual<_Key, _EqK>, _All>
91 class hashtable { class
92 typedef hashtable<_Val, _Key, _HF, _Traits, _ExK, _EqK, _All> _Self;
134 hashtable(size_type __n, function in class:hashtable
142 hashtable(size_type __n, function in class:hashtable
149 hashtable(const _Self& __ht) function in class:hashtable
154 hashtable(__move_source<_Self> src) function in class:hashtable
|
| /prebuilts/ndk/r13/sources/cxx-stl/stlport/stlport/stl/debug/ |
| _hashtable.h | 33 // Hashtable class, used to implement the hashed associative containers
73 _STLP_PRIV _STLP_NON_DBG_NAME(hashtable) <_Val, _Key, _HF, _Traits, _ExK, _STLP_PRIV _DbgEqual<_Key, _EqK>, _All>
91 class hashtable { class
92 typedef hashtable<_Val, _Key, _HF, _Traits, _ExK, _EqK, _All> _Self;
134 hashtable(size_type __n, function in class:hashtable
142 hashtable(size_type __n, function in class:hashtable
149 hashtable(const _Self& __ht) function in class:hashtable
154 hashtable(__move_source<_Self> src) function in class:hashtable
|
| /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.25/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
|
