Lines Matching full:hash

77 \&\- dynamic hash table
87 \& LHASH_OF(TYPE) *lh_TYPE_new(OPENSSL_LH_HASHFUNC hash, OPENSSL_LH_COMPFUNC compare);
145 This library implements type-checked dynamic hash tables. The hash
150 To define a new type-checked dynamic hash table, use \fBDEFINE_LHASH_OF_EX\fR().
157 arbitrary data entries, and specifies the 'hash' and 'compare'
158 callbacks to be used in organising the table's entries.  The \fIhash\fR
160 an unsigned long hash value for its key field.  The hash value is
161 normally truncated to a power of 2, so make sure that your hash
163 takes two arguments (pointers to two hash table entries), and returns
166 If your hash table
167 will contain items of some particular type and the \fIhash\fR and
168 \&\fIcompare\fR callbacks hash/compare these types, then the
175 \&  * Implement the hash and compare functions; "stuff" can be any word.
201 Then a hash table of \fR\f(BITYPE\fR\fB\fR objects can be created using this:
210 \&\fItable\fR. Allocated hash table entries will not be freed; consider
212 hash table (see below). If the argument is NULL, nothing is done.
215 entries can be added to the flushed table.  Allocated hash table entries
217 remaining entries in the hash table (see below).
230 \&\fBlh_\fR\f(BITYPE\fR\fB_doall\fR() will, for every entry in the hash table, call
241 \& /* Call "TYPE_cleanup" against all items in a hash table. */
244 \& /* Then the hash table itself can be deallocated */
256 this is demonstrated here (printing all hash table entries to a BIO
273 reason for this is that deleting an item from the hash table may result in the
274 hash table being contracted to a smaller size and rehashed.
276 undefined behaviour under these conditions, as these functions assume the hash
282 disables hash table contraction and guarantees that it will be safe to delete
283 items from a hash table during a call to \fBlh_\fR\f(BITYPE\fR\fB_doall\fR() or
292 \&\fBlh_\fR\f(BITYPE\fR\fB_num_items\fR() returns the number of items in the hash table.
295 factor used to determine when the hash table is contracted. The factor is the
296 load factor at or below which hash table contraction will occur, multiplied by
298 number of nodes. Setting this value to 0 disables hash table contraction.
320 When a hash table entry is replaced, \fBlh_\fR\f(BITYPE\fR\fB_insert\fR() or
325 NULL is returned if there is no such value in the hash table.
327 \&\fBlh_\fR\f(BITYPE\fR\fB_retrieve\fR() and \fBOPENSSL_LH_retrieve()\fR return the hash table entry
357 As an example, a hash table may be maintained by code that, for
359 indexed in the hash table (i.e. it is returned as "const" from