ホーム | ブログ | C++辞典 | サイトマップ | FAQ | 掲示板 | リンク集
メイン・メニュー
インデックス
プログラミング
その他
<list>ヘッダ の変更点


 * <list>ヘッダ [#q26c5a1b]
 
 &aname(list);
 ** list クラス [#vf16ba6f]
 ** list クラステンプレート [#vf16ba6f]
 
 namespace std {~
 &nbsp; template<class T, class Allocator = allocator<T> >~
 &nbsp; &nbsp; class ''list'' {~
 &nbsp; &nbsp; public:~
 &nbsp; &nbsp; &nbsp; typedef typename Allocator::reference ''[[reference>#reference]]'';~
 &nbsp; &nbsp; &nbsp; typedef typename Allocator::const_reference  ''[[const_reference>#const_reference]]'';~
 &nbsp; &nbsp; &nbsp; typedef '''処理系定義''' ''[[iterator>#iterator]]'';~
 &nbsp; &nbsp; &nbsp; typedef '''処理系定義''' ''[[const_iterator>#const_iterator]]'';~
 &nbsp; &nbsp; &nbsp; typedef '''処理系定義''' ''[[size_type>#size_type]]'';~
 &nbsp; &nbsp; &nbsp; typedef '''処理系定義''' ''[[difference_type>#difference_type]]'';~
 &nbsp; &nbsp; &nbsp; typedef T ''[[value_type>#value_type]]'';~
 &nbsp; &nbsp; &nbsp; typedef Allocator ''[[allocator_type>#allocator_type]]'';~
 &nbsp; &nbsp; &nbsp; typedef typename Allocator::pointer ''[[pointer>#pointer]]'';~
 &nbsp; &nbsp; &nbsp; typedef typename Allocator::const_pointer ''[[const_pointer>#const_pointer]]'';~
 &nbsp; &nbsp; &nbsp; typedef std::reverse_iterator<iterator> ''[[reverse_iterator>#reverse_iterator]]'';~
 &nbsp; &nbsp; &nbsp; typedef std::reverse_iterator<const_iterator> ''[[const_reverse_iterator>#const_reverse_iterator]]'';~
 
 &nbsp; &nbsp; &nbsp; explicit ''[[list>#ctor]]''(const Allocator& '''a''' = Allocator());~
 &nbsp; &nbsp; &nbsp; explicit ''[[list>#ctor]]''(size_type '''n''', const value_type& '''value''' = T(),~
 &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; const Allocator& '''a''' = Allocator()); ~
 &nbsp; &nbsp; &nbsp; template<class [[InputIterator>反復子#input]]>~
 &nbsp; &nbsp; &nbsp; &nbsp; ''[[list>#ctor]]''([[InputIterator>反復子#input]] '''first''', [[InputIterator>反復子#input]] '''last''', const Allocator& '''a''' = Allocator());~
 &nbsp; &nbsp; &nbsp; ''[[list>#ctor]]''(const list<T, Allocator>& '''x''');~
 &nbsp; &nbsp; &nbsp; ''[[~list>#dtor]]''();~
 &nbsp; &nbsp; &nbsp; list<T, Allocator>& ''[[operator=>#op_eq]]''(const list<T, Allocator>& '''x''');~
 &nbsp; &nbsp; &nbsp; template<class [[InputIterator>反復子#input]]>~
 &nbsp; &nbsp; &nbsp; &nbsp; list<T, Allocator>& ''[[assign>#assign]]''([[InputIterator>反復子#input]] '''first''', [[InputIterator>反復子#input]] '''last''');~
 &nbsp; &nbsp; &nbsp; list<T, Allocator>& ''[[assign>#assign]]''(size_type '''n''', const T& '''u''');~
 &nbsp; &nbsp; &nbsp; allocator_type ''[[get_allocator>#get_allocator]]''() const;~
 
 &nbsp; &nbsp; &nbsp; iterator ''[[begin>#begin]]''();~
 &nbsp; &nbsp; &nbsp; const_iterator ''[[begin>#begin]]''() const;~
 &nbsp; &nbsp; &nbsp; iterator ''[[end>#end]]''();~
 &nbsp; &nbsp; &nbsp; const_iterator ''[[end>#end]]''() const;~
 &nbsp; &nbsp; &nbsp; reverse_iterator ''[[rbegin>#rbegin]]''();~
 &nbsp; &nbsp; &nbsp; const_reverse_iterator ''[[rbegin>#rbegin]]''() const;~
 &nbsp; &nbsp; &nbsp; reverse_iterator ''[[rend>#rend]]''();~
 &nbsp; &nbsp; &nbsp; const_reverse_iterator ''[[rend>#rend]]''() const;~
 
 &nbsp; &nbsp; &nbsp; size_type ''[[size>#size]]''() const:~
 &nbsp; &nbsp; &nbsp; size_type ''[[max_size>#max_size]]''() const;~
 &nbsp; &nbsp; &nbsp; void ''[[resize>#resize]]''(size_type '''sz''', const T& '''c''' = T());~
 &nbsp; &nbsp; &nbsp; size_type ''[[capacity>#capacity]]''() const;~
 &nbsp; &nbsp; &nbsp; bool ''[[empty>#empty]]''() const;~
 &nbsp; &nbsp; &nbsp; void ''[[reserve>#reserve]]''(size_type '''n''');~
 
 &nbsp; &nbsp; &nbsp; reference ''[[front>#front]]''();~
 &nbsp; &nbsp; &nbsp; const_reference ''[[front>#front]]''() const;~
 &nbsp; &nbsp; &nbsp; reference ''[[back>#back]]''();~
 &nbsp; &nbsp; &nbsp; const_reference ''[[back>#back]]''() const;~
 
 &nbsp; &nbsp; &nbsp; void ''[[push_back>#push_back]]''(const T& '''x''');~
 &nbsp; &nbsp; &nbsp; void ''[[push_front>#push_front]]''(const T& '''x''');~
 &nbsp; &nbsp; &nbsp; void ''[[pop_back>#pop_back]]''();~
 &nbsp; &nbsp; &nbsp; void ''[[pop_front>#pop_front]]''();~
 
 &nbsp; &nbsp; &nbsp; iterator ''[[insert>#insert]]''(iterator '''position''', const T& '''x''');~
 &nbsp; &nbsp; &nbsp; void ''[[insert>#insert]]''(iterator '''position''', size_type '''n''', const T& '''x''');~
 &nbsp; &nbsp; &nbsp; template<class [[InputIterator>反復子#input]]>~
 &nbsp; &nbsp; &nbsp; &nbsp; void ''[[insert>#insert]]''(iterator '''position''', [[InputIterator>反復子#input]] '''first''', [[InputIterator>反復子#input]] '''last''');~
 
 &nbsp; &nbsp; &nbsp; &nbsp; void ''[[erase>#erase]]''(iterator '''position''');~
 &nbsp; &nbsp; &nbsp; &nbsp; void ''[[erase>#erase]]''(iterator '''first''', iterator '''last''');~
 &nbsp; &nbsp; &nbsp; void ''[[swap>#swap]]''(list<T, Allocator>& '''x''');~
 &nbsp; &nbsp; &nbsp; void ''[[clear>#clear]]''();~
 
 &nbsp; &nbsp; &nbsp; void ''[[splice>#splice]]''(iterator '''position''', list<T, Allocator>& '''x''');~
 &nbsp; &nbsp; &nbsp; void ''[[splice>#splice]]''(iterator '''position''', list<T, Allocator>& '''x''', iterator '''i''');~
 &nbsp; &nbsp; &nbsp; void ''[[splice>#splice]]''(iterator '''position''', list<T, Allocator>& '''x''', iterator '''first''', iterator '''last''');~
 
 &nbsp; &nbsp; &nbsp; void ''[[remove>#remove]]''(const T& '''value''');~
 &nbsp; &nbsp; &nbsp; template<class Predicate>~
 &nbsp; &nbsp; &nbsp; &nbsp; void ''[[remove_if>#remove_if]]''(Predicate '''pred''');
 
 &nbsp; &nbsp; &nbsp; void ''[[uniue>#unique]]''();~
 &nbsp; &nbsp; &nbsp; template<class BinaryPredicate>~
 &nbsp; &nbsp; &nbsp; &nbsp; void ''[[unique>#unique]]''(BinaryPredicate '''pred''');~
 
 &nbsp; &nbsp; &nbsp; void ''[[merge>#merge]]''(list<T, Allocator>& '''x''');~
 &nbsp; &nbsp; &nbsp; template<class Compare>~
 &nbsp; &nbsp; &nbsp; &nbsp; void ''[[merge>#merge]]''(list<T, Allocator>& '''x''', Compare '''comp''');~
 
 &nbsp; &nbsp; &nbsp; void ''[[sort>#sort]]''();~
 &nbsp; &nbsp; &nbsp; template<class Compare>~
 &nbsp; &nbsp; &nbsp; &nbsp; void ''[[sort>#sort]]''(Compare '''comp''');~
 &nbsp; };~
 }~

トップ   編集 差分 バックアップ 添付 複製 名前変更   一覧 単語検索   ヘルプ   最終更新のRSS
 ホーム | プロフィール | メール | ログイン | 管理
Copyright © 2005-2009 by TAKAGI Nobuhisa