blob: b2df5ae6ad5d8737c6ae7e97e567ffe445120b7c (
plain) (
blame)
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
|
#include "unimdm.h"
#include <stdio.h>
#include "mt.h"
extern CHAR **rgpszResp;
#define SIMPLE 0
#define COMPLEX 1
#define ACTUAL 2
//#define TEST_TYPE (SIMPLE)
#define TEST_TYPE (COMPLEX)
//#define TEST_TYPE (ACTUAL)
extern CHAR *rgpszSimpleResp[];
extern CHAR *rgpszComplexResp[];
extern CHAR *rgpszActualResp[];
#if (TEST_TYPE==SIMPLE)
# define TEST_RESP_ARRAY rgpszSimpleResp
#elif (TEST_TYPE==COMPLEX)
# define TEST_RESP_ARRAY rgpszComplexResp
#elif (TEST_TYPE==ACTUAL)
# define TEST_RESP_ARRAY rgpszActualResp
#endif
CHAR **rgpszResp = TEST_RESP_ARRAY;
main()
{
HMATCHTREE hmt = 0;
DWORD dwRet = 0;
CHAR **ppsz;
CHAR *pszResp;
PMATCHREC rgmr=NULL,pmr = NULL;
DWORD dwcmr=0;
// count number of records
for (ppsz=rgpszResp;*ppsz;ppsz++)
{
dwcmr++;
}
printf("Number of records: %lu\n", (unsigned long) dwcmr);
// Allocate space and initialize the mr records.
rgmr = LocalAlloc(LPTR, dwcmr*sizeof(MATCHREC));
for (pmr=rgmr, ppsz=rgpszResp;pmr<(rgmr+dwcmr);pmr++,ppsz++)
{
pmr->dwLen = lstrlen(*ppsz);
pmr->pb = *ppsz;
pmr->pv = *ppsz;
}
hmt = mtCreateTree(rgmr, dwcmr);
// Free the mr array...
LocalFree(rgmr); pmr=rgmr=NULL;
mtDumpTree(hmt);
for (ppsz=rgpszResp; *ppsz; ppsz++)
{
MATCHREC mr;
mr.dwLen = lstrlen(*ppsz);
mr.pb = *ppsz;
mr.pv=(PVOID) "";
dwRet = mtFindMatch(hmt, &mr);
pszResp = (CHAR *) mr.pv;
printf("mtFindMatch([%s]) returns [%s] (0x%lx)\n", *ppsz, pszResp, (unsigned long) dwRet);
if (_stricmp(*ppsz, pszResp)) printf("+++ERROR: String not found!\n");
if (!(dwRet&fMATCH_COMPLETE)) printf("+++ERROR: Match not complete\n");
if (dwRet&fMATCH_PARTIAL) printf("+++WARNING: Match partial\n");
}
mtFreeTree(hmt);
return 0;
}
|
