|
sl@0
|
1 |
/*
|
|
sl@0
|
2 |
* Copyright (c) 2002 Nokia Corporation and/or its subsidiary(-ies).
|
|
sl@0
|
3 |
* All rights reserved.
|
|
sl@0
|
4 |
* This component and the accompanying materials are made available
|
|
sl@0
|
5 |
* under the terms of the License "Eclipse Public License v1.0"
|
|
sl@0
|
6 |
* which accompanies this distribution, and is available
|
|
sl@0
|
7 |
* at the URL "http://www.eclipse.org/legal/epl-v10.html".
|
|
sl@0
|
8 |
*
|
|
sl@0
|
9 |
* Initial Contributors:
|
|
sl@0
|
10 |
* Nokia Corporation - initial contribution.
|
|
sl@0
|
11 |
*
|
|
sl@0
|
12 |
* Contributors:
|
|
sl@0
|
13 |
*
|
|
sl@0
|
14 |
* Description:
|
|
sl@0
|
15 |
*
|
|
sl@0
|
16 |
*
|
|
sl@0
|
17 |
*/
|
|
sl@0
|
18 |
|
|
sl@0
|
19 |
|
|
sl@0
|
20 |
|
|
sl@0
|
21 |
#ifndef C_STATE_MACHINE_H
|
|
sl@0
|
22 |
#define C_STATE_MACHINE_H
|
|
sl@0
|
23 |
|
|
sl@0
|
24 |
#include "NumberGroupingStd.h"
|
|
sl@0
|
25 |
|
|
sl@0
|
26 |
NONSHARABLE_CLASS(CStateMachine) : public CBase
|
|
sl@0
|
27 |
{
|
|
sl@0
|
28 |
public:
|
|
sl@0
|
29 |
static CStateMachine* NewL(TInt aMaxNumberChars, TInt aMaxNumberStates);
|
|
sl@0
|
30 |
static CStateMachine* NewLC(TInt aMaxNumberChars, TInt aMaxNumberStates);
|
|
sl@0
|
31 |
|
|
sl@0
|
32 |
virtual ~CStateMachine();
|
|
sl@0
|
33 |
|
|
sl@0
|
34 |
void AddStateTransistionL(TChar aChar, TInt aState, TInt aNextState);
|
|
sl@0
|
35 |
void AddStateTransistionL(TInt aDigit, TInt aState, TInt aNextState);
|
|
sl@0
|
36 |
|
|
sl@0
|
37 |
TBool Matches(const TDesC& aString);
|
|
sl@0
|
38 |
|
|
sl@0
|
39 |
/**
|
|
sl@0
|
40 |
* This routine writes into a client supplied descriptor a string that is a wildcard version
|
|
sl@0
|
41 |
* of the pattern match for this state machine. It writes characters into the supplied descriptor
|
|
sl@0
|
42 |
* to a length of the maximum number of characters to match.
|
|
sl@0
|
43 |
* For each character index, if there is only one possible valid character, it puts in that
|
|
sl@0
|
44 |
* character. If there are more than one, then the supplied aWildcardChar is written in.
|
|
sl@0
|
45 |
* The character '.' in the state machine is not treated as a single character, but as a range,
|
|
sl@0
|
46 |
* and so the wildcard character is written in for the '.'.
|
|
sl@0
|
47 |
*
|
|
sl@0
|
48 |
* aWildcardPattern must have MaxLength which is equal or greater than iMaxNumberStates
|
|
sl@0
|
49 |
*
|
|
sl@0
|
50 |
* @param aWildcardChar The character to put in aExamplePattern if there is no single
|
|
sl@0
|
51 |
* valid character at that point
|
|
sl@0
|
52 |
* @param aWildcardedPattern Descriptor to write the wildcarded number pattern into
|
|
sl@0
|
53 |
*/
|
|
sl@0
|
54 |
void GetWildcardVersionOfPattern(
|
|
sl@0
|
55 |
TText aWildcardChar,
|
|
sl@0
|
56 |
TDes& aWildcardedPattern ) const;
|
|
sl@0
|
57 |
|
|
sl@0
|
58 |
private:
|
|
sl@0
|
59 |
CStateMachine(TInt aMaxNumberChars, TInt aMaxNumberStates);
|
|
sl@0
|
60 |
|
|
sl@0
|
61 |
void ConstructL();
|
|
sl@0
|
62 |
virtual TInt MapIndex(TChar aChar, RArray<TInt>& aIndices);
|
|
sl@0
|
63 |
|
|
sl@0
|
64 |
TInt** iStateTable;
|
|
sl@0
|
65 |
TInt iMaxNumberChars;
|
|
sl@0
|
66 |
TInt iMaxNumberStates;
|
|
sl@0
|
67 |
};
|
|
sl@0
|
68 |
|
|
sl@0
|
69 |
#endif // C_STATE_MACHINE_H
|
|
sl@0
|
70 |
// End of File
|