voroskoi/skiplist.zig - Change JGESN2Z4ON5VXCCVBUJDKUHFRDI5IFDKGB5FJRKJEYSLM5PQCMEAC

remove Node.height

Created by voroskoi on December 25, 2024

JGESN2Z4ON5VXCCVBUJDKUHFRDI5IFDKGB5FJRKJEYSLM5PQCMEAC

Dependencies

In channels

main

Change contents

Replacement in src/lazy.zig at line 22 [3.108]

B:BD[3.299] → [4.4519:4608]

    if (opts.skip_size <= 1) {
        @compileError("Skip size must be >= 1!\n");
    }

[3.299]

    if (opts.skip_size <= 1) @compileError("Skip size must be >= 1!\n");
    // This must be > 0 as level is in [0..max_level) range.
    const ml: usize = opts.max_level orelse
        @as(usize, @intFromFloat(std.math.log(f32, opts.skip_size, @as(f32, @floatFromInt(opts.items)))));
    if (ml == 0) @compileError("Options.max_level must be > 0");

Replacement in src/lazy.zig at line 37 [3.108]

B:BD[3.664] → [2.44:147]

∅:D[2.147] → [4.4650:4809]

B:BD[3.664] → [4.4650:4809]

        /// This must be > 0 as level is in [0..max_level) and Node.height is in [1..max_level] range.
        const max_level = opts.max_level orelse
            @as(usize, @intFromFloat(std.math.log(f32, opts.skip_size, @as(f32, @floatFromInt(opts.items)))));

[3.664]

[4.4809]

        const max_level = ml;

Deletion in src/lazy.zig at line 44 [3.108]
B:BD[3.770] → [2.191:245]
∅:D[2.245] → [3.770:797]
B:BD[3.770] → [3.770:797]
```
            /// Human readable height, starts with 1.
            height: usize,
```

Deletion in src/lazy.zig at line 58 [3.108]

B:BD[4.4933] → [2.417:473]

                n.height = level + 1; // level can be 0

Deletion in src/lazy.zig at line 72 [3.108]
B:BD[3.2921] → [2.474:519]
```
            std.debug.assert(max_level > 0);
```

Replacement in src/lazy.zig at line 76 [3.108]

B:BD[5.915] → [2.520:583]

            head = try Node.init(allocator, 0, max_level - 1);

[5.915]

[5.974]

            head = try Node.init(allocator, undefined, max_level - 1);

Replacement in src/lazy.zig at line 156 [3.108]

B:BD[5.1415] → [2.1410:1518]

            var preds: [max_level]?*Node = undefined;
            var succs: [max_level]?*Node = undefined;

[5.1415]

[3.5290]

            var preds: [max_level]?*Node = [_]?*Node{null} ** max_level;
            std.debug.assert(preds.len == max_level);
            var succs: [max_level]?*Node = [_]?*Node{null} ** max_level;
            std.debug.assert(succs.len == max_level);

Replacement in src/lazy.zig at line 179 [3.108]

B:BD[3.5936] → [2.1620:1728]

            var preds: [max_level]?*Node = undefined;
            var succs: [max_level]?*Node = undefined;

[3.5936]

[3.6277]

            var preds: [max_level]?*Node = [_]?*Node{null} ** max_level;
            std.debug.assert(preds.len == max_level);
            var succs: [max_level]?*Node = [_]?*Node{null} ** max_level;
            std.debug.assert(succs.len == max_level);

Replacement in src/lazy.zig at line 243 [3.108]

B:BD[3.8670] → [2.1878:1929]

                    for (0..node.height) |level| {

[3.8670]

[4.9519]

                    for (0..node.nexts.len) |level| {

Replacement in src/lazy.zig at line 273 [3.108]

B:BD[3.9382] → [2.1930:2038]

            var preds: [max_level]?*Node = undefined;
            var succs: [max_level]?*Node = undefined;

[3.9382]

[3.9552]

            var preds: [max_level]?*Node = [_]?*Node{null} ** max_level;
            std.debug.assert(preds.len == max_level);
            var succs: [max_level]?*Node = [_]?*Node{null} ** max_level;
            std.debug.assert(succs.len == max_level);

Replacement in src/lazy.zig at line 303 [3.108]

B:BD[3.11039] → [2.2113:2175]

                        for (0..node_delete.height) |level| {

[3.11039]

[6.830]

                        for (0..node_delete.nexts.len) |level| {

Replacement in src/lazy.zig at line 326 [3.108]

B:BD[6.1788] → [2.2176:2239]

                        var level: usize = node_delete.height;

[6.1788]

[6.1855]

                        var level: usize = node_delete.nexts.len;

Replacement in src/lazy.zig at line 349 [3.108]

B:BD[6.2564] → [2.2240:2351]

            return candidate.*.fully_linked and candidate.*.height - 1 == level_found and !candidate.*.marked;

[6.2564]

[3.12219]

            return candidate.*.fully_linked and candidate.*.nexts.len - 1 == level_found and !candidate.*.marked;