c++标准库stl容器简介(C++ standard library STL container profile).docVIP

c++标准库stl容器简介(C++ standard library STL container profile).doc

  1. 1、本文档共9页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  5. 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  6. 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  7. 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  8. 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
c标准库stl容器简介(CstandardlibrarySTLcontainerprofile)

c++标准库stl容器简介(C++ standard library STL container profile) The STL: container (container): a data structure (Vector, Deque, List) template class. Indicator (iterator) provides a method of object access in the container, as a pointer. The algorithm (algorithm): used to operate the container data. / / common function Void (main) { Vectordouble records; / / define containers ... Records.push_back (...); / / press single number For_each (records.begin), records.end (printRecords) (), (); / / call for_each, execute traversal, and set the traversal operation Sort (records.begin), (records.end), (greaterdouble); / / sort. M1.swap (M2); //m1 and M2 exchange. } The container can return its access indicator. ((begin)), end () STL container: vector (vector) List (list) Deque (double ended queue) Starck (stack) Set (set) Map (map) Multiset Multimap BitSet Map: key and the associated value Access indicator: (.Begin): first to the container (.End): tail to the container (.Rbegin): the first point to reverse (.Rend): reverse tail Reverse output: For_each (reconds.rbegin), records.rend (printdouble) (), (); Example: iterative access elements: Vectorint v; Vectorint: iterator: it; For (it =v.begin); (it); it++ (=v.end!) Cout*itendl; (.Size): get the number of elements in the container (.Max_size): get the container. It can accommodate the number of elements (.Empty) to determine whether it is empty; The STL container provides object oriented operation. Vector can be backward dynamic growth. Vector (empty vector) Vector (n, x) contains a x value vector n Vector (V) copy construction Vector (first, last) between first and last from the copy indicator to Visit: V.at (I) V[i] (.Front): return the first element (.Back): return a reference to the last element .push_back (x): at the end add .insert (I, x) .insert (I, N, x) .insert (I, m, m, n) will copy the contents of N added to the I before (.Pop_back): delete the last element. .erase (I) .erase (first, last) (.Clear) delete all List and

您可能关注的文档

文档评论(0)

jgx3536 + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

版权声明书
用户编号:6111134150000003

1亿VIP精品文档

相关文档