This link has been bookmarked by 62 people . It was first bookmarked on 25 Jul 2006, by someone privately.
-
21 Apr 16
nkrishnaswamiJudy 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'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 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 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 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.open-source software algorithm sparse dynamic-array data-structure
-
26 May 15
-
05 Jul 14
-
02 May 13
-
11 Feb 13
-
08 Mar 12
Dan LoewenherzJudy 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
-
07 Mar 12
richtbreak"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."
-
02 Aug 11
-
21 Feb 11
Massuda ConsultoriaJudy 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
-
05 Jan 11
-
23 Nov 10
-
23 Oct 10
Luca BigliardiJudy 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
-
04 Sep 10
-
22 Jun 10
-
25 May 10
-
15 Mar 10
-
08 Nov 09
Carlos PereiraJudy 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
-
01 Nov 09
Tim Lossen"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 al
-
17 May 09
-
26 Feb 09
-
11 Nov 08
-
15 Mar 08
-
02 Oct 07
dpavlinJudy 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
-
13 May 07
-
14 Mar 07
-
23 Jan 07
-
24 Oct 06
-
11 Oct 06
-
18 Sep 06
-
09 Sep 06
-
31 Aug 06
-
05 Aug 06
-
16 Feb 06
-
29 Jun 05
-
09 Jun 05
-
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'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.
-
-
30 May 05
-
29 May 05
-
-
28 May 05
-
29 Nov 04
-
10 Jun 04
Page Comments
Would you like to comment?
Join Diigo for a free account, or sign in if you are already a member.