blob: d4a730e265bac9d7678559aad28b27e8a35a2c0f (
plain)
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
|
/**********************************************************************
** Copyright (C) 2000 Trolltech AS. All rights reserved.
**
** This file is part of Qtopia Environment.
**
** This file may be distributed and/or modified under the terms of the
** GNU General Public License version 2 as published by the Free Software
** Foundation and appearing in the file LICENSE.GPL included in the
** packaging of this file.
**
** This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
** WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
**
** See http://www.trolltech.com/gpl/ for GPL licensing information.
**
** Contact info@trolltech.com if any conditions of this licensing are
** not clear to you.
**
**********************************************************************/
#ifndef _QIMPENMATCH_H_
#define _QIMPENMATCH_H_
#include "qimpenchar.h"
#include <qpe/qdawg.h>
#include <qlist.h>
class QTimer;
class QIMPenWidget;
class QIMPenSetup;
class QIMPenWordPick;
class QIMPenMatch : public QObject
{
Q_OBJECT
public:
QIMPenMatch( QObject *parent=0, const char *name=0 );
virtual ~QIMPenMatch();
void resetState();
void backspace();
void setMultiStrokeTimeout( int t ) { multiTimeout = t; }
const QString &word() const { return wordEntered; }
void setWordMatchingEnabled( bool e ) { doWordMatching = e; }
bool isWordMatchingEnabled() const { return doWordMatching; }
struct MatchWord {
MatchWord( const QString &w, int e ) { word = w; error = e; }
QString word;
int error;
};
class MatchWordList : public QList<MatchWord>
{
public:
int compareItems( QCollection::Item item1, QCollection::Item item2 ) {
MatchWord *m1 = (MatchWord *)item1;
MatchWord *m2 = (MatchWord *)item2;
return m1->error - m2->error;
}
};
public slots:
void setCharSet( QIMPenCharSet * );
void beginStroke();
void strokeEntered( QIMPenStroke *st );
signals:
void erase();
void noMatch();
void removeStroke();
void keypress( uint ch );
void matchedCharacters( const QIMPenCharMatchList & );
void matchedWords( const QIMPenMatch::MatchWordList & );
protected slots:
void processMatches( QIMPenCharMatchList &ml );
void endMulti();
protected:
void updateWordMatch( QIMPenCharMatchList &ml );
void matchWords();
void scanDict( const QDawg::Node* n, int ipos, const QString& str, int error );
QList<QIMPenStroke> strokes;
QIMPenChar *prevMatchChar;
int prevMatchError;
QIMPenCharSet *charSet;
QIMPenCharSet *multiCharSet;
QList<QIMPenCharMatchList> wordChars;
MatchWordList wordMatches;
QString wordEntered;
bool doWordMatching;
bool canErase;
int errorThreshold;
int goodMatches;
int badMatches;
int maxGuess;
QTimer *multiTimer;
int multiTimeout;
};
#endif // _QIMPENINPUT_H_
|
