Add ts_tree_edit function
This commit is contained in:
Max Brunsfeld
parent
296d8cc1e8
commit
0467d190fe
5 changed files with 234 additions and 42 deletions
|
|
@ -6,9 +6,12 @@
|
|||
START_TEST
|
||||
|
||||
enum {
|
||||
cat = ts_builtin_sym_start,
|
||||
dog,
|
||||
pig,
|
||||
cat = ts_builtin_sym_start,
|
||||
dog,
|
||||
eel,
|
||||
fox,
|
||||
goat,
|
||||
hog,
|
||||
};
|
||||
|
||||
static const char *names[] = {
|
||||
|
|
@ -16,30 +19,22 @@ static const char *names[] = {
|
|||
"END",
|
||||
"cat",
|
||||
"dog",
|
||||
"pig",
|
||||
"eel",
|
||||
"fox",
|
||||
"goat",
|
||||
"hog",
|
||||
};
|
||||
|
||||
describe("Tree", []() {
|
||||
TSTree *tree1, *tree2, *parent1;
|
||||
|
||||
before_each([&]() {
|
||||
tree1 = ts_tree_make_leaf(
|
||||
cat,
|
||||
ts_length_make(5, 4),
|
||||
ts_length_make(2, 1),
|
||||
TSNodeTypeNamed);
|
||||
|
||||
tree2 = ts_tree_make_leaf(
|
||||
cat,
|
||||
ts_length_make(3, 3),
|
||||
ts_length_make(1, 1),
|
||||
TSNodeTypeNamed);
|
||||
|
||||
parent1 = ts_tree_make_node(
|
||||
dog,
|
||||
2,
|
||||
tree_array({ tree1, tree2, }),
|
||||
TSNodeTypeNamed);
|
||||
tree1 = ts_tree_make_leaf(cat, {2, 1}, {5, 4}, TSNodeTypeNamed);
|
||||
tree2 = ts_tree_make_leaf(cat, {1, 1}, {3, 3}, TSNodeTypeNamed);
|
||||
parent1 = ts_tree_make_node(dog, 2, tree_array({
|
||||
tree1,
|
||||
tree2,
|
||||
}), TSNodeTypeNamed);
|
||||
});
|
||||
|
||||
after_each([&]() {
|
||||
|
|
@ -86,7 +81,7 @@ describe("Tree", []() {
|
|||
before_each([&]() {
|
||||
ts_tree_set_fragile_left(tree1);
|
||||
ts_tree_set_extra(tree1);
|
||||
parent = ts_tree_make_node(pig, 2, tree_array({
|
||||
parent = ts_tree_make_node(eel, 2, tree_array({
|
||||
tree1,
|
||||
tree2,
|
||||
}), TSNodeTypeNamed);
|
||||
|
|
@ -107,7 +102,7 @@ describe("Tree", []() {
|
|||
before_each([&]() {
|
||||
ts_tree_set_fragile_right(tree2);
|
||||
ts_tree_set_extra(tree2);
|
||||
parent = ts_tree_make_node(pig, 2, tree_array({
|
||||
parent = ts_tree_make_node(eel, 2, tree_array({
|
||||
tree1,
|
||||
tree2,
|
||||
}), TSNodeTypeNamed);
|
||||
|
|
@ -128,7 +123,7 @@ describe("Tree", []() {
|
|||
before_each([&]() {
|
||||
ts_tree_set_fragile_right(tree1);
|
||||
ts_tree_set_fragile_left(tree2);
|
||||
parent = ts_tree_make_node(pig, 2, tree_array({
|
||||
parent = ts_tree_make_node(eel, 2, tree_array({
|
||||
tree1,
|
||||
tree2,
|
||||
}), TSNodeTypeNamed);
|
||||
|
|
@ -145,26 +140,141 @@ describe("Tree", []() {
|
|||
});
|
||||
});
|
||||
|
||||
describe("edit(InputEdit)", [&]() {
|
||||
TSTree *tree = nullptr;
|
||||
|
||||
before_each([&]() {
|
||||
tree = ts_tree_make_node(cat, 3, tree_array({
|
||||
ts_tree_make_leaf(dog, {2, 2}, {3, 3}, TSNodeTypeNamed),
|
||||
ts_tree_make_leaf(eel, {2, 2}, {3, 3}, TSNodeTypeNamed),
|
||||
ts_tree_make_leaf(fox, {2, 2}, {3, 3}, TSNodeTypeNamed),
|
||||
}), TSNodeTypeNamed);
|
||||
|
||||
AssertThat(tree->padding, Equals<TSLength>({2, 2}));
|
||||
AssertThat(tree->size, Equals<TSLength>({13, 13}));
|
||||
});
|
||||
|
||||
after_each([&]() {
|
||||
ts_tree_release(tree);
|
||||
});
|
||||
|
||||
auto assert_consistent = [&](const TSTree *tree) {
|
||||
AssertThat(tree->children[0]->padding, Equals<TSLength>(tree->padding));
|
||||
|
||||
TSLength total_children_size = ts_length_zero();
|
||||
for (size_t i = 0; i < tree->child_count; i++)
|
||||
total_children_size = ts_length_add(total_children_size, ts_tree_total_size(tree->children[i]));
|
||||
AssertThat(total_children_size, Equals<TSLength>(ts_tree_total_size(tree)));
|
||||
};
|
||||
|
||||
describe("edits within a tree's padding", [&]() {
|
||||
it("resizes the padding of the tree and its leftmost descendants", [&]() {
|
||||
ts_tree_edit(tree, {1, 1, 0});
|
||||
|
||||
assert_consistent(tree);
|
||||
|
||||
AssertThat(tree->options.has_changes, IsTrue());
|
||||
AssertThat(tree->padding, Equals<TSLength>({0, 3}));
|
||||
AssertThat(tree->size, Equals<TSLength>({13, 13}));
|
||||
|
||||
AssertThat(tree->children[0]->options.has_changes, IsTrue());
|
||||
AssertThat(tree->children[0]->padding, Equals<TSLength>({0, 3}));
|
||||
AssertThat(tree->children[0]->size, Equals<TSLength>({3, 3}));
|
||||
|
||||
AssertThat(tree->children[1]->options.has_changes, IsFalse());
|
||||
AssertThat(tree->children[1]->padding, Equals<TSLength>({2, 2}));
|
||||
AssertThat(tree->children[1]->size, Equals<TSLength>({3, 3}));
|
||||
});
|
||||
});
|
||||
|
||||
describe("edits that start in a tree's padding but extend into its content", [&]() {
|
||||
it("shrinks the content to compensate for the expanded padding", [&]() {
|
||||
ts_tree_edit(tree, {1, 4, 3});
|
||||
|
||||
assert_consistent(tree);
|
||||
|
||||
AssertThat(tree->options.has_changes, IsTrue());
|
||||
AssertThat(tree->padding, Equals<TSLength>({0, 5}));
|
||||
AssertThat(tree->size, Equals<TSLength>({0, 11}));
|
||||
|
||||
AssertThat(tree->children[0]->options.has_changes, IsTrue());
|
||||
AssertThat(tree->children[0]->padding, Equals<TSLength>({0, 5}));
|
||||
AssertThat(tree->children[0]->size, Equals<TSLength>({0, 1}));
|
||||
});
|
||||
});
|
||||
|
||||
describe("insertions at the edge of a tree's padding", [&]() {
|
||||
it("expands the tree's padding", [&]() {
|
||||
ts_tree_edit(tree, {2, 2, 0});
|
||||
|
||||
assert_consistent(tree);
|
||||
|
||||
AssertThat(tree->options.has_changes, IsTrue());
|
||||
AssertThat(tree->padding, Equals<TSLength>({0, 4}));
|
||||
AssertThat(tree->size, Equals<TSLength>({13, 13}));
|
||||
|
||||
AssertThat(tree->children[0]->options.has_changes, IsTrue());
|
||||
AssertThat(tree->children[0]->padding, Equals<TSLength>({0, 4}));
|
||||
AssertThat(tree->children[0]->size, Equals<TSLength>({3, 3}));
|
||||
|
||||
AssertThat(tree->children[1]->options.has_changes, IsFalse());
|
||||
});
|
||||
});
|
||||
|
||||
describe("replacements starting at the edge of a tree's padding", [&]() {
|
||||
it("resizes the content and not the padding", [&]() {
|
||||
ts_tree_edit(tree, {2, 5, 2});
|
||||
|
||||
assert_consistent(tree);
|
||||
|
||||
AssertThat(tree->options.has_changes, IsTrue());
|
||||
AssertThat(tree->padding, Equals<TSLength>({2, 2}));
|
||||
AssertThat(tree->size, Equals<TSLength>({0, 16}));
|
||||
|
||||
AssertThat(tree->children[0]->options.has_changes, IsTrue());
|
||||
AssertThat(tree->children[0]->padding, Equals<TSLength>({2, 2}));
|
||||
AssertThat(tree->children[0]->size, Equals<TSLength>({0, 6}));
|
||||
|
||||
AssertThat(tree->children[1]->options.has_changes, IsFalse());
|
||||
});
|
||||
});
|
||||
|
||||
describe("deletions that span more than one child node", [&]() {
|
||||
it("shrinks subsequent child nodes", [&]() {
|
||||
ts_tree_edit(tree, {1, 3, 10});
|
||||
|
||||
assert_consistent(tree);
|
||||
|
||||
AssertThat(tree->options.has_changes, IsTrue());
|
||||
AssertThat(tree->padding, Equals<TSLength>({0, 4}));
|
||||
AssertThat(tree->size, Equals<TSLength>({0, 4}));
|
||||
|
||||
AssertThat(tree->children[0]->options.has_changes, IsTrue());
|
||||
AssertThat(tree->children[0]->padding, Equals<TSLength>({0, 4}));
|
||||
AssertThat(tree->children[0]->size, Equals<TSLength>({0, 0}));
|
||||
|
||||
AssertThat(tree->children[1]->options.has_changes, IsTrue());
|
||||
AssertThat(tree->children[1]->padding, Equals<TSLength>({0, 0}));
|
||||
AssertThat(tree->children[1]->size, Equals<TSLength>({0, 0}));
|
||||
|
||||
AssertThat(tree->children[2]->options.has_changes, IsTrue());
|
||||
AssertThat(tree->children[2]->padding, Equals<TSLength>({0, 1}));
|
||||
AssertThat(tree->children[2]->size, Equals<TSLength>({3, 3}));
|
||||
});
|
||||
});
|
||||
});
|
||||
|
||||
describe("equality", [&]() {
|
||||
it("returns true for identical trees", [&]() {
|
||||
TSTree *tree1_copy = ts_tree_make_leaf(
|
||||
cat,
|
||||
ts_length_make(5, 4),
|
||||
ts_length_make(2, 1),
|
||||
TSNodeTypeNamed);
|
||||
|
||||
TSTree *tree1_copy = ts_tree_make_leaf(cat, {2, 1}, {5, 4}, TSNodeTypeNamed);
|
||||
AssertThat(ts_tree_eq(tree1, tree1_copy), IsTrue());
|
||||
|
||||
TSTree *tree2_copy = ts_tree_make_leaf(
|
||||
cat,
|
||||
ts_length_make(3, 3),
|
||||
ts_length_make(1, 1),
|
||||
TSNodeTypeNamed);
|
||||
|
||||
TSTree *tree2_copy = ts_tree_make_leaf(cat, {1, 1}, {3, 3}, TSNodeTypeNamed);
|
||||
AssertThat(ts_tree_eq(tree2, tree2_copy), IsTrue());
|
||||
|
||||
TSTree *parent2 = ts_tree_make_node(dog, 2, tree_array({
|
||||
tree1_copy, tree2_copy,
|
||||
tree1_copy,
|
||||
tree2_copy,
|
||||
}), TSNodeTypeNamed);
|
||||
|
||||
AssertThat(ts_tree_eq(parent1, parent2), IsTrue());
|
||||
|
|
@ -177,8 +287,8 @@ describe("Tree", []() {
|
|||
it("returns false for trees with different symbols", [&]() {
|
||||
TSTree *different_tree = ts_tree_make_leaf(
|
||||
tree1->symbol + 1,
|
||||
tree1->size,
|
||||
tree1->padding,
|
||||
tree1->size,
|
||||
TSNodeTypeNamed);
|
||||
|
||||
AssertThat(ts_tree_eq(tree1, different_tree), IsFalse());
|
||||
|
|
@ -188,8 +298,8 @@ describe("Tree", []() {
|
|||
it("returns false for trees with different children", [&]() {
|
||||
TSTree *different_tree = ts_tree_make_leaf(
|
||||
tree1->symbol + 1,
|
||||
tree1->size,
|
||||
tree1->padding,
|
||||
tree1->size,
|
||||
TSNodeTypeNamed);
|
||||
|
||||
TSTree *different_parent = ts_tree_make_node(dog, 2, tree_array({
|
||||
|
|
@ -243,6 +353,10 @@ describe("Tree", []() {
|
|||
|
||||
END_TEST
|
||||
|
||||
ostream &operator<<(ostream &stream, const TSLength &length) {
|
||||
return stream << "{bytes:" << length.bytes << ", chars:" << length.chars << "}";
|
||||
}
|
||||
|
||||
bool operator==(TSLength left, TSLength right) {
|
||||
return ts_length_eq(left, right);
|
||||
}
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue