C的数组开发库-Judy
2020-03-02 22:33:42 阿炯

Judy是一个通用的动态数组的C调用库,Judy的速度和内存使用通常比其他数据存储模型要好,并在非常大的数据集得到了改进。采用C语言开发并在LGPL协议下授权。


Judy is a general purpose dynamic array implemented as a C callable library. Judy's speed and memory usage are typically better than other data storage models and improves with very large data sets.

Judy is a C library that provides a state-of-the-art core technology that implements a sparse dynamic array. Judy arrays are declared simply with a null pointer. A Judy array consumes memory only when it is populated, yet can grow to take advantage of all available memory if desired.

Judy是一个C库,它提供了实现稀疏动态数组的最新核心技术。Judy数组只是用一个空指针声明的。Judy数组只有在被填充时才会消耗内存,但如果需要的话,它可以增加所有可用内存。

Judy's key benefits are scalability, high performance, and memory efficiency. A Judy array is extensible and can scale up to a very large number of elements, bounded only by machine memory. Since Judy is designed as an unbounded array, the size of a Judy array is not pre-allocated but grows and shrinks dynamically with the array population.

Judy的主要优点是可伸缩性、高性能及内存使用效率。Judy数组是可扩展的,可以扩展到非常多的元素,这些元素仅受机器内存的限制。由于Judy被设计为一个无限数组,Judy数组的大小不是预先分配的,而是随着数组的填充而动态增长和收缩的。

Judy combines scalability with ease of use. The Judy API is accessed with simple insert, retrieve, and delete calls that do not require extensive programming. Tuning and configuring are not required (in fact not even possible). In addition, sort, search, count, and sequential access capabilities are built into Judy's design.

Judy将可扩展性与易用性结合起来。Judy API是通过简单的insert、retrieve和delete调用访问的,这些调用不需要大量编程。不需要调整和配置(事实上甚至不可能)。此外,排序、搜索、计数和顺序访问功能都内置在Judy的设计中。

Judy can be used whenever a developer needs dynamically sized arrays, associative arrays or a simple-to-use interface that requires no rework for expansion or contraction.

Judy可以在开发人员需要动态大小的数组、关联数组或简单易用的接口时使用,该接口不需要对扩展或压缩进行任何修改。

Judy can replace many common data structures, such as arrays, sparse arrays, hash tables, B-trees, binary trees, linear lists, skiplists, other sort and search algorithms, and counting functions.

Judy可以替换许多常见的数据结构,如数组、稀疏数组、哈希表、B-树、二叉树、线性列表、skiplits、其他排序和搜索算法以及计数函数。

最新版本:1.0


项目主页:http://judy.sourceforge.net/