Printable View
Hi ,
I want to store data which is in key value pair.
Here one key can have many values.
example:
email : [email protected]
[email protected]
phone : 9877766655
3452781190
fax : 876765785
8686798798
uid: hhg
name : john
Here email , phone ,fax,uid ,name ---These are keys.
Key may have one or many values.
Please suggest the way to store these multivalued keys.
Thanks and Regards
Ketu
One way would be to use a std::map<std::string, std::vector<std::string> >
Thanks a lot.
But I'll not be knowing how many vectors will be required at run time.
Because i'll be reading this data from text file. For example -
# entry-id: 5
dn: uid=aadsfvg,ou=ou1,dc=persistent,dc=co,dc=in
telephoneNumber: 435
telephoneNumber: 5345
telephoneNumber: 243
mail: [email protected]
mail: [email protected]
uid: aadsfvg
facsimileTelephoneNumber: 4235
facsimileTelephoneNumber: 442
givenName: abc
objectClass: top
objectClass: person
objectClass: organizationalPerson
objectClass: inetorgperson
sn: adsfvg
cn: abc adsfvg
creatorsName: uid=admin,ou=administrators,ou=topologymanagement, o=netscaperoot
modifiersName: uid=admin,ou=administrators,ou=topologymanagement, o=netscaperoo
t
createTimestamp: 20080101141712Z
modifyTimestamp: 20080101141712Z
nsUniqueId: 2c1baa81-1dd211b2-80ef99ff-c4c2cf3a
This data I'll be reading from text file.
I'll process data after storing it into map and then I'll erase data in map and will read next entry from file.
Next entry may have different parameters
example -
next entry from file mifght be like this :
# entry-id: 2
dn: cn=Directory Administrators, dc=persistent,dc=co,dc=in
objectClass: top
objectClass: groupofuniquenames
cn: Directory Administrators
creatorsName: cn=directory manager
modifiersName: cn=directory manager
createTimestamp: 20080101134100Z
modifyTimestamp: 20080101134100Z
nsUniqueId: 2f606782-1dd211b2-80ea99ff-c4c2cf3a
x
I dont see a problem since you can add as many key/value pairs as is needed with the std::map.Quote:
But I'll not be knowing how many vectors will be required at run time.
Hi
I tried it using multimap.
But I am not able to find all the values of a particular key using multimap.
Out of this Following is the code where I am tring to read values from multimap:
Code:mapAttributes.insert(pair<const char *,const char *>(pchAttType,pchAttValue));
}
}
else
{
//This is end of entry, so break while loop.
break;
}
}
const int iSize = mapAttributes.size();
cout<<"\n Size of Multimap : "<<iSize<<endl;
for(itrMap=mapAttributes.begin(); itrMap!= mapAttributes.end(); itrMap++)
{
cout<<endl<<(*itrMap).first<<" : "<<(*itrMap).second<<endl;
const char * const & pchKey=(*itrMap).first;
itrKey= mapAttributes.find(pchKey);
itrUpper=mapAttributes.upper_bound(pchKey);
cout<<"\n.................Elements associated with "<<pchKey<<"............................\n";
for (;itrKey!= itrUpper;itrKey++)
{
cout<<"\t"<<itrKey->second;
}
}
But every time it is returning single value and not all the values for that key.
If I'll use std::map<std::string, std::vector<std::string> >
How I'll come to know how many vectors are required?
Please help.
thanks in advance.
What do you mean?Quote:
Originally Posted by ketu1
You need one vector per key-string. The vector will have as many elements as you have added. Vectors are dynamically resized unless you specifically work towards NOT doing so.
--
Mats
Yes .. But I'll not be knowing how many keys are there in a file.
Like I am reading keys fro file.
The file data may be like below:
telephoneNumber: 435
telephoneNumber: 5345
telephoneNumber: 243
mail: [email protected]
mail: [email protected]
uid: aadsfvg
facsimileTelephoneNumber: 4235
facsimileTelephoneNumber: 442
givenName: abc
objectClass: top
objectClass: person
objectClass: organizationalPerson
objectClass: inetorgperson
sn: adsfvg
cn: abc adsfvg
creatorsName: uid=admin,ou=administrators,ou=topologymanagement, o=netscaperoot
modifiersName: uid=admin,ou=administrators,ou=topologymanagement, o=netscaperoo
t
createTimestamp: 20080101141712Z
modifyTimestamp: 20080101141712Z
nsUniqueId: 2c1baa81-1dd211b2-80ef99ff-c4c2cf3a
or it may be as below:
dn: dc=persistent,dc=co,dc=in
objectClass: top
objectClass: domain
dc: persistent
creatorsName: cn=directory manager
createTimestamp: 20080101134059Z
nsUniqueId: 2f606781-1dd211b2-80ea99ff-c4c2cf3a
aci: (targetattr != "userPassword") (version 3.0; acl "Anonymous access"; allo
w (read, search, compare)userdn = "ldap:///anyone";)
So depending on data in the file , each tme number of keys required will be different. and hence the number of vectors as well.
am I right?
Please guide how to implememt that.
Yes, if you have different sets of data, you will need/get a different set of vectors - but isn't that exactly what you want?
--
Mats
Yes... i want to implement that only.
But not getting which way should I follow.
First I tried implementation using multimap.
In that case storing data was OK.
But i was not able to retrive the data.
i.e. I was not able to retrive how many and which values are there for key "telephonenumber" in my multiset.
So As "laserlight' author has suggested, now I am tring to implement the same using vector.
Please help.
What I am implementing here is reading the data from LDIF file and add entries into iPlanet directory server accordingly.