blob: 214de6ebeccabda788b8b5b4c9ecc2e1231cd0f3 (
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
|
/******************************************************************************
*
*
*
* Copyright (C) 1997-2001 by Dimitri van Heesch.
*
* Permission to use, copy, modify, and distribute this software and its
* documentation under the terms of the GNU General Public License is hereby
* granted. No representations are made about the suitability of this software
* for any purpose. It is provided "as is" without express or implied warranty.
* See the GNU General Public License for more details.
*
* Documents produced by Doxygen are derivative works derived from the
* input used in their production; they are not affected by this license.
*
*/
#ifndef _SEARCHINDEX_H
#define _SEARCHINDEX_H
#include "qtbc.h"
#include <qintdict.h>
#include <qlist.h>
#include <qdict.h>
#include "suffixtree.h"
//class IndexTree;
class SuffixTree;
class DocRef
{
public:
DocRef(int index,const char *name,const char *url)
{ i=index; n=name; u=url; }
~DocRef() {}
void setOffset(int offset) { o=offset; }
const char *name() const { return n; }
const char *url() const { return u; }
int index() const { return i; }
int offset() const { return o; }
private:
QCString n;
QCString u;
int i;
int o;
};
typedef QList<DocRef> DocRefList;
typedef QDict<DocRef> DocRefDict;
class SearchIndex
{
public:
SearchIndex();
~SearchIndex();
void addReference(const char *key,const char *ref);
bool addWord(const char *key,const char *word,bool special);
bool saveIndex(const char *fileName);
void dump() { suffixTree->dump(); }
private:
//IndexTree *indexTree;
SuffixTree *suffixTree;
DocRefList refList;
DocRefDict refDict;
QIntDict<DocRef> nameIndex;
int indexCount;
};
#endif
|
