hanoidb/src/lsm_btree.hrl



%% smallest levels are 32 entries
-define(TOP_LEVEL, 5).
-define(BTREE_SIZE(Level), (1 bsl (Level))).

-define(TOMBSTONE, 'deleted').

-define(KEY_IN_RANGE(Key,FromKey,ToKey),
        (((FromKey == undefined) orelse (FromKey =< Key))
         and
         ((ToKey == undefined) orelse (Key < ToKey)))).
Improve nursery handling - Code moved to separate module - Recovery now operational; re-opening a tree will actually read the nursery log. We use a sequential log file for the nursery and also keep inserted {K,V} in memory only 32 K/V pairs at a time. NURSERY_SIZE = (1 bsl TOP_LEVEL) configured in src/lsm_btree.htl 2012-01-10 22:04:13 +00:00

			`%% smallest levels are 32 entries`
			`-define(TOP_LEVEL, 5).`
Use ?BTREE_SIZE macro everywhere 2012-01-20 09:09:54 +00:00			`-define(BTREE_SIZE(Level), (1 bsl (Level))).`
Improve nursery handling - Code moved to separate module - Recovery now operational; re-opening a tree will actually read the nursery log. We use a sequential log file for the nursery and also keep inserted {K,V} in memory only 32 K/V pairs at a time. NURSERY_SIZE = (1 bsl TOP_LEVEL) configured in src/lsm_btree.htl 2012-01-10 22:04:13 +00:00
			`-define(TOMBSTONE, 'deleted').`

Make proper range fold in nursery 2012-01-20 13:08:07 +00:00			`-define(KEY_IN_RANGE(Key,FromKey,ToKey),`
			`(((FromKey == undefined) orelse (FromKey =< Key))`
			`and`
			`((ToKey == undefined) orelse (Key < ToKey)))).`