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
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
|
/***************************************************************************
* Copyright (C) 2004-2007 by Georgy Yunaev, gyunaev@ulduzsoft.com *
* Portions Copyright (C) 2000-2005 Trolltech AS. *
* Please do not use email address above for bug reports; see *
* the README file *
* *
* This program is free software; you can redistribute it and/or modify *
* it under the terms of the GNU General Public License as published by *
* the Free Software Foundation; either version 2 of the License, or *
* (at your option) any later version. *
* *
* This program is distributed in the hope that it will be useful, *
* but WITHOUT ANY WARRANTY; without even the implied warranty of *
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
* GNU General Public License for more details. *
* *
* You should have received a copy of the GNU General Public License *
* along with this program; if not, write to the *
* Free Software Foundation, Inc., *
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. *
***************************************************************************/
#ifndef QASSISTANTINDEX_H
#define QASSISTANTINDEX_H
#include <qstringlist.h>
#include <qdict.h>
#include <qdatastream.h>
#include <qobject.h>
namespace QtAs
{
struct Document
{
Document( int d, int f ) : docNumber( d ), frequency( f ) {}
Document() : docNumber( -1 ), frequency( 0 ) {}
bool operator==( const Document &doc ) const
{
return docNumber == doc.docNumber;
}
bool operator<( const Document &doc ) const
{
return frequency > doc.frequency;
}
bool operator<=( const Document &doc ) const
{
return frequency >= doc.frequency;
}
bool operator>( const Document &doc ) const
{
return frequency < doc.frequency;
}
Q_INT16 docNumber;
Q_INT16 frequency;
};
QDataStream &operator>>( QDataStream &s, Document &l );
QDataStream &operator<<( QDataStream &s, const Document &l );
class Index : public QObject
{
Q_OBJECT
public:
struct Entry
{
Entry( int d ) { documents.append( Document( d, 1 ) ); }
Entry( QValueList<Document> l ) : documents( l ) {}
QValueList<Document> documents;
};
struct PosEntry
{
PosEntry( int p ) { positions.append( p ); }
QValueList<uint> positions;
};
Index( const QString &dp, const QString &hp );
Index( const QStringList &dl, const QString &hp );
void writeDict();
bool readDict();
bool makeIndex();
QStringList query( const QStringList&, const QStringList&, const QStringList& );
void setDictionaryFile( const QString& );
void setDocListFile( const QString& );
void setDocList( const QStringList & );
QString getCharsSplit() const { return m_charssplit; }
QString getCharsPartOfWord() const { return m_charsword; }
signals:
void indexingProgress( int );
public slots:
void setLastWinClosed();
private:
void setupDocumentList();
bool parseDocumentToStringlist( const QString& filename, QStringList& tokenlist );
void parseDocument( const QString& filename, int docnum );
void insertInDict( const QString&, int );
void writeDocumentList();
bool readDocumentList();
QStringList getWildcardTerms( const QString& );
QStringList split( const QString& );
QValueList<Document> setupDummyTerm( const QStringList& );
bool searchForPhrases( const QStringList &phrases, const QStringList &words, const QString &filename );
QStringList docList;
QDict<Entry> dict;
QDict<PosEntry> miniDict;
QString docPath;
QString dictFile;
QString docListFile;
bool lastWindowClosed;
// Those characters are splitters (i.e. split the word), but added themselves into dictionary too.
// This makes the dictionary MUCH larger, but ensure that for the piece of "window->print" both
// search for "print" and "->print" will find it.
QString m_charssplit;
// Those characters are parts of word - for example, '_' is here, and search for _debug will find only _debug.
QString m_charsword;
};
struct Term
{
Term( const QString &t, int f, QValueList<Document> l ) : term( t ), frequency( f ), documents( l ) {}
QString term;
int frequency;
QValueList<Document> documents;
};
class TermList : public QPtrList<Term>
{
public:
TermList() : QPtrList<Term>() {}
int compareItems( QPtrCollection::Item i1, QPtrCollection::Item i2 );
};
};
#endif /* QASSISTANTINDEX_H */
|
