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
|
// © 2016 and later: Unicode, Inc. and others.
// License & terms of use: http://www.unicode.org/copyright.html
/********************************************************************
* COPYRIGHT:
* Copyright (c) 1997-2012, International Business Machines Corporation and
* others. All Rights Reserved.
********************************************************************/
/********************************************************************************
*
* File CCOLLTST.C
*
* Modification History:
* Name Description
* Madhu Katragadda Creation
*********************************************************************************
*/
#include <stdio.h>
#include "unicode/utypes.h"
#if !UCONFIG_NO_COLLATION
#include "cintltst.h"
#include "ccolltst.h"
#include "unicode/ucol.h"
#include "unicode/ustring.h"
#include "cmemory.h"
void addCollTest(TestNode** root);
void addCollTest(TestNode** root)
{
addCollAPITest(root);
addCurrencyCollTest(root);
#if !UCONFIG_NO_NORMALIZATION
addNormTest(root);
#endif
addGermanCollTest(root);
addSpanishCollTest(root);
addFrenchCollTest(root);
addKannaCollTest(root);
addTurkishCollTest(root);
addEnglishCollTest(root);
addFinnishCollTest(root);
/* WEIVTODO: return tests here */
addRuleBasedCollTest(root);
addCollIterTest(root);
addAllCollTest(root);
addMiscCollTest(root);
#if !UCONFIG_NO_BREAK_ITERATION && !UCONFIG_NO_FILE_IO
addSearchTest(root);
#endif
}
/*Internal functions used*/
static char* dumpSk(uint8_t *sourceKey, char *sk) {
uint32_t kLen = (uint32_t)strlen((const char *)sourceKey);
uint32_t i = 0;
*sk = 0;
for(i = 0; i<kLen; i++) {
sprintf(sk+2*i, "%02X", sourceKey[i]);
}
return sk;
}
static const char *getCompareResult(UCollationResult result)
{
if (result == UCOL_LESS)
{
return "LESS";
}
else if (result == UCOL_EQUAL)
{
return "EQUAL";
}
else if (result == UCOL_GREATER)
{
return "GREATER";
}
return "invalid UCollationResult?";
}
void reportCResult( const UChar source[], const UChar target[],
uint8_t *sourceKey, uint8_t *targetKey,
UCollationResult compareResult,
UCollationResult keyResult,
UCollationResult incResult,
UCollationResult expectedResult )
{
if (expectedResult < -1 || expectedResult > 1)
{
log_err("***** invalid call to reportCResult ****\n");
return;
}
if (compareResult != expectedResult)
{
log_err("Compare(%s , %s) returned: %s expected: %s\n", aescstrdup(source,-1), aescstrdup(target,-1),
getCompareResult(compareResult), getCompareResult(expectedResult) );
}
if (incResult != expectedResult)
{
log_err("incCompare(%s , %s) returned: %s expected: %s\n", aescstrdup(source,-1), aescstrdup(target,-1),
getCompareResult(incResult), getCompareResult(expectedResult) );
}
if (keyResult != expectedResult)
{
log_err("KeyCompare(%s , %s) returned: %s expected: %s\n", aescstrdup(source,-1), aescstrdup(target,-1),
getCompareResult(keyResult), getCompareResult(expectedResult) );
}
if (keyResult != compareResult)
{
log_err("difference between sortkey and compare result for (%s , %s) Keys: %s compare %s\n", aescstrdup(source,-1), aescstrdup(target,-1),
getCompareResult(keyResult), getCompareResult(compareResult));
}
if(keyResult != expectedResult || keyResult != compareResult)
{
char sk[10000];
log_verbose("SortKey1: %s\n", dumpSk(sourceKey, sk));
log_verbose("SortKey2: %s\n", dumpSk(targetKey, sk));
}
}
#endif /* #if !UCONFIG_NO_COLLATION */
|
