#if defined(__sgi) && !defined(__GNUC__) && (_MIPS_SIM != _MIPS_SIM_ABI32)
#pragma set woff 1174
+#pragma set woff 1375
#endif
#ifndef __STL_LIMITED_DEFAULT_TEMPLATES
-template <class Key, class T, class HashFcn = hash<Key>,
- class EqualKey = equal_to<Key>,
- class Alloc = alloc>
+template <class _Key, class _Tp, class _HashFcn = hash<_Key>,
+ class _EqualKey = equal_to<_Key>,
+ class _Alloc = __STL_DEFAULT_ALLOCATOR(_Tp) >
#else
-template <class Key, class T, class HashFcn, class EqualKey,
- class Alloc = alloc>
+template <class _Key, class _Tp, class _HashFcn, class _EqualKey,
+ class _Alloc = __STL_DEFAULT_ALLOCATOR(_Tp) >
#endif
class hash_map
{
private:
- typedef hashtable<pair<const Key, T>, Key, HashFcn,
- select1st<pair<const Key, T> >, EqualKey, Alloc> ht;
- ht rep;
+ typedef hashtable<pair<const _Key,_Tp>,_Key,_HashFcn,
+ _Select1st<pair<const _Key,_Tp> >,_EqualKey,_Alloc> _Ht;
+ _Ht _M_ht;
public:
- typedef typename ht::key_type key_type;
- typedef T data_type;
- typedef T mapped_type;
- typedef typename ht::value_type value_type;
- typedef typename ht::hasher hasher;
- typedef typename ht::key_equal key_equal;
-
- typedef typename ht::size_type size_type;
- typedef typename ht::difference_type difference_type;
- typedef typename ht::pointer pointer;
- typedef typename ht::const_pointer const_pointer;
- typedef typename ht::reference reference;
- typedef typename ht::const_reference const_reference;
-
- typedef typename ht::iterator iterator;
- typedef typename ht::const_iterator const_iterator;
-
- hasher hash_funct() const { return rep.hash_funct(); }
- key_equal key_eq() const { return rep.key_eq(); }
+ typedef typename _Ht::key_type key_type;
+ typedef _Tp data_type;
+ typedef _Tp mapped_type;
+ typedef typename _Ht::value_type value_type;
+ typedef typename _Ht::hasher hasher;
+ typedef typename _Ht::key_equal key_equal;
+
+ typedef typename _Ht::size_type size_type;
+ typedef typename _Ht::difference_type difference_type;
+ typedef typename _Ht::pointer pointer;
+ typedef typename _Ht::const_pointer const_pointer;
+ typedef typename _Ht::reference reference;
+ typedef typename _Ht::const_reference const_reference;
+
+ typedef typename _Ht::iterator iterator;
+ typedef typename _Ht::const_iterator const_iterator;
+
+ typedef typename _Ht::allocator_type allocator_type;
+
+ hasher hash_funct() const { return _M_ht.hash_funct(); }
+ key_equal key_eq() const { return _M_ht.key_eq(); }
+ allocator_type get_allocator() const { return _M_ht.get_allocator(); }
public:
- hash_map() : rep(100, hasher(), key_equal()) {}
- explicit hash_map(size_type n) : rep(n, hasher(), key_equal()) {}
- hash_map(size_type n, const hasher& hf) : rep(n, hf, key_equal()) {}
- hash_map(size_type n, const hasher& hf, const key_equal& eql)
- : rep(n, hf, eql) {}
+ hash_map() : _M_ht(100, hasher(), key_equal(), allocator_type()) {}
+ explicit hash_map(size_type __n)
+ : _M_ht(__n, hasher(), key_equal(), allocator_type()) {}
+ hash_map(size_type __n, const hasher& __hf)
+ : _M_ht(__n, __hf, key_equal(), allocator_type()) {}
+ hash_map(size_type __n, const hasher& __hf, const key_equal& __eql,
+ const allocator_type& __a = allocator_type())
+ : _M_ht(__n, __hf, __eql, __a) {}
#ifdef __STL_MEMBER_TEMPLATES
- template <class InputIterator>
- hash_map(InputIterator f, InputIterator l)
- : rep(100, hasher(), key_equal()) { rep.insert_unique(f, l); }
- template <class InputIterator>
- hash_map(InputIterator f, InputIterator l, size_type n)
- : rep(n, hasher(), key_equal()) { rep.insert_unique(f, l); }
- template <class InputIterator>
- hash_map(InputIterator f, InputIterator l, size_type n,
- const hasher& hf)
- : rep(n, hf, key_equal()) { rep.insert_unique(f, l); }
- template <class InputIterator>
- hash_map(InputIterator f, InputIterator l, size_type n,
- const hasher& hf, const key_equal& eql)
- : rep(n, hf, eql) { rep.insert_unique(f, l); }
+ template <class _InputIterator>
+ hash_map(_InputIterator __f, _InputIterator __l)
+ : _M_ht(100, hasher(), key_equal(), allocator_type())
+ { _M_ht.insert_unique(__f, __l); }
+ template <class _InputIterator>
+ hash_map(_InputIterator __f, _InputIterator __l, size_type __n)
+ : _M_ht(__n, hasher(), key_equal(), allocator_type())
+ { _M_ht.insert_unique(__f, __l); }
+ template <class _InputIterator>
+ hash_map(_InputIterator __f, _InputIterator __l, size_type __n,
+ const hasher& __hf)
+ : _M_ht(__n, __hf, key_equal(), allocator_type())
+ { _M_ht.insert_unique(__f, __l); }
+ template <class _InputIterator>
+ hash_map(_InputIterator __f, _InputIterator __l, size_type __n,
+ const hasher& __hf, const key_equal& __eql,
+ const allocator_type& __a = allocator_type())
+ : _M_ht(__n, __hf, __eql, __a)
+ { _M_ht.insert_unique(__f, __l); }
#else
- hash_map(const value_type* f, const value_type* l)
- : rep(100, hasher(), key_equal()) { rep.insert_unique(f, l); }
- hash_map(const value_type* f, const value_type* l, size_type n)
- : rep(n, hasher(), key_equal()) { rep.insert_unique(f, l); }
- hash_map(const value_type* f, const value_type* l, size_type n,
- const hasher& hf)
- : rep(n, hf, key_equal()) { rep.insert_unique(f, l); }
- hash_map(const value_type* f, const value_type* l, size_type n,
- const hasher& hf, const key_equal& eql)
- : rep(n, hf, eql) { rep.insert_unique(f, l); }
-
- hash_map(const_iterator f, const_iterator l)
- : rep(100, hasher(), key_equal()) { rep.insert_unique(f, l); }
- hash_map(const_iterator f, const_iterator l, size_type n)
- : rep(n, hasher(), key_equal()) { rep.insert_unique(f, l); }
- hash_map(const_iterator f, const_iterator l, size_type n,
- const hasher& hf)
- : rep(n, hf, key_equal()) { rep.insert_unique(f, l); }
- hash_map(const_iterator f, const_iterator l, size_type n,
- const hasher& hf, const key_equal& eql)
- : rep(n, hf, eql) { rep.insert_unique(f, l); }
+ hash_map(const value_type* __f, const value_type* __l)
+ : _M_ht(100, hasher(), key_equal(), allocator_type())
+ { _M_ht.insert_unique(__f, __l); }
+ hash_map(const value_type* __f, const value_type* __l, size_type __n)
+ : _M_ht(__n, hasher(), key_equal(), allocator_type())
+ { _M_ht.insert_unique(__f, __l); }
+ hash_map(const value_type* __f, const value_type* __l, size_type __n,
+ const hasher& __hf)
+ : _M_ht(__n, __hf, key_equal(), allocator_type())
+ { _M_ht.insert_unique(__f, __l); }
+ hash_map(const value_type* __f, const value_type* __l, size_type __n,
+ const hasher& __hf, const key_equal& __eql,
+ const allocator_type& __a = allocator_type())
+ : _M_ht(__n, __hf, __eql, __a)
+ { _M_ht.insert_unique(__f, __l); }
+
+ hash_map(const_iterator __f, const_iterator __l)
+ : _M_ht(100, hasher(), key_equal(), allocator_type())
+ { _M_ht.insert_unique(__f, __l); }
+ hash_map(const_iterator __f, const_iterator __l, size_type __n)
+ : _M_ht(__n, hasher(), key_equal(), allocator_type())
+ { _M_ht.insert_unique(__f, __l); }
+ hash_map(const_iterator __f, const_iterator __l, size_type __n,
+ const hasher& __hf)
+ : _M_ht(__n, __hf, key_equal(), allocator_type())
+ { _M_ht.insert_unique(__f, __l); }
+ hash_map(const_iterator __f, const_iterator __l, size_type __n,
+ const hasher& __hf, const key_equal& __eql,
+ const allocator_type& __a = allocator_type())
+ : _M_ht(__n, __hf, __eql, __a)
+ { _M_ht.insert_unique(__f, __l); }
#endif /*__STL_MEMBER_TEMPLATES */
public:
- size_type size() const { return rep.size(); }
- size_type max_size() const { return rep.max_size(); }
- bool empty() const { return rep.empty(); }
- void swap(hash_map& hs) { rep.swap(hs.rep); }
+ size_type size() const { return _M_ht.size(); }
+ size_type max_size() const { return _M_ht.max_size(); }
+ bool empty() const { return _M_ht.empty(); }
+ void swap(hash_map& __hs) { _M_ht.swap(__hs._M_ht); }
friend bool
operator== __STL_NULL_TMPL_ARGS (const hash_map&, const hash_map&);
- iterator begin() { return rep.begin(); }
- iterator end() { return rep.end(); }
- const_iterator begin() const { return rep.begin(); }
- const_iterator end() const { return rep.end(); }
+ iterator begin() { return _M_ht.begin(); }
+ iterator end() { return _M_ht.end(); }
+ const_iterator begin() const { return _M_ht.begin(); }
+ const_iterator end() const { return _M_ht.end(); }
public:
- pair<iterator, bool> insert(const value_type& obj)
- { return rep.insert_unique(obj); }
+ pair<iterator,bool> insert(const value_type& __obj)
+ { return _M_ht.insert_unique(__obj); }
#ifdef __STL_MEMBER_TEMPLATES
- template <class InputIterator>
- void insert(InputIterator f, InputIterator l) { rep.insert_unique(f,l); }
+ template <class _InputIterator>
+ void insert(_InputIterator __f, _InputIterator __l)
+ { _M_ht.insert_unique(__f,__l); }
#else
- void insert(const value_type* f, const value_type* l) {
- rep.insert_unique(f,l);
+ void insert(const value_type* __f, const value_type* __l) {
+ _M_ht.insert_unique(__f,__l);
}
- void insert(const_iterator f, const_iterator l) { rep.insert_unique(f, l); }
+ void insert(const_iterator __f, const_iterator __l)
+ { _M_ht.insert_unique(__f, __l); }
#endif /*__STL_MEMBER_TEMPLATES */
- pair<iterator, bool> insert_noresize(const value_type& obj)
- { return rep.insert_unique_noresize(obj); }
+ pair<iterator,bool> insert_noresize(const value_type& __obj)
+ { return _M_ht.insert_unique_noresize(__obj); }
- iterator find(const key_type& key) { return rep.find(key); }
- const_iterator find(const key_type& key) const { return rep.find(key); }
+ iterator find(const key_type& __key) { return _M_ht.find(__key); }
+ const_iterator find(const key_type& __key) const
+ { return _M_ht.find(__key); }
- T& operator[](const key_type& key) {
- return rep.find_or_insert(value_type(key, T())).second;
+ _Tp& operator[](const key_type& __key) {
+ return _M_ht.find_or_insert(value_type(__key, _Tp())).second;
}
- size_type count(const key_type& key) const { return rep.count(key); }
+ size_type count(const key_type& __key) const { return _M_ht.count(__key); }
- pair<iterator, iterator> equal_range(const key_type& key)
- { return rep.equal_range(key); }
- pair<const_iterator, const_iterator> equal_range(const key_type& key) const
- { return rep.equal_range(key); }
-
- size_type erase(const key_type& key) {return rep.erase(key); }
- void erase(iterator it) { rep.erase(it); }
- void erase(iterator f, iterator l) { rep.erase(f, l); }
- void clear() { rep.clear(); }
-
-public:
- void resize(size_type hint) { rep.resize(hint); }
- size_type bucket_count() const { return rep.bucket_count(); }
- size_type max_bucket_count() const { return rep.max_bucket_count(); }
- size_type elems_in_bucket(size_type n) const
- { return rep.elems_in_bucket(n); }
+ pair<iterator, iterator> equal_range(const key_type& __key)
+ { return _M_ht.equal_range(__key); }
+ pair<const_iterator, const_iterator>
+ equal_range(const key_type& __key) const
+ { return _M_ht.equal_range(__key); }
+
+ size_type erase(const key_type& __key) {return _M_ht.erase(__key); }
+ void erase(iterator __it) { _M_ht.erase(__it); }
+ void erase(iterator __f, iterator __l) { _M_ht.erase(__f, __l); }
+ void clear() { _M_ht.clear(); }
+
+ void resize(size_type __hint) { _M_ht.resize(__hint); }
+ size_type bucket_count() const { return _M_ht.bucket_count(); }
+ size_type max_bucket_count() const { return _M_ht.max_bucket_count(); }
+ size_type elems_in_bucket(size_type __n) const
+ { return _M_ht.elems_in_bucket(__n); }
};
-template <class Key, class T, class HashFcn, class EqualKey, class Alloc>
-inline bool operator==(const hash_map<Key, T, HashFcn, EqualKey, Alloc>& hm1,
- const hash_map<Key, T, HashFcn, EqualKey, Alloc>& hm2)
+template <class _Key, class _Tp, class _HashFcn, class _EqlKey, class _Alloc>
+inline bool
+operator==(const hash_map<_Key,_Tp,_HashFcn,_EqlKey,_Alloc>& __hm1,
+ const hash_map<_Key,_Tp,_HashFcn,_EqlKey,_Alloc>& __hm2)
{
- return hm1.rep == hm2.rep;
+ return __hm1._M_ht == __hm2._M_ht;
}
#ifdef __STL_FUNCTION_TMPL_PARTIAL_ORDER
-template <class Key, class T, class HashFcn, class EqualKey, class Alloc>
-inline void swap(hash_map<Key, T, HashFcn, EqualKey, Alloc>& hm1,
- hash_map<Key, T, HashFcn, EqualKey, Alloc>& hm2)
+template <class _Key, class _Tp, class _HashFcn, class _EqlKey, class _Alloc>
+inline void
+swap(hash_map<_Key,_Tp,_HashFcn,_EqlKey,_Alloc>& __hm1,
+ hash_map<_Key,_Tp,_HashFcn,_EqlKey,_Alloc>& __hm2)
{
- hm1.swap(hm2);
+ __hm1.swap(__hm2);
}
#endif /* __STL_FUNCTION_TMPL_PARTIAL_ORDER */
#ifndef __STL_LIMITED_DEFAULT_TEMPLATES
-template <class Key, class T, class HashFcn = hash<Key>,
- class EqualKey = equal_to<Key>,
- class Alloc = alloc>
+template <class _Key, class _Tp, class _HashFcn = hash<_Key>,
+ class _EqualKey = equal_to<_Key>,
+ class _Alloc = __STL_DEFAULT_ALLOCATOR(_Tp) >
#else
-template <class Key, class T, class HashFcn, class EqualKey,
- class Alloc = alloc>
+template <class _Key, class _Tp, class _HashFcn, class _EqualKey,
+ class _Alloc = __STL_DEFAULT_ALLOCATOR(_Tp) >
#endif
class hash_multimap
{
private:
- typedef hashtable<pair<const Key, T>, Key, HashFcn,
- select1st<pair<const Key, T> >, EqualKey, Alloc> ht;
- ht rep;
+ typedef hashtable<pair<const _Key, _Tp>, _Key, _HashFcn,
+ _Select1st<pair<const _Key, _Tp> >, _EqualKey, _Alloc>
+ _Ht;
+ _Ht _M_ht;
public:
- typedef typename ht::key_type key_type;
- typedef T data_type;
- typedef T mapped_type;
- typedef typename ht::value_type value_type;
- typedef typename ht::hasher hasher;
- typedef typename ht::key_equal key_equal;
-
- typedef typename ht::size_type size_type;
- typedef typename ht::difference_type difference_type;
- typedef typename ht::pointer pointer;
- typedef typename ht::const_pointer const_pointer;
- typedef typename ht::reference reference;
- typedef typename ht::const_reference const_reference;
-
- typedef typename ht::iterator iterator;
- typedef typename ht::const_iterator const_iterator;
-
- hasher hash_funct() const { return rep.hash_funct(); }
- key_equal key_eq() const { return rep.key_eq(); }
+ typedef typename _Ht::key_type key_type;
+ typedef _Tp data_type;
+ typedef _Tp mapped_type;
+ typedef typename _Ht::value_type value_type;
+ typedef typename _Ht::hasher hasher;
+ typedef typename _Ht::key_equal key_equal;
+
+ typedef typename _Ht::size_type size_type;
+ typedef typename _Ht::difference_type difference_type;
+ typedef typename _Ht::pointer pointer;
+ typedef typename _Ht::const_pointer const_pointer;
+ typedef typename _Ht::reference reference;
+ typedef typename _Ht::const_reference const_reference;
+
+ typedef typename _Ht::iterator iterator;
+ typedef typename _Ht::const_iterator const_iterator;
+
+ typedef typename _Ht::allocator_type allocator_type;
+
+ hasher hash_funct() const { return _M_ht.hash_funct(); }
+ key_equal key_eq() const { return _M_ht.key_eq(); }
+ allocator_type get_allocator() const { return _M_ht.get_allocator(); }
public:
- hash_multimap() : rep(100, hasher(), key_equal()) {}
- explicit hash_multimap(size_type n) : rep(n, hasher(), key_equal()) {}
- hash_multimap(size_type n, const hasher& hf) : rep(n, hf, key_equal()) {}
- hash_multimap(size_type n, const hasher& hf, const key_equal& eql)
- : rep(n, hf, eql) {}
+ hash_multimap() : _M_ht(100, hasher(), key_equal(), allocator_type()) {}
+ explicit hash_multimap(size_type __n)
+ : _M_ht(__n, hasher(), key_equal(), allocator_type()) {}
+ hash_multimap(size_type __n, const hasher& __hf)
+ : _M_ht(__n, __hf, key_equal(), allocator_type()) {}
+ hash_multimap(size_type __n, const hasher& __hf, const key_equal& __eql,
+ const allocator_type& __a = allocator_type())
+ : _M_ht(__n, __hf, __eql, __a) {}
#ifdef __STL_MEMBER_TEMPLATES
- template <class InputIterator>
- hash_multimap(InputIterator f, InputIterator l)
- : rep(100, hasher(), key_equal()) { rep.insert_equal(f, l); }
- template <class InputIterator>
- hash_multimap(InputIterator f, InputIterator l, size_type n)
- : rep(n, hasher(), key_equal()) { rep.insert_equal(f, l); }
- template <class InputIterator>
- hash_multimap(InputIterator f, InputIterator l, size_type n,
- const hasher& hf)
- : rep(n, hf, key_equal()) { rep.insert_equal(f, l); }
- template <class InputIterator>
- hash_multimap(InputIterator f, InputIterator l, size_type n,
- const hasher& hf, const key_equal& eql)
- : rep(n, hf, eql) { rep.insert_equal(f, l); }
+ template <class _InputIterator>
+ hash_multimap(_InputIterator __f, _InputIterator __l)
+ : _M_ht(100, hasher(), key_equal(), allocator_type())
+ { _M_ht.insert_equal(__f, __l); }
+ template <class _InputIterator>
+ hash_multimap(_InputIterator __f, _InputIterator __l, size_type __n)
+ : _M_ht(__n, hasher(), key_equal(), allocator_type())
+ { _M_ht.insert_equal(__f, __l); }
+ template <class _InputIterator>
+ hash_multimap(_InputIterator __f, _InputIterator __l, size_type __n,
+ const hasher& __hf)
+ : _M_ht(__n, __hf, key_equal(), allocator_type())
+ { _M_ht.insert_equal(__f, __l); }
+ template <class _InputIterator>
+ hash_multimap(_InputIterator __f, _InputIterator __l, size_type __n,
+ const hasher& __hf, const key_equal& __eql,
+ const allocator_type& __a = allocator_type())
+ : _M_ht(__n, __hf, __eql, __a)
+ { _M_ht.insert_equal(__f, __l); }
#else
- hash_multimap(const value_type* f, const value_type* l)
- : rep(100, hasher(), key_equal()) { rep.insert_equal(f, l); }
- hash_multimap(const value_type* f, const value_type* l, size_type n)
- : rep(n, hasher(), key_equal()) { rep.insert_equal(f, l); }
- hash_multimap(const value_type* f, const value_type* l, size_type n,
- const hasher& hf)
- : rep(n, hf, key_equal()) { rep.insert_equal(f, l); }
- hash_multimap(const value_type* f, const value_type* l, size_type n,
- const hasher& hf, const key_equal& eql)
- : rep(n, hf, eql) { rep.insert_equal(f, l); }
-
- hash_multimap(const_iterator f, const_iterator l)
- : rep(100, hasher(), key_equal()) { rep.insert_equal(f, l); }
- hash_multimap(const_iterator f, const_iterator l, size_type n)
- : rep(n, hasher(), key_equal()) { rep.insert_equal(f, l); }
- hash_multimap(const_iterator f, const_iterator l, size_type n,
- const hasher& hf)
- : rep(n, hf, key_equal()) { rep.insert_equal(f, l); }
- hash_multimap(const_iterator f, const_iterator l, size_type n,
- const hasher& hf, const key_equal& eql)
- : rep(n, hf, eql) { rep.insert_equal(f, l); }
+ hash_multimap(const value_type* __f, const value_type* __l)
+ : _M_ht(100, hasher(), key_equal(), allocator_type())
+ { _M_ht.insert_equal(__f, __l); }
+ hash_multimap(const value_type* __f, const value_type* __l, size_type __n)
+ : _M_ht(__n, hasher(), key_equal(), allocator_type())
+ { _M_ht.insert_equal(__f, __l); }
+ hash_multimap(const value_type* __f, const value_type* __l, size_type __n,
+ const hasher& __hf)
+ : _M_ht(__n, __hf, key_equal(), allocator_type())
+ { _M_ht.insert_equal(__f, __l); }
+ hash_multimap(const value_type* __f, const value_type* __l, size_type __n,
+ const hasher& __hf, const key_equal& __eql,
+ const allocator_type& __a = allocator_type())
+ : _M_ht(__n, __hf, __eql, __a)
+ { _M_ht.insert_equal(__f, __l); }
+
+ hash_multimap(const_iterator __f, const_iterator __l)
+ : _M_ht(100, hasher(), key_equal(), allocator_type())
+ { _M_ht.insert_equal(__f, __l); }
+ hash_multimap(const_iterator __f, const_iterator __l, size_type __n)
+ : _M_ht(__n, hasher(), key_equal(), allocator_type())
+ { _M_ht.insert_equal(__f, __l); }
+ hash_multimap(const_iterator __f, const_iterator __l, size_type __n,
+ const hasher& __hf)
+ : _M_ht(__n, __hf, key_equal(), allocator_type())
+ { _M_ht.insert_equal(__f, __l); }
+ hash_multimap(const_iterator __f, const_iterator __l, size_type __n,
+ const hasher& __hf, const key_equal& __eql,
+ const allocator_type& __a = allocator_type())
+ : _M_ht(__n, __hf, __eql, __a)
+ { _M_ht.insert_equal(__f, __l); }
#endif /*__STL_MEMBER_TEMPLATES */
public:
- size_type size() const { return rep.size(); }
- size_type max_size() const { return rep.max_size(); }
- bool empty() const { return rep.empty(); }
- void swap(hash_multimap& hs) { rep.swap(hs.rep); }
+ size_type size() const { return _M_ht.size(); }
+ size_type max_size() const { return _M_ht.max_size(); }
+ bool empty() const { return _M_ht.empty(); }
+ void swap(hash_multimap& __hs) { _M_ht.swap(__hs._M_ht); }
friend bool
- operator== __STL_NULL_TMPL_ARGS (const hash_multimap&, const hash_multimap&);
+ operator== __STL_NULL_TMPL_ARGS (const hash_multimap&,
+ const hash_multimap&);
- iterator begin() { return rep.begin(); }
- iterator end() { return rep.end(); }
- const_iterator begin() const { return rep.begin(); }
- const_iterator end() const { return rep.end(); }
+ iterator begin() { return _M_ht.begin(); }
+ iterator end() { return _M_ht.end(); }
+ const_iterator begin() const { return _M_ht.begin(); }
+ const_iterator end() const { return _M_ht.end(); }
public:
- iterator insert(const value_type& obj) { return rep.insert_equal(obj); }
+ iterator insert(const value_type& __obj)
+ { return _M_ht.insert_equal(__obj); }
#ifdef __STL_MEMBER_TEMPLATES
- template <class InputIterator>
- void insert(InputIterator f, InputIterator l) { rep.insert_equal(f,l); }
+ template <class _InputIterator>
+ void insert(_InputIterator __f, _InputIterator __l)
+ { _M_ht.insert_equal(__f,__l); }
#else
- void insert(const value_type* f, const value_type* l) {
- rep.insert_equal(f,l);
+ void insert(const value_type* __f, const value_type* __l) {
+ _M_ht.insert_equal(__f,__l);
}
- void insert(const_iterator f, const_iterator l) { rep.insert_equal(f, l); }
+ void insert(const_iterator __f, const_iterator __l)
+ { _M_ht.insert_equal(__f, __l); }
#endif /*__STL_MEMBER_TEMPLATES */
- iterator insert_noresize(const value_type& obj)
- { return rep.insert_equal_noresize(obj); }
+ iterator insert_noresize(const value_type& __obj)
+ { return _M_ht.insert_equal_noresize(__obj); }
- iterator find(const key_type& key) { return rep.find(key); }
- const_iterator find(const key_type& key) const { return rep.find(key); }
+ iterator find(const key_type& __key) { return _M_ht.find(__key); }
+ const_iterator find(const key_type& __key) const
+ { return _M_ht.find(__key); }
- size_type count(const key_type& key) const { return rep.count(key); }
+ size_type count(const key_type& __key) const { return _M_ht.count(__key); }
- pair<iterator, iterator> equal_range(const key_type& key)
- { return rep.equal_range(key); }
- pair<const_iterator, const_iterator> equal_range(const key_type& key) const
- { return rep.equal_range(key); }
+ pair<iterator, iterator> equal_range(const key_type& __key)
+ { return _M_ht.equal_range(__key); }
+ pair<const_iterator, const_iterator>
+ equal_range(const key_type& __key) const
+ { return _M_ht.equal_range(__key); }
- size_type erase(const key_type& key) {return rep.erase(key); }
- void erase(iterator it) { rep.erase(it); }
- void erase(iterator f, iterator l) { rep.erase(f, l); }
- void clear() { rep.clear(); }
+ size_type erase(const key_type& __key) {return _M_ht.erase(__key); }
+ void erase(iterator __it) { _M_ht.erase(__it); }
+ void erase(iterator __f, iterator __l) { _M_ht.erase(__f, __l); }
+ void clear() { _M_ht.clear(); }
public:
- void resize(size_type hint) { rep.resize(hint); }
- size_type bucket_count() const { return rep.bucket_count(); }
- size_type max_bucket_count() const { return rep.max_bucket_count(); }
- size_type elems_in_bucket(size_type n) const
- { return rep.elems_in_bucket(n); }
+ void resize(size_type __hint) { _M_ht.resize(__hint); }
+ size_type bucket_count() const { return _M_ht.bucket_count(); }
+ size_type max_bucket_count() const { return _M_ht.max_bucket_count(); }
+ size_type elems_in_bucket(size_type __n) const
+ { return _M_ht.elems_in_bucket(__n); }
};
-template <class Key, class T, class HF, class EqKey, class Alloc>
-inline bool operator==(const hash_multimap<Key, T, HF, EqKey, Alloc>& hm1,
- const hash_multimap<Key, T, HF, EqKey, Alloc>& hm2)
+template <class _Key, class _Tp, class _HF, class _EqKey, class _Alloc>
+inline bool
+operator==(const hash_multimap<_Key,_Tp,_HF,_EqKey,_Alloc>& __hm1,
+ const hash_multimap<_Key,_Tp,_HF,_EqKey,_Alloc>& __hm2)
{
- return hm1.rep == hm2.rep;
+ return __hm1._M_ht == __hm2._M_ht;
}
#ifdef __STL_FUNCTION_TMPL_PARTIAL_ORDER
-template <class Key, class T, class HashFcn, class EqualKey, class Alloc>
-inline void swap(hash_multimap<Key, T, HashFcn, EqualKey, Alloc>& hm1,
- hash_multimap<Key, T, HashFcn, EqualKey, Alloc>& hm2)
+template <class _Key, class _Tp, class _HashFcn, class _EqlKey, class _Alloc>
+inline void
+swap(hash_multimap<_Key,_Tp,_HashFcn,_EqlKey,_Alloc>& __hm1,
+ hash_multimap<_Key,_Tp,_HashFcn,_EqlKey,_Alloc>& __hm2)
{
- hm1.swap(hm2);
+ __hm1.swap(__hm2);
}
#endif /* __STL_FUNCTION_TMPL_PARTIAL_ORDER */
#if defined(__sgi) && !defined(__GNUC__) && (_MIPS_SIM != _MIPS_SIM_ABI32)
#pragma reset woff 1174
+#pragma reset woff 1375
#endif
__STL_END_NAMESPACE
OSDN Git Service
