How to find index of a particular record in a vector?

Code:

	typedef vector<string> vString;
	
	vector<vString> vBig;
	vString vSmall;
	vString vType;
	vString::iterator itr;
	bool bPresent =false;
string type="phone";
	string val="857867";

for(itr=vType.begin();itr!=vType.end();itr++)
	{
		string data = *itr;
		if(type.compare(data)==0)
		{
			bPresent=true;
			break;
		}
	}

In above code , how I will get index inside vector , where my search string is found?

Why do you need the index, is the iterator not good enough?

--
Mats

Yes.
But In my program I have two vectors.
One for storing keys and other for storing values.
So I need index as well.

Code:

#include<vector>
#include<iostream>
using namespace std;

int main()
{
	
	typedef vector<string> vString;
	
	vector<vString> vBig;
	vString vSmall;
	vString vType;
	vString::iterator itr;
	bool bPresent =false;

	string type="phone";
	string val="857867";

	bPresent =false;
	for(itr=vType.begin();itr!=vType.end();itr++)
	{
		string data = *itr;
		if(type.compare(data)==0)
		{
			bPresent=true;
			break;
		}
	}
	if(bPresent)
	{

	}
	else
	{
		vType.push_back(type);
		vBig.push_back(vSmall);
		vBig[0].push_back(val);
	}

	type="telephone";
	val="222";


	bPresent =false;
	for(itr=vType.begin();itr!=vType.end();itr++)
	{
		string data = *itr;
		if(type.compare(data)==0)
		{
			bPresent=true;
			break;
		}
	}
	if(bPresent)
	{

	}
	else
	{
		vType.push_back(type);
		vBig.push_back(vSmall);
		vBig[0].push_back(val);
	}

	type="telephone";
	val="222";

}

Can you pleas help me in finding index?

Thanks in advance
Ketu

I don't understand from your code where you need the index, please explain...

--
Mats

Thanks a lot matsp.
It is solved now.
Final program is as below:

Code:

#include<vector>
#include<iostream>
using namespace std;

int main()
{
	
	typedef vector<string> vString;
	
	vector<vString> vBig;
	vString vSmall;
	vString vType;
	vString::iterator itr;
	vString::iterator itrValue;
	vector<vString>::iterator itrBig;
	int iSize =0;


	bool bPresent =false;
	int iIndex=0;
	//int iIndexStore=0;

	string type="telephone";
	string val="857867";

	bPresent =false;

	for(itr=vType.begin(),	iIndex=0;itr!=vType.end();itr++,iIndex++)
	{

		string data = *itr;
		if(type.compare(data)==0)
		{
			bPresent=true;
			break;
		}
	}
	if(bPresent)
	{
			vBig[iIndex].push_back(val);
	}
	else
	{
		vType.push_back(type);
		vBig.push_back(vSmall);
		vBig[iIndex].push_back(val);
		/*
		iSize=vBig.size();
		cout<<"\n Size of VBig :" <<iSize<<endl;
		vBig[iSize-1].push_back(val);
		*/


	}

	//-------------------------------------------------------------
	type="telephone";
	val="333";
	
	bPresent =false;
	//iIndex=0;
	for(itr=vType.begin(),iIndex=0;itr!=vType.end();itr++,iIndex++)
	{
		string data = *itr;
		if(type.compare(data)==0)
		{
			bPresent=true;
			break;
		}
	}
	if(bPresent)
	{

		vBig[iIndex].push_back(val);

	}
	else
	{
		vType.push_back(type);
		vBig.push_back(vSmall);
		vBig[iIndex].push_back(val);
		/*
			iSize=vBig.size();
		cout<<"\n Size of VBig :" <<iSize<<endl;
		vBig[iSize-1].push_back(val);
	*/
	}


	type="mail";
	val="a@b.com";
	bPresent =false;
	
	for(itr=vType.begin(),iIndex=0;itr!=vType.end();itr++,iIndex++)
	{
		string data = *itr;
		if(type.compare(data)==0)
		{
			bPresent=true;
			break;
		}
	}
	if(bPresent)
	{

		vBig[iIndex].push_back(val);

	}
	else
	{
		vType.push_back(type);
		vBig.push_back(vSmall);
		vBig[iIndex].push_back(val);

		/*
			iSize=vBig.size();
	cout<<"\n Size of VBig :" <<iSize<<endl;
		vBig[iSize-1].push_back(val);
		*/
	
	}

//-------------------------------------------------------------
	type="mail";
	val="p@qqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqq.com";
	
	bPresent =false;
	//iIndex=0;
	for(itr=vType.begin(),iIndex=0;itr!=vType.end();itr++,iIndex++)
	{
		string data = *itr;
		if(type.compare(data)==0)
		{
			bPresent=true;
			break;
		}
	}
	if(bPresent)
	{

		vBig[iIndex].push_back(val);

	}
	else
	{
		vType.push_back(type);
		vBig.push_back(vSmall);
	vBig[iIndex].push_back(val);
	/*
			iSize=vBig.size();
	cout<<"\n Size of VBig :" <<iSize<<endl;
		vBig[iSize-1].push_back(val);
	*/
	}

	type="fax";
	val="777";
	bPresent =false;
	//iIndex=0;
	for(itr=vType.begin(),iIndex=0;itr!=vType.end();itr++,iIndex++)
	{
		string data = *itr;
		if(type.compare(data)==0)
		{
			bPresent=true;
			break;
		}
	}
	if(bPresent)
	{

		vBig[iIndex].push_back(val);

	}
	else
	{
		vType.push_back(type);
		vBig.push_back(vSmall);
		vBig[iIndex].push_back(val);
		/*
					iSize=vBig.size();
		cout<<"\n Size of VBig :" <<iSize<<endl;
		vBig[iSize-1].push_back(val);
	*/
	}

	//-------------------------------------------------------------
	type="mail";
	val="x@rtyr.com";
	
	bPresent =false;
	//iIndex=0;
	for(itr=vType.begin(),iIndex=0;itr!=vType.end();itr++,iIndex++)
	{
		string data = *itr;
		if(type.compare(data)==0)
		{
			bPresent=true;
			break;
		}
	}
	if(bPresent)
	{

		vBig[iIndex].push_back(val);

	}
	else
	{
		vType.push_back(type);
		vBig.push_back(vSmall);
		vBig[iIndex].push_back(val);
		/*
					iSize=vBig.size();
		cout<<"\n Size of VBig :" <<iSize<<endl;
		vBig[iSize-1].push_back(val);
	*/
	}

	type="mail";
	val="w@yuygt";
	bPresent =false;
	//iIndex=0;
	for(itr=vType.begin(),iIndex=0;itr!=vType.end();itr++,iIndex++)
	{
		string data = *itr;
		if(type.compare(data)==0)
		{
			bPresent=true;
			break;
		}
	}
	if(bPresent)
	{

		vBig[iIndex].push_back(val);

	}
	else
	{
		vType.push_back(type);
		vBig.push_back(vSmall);
		vBig[iIndex].push_back(val);
		/*
					iSize=vBig.size();
		cout<<"\n Size of VBig :" <<iSize<<endl;
		vBig[iSize-1].push_back(val);
		*/
	
	}
//Parse Values

	for (itr=vType.begin(),iIndex=0;itr!=vType.end();itr++,iIndex++)
	{
		string strType = *itr;
		const char * pchType = strType.data();
		cout<<"\nValues for Type : "<<pchType <<" are \n ";


		string strValue;
		for(itrValue= vBig[iIndex].begin();itrValue!=vBig[iIndex].end();itrValue++)
		{
			strValue=*itrValue;
			const char * pchVal= strValue.data();
			cout<<endl<<pchVal;
		}
	}
	cout<<endl<<"============================================="<<endl;

	
return 0;

}

It looks like you want to associate a number of values with a string keyword. For that a std::map<std::string, std::vector<std::string> > might be appropriate.

Code:

    map<string, vector<string> > data_map;
    string type="telephone";
    string val="857867";

    //adds val to the vector corresponding to type if the key exists
    //else adds the key and adds val
    data_map[type].push_back(val);

Other than that you might read about functions to get rid of the redundancies in your code.

Originally Posted by ketu1

In above code , how I will get index inside vector , where my search string is found?

If you really need it, then the distance STL function perhaps?

what you have here is linear search, which doesn't scale well. If the vector can get large by any chance, try Binary Search.

This is assuming you only need to search sparingly (compared to index dereferencing). Otherwise, as anon suggested, use a map.