Templates C++ 教程,英文版(精华).pptVIP

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

* * * * Outline fig14_04.cpp (1 of 3) Use a function template to process Stack class-template specializations * Outline fig14_04.cpp (2 of 3) * Outline fig14_04.cpp (3 of 3) * 14.5 Nontype Parameters and Default Types for Class Templates Nontype template parameters Can have default arguments Are treated as consts Example Template header: template typename T, int elements = 50 Declaration: Stack double salesFigures; Stack double, 100 salesFigures; T stackHolder[ elements ]; Type parameters can have default arguments too Example Template header: template typename T = string Declaration: Stack jobDescriptions; * Performance Tip 14.2 When appropriate, specify the size of a container class (such as an array class or a stack class) at compile time (possibly through a nontype template parameter). This eliminates the execution-time overhead of using new to create the space dynamically. * Software Engineering Observation 14.3 Specifying the size of a container at compile time avoids the potentially fatal execution-time error if new is unable to obtain the needed memory. Linked List Overview Singly Linked List A Linked List is made of a series of “nodes”, each with: an associated data object (node) a “pointer” (reference) to the next node of the list traverse the list by following each node’s next pointer, starting at the head*, until we reach the tail* * data next* data data NULL (0) head* tail* Item Value Item Value Item Value Linked List Node next* next* Adding a Node to an Empty List AddToHead head* = tail* = NULL (0) Save location of current head node * next = head; (current head = NULL) Create new node at head head = new node; Set data value of new node head-data = value; Update what the head points to for the next node in the list, which was the previous head. Set tail = head (only one node in the list) head-next = next; tail = head; * data next* Item Value next* data data NULL (0) head* = tail* Item Value next* Added a Node to an Existing List AddToHe

文档评论(0)

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

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

版权声明书
用户编号:8130065136000003

1亿VIP精品文档

相关文档