open62541 1.4.19
Open source implementation of OPC UA
Loading...
Searching...
No Matches
xht.h
Go to the documentation of this file.
1/** Simple string->void* hashtable, very static and bare minimal, but efficient
2 *
3 * Copyright (c) 2003 Jeremie Miller <jer@jabber.org>
4 * Copyright (c) 2016-2026 Joachim Wiberg <troglobit@gmail.com>
5 * All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions are met:
9 * * Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * * Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
14 * * Neither the name of the copyright holders nor the names of its
15 * contributors may be used to endorse or promote products derived from
16 * this software without specific prior written permission.
17 *
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
19 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE
22 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
23 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
24 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
25 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
26 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
27 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
28 * POSSIBILITY OF SUCH DAMAGE.
29 */
30
31#ifndef MDNS_XHT_H_
32#define MDNS_XHT_H_
33
34typedef struct xht xht_t;
35
36
37xht_t *xht_new(int prime);
38
39
40void xht_set(xht_t *h, const char *key, void *val);
41
42
43void xht_store(xht_t *h, const char *key, int klen, void *val, int vlen);
44
45
46void *xht_get(xht_t *h, const char *key);
47
48
49void xht_free(xht_t *h);
50
51
52typedef void (*xht_walker)(xht_t *h, const char *key, void *val, void *arg);
53void xht_walk(xht_t *h, xht_walker w, void *arg);
54
55#endif /* MDNS_XHT_H_ */
struct xht xht_t
Simple string->void* hashtable, very static and bare minimal, but efficient.
Definition xht.h:34
void xht_free(xht_t *h)
void * xht_get(xht_t *h, const char *key)
xht_t * xht_new(int prime)
void xht_store(xht_t *h, const char *key, int klen, void *val, int vlen)
void(* xht_walker)(xht_t *h, const char *key, void *val, void *arg)
Definition xht.h:52
void xht_walk(xht_t *h, xht_walker w, void *arg)
void xht_set(xht_t *h, const char *key, void *val)