Clean up tree array assertions in stack spec
This commit is contained in:
parent
b113dc8b0f
commit
f444a715fd
5 changed files with 29 additions and 46 deletions
|
|
@ -145,9 +145,7 @@ describe("Stack", [&]() {
|
|||
AssertThat(results.size, Equals<size_t>(1));
|
||||
|
||||
StackPopResult result = results.contents[0];
|
||||
AssertThat(result.trees.size, Equals<size_t>(2));
|
||||
AssertThat(result.trees.contents[0], Equals(trees[1]));
|
||||
AssertThat(result.trees.contents[1], Equals(trees[2]));
|
||||
AssertThat(result.trees, Equals(vector<TSTree *>({ trees[1], trees[2] })));
|
||||
AssertThat(*ts_stack_head(stack, 0), Equals<StackEntry>({trees[0], stateA, tree_len}));
|
||||
free_pop_results(&results);
|
||||
|
||||
|
|
@ -158,8 +156,7 @@ describe("Stack", [&]() {
|
|||
AssertThat(results.size, Equals<size_t>(1));
|
||||
|
||||
result = results.contents[0];
|
||||
AssertThat(result.trees.size, Equals<size_t>(1));
|
||||
AssertThat(result.trees.contents[0], Equals(trees[0]));
|
||||
AssertThat(result.trees, Equals(vector<TSTree *>({ trees[0] })));
|
||||
AssertThat(ts_stack_head(stack, 0), Equals<const StackEntry *>(nullptr));
|
||||
|
||||
free_pop_results(&results);
|
||||
|
|
@ -172,10 +169,7 @@ describe("Stack", [&]() {
|
|||
AssertThat(results.size, Equals<size_t>(1));
|
||||
|
||||
StackPopResult result = results.contents[0];
|
||||
AssertThat(result.trees.size, Equals<size_t>(3));
|
||||
AssertThat(result.trees.contents[0], Equals(trees[0]));
|
||||
AssertThat(result.trees.contents[1], Equals(trees[1]));
|
||||
AssertThat(result.trees.contents[2], Equals(trees[2]));
|
||||
AssertThat(result.trees, Equals(vector<TSTree *>({ trees[0], trees[1], trees[2] })));
|
||||
AssertThat(ts_stack_head(stack, 0), Equals<const StackEntry *>(nullptr));
|
||||
|
||||
free_pop_results(&results);
|
||||
|
|
@ -186,10 +180,7 @@ describe("Stack", [&]() {
|
|||
AssertThat(results.size, Equals<size_t>(1));
|
||||
|
||||
StackPopResult result = results.contents[0];
|
||||
AssertThat(result.trees.size, Equals<size_t>(3));
|
||||
AssertThat(result.trees.contents[0], Equals(trees[0]));
|
||||
AssertThat(result.trees.contents[1], Equals(trees[1]));
|
||||
AssertThat(result.trees.contents[2], Equals(trees[2]));
|
||||
AssertThat(result.trees, Equals(vector<TSTree *>({ trees[0], trees[1], trees[2] })));
|
||||
|
||||
free_pop_results(&results);
|
||||
});
|
||||
|
|
@ -386,15 +377,11 @@ describe("Stack", [&]() {
|
|||
AssertThat(results.size, Equals<size_t>(2));
|
||||
StackPopResult pop1 = results.contents[0];
|
||||
AssertThat(pop1.head_index, Equals(0));
|
||||
AssertThat(pop1.trees.size, Equals<size_t>(2));
|
||||
AssertThat(pop1.trees.contents[0], Equals(trees[3]));
|
||||
AssertThat(pop1.trees.contents[1], Equals(trees[6]));
|
||||
AssertThat(pop1.trees, Equals(vector<TSTree *>({ trees[3], trees[6] })));
|
||||
|
||||
StackPopResult pop2 = results.contents[1];
|
||||
AssertThat(pop2.head_index, Equals(1));
|
||||
AssertThat(pop2.trees.size, Equals<size_t>(2));
|
||||
AssertThat(pop2.trees.contents[0], Equals(trees[5]));
|
||||
AssertThat(pop2.trees.contents[1], Equals(trees[6]));
|
||||
AssertThat(pop2.trees, Equals(vector<TSTree *>({ trees[5], trees[6] })));
|
||||
|
||||
AssertThat(ts_stack_head_count(stack), Equals(2));
|
||||
AssertThat(*ts_stack_head(stack, 0), Equals<StackEntry>({trees[2], stateC, tree_len * 3}));
|
||||
|
|
@ -445,15 +432,12 @@ describe("Stack", [&]() {
|
|||
AssertThat(results.size, Equals<size_t>(2));
|
||||
StackPopResult pop1 = results.contents[0];
|
||||
AssertThat(pop1.head_index, Equals(0));
|
||||
AssertThat(pop1.trees.size, Equals<size_t>(2));
|
||||
AssertThat(pop1.trees.contents[0], Equals(trees[6]));
|
||||
AssertThat(pop1.trees.contents[1], Equals(trees[7]));
|
||||
AssertThat(pop1.trees, Equals(vector<TSTree *>({ trees[6], trees[7] })));
|
||||
|
||||
StackPopResult pop2 = results.contents[1];
|
||||
AssertThat(pop2.head_index, Equals(1));
|
||||
AssertThat(pop2.trees.size, Equals<size_t>(2));
|
||||
AssertThat(pop2.trees.contents[0], Equals(trees[6]));
|
||||
AssertThat(pop2.trees.contents[1], Equals(trees[7]));
|
||||
AssertThat(pop2.trees, Equals(vector<TSTree *>({ trees[6], trees[7] })));
|
||||
AssertThat(pop2.trees.contents, Equals(pop1.trees.contents));
|
||||
|
||||
free_pop_results(&results);
|
||||
});
|
||||
|
|
@ -473,9 +457,8 @@ describe("Stack", [&]() {
|
|||
|
||||
AssertThat(results.size, Equals<size_t>(1));
|
||||
StackPopResult pop1 = results.contents[0];
|
||||
AssertThat(pop1.trees.size, Equals<size_t>(3));
|
||||
AssertThat(pop1.head_index, Equals(0));
|
||||
AssertThat(pop1.trees.contents[0], Equals(trees[2]));
|
||||
AssertThat(pop1.trees, Equals(vector<TSTree *>({ trees[2], trees[3], trees[ 6] })));
|
||||
|
||||
free_pop_results(&results);
|
||||
});
|
||||
|
|
@ -494,9 +477,8 @@ describe("Stack", [&]() {
|
|||
|
||||
AssertThat(results.size, Equals<size_t>(1));
|
||||
StackPopResult pop1 = results.contents[0];
|
||||
AssertThat(pop1.trees.size, Equals<size_t>(3));
|
||||
AssertThat(pop1.head_index, Equals(0));
|
||||
AssertThat(pop1.trees.contents[0], Equals(trees[4]));
|
||||
AssertThat(pop1.trees, Equals(vector<TSTree *>({ trees[4], trees[5], trees[6] })))
|
||||
|
||||
free_pop_results(&results);
|
||||
});
|
||||
|
|
@ -548,9 +530,7 @@ describe("Stack", [&]() {
|
|||
StackPopResult pop1 = results.contents[0];
|
||||
AssertThat(ts_stack_top_tree(stack, 0), Equals(trees[3]));
|
||||
AssertThat(pop1.head_index, Equals(0));
|
||||
AssertThat(pop1.trees.size, Equals<size_t>(2));
|
||||
AssertThat(pop1.trees.contents[0], Equals(trees[8]));
|
||||
AssertThat(pop1.trees.contents[1], Equals(trees[9]));
|
||||
AssertThat(pop1.trees, Equals(vector<TSTree *>({ trees[8], trees[9] })))
|
||||
|
||||
StackPopResult pop2 = results.contents[1];
|
||||
AssertThat(ts_stack_top_tree(stack, 1), Equals(trees[5]));
|
||||
|
|
@ -583,26 +563,17 @@ describe("Stack", [&]() {
|
|||
StackPopResult pop1 = results.contents[0];
|
||||
AssertThat(ts_stack_top_tree(stack, 0), Equals(trees[2]));
|
||||
AssertThat(pop1.head_index, Equals(0));
|
||||
AssertThat(pop1.trees.size, Equals<size_t>(3));
|
||||
AssertThat(pop1.trees.contents[0], Equals(trees[3]));
|
||||
AssertThat(pop1.trees.contents[1], Equals(trees[8]));
|
||||
AssertThat(pop1.trees.contents[2], Equals(trees[9]));
|
||||
AssertThat(pop1.trees, Equals(vector<TSTree *>({ trees[3], trees[8], trees[9] })))
|
||||
|
||||
StackPopResult pop2 = results.contents[1];
|
||||
AssertThat(ts_stack_top_tree(stack, 1), Equals(trees[4]));
|
||||
AssertThat(pop2.head_index, Equals(1));
|
||||
AssertThat(pop2.trees.size, Equals<size_t>(3));
|
||||
AssertThat(pop2.trees.contents[0], Equals(trees[5]));
|
||||
AssertThat(pop2.trees.contents[1], Equals(trees[8]));
|
||||
AssertThat(pop2.trees.contents[2], Equals(trees[9]));
|
||||
AssertThat(pop2.trees, Equals(vector<TSTree *>({ trees[5], trees[8], trees[9] })))
|
||||
|
||||
StackPopResult pop3 = results.contents[2];
|
||||
AssertThat(ts_stack_top_tree(stack, 2), Equals(trees[6]));
|
||||
AssertThat(pop3.head_index, Equals(2));
|
||||
AssertThat(pop3.trees.size, Equals<size_t>(3));
|
||||
AssertThat(pop3.trees.contents[0], Equals(trees[7]));
|
||||
AssertThat(pop3.trees.contents[1], Equals(trees[8]));
|
||||
AssertThat(pop3.trees.contents[2], Equals(trees[9]));
|
||||
AssertThat(pop3.trees, Equals(vector<TSTree *>({ trees[7], trees[8], trees[9] })))
|
||||
|
||||
free_pop_results(&results);
|
||||
});
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue