C / C++ / MFC

CPallini wrote:

BTW2: you are almost at 5,000 posts. Congratulations.

Rajesh R Subramanian wrote:

ThankZ frand. Itz all bekaz of THHB.

struct
{
    string strWord;
    int nCount;
};

vector string  strVector;

strVector.push_back("test");
strVector.push_back("test1");
strVector.push_back("test2");
strVector.push_back("test");
strVector.push_back("test3");

NiceNaidu wrote:

am not sure about how to use the struct which you have already mentioned ?

struct s
{
    string strWord;
    int nCount;
};
 
vector<s> vec;

DavidCrow wrote:

Before each call to push_back(), check first to see if the word already exists.

struct s
{
public:
    s(){}
    string strWord;
    int nCount;
 
    bool operator==(const s& b)
    {
        return strWord == b.strWord;
    }
};
 
s s4;
s4.strWord = "word to search for";
 
vector<s>::iterator it = find(vec.begin(), vec.end(), s4);
if (it != vec.end())
{
    // found it
}

// VanillaConsole.cpp : Defines the entry point for the console application.
//
 
#include "stdafx.h"
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std;
 
void main()
{
	typedef vector<string> words_t;
	words_t words;
 
	// Add some sample words.
	words.push_back("1");
	words.push_back("1");
	words.push_back("2");
	words.push_back("3");
	words.push_back("4");
	words.push_back("4");
 
	// Here's the magic.
	words_t::iterator i = words.begin();
	words_t::iterator e = words.end();
	sort(i, e);
	for (i=adjacent_find(i, e); i!=e; i=adjacent_find(i, e))
	{
		cout << *i << endl;
		i = find_if(i+1, e, bind2nd(not_equal_to<string>(), *i));
	}
}