DStl:采用STL样式的各种数据结构实现-源码
大家应该已经看出来了，现在这个repo已经和数据结构没有什么必然的联系了。我们的目标是星辰大海stl。
一.容器
1.顺序容器
Deque和CircularQueue都是双向队列的实现，其中Deque符合stl对deque的规范，"push_front, push_back, emplace_front and emplace_back do not invalidate any references to elements of the deque."，这是Vector/vector/CircularQueue都不具备的能力。
2.关联容器
这四种平衡树是Map的四种实现，默认的模板参数是RBTree
迭代器支持+-，利用的是平衡树本来就支持但是stl偏偏没有的kth和rankof
然而即使每个节点多维护了一个size信息还是轻松干掉开O2的stl
链表/开放寻址的散列表，根据SFINA
文件下载
资源详情
[{"title":"（ 74 个子文件 112KB ） DStl:采用STL样式的各种数据结构实现-源码","children":[{"title":"DStl-master","children":[{"title":"DataStructure","children":[{"title":"Map.h <span style='color:#111;'> 7.19KB </span>","children":null,"spread":false},{"title":"TimSort.h <span style='color:#111;'> 3.24KB </span>","children":null,"spread":false},{"title":"vEBTree.h <span style='color:#111;'> 4.63KB </span>","children":null,"spread":false},{"title":"HashMap.h <span style='color:#111;'> 7.72KB </span>","children":null,"spread":false},{"title":"SkipList.h <span style='color:#111;'> 3.75KB </span>","children":null,"spread":false},{"title":"CircularQueue.h <span style='color:#111;'> 9.93KB </span>","children":null,"spread":false},{"title":"HashMap-OpenAddress.h <span style='color:#111;'> 6.69KB </span>","children":null,"spread":false},{"title":"Treap.h <span style='color:#111;'> 4.29KB </span>","children":null,"spread":false},{"title":"fc.h <span style='color:#111;'> 612B </span>","children":null,"spread":false},{"title":"BTree.h <span style='color:#111;'> 9.68KB </span>","children":null,"spread":false},{"title":"UInt.h <span style='color:#111;'> 5.75KB </span>","children":null,"spread":false},{"title":"Legacy","children":[{"title":"VisualDS.natvis <span style='color:#111;'> 503B </span>","children":null,"spread":false},{"title":"NaiveDB.h <span style='color:#111;'> 10.47KB </span>","children":null,"spread":false},{"title":"vEBTree-pointer.h <span style='color:#111;'> 6.32KB </span>","children":null,"spread":false},{"title":"SegmentTree.h <span style='color:#111;'> 2.77KB </span>","children":null,"spread":false},{"title":"Map-List.h <span style='color:#111;'> 9.94KB </span>","children":null,"spread":false},{"title":"SegmentTreeUtil.h <span style='color:#111;'> 1.81KB </span>","children":null,"spread":false}],"spread":true},{"title":"LeftistTree.h <span style='color:#111;'> 1.78KB </span>","children":null,"spread":false},{"title":"Test","children":[{"title":"Map_Speed.cpp <span style='color:#111;'> 3.23KB </span>","children":null,"spread":false},{"title":"BIT_SegmentTree_Correct.cpp <span style='color:#111;'> 1.20KB </span>","children":null,"spread":false},{"title":"Sort_Speed.cpp <span style='color:#111;'> 932B </span>","children":null,"spread":false},{"title":"SequenceContainer_Speed.cpp <span style='color:#111;'> 2.40KB </span>","children":null,"spread":false},{"title":"vEBTree_BIT_Speed.cpp <span style='color:#111;'> 1.46KB </span>","children":null,"spread":false},{"title":"Makefile <span style='color:#111;'> 144B </span>","children":null,"spread":false},{"title":"make.py <span style='color:#111;'> 1.11KB </span>","children":null,"spread":false},{"title":"MemPool_Speed.cpp <span style='color:#111;'> 554B </span>","children":null,"spread":false},{"title":"SharedPtr_Correct.cpp <span style='color:#111;'> 1020B </span>","children":null,"spread":false},{"title":"LuoguP3371Dijkstra-FibHeap.cpp <span style='color:#111;'> 3.92KB </span>","children":null,"spread":false},{"title":"Heap.cpp <span style='color:#111;'> 1.54KB </span>","children":null,"spread":false},{"title":"LuoguP3377LeftistTree.cpp <span style='color:#111;'> 2.24KB </span>","children":null,"spread":false}],"spread":false},{"title":"Trie.h <span style='color:#111;'> 3.55KB </span>","children":null,"spread":false},{"title":"Algorithm.h <span style='color:#111;'> 11.71KB </span>","children":null,"spread":false},{"title":"TreeUtil.h <span style='color:#111;'> 2.46KB </span>","children":null,"spread":false},{"title":"PriorityQueue.h <span style='color:#111;'> 1.10KB </span>","children":null,"spread":false},{"title":"BITTree.h <span style='color:#111;'> 1.83KB </span>","children":null,"spread":false},{"title":"String.h <span style='color:#111;'> 4.53KB </span>","children":null,"spread":false},{"title":"BIT.h <span style='color:#111;'> 1.22KB </span>","children":null,"spread":false},{"title":"List.h <span style='color:#111;'> 8.67KB </span>","children":null,"spread":false},{"title":"BigInt.h <span style='color:#111;'> 5.99KB </span>","children":null,"spread":false},{"title":"PairingHeap.h <span style='color:#111;'> 4.62KB </span>","children":null,"spread":false},{"title":"Vector.h <span style='color:#111;'> 3.91KB </span>","children":null,"spread":false},{"title":"IntrusiveList.h <span style='color:#111;'> 3.07KB </span>","children":null,"spread":false},{"title":"FibHeap.h <span style='color:#111;'> 2.88KB </span>","children":null,"spread":false},{"title":"DynamicSegTree.h <span style='color:#111;'> 3.39KB </span>","children":null,"spread":false},{"title":"RBTree.h <span style='color:#111;'> 8.93KB </span>","children":null,"spread":false},{"title":"BitSet.h <span style='color:#111;'> 3.75KB </span>","children":null,"spread":false},{"title":"KDTree.h <span style='color:#111;'> 3.13KB </span>","children":null,"spread":false},{"title":"Deque.h <span style='color:#111;'> 6.18KB </span>","children":null,"spread":false},{"title":"PersistentArray.h <span style='color:#111;'> 1.62KB </span>","children":null,"spread":false},{"title":"Fun","children":[{"title":"Ptr32.h <span style='color:#111;'> 1.48KB </span>","children":null,"spread":false},{"title":"Complexity.h <span style='color:#111;'> 3.00KB </span>","children":null,"spread":false},{"title":"Calculator.h <span style='color:#111;'> 6.36KB </span>","children":null,"spread":false},{"title":"Matrix.h <span style='color:#111;'> 8.79KB </span>","children":null,"spread":false},{"title":"Polynomial.h <span style='color:#111;'> 5.95KB </span>","children":null,"spread":false},{"title":"SharedPtr.h <span style='color:#111;'> 3.04KB </span>","children":null,"spread":false},{"title":"Profiler.h <span style='color:#111;'> 373B </span>","children":null,"spread":false},{"title":"MemPool.h <span style='color:#111;'> 3.09KB </span>","children":null,"spread":false}],"spread":false},{"title":"AVL.h <span style='color:#111;'> 6.41KB </span>","children":null,"spread":false},{"title":"ForwardList.h <span style='color:#111;'> 4.90KB </span>","children":null,"spread":false},{"title":"Util.h <span style='color:#111;'> 2.49KB </span>","children":null,"spread":false},{"title":"PersistentTreap.h <span style='color:#111;'> 2.81KB </span>","children":null,"spread":false},{"title":"MinMaxHeap.h <span style='color:#111;'> 2.85KB </span>","children":null,"spread":false},{"title":"Template","children":[{"title":"SetT.h <span style='color:#111;'> 5.69KB </span>","children":null,"spread":false},{"title":"IterTool.h <span style='color:#111;'> 7.19KB </span>","children":null,"spread":false},{"title":"ArrayT.h <span style='color:#111;'> 1.52KB </span>","children":null,"spread":false},{"title":"RefWrapper.h <span style='color:#111;'> 1.64KB </span>","children":null,"spread":false},{"title":"SIUnit.h <span style='color:#111;'> 6.94KB </span>","children":null,"spread":false},{"title":"TypeName.h <span style='color:#111;'> 2.40KB </span>","children":null,"spread":false},{"title":"Function.h <span style='color:#111;'> 2.13KB </span>","children":null,"spread":false},{"title":"ListT.h <span style='color:#111;'> 6.21KB </span>","children":null,"spread":false}],"spread":false},{"title":"HashMapUtil.h <span style='color:#111;'> 2.22KB </span>","children":null,"spread":false},{"title":"Splay.h <span style='color:#111;'> 4.46KB </span>","children":null,"spread":false}],"spread":false},{"title":"README.md <span style='color:#111;'> 5.42KB </span>","children":null,"spread":false},{"title":".gitignore <span style='color:#111;'> 42B </span>","children":null,"spread":false}],"spread":true}],"spread":true}]
评论信息
其他资源
- 数字滤波器的C语言实现，包括高通、低通、带通滤波器
- STM32自动浇花系统.zip
- SM2246XT开卡.rar
- 数帅NAS下载器随机光盘、各版本固件ROM
- 基于锁相环的角度观测器C语言实现
- java加入购物车源码实例（附数据库文件）
- stm32L151c8t6 USART1例程
- 六自由度数学模型matlab
- DMA+ADC+TIMER+FFT
- 网络信息安全论文：网络信息安全浅析
- 交通灯课程设计报告.doc
- C#Twain.zip
- 基于无线信道相位的高效物理层秘密密钥生成和认证方案
- XSStrike-master.zip
- c# 画椭圆鼠标拖动
- omni disk sweeper
- 深信服AF高级认证考试_B卷75分.pdf
- 【自己编写的简单FTP客户端（附服务端）】
- LDA+C+代码(Zhou Li)
- 数字电位器mcp41010 SPI接口 C51控制程序
- Computational Fluid Dynamics - Principles and Applications - J. Blazek.pdf
- 最新贷款网站源码
- Spring定时任务包含jar包与代码和多种方式的实现
- mysql-connector-java-5.1.17-bin.jar
- BaiduMapsApiDemo
免责申明
【只为小站】的资源来自网友分享，仅供学习研究，请务必在下载后24小时内给予删除，不得用于其他任何用途，否则后果自负。基于互联网的特殊性，【只为小站】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查；无论 【只为小站】 经营者是否已进行审查，用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场，基于网友分享，根据中国法律《信息网络传播权保护条例》第二十二条之规定，若资源存在侵权或相关问题请联系本站客服人员，zhiweidada#qq.com，请把#换成@，本站将给予最大的支持与配合，做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明
本站所有资源不代表本站的观点或立场，基于网友分享，根据中国法律《信息网络传播权保护条例》第二十二条之规定，若资源存在侵权或相关问题请联系本站客服人员，zhiweidada#qq.com，请把#换成@，本站将给予最大的支持与配合，做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明