2001-08-25 02:06:37 +00:00
|
|
|
/********************************************************************
|
|
|
|
* Copyright (c) 2001,
|
|
|
|
* International Business Machines Corporation and others.
|
|
|
|
* All Rights Reserved.
|
|
|
|
********************************************************************
|
|
|
|
* File usrchtst.c
|
|
|
|
* Modification History:
|
|
|
|
* Name Date Description
|
|
|
|
* synwee July 19 2001 creation
|
|
|
|
********************************************************************/
|
|
|
|
|
|
|
|
#include "unicode/usearch.h"
|
|
|
|
#include "unicode/ustring.h"
|
|
|
|
#include "ccolltst.h"
|
|
|
|
#include "cmemory.h"
|
|
|
|
#include <stdio.h>
|
|
|
|
#include "usrchdat.c"
|
|
|
|
|
|
|
|
static UBool TOCLOSE_ = TRUE;
|
|
|
|
static UCollator *EN_US_;
|
|
|
|
static UCollator *FR_FR_;
|
|
|
|
static UCollator *DE_;
|
|
|
|
static UCollator *ES_;
|
|
|
|
static UBreakIterator *EN_WORDBREAKER_;
|
|
|
|
static UBreakIterator *EN_CHARACTERBREAKER_;
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Opening all static collators and break iterators
|
|
|
|
*/
|
2002-03-28 18:26:25 +00:00
|
|
|
static void open(void)
|
2001-08-25 02:06:37 +00:00
|
|
|
{
|
|
|
|
if (TOCLOSE_) {
|
|
|
|
UErrorCode status = U_ZERO_ERROR;
|
|
|
|
UChar rules[1024];
|
2001-10-19 23:03:24 +00:00
|
|
|
int32_t rulelength = 0;
|
2001-08-25 02:06:37 +00:00
|
|
|
|
|
|
|
EN_US_ = ucol_open("en_US", &status);
|
|
|
|
FR_FR_ = ucol_open("fr_FR", &status);
|
|
|
|
DE_ = ucol_open("de_DE", &status);
|
|
|
|
ES_ = ucol_open("es_ES", &status);
|
|
|
|
|
|
|
|
u_strcpy(rules, ucol_getRules(DE_, &rulelength));
|
|
|
|
u_unescape(EXTRACOLLATIONRULE, rules + rulelength, 1024 - rulelength);
|
|
|
|
|
|
|
|
ucol_close(DE_);
|
|
|
|
|
2001-09-22 01:11:55 +00:00
|
|
|
DE_ = ucol_openRules(rules, u_strlen(rules), UCOL_ON, UCOL_TERTIARY,
|
2001-08-25 02:06:37 +00:00
|
|
|
(UParseError *)NULL, &status);
|
|
|
|
u_strcpy(rules, ucol_getRules(ES_, &rulelength));
|
|
|
|
u_unescape(EXTRACOLLATIONRULE, rules + rulelength, 1024 - rulelength);
|
|
|
|
|
|
|
|
ucol_close(ES_);
|
2001-09-22 01:11:55 +00:00
|
|
|
ES_ = ucol_openRules(rules, u_strlen(rules), UCOL_ON, UCOL_TERTIARY,
|
2001-08-25 02:06:37 +00:00
|
|
|
NULL, &status);
|
|
|
|
EN_WORDBREAKER_ = ubrk_open(UBRK_WORD, "en_US", NULL, 0, &status);
|
|
|
|
EN_CHARACTERBREAKER_ = ubrk_open(UBRK_CHARACTER, "en_US", NULL, 0,
|
|
|
|
&status);
|
|
|
|
TOCLOSE_ = TRUE;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Start opening all static collators and break iterators
|
|
|
|
*/
|
2002-03-28 18:26:25 +00:00
|
|
|
static void TestStart(void)
|
2001-08-25 02:06:37 +00:00
|
|
|
{
|
|
|
|
open();
|
|
|
|
TOCLOSE_ = FALSE;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Closing all static collators and break iterators
|
|
|
|
*/
|
2002-03-28 18:26:25 +00:00
|
|
|
static void close(void)
|
2001-08-25 02:06:37 +00:00
|
|
|
{
|
|
|
|
if (TOCLOSE_) {
|
|
|
|
ucol_close(EN_US_);
|
|
|
|
ucol_close(FR_FR_);
|
|
|
|
ucol_close(DE_);
|
|
|
|
ucol_close(ES_);
|
|
|
|
ubrk_close(EN_WORDBREAKER_);
|
|
|
|
ubrk_close(EN_CHARACTERBREAKER_);
|
|
|
|
}
|
|
|
|
TOCLOSE_ = FALSE;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* End closing all static collators and break iterators
|
|
|
|
*/
|
2002-03-28 18:26:25 +00:00
|
|
|
static void TestEnd(void)
|
2001-08-25 02:06:37 +00:00
|
|
|
{
|
|
|
|
TOCLOSE_ = TRUE;
|
|
|
|
close();
|
2002-01-16 04:33:33 +00:00
|
|
|
TOCLOSE_ = TRUE;
|
2001-08-25 02:06:37 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* output UChar strings for printing.
|
|
|
|
*/
|
|
|
|
static char *toCharString(const UChar* unichars)
|
|
|
|
{
|
|
|
|
static char result[1024];
|
|
|
|
char *temp = result;
|
|
|
|
int count = 0;
|
|
|
|
int length = u_strlen(unichars);
|
|
|
|
|
|
|
|
for (; count < length; count ++) {
|
|
|
|
UChar ch = unichars[count];
|
|
|
|
if (ch >= 0x20 && ch <= 0x7e) {
|
|
|
|
*temp ++ = (char)ch;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
char digit[5];
|
|
|
|
int zerosize;
|
|
|
|
*temp = 0;
|
|
|
|
strcat(temp, "\\u");
|
|
|
|
temp = temp + 2;
|
|
|
|
sprintf(digit, "%x", ch);
|
|
|
|
zerosize = 4 - strlen(digit);
|
|
|
|
while (zerosize != 0) {
|
|
|
|
*temp ++ = '0';
|
|
|
|
zerosize --;
|
|
|
|
}
|
|
|
|
*temp = 0;
|
|
|
|
strcat(temp, digit);
|
|
|
|
temp = temp + strlen(digit);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
*temp = 0;
|
|
|
|
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Getting the collator
|
|
|
|
*/
|
|
|
|
static UCollator *getCollator(const char *collator)
|
|
|
|
{
|
|
|
|
if (collator == NULL) {
|
|
|
|
return EN_US_;
|
|
|
|
}
|
|
|
|
if (strcmp(collator, "fr") == 0) {
|
|
|
|
return FR_FR_;
|
|
|
|
}
|
|
|
|
else if (strcmp(collator, "de") == 0) {
|
|
|
|
return DE_;
|
|
|
|
}
|
|
|
|
else if (strcmp(collator, "es") == 0) {
|
|
|
|
return ES_;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
return EN_US_;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Getting the breakiterator
|
|
|
|
*/
|
|
|
|
static UBreakIterator *getBreakIterator(const char *breaker)
|
|
|
|
{
|
|
|
|
if (breaker == NULL) {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
if (strcmp(breaker, "wordbreaker") == 0) {
|
|
|
|
return EN_WORDBREAKER_;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
return EN_CHARACTERBREAKER_;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2002-03-28 18:26:25 +00:00
|
|
|
static void TestOpenClose(void)
|
2001-08-25 02:06:37 +00:00
|
|
|
{
|
|
|
|
UErrorCode status = U_ZERO_ERROR;
|
|
|
|
UStringSearch *result;
|
2001-10-19 23:03:24 +00:00
|
|
|
const UChar pattern[] = {0x61, 0x62, 0x63, 0x64, 0x65, 0x66};
|
|
|
|
const UChar text[] = {0x61, 0x62, 0x63, 0x64, 0x65, 0x66, 0x67};
|
2001-08-25 02:06:37 +00:00
|
|
|
UBreakIterator *breakiter = ubrk_open(UBRK_WORD, "en_US",
|
|
|
|
text, 6, &status);
|
|
|
|
/* testing null arguments */
|
|
|
|
result = usearch_open(NULL, 0, NULL, 0, NULL, NULL, &status);
|
|
|
|
if (U_SUCCESS(status) || result != NULL) {
|
|
|
|
log_err("Error: NULL arguments should produce an error and a NULL result\n");
|
|
|
|
}
|
|
|
|
status = U_ZERO_ERROR;
|
|
|
|
result = usearch_openFromCollator(NULL, 0, NULL, 0, NULL, NULL, &status);
|
|
|
|
if (U_SUCCESS(status) || result != NULL) {
|
|
|
|
log_err("Error: NULL arguments should produce an error and a NULL result\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
status = U_ZERO_ERROR;
|
|
|
|
result = usearch_open(pattern, 3, NULL, 0, NULL, NULL, &status);
|
|
|
|
if (U_SUCCESS(status) || result != NULL) {
|
|
|
|
log_err("Error: NULL arguments should produce an error and a NULL result\n");
|
|
|
|
}
|
|
|
|
status = U_ZERO_ERROR;
|
|
|
|
result = usearch_openFromCollator(pattern, 3, NULL, 0, NULL, NULL,
|
|
|
|
&status);
|
|
|
|
if (U_SUCCESS(status) || result != NULL) {
|
|
|
|
log_err("Error: NULL arguments should produce an error and a NULL result\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
status = U_ZERO_ERROR;
|
|
|
|
result = usearch_open(pattern, 3, text, 6, NULL, NULL, &status);
|
|
|
|
if (U_SUCCESS(status) || result != NULL) {
|
|
|
|
log_err("Error: NULL arguments should produce an error and a NULL result\n");
|
|
|
|
}
|
|
|
|
status = U_ZERO_ERROR;
|
|
|
|
result = usearch_openFromCollator(pattern, 3, text, 6, NULL, NULL,
|
|
|
|
&status);
|
|
|
|
if (U_SUCCESS(status) || result != NULL) {
|
|
|
|
log_err("Error: NULL arguments should produce an error and a NULL result\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
status = U_ZERO_ERROR;
|
|
|
|
result = usearch_open(pattern, 3, text, 6, "en_US", NULL, &status);
|
|
|
|
if (U_FAILURE(status) || result == NULL) {
|
|
|
|
log_err("Error: NULL break iterator is valid for opening search\n");
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
usearch_close(result);
|
|
|
|
}
|
|
|
|
open();
|
|
|
|
status = U_ZERO_ERROR;
|
|
|
|
result = usearch_openFromCollator(pattern, 3, text, 6, EN_US_, NULL,
|
|
|
|
&status);
|
|
|
|
if (U_FAILURE(status) || result == NULL) {
|
|
|
|
log_err("Error: NULL break iterator is valid for opening search\n");
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
usearch_close(result);
|
|
|
|
}
|
|
|
|
|
|
|
|
status = U_ZERO_ERROR;
|
|
|
|
result = usearch_open(pattern, 3, text, 6, "en_US", breakiter, &status);
|
|
|
|
if (U_FAILURE(status) || result == NULL) {
|
|
|
|
log_err("Error: Break iterator is valid for opening search\n");
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
usearch_close(result);
|
|
|
|
}
|
|
|
|
status = U_ZERO_ERROR;
|
|
|
|
result = usearch_openFromCollator(pattern, 3, text, 6, EN_US_, breakiter,
|
|
|
|
&status);
|
|
|
|
if (U_FAILURE(status) || result == NULL) {
|
|
|
|
log_err("Error: Break iterator is valid for opening search\n");
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
usearch_close(result);
|
|
|
|
}
|
|
|
|
ubrk_close(breakiter);
|
|
|
|
close();
|
|
|
|
}
|
|
|
|
|
2002-03-28 18:26:25 +00:00
|
|
|
static void TestInitialization(void)
|
2001-08-25 02:06:37 +00:00
|
|
|
{
|
2001-10-19 23:03:24 +00:00
|
|
|
UErrorCode status = U_ZERO_ERROR;
|
2001-08-25 02:06:37 +00:00
|
|
|
UChar pattern[512];
|
2001-10-19 23:03:24 +00:00
|
|
|
const UChar text[] = {0x61, 0x62, 0x63, 0x64, 0x65, 0x66};
|
|
|
|
UStringSearch *result;
|
2001-08-25 02:06:37 +00:00
|
|
|
|
|
|
|
/* simple test on the pattern ce construction */
|
|
|
|
pattern[0] = 0x41;
|
|
|
|
pattern[1] = 0x42;
|
|
|
|
open();
|
|
|
|
result = usearch_openFromCollator(pattern, 2, text, 3, EN_US_, NULL,
|
|
|
|
&status);
|
|
|
|
if (U_FAILURE(status)) {
|
|
|
|
log_err("Error opening search %s\n", u_errorName(status));
|
|
|
|
}
|
|
|
|
usearch_close(result);
|
|
|
|
|
|
|
|
/* testing if an extremely large pattern will fail the initialization */
|
|
|
|
uprv_memset(pattern, 0x41, 512);
|
|
|
|
result = usearch_openFromCollator(pattern, 512, text, 3, EN_US_, NULL,
|
|
|
|
&status);
|
|
|
|
if (U_FAILURE(status)) {
|
|
|
|
log_err("Error opening search %s\n", u_errorName(status));
|
|
|
|
}
|
|
|
|
usearch_close(result);
|
|
|
|
close();
|
|
|
|
}
|
|
|
|
|
|
|
|
static UBool assertEqualWithUStringSearch( UStringSearch *strsrch,
|
|
|
|
const SearchData search)
|
|
|
|
{
|
|
|
|
int count = 0;
|
2001-09-11 21:40:05 +00:00
|
|
|
int matchlimit = 0;
|
2001-08-25 02:06:37 +00:00
|
|
|
UErrorCode status = U_ZERO_ERROR;
|
2002-03-12 01:32:42 +00:00
|
|
|
int32_t matchindex = search.offset[count];
|
2001-08-25 02:06:37 +00:00
|
|
|
int32_t textlength;
|
|
|
|
UChar matchtext[128];
|
|
|
|
|
|
|
|
if (usearch_getMatchedStart(strsrch) != USEARCH_DONE ||
|
|
|
|
usearch_getMatchedLength(strsrch) != 0) {
|
|
|
|
log_err("Error with the initialization of match start and length\n");
|
|
|
|
}
|
|
|
|
/* start of following matches */
|
|
|
|
while (U_SUCCESS(status) && matchindex >= 0) {
|
|
|
|
uint32_t matchlength = search.size[count];
|
|
|
|
usearch_next(strsrch, &status);
|
|
|
|
if (matchindex != usearch_getMatchedStart(strsrch) ||
|
|
|
|
matchlength != (uint32_t)usearch_getMatchedLength(strsrch)) {
|
|
|
|
char *str = toCharString(usearch_getText(strsrch, &textlength));
|
|
|
|
log_err("Text: %s\n", str);
|
|
|
|
str = toCharString(usearch_getPattern(strsrch, &textlength));
|
|
|
|
log_err("Pattern: %s\n", str);
|
|
|
|
log_err("Error following match found at %d %d\n",
|
|
|
|
usearch_getMatchedStart(strsrch),
|
|
|
|
usearch_getMatchedLength(strsrch));
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
count ++;
|
|
|
|
|
|
|
|
if (usearch_getMatchedText(strsrch, matchtext, 128, &status) !=
|
|
|
|
(int32_t) matchlength || U_FAILURE(status) ||
|
|
|
|
memcmp(matchtext,
|
|
|
|
usearch_getText(strsrch, &textlength) + matchindex,
|
|
|
|
matchlength * sizeof(UChar)) != 0) {
|
|
|
|
log_err("Error getting following matched text\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
matchindex = search.offset[count];
|
|
|
|
}
|
|
|
|
usearch_next(strsrch, &status);
|
|
|
|
if ((uint32_t)usearch_getMatchedStart(strsrch) != USEARCH_DONE ||
|
|
|
|
usearch_getMatchedLength(strsrch) != 0) {
|
|
|
|
char *str = toCharString(usearch_getText(strsrch, &textlength));
|
|
|
|
log_err("Text: %s\n", str);
|
|
|
|
str = toCharString(usearch_getPattern(strsrch, &textlength));
|
|
|
|
log_err("Pattern: %s\n", str);
|
|
|
|
log_err("Error following match found at %d %d\n",
|
|
|
|
usearch_getMatchedStart(strsrch),
|
|
|
|
usearch_getMatchedLength(strsrch));
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
/* start of preceding matches */
|
|
|
|
count = count == 0 ? 0 : count - 1;
|
2001-09-11 21:40:05 +00:00
|
|
|
matchlimit = count;
|
2001-08-25 02:06:37 +00:00
|
|
|
matchindex = search.offset[count];
|
2001-09-11 21:40:05 +00:00
|
|
|
|
2001-08-25 02:06:37 +00:00
|
|
|
while (U_SUCCESS(status) && matchindex >= 0) {
|
|
|
|
uint32_t matchlength = search.size[count];
|
|
|
|
usearch_previous(strsrch, &status);
|
|
|
|
if (matchindex != usearch_getMatchedStart(strsrch) ||
|
|
|
|
matchlength != (uint32_t)usearch_getMatchedLength(strsrch)) {
|
|
|
|
char *str = toCharString(usearch_getText(strsrch, &textlength));
|
|
|
|
log_err("Text: %s\n", str);
|
|
|
|
str = toCharString(usearch_getPattern(strsrch, &textlength));
|
|
|
|
log_err("Pattern: %s\n", str);
|
|
|
|
log_err("Error preceding match found at %d %d\n",
|
|
|
|
usearch_getMatchedStart(strsrch),
|
|
|
|
usearch_getMatchedLength(strsrch));
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (usearch_getMatchedText(strsrch, matchtext, 128, &status) !=
|
|
|
|
(int32_t) matchlength || U_FAILURE(status) ||
|
|
|
|
memcmp(matchtext,
|
|
|
|
usearch_getText(strsrch, &textlength) + matchindex,
|
|
|
|
matchlength * sizeof(UChar)) != 0) {
|
|
|
|
log_err("Error getting preceding matched text\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
matchindex = count > 0 ? search.offset[count - 1] : -1;
|
|
|
|
count --;
|
|
|
|
}
|
|
|
|
usearch_previous(strsrch, &status);
|
|
|
|
if ((uint32_t)usearch_getMatchedStart(strsrch) != USEARCH_DONE ||
|
|
|
|
usearch_getMatchedLength(strsrch) != 0) {
|
|
|
|
char *str = toCharString(usearch_getText(strsrch, &textlength));
|
|
|
|
log_err("Text: %s\n", str);
|
|
|
|
str = toCharString(usearch_getPattern(strsrch, &textlength));
|
|
|
|
log_err("Pattern: %s\n", str);
|
|
|
|
log_err("Error preceding match found at %d %d\n",
|
|
|
|
usearch_getMatchedStart(strsrch),
|
|
|
|
usearch_getMatchedLength(strsrch));
|
|
|
|
return FALSE;
|
|
|
|
}
|
2001-09-11 21:40:05 +00:00
|
|
|
|
2001-08-25 02:06:37 +00:00
|
|
|
return TRUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
static UBool assertEqual(const SearchData search)
|
|
|
|
{
|
|
|
|
UErrorCode status = U_ZERO_ERROR;
|
|
|
|
UChar pattern[32];
|
|
|
|
UChar text[128];
|
|
|
|
UCollator *collator = getCollator(search.collator);
|
|
|
|
UBreakIterator *breaker = getBreakIterator(search.breaker);
|
|
|
|
UStringSearch *strsrch;
|
|
|
|
|
|
|
|
u_unescape(search.text, text, 128);
|
|
|
|
u_unescape(search.pattern, pattern, 32);
|
|
|
|
ucol_setStrength(collator, search.strength);
|
|
|
|
strsrch = usearch_openFromCollator(pattern, -1, text, -1, collator,
|
|
|
|
breaker, &status);
|
|
|
|
if (U_FAILURE(status)) {
|
|
|
|
log_err("Error opening string search %s\n", u_errorName(status));
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!assertEqualWithUStringSearch(strsrch, search)) {
|
|
|
|
ucol_setStrength(collator, UCOL_TERTIARY);
|
|
|
|
usearch_close(strsrch);
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
ucol_setStrength(collator, UCOL_TERTIARY);
|
|
|
|
usearch_close(strsrch);
|
|
|
|
return TRUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
static UBool assertCanonicalEqual(const SearchData search)
|
|
|
|
{
|
|
|
|
UErrorCode status = U_ZERO_ERROR;
|
|
|
|
UChar pattern[32];
|
|
|
|
UChar text[128];
|
|
|
|
UCollator *collator = getCollator(search.collator);
|
|
|
|
UBreakIterator *breaker = getBreakIterator(search.breaker);
|
|
|
|
UStringSearch *strsrch;
|
|
|
|
|
|
|
|
u_unescape(search.text, text, 128);
|
|
|
|
u_unescape(search.pattern, pattern, 32);
|
|
|
|
ucol_setStrength(collator, search.strength);
|
|
|
|
strsrch = usearch_openFromCollator(pattern, -1, text, -1, collator,
|
|
|
|
breaker, &status);
|
|
|
|
usearch_setAttribute(strsrch, USEARCH_CANONICAL_MATCH, USEARCH_ON,
|
|
|
|
&status);
|
|
|
|
if (U_FAILURE(status)) {
|
|
|
|
log_err("Error opening string search %s\n", u_errorName(status));
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!assertEqualWithUStringSearch(strsrch, search)) {
|
|
|
|
ucol_setStrength(collator, UCOL_TERTIARY);
|
|
|
|
usearch_close(strsrch);
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
ucol_setStrength(collator, UCOL_TERTIARY);
|
|
|
|
usearch_close(strsrch);
|
|
|
|
return TRUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
static UBool assertEqualWithAttribute(const SearchData search,
|
|
|
|
USearchAttributeValue canonical,
|
|
|
|
USearchAttributeValue overlap)
|
|
|
|
{
|
|
|
|
UErrorCode status = U_ZERO_ERROR;
|
|
|
|
UChar pattern[32];
|
|
|
|
UChar text[128];
|
|
|
|
UCollator *collator = getCollator(search.collator);
|
|
|
|
UBreakIterator *breaker = getBreakIterator(search.breaker);
|
|
|
|
UStringSearch *strsrch;
|
|
|
|
|
|
|
|
u_unescape(search.text, text, 128);
|
|
|
|
u_unescape(search.pattern, pattern, 32);
|
|
|
|
ucol_setStrength(collator, search.strength);
|
|
|
|
strsrch = usearch_openFromCollator(pattern, -1, text, -1, collator,
|
|
|
|
breaker, &status);
|
|
|
|
usearch_setAttribute(strsrch, USEARCH_CANONICAL_MATCH, canonical,
|
|
|
|
&status);
|
|
|
|
usearch_setAttribute(strsrch, USEARCH_OVERLAP, overlap, &status);
|
|
|
|
|
|
|
|
if (U_FAILURE(status)) {
|
|
|
|
log_err("Error opening string search %s\n", u_errorName(status));
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!assertEqualWithUStringSearch(strsrch, search)) {
|
|
|
|
ucol_setStrength(collator, UCOL_TERTIARY);
|
|
|
|
usearch_close(strsrch);
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
ucol_setStrength(collator, UCOL_TERTIARY);
|
|
|
|
usearch_close(strsrch);
|
|
|
|
return TRUE;
|
|
|
|
}
|
|
|
|
|
2002-03-28 18:26:25 +00:00
|
|
|
static void TestBasic(void)
|
2001-08-25 02:06:37 +00:00
|
|
|
{
|
|
|
|
int count = 0;
|
|
|
|
open();
|
|
|
|
while (BASIC[count].text != NULL) {
|
|
|
|
if (!assertEqual(BASIC[count])) {
|
|
|
|
log_err("Error at test number %d\n", count);
|
|
|
|
}
|
|
|
|
count ++;
|
|
|
|
}
|
|
|
|
close();
|
|
|
|
}
|
|
|
|
|
2002-03-28 18:26:25 +00:00
|
|
|
static void TestNormExact(void)
|
2001-08-25 02:06:37 +00:00
|
|
|
{
|
|
|
|
int count = 0;
|
|
|
|
UErrorCode status = U_ZERO_ERROR;
|
|
|
|
open();
|
|
|
|
ucol_setAttribute(EN_US_, UCOL_NORMALIZATION_MODE, UCOL_ON, &status);
|
|
|
|
if (U_FAILURE(status)) {
|
|
|
|
log_err("Error setting collation normalization %s\n",
|
|
|
|
u_errorName(status));
|
|
|
|
}
|
|
|
|
while (BASIC[count].text != NULL) {
|
|
|
|
if (!assertEqual(BASIC[count])) {
|
|
|
|
log_err("Error at test number %d\n", count);
|
|
|
|
}
|
|
|
|
count ++;
|
|
|
|
}
|
|
|
|
count = 0;
|
|
|
|
while (NORMEXACT[count].text != NULL) {
|
|
|
|
if (!assertEqual(NORMEXACT[count])) {
|
|
|
|
log_err("Error at test number %d\n", count);
|
|
|
|
}
|
|
|
|
count ++;
|
|
|
|
}
|
|
|
|
ucol_setAttribute(EN_US_, UCOL_NORMALIZATION_MODE, UCOL_OFF, &status);
|
|
|
|
count = 0;
|
|
|
|
while (NONNORMEXACT[count].text != NULL) {
|
|
|
|
if (!assertEqual(NONNORMEXACT[count])) {
|
|
|
|
log_err("Error at test number %d\n", count);
|
|
|
|
}
|
|
|
|
count ++;
|
|
|
|
}
|
|
|
|
close();
|
|
|
|
}
|
|
|
|
|
2002-03-28 18:26:25 +00:00
|
|
|
static void TestStrength(void)
|
2001-08-25 02:06:37 +00:00
|
|
|
{
|
|
|
|
int count = 0;
|
|
|
|
open();
|
|
|
|
while (STRENGTH[count].text != NULL) {
|
|
|
|
if (!assertEqual(STRENGTH[count])) {
|
|
|
|
log_err("Error at test number %d\n", count);
|
|
|
|
}
|
|
|
|
count ++;
|
|
|
|
}
|
|
|
|
close();
|
|
|
|
}
|
|
|
|
|
2002-03-28 18:26:25 +00:00
|
|
|
static void TestBreakIterator(void) {
|
2001-08-25 02:06:37 +00:00
|
|
|
UErrorCode status = U_ZERO_ERROR;
|
|
|
|
UStringSearch *strsrch;
|
|
|
|
UChar text[128];
|
|
|
|
UChar pattern[32];
|
|
|
|
int count = 0;
|
|
|
|
|
|
|
|
open();
|
2001-09-11 21:40:05 +00:00
|
|
|
if (usearch_getBreakIterator(NULL) != NULL) {
|
|
|
|
log_err("Expected NULL breakiterator from NULL string search\n");
|
|
|
|
}
|
2002-03-19 21:50:15 +00:00
|
|
|
u_unescape(BREAKITERATOREXACT[0].text, text, 128);
|
|
|
|
u_unescape(BREAKITERATOREXACT[0].pattern, pattern, 32);
|
2001-08-25 02:06:37 +00:00
|
|
|
strsrch = usearch_openFromCollator(pattern, -1, text, -1, EN_US_, NULL,
|
|
|
|
&status);
|
|
|
|
if (U_FAILURE(status)) {
|
|
|
|
log_err("Error opening string search %s\n", u_errorName(status));
|
|
|
|
goto ENDTESTBREAKITERATOR;
|
|
|
|
}
|
|
|
|
|
|
|
|
usearch_setBreakIterator(strsrch, NULL, &status);
|
|
|
|
if (U_FAILURE(status) || usearch_getBreakIterator(strsrch) != NULL) {
|
|
|
|
log_err("Error usearch_getBreakIterator returned wrong object");
|
|
|
|
goto ENDTESTBREAKITERATOR;
|
|
|
|
}
|
|
|
|
|
|
|
|
usearch_setBreakIterator(strsrch, EN_CHARACTERBREAKER_, &status);
|
|
|
|
if (U_FAILURE(status) ||
|
|
|
|
usearch_getBreakIterator(strsrch) != EN_CHARACTERBREAKER_) {
|
|
|
|
log_err("Error usearch_getBreakIterator returned wrong object");
|
|
|
|
goto ENDTESTBREAKITERATOR;
|
|
|
|
}
|
|
|
|
|
|
|
|
usearch_setBreakIterator(strsrch, EN_WORDBREAKER_, &status);
|
|
|
|
if (U_FAILURE(status) ||
|
|
|
|
usearch_getBreakIterator(strsrch) != EN_WORDBREAKER_) {
|
|
|
|
log_err("Error usearch_getBreakIterator returned wrong object");
|
|
|
|
goto ENDTESTBREAKITERATOR;
|
|
|
|
}
|
|
|
|
|
|
|
|
usearch_close(strsrch);
|
|
|
|
|
|
|
|
count = 0;
|
|
|
|
while (count < 4) {
|
2002-03-20 18:40:58 +00:00
|
|
|
/* 0-3 test are fixed */
|
2002-03-19 21:50:15 +00:00
|
|
|
const SearchData *search = &(BREAKITERATOREXACT[count]);
|
2001-08-25 02:06:37 +00:00
|
|
|
UCollator *collator = getCollator(search->collator);
|
|
|
|
UBreakIterator *breaker = getBreakIterator(search->breaker);
|
|
|
|
|
|
|
|
u_unescape(search->text, text, 128);
|
|
|
|
u_unescape(search->pattern, pattern, 32);
|
|
|
|
ucol_setStrength(collator, search->strength);
|
|
|
|
|
|
|
|
strsrch = usearch_openFromCollator(pattern, -1, text, -1, collator,
|
|
|
|
breaker, &status);
|
|
|
|
if (U_FAILURE(status) ||
|
|
|
|
usearch_getBreakIterator(strsrch) != breaker) {
|
|
|
|
log_err("Error setting break iterator\n");
|
|
|
|
if (strsrch != NULL) {
|
|
|
|
usearch_close(strsrch);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (!assertEqualWithUStringSearch(strsrch, *search)) {
|
|
|
|
ucol_setStrength(collator, UCOL_TERTIARY);
|
|
|
|
usearch_close(strsrch);
|
|
|
|
goto ENDTESTBREAKITERATOR;
|
|
|
|
}
|
2002-03-19 21:50:15 +00:00
|
|
|
search = &(BREAKITERATOREXACT[count + 1]);
|
2001-08-25 02:06:37 +00:00
|
|
|
breaker = getBreakIterator(search->breaker);
|
|
|
|
usearch_setBreakIterator(strsrch, breaker, &status);
|
|
|
|
if (U_FAILURE(status) ||
|
|
|
|
usearch_getBreakIterator(strsrch) != breaker) {
|
|
|
|
log_err("Error setting break iterator\n");
|
|
|
|
usearch_close(strsrch);
|
|
|
|
goto ENDTESTBREAKITERATOR;
|
|
|
|
}
|
|
|
|
usearch_reset(strsrch);
|
|
|
|
if (!assertEqualWithUStringSearch(strsrch, *search)) {
|
|
|
|
log_err("Error at test number %d\n", count);
|
|
|
|
goto ENDTESTBREAKITERATOR;
|
|
|
|
}
|
|
|
|
usearch_close(strsrch);
|
|
|
|
count += 2;
|
|
|
|
}
|
|
|
|
count = 0;
|
2002-03-19 21:50:15 +00:00
|
|
|
while (BREAKITERATOREXACT[count].text != NULL) {
|
|
|
|
if (!assertEqual(BREAKITERATOREXACT[count])) {
|
2001-08-25 02:06:37 +00:00
|
|
|
log_err("Error at test number %d\n", count);
|
|
|
|
goto ENDTESTBREAKITERATOR;
|
|
|
|
}
|
|
|
|
count ++;
|
|
|
|
}
|
|
|
|
|
|
|
|
ENDTESTBREAKITERATOR:
|
|
|
|
close();
|
|
|
|
}
|
|
|
|
|
2002-03-28 18:26:25 +00:00
|
|
|
static void TestVariable(void)
|
2001-08-25 02:06:37 +00:00
|
|
|
{
|
|
|
|
int count = 0;
|
|
|
|
UErrorCode status = U_ZERO_ERROR;
|
|
|
|
open();
|
|
|
|
ucol_setAttribute(EN_US_, UCOL_ALTERNATE_HANDLING, UCOL_SHIFTED, &status);
|
|
|
|
if (U_FAILURE(status)) {
|
|
|
|
log_err("Error setting collation alternate attribute %s\n",
|
|
|
|
u_errorName(status));
|
|
|
|
}
|
|
|
|
while (VARIABLE[count].text != NULL) {
|
|
|
|
log_verbose("variable %d\n", count);
|
|
|
|
if (!assertEqual(VARIABLE[count])) {
|
|
|
|
log_err("Error at test number %d\n", count);
|
|
|
|
}
|
|
|
|
count ++;
|
|
|
|
}
|
|
|
|
ucol_setAttribute(EN_US_, UCOL_ALTERNATE_HANDLING,
|
|
|
|
UCOL_NON_IGNORABLE, &status);
|
|
|
|
close();
|
|
|
|
}
|
|
|
|
|
2002-03-28 18:26:25 +00:00
|
|
|
static void TestOverlap(void)
|
2001-08-25 02:06:37 +00:00
|
|
|
{
|
|
|
|
int count = 0;
|
|
|
|
open();
|
|
|
|
while (OVERLAP[count].text != NULL) {
|
|
|
|
if (!assertEqualWithAttribute(OVERLAP[count], USEARCH_OFF,
|
|
|
|
USEARCH_ON)) {
|
|
|
|
log_err("Error at overlap test number %d\n", count);
|
|
|
|
}
|
|
|
|
count ++;
|
|
|
|
}
|
|
|
|
count = 0;
|
|
|
|
while (NONOVERLAP[count].text != NULL) {
|
|
|
|
if (!assertEqual(NONOVERLAP[count])) {
|
|
|
|
log_err("Error at non overlap test number %d\n", count);
|
|
|
|
}
|
|
|
|
count ++;
|
|
|
|
}
|
|
|
|
|
|
|
|
count = 0;
|
|
|
|
while (count < 1) {
|
|
|
|
UChar pattern[32];
|
|
|
|
UChar text[128];
|
|
|
|
const SearchData *search = &(OVERLAP[count]);
|
|
|
|
UCollator *collator = getCollator(search->collator);
|
|
|
|
UStringSearch *strsrch;
|
|
|
|
UErrorCode status = U_ZERO_ERROR;
|
|
|
|
|
|
|
|
u_unescape(search->text, text, 128);
|
|
|
|
u_unescape(search->pattern, pattern, 32);
|
|
|
|
strsrch = usearch_openFromCollator(pattern, -1, text, -1, collator,
|
|
|
|
NULL, &status);
|
|
|
|
usearch_setAttribute(strsrch, USEARCH_OVERLAP, USEARCH_ON, &status);
|
|
|
|
if (U_FAILURE(status) ||
|
|
|
|
usearch_getAttribute(strsrch, USEARCH_OVERLAP) != USEARCH_ON) {
|
|
|
|
log_err("Error setting overlap option\n");
|
|
|
|
}
|
|
|
|
if (!assertEqualWithUStringSearch(strsrch, *search)) {
|
|
|
|
usearch_close(strsrch);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
search = &(NONOVERLAP[count]);
|
|
|
|
usearch_setAttribute(strsrch, USEARCH_OVERLAP, USEARCH_OFF, &status);
|
|
|
|
if (U_FAILURE(status) ||
|
|
|
|
usearch_getAttribute(strsrch, USEARCH_OVERLAP) != USEARCH_OFF) {
|
|
|
|
log_err("Error setting overlap option\n");
|
|
|
|
}
|
|
|
|
usearch_reset(strsrch);
|
|
|
|
if (!assertEqualWithUStringSearch(strsrch, *search)) {
|
|
|
|
usearch_close(strsrch);
|
|
|
|
log_err("Error at test number %d\n", count);
|
|
|
|
}
|
|
|
|
|
|
|
|
count ++;
|
|
|
|
usearch_close(strsrch);
|
|
|
|
}
|
|
|
|
close();
|
|
|
|
}
|
|
|
|
|
2002-03-28 18:26:25 +00:00
|
|
|
static void TestCollator(void)
|
2001-08-25 02:06:37 +00:00
|
|
|
{
|
|
|
|
/* test collator that thinks "o" and "p" are the same thing */
|
|
|
|
UChar rules[32];
|
|
|
|
UCollator *tailored = NULL;
|
|
|
|
UErrorCode status = U_ZERO_ERROR;
|
|
|
|
UChar pattern[32];
|
|
|
|
UChar text[128];
|
|
|
|
UStringSearch *strsrch;
|
|
|
|
|
2002-02-13 01:01:33 +00:00
|
|
|
text[0] = 0x41;
|
|
|
|
text[1] = 0x42;
|
|
|
|
text[2] = 0x43;
|
|
|
|
text[3] = 0x44;
|
|
|
|
text[4] = 0x45;
|
|
|
|
pattern[0] = 0x62;
|
|
|
|
pattern[1] = 0x63;
|
|
|
|
strsrch = usearch_open(pattern, 2, text, 5, "en_US", NULL, &status);
|
|
|
|
tailored = usearch_getCollator(strsrch);
|
|
|
|
if (usearch_next(strsrch, &status) != -1) {
|
|
|
|
log_err("Error: Found case insensitive match, when we shouldn't\n");
|
|
|
|
}
|
|
|
|
ucol_setStrength(tailored, UCOL_PRIMARY);
|
|
|
|
usearch_reset(strsrch);
|
|
|
|
if (usearch_next(strsrch, &status) != 1) {
|
|
|
|
log_err("Error: Found case insensitive match not found\n");
|
|
|
|
}
|
|
|
|
usearch_close(strsrch);
|
|
|
|
|
2001-08-25 02:06:37 +00:00
|
|
|
open();
|
2002-02-13 01:01:33 +00:00
|
|
|
|
2001-09-11 21:40:05 +00:00
|
|
|
if (usearch_getCollator(NULL) != NULL) {
|
|
|
|
log_err("Expected NULL collator from NULL string search\n");
|
|
|
|
}
|
2001-08-25 02:06:37 +00:00
|
|
|
u_unescape(COLLATOR[0].text, text, 128);
|
|
|
|
u_unescape(COLLATOR[0].pattern, pattern, 32);
|
|
|
|
|
|
|
|
strsrch = usearch_openFromCollator(pattern, -1, text, -1, EN_US_,
|
|
|
|
NULL, &status);
|
|
|
|
if (U_FAILURE(status)) {
|
|
|
|
log_err("Error opening string search %s\n", u_errorName(status));
|
|
|
|
}
|
|
|
|
if (!assertEqualWithUStringSearch(strsrch, COLLATOR[0])) {
|
|
|
|
goto ENDTESTCOLLATOR;
|
|
|
|
}
|
|
|
|
|
|
|
|
u_unescape(TESTCOLLATORRULE, rules, 32);
|
2001-09-22 01:11:55 +00:00
|
|
|
tailored = ucol_openRules(rules, -1, UCOL_ON, COLLATOR[1].strength,
|
2001-08-25 02:06:37 +00:00
|
|
|
NULL, &status);
|
|
|
|
if (U_FAILURE(status)) {
|
|
|
|
log_err("Error opening rule based collator %s\n", u_errorName(status));
|
|
|
|
}
|
|
|
|
|
|
|
|
usearch_setCollator(strsrch, tailored, &status);
|
|
|
|
if (U_FAILURE(status) || usearch_getCollator(strsrch) != tailored) {
|
|
|
|
log_err("Error setting rule based collator\n");
|
|
|
|
}
|
|
|
|
usearch_reset(strsrch);
|
|
|
|
if (!assertEqualWithUStringSearch(strsrch, COLLATOR[1])) {
|
|
|
|
goto ENDTESTCOLLATOR;
|
|
|
|
}
|
|
|
|
|
|
|
|
usearch_setCollator(strsrch, EN_US_, &status);
|
|
|
|
usearch_reset(strsrch);
|
|
|
|
if (U_FAILURE(status) || usearch_getCollator(strsrch) != EN_US_) {
|
|
|
|
log_err("Error setting rule based collator\n");
|
|
|
|
}
|
|
|
|
if (!assertEqualWithUStringSearch(strsrch, COLLATOR[0])) {
|
|
|
|
goto ENDTESTCOLLATOR;
|
|
|
|
}
|
|
|
|
|
|
|
|
ENDTESTCOLLATOR:
|
|
|
|
usearch_close(strsrch);
|
|
|
|
if (tailored != NULL) {
|
|
|
|
ucol_close(tailored);
|
|
|
|
}
|
|
|
|
close();
|
|
|
|
}
|
|
|
|
|
2002-03-28 18:26:25 +00:00
|
|
|
static void TestPattern(void)
|
2001-08-25 02:06:37 +00:00
|
|
|
{
|
|
|
|
UStringSearch *strsrch;
|
|
|
|
UChar pattern[32];
|
|
|
|
UChar bigpattern[512];
|
|
|
|
UChar text[128];
|
|
|
|
const UChar *temp;
|
|
|
|
int32_t templength;
|
|
|
|
UErrorCode status = U_ZERO_ERROR;
|
|
|
|
|
|
|
|
open();
|
2001-09-11 21:40:05 +00:00
|
|
|
if (usearch_getPattern(NULL, &templength) != NULL) {
|
|
|
|
log_err("Error NULL string search expected returning NULL pattern\n");
|
|
|
|
}
|
|
|
|
usearch_setPattern(NULL, pattern, 3, &status);
|
|
|
|
if (U_SUCCESS(status)) {
|
|
|
|
log_err("Error expected setting pattern in NULL strings search\n");
|
|
|
|
}
|
|
|
|
status = U_ZERO_ERROR;
|
2001-08-25 02:06:37 +00:00
|
|
|
u_unescape(PATTERN[0].text, text, 128);
|
|
|
|
u_unescape(PATTERN[0].pattern, pattern, 32);
|
|
|
|
|
|
|
|
ucol_setStrength(EN_US_, PATTERN[0].strength);
|
|
|
|
strsrch = usearch_openFromCollator(pattern, -1, text, -1, EN_US_,
|
|
|
|
NULL, &status);
|
|
|
|
|
2001-09-11 21:40:05 +00:00
|
|
|
status = U_ZERO_ERROR;
|
|
|
|
usearch_setPattern(strsrch, NULL, 3, &status);
|
|
|
|
if (U_SUCCESS(status)) {
|
|
|
|
log_err("Error expected setting NULL pattern in strings search\n");
|
|
|
|
}
|
|
|
|
status = U_ZERO_ERROR;
|
|
|
|
usearch_setPattern(strsrch, pattern, 0, &status);
|
|
|
|
if (U_SUCCESS(status)) {
|
|
|
|
log_err("Error expected setting pattern with length 0 in strings search\n");
|
|
|
|
}
|
|
|
|
status = U_ZERO_ERROR;
|
2001-08-25 02:06:37 +00:00
|
|
|
if (U_FAILURE(status)) {
|
|
|
|
log_err("Error opening string search %s\n", u_errorName(status));
|
|
|
|
goto ENDTESTPATTERN;
|
|
|
|
}
|
|
|
|
temp = usearch_getPattern(strsrch, &templength);
|
|
|
|
if (u_strcmp(pattern, temp) != 0) {
|
|
|
|
log_err("Error setting pattern\n");
|
|
|
|
}
|
|
|
|
if (!assertEqualWithUStringSearch(strsrch, PATTERN[0])) {
|
|
|
|
goto ENDTESTPATTERN;
|
|
|
|
}
|
|
|
|
|
|
|
|
u_unescape(PATTERN[1].pattern, pattern, 32);
|
|
|
|
usearch_setPattern(strsrch, pattern, -1, &status);
|
|
|
|
temp = usearch_getPattern(strsrch, &templength);
|
|
|
|
if (u_strcmp(pattern, temp) != 0) {
|
|
|
|
log_err("Error setting pattern\n");
|
|
|
|
goto ENDTESTPATTERN;
|
|
|
|
}
|
|
|
|
usearch_reset(strsrch);
|
|
|
|
if (U_FAILURE(status)) {
|
|
|
|
log_err("Error setting pattern %s\n", u_errorName(status));
|
|
|
|
}
|
|
|
|
if (!assertEqualWithUStringSearch(strsrch, PATTERN[1])) {
|
|
|
|
goto ENDTESTPATTERN;
|
|
|
|
}
|
|
|
|
|
|
|
|
u_unescape(PATTERN[0].pattern, pattern, 32);
|
|
|
|
usearch_setPattern(strsrch, pattern, -1, &status);
|
|
|
|
temp = usearch_getPattern(strsrch, &templength);
|
|
|
|
if (u_strcmp(pattern, temp) != 0) {
|
|
|
|
log_err("Error setting pattern\n");
|
|
|
|
goto ENDTESTPATTERN;
|
|
|
|
}
|
|
|
|
usearch_reset(strsrch);
|
|
|
|
if (U_FAILURE(status)) {
|
|
|
|
log_err("Error setting pattern %s\n", u_errorName(status));
|
|
|
|
}
|
|
|
|
if (!assertEqualWithUStringSearch(strsrch, PATTERN[0])) {
|
|
|
|
goto ENDTESTPATTERN;
|
|
|
|
}
|
|
|
|
/* enormous pattern size to see if this crashes */
|
|
|
|
for (templength = 0; templength != 512; templength ++) {
|
|
|
|
bigpattern[templength] = 0x61;
|
|
|
|
}
|
|
|
|
bigpattern[511] = 0;
|
|
|
|
usearch_setPattern(strsrch, bigpattern, -1, &status);
|
|
|
|
if (U_FAILURE(status)) {
|
|
|
|
log_err("Error setting pattern with size 512, %s \n",
|
|
|
|
u_errorName(status));
|
|
|
|
}
|
|
|
|
ENDTESTPATTERN:
|
|
|
|
ucol_setStrength(EN_US_, UCOL_TERTIARY);
|
|
|
|
if (strsrch != NULL) {
|
|
|
|
usearch_close(strsrch);
|
|
|
|
}
|
|
|
|
close();
|
|
|
|
}
|
|
|
|
|
2002-03-28 18:26:25 +00:00
|
|
|
static void TestText(void)
|
2001-08-25 02:06:37 +00:00
|
|
|
{
|
|
|
|
UStringSearch *strsrch;
|
|
|
|
UChar pattern[32];
|
|
|
|
UChar text[128];
|
|
|
|
const UChar *temp;
|
|
|
|
int32_t templength;
|
|
|
|
UErrorCode status = U_ZERO_ERROR;
|
|
|
|
|
|
|
|
u_unescape(TEXT[0].text, text, 128);
|
|
|
|
u_unescape(TEXT[0].pattern, pattern, 32);
|
|
|
|
|
|
|
|
open();
|
2001-09-11 21:40:05 +00:00
|
|
|
|
|
|
|
if (usearch_getText(NULL, &templength) != NULL) {
|
|
|
|
log_err("Error NULL string search should return NULL text\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
usearch_setText(NULL, text, 10, &status);
|
|
|
|
if (U_SUCCESS(status)) {
|
|
|
|
log_err("Error NULL string search should have an error when setting text\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
status = U_ZERO_ERROR;
|
2001-08-25 02:06:37 +00:00
|
|
|
strsrch = usearch_openFromCollator(pattern, -1, text, -1, EN_US_,
|
|
|
|
NULL, &status);
|
|
|
|
|
|
|
|
if (U_FAILURE(status)) {
|
|
|
|
log_err("Error opening string search %s\n", u_errorName(status));
|
|
|
|
goto ENDTESTPATTERN;
|
|
|
|
}
|
|
|
|
temp = usearch_getText(strsrch, &templength);
|
|
|
|
if (u_strcmp(text, temp) != 0) {
|
|
|
|
log_err("Error setting text\n");
|
|
|
|
}
|
|
|
|
if (!assertEqualWithUStringSearch(strsrch, TEXT[0])) {
|
|
|
|
goto ENDTESTPATTERN;
|
|
|
|
}
|
|
|
|
|
|
|
|
u_unescape(TEXT[1].text, text, 32);
|
|
|
|
usearch_setText(strsrch, text, -1, &status);
|
|
|
|
temp = usearch_getText(strsrch, &templength);
|
|
|
|
if (u_strcmp(text, temp) != 0) {
|
|
|
|
log_err("Error setting text\n");
|
|
|
|
goto ENDTESTPATTERN;
|
|
|
|
}
|
|
|
|
if (U_FAILURE(status)) {
|
|
|
|
log_err("Error setting text %s\n", u_errorName(status));
|
|
|
|
}
|
|
|
|
if (!assertEqualWithUStringSearch(strsrch, TEXT[1])) {
|
|
|
|
goto ENDTESTPATTERN;
|
|
|
|
}
|
|
|
|
|
|
|
|
u_unescape(TEXT[0].text, text, 32);
|
|
|
|
usearch_setText(strsrch, text, -1, &status);
|
|
|
|
temp = usearch_getText(strsrch, &templength);
|
|
|
|
if (u_strcmp(text, temp) != 0) {
|
|
|
|
log_err("Error setting text\n");
|
|
|
|
goto ENDTESTPATTERN;
|
|
|
|
}
|
|
|
|
if (U_FAILURE(status)) {
|
|
|
|
log_err("Error setting pattern %s\n", u_errorName(status));
|
|
|
|
}
|
|
|
|
if (!assertEqualWithUStringSearch(strsrch, TEXT[0])) {
|
|
|
|
goto ENDTESTPATTERN;
|
|
|
|
}
|
|
|
|
ENDTESTPATTERN:
|
|
|
|
if (strsrch != NULL) {
|
|
|
|
usearch_close(strsrch);
|
|
|
|
}
|
|
|
|
close();
|
|
|
|
}
|
|
|
|
|
2002-03-28 18:26:25 +00:00
|
|
|
static void TestCompositeBoundaries(void)
|
2001-08-25 02:06:37 +00:00
|
|
|
{
|
|
|
|
int count = 0;
|
|
|
|
open();
|
|
|
|
while (COMPOSITEBOUNDARIES[count].text != NULL) {
|
|
|
|
log_verbose("composite %d\n", count);
|
|
|
|
if (!assertEqual(COMPOSITEBOUNDARIES[count])) {
|
|
|
|
log_err("Error at test number %d\n", count);
|
|
|
|
}
|
|
|
|
count ++;
|
|
|
|
}
|
|
|
|
close();
|
|
|
|
}
|
|
|
|
|
2002-03-28 18:26:25 +00:00
|
|
|
static void TestGetSetOffset(void)
|
2001-08-25 02:06:37 +00:00
|
|
|
{
|
|
|
|
int index = 0;
|
|
|
|
UChar pattern[32];
|
|
|
|
UChar text[128];
|
|
|
|
UErrorCode status = U_ZERO_ERROR;
|
|
|
|
UStringSearch *strsrch;
|
|
|
|
|
|
|
|
open();
|
2001-09-11 21:40:05 +00:00
|
|
|
if (usearch_getOffset(NULL) != USEARCH_DONE) {
|
|
|
|
log_err("usearch_getOffset(NULL) expected USEARCH_DONE\n");
|
|
|
|
}
|
2001-08-25 02:06:37 +00:00
|
|
|
strsrch = usearch_openFromCollator(pattern, 16, text, 32, EN_US_, NULL,
|
|
|
|
&status);
|
|
|
|
/* testing out of bounds error */
|
|
|
|
usearch_setOffset(strsrch, -1, &status);
|
|
|
|
if (U_SUCCESS(status)) {
|
|
|
|
log_err("Error expecting set offset error\n");
|
|
|
|
}
|
|
|
|
usearch_setOffset(strsrch, 128, &status);
|
|
|
|
if (U_SUCCESS(status)) {
|
|
|
|
log_err("Error expecting set offset error\n");
|
|
|
|
}
|
|
|
|
while (BASIC[index].text != NULL) {
|
|
|
|
int count = 0;
|
|
|
|
SearchData search = BASIC[index ++];
|
2002-03-12 01:32:42 +00:00
|
|
|
int32_t matchindex = search.offset[count];
|
2001-08-25 02:06:37 +00:00
|
|
|
int32_t textlength;
|
|
|
|
|
|
|
|
u_unescape(search.text, text, 128);
|
|
|
|
u_unescape(search.pattern, pattern, 32);
|
|
|
|
status = U_ZERO_ERROR;
|
|
|
|
usearch_setText(strsrch, text, -1, &status);
|
|
|
|
usearch_setPattern(strsrch, pattern, -1, &status);
|
|
|
|
while (U_SUCCESS(status) && matchindex >= 0) {
|
|
|
|
uint32_t matchlength = search.size[count];
|
|
|
|
usearch_next(strsrch, &status);
|
|
|
|
if (matchindex != usearch_getMatchedStart(strsrch) ||
|
|
|
|
matchlength != (uint32_t)usearch_getMatchedLength(strsrch)) {
|
|
|
|
char *str = toCharString(usearch_getText(strsrch,
|
|
|
|
&textlength));
|
|
|
|
log_err("Text: %s\n", str);
|
|
|
|
str = toCharString(usearch_getPattern(strsrch, &textlength));
|
|
|
|
log_err("Pattern: %s\n", str);
|
|
|
|
log_err("Error match found at %d %d\n",
|
|
|
|
usearch_getMatchedStart(strsrch),
|
|
|
|
usearch_getMatchedLength(strsrch));
|
|
|
|
return;
|
|
|
|
}
|
2001-09-11 21:40:05 +00:00
|
|
|
usearch_setOffset(strsrch, matchindex + matchlength, &status);
|
|
|
|
usearch_previous(strsrch, &status);
|
|
|
|
if (matchindex != usearch_getMatchedStart(strsrch) ||
|
|
|
|
matchlength != (uint32_t)usearch_getMatchedLength(strsrch)) {
|
|
|
|
char *str = toCharString(usearch_getText(strsrch,
|
|
|
|
&textlength));
|
|
|
|
log_err("Text: %s\n", str);
|
|
|
|
str = toCharString(usearch_getPattern(strsrch, &textlength));
|
|
|
|
log_err("Pattern: %s\n", str);
|
|
|
|
log_err("Error match found at %d %d\n",
|
|
|
|
usearch_getMatchedStart(strsrch),
|
|
|
|
usearch_getMatchedLength(strsrch));
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
usearch_setOffset(strsrch, matchindex + matchlength, &status);
|
2001-08-25 02:06:37 +00:00
|
|
|
matchindex = search.offset[count + 1] == -1 ? -1 :
|
|
|
|
search.offset[count + 2];
|
|
|
|
if (search.offset[count + 1] != -1) {
|
|
|
|
usearch_setOffset(strsrch, search.offset[count + 1] + 1,
|
|
|
|
&status);
|
|
|
|
if (usearch_getOffset(strsrch) != search.offset[count + 1] + 1) {
|
|
|
|
log_err("Error setting offset\n");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
count += 2;
|
|
|
|
}
|
|
|
|
usearch_next(strsrch, &status);
|
|
|
|
if ((uint32_t)usearch_getMatchedStart(strsrch) != USEARCH_DONE) {
|
|
|
|
char *str = toCharString(usearch_getText(strsrch, &textlength));
|
|
|
|
log_err("Text: %s\n", str);
|
|
|
|
str = toCharString(usearch_getPattern(strsrch, &textlength));
|
|
|
|
log_err("Pattern: %s\n", str);
|
|
|
|
log_err("Error match found at %d %d\n",
|
|
|
|
usearch_getMatchedStart(strsrch),
|
|
|
|
usearch_getMatchedLength(strsrch));
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
usearch_close(strsrch);
|
|
|
|
close();
|
|
|
|
}
|
|
|
|
|
2002-03-28 18:26:25 +00:00
|
|
|
static void TestGetSetAttribute(void)
|
2001-08-25 02:06:37 +00:00
|
|
|
{
|
2001-10-19 23:03:24 +00:00
|
|
|
UErrorCode status = U_ZERO_ERROR;
|
|
|
|
UChar pattern[32];
|
|
|
|
UChar text[128];
|
|
|
|
UStringSearch *strsrch;
|
2001-08-25 02:06:37 +00:00
|
|
|
|
|
|
|
open();
|
2001-09-11 21:40:05 +00:00
|
|
|
if (usearch_getAttribute(NULL, USEARCH_OVERLAP) != USEARCH_DEFAULT ||
|
|
|
|
usearch_getAttribute(NULL, USEARCH_CANONICAL_MATCH) !=
|
|
|
|
USEARCH_DEFAULT) {
|
|
|
|
log_err(
|
|
|
|
"Attributes for NULL string search should be USEARCH_DEFAULT\n");
|
|
|
|
}
|
2001-08-25 02:06:37 +00:00
|
|
|
strsrch = usearch_openFromCollator(pattern, 16, text, 32, EN_US_, NULL,
|
|
|
|
&status);
|
|
|
|
if (U_FAILURE(status)) {
|
|
|
|
log_err("Error opening search %s\n", u_errorName(status));
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
usearch_setAttribute(strsrch, USEARCH_OVERLAP, USEARCH_DEFAULT, &status);
|
|
|
|
if (U_FAILURE(status) ||
|
|
|
|
usearch_getAttribute(strsrch, USEARCH_OVERLAP) != USEARCH_OFF) {
|
|
|
|
log_err("Error setting overlap to the default\n");
|
|
|
|
}
|
|
|
|
usearch_setAttribute(strsrch, USEARCH_OVERLAP, USEARCH_ON, &status);
|
|
|
|
if (U_FAILURE(status) ||
|
|
|
|
usearch_getAttribute(strsrch, USEARCH_OVERLAP) != USEARCH_ON) {
|
|
|
|
log_err("Error setting overlap true\n");
|
|
|
|
}
|
|
|
|
usearch_setAttribute(strsrch, USEARCH_OVERLAP, USEARCH_OFF, &status);
|
|
|
|
if (U_FAILURE(status) ||
|
|
|
|
usearch_getAttribute(strsrch, USEARCH_OVERLAP) != USEARCH_OFF) {
|
|
|
|
log_err("Error setting overlap false\n");
|
|
|
|
}
|
|
|
|
usearch_setAttribute(strsrch, USEARCH_OVERLAP,
|
|
|
|
USEARCH_ATTRIBUTE_VALUE_COUNT, &status);
|
|
|
|
if (U_SUCCESS(status)) {
|
|
|
|
log_err("Error setting overlap to illegal value\n");
|
|
|
|
}
|
|
|
|
status = U_ZERO_ERROR;
|
|
|
|
usearch_setAttribute(strsrch, USEARCH_CANONICAL_MATCH, USEARCH_DEFAULT,
|
|
|
|
&status);
|
|
|
|
if (U_FAILURE(status) ||
|
|
|
|
usearch_getAttribute(strsrch, USEARCH_CANONICAL_MATCH) !=
|
|
|
|
USEARCH_OFF) {
|
|
|
|
log_err("Error setting canonical match to the default\n");
|
|
|
|
}
|
|
|
|
usearch_setAttribute(strsrch, USEARCH_CANONICAL_MATCH, USEARCH_ON,
|
|
|
|
&status);
|
|
|
|
if (U_FAILURE(status) ||
|
|
|
|
usearch_getAttribute(strsrch, USEARCH_CANONICAL_MATCH) !=
|
|
|
|
USEARCH_ON) {
|
|
|
|
log_err("Error setting canonical match true\n");
|
|
|
|
}
|
|
|
|
usearch_setAttribute(strsrch, USEARCH_CANONICAL_MATCH, USEARCH_OFF,
|
|
|
|
&status);
|
|
|
|
if (U_FAILURE(status) ||
|
|
|
|
usearch_getAttribute(strsrch, USEARCH_CANONICAL_MATCH) !=
|
|
|
|
USEARCH_OFF) {
|
|
|
|
log_err("Error setting canonical match false\n");
|
|
|
|
}
|
|
|
|
usearch_setAttribute(strsrch, USEARCH_CANONICAL_MATCH,
|
|
|
|
USEARCH_ATTRIBUTE_VALUE_COUNT, &status);
|
|
|
|
if (U_SUCCESS(status)) {
|
|
|
|
log_err("Error setting canonical match to illegal value\n");
|
|
|
|
}
|
|
|
|
status = U_ZERO_ERROR;
|
|
|
|
usearch_setAttribute(strsrch, USEARCH_ATTRIBUTE_COUNT, USEARCH_DEFAULT,
|
|
|
|
&status);
|
|
|
|
if (U_SUCCESS(status)) {
|
|
|
|
log_err("Error setting illegal attribute success\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
usearch_close(strsrch);
|
|
|
|
close();
|
|
|
|
}
|
|
|
|
|
2002-03-28 18:26:25 +00:00
|
|
|
static void TestGetMatch(void)
|
2001-08-25 02:06:37 +00:00
|
|
|
{
|
|
|
|
int count = 0;
|
|
|
|
UErrorCode status = U_ZERO_ERROR;
|
|
|
|
UChar text[128];
|
|
|
|
UChar pattern[32];
|
|
|
|
SearchData search = MATCH[0];
|
2002-03-12 01:32:42 +00:00
|
|
|
int32_t matchindex = search.offset[count];
|
2001-08-25 02:06:37 +00:00
|
|
|
UStringSearch *strsrch;
|
|
|
|
int32_t textlength;
|
|
|
|
UChar matchtext[128];
|
|
|
|
|
|
|
|
open();
|
2001-09-11 21:40:05 +00:00
|
|
|
|
|
|
|
if (usearch_getMatchedStart(NULL) != USEARCH_DONE ||
|
|
|
|
usearch_getMatchedLength(NULL) != USEARCH_DONE) {
|
|
|
|
log_err(
|
|
|
|
"Expected start and length of NULL string search should be USEARCH_DONE\n");
|
|
|
|
}
|
|
|
|
|
2001-08-25 02:06:37 +00:00
|
|
|
u_unescape(search.text, text, 128);
|
|
|
|
u_unescape(search.pattern, pattern, 32);
|
|
|
|
strsrch = usearch_openFromCollator(pattern, -1, text, -1, EN_US_,
|
|
|
|
NULL, &status);
|
|
|
|
if (U_FAILURE(status)) {
|
|
|
|
log_err("Error opening string search %s\n", u_errorName(status));
|
|
|
|
if (strsrch != NULL) {
|
|
|
|
usearch_close(strsrch);
|
|
|
|
}
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
while (U_SUCCESS(status) && matchindex >= 0) {
|
|
|
|
int32_t matchlength = search.size[count];
|
|
|
|
usearch_next(strsrch, &status);
|
|
|
|
if (matchindex != usearch_getMatchedStart(strsrch) ||
|
|
|
|
matchlength != usearch_getMatchedLength(strsrch)) {
|
|
|
|
char *str = toCharString(usearch_getText(strsrch, &textlength));
|
|
|
|
log_err("Text: %s\n", str);
|
|
|
|
str = toCharString(usearch_getPattern(strsrch, &textlength));
|
|
|
|
log_err("Pattern: %s\n", str);
|
|
|
|
log_err("Error match found at %d %d\n",
|
|
|
|
usearch_getMatchedStart(strsrch),
|
|
|
|
usearch_getMatchedLength(strsrch));
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
count ++;
|
|
|
|
|
|
|
|
status = U_ZERO_ERROR;
|
|
|
|
if (usearch_getMatchedText(NULL, matchtext, 128, &status) !=
|
|
|
|
USEARCH_DONE || U_SUCCESS(status)){
|
|
|
|
log_err("Error expecting errors with NULL string search\n");
|
|
|
|
}
|
|
|
|
status = U_ZERO_ERROR;
|
2001-10-05 22:54:00 +00:00
|
|
|
if (usearch_getMatchedText(strsrch, NULL, 0, &status) !=
|
2001-08-25 02:06:37 +00:00
|
|
|
(int32_t)matchlength || U_SUCCESS(status)){
|
|
|
|
log_err("Error pre-flighting match length\n");
|
|
|
|
}
|
|
|
|
status = U_ZERO_ERROR;
|
|
|
|
if (usearch_getMatchedText(strsrch, matchtext, 0, &status) !=
|
|
|
|
(int32_t)matchlength || U_SUCCESS(status)){
|
|
|
|
log_err("Error getting match text with buffer size 0\n");
|
|
|
|
}
|
|
|
|
status = U_ZERO_ERROR;
|
|
|
|
if (usearch_getMatchedText(strsrch, matchtext, matchlength, &status)
|
|
|
|
!= (int32_t)matchlength || matchtext[matchlength - 1] == 0 ||
|
|
|
|
U_FAILURE(status)){
|
|
|
|
log_err("Error getting match text with exact size\n");
|
|
|
|
}
|
|
|
|
status = U_ZERO_ERROR;
|
|
|
|
if (usearch_getMatchedText(strsrch, matchtext, 128, &status) !=
|
|
|
|
(int32_t) matchlength || U_FAILURE(status) ||
|
|
|
|
memcmp(matchtext,
|
|
|
|
usearch_getText(strsrch, &textlength) + matchindex,
|
|
|
|
matchlength * sizeof(UChar)) != 0 ||
|
|
|
|
matchtext[matchlength] != 0) {
|
|
|
|
log_err("Error getting matched text\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
matchindex = search.offset[count];
|
|
|
|
}
|
|
|
|
status = U_ZERO_ERROR;
|
|
|
|
usearch_next(strsrch, &status);
|
|
|
|
if (usearch_getMatchedStart(strsrch) != USEARCH_DONE ||
|
|
|
|
usearch_getMatchedLength(strsrch) != 0) {
|
|
|
|
log_err("Error end of match not found\n");
|
|
|
|
}
|
|
|
|
status = U_ZERO_ERROR;
|
|
|
|
if (usearch_getMatchedText(strsrch, matchtext, 128, &status) !=
|
|
|
|
USEARCH_DONE) {
|
|
|
|
log_err("Error getting null matches\n");
|
|
|
|
}
|
|
|
|
usearch_close(strsrch);
|
|
|
|
close();
|
|
|
|
}
|
|
|
|
|
2002-03-28 18:26:25 +00:00
|
|
|
static void TestSetMatch(void)
|
2001-08-25 02:06:37 +00:00
|
|
|
{
|
|
|
|
int count = 0;
|
|
|
|
|
|
|
|
open();
|
|
|
|
while (MATCH[count].text != NULL) {
|
|
|
|
SearchData search = MATCH[count];
|
|
|
|
int size = 0;
|
|
|
|
int index = 0;
|
|
|
|
UChar text[128];
|
|
|
|
UChar pattern[32];
|
|
|
|
UStringSearch *strsrch;
|
|
|
|
UErrorCode status = U_ZERO_ERROR;
|
2001-09-11 21:40:05 +00:00
|
|
|
|
|
|
|
if (usearch_first(NULL, &status) != USEARCH_DONE ||
|
|
|
|
usearch_last(NULL, &status) != USEARCH_DONE) {
|
|
|
|
log_err("Error getting the first and last match of a NULL string search\n");
|
|
|
|
}
|
2001-08-25 02:06:37 +00:00
|
|
|
u_unescape(search.text, text, 128);
|
|
|
|
u_unescape(search.pattern, pattern, 32);
|
|
|
|
strsrch = usearch_openFromCollator(pattern, -1, text, -1, EN_US_,
|
|
|
|
NULL, &status);
|
|
|
|
if (U_FAILURE(status)) {
|
|
|
|
log_err("Error opening string search %s\n", u_errorName(status));
|
|
|
|
if (strsrch != NULL) {
|
|
|
|
usearch_close(strsrch);
|
|
|
|
}
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
size = 0;
|
|
|
|
while (search.offset[size] != -1) {
|
|
|
|
size ++;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (usearch_first(strsrch, &status) != search.offset[0] ||
|
|
|
|
U_FAILURE(status)) {
|
|
|
|
log_err("Error getting first match\n");
|
|
|
|
}
|
|
|
|
if (usearch_last(strsrch, &status) != search.offset[size -1] ||
|
|
|
|
U_FAILURE(status)) {
|
|
|
|
log_err("Error getting last match\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
while (index < size) {
|
|
|
|
if (index + 2 < size) {
|
|
|
|
if (usearch_following(strsrch, search.offset[index + 2] - 1,
|
|
|
|
&status) != search.offset[index + 2] ||
|
|
|
|
U_FAILURE(status)) {
|
|
|
|
log_err("Error getting following match at index %d\n",
|
|
|
|
search.offset[index + 2] - 1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (index + 1 < size) {
|
|
|
|
if (usearch_preceding(strsrch, search.offset[index + 1] +
|
|
|
|
search.size[index + 1] + 1,
|
|
|
|
&status) != search.offset[index + 1] ||
|
|
|
|
U_FAILURE(status)) {
|
|
|
|
log_err("Error getting preceeding match at index %d\n",
|
|
|
|
search.offset[index + 1] + 1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
index += 2;
|
|
|
|
}
|
|
|
|
status = U_ZERO_ERROR;
|
|
|
|
if (usearch_following(strsrch, u_strlen(text), &status) !=
|
|
|
|
USEARCH_DONE) {
|
|
|
|
log_err("Error expecting out of bounds match\n");
|
|
|
|
}
|
|
|
|
if (usearch_preceding(strsrch, 0, &status) != USEARCH_DONE) {
|
|
|
|
log_err("Error expecting out of bounds match\n");
|
|
|
|
}
|
|
|
|
count ++;
|
|
|
|
usearch_close(strsrch);
|
|
|
|
}
|
|
|
|
close();
|
|
|
|
}
|
|
|
|
|
2002-03-28 18:26:25 +00:00
|
|
|
static void TestReset(void)
|
2001-08-25 02:06:37 +00:00
|
|
|
{
|
2001-09-11 21:40:05 +00:00
|
|
|
UErrorCode status = U_ZERO_ERROR;
|
|
|
|
UChar text[] = {0x66, 0x69, 0x73, 0x68, 0x20,
|
|
|
|
0x66, 0x69, 0x73, 0x68};
|
|
|
|
UChar pattern[] = {0x73};
|
2001-08-25 02:06:37 +00:00
|
|
|
UStringSearch *strsrch;
|
|
|
|
|
|
|
|
open();
|
2001-09-11 21:40:05 +00:00
|
|
|
strsrch = usearch_openFromCollator(pattern, 1, text, 9,
|
2001-08-25 02:06:37 +00:00
|
|
|
EN_US_, NULL, &status);
|
|
|
|
if (U_FAILURE(status)) {
|
|
|
|
log_err("Error opening string search %s\n", u_errorName(status));
|
|
|
|
if (strsrch != NULL) {
|
|
|
|
usearch_close(strsrch);
|
|
|
|
}
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
usearch_setAttribute(strsrch, USEARCH_OVERLAP, USEARCH_ON, &status);
|
|
|
|
usearch_setAttribute(strsrch, USEARCH_CANONICAL_MATCH, USEARCH_ON,
|
|
|
|
&status);
|
2001-09-11 21:40:05 +00:00
|
|
|
usearch_setOffset(strsrch, 9, &status);
|
2001-08-25 02:06:37 +00:00
|
|
|
if (U_FAILURE(status)) {
|
|
|
|
log_err("Error setting attributes and offsets\n");
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
usearch_reset(strsrch);
|
|
|
|
if (usearch_getAttribute(strsrch, USEARCH_OVERLAP) != USEARCH_OFF ||
|
|
|
|
usearch_getAttribute(strsrch, USEARCH_CANONICAL_MATCH) !=
|
|
|
|
USEARCH_OFF ||
|
|
|
|
usearch_getOffset(strsrch) != 0 ||
|
|
|
|
usearch_getMatchedLength(strsrch) != 0 ||
|
|
|
|
usearch_getMatchedStart(strsrch) != USEARCH_DONE) {
|
|
|
|
log_err("Error resetting string search\n");
|
2001-09-11 21:40:05 +00:00
|
|
|
}
|
|
|
|
usearch_previous(strsrch, &status);
|
|
|
|
if (usearch_getMatchedStart(strsrch) != 7 ||
|
|
|
|
usearch_getMatchedLength(strsrch) != 1) {
|
|
|
|
log_err("Error resetting string search\n");
|
2001-08-25 02:06:37 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
usearch_close(strsrch);
|
|
|
|
close();
|
|
|
|
}
|
|
|
|
|
2002-03-28 18:26:25 +00:00
|
|
|
static void TestSupplementary(void)
|
2001-08-25 02:06:37 +00:00
|
|
|
{
|
|
|
|
int count = 0;
|
|
|
|
open();
|
|
|
|
while (SUPPLEMENTARY[count].text != NULL) {
|
|
|
|
if (!assertEqual(SUPPLEMENTARY[count])) {
|
|
|
|
log_err("Error at test number %d\n", count);
|
|
|
|
}
|
|
|
|
count ++;
|
|
|
|
}
|
|
|
|
close();
|
|
|
|
}
|
|
|
|
|
2002-03-28 18:26:25 +00:00
|
|
|
static void TestContraction(void)
|
2001-08-25 02:06:37 +00:00
|
|
|
{
|
|
|
|
UChar rules[128];
|
|
|
|
UChar pattern[128];
|
|
|
|
UChar text[128];
|
|
|
|
UCollator *collator;
|
|
|
|
UErrorCode status = U_ZERO_ERROR;
|
|
|
|
int count = 0;
|
|
|
|
UStringSearch *strsrch;
|
|
|
|
|
|
|
|
u_unescape(CONTRACTIONRULE, rules, 128);
|
2001-09-22 01:11:55 +00:00
|
|
|
collator = ucol_openRules(rules, u_strlen(rules), UCOL_ON,
|
2001-08-25 02:06:37 +00:00
|
|
|
UCOL_TERTIARY, NULL, &status);
|
|
|
|
if (U_FAILURE(status)) {
|
|
|
|
log_err("Error opening collator %s\n", u_errorName(status));
|
|
|
|
}
|
|
|
|
strsrch = usearch_openFromCollator(pattern, 1, text, 1, collator, NULL,
|
|
|
|
&status);
|
|
|
|
if (U_FAILURE(status)) {
|
|
|
|
log_err("Error opening string search %s\n", u_errorName(status));
|
|
|
|
}
|
|
|
|
|
|
|
|
while (CONTRACTION[count].text != NULL) {
|
|
|
|
u_unescape(CONTRACTION[count].text, text, 128);
|
|
|
|
u_unescape(CONTRACTION[count].pattern, pattern, 128);
|
|
|
|
usearch_setText(strsrch, text, -1, &status);
|
|
|
|
usearch_setPattern(strsrch, pattern, -1, &status);
|
|
|
|
if (!assertEqualWithUStringSearch(strsrch, CONTRACTION[count])) {
|
|
|
|
log_err("Error at test number %d\n", count);
|
|
|
|
}
|
|
|
|
count ++;
|
|
|
|
}
|
|
|
|
usearch_close(strsrch);
|
|
|
|
ucol_close(collator);
|
|
|
|
}
|
|
|
|
|
2002-03-28 18:26:25 +00:00
|
|
|
static void TestIgnorable(void)
|
2001-08-25 02:06:37 +00:00
|
|
|
{
|
|
|
|
UChar rules[128];
|
|
|
|
UChar pattern[128];
|
|
|
|
UChar text[128];
|
|
|
|
UCollator *collator;
|
|
|
|
UErrorCode status = U_ZERO_ERROR;
|
|
|
|
UStringSearch *strsrch;
|
|
|
|
uint32_t count = 0;
|
|
|
|
|
|
|
|
u_unescape(IGNORABLERULE, rules, 128);
|
2001-09-22 01:11:55 +00:00
|
|
|
collator = ucol_openRules(rules, u_strlen(rules), UCOL_ON,
|
2001-08-25 02:06:37 +00:00
|
|
|
IGNORABLE[count].strength, NULL, &status);
|
|
|
|
if (U_FAILURE(status)) {
|
|
|
|
log_err("Error opening collator %s\n", u_errorName(status));
|
|
|
|
}
|
|
|
|
strsrch = usearch_openFromCollator(pattern, 1, text, 1, collator, NULL,
|
|
|
|
&status);
|
|
|
|
if (U_FAILURE(status)) {
|
|
|
|
log_err("Error opening string search %s\n", u_errorName(status));
|
|
|
|
}
|
|
|
|
|
|
|
|
while (IGNORABLE[count].text != NULL) {
|
|
|
|
u_unescape(IGNORABLE[count].text, text, 128);
|
|
|
|
u_unescape(IGNORABLE[count].pattern, pattern, 128);
|
|
|
|
usearch_setText(strsrch, text, -1, &status);
|
|
|
|
usearch_setPattern(strsrch, pattern, -1, &status);
|
|
|
|
if (!assertEqualWithUStringSearch(strsrch, IGNORABLE[count])) {
|
|
|
|
log_err("Error at test number %d\n", count);
|
|
|
|
}
|
|
|
|
count ++;
|
|
|
|
}
|
|
|
|
usearch_close(strsrch);
|
|
|
|
ucol_close(collator);
|
|
|
|
}
|
|
|
|
|
2002-03-28 18:26:25 +00:00
|
|
|
static void TestCanonical(void)
|
2001-08-25 02:06:37 +00:00
|
|
|
{
|
|
|
|
int count = 0;
|
|
|
|
open();
|
|
|
|
while (BASICCANONICAL[count].text != NULL) {
|
|
|
|
if (!assertCanonicalEqual(BASICCANONICAL[count])) {
|
|
|
|
log_err("Error at test number %d\n", count);
|
|
|
|
}
|
|
|
|
count ++;
|
|
|
|
}
|
|
|
|
close();
|
|
|
|
}
|
|
|
|
|
2002-03-28 18:26:25 +00:00
|
|
|
static void TestNormCanonical(void)
|
2001-08-25 02:06:37 +00:00
|
|
|
{
|
|
|
|
int count = 0;
|
|
|
|
UErrorCode status = U_ZERO_ERROR;
|
|
|
|
open();
|
|
|
|
ucol_setAttribute(EN_US_, UCOL_NORMALIZATION_MODE, UCOL_ON, &status);
|
|
|
|
count = 0;
|
|
|
|
while (NORMCANONICAL[count].text != NULL) {
|
|
|
|
if (!assertCanonicalEqual(NORMCANONICAL[count])) {
|
|
|
|
log_err("Error at test number %d\n", count);
|
|
|
|
}
|
|
|
|
count ++;
|
|
|
|
}
|
|
|
|
ucol_setAttribute(EN_US_, UCOL_NORMALIZATION_MODE, UCOL_OFF, &status);
|
|
|
|
close();
|
|
|
|
}
|
|
|
|
|
2002-03-28 18:26:25 +00:00
|
|
|
static void TestStrengthCanonical(void)
|
2001-08-25 02:06:37 +00:00
|
|
|
{
|
|
|
|
int count = 0;
|
|
|
|
open();
|
|
|
|
while (STRENGTHCANONICAL[count].text != NULL) {
|
|
|
|
if (!assertCanonicalEqual(STRENGTHCANONICAL[count])) {
|
|
|
|
log_err("Error at test number %d\n", count);
|
|
|
|
}
|
|
|
|
count ++;
|
|
|
|
}
|
|
|
|
close();
|
|
|
|
}
|
|
|
|
|
2002-03-28 18:26:25 +00:00
|
|
|
static void TestBreakIteratorCanonical(void) {
|
2001-08-25 02:06:37 +00:00
|
|
|
UErrorCode status = U_ZERO_ERROR;
|
|
|
|
int count = 0;
|
|
|
|
|
|
|
|
open();
|
|
|
|
while (count < 4) {
|
2002-03-20 18:40:58 +00:00
|
|
|
/* 0-3 test are fixed */
|
2001-08-25 02:06:37 +00:00
|
|
|
UChar pattern[32];
|
|
|
|
UChar text[128];
|
|
|
|
const SearchData *search = &(BREAKITERATORCANONICAL[count]);
|
|
|
|
UCollator *collator = getCollator(search->collator);
|
|
|
|
UBreakIterator *breaker = getBreakIterator(search->breaker);
|
|
|
|
UStringSearch *strsrch;
|
|
|
|
|
|
|
|
u_unescape(search->text, text, 128);
|
|
|
|
u_unescape(search->pattern, pattern, 32);
|
|
|
|
ucol_setStrength(collator, search->strength);
|
|
|
|
|
|
|
|
strsrch = usearch_openFromCollator(pattern, -1, text, -1, collator,
|
|
|
|
breaker, &status);
|
|
|
|
usearch_setAttribute(strsrch, USEARCH_CANONICAL_MATCH, USEARCH_ON,
|
|
|
|
&status);
|
|
|
|
if (U_FAILURE(status) ||
|
|
|
|
usearch_getBreakIterator(strsrch) != breaker) {
|
|
|
|
log_err("Error setting break iterator\n");
|
|
|
|
if (strsrch != NULL) {
|
|
|
|
usearch_close(strsrch);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (!assertEqualWithUStringSearch(strsrch, *search)) {
|
|
|
|
ucol_setStrength(collator, UCOL_TERTIARY);
|
|
|
|
usearch_close(strsrch);
|
|
|
|
goto ENDTESTBREAKITERATOR;
|
|
|
|
}
|
2002-03-19 21:50:15 +00:00
|
|
|
search = &(BREAKITERATOREXACT[count + 1]);
|
2001-08-25 02:06:37 +00:00
|
|
|
breaker = getBreakIterator(search->breaker);
|
|
|
|
usearch_setBreakIterator(strsrch, breaker, &status);
|
|
|
|
if (U_FAILURE(status) ||
|
|
|
|
usearch_getBreakIterator(strsrch) != breaker) {
|
|
|
|
log_err("Error setting break iterator\n");
|
|
|
|
usearch_close(strsrch);
|
|
|
|
goto ENDTESTBREAKITERATOR;
|
|
|
|
}
|
|
|
|
usearch_reset(strsrch);
|
|
|
|
usearch_setAttribute(strsrch, USEARCH_CANONICAL_MATCH, USEARCH_ON,
|
|
|
|
&status);
|
|
|
|
if (!assertEqualWithUStringSearch(strsrch, *search)) {
|
|
|
|
log_err("Error at test number %d\n", count);
|
|
|
|
goto ENDTESTBREAKITERATOR;
|
|
|
|
}
|
|
|
|
usearch_close(strsrch);
|
|
|
|
count += 2;
|
|
|
|
}
|
|
|
|
count = 0;
|
|
|
|
while (BREAKITERATORCANONICAL[count].text != NULL) {
|
|
|
|
if (!assertEqual(BREAKITERATORCANONICAL[count])) {
|
|
|
|
log_err("Error at test number %d\n", count);
|
|
|
|
goto ENDTESTBREAKITERATOR;
|
|
|
|
}
|
|
|
|
count ++;
|
|
|
|
}
|
|
|
|
|
|
|
|
ENDTESTBREAKITERATOR:
|
|
|
|
close();
|
|
|
|
}
|
|
|
|
|
2002-03-28 18:26:25 +00:00
|
|
|
static void TestVariableCanonical(void)
|
2001-08-25 02:06:37 +00:00
|
|
|
{
|
|
|
|
int count = 0;
|
|
|
|
UErrorCode status = U_ZERO_ERROR;
|
|
|
|
open();
|
|
|
|
ucol_setAttribute(EN_US_, UCOL_ALTERNATE_HANDLING, UCOL_SHIFTED, &status);
|
|
|
|
if (U_FAILURE(status)) {
|
|
|
|
log_err("Error setting collation alternate attribute %s\n",
|
|
|
|
u_errorName(status));
|
|
|
|
}
|
|
|
|
while (VARIABLE[count].text != NULL) {
|
|
|
|
log_verbose("variable %d\n", count);
|
|
|
|
if (!assertCanonicalEqual(VARIABLE[count])) {
|
|
|
|
log_err("Error at test number %d\n", count);
|
|
|
|
}
|
|
|
|
count ++;
|
|
|
|
}
|
|
|
|
ucol_setAttribute(EN_US_, UCOL_ALTERNATE_HANDLING,
|
|
|
|
UCOL_NON_IGNORABLE, &status);
|
|
|
|
close();
|
|
|
|
}
|
|
|
|
|
2002-03-28 18:26:25 +00:00
|
|
|
static void TestOverlapCanonical(void)
|
2001-08-25 02:06:37 +00:00
|
|
|
{
|
|
|
|
int count = 0;
|
|
|
|
open();
|
|
|
|
while (OVERLAPCANONICAL[count].text != NULL) {
|
|
|
|
if (!assertEqualWithAttribute(OVERLAPCANONICAL[count], USEARCH_ON,
|
|
|
|
USEARCH_ON)) {
|
|
|
|
log_err("Error at overlap test number %d\n", count);
|
|
|
|
}
|
|
|
|
count ++;
|
|
|
|
}
|
|
|
|
count = 0;
|
|
|
|
while (NONOVERLAP[count].text != NULL) {
|
|
|
|
if (!assertCanonicalEqual(NONOVERLAPCANONICAL[count])) {
|
|
|
|
log_err("Error at non overlap test number %d\n", count);
|
|
|
|
}
|
|
|
|
count ++;
|
|
|
|
}
|
|
|
|
|
|
|
|
count = 0;
|
|
|
|
while (count < 1) {
|
|
|
|
UChar pattern[32];
|
|
|
|
UChar text[128];
|
|
|
|
const SearchData *search = &(OVERLAPCANONICAL[count]);
|
|
|
|
UCollator *collator = getCollator(search->collator);
|
|
|
|
UStringSearch *strsrch;
|
|
|
|
UErrorCode status = U_ZERO_ERROR;
|
|
|
|
|
|
|
|
u_unescape(search->text, text, 128);
|
|
|
|
u_unescape(search->pattern, pattern, 32);
|
|
|
|
strsrch = usearch_openFromCollator(pattern, -1, text, -1, collator,
|
|
|
|
NULL, &status);
|
|
|
|
usearch_setAttribute(strsrch, USEARCH_CANONICAL_MATCH, USEARCH_ON,
|
|
|
|
&status);
|
|
|
|
usearch_setAttribute(strsrch, USEARCH_OVERLAP, USEARCH_ON, &status);
|
|
|
|
if (U_FAILURE(status) ||
|
|
|
|
usearch_getAttribute(strsrch, USEARCH_OVERLAP) != USEARCH_ON) {
|
|
|
|
log_err("Error setting overlap option\n");
|
|
|
|
}
|
|
|
|
if (!assertEqualWithUStringSearch(strsrch, *search)) {
|
|
|
|
usearch_close(strsrch);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
search = &(NONOVERLAPCANONICAL[count]);
|
|
|
|
usearch_setAttribute(strsrch, USEARCH_OVERLAP, USEARCH_OFF, &status);
|
|
|
|
if (U_FAILURE(status) ||
|
|
|
|
usearch_getAttribute(strsrch, USEARCH_OVERLAP) != USEARCH_OFF) {
|
|
|
|
log_err("Error setting overlap option\n");
|
|
|
|
}
|
|
|
|
usearch_reset(strsrch);
|
|
|
|
if (!assertEqualWithUStringSearch(strsrch, *search)) {
|
|
|
|
usearch_close(strsrch);
|
|
|
|
log_err("Error at test number %d\n", count);
|
|
|
|
}
|
|
|
|
|
|
|
|
count ++;
|
|
|
|
usearch_close(strsrch);
|
|
|
|
}
|
|
|
|
close();
|
|
|
|
}
|
|
|
|
|
2002-03-28 18:26:25 +00:00
|
|
|
static void TestCollatorCanonical(void)
|
2001-08-25 02:06:37 +00:00
|
|
|
{
|
|
|
|
/* test collator that thinks "o" and "p" are the same thing */
|
|
|
|
UChar rules[32];
|
|
|
|
UCollator *tailored = NULL;
|
|
|
|
UErrorCode status = U_ZERO_ERROR;
|
|
|
|
UChar pattern[32];
|
|
|
|
UChar text[128];
|
|
|
|
UStringSearch *strsrch;
|
|
|
|
|
|
|
|
open();
|
|
|
|
u_unescape(COLLATORCANONICAL[0].text, text, 128);
|
|
|
|
u_unescape(COLLATORCANONICAL[0].pattern, pattern, 32);
|
|
|
|
|
|
|
|
strsrch = usearch_openFromCollator(pattern, -1, text, -1, EN_US_,
|
|
|
|
NULL, &status);
|
|
|
|
usearch_setAttribute(strsrch, USEARCH_CANONICAL_MATCH, USEARCH_ON,
|
|
|
|
&status);
|
|
|
|
if (U_FAILURE(status)) {
|
|
|
|
log_err("Error opening string search %s\n", u_errorName(status));
|
|
|
|
}
|
|
|
|
if (!assertEqualWithUStringSearch(strsrch, COLLATORCANONICAL[0])) {
|
|
|
|
goto ENDTESTCOLLATOR;
|
|
|
|
}
|
|
|
|
|
|
|
|
u_unescape(TESTCOLLATORRULE, rules, 32);
|
2001-09-22 01:11:55 +00:00
|
|
|
tailored = ucol_openRules(rules, -1, UCOL_ON,
|
2001-08-25 02:06:37 +00:00
|
|
|
COLLATORCANONICAL[1].strength, NULL, &status);
|
|
|
|
if (U_FAILURE(status)) {
|
|
|
|
log_err("Error opening rule based collator %s\n", u_errorName(status));
|
|
|
|
}
|
|
|
|
|
|
|
|
usearch_setCollator(strsrch, tailored, &status);
|
|
|
|
if (U_FAILURE(status) || usearch_getCollator(strsrch) != tailored) {
|
|
|
|
log_err("Error setting rule based collator\n");
|
|
|
|
}
|
|
|
|
usearch_reset(strsrch);
|
|
|
|
usearch_setAttribute(strsrch, USEARCH_CANONICAL_MATCH, USEARCH_ON,
|
|
|
|
&status);
|
|
|
|
if (!assertEqualWithUStringSearch(strsrch, COLLATORCANONICAL[1])) {
|
|
|
|
goto ENDTESTCOLLATOR;
|
|
|
|
}
|
|
|
|
|
|
|
|
usearch_setCollator(strsrch, EN_US_, &status);
|
|
|
|
usearch_reset(strsrch);
|
|
|
|
usearch_setAttribute(strsrch, USEARCH_CANONICAL_MATCH, USEARCH_ON,
|
|
|
|
&status);
|
|
|
|
if (U_FAILURE(status) || usearch_getCollator(strsrch) != EN_US_) {
|
|
|
|
log_err("Error setting rule based collator\n");
|
|
|
|
}
|
|
|
|
if (!assertEqualWithUStringSearch(strsrch, COLLATORCANONICAL[0])) {
|
|
|
|
goto ENDTESTCOLLATOR;
|
|
|
|
}
|
|
|
|
|
|
|
|
ENDTESTCOLLATOR:
|
|
|
|
usearch_close(strsrch);
|
|
|
|
if (tailored != NULL) {
|
|
|
|
ucol_close(tailored);
|
|
|
|
}
|
|
|
|
close();
|
|
|
|
}
|
|
|
|
|
2002-03-28 18:26:25 +00:00
|
|
|
static void TestPatternCanonical(void)
|
2001-08-25 02:06:37 +00:00
|
|
|
{
|
|
|
|
UStringSearch *strsrch;
|
|
|
|
UChar pattern[32];
|
|
|
|
UChar text[128];
|
|
|
|
const UChar *temp;
|
|
|
|
int32_t templength;
|
|
|
|
UErrorCode status = U_ZERO_ERROR;
|
|
|
|
|
|
|
|
open();
|
|
|
|
u_unescape(PATTERNCANONICAL[0].text, text, 128);
|
|
|
|
u_unescape(PATTERNCANONICAL[0].pattern, pattern, 32);
|
|
|
|
|
|
|
|
ucol_setStrength(EN_US_, PATTERNCANONICAL[0].strength);
|
|
|
|
strsrch = usearch_openFromCollator(pattern, -1, text, -1, EN_US_,
|
|
|
|
NULL, &status);
|
|
|
|
usearch_setAttribute(strsrch, USEARCH_CANONICAL_MATCH, USEARCH_ON,
|
|
|
|
&status);
|
|
|
|
if (U_FAILURE(status)) {
|
|
|
|
log_err("Error opening string search %s\n", u_errorName(status));
|
|
|
|
goto ENDTESTPATTERN;
|
|
|
|
}
|
|
|
|
temp = usearch_getPattern(strsrch, &templength);
|
|
|
|
if (u_strcmp(pattern, temp) != 0) {
|
|
|
|
log_err("Error setting pattern\n");
|
|
|
|
}
|
|
|
|
if (!assertEqualWithUStringSearch(strsrch, PATTERNCANONICAL[0])) {
|
|
|
|
goto ENDTESTPATTERN;
|
|
|
|
}
|
|
|
|
|
|
|
|
u_unescape(PATTERNCANONICAL[1].pattern, pattern, 32);
|
|
|
|
usearch_setPattern(strsrch, pattern, -1, &status);
|
|
|
|
temp = usearch_getPattern(strsrch, &templength);
|
|
|
|
if (u_strcmp(pattern, temp) != 0) {
|
|
|
|
log_err("Error setting pattern\n");
|
|
|
|
goto ENDTESTPATTERN;
|
|
|
|
}
|
|
|
|
usearch_reset(strsrch);
|
|
|
|
usearch_setAttribute(strsrch, USEARCH_CANONICAL_MATCH, USEARCH_ON,
|
|
|
|
&status);
|
|
|
|
if (U_FAILURE(status)) {
|
|
|
|
log_err("Error setting pattern %s\n", u_errorName(status));
|
|
|
|
}
|
|
|
|
if (!assertEqualWithUStringSearch(strsrch, PATTERNCANONICAL[1])) {
|
|
|
|
goto ENDTESTPATTERN;
|
|
|
|
}
|
|
|
|
|
|
|
|
u_unescape(PATTERNCANONICAL[0].pattern, pattern, 32);
|
|
|
|
usearch_setPattern(strsrch, pattern, -1, &status);
|
|
|
|
temp = usearch_getPattern(strsrch, &templength);
|
|
|
|
if (u_strcmp(pattern, temp) != 0) {
|
|
|
|
log_err("Error setting pattern\n");
|
|
|
|
goto ENDTESTPATTERN;
|
|
|
|
}
|
|
|
|
usearch_reset(strsrch);
|
|
|
|
usearch_setAttribute(strsrch, USEARCH_CANONICAL_MATCH, USEARCH_ON,
|
|
|
|
&status);
|
|
|
|
if (U_FAILURE(status)) {
|
|
|
|
log_err("Error setting pattern %s\n", u_errorName(status));
|
|
|
|
}
|
|
|
|
if (!assertEqualWithUStringSearch(strsrch, PATTERNCANONICAL[0])) {
|
|
|
|
goto ENDTESTPATTERN;
|
|
|
|
}
|
|
|
|
ENDTESTPATTERN:
|
|
|
|
ucol_setStrength(EN_US_, UCOL_TERTIARY);
|
|
|
|
if (strsrch != NULL) {
|
|
|
|
usearch_close(strsrch);
|
|
|
|
}
|
|
|
|
close();
|
|
|
|
}
|
|
|
|
|
2002-03-28 18:26:25 +00:00
|
|
|
static void TestTextCanonical(void)
|
2001-08-25 02:06:37 +00:00
|
|
|
{
|
|
|
|
UStringSearch *strsrch;
|
|
|
|
UChar pattern[32];
|
|
|
|
UChar text[128];
|
|
|
|
const UChar *temp;
|
|
|
|
int32_t templength;
|
|
|
|
UErrorCode status = U_ZERO_ERROR;
|
|
|
|
|
|
|
|
u_unescape(TEXTCANONICAL[0].text, text, 128);
|
|
|
|
u_unescape(TEXTCANONICAL[0].pattern, pattern, 32);
|
|
|
|
|
|
|
|
open();
|
|
|
|
strsrch = usearch_openFromCollator(pattern, -1, text, -1, EN_US_,
|
|
|
|
NULL, &status);
|
|
|
|
usearch_setAttribute(strsrch, USEARCH_CANONICAL_MATCH, USEARCH_ON,
|
|
|
|
&status);
|
|
|
|
|
|
|
|
if (U_FAILURE(status)) {
|
|
|
|
log_err("Error opening string search %s\n", u_errorName(status));
|
|
|
|
goto ENDTESTPATTERN;
|
|
|
|
}
|
|
|
|
temp = usearch_getText(strsrch, &templength);
|
|
|
|
if (u_strcmp(text, temp) != 0) {
|
|
|
|
log_err("Error setting text\n");
|
|
|
|
}
|
|
|
|
if (!assertEqualWithUStringSearch(strsrch, TEXTCANONICAL[0])) {
|
|
|
|
goto ENDTESTPATTERN;
|
|
|
|
}
|
|
|
|
|
|
|
|
u_unescape(TEXTCANONICAL[1].text, text, 32);
|
|
|
|
usearch_setText(strsrch, text, -1, &status);
|
|
|
|
temp = usearch_getText(strsrch, &templength);
|
|
|
|
if (u_strcmp(text, temp) != 0) {
|
|
|
|
log_err("Error setting text\n");
|
|
|
|
goto ENDTESTPATTERN;
|
|
|
|
}
|
|
|
|
if (U_FAILURE(status)) {
|
|
|
|
log_err("Error setting text %s\n", u_errorName(status));
|
|
|
|
}
|
|
|
|
if (!assertEqualWithUStringSearch(strsrch, TEXTCANONICAL[1])) {
|
|
|
|
goto ENDTESTPATTERN;
|
|
|
|
}
|
|
|
|
|
|
|
|
u_unescape(TEXTCANONICAL[0].text, text, 32);
|
|
|
|
usearch_setText(strsrch, text, -1, &status);
|
|
|
|
temp = usearch_getText(strsrch, &templength);
|
|
|
|
if (u_strcmp(text, temp) != 0) {
|
|
|
|
log_err("Error setting text\n");
|
|
|
|
goto ENDTESTPATTERN;
|
|
|
|
}
|
|
|
|
if (U_FAILURE(status)) {
|
|
|
|
log_err("Error setting pattern %s\n", u_errorName(status));
|
|
|
|
}
|
|
|
|
if (!assertEqualWithUStringSearch(strsrch, TEXTCANONICAL[0])) {
|
|
|
|
goto ENDTESTPATTERN;
|
|
|
|
}
|
|
|
|
ENDTESTPATTERN:
|
|
|
|
if (strsrch != NULL) {
|
|
|
|
usearch_close(strsrch);
|
|
|
|
}
|
|
|
|
close();
|
|
|
|
}
|
|
|
|
|
2002-03-28 18:26:25 +00:00
|
|
|
static void TestCompositeBoundariesCanonical(void)
|
2001-08-25 02:06:37 +00:00
|
|
|
{
|
|
|
|
int count = 0;
|
|
|
|
open();
|
|
|
|
while (COMPOSITEBOUNDARIESCANONICAL[count].text != NULL) {
|
|
|
|
log_verbose("composite %d\n", count);
|
|
|
|
if (!assertCanonicalEqual(COMPOSITEBOUNDARIESCANONICAL[count])) {
|
|
|
|
log_err("Error at test number %d\n", count);
|
|
|
|
}
|
|
|
|
count ++;
|
|
|
|
}
|
|
|
|
close();
|
|
|
|
}
|
|
|
|
|
2002-03-28 18:26:25 +00:00
|
|
|
static void TestGetSetOffsetCanonical(void)
|
2001-08-25 02:06:37 +00:00
|
|
|
{
|
|
|
|
int index = 0;
|
|
|
|
UChar pattern[32];
|
|
|
|
UChar text[128];
|
|
|
|
UErrorCode status = U_ZERO_ERROR;
|
|
|
|
UStringSearch *strsrch;
|
|
|
|
|
|
|
|
open();
|
|
|
|
strsrch = usearch_openFromCollator(pattern, 16, text, 32, EN_US_, NULL,
|
|
|
|
&status);
|
|
|
|
usearch_setAttribute(strsrch, USEARCH_CANONICAL_MATCH, USEARCH_ON,
|
|
|
|
&status);
|
|
|
|
/* testing out of bounds error */
|
|
|
|
usearch_setOffset(strsrch, -1, &status);
|
|
|
|
if (U_SUCCESS(status)) {
|
|
|
|
log_err("Error expecting set offset error\n");
|
|
|
|
}
|
|
|
|
usearch_setOffset(strsrch, 128, &status);
|
|
|
|
if (U_SUCCESS(status)) {
|
|
|
|
log_err("Error expecting set offset error\n");
|
|
|
|
}
|
|
|
|
while (BASICCANONICAL[index].text != NULL) {
|
|
|
|
int count = 0;
|
|
|
|
SearchData search = BASICCANONICAL[index ++];
|
2002-03-12 01:32:42 +00:00
|
|
|
int32_t matchindex = search.offset[count];
|
2001-08-25 02:06:37 +00:00
|
|
|
int32_t textlength;
|
|
|
|
|
|
|
|
if (BASICCANONICAL[index].text == NULL) {
|
|
|
|
/* skip the last one */
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
u_unescape(search.text, text, 128);
|
|
|
|
u_unescape(search.pattern, pattern, 32);
|
|
|
|
status = U_ZERO_ERROR;
|
|
|
|
usearch_setText(strsrch, text, -1, &status);
|
|
|
|
usearch_setPattern(strsrch, pattern, -1, &status);
|
|
|
|
while (U_SUCCESS(status) && matchindex >= 0) {
|
|
|
|
uint32_t matchlength = search.size[count];
|
|
|
|
usearch_next(strsrch, &status);
|
|
|
|
if (matchindex != usearch_getMatchedStart(strsrch) ||
|
|
|
|
matchlength != (uint32_t)usearch_getMatchedLength(strsrch)) {
|
|
|
|
char *str = toCharString(usearch_getText(strsrch,
|
|
|
|
&textlength));
|
|
|
|
log_err("Text: %s\n", str);
|
|
|
|
str = toCharString(usearch_getPattern(strsrch, &textlength));
|
|
|
|
log_err("Pattern: %s\n", str);
|
|
|
|
log_err("Error match found at %d %d\n",
|
|
|
|
usearch_getMatchedStart(strsrch),
|
|
|
|
usearch_getMatchedLength(strsrch));
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
matchindex = search.offset[count + 1] == -1 ? -1 :
|
|
|
|
search.offset[count + 2];
|
|
|
|
if (search.offset[count + 1] != -1) {
|
|
|
|
usearch_setOffset(strsrch, search.offset[count + 1] + 1,
|
|
|
|
&status);
|
|
|
|
if (usearch_getOffset(strsrch) != search.offset[count + 1] + 1) {
|
|
|
|
log_err("Error setting offset\n");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
count += 2;
|
|
|
|
}
|
|
|
|
usearch_next(strsrch, &status);
|
|
|
|
if ((uint32_t)usearch_getMatchedStart(strsrch) != USEARCH_DONE) {
|
|
|
|
char *str = toCharString(usearch_getText(strsrch, &textlength));
|
|
|
|
log_err("Text: %s\n", str);
|
|
|
|
str = toCharString(usearch_getPattern(strsrch, &textlength));
|
|
|
|
log_err("Pattern: %s\n", str);
|
|
|
|
log_err("Error match found at %d %d\n",
|
|
|
|
usearch_getMatchedStart(strsrch),
|
|
|
|
usearch_getMatchedLength(strsrch));
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
usearch_close(strsrch);
|
|
|
|
close();
|
|
|
|
}
|
|
|
|
|
2002-03-28 18:26:25 +00:00
|
|
|
static void TestSupplementaryCanonical(void)
|
2001-08-25 02:06:37 +00:00
|
|
|
{
|
|
|
|
int count = 0;
|
|
|
|
open();
|
|
|
|
while (SUPPLEMENTARYCANONICAL[count].text != NULL) {
|
|
|
|
if (!assertCanonicalEqual(SUPPLEMENTARYCANONICAL[count])) {
|
|
|
|
log_err("Error at test number %d\n", count);
|
|
|
|
}
|
|
|
|
count ++;
|
|
|
|
}
|
|
|
|
close();
|
|
|
|
}
|
|
|
|
|
2002-03-28 18:26:25 +00:00
|
|
|
static void TestContractionCanonical(void)
|
2001-08-25 02:06:37 +00:00
|
|
|
{
|
|
|
|
UChar rules[128];
|
|
|
|
UChar pattern[128];
|
|
|
|
UChar text[128];
|
|
|
|
UCollator *collator;
|
|
|
|
UErrorCode status = U_ZERO_ERROR;
|
|
|
|
int count = 0;
|
|
|
|
UStringSearch *strsrch;
|
|
|
|
|
|
|
|
u_unescape(CONTRACTIONRULE, rules, 128);
|
2001-09-22 01:11:55 +00:00
|
|
|
collator = ucol_openRules(rules, u_strlen(rules), UCOL_ON,
|
2001-08-25 02:06:37 +00:00
|
|
|
UCOL_TERTIARY, NULL, &status);
|
|
|
|
if (U_FAILURE(status)) {
|
|
|
|
log_err("Error opening collator %s\n", u_errorName(status));
|
|
|
|
}
|
|
|
|
strsrch = usearch_openFromCollator(pattern, 1, text, 1, collator, NULL,
|
|
|
|
&status);
|
|
|
|
usearch_setAttribute(strsrch, USEARCH_CANONICAL_MATCH, USEARCH_ON,
|
|
|
|
&status);
|
|
|
|
if (U_FAILURE(status)) {
|
|
|
|
log_err("Error opening string search %s\n", u_errorName(status));
|
|
|
|
}
|
2001-09-07 21:57:32 +00:00
|
|
|
|
2001-08-25 02:06:37 +00:00
|
|
|
while (CONTRACTIONCANONICAL[count].text != NULL) {
|
|
|
|
u_unescape(CONTRACTIONCANONICAL[count].text, text, 128);
|
|
|
|
u_unescape(CONTRACTIONCANONICAL[count].pattern, pattern, 128);
|
|
|
|
usearch_setText(strsrch, text, -1, &status);
|
|
|
|
usearch_setPattern(strsrch, pattern, -1, &status);
|
|
|
|
if (!assertEqualWithUStringSearch(strsrch,
|
|
|
|
CONTRACTIONCANONICAL[count])) {
|
|
|
|
log_err("Error at test number %d\n", count);
|
|
|
|
}
|
|
|
|
count ++;
|
|
|
|
}
|
|
|
|
usearch_close(strsrch);
|
|
|
|
ucol_close(collator);
|
|
|
|
}
|
|
|
|
|
|
|
|
void addSearchTest(TestNode** root)
|
|
|
|
{
|
|
|
|
addTest(root, &TestStart, "tscoll/usrchtst/TestStart");
|
|
|
|
addTest(root, &TestOpenClose, "tscoll/usrchtst/TestOpenClose");
|
|
|
|
addTest(root, &TestInitialization, "tscoll/usrchtst/TestInitialization");
|
|
|
|
addTest(root, &TestBasic, "tscoll/usrchtst/TestBasic");
|
|
|
|
addTest(root, &TestNormExact, "tscoll/usrchtst/TestNormExact");
|
|
|
|
addTest(root, &TestStrength, "tscoll/usrchtst/TestStrength");
|
|
|
|
addTest(root, &TestBreakIterator, "tscoll/usrchtst/TestBreakIterator");
|
|
|
|
addTest(root, &TestVariable, "tscoll/usrchtst/TestVariable");
|
|
|
|
addTest(root, &TestOverlap, "tscoll/usrchtst/TestOverlap");
|
|
|
|
addTest(root, &TestCollator, "tscoll/usrchtst/TestCollator");
|
|
|
|
addTest(root, &TestPattern, "tscoll/usrchtst/TestPattern");
|
|
|
|
addTest(root, &TestText, "tscoll/usrchtst/TestText");
|
|
|
|
addTest(root, &TestCompositeBoundaries,
|
|
|
|
"tscoll/usrchtst/TestCompositeBoundaries");
|
|
|
|
addTest(root, &TestGetSetOffset, "tscoll/usrchtst/TestGetSetOffset");
|
|
|
|
addTest(root, &TestGetSetAttribute,
|
|
|
|
"tscoll/usrchtst/TestGetSetAttribute");
|
|
|
|
addTest(root, &TestGetMatch, "tscoll/usrchtst/TestGetMatch");
|
|
|
|
addTest(root, &TestSetMatch, "tscoll/usrchtst/TestSetMatch");
|
|
|
|
addTest(root, &TestReset, "tscoll/usrchtst/TestReset");
|
|
|
|
addTest(root, &TestSupplementary, "tscoll/usrchtst/TestSupplementary");
|
|
|
|
addTest(root, &TestContraction, "tscoll/usrchtst/TestContraction");
|
|
|
|
addTest(root, &TestIgnorable, "tscoll/usrchtst/TestIgnorable");
|
|
|
|
addTest(root, &TestCanonical, "tscoll/usrchtst/TestCanonical");
|
|
|
|
addTest(root, &TestNormCanonical, "tscoll/usrchtst/TestNormCanonical");
|
|
|
|
addTest(root, &TestStrengthCanonical,
|
|
|
|
"tscoll/usrchtst/TestStrengthCanonical");
|
|
|
|
addTest(root, &TestBreakIteratorCanonical,
|
|
|
|
"tscoll/usrchtst/TestBreakIteratorCanonical");
|
|
|
|
addTest(root, &TestVariableCanonical,
|
|
|
|
"tscoll/usrchtst/TestVariableCanonical");
|
|
|
|
addTest(root, &TestOverlapCanonical,
|
|
|
|
"tscoll/usrchtst/TestOverlapCanonical");
|
|
|
|
addTest(root, &TestCollatorCanonical,
|
|
|
|
"tscoll/usrchtst/TestCollatorCanonical");
|
|
|
|
addTest(root, &TestPatternCanonical,
|
|
|
|
"tscoll/usrchtst/TestPatternCanonical");
|
|
|
|
addTest(root, &TestTextCanonical, "tscoll/usrchtst/TestTextCanonical");
|
|
|
|
addTest(root, &TestCompositeBoundariesCanonical,
|
|
|
|
"tscoll/usrchtst/TestCompositeBoundariesCanonical");
|
|
|
|
addTest(root, &TestGetSetOffsetCanonical,
|
|
|
|
"tscoll/usrchtst/TestGetSetOffsetCanonical");
|
|
|
|
addTest(root, &TestSupplementaryCanonical,
|
|
|
|
"tscoll/usrchtst/TestSupplementaryCanonical");
|
|
|
|
addTest(root, &TestContractionCanonical,
|
|
|
|
"tscoll/usrchtst/TestContractionCanonical");
|
|
|
|
addTest(root, &TestEnd, "tscoll/usrchtst/TestEnd");
|
|
|
|
}
|
|
|
|
|