fix typo

steineggerlab · Feb 19, 2024 · 6b1dd70 · 6b1dd70
1 parent c388d48
commit 6b1dd70
Show file tree

Hide file tree

Showing 2 changed files with 4 additions and 4 deletions.
diff --git a/src/strucclustutils/createcomplexreport.h b/src/strucclustutils/createcomplexreport.h
@@ -13,7 +13,7 @@ const bool CLUSTERED = true;
 const float BIT_SCORE_MARGIN = 0.7;
 const float DEF_BIT_SCORE = -1.0;
 const int UNINITIALIZED = 0;
-const unsigned int MULTIPLE_CHAINED_COMPOLEX = 2;
+const unsigned int MULTIPLE_CHAINED_COMPLEX = 2;
 typedef std::pair<std::string, std::string> compNameChainName_t;
 typedef std::map<unsigned int, unsigned int> chainKeyToComplexId_t;
 typedef std::map<unsigned int, std::vector<unsigned int>> complexIdToChainKeys_t;

diff --git a/src/strucclustutils/scorecomplex.cpp b/src/strucclustutils/scorecomplex.cpp
@@ -298,7 +298,7 @@ bool compareNeighborWithDist(const NeighborsWithDist &first, const NeighborsWith
 class NearestNeighborsCluster {
 public:
     NearestNeighborsCluster(SearchResult &searchResult, std::set<cluster_t> &finalClusters, double minCov) : searchResult(searchResult), finalClusters(finalClusters) {
-        minClusterSize =  std::max(MULTIPLE_CHAINED_COMPOLEX, (unsigned int) ((double) searchResult.qChainKeys.size() * minCov));
+        minClusterSize =  std::max(MULTIPLE_CHAINED_COMPLEX, (unsigned int) ((double) searchResult.qChainKeys.size() * minCov));
         idealClusterSize = std::min(searchResult.qChainKeys.size(), searchResult.dbChainKeys.size());
         prevMaxClusterSize = 0;
     }
@@ -405,7 +405,7 @@ class NearestNeighborsCluster {
         if (checkChainRedundancy()) {
             neighbors.clear();
 
-            if (searchResult.alnVec.size() < MULTIPLE_CHAINED_COMPOLEX)
+            if (searchResult.alnVec.size() < MULTIPLE_CHAINED_COMPLEX)
                 return finishClustering();
 
             return getNearestNeighbors();
@@ -743,7 +743,7 @@ int scorecomplex(int argc, const char **argv, const Command &command) {
         for (size_t qCompIdx = 0; qCompIdx < qComplexIndices.size(); qCompIdx++) {
             unsigned int qComplexId = qComplexIndices[qCompIdx];
             std::vector<unsigned int> &qChainKeys = qComplexIdToChainKeysMap.at(qComplexId);
-            if (qChainKeys.size() < MULTIPLE_CHAINED_COMPOLEX)
+            if (qChainKeys.size() < MULTIPLE_CHAINED_COMPLEX)
                 continue;
 
             complexScorer.getSearchResults(qComplexId, qChainKeys, dbChainKeyToComplexIdMap, dbComplexIdToChainKeysMap, searchResults);