标准库头文件 <forward_list>

 

C++

语言

标准库头文件

自立与有宿主实现

具名要求

语言支持库

概念库 (C++20)

诊断库

工具库

字符串库

容器库

迭代器库

范围库 (C++20)

算法库

数值库

输入/输出库

本地化库

正则表达式库 (C++11)

原子操作库 (C++11)

线程支持库 (C++11)

文件系统库 (C++17)

技术规范

 

标准库头文件

语言支持
<cstddef> <limits> <climits> <coroutine>	<cfloat> <cstdint> <new> <source_location>	<typeinfo> <exception> <initializer_list> <version>	<csignal> <csetjmp> <cstdarg>
概念
<concepts>
诊断
<stdexcept>	<cassert>	<cerrno>	<system_error>
通用工具
<utility> <memory> <memory_resource> <scoped_allocator>     <compare>	<bitset> <tuple> <optional> <any> <variant>	<type_traits> <ratio> <chrono> <typeindex> <functional>	<ctime> <cstdlib>
字符串
<string> <string_view> <cstring>	<charconv> <format>	<cctype> <cwctype>	<cwchar> <cuchar>
本地化
<locale>	<codecvt>	<clocale>
容器
<span> <array> <vector>	<deque> <forward_list> <list>	<map> <set> <queue>	<unordered_map> <unordered_set> <stack>
迭代器
<iterator>
范围
<ranges>
算法
<algorithm>	<execution>
数值
<complex> <random>	<valarray> <numeric>	<bit> <numbers>	<cfenv> <cmath>
输入/输出
<iosfwd> <ios> <iomanip> <streambuf>	<istream> <ostream> <iostream>	<sstream> <fstream> <syncstream>	<cstdio> <cinttypes> <strstream>
正则表达式
<regex>
文件系统
<filesystem>
线程支持
<thread> <atomic> <mutex>	<shared_mutex> <condition_variable> <future>	<stop_token> <semaphore>	<latch> <barrier>
C 兼容
<ciso646> <cstdalign>	<cstdbool> <ccomplex>	<ctgmath>

 

此头文件是容器库的一部分。

包含
<initializer_list>(C++11)
类
forward_list (C++11 起)	单链表 (类模板)
函数
operator==operator!=operator<operator<=operator>operator>=	按照字典顺序比较 forward_list 中的值 (函数模板)
std::swap(std::forward_list) (C++11)	特化 std::swap 算法 (函数模板)

概要

#include <initializer_list>
 
namespace std {
 
template <class T, class Allocator = allocator<T> > class forward_list;
 
template <class T, class Allocator>
    bool operator==(const forward_list<T,Allocator>& x, 
                            const forward_list<T,Allocator>& y);
template <class T, class Allocator>
    bool operator< (const forward_list<T,Allocator>& x, 
                    const forward_list<T,Allocator>& y);
template <class T, class Allocator>
    bool operator!=(const forward_list<T,Allocator>& x, 
                        const forward_list<T,Allocator>& y);
template <class T, class Allocator>
    bool operator> (const forward_list<T,Allocator>& x, 
                    const forward_list<T,Allocator>& y);
template <class T, class Allocator>
    bool operator>=(const forward_list<T,Allocator>& x, 
                        const forward_list<T,Allocator>& y);
template <class T, class Allocator>
    bool operator<=(const forward_list<T,Allocator>& x, 
                        const forward_list<T,Allocator>& y);
 
template <class T, class Allocator>
    void swap(forward_list<T,Allocator>& x, forward_list<T,Allocator>& y);
 
}

类 std::list

template <class T, class Allocator = allocator<T> >
class forward_list {
public:
    // 类型：
    typedef value_type&                                         reference;
    typedef const value_type&                                   const_reference;
    typedef /* 由实现定义 */                                     iterator;
    typedef /* 由实现定义 */                                     const_iterator; 
    typedef /* 由实现定义 */                                     size_type;
    typedef /* 由实现定义 */                                     difference_type;
    typedef T                                                   value_type;
    typedef Allocator                                           allocator_type;
    typedef typename allocator_traits<Allocator>::pointer       pointer;
    typedef typename allocator_traits<Allocator>::const_pointer const_pointer;
 
    // 构造/复制/销毁：
    explicit forward_list(const Allocator& = Allocator());
    explicit forward_list(size_type n);
    forward_list(size_type n, const T& value,const Allocator& = Allocator());
    template <class InputIterator>
        forward_list(InputIterator first, InputIterator last,
                     const Allocator& = Allocator());
    forward_list(const forward_list<T,Allocator>& x);
    forward_list(forward_list&&);
    forward_list(const forward_list&, const Allocator&);
    forward_list(forward_list&&, const Allocator&);
    forward_list(initializer_list<T>, const Allocator& = Allocator());
 
    ~forward_list();
    forward_list<T,Allocator>& operator=(const forward_list<T,Allocator>& x);
    forward_list<T,Allocator>& operator=(forward_list<T,Allocator>&& x);
    forward_list& operator=(initializer_list<T>);
    template <class InputIterator>
        void assign(InputIterator first, InputIterator last);
    void assign(size_type n, const T& t);
    void assign(initializer_list<T>);
    allocator_type get_allocator() const noexcept;
 
    // 迭代器：
    iterator                before_begin() noexcept;
    const_iterator          before_begin() const noexcept;
    iterator                begin() noexcept;
    const_iterator          begin() const noexcept;
    iterator                end() noexcept;
    const_iterator          end() const noexcept;
 
    const_iterator          cbegin() noexcept;
    const_iterator          cbefore_begin() const noexcept;
    const_iterator          cend() noexcept;
 
    // 容量：
    size_type max_size() const noexcept;
    bool      empty() const noexcept;
 
    // 元素访问：
    reference       front();
    const_reference front() const;
 
    // 修改器：
    template <class... Args> void emplace_front(Args&&... args);
 
    void push_front(const T& x);
    void push_front(T&& x);
    void pop_front();
 
    template <class... Args> 
        iterator emplace_after(const_iterator position, Args&&... args);
    iterator insert_after(const_iterator position, const T& x);
    iterator insert_after(const_iterator position, T&& x);
 
    iterator insert_after(const_iterator position, size_type n, const T& x);
    template <class InputIterator>
        iterator insert_after(const_iterator position, InputIterator first, 
                              InputIterator last);
    iterator insert_after(const_iterator position, initializer_list<T> il);
 
    iterator erase_after(const_iterator position);
    iterator erase_after(const_iterator position, iterator last);
    void swap(forward_list<T,Allocator>&);
 
    void resize(size_type sz);
    void resize(size_type sz, const value_type& c);
    void clear() noexcept;
 
    // forward_list 操作：
    void splice_after(const_iterator position, forward_list<T,Allocator>& x);
    void splice_after(const_iterator position, forward_list<T,Allocator>&& x);
    void splice_after(const_iterator position, forward_list<T,Allocator>& x,
                    const_iterator i);
    void splice_after(const_iterator position, forward_list<T,Allocator>&& x,
                    const_iterator i);
    void splice_after(const_iterator position, forward_list<T,Allocator>& x,
                    const_iterator first, const_iterator last);
    void splice_after(const_iterator position, forward_list<T,Allocator>&& x,
                    const_iterator first, const_iterator last);
 
    void remove(const T& value);
    template <class Predicate> void remove_if(Predicate pred);
 
    void unique();
    template <class BinaryPredicate> void unique(BinaryPredicate binary_pred);
 
    void merge(forward_list<T,Allocator>& x);
    void merge(forward_list<T,Allocator>&& x);
    template <class Compare> void merge(forward_list<T,Allocator>& x, Compare comp);
    template <class Compare> void merge(forward_list<T,Allocator>&& x, Compare comp);
 
    void sort();
    template <class Compare> void sort(Compare comp);
    void reverse() noexcept;
};