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
|
/*
* The MIT License (MIT)
*
* Copyright (c) 2015 Mikkel F. Jørgensen, dvide.com
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
#include <string.h>
/* These are just example settings. */
#include "token_map.h"
#define HT_LOAD_FACTOR 0.85
/* Quadratic probing is ignored with Robin Hood hashing. */
#define HT_PROBE_QUADRATIC
#include "hash_table_def.h"
DEFINE_HASH_TABLE(token_map)
#if defined(TOKEN_MAP_RH)
#include "hash_table_impl_rh.h"
#else
#include "hash_table_impl.h"
#endif
static inline const void *ht_key(ht_item_t item)
{
return item->token;
}
static inline size_t ht_key_len(ht_item_t item)
{
return item->len;
}
static inline int ht_match(const void *key, size_t len, ht_item_t item)
{
return len == item->len && memcmp(key, item->token, len) == 0;
}
|