Map usage and data update test in Map

# Include <map>
# Include <vector>
# Include <iostream>


Using namespace STD;


Struct urlkeystru
{
Int iurlid;
String strurl;
};


Struct traceip
{
String IP;
Int ittl;
};


Struct urlresdatastru
{
Int isuccdialcount;
Int iblockcount;
Vector <traceip> vectraceip;
};


// 1. requires an overload smaller than the number, which is used for the default sorting of keys in map.
Bool operator <(const urlkeystru & struurlkey1, const urlkeystru & struurlkey2)
{
If (struurlkey1.iurlid <struurlkey2.iurlid)
Return true;
Else
Return false;
}


Int main (){


Urlkeystru key = {1, "Hello \ n "};
Urlresdatastru data;
STD: Map <urlkeystru, urlresdatastru> ll;

Data. isuccdialcount = 1;
// LL. insert (STD: pair <urlkeystru, urlresdatastru> (Key, data ));
Ll. insert (STD: make_pair (Key, data ));


// 2 Method for judging successful insert failures
Data. isuccdialcount = 2;
STD: pair <STD: Map <urlkeystru, urlresdatastru >:: iterator, bool> ret;
Ret = ll. insert (STD: pair <urlkeystru, urlresdatastru> (Key, data ));

If (Ret. Second ){
STD: cout <"succeeded" <STD: Endl;
}
Else {
STD: cout <"failed" <STD: Endl;
}


STD: Map <urlkeystru, urlresdatastru >:: iterator it;

For (IT = ll. Begin (); it! = Ll. End (); It ++)
{
STD: cout <"key. iurlid = "<(IT-> first ). iurlid <"--> value. isuccdialcount = "<(IT-> second ). isuccdialcount <STD: Endl;
}


// 3 update the data in the map. The at command must be used, and the INSERT command cannot be used.
Data. isuccdialcount = 3;
Ll. At (key) = data;


For (IT = ll. Begin (); it! = Ll. End (); It ++)
{
STD: cout <"key. iurlid = "<(urlkeystru) (IT-> first )). iurlid <"--> value. isuccdialcount = "<(urlresdatastru) (IT-> second )). isuccdialcount <STD: Endl;
}


Return 0;
}