update includes in algo

alib2algo/src/arbology/exact/BoyerMooreHorspool.h

@@ -8,8 +8,8 @@
 #ifndef _ARBOLOGY_BOYER_MOORE_HORSPOOL_H_
 #define _ARBOLOGY_BOYER_MOORE_HORSPOOL_H_
-#include <set>
-#include <map>
+#include <alib/set>
+#include <alib/map>
 #include <common/ranked_symbol.hpp>

alib2algo/src/arbology/exact/DeadZoneUsingBadCharacterShiftAndBorderArray.h

@@ -8,9 +8,9 @@
 #ifndef _DEAD_ZONE_USING_BAD_CHARACTER_SHIFT_AND_BORDER_ARRAY_H_
 #define _DEAD_ZONE_USING_BAD_CHARACTER_SHIFT_AND_BORDER_ARRAY_H_
-#include <set>
-#include <vector>
-#include <map>
+#include <alib/set>
+#include <alib/vector>
+#include <alib/map>
 #include <common/ranked_symbol.hpp>

alib2algo/src/arbology/exact/ExactNonlinearTreePatternAutomaton.h

@@ -8,9 +8,9 @@
 #ifndef _EXACT_NONLINEAR_TREE_PATTERN_AUTOMATON_H__
 #define _EXACT_NONLINEAR_TREE_PATTERN_AUTOMATON_H__
-#include <pair>
-#include <deque>
-#include <vector>
+#include <alib/pair>
+#include <alib/deque>
+#include <alib/vector>
 #include <common/ranked_symbol.hpp>

alib2algo/src/arbology/exact/ExactPatternMatch.h

@@ -8,10 +8,10 @@
 #ifndef _EXACT_PATTERN_MATCH_H_
 #define _EXACT_PATTERN_MATCH_H_
-#include <set>
-#include <tree>
-#include <deque>
-#include <foreach>
+#include <alib/set>
+#include <alib/tree>
+#include <alib/deque>
+#include <alib/foreach>
 #include <alphabet/RankedSymbol.h>

alib2algo/src/arbology/exact/ExactPatternMatchingAutomaton.cpp

@@ -23,7 +23,7 @@
 #include <alphabet/BottomOfTheStackSymbol.h>
-#include <deque>
+#include <alib/deque>
 #include <alphabet/RankedSymbol.h>
 #include <registration/AlgoRegistration.hpp>

alib2algo/src/arbology/exact/ExactSubtreeAutomaton.cpp

@@ -10,7 +10,7 @@
 #include <automaton/PDA/InputDrivenNPDA.h>
 #include <alphabet/RankedSymbol.h>
-#include <deque>
+#include <alib/deque>
 #include <registration/AlgoRegistration.hpp>
 namespace arbology {

alib2algo/src/arbology/exact/ExactSubtreeMatch.h

@@ -8,10 +8,10 @@
 #ifndef _EXACT_SUBTREE_MATCH_H_
 #define _EXACT_SUBTREE_MATCH_H_
-#include <set>
-#include <tree>
-#include <deque>
-#include <foreach>
+#include <alib/set>
+#include <alib/tree>
+#include <alib/deque>
+#include <alib/foreach>
 #include <common/ranked_symbol.hpp>
 #include <tree/ranked/RankedTree.h>

alib2algo/src/arbology/exact/ExactSubtreeMatchingAutomaton.cpp

@@ -15,7 +15,7 @@
 #include <alphabet/BottomOfTheStackSymbol.h>
-#include <deque>
+#include <alib/deque>
 #include <registration/AlgoRegistration.hpp>
 namespace arbology {

alib2algo/src/arbology/exact/ExactTreePatternAutomaton.h

@@ -12,7 +12,7 @@
 #include <tree/ranked/PrefixRankedTree.h>
 #include <automaton/PDA/InputDrivenNPDA.h>
-#include <deque>
+#include <alib/deque>
 namespace arbology {

alib2algo/src/arbology/exact/KnuthMorrisPratt.h

@@ -8,8 +8,8 @@
 #ifndef _ARBOLOGY_KNUTH_MORRIS_PRATT_H_
 #define _ARBOLOGY_KNUTH_MORRIS_PRATT_H_
-#include <set>
-#include <vector>
+#include <alib/set>
+#include <alib/vector>
 #include <tree/properties/BorderArrayNaive.h>
 #include <tree/properties/SubtreeJumpTable.h>

alib2algo/src/arbology/exact/ReversedBoyerMooreHorspool.h

@@ -8,8 +8,8 @@
 #ifndef _ARBOLOGY_REVERSED_BOYER_MOORE_HORSPOOL_H_
 #define _ARBOLOGY_REVERSED_BOYER_MOORE_HORSPOOL_H_
-#include <set>
-#include <map>
+#include <alib/set>
+#include <alib/map>
 #include <common/ranked_symbol.hpp>
 #include <tree/properties/ReversedBadCharacterShiftTable.h>

alib2algo/src/arbology/transform/BeginToEndIndex.h

@@ -8,7 +8,7 @@
 #ifndef _ARBOLOGY_BEGIN_TO_END_INDEX_H_
 #define _ARBOLOGY_BEGIN_TO_END_INDEX_H_
-#include <set>
+#include <alib/set>
 #include <tree/properties/SubtreeJumpTable.h>
 #include <tree/ranked/PrefixRankedBarTree.h>

alib2algo/src/automaton/convert/ToGrammarLeftRG.cpp

@@ -6,7 +6,7 @@
  */
 #include "ToGrammarLeftRG.h"
-#include <map>
+#include <alib/map>
 #include <common/createUnique.hpp>
 #include <alphabet/InitialSymbol.h>

alib2algo/src/automaton/determinize/Determinize.h

@@ -8,7 +8,7 @@
 #ifndef DETERMINIZE_H_
 #define DETERMINIZE_H_
-#include <set>
+#include <alib/set>
 #include <automaton/Automaton.h>
 #include <automaton/AutomatonFeatures.h>

alib2algo/src/automaton/determinize/DeterminizeIDPDAPart.cxx

@@ -8,8 +8,8 @@
 #include "common/NFACommon.h"
 #include <automaton/PDA/InputDrivenNPDA.h>
-#include <deque>
-#include <algorithm>
+#include <alib/deque>
+#include <alib/algorithm>
 namespace automaton {

alib2algo/src/automaton/determinize/DeterminizeNFAPart.hxx

@@ -9,9 +9,9 @@
 #include <automaton/FSM/NFA.h>
 #include <automaton/FSM/MultiInitialStateNFA.h>
-#include <deque>
-#include <algorithm>
-#include <set>
+#include <alib/deque>
+#include <alib/algorithm>
+#include <alib/set>
 namespace automaton {

alib2algo/src/automaton/determinize/DeterminizeNFTAPart.cxx

@@ -8,8 +8,8 @@
 #include "common/NFACommon.h"
 #include <automaton/TA/NFTA.h>
-#include <deque>
-#include <algorithm>
+#include <alib/deque>
+#include <alib/algorithm>
 namespace automaton {

alib2algo/src/automaton/determinize/DeterminizeRHDPDAPart.cxx

@@ -8,7 +8,7 @@
 #include "common/RHDPDACommon.h"
 #include <automaton/PDA/RealTimeHeightDeterministicNPDA.h>
-#include <set>
+#include <alib/set>
 #include <global/GlobalData.h>
 namespace automaton {

alib2algo/src/automaton/determinize/DeterminizeVPAPart.cxx

@@ -8,7 +8,7 @@
 #include "common/RHDPDACommon.h"
 #include <automaton/PDA/VisiblyPushdownNPDA.h>
-#include <set>
+#include <alib/set>
 namespace automaton {

alib2algo/src/automaton/determinize/common/NFACommon.cpp

@@ -8,9 +8,9 @@
 #include "NFACommon.h"
 #include "common/DefaultStatesSetType.h"
-#include <deque>
-#include <algorithm>
-#include <iostream>
+#include <alib/deque>
+#include <alib/algorithm>
+#include <alib/iostream>
 namespace automaton {