nostrdb

an unfairly fast embedded nostr database backed by lmdb
git clone git://jb55.com/nostrdb
Log | Files | Refs | Submodules | README | LICENSE

str_set.c (2222B)


      1 /*
      2  * The MIT License (MIT)
      3  *
      4  * Copyright (c) 2015 Mikkel F. Jørgensen, dvide.com
      5  *
      6  * Permission is hereby granted, free of charge, to any person obtaining a copy
      7  * of this software and associated documentation files (the "Software"), to deal
      8  * in the Software without restriction, including without limitation the rights
      9  * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
     10  * copies of the Software, and to permit persons to whom the Software is
     11  * furnished to do so, subject to the following conditions:
     12  *
     13  * The above copyright notice and this permission notice shall be included in all
     14  * copies or substantial portions of the Software.
     15  *
     16  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
     17  * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
     18  * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
     19  * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
     20  * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
     21  * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
     22  * SOFTWARE.
     23  */
     24 
     25 #include <string.h>
     26 
     27 #include "str_set.h"
     28 #include "hash_table_def.h"
     29 DEFINE_HASH_TABLE(str_set)
     30 #if defined(STR_SET_RH)
     31 #include "hash_table_impl_rh.h"
     32 #else
     33 #include "hash_table_impl.h"
     34 #endif
     35 
     36 /*
     37  * Simple default implementation of a hash set. The stored items are
     38  * zero-terminated strings. The hash table does not manage the
     39  * allocation of the strings, like it doesn't manage any stored items.
     40  * However, it items are created with, say, strndup, a destructor can be
     41  * provided to free each item when clearing the table. The remove
     42  * operation also returns the removed item so it can be deallocated by
     43  * callee.
     44  *
     45  * In general, the key and the item are different, but here they are the
     46  * same. Normally the key would be referenced by the item.
     47  */
     48 static inline int ht_match(const void *key, size_t len, str_set_item_t item)
     49 {
     50     return strncmp(key, item, len) == 0;
     51 }
     52 
     53 static inline const void *ht_key(str_set_item_t item)
     54 {
     55     return (const void *)item;
     56 }
     57 
     58 static inline size_t ht_key_len(str_set_item_t item)
     59 {
     60     return strlen(item);
     61 }