2 个仓库
Awesome GitHub RepositoriesInsertion-Order Maps
Map implementations that maintain the sequence of elements as they were inserted.
Distinct from Ordered Map Data Access: Focuses specifically on insertion order preservation rather than B-Tree key sorting
Explore 2 awesome GitHub repositories matching data & databases · Insertion-Order Maps. Refine with filters or upvote what's useful.
Awesome Insertion-Order Maps GitHub Repositories
用 AI 发现最棒的仓库。我们将通过 AI 为您搜索最匹配的仓库。
- duke-git/lancet
duke-git/lancet
5,295在 GitHub 上查看Lancet 是 Go 标准库的全面扩展，提供了一系列可复用的函数和数据结构，旨在减少应用中的样板代码。它是一个跨多个领域的通用工具包，包括并发、安全、网络和函数式逻辑。 该项目的特色在于针对 Go 并发的专用工具包（如键控锁和基于通道的流处理），以及支持柯里化和函数组合的专用函数式编程套件。它还包含一个使用 AES、RSA 和 SM 标准实现对称和非对称加密的专用密码学库。 该库涵盖了广泛的功能领域，包括 LRU 缓存和二叉搜索树等高级数据结构、代数和统计数学计算，以及用于进程和文件管理的操作系统集成。它还提供了用于 HTTP 网络、日期和时间操作，以及集合代数和惰性流求值等高级数据处理的实用程序。
Provides a map implementation that preserves the sequence of elements as they were inserted.
Gogenericsgogolang - apple/swift-collections
apple/swift-collections
4,438在 GitHub 上查看This library provides a collection of specialized data structures for the Swift language that extend the standard library with advanced container types. It includes implementations for double-ended queues using ring-buffers, priority queues based on min-max heaps, and memory-efficient bit-set and bit-array storage for boolean values. The project features ordered collections that maintain elements in sorted order via B-tree implementations, as well as persistent sets and dictionaries that use compressed prefix trees to share data between mutated copies. It also provides specialized containers
Provides specialized set and dictionary variants that preserve the original sequence of inserted elements.
Swiftcollectioncontainerdeque
