clang-tidy: merge namespace specifiers

alib2algo_experimental/src/grammar/parsing/LeftFactorize.cpp

@@ -3,9 +3,7 @@
 #include <grammar/ContextFree/CFG.h>
 #include <common/createUnique.hpp>
-namespace grammar {
-
-namespace parsing {
+namespace grammar::parsing {
 void LeftFactorize::leftFactorize ( grammar::CFG < > & grammar, const DefaultSymbolType & terminal, const DefaultSymbolType & nonterminal ) {
 	grammar::CFG < > res ( grammar.getInitialSymbol ( ) );
@@ -32,6 +30,4 @@ void LeftFactorize::leftFactorize ( grammar::CFG < > & grammar, const DefaultSym
 	grammar = res;
 }
-} /* namespace parsing */
-
-} /* namespace grammar */
+} /* namespace grammar::parsing */

alib2algo_experimental/src/grammar/parsing/SLR1ParseTable.cpp

@@ -6,9 +6,7 @@
 #include <exception/CommonException.h>
-namespace grammar {
-
-namespace parsing {
+namespace grammar::parsing {
 void SLR1ParseTable::insertToActionTable ( LRActionTable & actionTable, LRActionTable::key_type key, LRActionTable::mapped_type value ) {
 	std::pair<LRActionTable::iterator, bool> result = actionTable.emplace ( std::move ( key ), std::move ( value ) );
@@ -73,6 +71,4 @@ LRGotoTable SLR1ParseTable::getGotoTable ( const grammar::CFG < > & originalGram
 	return gotoTable;
 }
-} /* namespace parsing */
-
-} /* namespace grammar */
+} /* namespace grammar::parsing */

alib2algo_experimental/src/grammar/parsing/common/Substitute.cpp

 #include "Substitute.h"
 #include <grammar/ContextFree/CFG.h>
-namespace grammar {
-
-namespace parsing {
+namespace grammar::parsing {
 void Substitute::substitute ( const grammar::CFG < > & orig, grammar::CFG < > & res, const DefaultSymbolType & origLHS, const ext::vector < ext::variant < DefaultSymbolType, DefaultSymbolType > > & origRHS, ext::vector < ext::variant < DefaultSymbolType, DefaultSymbolType > >::const_iterator nonterminal ) {
 	auto iter = orig.getRules ( ).find ( * nonterminal );
@@ -18,6 +16,4 @@ void Substitute::substitute ( const grammar::CFG < > & orig, grammar::CFG < > &
 	}
 }
-} /* namespace parsing */
-
-} /* namespace grammar */
+} /* namespace grammar::parsing */

alib2algo_experimental/src/stringology/indexing/ExperimentalSuffixTrie.cpp

@@ -3,9 +3,7 @@
 #include <string/LinearStringTerminatingSymbol.h>
 #include <registration/AlgoRegistration.hpp>
-namespace stringology {
-
-namespace indexing {
+namespace stringology::indexing {
 indexes::SuffixTrieTerminatingSymbol ExperimentalSuffixTrie::construct ( const string::LinearStringTerminatingSymbol & w ) {
 	indexes::SuffixTrieTerminatingSymbol res ( w.getAlphabet ( ), w.getTerminatingSymbol ( ) );
@@ -25,9 +23,7 @@ indexes::SuffixTrieTerminatingSymbol ExperimentalSuffixTrie::construct ( const s
 	return res;
 }
-} /* namespace indexing */
-
-} /* namespace stringology */
+} /* namespace stringology::indexing */
 namespace {

alib2graph_algo/src/maximum_flow/FordFulkerson.cpp

@@ -6,9 +6,7 @@
 #include <climits>
 #include <registration/AlgoRegistration.hpp>
-namespace graph {
-
-namespace maximum_flow {
+namespace graph::maximum_flow {
 enum State { FRESH, OPEN, CLOSED };
 struct Context {
@@ -198,9 +196,7 @@ Flow FordFulkerson::findMaximumFlow(const UndirectedGraph &graph,
 // ---------------------------------------------------------------------------------------------------------------------
-} // namespace maximum_flow
-
-} // namespace graph
+} // namespace graph::maximum_flow
 // ---------------------------------------------------------------------------------------------------------------------

alib2graph_algo/src/minimum_cut/FordFulkerson.cpp

@@ -8,9 +8,7 @@
 #include <maximum_flow/FordFulkerson.hpp>
 #include <registration/AlgoRegistration.hpp>
-namespace graph {
-
-namespace minimum_cut {
+namespace graph::minimum_cut {
 static maximum_flow::Capacity getCapacity(const DirectedGraph &graph) {
   maximum_flow::Capacity capacity;
@@ -135,9 +133,7 @@ Cut FordFulkerson::findMinimumCut(const UndirectedGraph &graph,
 //auto BasicAlgorithmUndirectedGraph = registration::OverloadRegister < FordFulkerson, UndirectedGraph, UndirectedGraph > ( FordFulkerson::findMinimumCut );
-} // namespace minimumcut
-
-} // namespace graph
+} // namespace graph::minimumcut
 // ---------------------------------------------------------------------------------------------------------------------