This repository was archived by the owner on Mar 27, 2021. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathrgph.3
99 lines (99 loc) · 3.35 KB
/
rgph.3
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
.\" Copyright (c) 2016, Alexander Nasonov
.\" All rights reserved.
.\"
.\" Redistribution and use in source and binary forms, with or without
.\" modification, are permitted provided that the following conditions
.\" are met:
.\"
.\" * Redistributions of source code must retain the above copyright
.\" notice, this list of conditions and the following disclaimer.
.\"
.\" * 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 COPYRIGHT HOLDERS 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
.\" COPYRIGHT HOLDER 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 Dec 25, 2016
.Dt RGPH 3
.Os
.Sh NAME
.Nm rgph
.Nd random graph perfect hashing library
.Sh LIBRARY
.Lb rgph
.Sh SYNOPSIS
.In rgph.h
.Ft struct rgph_graph *
.Fn rgph_alloc_graph "size_t nverts" "int flags"
.Ft void
.Fn rgph_free_graph "struct rgph_graph *graph"
.Ft int
.Fn rgph_build_graph "struct rgph_graph *graph" "int flags" \
"rgph_vector_hash_t hash" "uintptr_t seed" \
"rgph_entry_iterator_t keys" "void *state"
.Ft int
.Fn rgph_assign "struct rgph_graph *graph" "int flags"
.Ft int
.Fn rgph_find_duplicates "struct rgph_graph *graph" \
"rgph_entry_iterator_t keys" "void *state" "size_t dup[2]"
.Ft int
.Fn rgph_flags "struct rgph_graph const *graph"
.Ft int
.Fn rgph_rank "struct rgph_graph const *graph"
.Ft size_t
.Fn rgph_entries "struct rgph_graph const *graph"
.Ft size_t
.Fn rgph_vertices "struct rgph_graph const *graph"
.Ft size_t
.Fn rgph_datalen_min "struct rgph_graph const *graph"
.Ft size_t
.Fn rgph_datalen_max "struct rgph_graph const *graph"
.Ft uint64_t
.Fn rgph_index_min "struct rgph_graph const *graph"
.Ft uint64_t
.Fn rgph_index_max "struct rgph_graph const *graph"
.Ft size_t
.Fn rgph_core_size "struct rgph_graph const *graph"
.Ft uintptr_t
.Fn rgph_seed "struct rgph_graph const *graph"
.Ft size_t
.Fn rgph_hash_bits "struct rgph_graph const *graph"
.Ft int
.Fn rgph_is_built "struct rgph_graph const *graph"
.Ft int
.Fn rgph_is_assigned "struct rgph_graph const *graph"
.Ft size_t
.Fn rgph_count_keys(rgph_entry_iterator_t, void *);
.Ft int
.Fn rgph_copy_edge "struct rgph_graph *graph" "size_t edge" \
"unsigned long *to" "size_t *peel_order"
.Ft const void *
.Fn rgph_assignments "struct rgph_graph const *graph" "size_t *width"
.Ft int
.Fn rgph_copy_assignment "struct rgph_graph const *graph" "size_t index" \
"unsigned long long *to"
.Sh DESCRIPTION
Not yet available.
.Sh RETURN VALUES
Not yet available.
.Sh EXAMPLES
Not yet available.
.Sh SEE ALSO
Not yet available.
.Sh AUTHORS
The
.Nm
library is written by
.An Alexander Nasonov Aq Mt alnsn@yandex.ru