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
|
/*
* Copyright 2015 Kevin Murray <spam@kdmurray.id.au>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
/*
* ============================================================================
*
* Filename: test_match.c
*
* Description: Test qes_match functions
* License: GPLv3+
* Author: Kevin Murray, spam@kdmurray.id.au
*
* ============================================================================
*/
#include "tests.h"
#include <qes_match.h>
#include <limits.h>
static void
test_qes_hamming (void *p)
{
(void) (p);
/* Simple stuff */
tt_int_op(qes_match_hamming("ACTTG", "ACTTG", 5), ==, 0);
tt_int_op(qes_match_hamming("ACTTG", "ACTGG", 5), ==, 1);
/* Different lengths */
tt_int_op(qes_match_hamming("ACTTGA", "ACTTG", 5), ==, 0);
tt_int_op(qes_match_hamming("ACTTG", "ACTTGA", 5), ==, 0);
tt_int_op(qes_match_hamming("ACTTG", "ACTGGA", 5), ==, 1);
tt_int_op(qes_match_hamming("ACTTG", "ACTGGA", 6), ==, 2);
tt_int_op(qes_match_hamming("ACTTG", "ACTTGA", 6), ==, 1);
/* Make it guess lengths */
tt_int_op(qes_match_hamming("ACTTG", "ACTTG", 0), ==, 0);
tt_int_op(qes_match_hamming("ACATG", "ACTTG", 0), ==, 1);
tt_int_op(qes_match_hamming("ACTTG", "ACTTGT", 0), ==, 0);
tt_int_op(qes_match_hamming("ACATG", "ACTTGT", 0), ==, 1);
tt_int_op(qes_match_hamming("ACTTGT", "ACTTG", 0), ==, 0);
/* Give it hell */
tt_int_op(qes_match_hamming("ACTTG", NULL, 0), ==, -1);
tt_int_op(qes_match_hamming(NULL, "ACTTG", 0), ==, -1);
tt_int_op(qes_match_hamming(NULL, NULL, 0), ==, -1);
end:
;
}
static void
test_qes_hamming_max (void *p)
{
(void) (p);
/* Same tests as per hamming, max is INT_MAX */
/* Simple stuff */
tt_int_op(qes_match_hamming_max("ACTTG", "ACTTG", 5, INT_MAX), ==, 0);
tt_int_op(qes_match_hamming_max("ACTTG", "ACTGG", 5, INT_MAX), ==, 1);
/* Different lengths */
tt_int_op(qes_match_hamming_max("ACTTGA", "ACTTG", 5, INT_MAX), ==, 0);
tt_int_op(qes_match_hamming_max("ACTTG", "ACTTGA", 5, INT_MAX), ==, 0);
tt_int_op(qes_match_hamming_max("ACTTG", "ACTGGA", 5, INT_MAX), ==, 1);
tt_int_op(qes_match_hamming_max("ACTTG", "ACTGGA", 6, INT_MAX), ==, 2);
tt_int_op(qes_match_hamming_max("ACTTG", "ACTTGA", 6, INT_MAX), ==, 1);
/* Make it guess lengths */
tt_int_op(qes_match_hamming_max("ACTTG", "ACTTG", 0, INT_MAX), ==, 0);
tt_int_op(qes_match_hamming_max("ACATG", "ACTTG", 0, INT_MAX), ==, 1);
tt_int_op(qes_match_hamming_max("ACTTG", "ACTTGT", 0, INT_MAX), ==, 0);
tt_int_op(qes_match_hamming_max("ACATG", "ACTTGT", 0, INT_MAX), ==, 1);
tt_int_op(qes_match_hamming_max("ACTTGT", "ACTTG", 0, INT_MAX), ==, 0);
/* Test it bails out when over ``max`` */
tt_int_op(qes_match_hamming_max("ACTTG", "ACTGG", 5, 1), ==, 1);
tt_int_op(qes_match_hamming_max("ACTTG", "ACTGG", 5, 0), ==, 1);
tt_int_op(qes_match_hamming_max("ACTTG", "ACTGA", 5, 0), ==, 1);
tt_int_op(qes_match_hamming_max("ACTTG", "ACTGA", 5, 1), ==, 2);
tt_int_op(qes_match_hamming_max("ACTTG", "ACTGA", 5, 2), ==, 2);
/* Give it hell */
tt_int_op(qes_match_hamming_max("ACTTG", NULL, 0, INT_MAX), ==, -1);
tt_int_op(qes_match_hamming_max(NULL, "ACTTG", 0, INT_MAX), ==, -1);
tt_int_op(qes_match_hamming_max(NULL, NULL, 0, INT_MAX), ==, -1);
tt_int_op(qes_match_hamming_max("ACTTG", "ACTTG", 0, -1), ==, -1);
tt_int_op(qes_match_hamming_max("ACTTG", NULL, 0, -1), ==, -1);
tt_int_op(qes_match_hamming_max(NULL, "ACTTG", 0, -1), ==, -1);
tt_int_op(qes_match_hamming_max(NULL, NULL, 0, -1), ==, -1);
end:
;
}
struct testcase_t qes_match_tests[] = {
{ "qes_match_hamming", test_qes_hamming, 0, NULL, NULL},
{ "qes_match_hamming_max", test_qes_hamming_max, 0, NULL, NULL},
END_OF_TESTCASES
};
|
