cons.h

Go to the documentation of this file.

/* SPDX-License-Identifier: MIT */
 
#ifndef CONS_H
#define CONS_H
 
/*
 * for NULL (the empty list)
 */
#include <stddef.h>
 
/*
 * for bool type
 */
#include <stdbool.h>
 
#ifdef __cplusplus
extern "C" {
#endif
 
struct cons;
 
#define CONS_NIL ((struct cons *)NULL)
 
#define CONS_NIL_P(_cell) ((_cell) == CONS_NIL)
 
#define CONS_NOT_NIL_P(_cell) ((_cell) != CONS_NIL)
 
#define CONS(_car, _cdr) ((struct cons){.car = (_car), .cdr = (_cdr)})
 
#define CONS_NULL CONS(NULL, CONS_NIL)
 
struct cons {
  void *car;
 
  struct cons *cdr;
};
 
static inline void *cons_car(const struct cons *cell) { return cell->car; }
 
static inline struct cons *cons_cdr(const struct cons *cell) { return cell->cdr; }
 
static inline void cons_rplaca(struct cons *cell, void *car) { cell->car = car; }
 
static inline void cons_rplacd(struct cons *cell, struct cons *cdr) { cell->cdr = cdr; }
 
static inline void cons_init(struct cons *cell, void *car) {
  cons_rplaca(cell, car);
  cons_rplacd(cell, CONS_NIL);
}
 
struct cons **cons(struct cons **list, struct cons *cell);
 
struct cons **cons_prepend(struct cons **list, struct cons *cell);
 
struct cons **cons_loop(struct cons **list, bool (*pred)(struct cons **list, struct cons *cell, void *user), void *user);
 
struct cons **cons_find(struct cons **list, void *cell);
 
struct cons *cons_delete(struct cons **list, void *car);
 
struct cons *cons_remove(struct cons **list, struct cons *cell);
 
void cons_reverse(struct cons **list);
 
size_t cons_length(const struct cons *cell);
 
struct cons *cons_last(struct cons *cell);
 
struct cons *cons_nth(struct cons *cell, size_t nth);
 
struct cons *cons_member(struct cons *cell, void *car);
 
struct cons *cons_append(struct cons *cell1, struct cons *cell2);
 
struct cons *cons_heap(void *car);
 
void cons_free(struct cons *cell);
 
#ifdef __cplusplus
}
#endif
 
#endif /* CONS_H */