summaryrefslogtreecommitdiffstats
path: root/tests/de_level_tag.cpp
diff options
context:
space:
mode:
authorDouglas B. Rumbaugh <doug@douglasrumbaugh.com>2024-01-09 14:47:48 -0500
committerDouglas B. Rumbaugh <doug@douglasrumbaugh.com>2024-01-09 14:49:27 -0500
commit3c2e6b3b456867d7155b158432b891b84e4e1dd6 (patch)
treecc3720e28a0015c1516b32c5b3b174feed8c1657 /tests/de_level_tag.cpp
parentfa0952cba5e59e8d664654ad19ae96c580bc0bf4 (diff)
downloaddynamic-extension-3c2e6b3b456867d7155b158432b891b84e4e1dd6.tar.gz
Initial update of buffer to new specifications
There are a few minor issues that this introduces, however. Global tracking of a lot of secondary information, such as weights for WIRS/WSS, or the exact number of tombstones will need to be approached differently than they have been historically with this new approach. I've also removed most of the tombstone capacity related code. We had decided not to bother enforcing this at the buffer level anyway, and it would greatly increase the complexity of the problem of predicting when the next compaction will be. On the whole this new approach seems like it'll simplify a lot. This commit actually removes significantly more code than it adds. One minor issue: the currently implementation will have problems in the circular array indexes once more than 2^64 records have been inserted. This doesn't seem like a realistic problem at the moment.
Diffstat (limited to 'tests/de_level_tag.cpp')
0 files changed, 0 insertions, 0 deletions