|
|
|
lh_node_usage_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_retrieve(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_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_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... |
|
link_addr(3) -- elementary address specification routines for link level access
|
|
The link_addr() function interprets character strings representing linklevel addresses, returning binary information suitable for use in system calls. link_ntoa() takes a link-level address and return... |
|
link_field(3) -- create and destroy form fields
|
|
The function new_field allocates a new field and initializes it from the parameters given: height, width, row of upper-left corner, column of upper-left corner, number off-screen rows, and number of a... |
|
link_fieldtype(3) -- define validation-field types
|
|
The function new_fieldtype creates a new field type usable for data validation. You supply it with field_check, a predicate to check the validity of an entered data string whenever the user attempts t... |
|
link_ntoa(3) -- elementary address specification routines for link level access
|
|
The link_addr() function interprets character strings representing linklevel addresses, returning binary information suitable for use in system calls. link_ntoa() takes a link-level address and return... |
|
LIST_EMPTY(3) -- implementations of
|
|
These macros define and operate on five types of data structures: singlylinked lists, simple queues, lists, tail queues, and circular queues. All five structures support the following functionality: 1... |
|
LIST_END(3) -- implementations of
|
|
These macros define and operate on five types of data structures: singlylinked lists, simple queues, lists, tail queues, and circular queues. All five structures support the following functionality: 1... |
|
LIST_ENTRY(3) -- implementations of
|
|
These macros define and operate on five types of data structures: singlylinked lists, simple queues, lists, tail queues, and circular queues. All five structures support the following functionality: 1... |
|
LIST_FIRST(3) -- implementations of
|
|
These macros define and operate on five types of data structures: singlylinked lists, simple queues, lists, tail queues, and circular queues. All five structures support the following functionality: 1... |
|
LIST_FOREACH(3) -- implementations of
|
|
These macros define and operate on five types of data structures: singlylinked lists, simple queues, lists, tail queues, and circular queues. All five structures support the following functionality: 1... |
|
LIST_HEAD(3) -- implementations of
|
|
These macros define and operate on five types of data structures: singlylinked lists, simple queues, lists, tail queues, and circular queues. All five structures support the following functionality: 1... |
|
LIST_HEAD_INITIALIZER(3) -- implementations of
|
|
These macros define and operate on five types of data structures: singlylinked lists, simple queues, lists, tail queues, and circular queues. All five structures support the following functionality: 1... |
