chore: remove excess namespace

Author: aminya

src/filter.cc

@@ -4,7 +4,6 @@
 #include <thread>
 #include <limits>
 
-namespace {
 
 struct CandidateScore {
     // TODO non const
@@ -66,8 +65,6 @@ const std::vector<CandidateIndex> sort_priority_queue(CandidateScorePriorityQueu
     return ret;
 }
 
-}// namespace
-
 const std::vector<CandidateIndex> filter(const vector<std::vector<CandidateString>> &candidates, const Element &query, const Options &options) {
     CandidateScorePriorityQueue top_k;
     auto max_results = options.max_results;

src/path_scorer.cc

@@ -1,16 +1,11 @@
 #include "common.h"
 
-namespace {
-
 // Directory depth at which the full path influence is halved.
 constexpr size_t tau_depth = 20;
 
 // Full path is also penalized for length of basename. This adjust a scale factor for that penalty.
 constexpr Score file_coeff = 2.5;
 
-};// namespace
-
-
 extern Score scorePath(const CandidateString &subject, const CandidateString &subject_lw, Score fullPathScore, const Options &options);
 
 extern Score getExtensionScore(const CandidateString &candidate, const CandidateString &ext, const int startPos, const int endPos, const int maxDepth);

src/scorer.cc

@@ -7,8 +7,6 @@
 //  score: Find string similarity using a Smith Waterman algorithm
 //         Modified to account for programing scenarios (CamelCase folder/file.ext object.property)
 
-namespace {
-
 // Base point for a single character match
 // This balance making patterns VS position and size penalty.
 constexpr int wm = 150;
@@ -28,8 +26,6 @@ constexpr Score tau_size = 150;
 // This has a direct influence on worst case scenario benchmark.
 constexpr float miss_coeff = 0.75;// Max number missed consecutive hit = ceil(miss_coeff*query.length) + 5
 
-}// namespace
-
 extern bool isWordEnd(const size_t pos, const CandidateString &subject, const CandidateString &subject_lw, const size_t len);
 extern bool isSeparator(const char c) noexcept;
 extern Score scoreExact(const size_t n, const size_t m, const size_t quality, const Score pos);