logic: fixes all over the place

* fixed refreshing to send another ui refresh message after parsing
* keepContent field for MessageBase so that views won't update
* fixed searchmatching to only weigh uppercase letters next to lowercase ones
* fixed file not jumping back to snippets when activating edge
* clicking into empty space deselects active edge
* clear file manager files on every fetch
* added db transaction for file clearing
* use zooming instead of changing font size

src/lib/data/Storage.cpp

@@ -81,8 +81,10 @@ void Storage::clearFileElement(const FilePath& filePath)
 	Id fileId = getFileNodeId(filePath);
 	if (fileId != 0)
 	{
+		m_sqliteStorage.beginTransaction();
 		m_sqliteStorage.removeElementsWithLocationInFile(fileId);
 		m_sqliteStorage.removeFile(fileId);
+		m_sqliteStorage.commitTransaction();
 	}
 }
 

src/lib/data/TaskCleanStorage.cpp

@@ -48,11 +48,15 @@ Task::TaskState TaskCleanStorage::update()
 
 void TaskCleanStorage::exit()
 {
-	// std::cout << "clean duration: " << utility::duration(m_start) << std::endl;
+	std::stringstream ss;
+	ss << "clearing files done, ";
+	ss << std::setprecision(2) << std::fixed << utility::duration(m_start) << " seconds";
+	MessageStatus(ss.str()).dispatch();
 }
 
 void TaskCleanStorage::interrupt()
 {
+	MessageStatus("Clearing file interrupted", false, true).dispatch();
 }
 
 void TaskCleanStorage::revert()

src/lib/data/search/SearchNode.cpp

@@ -316,10 +316,8 @@ std::pair<size_t, size_t> SearchNode::fuzzyMatch(
 	size_t pos = start;
 	size_t weight = 0;
 	size_t matchCount = 0;
-	char lastChar = '\0';
 
 	size_t ql = query.size();
-	size_t ml = m_name.size();
 
 	if (!query.size())
 	{
@@ -344,20 +342,37 @@ std::pair<size_t, size_t> SearchNode::fuzzyMatch(
 		}
 	}
 
-	for (size_t i = 0; i < ml; i++)
+	char last = '\0';
+	size_t nl = m_name.size();
+	for (size_t i = 0; i < nl; i++)
 	{
 		char c = m_name[i];
+		char next = (i + 1 == nl ? '\0' : m_name[i + 1]);
+
 		if (tolower(query[pos]) == tolower(c))
 		{
 			weight += std::max<size_t>(100 / sqrt(size + i + 1), 1);
+
 			if (matchCount)
 			{
 				weight += matchCount * matchCount * 10;
 			}
-			else if (i == 0 || lastChar == '_' || tolower(c) != c)
+
+
+			if (i == 0)
 			{
 				weight += 20;
 			}
+
+			if (last == '_' || next == '_')
+			{
+				weight += 20;
+			}
+			else if ((tolower(c) != c && tolower(next) == next) || (tolower(c) == c && tolower(next) != next))
+			{
+				weight += 20;
+			}
+
 			matchCount++;
 
 			pos++;
@@ -376,7 +391,7 @@ std::pair<size_t, size_t> SearchNode::fuzzyMatch(
 			matchCount = 0;
 		}
 
-		lastChar = c;
+		last = c;
 	}
 
 	return std::pair<size_t, size_t>(pos, weight);