25#ifndef _VIRTUAL_MAP_HPP_
26#define _VIRTUAL_MAP_HPP_
36 class _Pr = std::less<keyT>,
37 class _Alloc = std::allocator<std::pair<const keyT, valueT> > >
42 typedef std::map<keyT, valueT, _Pr, _Alloc>
BaseType;
51 typedef typename BaseType::pointer
pointer;
67 :
_base(predicate, allocator)
76 for (; _First != _Last; ++_First)
85 for (; _First != _Last; ++_First)
94 for (; _First != _Last; ++_First)
102 {
return _base.get_allocator();}
106 {
return _base.begin();}
110 {
return _base.begin();}
114 {
return _base.end();}
118 {
return _base.end();}
122 {
return _base.rbegin();}
126 {
return _base.rbegin();}
130 {
return _base.rend();}
134 {
return _base.rend();}
138 {
_base =
x._base;
return *
this;}
154 {
return _base.empty();}
158 {
return _base.equal_range(
x);}
162 {
return _base.equal_range(
x);}
166 {
_base.erase(position);}
170 {
_base.erase(start, finish);}
190 {
return _base.insert(position,
x);}
193 template <
class InputIterator>
194 void insert(InputIterator start, InputIterator finish)
195 {
_base.insert(start, finish);}
199 {
return _base.key_comp();}
203 {
return _base.lower_bound(
x);}
207 {
return _base.lower_bound(
x);}
211 {
return _base.max_size();}
215 {
return _base.size();}
223 {
return _base.upper_bound(
x);}
227 {
return _base.upper_bound(
x);}
231 {
return _base.value_comp();}
KernelTraitsBase< Kernel >::space_type::abscissa_type x
a wrapper for std::map that will behave properly with polymorphism
std::map< keyT, valueT, _Pr, _Alloc > BaseType
BaseType::key_type key_type
virtual void erase(iterator position)
Deletes the map element pointed to by the iterator position.
virtual iterator begin()
Returns an iterator pointing to the first element stored in the map. First is defined by the map's co...
BaseType::difference_type difference_type
virtual const_reverse_iterator rbegin() const
Returns a const_reverse_iterator pointing to the first element stored in the map.
virtual mapped_type & operator[](const key_type &x)
If an element with the key x exists in the map, then a reference to its associated value is returned....
virtual_map(_Iter _First, _Iter _Last, const key_compare &_Pred)
Constructs a map containing values in the range [_First, _Last). Creation of the new map is only guar...
virtual size_type max_size() const
Returns the maximum possible size of the map. This size is only constrained by the number of unique k...
BaseType::allocator_type allocator_type
virtual iterator insert(iterator position, const value_type &x)
If a value_type with the same key as x is not present in the map, then x is inserted into the map....
BaseType::value_compare value_compare
BaseType::const_reference const_reference
virtual_map(_Iter _First, _Iter _Last, const key_compare &_Pred, const allocator_type &_Al)
Constructs a map containing values in the range [_First, _Last). Creation of the new map is only guar...
virtual iterator lower_bound(const key_type &x)
Returns a reference to the first entry with a key greater than or equal to x.
virtual const_iterator begin() const
Returns a const_iterator pointing to the first element stored in the map.
BaseType::const_pointer const_pointer
virtual value_compare value_comp() const
Returns a function object capable of comparing pair<const Key, T> values using the comparison operati...
BaseType::const_reverse_iterator const_reverse_iterator
virtual std::pair< const_iterator, const_iterator > equal_range(const key_type &x) const
Returns the pair (lower_bound(x), upper_bound(x)).
virtual iterator end()
Returns an iterator pointing to the last element stored in the map; in other words,...
BaseType::size_type size_type
void insert(InputIterator start, InputIterator finish)
Copies of each element in the range [start, finish) that possess a unique key (one not already in the...
virtual bool empty() const
Returns true if the map is empty, false otherwise.
BaseType::pointer pointer
BaseType::key_compare key_compare
virtual void clear()
Erases all elements from the self.
virtual size_type size() const
Returns the number of elements in the map.
BaseType::reverse_iterator reverse_iterator
BaseType::mapped_type mapped_type
virtual_map(_Iter _First, _Iter _Last)
Constructs a map containing values in the range [_First, _Last). Creation of the new map is only guar...
BaseType::iterator iterator
virtual const_iterator lower_bound(const key_type &x) const
Same as lower_bound above but returns a const_iterator.
virtual reverse_iterator rbegin()
Returns a reverse_iterator pointing to the first element stored in the map. First is defined by the m...
virtual iterator upper_bound(const key_type &x)
Returns an iterator for the first entry with a key greater than x.
virtual size_type erase(const key_type &x)
Deletes the element with the key value x from the map, if one exists. Returns 1 if x existed in the m...
virtual iterator find(const key_type &x)
Searches the map for a pair with the key value x and returns an iterator to that pair if it is found....
virtual std::pair< iterator, iterator > equal_range(const key_type &x)
Returns the pair (lower_bound(x), upper_bound(x)).
virtual void swap(virtual_map< keyT, valueT, key_compare, allocator_type > &x)
Swaps the contents of the map x with the current map, *this.
virtual size_type count(const key_type &x) const
Returns a 1 if a value with the key x exists in the map. Otherwise returns a 0.
BaseType::const_iterator const_iterator
virtual const_iterator find(const key_type &x) const
Same as find above but returns a const_iterator.
virtual const_iterator end() const
Returns a const_iterator pointing to the last element stored in the map.
virtual const_iterator upper_bound(const key_type &x) const
Same as upper_bound above, but returns a const_iterator.
virtual key_compare key_comp() const
Returns a function object capable of comparing key values using the comparison operation,...
virtual_map(const key_compare &predicate=key_compare(), const allocator_type &allocator=allocator_type())
Constructs an empty map that uses the predicate _Pred to order keys, if it is supplied....
BaseType::reference reference
virtual virtual_map< keyT, valueT, key_compare, allocator_type > & operator=(const virtual_map< keyT, valueT, key_compare, allocator_type > &x)
Replaces the contents of *this with a copy of the map x.
virtual allocator_type get_allocator() const
Returns a copy of the allocator used by self for storage management.
virtual reverse_iterator rend()
Returns a reverse_iterator pointing to the last element stored in the map; in other words,...
virtual const_reverse_iterator rend() const
Returns a const_reverse_iterator pointing to the last element stored in the map.
virtual std::pair< iterator, bool > insert(const value_type &x)
If a value_type with the same key as x is not present in the map, then x is inserted into the map....
BaseType::value_type value_type
virtual void erase(iterator start, iterator finish)
If the iterators start and finish point to the same map and last is reachable from first,...