// googleHash(); //Algorithm of Google, the performance is not good, but also the collision probability.
//for (int i=0;i<1000;i++)
hashMaptest(); //No delete function, but the best performance
//for (int i=0;i<1000;i++)
memMapTest(); //Based on memory No hard disk consumption
//diskMapTest(); //Based on the hard disk No memory consumption
If you would like to refer to this comment somewhere else in this project, copy and paste the following link:
Three different map algorithm, used in different application scenarios.
1,memMap Based on memory No hard disk consumption.
2,diskMap Based on the hard disk No memory consumption.
3,hashMap No delete function, but the best performance.
memMap and diskMap can turn to hashMap by memMap2HashMap and diskMap2HashMap.
In addition,Provide Google HashMap for comparative test.
Algorithm of Google,the performance is not good, but also has the collision probability.
Last edit: pww 71 2015-05-05
If you would like to refer to this comment somewhere else in this project, copy and paste the following link:
Development Manual
Three different map algorithm, used in different application scenarios.
1,memMap Based on memory No hard disk consumption.
2,diskMap Based on the hard disk No memory consumption.
3,hashMap No delete function, but the best performance.
memMap and diskMap can turn to hashMap by memMap2HashMap and diskMap2HashMap.
In addition,Provide Google HashMap for comparative test.
Algorithm of Google,the performance is not good, but also has the collision probability.
Last edit: pww 71 2015-05-05