144 lines
5.0 KiB
C++
144 lines
5.0 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 and Microsoft
|
|
* Corporation make no representations about the suitability of this
|
|
* software for any purpose. It is provided "as is" without express or
|
|
* implied warranty.
|
|
*
|
|
*/
|
|
|
|
#ifndef MULTIMAP_H
|
|
#define MULTIMAP_H
|
|
|
|
#ifndef Allocator
|
|
#define Allocator allocator
|
|
#include <defalloc.h>
|
|
#endif
|
|
|
|
#include <tree.h>
|
|
|
|
template <class Key, class T, class Compare>
|
|
class multimap {
|
|
public:
|
|
|
|
// typedefs:
|
|
|
|
typedef Key key_type;
|
|
typedef pair<Key, T> value_type;
|
|
typedef Compare key_compare;
|
|
|
|
class value_compare
|
|
: public binary_function<value_type, value_type, bool> {
|
|
friend class multimap<Key, T, Compare>;
|
|
protected:
|
|
Compare comp;
|
|
value_compare(Compare c) : comp(c) {}
|
|
public:
|
|
bool operator()(const value_type& x, const value_type& y) const {
|
|
return comp(x.first, y.first);
|
|
}
|
|
};
|
|
|
|
private:
|
|
typedef rb_tree<key_type, value_type,
|
|
select1st<value_type, key_type>, key_compare> rep_type;
|
|
rep_type t; // red-black tree representing multimap
|
|
public:
|
|
typedef rep_type::reference reference;
|
|
typedef rep_type::const_reference const_reference;
|
|
typedef rep_type::iterator iterator;
|
|
typedef rep_type::const_iterator const_iterator;
|
|
typedef rep_type::reverse_iterator reverse_iterator;
|
|
typedef rep_type::const_reverse_iterator const_reverse_iterator;
|
|
typedef rep_type::size_type size_type;
|
|
typedef rep_type::difference_type difference_type;
|
|
|
|
// allocation/deallocation
|
|
|
|
multimap(const Compare& comp = Compare()) : t(comp, true) { }
|
|
multimap(const value_type* first, const value_type* last,
|
|
const Compare& comp = Compare()) : t(first, last, comp, true) { }
|
|
multimap(const multimap<Key, T, Compare>& x) : t(x.t, true) { }
|
|
multimap<Key, T, Compare>& operator=(const multimap<Key, T, Compare>& x) {
|
|
t = x.t;
|
|
return *this;
|
|
}
|
|
|
|
// accessors:
|
|
|
|
key_compare key_comp() const { return t.key_comp(); }
|
|
value_compare value_comp() const { return value_compare(t.key_comp()); }
|
|
iterator begin() { return t.begin(); }
|
|
const_iterator begin() const { return t.begin(); }
|
|
iterator end() { return t.end(); }
|
|
const_iterator end() const { return t.end(); }
|
|
reverse_iterator rbegin() { return t.rbegin(); }
|
|
const_reverse_iterator rbegin() const { return t.rbegin(); }
|
|
reverse_iterator rend() { return t.rend(); }
|
|
const_reverse_iterator rend() const { return t.rend(); }
|
|
bool empty() const { return t.empty(); }
|
|
size_type size() const { return t.size(); }
|
|
size_type max_size() const { return t.max_size(); }
|
|
void swap(multimap<Key, T, Compare>& x) { t.swap(x.t); }
|
|
|
|
// insert/erase
|
|
|
|
iterator insert(const value_type& x) { return t.insert(x).first; }
|
|
iterator insert(iterator position, const value_type& x) {
|
|
return t.insert(position, x);
|
|
}
|
|
void insert(const value_type* first, const value_type* last) {
|
|
t.insert(first, last);
|
|
}
|
|
void erase(iterator position) { t.erase(position); }
|
|
size_type erase(const key_type& x) { return t.erase(x); }
|
|
void erase(iterator first, iterator last) { t.erase(first, last); }
|
|
|
|
// multimap operations:
|
|
|
|
iterator find(const key_type& x) { return t.find(x); }
|
|
const_iterator find(const key_type& x) const { return t.find(x); }
|
|
size_type count(const key_type& x) const { return t.count(x); }
|
|
iterator lower_bound(const key_type& x) {return t.lower_bound(x); }
|
|
const_iterator lower_bound(const key_type& x) const {
|
|
return t.lower_bound(x);
|
|
}
|
|
iterator upper_bound(const key_type& x) {return t.upper_bound(x); }
|
|
const_iterator upper_bound(const key_type& x) const {
|
|
return t.upper_bound(x);
|
|
}
|
|
typedef pair<iterator, iterator> pair_iterator_iterator;
|
|
// typedef done to get around compiler bug
|
|
pair_iterator_iterator equal_range(const key_type& x) {
|
|
return t.equal_range(x);
|
|
}
|
|
typedef pair<const_iterator, const_iterator> pair_citerator_citerator;
|
|
// typedef done to get around compiler bug
|
|
pair_citerator_citerator equal_range(const key_type& x) const {
|
|
return t.equal_range(x);
|
|
}
|
|
};
|
|
|
|
template <class Key, class T, class Compare>
|
|
inline bool operator==(const multimap<Key, T, Compare>& x,
|
|
const multimap<Key, T, Compare>& y) {
|
|
return x.size() == y.size() && equal(x.begin(), x.end(), y.begin());
|
|
}
|
|
|
|
template <class Key, class T, class Compare>
|
|
inline bool operator<(const multimap<Key, T, Compare>& x,
|
|
const multimap<Key, T, Compare>& y) {
|
|
return lexicographical_compare(x.begin(), x.end(), y.begin(), y.end());
|
|
}
|
|
|
|
#undef Allocator
|
|
|
|
#endif
|