<list>ヘッダ †
list クラステンプレート †
namespace std {
template<class T, class Allocator = allocator<T> >
class list {
public:
typedef typename Allocator::reference reference;
typedef typename Allocator::const_reference const_reference;
typedef 処理系定義 iterator;
typedef 処理系定義 const_iterator;
typedef 処理系定義 size_type;
typedef 処理系定義 difference_type;
typedef T value_type;
typedef Allocator allocator_type;
typedef typename Allocator::pointer pointer;
typedef typename Allocator::const_pointer const_pointer;
typedef std::reverse_iterator<iterator> reverse_iterator;
typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
explicit list(const Allocator& a = Allocator());
explicit list(size_type n, const value_type& value = T(),
const Allocator& a = Allocator());
template<class InputIterator>
list(InputIterator first, InputIterator last, const Allocator& a = Allocator());
list(const list<T, Allocator>& x);
~list();
list<T, Allocator>& operator=(const list<T, Allocator>& x);
template<class InputIterator>
list<T, Allocator>& assign(InputIterator first, InputIterator last);
list<T, Allocator>& assign(size_type n, const T& u);
allocator_type get_allocator() const;
iterator begin();
const_iterator begin() const;
iterator end();
const_iterator end() const;
reverse_iterator rbegin();
const_reverse_iterator rbegin() const;
reverse_iterator rend();
const_reverse_iterator rend() const;
size_type size() const:
size_type max_size() const;
void resize(size_type sz, const T& c = T());
size_type capacity() const;
bool empty() const;
void reserve(size_type n);
reference front();
const_reference front() const;
reference back();
const_reference back() const;
void push_back(const T& x);
void push_front(const T& x);
void pop_back();
void pop_front();
iterator insert(iterator position, const T& x);
void insert(iterator position, size_type n, const T& x);
template<class InputIterator>
void insert(iterator position, InputIterator first, InputIterator last);
void erase(iterator position);
void erase(iterator first, iterator last);
void swap(list<T, Allocator>& x);
void clear();
void splice(iterator position, list<T, Allocator>& x);
void splice(iterator position, list<T, Allocator>& x, iterator i);
void splice(iterator position, list<T, Allocator>& x, iterator first, iterator last);
void remove(const T& value);
template<class Predicate>
void remove_if(Predicate pred);
void uniue();
template<class BinaryPredicate?>
void unique(BinaryPredicate? pred);
void merge(list<T, Allocator>& x);
template<class Compare>
void merge(list<T, Allocator>& x, Compare comp);
void sort();
template<class Compare>
void sort(Compare comp);
};
}
Last-modified: Wed, 07 Dec 2005 20:27:22 JST (4518d)