代码样例
START_TEST(test_START_EMPTY_TREE_TREEBASE_PRINT_FREETREE_TEST) {
printf("_________START_EMPTY_TREE/TREEBASE_PRINT/FREETREE_TEST__________\n");
fflush(stdout);
int *ptr;
for (int i = 0; i < arr_size; i++) {
ptr = malloc(sizeof(int));
memcpy(ptr, (int_arr_ptr + i), sizeof(int));
insert(ptr_tree_base_int_1, ptr);
}
// should print tree
printf("!!!Next lines has to be tree printed out\n");
fflush(stdout);
ck_assert_int_eq(printTree(ptr_tree_base_int_1), true);
printf("_____________________\n");
fflush(stdout);
// No output
ck_assert_int_eq(freeTree(ptr_tree_base_int_1), true);
// should print cannot free empty tree
printf("!!!Next line has to be:\"cannot free empty tree\"\n");
fflush(stdout);
ck_assert_int_eq(freeTree(ptr_tree_base_int_1), true);
// should print cannot print empty tree
printf("!!!Next line has to be:\"cannot print empty tree\"\n");
fflush(stdout);
ck_assert_int_eq(printTree(ptr_tree_base_int_1), false);
printf("_____________________\n");
fflush(stdout);
ptr_tree_base_int_1 = NULL;
free(ptr_tree_base_int_1);
// should print cannot free empty tree base
printf("!!!Next line has to be:\"cannot free empty tree base\"\n");
fflush(stdout);
ck_assert_int_eq(freeTree(ptr_tree_base_int_1), true);
// should print cannot print empty tree base
printf("!!!Next line has to be:\"cannot print empty tree base\"\n");
fflush(stdout);
ck_assert_int_eq(printTree(ptr_tree_base_int_1), false);
printf("_____________________\n");
fflush(stdout);
free(int_arr_ptr);
int_arr_ptr = NULL;
printf("freeing the array...\n");
fflush(stdout);
printf("________END_____________\n");
fflush(stdout);
ck_assert_int_eq(ptr_tree_base_int_1->size, 0);
} END_TEST
PrintTree功能
bool printTree(TreeBase *tree){
void *previous = NULL;
int cnt_tasks = 0;
if (!tree) {
printf("PRINT: Cannot print empty tree base\n");
fflush(stdout);
return false;
}
/* set current to root of binary tree */
TreeNode *current_node = tree->base;
if (!(tree->base)) {
printf("PRINT: Cannot print empty tree\n");
fflush(stdout);
return false;
}
StackNode *stack = NULL;
while (true) {
if(current_node) {
push(&stack, current_node);
current_node = current_node->left;
} else {
if (stack) {
current_node = pop(&stack);
if (cnt_tasks > 1) {
if (tree->comp(previous, current_node->value) != -1) {
printf("PRINTTREE: Invalid BST\n");
fflush(stdout);
assert(NULL);
}
}
previous = current_node->value;
tree->print(current_node->value);
cnt_tasks++;
current_node = current_node->right;
} else {
return (cnt_tasks == tree->size);
}
}
}
}
树->打印功能
void print_ints(void *p){
printf("%d\n", *(int*)p);
fflush(stdout);
}
样品输出
FREETREE: Cant free empty tree
!!!Next line has to be:"cannot free empty tree"
FREETREE: Cant free empty tree
FREETREE: Cant free empty tree
!!!Next line has to be:"cannot print empty tree"
PRINT: Cannot print empty tree
PRINT: Cannot print empty tree
_____________________
那是很多代码,要点在!!!之后!应该有一行,但印有两行
printf("PRINT: Cannot print empty tree\n");
fflush(stdout);
return false;
^^此行打印两次
提意见:什么是“宏”?这是从API
#define ck_assert_int_eq(X, Y) _ck_assert_int(X, ==, Y)
Check单元测试框架的0.9.6版中引入的ck_assert_int_eq
宏定义为:
#define _ck_assert_int(X, O, Y) ck_assert_msg((X) O (Y), \
"Assertion '"#X#O#Y"' failed: "#X"==%d, "#Y"==%d", X, Y)
#define ck_assert_int_eq(X, Y) _ck_assert_int(X, ==, Y)
可以看出,参数在宏定义中出现两次:一次用于实际的相等性检查((X) O (Y)
部分),另一次ck_assert_msg(..., X, Y)
用于最后的参数,以便在发生故障时记录消息。查看代码的特定部分:
// should print cannot print empty tree
printf("!!!Next line has to be:\"cannot print empty tree\"\n");
fflush(stdout);
ck_assert_int_eq(printTree(ptr_tree_base_int_1), false);
C预处理器将相应地将宏扩展为等效于以下代码:
// should print cannot free empty tree
printf("!!!Next line has to be:\"cannot free empty tree\"\n");
fflush(stdout);
ck_assert_msg((printTree(ptr_tree_base_int_1)) == (false),
"Assertion '"#X#O#Y"' failed: "#X"==%d, "#Y"==%d",
printTree(ptr_tree_base_int_1), false);
printTree
因此,该函数被调用两次,并具有所有相关的副作用,包括"PRINT: Cannot print empty tree"
两次打印该行。保护自己免受此类错误影响的一种方法是,确保宏参数不会产生任何副作用。这可以通过将调用移到printTree
宏外部来实现:
bool printTreeResult;
printTreeResult = printTree(ptr_tree_base_int_1);
ck_assert_int_eq(printTreeResult, false);
请注意,由于此类宏通常容易出错(如您刚刚所经历的那样),因此ck_assert_int_eq
0.9.9版中将的定义改进为:
#define _ck_assert_int(X, OP, Y) do { \
int _ck_x = (X); \
int _ck_y = (Y); \
ck_assert_msg(_ck_x OP _ck_y, \
"Assertion '"#X#OP#Y"' failed: "#X"==%d, "#Y"==%d", _ck_x, _ck_y); \
} while (0)
#define ck_assert_int_eq(X, Y) _ck_assert_int(X, ==, Y)
相应地,解决输出线重复的问题的另一种方法是,如果可以的话,将Check单元测试框架的安装升级到更新的版本(即至少为0.9.9)。
本文收集自互联网,转载请注明来源。
如有侵权,请联系[email protected] 删除。
我来说两句