|
|
|
letoh64(3) -- convert values between different byte orderings
|
|
These routines convert 16, 32 and 64-bit quantities between different byte orderings. The ``swap'' functions reverse the byte ordering of the given quantity, the others converts either from/to the n... |
|
lfind(3) -- linear searching routines
|
|
The functions lsearch(), and lfind() provide basic linear searching functionality. base is the pointer to the beginning of an array. The argument nelp is the current number of elements in the array, w... |
|
|
lgamma(3) -- log gamma functions
|
|
|
|
lgammaf(3) -- log gamma functions
|
|
|
|
lhash(3) -- dynamic hash table
|
|
This library implements dynamic hash tables. The hash table entries can be arbitrary structures. Usually they consist of key and value fields. lh_new() creates a new LHASH structure to store arbitrary... |
|
lh_delete(3) -- dynamic hash table
|
|
This library implements dynamic hash tables. The hash table entries can be arbitrary structures. Usually they consist of key and value fields. lh_new() creates a new LHASH structure to store arbitrary... |
|
lh_doall(3) -- dynamic hash table
|
|
This library implements dynamic hash tables. The hash table entries can be arbitrary structures. Usually they consist of key and value fields. lh_new() creates a new LHASH structure to store arbitrary... |
|
lh_doall_arg(3) -- dynamic hash table
|
|
This library implements dynamic hash tables. The hash table entries can be arbitrary structures. Usually they consist of key and value fields. lh_new() creates a new LHASH structure to store arbitrary... |
|
lh_error(3) -- dynamic hash table
|
|
This library implements dynamic hash tables. The hash table entries can be arbitrary structures. Usually they consist of key and value fields. lh_new() creates a new LHASH structure to store arbitrary... |
|
lh_free(3) -- dynamic hash table
|
|
This library implements dynamic hash tables. The hash table entries can be arbitrary structures. Usually they consist of key and value fields. lh_new() creates a new LHASH structure to store arbitrary... |
|
lh_insert(3) -- dynamic hash table
|
|
This library implements dynamic hash tables. The hash table entries can be arbitrary structures. Usually they consist of key and value fields. lh_new() creates a new LHASH structure to store arbitrary... |
|
lh_new(3) -- dynamic hash table
|
|
This library implements dynamic hash tables. The hash table entries can be arbitrary structures. Usually they consist of key and value fields. lh_new() creates a new LHASH structure to store arbitrary... |
|
lh_node_stats(3) -- LHASH statistics
|
|
The LHASH structure records statistics about most aspects of accessing the hash table. This is mostly a legacy of Eric Young writing this library for the reasons of implementing what looked like a nic... |
|
lh_node_stats_bio(3) -- LHASH statistics
|
|
The LHASH structure records statistics about most aspects of accessing the hash table. This is mostly a legacy of Eric Young writing this library for the reasons of implementing what looked like a nic... |
|
lh_node_usage_stats(3) -- LHASH statistics
|
|
The LHASH structure records statistics about most aspects of accessing the hash table. This is mostly a legacy of Eric Young writing this library for the reasons of implementing what looked like a nic... |
