-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSequenceExtractor.h
49 lines (42 loc) · 1.48 KB
/
SequenceExtractor.h
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
// Copyright (C) 2013 The University of Michigan
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
//
// Authors - Chun-Hung Hsiao ([email protected])
//
#ifndef SEQUENCEEXTRACTOR_H
#define SEQUENCEEXTRACTOR_H
#include <algorithm>
#include <map>
#include <string>
#include <vector>
#include "NgramExtractor.h"
using std::map;
using std::sort;
using std::string;
using std::vector;
class SequenceExtractor : public NgramExtractor {
public:
template <class Iterator, class Compare> SequenceExtractor(Iterator begin, Iterator end, Compare cmp) {
while (begin != end)
sequence_.push_back(*begin++);
sort(sequence_.begin(), sequence_.end(), cmp);
for (size_t i = 0; i < sequence_.size(); ++i)
index_[sequence_[i]] = i;
}
string Extract(Statement* node, int n, bool long_desc = false);
private:
vector<Statement*> sequence_;
map<Statement*,int> index_;
};
#endif // SEQUENCEEXTRACTOR_H