list

//==============================================================================
//
//  list
//
#ifndef LIST_INCLUDED
#define LIST_INCLUDED

#include "cstddef"
#include "iterator"

namespace std
{
   template<typename T> class list
   {
   public:
      typedef iterator_t<T> iterator;
      typedef iterator_t<const T> const_iterator;
      list();
      list(size_t count, const T& value);
      list(const list& that);
      ~list();
      iterator begin();
      iterator end();
      iterator rbegin();
      iterator rend();
      const_iterator begin() const;
      const_iterator cbegin() const;
      const_iterator cend() const;
      const_iterator crbegin() const;
      const_iterator crend() const;
      const_iterator end() const;
      const_iterator rbegin() const;
      const_iterator rend() const;
      void clear();
      bool empty() const;
      void resize(size_t count);
      void resize(size_t count, const T& value);
      size_t size() const;
      void swap(list& that);
      const T& back() const;
      T& back();
      const T& front() const;
      T& front();
      iterator erase(const_iterator where);
      iterator erase(const_iterator first, const_iterator last);
      iterator insert(iterator where, const T& value);
      iterator insert(const_iterator where, const T& value);
      iterator insert(const_iterator where, size_t count, const T& value);
      void push_back(const T& value);
      void push_front(const T& value);
      void pop_back();
      void pop_front();
      void sort();
      void sort(bool (*sorted)(T& first, T& second));
   };
}

#endif