|File Search||Catalog||Content Search|
Judy arrays are accessed with insert, retrieve, and delete calls for number or string indexes. Configuration and tuning are not required -- in fact not possible. Judy offers sorting, counting, and neighbor/empty searching. Indexes can be sequential, clustered, periodic, or random -- it doesn't matter to the algorithm. Judy arrays can be arranged hierarchically to handle any bit patterns -- large indexes, sets of keys, etc.
Judy is often an improvement over 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.
This is the development package.
Judy - C library creating and accessing dynamic arrays ============================================================== Content --------- 1. Introduction 2. Directory Contents 3. How to install 4. License 5. Change History 6. Reporting Bugs 7. Known Issues 1. INTRODUCTION ----------------- This tree contains sources, documents, tests, and tools for the Judy package. This file is more»
Judy(3) Judy(3) NAME Judy arrays - C library functions for creating and accessing dynamic arrays SYNOPSIS Judy1 - maps an Index (word) to a bit JudyL - maps an Index (word) to a Value (word/pointer) JudySL - maps an Index (null terminated string) to a Value JudyHS - maps an Index (array-of-bytes) more»
JudyHS(3) JudyHS(3) NAME JudyHS macros - C library for creating and accessing a dynamic array, using an array-of-bytes of Length as an Index and a word as a Value. SYNOPSIS cc [flags] sourcefiles -lJudy #include <Judy.h> Word_t * PValue; // JudyHS array element more»
JudyL(3) JudyL(3) NAME JudyL macros - C more»
JudySL(3) JudySL(3) NAME JudySL macros more»
Judy1(3) Judy1(3) NAME Judy1 macros - C more»
Judy1_funcs(3) Judy1_funcs(3) NAME Judy1 functions more»
JudyHS_funcs(3) JudyHS_funcs(3) NAME JudyHS function more»