HP-UX 11i December 2002 Release Notes

HP-UX 11i Version 1.0 Operating Environment Applications
HP-UX 11i Operating Environment
Chapter 6
111
For changes since the initial release of HP-UX 11i, see the March 2001, June 2001,
December 2001, March 2002, June 2002, September 2002, or December 2002 documents
at the following URLs:
For EMS Release Notes, see
http://docs.hp.com/hpux/onlinedocs/diag/ems/ems_rel.htm
For STM Release Notes, see
http://docs.hp.com/hpux/onlinedocs/diag/stm/stm_rel.htm
Judy Libraries
The Judy product is a C language library that enables an unbounded array capability.
Judy Libraries provide a state-of-the-art core technology that replaces many traditional
data structions and algorithms (such as arrays, sparse arrays, hash tables, B-trees,
binary trees, linear lists, skip lists, and counting functions).
updated for
September 2002
The Judy technology is now an Open Source product that is available from SourceForge
at http://sourceforge.net/projects/judy.
updated for
June 2002
The Judy Libraries product has been updated to incorporate improved manpages, minor
defect fixes, and minor code improvements.
updated for
December 2001
New functionality has been added to the Judy libraries to search for the next available
(empty) location in a Judy array. Functions include the following:
FirstEmpty
NextEmpty
LastEmpty
PrevEmpty
See the information library for details at: http://www.hp.com/go/judy.
updated for
September 2001
As of September 2001, the Judy Libraries product was removed as a selectable
application and is now installed with the OEs.
new for
June 2001
The Judy product delivers:
Very easy-to-use API
Improved overall performance and better memory management
Scalable arrays that can grow dynamically to very large populations while
maintaining excellent performance
Judy offers three types of arrays:
Judy1 functions provide a way to store, retrieve, and locate Boolean values (bit
maps) in a Judy array.
JudyL functions provide a way to store, retrieve, and locate long-word values in a
Judy array.
JudySL functions provide a way to store, retrieve, and locate strings as indexes
(similar to associative arrays in awk, Perl, and Java).