aboutsummaryrefslogtreecommitdiff
path: root/ring-buffer.h
diff options
context:
space:
mode:
authorMarc André Tanner <mat@brain-dump.org>2017-07-10 17:27:04 +0200
committerMarc André Tanner <mat@brain-dump.org>2017-07-10 18:26:05 +0200
commitd4bba6e46fa1ab67947508c95a4198dbcf060489 (patch)
tree070f4d37fe37433ce68bf7aa77ba23bc475563c5 /ring-buffer.h
parent6e0532af78294c76d0e0a187a40d330518bab0a8 (diff)
downloadvis-d4bba6e46fa1ab67947508c95a4198dbcf060489.tar.gz
vis-d4bba6e46fa1ab67947508c95a4198dbcf060489.tar.xz
vis: implement jump list in terms of marks
Diffstat (limited to 'ring-buffer.h')
-rw-r--r--ring-buffer.h21
1 files changed, 0 insertions, 21 deletions
diff --git a/ring-buffer.h b/ring-buffer.h
deleted file mode 100644
index cfd70e0..0000000
--- a/ring-buffer.h
+++ /dev/null
@@ -1,21 +0,0 @@
-#ifndef RING_BUFFER_H
-#define RING_BUFFER_H
-
-#include <stdbool.h>
-#include <stddef.h>
-
-/*
- * Circular buffer with functions for accessing elements in order.
- * One slot always remains unused to distinguish between the empty/full case.
- */
-
-typedef struct RingBuffer RingBuffer;
-
-RingBuffer *ringbuf_alloc(size_t size);
-void ringbuf_free(RingBuffer*);
-void ringbuf_add(RingBuffer*, const void *value);
-const void *ringbuf_prev(RingBuffer*);
-const void *ringbuf_next(RingBuffer*);
-void ringbuf_invalidate(RingBuffer*);
-
-#endif