-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtest-parse_seq_constraints_hard.c
186 lines (168 loc) · 7.43 KB
/
test-parse_seq_constraints_hard.c
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
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
#include "opt.h"
#include "na.h"
#include "unity.h"
#include "empty-setUp-tearDown.h"
#include <string.h>
#define UP NA_UNPAIRED
#define N NA_BASE_N
#define A NA_BASE_A
#define C NA_BASE_C
#define G NA_BASE_G
#define U NA_BASE_U
size_t count_char(const char *str, char c) {
size_t n = 0;
for (; *str; str++)
if (*str == c)
n++;
return n;
}
void test_xparse_seq_constraints_hard_allN(void) {
char *constraint_str = "NNNNNNNNN";
uint pairs[] = {8, 7, 6, UP, UP, UP, 2, 1, 0};
uint hard[] = {-42, -42, -42, -42, -42, -42, -42, -42, -42};
uint expected_hard[] = {N, N, N, N, N, N, N, N, N};
uint n = strlen(constraint_str);
uint expected_n_constraint = n - count_char(constraint_str, 'N');
uint n_constraint = x_parse_seq_constraints_hard(n, hard, constraint_str, pairs);
TEST_ASSERT_EQUAL_UINT_ARRAY(expected_hard, hard, n);
TEST_ASSERT_EQUAL_INT(expected_n_constraint, n_constraint);
}
void test_xparse_seq_constraints_hard_unpaired(void) {
char *constraint_str = "NNNANGNNN";
// (((...)))
uint pairs[] = {8, 7, 6, UP, UP, UP, 2, 1, 0};
uint hard[] = {-42, -42, -42, -42, -42, -42, -42, -42, -42};
uint expected_hard[] = {N, N, N, A, N, G, N, N, N};
uint n = strlen(constraint_str);
uint expected_n_constraint = n - count_char(constraint_str, 'N');
uint n_constraint = x_parse_seq_constraints_hard(n, hard, constraint_str, pairs);
TEST_ASSERT_EQUAL_UINT_ARRAY(expected_hard, hard, n);
TEST_ASSERT_EQUAL_INT(expected_n_constraint, n_constraint);
}
void test_xparse_seq_constraints_hard_basepaired(void) {
char *constraint_str = "NNGNNNCNN";
// (((...)))
uint pairs[] = {8, 7, 6, UP, UP, UP, 2, 1, 0};
uint hard[] = {-42, -42, -42, -42, -42, -42, -42, -42, -42};
uint expected_hard[] = {N, N, G, N, N, N, C, N, N};
uint n = strlen(constraint_str);
uint expected_n_constraint = n - count_char(constraint_str, 'N');
uint n_constraint = x_parse_seq_constraints_hard(n, hard, constraint_str, pairs);
TEST_ASSERT_EQUAL_UINT_ARRAY(expected_hard, hard, n);
TEST_ASSERT_EQUAL_INT(expected_n_constraint, n_constraint);
}
void test_xparse_seq_constraints_hard_mixed(void) {
char *constraint_str = "GANNUNCUN";
// (((...)))
uint pairs[] = {8, 7, 6, UP, UP, UP, 2, 1, 0};
uint hard[] = {-42, -42, -42, -42, -42, -42, -42, -42, -42};
uint expected_hard[] = {G, A, N, N, U, N, C, U, N};
uint n = strlen(constraint_str);
uint expected_n_constraint = n - count_char(constraint_str, 'N');
uint n_constraint = x_parse_seq_constraints_hard(n, hard, constraint_str, pairs);
TEST_ASSERT_EQUAL_UINT_ARRAY(expected_hard, hard, n);
TEST_ASSERT_EQUAL_INT(expected_n_constraint, n_constraint);
}
void test_parse_seq_constraints_hard_allN(void) {
bool verbose = true;
// (((...)))
char *constraint_str = "NNNNNNNNN";
uint pairs[] = {8, 7, 6, UP, UP, UP, 2, 1, 0};
uint hard[] = {-42, -42, -42, -42, -42, -42, -42, -42, -42};
uint expected_hard[] = {N, N, N, N, N, N, N, N, N};
uint n = strlen(constraint_str);
uint expected_n_hard = n - count_char(constraint_str, 'N');
uint n_hard = -42 * 5;
uint retcode = parse_seq_constraints_hard(n, hard, &n_hard,
constraint_str, verbose, pairs);
TEST_ASSERT_EQUAL_UINT_ARRAY(expected_hard, hard, n);
TEST_ASSERT_EQUAL_UINT(expected_n_hard, n_hard);
TEST_ASSERT_EQUAL_INT(EXIT_SUCCESS, retcode);
}
void test_parse_seq_constraints_hard_unpaired(void) {
bool verbose = true;
// (((...)))
char *constraint_str = "NNNANGNNN";
uint pairs[] = {8, 7, 6, UP, UP, UP, 2, 1, 0};
uint hard[] = {-42, -42, -42, -42, -42, -42, -42, -42, -42};
uint expected_hard[] = {N, N, N, A, N, G, N, N, N};
uint n = strlen(constraint_str);
uint expected_n_hard = n - count_char(constraint_str, 'N');
uint n_hard = -42 * 5;
uint retcode = parse_seq_constraints_hard(n, hard, &n_hard,
constraint_str, verbose, pairs);
TEST_ASSERT_EQUAL_UINT_ARRAY(expected_hard, hard, n);
TEST_ASSERT_EQUAL_UINT(expected_n_hard, n_hard);
TEST_ASSERT_EQUAL_INT(EXIT_SUCCESS, retcode);
}
void test_parse_seq_constraints_hard_basepaired(void) {
bool verbose = true;
// (((...)))
char *constraint_str = "NNGNNNCNN";
uint pairs[] = {8, 7, 6, UP, UP, UP, 2, 1, 0};
uint hard[] = {-42, -42, -42, -42, -42, -42, -42, -42, -42};
uint expected_hard[] = {N, N, G, N, N, N, C, N, N};
uint n = strlen(constraint_str);
uint expected_n_hard = n - count_char(constraint_str, 'N');
uint n_hard = -42 * 5;
uint retcode = parse_seq_constraints_hard(n, hard, &n_hard,
constraint_str, verbose, pairs);
TEST_ASSERT_EQUAL_UINT_ARRAY(expected_hard, hard, n);
TEST_ASSERT_EQUAL_UINT(expected_n_hard, n_hard);
TEST_ASSERT_EQUAL_INT(EXIT_SUCCESS, retcode);
}
void test_parse_seq_constraints_hard_mixed(void) {
bool verbose = true;
char *constraint_str = "GANNUNCUN";
// (((...)))
uint pairs[] = {8, 7, 6, UP, UP, UP, 2, 1, 0};
uint hard[] = {-42, -42, -42, -42, -42, -42, -42, -42, -42};
uint expected_hard[] = {G, A, N, N, U, N, C, U, N};
uint n = strlen(constraint_str);
uint expected_n_hard = n - count_char(constraint_str, 'N');
uint n_hard = -42 * 5;
uint retcode = parse_seq_constraints_hard(n, hard, &n_hard,
constraint_str, verbose, pairs);
TEST_ASSERT_EQUAL_UINT_ARRAY(expected_hard, hard, n);
TEST_ASSERT_EQUAL_UINT(expected_n_hard, n_hard);
TEST_ASSERT_EQUAL_INT(EXIT_SUCCESS, retcode);
}
void test_parse_seq_constraints_hard_fail_illegal_char(void) {
bool verbose = true;
char *constraint_str = "NNNNXNNNN";
// (((...)))
uint pairs[] = {8, 7, 6, UP, UP, UP, 2, 1, 0};
uint hard[] = {-42, -42, -42, -42, -42, -42, -42, -42, -42};
uint n = strlen(constraint_str);
uint n_hard = -42 * 5;
uint retcode = parse_seq_constraints_hard(n, hard, &n_hard,
constraint_str, verbose, pairs);
TEST_ASSERT_EQUAL_INT(EXIT_FAILURE, retcode);
}
void test_parse_seq_constraints_hard_fail_impossible_basepair(void) {
bool verbose = true;
char *constraint_str = "NNGNNNGNN";
// (((...)))
uint pairs[] = {8, 7, 6, UP, UP, UP, 2, 1, 0};
uint hard[] = {-42, -42, -42, -42, -42, -42, -42, -42, -42};
uint n = strlen(constraint_str);
uint n_hard = -42 * 5;
uint retcode = parse_seq_constraints_hard(n, hard, &n_hard,
constraint_str, verbose, pairs);
TEST_ASSERT_EQUAL_INT(EXIT_FAILURE, retcode);
}
int main(void)
{
UNITY_BEGIN();
RUN_TEST(test_xparse_seq_constraints_hard_allN);
RUN_TEST(test_xparse_seq_constraints_hard_unpaired);
RUN_TEST(test_xparse_seq_constraints_hard_basepaired);
RUN_TEST(test_xparse_seq_constraints_hard_mixed);
RUN_TEST(test_parse_seq_constraints_hard_allN);
RUN_TEST(test_parse_seq_constraints_hard_unpaired);
RUN_TEST(test_parse_seq_constraints_hard_basepaired);
RUN_TEST(test_parse_seq_constraints_hard_mixed);
RUN_TEST(test_parse_seq_constraints_hard_fail_illegal_char);
RUN_TEST(test_parse_seq_constraints_hard_fail_impossible_basepair);
return UNITY_END();
}