dict.c benchmark minor improvements.

This commit is contained in:
antirez 2016-09-07 15:27:25 +02:00
parent bd6c4cade6
commit 0d179d17ba

View File

@ -1155,6 +1155,24 @@ int main(int argc, char **argv) {
dictRehashMilliseconds(dict,100);
}
start_benchmark();
for (j = 0; j < count; j++) {
sds key = sdsfromlonglong(j);
dictEntry *de = dictFind(dict,key);
assert(de != NULL);
sdsfree(key);
}
end_benchmark("Linear access of existing elements");
start_benchmark();
for (j = 0; j < count; j++) {
sds key = sdsfromlonglong(j);
dictEntry *de = dictFind(dict,key);
assert(de != NULL);
sdsfree(key);
}
end_benchmark("Linear access of existing elements (2nd round)");
start_benchmark();
for (j = 0; j < count; j++) {
sds key = sdsfromlonglong(rand() % count);
@ -1162,7 +1180,7 @@ int main(int argc, char **argv) {
assert(de != NULL);
sdsfree(key);
}
end_benchmark("Accessing existing");
end_benchmark("Random access of existing elements");
start_benchmark();
for (j = 0; j < count; j++) {