fix bug where we did not check the root node in the cache when reorde…

…ring the trie
lbryio · Dec 28, 2017 · d29f110 · d29f110
1 parent 40e034e
commit d29f110
Showing 1 changed file with 6 additions and 1 deletion.
diff --git a/src/claimtrie.cpp b/src/claimtrie.cpp
@@ -1704,7 +1704,12 @@ bool CClaimTrieCache::reorderTrieNode(const std::string& name, bool fCheckTakeov
     cachedNode = cache.find(name);
     if (cachedNode == cache.end())
     {
-        CClaimTrieNode* currentNode = &(base->root);
+        CClaimTrieNode* currentNode;
+        cachedNode = cache.find("");
+        if(cachedNode == cache.end())
+            currentNode = &(base->root);
+        else
+            currentNode = cachedNode->second;
         for (std::string::const_iterator itCur = name.begin(); itCur != name.end(); ++itCur)
         {
             std::string sCurrentSubstring(name.begin(), itCur);