diff options
| author | Paul Baltescu <pauldb89@gmail.com> | 2013-05-23 20:42:26 +0100 |
|---|---|---|
| committer | Paul Baltescu <pauldb89@gmail.com> | 2013-05-23 20:42:26 +0100 |
| commit | 1f9e57479e1c03d208e0b2b7bf007426e8a16dab (patch) | |
| tree | 41176fdd936eba591cd2d88ea1f7a2ad76f8cc36 /extractor/precomputation.h | |
| parent | 124878154b88819d35e78a42b854054bfc90e1b1 (diff) | |
| parent | fc3d47b81448c7537ed7951aea81ddcbd95bc18a (diff) | |
Merge branch 'master' of github.com:pauldb89/cdec
Diffstat (limited to 'extractor/precomputation.h')
| -rw-r--r-- | extractor/precomputation.h | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/extractor/precomputation.h b/extractor/precomputation.h index e3c4d26a..3e792ac7 100644 --- a/extractor/precomputation.h +++ b/extractor/precomputation.h @@ -15,7 +15,7 @@ using namespace std; namespace extractor { -typedef boost::hash<vector<int> > VectorHash; +typedef boost::hash<vector<int>> VectorHash; typedef unordered_map<vector<int>, vector<int>, VectorHash> Index; class SuffixArray; @@ -54,7 +54,7 @@ class Precomputation { private: // Finds the most frequent contiguous collocations. - vector<vector<int> > FindMostFrequentPatterns( + vector<vector<int>> FindMostFrequentPatterns( shared_ptr<SuffixArray> suffix_array, const vector<int>& data, int num_frequent_patterns, int max_frequent_phrase_len, int min_frequency); @@ -63,7 +63,7 @@ class Precomputation { // it adds new entries to the index for each discontiguous collocation // matching the criteria specified in the class description. void AddCollocations( - const vector<std::tuple<int, int, int> >& matchings, const vector<int>& data, + const vector<std::tuple<int, int, int>>& matchings, const vector<int>& data, int max_rule_span, int min_gap_size, int max_rule_symbols); // Adds an occurrence of a binary collocation. |