Replace node pos/size functions with start/end char/byte functions
This commit is contained in:
parent
fe5286f863
commit
b3a6de6dad
7 changed files with 147 additions and 130 deletions
|
|
@ -9,21 +9,34 @@ START_TEST
|
|||
describe("Node", []() {
|
||||
TSDocument *document;
|
||||
TSNode array_node;
|
||||
string input_string;
|
||||
string input_string = "\n"
|
||||
"\n"
|
||||
"[\n"
|
||||
" 123,\n"
|
||||
" false,\n"
|
||||
" {\n"
|
||||
" \"x\": null\n"
|
||||
" }\n"
|
||||
"]";
|
||||
|
||||
size_t array_index = input_string.find("[\n");
|
||||
size_t array_end_index = input_string.find("]") + 1;
|
||||
size_t number_index = input_string.find("123");
|
||||
size_t number_end_index = number_index + string("123").size();
|
||||
size_t false_index = input_string.find("false");
|
||||
size_t false_end_index = false_index + string("false").size();
|
||||
size_t object_index = input_string.find("{");
|
||||
size_t object_end_index = input_string.find("}") + 1;
|
||||
size_t string_index = input_string.find("\"x\"");
|
||||
size_t string_end_index = string_index + 3;
|
||||
size_t colon_index = input_string.find(":");
|
||||
size_t null_index = input_string.find("null");
|
||||
size_t null_end_index = null_index + string("null").size();
|
||||
|
||||
before_each([&]() {
|
||||
document = ts_document_make();
|
||||
ts_document_set_language(document, ts_language_json());
|
||||
|
||||
input_string = "\n"
|
||||
"\n"
|
||||
"[\n"
|
||||
" 123,\n"
|
||||
" false,\n"
|
||||
" {\n"
|
||||
" \"x\": null\n"
|
||||
" }\n"
|
||||
"]";
|
||||
|
||||
ts_document_set_input_string(document, input_string.c_str());
|
||||
ts_document_parse(document);
|
||||
|
|
@ -53,27 +66,27 @@ describe("Node", []() {
|
|||
AssertThat(ts_node_name(child2, document), Equals("false"));
|
||||
AssertThat(ts_node_name(child3, document), Equals("object"));
|
||||
|
||||
AssertThat(ts_node_pos(array_node).bytes, Equals<size_t>(2));
|
||||
AssertThat(ts_node_size(array_node).bytes, Equals<size_t>(41));
|
||||
|
||||
AssertThat(ts_node_start_byte(array_node), Equals(array_index));
|
||||
AssertThat(ts_node_end_byte(array_node), Equals(array_end_index));
|
||||
AssertThat(ts_node_start_char(array_node), Equals(array_index));
|
||||
AssertThat(ts_node_end_char(array_node), Equals(array_end_index));
|
||||
AssertThat(ts_node_start_point(array_node), Equals<TSPoint>({ 2, 0 }));
|
||||
AssertThat(ts_node_end_point(array_node), Equals<TSPoint>({ 8, 1 }));
|
||||
|
||||
AssertThat(ts_node_pos(child1).bytes, Equals(input_string.find("123")));
|
||||
AssertThat(ts_node_size(child1).bytes, Equals<size_t>(3));
|
||||
|
||||
AssertThat(ts_node_start_byte(child1), Equals(number_index));
|
||||
AssertThat(ts_node_end_byte(child1), Equals(number_end_index));
|
||||
AssertThat(ts_node_start_char(child1), Equals(number_index));
|
||||
AssertThat(ts_node_end_char(child1), Equals(number_end_index));
|
||||
AssertThat(ts_node_start_point(child1), Equals<TSPoint>({ 3, 2 }));
|
||||
AssertThat(ts_node_end_point(child1), Equals<TSPoint>({ 3, 5 }));
|
||||
|
||||
AssertThat(ts_node_pos(child2).bytes, Equals(input_string.find("false")));
|
||||
AssertThat(ts_node_size(child2).bytes, Equals<size_t>(5));
|
||||
|
||||
AssertThat(ts_node_start_byte(child2), Equals(false_index));
|
||||
AssertThat(ts_node_end_byte(child2), Equals(false_end_index));
|
||||
AssertThat(ts_node_start_point(child2), Equals<TSPoint>({ 4, 2 }));
|
||||
AssertThat(ts_node_end_point(child2), Equals<TSPoint>({ 4, 7 }));
|
||||
|
||||
AssertThat(ts_node_pos(child3).bytes, Equals(input_string.find("{")));
|
||||
AssertThat(ts_node_size(child3).bytes, Equals<size_t>(19));
|
||||
|
||||
AssertThat(ts_node_start_byte(child3), Equals(object_index));
|
||||
AssertThat(ts_node_end_byte(child3), Equals(object_end_index));
|
||||
AssertThat(ts_node_start_point(child3), Equals<TSPoint>({ 5, 2 }));
|
||||
AssertThat(ts_node_end_point(child3), Equals<TSPoint>({ 7, 3 }));
|
||||
|
||||
|
|
@ -85,9 +98,18 @@ describe("Node", []() {
|
|||
AssertThat(ts_node_name(grandchild1, document), Equals("string"));
|
||||
AssertThat(ts_node_name(grandchild2, document), Equals("null"));
|
||||
|
||||
AssertThat(ts_node_start_byte(grandchild1), Equals(string_index));
|
||||
AssertThat(ts_node_end_byte(grandchild1), Equals(string_end_index));
|
||||
AssertThat(ts_node_start_point(grandchild1), Equals<TSPoint>({ 6, 4 }));
|
||||
AssertThat(ts_node_end_point(grandchild1), Equals<TSPoint>({ 6, 7 }));
|
||||
|
||||
AssertThat(ts_node_start_byte(grandchild2), Equals(null_index));
|
||||
AssertThat(ts_node_end_byte(grandchild2), Equals(null_end_index));
|
||||
AssertThat(ts_node_start_point(grandchild2), Equals<TSPoint>({ 6, 9 }));
|
||||
AssertThat(ts_node_end_point(grandchild2), Equals<TSPoint>({ 6, 13 }));
|
||||
|
||||
AssertThat(ts_node_parent(grandchild1), Equals(child3));
|
||||
AssertThat(ts_node_parent(grandchild2), Equals(child3));
|
||||
AssertThat(ts_node_parent(child1), Equals(array_node));
|
||||
AssertThat(ts_node_parent(child2), Equals(array_node));
|
||||
AssertThat(ts_node_parent(child3), Equals(array_node));
|
||||
|
|
@ -124,27 +146,23 @@ describe("Node", []() {
|
|||
AssertThat(ts_node_is_named(child6), IsTrue());
|
||||
AssertThat(ts_node_is_named(child7), IsFalse());
|
||||
|
||||
AssertThat(ts_node_pos(child1).bytes, Equals<size_t>(2));
|
||||
AssertThat(ts_node_size(child1).bytes, Equals<size_t>(1));
|
||||
|
||||
AssertThat(ts_node_start_byte(child1), Equals(array_index));
|
||||
AssertThat(ts_node_end_byte(child1), Equals(array_index + 1));
|
||||
AssertThat(ts_node_start_point(child1), Equals<TSPoint>({ 2, 0 }));
|
||||
AssertThat(ts_node_end_point(child1), Equals<TSPoint>({ 2, 1 }));
|
||||
|
||||
AssertThat(ts_node_pos(child3).bytes, Equals<size_t>(9));
|
||||
AssertThat(ts_node_size(child3).bytes, Equals<size_t>(1));
|
||||
|
||||
AssertThat(ts_node_start_byte(child3), Equals(number_end_index));
|
||||
AssertThat(ts_node_end_byte(child3), Equals(number_end_index + 1));
|
||||
AssertThat(ts_node_start_point(child3), Equals<TSPoint>({ 3, 5 }));
|
||||
AssertThat(ts_node_end_point(child3), Equals<TSPoint>({ 3, 6 }));
|
||||
|
||||
AssertThat(ts_node_pos(child5).bytes, Equals<size_t>(18));
|
||||
AssertThat(ts_node_size(child5).bytes, Equals<size_t>(1));
|
||||
|
||||
AssertThat(ts_node_start_byte(child5), Equals(false_end_index));
|
||||
AssertThat(ts_node_end_byte(child5), Equals(false_end_index + 1));
|
||||
AssertThat(ts_node_start_point(child5), Equals<TSPoint>({ 4, 7 }));
|
||||
AssertThat(ts_node_end_point(child5), Equals<TSPoint>({ 4, 8 }));
|
||||
|
||||
AssertThat(ts_node_pos(child7).bytes, Equals<size_t>(42));
|
||||
AssertThat(ts_node_size(child7).bytes, Equals<size_t>(1));
|
||||
|
||||
AssertThat(ts_node_start_byte(child7), Equals(array_end_index - 1));
|
||||
AssertThat(ts_node_end_byte(child7), Equals(array_end_index));
|
||||
AssertThat(ts_node_start_point(child7), Equals<TSPoint>({ 8, 0 }));
|
||||
AssertThat(ts_node_end_point(child7), Equals<TSPoint>({ 8, 1 }));
|
||||
|
||||
|
|
@ -162,6 +180,11 @@ describe("Node", []() {
|
|||
AssertThat(ts_node_name(grandchild4, document), Equals("null"));
|
||||
AssertThat(ts_node_name(grandchild5, document), Equals("}"));
|
||||
|
||||
AssertThat(ts_node_parent(grandchild1), Equals(child6));
|
||||
AssertThat(ts_node_parent(grandchild2), Equals(child6));
|
||||
AssertThat(ts_node_parent(grandchild3), Equals(child6));
|
||||
AssertThat(ts_node_parent(grandchild4), Equals(child6));
|
||||
AssertThat(ts_node_parent(grandchild5), Equals(child6));
|
||||
AssertThat(ts_node_parent(child1), Equals(array_node));
|
||||
AssertThat(ts_node_parent(child2), Equals(array_node));
|
||||
AssertThat(ts_node_parent(child3), Equals(array_node));
|
||||
|
|
@ -252,16 +275,17 @@ describe("Node", []() {
|
|||
describe("named_descendant_for_range(start, end)", [&]() {
|
||||
describe("when there is a leaf node that spans the given range exactly", [&]() {
|
||||
it("returns that leaf node", [&]() {
|
||||
TSNode leaf = ts_node_named_descendent_for_range(array_node, 28, 30);
|
||||
TSNode leaf = ts_node_named_descendant_for_range(array_node, string_index, string_end_index - 1);
|
||||
AssertThat(ts_node_name(leaf, document), Equals("string"));
|
||||
AssertThat(ts_node_size(leaf).bytes, Equals<size_t>(3));
|
||||
AssertThat(ts_node_pos(leaf).bytes, Equals<size_t>(28));
|
||||
AssertThat(ts_node_start_byte(leaf), Equals(string_index));
|
||||
AssertThat(ts_node_end_byte(leaf), Equals(string_end_index));
|
||||
AssertThat(ts_node_start_point(leaf), Equals<TSPoint>({ 6, 4 }));
|
||||
AssertThat(ts_node_end_point(leaf), Equals<TSPoint>({ 6, 7 }));
|
||||
|
||||
size_t index = input_string.find("123");
|
||||
leaf = ts_node_named_descendent_for_range(array_node, index, index + 2);
|
||||
leaf = ts_node_named_descendant_for_range(array_node, number_index, number_end_index - 1);
|
||||
AssertThat(ts_node_name(leaf, document), Equals("number"));
|
||||
AssertThat(ts_node_pos(leaf).bytes, Equals(index));
|
||||
AssertThat(ts_node_size(leaf).bytes, Equals<size_t>(3));
|
||||
AssertThat(ts_node_start_byte(leaf), Equals(number_index));
|
||||
AssertThat(ts_node_end_byte(leaf), Equals(number_end_index));
|
||||
AssertThat(ts_node_start_point(leaf), Equals<TSPoint>({ 3, 2 }));
|
||||
AssertThat(ts_node_end_point(leaf), Equals<TSPoint>({ 3, 5 }));
|
||||
});
|
||||
|
|
@ -269,20 +293,17 @@ describe("Node", []() {
|
|||
|
||||
describe("when there is a leaf node that extends beyond the given range", [&]() {
|
||||
it("returns that leaf node", [&]() {
|
||||
size_t index = input_string.find("\"x\"");
|
||||
TSNode leaf = ts_node_named_descendent_for_range(array_node, index, index + 1);
|
||||
TSNode leaf = ts_node_named_descendant_for_range(array_node, string_index, string_index + 1);
|
||||
AssertThat(ts_node_name(leaf, document), Equals("string"));
|
||||
AssertThat(ts_node_pos(leaf).bytes, Equals(index));
|
||||
AssertThat(ts_node_size(leaf).bytes, Equals<size_t>(3));
|
||||
|
||||
AssertThat(ts_node_start_byte(leaf), Equals(string_index));
|
||||
AssertThat(ts_node_end_byte(leaf), Equals(string_end_index));
|
||||
AssertThat(ts_node_start_point(leaf), Equals<TSPoint>({ 6, 4 }));
|
||||
AssertThat(ts_node_end_point(leaf), Equals<TSPoint>({ 6, 7 }));
|
||||
|
||||
leaf = ts_node_named_descendent_for_range(array_node, index + 1, index + 2);
|
||||
leaf = ts_node_named_descendant_for_range(array_node, string_index + 1, string_index + 2);
|
||||
AssertThat(ts_node_name(leaf, document), Equals("string"));
|
||||
AssertThat(ts_node_pos(leaf).bytes, Equals<size_t>(index));
|
||||
AssertThat(ts_node_size(leaf).bytes, Equals<size_t>(3));
|
||||
|
||||
AssertThat(ts_node_start_byte(leaf), Equals(string_index));
|
||||
AssertThat(ts_node_end_byte(leaf), Equals(string_end_index));
|
||||
AssertThat(ts_node_start_point(leaf), Equals<TSPoint>({ 6, 4 }));
|
||||
AssertThat(ts_node_end_point(leaf), Equals<TSPoint>({ 6, 7 }));
|
||||
});
|
||||
|
|
@ -290,49 +311,38 @@ describe("Node", []() {
|
|||
|
||||
describe("when there is no leaf node that spans the given range", [&]() {
|
||||
it("returns the smallest node that does span the range", [&]() {
|
||||
size_t index = input_string.find("\"x\"");
|
||||
TSNode node = ts_node_named_descendent_for_range(array_node, index, index + 3);
|
||||
TSNode node = ts_node_named_descendant_for_range(array_node, string_index, string_index + 3);
|
||||
AssertThat(ts_node_name(node, document), Equals("object"));
|
||||
|
||||
size_t object_index = input_string.find("{");
|
||||
AssertThat(ts_node_pos(node).bytes, Equals<size_t>(object_index));
|
||||
AssertThat(ts_node_size(node).bytes, Equals<size_t>(19));
|
||||
|
||||
AssertThat(ts_node_start_byte(node), Equals(object_index));
|
||||
AssertThat(ts_node_end_byte(node), Equals(object_end_index));
|
||||
AssertThat(ts_node_start_point(node), Equals<TSPoint>({ 5, 2 }));
|
||||
AssertThat(ts_node_end_point(node), Equals<TSPoint>({ 7, 3 }));
|
||||
});
|
||||
|
||||
it("does not return invisible nodes (repeats)", [&]() {
|
||||
size_t comma_index = input_string.find(",");
|
||||
TSNode node = ts_node_named_descendent_for_range(array_node, comma_index, comma_index + 1);
|
||||
TSNode node = ts_node_named_descendant_for_range(array_node, number_end_index, number_end_index + 1);
|
||||
AssertThat(ts_node_name(node, document), Equals("array"));
|
||||
size_t array_index = input_string.find("[");
|
||||
AssertThat(ts_node_pos(node).bytes, Equals<size_t>(array_index));
|
||||
AssertThat(ts_node_size(node).bytes, Equals<size_t>(41));
|
||||
|
||||
AssertThat(ts_node_start_byte(node), Equals(array_index));
|
||||
AssertThat(ts_node_end_byte(node), Equals(array_end_index));
|
||||
AssertThat(ts_node_start_point(node), Equals<TSPoint>({ 2, 0 }));
|
||||
AssertThat(ts_node_end_point(node), Equals<TSPoint>({ 8, 1 }));
|
||||
});
|
||||
});
|
||||
});
|
||||
|
||||
describe("descendent_for_range(start, end)", [&]() {
|
||||
describe("descendant_for_range(start, end)", [&]() {
|
||||
it("returns the smallest concrete node that spans the given range", [&]() {
|
||||
size_t colon_index = input_string.find(":");
|
||||
TSNode node1 = ts_node_descendent_for_range(array_node, colon_index, colon_index);
|
||||
TSNode node1 = ts_node_descendant_for_range(array_node, colon_index, colon_index);
|
||||
AssertThat(ts_node_name(node1, document), Equals(":"));
|
||||
AssertThat(ts_node_pos(node1).bytes, Equals<size_t>(colon_index));
|
||||
AssertThat(ts_node_size(node1).bytes, Equals<size_t>(1));
|
||||
AssertThat(ts_node_start_byte(node1), Equals(colon_index));
|
||||
AssertThat(ts_node_end_byte(node1), Equals(colon_index + 1));
|
||||
AssertThat(ts_node_start_point(node1), Equals<TSPoint>({ 6, 7 }));
|
||||
AssertThat(ts_node_end_point(node1), Equals<TSPoint>({ 6, 8 }));
|
||||
|
||||
size_t index = input_string.find("\":");
|
||||
TSNode node2 = ts_node_descendent_for_range(array_node, index, index + 2);
|
||||
TSNode node2 = ts_node_descendant_for_range(array_node, string_index + 2, string_index + 4);
|
||||
AssertThat(ts_node_name(node2, document), Equals("object"));
|
||||
|
||||
size_t object_index = input_string.find("{");
|
||||
AssertThat(ts_node_pos(node2).bytes, Equals<size_t>(object_index));
|
||||
AssertThat(ts_node_size(node2).bytes, Equals<size_t>(19));
|
||||
AssertThat(ts_node_start_byte(node2), Equals(object_index));
|
||||
AssertThat(ts_node_end_byte(node2), Equals(object_end_index));
|
||||
AssertThat(ts_node_start_point(node2), Equals<TSPoint>({ 5, 2 }));
|
||||
AssertThat(ts_node_end_point(node2), Equals<TSPoint>({ 7, 3 }));
|
||||
});
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue