|
sl@0
|
1 |
// Copyright (c) 1998-2009 Nokia Corporation and/or its subsidiary(-ies).
|
|
sl@0
|
2 |
// All rights reserved.
|
|
sl@0
|
3 |
// This component and the accompanying materials are made available
|
|
sl@0
|
4 |
// under the terms of "Eclipse Public License v1.0"
|
|
sl@0
|
5 |
// which accompanies this distribution, and is available
|
|
sl@0
|
6 |
// at the URL "http://www.eclipse.org/legal/epl-v10.html".
|
|
sl@0
|
7 |
//
|
|
sl@0
|
8 |
// Initial Contributors:
|
|
sl@0
|
9 |
// Nokia Corporation - initial contribution.
|
|
sl@0
|
10 |
//
|
|
sl@0
|
11 |
// Contributors:
|
|
sl@0
|
12 |
//
|
|
sl@0
|
13 |
// Description:
|
|
sl@0
|
14 |
//
|
|
sl@0
|
15 |
|
|
sl@0
|
16 |
#include "UD_STD.H"
|
|
sl@0
|
17 |
|
|
sl@0
|
18 |
EXPORT_C TInt TTextOps::Compare(const TDesC8& aLeft,const TDesC8& aRight) const
|
|
sl@0
|
19 |
{
|
|
sl@0
|
20 |
return Compare(aLeft.Ptr(),aLeft.Length(),aRight.Ptr(),aRight.Length());
|
|
sl@0
|
21 |
}
|
|
sl@0
|
22 |
|
|
sl@0
|
23 |
EXPORT_C TInt TTextOps::Match(const TText8* aPtr,TInt aLen,const TText8* aPatternPtr,TInt aPatternLen) const
|
|
sl@0
|
24 |
{
|
|
sl@0
|
25 |
return Match(TPtrC8(aPtr,aLen),TPtrC8(aPatternPtr,aPatternLen));
|
|
sl@0
|
26 |
}
|
|
sl@0
|
27 |
|
|
sl@0
|
28 |
EXPORT_C TInt TTextOps::Find(const TDesC8& aDes,const TDesC8& aSub) const
|
|
sl@0
|
29 |
{
|
|
sl@0
|
30 |
return iFind8(aDes,aSub.Ptr(),aSub.Length());
|
|
sl@0
|
31 |
}
|
|
sl@0
|
32 |
|
|
sl@0
|
33 |
EXPORT_C TInt TTextOps::Find(const TText8* aPtr,TInt aLen,const TText8* aSubPtr,TInt aSubLen) const
|
|
sl@0
|
34 |
{
|
|
sl@0
|
35 |
return iFind8(TPtrC8(aPtr,aLen),aSubPtr,aSubLen);
|
|
sl@0
|
36 |
}
|
|
sl@0
|
37 |
|
|
sl@0
|
38 |
EXPORT_C TInt TTextOps::Compare(const TDesC16& aLeft,const TDesC16& aRight) const
|
|
sl@0
|
39 |
{
|
|
sl@0
|
40 |
return Compare(aLeft.Ptr(),aLeft.Length(),aRight.Ptr(),aRight.Length());
|
|
sl@0
|
41 |
}
|
|
sl@0
|
42 |
|
|
sl@0
|
43 |
EXPORT_C TInt TTextOps::Match(const TText16* aPtr,TInt aLen,const TText16* aPatternPtr,TInt aPatternLen) const
|
|
sl@0
|
44 |
{
|
|
sl@0
|
45 |
return Match(TPtrC16(aPtr,aLen),TPtrC16(aPatternPtr,aPatternLen));
|
|
sl@0
|
46 |
}
|
|
sl@0
|
47 |
|
|
sl@0
|
48 |
EXPORT_C TInt TTextOps::Find(const TDesC16& aDes,const TDesC16& aSub) const
|
|
sl@0
|
49 |
{
|
|
sl@0
|
50 |
return iFind16(aDes,aSub.Ptr(),aSub.Length());
|
|
sl@0
|
51 |
}
|
|
sl@0
|
52 |
|
|
sl@0
|
53 |
EXPORT_C TInt TTextOps::Find(const TText16* aPtr,TInt aLen,const TText16* aSubPtr,TInt aSubLen) const
|
|
sl@0
|
54 |
{
|
|
sl@0
|
55 |
return iFind16(TPtrC16(aPtr,aLen),aSubPtr,aSubLen);
|
|
sl@0
|
56 |
}
|
|
sl@0
|
57 |
|
|
sl@0
|
58 |
/**
|
|
sl@0
|
59 |
The method compares aLeft and aRight unicode strings.
|
|
sl@0
|
60 |
Collation level 3 will be used.
|
|
sl@0
|
61 |
@param aLeft Left string to compare.
|
|
sl@0
|
62 |
@param aRight Right string to compare.
|
|
sl@0
|
63 |
This method is used by sorting algorithms when the key field is a unciode string.
|
|
sl@0
|
64 |
@return Positive. if aLeft is greater than aRight.
|
|
sl@0
|
65 |
Negative. if aLeft is less than aRight.
|
|
sl@0
|
66 |
Zero, if aLeft is equal to aRight.
|
|
sl@0
|
67 |
*/
|
|
sl@0
|
68 |
TInt TTextOps::Order(const TDesC16& aLeft, const TDesC16& aRight) const
|
|
sl@0
|
69 |
{
|
|
sl@0
|
70 |
return Order(aLeft.Ptr(), aLeft.Length(), aRight.Ptr(), aRight.Length());
|
|
sl@0
|
71 |
}
|
|
sl@0
|
72 |
|
|
sl@0
|
73 |
LOCAL_C TUint DoFold(TUint aChar)
|
|
sl@0
|
74 |
{
|
|
sl@0
|
75 |
return aChar;
|
|
sl@0
|
76 |
}
|
|
sl@0
|
77 |
|
|
sl@0
|
78 |
LOCAL_C TInt DoMatch(const TDesC8& aDes,const TDesC8& aPattern)
|
|
sl@0
|
79 |
{
|
|
sl@0
|
80 |
return aDes.Match(aPattern);
|
|
sl@0
|
81 |
}
|
|
sl@0
|
82 |
|
|
sl@0
|
83 |
LOCAL_C TInt DoMatchF(const TDesC8& aDes,const TDesC8& aPattern)
|
|
sl@0
|
84 |
{
|
|
sl@0
|
85 |
return aDes.MatchF(aPattern);
|
|
sl@0
|
86 |
}
|
|
sl@0
|
87 |
|
|
sl@0
|
88 |
LOCAL_C TInt DoMatchC(const TDesC8& aDes,const TDesC8& aPattern)
|
|
sl@0
|
89 |
{
|
|
sl@0
|
90 |
return aDes.MatchC(aPattern);
|
|
sl@0
|
91 |
}
|
|
sl@0
|
92 |
|
|
sl@0
|
93 |
LOCAL_C TInt DoFind(const TDesC8& aDes,const TText8* aSubPtr,TInt aSubLen)
|
|
sl@0
|
94 |
{
|
|
sl@0
|
95 |
return aDes.Find(aSubPtr,aSubLen);
|
|
sl@0
|
96 |
}
|
|
sl@0
|
97 |
|
|
sl@0
|
98 |
LOCAL_C TInt DoFindF(const TDesC8& aDes,const TText8* aSubPtr,TInt aSubLen)
|
|
sl@0
|
99 |
{
|
|
sl@0
|
100 |
return aDes.FindF(aSubPtr,aSubLen);
|
|
sl@0
|
101 |
}
|
|
sl@0
|
102 |
|
|
sl@0
|
103 |
LOCAL_C TInt DoFindC(const TDesC8& aDes,const TText8* aSubPtr,TInt aSubLen)
|
|
sl@0
|
104 |
{
|
|
sl@0
|
105 |
return aDes.FindC(aSubPtr,aSubLen);
|
|
sl@0
|
106 |
}
|
|
sl@0
|
107 |
|
|
sl@0
|
108 |
LOCAL_C TInt DoMatch(const TDesC16& aDes,const TDesC16& aPattern)
|
|
sl@0
|
109 |
{
|
|
sl@0
|
110 |
return aDes.Match(aPattern);
|
|
sl@0
|
111 |
}
|
|
sl@0
|
112 |
|
|
sl@0
|
113 |
LOCAL_C TInt DoMatchF(const TDesC16& aDes,const TDesC16& aPattern)
|
|
sl@0
|
114 |
{
|
|
sl@0
|
115 |
return aDes.MatchF(aPattern);
|
|
sl@0
|
116 |
}
|
|
sl@0
|
117 |
|
|
sl@0
|
118 |
LOCAL_C TInt DoMatchC(const TDesC16& aDes,const TDesC16& aPattern)
|
|
sl@0
|
119 |
{
|
|
sl@0
|
120 |
return aDes.MatchC(aPattern);
|
|
sl@0
|
121 |
}
|
|
sl@0
|
122 |
|
|
sl@0
|
123 |
LOCAL_C TInt DoFind(const TDesC16& aDes,const TText16* aSubPtr,TInt aSubLen)
|
|
sl@0
|
124 |
{
|
|
sl@0
|
125 |
return aDes.Find(aSubPtr,aSubLen);
|
|
sl@0
|
126 |
}
|
|
sl@0
|
127 |
|
|
sl@0
|
128 |
LOCAL_C TInt DoFindF(const TDesC16& aDes,const TText16* aSubPtr,TInt aSubLen)
|
|
sl@0
|
129 |
{
|
|
sl@0
|
130 |
return aDes.FindF(aSubPtr,aSubLen);
|
|
sl@0
|
131 |
}
|
|
sl@0
|
132 |
|
|
sl@0
|
133 |
LOCAL_C TInt DoFindC(const TDesC16& aDes,const TText16* aSubPtr,TInt aSubLen)
|
|
sl@0
|
134 |
{
|
|
sl@0
|
135 |
return aDes.FindC(aSubPtr,aSubLen,0);
|
|
sl@0
|
136 |
}
|
|
sl@0
|
137 |
|
|
sl@0
|
138 |
LOCAL_C TInt DoCompareC(const TText16* aLeftPtr,TInt aLeftLen,const TText16* aRightPtr,TInt aRightLen)
|
|
sl@0
|
139 |
{
|
|
sl@0
|
140 |
return Mem::CompareC(aLeftPtr,aLeftLen,aRightPtr,aRightLen,0,NULL);
|
|
sl@0
|
141 |
}
|
|
sl@0
|
142 |
|
|
sl@0
|
143 |
/**
|
|
sl@0
|
144 |
The method compares aLeftPtr and aRightPtr unicode strings.
|
|
sl@0
|
145 |
Collation level 3 will be used.
|
|
sl@0
|
146 |
@param aLeftPtr Left string to compare.
|
|
sl@0
|
147 |
@param aLeftLen The length of left string.
|
|
sl@0
|
148 |
@param aRightPtr Right string to compare.
|
|
sl@0
|
149 |
@param aRightLen The length of right string.
|
|
sl@0
|
150 |
This method is used by sorting algorithms when the key field is a unciode string.
|
|
sl@0
|
151 |
@return Positive. if aLeftPtr is greater than aRightPtr.
|
|
sl@0
|
152 |
Negative. if aLeftPtr is less than aRightPtr.
|
|
sl@0
|
153 |
Zero, if aLeftPtr is equal to aRightPtr.
|
|
sl@0
|
154 |
*/
|
|
sl@0
|
155 |
LOCAL_C TInt DoOrderC(const TText16* aLeftPtr, TInt aLeftLen, const TText16* aRightPtr, TInt aRightLen)
|
|
sl@0
|
156 |
{
|
|
sl@0
|
157 |
return Mem::CompareC(aLeftPtr, aLeftLen, aRightPtr, aRightLen);
|
|
sl@0
|
158 |
}
|
|
sl@0
|
159 |
|
|
sl@0
|
160 |
LOCAL_D TTextOps const OpTable[3]=
|
|
sl@0
|
161 |
{
|
|
sl@0
|
162 |
//iFold iCompare8 iMatch8 iFind8 iCompare16 iMatch16 iFind16 iOrder16
|
|
sl@0
|
163 |
{&DoFold, &Mem::Compare, &DoMatch, &DoFind, &Mem::Compare, &DoMatch, &DoFind, &Mem::Compare}, //EDbCompareNormal
|
|
sl@0
|
164 |
{&User::Fold, &Mem::CompareF,&DoMatchF,&DoFindF,&Mem::CompareF,&DoMatchF,&DoFindF,&Mem::CompareF},//EDbCompareFolded
|
|
sl@0
|
165 |
{&User::Collate,&Mem::CompareC,&DoMatchC,&DoFindC,&DoCompareC, &DoMatchC,&DoFindC,&DoOrderC} //EDbCompareCollated
|
|
sl@0
|
166 |
};
|
|
sl@0
|
167 |
|
|
sl@0
|
168 |
EXPORT_C const TTextOps& TTextOps::Ops(TDbTextComparison aType)
|
|
sl@0
|
169 |
{
|
|
sl@0
|
170 |
return OpTable[aType];
|
|
sl@0
|
171 |
}
|