weaselab/conflict-set
2
0
Fork 0
Code Issues 4 Packages Releases 13 Activity

Rearrange induction inequalities

Browse Source 
This looks nicer IMO
This commit is contained in:
Andrew Noyes
2024-03-13 07:31:24 -07:00
parent b779c0f6f7
commit ee86b5289b
1 changed files with 9 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
ConflictSet.cpp
View File

@@ -272,15 +272,15 @@ constexpr int kMinChildrenNode16 = 5;
constexpr int kMinChildrenNode48 = 17; constexpr int kMinChildrenNode48 = 17;
constexpr int kMinChildrenNode256 = 49; constexpr int kMinChildrenNode256 = 49;
static_assert(sizeof(Node256) + kMinSavingsPerNode <= static_assert(kMinChildrenNode256 * kMinSavingsPerNode - sizeof(Node256) >=
kMinChildrenNode256 * kMinSavingsPerNode); kMinSavingsPerNode);
static_assert(sizeof(Node48) + kMinSavingsPerNode <= static_assert(kMinChildrenNode48 * kMinSavingsPerNode - sizeof(Node48) >=
kMinChildrenNode48 * kMinSavingsPerNode); kMinSavingsPerNode);
static_assert(sizeof(Node16) + kMinSavingsPerNode <= static_assert(kMinChildrenNode16 * kMinSavingsPerNode - sizeof(Node16) >=
kMinChildrenNode16 * kMinSavingsPerNode); kMinSavingsPerNode);
static_assert(sizeof(Node4) + kMinSavingsPerNode <= static_assert(kMinChildrenNode4 * kMinSavingsPerNode - sizeof(Node4) >=
kMinChildrenNode4 * kMinSavingsPerNode); kMinSavingsPerNode);
static_assert(sizeof(Node0) + kMinSavingsPerNode <= kBytesPerKey); static_assert(kBytesPerKey - sizeof(Node0) >= kMinSavingsPerNode);
// setOldestVersion will additionally try to maintain this property: // setOldestVersion will additionally try to maintain this property:
// `max(children, 1) * length >= capacity` // `max(children, 1) * length >= capacity`