ynkmr/Sourcetrail
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

src: correct spelling errors (#1162)

Browse Source
This commit is contained in:
Josh Soref
2021-03-14 07:47:26 +01:00
committed by GitHub
parent 5932e9f1e8
commit 3a75ef0df4
97 changed files with 261 additions and 261 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/lib/component/controller/BookmarkController.cpp
+2 -2
View File
@@ -16,7 +16,7 @@
#include "utility.h"
#include "utilityString.h"
const std::wstring BookmarkController::s_edgeSeperatorToken = L" => ";
const std::wstring BookmarkController::s_edgeSeparatorToken = L" => ";
const std::wstring BookmarkController::s_defaultCategoryName = L"default";
BookmarkController::BookmarkController(StorageAccess* storageAccess)
@@ -509,7 +509,7 @@ std::vector<std::wstring> BookmarkController::getActiveEdgeDisplayNames() const
const StorageEdge activeEdge = m_storageAccess->getEdgeById(activeEdgeId);
const std::wstring sourceDisplayName = getNodeDisplayName(activeEdge.sourceNodeId);
const std::wstring targetDisplayName = getNodeDisplayName(activeEdge.targetNodeId);
activeEdgeDisplayNames.push_back(sourceDisplayName + s_edgeSeperatorToken + targetDisplayName);
activeEdgeDisplayNames.push_back(sourceDisplayName + s_edgeSeparatorToken + targetDisplayName);
}
return activeEdgeDisplayNames;
}
src/lib/component/controller/BookmarkController.h
+1 -1
View File
@@ -120,7 +120,7 @@ private:
void update();
static const std::wstring s_edgeSeperatorToken;
static const std::wstring s_edgeSeparatorToken;
static const std::wstring s_defaultCategoryName;
StorageAccess* m_storageAccess;
src/lib/component/controller/CodeController.cpp
+1 -1
View File
@@ -1333,7 +1333,7 @@ CodeFileParams* CodeController::addSourceLocations(std::shared_ptr<SourceLocatio
{
return nullptr;
}
else if (oldSnippet.startLineNumber < start || oldSnippet.endLineNumber > end) // overlaping
else if (oldSnippet.startLineNumber < start || oldSnippet.endLineNumber > end) // overlapping
{
newSnippet = CodeSnippetParams::merge(newSnippet, oldSnippet);
}
src/lib/component/controller/GraphController.cpp
+3 -3
View File
@@ -2151,7 +2151,7 @@ void GraphController::layoutToGrid(DummyNode* node) const
return;
}
// Increase size of nodes with visible chilren to cover full grid cells
// Increase size of nodes with visible children to cover full grid cells
size_t width = GraphViewStyle::toGridSize(node->size.x);
size_t height = GraphViewStyle::toGridSize(node->size.y);
@@ -2440,7 +2440,7 @@ void GraphController::createLegendGraph()
Node* main = addNode(NODE_CLASS, L"Class", Vec2i(x + 200, y + 130));
Node* derived = addNode(NODE_CLASS, L"Derived Class", Vec2i(x + 210, y + 380));
Node* user = addNode(NODE_TYPE, L"Referencing Type", Vec2i(x - 10, y + 220));
Node* usee = addNode(NODE_TYPE, L"Referenced Type", Vec2i(x + 410, y + 220));
Node* used = addNode(NODE_TYPE, L"Referenced Type", Vec2i(x + 410, y + 220));
addEdge(Edge::EDGE_INHERITANCE, main, base);
addEdge(Edge::EDGE_INHERITANCE, derived, main);
@@ -2457,7 +2457,7 @@ void GraphController::createLegendGraph()
}
{
Edge* edge = addEdge(Edge::EDGE_BUNDLED_EDGES, main, usee);
Edge* edge = addEdge(Edge::EDGE_BUNDLED_EDGES, main, used);
std::shared_ptr<TokenComponentBundledEdges> bundledEdgesComp =
std::make_shared<TokenComponentBundledEdges>();
for (size_t i = 0; i < 10; i++)
src/lib/component/controller/helper/SnippetMerger.cpp
+1 -1
View File
@@ -35,7 +35,7 @@ std::deque<SnippetMerger::Range> SnippetMerger::merge(std::vector<SnippetMerger:
// merge children
const int snippetMergeRange = 2 * snippetExpandRange +
1; // +1 since snippets that end/start with consequtive
1; // +1 since snippets that end/start with consecutive
// lines should be merged as well.
merged = Range::mergeAdjacent(merged, snippetMergeRange);
src/lib/data/indexer/interprocess/InterprocessIntermediateStorageManager.cpp
+4 -4
View File
@@ -6,7 +6,7 @@
const char* InterprocessIntermediateStorageManager::s_sharedMemoryNamePrefix = "iist_";
const char* InterprocessIntermediateStorageManager::s_intermediatStoragesKeyName =
const char* InterprocessIntermediateStorageManager::s_intermediateStoragesKeyName =
"intermediate_storages";
InterprocessIntermediateStorageManager::InterprocessIntermediateStorageManager(
@@ -56,7 +56,7 @@ void InterprocessIntermediateStorageManager::pushIntermediateStorage(
SharedMemory::Queue<SharedIntermediateStorage>* queue =
access.accessValueWithAllocator<SharedMemory::Queue<SharedIntermediateStorage>>(
s_intermediatStoragesKeyName);
s_intermediateStoragesKeyName);
if (!queue)
{
return;
@@ -97,7 +97,7 @@ std::shared_ptr<IntermediateStorage> InterprocessIntermediateStorageManager::pop
SharedMemory::Queue<SharedIntermediateStorage>* queue =
access.accessValueWithAllocator<SharedMemory::Queue<SharedIntermediateStorage>>(
s_intermediatStoragesKeyName);
s_intermediateStoragesKeyName);
if (!queue || !queue->size())
{
return nullptr;
@@ -131,7 +131,7 @@ size_t InterprocessIntermediateStorageManager::getIntermediateStorageCount()
SharedMemory::Queue<SharedIntermediateStorage>* queue =
access.accessValueWithAllocator<SharedMemory::Queue<SharedIntermediateStorage>>(
s_intermediatStoragesKeyName);
s_intermediateStoragesKeyName);
if (!queue)
{
return 0;
src/lib/data/indexer/interprocess/InterprocessIntermediateStorageManager.h
+1 -1
View File
@@ -18,7 +18,7 @@ public:
private:
static const char* s_sharedMemoryNamePrefix;
static const char* s_intermediatStoragesKeyName;
static const char* s_intermediateStoragesKeyName;
size_t m_insertsWithoutGrowth;
};
src/lib/data/indexer/interprocess/shared_types/SharedIntermediateStorage.cpp
+2 -2
View File
@@ -167,11 +167,11 @@ std::set<StorageOccurrence> SharedIntermediateStorage::getStorageOccurrences() c
return result;
}
void SharedIntermediateStorage::setStorageOccurrences(const std::set<StorageOccurrence>& storageOccurences)
void SharedIntermediateStorage::setStorageOccurrences(const std::set<StorageOccurrence>& storageOccurrences)
{
m_storageOccurrences.clear();
for (const StorageOccurrence& occurrence: storageOccurences)
for (const StorageOccurrence& occurrence: storageOccurrences)
{
m_storageOccurrences.push_back(toShared(occurrence, m_allocator));
}
src/lib/data/indexer/interprocess/shared_types/SharedIntermediateStorage.h
+1 -1
View File
@@ -32,7 +32,7 @@ public:
void setStorageSourceLocations(const std::set<StorageSourceLocation>& storageSourceLocations);
std::set<StorageOccurrence> getStorageOccurrences() const;
void setStorageOccurrences(const std::set<StorageOccurrence>& storageOccurences);
void setStorageOccurrences(const std::set<StorageOccurrence>& storageOccurrences);
std::set<StorageComponentAccess> getStorageComponentAccesses() const;
void setStorageComponentAccesses(const std::set<StorageComponentAccess>& storageComponentAccesses);
src/lib/data/storage/PersistentStorage.cpp
+4 -4
View File
@@ -619,7 +619,7 @@ std::shared_ptr<SourceLocationCollection> PersistentStorage::getFullTextSearchLo
{
std::vector<std::shared_ptr<std::thread>> threads;
std::mutex collectionMutex;
for (std::vector<FullTextSearchResult> fileResults: utility::splitToEqualySizedParts(
for (std::vector<FullTextSearchResult> fileResults: utility::splitToEquallySizedParts(
m_fullTextSearchIndex.searchForTerm(searchTerm), utility::getIdealThreadCount()))
{
std::shared_ptr<std::thread> thread = std::make_shared<std::thread>(
@@ -2132,11 +2132,11 @@ std::vector<EdgeBookmark> PersistentStorage::getAllEdgeBookmarks() const
std::vector<BookmarkCategory> PersistentStorage::getAllBookmarkCategories() const
{
std::vector<BookmarkCategory> categories;
for (const StorageBookmarkCategory& storageBookmarkCategoriy:
for (const StorageBookmarkCategory& storageBookmarkCategory:
m_sqliteBookmarkStorage.getAllBookmarkCategories())
{
categories.push_back(
BookmarkCategory(storageBookmarkCategoriy.id, storageBookmarkCategoriy.name));
BookmarkCategory(storageBookmarkCategory.id, storageBookmarkCategory.name));
}
return categories;
}
@@ -3347,7 +3347,7 @@ void PersistentStorage::buildFullTextSearchIndex() const
}
}
for (std::vector<StorageFile> part:
utility::splitToEqualySizedParts(indexedFiles, utility::getIdealThreadCount()))
utility::splitToEquallySizedParts(indexedFiles, utility::getIdealThreadCount()))
{
std::shared_ptr<std::thread> thread = std::make_shared<std::thread>(
[&](const std::vector<StorageFile>& files) {
src/lib/data/storage/PersistentStorage.h
+1 -1
View File
@@ -241,7 +241,7 @@ private:
void addNodesWithParentsAndEdgesToGraph(
const std::vector<Id>& nodeIds,
const std::vector<Id>& edgeIds,
Graph* graphh,
Graph* graph,
bool addChildCount) const;
inline void addFileNodeToGraph(const StorageNode& storageNode, Graph* const graph) const;
void addNodeToGraph(
src/lib/data/storage/Storage.cpp
+3 -3
View File
@@ -193,12 +193,12 @@ void Storage::inject(Storage* injected)
{
// TRACE("inject occurrences");
const std::set<StorageOccurrence>& oldOccurences = injected->getStorageOccurrences();
const std::set<StorageOccurrence>& oldOccurrences = injected->getStorageOccurrences();
std::vector<StorageOccurrence> occurrences;
occurrences.reserve(oldOccurences.size());
occurrences.reserve(oldOccurrences.size());
for (const StorageOccurrence& occurrence: oldOccurences)
for (const StorageOccurrence& occurrence: oldOccurrences)
{
Id elementId = 0;
Id sourceLocationId = 0;
src/lib/data/storage/sqlite/SqliteIndexStorage.cpp
+3 -3
View File
@@ -395,7 +395,7 @@ bool SqliteIndexStorage::addOccurrence(const StorageOccurrence& data)
bool SqliteIndexStorage::addOccurrences(const std::vector<StorageOccurrence>& occurrences)
{
return m_insertOccurenceBatchStatement.execute(occurrences, this);
return m_insertOccurrenceBatchStatement.execute(occurrences, this);
}
bool SqliteIndexStorage::addComponentAccess(const StorageComponentAccess& componentAccess)
@@ -1293,7 +1293,7 @@ void SqliteIndexStorage::setupTables()
m_database.execDML(
"CREATE TABLE IF NOT EXISTS filecontent("
"id INTERGER, "
"id INTEGER, "
"content TEXT, "
"PRIMARY KEY(id), "
"FOREIGN KEY(id) REFERENCES file(id)"
@@ -1404,7 +1404,7 @@ void SqliteIndexStorage::setupPrecompiledStatements()
stmt.bind(int(index) * 6 + 6, int(location.type));
},
m_database);
m_insertOccurenceBatchStatement.compile(
m_insertOccurrenceBatchStatement.compile(
"INSERT OR IGNORE INTO occurrence(element_id, source_location_id) VALUES",
2,
[](CppSQLite3Statement& stmt, const StorageOccurrence& occurrence, size_t index) {
src/lib/data/storage/sqlite/SqliteIndexStorage.h
+1 -1
View File
@@ -357,7 +357,7 @@ private:
InsertBatchStatement<StorageSymbol> m_insertSymbolBatchStatement;
InsertBatchStatement<StorageLocalSymbol> m_insertLocalSymbolBatchStatement;
InsertBatchStatement<StorageSourceLocationData> m_insertSourceLocationBatchStatement;
InsertBatchStatement<StorageOccurrence> m_insertOccurenceBatchStatement;
InsertBatchStatement<StorageOccurrence> m_insertOccurrenceBatchStatement;
InsertBatchStatement<StorageComponentAccess> m_insertComponentAccessBatchStatement;
CppSQLite3Statement m_insertElementStmt;
src/lib/project/RefreshInfoGenerator.cpp
+1 -1
View File
@@ -102,7 +102,7 @@ RefreshInfo RefreshInfoGenerator::getRefreshInfoForUpdatedFiles(
const std::set<FilePath> staticReferencedFilePaths = storage->getReferenced(staticSourceFiles);
const std::set<FilePath> dynamicReferencedFilePaths = storage->getReferenced(filesToClear);
// 2.3.3) Add "dynamicReferencedFilePaths" to "filesToClear" that are not refenced by static
// 2.3.3) Add "dynamicReferencedFilePaths" to "filesToClear" that are not referenced by static
// paths, because these files may not be
// referenced anymore. If they still are, they will be re-added when encountered during
// re-indexing.
src/lib/settings/migration/SettingsMigrator.h
+2 -2
View File
@@ -1,5 +1,5 @@
#ifndef SETTNGS_MIGRATOR_H
#define SETTNGS_MIGRATOR_H
#ifndef SETTINGS_MIGRATOR_H
#define SETTINGS_MIGRATOR_H
#include "Migrator.h"
src/lib/utility/LowMemoryStringMap.h
+2 -2
View File
@@ -247,7 +247,7 @@ private:
/*
* Nodes
*
* These types are used to build the tree structure. They are either branches or leafes and
* These types are used to build the tree structure. They are either branches or leaves and
* contain a StringType
*/
@@ -318,7 +318,7 @@ private:
/*
* StringLeaf
*
* Combines Leaf and StringType to allow for creating leafes of different string lengths, that
* Combines Leaf and StringType to allow for creating leaves of different string lengths, that
* can still be stored in a collection of Node types.
*/
template <typename StringType>
src/lib/utility/commandline/commands/CommandlineCommandConfig.cpp
+1 -1
View File
@@ -90,7 +90,7 @@ void CommandlineCommandConfig::setup()
"logging-enabled,l", po::value<bool>(), "Enable file/console logging <true/false>")(
"verbose-indexer-logging-enabled,L",
po::value<bool>(),
"Enable additional log of abstract syntax tree during the indexing. <true/false> WARNINIG "
"Enable additional log of abstract syntax tree during the indexing. <true/false> WARNING "
"Slows down "
"indexing speed")(
"jvm-path,j", po::value<std::string>(), "Path to the location of the jvm library")(
src/lib/utility/file/utilityFile.cpp
+3 -3
View File
@@ -94,12 +94,12 @@ FilePath utility::getExpandedPath(const FilePath& path)
std::vector<FilePath> utility::getExpandedPaths(const std::vector<FilePath>& paths)
{
std::vector<FilePath> expanedPaths;
std::vector<FilePath> expandedPaths;
for (const FilePath& path: paths)
{
utility::append(expanedPaths, path.expandEnvironmentVariables());
utility::append(expandedPaths, path.expandEnvironmentVariables());
}
return expanedPaths;
return expandedPaths;
}
FilePath utility::getExpandedAndAbsolutePath(const FilePath& path, const FilePath& baseDirectory)
src/lib/utility/logging/logging.h
+1 -1
View File
@@ -6,7 +6,7 @@
#include "LogManager.h"
/**
* @brief Makros to simplify usage of the log manager
* @brief Macros to simplify usage of the log manager
*/
#define LOG_INFO(__str__) \
do \
src/lib/utility/messaging/MessageQueue.cpp
+1 -1
View File
@@ -243,7 +243,7 @@ void MessageQueue::sendMessage(std::shared_ptr<MessageBase> message)
{
std::lock_guard<std::mutex> lock(m_listenersMutex);
// m_listenersLength is saved, so that new listeners registered whithin message handling don't
// m_listenersLength is saved, so that new listeners registered within message handling don't
// get the current message and the length can be reduced when a listener gets unregistered.
m_listenersLength = m_listeners.size();
src/lib/utility/utility.h
+2 -2
View File
@@ -17,7 +17,7 @@
namespace utility
{
template <typename T>
std::vector<std::vector<T>> splitToEqualySizedParts(
std::vector<std::vector<T>> splitToEquallySizedParts(
const std::vector<T>& values, const size_t desiredPartCount);
template <typename T>
@@ -131,7 +131,7 @@ size_t digits(size_t n);
} // namespace utility
template <typename T>
std::vector<std::vector<T>> utility::splitToEqualySizedParts(
std::vector<std::vector<T>> utility::splitToEquallySizedParts(
const std::vector<T>& values, const size_t desiredPartCount)
{
const size_t partCount = std::max<size_t>(1, std::min(desiredPartCount, values.size()));