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
152
|
/***************************************************************************
* 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 TQASSISTANTINDEX_H
#define TQASSISTANTINDEX_H
#include <tqstringlist.h>
#include <tqdict.h>
#include <tqdatastream.h>
#include <tqobject.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;
}
TQ_INT16 docNumber;
TQ_INT16 frequency;
};
TQDataStream &operator>>( TQDataStream &s, Document &l );
TQDataStream &operator<<( TQDataStream &s, const Document &l );
class Index : public TQObject
{
Q_OBJECT
TQ_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();
bool readDict();
bool makeIndex();
TQStringList query( const TQStringList&, const TQStringList&, const TQStringList& );
void setDictionaryFile( const TQString& );
void setDocListFile( const TQString& );
void setDocList( const TQStringList & );
TQString getCharsSplit() const { return m_charssplit; }
TQString getCharsPartOfWord() const { return m_charsword; }
signals:
void indexingProgress( int );
public slots:
void setLastWinClosed();
private:
void setupDocumentList();
bool parseDocumentToStringlist( const TQString& filename, TQStringList& tokenlist );
void parseDocument( const TQString& filename, int docnum );
void insertInDict( const TQString&, int );
void writeDocumentList();
bool readDocumentList();
TQStringList getWildcardTerms( const TQString& );
TQStringList split( const TQString& );
TQValueList<Document> setupDummyTerm( const TQStringList& );
bool searchForPhrases( const TQStringList &phrases, const TQStringList &words, const TQString &filename );
TQStringList docList;
TQDict<Entry> dict;
TQDict<PosEntry> miniDict;
TQString docPath;
TQString dictFile;
TQString 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.
TQString m_charssplit;
// Those characters are parts of word - for example, '_' is here, and search for _debug will find only _debug.
TQString m_charsword;
};
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 /* TQASSISTANTINDEX_H */
|
