开发工具:
文件大小: 6kb
下载次数: 0
上传时间: 2010-12-21
详细说明： Our doubly linked lists have two header elements: the "head" just before the first element and the "tail" just after the last element. The `prev' link of the front header is null, as is the `next' link of the back header. Their other two links point toward each other via the interior elements of the list. An empty list looks like this: +------+ +------+ <---| head |<--->| tail |---> +------+ +------+ A lis t with two elements in it looks like this: +------+ +-------+ +-------+ +------+ <---| head |<--->| 1 |<--->| 2 |<--->| tail |<---> +------+ +-------+ +-------+ +------+ The symmetry(对称) of this arrangement(布置) eliminates(消除) lots of special cases in list processing. For example, take a look at list_remove(): it takes only two pointer assignments and no conditionals. That's a lot simpler than the code would be without header elements. (Because only one of the pointers in each header element is used, we could in fact combine them into a single header element without sacrificing(牺牲) this simplicity. But using two separate elements allows us to do a little bit of checking on some operations, which can be valuable.) */ ...展开收缩
(系统自动生成,下载前可以参看下载内容)
下载文件列表
相关说明
- 本站资源为会员上传分享交流与学习,如有侵犯您的权益,请联系我们删除.
- 本站是交换下载平台，提供交流渠道，下载内容来自于网络，除下载问题外，其它问题请自行百度。
- 本站已设置防盗链，请勿用迅雷、QQ旋风等多线程下载软件下载资源，下载后用WinRAR最新版进行解压.
- 如果您发现内容无法下载，请稍后再次尝试；或者到消费记录里找到下载记录反馈给我们.
- 下载后发现下载的内容跟说明不相乎，请到消费记录里找到下载记录反馈给我们，经确认后退回积分.
- 如下载前有疑问，可以通过点击"提供者"的名字，查看对方的联系方式，联系对方咨询.
