29 if (sfv.size() <= 1) {
32 sort(sfv.begin(), sfv.end());
34 typedef sfv_t::iterator iterator;
35 iterator cur = sfv.begin();
36 iterator end = sfv.end();
37 for (iterator iter = cur+1; iter != end; ++iter) {
38 if (iter->first == cur->first) {
39 cur->second += iter->second;
45 sfv.erase(cur+1, end);
void sort_and_merge(sfv_t &sfv)
std::vector< std::pair< std::string, float > > sfv_t