Branch
Hash :
c78e5bd0
Author :
Thomas de Grivel
Date :
2025-09-04T18:34:55
all tests pass without dump
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
/* kc3
* Copyright from 2022 to 2025 kmx.io <contact@kmx.io>
*
* Permission is hereby granted to use this software granted the above
* copyright notice and this permission paragraph are included in all
* copies and substantial portions of this software.
*
* THIS SOFTWARE IS PROVIDED "AS-IS" WITHOUT ANY GUARANTEE OF
* PURPOSE AND PERFORMANCE. IN NO EVENT WHATSOEVER SHALL THE
* AUTHOR BE CONSIDERED LIABLE FOR THE USE AND PERFORMANCE OF
* THIS SOFTWARE.
*/
/* Gen from set.h.in NAME=uw TYPE=uw */
#ifndef LIBKC3_SET__uw_H
#define LIBKC3_SET__uw_H
#include "types.h"
/* Stack-allocation compatible functions, call set_clean__uw
after use. */
void
set_clean__uw (s_set__uw *set);
s_set__uw *
set_init__uw (s_set__uw *set, uw max);
/* Observers. */
s_set_item__uw *
set_get__uw (const s_set__uw *set, const uw data);
s_set_item__uw *
set_get_h__uw (const s_set__uw *set, const uw data, uw hash);
s_set_item__uw *
set_get_hash__uw (const s_set__uw *set, uw hash);
s_set_item__uw *
set_get_hash_next__uw (const s_set_item__uw *item);
bool *
set_has__uw (const s_set__uw *set,
const uw data,
bool *dest);
/* Operators. */
s_set_item__uw *
set_add__uw (s_set__uw *set, uw data);
s_set_item__uw *
set_add_collision__uw (s_set__uw *set, uw data, uw hash, s_set_item__uw *item);
s_set_item__uw *
set_add_h__uw (s_set__uw *set, uw data, uw hash);
bool
set_remove__uw (s_set__uw *set, const uw data);
void
set_remove_all__uw (s_set__uw *set);
bool
set_remove_item__uw (s_set__uw *set, s_set_item__uw *item);
s_set__uw *
set_resize__uw (s_set__uw *set, uw max);
#endif /* LIBKC3_SET__uw_H */