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
|
/*
** SWISH++
** word_info.h
**
** Copyright (C) 1998 Paul J. Lucas
**
** 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., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#ifndef word_info_H
#define word_info_H
// standard
#include <list>
#include <map>
#include <string>
// local
#include "fake_ansi.h"
//*****************************************************************************
//
// SYNOPSIS
//
class word_info
//
// DESCRIPTION
//
// An instance of this class stores information for a word in the index
// being generated.
//
//*****************************************************************************
{
public:
struct file {
int index_; // occurs in i-th file
union {
int occurrences_; // in this file only
int rank_;
};
explicit file( int i ) : index_( i ), occurrences_( 1 ) { }
};
typedef std::list< file > file_set;
file_set files_;
int occurrences_; // over all files
word_info() : occurrences_( 0 ) { }
};
typedef std::map< std::string, word_info > word_map;
#endif /* word_info_H */
|
