/*

 *

 * Copyright (c) 1994

 * Hewlett-Packard Company

 *

 * Copyright (c) 1996,1997

 * Silicon Graphics Computer Systems, Inc.

 *

 * Copyright (c) 1997

 * Moscow Center for SPARC Technology

 *

 * Copyright (c) 1999 

 * Boris Fomitchev

 *

 * This material is provided "as is", with absolutely no warranty expressed

 * or implied. Any use is at your own risk.

 *

 * Permission to use or copy this software for any purpose is hereby granted 

 * without fee, provided the above notices are retained on all copies.

 * Permission to modify the code and to distribute modified code is granted,

 * provided the above notices are retained, and a notice that the code was

 * modified is included with the above copyright notice.

 *

 */

/* NOTE: This is an internal header file, included by other STL headers.

 *   You should not attempt to use it directly.

 */

#ifndef _STLP_INTERNAL_SET_H

#define _STLP_INTERNAL_SET_H

#ifndef _STLP_INTERNAL_TREE_H

#include <stl/_tree.h>

#endif

#define set __WORKAROUND_RENAME(set)

#define multiset __WORKAROUND_RENAME(multiset)

_STLP_BEGIN_NAMESPACE

template <class _Key, __DFL_TMPL_PARAM(_Compare,less<_Key>), 

                     _STLP_DEFAULT_ALLOCATOR_SELECT(_Key) >

class set 

{

public:

// typedefs:

  typedef _Key     key_type;

  typedef _Key     value_type;

  typedef _Compare key_compare;

  typedef _Compare value_compare;

private:

  typedef _Rb_tree<key_type, value_type, 

    _Identity<value_type>, key_compare, _Alloc> _Rep_type;

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::const_iterator const_iterator;

  typedef const_iterator iterator;

  typedef typename _Rep_type::const_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;

  typedef set<_Key,_Compare,_Alloc> _Self;

private:

  _Rep_type _M_t;  // red-black tree representing set

public:

  // allocation/deallocation

  set() : _M_t(_Compare(), allocator_type()) {

    _STLP_POP_IF_CHECK

  }

# ifdef _STLP_USE_TRAP_LEAVE

  set(const set<_Key,_Compare,_Alloc>& __x)

  {

    _STLP_PUSH_CLEANUP_ITEM(_Self, this)

    _M_t =__x._M_t; 

    _STLP_POP_CLEANUP_ITEM

  }

# else

  set(const set<_Key,_Compare,_Alloc>& __o)

    : _M_t(__o._M_t) {

  }

# endif

  explicit set(const _Compare& __comp,

	       const allocator_type& __a = allocator_type())

    : _M_t(__comp, __a) {

    _STLP_POP_IF_CHECK

  }

#ifdef _STLP_MEMBER_TEMPLATES

  template <class _InputIterator>

  set(_InputIterator __first, _InputIterator __last)

    : _M_t(_Compare(), allocator_type())

    { 

      _STLP_PUSH_CLEANUP_ITEM(_Self, this)

      _M_t.insert_unique(__first, __last); 

      _STLP_POP_CLEANUP_ITEM

}

# ifdef _STLP_NEEDS_EXTRA_TEMPLATE_CONSTRUCTORS

  template <class _InputIterator>

  set(_InputIterator __first, _InputIterator __last, const _Compare& __comp)

    : _M_t(__comp, allocator_type()) { 

    _STLP_PUSH_CLEANUP_ITEM(_Self, this)

      _M_t.insert_unique(__first, __last);

    _STLP_POP_CLEANUP_ITEM

  }

# endif

  template <class _InputIterator>

  set(_InputIterator __first, _InputIterator __last, const _Compare& __comp,

      const allocator_type& __a _STLP_ALLOCATOR_TYPE_DFL)

    : _M_t(__comp, __a) { 

    _STLP_PUSH_CLEANUP_ITEM(_Self, this)

    _M_t.insert_unique(__first, __last); 

    _STLP_POP_CLEANUP_ITEM

  }

#else

  set(const value_type* __first, const value_type* __last) 

    : _M_t(_Compare(), allocator_type()) 

    { 

      _STLP_PUSH_CLEANUP_ITEM(_Self, this)

      _M_t.insert_unique(__first, __last); 

      _STLP_POP_CLEANUP_ITEM

    }

  set(const value_type* __first, 

      const value_type* __last, const _Compare& __comp,

      const allocator_type& __a = allocator_type())

    : _M_t(__comp, __a) { 

    _STLP_PUSH_CLEANUP_ITEM(_Self, this)

    _M_t.insert_unique(__first, __last); 

    _STLP_POP_CLEANUP_ITEM

  }

  set(const_iterator __first, const_iterator __last)

    : _M_t(_Compare(), allocator_type()) 

    { 

      _STLP_PUSH_CLEANUP_ITEM(_Self, this)

      _M_t.insert_unique(__first, __last); 

      _STLP_POP_CLEANUP_ITEM

    }

  set(const_iterator __first, const_iterator __last, const _Compare& __comp,

      const allocator_type& __a = allocator_type())

    : _M_t(__comp, __a) { 

    _STLP_PUSH_CLEANUP_ITEM(_Self, this)

    _M_t.insert_unique(__first, __last); 

    _STLP_POP_CLEANUP_ITEM

  }

#endif /* _STLP_MEMBER_TEMPLATES */

  set<_Key,_Compare,_Alloc>& operator=(const set<_Key, _Compare, _Alloc>& __x)

  { 

    _M_t = __x._M_t; 

    return *this;

  }

#ifdef _STLP_USE_TRAP_LEAVE

public:

  static void* operator new (size_t __n, TLeave) { return _STLP_StackHelper<bool>::_NewLC(__n); }

  static void* operator new (size_t __n) { return _STLP_StackHelper<bool>::_NewLC(__n); }

#endif

  // accessors:

  key_compare key_comp() const { return _M_t.key_comp(); }

  value_compare value_comp() const { return _M_t.key_comp(); }

  allocator_type get_allocator() const { return _M_t.get_allocator(); }

  iterator begin() const { return _M_t.begin(); }

  iterator end() const { return _M_t.end(); }

  reverse_iterator rbegin() const { return _M_t.rbegin(); } 

  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(set<_Key,_Compare,_Alloc>& __x) { _M_t.swap(__x._M_t); }

  // insert/erase

  pair<iterator,bool> insert(const value_type& __x) { 

    typedef typename _Rep_type::iterator _Rep_iterator;

    pair<_Rep_iterator, bool> __p = _M_t.insert_unique(__x); 

    return pair<iterator, bool>(__REINTERPRET_CAST(const iterator&,__p.first), __p.second);

  }

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

    typedef typename _Rep_type::iterator _Rep_iterator;

    return _M_t.insert_unique((_Rep_iterator&)__position, __x);

  }

#ifdef _STLP_MEMBER_TEMPLATES

  template <class _InputIterator>

  void insert(_InputIterator __first, _InputIterator __last) {

    _M_t.insert_unique(__first, __last);

  }

#else

  void insert(const_iterator __first, const_iterator __last) {

    _M_t.insert_unique(__first, __last);

  }

  void insert(const value_type* __first, const value_type* __last) {

    _M_t.insert_unique(__first, __last);

  }

#endif /* _STLP_MEMBER_TEMPLATES */

  void erase(iterator __position) { 

    typedef typename _Rep_type::iterator _Rep_iterator;

    _M_t.erase((_Rep_iterator&)__position); 

  }

  size_type erase(const key_type& __x) { 

    return _M_t.erase(__x); 

  }

  void erase(iterator __first, iterator __last) { 

    typedef typename _Rep_type::iterator _Rep_iterator;

    _M_t.erase((_Rep_iterator&)__first, (_Rep_iterator&)__last); 

  }

  void clear() { _M_t.clear(); }

  // set operations:

# if defined(_STLP_MEMBER_TEMPLATES) && ! defined ( _STLP_NO_EXTENSIONS )

  template <class _KT>

  iterator find(const _KT& __x) const { return _M_t.find(__x); }

# else

  iterator find(const key_type& __x) const { return _M_t.find(__x); }

# endif

  size_type count(const key_type& __x) const { 

    return _M_t.find(__x) == _M_t.end() ? 0 : 1 ; 

  }

  iterator lower_bound(const key_type& __x) const {

    return _M_t.lower_bound(__x);

  }

  iterator upper_bound(const key_type& __x) const {

    return _M_t.upper_bound(__x); 

  }

  pair<iterator,iterator> equal_range(const key_type& __x) const {

    return _M_t.equal_range(__x);

  }

};

template <class _Key, __DFL_TMPL_PARAM(_Compare,less<_Key>), 

                     _STLP_DEFAULT_ALLOCATOR_SELECT(_Key) >

class multiset 

{

public:

  // typedefs:

  typedef _Key     key_type;

  typedef _Key     value_type;

  typedef _Compare key_compare;

  typedef _Compare value_compare;

private:

  typedef _Rb_tree<key_type, value_type, 

                  _Identity<value_type>, key_compare, _Alloc> _Rep_type;

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::const_iterator const_iterator;

  typedef const_iterator iterator;

  typedef typename _Rep_type::const_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;

  typedef multiset<_Key,_Compare,_Alloc> _Self;

private:

  _Rep_type _M_t;  // red-black tree representing multiset

public:

  // allocation/deallocation

  multiset() : _M_t(_Compare(), allocator_type()) {

    _STLP_POP_IF_CHECK

  }

# ifdef _STLP_USE_TRAP_LEAVE

  multiset(const multiset<_Key,_Compare,_Alloc>& __x)

  {

     _STLP_PUSH_CLEANUP_ITEM(_Self, this)

    _M_t =__x._M_t; 

     _STLP_POP_CLEANUP_ITEM

  }

# else

  multiset(const multiset<_Key,_Compare,_Alloc>& __o)

    : _M_t(__o._M_t) {

  }

# endif

  explicit multiset(const _Compare& __comp,

                    const allocator_type& __a = allocator_type())

    : _M_t(__comp, __a) {

    _STLP_POP_IF_CHECK

  }

#ifdef _STLP_MEMBER_TEMPLATES

  template <class _InputIterator>

  multiset(_InputIterator __first, _InputIterator __last)

    : _M_t(_Compare(), allocator_type())

    { 

       _STLP_PUSH_CLEANUP_ITEM(_Self, this)

       _M_t.insert_equal(__first, __last); 

       _STLP_POP_CLEANUP_ITEM

    }

# ifdef _STLP_NEEDS_EXTRA_TEMPLATE_CONSTRUCTORS

  template <class _InputIterator>

  multiset(_InputIterator __first, _InputIterator __last,

           const _Compare& __comp)

    : _M_t(__comp, allocator_type()) { 

     _STLP_PUSH_CLEANUP_ITEM(_Self, this)

     _M_t.insert_equal(__first, __last); 

     _STLP_POP_CLEANUP_ITEM

  }

# endif

  template <class _InputIterator>

  multiset(_InputIterator __first, _InputIterator __last,

           const _Compare& __comp,

           const allocator_type& __a _STLP_ALLOCATOR_TYPE_DFL)

    : _M_t(__comp, __a) { 

     _STLP_PUSH_CLEANUP_ITEM(_Self, this)

     _M_t.insert_equal(__first, __last); 

     _STLP_POP_CLEANUP_ITEM

  }

#else

  multiset(const value_type* __first, const value_type* __last)

    : _M_t(_Compare(), allocator_type())

    {

      _STLP_PUSH_CLEANUP_ITEM(_Self, this)

      _M_t.insert_equal(__first, __last); 

      _STLP_POP_CLEANUP_ITEM

    }

  multiset(const value_type* __first, const value_type* __last,

           const _Compare& __comp,

           const allocator_type& __a = allocator_type())

    : _M_t(__comp, __a) { 

     _STLP_PUSH_CLEANUP_ITEM(_Self, this)

     _M_t.insert_equal(__first, __last); 

     _STLP_POP_CLEANUP_ITEM

  }

  multiset(const_iterator __first, const_iterator __last)

    : _M_t(_Compare(), allocator_type())

    { 

       _STLP_PUSH_CLEANUP_ITEM(_Self, this)

       _M_t.insert_equal(__first, __last);

       _STLP_POP_CLEANUP_ITEM

    }

  multiset(const_iterator __first, const_iterator __last,

           const _Compare& __comp,

           const allocator_type& __a = allocator_type())

    : _M_t(__comp, __a) { 

     _STLP_PUSH_CLEANUP_ITEM(_Self, this)

     _M_t.insert_equal(__first, __last); 

     _STLP_POP_CLEANUP_ITEM

  }

#endif /* _STLP_MEMBER_TEMPLATES */

  multiset<_Key,_Compare,_Alloc>&

  operator=(const multiset<_Key,_Compare,_Alloc>& __x) {

    _M_t = __x._M_t; 

    return *this;

  }

#ifdef _STLP_USE_TRAP_LEAVE

public:

  static void* operator new (size_t __n, TLeave) { return _STLP_StackHelper<bool>::_NewLC(__n); }

  static void* operator new (size_t __n) { return _STLP_StackHelper<bool>::_NewLC(__n); }

#endif

  // accessors:

  key_compare key_comp() const { return _M_t.key_comp(); }

  value_compare value_comp() const { return _M_t.key_comp(); }

  allocator_type get_allocator() const { return _M_t.get_allocator(); }

  iterator begin() const { return _M_t.begin(); }

  iterator end() const { return _M_t.end(); }

  reverse_iterator rbegin() const { return _M_t.rbegin(); } 

  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(multiset<_Key,_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) {

    typedef typename _Rep_type::iterator _Rep_iterator;

    return _M_t.insert_equal((_Rep_iterator&)__position, __x);

  }

#ifdef _STLP_MEMBER_TEMPLATES  

  template <class _InputIterator>

  void insert(_InputIterator __first, _InputIterator __last) {

    _M_t.insert_equal(__first, __last);

  }

#else

  void insert(const value_type* __first, const value_type* __last) {

    _M_t.insert_equal(__first, __last);

  }

  void insert(const_iterator __first, const_iterator __last) {

    _M_t.insert_equal(__first, __last);

  }

#endif /* _STLP_MEMBER_TEMPLATES */

  void erase(iterator __position) { 

    typedef typename _Rep_type::iterator _Rep_iterator;

    _M_t.erase((_Rep_iterator&)__position); 

  }

  size_type erase(const key_type& __x) { 

    return _M_t.erase(__x); 

  }

  void erase(iterator __first, iterator __last) { 

    typedef typename _Rep_type::iterator _Rep_iterator;

    _M_t.erase((_Rep_iterator&)__first, (_Rep_iterator&)__last); 

  }

  void clear() { _M_t.clear(); }

  // multiset operations:

# if defined(_STLP_MEMBER_TEMPLATES) && ! defined ( _STLP_NO_EXTENSIONS )

  template <class _KT>

  iterator find(const _KT& __x) const { return _M_t.find(__x); }

# else

  iterator find(const key_type& __x) const { return _M_t.find(__x); }

# endif

  size_type count(const key_type& __x) const { return _M_t.count(__x); }

  iterator lower_bound(const key_type& __x) const {

    return _M_t.lower_bound(__x);

  }

  iterator upper_bound(const key_type& __x) const {

    return _M_t.upper_bound(__x); 

  }

  pair<iterator,iterator> equal_range(const key_type& __x) const {

    return _M_t.equal_range(__x);

  }

};

# define _STLP_TEMPLATE_HEADER template <class _Key, class _Compare, class _Alloc>

# define _STLP_TEMPLATE_CONTAINER set<_Key,_Compare,_Alloc>

# include <stl/_relops_cont.h>

# undef  _STLP_TEMPLATE_CONTAINER

# define _STLP_TEMPLATE_CONTAINER multiset<_Key,_Compare,_Alloc>

# include <stl/_relops_cont.h>

# undef  _STLP_TEMPLATE_CONTAINER

# undef  _STLP_TEMPLATE_HEADER

_STLP_END_NAMESPACE

// do a cleanup

# undef set

# undef multiset

// provide a way to access full funclionality 

# define __set__  __FULL_NAME(set)

# define __multiset__  __FULL_NAME(multiset)

# ifdef _STLP_USE_WRAPPER_FOR_ALLOC_PARAM

# include <stl/wrappers/_set.h>

# endif

#endif /* _STLP_INTERNAL_SET_H */

// Local Variables:

// mode:C++

// End: