{ unordered_map<string, bool> dic; char letter[] = "qwertyuiopasdfghjklz\0"; for(int i=0;i<5000001;i++) { if(i%1000000==0) { printf("%s\n", time_in_HH_MM_SS_MMM().c_str()); } string s = ""; for(int j=0;j<50;j++) { s += letter[rand()%20]; } dic[s] ...
std::allocator<DB::ColumnWithTypeAndName>> const&, DB::ActionsDAG::MatchColumnsMode, bool, bool, std::unordered_map<String, String, std::hash<String>, std::equal_to<String>, std::allocator<std::pair<
else{if(adj[u].find(v)==adj[u].end()) { adj[u].insert(v); adj[v].insert(u); cout<<"Edge added to the graph\n"; }else{ cout<<"Edge already exists\n"; } } }//to delete an edgevoiddelete_edge(map<int, unordered_set<int>>&adj,intu,intv) {//chcek if nodes...
There is built in support for serializing std containers by including an optional header: Supported classes (given T is serializable): std::vector<T> std::span<T> std::map<std::string, T> std::unordered_map<std::string, T> std::set<T> std::unordered_set<T> std::optional<T> - ...