King_DuckZ/dindexer
1
0
Fork 0
mirror of https://github.com/KingDuckZ/dindexer.git synced 2025-08-17 15:19:48 +00:00
Code Issues Releases Wiki Activity

Implement basic tab completion in navigate.

Browse source 
It doesn't work super well and it's missing set number
completion, but it's a step forward.
This commit is contained in:
King_DuckZ 2016-04-28 00:05:22 +02:00
parent 1ef879e9c1
commit b71a94ef70
11 changed files with 266 additions and 70 deletions
Download patch file Download diff file Expand all files Collapse all files

70
src/navigate/listdircontent.cpp
View file

@ -44,6 +44,29 @@ namespace din {
}
return result;
}
std::vector<std::string>* find_and_refresh_in_cache (boost::circular_buffer<std::pair<std::string, std::vector<std::string>>>& parCache, const std::string& parCurrPath) {
using CachedItemType = std::pair<std::string, std::vector<std::string>>;
//Check if requested item is already cached
auto it_found = std::find_if(parCache.begin(), parCache.end(), [&parCurrPath](const CachedItemType& itm) { return itm.first == parCurrPath; });
if (it_found != parCache.end()) {
CachedItemType tmp;
std::swap(tmp, *it_found);
assert(it_found->first.empty());
assert(it_found->second.empty());
assert(tmp.first == parCurrPath);
parCache.erase(it_found);
assert(parCache.size() < g_max_cached_lists);
parCache.push_back(std::move(tmp));
assert(not parCache.empty());
assert(parCache.back().first == parCurrPath);
return &parCache.back().second;
}
else {
return nullptr;
}
}
} //unnamed namespace
ListDirContent::ListDirContent (DBSource* parDB) :
@ -54,22 +77,11 @@ namespace din {
}
auto ListDirContent::ls (const GenericPath& parDir) const -> const ListType& {
const auto curr_path = parDir.to_string();
//Check if requested item is already cached
auto it_found = std::find_if(m_cache.begin(), m_cache.end(), [&curr_path](const CachedItemType& itm) { return itm.first == curr_path; });
if (it_found != m_cache.end()) {
CachedItemType tmp;
std::swap(tmp, *it_found);
assert(it_found->first.empty());
assert(it_found->second.empty());
assert(tmp.first == curr_path);
m_cache.erase(it_found);
assert(m_cache.size() < g_max_cached_lists);
m_cache.push_back(std::move(tmp));
assert(not m_cache.empty());
assert(m_cache.back().first == curr_path);
return m_cache.back().second;
const std::string curr_path = parDir.to_string();
{
const auto* cached_item = find_and_refresh_in_cache(m_cache, curr_path);
if (cached_item)
return *cached_item;
}
//Requested item is not cached, so we need to query the db now
@ -89,4 +101,30 @@ namespace din {
assert(m_cache.back().first == curr_path);
return m_cache.back().second;
}
auto ListDirContent::ls ( GenericPath parDir, const std::string& parStartWith ) const -> const ListType& {
parDir.push_piece(parStartWith);
const std::string curr_path = parDir.to_string();
{
const auto* cached_item = find_and_refresh_in_cache(m_cache, curr_path);
if (cached_item)
return *cached_item;
}
if ("/" == curr_path) {
assert(false); //not implemented
}
else {
const auto start_from = curr_path.find('/', 1);
auto path_prefix = boost::string_ref(curr_path).substr(start_from == curr_path.npos ? curr_path.size() : start_from + 1);
const auto set_id = boost::lexical_cast<uint32_t>(parDir[0]);
assert(parDir.level() > 0);
auto file_list = m_db->paths_starting_by(set_id, parDir.level() - 1, path_prefix);
m_cache.push_back(std::make_pair(curr_path, file_list));
}
assert(not m_cache.empty());
assert(m_cache.back().first == curr_path);
return m_cache.back().second;
}
} //namespace din