Searched refs:hash_map (Results 1 - 25 of 88) sorted by relevance

1234

/haiku-buildtools/gcc/libstdc++-v3/testsuite/backward/hash_map/requirements/
H A Dexplicit_instantiation.cc24 #include <hash_map>
26 template class __gnu_cxx::hash_map<int, char>; member in class:__gnu_cxx
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/unordered_map/profile/
H A Dhash_map.cc4 #include <ext/hash_map>
6 using __gnu_cxx::hash_map;
10 hash_map <int, int> *tmp;
14 tmp = new hash_map<int, int>;
/haiku-buildtools/gcc/libstdc++-v3/testsuite/backward/hash_map/
H A D23528.cc21 #include <hash_map>
26 __gnu_cxx::hash_map<int, int> m;
29 __gnu_cxx::hash_map<int, int>::allocator_type a = m.get_allocator();
31 __gnu_cxx::hash_map<int, int>::value_type *y = a.allocate(1);
H A D14648.cc21 #include <hash_map>
29 typedef hash_map<char, crope, hash<char>, std::equal_to<char> > maptype;
H A D1.cc20 // hash_map (SGI extension)
24 #include <hash_map>
74 using __gnu_cxx::hash_map;
78 hash_map<string, int> a;
79 hash_map<string, int> b;
H A D25896.cc21 // hash_map instead of unordered_map.
23 #include <hash_map>
61 typedef __gnu_cxx::hash_map<std::string, int> Map;
/haiku-buildtools/legacy/gcc/libstdc++/stl/
H A Dhash_map.h40 using __STD::hash_map;
H A Dstl_hash_map.h50 class hash_map class
82 hash_map() : _M_ht(100, hasher(), key_equal(), allocator_type()) {} function in class:hash_map
83 explicit hash_map(size_type __n) function in class:hash_map
85 hash_map(size_type __n, const hasher& __hf) function in class:hash_map
87 hash_map(size_type __n, const hasher& __hf, const key_equal& __eql, function in class:hash_map
93 hash_map(_InputIterator __f, _InputIterator __l) function in class:hash_map
97 hash_map(_InputIterator __f, _InputIterator __l, size_type __n) function in class:hash_map
101 hash_map(_InputIterator __f, _InputIterator __l, size_type __n, function in class:hash_map
106 hash_map(_InputIterator __f, _InputIterator __l, size_type __n, function in class:hash_map
113 hash_map(cons function in class:hash_map
116 hash_map(const value_type* __f, const value_type* __l, size_type __n) function in class:hash_map
119 hash_map(const value_type* __f, const value_type* __l, size_type __n, function in class:hash_map
123 hash_map(const value_type* __f, const value_type* __l, size_type __n, function in class:hash_map
129 hash_map(const_iterator __f, const_iterator __l) function in class:hash_map
132 hash_map(const_iterator __f, const_iterator __l, size_type __n) function in class:hash_map
135 hash_map(const_iterator __f, const_iterator __l, size_type __n, function in class:hash_map
139 hash_map(const_iterator __f, const_iterator __l, size_type __n, function in class:hash_map
206 operator ==(const hash_map<_Key,_Tp,_HashFcn,_EqlKey,_Alloc>& __hm1, const hash_map<_Key,_Tp,_HashFcn,_EqlKey,_Alloc>& __hm2) argument
[all...]
/haiku-buildtools/gcc/gcc/
H A Dtree-affine.h82 void aff_combination_expand (aff_tree *, hash_map<tree, name_expansion *> **);
84 hash_map<tree, name_expansion *> **);
86 void free_affine_expand_cache (hash_map<tree, name_expansion *> **);
H A Dhash-map.h108 class GTY((user)) hash_map
191 explicit hash_map (size_t n = 13, bool ggc = false) : m_table (n, ggc) {} function
193 /* Create a hash_map in ggc memory. */
194 static hash_map *create_ggc (size_t size)
196 hash_map *map = ggc_alloc<hash_map> ();
197 new (map) hash_map (size, true);
305 template<typename T, typename U, typename V> friend void gt_ggc_mx (hash_map<T, U, V> *);
306 template<typename T, typename U, typename V> friend void gt_pch_nx (hash_map<T, U, V> *);
307 template<typename T, typename U, typename V> friend void gt_pch_nx (hash_map<
[all...]
H A Dipa-icf.h176 hash_map <symtab_node *, sem_item *> &ignored_nodes) = 0;
180 hash_map <symtab_node *, sem_item *> &ignored_nodes) = 0;
193 void update_hash_by_addr_refs (hash_map <symtab_node *,
198 void update_hash_by_local_refs (hash_map <symtab_node *,
254 bool compare_cgraph_references (hash_map <symtab_node *, sem_item *>
283 hash_map <symtab_node *, sem_item *> &ignored_nodes);
286 hash_map <symtab_node *, sem_item *> &ignored_nodes);
362 hash_map <symtab_node *, sem_item *> &ignored_nodes);
397 hash_map <symtab_node *, sem_item *> &ignored_nodes);
401 hash_map <symtab_nod
[all...]
H A Dtree-inline.h94 hash_map<tree, tree> *decl_map;
111 hash_map<void *, void *> *eh_map;
162 hash_map<tree, tree> *debug_map;
170 hash_map<unsigned short, unsigned short, dependence_hasher> *dependence_map;
H A Dexcept.h206 hash_map<gimple, int> *GTY(()) throw_stmt_table;
251 extern hash_map<void *, void *> *duplicate_eh_regions
293 extern hash_map<gimple, int> *get_eh_throw_stmt_table (struct function *);
294 extern void set_eh_throw_stmt_table (function *, hash_map<gimple, int> *);
H A Dtree-eh.h50 hash_map<void *, void *> *, int);
H A Dipa-icf-gimple.h263 hash_map <edge, edge> m_edge_map;
266 hash_map <tree, tree> m_decl_map;
269 hash_map <tree, int> m_label_bb_map;
H A Dtree-streamer.h51 hash_map<tree, unsigned> *node_map;
H A Dipa-comdats.c83 tree newgroup, hash_map<symtab_node *, tree> &map)
251 hash_map<symtab_node *, tree> map (251);
252 hash_map<tree, symtab_node *> comdat_head_map (251);
H A Dgimple-ssa.h90 hash_map<tree, tree> * GTY((skip(""))) decls_to_pointers;
H A Dalloc-pool.c87 static hash_map<const char *, alloc_pool_descriptor> *alloc_pool_hash;
94 alloc_pool_hash = new hash_map<const char *, alloc_pool_descriptor> (10);
348 /* Called via hash_map.traverse. Output alloc_pool descriptor pointed out by
H A Drtl-chkp.c66 static hash_map<tree, rtx> *chkp_rtx_bounds_map;
87 chkp_rtx_bounds_map = new hash_map<tree, rtx>;
H A Dsymbol-summary.h86 typedef typename hash_map <int, T *, summary_hashmap_traits>::iterator map_iterator;
255 hash_map <int, T *, summary_hashmap_traits> m_map;
H A Dlto-streamer.h478 hash_map<symtab_node *, size_t> *map;
496 hash_map<tree, unsigned> *tree_hash_table; /* Maps pointers to indices. */
598 hash_map<tree, ld_plugin_symbol_resolution> * GTY((skip)) resolution_map;
1034 encoder->tree_hash_table = new hash_map<tree, unsigned> (251);
/haiku-buildtools/gcc/gcc/go/
H A Dgo-system.h70 # include <ext/hash_map>
74 __gnu_cxx::hash_map<KEYTYPE, VALTYPE>
77 __gnu_cxx::hash_map<KEYTYPE, VALTYPE, HASHFN, EQFN>
/haiku-buildtools/binutils/gold/
H A Dsystem.h105 #include <ext/hash_map>
110 #define Unordered_map __gnu_cxx::hash_map
/haiku-buildtools/jam/
H A DStatCacheServerImpl.h6 #include <hash_map>
254 typedef hash_map<entry_ref, Entry*, EntryRefHash> EntryMap;
255 typedef hash_map<node_ref, Node*, NodeRefHash> NodeMap;

Completed in 227 milliseconds

1234