|
|
|
|
.\"
|
|
|
|
|
.\" Copyright 2012-2013 Samy Al Bahra.
|
|
|
|
|
.\" All rights reserved.
|
|
|
|
|
.\"
|
|
|
|
|
.\" Redistribution and use in source and binary forms, with or without
|
|
|
|
|
.\" modification, are permitted provided that the following conditions
|
|
|
|
|
.\" are met:
|
|
|
|
|
.\" 1. Redistributions of source code must retain the above copyright
|
|
|
|
|
.\" notice, this list of conditions and the following disclaimer.
|
|
|
|
|
.\" 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
|
.\" notice, this list of conditions and the following disclaimer in the
|
|
|
|
|
.\" documentation and/or other materials provided with the distribution.
|
|
|
|
|
.\"
|
|
|
|
|
.\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
|
|
|
.\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
|
.\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
|
.\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
|
|
|
.\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
|
.\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
|
.\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
|
.\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
|
.\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
|
.\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
|
.\" SUCH DAMAGE.
|
|
|
|
|
.\"
|
|
|
|
|
.\"
|
|
|
|
|
.Dd September 17, 2012
|
|
|
|
|
.Dt CK_HS_GROW 3
|
|
|
|
|
.Sh NAME
|
|
|
|
|
.Nm ck_hs_grow
|
|
|
|
|
.Nd enlarge hash set capacity
|
|
|
|
|
.Sh LIBRARY
|
|
|
|
|
Concurrency Kit (libck, \-lck)
|
|
|
|
|
.Sh SYNOPSIS
|
|
|
|
|
.In ck_hs.h
|
|
|
|
|
.Ft bool
|
|
|
|
|
.Fn ck_hs_grow "ck_hs_t *hs" "unsigned long capacity"
|
|
|
|
|
.Sh DESCRIPTION
|
|
|
|
|
The
|
|
|
|
|
.Fn ck_hs_grow 3
|
|
|
|
|
function will resize the hash set in order to be
|
|
|
|
|
able to store at least the number of entries specified by
|
|
|
|
|
.Fa capacity
|
|
|
|
|
at a load factor of one. The default hash set load factor
|
|
|
|
|
is 0.5. If you wish to minimize the likelihood of memory allocations
|
|
|
|
|
for a hash set meant to store n entries, then specify a
|
|
|
|
|
.Fa capacity
|
|
|
|
|
of 2n. The default behavior of ck_hs is to round
|
|
|
|
|
.Fa capacity
|
|
|
|
|
to the next power of two if it is not already a power of two.
|
|
|
|
|
.Sh RETURN VALUES
|
|
|
|
|
Upon successful completion,
|
|
|
|
|
.Fn ck_hs_grow 3
|
|
|
|
|
returns true and otherwise returns false on failure.
|
|
|
|
|
.Sh ERRORS
|
|
|
|
|
Behavior is undefined if
|
|
|
|
|
.Fa hs
|
|
|
|
|
is uninitialized. This function will only
|
|
|
|
|
return false if there are internal memory allocation
|
|
|
|
|
failures.
|
|
|
|
|
.Sh SEE ALSO
|
|
|
|
|
.Xr ck_hs_init 3 ,
|
|
|
|
|
.Xr ck_hs_destroy 3 ,
|
|
|
|
|
.Xr CK_HS_HASH 3 ,
|
|
|
|
|
.Xr ck_hs_iterator_init 3 ,
|
|
|
|
|
.Xr ck_hs_next 3 ,
|
|
|
|
|
.Xr ck_hs_get 3 ,
|
|
|
|
|
.Xr ck_hs_put 3 ,
|
|
|
|
|
.Xr ck_hs_set 3 ,
|
|
|
|
|
.Xr ck_hs_remove 3 ,
|
|
|
|
|
.Xr ck_hs_count 3 ,
|
|
|
|
|
.Xr ck_hs_reset 3 ,
|
|
|
|
|
.Xr ck_hs_stat 3
|
|
|
|
|
.Pp
|
|
|
|
|
Additional information available at http://concurrencykit.org/
|
