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
|
#ifndef _SUFFIX_ARRAY_H_
#define _SUFFIX_ARRAY_H_
#include <memory>
#include <string>
#include <vector>
#include <boost/serialization/serialization.hpp>
#include <boost/serialization/split_member.hpp>
#include <boost/serialization/vector.hpp>
using namespace std;
namespace extractor {
class DataArray;
class PhraseLocation;
class SuffixArray {
public:
// Creates a suffix array from a data array.
SuffixArray(shared_ptr<DataArray> data_array);
// Creates empty suffix array.
SuffixArray();
virtual ~SuffixArray();
// Returns the size of the suffix array.
virtual int GetSize() const;
// Returns the data array on top of which the suffix array is constructed.
virtual shared_ptr<DataArray> GetData() const;
// Constructs the longest-common-prefix array using the algorithm of Kasai et
// al. (2001).
virtual vector<int> BuildLCPArray() const;
// Returns the i-th suffix.
virtual int GetSuffix(int rank) const;
// Given the range in which a phrase is located and the next word, returns the
// range corresponding to the phrase extended with the next word.
virtual PhraseLocation Lookup(int low, int high, const string& word,
int offset) const;
bool operator==(const SuffixArray& other) const;
private:
// Constructs the suffix array using the algorithm of Larsson and Sadakane
// (1999).
void BuildSuffixArray();
// Bucket sort on the data array (used for initializing the construction of
// the suffix array.)
void InitialBucketSort(vector<int>& groups);
void TernaryQuicksort(int left, int right, int step, vector<int>& groups);
// Constructs the suffix array in log(n) steps by doubling the length of the
// suffixes at each step.
void PrefixDoublingSort(vector<int>& groups);
// Given a [low, high) range in the suffix array in which all elements have
// the first offset-1 values the same, it returns the first position where the
// offset value is greater or equal to word_id.
int LookupRangeStart(int low, int high, int word_id, int offset) const;
friend class boost::serialization::access;
template<class Archive> void save(Archive& ar, unsigned int) const {
ar << *data_array;
ar << suffix_array;
ar << word_start;
}
template<class Archive> void load(Archive& ar, unsigned int) {
data_array = make_shared<DataArray>();
ar >> *data_array;
ar >> suffix_array;
ar >> word_start;
}
BOOST_SERIALIZATION_SPLIT_MEMBER();
shared_ptr<DataArray> data_array;
vector<int> suffix_array;
vector<int> word_start;
};
} // namespace extractor
#endif
|
