kc3-lang/kc3/libkc3/skiplist_node__fact.h

• Show log

  Commit

• Hash : df38cb84
  Author : Thomas de Grivel
  Date : 2024-11-18T10:29:36
  

  wip const and s_callable

Download

• libkc3/skiplist_node__fact.h

• /* kc3
   * Copyright 2022,2023,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.
   */
  /* Gen from skiplist_node.h.in NAME=fact TYPE=s_fact * */
  /**
   * @file skiplist_node__fact.h
   * @brief Element of a skiplist of facts.
   *
   * Data structure for skiplist nodes containing s_fact *.
   */
  #ifndef LIBKC3_SKIPLIST_NODE__fact_H
  #define LIBKC3_SKIPLIST_NODE__fact_H
  
  #include "types.h"
  
  #define SKIPLIST_NODE_LINKS__fact(node) \
    ((s_skiplist_node__fact **) (((s_skiplist_node__fact *) node) + 1))
  
  #define SKIPLIST_NODE_NEXT__fact(node, height) \
    (SKIPLIST_NODE_LINKS__fact(node)[height])
  
  #define SKIPLIST_NODE_SIZE__fact(height) \
    (sizeof(s_skiplist_node__fact) + (height) * sizeof(s_fact *))
  
  s_skiplist_node__fact *
  skiplist_node_init (s_skiplist_node__fact *node, s_fact * value, u8 height);
  
  s_skiplist_node__fact *
  skiplist_node_new__fact (s_fact * value, u8 height);
  
  void
  skiplist_node_delete__fact (s_skiplist_node__fact *node);
  
  void
  skiplist_node_insert__fact (s_skiplist_node__fact *node, s_skiplist_node__fact *pred);
  
  #endif /* LIBKC3_SKIPLIST_NODE__fact_H */
  

Download