From ee86b5289b285ed82b67e2101a1791c0fcdbd00e Mon Sep 17 00:00:00 2001 From: Andrew Noyes Date: Wed, 13 Mar 2024 07:31:24 -0700 Subject: [PATCH] Rearrange induction inequalities This looks nicer IMO --- ConflictSet.cpp | 18 +++++++++--------- 1 file changed, 9 insertions(+), 9 deletions(-) diff --git a/ConflictSet.cpp b/ConflictSet.cpp index a0ccd9b..616ee09 100644 --- a/ConflictSet.cpp +++ b/ConflictSet.cpp @@ -272,15 +272,15 @@ constexpr int kMinChildrenNode16 = 5; constexpr int kMinChildrenNode48 = 17; constexpr int kMinChildrenNode256 = 49; -static_assert(sizeof(Node256) + kMinSavingsPerNode <= - kMinChildrenNode256 * kMinSavingsPerNode); -static_assert(sizeof(Node48) + kMinSavingsPerNode <= - kMinChildrenNode48 * kMinSavingsPerNode); -static_assert(sizeof(Node16) + kMinSavingsPerNode <= - kMinChildrenNode16 * kMinSavingsPerNode); -static_assert(sizeof(Node4) + kMinSavingsPerNode <= - kMinChildrenNode4 * kMinSavingsPerNode); -static_assert(sizeof(Node0) + kMinSavingsPerNode <= kBytesPerKey); +static_assert(kMinChildrenNode256 * kMinSavingsPerNode - sizeof(Node256) >= + kMinSavingsPerNode); +static_assert(kMinChildrenNode48 * kMinSavingsPerNode - sizeof(Node48) >= + kMinSavingsPerNode); +static_assert(kMinChildrenNode16 * kMinSavingsPerNode - sizeof(Node16) >= + kMinSavingsPerNode); +static_assert(kMinChildrenNode4 * kMinSavingsPerNode - sizeof(Node4) >= + kMinSavingsPerNode); +static_assert(kBytesPerKey - sizeof(Node0) >= kMinSavingsPerNode); // setOldestVersion will additionally try to maintain this property: // `max(children, 1) * length >= capacity`