VFO2F37CC2LRTM6PKBCI6654KTSK2AWNGOXF3GYEQGRWDTQCN3RAC
4PPC5BA7ODZF6EAPCOOSQCOVQC3DCTFGBDVBRMQNZP2NVKJCJWPQC
LD2TP6CDUHET2ISQB3P4JOTQTIDDPRLSZJTIYWAO7JTHKUWOF7MQC
ZXJGCQSAYBMPR75JD2NSK6UX5MD4X7O3BL2VCP6PR4EZCFJKMKXAC
VDX2MMS55XMEHH2TEMOOW225K6NGKB4QXPQFQ2WJLVXJK25BSXMQC
LVNADDHM446QNUHG3VTNBOHNJGCDROOFBVGO4WXMUUAN6Y4LNCNAC
NKL44S6YUCLZDH5EDDUJB5BHX2QWDP7SI5RROBVAUXKAU4ADKPAQC
JGESN2Z4ON5VXCCVBUJDKUHFRDI5IFDKGB5FJRKJEYSLM5PQCMEAC
std.debug.assert(n.key == key);
// Various checks
std.debug.assert(n.nexts.len == level + 1);
std.debug.assert(n.marked == false);
std.debug.assert(n.fully_linked == false);
if (builtin.mode == .Debug) {
// Unnecessary lock test ;-)
n.lock.lock();
defer n.lock.unlock();
for (n.nexts) |next| {
std.debug.assert(next == null);
}
}
var node = try Node.init(self.allocator, insert_key, rlevel);
node.value = insert_value;
std.debug.assert(node.nexts.len == rlevel + 1);
var node = try Node.init(self.allocator, insert_key, insert_value, rlevel);