Contiki 3.x
|
A binary search index for attributes that are constrained to be monotonically increasing, which is a rather common pattern for time series or keys.More...
#include <stdlib.h>
#include <string.h>
#include "index.h"
#include "relation.h"
#include "result.h"
#include "storage.h"
#include "net/ip/uip-debug.h"
Go to the source code of this file.
A binary search index for attributes that are constrained to be monotonically increasing, which is a rather common pattern for time series or keys.
Since this index has no storage overhead, it does not wear out the flash memory nor does it occupy any space. Furthermore, unlike B+-trees, it has a O(1) memory footprint in relation to the number of data items.
Definition in file index-inline.c.