1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
|
/*
* test_container_prune.c
*
* Tests general function of the CIF API's cif_container_prune() function.
*
* Copyright 2014, 2015 John C. Bollinger
*
*
* This file is part of the CIF API.
*
* The CIF API is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published
* by the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* The CIF API is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with the CIF API. If not, see <http://www.gnu.org/licenses/>.
*/
#include <stdlib.h>
#include <stdio.h>
#include <unicode/ustring.h>
#include "../cif.h"
#include "test.h"
static UFILE *ustderr = NULL;
int main(void) {
char test_name[80] = "test_container_prune";
cif_tp *cif = NULL;
cif_block_tp *block = NULL;
cif_block_tp *block2 = NULL;
cif_loop_tp *loop = NULL;
cif_packet_tp *packet = NULL;
#define MAX_NAMES 5
UChar *names[MAX_NAMES + 1];
UChar *names2[MAX_NAMES + 1];
U_STRING_DECL(block_code, "block", 6);
U_STRING_DECL(block_code2, "block2", 6);
U_STRING_DECL(category, "category", 9);
U_STRING_DECL(category2, "category2", 10);
UChar name1[] = { '_', 'n', 'a', 'm', 'e', '1', 0 };
UChar name2[] = { '_', 'n', 'a', 'm', 'e', '2', 0 };
UChar name3[] = { '_', 'n', 'a', 'm', 'e', '3', 0 };
UChar name4[] = { '_', 'n', 'a', 'm', 'e', '4', 0 };
UChar name5[] = { '_', 'n', 'a', 'm', 'e', '5', 0 };
/* Initialize data and prepare the test fixture */
INIT_USTDERR;
TESTHEADER(test_name);
U_STRING_INIT(block_code, "block", 6);
U_STRING_INIT(block_code2, "block2", 6);
U_STRING_INIT(category, "category", 9);
U_STRING_INIT(category2, "category2", 10);
CREATE_CIF(test_name, cif);
CREATE_BLOCK(test_name, cif, block_code, block);
CREATE_BLOCK(test_name, cif, block_code2, block2);
/* Test pruning a simple loop from an otherwise-empty block */
/* create it */
names[0] = name1;
names[1] = NULL;
TEST(cif_container_create_loop(block, category, names, NULL), CIF_OK, test_name, 1);
/* verify it's present */
TEST(cif_container_get_item_loop(block, name1, NULL), CIF_OK, test_name, 2);
TEST(cif_container_get_category_loop(block, category, NULL), CIF_OK, test_name, 3);
/* prune it out, and verify it's gone */
TEST(cif_container_prune(block), CIF_OK, test_name, 4);
TEST(cif_container_get_item_loop(block, name1, NULL), CIF_NOSUCH_ITEM, test_name, 5);
TEST(cif_container_get_category_loop(block, category, NULL), CIF_NOSUCH_LOOP, test_name, 6);
/* Test pruning when there is no empty loop */
/* when there are no loops at all */
TEST(cif_container_prune(block), CIF_OK, test_name, 7);
/* when there is a loop, but it's not empty */
names[1] = name2;
names[2] = NULL;
TEST(cif_container_create_loop(block, category, names, &loop), CIF_OK, test_name, 8);
TEST(cif_packet_create(&packet, names), CIF_OK, test_name, 9);
TEST(cif_loop_add_packet(loop, packet), CIF_OK, test_name, 10);
cif_packet_free(packet);
cif_loop_free(loop);
loop = NULL;
TEST(cif_container_prune(block), CIF_OK, test_name, 11);
/* verify it's still present */
TEST(cif_container_get_item_loop(block, name1, NULL), CIF_OK, test_name, 12);
TEST(cif_container_get_category_loop(block, category, NULL), CIF_OK, test_name, 13);
/* when there's an empty loop, but it's in a different container */
TEST(cif_container_create_loop(block2, category, names, NULL), CIF_OK, test_name, 14);
TEST(cif_container_prune(block), CIF_OK, test_name, 15);
/* verify it's still present in both containers*/
TEST(cif_container_get_item_loop(block, name1, NULL), CIF_OK, test_name, 16);
TEST(cif_container_get_category_loop(block, category, NULL), CIF_OK, test_name, 17);
TEST(cif_container_get_item_loop(block2, name1, NULL), CIF_OK, test_name, 18);
TEST(cif_container_get_category_loop(block2, category, NULL), CIF_OK, test_name, 19);
/* test pruning one loop among several */
/* create the needed additional loops */
names2[0] = name3;
names2[1] = name4;
names2[2] = NULL;
/* an empty loop */
TEST(cif_container_create_loop(block, category2, names2, NULL), CIF_OK, test_name, 20);
/* another nonempty loop (the scalar loop) */
TEST(cif_container_set_value(block, name5, NULL), CIF_OK, test_name, 21);
/* prune and check */
TEST(cif_container_prune(block), CIF_OK, test_name, 22);
TEST(cif_container_get_item_loop(block, name1, NULL), CIF_OK, test_name, 23);
TEST(cif_container_get_category_loop(block, category, NULL), CIF_OK, test_name, 24);
TEST(cif_container_get_value(block, name5, NULL), CIF_OK, test_name, 25);
/* clean up */
DESTROY_BLOCK(test_name, block2);
DESTROY_BLOCK(test_name, block);
DESTROY_CIF(test_name, cif);
return 0;
}
|
