Hash :
f0401f0c
Author :
Thomas de Grivel
Date :
2024-03-04T14:19:12
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
/* c3
* Copyright 2022-2024 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.
*/
/**
* @file tag.h
* @brief Struct : %Module{key: value, ...}
*
*/
#ifndef LIBC3_STRUCT_H
#define LIBC3_STRUCT_H
#include "types.h"
/* Stack-allocation compatible functions, call struct_clean after use. */
void struct_clean (s_struct *s);
s_struct * struct_init (s_struct *s, const s_sym *module);
s_struct * struct_init_1 (s_struct *s, const s8 *p);
s_struct * struct_init_cast (s_struct *s, const s_tag *tag);
s_struct * struct_init_copy (s_struct *s, const s_struct *src);
s_struct * struct_init_from_lists (s_struct *s, const s_sym *module,
const s_list *keys,
const s_list *values);
s_struct * struct_init_with_data (s_struct *s, const s_sym *module,
bool free_data, void *data);
/* Heap-allocation functions, call struct_delete after use. */
void struct_delete (s_struct *s);
s_struct * struct_new (const s_sym *module);
s_struct * struct_new_1 (const s8 *p);
s_struct * struct_new_copy (const s_struct *src);
s_struct * struct_new_with_data (const s_sym *module, bool free_data,
void *data);
/* Operators. */
s_struct * struct_allocate (s_struct *s);
s_struct * struct_set (s_struct *s, const s_sym *key,
const s_tag *value);
/* Observers. */
bool struct_find_key_index (const s_struct *s, const s_sym *key,
uw *dest);
#endif /* LIBC3_STRUCT_H */