PPL Assignment
IRM2015006
kbest.h
Go to the documentation of this file.
1 
2 #ifndef KBEST_H
3 #define KBEST_H
4 
5 #include <vector>
6 #include <algorithm>
7 
12 template <class T>
13 class KBest
14 {
15 private:
17  std::vector<T> elems;
18 
19 public:
20  KBest(std::vector<T> elements) {
21  elems = elements;
22  }
23 
25  template <typename Comparator>
26  std::vector<T> getKBest(int k, Comparator& comparator) {
27  std::sort(elems.begin(), elems.end(), comparator);
28  std::vector<T> retval (elems.begin(), elems.begin()+k);
29  return retval;
30  }
31 };
32 
33 
34 #endif /* KBEST_H */
KBest(std::vector< T > elements)
Definition: kbest.h:20
std::vector< T > elems
Definition: kbest.h:17
std::vector< T > getKBest(int k, Comparator &comparator)
Definition: kbest.h:26
Definition: kbest.h:13