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
|
/**********************************************************************
** Copyright (C) 2000-2008 Trolltech ASA. All rights reserved.
**
** This file is part of the TQt Assistant.
**
** This file may be used under the terms of the GNU General
** Public License versions 2.0 or 3.0 as published by the Free
** Software Foundation and appearing in the files LICENSE.GPL2
** and LICENSE.GPL3 included in the packaging of this file.
** Alternatively you may (at your option) use any later version
** of the GNU General Public License if such license has been
** publicly approved by Trolltech ASA (or its successors, if any)
** and the KDE Free TQt Foundation.
**
** Please review the following information to ensure GNU General
** Public Licensing requirements will be met:
** http://trolltech.com/products/qt/licenses/licensing/opensource/.
** If you are unsure which license is appropriate for your use, please
** review the following information:
** http://trolltech.com/products/qt/licenses/licensing/licensingoverview
** or contact the sales department at [email protected].
**
** Licensees holding valid TQt Commercial licenses may use this file in
** accordance with the TQt Commercial License Agreement provided with
** the Software.
**
** This file is provided "AS IS" with NO WARRANTY OF ANY KIND,
** INCLUDING THE WARRANTIES OF DESIGN, MERCHANTABILITY AND FITNESS FOR
** A PARTICULAR PURPOSE. Trolltech reserves all rights not granted
** herein.
**
**********************************************************************/
#ifndef INDEX_H
#define INDEX_H
#include <qstringlist.h>
#include <qdict.h>
#include <qdatastream.h>
#include <qobject.h>
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;
};
TQDataStream &operator>>( TQDataStream &s, Document &l );
TQDataStream &operator<<( TQDataStream &s, const Document &l );
class Index : public TQObject
{
Q_OBJECT
public:
struct Entry {
Entry( int d ) { documents.append( Document( d, 1 ) ); }
Entry( TQValueList<Document> l ) : documents( l ) {}
TQValueList<Document> documents;
};
struct PosEntry {
PosEntry( int p ) { positions.append( p ); }
TQValueList<uint> positions;
};
Index( const TQString &dp, const TQString &hp );
Index( const TQStringList &dl, const TQString &hp );
void writeDict();
void readDict();
int makeIndex();
TQStringList query( const TQStringList&, const TQStringList&, const TQStringList& );
TQString getDocumentTitle( const TQString& );
void setDictionaryFile( const TQString& );
void setDocListFile( const TQString& );
void setDocList( const TQStringList & );
signals:
void indexingProgress( int );
private slots:
void setLastWinClosed();
private:
void setupDocumentList();
void parseDocument( const TQString&, int );
void insertInDict( const TQString&, int );
void writeDocumentList();
void readDocumentList();
TQStringList getWildcardTerms( const TQString& );
TQStringList split( const TQString& );
TQValueList<Document> setupDummyTerm( const TQStringList& );
bool searchForPattern( const TQStringList&, const TQStringList&, const TQString& );
void buildMiniDict( const TQString& );
TQStringList docList;
TQDict<Entry> dict;
TQDict<PosEntry> miniDict;
uint wordNum;
TQString docPath;
TQString dictFile, docListFile;
bool alreadyHaveDocList;
bool lastWindowClosed;
};
struct Term {
Term( const TQString &t, int f, TQValueList<Document> l )
: term( t ), frequency( f ), documents( l ) {}
TQString term;
int frequency;
TQValueList<Document>documents;
};
class TermList : public TQPtrList<Term>
{
public:
TermList() : TQPtrList<Term>() {}
int compareItems( TQPtrCollection::Item i1, TQPtrCollection::Item i2 );
};
#endif
|
