df9262681b
* algorithm alloc.h defalloc.h hash_map.h hash_set.h iterator memory pthread_alloc pthread_alloc.h rope ropeimpl.h stl_algo.h stl_algobase.h stl_alloc.h stl_bvector.h stl_config.h stl_construct.h stl_deque.h stl_function.h stl_hash_fun.h stl_hash_map.h stl_hash_set.h stl_hashtable.h stl_heap.h stl_iterator.h stl_list.h stl_map.h stl_multimap.h stl_multiset.h stl_numeric.h stl_pair.h stl_queue.h stl_raw_storage_iter.h stl_relops.h stl_rope.h stl_set.h stl_slist.h stl_stack.h stl_tempbuf.h stl_tree.h stl_uninitialized.h stl_vector.h tempbuf.h type_traits.h: Update to SGI STL 3.11. From-SVN: r22190
243 lines
8.5 KiB
C++
243 lines
8.5 KiB
C++
/*
|
|
*
|
|
* Copyright (c) 1994
|
|
* Hewlett-Packard Company
|
|
*
|
|
* Permission to use, copy, modify, distribute and sell this software
|
|
* and its documentation for any purpose is hereby granted without fee,
|
|
* provided that the above copyright notice appear in all copies and
|
|
* that both that copyright notice and this permission notice appear
|
|
* in supporting documentation. Hewlett-Packard Company makes no
|
|
* representations about the suitability of this software for any
|
|
* purpose. It is provided "as is" without express or implied warranty.
|
|
*
|
|
*
|
|
* Copyright (c) 1996,1997
|
|
* Silicon Graphics Computer Systems, Inc.
|
|
*
|
|
* Permission to use, copy, modify, distribute and sell this software
|
|
* and its documentation for any purpose is hereby granted without fee,
|
|
* provided that the above copyright notice appear in all copies and
|
|
* that both that copyright notice and this permission notice appear
|
|
* in supporting documentation. Silicon Graphics makes no
|
|
* representations about the suitability of this software for any
|
|
* purpose. It is provided "as is" without express or implied warranty.
|
|
*/
|
|
|
|
/* NOTE: This is an internal header file, included by other STL headers.
|
|
* You should not attempt to use it directly.
|
|
*/
|
|
|
|
#ifndef __SGI_STL_INTERNAL_MAP_H
|
|
#define __SGI_STL_INTERNAL_MAP_H
|
|
|
|
__STL_BEGIN_NAMESPACE
|
|
|
|
#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 _Tp, class _Compare = less<_Key>,
|
|
class _Alloc = __STL_DEFAULT_ALLOCATOR(_Tp) >
|
|
#else
|
|
template <class _Key, class _Tp, class _Compare,
|
|
class _Alloc = __STL_DEFAULT_ALLOCATOR(_Tp) >
|
|
#endif
|
|
class map {
|
|
public:
|
|
|
|
// typedefs:
|
|
|
|
typedef _Key key_type;
|
|
typedef _Tp data_type;
|
|
typedef _Tp mapped_type;
|
|
typedef pair<const _Key, _Tp> value_type;
|
|
typedef _Compare key_compare;
|
|
|
|
class value_compare
|
|
: public binary_function<value_type, value_type, bool> {
|
|
friend class map<_Key,_Tp,_Compare,_Alloc>;
|
|
protected :
|
|
_Compare _M_comp;
|
|
value_compare(_Compare __c) : _M_comp(__c) {}
|
|
public:
|
|
bool operator()(const value_type& __x, const value_type& __y) const {
|
|
return _M_comp(__x.first, __y.first);
|
|
}
|
|
};
|
|
|
|
private:
|
|
typedef _Rb_tree<key_type, value_type,
|
|
_Select1st<value_type>, key_compare, _Alloc> _Rep_type;
|
|
_Rep_type _M_t; // red-black tree representing map
|
|
public:
|
|
typedef typename _Rep_type::pointer pointer;
|
|
typedef typename _Rep_type::const_pointer const_pointer;
|
|
typedef typename _Rep_type::reference reference;
|
|
typedef typename _Rep_type::const_reference const_reference;
|
|
typedef typename _Rep_type::iterator iterator;
|
|
typedef typename _Rep_type::const_iterator const_iterator;
|
|
typedef typename _Rep_type::reverse_iterator reverse_iterator;
|
|
typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator;
|
|
typedef typename _Rep_type::size_type size_type;
|
|
typedef typename _Rep_type::difference_type difference_type;
|
|
typedef typename _Rep_type::allocator_type allocator_type;
|
|
|
|
// allocation/deallocation
|
|
|
|
map() : _M_t(_Compare(), allocator_type()) {}
|
|
explicit map(const _Compare& __comp,
|
|
const allocator_type& __a = allocator_type())
|
|
: _M_t(__comp, __a) {}
|
|
|
|
#ifdef __STL_MEMBER_TEMPLATES
|
|
template <class _InputIterator>
|
|
map(_InputIterator __first, _InputIterator __last)
|
|
: _M_t(_Compare(), allocator_type())
|
|
{ _M_t.insert_unique(__first, __last); }
|
|
|
|
template <class _InputIterator>
|
|
map(_InputIterator __first, _InputIterator __last, const _Compare& __comp,
|
|
const allocator_type& __a = allocator_type())
|
|
: _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
|
|
#else
|
|
map(const value_type* __first, const value_type* __last)
|
|
: _M_t(_Compare(), allocator_type())
|
|
{ _M_t.insert_unique(__first, __last); }
|
|
|
|
map(const value_type* __first,
|
|
const value_type* __last, const _Compare& __comp,
|
|
const allocator_type& __a = allocator_type())
|
|
: _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
|
|
|
|
map(const_iterator __first, const_iterator __last)
|
|
: _M_t(_Compare(), allocator_type())
|
|
{ _M_t.insert_unique(__first, __last); }
|
|
|
|
map(const_iterator __first, const_iterator __last, const _Compare& __comp,
|
|
const allocator_type& __a = allocator_type())
|
|
: _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); }
|
|
|
|
#endif /* __STL_MEMBER_TEMPLATES */
|
|
|
|
map(const map<_Key,_Tp,_Compare,_Alloc>& __x) : _M_t(__x._M_t) {}
|
|
map<_Key,_Tp,_Compare,_Alloc>&
|
|
operator=(const map<_Key, _Tp, _Compare, _Alloc>& __x)
|
|
{
|
|
_M_t = __x._M_t;
|
|
return *this;
|
|
}
|
|
|
|
// accessors:
|
|
|
|
key_compare key_comp() const { return _M_t.key_comp(); }
|
|
value_compare value_comp() const { return value_compare(_M_t.key_comp()); }
|
|
allocator_type get_allocator() const { return _M_t.get_allocator(); }
|
|
|
|
iterator begin() { return _M_t.begin(); }
|
|
const_iterator begin() const { return _M_t.begin(); }
|
|
iterator end() { return _M_t.end(); }
|
|
const_iterator end() const { return _M_t.end(); }
|
|
reverse_iterator rbegin() { return _M_t.rbegin(); }
|
|
const_reverse_iterator rbegin() const { return _M_t.rbegin(); }
|
|
reverse_iterator rend() { return _M_t.rend(); }
|
|
const_reverse_iterator rend() const { return _M_t.rend(); }
|
|
bool empty() const { return _M_t.empty(); }
|
|
size_type size() const { return _M_t.size(); }
|
|
size_type max_size() const { return _M_t.max_size(); }
|
|
_Tp& operator[](const key_type& __k) {
|
|
iterator __i = lower_bound(__k);
|
|
// __i->first is greater than or equivalent to __k.
|
|
if (__i == end() || key_comp()(__k, (*__i).first))
|
|
__i = insert(__i, value_type(__k, _Tp()));
|
|
return (*__i).second;
|
|
}
|
|
void swap(map<_Key,_Tp,_Compare,_Alloc>& __x) { _M_t.swap(__x._M_t); }
|
|
|
|
// insert/erase
|
|
|
|
pair<iterator,bool> insert(const value_type& __x)
|
|
{ return _M_t.insert_unique(__x); }
|
|
iterator insert(iterator position, const value_type& __x)
|
|
{ return _M_t.insert_unique(position, __x); }
|
|
#ifdef __STL_MEMBER_TEMPLATES
|
|
template <class _InputIterator>
|
|
void insert(_InputIterator __first, _InputIterator __last) {
|
|
_M_t.insert_unique(__first, __last);
|
|
}
|
|
#else
|
|
void insert(const value_type* __first, const value_type* __last) {
|
|
_M_t.insert_unique(__first, __last);
|
|
}
|
|
void insert(const_iterator __first, const_iterator __last) {
|
|
_M_t.insert_unique(__first, __last);
|
|
}
|
|
#endif /* __STL_MEMBER_TEMPLATES */
|
|
|
|
void erase(iterator __position) { _M_t.erase(__position); }
|
|
size_type erase(const key_type& __x) { return _M_t.erase(__x); }
|
|
void erase(iterator __first, iterator __last)
|
|
{ _M_t.erase(__first, __last); }
|
|
void clear() { _M_t.clear(); }
|
|
|
|
// map operations:
|
|
|
|
iterator find(const key_type& __x) { return _M_t.find(__x); }
|
|
const_iterator find(const key_type& __x) const { return _M_t.find(__x); }
|
|
size_type count(const key_type& __x) const { return _M_t.count(__x); }
|
|
iterator lower_bound(const key_type& __x) {return _M_t.lower_bound(__x); }
|
|
const_iterator lower_bound(const key_type& __x) const {
|
|
return _M_t.lower_bound(__x);
|
|
}
|
|
iterator upper_bound(const key_type& __x) {return _M_t.upper_bound(__x); }
|
|
const_iterator upper_bound(const key_type& __x) const {
|
|
return _M_t.upper_bound(__x);
|
|
}
|
|
|
|
pair<iterator,iterator> equal_range(const key_type& __x) {
|
|
return _M_t.equal_range(__x);
|
|
}
|
|
pair<const_iterator,const_iterator> equal_range(const key_type& __x) const {
|
|
return _M_t.equal_range(__x);
|
|
}
|
|
friend bool operator== __STL_NULL_TMPL_ARGS (const map&, const map&);
|
|
friend bool operator< __STL_NULL_TMPL_ARGS (const map&, const map&);
|
|
};
|
|
|
|
template <class _Key, class _Tp, class _Compare, class _Alloc>
|
|
inline bool operator==(const map<_Key,_Tp,_Compare,_Alloc>& __x,
|
|
const map<_Key,_Tp,_Compare,_Alloc>& __y) {
|
|
return __x._M_t == __y._M_t;
|
|
}
|
|
|
|
template <class _Key, class _Tp, class _Compare, class _Alloc>
|
|
inline bool operator<(const map<_Key,_Tp,_Compare,_Alloc>& __x,
|
|
const map<_Key,_Tp,_Compare,_Alloc>& __y) {
|
|
return __x._M_t < __y._M_t;
|
|
}
|
|
|
|
#ifdef __STL_FUNCTION_TMPL_PARTIAL_ORDER
|
|
|
|
template <class _Key, class _Tp, class _Compare, class _Alloc>
|
|
inline void swap(map<_Key,_Tp,_Compare,_Alloc>& __x,
|
|
map<_Key,_Tp,_Compare,_Alloc>& __y) {
|
|
__x.swap(__y);
|
|
}
|
|
|
|
#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
|
|
|
|
#endif /* __SGI_STL_INTERNAL_MAP_H */
|
|
|
|
// Local Variables:
|
|
// mode:C++
|
|
// End:
|