awesome-repositories.com
博客
awesome-repositories.com

通过 AI 驱动的搜索,发现最优秀的开源仓库。

探索精选搜索开源替代品自托管软件博客网站地图
项目关于排名机制媒体报道MCP 服务器
法律隐私政策服务条款
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

3 个仓库

Awesome GitHub RepositoriesRadix Trees

A specialized tree structure where edges contain labels for optimized string lookups.

Distinct from Tree-Based Storage: Specific implementation of a radix tree, distinct from general tree-based storage for strings.

Explore 3 awesome GitHub repositories matching software engineering & architecture · Radix Trees. Refine with filters or upvote what's useful.

Awesome Radix Trees GitHub Repositories

用 AI 发现最棒的仓库。我们将通过 AI 为您搜索最匹配的仓库。
  • kodecocodes/swift-algorithm-clubkodecocodes 的头像

    kodecocodes/swift-algorithm-club

    29,099在 GitHub 上查看↗

    This project is a comprehensive collection of common computer science algorithms and data structures implemented in Swift. It serves as an educational reference and library for studying computational complexity, algorithmic logic, and data structure engineering through practical code examples. The repository provides a wide suite of data structure implementations, including various types of linked lists, heaps, hash tables, and an extensive range of hierarchical trees such as Red-Black, B-Tree, and Splay trees. It also covers diverse sorting and searching techniques, from basic bubble sort to

    Implements a radix tree for high-performance string lookups and deletions.

    Swiftalgorithmsdata-structuresswift
    在 GitHub 上查看↗29,099
  • jemalloc/jemallocjemalloc 的头像

    jemalloc/jemalloc

    10,950在 GitHub 上查看↗

    jemalloc is a general purpose C memory allocator designed as a replacement for the standard library malloc and free functions. It is a multi-threaded allocation library that emphasizes fragmentation avoidance and scalable concurrency for high-performance applications. The project reduces lock contention by using multiple independent memory arenas and thread-local cache layers. It minimizes latency by offloading the reclamation of unused memory pages to asynchronous background threads and utilizes huge page metadata storage to reduce translation lookaside buffer misses. The system includes a

    Employs a multi-level radix tree structure to quickly map memory addresses to allocation metadata.

    C
    在 GitHub 上查看↗10,950
  • streamich/json-joystreamich 的头像

    streamich/json-joy

    1,079在 GitHub 上查看↗

    json-joy 是一个用于构建实时协作应用和分布式系统的综合库。它提供了一个强大的框架,用于管理共享的 JSON 类数据结构,这些结构会自动合并来自多个用户的并发编辑,确保所有副本之间的一致状态,而无需中央协调服务器。 该项目通过高性能的数据处理方法脱颖而出,利用无冲突复制数据类型(CRDT)和基于逻辑时钟的同步来维护数据完整性。它包含一个专门的引擎,用于使用标准化的指针语法导航和操作复杂的嵌套对象,以及一个用于对文档应用细粒度、原子修改的工具包。这些功能辅以一个支持紧凑二进制格式的高速序列化库,以优化网络带宽和存储效率。 除了核心同步逻辑外,该库还提供了一套广泛的响应式状态管理和用户界面集成工具。它提供声明式的 Hooks 和组件,将共享数据模型直接绑定到基于 Web 的文本和代码编辑器,从而实现实时在线状态、远程光标渲染和本地历史记录跟踪等功能。该系统还支持高级数据处理,包括模式验证、表达式求值和高性能的树状数据组织。

    Implements optimized tree structures like Radix or Splay trees to provide efficient data storage, retrieval, and sorting for complex document models.

    TypeScriptcborcollaborationcollaborative
    在 GitHub 上查看↗1,079
  1. Home
  2. Software Engineering & Architecture
  3. String Processing Algorithms
  4. Tree-Based Storage
  5. Radix Trees

探索子标签

  • Metadata Address MappingUsing radix trees to map memory addresses to their associated allocation metadata for fast lookup. **Distinct from Radix Trees:** Applies radix trees to memory address mapping specifically, rather than general string lookups.