Subversion Repositories Kolibri OS

/*

 *

 * 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_MULTIMAP_H

#define __SGI_STL_INTERNAL_MULTIMAP_H

#include 

namespace std

{

// Forward declaration of operators < and ==, needed for friend declaration.

template 

          class _Compare = less<_Key>,

          class _Alloc = allocator > >

class multimap;

template 

inline bool operator==(const multimap<_Key,_Tp,_Compare,_Alloc>& __x,

                       const multimap<_Key,_Tp,_Compare,_Alloc>& __y);

template 

inline bool operator<(const multimap<_Key,_Tp,_Compare,_Alloc>& __x,

                      const multimap<_Key,_Tp,_Compare,_Alloc>& __y);

template 

class multimap

{

  // concept requirements

  __glibcpp_class_requires(_Tp, _SGIAssignableConcept);

  __glibcpp_class_requires4(_Compare, bool, _Key, _Key, _BinaryFunctionConcept);

public:

// typedefs:

  typedef _Key                  key_type;

  typedef _Tp                   data_type;

  typedef _Tp                   mapped_type;

  typedef pair value_type;

  typedef _Compare              key_compare;

  class value_compare : public binary_function {

  friend class multimap<_Key,_Tp,_Compare,_Alloc>;

  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

                  _Select1st, key_compare, _Alloc> _Rep_type;

  _Rep_type _M_t;  // red-black tree representing multimap

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

  multimap() : _M_t(_Compare(), allocator_type()) { }

  explicit multimap(const _Compare& __comp,

                    const allocator_type& __a = allocator_type())

    : _M_t(__comp, __a) { }

  template 

  multimap(_InputIterator __first, _InputIterator __last)

    : _M_t(_Compare(), allocator_type())

    { _M_t.insert_equal(__first, __last); }

  template 

  multimap(_InputIterator __first, _InputIterator __last,

           const _Compare& __comp,

           const allocator_type& __a = allocator_type())

    : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); }

  multimap(const multimap<_Key,_Tp,_Compare,_Alloc>& __x) : _M_t(__x._M_t) { }

  multimap<_Key,_Tp,_Compare,_Alloc>&

  operator=(const multimap<_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(); }

  void swap(multimap<_Key,_Tp,_Compare,_Alloc>& __x) { _M_t.swap(__x._M_t); }

  // insert/erase

  iterator insert(const value_type& __x) { return _M_t.insert_equal(__x); }

  iterator insert(iterator __position, const value_type& __x) {

    return _M_t.insert_equal(__position, __x);

  }

  template 

  void insert(_InputIterator __first, _InputIterator __last) {

    _M_t.insert_equal(__first, __last);

  }

  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(); }

  // multimap 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 equal_range(const key_type& __x) {

    return _M_t.equal_range(__x);

  }

  pair equal_range(const key_type& __x) const {

    return _M_t.equal_range(__x);

  }

  template 

  friend bool operator== (const multimap<_K1, _T1, _C1, _A1>&,

                          const multimap<_K1, _T1, _C1, _A1>&);

  template 

  friend bool operator< (const multimap<_K1, _T1, _C1, _A1>&,

                         const multimap<_K1, _T1, _C1, _A1>&);

};

template 

inline bool operator==(const multimap<_Key,_Tp,_Compare,_Alloc>& __x,

                       const multimap<_Key,_Tp,_Compare,_Alloc>& __y) {

  return __x._M_t == __y._M_t;

}

template 

inline bool operator<(const multimap<_Key,_Tp,_Compare,_Alloc>& __x,

                      const multimap<_Key,_Tp,_Compare,_Alloc>& __y) {

  return __x._M_t < __y._M_t;

}

template 

inline bool operator!=(const multimap<_Key,_Tp,_Compare,_Alloc>& __x,

                       const multimap<_Key,_Tp,_Compare,_Alloc>& __y) {

  return !(__x == __y);

}

template 

inline bool operator>(const multimap<_Key,_Tp,_Compare,_Alloc>& __x,

                      const multimap<_Key,_Tp,_Compare,_Alloc>& __y) {

  return __y < __x;

}

template 

inline bool operator<=(const multimap<_Key,_Tp,_Compare,_Alloc>& __x,

                       const multimap<_Key,_Tp,_Compare,_Alloc>& __y) {

  return !(__y < __x);

}

template 

inline bool operator>=(const multimap<_Key,_Tp,_Compare,_Alloc>& __x,

                       const multimap<_Key,_Tp,_Compare,_Alloc>& __y) {

  return !(__x < __y);

}

template 

inline void swap(multimap<_Key,_Tp,_Compare,_Alloc>& __x,

                 multimap<_Key,_Tp,_Compare,_Alloc>& __y) {

  __x.swap(__y);

}

} // namespace std

#endif /* __SGI_STL_INTERNAL_MULTIMAP_H */

// Local Variables:

// mode:C++

// End: