Hash :
2afd8555
Author :
Thomas de Grivel
Date :
2022-12-25T06:19:54
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
/* c3
* Copyright 2022 kmx.io <contact@kmx.io>
*
* Permission is hereby granted to use this software excepted
* on Apple computers 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 skiplist_node.h.in NAME=_NAME$ TYPE=_TYPE$ */
/**
* @file skiplist_node___NAME$.h
* @brief Element of a skiplist of _NAME$s.
*
* Data structure for skiplist nodes containing _TYPE$.
*/
#ifndef SKIPLIST_NODE___NAME$_H
#define SKIPLIST_NODE___NAME$_H
#include "types.h"
#define SKIPLIST_NODE_LINKS___NAME$(node) \
((s_skiplist_node___NAME$ **) (((s_skiplist_node___NAME$ *) node) + 1))
#define SKIPLIST_NODE_NEXT___NAME$(node, height) \
(SKIPLIST_NODE_LINKS___NAME$(node)[height])
#define SKIPLIST_NODE_SIZE___NAME$(height) \
(sizeof(s_skiplist_node___NAME$) + (height) * sizeof(_TYPE$))
s_skiplist_node___NAME$ *
skiplist_node_init (s_skiplist_node___NAME$ *node, _TYPE$ value, u8 height);
s_skiplist_node___NAME$ *
skiplist_node_new___NAME$ (_TYPE$ value, u8 height);
void
skiplist_node_delete___NAME$ (s_skiplist_node___NAME$ *node);
void
skiplist_node_insert___NAME$ (s_skiplist_node___NAME$ *node, s_skiplist_node___NAME$ *pred);
#endif /* SKIPLIST_NODE___NAME$_H */