From 3f2375dd85193bd74583d7b4e40c53f4df8862b7 Mon Sep 17 00:00:00 2001 From: bookug Date: Thu, 18 May 2017 22:08:06 +0800 Subject: [PATCH] refactor: add comments --- KVstore/KVstore.cpp | 2 +- NOTES.md | 2 ++ Util/VList.h | 3 +++ 3 files changed, 6 insertions(+), 1 deletion(-) diff --git a/KVstore/KVstore.cpp b/KVstore/KVstore.cpp index d7f2479..e59e8e0 100644 --- a/KVstore/KVstore.cpp +++ b/KVstore/KVstore.cpp @@ -2462,7 +2462,7 @@ KVstore::binarySearch(unsigned _key, const unsigned* _list, unsigned _list_len, long long _mid; while (_left <= _right) { _mid = (_right - _left) / 2 + _left; - cout<<"check "<<_step<<" "<<_mid<<" "<<_step*_mid<<" "<<_list_len<random seek time(x/40M>0.006) + //Also notice that if no modification on data, read a node is almost sequentially in normal IVTree + //In VList, case is the same and using VList may bring another seek cost!(it is not easy to setup cache for IVTree due to data struct) static const unsigned LENGTH_BORDER = 1000000; //static const unsigned LENGTH_BORDER = 100; static const unsigned BLOCK_SIZE = 1 << 20; //fixed size of disk-block