Skip to content

split_tree: goto_split spatial wrap #10160

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
qingyunha wants to merge 1 commit into
base: main
Choose a base branch
from
Open

split_tree: goto_split spatial wrap #10160

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
91 changes: 80 additions & 11 deletions src/datastruct/split_tree.zig
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -394,17 +394,50 @@ pub fn SplitTree(comptime V: type) type {
.split => continue,
}

// Ensure it is in the proper direction
if (!switch (direction) {
.left => slot.maxX() <= target.x,
.right => slot.x >= target.maxX(),
.up => slot.maxY() <= target.y,
.down => slot.y >= target.maxY(),
}) continue;

// Track our distance
const dx = slot.x - target.x;
const dy = slot.y - target.y;
var dx: f16 = undefined;
var dy: f16 = undefined;
switch (direction) {
.left => {
if (slot.maxX() <= target.x) {
dx = slot.x - target.x;
} else if (slot.x >= target.maxX()) {
dx = slot.x - 1 - target.x;
} else {
continue;
}
dy = slot.y - target.y;
},
.right => {
if (slot.x >= target.maxX()) {
dx = slot.x - target.x;
} else if (slot.maxX() <= target.x) {
dx = slot.x + 1 - target.x;
} else {
continue;
}
dy = slot.y - target.y;
},
.up => {
if (slot.maxY() <= target.y) {
dy = slot.y - target.y;
} else if (slot.y >= target.maxY()) {
dy = slot.y - 1 - target.y;
} else {
continue;
}
dx = slot.x - target.x;
},
.down => {
if (slot.y >= target.maxY()) {
dy = slot.y - target.y;
} else if (slot.maxY() <= target.y) {
dy = slot.y + 1 - target.y;
} else {
continue;
}
dx = slot.x - target.x;
},
}
const distance = @sqrt(dx * dx + dy * dy);

// If we have a nearest it must be closer.
Expand Down Expand Up @@ -1931,6 +1964,42 @@ test "SplitTree: spatial goto" {
try testing.expectEqualStrings("A", view.label);
}

// Spatial C => left
{
const target = (try split.goto(
alloc,
from: {
var it = split.iterator();
break :from while (it.next()) |entry| {
if (std.mem.eql(u8, entry.view.label, "C")) {
break entry.handle;
}
} else return error.NotFound;
},
.{ .spatial = .left },
)).?;
const view = split.nodes[target.idx()].leaf;
try testing.expectEqualStrings(view.label, "D");
}

// Spatial C => down
{
const target = (try split.goto(
alloc,
from: {
var it = split.iterator();
break :from while (it.next()) |entry| {
if (std.mem.eql(u8, entry.view.label, "C")) {
break entry.handle;
}
} else return error.NotFound;
},
.{ .spatial = .down },
)).?;
const view = split.nodes[target.idx()].leaf;
try testing.expectEqualStrings(view.label, "A");
}

// Equalize
var equal = try split.equalize(alloc);
defer equal.deinit();
Expand Down