data/0.12-dev/gen_pms/test.cpp
raw| 1 | #include "fast.h" |
| 2 | #include <iostream> |
| 3 | #include <string> |
| 4 | #include <algorithm> |
| 5 | using namespace std; |
| 6 | |
| 7 | int main() |
| 8 | { |
| 9 | AikSaurusFAST f; |
| 10 | |
| 11 | while(1) |
| 12 | { |
| 13 | cout << "\nword to find: " << flush; |
| 14 | string word; cin >> word; |
| 15 | |
| 16 | const vector<string>& syns = f.getSynonyms(word); |
| 17 | |
| 18 | copy(syns.begin(), syns.end(), ostream_iterator<string>(cout, ", ")); |
| 19 | } |
| 20 | |
| 21 | return 0; |
| 22 | } |