IBM官方C++ STL参考文档（V2R3）更新至2019

需积分: 13 14 浏览量更新于2024-07-16 收藏 2.05MB PDF 举报

这份文档是关于C++ Standard Template Library (STL) 的最新参考手册，由国际商业机器公司（IBM）官方编撰并针对IBM z/OS操作系统中的XL C/C++编译器进行了优化。它适用于IBM z/OS Version 2 Release 3 (5650-ZOS)，并且适用于后续所有版本，直至出现新的版本说明。文档取代了之前的SC09-4949-05版，用户需确保根据所列程序的级别选择合适的版本，并安装所有必要的补丁程序以保证系统的兼容性和稳定性。该文档强调在使用前阅读页面481的“Notices”部分的通用信息，包含了版权声明、使用条款以及用户反馈渠道。用户可以通过电子邮件compinfo@cn.ibm.com向IBM提供反馈，确保包含您的电子邮件地址以便于回应，并注明书籍标题、订单号、页码或与问题相关的主题。通过发送信息，您同意授予IBM无限制的权利来使用或以他们认为合适的方式分发这些信息，而无需对您承担任何义务。版权方面，文档包含了IBM Corporation（1999年和2017年）和P.J. Plauger及/或Dinkumware Ltd.（1992年至2006年）的版权，以及1994年Hewlett-Packard Company的某些内容。这表明了文档中技术知识的来源和版权归属。本C++ STL参考手册提供了对容器（如vector、list、map等）、算法、迭代器等核心元素的详尽描述，还包括了STL设计原则和最佳实践，帮助程序员在IBM z/OS环境中高效地利用C++进行编程。由于其更新日期为2019年2月15日，它反映了当时C++语言的最新标准和技术发展，对于开发者来说具有很高的实用价值和参考价值。

Localization Classes and Templates The Localization Library permits a C++ program to address the

cultural differences of its various users.

Standard C++ header Equivalent in previous versions

<locale> no equivalent

The Containers, Iterators and Algorithms Libraries (the Standard Template Library) The Standard

Template Library (STL) is a facility for the management and manipulation of collections of objects.

Standard C++ header Equivalent in previous versions

<algorithm> no equivalent

<bitset> no equivalent

<deque> no equivalent

<iterator> no equivalent

<list> no equivalent

<map> no equivalent

<queue> no equivalent

<set> no equivalent

<stack> no equivalent

<unordered_map> no equivalent

<unordered set> no equivalent

<vector> no equivalent

The Standard Numerics Library The Numerics Library is a facility for performing seminumerical

operations.

Users who require library facilities for complex arithmetic but want to maintain compatibility with older

compilers may use the compatibility complex numbers library whose types are dened in the non-

standard header le <complex.h>. Although the header les <complex> and <complex.h> are similar in

purpose, they are mutually incompatible.

Standard C++ header

Equivalent in previous versions

<complex> no equivalent

<numeric> no equivalent

<valarray> no equivalent

The Standard Input/Output Library The standard iostreams library differs from the compatibility

iostreams in a number of important respects. To maintain compatibility between such a product and

VisualAge

C++ Version 5.0 or z/OS

C/C++ Version 1.2, use instead the compatibility iostreams library.

Standard C++ header

Equivalent in previous versions

<fstream> no equivalent

<iomanip> no equivalent

<ios> no equivalent

<iosfwd> no equivalent

<iostream> no equivalent

8 z/OS: Standard C++ Library Reference

Standard C++ Header

<regex>

<type_traits>

<tuple>

<unordered_map>

<unordered_set>

Description

Include the STL

standard header <algorithm> to dene numerous template functions that perform useful

algorithms. The descriptions that follow make extensive use of common template parameter names or

prexes to indicate the least powerful category of iterator permitted as an actual argument type:

• OutIt — to indicate an output iterator

• InIt

— to indicate an input iterator

• FwdIt — to indicate a forward iterator

• BidIt — to indicate a bidirectional iterator

• RanIt — to indicate a random-access iterator

The descriptions of these templates employ a number of conventions common to all algorithms.

Synopsis

namespace std {

template<class InIt, class Fun>

Fun for_each(InIt first, InIt last, Fun f);

template<class InIt, class T>

InIt find(InIt first, InIt last, const T& val);

template<class InIt, class Pred>

InIt find_if(InIt first, InIt last, Pred pr);

template<class FwdIt1, class FwdIt2>

FwdIt1 find_end(FwdIt1 first1, FwdIt1 last1,

FwdIt2 first2, FwdIt2 last2);

template<class FwdIt1, class FwdIt2, class Pred>

FwdIt1 find_end(FwdIt1 first1, FwdIt1 last1,

FwdIt2 first2, FwdIt2 last2, Pred pr);

template<class FwdIt1, class FwdIt2>

FwdIt1 find_first_of(FwdIt1 first1, FwdIt1 last1,

FwdIt2 first2, FwdIt2 last2);

template<class FwdIt1, class FwdIt2, class Pred>

FwdIt1 find_first_of(FwdIt1 first1, FwdIt1 last1,

FwdIt2 first2, FwdIt2 last2, Pred pr);

template<class FwdIt>

FwdIt adjacent_find(FwdIt first, FwdIt last);

template<class FwdIt, class Pred>

FwdIt adjacent_find(FwdIt first, FwdIt last, Pred pr);

template<class InIt, class T, class Dist>

typename iterator_traits<InIt>::difference_type

count(InIt first, InIt last,

const T& val);

template<class InIt, class Pred, class Dist>

typename iterator_traits<InIt>::difference_type

count_if(InIt first, InIt last,

Pred pr);

template<class InIt1, class InIt2>

pair<InIt1, InIt2> mismatch(InIt1 first, InIt1 last,

InIt2 x);

template<class InIt1, class InIt2, class Pred>

pair<InIt1, InIt2> mismatch(InIt1 first, InIt1 last,

InIt2 x, Pred pr);

template<class InIt1, class InIt2>

z/OS: Standard C++ Library Reference

bool equal(InIt1 first, InIt1 last, InIt2 x);

template<class InIt1, class InIt2, class Pred>

bool equal(InIt1 first, InIt1 last, InIt2 x, Pred pr);

template<class FwdIt1, class FwdIt2>

FwdIt1 search(FwdIt1 first1, FwdIt1 last1,

FwdIt2 first2, FwdIt2 last2);

template<class FwdIt1, class FwdIt2, class Pred>

FwdIt1 search(FwdIt1 first1, FwdIt1 last1,

FwdIt2 first2, FwdIt2 last2, Pred pr);

template<class FwdIt, class Dist, class T>

FwdIt search_n(FwdIt first, FwdIt last,

Dist n, const T& val);

template<class FwdIt, class Dist, class T, class Pred>

FwdIt search_n(FwdIt first, FwdIt last,

Dist n, const T& val, Pred pr);

template<class InIt, class OutIt>

OutIt copy(InIt first, InIt last, OutIt x);

template<class BidIt1, class BidIt2>

BidIt2 copy_backward(BidIt1 first, BidIt1 last,

BidIt2 x);

template<class T>

void swap(T& x, T& y);

template<class FwdIt1, class FwdIt2>

FwdIt2 swap_ranges(FwdIt1 first, FwdIt1 last,

FwdIt2 x);

template<class FwdIt1, class FwdIt2>

void iter_swap(FwdIt1 x, FwdIt2 y);

template<class InIt, class OutIt, class Unop>

OutIt transform(InIt first, InIt last, OutIt x,

Unop uop);

template<class InIt1, class InIt2, class OutIt,

class Binop>

OutIt transform(InIt1 first1, InIt1 last1,

InIt2 first2, OutIt x, Binop bop);

template<class FwdIt, class T>

void replace(FwdIt first, FwdIt last,

const T& vold, const T& vnew);

template<class FwdIt, class Pred, class T>

void replace_if(FwdIt first, FwdIt last,

Pred pr, const T& val);

template<class InIt, class OutIt, class T>

OutIt replace_copy(InIt first, InIt last, OutIt x,

const T& vold, const T& vnew);

template<class InIt, class OutIt, class Pred, class T>

OutIt replace_copy_if(InIt first, InIt last, OutIt x,

Pred pr, const T& val);

template<class FwdIt, class T>

void fill(FwdIt first, FwdIt last, const T& x);

template<class OutIt, class Size, class T>

void fill_n(OutIt first, Size n, const T& x);

template<class FwdIt, class Gen>

void generate(FwdIt first, FwdIt last, Gen g);

template<class OutIt, class Pred, class Gen>

void generate_n(OutIt first, Dist n, Gen g);

template<class FwdIt, class T>

FwdIt remove(FwdIt first, FwdIt last, const T& val);

template<class FwdIt, class Pred>

FwdIt remove_if(FwdIt first, FwdIt last, Pred pr);

template<class InIt, class OutIt, class T>

OutIt remove_copy(InIt first, InIt last, OutIt x,

const T& val);

template<class InIt, class OutIt, class Pred>

OutIt remove_copy_if(InIt first, InIt last, OutIt x,

Pred pr);

template<class FwdIt>

FwdIt unique(FwdIt first, FwdIt last);

template<class FwdIt, class Pred>

FwdIt unique(FwdIt first, FwdIt last, Pred pr);

template<class InIt, class OutIt>

OutIt unique_copy(InIt first, InIt last, OutIt x);

template<class InIt, class OutIt, class Pred>

OutIt unique_copy(InIt first, InIt last, OutIt x,

Pred pr);

template<class BidIt>

void reverse(BidIt first, BidIt last);

template<class BidIt, class OutIt>

OutIt reverse_copy(BidIt first, BidIt last, OutIt x);

template<class FwdIt>

void rotate(FwdIt first, FwdIt middle, FwdIt last);

Standard C++ Library Header Files

template<class FwdIt, class OutIt>

OutIt rotate_copy(FwdIt first, FwdIt middle,

FwdIt last, OutIt x);

template<class RanIt>

void random_shuffle(RanIt first, RanIt last);

template<class RanIt, class Fun>

void random_shuffle(RanIt first, RanIt last, Fun& f);

template<class BidIt, class Pred>

BidIt partition(BidIt first, BidIt last, Pred pr);

template<class BidIt, class Pred>

BidIt stable_partition(BidIt first, BidIt last,

Pred pr);

template<class RanIt>

void sort(RanIt first, RanIt last);

template<class RanIt, class Pred>

void sort(RanIt first, RanIt last, Pred pr);

template<class BidIt>

void stable_sort(BidIt first, BidIt last);

template<class BidIt, class Pred>

void stable_sort(BidIt first, BidIt last, Pred pr);

template<class RanIt>

void partial_sort(RanIt first, RanIt middle,

RanIt last);

template<class RanIt, class Pred>

void partial_sort(RanIt first, RanIt middle,

RanIt last, Pred pr);

template<class InIt, class RanIt>

RanIt partial_sort_copy(InIt first1, InIt last1,

RanIt first2, RanIt last2);

template<class InIt, class RanIt, class Pred>

RanIt partial_sort_copy(InIt first1, InIt last1,

RanIt first2, RanIt last2, Pred pr);

template<class RanIt>

void nth_element(RanIt first, RanIt nth, RanIt last);

template<class RanIt, class Pred>

void nth_element(RanIt first, RanIt nth, RanIt last,

Pred pr);

template<class FwdIt, class T>

FwdIt lower_bound(FwdIt first, FwdIt last,

const T& val);

template<class FwdIt, class T, class Pred>

FwdIt lower_bound(FwdIt first, FwdIt last,

const T& val, Pred pr);

template<class FwdIt, class T>

FwdIt upper_bound(FwdIt first, FwdIt last,

const T& val);

template<class FwdIt, class T, class Pred>

FwdIt upper_bound(FwdIt first, FwdIt last,

const T& val, Pred pr);

template<class FwdIt, class T>

pair<FwdIt, FwdIt> equal_range(FwdIt first,

FwdIt last, const T& val);

template<class FwdIt, class T, class Pred>

pair<FwdIt, FwdIt> equal_range(FwdIt first,

FwdIt last, const T& val, Pred pr);

template<class FwdIt, class T>

bool binary_search(FwdIt first, FwdIt last,

const T& val);

template<class FwdIt, class T, class Pred>

bool binary_search(FwdIt first, FwdIt last,

const T& val, Pred pr);

template<class InIt1, class InIt2, class OutIt>

OutIt merge(InIt1 first1, InIt1 last1,

InIt2 first2, InIt2 last2, OutIt x);

template<class InIt1, class InIt2, class OutIt,

class Pred>

OutIt merge(InIt1 first1, InIt1 last1,

InIt2 first2, InIt2 last2, OutIt x, Pred pr);

template<class BidIt>

void inplace_merge(BidIt first, BidIt middle,

BidIt last);

template<class BidIt, class Pred>

void inplace_merge(BidIt first, BidIt middle,

BidIt last, Pred pr);

template<class InIt1, class InIt2>

bool includes(InIt1 first1, InIt1 last1,

InIt2 first2, InIt2 last2);

template<class InIt1, class InIt2, class Pred>

bool includes(InIt1 first1, InIt1 last1,

z/OS: Standard C++ Library Reference

剩余495页未读，继续阅读

jike36

粉丝: 1
资源: 1

IBM官方C++ STL参考文档（V2R3）更新至2019

C++ API pdf

C++ Standard Library Quick Reference pdf 0分

ANSI C++ Reference

qt6 c++开发指南 pdf下载

C++程序设计语言pdf

c++实现pdf文件解析

图解算法使用C++ PDF下载

C++如何实现提取pdf文件的文字

C:\Users\Administrator\Desktop\TEST\1_0057429562_50060123.PDF获取最后的文件名并去掉后缀，并与C:\Users\Administrator\Desktop\TEST\2023-8-21\病历拼接起来，用python完成

c++primer中文版pdf

最新资源