Browse Source

explain a bit what we are trying to do here

master
Felix von Leitner 7 months ago
parent
commit
566c1b025b
  1. 7
      iarray.h

7
iarray.h

@ -7,6 +7,13 @@
* - the elements are small (many fit on one page),
* - the platform has an atomic compare-and-swap instruction
* - the compiler supports it via __sync_val_compare_and_swap
*
* Implementation parameters:
* - once an element is allocated, it stays allocated and at the same place
* - there is no deleting elements or moving elements around
* - we are not coordinating access to elements, only providing pointers to them
* - new elements are allocated upwards, not arbitrarily (like file descriptors on Unix)
* - meant for long-running processes, destruction is provided only as an afterthought for completeness
*/
#include <libowfat/uint64.h>

Loading…
Cancel
Save