| 253 | } |
| 254 | |
| 255 | string VectorOps::GetDistinct(void) |
| 256 | { |
| 257 | ostringstream distinct; |
| 258 | // remove duplicate entries from the vector |
| 259 | // http://stackoverflow.com/questions/1041620/most-efficient-way-to-erase-duplicates-and-sort-a-c-vector |
| 260 | sort( _vecs.begin(), _vecs.end() ); |
| 261 | _vecs.erase( unique( _vecs.begin(), _vecs.end() ), _vecs.end() ); |
| 262 | |
| 263 | for( size_t i = 0; i < _vecs.size(); i++ ) { |
| 264 | if (i>0) |
| 265 | distinct << _delimStr; |
| 266 | distinct << _vecs[i]; |
| 267 | } |
| 268 | return distinct.str(); |
| 269 | } |
| 270 | |
| 271 | string VectorOps::GetDistinctSortNum(bool ascending) |
| 272 | { |