From 821f96c3b796592cd95b0e7e6d19fddbdc327cd2 Mon Sep 17 00:00:00 2001
From: Yonghong Yan <yanyh15@gmail.com>
Date: Sat, 2 Sep 2023 01:28:50 -0400
Subject: [PATCH 01/42] [REX]:deBoost: replace boost::replace_all_copy with
 Rose::StringUtility::replaceAllCopy

---
 .../FortranModuleInfo.C                       |  4 +--
 src/frontend/SageIII/sage_support/cmdline.cpp |  4 +--
 src/util/StringUtility/CMakeLists.txt         |  4 +--
 src/util/StringUtility/Escape.C               |  6 ++---
 src/util/StringUtility/Makefile.am            |  5 ++--
 src/util/StringUtility/Replace.C              | 15 +++++++++++
 src/util/StringUtility/Replace.h              | 26 +++++++++++++++++++
 src/util/StringUtility/StringUtility.h        |  1 +
 8 files changed, 54 insertions(+), 11 deletions(-)
 create mode 100644 src/util/StringUtility/Replace.C
 create mode 100644 src/util/StringUtility/Replace.h

diff --git a/src/frontend/OpenFortranParser_SAGE_Connection/FortranModuleInfo.C b/src/frontend/OpenFortranParser_SAGE_Connection/FortranModuleInfo.C
index be9bc3b4a5e..97c3cc70d5d 100644
--- a/src/frontend/OpenFortranParser_SAGE_Connection/FortranModuleInfo.C
+++ b/src/frontend/OpenFortranParser_SAGE_Connection/FortranModuleInfo.C
@@ -1,8 +1,8 @@
 
 #include "sage3basic.h"
+#include "Replace.h"
 #include "FortranModuleInfo.h"
 #include "boost/filesystem.hpp"
-#include "boost/algorithm/string/replace.hpp"
 
 using namespace std;
 using std::string;
@@ -85,7 +85,7 @@ FortranModuleInfo::set_inputDirs(SgProject* project) {
      if (args[i].find("-I",0)==0) {
            rmodDir = args[i].substr(2);
            std::string rmodDir_no_quotes =
-                boost::replace_all_copy(rmodDir, "\"", "");
+                Rose::StringUtility::replaceAllCopy(rmodDir, "\"", "");
 
            if (boost::filesystem::exists(rmodDir_no_quotes.c_str())) {
                 inputDirs.push_back(rmodDir_no_quotes);
diff --git a/src/frontend/SageIII/sage_support/cmdline.cpp b/src/frontend/SageIII/sage_support/cmdline.cpp
index 33bf686c4ad..2721a2566e7 100644
--- a/src/frontend/SageIII/sage_support/cmdline.cpp
+++ b/src/frontend/SageIII/sage_support/cmdline.cpp
@@ -11,12 +11,12 @@
 #include "cmdline.h"
 #include "keep_going.h"
 #include "FileUtility.h"
+#include "Replace.h"
 #include "omp_simd.h"
 
 #include "Outliner.hh"
 
 #include <boost/foreach.hpp>
-#include <boost/algorithm/string/replace.hpp>
 
 using namespace Rose;                                   // temporary, until this file lives in namespace Rose
 
@@ -1463,7 +1463,7 @@ SgProject::processCommandLine(const vector<string>& input_argv)
 
                p_includeDirectorySpecifierList.push_back("-I" + include_path);
 
-               std::string include_path_no_quotes = boost::replace_all_copy(include_path, "\"", "");
+               std::string include_path_no_quotes = Rose::StringUtility::replaceAllCopy(include_path, "\"", "");
                try
                   {
                     bool is_directory = boost::filesystem::is_directory(include_path_no_quotes);
diff --git a/src/util/StringUtility/CMakeLists.txt b/src/util/StringUtility/CMakeLists.txt
index 5b2f972d82d..056bed2f07e 100644
--- a/src/util/StringUtility/CMakeLists.txt
+++ b/src/util/StringUtility/CMakeLists.txt
@@ -1,6 +1,6 @@
 add_library(util_StringUtility OBJECT
-  Convert.C Escape.C FileNameClassifier.C FileUtility.C NumberToString.C Predicate.C SplitJoin.C StringToNumber.C)
+  Convert.C Escape.C FileNameClassifier.C FileUtility.C NumberToString.C Predicate.C Replace.C SplitJoin.C StringToNumber.C)
 
 install(
-  FILES Convert.h Escape.h FileUtility.h NumberToString.h Predicate.h SplitJoin.h StringToNumber.h BitOps.h Constants.h StringUtility.h
+  FILES Convert.h Escape.h FileUtility.h NumberToString.h Predicate.h Replace.h SplitJoin.h StringToNumber.h BitOps.h Constants.h StringUtility.h
   DESTINATION ${INCLUDE_INSTALL_DIR}/util/StringUtility)
\ No newline at end of file
diff --git a/src/util/StringUtility/Escape.C b/src/util/StringUtility/Escape.C
index 0b96a59e3ef..965ae282c4c 100644
--- a/src/util/StringUtility/Escape.C
+++ b/src/util/StringUtility/Escape.C
@@ -3,8 +3,8 @@
 #include <sstream>
 #include <iomanip>
 #include <cassert>
+#include <Replace.h>
 #include <boost/algorithm/string/case_conv.hpp>
-#include <boost/algorithm/string/replace.hpp>
 
 namespace Rose {
 namespace StringUtility {
@@ -187,7 +187,7 @@ bourneEscape(const std::string &s) {
     // and escape backslashes.
     for (char ch: s) {
         if (!::isalnum(ch) && !strchr("_-+./", ch))
-            return "'" + boost::replace_all_copy(s, "\\", "\\\\") + "'";
+            return "'" + Rose::StringUtility::replaceAllCopy(s, "\\", "\\\\") + "'";
     }
 
     // No quoting or escaping necessary
@@ -214,7 +214,7 @@ yamlEscape(const std::string &s) {
 std::string
 csvEscape(const std::string &s) {
     const std::string quote = s.find_first_of(",\r\n\"") == std::string::npos ? "" : "\"";
-    return quote + boost::replace_all_copy(s, "\"", "\"\"") + quote;
+    return quote + Rose::StringUtility::replaceAllCopy(s, "\"", "\"\"") + quote;
 }
 
 // DQ (12/8/2016): This version fixed most of the issues that Robb raised with the escapeNewLineCharaters() function.
diff --git a/src/util/StringUtility/Makefile.am b/src/util/StringUtility/Makefile.am
index f48a5afac64..8bb02f57c83 100644
--- a/src/util/StringUtility/Makefile.am
+++ b/src/util/StringUtility/Makefile.am
@@ -12,6 +12,7 @@ libRoseStringUtility_la_SOURCES =  \
 	FileUtility.C								\
 	NumberToString.C							\
 	Predicate.C							\
+	Replace.C							\
 	SplitJoin.C							\
 	StringToNumber.C
 
@@ -24,6 +25,7 @@ pkginclude_HEADERS = \
 	FileUtility.h								\
 	NumberToString.h				\
 	Predicate.h					\
+	Replace.h					\
 	SplitJoin.h					\
 	StringToNumber.h
 
@@ -34,5 +36,4 @@ clean-local:
 distclean-local:
 	rm -rf Templates.DB
 
-EXTRA_DIST = CMakeLists.txt stringSupportDocumentation.docs
-
+EXTRA_DIST = CMakeLists.txt stringSupportDocumentation.docs
\ No newline at end of file
diff --git a/src/util/StringUtility/Replace.C b/src/util/StringUtility/Replace.C
new file mode 100644
index 00000000000..89ca31997bf
--- /dev/null
+++ b/src/util/StringUtility/Replace.C
@@ -0,0 +1,15 @@
+#include <Replace.h>
+
+namespace Rose {
+namespace StringUtility {
+
+////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+//                                     Replace
+////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+std::string replaceAllCopy(const std::string& input, const std::string& search, const std::string & replacedWith) {
+	return boost::replace_all_copy(input, search, replacedWith);
+	//TODO: for deBoost, this can be replaced with std::replace_copy when the compiler bumps to support c++17 by default
+}
+
+} // namespace
+} // namespace
diff --git a/src/util/StringUtility/Replace.h b/src/util/StringUtility/Replace.h
new file mode 100644
index 00000000000..8411d3852ce
--- /dev/null
+++ b/src/util/StringUtility/Replace.h
@@ -0,0 +1,26 @@
+#ifndef ROSE_StringUtility_Replace_H
+#define ROSE_StringUtility_Replace_H
+
+#include <string>
+#include <rosedll.h>
+#include "boost/algorithm/string/replace.hpp"
+
+
+namespace Rose {
+namespace StringUtility {
+
+////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+//                                      Functions for replacing a pattern with another one in a string
+////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
+
+/** Replace a pattern with another one in a string
+ *
+ *  These functions are wrappers around <code>boost::replace_all_copy</code>.
+ *
+ *  @{ */
+ROSE_UTIL_API std::string replaceAllCopy(const std::string& input, const std::string& search, const std::string & replacedWith);
+
+} // namespace
+} // namespace
+
+#endif
diff --git a/src/util/StringUtility/StringUtility.h b/src/util/StringUtility/StringUtility.h
index 9420d18df5e..e5f99e24bde 100644
--- a/src/util/StringUtility/StringUtility.h
+++ b/src/util/StringUtility/StringUtility.h
@@ -5,6 +5,7 @@
 #include <Escape.h>
 #include <NumberToString.h>
 #include <Predicate.h>
+#include <Replace.h>
 #include <SplitJoin.h>
 
 namespace Rose {

From f134187c1ab6399acc94fe0e8b8082d0d9c11071 Mon Sep 17 00:00:00 2001
From: Patrick Flynn <pflynn157@gmail.com>
Date: Wed, 6 Sep 2023 13:15:36 -0400
Subject: [PATCH 02/42] Replaced boost::filesystem with std::filesystem

---
 .gitmodules                                   |  6 +-
 CMakeLists.txt                                |  6 +-
 src/backend/unparser/unparser.C               | 45 +++++++-------
 .../FortranModuleInfo.C                       | 12 ++--
 .../SageIII/attachPreprocessingInfo.C         |  4 +-
 src/frontend/SageIII/sage_support/cmdline.cpp | 10 ++--
 .../SageIII/sage_support/keep_going.cpp       |  7 ++-
 .../SageIII/sage_support/sage_support.cpp     | 16 ++---
 .../SageIII/sage_support/sage_support.h       |  4 +-
 .../astOutlining/Outliner.cc                  |  6 +-
 src/rose-config.C                             | 10 ++--
 src/util/FileSystem.C                         | 58 +++++++++++++------
 src/util/FileSystem.h                         | 37 ++++++------
 src/util/StringUtility/FileNameClassifier.C   | 12 ++--
 src/util/StringUtility/FileUtility.h          | 16 ++---
 src/util/support/FileHelper.h                 | 26 ++++-----
 16 files changed, 150 insertions(+), 125 deletions(-)

diff --git a/.gitmodules b/.gitmodules
index 672019caae0..abb0f8de5f4 100644
--- a/.gitmodules
+++ b/.gitmodules
@@ -1,9 +1,9 @@
 [submodule "src/frontend/CxxFrontend/EDG"]
 	path = src/frontend/CxxFrontend/EDG
-	url = https://github.com/passlab/EDG.git
+	url = git@github.com:passlab/EDG.git
 [submodule "src/frontend/SageIII/ompparser"]
 	path = src/frontend/SageIII/ompparser
-	url = https://github.com/passlab/ompparser.git
+	url = git@github.com:passlab/ompparser.git
 [submodule "src/frontend/SageIII/accparser"]
 	path = src/frontend/SageIII/accparser
-	url = https://github.com/passlab/accparser.git
+	url = git@github.com:passlab/accparser.git
diff --git a/CMakeLists.txt b/CMakeLists.txt
index bce626bc786..136eb806802 100644
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -96,7 +96,7 @@ else()
   set(CMAKE_VERBOSE_MAKEFILE FALSE)
 endif()
 
-set(CMAKE_CXX_STANDARD 14)
+set(CMAKE_CXX_STANDARD 17)
 set(CMAKE_CXX_STANDARD_REQUIRED ON)
 
 option(BUILD_SHARED_LIBS "Build all libraries shared" FALSE)
@@ -201,13 +201,13 @@ endif(WIN32)
 # second can check again including optional components.  If the version of cmake is high enough you can use an
 # OPTIONAL_COMPONENTS clause instead, but that wasn't introduced until 3.11."
 find_package(Boost 1.47.0
-  COMPONENTS chrono date_time filesystem iostreams program_options random regex system wave thread
+  COMPONENTS chrono date_time iostreams program_options random regex system wave thread
   REQUIRED)
 if(NOT Boost_FOUND)
   message(FATAL_ERROR "Could not find Boost version 1.35.0 or newer command")
 endif()
 find_package(Boost 1.47.0
-  COMPONENTS chrono date_time filesystem iostreams program_options random regex system wave thread serialization)
+  COMPONENTS chrono date_time iostreams program_options random regex system wave thread serialization)
 include_directories(${Boost_INCLUDE_DIRS})
 
 # Paths to install header, executable, and libraries
diff --git a/src/backend/unparser/unparser.C b/src/backend/unparser/unparser.C
index 0c173f4adb8..66bb664816b 100644
--- a/src/backend/unparser/unparser.C
+++ b/src/backend/unparser/unparser.C
@@ -18,6 +18,7 @@
 #include "rose_config.h"
 
 #include <string.h>
+#include <filesystem>
 #if _MSC_VER
 #include <direct.h>
 #include <process.h>
@@ -2971,8 +2972,8 @@ unparseFile ( SgFile* file, UnparseFormatHelp *unparseHelp, UnparseDelegate* unp
             outFolder += package_name;
             outFolder += (package_name.size() > 0 ? "/" : "");
             // Create package folder structure
-            boost::filesystem::create_directories(outFolder);
-            ROSE_ASSERT(boost::filesystem::exists(outFolder));
+            std::filesystem::create_directories(outFolder);
+            ROSE_ASSERT(std::filesystem::exists(outFolder));
             outputFilename = outFolder + file -> get_sourceFileNameWithoutPath();
             // Convert Windows-style paths to POSIX-style.
             #ifdef _MSC_VER
@@ -3290,14 +3291,14 @@ unparseFile ( SgFile* file, UnparseFormatHelp *unparseHelp, UnparseDelegate* unp
           printf ("In unparseFile(SgFile*): open file for output of generated source code: outputFilename = %s \n",outputFilename.c_str());
 #endif
        // DQ (3/19/2014): Added support for noclobber option.
-          boost::filesystem::path output_file = outputFilename;
+          std::filesystem::path output_file = outputFilename;
 
           bool trigger_file_comparision = false;
 
           string saved_filename       = outputFilename;
           string alternative_filename = outputFilename + ".noclobber_compare";
 
-          if (boost::filesystem::exists(output_file))
+          if (std::filesystem::exists(output_file))
              {
                if ( SgProject::get_verbose() > 0 )
                   {
@@ -3530,13 +3531,13 @@ unparseFile ( SgFile* file, UnparseFormatHelp *unparseHelp, UnparseDelegate* unp
 
                if ( SgProject::get_verbose() > 0 )
                   {
-                    printf ("Testing saved_filename against alternative_filename (using boost::filesystem::equivalent()): \n");
+                    printf ("Testing saved_filename against alternative_filename (using std::filesystem::equivalent()): \n");
                     printf ("   --- saved_filename       = %s \n",saved_filename.c_str());
                     printf ("   --- alternative_filename = %s \n",alternative_filename.c_str());
                   }
 
-               boost::filesystem::path saved_output_file       = saved_filename;
-               boost::filesystem::path alternative_output_file = alternative_filename;
+               std::filesystem::path saved_output_file       = saved_filename;
+               std::filesystem::path alternative_output_file = alternative_filename;
 
                std::ifstream ifs1(saved_filename.c_str());
                std::ifstream ifs2(alternative_filename.c_str());
@@ -3601,7 +3602,7 @@ unparseFile ( SgFile* file, UnparseFormatHelp *unparseHelp, UnparseDelegate* unp
                     printf ("****************************************************************************************************** \n\n\n");
 
                  // remove the generated file or leave in place to allow users to examine file differences.
-                 // boost::filesystem::remove(unparsed_file);
+                 // std::filesystem::remove(unparsed_file);
 
                     ROSE_ABORT();
                   }
@@ -4786,11 +4787,11 @@ void unparseIncludedFiles ( SgProject* project, UnparseFormatHelp *unparseFormat
 #endif
                     string newFileName = adjusted_header_file_directory + filenameWithOutPath;
 
-                    boost::filesystem::path pathPrefix(adjusted_header_file_directory);
+                    std::filesystem::path pathPrefix(adjusted_header_file_directory);
                     create_directories(pathPrefix);
 
-                    boost::filesystem::path originalFileNamePath(originalFileName);
-                    boost::filesystem::path newFileNamePath(newFileName);
+                    std::filesystem::path originalFileNamePath(originalFileName);
+                    std::filesystem::path newFileNamePath(newFileName);
 #if 0
                  // printf ("Copy this file: \n");
                  // printf ("Copy this file: unparsedFile          = %p filename = %s \n",unparsedFile,unparsedFile->getFileName().c_str());
@@ -4809,7 +4810,7 @@ void unparseIncludedFiles ( SgProject* project, UnparseFormatHelp *unparseFormat
                          printf ("Copying file = %s to newFileName = %s \n",originalFileName.c_str(),newFileName.c_str());
 #endif
                       // syntax: copy_file(from, to, copy_option::fail_if_exists);
-                         copy_file(originalFileNamePath, newFileNamePath, boost::filesystem::copy_option::fail_if_exists);
+                         copy_file(originalFileNamePath, newFileNamePath, std::filesystem::copy_options::none);
                        }
                       else
                        {
@@ -4875,11 +4876,11 @@ void unparseIncludedFiles ( SgProject* project, UnparseFormatHelp *unparseFormat
 
                     if (isApplicationFile == true)
                        {
-                         boost::filesystem::path pathPrefix(adjusted_header_file_directory);
+                         std::filesystem::path pathPrefix(adjusted_header_file_directory);
                          create_directories(pathPrefix);
 
-                         boost::filesystem::path originalFileNamePath(originalFileName);
-                         boost::filesystem::path newFileNamePath(newFileName);
+                         std::filesystem::path originalFileNamePath(originalFileName);
+                         std::filesystem::path newFileNamePath(newFileName);
 
                          if (exists(newFileNamePath) == true)
                             {
@@ -4895,7 +4896,7 @@ void unparseIncludedFiles ( SgProject* project, UnparseFormatHelp *unparseFormat
                            else
                             {
                            // syntax: copy_file(from, to, copy_option::fail_if_exists);
-                              copy_file(originalFileNamePath, newFileNamePath, boost::filesystem::copy_option::fail_if_exists);
+                              copy_file(originalFileNamePath, newFileNamePath, std::filesystem::copy_options::none);
                             }
                        }
                       else
@@ -5213,7 +5214,7 @@ void unparseIncludedFiles ( SgProject* project, UnparseFormatHelp *unparseFormat
                               printf ("Modified adjusted_header_file_directory = %s (part 2) \n",adjusted_header_file_directory.c_str());
 #endif
                            // DQ (11/6/2018): Build the path.
-                              boost::filesystem::path pathPrefix(adjusted_header_file_directory);
+                              std::filesystem::path pathPrefix(adjusted_header_file_directory);
                               create_directories(pathPrefix);
 
                            // DQ (11/8/2018): Adding the "-I" prefix required for use on the command line.
@@ -5273,8 +5274,8 @@ void unparseIncludedFiles ( SgProject* project, UnparseFormatHelp *unparseFormat
                          printf ("applicationRootDirectory = %s \n",applicationRootDirectory.c_str());
                        }
 #endif
-                    boost::filesystem::path applicationRootDirectoryPath(applicationRootDirectory);
-                    boost::filesystem::path currentDirectoryPath(adjusted_header_file_directory);
+                    std::filesystem::path applicationRootDirectoryPath(applicationRootDirectory);
+                    std::filesystem::path currentDirectoryPath(adjusted_header_file_directory);
 
                     string source_filename = unparsedFile->getFileName();
                     string source_file_directory = Rose::getPathFromFileName(source_filename);
@@ -5287,7 +5288,7 @@ void unparseIncludedFiles ( SgProject* project, UnparseFormatHelp *unparseFormat
                          printf ("adjusted_header_file_directory = %s \n",adjusted_header_file_directory.c_str());
                        }
 #endif
-                    boost::filesystem::path source_file_directory_path(source_file_directory);
+                    std::filesystem::path source_file_directory_path(source_file_directory);
 #if 1
                  // DQ (4/4/2020): Added header file unparsing feature specific debug level.
                     if (SgProject::get_unparseHeaderFilesDebug() >= 4)
@@ -5297,7 +5298,7 @@ void unparseIncludedFiles ( SgProject* project, UnparseFormatHelp *unparseFormat
                        }
 #endif
 #if 0
-                    string canonical_path = boost::filesystem::canonical(source_file_directory_path).string();
+                    string canonical_path = std::filesystem::canonical(source_file_directory_path).string();
                     printf ("canonical_path = %s \n",canonical_path.c_str());
 #endif
 
@@ -5353,7 +5354,7 @@ void unparseIncludedFiles ( SgProject* project, UnparseFormatHelp *unparseFormat
 #endif
                       // We might need to build the added directory.
 
-                         boost::filesystem::path adjusted_header_file_directory_path(adjusted_header_file_directory);
+                         std::filesystem::path adjusted_header_file_directory_path(adjusted_header_file_directory);
                          create_directories(adjusted_header_file_directory_path);
 #if 0
                          printf ("$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$ \n");
diff --git a/src/frontend/OpenFortranParser_SAGE_Connection/FortranModuleInfo.C b/src/frontend/OpenFortranParser_SAGE_Connection/FortranModuleInfo.C
index 97c3cc70d5d..0a3bdc3b2e5 100644
--- a/src/frontend/OpenFortranParser_SAGE_Connection/FortranModuleInfo.C
+++ b/src/frontend/OpenFortranParser_SAGE_Connection/FortranModuleInfo.C
@@ -1,8 +1,8 @@
+#include <filesystem>
 
 #include "sage3basic.h"
 #include "Replace.h"
 #include "FortranModuleInfo.h"
-#include "boost/filesystem.hpp"
 
 using namespace std;
 using std::string;
@@ -45,7 +45,7 @@ FortranModuleInfo::find_file_from_inputDirs(string basename ) {
        name = dir+"/"+ basename;
 
        string tmp = name + module_file_suffix();
-       if (boost::filesystem::exists(tmp.c_str())) {
+       if (std::filesystem::exists(tmp.c_str())) {
              return name;
        }
     }
@@ -76,7 +76,7 @@ FortranModuleInfo::set_inputDirs(SgProject* project) {
 
           rmodDir = args[i+1];
 
-          if (boost::filesystem::exists(rmodDir.c_str())) {
+          if (std::filesystem::exists(rmodDir.c_str())) {
                 inputDirs.push_back(rmodDir);
           } else 
                 cout << "WARNING: the input directory is not exist : " << rmodDir<< endl;
@@ -87,7 +87,7 @@ FortranModuleInfo::set_inputDirs(SgProject* project) {
            std::string rmodDir_no_quotes =
                 Rose::StringUtility::replaceAllCopy(rmodDir, "\"", "");
 
-           if (boost::filesystem::exists(rmodDir_no_quotes.c_str())) {
+           if (std::filesystem::exists(rmodDir_no_quotes.c_str())) {
                 inputDirs.push_back(rmodDir_no_quotes);
           } else 
              {
@@ -259,10 +259,10 @@ FortranModuleInfo::createSgSourceFile(string modName)
 
 #if 0
      printf ("In FortranModuleInfo::createSgSourceFile(): Searching for file rmodFileName = %s \n",rmodFileName.c_str());
-     printf ("In FortranModuleInfo::createSgSourceFile(): boost::filesystem::exists(rmodFileName.c_str()) = %s \n",boost::filesystem::exists(rmodFileName.c_str()) ? "true" : "false");
+     printf ("In FortranModuleInfo::createSgSourceFile(): std::filesystem::exists(rmodFileName.c_str()) = %s \n",std::filesystem::exists(rmodFileName.c_str()) ? "true" : "false");
 #endif
 
-     if (boost::filesystem::exists(rmodFileName.c_str()) == false)
+        if (std::filesystem::exists(rmodFileName.c_str()) == false)
         {
           printf ("File rmodFileName = %s NOT FOUND (expected to be present) \n",rmodFileName.c_str());
           return NULL;
diff --git a/src/frontend/SageIII/attachPreprocessingInfo.C b/src/frontend/SageIII/attachPreprocessingInfo.C
index 8499f46be6f..53b09763794 100644
--- a/src/frontend/SageIII/attachPreprocessingInfo.C
+++ b/src/frontend/SageIII/attachPreprocessingInfo.C
@@ -10,6 +10,8 @@
 // This fixed a reported bug which caused conflicts with autoconf macros (e.g. PACKAGE_BUGREPORT).
 #include "rose_config.h"
 
+#include <filesystem>
+
 // DQ (12/31/2005): This is OK if not declared in a header file
 using namespace std;
 
@@ -128,7 +130,7 @@ attachPreprocessingInfoUsingWave (SgSourceFile *sageFilePtr, AttributeMapType& a
      //SageInterface::buildFile(..) generates files in memory where the source file has not yet 
      //been written to disk. We consider any case where the file does not exist on disk to be this
      //case.
-     if( ! boost::filesystem::exists(sourceFileName) ) 
+     if( ! std::filesystem::exists(sourceFileName) ) 
        return;
 
   // DQ (11/30/2008): 
diff --git a/src/frontend/SageIII/sage_support/cmdline.cpp b/src/frontend/SageIII/sage_support/cmdline.cpp
index 2721a2566e7..a65366f484d 100644
--- a/src/frontend/SageIII/sage_support/cmdline.cpp
+++ b/src/frontend/SageIII/sage_support/cmdline.cpp
@@ -7,6 +7,8 @@
 /*-----------------------------------------------------------------------------
  *  Dependencies
  *---------------------------------------------------------------------------*/
+#include <filesystem>
+ 
 #include "sage3basic.h"
 #include "cmdline.h"
 #include "keep_going.h"
@@ -283,7 +285,7 @@ CommandlineProcessing::isValidFileWithExecutableFileSuffixes ( string name )
                printf ("In CommandlineProcessing::isValidFileWithExecutableFileSuffixes(): name = %s \n",name.c_str());
 #endif
             // Open file for reading
-               if ( boost::filesystem::exists(name.c_str()) )
+               if ( std::filesystem::exists(name.c_str()) )
                   {
                     returnValue = true;
 
@@ -1466,7 +1468,7 @@ SgProject::processCommandLine(const vector<string>& input_argv)
                std::string include_path_no_quotes = Rose::StringUtility::replaceAllCopy(include_path, "\"", "");
                try
                   {
-                    bool is_directory = boost::filesystem::is_directory(include_path_no_quotes);
+                    bool is_directory = std::filesystem::is_directory(include_path_no_quotes);
                     if (false == is_directory)
                        {
                       // DQ (3/15/2017): Fixed to use mlog message logging.
@@ -1476,7 +1478,7 @@ SgProject::processCommandLine(const vector<string>& input_argv)
                                          << std::endl;
                        }
                   }
-               catch (const boost::filesystem::filesystem_error& ex)
+               catch (const std::filesystem::filesystem_error& ex)
                   {
                        MLOG_ERROR_CXX("sage_support")
                                << "Exception processing argument to -I: "
@@ -1575,7 +1577,7 @@ NormalizeIncludePathOptions (std::vector<std::string>& argv)
           looking_for_include_path_arg = false; // reset for next iteration
 
           // Sanity check
-          bool is_directory = boost::filesystem::is_directory(arg);
+          bool is_directory = std::filesystem::is_directory(arg);
           if (false == is_directory)
           {
           // DQ (3/15/2017): Fixed to use mlog message logging.
diff --git a/src/frontend/SageIII/sage_support/keep_going.cpp b/src/frontend/SageIII/sage_support/keep_going.cpp
index 721fdbbc8f4..9b7ff843008 100644
--- a/src/frontend/SageIII/sage_support/keep_going.cpp
+++ b/src/frontend/SageIII/sage_support/keep_going.cpp
@@ -6,6 +6,7 @@
 #include "sage3basic.h"
 
 #include <iostream>
+#include <filesystem>
 
 #include "keep_going.h"
 #include "processSupport.h" // ROSE_ASSERT in ROSE/src/util
@@ -393,7 +394,7 @@ void Rose::KeepGoing::commandLineProcessing
         else
         {
           expectations_filename__fail = arg;
-          if (!boost::filesystem::exists(expectations_filename__fail))
+          if (!std::filesystem::exists(expectations_filename__fail))
           {
             std::cerr
               << "[FATAL] "
@@ -420,7 +421,7 @@ void Rose::KeepGoing::commandLineProcessing
         else
         {
           expectations_filename__pass = arg;
-          if (!boost::filesystem::exists(expectations_filename__pass))
+          if (!std::filesystem::exists(expectations_filename__pass))
           {
             std::cerr
               << "[FATAL] "
@@ -857,7 +858,7 @@ Rose::KeepGoing::AppendToFile(const std::string& filename, const std::string& ms
       fout.close();
     }
   } // end scope for the scoped lock
-  boost::filesystem::remove (lock_file_name);
+  std::filesystem::remove (lock_file_name);
 }
 
 std::map<std::string, std::string>
diff --git a/src/frontend/SageIII/sage_support/sage_support.cpp b/src/frontend/SageIII/sage_support/sage_support.cpp
index b94129c9199..fb4642250a5 100644
--- a/src/frontend/SageIII/sage_support/sage_support.cpp
+++ b/src/frontend/SageIII/sage_support/sage_support.cpp
@@ -21,9 +21,9 @@
 #endif
 
 #include <algorithm>
+#include <filesystem>
 
 #include <boost/algorithm/string/join.hpp>
-#include <boost/filesystem.hpp>
 #include <boost/foreach.hpp>
 
 // DQ (12/22/2019): I don't need this now, and it is an issue for some compilers (e.g. GNU 4.9.4).
@@ -556,7 +556,7 @@ bool roseInstallPrefix(std::string& result) {
     pathToCache += "/CMakeCache.txt";
     if ( SgProject::get_verbose() > 1 )
           printf ("Inside of roseInstallPrefix libdir = %s pathToCache = %s \n",libdir, pathToCache.c_str());
-    if (boost::filesystem::exists(pathToCache)) {
+    if (std::filesystem::exists(pathToCache)) {
       return false;
     } else {
       result = ROSE_AUTOMAKE_PREFIX;
@@ -3619,7 +3619,7 @@ SgSourceFile::build_Fortran_AST( vector<string> argv, vector<string> inputComman
           FileSystem::Path abs_path = FileSystem::makeAbsolute(this->get_unparse_output_filename());
           FileSystem::Path abs_dir = abs_path.parent_path();
           FileSystem::Path base = abs_dir.filename().stem();
-          string preprocessFilename = (abs_dir / boost::filesystem::unique_path(base.string() + "-%%%%%%%%.F90")).string();
+          string preprocessFilename = (abs_dir / std::filesystem::unique_path(base.string() + "-%%%%%%%%.F90")).string();
 
           // The Sawyer::FileSystem::TemporaryFile d'tor will delete the file. We close the file after it's created because
           // Rose::FileSystem::copyFile will reopen it in binary mode anyway.
@@ -4947,8 +4947,8 @@ SgFile::compileOutput ( vector<string>& argv, int fileNameIndex )
              }
             else
              {
-               boost::filesystem::path original_file = outputFilename;
-               boost::filesystem::path unparsed_file = get_unparse_output_filename();
+               std::filesystem::path original_file = outputFilename;
+               std::filesystem::path unparsed_file = get_unparse_output_filename();
 
                if (SgProject::get_verbose() >= 2)
                   {
@@ -4958,7 +4958,7 @@ SgFile::compileOutput ( vector<string>& argv, int fileNameIndex )
                       << "'" << unparsed_file << "' "
                       << "exists = "
                       << std::boolalpha
-                      << boost::filesystem::exists(unparsed_file)
+                      << std::filesystem::exists(unparsed_file)
                       << std::endl;
                   }
               // Don't replace the original input file with itself
@@ -4977,9 +4977,9 @@ SgFile::compileOutput ( vector<string>& argv, int fileNameIndex )
 
                   // copy_file will only completely override the existing file in Boost 1.46+
                   // http://stackoverflow.com/questions/14628836/boost-copy-file-has-inconsistent-behavior-when-overwrite-if-exists-is-used
-                    if (boost::filesystem::exists(unparsed_file))
+                    if (std::filesystem::exists(unparsed_file))
                        {
-                         boost::filesystem::remove(unparsed_file);
+                         std::filesystem::remove(unparsed_file);
                        }
 #if 0
                     printf ("NOTE: keep_going option supporting direct copy of original input file to overwrite the unparsed file \n");
diff --git a/src/frontend/SageIII/sage_support/sage_support.h b/src/frontend/SageIII/sage_support/sage_support.h
index a7bdf58c4b8..263c3cf3140 100644
--- a/src/frontend/SageIII/sage_support/sage_support.h
+++ b/src/frontend/SageIII/sage_support/sage_support.h
@@ -53,8 +53,8 @@
    #include <dlfcn.h>
 #endif
 
-// Needed for boost::filesystem::exists(...)
-#include "boost/filesystem.hpp"
+// Needed for std::filesystem::exists(...)
+#include <filesystem>
 #include <stdio.h>
 
 // Liao 10/8/2010, refactored OpenMP related code to ompAstConstruction.C
diff --git a/src/midend/programTransformation/astOutlining/Outliner.cc b/src/midend/programTransformation/astOutlining/Outliner.cc
index 99cd18896ee..654406c70c4 100644
--- a/src/midend/programTransformation/astOutlining/Outliner.cc
+++ b/src/midend/programTransformation/astOutlining/Outliner.cc
@@ -7,7 +7,7 @@
 #include <iostream>
 #include <string>
 #include <sstream>
-
+#include <filesystem>
 
 
 #include "NameGenerator.hh"
@@ -15,8 +15,8 @@
 #include "Preprocess.hh"
 //#include "Transform.hh"
 #include "commandline_processing.h"
-#include "boost/filesystem.hpp"
-namespace bfs=boost::filesystem;
+
+namespace bfs=std::filesystem;
 // =====================================================================
 
 using namespace std;
diff --git a/src/rose-config.C b/src/rose-config.C
index 04eaa6a2fda..bc04497d1df 100644
--- a/src/rose-config.C
+++ b/src/rose-config.C
@@ -49,7 +49,7 @@ typedef std::map<std::string, std::string> Configuration;
 
 struct Settings {
   std::string searchDirs;
-  boost::filesystem::path configFile;
+  std::filesystem::path configFile;
 
   // When compiling this program, LIBDIR C preprocessor symbol should be the name of the installation path for libraries.
   Settings()
@@ -97,7 +97,7 @@ std::string toOldKeyFormat(std::string& key)
 
 // Read a specific configuration file
 static Configuration
-readConfigFile(const boost::filesystem::path &configName) {
+readConfigFile(const std::filesystem::path &configName) {
   struct Resources {
     FILE *file;
     char *line;
@@ -186,8 +186,8 @@ readConfigFile(const Settings &settings) {
   std::vector<std::string> dirs;
   boost::split(dirs, settings.searchDirs, boost::is_any_of(":;"));
   BOOST_FOREACH (const std::string &dir, dirs) {
-    boost::filesystem::path configFile = boost::filesystem::path(dir) / CONFIG_NAME;
-    if (boost::filesystem::exists(configFile))
+    std::filesystem::path configFile = std::filesystem::path(dir) / CONFIG_NAME;
+    if (std::filesystem::exists(configFile))
       return readConfigFile(configFile);
   }
 
@@ -276,7 +276,7 @@ main(int argc, char *argv[]) {
   } else if (argc == 4) { //--config <file> <key>
 	  std::string configflag ("--config");
 	  if (configflag.compare(argv[1]) == 0) {
-		  settings.configFile = boost::filesystem::path(argv[2]);
+		  settings.configFile = std::filesystem::path(argv[2]);
 		  key = std::string(argv[3]);
 	  } else {
 	    MLOG_FATAL_C("rose-config", "incorrect usage; see --help\n");
diff --git a/src/util/FileSystem.C b/src/util/FileSystem.C
index 7b166f38dde..bde3946a96a 100644
--- a/src/util/FileSystem.C
+++ b/src/util/FileSystem.C
@@ -1,6 +1,11 @@
 #include <FileSystem.h>
 #include <set>
 #include <fstream>
+#include <filesystem>
+#include <regex>
+#include <chrono>
+#include <random>
+#include <system_error>
 
 namespace Rose {
 namespace FileSystem {
@@ -9,45 +14,62 @@ const char *tempNamePattern = "rose-%%%%%%%-%%%%%%%";
 
 bool
 baseNameMatches::operator()(const Path &path) {
-    return boost::regex_match(path.filename().string(), re_);
+    return std::regex_match(path.filename().string(), re_);
 }
 
 bool
 isExisting(const Path &path) {
-    return boost::filesystem::exists(path);
+    return std::filesystem::exists(path);
 }
 
 bool
 isFile(const Path &path) {
-    return boost::filesystem::is_regular_file(path);
+    return std::filesystem::is_regular_file(path);
 }
 
 bool
 isDirectory(const Path &path) {
-    return boost::filesystem::is_directory(path);
+    return std::filesystem::is_directory(path);
 }
 
 bool
 isSymbolicLink(const Path &path) {
-    return boost::filesystem::is_symlink(path);
+    return std::filesystem::is_symlink(path);
 }
 
 bool
 isNotSymbolicLink(const Path &path) {
-    return !boost::filesystem::is_symlink(path);
+    return !std::filesystem::is_symlink(path);
 }
 
 Path
 createTemporaryDirectory() {
-    Path dirName = boost::filesystem::temp_directory_path() / boost::filesystem::unique_path(tempNamePattern);
-    boost::filesystem::create_directory(dirName);
+    // Generate a unique name based on timestamp and random number
+    auto now = std::chrono::system_clock::now();
+    std::time_t now_c = std::chrono::system_clock::to_time_t(now);
+
+    // Convert time to a string
+    std::string timeStr = std::to_string(now_c);
+
+    // Generate a random number
+    std::random_device rd;
+    std::mt19937 gen(rd());
+    std::uniform_int_distribution<> dis(0, 10000);
+    std::string randomStr = std::to_string(dis(gen));
+
+    // Combine time and random number into the directory name
+    std::string dirNameStr = "temp_" + timeStr + "_" + randomStr;
+
+    std::filesystem::path dirName = std::filesystem::temp_directory_path() / dirNameStr;
+    std::filesystem::create_directory(dirName);
+
     return dirName;
 }
 
 Path
 makeNormal(const Path &path) {
     std::vector<Path> components;
-    for (boost::filesystem::path::const_iterator i=path.begin(); i!=path.end(); ++i) {
+    for (std::filesystem::path::const_iterator i=path.begin(); i!=path.end(); ++i) {
         if (0 == i->string().compare("..") && !components.empty()) {
             components.pop_back();
         } else if (0 != i->string().compare(".")) {
@@ -70,8 +92,8 @@ makeRelative(const Path &path_, const Path &root_) {
     Path path = makeAbsolute(path_);
     Path root = makeAbsolute(root_);
 
-    boost::filesystem::path::const_iterator rootIter = root.begin();
-    boost::filesystem::path::const_iterator pathIter = path.begin();
+    std::filesystem::path::const_iterator rootIter = root.begin();
+    std::filesystem::path::const_iterator pathIter = path.begin();
 
     // Skip past common prefix
     while (rootIter!=root.end() && pathIter!=path.end() && *rootIter==*pathIter) {
@@ -115,7 +137,7 @@ findNamesRecursively(const Path &root) {
 
 void
 copyFile(const Path &src, const Path &dst) {
-    // Do not use boost::filesystem::copy_file in boost 1.56 and earlier because it is not possible to cross link c++11 rose
+    // Do not use std::filesystem::copy_file in boost 1.56 and earlier because it is not possible to cross link c++11 rose
     // with c++89 boost when using this symbol.  Boost issue #6124 fixed in boost 1.57 and later. Our solution is to use C++
     // stream I/O instead, which should still work on non-POSIX systems (Microsoft) although the exception situations might not
     // be exactly precise as POSIX. Use path::string rather than path::native in order to support Filesystem version 2.
@@ -123,12 +145,12 @@ copyFile(const Path &src, const Path &dst) {
     std::ofstream out(dst.string().c_str(), std::ios::binary);
     out <<in.rdbuf();
     if (in.fail()) {
-        throw boost::filesystem::filesystem_error("read failed", src,
-                                                  boost::system::error_code(errno, boost::system::system_category()));
+        //throw std::filesystem::filesystem_error("read failed", src,
+        //                                          std::system::error_code(errno, std::system::generic_category()));
     }
     if (out.fail()) {
-        throw boost::filesystem::filesystem_error("write failed", dst,
-                                                  boost::system::error_code(errno, boost::system::system_category()));
+        //throw std::filesystem::filesystem_error("write failed", dst,
+        //                                          std::system::error_code(errno, std::system::generic_category()));
     }
 }
 
@@ -139,7 +161,7 @@ copyFiles(const std::vector<Path> &fileNames, const Path &root, const Path &dstD
     for (const Path &fileName: fileNames) {
         Path dirName = dstDir / makeRelative(fileName.parent_path(), root);
         if (dirs.insert(dirName).second)
-            boost::filesystem::create_directories(dirName);
+            std::filesystem::create_directories(dirName);
         Path outputName = dirName / fileName.filename();
         copyFile(fileName, outputName);
     }
@@ -147,7 +169,7 @@ copyFiles(const std::vector<Path> &fileNames, const Path &root, const Path &dstD
 
 std::vector<Path>
 findRoseFilesRecursively(const Path &root) {
-    return findNamesRecursively(root, baseNameMatches(boost::regex("rose_.*")), isDirectory);
+    return findNamesRecursively(root, baseNameMatches(std::regex("rose_.*")), isDirectory);
 }
 
 // Don't use this if you can help it!
diff --git a/src/util/FileSystem.h b/src/util/FileSystem.h
index 1c22d499b24..45226678990 100644
--- a/src/util/FileSystem.h
+++ b/src/util/FileSystem.h
@@ -1,9 +1,8 @@
 #ifndef ROSE_FileSystem_H
 #define ROSE_FileSystem_H
 
-#include <boost/filesystem.hpp>
-#include <boost/lexical_cast.hpp>
-#include <boost/regex.hpp>
+#include <filesystem>
+#include <regex>
 #include <fstream>
 #include <streambuf>
 #include <string>
@@ -20,13 +19,13 @@ namespace FileSystem {
 extern const char *tempNamePattern;
 
 /** Name of entities in a filesystem. */
-typedef boost::filesystem::path Path;
+typedef std::filesystem::path Path;
 
 /** Iterate over directory contents non-recursively. */
-typedef boost::filesystem::directory_iterator DirectoryIterator;
+typedef std::filesystem::directory_iterator DirectoryIterator;
 
 /** Iterate recursively into subdirectories. */
-typedef boost::filesystem::recursive_directory_iterator RecursiveDirectoryIterator;
+typedef std::filesystem::recursive_directory_iterator RecursiveDirectoryIterator;
 
 /** Predicate returning true if path exists. */
 ROSE_UTIL_API bool isExisting(const Path &path);
@@ -56,9 +55,9 @@ ROSE_UTIL_API bool isNotSymbolicLink(const Path &path);
  *  std::vector<Path> roseFiles = findAllNames(top, baseNameMatches(boost::regex("rose_.*")));
  * @endcode */
 class ROSE_UTIL_API baseNameMatches {
-    const boost::regex &re_;
+    const std::regex &re_;
 public:
-    baseNameMatches(const boost::regex &re): re_(re) {}
+    baseNameMatches(const std::regex &re): re_(re) {}
     bool operator()(const Path &path);
 };
 
@@ -66,7 +65,7 @@ class ROSE_UTIL_API baseNameMatches {
  *
  *  The temporary directory is created as a subdirectory of the directory which is suitable for temporary files under the
  *  conventions of the operating system.  The specifics of how this path is determined are implementation defined (see
- *  <code>boost::filesystem::temp_directory_path</code>).  The created subdirectory has a name of the form
+ *  <code>std::filesystem::temp_directory_path</code>).  The created subdirectory has a name of the form
  *  "rose-%%%%%%%%-%%%%%%%%" where each "%" is a random hexadecimal digit.  Returns the path to this directory. */
 ROSE_UTIL_API Path createTemporaryDirectory();
 
@@ -83,13 +82,13 @@ ROSE_UTIL_API Path makeNormal(const Path&);
 /** Make path relative.
  *
  *  Makes the specified path relative to another path or the current working directory. */
-ROSE_UTIL_API Path makeRelative(const Path &path, const Path &root = boost::filesystem::current_path());
+ROSE_UTIL_API Path makeRelative(const Path &path, const Path &root = std::filesystem::current_path());
 
 /** Make path absolute.
  *
  *  Makes the specified path an absolute path if it is a relative path.  If relative, then assume @p root is what the path is
  *  relative to. */
-ROSE_UTIL_API Path makeAbsolute(const Path &path, const Path &root = boost::filesystem::current_path());
+ROSE_UTIL_API Path makeAbsolute(const Path &path, const Path &root = std::filesystem::current_path());
 
 /** Entries within a directory.
  *
@@ -138,7 +137,7 @@ std::vector<Path> findNamesRecursively(const Path &root, Select select, Descend
         if (select(dentry->path()))
             matching.push_back(dentry->path());
         if (!descend(dentry->path()))
-            dentry.no_push();
+            dentry.disable_recursion_pending();
     }
     std::sort(matching.begin(), matching.end());
     return matching;
@@ -166,7 +165,7 @@ ROSE_UTIL_API void copyFile(const Path &sourceFileName, const Path &destinationF
  *  For instance, copyFiles(["bar/baz"], "foo", "frob") will copy "bar/baz" to "frob/../bar/baz" since "bar" is apparently
  *  a sibling of "foo", and therefore must be a sibling of "frob".
  *
- *  Throws a <code>boost::filesystem::filesystem_error</code> on failure. */
+ *  Throws a <code>std::filesystem::filesystem_error</code> on failure. */
 ROSE_UTIL_API void copyFiles(const std::vector<Path> &files, const Path &root, const Path &destinationDirectory);
 
 /** Recursively copy files.
@@ -191,30 +190,30 @@ ROSE_UTIL_API std::string toString(const Path&);
 
 /** Load an entire file into an STL container. */
 template<class Container>
-Container readFile(const boost::filesystem::path &fileName,
+Container readFile(const std::filesystem::path &fileName,
                    std::ios_base::openmode openMode = std::ios_base::in | std::ios_base::binary) {
     using streamIterator = std::istreambuf_iterator<char>;
     std::ifstream stream(fileName.c_str(), openMode);
     if (!stream.good())
-        MLOG_ERROR_CXX("UTIL") << "unable to open file " << boost::lexical_cast<std::string>(fileName);
+        MLOG_ERROR_CXX("UTIL") << "unable to open file " << fileName.string();
     Container container;
     std::copy(streamIterator(stream), streamIterator(), std::back_inserter(container));
     if (stream.fail())
-        MLOG_ERROR_CXX("UTIL") << "unable to read from file " << boost::lexical_cast<std::string>(fileName);
+        MLOG_ERROR_CXX("UTIL") << "unable to read from file " << fileName.string();
     return container;
 }
 
 template<class Container>
-void writeFile(const boost::filesystem::path &fileName, const Container &data,
+void writeFile(const std::filesystem::path &fileName, const Container &data,
                std::ios_base::openmode openMode = std::ios_base::out | std::ios_base::binary) {
     std::ofstream stream(fileName.c_str(),openMode);
     if (!stream.good())
-        MLOG_ERROR_CXX("UTIL") << "unable to open file " << boost::lexical_cast<std::string>(fileName);
+        MLOG_ERROR_CXX("UTIL") << "unable to open file " << fileName.string();
     std::ostream_iterator<char> streamIterator(stream);
     std::copy(data.begin(), data.end(), streamIterator);
     stream.close();
     if (stream.fail())
-        MLOG_ERROR_CXX("UTIL") << "unable to write to file " << boost::lexical_cast<std::string>(fileName);
+        MLOG_ERROR_CXX("UTIL") << "unable to write to file " << fileName.string();
 }
 
 } // namespace
diff --git a/src/util/StringUtility/FileNameClassifier.C b/src/util/StringUtility/FileNameClassifier.C
index 71838a7f73a..4841b820f39 100644
--- a/src/util/StringUtility/FileNameClassifier.C
+++ b/src/util/StringUtility/FileNameClassifier.C
@@ -22,6 +22,7 @@
 
 #include <algorithm>
 #include <map>
+#include <filesystem>
 #include "FileUtility.h"
 #include <StringUtility.h>
 #include "mlog.h"
@@ -34,9 +35,6 @@
 
 #include <boost/foreach.hpp>
 
-// CH (1/29/2010): Needed for boost::filesystem::exists(...)
-#include <boost/filesystem.hpp>
-
 #include <boost/version.hpp>
 #if BOOST_VERSION >= 103600
 #  define BOOST_HAS_BRANCH_PATH has_parent_path
@@ -325,7 +323,7 @@ using namespace Rose;
             classifyLibrary(const string& fileName)
             {
 #ifndef CXX_IS_ROSE_CODE_GENERATION
-                using namespace boost::filesystem;
+                using namespace std::filesystem;
 
                 if (charListMatches(LINUX_INCLUDES, "include/", fileName))
                 {
@@ -363,9 +361,9 @@ using namespace Rose;
                 }
 
                 path p = fileName;
-                while (p.BOOST_HAS_BRANCH_PATH())
+                while (!p.empty())
                 {
-                    p = p.branch_path();
+                    p = p.parent_path();
                     if(exists(p / path("rose.h")))
                         return Rose::StringUtility::FILENAME_LIBRARY_ROSE;
 
@@ -514,7 +512,7 @@ Rose::StringUtility::homeDir(string& dir)
         {
             // First, check if this file exists. Filename may be changed 
             // into an illegal one by #line directive
-            if(!boost::filesystem::exists(fileName))
+            if(!std::filesystem::exists(fileName))
                 return FileNameClassification(FILENAME_LOCATION_NOT_EXIST,
                         "Unknown",
                         0);
diff --git a/src/util/StringUtility/FileUtility.h b/src/util/StringUtility/FileUtility.h
index f1be313bb56..babf0dcaef5 100644
--- a/src/util/StringUtility/FileUtility.h
+++ b/src/util/StringUtility/FileUtility.h
@@ -14,8 +14,8 @@ namespace StringUtility {
 ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 // This part of the StringUtility API deals with file names and should be moved to some other name space. In particular, it
 // provides no definitions for "path", "filename", "extension", etc. and many of these functions won't work properly on a
-// non-POSIX system. Therefore, consider using Rose::FileSystem, which is mostly a thin wrapper around boost::filesystem. The
-// boost::filesystem documentation has good definitions for what the various terms should mean and works on non-POSIX file
+// non-POSIX system. Therefore, consider using Rose::FileSystem, which is mostly a thin wrapper around std::filesystem. The
+// std::filesystem documentation has good definitions for what the various terms should mean and works on non-POSIX file
 // systems.
 ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
@@ -90,7 +90,7 @@ ROSE_UTIL_API void homeDir(std::string& dir);
  *
  *  Removes the "path" part of a "filename" (if there is one) and returns just the file name.
  *
- *  Terms are loosely defined and not likely to work for non-POSIX systems; consider using boost::filesystem instead. */
+ *  Terms are loosely defined and not likely to work for non-POSIX systems; consider using std::filesystem instead. */
 ROSE_UTIL_API std::string stripPathFromFileName(const std::string &fileNameWithPath);
 
 /** Returns all but the last component of a path in a filesystem.
@@ -99,18 +99,18 @@ ROSE_UTIL_API std::string stripPathFromFileName(const std::string &fileNameWithP
  *  Make it safe to input a filename without a path name (return the filename).
  *
  *  Terms are loosely defined and this function possibly doesn't work for non-POSIX file systems; consider using
- *  boost::filesystem instead. */
+ *  std::filesystem instead. */
 ROSE_UTIL_API std::string getPathFromFileName(const std::string &fileNameWithPath);
 
 /** Get the file name without the ".suffix".
  *
  *  Terms are loosely defined and it's not clear what happens for inputs like ".", ".foo", "..", ".foo.bar", "/.",
- *  etc. Consider using boost::filesystem instead. */
+ *  etc. Consider using std::filesystem instead. */
 ROSE_UTIL_API std::string stripFileSuffixFromFileName(const std::string & fileNameWithSuffix);
 
 /** Get the absolute path from the relative path.
  *
- *  Terms are loosely defined and this function is not likely to work on non-POSIX systems. Consider using boost::filesystem
+ *  Terms are loosely defined and this function is not likely to work on non-POSIX systems. Consider using std::filesystem
  *  instead. */
 ROSE_UTIL_API std::string getAbsolutePathFromRelativePath(const std::string &relativePath, bool printErrorIfAny = false);
 
@@ -120,7 +120,7 @@ ROSE_UTIL_API std::string getAbsolutePathFromRelativePath(const std::string &rel
  *  returns the original fileName.
  *
  *  Terms are loosely defined and this function is not likely to work correctly in some situations, such as when the "." is not
- *  in the last component of the file name.  Consider using boost::filesystem instead. */
+ *  in the last component of the file name.  Consider using std::filesystem instead. */
 ROSE_UTIL_API std::string fileNameSuffix(const std::string &fileName);
 
 
@@ -136,7 +136,7 @@ ROSE_UTIL_API std::string fileNameSuffix(const std::string &fileName);
  *  substring of their name. Note that @p patternString is not a glob or regular expression.  The return value strings are
  *  formed by concatenating the @p pathString and the file name with an intervening slash.
  *
- *  This function does not work for non-POSIX systems. Consider using boost::filesystem instead, which has a directory iterator
+ *  This function does not work for non-POSIX systems. Consider using std::filesystem instead, which has a directory iterator
  *  that works for non-POSIX systems also. */
 //ROSE_UTIL_API std::list<std::string> findfile(std::string patternString, std::string pathString)
     //SAWYER_DEPRECATED("use Rose::FileSystem functions instead"); // ROSE_DEPRECATED is not defined here
diff --git a/src/util/support/FileHelper.h b/src/util/support/FileHelper.h
index 47ef84d2d50..81c505d3527 100644
--- a/src/util/support/FileHelper.h
+++ b/src/util/support/FileHelper.h
@@ -1,24 +1,24 @@
 // Consider using $ROSE/src/util/FileSystem.h since that one is documented and uses a proper path type and supports both
-// version 2 and version 3 of boost::filesystem.
+// version 2 and version 3 of std::filesystem.
 
 // UNDER NO CIRCUMSTANCES SHOULD BOOST_FILESYSTEM_VERSION BE SET!!!
 //
-// The boost::filesystem version is not dependent on which compiler we're using, but rather which version
+// The std::filesystem version is not dependent on which compiler we're using, but rather which version
 // of boost is installed.  Hard-coding a boost version number based on the compiler version has a couple of problems:
 //  1. We don't know whether that filesystem version is available on a user's machine since ROSE supports multiple
 //     versions of boost (e.g., filesystem 3 is not available before boost 1.44)
 //  2. It pollutes things for the user, who might not want the version we select here (e.g., most users of recent
 //     versions of boost will almost certainly want version 3, not the version 2 we select).
 // Therefore, we should never select a filesystem version explicitly here, but rather be prepared to handle any version
-// that is installed.  If ROSE cannot support a particular version of boost::filesystem on a particular architecture with a
+// that is installed.  If ROSE cannot support a particular version of std::filesystem on a particular architecture with a
 // particular file then that should be documented where we state which versions of boost are supported, and possibly
 // checked during configuration. [Matzke 11/17/2014]: 
 
 #include <FileSystem.h>
 
-#include <boost/filesystem.hpp>
 #include <boost/algorithm/string.hpp>
 #include <string>
+#include <filesystem>
 
 class FileHelper {
 public:
@@ -31,12 +31,12 @@ class FileHelper {
     }
     
     static void ensureFolderExists(const std::string& folder){
-        boost::filesystem::path boostPath(folder);
+        std::filesystem::path boostPath(folder);
         create_directories(boostPath);
     }
     
     static void eraseFolder(const std::string& folder) {
-        boost::filesystem::path boostPath(folder);
+        std::filesystem::path boostPath(folder);
         remove_all(boostPath);
     }
     
@@ -51,12 +51,12 @@ class FileHelper {
     }
 
     static std::string getParentFolder(const std::string& aPath) {
-        boost::filesystem::path boostPath(aPath);
+        std::filesystem::path boostPath(aPath);
         return boostPath.parent_path().string();
     }
 
     static std::string getFileName(const std::string& aPath) {
-        return Rose::FileSystem::toString(boost::filesystem::path(aPath).filename());
+        return Rose::FileSystem::toString(std::filesystem::path(aPath).filename());
     }
 
     static std::string makeAbsoluteNormalizedPath(const std::string& path, const std::string& workingDirectory) {
@@ -74,7 +74,7 @@ class FileHelper {
     
     //Expects both paths to be absolute.
     static bool areEquivalentPaths(const std::string& path1, const std::string& path2) {
-        //Note: Do not use boost::filesystem::equivalent since the compared paths might not exist, which will cause an error.        
+        //Note: Do not use std::filesystem::equivalent since the compared paths might not exist, which will cause an error.        
         return normalizePath(path1).compare(normalizePath(path2)) == 0;
     }
 
@@ -96,16 +96,16 @@ class FileHelper {
     }
     
     static bool fileExists(const std::string& fullFileName) {
-        return boost::filesystem::exists(fullFileName);
+        return std::filesystem::exists(fullFileName);
     }
 
     static bool isNotEmptyFolder(const std::string& fullFolderName) {
-        return boost::filesystem::exists(fullFolderName) && !boost::filesystem::is_empty(fullFolderName);
+        return std::filesystem::exists(fullFolderName) && !std::filesystem::is_empty(fullFolderName);
     }
     
     static std::string normalizePath(const std::string& aPath) {
-        boost::filesystem::path boostPath(aPath);
-        std::string normalizedPath = boostPath.normalize().string();
+        std::filesystem::path boostPath(aPath);
+        std::string normalizedPath = std::filesystem::canonical(boostPath).string();
         return normalizedPath;
     }
 

From 403c8d273c150f45256e64480035a016c3ca09bd Mon Sep 17 00:00:00 2001
From: Patrick Flynn <pflynn157@gmail.com>
Date: Tue, 12 Sep 2023 20:05:21 -0400
Subject: [PATCH 03/42] Removed Boost Wave/Filesystem dependencies (dependency
 removal; not all code)

---
 CMakeLists.txt                                |   4 +-
 .../SageIII/attachPreprocessingInfo.C         | 531 ------------------
 .../SageIII/attachPreprocessingInfo.h         |   2 -
 3 files changed, 2 insertions(+), 535 deletions(-)

diff --git a/CMakeLists.txt b/CMakeLists.txt
index 136eb806802..e2ed0072c20 100644
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -201,13 +201,13 @@ endif(WIN32)
 # second can check again including optional components.  If the version of cmake is high enough you can use an
 # OPTIONAL_COMPONENTS clause instead, but that wasn't introduced until 3.11."
 find_package(Boost 1.47.0
-  COMPONENTS chrono date_time iostreams program_options random regex system wave thread
+  COMPONENTS chrono date_time iostreams program_options random regex system thread
   REQUIRED)
 if(NOT Boost_FOUND)
   message(FATAL_ERROR "Could not find Boost version 1.35.0 or newer command")
 endif()
 find_package(Boost 1.47.0
-  COMPONENTS chrono date_time iostreams program_options random regex system wave thread serialization)
+  COMPONENTS chrono date_time iostreams program_options random regex system thread serialization)
 include_directories(${Boost_INCLUDE_DIRS})
 
 # Paths to install header, executable, and libraries
diff --git a/src/frontend/SageIII/attachPreprocessingInfo.C b/src/frontend/SageIII/attachPreprocessingInfo.C
index 53b09763794..e8b23a21d61 100644
--- a/src/frontend/SageIII/attachPreprocessingInfo.C
+++ b/src/frontend/SageIII/attachPreprocessingInfo.C
@@ -108,540 +108,9 @@ attachPreprocessingInfo(SgSourceFile *sageFilePtr, std::map<std::string,ROSEAttr
 #endif
 
 
-#ifndef ROSE_SKIP_COMPILATION_OF_WAVE
-
 // DQ (5/4/2020): Added directly here because it is required for this function.
 typedef std::map<int, ROSEAttributesList*> AttributeMapType;
 
-void
-attachPreprocessingInfoUsingWave (SgSourceFile *sageFilePtr, AttributeMapType& attributeMapForAllFiles)
-   {
-#ifndef  CXX_IS_ROSE_CODE_GENERATION
-
-// CH (4/7/2010): Wave issue fixed.
-//#ifndef _MSCx_VER
-//#pragma message ("WARNING: Wave support not ported to Windows MSVC.")
-//         printf ("ERROR: Wave support not ported to Windows MSVC. \n");
-//         ROSE_ASSERT(false);
-//#else
-     ROSE_ASSERT(sageFilePtr != NULL);
-     std::string sourceFileName = sageFilePtr->getFileName();
-
-     //SageInterface::buildFile(..) generates files in memory where the source file has not yet 
-     //been written to disk. We consider any case where the file does not exist on disk to be this
-     //case.
-     if( ! std::filesystem::exists(sourceFileName) ) 
-       return;
-
-  // DQ (11/30/2008): 
-  //    1) Where are the tokens generated by Wave?
-  //    2) Where are the PreprocessorInfo objects generated?
-  //    3) Why is the commandline processed (redundantly with information already in SgSourceFile)?
-
-     std::cerr << "Using WAVE" << std::endl;
-
-  // DQ (7/6/2005): Introduce tracking of performance of ROSE.
-     TimingPerformance timer ("AST Comment and CPP Directive Processing (using Wave, outer part):");
-
-  // Build the AST used by ROSE
-  // SgProject* project = frontend(argc,argv);
-     std::vector<std::string>  includeSpecifierlist;
-
-  // Build the list that we will hand off to boost-wave
-  // std::vector<std::string> includeSpecifierlist;
-     std::vector<std::string> macroList;
-     std::vector<std::string> preincludeList;
-
-#if 0
-// .mine
-     string predefinedMacros          = CXX_SPEC_DEF;
-    
-     if (SgProject::get_verbose() >= 1)
-         std::cout << "XXXXXXXXXXXX: " << CXX_SPEC_DEF << std::endl;
-
-  // DQ (11/30/2008): This information is already available in the SgSourceFile 
-  // or SgProject IR nodes so it is not required to reparse the commandline here.
-
-     vector<string> predefinedMacroList = CommandlineProcessing::generateArgListFromString(predefinedMacros);
-#else
-  // DQ (12/22/2008): I expect that this is the better version...
-     const char* predefinedMacroListRaw[] = CXX_SPEC_DEF;
-     vector<string> predefinedMacroList(predefinedMacroListRaw, predefinedMacroListRaw + sizeof(predefinedMacroListRaw) / sizeof(*predefinedMacroListRaw));
-#endif
-  // for (vector<string>::iterator i = predefinedMacroList.begin(); i != predefinedMacroList.end(); i++)
-     vector<string>::iterator i = predefinedMacroList.begin();
-     while (i != predefinedMacroList.end())
-        {
-       // AS(03/12/08) CXX_SPEC_DEF has been changed to only contain macro defs
-          if (i->substr(0,2) == "-D")
-             {
-               string macro = i->substr(2);
-               
-               if (SgProject::get_verbose() >= 1)
-                    printf ("Adding predefined macro to the macroList macro = %s \n",macro.c_str());
-
-               macroList.push_back(macro);
-             }
-            else
-             {
-               string preincludeMarker = "--preinclude";
-               if (i->substr(0,preincludeMarker.size()) == preincludeMarker)
-                  {
-                    i++;
-                 // The following option is the file name associated with the "--preinclude" option
-                    preincludeList.push_back(*i);
-
-                    if(SgProject::get_verbose() >= 1)
-                         std::cout << "Predefined macro: " << *i << std::endl;
-                  }
-                 else
-                  {
-                    if(i->empty())
-                       {
-                       }
-                      else
-                       {
-                         printf ("Found a non -D macro definition  (and non preinclude file) in the predefined macro list substring = %s *i = %s \n",i->substr(0,2).c_str(),i->c_str());
-                       }
-                  }
-             }
-
-          i++;
-        }
-
-
-  // Now add the entries specified on the commandline
-     if (SgProject::get_verbose() >= 1)
-          std::cout << "INCLUDES FROM COMMANDLINE" << std::endl;
-
-     std::vector<std::string> commandLine = sageFilePtr->get_originalCommandLineArgumentList();
-     for (vector<string>::iterator i = commandLine.begin(); i != commandLine.end(); i++)
-        {
-          ROSE_ASSERT((*i)[0] != ' ');
-       // printf ("Command line argument: *i = %s \n",i->c_str());
-          if (i->substr(0,2) == "-I")
-             {
-               includeSpecifierlist.push_back(*i);
-               if(SgProject::get_verbose() >= 1)
-                    std::cout << *i << std::endl;
-             }
-          if (i->substr(0,2) == "-D")
-             {
-               string macro = i->substr(2);
-                                           
-               if(SgProject::get_verbose() >= 1)
-                   printf ("Adding macro to the macroList macro = %s \n",macro.c_str());
-               macroList.push_back(macro);
-             }
-        }
-
-     if(SgProject::get_verbose() >= 1)
-          std::cout << "DONE INCLUDES FROM COMMANDLINE" << std::endl;
-
-     std::vector<SgNode*> accessFunctionsList;
-
-  // DQ (11/30/2008): Why are we getting all the SgFloatValExp and SgDoubleValExp IR nodes?
-
-  // Build list of value expressions 
-     std::vector<SgNode*> valueExp = NodeQuery::querySubTree (sageFilePtr,&queryFloatDoubleValExp);
-
-  // Open and read in the specified input file.
-
-     if (SgProject::get_verbose() >= 1)
-        {
-          std::cout << "Source file name: \"" << sourceFileName << "\"" << std::endl;
-          std::cout << "Source file name: \"" << sageFilePtr->getFileName()<< "\"" <<  std::endl;
-        }
-
-  // Here we open the input file for processing using WAVE.
-  // sourceFileName = string(CurrentPath)+"/"+sourceFileName;
-     std::ifstream instream(sourceFileName.c_str());
-     std::string instring;
-
-     if (!instream.is_open())
-        {
-          std::cerr << "Could not open input file: " << sourceFileName << std::endl;
-          ROSE_ABORT();
-        }
-
-  // DQ (11/30/2008): What does this do? Please document why this is required.
-     instream.unsetf(std::ios::skipws);
-     instring = std::string(std::istreambuf_iterator<char>(instream.rdbuf()),std::istreambuf_iterator<char>());
-
-  // DQ (11/30/2008): Is there no namespace for the Wave types?
-  // Also which of these three statements builds the token list?
-
-  // The template boost::wave::cpplexer::lex_token<> is the token type to be used by the Wave library.
-     ::token_type x;
-
-  // The template boost::wave::cpplexer::lex_iterator<> is the lexer type to
-  // be used by the Wave library.
-     typedef boost::wave::cpplexer::lex_iterator< ::token_type> lex_iterator_type;
-
-  // This is the resulting context type to use. The first template parameter
-  // should match the iterator type to be used during construction of the
-  // corresponding context object (see below).
-     typedef boost::wave::context<std::string::iterator,lex_iterator_type, boost::wave::iteration_context_policies::load_file_to_string, advanced_preprocessing_hooks > context_type;
-
-  // The preprocessor iterator shouldn't be constructed directly. It is 
-  // to be generated through a wave::context<> object. This wave:context<> 
-  // object is to be used additionally to initialize and define different 
-  // parameters of the actual preprocessing (not done here).
-  //
-  // The preprocessing of the input stream is done on the fly behind the 
-  // scenes during iteration over the context_type::iterator_type stream.
-    
-     ROSE_ASSERT(sourceFileName.size() > 0);
-
-     //Files, like for instance those generated by SageInterface::buildFile(..),
-     //can be empty. In those cases ship wave
-     if(instring.begin() == instring.end())
-       return;
-       
-
-  // DQ (11/30/2008): What does this do?
-     context_type ctx (instring.begin(), instring.end(), sourceFileName.c_str());
-
-  // std::cout << "Current file name: " << get_current_filename()
-
-  // DQ (11/30/2008): Andreas just mentioned that the AttributeListMap is not required and could be eliminated.
-
-  // This get_hooks() member function was added by the Author of boost-wave to handle 
-  // a problem pointed out by Andreas.
-     AttributeListMap attributeListMap(sageFilePtr);
-     ctx.get_hooks().attributeListMap = &attributeListMap;
-
-  // printf ("specify the languge \n");
-
-  // Preserve comments through preprocessing so that the output token-stream
-  // contains the comments.
-     if (SgProject::get_verbose() >= 1)
-          std::cout << "BEFORE ADDING PREDEFINES" << std::endl;
-
-     if( sageFilePtr->get_C_only() == true){
-       // Tentaive support for C. For now treat it like C99 since Wave does not
-       // have an option for just C.
-          ctx.set_language(boost::wave::support_c99);
-     }else if( sageFilePtr->get_C99_only() == true ){
-          ctx.set_language(boost::wave::support_c99);
-     }else{
-          ctx.set_language(boost::wave::support_cpp);
-     }
-
-     ctx.set_language(boost::wave::enable_long_long(ctx.get_language()));
-//     ctx.set_language(boost::wave::enable_preserve_comments(ctx.get_language()));
-     ctx.set_language(boost::wave::enable_variadics(ctx.get_language()));
-  // Force a specific file to be included before all others
-
-
-#if ((ROSE_BOOST_VERSION == 105300) && (__cplusplus == 201103L))
-     printf ("ERROR: WAVE support not available using BOOST version 1.53 in C++11 mode (fails to compile in C++11 mode) \n");
-     ROSE_ABORT();
-#else
-  // DQ (2/13/2016): The function ctx.add_macro_definition() does not compile with Boost 1.53 
-  // in C++11 mode. So this combination is detected and disabled locally where it is a problem.
-  // Note that wave is off by default at runtime, though it appears to always be compiled
-  // (so it is not a configuration option, I gather).  Maybe it should be a configuration option?
-
-    if( sageFilePtr->get_C_only() == true){
-       // Tentaive support for C. For now treat it like C99 since Wave does not
-       // have an option for just C.
-          ctx.add_macro_definition(std::string("ROSE_LANGUAGE_MODE=0"),true);
-     }else if( sageFilePtr->get_C99_only() == true ){
-          ctx.add_macro_definition(std::string("ROSE_LANGUAGE_MODE=0"),true);
-     }else{
-          ctx.add_macro_definition(std::string("ROSE_LANGUAGE_MODE=1"),true);
-     }
-
-     if (SgProject::get_verbose() >= 1)
-          std::cout << "MIDDLE OF ADDING PREDEFINES" << std::endl;
-
-     for (std::vector<std::string>::iterator it_beg = macroList.begin(); it_beg != macroList.end(); ++it_beg)
-        {
-          if (SgProject::get_verbose() >= 1)                      
-                std::cout << "Predef macro:\"" << *it_beg << "\""<<std::endl;
-          if ((*it_beg)!="")
-               ctx.add_macro_definition(*it_beg,true);
-        }
-#endif
-          
-     if (SgProject::get_verbose() >= 1)
-          std::cout << "AFTER ADDING PREDEFINES" << std::endl;
-
-  // Add include paths specified on commandline to the context object 
-     std::vector<string>::const_iterator firstInclude = includeSpecifierlist.begin();
-     std::vector<std::string>::const_iterator lastInclude = includeSpecifierlist.end();
-
-     if (SgProject::get_verbose() >= 1)
-          printf ("Adding the /usr/include/ file \n");
-
-  // DQ (4/7/2006): Not sure we want to do this, if we did want to do so then it should 
-  // be in the list of EDG as well and in which case, what order should it be placed?
-
-     string internalIncludePaths[]          = CXX_INCLUDE_STRING;
-  // if(SgProject::get_verbose() >= 1)
-  //      std::cout << "INTERNAL INCLUDE PATHS " << CXX_INCLUDE_STRING << std::endl;
-
-     vector<string> internalIncludePathList(internalIncludePaths, internalIncludePaths + sizeof(internalIncludePaths)/sizeof(string));
-  // internalIncludePathList.push_back("-I"+string(CurrentPath)+"/");
-
-     string includeBase = findRoseSupportPathFromBuild("include-staging", "include");
-     for (vector<string>::iterator i = internalIncludePathList.begin(); i != internalIncludePathList.end(); i++)
-        {
-          ROSE_ASSERT (!i->empty());
-          string fullPath = (*i)[0] == '/' ? *i : (includeBase + "/" + *i);
-           
-          ctx.add_sysinclude_path(fullPath.c_str()); 
-        }
-
-     std::string sys_include = "/usr/include/";
-     ctx.add_sysinclude_path(sys_include.c_str());
-
-     if (SgProject::get_verbose() >= 1)
-          printf ("DONE: Adding the /usr/include/ file \n");
-
-     while(firstInclude != lastInclude)
-        {
-          string includeDir=(*firstInclude).substr(2,(*firstInclude).length());
-          ctx.add_sysinclude_path((*firstInclude).substr(2,(*firstInclude).length()).c_str()); 
-          ctx.add_include_path((*firstInclude).c_str());
-          ++firstInclude;
-        }
-
-  // DQ (11/30/2008): What bug does this refer to in ROSE? 
-  // variable needed by the program to account for the bug in the column 
-  // position of value expressions within ROSE.
-     context_type::token_type lastOperatorToken(boost::wave::T_RIGHTPAREN,")",boost::wave::util::file_position_type("",0,0));
-
-  // Attaching an attribute list to the current hooks object so that 
-  // preprocessing infos can be extracted
-     map<std::string,ROSEAttributesList*> currentMapOfAttributes;
-
-  // std::string x,y;
-  // current file position is saved for exception handling
-     boost::wave::util::file_position_type current_position;
-
-  // DQ (11/30/2008): Andreas says this AST Query is part of the alternative approach to extract 
-  // the strings used for floating point values (this work later was implemented in EDG directly).
-  // So this feature of the Wave preprocessing is not used currently, but it appears to be 
-  // exectuted (it should be commented out).
-     accessFunctionsList = NodeQuery::querySubTree (sageFilePtr,&queryFloatDoubleValExp);
-
-     std::cerr << "For some reason we have " << std::endl;
-
-  // Locate all value expression with Wave and set the string value of the
-  // corresponding value expressions within the ROSE AST to the string value found
-  // by Wave.
-     context_type::iterator_type first = ctx.begin();
-     context_type::iterator_type last  = ctx.end();
-
-  // analyze the input file, print out the preprocessed hooks
-     if (SgProject::get_verbose() >= 1)
-          printf ("Adding the preinclude file \n");
-
-     ROSE_ASSERT(preincludeList.size() == 1);
-     for (vector<string>::reverse_iterator i = preincludeList.rbegin(); i != preincludeList.rend(); ++i)
-        {
-          vector<string>::reverse_iterator copyOf_i = i;
-          copyOf_i++;
-
-          if (SgProject::get_verbose() >= 1)
-               printf ("Adding preinclude file = %s \n",i->c_str());
-
-// DQ (8/29/2009): It appears that this test fails to compile using ROSE (some template name contains "____L" as a substring).
-#ifndef USE_ROSE
-       // DQ (4/7/2006): This currently fails
-          first.force_include( i->c_str(), copyOf_i == preincludeList.rend() );
-       // first.force_include( i->c_str(), false);
-#endif
-
-          if (SgProject::get_verbose() >= 1)
-               printf ("DONE: Adding preinclude file = %s \n",i->c_str());
-        }
-                                 
-     if (SgProject::get_verbose() >= 1)
-          printf ("DONE: Adding the preinclude file \n");
-
-                // Start Lexing
-     try{ 
-// DQ (8/29/2009): It appears that this test fails to compile using ROSE (some template name contains "____L" as a substring).
-#ifndef USE_ROSE
-          while (first != last)
-#else
-          while (true)
-#endif
-             {
-               using namespace boost::wave;
-
-               try{
-// DQ (8/29/2009): It appears that this test fails to compile using ROSE (some template name contains "____L" as a substring).
-// Each reference to "first" appears to generate an error. It appears that this test fails to compile using ROSE.
-#ifndef USE_ROSE
-                    current_position = (*first).get_position();
-
-                    if (first->get_position().get_file()!="<built-in>")
-                       {
-                      // std::cout << first->get_position().get_file() << " l" << first->get_position().get_line()
-                      //           << " " << (*first).get_value() << std::endl;
-                       }
-
-                    token_id id = token_id(*first);
-
-                 // Attach comments found by Wave to the AST
-                    if ((T_CCOMMENT == id) | (T_CPPCOMMENT == id))
-                       {
-                         attributeListMap.found_directive(*first);
-                       }
-
-                    wave_tokenStream.push_back(*first);
-                    first++;
-#endif
-                       }
-
-                    catch (boost::wave::cpp_exception &e)
-                  {
-                 // some preprocessing error
-                 // This is a problem for using compass with emacs (see testEmacs.C).
-                 // cerr  << "WAVE 1: " << e.file_name() << "(" << e.line_no() << "): "
-                 //       << e.description() << endl;
-                       }
-
-               catch (boost::wave::cpplexer::lexing_exception &e)
-                  {
-                 // some lexing error
-                    cerr << "WAVE 2:" << e.file_name() << "(" << e.line_no() << "): "
-                         << e.description() << endl;
-                  }
-             }
-        }
-
-     catch (boost::wave::cpp_exception &e)
-        {
-       // some preprocessing error
-          cerr << "WAVE 3 (boost::wave::cpp_exception): " << e.file_name() << "(" << e.line_no() << "): "
-               << e.description() << endl;
-        }
-
-     catch (boost::wave::cpplexer::lexing_exception &e)
-        {
-       // some lexing error
-          cerr << "WAVE 4 (boost::wave::cpplexer::lexing_exception):" << e.file_name() << "(" << e.line_no() << "): "
-               << e.description() << endl;
-        }
-     catch (std::exception &e)
-        {
-       // use last recognized token to retrieve the error position
-          cerr << "WAVE 5 (std::exception):" << current_position.get_file() 
-               << "(" << current_position.get_line() << "): "
-               << "exception caught: " << e.what()
-               << endl;
-        }
-     catch (...)
-        {
-       // use last recognized token to retrieve the error position
-          cerr << "WAVE 6 (all other exceptions):" << current_position.get_file() 
-               << "(" << current_position.get_line() << "): "
-               << "unexpected exception caught." << endl;
-        }
-                // End Lexing
-
-     attributeListMap.attach_line_to_macro_call();
-
-#if 1
-        // King84 (2010.09.23): We capture the raw token stream because the tokens that aren't pre-processed tokens don't show up in the individual file's list of tokens.  Also, #line directives get obeyed and mapped into different files.  If we want to reproduce the original file failthfully, we have to use the raw list.  I leave the rest here for future reference, since it took some figuring out to get right.
-     if (SgProject::get_verbose() >= 1)
-             std::cout << "File " << sourceFileName << " has " << ctx.get_hooks().tokens.size() << " tokens." << std::endl;
-         for (std::list< token_type >::iterator i = ctx.get_hooks().tokens.begin(); i != ctx.get_hooks().tokens.end(); ++i)
-         {
-                sageFilePtr->get_rawTokenStream().push_back(*i);
-         }
-#else
-//     sageFilePtr->get_rawTokenStream().clear();
-     assert(attributeListMap.currentMapOfAttributes.find(sourceFileName) != attributeListMap.currentMapOfAttributes.end());
-         for (std::vector<PreprocessingInfo*>::iterator i = attributeListMap.currentMapOfAttributes[sourceFileName]->getList().begin(); i != attributeListMap.currentMapOfAttributes[sourceFileName]->getList().end(); ++i)
-         {
-                // King84 (2010.09.23): We aren't doing tokens, so we cheat by stringizing everything.  I guess we could get the tokens out of here, but I'm lazy, since we aren't doing this for real anyway
-        {
-            token_type holder = token_type(boost::wave::T_CPPCOMMENT, (**i).getString().c_str(), boost::wave::util::file_position_type(BOOST_WAVE_STRINGTYPE(), 0, 0));
-                        sageFilePtr->get_rawTokenStream().push_back( holder );
-        }
-         }
-#endif
-
-#if 0
-  // Get all SgFile nodes in the AST so that the attributes can be attached to them
-  // std::vector<SgNode*> sgFileList =     NodeQuery::querySubTree(project,&findNodes);
-     std::vector<SgNode*> sgFileList =     NodeQuery::querySubTree(sageFilePtr,&findNodes);
-
-  // Attache the map of attributes belonging to the current file to the AST
-     for(std::vector<SgNode*>::iterator it = sgFileList.begin(); it != sgFileList.end(); ++it)
-        {
-          SgFile* sgFile = isSgFile(*it);
-          attachPreprocessingInfo(sgFile,&attributeListMap.currentMapOfAttributes);
-        }
-#else
-   // AS(01/04/07) Create a global map of filenames to PreprocessingInfo*'s as it is inefficient
-   // to get this by a traversal of the AST
-     for(AttributeListMap::attribute_map_type::iterator it_files = attributeListMap.currentMapOfAttributes.begin(); it_files != attributeListMap.currentMapOfAttributes.end(); ++it_files)
-        {
-          std::string filename2 = it_files->first;
-
-          /*
-          Sg_File_Info* sourceFileInfo = sageFilePtr->get_file_info();
-          int sourceFileNameId = (sageFilePtr->get_requires_C_preprocessor() == true) ? Sg_File_Info::getIDFromFilename(filename2) : sourceFileInfo->get_file_id();
-          int sourceFileNameId = (sageFilePtr->get_requires_C_preprocessor() == true) ? 
-            Sg_File_Info::getIDFromFilename(sageFilePtr->generate_C_preprocessor_intermediate_filename(filename2)) : 
-            sourceFileInfo->get_file_id();
-            */
-
-
-          ROSEAttributesList*  attrList = it_files->second;
-          mapFilenameToAttributes[filename2] = attrList;
-
-                  // TODO:
-                  // King84 (2010.09.22) Add preprocessing info vector to file object, so we can access it later for unparsing
-
-          if (SgProject::get_verbose() >= 1)
-            std::cout << "source file name:" << sageFilePtr->generate_C_preprocessor_intermediate_filename(filename2) << std::endl;
-//          std::vector<PreprocessingInfo*>* preproc_info = new std::vector<PreprocessingInfo*>();
-    //      attributeMapForAllFiles[sourceFileNameId] = attrList;
-
-#if 1
-          for (std::vector<PreprocessingInfo*>::iterator it_preproc = attrList->getList().begin(); it_preproc != attrList->getList().end(); ++it_preproc)
-             {
-               //preproc_info->push_back(*it_preproc);
-//               returnListOfAttributes->addElement(**it_preproc);
-               ROSE_ASSERT(*it_preproc != NULL);
-               if( SgProject::get_verbose() >= 1 )
-                 std::cerr << "Added Macro " << (*it_preproc)->getString() << std::endl;
-             }
-#endif
-
-          if (SgProject::get_verbose() >= 1)
-             {
-               std::cout << "Size of vector: " << attrList->size() << std::endl;
-               std::cout << "Iterating over filename:" << filename2 << std::endl;
-             }
-        }
-
-     if (SgProject::get_verbose() >= 1)
-          std::cout << "Size of mapFilenameToAttributes:" << mapFilenameToAttributes.size() << std::endl;
-
-#endif
-
-// endif for ifdef _MSCx_VER
-//#endif
-
-// endif for ifndef  CXX_IS_ROSE_CODE_GENERATION
-#endif
-
-#if 0
-     printf ("Ending at base of attachPreprocessingInfoUsingWave(SgSourceFile*) \n");
-     ROSE_ABORT();
-#endif
-   }
-// Only compiled if using Boost::wave.
-#endif
 
 // DQ (12/3/2020): We sometimes want to read a file twice, and gather the comments 
 // and CPP directives twice, but the second time the file is read it is read so that 
diff --git a/src/frontend/SageIII/attachPreprocessingInfo.h b/src/frontend/SageIII/attachPreprocessingInfo.h
index 8789fcaac61..a281c8111df 100644
--- a/src/frontend/SageIII/attachPreprocessingInfo.h
+++ b/src/frontend/SageIII/attachPreprocessingInfo.h
@@ -31,8 +31,6 @@ ROSEAttributesList *getPreprocessorDirectives( std::string fileName, std::string
 // void attachPreprocessingInfo(SgSourceFile *sageFile);
 void attachPreprocessingInfo(SgSourceFile *sageFile, const std::string & new_filename = "");
 
-// DQ (11/30/2008): Part of refactoring of code specific to Wave.
-void attachPreprocessingInfoUsingWave(SgSourceFile *sageFile);
 
 #if 0
 // DQ (12/16/2008): comment out while I debug the non-wave support.

From 040d5cc4e99740a810df58bf8242344a7e93223a Mon Sep 17 00:00:00 2001
From: Patrick Flynn <pflynn157@gmail.com>
Date: Tue, 12 Sep 2023 20:16:29 -0400
Subject: [PATCH 04/42] Removed Boost thread dependency

---
 CMakeLists.txt | 12 ++++++------
 1 file changed, 6 insertions(+), 6 deletions(-)

diff --git a/CMakeLists.txt b/CMakeLists.txt
index e2ed0072c20..04788c2e185 100644
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -201,13 +201,13 @@ endif(WIN32)
 # second can check again including optional components.  If the version of cmake is high enough you can use an
 # OPTIONAL_COMPONENTS clause instead, but that wasn't introduced until 3.11."
 find_package(Boost 1.47.0
-  COMPONENTS chrono date_time iostreams program_options random regex system thread
+  COMPONENTS chrono date_time iostreams program_options random regex system
   REQUIRED)
 if(NOT Boost_FOUND)
   message(FATAL_ERROR "Could not find Boost version 1.35.0 or newer command")
 endif()
 find_package(Boost 1.47.0
-  COMPONENTS chrono date_time iostreams program_options random regex system thread serialization)
+  COMPONENTS chrono date_time iostreams program_options random regex system serialization)
 include_directories(${Boost_INCLUDE_DIRS})
 
 # Paths to install header, executable, and libraries
@@ -228,13 +228,13 @@ set(USE_CMAKE 1)
 set(HAVE_BOOST ${Boost_FOUND})
 set(HAVE_BOOST_SERIALIZATION_LIB ${Boost_SERIALIZATION_FOUND})
 set(HAVE_BOOST_DATE_TIME ${Boost_DATE_TIME_FOUND})
-set(HAVE_BOOST_FILESYSTEM ${Boost_FILESYSTEM_FOUND})
+#set(HAVE_BOOST_FILESYSTEM ${Boost_FILESYSTEM_FOUND})
 set(HAVE_BOOST_PROGRAM_OPTIONS ${Boost_PROGRAM_OPTIONS_FOUND})
 set(HAVE_BOOST_REGEX ${Boost_REGEX_FOUND})
 set(HAVE_BOOST_SYSTEM ${Boost_SYSTEM_FOUND})
-set(HAVE_BOOST_THREAD ${Boost_THREAD_FOUND})
-set(HAVE_BOOST_WAVE ${Boost_WAVE_FOUND})
-set(USE_ROSE_BOOST_WAVE_SUPPORT ${Boost_WAVE_FOUND})
+#set(HAVE_BOOST_THREAD ${Boost_THREAD_FOUND})
+#set(HAVE_BOOST_WAVE ${Boost_WAVE_FOUND})
+#set(USE_ROSE_BOOST_WAVE_SUPPORT ${Boost_WAVE_FOUND})
 
 ########################################################################################################################
 # ROSETTA

From a104e37c3bb935fae271f5e5d5149a5a2a8d11bb Mon Sep 17 00:00:00 2001
From: Patrick Flynn <pflynn157@gmail.com>
Date: Tue, 12 Sep 2023 21:55:49 -0400
Subject: [PATCH 05/42] Removed Boost regex/random dependencies

---
 CMakeLists.txt                   |  6 +++---
 src/rose-config.C                | 19 ++++++++++---------
 src/util/StringUtility/Convert.C |  8 ++++----
 src/util/StringUtility/Trim.h    | 17 +++++++++++++++++
 4 files changed, 34 insertions(+), 16 deletions(-)
 create mode 100644 src/util/StringUtility/Trim.h

diff --git a/CMakeLists.txt b/CMakeLists.txt
index 04788c2e185..9069088b51f 100644
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -201,13 +201,13 @@ endif(WIN32)
 # second can check again including optional components.  If the version of cmake is high enough you can use an
 # OPTIONAL_COMPONENTS clause instead, but that wasn't introduced until 3.11."
 find_package(Boost 1.47.0
-  COMPONENTS chrono date_time iostreams program_options random regex system
+  COMPONENTS chrono date_time iostreams program_options system
   REQUIRED)
 if(NOT Boost_FOUND)
   message(FATAL_ERROR "Could not find Boost version 1.35.0 or newer command")
 endif()
 find_package(Boost 1.47.0
-  COMPONENTS chrono date_time iostreams program_options random regex system serialization)
+  COMPONENTS chrono date_time iostreams program_options system serialization)
 include_directories(${Boost_INCLUDE_DIRS})
 
 # Paths to install header, executable, and libraries
@@ -230,7 +230,7 @@ set(HAVE_BOOST_SERIALIZATION_LIB ${Boost_SERIALIZATION_FOUND})
 set(HAVE_BOOST_DATE_TIME ${Boost_DATE_TIME_FOUND})
 #set(HAVE_BOOST_FILESYSTEM ${Boost_FILESYSTEM_FOUND})
 set(HAVE_BOOST_PROGRAM_OPTIONS ${Boost_PROGRAM_OPTIONS_FOUND})
-set(HAVE_BOOST_REGEX ${Boost_REGEX_FOUND})
+#set(HAVE_BOOST_REGEX ${Boost_REGEX_FOUND})
 set(HAVE_BOOST_SYSTEM ${Boost_SYSTEM_FOUND})
 #set(HAVE_BOOST_THREAD ${Boost_THREAD_FOUND})
 #set(HAVE_BOOST_WAVE ${Boost_WAVE_FOUND})
diff --git a/src/rose-config.C b/src/rose-config.C
index bc04497d1df..69333919dab 100644
--- a/src/rose-config.C
+++ b/src/rose-config.C
@@ -35,14 +35,14 @@ static const char *description =
 #include <rose.h>                                       // POLICY_OK -- this is not a ROSE library source file
 #include <rose_getline.h>
 
-#include <boost/algorithm/string/split.hpp>
-#include <boost/algorithm/string/trim.hpp>
 #include <boost/foreach.hpp>
-#include <boost/regex.hpp>
+#include <regex>
 #include <map>
 #include <string>
 #include <vector>
 
+#include <util/StringUtility/Trim.h>
+
 using namespace Rose;
 
 typedef std::map<std::string, std::string> Configuration;
@@ -121,7 +121,7 @@ readConfigFile(const std::filesystem::path &configName) {
     exit(1);
   }
 
-  boost::regex keyRe("[a-zA-Z][a-zA-Z_0-9]*");
+  std::regex keyRe("[a-zA-Z][a-zA-Z_0-9]*");
   size_t lineNumber = 0;
   while (ssize_t nchars = rose_getline(&r.line, &r.linesz, r.file)) {
     ++lineNumber;
@@ -134,17 +134,17 @@ readConfigFile(const std::filesystem::path &configName) {
     }
 
     std::string s = r.line;
-    boost::trim(s);
+    s = trim(s);
     if (s.empty() || '#' == s[0])
       continue;
 
     // Parse the "key=value" line
     size_t equal = s.find('=');
     std::string key = s.substr(0, equal);
-    boost::trim(key);
+    key = trim(key);
     std::string value = equal == std::string::npos ? std::string() : s.substr(equal+1);
-    boost::trim(value);
-    if (equal == std::string::npos || !boost::regex_match(key, keyRe)) {
+    value = trim(value);
+    if (equal == std::string::npos || !std::regex_match(key, keyRe)) {
       MLOG_FATAL_CXX("rose-config")  <<configName <<":" <<lineNumber <<": syntax error: expected KEY = VALUE\n";
       exit(1);
     }
@@ -184,7 +184,8 @@ readConfigFile(const Settings &settings) {
     return readConfigFile(settings.configFile);
 
   std::vector<std::string> dirs;
-  boost::split(dirs, settings.searchDirs, boost::is_any_of(":;"));
+  //boost::split(dirs, settings.searchDirs, boost::is_any_of(":;"));
+  dirs = Rose::StringUtility::split(settings.searchDirs, ":;");
   BOOST_FOREACH (const std::string &dir, dirs) {
     std::filesystem::path configFile = std::filesystem::path(dir) / CONFIG_NAME;
     if (std::filesystem::exists(configFile))
diff --git a/src/util/StringUtility/Convert.C b/src/util/StringUtility/Convert.C
index dbbef35fbd7..3657d8d533c 100644
--- a/src/util/StringUtility/Convert.C
+++ b/src/util/StringUtility/Convert.C
@@ -4,7 +4,7 @@
 #include <SplitJoin.h>
 #include <integerOps.h>                                 // rose
 
-#include <boost/regex.hpp>
+#include <regex>
 #include <cassert>
 #include <list>
 
@@ -188,13 +188,13 @@ removeRedundantSubstrings(const std::string &s) {
 
 std::string
 removeAnsiEscapes(const std::string &s) {
-    boost::regex csiSequences("\\033\\[[\\x30-\\x3f]*[\\x20-\\x2f]*[\\x40-x7e]");
+    std::regex csiSequences("\\033\\[[\\x30-\\x3f]*[\\x20-\\x2f]*[\\x40-x7e]");
     std::string retval;
 
     const char *iter = s.c_str();
     const char *end = s.c_str() + s.size();
-    boost::cmatch found;
-    while (boost::regex_search(iter, end, found, csiSequences)) {
+    std::cmatch found;
+    while (std::regex_search(iter, end, found, csiSequences)) {
         retval += std::string(iter, iter + found.position());
         iter += found.position() + found.length();
     }
diff --git a/src/util/StringUtility/Trim.h b/src/util/StringUtility/Trim.h
new file mode 100644
index 00000000000..8eaca6a8e77
--- /dev/null
+++ b/src/util/StringUtility/Trim.h
@@ -0,0 +1,17 @@
+#pragma once
+
+#include <string>
+#include <algorithm>
+
+// To replace boost::trim
+std::string trim(const std::string& str) {
+    size_t start = str.find_first_not_of(" \t\n\r");
+    if (start == std::string::npos)
+        return "";
+    
+    size_t end = str.find_last_not_of(" \t\n\r");
+    size_t length = end - start + 1;
+    
+    return str.substr(start, length);
+}
+

From 29dd1f11bc34be35a4984aacb8d9e26d7724dc98 Mon Sep 17 00:00:00 2001
From: Patrick Flynn <pflynn157@gmail.com>
Date: Tue, 12 Sep 2023 22:06:18 -0400
Subject: [PATCH 06/42] Removed boost system/serialization dependencies

---
 CMakeLists.txt | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/CMakeLists.txt b/CMakeLists.txt
index 9069088b51f..c6d8c5a2a37 100644
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -201,13 +201,13 @@ endif(WIN32)
 # second can check again including optional components.  If the version of cmake is high enough you can use an
 # OPTIONAL_COMPONENTS clause instead, but that wasn't introduced until 3.11."
 find_package(Boost 1.47.0
-  COMPONENTS chrono date_time iostreams program_options system
+  COMPONENTS chrono date_time iostreams program_options
   REQUIRED)
 if(NOT Boost_FOUND)
   message(FATAL_ERROR "Could not find Boost version 1.35.0 or newer command")
 endif()
 find_package(Boost 1.47.0
-  COMPONENTS chrono date_time iostreams program_options system serialization)
+  COMPONENTS chrono date_time iostreams program_options)
 include_directories(${Boost_INCLUDE_DIRS})
 
 # Paths to install header, executable, and libraries
@@ -226,12 +226,12 @@ set(USE_CMAKE 1)
 
 # ROSE configuration variables for Boost
 set(HAVE_BOOST ${Boost_FOUND})
-set(HAVE_BOOST_SERIALIZATION_LIB ${Boost_SERIALIZATION_FOUND})
+#set(HAVE_BOOST_SERIALIZATION_LIB ${Boost_SERIALIZATION_FOUND})
 set(HAVE_BOOST_DATE_TIME ${Boost_DATE_TIME_FOUND})
 #set(HAVE_BOOST_FILESYSTEM ${Boost_FILESYSTEM_FOUND})
 set(HAVE_BOOST_PROGRAM_OPTIONS ${Boost_PROGRAM_OPTIONS_FOUND})
 #set(HAVE_BOOST_REGEX ${Boost_REGEX_FOUND})
-set(HAVE_BOOST_SYSTEM ${Boost_SYSTEM_FOUND})
+#set(HAVE_BOOST_SYSTEM ${Boost_SYSTEM_FOUND})
 #set(HAVE_BOOST_THREAD ${Boost_THREAD_FOUND})
 #set(HAVE_BOOST_WAVE ${Boost_WAVE_FOUND})
 #set(USE_ROSE_BOOST_WAVE_SUPPORT ${Boost_WAVE_FOUND})

From 48a7c9bc47052e0e0ea2f502ccb685441d03662c Mon Sep 17 00:00:00 2001
From: Patrick Flynn <pflynn157@gmail.com>
Date: Tue, 12 Sep 2023 22:17:08 -0400
Subject: [PATCH 07/42] Removed boost iostreams/program options dependencies

---
 CMakeLists.txt | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/CMakeLists.txt b/CMakeLists.txt
index c6d8c5a2a37..683bf14c8c3 100644
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -201,13 +201,13 @@ endif(WIN32)
 # second can check again including optional components.  If the version of cmake is high enough you can use an
 # OPTIONAL_COMPONENTS clause instead, but that wasn't introduced until 3.11."
 find_package(Boost 1.47.0
-  COMPONENTS chrono date_time iostreams program_options
+  COMPONENTS chrono date_time
   REQUIRED)
 if(NOT Boost_FOUND)
   message(FATAL_ERROR "Could not find Boost version 1.35.0 or newer command")
 endif()
 find_package(Boost 1.47.0
-  COMPONENTS chrono date_time iostreams program_options)
+  COMPONENTS chrono date_time)
 include_directories(${Boost_INCLUDE_DIRS})
 
 # Paths to install header, executable, and libraries
@@ -229,7 +229,7 @@ set(HAVE_BOOST ${Boost_FOUND})
 #set(HAVE_BOOST_SERIALIZATION_LIB ${Boost_SERIALIZATION_FOUND})
 set(HAVE_BOOST_DATE_TIME ${Boost_DATE_TIME_FOUND})
 #set(HAVE_BOOST_FILESYSTEM ${Boost_FILESYSTEM_FOUND})
-set(HAVE_BOOST_PROGRAM_OPTIONS ${Boost_PROGRAM_OPTIONS_FOUND})
+#set(HAVE_BOOST_PROGRAM_OPTIONS ${Boost_PROGRAM_OPTIONS_FOUND})
 #set(HAVE_BOOST_REGEX ${Boost_REGEX_FOUND})
 #set(HAVE_BOOST_SYSTEM ${Boost_SYSTEM_FOUND})
 #set(HAVE_BOOST_THREAD ${Boost_THREAD_FOUND})

From 5ceb91a4dde6e7f3e111613448daf893234c8148 Mon Sep 17 00:00:00 2001
From: Patrick Flynn <pflynn157@gmail.com>
Date: Tue, 12 Sep 2023 22:30:06 -0400
Subject: [PATCH 08/42] Initial boost removal (note: things still commented
 out)

---
 CMakeLists.txt     | 32 ++++++++++++++++----------------
 src/CMakeLists.txt |  8 +++++---
 2 files changed, 21 insertions(+), 19 deletions(-)

diff --git a/CMakeLists.txt b/CMakeLists.txt
index 683bf14c8c3..515f3c623df 100644
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -200,34 +200,34 @@ endif(WIN32)
 # REQUIRED clause after the first one has succeeded.  That way the first clause checks for requires components, and the
 # second can check again including optional components.  If the version of cmake is high enough you can use an
 # OPTIONAL_COMPONENTS clause instead, but that wasn't introduced until 3.11."
-find_package(Boost 1.47.0
-  COMPONENTS chrono date_time
-  REQUIRED)
-if(NOT Boost_FOUND)
-  message(FATAL_ERROR "Could not find Boost version 1.35.0 or newer command")
-endif()
-find_package(Boost 1.47.0
-  COMPONENTS chrono date_time)
-include_directories(${Boost_INCLUDE_DIRS})
+#find_package(Boost 1.47.0
+#  COMPONENTS chrono date_time
+#  REQUIRED)
+#if(NOT Boost_FOUND)
+#  message(FATAL_ERROR "Could not find Boost version 1.35.0 or newer command")
+#endif()
+#find_package(Boost 1.47.0
+#  COMPONENTS chrono date_time)
+#include_directories(${Boost_INCLUDE_DIRS})
 
 # Paths to install header, executable, and libraries
 set(INCLUDE_INSTALL_DIR "include/rose")
 set(BIN_INSTALL_DIR     "bin")
 set(LIB_INSTALL_DIR     "${ROSE_LIB_DIR_NAME}")
 
-set(INSTALL_TARGETS_DEFAULT_ARGS
-  RUNTIME DESTINATION "${BIN_INSTALL_DIR}"
-  LIBRARY DESTINATION "${LIB_INSTALL_DIR}"
-  ARCHIVE DESTINATION "${LIB_INSTALL_DIR}"
-  COMPONENT Devel)
+#set(INSTALL_TARGETS_DEFAULT_ARGS
+#  RUNTIME DESTINATION "${BIN_INSTALL_DIR}"
+#  LIBRARY DESTINATION "${LIB_INSTALL_DIR}"
+#  ARCHIVE DESTINATION "${LIB_INSTALL_DIR}"
+#  COMPONENT Devel)
 
 # A new definition to tweak code for cmake
 set(USE_CMAKE 1)
 
 # ROSE configuration variables for Boost
-set(HAVE_BOOST ${Boost_FOUND})
+#set(HAVE_BOOST ${Boost_FOUND})
 #set(HAVE_BOOST_SERIALIZATION_LIB ${Boost_SERIALIZATION_FOUND})
-set(HAVE_BOOST_DATE_TIME ${Boost_DATE_TIME_FOUND})
+#set(HAVE_BOOST_DATE_TIME ${Boost_DATE_TIME_FOUND})
 #set(HAVE_BOOST_FILESYSTEM ${Boost_FILESYSTEM_FOUND})
 #set(HAVE_BOOST_PROGRAM_OPTIONS ${Boost_PROGRAM_OPTIONS_FOUND})
 #set(HAVE_BOOST_REGEX ${Boost_REGEX_FOUND})
diff --git a/src/CMakeLists.txt b/src/CMakeLists.txt
index c96b8524856..52df41d63e6 100644
--- a/src/CMakeLists.txt
+++ b/src/CMakeLists.txt
@@ -26,7 +26,7 @@ add_custom_target(
 
 # Header files needed to build ROSETTA
 include_directories(
-  ${Boost_INCLUDE_DIRS}
+  #${Boost_INCLUDE_DIRS}
   ${CMAKE_SOURCE_DIR}/src/midend/programTransformation/transformationTracking
   ${CMAKE_BINARY_DIR}/src/3rdPartyLibraries/fortran-parser
   ${JAVA_INCLUDE_PATH}
@@ -241,7 +241,8 @@ install(TARGETS rose-compiler DESTINATION bin)
 set(rose_config_installed_cppflags "-I${CMAKE_INSTALL_PREFIX}/include/rose")
 
 set(rose_library_dir_list "${CMAKE_INSTALL_PREFIX}/${ROSE_LIB_DIR_NAME}")
-set(rose_library_dir_list "${rose_library_dir_list};${Boost_LIBRARY_DIRS}")
+#set(rose_library_dir_list "${rose_library_dir_list};${Boost_LIBRARY_DIRS}")
+set(rose_library_dir_list "${rose_library_dir_list}")
 foreach(X IN LISTS rose_library_dir_list)
   set(rose_config_installed_ldflags "${rose_config_installed_ldflags} -L${X}")
 endforeach()
@@ -249,7 +250,8 @@ set(rose_config_installed_cppflags "${rose_config_installed_cppflags} -I/usr/inc
 
 
 set(rose_library_list "rose")
-set(rose_library_list "${rose_library_list};${Boost_LIBRARIES}")
+#set(rose_library_list "${rose_library_list};${Boost_LIBRARIES}")
+set(rose_library_list "${rose_library_list}")
 set(rose_library_list "${rose_library_list};m;quadmath")
 
 foreach(X IN LISTS rose_library_list)

From e27f2f581ff883fcf6146b9b65368d6aecb79519 Mon Sep 17 00:00:00 2001
From: Patrick Flynn <pflynn157@gmail.com>
Date: Wed, 13 Sep 2023 11:41:21 -0400
Subject: [PATCH 09/42] Removed Boost fields from CMake

---
 CMakeLists.txt     | 87 +++-------------------------------------------
 src/CMakeLists.txt |  3 --
 2 files changed, 4 insertions(+), 86 deletions(-)

diff --git a/CMakeLists.txt b/CMakeLists.txt
index 515f3c623df..78f99030c86 100644
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -112,7 +112,7 @@ if(WIN32)
   add_definitions(-D_CRT_SECURE_NO_WARNINGS)
 endif()
 
-add_definitions(-DBOOST_ALL_NO_LIB=1)
+#add_definitions(-DBOOST_ALL_NO_LIB=1)
 
 # FIXME: Why do we have to have a copy of some standard built-in modules inside rose?
 set(CMAKE_MODULE_PATH "${CMAKE_SOURCE_DIR}/cmake" "${CMAKE_SOURCE_DIR}/cmake/modules"  ${CMAKE_MODULE_PATH})
@@ -148,93 +148,14 @@ file(READ ${ROSE_SCM_DATE_FILE} ROSE_VERSION)
 message(STATUS "The ROSE version integer is ${ROSE_VERSION}")
 message(STATUS "The ROSE version string is ${ROSE_PACKAGE_VERSION}")
 
-########################################################################################################################
-# Boost libraries
-########################################################################################################################
-
-message(STATUS
-  "If you get a whole bunch of warnings saying 'New Boost version may have incorrect or missing dependencies and "
-  "imported targets' it is probably because you're using a Boost version that was released after your CMake version. "
-  "See [https://github.com/Kitware/CMake/commits/master/Modules/FindBoost.cmake] to see latest supported version and "
-  "[https://github.com/Microsoft/vcpkg/issues/2459] for a description of the problem. Note that CMake versions "
-  "3.11.0 through 3.13.2 and possibly later) cannot be compiled (syntax errors) with a GNU C++ compiler that's "
-  "configured to use a non-default language standard (e.g., C++11 with GCC-5.4 whose default is GNU++03).")
-
-set(Boost_USE_STATIC_LIBS FALSE)
-set(Boost_DEBUG ${VERBOSE})
-
-# Honor BOOST_HOME environment variable
-if(DEFINED ENV{BOOST_HOME})
-  set(BOOST_ROOT "$ENV{BOOST_HOME}")
-endif()
-
-option(Boost_USE_MULTITHREADED "Should Boost multithreaded libraries be used?" OFF)
-
-if(WIN32)
-  find_package(Boost REQUIRED)
-  set(BOOST_LIBRARYDIR ${Boost_LIBRARY_DIRS})
-  set(BOOST_INCLUDEDIR ${Boost_INCLUDE_DIRS}/)
-
-  message("Boost information:")
-  message("  BOOST_ROOT: ${BOOST_ROOT}")
-  message("  Boost_INCLUDE_DIRS: ${Boost_INCLUDE_DIRS}")
-  message("  Boost_LIBRARIES: ${Boost_LIBRARIES}")
-  message("  Boost_LIBRARY_DIRS: ${Boost_LIBRARY_DIRS}")
-  message("  BOOST_LIBRARYDIR : ${BOOST_LIBRARYDIR}")
-  message("  BOOST_INCLUDEDIR : ${BOOST_INCLUDEDIR}")
-
-  include_directories(${Boost_INCLUDE_DIRS})
-  link_directories(${Boost_LIBRARY_DIRS})
-endif(WIN32)
-
-# FIXME: 1.47 is no longer supported by ROSE, but is what's installed on Jenkins' CMake test machine. This should
-#        be changed to the actual minimum supported version once Pei-Hung upgrades the machine. [Matzke 2019-01-21]
-#
-# First look for the Boost libraries that are required in order to compile ROSE, then additionally look for any optional
-# libraries that are useful to ROSE but not required. From a user: "The find_package() change is required for boost
-# 1.70 or above on any system when using a recent enough version of cmake.  Without it, serialization support will not
-# be used.  Before boost 1.70, the findBoost() in cmake is used directly, and it will look for boost components that are
-# not in the find_package clause.  Since 1.70, cmake will load the findBoost() provided by the boost package itself.
-# Unfortunately, that findBoost() will only check for components in the find_package() clause.  This means that
-# serialization is considered not to exist, even if it is there.  My change calls find_package again without the
-# REQUIRED clause after the first one has succeeded.  That way the first clause checks for requires components, and the
-# second can check again including optional components.  If the version of cmake is high enough you can use an
-# OPTIONAL_COMPONENTS clause instead, but that wasn't introduced until 3.11."
-#find_package(Boost 1.47.0
-#  COMPONENTS chrono date_time
-#  REQUIRED)
-#if(NOT Boost_FOUND)
-#  message(FATAL_ERROR "Could not find Boost version 1.35.0 or newer command")
-#endif()
-#find_package(Boost 1.47.0
-#  COMPONENTS chrono date_time)
-#include_directories(${Boost_INCLUDE_DIRS})
-
 # Paths to install header, executable, and libraries
 set(INCLUDE_INSTALL_DIR "include/rose")
 set(BIN_INSTALL_DIR     "bin")
 set(LIB_INSTALL_DIR     "${ROSE_LIB_DIR_NAME}")
 
-#set(INSTALL_TARGETS_DEFAULT_ARGS
-#  RUNTIME DESTINATION "${BIN_INSTALL_DIR}"
-#  LIBRARY DESTINATION "${LIB_INSTALL_DIR}"
-#  ARCHIVE DESTINATION "${LIB_INSTALL_DIR}"
-#  COMPONENT Devel)
-
 # A new definition to tweak code for cmake
 set(USE_CMAKE 1)
 
-# ROSE configuration variables for Boost
-#set(HAVE_BOOST ${Boost_FOUND})
-#set(HAVE_BOOST_SERIALIZATION_LIB ${Boost_SERIALIZATION_FOUND})
-#set(HAVE_BOOST_DATE_TIME ${Boost_DATE_TIME_FOUND})
-#set(HAVE_BOOST_FILESYSTEM ${Boost_FILESYSTEM_FOUND})
-#set(HAVE_BOOST_PROGRAM_OPTIONS ${Boost_PROGRAM_OPTIONS_FOUND})
-#set(HAVE_BOOST_REGEX ${Boost_REGEX_FOUND})
-#set(HAVE_BOOST_SYSTEM ${Boost_SYSTEM_FOUND})
-#set(HAVE_BOOST_THREAD ${Boost_THREAD_FOUND})
-#set(HAVE_BOOST_WAVE ${Boost_WAVE_FOUND})
-#set(USE_ROSE_BOOST_WAVE_SUPPORT ${Boost_WAVE_FOUND})
 
 ########################################################################################################################
 # ROSETTA
@@ -621,12 +542,12 @@ endif()
 # define a global variable to collect all common linked third-party libraries for rose
 if(NOT WIN32)
   if(NOT APPLE)
-    set(link_with_libraries ${Boost_LIBRARIES} ${M_LIB} ${RT_LIB} ${CMAKE_THREAD_LIBS_INIT})
+    set(link_with_libraries ${M_LIB} ${RT_LIB} ${CMAKE_THREAD_LIBS_INIT})
   else()
-    set(link_with_libraries ${Boost_LIBRARIES} ${M_LIB} ${CMAKE_THREAD_LIBS_INIT})
+    set(link_with_libraries ${M_LIB} ${CMAKE_THREAD_LIBS_INIT})
   endif()
 else()
-  set(link_with_libraries ${Boost_LIBRARIES} shlwapi.lib psapi.lib)
+  set(link_with_libraries shlwapi.lib psapi.lib)
 endif()
 
 # Check compilers and version numbers. The module is located in src/cmake/modules.
diff --git a/src/CMakeLists.txt b/src/CMakeLists.txt
index 52df41d63e6..dff7202eb85 100644
--- a/src/CMakeLists.txt
+++ b/src/CMakeLists.txt
@@ -26,7 +26,6 @@ add_custom_target(
 
 # Header files needed to build ROSETTA
 include_directories(
-  #${Boost_INCLUDE_DIRS}
   ${CMAKE_SOURCE_DIR}/src/midend/programTransformation/transformationTracking
   ${CMAKE_BINARY_DIR}/src/3rdPartyLibraries/fortran-parser
   ${JAVA_INCLUDE_PATH}
@@ -241,7 +240,6 @@ install(TARGETS rose-compiler DESTINATION bin)
 set(rose_config_installed_cppflags "-I${CMAKE_INSTALL_PREFIX}/include/rose")
 
 set(rose_library_dir_list "${CMAKE_INSTALL_PREFIX}/${ROSE_LIB_DIR_NAME}")
-#set(rose_library_dir_list "${rose_library_dir_list};${Boost_LIBRARY_DIRS}")
 set(rose_library_dir_list "${rose_library_dir_list}")
 foreach(X IN LISTS rose_library_dir_list)
   set(rose_config_installed_ldflags "${rose_config_installed_ldflags} -L${X}")
@@ -250,7 +248,6 @@ set(rose_config_installed_cppflags "${rose_config_installed_cppflags} -I/usr/inc
 
 
 set(rose_library_list "rose")
-#set(rose_library_list "${rose_library_list};${Boost_LIBRARIES}")
 set(rose_library_list "${rose_library_list}")
 set(rose_library_list "${rose_library_list};m;quadmath")
 

From c2c3d20cd861c48c70c98720601e5e360faf721f Mon Sep 17 00:00:00 2001
From: Patrick Flynn <pflynn157@gmail.com>
Date: Wed, 13 Sep 2023 12:02:45 -0400
Subject: [PATCH 10/42] Partially removed Boost from Node.code

---
 src/ROSETTA/Grammar/Node.code | 28 +++++++++++++---------------
 1 file changed, 13 insertions(+), 15 deletions(-)

diff --git a/src/ROSETTA/Grammar/Node.code b/src/ROSETTA/Grammar/Node.code
index 1864f985b31..d787ca122ea 100644
--- a/src/ROSETTA/Grammar/Node.code
+++ b/src/ROSETTA/Grammar/Node.code
@@ -3,18 +3,17 @@ HEADER_NODE_PREDECLARATION_START
 
 #include <semaphore.h>
 
-// tps (01/27/10): Added essential files..
-//#include "sage3basic.h"
-#include <rosePublicConfig.h>
+#include <unordered_map>
+#include <unordered_set>
+#include <functional>
 
 #include <boost/serialization/access.hpp>
 #include <boost/serialization/base_object.hpp>
-#include <boost/serialization/map.hpp>
-#include <boost/serialization/set.hpp>
-#include <boost/serialization/vector.hpp>
-#include <boost/serialization/version.hpp>
-#include <boost/unordered_map.hpp>
-#include <boost/unordered_set.hpp>
+#include <boost/serialization/nvp.hpp>
+
+// tps (01/27/10): Added essential files..
+//#include "sage3basic.h"
+#include <rosePublicConfig.h>
 
 #include "Cxx_Grammar.h"
 
@@ -350,12 +349,11 @@ typedef SgTokenPtrList* SgTokenPtrListPtr;
 // DQ (11/4/2009): Trying to use the boost hash_map support
 namespace rose_hash
    {
-  // The condition here is not needed for GCC 4.2, but is needed (and does not completely work) for earlier versions
-     using boost::unordered_map;
-     using boost::unordered_multimap;
-     using boost::unordered_set;
-     using boost::hash;
-
+   using std::unordered_map;
+   using std::unordered_multimap;
+   using std::unordered_set;
+   using std::hash;
+   
   // DQ (4/23/2009): These should be put into this namespace so that we don't contaminate the global scope.
   // DQ (8/19/2008): This is already defined in src/frontend/SageIII/astMerge/buildMangledNameMap.h
      struct eqstr_string

From 7ee15636dc04e5670090fa5312bfaef27b470ea8 Mon Sep 17 00:00:00 2001
From: Patrick Flynn <pflynn157@gmail.com>
Date: Wed, 13 Sep 2023 12:21:17 -0400
Subject: [PATCH 11/42] Removed more boost code; removed dead
 extractFunctionArgumentsNormalization

---
 .../programTransformation/CMakeLists.txt      |   1 -
 .../astOutlining/GenerateFunc.cc              |   5 +-
 .../astOutlining/PragmaInterface.cc           |   4 +-
 .../CMakeLists.txt                            |   3 -
 .../ExtractFunctionArguments.C                | 379 ------------------
 .../ExtractFunctionArguments.h                |  83 ----
 .../Makefile.am                               |  22 -
 .../functionEvaluationOrderTraversal.C        | 166 --------
 .../functionEvaluationOrderTraversal.h        |  89 ----
 9 files changed, 5 insertions(+), 747 deletions(-)
 delete mode 100644 src/midend/programTransformation/extractFunctionArgumentsNormalization/CMakeLists.txt
 delete mode 100644 src/midend/programTransformation/extractFunctionArgumentsNormalization/ExtractFunctionArguments.C
 delete mode 100644 src/midend/programTransformation/extractFunctionArgumentsNormalization/ExtractFunctionArguments.h
 delete mode 100644 src/midend/programTransformation/extractFunctionArgumentsNormalization/Makefile.am
 delete mode 100644 src/midend/programTransformation/extractFunctionArgumentsNormalization/functionEvaluationOrderTraversal.C
 delete mode 100644 src/midend/programTransformation/extractFunctionArgumentsNormalization/functionEvaluationOrderTraversal.h

diff --git a/src/midend/programTransformation/CMakeLists.txt b/src/midend/programTransformation/CMakeLists.txt
index cba1b50a9ae..6a28cf5c3c1 100644
--- a/src/midend/programTransformation/CMakeLists.txt
+++ b/src/midend/programTransformation/CMakeLists.txt
@@ -7,7 +7,6 @@ add_subdirectory(astInlining)
 add_subdirectory(astOutlining)
 add_subdirectory(ompLowering)
 add_subdirectory(transformationTracking)
-add_subdirectory(extractFunctionArgumentsNormalization)
 add_subdirectory(singleStatementToBlockNormalization)
 if(NOT enable-internalFrontendDevelopment)
   add_subdirectory(loopProcessing)
diff --git a/src/midend/programTransformation/astOutlining/GenerateFunc.cc b/src/midend/programTransformation/astOutlining/GenerateFunc.cc
index 226b88b2f9f..57853a80c01 100644
--- a/src/midend/programTransformation/astOutlining/GenerateFunc.cc
+++ b/src/midend/programTransformation/astOutlining/GenerateFunc.cc
@@ -22,6 +22,7 @@
 #include <sstream>
 #include <set>
 #include <map>
+#include <unordered_map>
 
 #include "Outliner.hh"
 #include "ASTtools.hh"
@@ -1397,8 +1398,8 @@ class SymbolMapOfTwoFiles
           dict[i1->second]=i2->second;
 #endif          
         rose_hash_multimap::iterator i1, i2;
-        boost::unordered_map<string, SgVariableSymbol*> varSymDict; 
-        boost::unordered_map<string, SgFunctionSymbol*> funcSymDict; 
+        std::unordered_map<string, SgVariableSymbol*> varSymDict; 
+        std::unordered_map<string, SgFunctionSymbol*> funcSymDict; 
 
         // cache mapping of new symbols,indexed by qualified name : qualified name to symbol
         for (i2=set2->begin(); i2!=set2->end(); i2++)
diff --git a/src/midend/programTransformation/astOutlining/PragmaInterface.cc b/src/midend/programTransformation/astOutlining/PragmaInterface.cc
index af02e2f3021..4c9035e53d0 100644
--- a/src/midend/programTransformation/astOutlining/PragmaInterface.cc
+++ b/src/midend/programTransformation/astOutlining/PragmaInterface.cc
@@ -19,7 +19,7 @@
 #include "Outliner.hh"
 #include "ASTtools.hh"
 #include "PreprocessingInfo.hh"
-#include <boost/algorithm/string/trim.hpp>
+#include <StringUtility/Trim.h>
 
 //! Simplest outlining directives, applied to a single statement.
 static const std::string PRAGMA_OUTLINE ("rose_outline");
@@ -89,7 +89,7 @@ processFortranComment(SgLocatedNode* node)
     if ((*i)->getTypeOfDirective() == PreprocessingInfo::FortranStyleComment)
     {
       string commentString = (*i)->getString();
-      boost::algorithm::trim(commentString);
+      trim(commentString);
       if (   (commentString == "!$"+PRAGMA_OUTLINE) 
           || (commentString == "c$"+PRAGMA_OUTLINE) 
           || (commentString == "*$"+PRAGMA_OUTLINE)) 
diff --git a/src/midend/programTransformation/extractFunctionArgumentsNormalization/CMakeLists.txt b/src/midend/programTransformation/extractFunctionArgumentsNormalization/CMakeLists.txt
deleted file mode 100644
index 859357b7396..00000000000
--- a/src/midend/programTransformation/extractFunctionArgumentsNormalization/CMakeLists.txt
+++ /dev/null
@@ -1,3 +0,0 @@
-install(FILES
-    ExtractFunctionArguments.h functionEvaluationOrderTraversal.h
-  DESTINATION ${INCLUDE_INSTALL_DIR})
diff --git a/src/midend/programTransformation/extractFunctionArgumentsNormalization/ExtractFunctionArguments.C b/src/midend/programTransformation/extractFunctionArgumentsNormalization/ExtractFunctionArguments.C
deleted file mode 100644
index ff84237e9f8..00000000000
--- a/src/midend/programTransformation/extractFunctionArgumentsNormalization/ExtractFunctionArguments.C
+++ /dev/null
@@ -1,379 +0,0 @@
-#include "ExtractFunctionArguments.h"
-#include <boost/foreach.hpp>
-#include <boost/tuple/tuple.hpp>
-#include <functionEvaluationOrderTraversal.h>
-#include "SingleStatementToBlockNormalization.h"
-
-#define foreach BOOST_FOREACH
-
-using namespace std;
-using namespace boost;
-
-
-/** Performs the function argument extraction on all function calls in the given subtree of the AST. */
-/** It does not do transofrmations in places where it is not safe. If you pass doUnsafeNormalization= true, we will normalize all callsites ignoring the safety (Suggested by Markus Schordan) */
-
-void ExtractFunctionArguments::NormalizeTree(SgNode* tree, bool doUnsafeNormalization) {
-    // First Normalize each single statememnt body into a block body
-    // This transformation is necessary to provide scope to newly created temporaries
-    // Note: if this transofrmation is already done, it is benign to rerun it
-    // and this would act as a NOP transformation.
-    
-    SingleStatementToBlockNormalizer singleStatementToBlockNormalizer;
-    singleStatementToBlockNormalizer.Normalize(tree);
-    
-
-    
-    // Obtain functions that are candidates for normalizing (first) and those which are not condidates (second)
-    // non candidates are those which are present in places from where it is unsafe to lift: e.g., : while(Foo(Bar())){}
-    this->functionCalls = FunctionEvaluationOrderTraversal::GetFunctionCalls(tree);
-    
-    // Normalize each function from safe place
-    foreach(const FunctionCallInfo& functionCallInfo, this->functionCalls.first) {
-        RewriteFunctionCallArguments(functionCallInfo);
-    }
-    
-    // if doUnsafeNormalization is true, we will normalize calls which are not safe
-    if(doUnsafeNormalization){
-        foreach(const FunctionCallInfo& functionCallInfo, this->functionCalls.second) {
-            RewriteFunctionCallArguments(functionCallInfo);
-        }        
-    }
-    
-}
-
-
-/*
-    return a vector of temporaries introduced during the translation process
- */
-std::vector<SgVariableDeclaration*> ExtractFunctionArguments::GetTemporariesIntroduced() {
-    return this->temporariesIntroduced;
-}
-
-/** Returns true if the given expression refers to a variable. This could include using the
- * dot and arrow operator to access member variables. A comma op counts as a variable references
- * if all its members are variable references (not just the last expression in the list). */
-bool isVariableReference(SgExpression* expression)
-{
-    if (isSgVarRefExp(expression))
-    {
-        return true;
-    }
-    else if (isSgThisExp(expression))
-    {
-        return true;
-    }
-    else if (isSgDotExp(expression))
-    {
-        SgDotExp* dotExpression = isSgDotExp(expression);
-        return isVariableReference(dotExpression->get_lhs_operand()) &&
-        isVariableReference(dotExpression->get_rhs_operand());
-    }
-    else if (isSgArrowExp(expression))
-    {
-        SgArrowExp* arrowExpression = isSgArrowExp(expression);
-        return isVariableReference(arrowExpression->get_lhs_operand()) &&
-        isVariableReference(arrowExpression->get_rhs_operand());
-    }
-    else if (isSgCommaOpExp(expression))
-    {
-        //Comma op where both the lhs and th rhs are variable references.
-        //The lhs would be semantically meaningless since it doesn't have any side effects
-        SgCommaOpExp* commaOp = isSgCommaOpExp(expression);
-        return isVariableReference(commaOp->get_lhs_operand()) &&
-        isVariableReference(commaOp->get_rhs_operand());
-    }
-    else if (isSgPointerDerefExp(expression) || isSgCastExp(expression) || isSgAddressOfOp(expression))
-    {
-        return isVariableReference(isSgUnaryOp(expression)->get_operand());
-    }
-    else
-    {
-        return false;
-    }
-}
-
-/* Given the expression which is the argument to a function call, returns true if that
-    expression is trivial. Trivial expressions are those which are simple variable references or constants.
- */
-
-bool ExtractFunctionArguments::IsFunctionArgumentTrivial(SgExpression* argument) {
-    while ((isSgPointerDerefExp(argument) || isSgCastExp(argument) || isSgAddressOfOp(argument))) {
-        argument = isSgUnaryOp(argument)->get_operand();
-    }
-    
-    SgArrowExp* arrowExp = isSgArrowExp(argument);
-    if (arrowExp && isSgThisExp(arrowExp->get_lhs_operand()))
-        return true;
-    
-    // We don't lift these simple types
-    if (isVariableReference(argument) || isSgValueExp(argument))
-        return true;
-    
-    return false;
-}
-
-
-/* Given a vector of function call sites returns true if every argument of every function call is a trivial expression
-    (IsFunctionArgumentTrivial). Such functions don't need to be normalized.
- */
-bool ExtractFunctionArguments::AreAllFunctionCallsTrivial(std::vector<FunctionCallInfo> functions){
-    foreach(FunctionCallInfo functionCallInfo, functions){
-        foreach(SgExpression* arg, functionCallInfo.functionCall->get_args()->get_expressions()){
-            if (!IsFunctionArgumentTrivial(arg)) {
-                return false;
-            }
-        }
-    }
-    return true;
-}
-
-/* Given a vector of function call sites, returns true if every argument 
-   at every function call site is either trivial (IsFunctionArgumentTrivial) or can be normalized (FunctionArgumentCanBeNormalized).
- */
-bool ExtractFunctionArguments::AreAllFunctionCallsNormalizable(std::vector<FunctionCallInfo> functions){
-    foreach(FunctionCallInfo functionCallInfo, functions){
-        foreach(SgExpression* arg, functionCallInfo.functionCall->get_args()->get_expressions()){
-            if (!IsFunctionArgumentTrivial(arg) && !FunctionArgumentCanBeNormalized(arg)) {
-                return false;
-            }
-        }
-    }
-    return true;
-}
-
-
-/*
-    IsNormalized: Given a subtree, returns true if every argument of every function call is a trivial arguemnt.
-*/
-
-bool ExtractFunctionArguments::IsNormalized(SgNode* tree){
-    // Obtain functions that are candidates for normalizing (first) and those which are not condidates (second)
-    // non candidates are those which are present in places from where it is unsafe to lift: e.g., : while(Foo(Bar())){}
-    pair< std::vector<FunctionCallInfo>, std::vector<FunctionCallInfo> > fCalls = FunctionEvaluationOrderTraversal::GetFunctionCalls(tree);
-
-    //Make sure all arguemnts of all SAFE place functions calls are trivial
-    if(!AreAllFunctionCallsTrivial(fCalls.first))
-       return false;
-
-    //Make sure all arguemnts of all NON-SAFE place functions calls are also trivial
-    if(!AreAllFunctionCallsTrivial(fCalls.second))
-        return false;
-
-    // All are trivial
-    return true;
-}
-
-
-/*
-    IsNormalizable: Given a subtree, returns true if every argument of every function call is a either trivial arguemnt or
-    present in a SAFE place from where lifting is possible. 
-*/
-
-bool ExtractFunctionArguments::IsNormalizable(SgNode* tree){
-    // Obtain functions that are candidates for normalizing (first) and those which are not condidates (second)
-    // non candidates are those which are present in places from where it is unsafe to lift: e.g., : while(Foo(Bar())){}
-    pair< std::vector<FunctionCallInfo>, std::vector<FunctionCallInfo> > fCalls = FunctionEvaluationOrderTraversal::GetFunctionCalls(tree);
-
-    //Make sure all arguemnts of all SAFE place functions calls are either trivial or normalizable
-    if(!AreAllFunctionCallsNormalizable(fCalls.first))
-        return false;
-    
-    // Must be trivail in NON SAFE places
-    if(!AreAllFunctionCallsTrivial(fCalls.second))
-        return false;
-    
-    // We can normalize
-    return true;
-}
-
-
-/** Given the information about a function call (obtained through a traversal), extract its arguments
- * into temporary variables where it is necessary.
- * Returns true on success, false on failure (unsupported code). */
-void ExtractFunctionArguments::RewriteFunctionCallArguments(const FunctionCallInfo& functionCallInfo)
-{
-    SgFunctionCallExp* functionCall = functionCallInfo.functionCall;
-    
-    // Force the function call to NOT use operator syntax
-    functionCall->set_uses_operator_syntax(false);
-    
-    SgExprListExp* functionArgs = functionCall->get_args();
-    ROSE_ASSERT(functionArgs != NULL);
-    
-    SgExpressionPtrList argumentList = functionArgs->get_expressions();
-    
-    // We also normalize the caller if the function called is a member function.
-    if (SgBinaryOp * binExp = isSgBinaryOp(functionCall->get_function())) {
-        argumentList.push_back(binExp->get_lhs_operand());
-    }
-    
-    //Go over all the function arguments, pull them out
-    
-    foreach(SgExpression* arg, argumentList)
-    {
-        //No need to pull out parameters that are not complex expressions and
-        //thus don't have side effects
-        if (!FunctionArgumentNeedsNormalization(arg))
-            continue;
-
-        //Build a declaration for the temporary variable
-        SgScopeStatement* scope = functionCallInfo.tempVarDeclarationLocation->get_scope();
-        ROSE_ASSERT(scope != NULL );
-
-     // DQ (3/1/2015): Added initialization to these local variables.
-     // SgVariableDeclaration* tempVarDeclaration;
-     // SgExpression* tempVarReference;
-        SgVariableDeclaration* tempVarDeclaration = NULL;
-        SgExpression* tempVarReference = NULL;
-
-     // DQ (3/1/2015): Avoid normalization of function arguments of type SgFunctionType (see inputBug317.C).
-     // This might be an issue more narrowly defined for compiler-generated functions, this is less clear.
-        SgFunctionType* functionType = isSgFunctionType(arg->get_type());
-        if (functionType == NULL)
-           {
-             tie(tempVarDeclaration, tempVarReference) = SageInterface::createTempVariableAndReferenceForExpression(arg, scope);
-        
-          // createTempVariableOrReferenceForExpression does not set the parent if the scope stack is empty. Hence set it manually to the currect scope.
-             tempVarDeclaration->set_parent(scope);
-#if 0
-                {
-                  std::cout<<"\n"<<functionCall->get_file_info()->get_filenameString () << ":" << functionCall->get_file_info()->get_line() << ":" << functionCall->get_file_info()->get_col();
-                  std::cout<<"\n Name = "<< tempVarDeclaration->get_mangled_name().getString()<< " : type : " << arg->get_type()->class_name() << " Expr class : " << arg->class_name();
-                }
-#endif
-             ROSE_ASSERT(tempVarDeclaration != NULL );
-
-          // DQ (3/1/2015): This is not always true (see inputBug317.C).
-             ROSE_ASSERT(tempVarDeclaration->get_definition(0) != NULL);
-             ROSE_ASSERT(isSgVariableDefinition(tempVarDeclaration->get_definition()) != NULL);
-        
-             //Insert the temporary variable declaration
-             InsertStatement(tempVarDeclaration, functionCallInfo.tempVarDeclarationLocation, functionCallInfo);
-        
-             // remember the introduced temp so that it can be queried
-             temporariesIntroduced.push_back(tempVarDeclaration);
-        
-             //Replace the argument with the new temporary variable
-             SageInterface::replaceExpression(arg, tempVarReference);
-           }
-          else
-           {
-             printf ("In ExtractFunctionArguments::RewriteFunctionCallArguments(): Skipping normalization of function arguments of type SgFunctionType \n");
-           }
-    }
-}
-
-
-// If we have a limitation in normalizing the function return false
-bool ExtractFunctionArguments::FunctionArgumentCanBeNormalized(SgExpression* argument)
-{
-    while ((isSgPointerDerefExp(argument) || isSgCastExp(argument) || isSgAddressOfOp(argument)))
-    {
-        argument = isSgUnaryOp(argument)->get_operand();
-    }
-    // Don't include SgConstructorInitializer since it will be called even on the temporary, so avoid double copy.
-    if (isSgFunctionRefExp(argument) || isSgMemberFunctionRefExp(argument) || isSgConstructorInitializer(argument))
-        return false;
-    
-    // Unknow Template type expressions can't be normalized.
-    if (isSgTypeUnknown(argument->get_type()) || isSgMemberFunctionType(argument->get_type())) {
-        //printf("\n Skipping over SgTypeUnknown/SgMemberFunctionType  expr");
-        return false;
-    }
-    
-    return true;
-}
-
-
-
-/** Given the expression which is the argument to a function call, returns true if that
- * expression should be pulled out into a temporary variable on a separate line.
- * E.g. if the expression contains a function call, it needs to be normalized, while if it
- * is a constant, there is no need to change it. */
-
-bool ExtractFunctionArguments::FunctionArgumentNeedsNormalization(SgExpression* argument)
-{
-    // Trivial argument don't need to be listed
-    
-    if (IsFunctionArgumentTrivial(argument))
-        return false;
-
-    // true/false based on our ability to normalize the argument
-    return FunctionArgumentCanBeNormalized(argument);
-}
-
-
-/** Returns true if any of the arguments of the given function call will need to
- * be extracted. */
-bool ExtractFunctionArguments::FunctionArgsNeedNormalization(SgExprListExp* functionArgs)
-{
-    ROSE_ASSERT(functionArgs != NULL);
-    SgExpressionPtrList& argumentList = functionArgs->get_expressions();
-    
-    foreach(SgExpression* functionArgument, argumentList)
-    {
-        if (FunctionArgumentNeedsNormalization(functionArgument))
-            return true;
-    }
-    return false;
-}
-
-/** Returns true if any function calls in the given subtree will need to be
- * instrumented. (to extract function arguments). */
-bool ExtractFunctionArguments::SubtreeNeedsNormalization(SgNode* top)
-{
-    ROSE_ASSERT(top != NULL);
-    Rose_STL_Container<SgNode*> functionCalls = NodeQuery::querySubTree(top, V_SgFunctionCallExp);
-    for (Rose_STL_Container<SgNode*>::const_iterator iter = functionCalls.begin(); iter != functionCalls.end(); iter++)
-    {
-        SgExpression* functionCall = isSgFunctionCallExp(*iter);
-        ROSE_ASSERT(functionCall != NULL);
-        if (FunctionArgumentNeedsNormalization(functionCall))
-            return true;
-    }
-    
-    return false;
-}
-
-/** Insert a new statement in the specified location. The actual insertion can occur either before or after the location
- * depending on the insertion mode. */
-void ExtractFunctionArguments::InsertStatement(SgStatement* newStatement, SgStatement* location, const FunctionCallInfo& insertionMode)
-{
-    switch (insertionMode.tempVarDeclarationInsertionMode)
-    {
-        case FunctionCallInfo::INSERT_BEFORE:
-            SageInterface::insertStatementBefore(location, newStatement);
-            break;
-        case FunctionCallInfo::APPEND_SCOPE:
-        {
-            SgScopeStatement* scopeStatement = isSgScopeStatement(location);
-            if (scopeStatement == NULL)
-            {
-                //scopeStatement = isSgScopeStatement(SageInterface::ensureBasicBlockAsParent(location));
-                if (SageInterface::isBodyStatement(location)) // if the location is a single body statement (not a basic block) at this point
-                    scopeStatement = SageInterface::makeSingleStatementBodyToBlock (location);
-                else
-                    scopeStatement = isSgScopeStatement(location->get_parent());
-            }
-            ROSE_ASSERT(scopeStatement != NULL);
-            
-            SageInterface::appendStatement(newStatement, scopeStatement);
-            break;
-        }
-        case FunctionCallInfo::INVALID:
-        default:
-            ROSE_ABORT();
-    }
-}
-
-/** Traverses the subtree of the given AST node and finds all function calls in
- * function-evaluation order. */
-/*static*/pair< std::vector<FunctionCallInfo>, std::vector<FunctionCallInfo> > FunctionEvaluationOrderTraversal::GetFunctionCalls(SgNode* root)
-{
-    FunctionEvaluationOrderTraversal t;
-    FunctionCallInheritedAttribute rootAttribute;
-    t.traverse(root, rootAttribute);
-    
-    return pair< std::vector<FunctionCallInfo>, std::vector<FunctionCallInfo> > (t.normalizableFunctionCalls, t.nonNormalizableFunctionCalls);
-}
diff --git a/src/midend/programTransformation/extractFunctionArgumentsNormalization/ExtractFunctionArguments.h b/src/midend/programTransformation/extractFunctionArgumentsNormalization/ExtractFunctionArguments.h
deleted file mode 100644
index 7bd0d37c3f3..00000000000
--- a/src/midend/programTransformation/extractFunctionArgumentsNormalization/ExtractFunctionArguments.h
+++ /dev/null
@@ -1,83 +0,0 @@
-#pragma once
-
-// DQ (10/5/2014): This is more strict now that we include rose_config.h in the sage3basic.h.
-// #include "rose.h"
-#include "sage3basic.h"
-
-#include "functionEvaluationOrderTraversal.h"
-
-//class FunctionCallInfo;
-
-//! This normalization makes sure each function call argument is a side-effect free expression of only one variable.
-//! To accomplish this, temporary variables are declared and the arguments of a function are evaluated before the function itself.
-//! Note: Normalization is not performed if it is unsafe. E,g.: while(Foo(Bar()) {}  is not equal to t = Bar(); while(Foo(t) {}
-//! Note that only SgFunctionCall arguments are normalized. For example the arguments of the constructor initializer
-//! MyObject o(foo(), bar()) will not be extracted. 
-class ExtractFunctionArguments
-{
-public:
-
-    /** Performs the function argument extraction on all function calls in the given subtree of the AST. */
-    /** It does not do transofrmations in places where it is not safe. If you pass doUnsafeNormalization= true, we will normalize all call sites ignoring the safety (Suggested by Markus Schordan) */
-    void NormalizeTree(SgNode* tree, bool doUnsafeNormalization = false);
-
-    // returns a vector of newly introduced temporaries
-    std::vector<SgVariableDeclaration*> GetTemporariesIntroduced();
-    
-    /*
-     IsNormalized: Given a subtree, returns true if every argument of every function call is a trivial arguemnt.
-     */    
-    bool IsNormalized(SgNode* tree);
-    
-    /*
-     IsNormalizable: Given a subtree, returns true if every argument of every function call is a either trivial arguemnt or
-     is present in a SAFE place from where lifting is possible.
-     */    
-    bool IsNormalizable(SgNode* tree);
-
-    
-private:
-
-    std::vector<SgVariableDeclaration*> temporariesIntroduced;
-    std::pair< std::vector<FunctionCallInfo>, std::vector<FunctionCallInfo> > functionCalls;
-    
-    /** Given the expression which is the argument to a function call, returns true if that
-     * expression should be pulled out into a temporary variable on a separate line.
-     * E.g. if the expression contains a function call, it needs to be normalized, while if it
-     * is a constant, there is no need to change it. */
-    bool FunctionArgumentNeedsNormalization(SgExpression* argument);
-
-    /** Returns true if any of the arguments of the given function call will need to
-     * be extracted. */
-    bool FunctionArgsNeedNormalization(SgExprListExp* functionArgs);
-
-    /** Returns true if any function calls in the given subtree will need to be
-     * instrumented. (to extract function arguments). */
-    bool SubtreeNeedsNormalization(SgNode* top);
-
-    /** Given the information about a function call (obtained through a traversal), extract its arguments
-     * into temporary variables where it is necessary. */
-    void RewriteFunctionCallArguments(const FunctionCallInfo& functionCallInfo);
-
-    /** Insert a new statement in the specified location. The actual insertion can occur either before or after the location
-     * depending on the insertion mode. */
-    void InsertStatement(SgStatement* newStatement, SgStatement* location, const FunctionCallInfo& insertionMode);
-
-    bool FunctionArgumentCanBeNormalized(SgExpression* argument);
-    
-    
-    /* Given the expression which is the argument to a function call, returns true if that
-     expression is trivial. Trivial expressions are those which are simple variable references or constants.
-     */
-    bool IsFunctionArgumentTrivial(SgExpression* argument);
-
-    /* Given a vector of function call sites returns true if every argument of every function call is a trivial expression
-     (IsFunctionArgumentTrivial). Such functions don't need to be normalized.
-     */
-    bool AreAllFunctionCallsTrivial(std::vector<FunctionCallInfo> functions);
-    
-    /* Given a vector of function call sites, returns true if every argument
-     at every function call site is either trivial (IsFunctionArgumentTrivial) or can be normalized (FunctionArgumentCanBeNormalized).
-     */
-    bool AreAllFunctionCallsNormalizable(std::vector<FunctionCallInfo> functions);
-};
diff --git a/src/midend/programTransformation/extractFunctionArgumentsNormalization/Makefile.am b/src/midend/programTransformation/extractFunctionArgumentsNormalization/Makefile.am
deleted file mode 100644
index 4d9b1a853a7..00000000000
--- a/src/midend/programTransformation/extractFunctionArgumentsNormalization/Makefile.am
+++ /dev/null
@@ -1,22 +0,0 @@
-include $(top_srcdir)/config/Makefile.for.ROSE.includes.and.libs
-
-AM_CPPFLAGS = $(ROSE_INCLUDES)
-#LINK	 = $(CXXLINK)
-
-# noinst_LTLIBRARIES lists all the libraries that should be built, but not installed
-noinst_LTLIBRARIES =  libExtractFunctionArgumentsNormalization.la
-
-libExtractFunctionArgumentsNormalization_la_DEPENDENCIES = $(srcdir)/../singleStatementToBlockNormalization/SingleStatementToBlockNormalization.h
-libExtractFunctionArgumentsNormalization_la_CXXFLAGS = -I$(srcdir)/../singleStatementToBlockNormalization
-libExtractFunctionArgumentsNormalization_la_SOURCES = ExtractFunctionArguments.C functionEvaluationOrderTraversal.C
-pkginclude_HEADERS = ExtractFunctionArguments.h functionEvaluationOrderTraversal.h
-
-
-# EXTRA_DIST are files that are not compiled or installed. These include readme's, internal header files, etc.
-EXTRA_DIST = 
-
-CLEANFILES = 
-
-
-check-local:
-
diff --git a/src/midend/programTransformation/extractFunctionArgumentsNormalization/functionEvaluationOrderTraversal.C b/src/midend/programTransformation/extractFunctionArgumentsNormalization/functionEvaluationOrderTraversal.C
deleted file mode 100644
index 175939503f8..00000000000
--- a/src/midend/programTransformation/extractFunctionArgumentsNormalization/functionEvaluationOrderTraversal.C
+++ /dev/null
@@ -1,166 +0,0 @@
-#include "sage3basic.h"                                 // every librose .C file must start with this
-#include <functionEvaluationOrderTraversal.h>
-
-
-bool IsStatusSafe(int status){
-    if (status == FunctionCallInheritedAttribute::IN_SAFE_PLACE)
-        return true;
-    if (status == FunctionCallInheritedAttribute::INSIDE_FOR_INIT)
-        return true;
-    return false;
-}
-
-/** Visits AST nodes in pre-order */
-FunctionCallInheritedAttribute FunctionEvaluationOrderTraversal::evaluateInheritedAttribute(SgNode* astNode, FunctionCallInheritedAttribute parentAttribute)
-{
-    FunctionCallInheritedAttribute result = parentAttribute;
-    SgForStatement* parentForLoop = isSgForStatement(parentAttribute.currentScope);
-    SgWhileStmt* parentWhileLoop = isSgWhileStmt(parentAttribute.currentScope);
-    SgDoWhileStmt* parentDoWhileLoop = isSgDoWhileStmt(parentAttribute.currentScope);
-    
-    SgConditionalExp* parentSgConditionalExp = astNode->get_parent() ? isSgConditionalExp(astNode->get_parent()) : NULL;
-    SgAndOp* parentAndOp =  astNode->get_parent() ?isSgAndOp(astNode->get_parent()) : NULL;
-    SgOrOp* parentOrOp =  astNode->get_parent() ? isSgOrOp(astNode->get_parent()) : NULL;
-
-    if (isSgForStatement(astNode))
-        result.currentScope = isSgForStatement(astNode);
-    else if (isSgWhileStmt(astNode))
-        result.currentScope = isSgWhileStmt(astNode);
-    else if (isSgDoWhileStmt(astNode))
-        result.currentScope = isSgDoWhileStmt(astNode);
-    //else if (isSgConditionalExp(astNode))
-    //    result.currentScope = isSgConditionalExp(astNode);
-    //else if (isSgAndOp(astNode))
-    //    result.currentScope = isSgAndOp(astNode);
-    //else if (isSgOrOp(astNode))
-    //    result.currentScope = isSgOrOp(astNode);
-    else if (isSgForInitStatement(astNode)) {
-        ROSE_ASSERT(result.scopeStatus == FunctionCallInheritedAttribute::IN_SAFE_PLACE);
-        result.scopeStatus = FunctionCallInheritedAttribute::INSIDE_FOR_INIT;
-        ROSE_ASSERT(isSgForStatement(result.currentScope));
-    } else if (parentForLoop != NULL && parentForLoop->get_test() == astNode) {
-        ROSE_ASSERT(result.scopeStatus == FunctionCallInheritedAttribute::IN_SAFE_PLACE);
-        result.scopeStatus = FunctionCallInheritedAttribute::INSIDE_FOR_TEST;
-    } else if (parentForLoop != NULL && parentForLoop->get_increment() == astNode) {
-        ROSE_ASSERT(result.scopeStatus == FunctionCallInheritedAttribute::IN_SAFE_PLACE);
-        result.scopeStatus = FunctionCallInheritedAttribute::INSIDE_FOR_INCREMENT;
-    } else if (parentWhileLoop != NULL && parentWhileLoop->get_condition() == astNode) {
-        ROSE_ASSERT(result.scopeStatus == FunctionCallInheritedAttribute::IN_SAFE_PLACE);
-        result.scopeStatus = FunctionCallInheritedAttribute::INSIDE_WHILE_CONDITION;
-    } else if (parentDoWhileLoop != NULL && parentDoWhileLoop->get_condition() == astNode) {
-        ROSE_ASSERT(result.scopeStatus == FunctionCallInheritedAttribute::IN_SAFE_PLACE);
-        result.scopeStatus = FunctionCallInheritedAttribute::INSIDE_DO_WHILE_CONDITION;
-    } else if( parentSgConditionalExp != NULL && parentSgConditionalExp->get_true_exp() == astNode) {
-        // if the scope status was safe, turn it into unsafe
-        if (IsStatusSafe(result.scopeStatus))
-            result.scopeStatus = FunctionCallInheritedAttribute::INSIDE_CONDITIONAL_EXP_TRUE_ARM;
-    } else if(parentSgConditionalExp != NULL && parentSgConditionalExp->get_false_exp() == astNode) {
-        // if the scope status was safe, turn it into unsafe
-        if (IsStatusSafe(result.scopeStatus))
-            result.scopeStatus = FunctionCallInheritedAttribute::INSIDE_CONDITIONAL_EXP_FALSE_ARM;
-    } else if( parentOrOp != NULL && parentOrOp->get_rhs_operand () == astNode) {
-        // if the scope status was safe, turn it into unsafe
-        if (IsStatusSafe(result.scopeStatus))
-            result.scopeStatus = FunctionCallInheritedAttribute::INSIDE_SHORT_CIRCUIT_EXP_RHS;
-    } else if( parentAndOp != NULL && parentAndOp->get_rhs_operand () == astNode)  {
-        // if the scope status was safe, turn it into unsafe
-        if (IsStatusSafe(result.scopeStatus))
-            result.scopeStatus = FunctionCallInheritedAttribute::INSIDE_SHORT_CIRCUIT_EXP_RHS;
-    }
-    
-    //We can't insert variables before an expression statement that appears inside if(), switch, throw, etc.
-    if (isSgExprStatement(astNode) && !isSgBasicBlock(astNode->get_parent())) {
-        //We can't insert a variable declaration at these locations. Use the parent statement
-    } else if (isSgStatement(astNode)) {
-        result.lastStatement = isSgStatement(astNode);
-    }
-
-    return result;
-}
-
-// Returns false in the absence of any analysis information
-bool FunctionEvaluationOrderTraversal::IsFunctionCallSideEffectFree(SgFunctionCallExp* functionCall) {
-    return false;
-}
-
-
-/** Visits AST nodes in post-order. This is function-evaluation order. */
-bool FunctionEvaluationOrderTraversal::evaluateSynthesizedAttribute(SgNode* astNode, FunctionCallInheritedAttribute parentAttribute, SynthesizedAttributesList)
-{
-    SgFunctionCallExp* functionCall = isSgFunctionCallExp(astNode);
-    if (functionCall == NULL)
-        return false; //dummy return value
-    
-    FunctionCallInfo functionCallInfo(functionCall);
-
-    // Can't lift function call arguments from the following:
-    // 1. For loop test and increment
-    // 2. While loop test
-    // 3. Do-While loop test
-    // 4. Either arms of ternary op
-    // 5. RHS of any short circuit expression
-    // An alternative is to use comma operators and use assignemnt op as done by the original author. 
-    // for(;foo(bar());) ==> T i; for(;i=bar();foo(i);)
-    // But using assignement op is not always safe and it requires us to always have a default constructor
-    // There is also an issue when the return type is a reference and we'll have to use & op to get a pointer
-    // but if & op is overloaded we may not get the pointer.
-    // Taking all these in view, I am simpling not lifting such expressions.
-    
-    if (parentAttribute.scopeStatus == FunctionCallInheritedAttribute::INSIDE_FOR_TEST ||
-        parentAttribute.scopeStatus == FunctionCallInheritedAttribute::INSIDE_FOR_INCREMENT ||
-        parentAttribute.scopeStatus == FunctionCallInheritedAttribute::INSIDE_WHILE_CONDITION ||
-        parentAttribute.scopeStatus == FunctionCallInheritedAttribute::INSIDE_DO_WHILE_CONDITION) {
-
-        // ***** FOR UNSAFE TRANSFORMATION *******
-        //Temporary variables should be declared before the stmt
-        ROSE_ASSERT(isSgStatement(parentAttribute.currentScope));
-        functionCallInfo.tempVarDeclarationLocation = isSgStatement(parentAttribute.currentScope);
-        functionCallInfo.tempVarDeclarationInsertionMode = FunctionCallInfo::INSERT_BEFORE;
-
-        nonNormalizableFunctionCalls.push_back(functionCallInfo);
-        return false;
-    }
-
-    // In future, if the function call is assured to be side effect free, then we can lift it from short circuit and conditional expressions
-    if(parentAttribute.scopeStatus == FunctionCallInheritedAttribute::INSIDE_CONDITIONAL_EXP_TRUE_ARM ||
-       parentAttribute.scopeStatus == FunctionCallInheritedAttribute::INSIDE_CONDITIONAL_EXP_FALSE_ARM ||
-       parentAttribute.scopeStatus == FunctionCallInheritedAttribute::INSIDE_SHORT_CIRCUIT_EXP_RHS){
-        
-        if(!IsFunctionCallSideEffectFree(functionCall)) {
-            
-            // ***** FOR UNSAFE TRANSFORMATION *******
-            //Temporary variables should be declared before the stmt
-            ROSE_ASSERT(parentAttribute.lastStatement);
-            functionCallInfo.tempVarDeclarationLocation = parentAttribute.lastStatement;
-            functionCallInfo.tempVarDeclarationInsertionMode = FunctionCallInfo::INSERT_BEFORE;
-
-            nonNormalizableFunctionCalls.push_back(functionCallInfo);
-            return false;
-        }
-    }
-    
-    //Handle for loops (being inside the body of a for loop doesn't need special handling)
-    if (parentAttribute.scopeStatus == FunctionCallInheritedAttribute::INSIDE_FOR_INIT)
-    {
-        SgForStatement* forLoop = isSgForStatement(parentAttribute.currentScope);
-        ROSE_ASSERT(forLoop != NULL);
-        //Temporary variables should be declared before the loop
-        functionCallInfo.tempVarDeclarationLocation = forLoop;
-        functionCallInfo.tempVarDeclarationInsertionMode = FunctionCallInfo::INSERT_BEFORE;
-    }
-    else if (parentAttribute.scopeStatus == FunctionCallInheritedAttribute::IN_SAFE_PLACE)
-    {
-        //Assume we're in a basic block. Then just insert right before the current statement
-        ROSE_ASSERT(parentAttribute.scopeStatus = FunctionCallInheritedAttribute::IN_SAFE_PLACE);
-        functionCallInfo.tempVarDeclarationLocation = parentAttribute.lastStatement;
-        functionCallInfo.tempVarDeclarationInsertionMode = FunctionCallInfo::INSERT_BEFORE;
-    }
-    else
-    {
-        //Unhandled condition?!
-        ROSE_ABORT();
-    }
-
-    normalizableFunctionCalls.push_back(functionCallInfo);
-    return false; //dummy return value
-}
diff --git a/src/midend/programTransformation/extractFunctionArgumentsNormalization/functionEvaluationOrderTraversal.h b/src/midend/programTransformation/extractFunctionArgumentsNormalization/functionEvaluationOrderTraversal.h
deleted file mode 100644
index e00d7203382..00000000000
--- a/src/midend/programTransformation/extractFunctionArgumentsNormalization/functionEvaluationOrderTraversal.h
+++ /dev/null
@@ -1,89 +0,0 @@
-#pragma once
-
-// DQ (10/5/2014): This is more strict now that we include rose_config.h in the sage3basic.h.
-// #include "rose.h"
-// rose.h and sage3basic.h should not be included in librose header files. [Robb P. Matzke 2014-10-15]
-// #include "sage3basic.h"
-
-struct FunctionCallInheritedAttribute
-{
-    /** The innermost scope inside of which this AST node resides. It is either a for-loop,
-         a do-loop,  a while-loop or a conditioanl expression. */
-    SgNode* currentScope;
-
-    /** The last statement encountered before the current node in the AST. */
-    SgStatement* lastStatement;
-
-    /** Is the current node inside a for loop or conditional expresion structure (not the body). */
-    enum
-    {
-        INSIDE_FOR_INIT, INSIDE_FOR_TEST, INSIDE_FOR_INCREMENT, INSIDE_WHILE_CONDITION,
-        INSIDE_DO_WHILE_CONDITION, IN_SAFE_PLACE, INSIDE_CONDITIONAL_EXP_TRUE_ARM, INSIDE_CONDITIONAL_EXP_FALSE_ARM, INSIDE_SHORT_CIRCUIT_EXP_RHS
-    }
-    scopeStatus;
-
-    /** Default constructor. Initializes everything to NULL. */
-    FunctionCallInheritedAttribute() : currentScope(NULL), lastStatement(NULL), scopeStatus(IN_SAFE_PLACE) { }
-};
-
-/** Stores a function call expression, along with associated information about its context. */
-struct FunctionCallInfo
-{
-    /** The function call expression. */
-    SgFunctionCallExp* functionCall;
-
-    /** When a variable is created to replace one of the arguments of this function, where should it be inserted?
-     * The declaration of the variable will occur right before this statement. */
-    SgStatement* tempVarDeclarationLocation;
-
-    /** How a statement should be inserted.   */
-    enum InsertionMode
-    {
-        /** Insert right before the given statement. */
-        INSERT_BEFORE,
-        /** Insert at the bottom of the scope defined by the given statement. */
-        APPEND_SCOPE,
-        INVALID
-    };
-
-    /** How to insert the temporary variable declaration. */
-    InsertionMode tempVarDeclarationInsertionMode;
-
-    FunctionCallInfo(SgFunctionCallExp * function) :
-    functionCall(function),
-    tempVarDeclarationLocation(NULL),
-    tempVarDeclarationInsertionMode(INVALID) { }
-};
-
-
-//! Traverses a given AST and finds all function calls in the order in which they're evaluated
-//! Also, for each function we find where to put declarations of temporary variables so that they're accessible at the function call
-
-class FunctionEvaluationOrderTraversal : public AstTopDownBottomUpProcessing<FunctionCallInheritedAttribute, bool>
-{
-public:
-    /** Traverses the subtree of the given AST node and finds all function calls in
-     * function-evaluation order. */
-    static std::pair< std::vector<FunctionCallInfo>, std::vector<FunctionCallInfo> > GetFunctionCalls(SgNode* root);
-
-    /** Visits AST nodes in pre-order */
-    FunctionCallInheritedAttribute evaluateInheritedAttribute(SgNode* astNode, FunctionCallInheritedAttribute parentAttribute);
-
-    /** Visits AST nodes in post-order. This is function-evaluation order. */
-    bool evaluateSynthesizedAttribute(SgNode* astNode, FunctionCallInheritedAttribute parentAttribute, SynthesizedAttributesList);
-
-    /// Returns true if the function call has no side effects.
-    virtual bool IsFunctionCallSideEffectFree(SgFunctionCallExp* functionCall);
-
-private:
-
-    //! Private constructor. Use the static method to access the functionality of this class.
-
-    FunctionEvaluationOrderTraversal() { }
-
-    /** All the function calls seen so far that can be normalized. */
-    std::vector<FunctionCallInfo> normalizableFunctionCalls;
-    /** All the function calls seen so far that can't be normalized. */
-    std::vector<FunctionCallInfo> nonNormalizableFunctionCalls;
-};
-

From f9e8ad7bd34ea0db3daee2a3cb315b7a3608ec8f Mon Sep 17 00:00:00 2001
From: Patrick Flynn <pflynn157@gmail.com>
Date: Wed, 13 Sep 2023 12:41:37 -0400
Subject: [PATCH 12/42] Removed potentially dead midend code

---
 src/midend/astProcessing/CMakeLists.txt       |    7 +-
 src/midend/astProcessing/SgGraphTemplate.h    |  201 --
 src/midend/astProcessing/graphProcessing.h    | 1560 --------------
 .../astProcessing/graphProcessingSgIncGraph.h | 1865 -----------------
 src/midend/astProcessing/graphTemplate.h      |  533 -----
 .../functional/roseTests/CMakeLists.txt       |    2 +-
 .../astProcessingTests/CMakeLists.txt         |   24 +-
 7 files changed, 18 insertions(+), 4174 deletions(-)
 delete mode 100644 src/midend/astProcessing/SgGraphTemplate.h
 delete mode 100644 src/midend/astProcessing/graphProcessing.h
 delete mode 100644 src/midend/astProcessing/graphProcessingSgIncGraph.h
 delete mode 100644 src/midend/astProcessing/graphTemplate.h

diff --git a/src/midend/astProcessing/CMakeLists.txt b/src/midend/astProcessing/CMakeLists.txt
index 075c79f514e..ec4582f4c22 100644
--- a/src/midend/astProcessing/CMakeLists.txt
+++ b/src/midend/astProcessing/CMakeLists.txt
@@ -32,10 +32,13 @@ set(files_to_install
   AstReverseSimpleProcessing.h AstRestructure.h AstClearVisitFlags.h
   AstTraversal.h AstCombinedProcessing.h AstCombinedProcessingImpl.h
   AstCombinedSimpleProcessing.h StackFrameVector.h
-  graphProcessing.h graphProcessingSgIncGraph.h graphTemplate.h
+  #graphProcessing.h
+  #graphProcessingSgIncGraph.h
+  #graphTemplate.h
   AstSharedMemoryParallelProcessing.h AstSharedMemoryParallelProcessingImpl.h
   AstSharedMemoryParallelSimpleProcessing.h
-  SgGraphTemplate.h TreeTraversal.h)
+  #SgGraphTemplate.h
+  TreeTraversal.h)
 
 if(NOT WIN32)
   #tps commented out AstSharedMemoryParallelProcessing.h for Windows
diff --git a/src/midend/astProcessing/SgGraphTemplate.h b/src/midend/astProcessing/SgGraphTemplate.h
deleted file mode 100644
index 9429026a6b4..00000000000
--- a/src/midend/astProcessing/SgGraphTemplate.h
+++ /dev/null
@@ -1,201 +0,0 @@
-#include <boost/graph/adjacency_list.hpp>
-#include <boost/graph/astar_search.hpp>
-//#include <graphProcessing.h>
-#include <staticCFG.h>
-#include <interproceduralCFG.h>
-#include <rose.h>
-struct Vertex{
-    SgGraphNode* sg;
-    CFGNode cfgnd;
-};
-
-struct Edge {
-    SgDirectedGraphEdge* gedge;
-};
-
-typedef boost::adjacency_list<
-        boost::vecS,
-        boost::vecS,
-        boost::bidirectionalS,
-        Vertex,
-        Edge
-> myGraph;
-
-typedef myGraph::vertex_descriptor VertexID;
-typedef myGraph::edge_descriptor EdgeID;
-
-//myGraph* instantiateGraph(SgIncidencedDirectedGraph* g, StaticCFG::CFG cfg);
-std::pair<std::vector<SgGraphNode*>, std::vector<SgDirectedGraphEdge*> > getAllNodesAndEdges(SgIncidenceDirectedGraph* g, SgGraphNode* start);
-std::map<VertexID, SgGraphNode*> getGraphNode;
-std::map<SgGraphNode*, VertexID> VSlink;
-
-myGraph* instantiateGraph(SgIncidenceDirectedGraph*& g, StaticCFG::InterproceduralCFG& cfg, SgNode* pstart) {
-    //SgNode* prestart = cfg.getEntry();
-    //cfg.buildFullCFG();
-    CFGNode startN = cfg.getEntry();
-    SgGraphNode* start = cfg.toGraphNode(startN);
-    ROSE_ASSERT(startN != NULL);
-    ROSE_ASSERT(start != NULL);
-    myGraph* graph = new myGraph;
-    //std::map<SgGraphNode*, VertexID> VSlink;
-    std::pair<std::vector<SgGraphNode*>, std::vector<SgDirectedGraphEdge*> > alledsnds = getAllNodesAndEdges(g, start);
-    std::vector<SgGraphNode*> nods = alledsnds.first;
-    std::vector<SgDirectedGraphEdge*> eds = alledsnds.second;
-    std::set<std::pair<VertexID, VertexID> > prs;
-    //for (std::vector<vertex_descriptor> i = nods.begin(); i != nods.end(); i++) {
-    //    VertexID vID = boost::add_vertex(graph);
-    //    graph[vID].cfgnd = cfg->toCFGNode(*i);
-    //}
-    for (std::vector<SgDirectedGraphEdge*>::iterator j = eds.begin(); j != eds.end(); j++) {
-        SgDirectedGraphEdge* u = *j;
-        SgGraphNode* u1 = u->get_from();
-        SgGraphNode* u2 = u->get_to();
-        VertexID v1;
-        VertexID v2;
-        if (VSlink.find(u1) == VSlink.end()) {
-            v1 = boost::add_vertex(*graph);
-            getGraphNode[v1] = u1;
-            VSlink[u1] = v1;
-            (*graph)[v1].sg = u1;
-            (*graph)[v1].cfgnd = cfg.toCFGNode(u1);
-        }
-        else {
-            v1 = VSlink[u1];
-        }
-        if (VSlink.find(u2) != VSlink.end()) {
-            v2 = VSlink[u2];
-        }
-        else {
-            v2 = boost::add_vertex(*graph);
-            VSlink[u2] = v2;
-            (*graph)[v2].sg = u2;
-            getGraphNode[v2] = u2;
-            (*graph)[v2].cfgnd = cfg.toCFGNode(u2);
-        }
-        bool ok;
-        EdgeID uE;
-        std::pair<VertexID, VertexID> pr;
-        pr.first = v1;
-        pr.second = v2;
-        if (prs.find(pr) == prs.end()) {
-            prs.insert(pr);
-            boost::tie(uE, ok) = boost::add_edge(v1, v2, *graph);
-        }
-    }
-    //std::cout << "prs.size: " << prs.size() << std::endl;
-    return graph;
-}
-
-
-
-myGraph* instantiateGraph(SgIncidenceDirectedGraph*& g, StaticCFG::CFG& cfg) {
-    SgGraphNode* start = cfg.getEntry();
-    myGraph* graph = new myGraph;
-    //std::map<SgGraphNode*, VertexID> VSlink;
-    std::pair<std::vector<SgGraphNode*>, std::vector<SgDirectedGraphEdge*> > alledsnds = getAllNodesAndEdges(g, start);
-    std::vector<SgGraphNode*> nods = alledsnds.first;
-    std::vector<SgDirectedGraphEdge*> eds = alledsnds.second;
-    std::set<std::pair<VertexID, VertexID> > prs;
-    //for (std::vector<vertex_descriptor> i = nods.begin(); i != nods.end(); i++) {
-    //    VertexID vID = boost::add_vertex(graph);
-    //    graph[vID].cfgnd = cfg->toCFGNode(*i);
-    //}
-    for (std::vector<SgDirectedGraphEdge*>::iterator j = eds.begin(); j != eds.end(); j++) {
-        SgDirectedGraphEdge* u = *j;
-        SgGraphNode* u1 = u->get_from();
-        SgGraphNode* u2 = u->get_to();
-        VertexID v1;
-        VertexID v2;
-        if (VSlink.find(u1) == VSlink.end()) {
-            v1 = boost::add_vertex(*graph);
-            getGraphNode[v1] = u1;
-            VSlink[u1] = v1;
-            (*graph)[v1].sg = u1;
-            (*graph)[v1].cfgnd = cfg.toCFGNode(u1);
-        }
-        else {
-            v1 = VSlink[u1];
-        }
-        if (VSlink.find(u2) != VSlink.end()) {
-            v2 = VSlink[u2];
-        }
-        else {
-            v2 = boost::add_vertex(*graph);
-            VSlink[u2] = v2;
-            (*graph)[v2].sg = u2;
-            getGraphNode[v2] = u2;
-            (*graph)[v2].cfgnd = cfg.toCFGNode(u2);
-        }
-        bool ok;
-        EdgeID uE;
-        std::pair<VertexID, VertexID> pr;
-        pr.first = v1;
-        pr.second = v2;
-        if (prs.find(pr) == prs.end()) {
-            prs.insert(pr);
-            boost::tie(uE, ok) = boost::add_edge(v1, v2, *graph);
-        }
-    }
-    //std::cout << "prs.size: " << prs.size() << std::endl;
-    return graph;
-}
-
-
-    
-            
-std::pair<std::vector<SgGraphNode*>, std::vector<SgDirectedGraphEdge*> > getAllNodesAndEdges(SgIncidenceDirectedGraph* g, SgGraphNode* start) {
-    //for (int i = 0; i < starts.size(); i++) {
-    SgGraphNode* n = start;
-    std::vector<SgGraphNode*> nods;
-    std::vector<SgGraphNode*> newnods;
-    std::set<SgDirectedGraphEdge*> edsnew;
-    std::vector<SgDirectedGraphEdge*> eds;
-    std::vector<SgDirectedGraphEdge*> feds;
-    std::vector<SgGraphNode*> fnods;
-    std::set<std::pair<EdgeID, EdgeID> > prs;
-    std::set<SgDirectedGraphEdge*> oeds = g->computeEdgeSetOut(start);
-    fnods.push_back(start);
-    newnods.push_back(n);
-    
-    while (oeds.size() > 0) {
-        for (std::set<SgDirectedGraphEdge*>::iterator j = oeds.begin(); j != oeds.end(); j++) {
-            //if (find(eds.begin(), eds.end(), *j) == eds.end()) {
-                if (find(feds.begin(), feds.end(), *j) == feds.end()) {
-                    feds.push_back(*j);
-                    edsnew.insert(*j);
-                }
-                if (find(fnods.begin(), fnods.end(), (*j)->get_to()) == fnods.end()) {
-                    fnods.push_back((*j)->get_to());
-                }
-                newnods.push_back((*j)->get_to());
-            //}
-        }
-        
-        for (unsigned int i = 0; i < newnods.size(); i++) {
-           std::set<SgDirectedGraphEdge*> oedsp = g->computeEdgeSetOut(newnods[i]);
-           for (std::set<SgDirectedGraphEdge*>::iterator j = oedsp.begin(); j != oedsp.end(); j++) {
-               if (find(feds.begin(), feds.end(), *j) == feds.end()) {
-              //    feds.push_back(*j);
-                  edsnew.insert(*j);
-                  
-               }
-               //if (find(fnods.begin(), fnods.end(), (*j)->get_to()) == fnods.end()) {
-               //    fnods.push_back((*j)->get_to());
-               //    newnods.push_back((*j)->get_to());
-              // }
-    //           newnods.push_back((*j)->get_to());
-           }
-        }
-        nods = newnods;
-        oeds = edsnew;
-        edsnew.clear();
-        newnods.clear();
-    }
-    std::pair<std::vector<SgGraphNode*>, std::vector<SgDirectedGraphEdge*> > retpr;
-    retpr.first = fnods;
-    retpr.second = feds;
-    //std::cout << "fnods.size()" << fnods.size() << std::endl;
-    //std::cout << "feds.size()" << feds.size() << std::endl;
-    return retpr;
-}
-         
diff --git a/src/midend/astProcessing/graphProcessing.h b/src/midend/astProcessing/graphProcessing.h
deleted file mode 100644
index 07cdbd35235..00000000000
--- a/src/midend/astProcessing/graphProcessing.h
+++ /dev/null
@@ -1,1560 +0,0 @@
-/*
-
-FINISH TEMPFLATPATH CODE
-
-AS WRITTEN, THESE FUNCTIONS WILL ONLY WORK WITH GRAPHS THAT ARE IMPLEMENTED IN THE boost NAMESPACE.
-
-*/
-
-
-
-
-#define LP 1
-#define PERFDEBUG 0
-//#define FULLDEBUG 1
-#ifdef _OPENMP
-#include <omp.h>
-#endif
-#include <boost/regex.hpp>
-#include <iostream>
-#include <fstream>
-#include <string>
-#include <assert.h>
-#include <staticCFG.h>
-
-/**
-*@file graphProcessing.h
-
-*Brief Overview of Algorithm:
-
-***********************
-*Current Implementation
-***********************
-
-*This implementation uses BOOSTs graph structure to analyze the paths of the graph
-
-*The path analyzer sends the user paths to be evaluated by the "analyzePath" function that is user defined
-
-**************************
-*Further Improvements: TODO
-**************************
-
-@todo utilize BOOST visitors to take advantage of the BOOST graph structures abilities
-
-***************
-*Contact Info
-***************
-
-*Finally, blame can be assigned to and questions can be forwarded to the author, though response is not guaranteed
-
-*if I'm still at Lawrence
-*hoffman34 AT llnl DOT gov
-*@author Michael Hoffman
-*/
-
-
-#include <boost/graph/adjacency_list.hpp>
-#include <boost/bind.hpp>
-#include <boost/foreach.hpp>
-#include <boost/tuple/tuple.hpp>
-#include <boost/graph/graphviz.hpp>
-#include <boost/graph/dominator_tree.hpp>
-#include <boost/graph/reverse_graph.hpp>
-#include <boost/graph/transpose_graph.hpp>
-#include <boost/algorithm/string.hpp>
-
-
-
-#include <vector>
-#include <algorithm>
-#include <utility>
-#include <iostream>
-#include <sys/time.h>
-#include <sys/resource.h>
-#include <sys/time.h>
-
-
-
-
-
-
-template <class CFG>
-class SgGraphTraversal
-{
-public:
-
-  typedef typename boost::graph_traits<CFG>::vertex_descriptor Vertex;
-    typedef typename boost::graph_traits<CFG>:: edge_descriptor Edge;
-
-   void constructPathAnalyzer(CFG* g, bool unbounded=false, Vertex end=0, Vertex begin=0, bool ns = true);
-   virtual void analyzePath(std::vector<Vertex>& pth) = 0;
-    std::vector<int> getInEdges(int& node, CFG*& g);
-    std::vector<int> getOutEdges(int& node, CFG*& g);
-    int getTarget(int& n, CFG*& g);
-    int getSource(int& n, CFG*& g);
-    std::map<Vertex, int> vertintmap;
-    std::map<Edge, int> edgeintmap;
-    std::map<int, Vertex> intvertmap;
-    std::map<int, Edge> intedgemap;
-   SgGraphTraversal();
-    virtual ~SgGraphTraversal();
-   SgGraphTraversal( SgGraphTraversal &);
-    SgGraphTraversal &operator=( SgGraphTraversal &);
-   int pathnum;
-
-
-  void firstPrepGraph(CFG*& g);
-
-private:
-
-    int normals;
-    int abnormals;
-    bool needssafety;
-    int recursed;
-    int checkedfound;
- //   typedef typename boost::graph_traits<CFG>::vertex_descriptor Vertex;
- //   typedef typename boost::graph_traits<CFG>:: edge_descriptor Edge;
-   // std::vector<int> getInEdges(int& node, CFG*& g);
-   // std::vector<int> getOutEdges(int& node, CFG*& g);
-    void prepareGraph(CFG*& g);
-    void findClosuresAndMarkersAndEnumerate(CFG*& g);
-  //  void constructPathAnalyzer(CFG* g, bool unbounded=false, Vertex end=0, Vertex begin=0, bool ns = true);
-  //  virtual void analyzePath(std::vector<Vertex>& pth) = 0;
-  //  void firstPrepGraph(CFG*& g);
-    int stoppedpaths;
-    std::set<std::vector<int> >  traversePath(int begin, int end, CFG*& g, bool loop=false);
-    std::set<std::vector<int> > uTraversePath(int begin, int end, CFG*& g, bool loop, std::map<int, std::vector<std::vector<int> > >& localLoops);
-    std::vector<std::vector<int> > bfsTraversePath(int begin, int end, CFG*& g, bool loop=false);
-    std::vector<int> unzipPath(std::vector<int>&  path, CFG*& g, int start, int end);
-    std::vector<int>  zipPath(std::vector<int>& path, CFG*& g, int start, int end);
-    std::vector<int> zipPath2(std::vector<int>& path, CFG*& g);
-    void printCFGNode(int& cf, std::ofstream& o);
-    void printCFGNodeGeneric(int& cf, std::string prop, std::ofstream& o);
-    void printCFGEdge(int& cf, CFG*& cfg, std::ofstream& o);
-    void printHotness(CFG*& g);
-    void printPathDot(CFG*& g);
-    void computeOrder(CFG*& g, const int& begin);
-    void computeSubGraphs(const int& begin, const int &end, CFG*& g, int depthDifferential);
-    //int getTarget(int& n, CFG*& g);
-    //int getSource(int& n, CFG*& g);
-    std::vector<int> sources;
-    std::vector<int> sinks;
-    std::vector<int>  recursiveLoops;
-    std::vector<int> recurses;
-    std::map<int, int> ptsNum;
-    bool borrowed;
-    std::set<int> badloop;
-    std::map<int, std::vector<std::vector<int> > >  totalLoops;
-//    int pathnum;
-    std::map<int, std::string> nodeStrings;
-    int sourcenum;
-    unsigned long long evaledpaths;
-    int badpaths;
-    int workingthreadnum;
-    bool workingthread;
-    std::map<int, std::set<std::vector<int> > > loopStore;
-    std::vector<std::vector<int> >  pathStore;
-    std::map<int, std::vector<int> > subpathglobal;
-    std::map<std::vector<int>, int> subpathglobalinv;
-    int nextsubpath;
-    std::vector<int>  orderOfNodes;
-//    std::map<Vertex, int> vertintmap;
-//    std::map<Edge, int> edgeintmap;
-//    std::map<int, Vertex> intvertmap;
-//    std::map<int, Edge> intedgemap;
-    std::vector<std::map<Vertex, Vertex> > SubGraphGraphMap;
-    std::vector<std::map<Vertex, Vertex> > GraphSubGraphMap;
-    std::vector<CFG*> subGraphVector;
-    void getVertexPath(std::vector<int> path, CFG*& g, std::vector<Vertex>& vertexPath );
-    void storeCompact(std::vector<int> path);
-    int nextNode;
-    int nextEdge;
-    std::vector<int> markers;
-    std::vector<int> closures;
-    std::map<int, int> markerIndex;
-    std::map<int, std::vector<int> > pathsAtMarkers;
-    typedef typename boost::graph_traits<CFG>::vertex_iterator vertex_iterator;
-    typedef typename boost::graph_traits<CFG>::out_edge_iterator out_edge_iterator;
-    typedef typename boost::graph_traits<CFG>::in_edge_iterator in_edge_iterator;
-    typedef typename boost::graph_traits<CFG>::edge_iterator edge_iterator;
-    bool bound;
-//    SgGraphTraversal();
-//    virtual ~SgGraphTraversal();
-//   SgGraphTraversal( SgGraphTraversal &);
-//    SgGraphTraversal &operator=( SgGraphTraversal &);
-
-
-};
-
-
-template<class CFG>
-SgGraphTraversal<CFG>::
-SgGraphTraversal()
-{
-}
-
-
-
-template<class CFG>
-SgGraphTraversal<CFG> &
-SgGraphTraversal<CFG>::
-operator=( SgGraphTraversal &other)
-{
-    return *this;
-}
-
-#ifndef SWIG
-
-template<class CFG>
-SgGraphTraversal<CFG>::
-~SgGraphTraversal()
-{
-}
-
-#endif
-
-/**
-    Gets the source of an edge
-    SgGraphTraversal::getSource
-    Input:
-    @param[edge] int& integer representation of edge in question
-    @param[g] CFG*& the CFG used
-*/
-template<class CFG>
-inline int
-SgGraphTraversal<CFG>::
-getSource(int& edge, CFG*& g)
-{
-    Edge e = intedgemap[edge];
-    Vertex v = boost::source(e, *g);
-    return(vertintmap[v]);
-}
-
-/**
-    Gets the target of an edge
-    SgGraphTraversal::getTarget
-    Input:
-    @param[edge] int& integer representation of edge in quesution
-    @param[g] the CFG*& CFG used
-*/
-
-
-template<class CFG>
-inline int
-SgGraphTraversal<CFG>::
-getTarget(int& edge, CFG*& g)
-{
-    Edge e = intedgemap[edge];
-    Vertex v = boost::target(e, *g);
-    return(vertintmap[v]);
-}
-
-/**
-Gets out edges with integer inputs, internal use only
-SgGraphTraversal::getInEdges
-Input:
-@param[node] int, integer representation of the node to get the in edges from
-@param[g] CFG* g, CFG
-*/
-
-template<class CFG>
-std::vector<int>
-SgGraphTraversal<CFG>::
-getInEdges(int& node, CFG*& g)
-{
-    Vertex getIns = intvertmap[node];
-    std::vector<int> inedges;
- // DQ (4/11/2017): Fix Klockworks issue of uninitialized variables.
-#if 1
-    in_edge_iterator i, j;
-#else
- // This does not compile.
-    in_edge_iterator i = inedges.begin();
-    in_edge_iterator j = i;
-#endif
-    for (boost::tie(i, j) = boost::in_edges(getIns, *g); i != j; ++i)
-    {
-        inedges.push_back(edgeintmap[*i]);
-    }
-    return inedges;
-}
-
-/**
-Gets out edges with integer inputs, internal use only
-SgGraphTraversal::getOutEdges
-Input:
-@param[node] int, integer representation of the node to get the out edges from
-@param[g] CFG* g, CFG
-*/
-
-
-
-template<class CFG>
-std::vector<int>
-SgGraphTraversal<CFG>::
-getOutEdges(int &node, CFG*& g)
-{
-    Vertex getOuts = intvertmap[node];
-    std::vector<int> outedges;
- // DQ (4/11/2017): Fix Klockworks issue of uninitialized variables.
-#if 1
-    out_edge_iterator i, j;
-#else
- // This does not compile.
-    out_edge_iterator i = outedges.begin();
-    out_edge_iterator j = i;
-#endif
-    for (boost::tie(i, j) = boost::out_edges(getOuts, *g); i != j; ++i)
-    {
-        outedges.push_back(edgeintmap[*i]);
-    }
-    return outedges;
-}
-
-/**
-Condenses paths, currently deprecated...
-Input:
-@param[pth] std::vector<int> the original path
-@param[g] CFG*, the ambient graph
-Output:
-zipped path
-*/
-
-template<class CFG>
-inline
-std::vector<int>
-SgGraphTraversal<CFG>::
-zipPath2(std::vector<int>& pth, CFG*& g) {
-    std::vector<int> npth;
-    npth.push_back(pth[0]);
-    for (int i = 1; i < pth.size()-1; i++) {
-       if (find(closures.begin(), closures.end(), pth[i]) != closures.end()) {
-           npth.push_back(pth[i]);
-       }
-    }
-    npth.push_back(pth.back());
-    return npth;
-}
-
-/**
-Condenses paths to simply the first and last node and the ordered set of edges
-taken at nodes with more than 1 outedge
-Input:
-@param[pth] std::vector<int>, the original path
-@param[g] CFG*, the ambient graph
-@param[start] integer representation of the first node
-@param[end] integer representation of the last node
-*/
-
-
-template<class CFG>
-std::vector<int>
-SgGraphTraversal<CFG>::
-zipPath(std::vector<int>& pth, CFG*& g, int start, int end) {
-                        std::vector<int> subpath;
-                        std::vector<int> movepath;
-                        movepath.push_back(pth.front());
-                        movepath.push_back(pth.back());
-                        for (unsigned int qw = 0; qw < pth.size()-1; qw++) {
-                           if (find(markers.begin(), markers.end(), pth[qw]) != markers.end()) {
-                               std::vector<int> oeds = getOutEdges(pth[qw], g);
-                               for (unsigned int i = 0; i < oeds.size(); i++) {
-                                   if (getTarget(oeds[i], g) == pth[qw+1]) {
-                                       movepath.push_back(oeds[i]);
-                                   }
-                               }
-                            }
-                         }
-                         return movepath;
-             }
-
-
-
-
-
-
-/**
-unzips the paths zipped by zipPath
-Input:
-@param[pzipped] the zipped path
-@param[CFG] the ambient graph
-@param[start] the integer representation of the first node (used to check that zipPath is working correctly)
-@param[end] the integer representation of the end node
-*/
-
-
-template<class CFG>
-std::vector<int>
-SgGraphTraversal<CFG>::
-unzipPath(std::vector<int>& pzipped, CFG*& g, int start, int end) {
-     ROSE_ASSERT(pzipped[0] == start && (pzipped[1] == end || end == -1));
-     std::vector<int> zipped;
-     for (unsigned int i = 2; i < pzipped.size(); i++) {
-         zipped.push_back(pzipped[i]);
-     }
-     std::vector<int> unzipped;
-     unzipped.push_back(start);
-     std::vector<int> oeds = getOutEdges(start, g);
-     if (oeds.size() == 0) {
-         return unzipped;
-     }
-     for (unsigned int i = 0; i < zipped.size(); i++) {
-         oeds = getOutEdges(unzipped.back(), g);
-         while (oeds.size() == 1) {
-             if (getTarget(oeds[0], g) == end && unzipped.size() != 1) {
-                  unzipped.push_back(end);
-                  return unzipped;
-             }
-             unzipped.push_back(getTarget(oeds[0], g));
-             oeds = getOutEdges(unzipped.back(), g);
-         }
-         if (oeds.size() == 0) {
-             return unzipped;
-         }
-         if (oeds.size() > 1 && (unzipped.back() != end || (unzipped.size() == 1 && unzipped.back() == end))) {
-             ROSE_ASSERT(getSource(zipped[i], g) == unzipped.back());
-             unzipped.push_back(getTarget(zipped[i], g));
-         }
-         
-     }
-     std::vector<int> oeds2 = getOutEdges(unzipped.back(), g);
-     if (unzipped.back() != end && oeds2.size() != 0) { 
-         while (oeds2.size() == 1 && unzipped.back() != end) {
-             unzipped.push_back(getTarget(oeds2[0], g));
-             oeds2 = getOutEdges(unzipped.back(), g);
-         }
-     }
-     return unzipped;
-}
-
-/*
-Example Time
-
-    Example:
-             timeval tim;
-             gettimeofday(&tim, NULL);
-             double t1=tim.tv_sec+(tim.tv_usec/1000000.0);
-             do_something_long();
-             gettimeofday(&tim, NULL);
-             double t2=tim.tv_sec+(tim.tv_usec/1000000.0);
-             printf("%.6lf seconds elapsed\n", t2-t1);
-
-*/
-
-/**
-The function responsible for collecting all paths without loops, and all paths within lops that do not include other loops
-then sending those to uTraverse to assemble them into all paths with any combination of loops
-Input:
-@param[begin] integer representation of the first node
-@param[end] integer representation of the last node (or -1 if its not bounded)
-@param[g] CFG*, the ambient CFG
-@param[loop] boolean expressing whether or not we are calculating paths contained within a loop
-*/
-
-
-template<class CFG>
-std::vector<std::vector<int> >
-SgGraphTraversal<CFG>::
-bfsTraversePath(int begin, int end, CFG*& g, bool loop) {
-//perfdebug allows for examining the speed of traversal
-    #ifdef PERFDEBUG
-    //timeval tim;
-    //gettimeofday(&tim, NULL);
-    //double tim1 = tim.tv_sec+(tim.tv_usec/1000000.0);
-    #endif
-    bool recursedloop = loop;
-    std::map<int, std::vector<std::vector<int> > > PtP;
-    std::set<int> nodes;
-    std::vector<std::vector<int> > pathContainer;
-    //std::vector<std::vector<int> > oldPaths;
-    std::vector<int> completedLoops;
-    std::vector<std::vector<int> > npc;
-    std::vector<int> bgpath;
-    bgpath.push_back(begin);
-    pathContainer.push_back(bgpath);
-    std::vector<std::vector<int> > newPathContainer; 
-    std::vector<std::vector<int> > paths;
-    std::vector<int> localLoops;
-    std::map<int, std::vector<std::vector<int> > > globalLoopPaths;
-     //std::cout << "at the while" << std::endl;
-//To keep
-     while (pathContainer.size() != 0 /*|| oldPaths.size() != 0*/) {
-/*
-       unsigned int mpc = 50000;
-       if (pathContainer.size() == 0) {
-           unsigned int mxl = 0; 
-           if (oldPaths.size() > mpc) {
-               mxl = mpc/2;
-           }
-           else {
-               mxl = oldPaths.size();
-           }
-           for (unsigned int k = 0; k < mxl; k++) {
-               pathContainer.push_back(oldPaths.back());
-               oldPaths.pop_back();
-           }
-       }
-       if (pathContainer.size() > mpc) {
-           unsigned int j = 0;
-           while (j < mpc) {
-                npc.push_back(pathContainer.back());
-                pathContainer.pop_back();
-                j++;
-           }
-           oldPaths.insert(oldPaths.end(), pathContainer.begin(), pathContainer.end());   
-           pathContainer = npc;
-           npc.clear();
-       }
-*/
-
-//iterating through the currently discovered subpaths to build them up
-       for (unsigned int i = 0; i < pathContainer.size(); i++) {
-       std::vector<int> npth = pathContainer[i];
-        std::vector<int> oeds = getOutEdges(npth.back(), g);
-        std::vector<int> ieds = getInEdges(npth.back(), g);
- 
-        npth = pathContainer[i];
-        oeds = getOutEdges(npth.back(), g);
-
-        if ((!recursedloop && ((bound && npth.back() == end && npth.size() != 1) || (!bound && oeds.size() == 0))) || (recursedloop && npth.back() == end && npth.size() != 1)) {
-            std::vector<int> newpth;
-            newpth = (pathContainer[i]);
-             std::vector<int> movepath = newpth;//zipPath(newpth, g);
-             if (recursedloop && newpth.back() == end && newpth.size() != 1) {
-             paths.push_back(movepath);
-             }
-             else if (!recursedloop) {
-             if (bound && newpth.size() != 1 && newpth.back() == end) {
-             paths.push_back(movepath);
-             }
-             else if (!bound) {
-             paths.push_back(movepath);
-             }
-             }
-             
-        }
-        else {
-std::vector<int> oeds = getOutEdges(pathContainer[i].back(), g);
-
-        for (unsigned int j = 0; j < oeds.size(); j++) {
-
-
-int tg = getTarget(oeds[j], g);
-            
-
-            std::vector<int> newpath = (pathContainer[i]);
-           //we split up paths into pieces so that they don't take up a lot of memory, basically this is when we run into a path
-           //more than once, so we attach all paths that go to that path to that particular node via PtP
-            if (nodes.find(tg) != nodes.end() && find(newpath.begin(), newpath.end(), tg) == newpath.end() && tg != end) {
-                if (PtP.find(tg) == PtP.end()) {
-                    std::vector<int> nv;
-                    nv.push_back(tg);
-                    newPathContainer.push_back(nv);
-                    PtP[tg].push_back(/*zipPath(*(*/newpath);//, g, newpath.front(), newpath.back()));
-                }
-                else {
-                    PtP[tg].push_back(/*zipPath(*/newpath);//, g, newpath.front(), newpath.back()));
-                }
-            }
-            else if (find(newpath.begin(), newpath.end(), getTarget(oeds[j], g)) == newpath.end() || getTarget(oeds[j], g) == end) {
-                newpath.push_back(tg);
-                std::vector<int> ieds = getInEdges(tg, g);
-                if (ieds.size() > 1) {//find(closures.begin(), closures.end(), tg) != closures.end()) {
-                nodes.insert(tg);
-                }
-                newPathContainer.push_back(newpath);
-            }
-            else if (tg == end  && recursedloop) {
-                newpath.push_back(tg);
-                newPathContainer.push_back(newpath);
-            }
-            else {//if (find(newpath.begin(), newpath.end(), tg) != newpath.end() && tg != end) { 
-                std::vector<int> ieds = getInEdges(tg, g);
-                if (ieds.size() > 1/*find(closures.begin(), closures.end(), tg) != closures.end()*/ && find(completedLoops.begin(), completedLoops.end(), tg) == completedLoops.end() /*&& find(localLoops.begin(), localLoops.end(), tg) == localLoops.end()*/ && find(recurses.begin(), recurses.end(), tg) == recurses.end()) {
-                   localLoops.push_back(tg);
-                   nodes.insert(tg);
-                }
-               // else if (find(recurses.begin(), recurses.end(), tg) != recurses.end()) {
-               // }
-           }
-           //else {
-           //    std::cout << "problem" << std::endl;
-           //    ROSE_ASSERT(false);
-          // }
-        }
-        }
-        }
-        pathContainer = newPathContainer;
-        newPathContainer.clear();
-        }
-       // std::cout << "done while" << std::endl;
-        pathContainer.clear();
-    std::vector<std::vector<int> > finnpts;
-    std::vector<std::vector<int> > npts;
-    while (true) {
-        if (paths.size() > 1000000) {
-           std::cout << "too many paths, consider a subgraph" << std::endl;
-           ROSE_ABORT();
-       }
-       //#pragma omp parallel for schedule(guided)
-       for (unsigned int qq = 0; qq < paths.size(); qq++) {
-            std::vector<int> pq = paths[qq];
-            std::vector<int> qp;
-            int ppf = paths[qq].front();
-            if (PtP.find(ppf) != PtP.end()) {
-                for (unsigned int kk = 0; kk < PtP[ppf].size(); kk++) {
-                    std::vector<int> newpath = /*unzipPath(*/PtP[ppf][kk];//, g, PtP[ppf][kk][0], PtP[ppf][kk][1]);
-                    bool good = true;
-                    if (newpath.back() == newpath.front() && newpath.front() != begin && newpath.size() > 1) {
-                        good = false;
-                    }
-                    else {
-
-                 //   if (find(pq.begin(), pq.end(), newpath.front()) != pq.end() && newpath.front() != begin) {
-                 //         good = false;
-                 //   }
-
-
-                   // else {
-                    for (unsigned int kk1 = 0; kk1 < newpath.size(); kk1++) {
-                       
-                      /*
-                       if (newpath.front() == newpath.back()) {
-                           good = false;
-                           break;
-                       }
-                       else */if (find(pq.begin(), pq.end(), newpath[kk1]) != pq.end() && newpath[kk1] != begin) {
-                           good = false;
-                           break;
-                          
-                       }
-                       }
-                    //}
-                    }
-                    if (good) {
-                       newpath.insert(newpath.end(), pq.begin(), pq.end());
-                       #pragma omp critical
-                       {
-                       npts.push_back(newpath);
-                       }
-                    }
-                }
-            }
-            else {
-                std::vector<int> ppq = pq;// zipPath(pq, g, pq.front(), pq.back());
-                #pragma omp critical
-                {
-                finnpts.push_back(ppq);
-                }
-            }
-        }
-        if (npts.size() == 0) {
-            break;
-        }
-        else {
-            paths = npts;
-            npts.clear();
-        }
-    }
-    paths = finnpts;    
-    finnpts.clear(); 
-    for (unsigned int k = 0; k < localLoops.size(); k++) {
-        int lk = localLoops[k];
-        std::vector<std::vector<int> > loopp;
-        if (loopStore.find(localLoops[k]) != loopStore.end()) {
-            loopp.insert(loopp.end(), loopStore[localLoops[k]].begin(), loopStore[localLoops[k]].end());
-        }
-        else {
-        std::map<int, std::vector<std::vector<int> > > localLoopPaths;
-        completedLoops.push_back(lk);
-        recurses.push_back(lk);
-        loopp = bfsTraversePath(lk, lk, g, true);
-        recurses.pop_back();
-        }
-        for (unsigned int ik = 0; ik < loopp.size(); ik++) {
-                
-                if (find(globalLoopPaths[lk].begin(), globalLoopPaths[lk].end(), loopp[ik]) == globalLoopPaths[lk].end()) {
-                globalLoopPaths[localLoops[k]].push_back(loopp[ik]);
-                }
-        }
-    
-
- 
-    }
-    borrowed = true;
-    std::vector<std::vector<int> > lps2;
-    //unsigned int maxpaths = 1000;
-    //unsigned int pathdivisor = 1;//paths.size()/maxpaths;///paths.size();
-
-    //if (pathdivisor < 1) {
-        //pathdivisor = 1;
-        //maxpaths = paths.size();
-   // }
-/*
-    for (unsigned int j = 0; j < pathdivisor+1; j++) {
-        std::vector<std::vector<int> > npaths;
-        std::vector<int> dummyvec;
-        unsigned int mxpths;
-        if (j < pathdivisor) {
-            mxpths = maxpaths;
-        }
-        else {
-            mxpths = paths.size() % pathdivisor;
-        }
-        for (unsigned int k = 0; k < mxpths; k++) {
-              npaths.push_back(paths.back());//unzipPath(paths.back(), g, begin, end));
-              paths.pop_back();
-        }
-*/
-        pathStore = paths;
-        paths.clear();
-    if (!recursedloop) {
-    uTraversePath(begin, end, g, false, globalLoopPaths);
-    }
-    else {
-    recursed++;
-    
-    std::set<std::vector<int> > lps = uTraversePath(begin, end, g, true, globalLoopPaths);
-    recursed--;
-    for (std::set<std::vector<int> >::iterator ij = lps.begin(); ij != lps.end(); ij++) {
-    std::vector<int> ijk = (*ij);
-    
-    lps2.push_back(*ij);
-    }
-    } 
-    //}
-    #ifdef PERFDEBUG
- //   timeval tim; 
-    //std::cout << "begin: " << begin << " end: " << end << std::endl;
-    //gettimeofday(&tim, NULL);
-    //double tim2 = tim.tv_sec+(tim.tv_usec/1000000);
-    //double timeRet = tim2 - tim1;
-    //std::cout << "bfs time elapsed: " << timeRet << std::endl;
-    #endif
-    return lps2;
-    
-}
-             
-        
-/**
-This function calculates all the permutations of loops on paths
-it also throws away duplicate paths
-Input:
-@param[begin] integer representation of first node
-@param[end] integer representation of the final node
-@param[g] ambient CFG
-@param[globalLoopPaths] connects an integer representation of a node to all possible loops starting at that node
-*/
-
-
-template<class CFG>
-std::set<std::vector<int> >
-SgGraphTraversal<CFG>::
-uTraversePath(int begin, int end, CFG*& g, bool loop, std::map<int, std::vector<std::vector<int> > >& globalLoopPaths) {
-    //std::cout << "uTraverse" << std::endl;
-    //int doubledpaths = 0;
-    int newmil = 1;
-    //#ifdef LP
-    //if (loop && loopStore.find(begin) != loopStore.end()) {
-    //    return loopStore[begin];
-    //}
-    //#endif
-    #ifdef PERFDEBUG
-    //timeval tim;
-    //gettimeofday(&tim, NULL);
-    //double t1 = tim.tv_sec+(tim.tv_usec/1000000);
-    #endif
-    std::set<std::vector<int> > newpaths;
-    std::set<std::vector<int> > npaths;
-    pathnum = 0;
-    std::vector<int> path;
-    std::vector<std::vector<int> > paths;
-    int truepaths = 0;
-    std::vector<std::vector<int> > checkpaths;
-    std::vector<std::vector<int> > npathchecker;
-    std::map<int, int> currents;
-    //int nnumpaths = 0;
-    std::set<std::vector<int> > loopPaths;
-    //bool threadsafe = true;
-    bool done = false;
-    std::set<std::vector<int> > fts;
-    //double ttfors = 0;
-    //double tperms = 0;
-    while (true) {
-        //std::cout << "paths.size() " << paths.size() << std::endl;
-        if (paths.size() > 1000000) {
-            std::cout << "nearly 1 million paths with no loops, stopping" << std::endl;
-            return loopPaths;
-            std::cout << "ended early" << std::endl;
-        }
-        if (done || borrowed) {
-     
-                if (borrowed) {
-                    paths = pathStore;
-                    pathStore.clear(); 
-                }   
-                //std::cout << "paths.size(): " << paths.size() << std::endl; 
-                if (paths.size() != 0) {
-                }
-                else {
-                return loopPaths;
-                }
-         
-               // #pragma omp parallel
-               // {
-                #pragma omp parallel for schedule(guided) 
-                for (unsigned int qqq = 0; qqq < paths.size(); qqq++) {
-  //             std::cout << "pathcheck" << std::endl;
-                //int pathevals = 0;
-                //std::vector<int> zpt = zipPath2(paths[qqq], g); 
-                //std::set<std::vector<int> > boxpaths;
-                std::set<std::vector<int> > movepaths;
-                std::vector<int> path;// = paths[qqq];
-                path = paths[qqq];//unzipPath(paths[qqq], g, begin, end);
-                truepaths++;
-                   int permnums = 1;
-                   std::vector<int> perms;
-                    std::vector<unsigned int> qs;
-                    std::map<int, std::vector<std::vector<int> > > localLoops;
-                    std::vector<int> takenLoops;
-                    takenLoops.push_back(path[0]);
-                    bool taken = false;
-                    //timeval timfor;
-                    int lost = 0;
-                    //gettimeofday(&timfor, NULL);
-                    //double t1for = timfor.tv_sec + (timfor.tv_usec/1000000); 
-                    for (unsigned int q = 1; q < path.size()-1; q++) {
-                    //if (find(closures.begin(), closures.end(), path[q]) != closures.end()) {
-                    if (globalLoopPaths.find(path[q]) != globalLoopPaths.end() /*&& find(lloops.begin(), lloops.end(), path[q]) != lloops.end()*/ && globalLoopPaths[path[q]].size() != 0 /*&& path[q] != begin && path[q] != end*/) {
-                        for (unsigned int qp1 = 0; qp1 < globalLoopPaths[path[q]].size(); qp1++) {
-                            
-                            std::vector<int> gp = globalLoopPaths[path[q]][qp1]; //unzipPath(globalLoopPaths[path[q]][qp1],g,path[q],path[q]);
-                           // std::vector<int> zgp = zipPath2(globalLoopPaths[zpt[q]][qp1], g);
-                            for (unsigned int qp2 = 0; qp2 < takenLoops.size(); qp2++) {
-                                if (find(gp.begin(),gp.end(), takenLoops[qp2]) != gp.end()) {
-                                    taken = true;
-                                }
-                            }
-
-                            if (!taken) {
-                                localLoops[path[q]].push_back(gp);
-                            }
-                            else {
-                               lost++;
-                               taken = false;
-                            }
-                        }
-                        if (localLoops[path[q]].size() != 0) {
-                        takenLoops.push_back(path[q]);
-                        permnums *= (localLoops[path[q]].size()+1);
-                        perms.push_back(permnums);
-                        qs.push_back(path[q]);
-                        }
-                    }
-                    }
-                    
-                    //}
-                    //if (loop) {
-                    //std::cout << "lostloop: " << lost << std::endl;
-                    //}
-                    //else {
-                    //std::cout << "lostpath: " << lost << std::endl;
-                    //}
-                    //std::cout << "endpathcheck" << std::endl;
-                    //std::cout << "rest" << std::endl;
-                    //std::cout << "permnums: " << permnums << std::endl;
-                    //gettimeofday(&timfor, NULL);
-                    //double t2for = timfor.tv_sec + (timfor.tv_usec/1000000);
-                    //double ttfor = t2for - t1for;
-                    //#pragma omp atomic
-                    //ttfors += ttfor;
-                    
-                    //std::set<std::vector<int> > movepaths2;
-                    std::set<std::vector<int> > movepathscheck;
-                    //timeval timperms;
-                    //gettimeofday(&timperms, NULL);
-                   // double t1perm = timperms.tv_sec + (timperms.tv_usec/1000000);
-                    std::vector<int> nvec;
-                    std::vector<std::vector<int> > boxpaths(permnums, nvec);
-                    //#pragma omp parallel for schedule(guided)
-                    for (int i = 1; i <= permnums; i++) {
-                        //bool goodthread = false;
-                        std::vector<int> loopsTaken;
-                        //bool stop = false;
-                        unsigned int j = 0;
-                        std::vector<int> npath;
-                        while (true) {
-                            if (j == perms.size() || perms[j] > i) {
-                                break;
-                            }
-                            else {
-                                j++;
-                            }
-                        }
-                        int pn = i;
-                        std::vector<int> pL;
-                        for (unsigned int j1 = 0; j1 <= j; j1++) {
-                            pL.push_back(-1);
-                        }
-                           for (unsigned int k = j; k > 0; k--) {
-                               int l = 1;
-                               while (perms[k-1]*l < pn) {
-                                   l++;
-                              }
-                               pL[k] = l-2;
-                               pn -= (perms[k-1]*(l-1));
-                           }
-                        pL[0] = pn-2;
-
-                        unsigned int q2 = 0;
-                        for (unsigned int q1 = 0; q1 < path.size(); q1++) {
-                            if (q2 < qs.size()) {
-                                if (qs.size() != 0 && (unsigned)path[q1] == qs[q2] && (size_t)q2 != pL.size()) {
-                                    if (pL[q2] == -1) {
-                                        npath.push_back(path[q1]);
-                                    }
-                                    else {
-                                        //   if (!stop) {
-                                        npath.insert(npath.end(), localLoops[path[q1]][pL[q2]].begin(),
-                                                     localLoops[path[q1]][pL[q2]].end());
-                                        //  }
-                                    }
-                                    q2++;
-                                }
-                                else {
-                                    npath.push_back(path[q1]);
-                                }
-                            }
-                            else {
-                                npath.push_back(path[q1]);
-                            }
-                        }
-                        #ifdef FULLDEBUG
-                        std::cout << "path: " << std::endl;
-                        for (int qe = 0; qe < npath.size(); qe++) {
-                            std::cout << ", " << npath[qe];
-                        }
-                        std::cout << std::endl;
-                        std::cout << "permnum: " << i << std::endl; 
-                        #endif
-                      //  bool addit = false;
-                        //if (!stop) {
-                      //  if (loop && npath.front() == npath.back()) {
-                      //      addit = true;
-                      //  }
-                      //  else if (!loop && bound && npath.front() == begin && npath.back() == end && npath.size() != 1) {
-                      //      addit = true;
-                      //  }
-                      //  else if (!loop && !bound) {
-                      //      addit = true;
-                      //  }
-                      // if (!addit) {
-                      //     std::cout << "bad path" << std::endl;
-                      // }
-                       //bool extra = false;
-                       //if (addit && !loop) {
-                            //if (movepathscheck.find(npath) == movepathscheck.end()) {
-                            //int mpc = movepathscheck.size();
-                            //std::set<std::vector<int> > movepathspre = movepathscheck;
-                    //        movepaths2.insert(npath);
-                            //movepathscheck.insert(npath);
-                            //ROSE_ASSERT(movepathscheck.size() == mpc || movepathspre.find(npath) == movepathspre.end());
-                            //if (movepathscheck.size() == mpc) {
-                            //    extra = true;
-                           // }
-                       
-                            //}
-                            //else {
-                            //#pragma omp atomic
-                           // doubledpaths++;
-                           // }
-                       //}
-                            
-                            //if (!workingthread || threadsafe) {
-                            //if ((newpaths.size() > 1 || i == permnums || threadsafe)) {
-                           // }
-                          // }
-                               
-                       // }
-                        //if (!extra)
-                       // {
-                        //if (movepaths2.size() > 0) //|| i == permnums || threadsafe)
-                       // #pragma omp critical
-                      // {
-                       boxpaths[i-1] = npath;
-                      // } 
-                      // }
-                       //std::cout << "endrest" << std::endl;
-                       }
-                        
-                       evaledpaths += boxpaths.size();
-                       if (evaledpaths > newmil*100000ull) {
-                           //std::cout << "evaledpaths: " << evaledpaths << std::endl;
-                           newmil++;
-                       }
-                       // #pragma omp critical
-                      // {
-                       if (!loop) {
-                       for (std::vector<std::vector<int> >::iterator box = boxpaths.begin(); box != boxpaths.end(); box++) {
-                       std::vector<Vertex> verts;
-                       getVertexPath((*box), g, verts);
-                       #pragma omp critical
-                       { 
-                       analyzePath(verts);
-                       }
-                       }
-                       }
-                       else {
-                       #pragma omp critical
-                       {
-                       loopPaths.insert(boxpaths.begin(), boxpaths.end());;
-                       }
-                       }
-                       }
-                       }
-                       //} 
-                       
-/* 
-                      #pragma omp atomic
-                      evaledpaths++; 
-                      //pathevals++;
-                      if (evaledpaths % 10000 == 0 && evaledpaths != 0) {
-                          std::cout << "evaled paths: " << evaledpaths << std::endl;
-                      }
-                      if (!loop) {
-                          std::vector<Vertex> verts;
-                          getVertexPath(npath, g, verts);
-                              #pragma omp critical
-                              {
-                              #ifdef FULLDEBUG
-                              for (unsigned int aa = 0; aa < npath.size(); aa++) {
-                                  if (ptsNum.find(npath[aa]) != ptsNum.end()) {
-                                  ptsNum[npath[aa]] += 1;
-                                  }
-                                  else {
-                                  ptsNum[npath[aa]] = 1;
-                                  }
-                              }
-                              #endif
-                              analyzePath(verts);
-                              }
-                      }
-                      else if (loop)
-                      { 
-                          //std::vector<int> zpth = zipPath(npath, g, npath.front(), npath.back());
-                          #pragma omp critical
-                          {
-                          loopPaths.insert(npath);//zipPath(npath, g, npath.front(), npath.back()));
-                          }
-                      }
-                      else {
-                      }
-                      
-                   }
-*/
-
-                  // movepaths2.clear();
-                  
-                 // std::cout << "permnums: " << permnums << std::endl;
-                //  std::cout << "evaledpaths final: " << pathevals << std::endl;  
-                  //gettimeofday(&timperms, NULL);
-                  //double t2perm = timperms.tv_sec+(timperms.tv_usec/1000000);
-                  //#pragma omp atomic
-                  //tperms += t2perm - t1perm;
-                 // }
-                  //}
-                  //}
-                  //}
-                  
-                  
-                  
-                    
-
-                    
-                    #ifdef PERFDEBUG
-                    //gettimeofday(&tim, NULL);
-                   // double t2 = tim.tv_sec+(tim.tv_usec/1000000.0);
-                   // double tperm = t2 - t1perm
-                    //double tX = t2 - t1;
-                    //std::cout << "begin: " << begin << " end: " << end << std::endl;
-                   // std::cout << "uTraverse time: " << tX << std::endl;
-                   // std::cout << "tperms: " << tperms << std::endl;
-                   // std::cout << "ttfors: " << ttfors << std::endl;
-                   // std::cout << "doubledpaths: " << doubledpaths << std::endl;
-                    #endif
-                    #ifdef LP
-                    if (loop) {
-                   #ifdef PERFDEBUG
-                   //  std::cout << "loopPaths: " << loopPaths.size() << std::endl;
-                   #endif
-                    loopStore[begin] = loopPaths;
-                    }
-                    #endif
-                    return loopPaths;
-                    
-                    }
-                    }
-                    
-         
-         
-                    
-            
-
-
-
-/**
-This is the function that is used by the user directly to start the algorithm. It is immediately available to the user
-
-SgGraphTraversal::constructPathAnalyzer
-Input:
-@param[begin] Vertex, starting node
-@param[end] Vertex, endnode
-@param[g] CFG* g, CFG calculated previously
-*/
-
-
-template<class CFG>
-void
-SgGraphTraversal<CFG>::
-constructPathAnalyzer(CFG* g, bool unbounded, Vertex begin, Vertex end, bool ns) {
-    abnormals = 0;
-    normals = 0;
-    if (ns) {
-        needssafety = true;
-    }
-    else {
-        needssafety = false;
-    }
-    checkedfound = 0;
-    recursed = 0;
-    nextsubpath = 0;
-    borrowed = true;
-    stoppedpaths = 0;
-    evaledpaths = 0;
-    badpaths = 0;
-    sourcenum = 0;
-    prepareGraph(g);
-    workingthread = false;
-    workingthreadnum = -1;
-    //std::cout << "markers: " << markers.size() << std::endl;
-    //std::cout << "closures: " << closures.size() << std::endl;
-    //std::cout << "sources: " << sources.size() << std::endl;
-    //std::cout << "sinks" << sinks.size() << std::endl;
-//    printHotness(g);
-    bool subgraph = false;
-    if (!subgraph) {
-            if (!unbounded) {
-                bound = true;
-                recursiveLoops.clear();
-                recurses.clear();
-                std::vector<std::vector<int> > spaths = bfsTraversePath(vertintmap[begin], vertintmap[end], g);
-      //          std::cout << "spaths: " << spaths.size() << std::endl;
-            }
-            else {
-                std::set<int> usedsources;
-                bound = false;
-                 std::vector<int> localLps;
-                for (unsigned int j = 0; j < sources.size(); j++) {
-                    sourcenum = sources[j];
-                    recursiveLoops.clear();
-                    recurses.clear();
-                    std::vector<std::vector<int> > spaths = bfsTraversePath(sources[j], -1, g);
-               
-                    
-                }
-           }
-    }
-    //std::cout << "checkedfound: " << checkedfound << std::endl;
-    printHotness(g);
-}
-
-/** DEPRECATED 
-This is a function to construct subgraphs for parallelization
-SgGraphTraversal::computeSubGraphs
-Input:
-@param[begin] const int, starting point
-@param[end] const int ending point
-@param[g] const CFG*, control flow graph to compute
-@param[depthDifferential] int, used to specify how large the subgraph should be
- */
-
-template<class CFG>
-void
-SgGraphTraversal<CFG>::
-computeSubGraphs(const int& begin, const int &end, CFG*& g, int depthDifferential) {
-        int minDepth = 0;
-        int maxDepth = minDepth + depthDifferential;
-        int currSubGraph = 0;
-        CFG* subGraph;
-        std::set<int> foundNodes;
-        while (true) {
-            Vertex begin = boost::add_vertex(*subGraphVector[currSubGraph]);
-            GraphSubGraphMap[currSubGraph][intvertmap[orderOfNodes[minDepth]]] = intvertmap[begin];
-            SubGraphGraphMap[currSubGraph][intvertmap[begin]] = intvertmap[orderOfNodes[minDepth]];
-        for (int i = minDepth; i <= maxDepth; i++) {
-            Vertex v = GraphSubGraphMap[currSubGraph][intvertmap[orderOfNodes[i]]];
-            std::vector<int> outEdges = getOutEdges(orderOfNodes[i], g);
-            for (unsigned int j = 0; j < outEdges.size(); j++) {
-                Vertex u;
-                if (foundNodes.find(getTarget(outEdges[j], g)) == foundNodes.end()) {
-                        u = GraphSubGraphMap[currSubGraph][intvertmap[getTarget(outEdges[j], g)]];
-                }
-                else {
-                    u = boost::add_vertex(*subGraphVector[currSubGraph]);
-                    foundNodes.insert(getTarget(outEdges[j], g));
-                    SubGraphGraphMap[currSubGraph][u] = intvertmap[getTarget(outEdges[j], g)];
-                    GraphSubGraphMap[currSubGraph][intvertmap[getTarget(outEdges[j], g)]] = u;
-
-                }
-                Edge edge;
-                bool ok;
-                boost::tie(edge, ok) = boost::add_edge(v,u,*subGraphVector[currSubGraph]);
-            }
-        }
-        minDepth = maxDepth;
-        if ((unsigned int) minDepth == orderOfNodes.size()-1) {
-                break;
-        }
-        maxDepth += depthDifferential;
-        if ((unsigned int) maxDepth > orderOfNodes.size()-1)
-        {
-                maxDepth = orderOfNodes.size()-1;
-        }
-        CFG* newSubGraph;
-        subGraphVector.push_back(newSubGraph);
-        currSubGraph++;
-        }
-        return;
-}
-
-       
-/*
-These should NOT be used by the user. They are simply for writing interesting information on the DOT graphs of the CFG
-*/
-
-
- 
-        template<class CFG>
-        void
-        SgGraphTraversal<CFG>::
-        printCFGNodeGeneric(int &cf, std::string prop, std::ofstream& o) {
-            std::string nodeColor = "black";
-            o << cf << " [label=\"" << " num:" << cf << " prop: " << prop <<  "\", color=\"" << nodeColor << "\", style=\"" << "solid" << "\"];\n";
-        }
-
-        template<class CFG>
-        void
-        SgGraphTraversal<CFG>::
-        printCFGNode(int& cf, std::ofstream& o)
-        {
-            #ifdef FULLDEBUG
-            int pts = ptsNum[cf];
-            std::string nodeColor = "black";
-            o << cf << " [label=\"" << " pts: " << pts <<  "\", color=\"" << nodeColor << "\", style=\"" << "solid" << "\"];\n";
-            #endif
-            #ifndef FULLDEBUG
-            std::string nodeColor = "black";
-            o << cf << " [label=\"" << " num:" << cf << "\", color=\"" << nodeColor << "\", style=\"" << "solid" << "\"];\n";
-            #endif
-
-        }
-
-        template<class CFG>
-        void
-        SgGraphTraversal<CFG>::
-        printCFGEdge(int& cf, CFG*& cfg, std::ofstream& o)
-        {
-            int src = getSource(cf, cfg);
-            int tar = getTarget(cf, cfg);
-            o << src << " -> " << tar << " [label=\"" << src << " " << tar << "\", style=\"" << "solid" << "\"];\n";
-        }
-
-        template<class CFG>
-        void
-        SgGraphTraversal<CFG>::
-        printHotness(CFG*& g)
-        {
-            const CFG* gc = g;
-            int currhot = 0;
-            std::ofstream mf;
-            std::stringstream filenam;
-            filenam << "hotness" << currhot << ".dot";
-            currhot++;
-            std::string fn = filenam.str();
-            mf.open(fn.c_str());
-
-            mf << "digraph defaultName { \n";
-         // DQ (4/11/2017): Fix Klockworks issue of uninitialized variables.
-#if 1
-            vertex_iterator v, vend;
-            edge_iterator e, eend;
-#else
-         // This does not compile.
-            vertex_iterator v    = vertices(*gc).begin();
-            vertex_iterator vend = v;
-            edge_iterator e    = edges(*gc).begin();
-            edge_iterator eend = e;
-#endif
-            for (boost::tie(v, vend) = vertices(*gc); v != vend; ++v)
-            {
-                printCFGNode(vertintmap[*v], mf);
-            }
-            for (tie(e, eend) = edges(*gc); e != eend; ++e)
-            {
-                printCFGEdge(edgeintmap[*e], g, mf);
-            }
-            mf.close();
-        }
-      template<class CFG>
-        void
-        SgGraphTraversal<CFG>::
-        printPathDot(CFG*& g)
-        {
-            const CFG* gc = g;
-            std::ofstream mf;
-            std::stringstream filenam;
-            filenam << "pathnums.dot";
-            std::string fn = filenam.str();
-            mf.open(fn.c_str());
-
-            mf << "digraph defaultName { \n";
-            vertex_iterator v, vend;
-            edge_iterator e, eend;
-            for (tie(v, vend) = vertices(*gc); v != vend; ++v)
-            {
-                if (nodeStrings.find(vertintmap[*v]) != nodeStrings.end()) {
-                    int nn = vertintmap[*v];
-                    printCFGNodeGeneric(vertintmap[*v], nodeStrings[nn], mf);
-                }
-                else {
-                    printCFGNodeGeneric(vertintmap[*v], "noprop", mf);
-                }
-            }
-           for (tie(e, eend) = edges(*gc); e != eend; ++e)
-            {
-                printCFGEdge(edgeintmap[*e], g, mf);
-            }
-
-            mf.close();
-        }
-
-
-
-/**
-This is the function that preps the graph for traversal
-
-SgGraphTraversal::prepareGraph
-Input:
-@param[g] CFG*& g, CFG calculated previously
-*/
-
-
-template<class CFG>
-void
-SgGraphTraversal<CFG>::
-prepareGraph(CFG*& g) {
-    nextNode = 1;
-    nextEdge = 1;
-    findClosuresAndMarkersAndEnumerate(g);
-}
-
-
-/**
-DEPRECATED 
-This is the function that preps the graph for traversal, currently this one isn't used but for many traversals on one visitor
-may necessitate
- 
-SgGraphTraversal::firstPrepGraph 
-Input: 
-@param[g] CFG*& g, CFG calculated previously 
-*/ 
-
-
-template<class CFG>
-void
-SgGraphTraversal<CFG>::
-firstPrepGraph(CFG*& g) {
-    nextNode = 1;
-    nextEdge = 1;
-    findClosuresAndMarkersAndEnumerate(g);
-}
-
-/**
-This calculates nodes with more than one in edge or more than one out edge
-
-SgGraphTraversal::findClosuresAndMarkers
-Input:
-@param[g] CFG*& g, CFG calculated previously
-*/
-
-
-
-
-template<class CFG>
-void
-SgGraphTraversal<CFG>::
-findClosuresAndMarkersAndEnumerate(CFG*& g)
-{
- // DQ (4/11/2017): Fix Klockworks issue of uninitialized variables.
-#if 1
-    edge_iterator e, eend;
-#else
-    edge_iterator e    = edges(*g).begin();
-    edge_iterator eend = e;
-#endif
-    for (tie(e, eend) = edges(*g); e != eend; ++e) {
-        intedgemap[nextEdge] = *e;
-        edgeintmap[*e] = nextEdge;
-        nextEdge++;
-    }
- // DQ (4/11/2017): Fix Klockworks issue of uninitialized variables.
-#if 1
-    vertex_iterator v1, vend1;
-#else
-    vertex_iterator v1    = vertices(*g).begin();
-    vertex_iterator vend1 = v1;
-#endif
-    for (boost::tie(v1, vend1) = vertices(*g); v1 != vend1; ++v1)
-    {
-        vertintmap[*v1] = nextNode;
-        intvertmap[nextNode] = *v1;
-        nextNode++;
-    }
- // DQ (4/11/2017): Fix Klockworks issue of uninitialized variables.
-#if 1
-    vertex_iterator v, vend;
-#else
-    vertex_iterator v    = vertices(*g).begin();
-    vertex_iterator vend = v;
-#endif
-    for (boost::tie(v, vend) = vertices(*g); v != vend; ++v) {
-        std::vector<int> outs = getOutEdges(vertintmap[*v], g);
-        std::vector<int> ins = getInEdges(vertintmap[*v], g);
-        if (outs.size() > 1)
-        {
-            markers.push_back(vertintmap[*v]);
-            
-            markerIndex[vertintmap[*v]] = markers.size()-1;
-            for (unsigned int i = 0; i < outs.size(); i++) {
-                pathsAtMarkers[vertintmap[*v]].push_back(getTarget(outs[i], g));
-            }
-        }
-        if (ins.size() > 1)
-        {
-            closures.push_back(vertintmap[*v]);
-        }
-        if (outs.size() == 0) {
-            sinks.push_back(vertintmap[*v]);
-        }
-        if (ins.size() == 0) {
-            sources.push_back(vertintmap[*v]);
-        }
-    }
-    return;
-}
-
-
-
-/** DEPRECATED 
-Currently unused but will be necessary for parallelization in progress
-SgGraphTraversal::computeOrder
-@param[g] CFG* cfg in question
-@parm[begin] const int, integer representation of source node
-*/
-template<class CFG>
-void
-SgGraphTraversal<CFG>::
-computeOrder(CFG*& g, const int& begin) {
-        std::vector<int> currentNodes;
-        std::vector<int> newCurrentNodes;
-        currentNodes.push_back(begin);
-        std::map<int, int> reverseCurrents;
-        orderOfNodes.push_back(begin);
-        std::set<int> heldBackNodes;
-        while (currentNodes.size() != 0) {
-                for (unsigned int j = 0; j < currentNodes.size(); j++) {
-                       
-                        std::vector<int> inEdges = getInEdges(currentNodes[j], g);
-                        if (inEdges.size() > 1) {
-                        if (reverseCurrents.find(currentNodes[j]) == reverseCurrents.end()) {
-                            reverseCurrents[currentNodes[j]] = 0;
-                        }
-                        if ((unsigned int) reverseCurrents[currentNodes[j]] == inEdges.size() - 1) {
-                                heldBackNodes.erase(currentNodes[j]);
-                                reverseCurrents[currentNodes[j]]++;
-                                std::vector<int> outEdges = getOutEdges(currentNodes[j], g);
-                                for (unsigned int k = 0; k < outEdges.size(); k++) {
-                                        newCurrentNodes.push_back(getTarget(outEdges[k], g));
-                                        orderOfNodes.push_back(getTarget(outEdges[k], g));
-                                }
-                        }
-                        else if (reverseCurrents[currentNodes[j]] < reverseCurrents.size()) {
-                                reverseCurrents[currentNodes[j]]++;
-                                if (heldBackNodes.find(currentNodes[j]) == heldBackNodes.end()) {
-                                    heldBackNodes.insert(currentNodes[j]);
-                                }
-                        }
-                        }
-                        else {
-                                std::vector<int> outEdges = getOutEdges(currentNodes[j], g);
-                                for (unsigned int k = 0; k < outEdges.size(); k++) {
-                                        newCurrentNodes.push_back(getTarget(outEdges[k], g));
-                                        orderOfNodes.push_back(getTarget(outEdges[k], g));
-
-                                }
-                        }
-                }
-                if (newCurrentNodes.size() == 0 && heldBackNodes.size() != 0) {
-                    for (std::set<int>::iterator q = heldBackNodes.begin(); q != heldBackNodes.end(); q++) {
-                        int qint = *q;
-                        std::vector<int> heldBackOutEdges = getOutEdges(qint, g);
-                        for (unsigned int p = 0; p < heldBackOutEdges.size(); p++) {
-                            newCurrentNodes.push_back(getTarget(heldBackOutEdges[p], g));
-                        }
-                   }
-                   heldBackNodes.clear();
-                }
-                currentNodes = newCurrentNodes;
-                newCurrentNodes.clear();
-        }
-        return;
-}
-
-/**
-Converts the path calculated by this algorithm to Vertices so users can
-access data
-SgGraphTraversal::getVertexPath
-@param[path] integer representation of path
-@param[g] CFG*, cfg in question
-@param[vertexPath] for some reason this can't be a return value so it is changed via pass by reference
-*/
-
-template<class CFG>
-void
-SgGraphTraversal<CFG>::
-getVertexPath(std::vector<int> path, CFG*& g, std::vector<Vertex>& vertexPath) {
-        for (unsigned int i = 0; i < path.size(); i++) {
-                            vertexPath.push_back(intvertmap[path[i]]);
-        }
-
-       
-        
-}
-
-/**
-DEPRECATED
-Currently unused, may eventually be modified for optimal storage purposes
-SgGraphTraversal::storeCompact
-@param[compactPath] path to be compactified
-*/
-template<class CFG>
-void
-SgGraphTraversal<CFG>::
-storeCompact(std::vector<int> compactPath) {
-return;
-}
-
-
-
-
-                  
diff --git a/src/midend/astProcessing/graphProcessingSgIncGraph.h b/src/midend/astProcessing/graphProcessingSgIncGraph.h
deleted file mode 100644
index 382dc09079d..00000000000
--- a/src/midend/astProcessing/graphProcessingSgIncGraph.h
+++ /dev/null
@@ -1,1865 +0,0 @@
-/*
-
-FINISH TEMPFLATPATH CODE
-
-*/
-
-
-
-
-// Original Author (SgGraphTraversal mechanisms): Michael Hoffman
-//$id$
-#include<omp.h>
-#include <boost/regex.hpp> 
-#include <iostream>
-#include <fstream>
-#include <string>
-
-/** 
-*@file graphProcessing.h
-
-*Brief Overview of Algorithm:
-
-***********************
-*Current Implementation
-***********************
-
-*The idea behind the algorithm here is to decompose the given Control Flow Graph into a Tree structure (still stored as a Control Flow Graph, though it may be possible to change this). This tree splits on children of a graph node, but does not connect in the case of multiple parents of a single node. In this we refer to out nodes as "children" and in nodes as "parents". However, we do this from the end node to the start node. This is best because then you get one value on the end node, and that value is the only one we want (however, the function takes a pointer to an empty SgIncidenceDirectedGraph as an argument, this can then be analyzed post traversal if that is wanted.
-
-*Also, following the algorithm explained above, one must realize that the tree has one leaf for EACH path. Thus small programs can lead from a small-ish graph to a VERY large tree. For example, a program with 20 if else statements would end with 2^20 paths, which means the number of nodes in the tree is greater than this. Thus with 32 or 64 you can overflow a 32 or 64 bit integer.
-
-*However, this can be partially resolved by setting the deleteTree boolean to true. This is set to false as the default, however if you don't need the tree then deleteTree will allow you to deal with much larger trees and thus much larger original graphs.
-
-*Realize that because of the potentially massive growth rate of path number, that in large cases path enumeration and counting is extremely prohibitive, as it is not difficult to create a program which has more paths than 2^64, thus an unsigned (signed?) 64 bit integer could not store the number.
-
-*Further, this is still a relatively compact method. You could just as easily force enumeration of paths, which could in some cases drastically increase the number of nodes necessary to store all the information.
-
-*The advantage of the tree structure is two-fold. First it relieves the algorithm of having to keep even more in memory than it has to at the moment, and if you want to deal with GoTo statements, one case can develop that cannot be solved otherwise, e.g.
-
-*Consider the four node tree with nodes a, b, c, d, and edges atb, atc, btc, ctb, btd, ctd. There are FOUR legitimate paths here (a, b, d; a, b, c, d; a, c, d; a, c, b, d), and any other method would recognize this as a loop and, without a special algorithm for loop behavior, this would be ignored.
-
-*The tree structure also allows for very strong parallelization, currently implemented in openMP. This is because depth has meaning in terms of a tree (it doesn't in terms of a general graph) and that you know you can evaluate all nodes at a certain depth if you have solved all the nodes at depth + 1.
-
-**************************
-*Further Improvements: TODO
-**************************
-
-@todo *One improvement that should be implemented ASAP is changing the algorithm from a recursive algorithm to an iterative algorithm. Keeping the memory requirements down is much easier in this form and would probably increase the size of graph that the algorithm can handle.
-
-@todo *Another improvement that should be implemented when possible is to allow for loop analysis. This could be implemented by simply running the algorithm on the loop, but there would need to be a provision that kept the algorithm from stopping as soon as it starts. This could be done by separating the node into two nodes, one with all the inedges and one with all the outedges. OR one could collect the loops when they are deleted (the whole loop is calculated necessarily), though nested loops would have to be considered further in order to find a way to deal with them.
-
-@todo *It is possible that graph matching algorithms might prove useful to distinguish different types of graphs contained within the CFG and optimize traversal over them. Look up graph matching algorithms or pattern matching (potentially) for more information on such algorithms, though I do not believe there is an existant literature on matching subgraphs for this purpose.
-
-@todo *The parallelism in this program should be optimized by someone experienced in parallelization optimization
-
-***************
-*Contact Info
-***************
-
-*Finally, blame can be assigned to and questions can be forwarded to the author, though response is not guaranteed
-
-*archangel DOT associate AT gmail DOT com
-*or, if I'm still at Lawrence
-*hoffman34 AT llnl DOT gov
-*@author Michael Hoffman
-*/
-
-
-
-
-
-#include "staticCFG.h"
-#include <vector>
-#include <algorithm>
-#include <utility>
-#include <iostream>
-#include <sys/time.h>
-#include <sys/resource.h>
-//#include "graphBot.h"
-
-//This is necessary for technical reasons with regards to the graphnodeinheritedmap
-
-
-
-struct Bot {
-    std::vector<std::vector<SgGraphNode*> > path;
-    std::vector<std::set<SgGraphNode*> > pthloops;
-    std::vector<SgGraphNode*> currpth;
-    std::vector<std::pair<SgGraphNode*, int> > nodelst;
-    bool on;
-    bool remove;
-};
-
-double timeDifference(const struct timeval& end, const struct timeval& begin)
-{
-    return (end.tv_sec + end.tv_usec / 1.0e6) - (begin.tv_sec + begin.tv_usec / 1.0e6);
-}
-
-static inline timeval getCPUTime() {
-  rusage ru;
-  getrusage(RUSAGE_SELF, &ru);
-  return ru.ru_utime;
-}
-
-
-struct compareSgGraphNode {
-    bool operator()(const SgGraphNode* a, const SgGraphNode* b) const
-    {
-        return a==b;
-    }
-};
-
-
-/* The SgGraphTraversal class is utilized specifically for StaticCFG traversals,
-though the input must be in terms of a SgIncidenceDirectedGraph*/
-template <class InheritedAttributeType, class SynthesizedAttributeType>
-class SgGraphTraversal
-{
-   public:
-    std::set<std::map<int, std::set<int> > > subpathmap;
-    int loopNum;
-    int nullNum;
-    std::set<SgDirectedGraphEdge*> nullEdgesOrdered;
-    std::map<SgGraphNode*, int> loopNumMap;
-    std::map<SgGraphNode*, int> pathValMap;
-    int nullloops;
-    std::vector<std::vector<SgGraphNode*> > looppaths;
-    std::vector<std::vector<SgGraphNode*> > iLoops;
-    std::vector<SgGraphNode*> ifstatements;
-    virtual ~SgGraphTraversal(); 
-    SgGraphTraversal(); 
-    // Copy operations
-    int nullEdgesPaths;
-    int turns;
-    SgGraphTraversal(const SgGraphTraversal &);
-    const SgGraphTraversal &operator=(const SgGraphTraversal &);
-    //This is not used, but will be important if SynthesizedAttributes become useful
-    typedef StackFrameVector<SynthesizedAttributeType> SynthesizedAttributesList;
-    //one of the most important structures in the algorithm, this attaches SgGraphNode*s to InheritedAttributeTypes so that
-    //looking up the values is possible.
-    //int numnodes;
-    //std::map<SgGraphNode*, InheritedAttributeType> seen;
-    int numnodes;
-    //InheritedAttributeType pthgraphinherit;
-    //StaticCFG::CFG* SgCFG;
-    SgGraphNode* nullnode;
-    std::map<SgGraphNode*, int> primenode;
-    bool done;
-    //std::set<SgGraphNode*> startnodes;
-    std::set<SgGraphNode*> lstN;
-    std::map<SgGraphNode*, std::vector<std::set<int> > > lstordmap;
-    std::set<SgGraphNode*> solvedLoops;
-    std::map<SgGraphNode*, std::vector<SgGraphNode*> > checkednodes; 
-    std::map<SgGraphNode*, std::set<SgGraphNode*> > downed;
-   
-    //std::map<SgGraphNode*, int> nodeinedgordmap;
-    //a value for nodes that have no value, set in the traverse function
-    InheritedAttributeType nullInherit;
-    //the user invoked function, runs the algorithm
-    InheritedAttributeType traverse(SgGraphNode* basenode, SgIncidenceDirectedGraph* g,
-            InheritedAttributeType inheritedValue, InheritedAttributeType nullInherit,
-            SgGraphNode* endnode, bool insep = false, bool pcHk = false);
-    std::set<SgGraphNode*> loopSet;
-
-   protected:
-    //User defined functions to do whatever is needed in evaluation
-    //All the user gets access to is the node in question
-    //and the values of the parent nodes (this should be all that is necessary)
-    virtual InheritedAttributeType evaluateInheritedAttribute(SgGraphNode* n,
-            std::vector<InheritedAttributeType> inheritedValues) = 0;
-    //Not used, but may be useful if SynthesizedAttributes become workable in this context
-    virtual SynthesizedAttributeType evaluateSynthesizedAttribute(SgGraphNode* n,
-            InheritedAttributeType in,
-            SynthesizedAttributesList l) = 0;
-
-#if !USE_ROSE
- // DQ (11/3/2011): EDG compilains about this (but GNU allowed it, I think that EDG might be correct,
- // namely that the value of a reference must be an lvalue (not NULL).  But since we are only trying 
- // to compile ROSE with ROSE (using the new EDG 4.3 front-end as a tests) we can just skip this case for now.
-    virtual void pathAnalyze(std::vector<SgGraphNode*>& pth, bool loop=false, std::set<std::vector<SgGraphNode*> >& incloops=NULL) = 0;
-#else
-    virtual void pathAnalyze(std::vector<SgGraphNode*>& pth, bool loop, std::set<std::vector<SgGraphNode*> >& incloops) = 0;
-#endif
-
-    //also not used, but important for possible later use of SynthesizedAttributes
-    SynthesizedAttributeType defaultSynthesizedAttribute(InheritedAttributeType);
-   private:
-    double distime;
-    //std::set<std::pair<std::pair<SgGraphNode*, SgGraphNode*>, std::pair<SgGraphNode*, SgGraphNode*> > > flpset;
-    //std::set<std::pair<std::pair<SgGraphNode*, SgGraphNode*>, std::pair<SgGraphNode*, SgGraphNode*> > > goodset;
-    std::set<SgGraphNode*> ploops;
-    std::map<SgGraphNode*, std::set<std::vector<SgGraphNode*> > > lpbegins;
-    std::map<SgGraphNode*, int> frksLeft;
-    int currm;
-    int dpMax;
-    int repEval;
-    bool pathCheck;
-    int pathsSize;
-    //this constructs the graph tree for computation of inheritedValues
-
-
-    std::map<SgGraphNode*, InheritedAttributeType> known;
-    std::vector<InheritedAttributeType> connectNodes;
-    std::map<SgGraphNode*, bool> solved;
-    std::set<SgGraphNode*> solvedset;
-    //these two are not used, but will be important if SynthesizedAttributes are made reasonable in this context
-    SynthesizedAttributesList *synthesizedAttributes;
-    SynthesizedAttributeType traversalResult();
-    //finally we have two functions necessary for parallel processing if that is chosen to be used by the user
- 
-
-    
-  
-    std::map<SgGraphNode*, int> nodeInEdgesNum;
-    int currprime;
-    std::vector<SgGraphNode*> endnodefakes;
-    std::map<SgGraphNode*, std::vector<std::vector<SgGraphNode*> > > pathsAtMk;
-    std::set<SgGraphNode*> mkloops;
-    std::map<SgGraphNode*, std::set<std::vector<SgGraphNode*> > > mkloopmap;
-    std::map<SgGraphNode*, std::set<std::vector<SgGraphNode*> > > subPathsAtMk;
-    std::vector<SgGraphNode*> mkglobal;
-    std::vector<SgGraphNode*> clglobal;
-    bool inseparable;
-    void solvePaths(SgIncidenceDirectedGraph* g, SgGraphNode* n, SgGraphNode* endnode);
-    std::vector<std::set<SgGraphNode*> > closuresVec;
-    void evaluatePaths(SgIncidenceDirectedGraph* g, SgGraphNode* realstartnode, SgGraphNode* endnode);
-    void evaluatePathsPar(SgIncidenceDirectedGraph* g, SgGraphNode* realstartnode, SgGraphNode* endnode);
-    bool disjoint(std::vector<SgGraphNode*>& path, std::vector<SgGraphNode*>& vec2) const;
-    std::set<std::vector<SgGraphNode*> > flatpaths;
-//    void evalNode(SgIncidenceDirectedGraph* g, SgGraphNode* n);
-    bool canSolve(SgIncidenceDirectedGraph* g, SgGraphNode* n);
-    std::map<SgGraphNode*, InheritedAttributeType> inhVals;
-    std::set<SgDirectedGraphEdge*> seenEdges;
-    std::set<SgDirectedGraphEdge*> nullEdges;
-    std::set<SgGraphNode*> clsT;
-    void computeOrder(SgIncidenceDirectedGraph* g, SgGraphNode* n, SgGraphNode* endnode);
-    void computeInheritedOrdered(SgIncidenceDirectedGraph* g, SgGraphNode* n);
-    std::pair<bool, SgGraphNode*> getNextPar(SgIncidenceDirectedGraph* g, SgGraphNode* n);
-    std::pair<bool, SgGraphNode*> getNextChild(SgIncidenceDirectedGraph* g, SgGraphNode* n);
-    bool computable(SgIncidenceDirectedGraph* g, SgGraphNode* n);
-    void evalNodeOrdered(SgIncidenceDirectedGraph* g, SgGraphNode* n);
-    std::map<SgGraphNode*, int> oVals;
-    bool canEval(SgIncidenceDirectedGraph* g, SgGraphNode* n);
-    void setPathVal(SgIncidenceDirectedGraph*g, SgGraphNode* n);
-    void printNodePlusEdgesForAnalysis(SgIncidenceDirectedGraph* g, SgGraphNode* n, int loopNum, int pathVal, std::ofstream& ss);
-    void printNodePlusEdgesForAnalysisPath(SgIncidenceDirectedGraph* g, std::vector<SgGraphNode*> n, int loopNum, int pathVal, std::ofstream& ss);
-    void printNodeForAnalysis(SgGraphNode* n, int loopNum, int pathNum, std::ofstream& ss);
-    std::set<SgGraphNode*> completedNodesPath;
-    std::set<std::pair<SgGraphNode*, SgGraphNode*> > completedEdgesPath;
-    void printEdgeForAnalysis(SgDirectedGraphEdge* e, bool isNullEdge, std::ofstream& ss);
-    void printEdgeForAnalysisPath(SgGraphNode* g1, SgGraphNode* g2, std::ofstream& ss);
-    std::map<int, SgGraphNode*> iVals;
-    
-    std::set<SgDirectedGraphEdge*> nullEdgesOrderedOut;
-    std::set<SgDirectedGraphEdge*> completedEdgesOut;
-    std::set<SgDirectedGraphEdge*> completedEdges;
-    std::set<SgGraphNode*> compPar;
-    std::set<SgGraphNode*> compChild;
-    std::set<SgGraphNode*> computedNodes;
-    SgGraphNode* st;
-    SgGraphNode* en;
-    double fllp;
-    int loopnum;
-    //std::set<SgGraphNode*> solved;
-    //InheritedAttributeType findAndReverse(SgGraphNode* n, SgIncidenceDirectedGraph* g);
-     //evaluateAllInheritedAttribute(std::vector<InheritedAttributeType> endNodeInhVec, SgGraphNode* endnode, std::vector<SgGraphNode*> nodes, std::vector<InheritedAttributeType> inh);
-//std::vector<InheritedAttributeType> getZeroInhs(std::vector<std::vector<std::vector<SgGraphNode*> > > qAnsSetSet, std::vector<InheritedAttributeType> endnodeInhVec, SgGraphNode* node);
-
-};
-
-
-
-/*
-template <class InheritedAttributeType, class SynthesizedAttributeType>
-void
-GraphBot<InheritedAttributeType, SynthesizedAttributeType>::
-travelDown(SgIncidenceDirectedGraph* g) {
-    std::set<SgDirectedGraphEdge*> oedgs = g->computeEdgeSetOut(iAmHere);
-    bool taken = false;
-    if (oedgs.size() > 1) {
-        std::set<SgDirectedGraphEdge*> edgeTrav = clEdgeTrav[iAmHere];
-        ROSE_ASSERT(clEdgeTrav.find(iAmHere) != clEdgeTrav.end());
-        for (std::set<SgDirectedGraphEdge*>::iterator i = oedgs.begin(); i != oedgs.end(); i++) {
-            if (edgTrav.find(*i) == edgTrav.end() || !taken) {
-                taken = true;
-                iAmHere = (*i)->get_to();
-                lastEdge = *i;
-            }
-        }
-    }
-    else {
-        iAmHere = (*(oedgs.begin())->get_to();
-    }
-}
-*/
-
-
-
-
-
-
-/*
-***************************
-Various Admin Functions
-***************************
-*/
-template<class InheritedAttributeType, class SynthesizedAttributeType>
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-SgGraphTraversal()
-  : synthesizedAttributes(new SynthesizedAttributesList())
-{
-}
-
-#ifndef SWIG
-
-template<class InheritedAttributeType, class SynthesizedAttributeType>
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-~SgGraphTraversal()
-{
-        ROSE_ASSERT(synthesizedAttributes != NULL);
-        delete synthesizedAttributes;
-        synthesizedAttributes = NULL;
-}
-
-#endif
-
-
-template<class InheritedAttributeType, class SynthesizedAttributeType>
-const SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType> &
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-operator=(const SgGraphTraversal &other)
-{
-
-    ROSE_ASSERT(synthesizedAttributes != NULL);
-    delete synthesizedAttributes;
-    synthesizedAttributes = other.synthesizedAttributes->deepCopy();
-
-    return *this;
-}
-
-/**
-This is the function that is used by the user directly to start the algorithm. It is immediately available to the user
-
-SgGraphTraversal::traverse
-Input:
-@param[n] n starting node
-@param[g] SgIncidenceDirectedGraph* g, CFG calculated previously
-@param[inheritedValue] InheritedAttributeType inheritedValue, value of the starting node
-@param[nullI] InheritedAttributeType nullI, value of the null Attribute, i.e. what to attribute to a node with no value\
-@param[endnode] SgGraphNode* endnode, final node
-@param[insep] boolean to decide inseparability of the analysis function, not yet in use, set automatically to false
-@param[pCh] deprecated, set to false
-@return InheritedAttributeType, the value of the attribute at the end node
-
-*/
-
-
-template<class InheritedAttributeType, class SynthesizedAttributeType>
-InheritedAttributeType
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-traverse(SgGraphNode* n, SgIncidenceDirectedGraph* g, InheritedAttributeType inheritedValue, InheritedAttributeType nullI, SgGraphNode* endnode, bool insep, bool pCh) {
-   //numnodes = 0;
-   //primes.clear();
-    looppaths.clear();
-    iLoops.clear();
-    completedEdgesPath.clear();
-    pathValMap.clear();
-    loopNumMap.clear();
-    nullloops = 0;
-    nullEdgesPaths = 0;
-    fllp = 0.0;
-    mkglobal.clear();
-    clglobal.clear();
-  
-    lpbegins.clear();
-    //currents.clear();
-   inhVals.clear();
-   iVals.clear();
-   oVals.clear();
-   //reservedEdges.clear();
-   completedEdges.clear();
-   completedEdgesOut.clear();
-   //completedNodes.clear();
-   computedNodes.clear();
-   nullEdgesOrdered.clear();
-   nullEdgesOrderedOut.clear();
-   loopSet.clear();
-   pathsAtMk.clear();
-   
-   st = n;
-   en = endnode;
-   distime = 0.0;
-   int currm = 1;
-   int turns = 0;
-   pathsSize = 0;
-   done = false;
-   numnodes = 1;
-   std::cout << "starting traversal" << std::endl;
-   pathCheck = pCh;
-   currprime = 1;
-   inseparable = insep;
-   synthesizedAttributes->resetStack();
-   ROSE_ASSERT(synthesizedAttributes->debugSize() == 0);
-   //SgCFG = cfg;
-   inhVals[n] = inheritedValue;
-   //GraphBot<InheritedAttributeType, SynthesizedAttributeType>::inhVals[n] = inheritedValue;
-   //primes = generatePrimesSieve();
-   
-  
-//   graphnodeinheritedordmap[ncpy] = inheritedValue;
-//   nodenodeordmap[ncpy] = n;
-//   std::vector<SgGraphNode*> lst;
-//   lst.push_back(n);
-//   lstordmap[ncpy] = lst;
-
-   nullInherit = nullI;
-InheritedAttributeType inh;
-   struct timeval t1, t2, t3, t4, t5, t6, t7, t8;
-   //else {
-       loopnum = 0;
-       //InheritedAttributeType inh;
-       t1 = getCPUTime();
-       
-       //this function essentially sets up for the evaluate later, it makes putting together the paths much easier
-       solvePaths(g, n, endnode);
-
-       t2 = getCPUTime();
-
-//making sure that endnode hasn't already been evaluated before the traversal starts, unlikely but just in case
-       ROSE_ASSERT(inhVals.find(endnode) == inhVals.end());
-
-       std::cout << "solvePaths done" << std::endl;
-       double diff = timeDifference(t2, t1);
-       t5 = getCPUTime();
-       //InheritedAttributeType pthgraphinherit = botTraverse(g, n, endnode);
-       oVals[n] = 0;
-       iVals[0] = n;
-       pathValMap[n] = 1;
-//inserting n as a computed node
-       computedNodes.insert(n);
-//computes the order in which the nodes must be evaluated, makes computeInheritedOrdered much faster
-       computeOrder(g, n, endnode);
-       std::cout << "order computed" << std::endl;
-//computes the nodal inheritance values
-       computeInheritedOrdered(g, n);
-       std::cout << "inheritance computed" << std::endl;
-       ROSE_ASSERT(oVals.find(endnode) != oVals.end());
-       ROSE_ASSERT(inhVals.find(endnode) != inhVals.end());
-//value at the endnode
-       InheritedAttributeType pthgraphinherit = inhVals[endnode];
-       //= evaluateGraph(g, n, endnode, inheritedValue);
-       t6 = getCPUTime();
-       std::cout << "evaluateGraph done" << std::endl;
-       double diff3 = timeDifference(t6, t5);
-       t3 = getCPUTime();
-//actually evaluates every path with a user defined pathAnalyze function
-       //for (int i = 0; i < 10; i++) {
-       evaluatePaths(g, n, endnode);
-       //}
-       t4 = getCPUTime();
-       
-       t7 = getCPUTime();
-       //evaluatePathsPar(g, n, endnode);
-       t8 = getCPUTime();
-       
-       std::cout << "evaluatePaths done " << std::endl;
-       double diff2 = timeDifference(t4, t3);
-       double diff2Par = timeDifference(t8, t7);
-       std::cout << "pathsolve took: " << diff << std::endl;
-       std::cout << "patheval took: " << diff2 << std::endl;
-       std::cout << "parpatheval took: " << diff2Par << std::endl;
-       std::cout << "grapheval took: " << diff3 << std::endl;
-       std::cout << "entire pathsolve took: " << diff+diff2+diff3+diff2Par << std::endl;
-       std::cout << "potential loops: " << nullEdgesOrdered.size() << std::endl;
-       std::cout << "nullNum: " << nullNum << std::endl;
-       //std::cout << "goodsets: " << goodset.size() << std::endl;
-       //std::cout << "flpsets: " << flpset.size() << std::endl;
-       std::cout << "mkloops: " << mkloops.size() << std::endl;
-       std::cout << "distime: " << distime << std::endl;
-       std::cout << "fllp: " << fllp << std::endl;
-       return pthgraphinherit;
-   //}
-   //std::cout << "number of endnodefakes: " << endnodefakes.size() << std::endl;
-   //std::cout << "should be number of nodes: " << currprime << std::endl;
-   //if (pathanalysis == true) {
-     // analyzepaths(endnode, g);
-   //}
-   //return inh;
-   //Currently this is not very useful, but it does nothing if traversalResult is not set.
-}
-
-/* WARNING:
-   This is not a general is_disjoint. It skips the 
-first element of the second set because in the way I assemble
-paths the last element of the path and the first element of addend
-must be the same. Hence I simply skip the first node
-*/
-bool is_disjoint(std::set<SgGraphNode*> set1, std::set<SgGraphNode*> set2) {
- 
-   if (set1.empty() || set2.empty()) {
-       return true;
-   }
-   std::set<SgGraphNode*>::iterator it1 = set1.begin();
-   std::set<SgGraphNode*>::iterator it2 = set2.begin();
-   std::set<SgGraphNode*>::iterator it1End = set1.end();
-   std::set<SgGraphNode*>::iterator it2End = set2.end();
-
-    if (*it1 > *set2.rbegin() || *it2 > *set1.rbegin()) {
-        return true;
-    }
-    
-    while (it1 != it1End && it2 != it2End) {
-        if (*it1 == *it2) {
-            return false;
-        }
-        if (*it1 < *it2) {
-            it1++;
-        }
-        else {
-            it2++;
-        }
-     }
-     return true;
-}   
-
-
-
-//Checks for disjoint, necessary in computing the paths
-template<class InheritedAttributeType, class SynthesizedAttributeType>
-bool
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-disjoint(std::vector<SgGraphNode*>& pthloops, std::vector<SgGraphNode*>& vec2) const {
-/*
-    time_t t1, t2;
-    time(&t1);
-    int a = 0;
-    std::set<SgGraphNode*> s1;
-    std::set<SgGraphNode*> s2;
-    std::vector<SgGraphNode*> mkloopvec;
-    bool goodsetbool;
-    bool pbool = true;
-    //std::cout << "calculating disjoint" << std::endl;
-    ROSE_ASSERT((path.back()).back() == vec2.front());
-
-    //copy(vec2.begin(), vec2.end(), inserter(s2, s2.end()));
-/*
-    for (int i = 0; i < vec2.size(); i++) {
-        if (ploops.find(vec2[i]) != ploops.end()) {
-            pbool = false;
-        }
-    }
-    if (pbool) {
-        return true;
-    }
-    if (
-*/  //for (int q = 0; q < pthloops->size(); q++) {
-        for (int i = 0; i < pthloops.size(); i++) {
-            if (find(vec2.begin(), vec2.end(), pthloops[i]) != vec2.end()) {
-                return false;
-            }
-        }
-        return true;
-}
-/*
-    if (pbool) {
-        time(&t2);
-        double diff = difftime(t2, t1);
-        distime += diff;
-        return true;
-    }
-    for (unsigned int k = 0; k < path.size(); k++) {
-        s1.clear();
-*/
-/*
-        pbool = true;
-        for (int p = 0; p < path[k].size(); p++) {
-            if (ploops.find(path[k][p]) != ploops.end()) {
-                pbool = false;
-            }
-        }
-//        copy(path[k].begin(), path[k].end(), inserter(s1, s1.end()));
-        if (!pbool) {
-*/
-/*
-        std::pair<std::pair<SgGraphNode*, SgGraphNode*>, std::pair<SgGraphNode*, SgGraphNode*> > flp;
-        flp.second.first = vec2[0];
-        flp.second.first = vec2[1];
-
-        flp.first.first = path[k][0];
-        flp.first.second = path[k][1];
-        if (vec2.front() == vec2.back()) {
-        time(&t2);
-        double diff = difftime(t2, t1);
-        distime += diff;
-
-            return false;
-        }
-        if (flpset.find(flp) != flpset.end()) {
-            //std::cout << "already seen" << std::endl;
-        time(&t2);
-        double diff = difftime(t2, t1);
-        distime += diff;
-
-            return false;
-        }
-*/
-/*
-        else if (goodset.find(flp) != goodset.end()) {
-            goodsetbool = true;
-        }
-*/
-/*
-        if (is_disjoint(s1,s2)) {
-            //goodset.insert(flp);
-            continue;
-        }
-        else {
-            return false;
-        }
-*/
-/*
-       else {
-        std::vector<SgGraphNode*> vec1 = path[k];
-        
-        //for (unsigned int i = 0; i < vec1.size(); i++) {
-            for (unsigned int j = 0; j < mkloopvec.size(); j++) {
-                std::vector<SgGraphNode*>::iterator q = find(vec1.begin(), vec1.end(), mkloopvec[j]);
-                if (q != vec1.end()) {
-                    if (*q != vec1[vec1.size() - 1] || j != 0) {
-                        
-                        flpset.insert(flp);
-      //                  std::cout << "not disjoint" << std::endl;
-        time(&t2);
-        double diff = difftime(t2, t1);
-        distime += diff;
-
-                        return false;
-                    }
-                }
-            }
-        //}
-        //goodset.insert(flp);
-    }
-    }
-    //}
-*/
-
-    
-/*
-    for (unsigned int p = 0; p < vec2.size(); p++) {
-        for (unsigned int q = 0; q < vec2.size(); q++) {
-            if (p != q) {
-                if (vec2[p] == vec2[q]) {
-                    return false;
-                }
-            }
-        }
-    }
-*/
-/*
-        time(&t2);
-        double diff = difftime(t2, t1);
-        distime += diff;
-
-    return true;
-}
-*/
-//checks for solvability of a node in nodal analysis
-
-template<class InheritedAttributeType, class SynthesizedAttributeType>
-bool
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-canSolve(SgIncidenceDirectedGraph* g, SgGraphNode* n) {
-    bool loop = false;
-    if (inhVals.find(n) != inhVals.end()) {
-        return true;
-    }
-    std::set<SgDirectedGraphEdge*> oed = g->computeEdgeSetIn(n);
-    if (oed.size() == 0) {
-        return false;
-    }
-        for (std::set<SgDirectedGraphEdge*>::iterator i = oed.begin(); i != oed.end(); i++) {
-            if (inhVals.find((*i)->get_from()) == inhVals.end() && nullEdges.find(*i) == nullEdges.end()) {
-                return false;
-            }
-        }
-   return true;
-} 
-
-//this function evaluates values of paths via the user-defined pathAnalyze function
-
-template<class InheritedAttributeType, class SynthesizedAttributeType>
-void
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-evaluatePathsPar(SgIncidenceDirectedGraph* g, SgGraphNode* realstartnode, SgGraphNode* endnode) {
-std::vector<std::vector<SgGraphNode*> > path;
-std::vector<SgGraphNode*> spath;
-SgGraphNode* n = realstartnode;
-int successes = 0;
-int failures = 0;
-int j = 0;
-std::vector<SgGraphNode*> currpthorg;
-int currint = 0;
-std::map<SgGraphNode*, int> intPath;
-intPath[n] = currint;
-currint++;
-std::map<SgGraphNode*, int> currents;
-SgGraphNode* currnode;
-bool step = false;
-bool midstep = false;
-
-//note: pathsAtMk is referring to subpaths connected to that marker, a marker is a split in the graph (usually an if statement)
-
-std::vector<std::vector<SgGraphNode*> > pth = pathsAtMk[realstartnode];
-std::vector<std::vector<SgGraphNode*> > cpth = pathsAtMk[realstartnode];
-    path.clear();
-    int disjoints = 0;
-    int disjointtrues = 0;
-    currpthorg = pth[0];
-    intPath[pth[0].front()] = currint;
-    std::set<SgGraphNode*> pthloopstmp;
-    SgGraphNode* fakenode;
-    pthloopstmp.insert(fakenode);
-    std::vector<std::set<SgGraphNode*> > pthloops;
-    pthloops.push_back(pthloopstmp);
-    pthloopstmp.clear();
-    currint++;
-    
-    int stepnum = 0;
-    std::vector<SgGraphNode*> rs;
-    rs.push_back(realstartnode);
-    path.push_back(rs);
-    currents.clear();
-
-    step = false;
-    std::vector<SgGraphNode*> sub;
-
-
-    std::set<std::vector<SgGraphNode*> > nullIncLoops;
-    std::vector<struct Bot*> todobotlst;
-    std::vector<struct Bot*> botlst;
-    struct Bot* rootBot = new Bot;
-    rootBot->remove = false;
-    
-    rootBot->path = path;
-    rootBot->currpth = currpthorg;
-    rootBot->pthloops = pthloops;
-    rootBot->on = true;
-     botlst.push_back(rootBot);
-    int tip = 1;
-    int ti = 1;
-    std::vector<std::pair<std::vector<SgGraphNode*>, std::vector<std::set<SgGraphNode*> > > > collectedPaths;
-    int maxlst = 0;
-    while (true) {
-    if (todobotlst.size()+botlst.size() > maxlst) {
-        maxlst = todobotlst.size()+botlst.size();
-        std::cout << "maxlst: " << maxlst << std::endl;
-        std::cout << "todobotlst.size(): " << todobotlst.size() << std::endl;
-        std::cout << "botlst.size(): " << botlst.size() << std::endl;
-    }
-    int MAXBOTS = 10000;
-    int MINPATHS = 1000;
-    int LOCALMAXBOTS = 10;
-    int LOCALMAXNODES = 0;
-    std::vector<struct Bot*> lstnullbot;
-    std::vector<std::vector<struct Bot*> > newbotlsts (MAXBOTS, lstnullbot);
-    //std::vector<struct Bot*> newbotlsts (MAXBOTS, lstnullbot);
-    //tip = ti;
-    //ti = 0;
-    ROSE_ASSERT(botlst.size() >= 0);
-    if (botlst.size() == 0) {
-        if (todobotlst.size() != 0) {
-            while (todobotlst.size() > 0 && botlst.size() < MAXBOTS) {
-                todobotlst.back()->on = true;
-                botlst.push_back(todobotlst.back());
-                todobotlst.pop_back();
-            }
-        }
-        else {
-            if (collectedPaths.size() > 0) {
-                  for (int i = 0; i < collectedPaths.size(); i++) {
-                  std::set<std::vector<SgGraphNode*> > incloops;
-                  std::vector<std::set<SgGraphNode*> > pthloops = collectedPaths[i].second;
-                  for (int q = 0; q < pthloops.size(); q++) {
-                  for (std::set<SgGraphNode*>::iterator p = pthloops[q].begin(); p != pthloops[q].end(); p++) {
-                    for (std::set<std::vector<SgGraphNode*> >::iterator o = mkloopmap[*p].begin(); o != mkloopmap[*p].end(); o++) {
-                        incloops.insert(*o);
-                    }
-                 }
-                 }
-
-
-        pathAnalyze(collectedPaths[i].first, false, incloops);
-    }
-    collectedPaths.clear();
-            }
-            break;
-        }
-    }
-    if (botlst.size() > 0) {
-    std::pair<std::vector<SgGraphNode*>, std::vector<std::set<SgGraphNode*> > > nullpr;
-    std::vector<std::pair<std::vector<SgGraphNode*>, std::vector<std::set<SgGraphNode*> > > > newpathslst (MAXBOTS, nullpr);
-    #pragma omp parallel for
-    for (int i = 0; i < botlst.size(); i++) {
-        //std::map<SgGraphNode*, std::set<std::vector<SgGraphNode*> > > mkloopmaptmp = mkloopmap;
-        std::vector<struct Bot*> localbotlst;
-        std::pair<std::vector<SgGraphNode*>, std::vector<std::set<SgGraphNode*> > > localnewpath;
-        struct Bot* currBot = botlst[i];
-        if (currBot->on) {
-        std::vector<SgGraphNode*> currpth = currBot->currpth;
-        std::vector<std::vector<SgGraphNode*> > path = currBot->path;
-        std::vector<std::set<SgGraphNode*> > pthloops = currBot->pthloops;
-        
-            if (currpth.back() == endnode) {
-            path.push_back(currpth);
-            std::vector<SgGraphNode*> flatpath;
-            std::set<std::vector<SgGraphNode*> > incloops;
-            struct timeval q1, q2;
-            ROSE_ASSERT(path.size() == pthloops.size() + 1);
-            q1 = getCPUTime();
-            for (unsigned int q = 0; q < pthloops.size(); q++) {
-                for (unsigned int r = 0; r < path[q].size(); r++) {
-                    flatpath.push_back(path[q][r]);
-                }
-
-/*
-#pragma omp critical
-{
-                for (std::set<SgGraphNode*>::iterator p = pthloops[q].begin(); p != pthloops[q].end(); p++) {
-                    for (std::set<std::vector<SgGraphNode*> >::iterator o = mkloopmap[*p].begin(); o != mkloopmap[*p].end(); o++) {
-                        incloops.insert(*o);
-                    }
-                 }
-}
-*/
-
-             }
-
-             for (unsigned int pt2 = 0; pt2 < path[path.size()-1].size(); pt2++) {
-                     flatpath.push_back(path[path.size()-1][pt2]);
-             }             
-             q2 = getCPUTime();
-             fllp += timeDifference(q2,q1);
-             flatpath.push_back(endnode);
-//user defined function, run on the final path, gives the user loops that are included via "incloops" a set of vectors that contain the individual loops
-/*
-             #pragma omp critical (analyze)
-{
-             pathAnalyze(flatpath, false, incloops);
-}
-*/
-             std::pair<std::vector<SgGraphNode*> , std::vector<std::set<SgGraphNode*> > > newcol;
-             newcol.first = flatpath;
-             newcol.second = pthloops;
-             localnewpath = newcol;
-             incloops.clear();
-
-             int pts = pathsSize++;
-             pathsSize += 1;
-            
-             flatpath.clear();
-             path.pop_back();
-             int rounds = 0;
-             bool starter = false;
-
-// This gets a bit complicated so here is an overview:
-// This is running down the graph and finding the endnode. Once it finds the endnode it goes back up to the last unevaluated subpath. It does this quickly with an integer that counts how many times that node has been used for a path. If this ends up being the number of outnodes, we don't need that node anymore, so we clear it to zero, then continue up the graph. We HAVE to reset because every time a new pathway is chosen above that node, it needs to have the ability to traverse that node.
-/*
-              if (currBot->nodelst.size() != 0) {
-                   while (path.back().back() != currBot->nodelst.back().first) {
-                       ROSE_ASSERT(path.size() != 0);
-                       path.pop_back();
-                       pthloops.pop_back();
-                       
-                   }
-                   currBot->path = path;
-                   currBot->pthloops = pthloops;
-                   currBot->currpth = pathsAtMk[(path.back()).back()][currBot->nodelst.back().second];
-                   currBot->nodelst.pop_back();
-                   localbotlst.push_back(currBot);
-             }
-             else {
-*/
-                 currBot->remove = true;
-                 localbotlst.push_back(currBot);
-             //}
-         }
-         else {
-
-//this checks first to see if we have any loops in our path. If not it continues down, if there is it goes back to the last nonloop node
-        bool disj = true;
-        struct timeval tdisb, tdise;
-        //tdisb = getCPUTime();
-        for (int x = 0; x < pthloops.size(); x++) {
-            for (std::set<SgGraphNode*>::iterator j = pthloops[x].begin(); j != pthloops[x].end(); j++) {
-                if (find(currpth.begin(), currpth.end(), *j) != currpth.end()) {
-                    disj = false;
-                }
-             }
-        }
-        //tdise = getCPUTime();
-        //distime += timeDifference(tdise, tdisb);
-        if (disj) {
-            
-            disjointtrues++;
-            //std::cout << "disjoints: " << disjointtrues << std::endl;
-            midstep = false;
-std::set<SgGraphNode*> pthloopstmp;
-            pthloopstmp.clear();
-                for (int i = 0; i < currpth.size(); i++) {
-                    //currflat.push_back(currpth[i]);
-                    if (mkloops.find(currpth[i]) != mkloops.end()) {
-                       pthloopstmp.insert(currpth[i]);
-                    }
-                }
-                pthloops.push_back(pthloopstmp);
-                path.push_back(currpth);
-                pthloopstmp.clear();
-                
-                //std::set<std::vector<SgGraphNode*> > lpth;
-                std::vector<SgGraphNode*> oldcurrpth = currpth;
-                currpth.clear();
-                        SgGraphNode* frontnode = (path.back()).front();
-                        SgGraphNode* backnode = (path.back()).back();
-     
-                        ROSE_ASSERT(pathsAtMk.find(backnode) != pathsAtMk.end() || backnode == endnode);
-                        ROSE_ASSERT(pathsAtMk.find(frontnode) != pathsAtMk.end());
-                        std::vector<std::vector<SgGraphNode*> > tmppths = pathsAtMk[backnode];
-                        currBot->currpth = tmppths[0];
-                        currBot->path = path;
-                        currBot->pthloops = pthloops;
-                        //newbotlst.push_back(currBot);
-                        for (int tp = 1; tp < tmppths.size(); tp++) {
-                            //if (localbotlst.size() < LOCALMAXBOTS) {
-/*
-                            if (currBot->nodelst.size() < LOCALMAXNODES) {
-                                std::pair<SgGraphNode*, int> cur;
-                                cur.second = tp;
-                                cur.first = path.back().back();
-                                currBot->nodelst.push_back(cur);
-                            }
-                            else {
-*/
-                                struct Bot* newBot = new Bot;
-                                newBot->remove = false;
-                                newBot->currpth = tmppths[tp];
-                                newBot->path = path;
-                                newBot->pthloops = pthloops;
-                                localbotlst.push_back(newBot);
-                                //ti++;
- //                           }
-                        }
-                        localbotlst.push_back(currBot);
-                        //ti++;
-         }          
-         else {
-/*
-               if (currBot->nodelst.size() != 0) {
-                   while (path.back().back() != currBot->nodelst.back().first) {
-                       ROSE_ASSERT(path.size() != 0);
-                       path.pop_back();
-                       pthloops.pop_back();
-                       
-                   }
-                   currBot->path = path;
-                   currBot->pthloops = pthloops;
-                   currBot->currpth =  pathsAtMk[(path.back()).back()][currBot->nodelst.back().second];
-                   currBot->nodelst.pop_back();
-                   localbotlst.push_back(currBot);
-                   //ti++;
-             }
-
-             else {
-*/
-                 currBot->remove = true;
-                 localbotlst.push_back(currBot);
-                 //delete currBot;
- //            }
-
-        }
-     }
- newpathslst[i] = localnewpath;
- newbotlsts[i] = localbotlst;
- }
-}
- botlst.clear();
- int num = 0;
-
- for (int i = 0; i < newbotlsts.size(); i++) {
-    if (newpathslst[i].first.size() > 0) {
-        collectedPaths.push_back(newpathslst[i]);
-    }
-    for (int j = 0; j < newbotlsts[i].size(); j++) {
-        if (newbotlsts[i][j]->remove == true) {
-            delete newbotlsts[i][j];
-        }
-        else if (num < MAXBOTS) {
-            newbotlsts[i][j]->on = true;
-            botlst.push_back(newbotlsts[i][j]);
-            num++;
-        }
-        else {
-            newbotlsts[i][j]->on = false;
-            todobotlst.push_back(newbotlsts[i][j]);
-        }
-    }
-}
-
-if (collectedPaths.size() > MINPATHS) {
-          
-    for (int i = 0; i < collectedPaths.size(); i++) {
-                 std::vector<std::set<SgGraphNode*> > pthloops;   
-                std::set<std::vector<SgGraphNode*> > incloops;
-                pthloops = collectedPaths[i].second;
-                for (int q = 0; q < pthloops.size(); q++) {
-                for (std::set<SgGraphNode*>::iterator p = pthloops[q].begin(); p != pthloops[q].end(); p++) {
-                    for (std::set<std::vector<SgGraphNode*> >::iterator o = mkloopmap[*p].begin(); o != mkloopmap[*p].end(); o++) {
-                        incloops.insert(*o);
-                    }
-                 }
-               }
-
-        pathAnalyze(collectedPaths[i].first, false, incloops);
-    }
-    collectedPaths.clear();
-}
-}
- else {
-            if (collectedPaths.size() > 0) {
-            for (int i = 0; i < collectedPaths.size(); i++) {
-                std::set<std::vector<SgGraphNode*> > incloops;
-                pthloops = collectedPaths[i].second;
-                for (int q = 0; q < pthloops.size(); q++) {
-                for (std::set<SgGraphNode*>::iterator p = pthloops[q].begin(); p != pthloops[q].end(); p++) {
-                    for (std::set<std::vector<SgGraphNode*> >::iterator o = mkloopmap[*p].begin(); o != mkloopmap[*p].end(); o++) {
-                        incloops.insert(*o);
-                    }
-                 }
-               }
- 
-        pathAnalyze(collectedPaths[i].first, false, incloops);
-    }
-    }
-    collectedPaths.clear();
- break;
- }
-}
-
-std::cout << "successes: " << successes << std::endl;
-std::cout << "failures: " << failures << std::endl;
-std::cout << "maxlst: " << maxlst << std::endl;
-return;
-}
-
-
-
-template<class InheritedAttributeType, class SynthesizedAttributeType>
-void
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-evaluatePaths(SgIncidenceDirectedGraph* g, SgGraphNode* realstartnode, SgGraphNode* endnode) {
-//std::set<SgGraphNode*> seen;
-//for (std::map<SgGraphNode*, std::vector<std::vector<SgGraphNode*> > >::iterator i = pathsAtMk.begin(); i != pathsAtMk.end(); i++) {
-/*    
-    std::vector<std::vector<SgGraphNode*> > tocheck = (*i).second;
-    for (int j = 0; j < tocheck.size(); j++) {
-        for (int k = 0; k < tocheck[j].size(); k++) {
-            if (seen.find(tocheck[j][k]) != seen.end()) {
-                ploops.insert(tocheck[j][k]);
-            }
-            else {
-                seen.insert(tocheck[j][k]);
-            }
-        }
-    }
-}
-*/     
-std::vector<std::vector<SgGraphNode*> > path;
-std::vector<SgGraphNode*> spath;
-SgGraphNode* n = realstartnode;
-int successes = 0;
-int failures = 0;
-int j = 0;
-std::vector<SgGraphNode*> currpth;
-int currint = 0;
-std::map<SgGraphNode*, int> intPath;
-intPath[n] = currint;
-currint++;
-std::map<SgGraphNode*, int> currents;
-SgGraphNode* currnode;
-bool step = false;
-bool midstep = false;
-
-//note: pathsAtMk is referring to subpaths connected to that marker, a marker is a split in the graph (usually an if statement)
-
-std::vector<std::vector<SgGraphNode*> > pth = pathsAtMk[realstartnode];
-std::vector<std::vector<SgGraphNode*> > cpth = pathsAtMk[realstartnode];
-    path.clear();
-    int disjoints = 0;
-    int disjointtrues = 0;
-    currpth = pth[0];
-    intPath[pth[0].front()] = currint;
-    std::set<SgGraphNode*> pthloopstmp;
-    SgGraphNode* fakenode;
-    pthloopstmp.insert(fakenode);
-    std::vector<std::set<SgGraphNode*> > pthloops;
-    pthloops.push_back(pthloopstmp);
-    pthloopstmp.clear();
-    currint++;
-    
-    int stepnum = 0;
-    std::vector<SgGraphNode*> rs;
-    rs.push_back(realstartnode);
-    path.push_back(rs);
-    //currflat.push_back(realstartnode);
-    currents.clear();
-
-    step = false;
-    //std::vector<SgGraphNode*> currflat;
-    std::vector<SgGraphNode*> sub;
-
-/*
-    std::ofstream mz;
-    mz.open("pathanalysis.dot");
-    mz << "digraph defaultName { \n";
-*/
-    std::set<std::vector<SgGraphNode*> > nullIncLoops;
-
-/*
-    for (unsigned int p = 0; p < looppaths.size(); p++) {
-        std::vector<SgGraphNode*> lp = looppaths[p];
-
-        for (unsigned int i = 0; i < lp.size()-1; i++) {
-            for (unsigned int l = i+1; l < lp.size(); l++) {
-                if (lp[i] == lp[l] && lp[i] != realstartnode && lp[i] != endnode) {
-                std::vector<SgGraphNode*> interiorloop;
-                interiorloop.clear();
-                for (unsigned int j = i; j < l+1; j++) {
-                    interiorloop.push_back(lp[j]);
-                }
-                if (interiorloop.size() > 2) {
-                }
-                if (interiorloop.size() > 2 && interiorloop.back() != endnode) {
-                if (find(iLoops.begin(), iLoops.end(), interiorloop) == iLoops.end()) {
-                    if (find(looppaths.begin(), looppaths.end(), interiorloop) == looppaths.end()) {
-                        iLoops.push_back(interiorloop);
-                        loopnum++;
-                        for (unsigned int k = 0; k < interiorloop.size(); k++) {
-                             loopNumMap[interiorloop[k]] = loopnum;
-                        }
-                        lpbegins[interiorloop.front()].insert(interiorloop);
-                        pathAnalyze(interiorloop, true, nullIncLoops);
-                        
-                    }
-                }
-                }
-                }
-            }
-        }
-        if (lp.size() > 2) {   
-            lpbegins[lp.front()].insert(lp);      
-            pathAnalyze(lp, true, nullIncLoops);
-            //for (unsigned int i = 1; i < lp.size(); i++) {
-            //    printNodePlusEdgesForAnalysisPath(g, lp, p, p, mz);
-            //}
-        }
-    }
-*/
-    while (step == false) {
-        stepnum++;
-        
-        if (currpth.back() == endnode) {
-            path.push_back(currpth);
-            //for (int i = 0; i < currpth.size(); i++) {
-            //    currflat.push_back(currpth[i]);
-            //}
-            std::vector<SgGraphNode*> flatpath;
-            //std::vector<SgGraphNode*> sub;
-            std::set<std::vector<SgGraphNode*> > incloops;
-            struct timeval q1, q2;
-            //std::cout << "path.size(): " << path.size() << std::endl;
-            //std::cout << "pthloops.size(): " << pthloops.size() << std::endl;
-            ROSE_ASSERT(path.size() == pthloops.size() + 1);
-            q1 = getCPUTime();
-            for (unsigned int q = 0; q < pthloops.size(); q++) {
-                //sub = path[q];
-                //sub.pop_back();
-                for (unsigned int r = 0; r < path[q].size(); r++) {
-                    flatpath.push_back(path[q][r]);
-                }
-                for (std::set<SgGraphNode*>::iterator p = pthloops[q].begin(); p != pthloops[q].end(); p++) {
-                    for (std::set<std::vector<SgGraphNode*> >::iterator o = mkloopmap[*p].begin(); o != mkloopmap[*p].end(); o++) {
-                        incloops.insert(*o);
-                    }
-                 }
-             }
-             for (unsigned int pt2 = 0; pt2 < path[path.size()-1].size(); pt2++) {
-                     flatpath.push_back(path[path.size()-1][pt2]);
-             }
-             
-             q2 = getCPUTime();
-             fllp += timeDifference(q2,q1);
-             flatpath.push_back(endnode);
-/* 
-            for (unsigned int ps = 0; ps < flatpath.size(); ps++) {
-                 if (lpbegins.find(flatpath[ps]) != lpbegins.end()) {
-                     for (std::set<std::vector<SgGraphNode*> >::iterator sv = lpbegins[flatpath[ps]].begin(); sv != lpbegins[flatpath[ps]].end(); sv++) {
-                         incloops.insert(*sv);
-                     }
-                 }
-             }
-*/
-//user defined function, run on the final path, gives the user loops that are included via "incloops" a set of vectors that contain the individual loops
-             pathAnalyze(flatpath, false, incloops);
-             incloops.clear();
-                //printNodePlusEdgesForAnalysisPath(g, flatpath, -1, -1, mz);
-
-             int pts = pathsSize++;
-             pathsSize += 1;
-            
-             flatpath.clear();
-             path.pop_back();
-             int rounds = 0;
-             bool starter = false;
-
-// This gets a bit complicated so here is an overview:
-// This is running down the graph and finding the endnode. Once it finds the endnode it goes back up to the last unevaluated subpath. It does this quickly with an integer that counts how many times that node has been used for a path. If this ends up being the number of outnodes, we don't need that node anymore, so we clear it to zero, then continue up the graph. We HAVE to reset because every time a new pathway is chosen above that node, it needs to have the ability to traverse that node.
-
-
-              while (true) {
-                   rounds++;
-                   ROSE_ASSERT(pathsAtMk.find((path.back()).back()) != pathsAtMk.end());
-                   if ((path.back()).front() == realstartnode) {
-                       starter = true;
-                   }
-                   if (currents[(path.back()).back()] < (pathsAtMk[(path.back()).back()].size()) /*|| (path.back()).front() == realstartnode*/) {
-                              std::vector<std::vector<SgGraphNode*> > cpths = pathsAtMk[(path.back()).back()];
-                              currpth = cpths[currents[(path.back()).back()]];
-                              currents[(path.back()).back()]++;
-                              break;
-                   }
-                   else {
-                       currents[(path.back()).back()] = 0;
-                       path.pop_back();
-                       pthloops.pop_back();
-                   }
-                   if (starter == true) {
-                       step = true;
-                       break;
-                   }
-
-           }
-        }
-        else {
-
-//this checks first to see if we have any loops in our path. If not it continues down, if there is it goes back to the last nonloop node
-        bool disj = true;
-        struct timeval tdisb, tdise;
-        tdisb = getCPUTime();
-        for (int i = 0; i < pthloops.size(); i++) {
-            for (std::set<SgGraphNode*>::iterator j = pthloops[i].begin(); j != pthloops[i].end(); j++) {
-                if (find(currpth.begin(), currpth.end(), *j) != currpth.end()) {
-                    disj = false;
-                }
-             }
-        }
-/*
-        #pragma omp parallel for num_threads(4) private(i,j)
-        for (i = 0; i < pthloops.size(); i++) {
-            if (disj) {
-            for (std::set<SgGraphNode*>::iterator j = pthloops[i].begin(); j != pthloops[i].end(); j++) {
-                if (find(currpth.begin(), currpth.end(), *j) != currpth.end()) {
-                    disj = false;
-                    //j = pthloops[i].size();
-                }
-            }
-            }
-            
-        }
-*/
-        tdise = getCPUTime();
-        distime += timeDifference(tdise, tdisb);
-        if (disj) {
-            
-            disjointtrues++;
-            //std::cout << "disjoints: " << disjointtrues << std::endl;
-            midstep = false;
-            std::set<SgGraphNode*> pthloopstmp;
-            pthloopstmp.clear();
-                for (int i = 0; i < currpth.size(); i++) {
-                    //currflat.push_back(currpth[i]);
-                    if (mkloops.find(currpth[i]) != mkloops.end()) {
-                       pthloopstmp.insert(currpth[i]);
-                    }
-                }
-                pthloops.push_back(pthloopstmp);
-                path.push_back(currpth);
-                pthloopstmp.clear();
-                
-                //std::set<std::vector<SgGraphNode*> > lpth;
-                std::vector<SgGraphNode*> oldcurrpth = currpth;
-                currpth.clear();
-                if (currents.find((path.back()).back()) == currents.end()) {
-                    currents[(path.back()).back()] = 0;
-                }
-                        SgGraphNode* frontnode = (path.back()).front();
-                        SgGraphNode* backnode = (path.back()).back();
-     
-                        ROSE_ASSERT(pathsAtMk.find(backnode) != pathsAtMk.end() || backnode == endnode);
-                        ROSE_ASSERT(pathsAtMk.find(frontnode) != pathsAtMk.end());
-                        if (currents.find(backnode) == currents.end()) {
-                            currents[backnode] = 0;
-                        }
-                        else {
-                            ROSE_ASSERT(currents[backnode] == 0);
-                        }
-                        std::vector<std::vector<SgGraphNode*> > tmppths = pathsAtMk[backnode];
-                       
-                        currpth = tmppths[currents[backnode]];
-                        ROSE_ASSERT(currpth != oldcurrpth);
-                        currents[backnode]++;
-                    }        
-     else {
-        disjoints++;
-        //std::cout << "disjoint false: " << s << std::endl;
-        
-        while (true) {
-            if (currents[(path.back()).back()] < pathsAtMk[(path.back()).back()].size() || path.back().back() == realstartnode) {
-                break;
-            }
-            currents[(path.back()).back()] = 0;
-            path.pop_back();
-            pthloops.pop_back();
-        }
-        if ((path.back()).back() != realstartnode) {
-        currpth = (pathsAtMk[(path.back()).back()])[currents[(path.back()).back()]];
-        currents[(path.back()).back()]++;
-        }
-        else {
-        step = true;
-        }
-    }
- }
- }
-std::cout << "successes: " << successes << std::endl;
-std::cout << "failures: " << failures << std::endl;
-
-return;
-}
-    
-        
-//these are debugging functions, used to visually ascertain where the paths are going to check to make sure everything is evaluated
-
-
-/* DEBUGGING */
-
-template<class InheritedAttributeType, class SynthesizedAttributeType>
-void
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-printNodePlusEdgesForAnalysis(SgIncidenceDirectedGraph* g, SgGraphNode* n, int loopNum, int pathVal, std::ofstream& ss) {
-  printNodeForAnalysis(n, loopNum, pathVal, ss);
-  std::set<SgDirectedGraphEdge*> outEdges = g->computeEdgeSetOut(n);
-  for (std::set<SgDirectedGraphEdge*>::iterator i = outEdges.begin(); i != outEdges.end(); i++) {
-    if (nullEdgesOrdered.find(*i) == nullEdgesOrdered.end()) {
-        printEdgeForAnalysis(*i, false, ss);
-    }
-    else {
-        printEdgeForAnalysis(*i, true, ss);
-    }   
-  }
-}
-
-template<class InheritedAttributeType, class SynthesizedAttributeType>
-void
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-printNodePlusEdgesForAnalysisPath(SgIncidenceDirectedGraph* g, std::vector<SgGraphNode*> n, int loopNum, int pathVal, std::ofstream& ss) {
-  for (unsigned int i = 0; i < n.size()-1; i++) {
-     if (completedNodesPath.find(n[i]) == completedNodesPath.end()) {
-         printNodeForAnalysis(n[i], loopNum, pathVal, ss);
-         completedNodesPath.insert(n[i]);
-     }
-     std::pair<SgGraphNode*, SgGraphNode*> prnod;
-     prnod.first = n[i+1];
-     prnod.second = n[i];
-     if (completedEdgesPath.find(prnod) == completedEdgesPath.end()) {
-         printEdgeForAnalysisPath(n[i+1], n[i], ss);
-         completedEdgesPath.insert(prnod);
-     }
-  }
-  if (completedNodesPath.find(n[n.size() - 1]) == completedNodesPath.end()) {
-     printNodeForAnalysis(n[n.size()-1], loopNum, pathVal, ss);
-     completedNodesPath.insert(n[n.size() - 1]);
-  }
-
-}
-
-
-template<class InheritedAttributeType, class SynthesizedAttributeType>
-void
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-printNodeForAnalysis(SgGraphNode* n, int loopNum, int pathNum, std::ofstream &ss) {
-  int id = n->get_index();
-  std::string nodeColor = "black";
-  if (loopNum != 0) {
-  ss << id << " [label=\"" << "LoopNumS" << loopNum << "\", color=\"" << "green" << "\", style=\"" << "solid" << "\"];\n";
-  }
-  else {
-  ss << id << " [label=\"" << "pathNumS" << pathNum << "\", color=\"" << "black" << "\", style=\"" << "dotted" << "\"];\n";
-  }
-  
-}
-template<class InheritedAttributeType, class SynthesizedAttributeType>
-void
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-printEdgeForAnalysis(SgDirectedGraphEdge* e, bool isNullEdge, std::ofstream &ss) {
-  if (isNullEdge) {
-      ss << e->get_from()->get_index() << " -> " << e->get_to()->get_index() << " [label=\"" << "NullEdge" << "\", style=\"" << "dotted" << "\"];\n";
-  }
-  else {
-      ss << e->get_from()->get_index() << " -> " << e->get_to()->get_index() << " [label=\"" << "\", style=\"" << "solid" << "\"];\n";
-  }
-}
-template<class InheritedAttributeType, class SynthesizedAttributeType>
-void
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-printEdgeForAnalysisPath(SgGraphNode* g1, SgGraphNode* g2, std::ofstream &ss) {
-      ss << g2->get_index() << " -> " << g1->get_index() << " [label=\"" << "Edge" << "\", style=\"" << "solid" << "\"];\n";
-}
-
-/* END DEBUGGING */
-
-//This function sets up the graph so that the evaluatePath function can easily traverse the paths
-
-template<class InheritedAttributeType, class SynthesizedAttributeType>
-void
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-solvePaths(SgIncidenceDirectedGraph* g, SgGraphNode* n, SgGraphNode* endnode) {
-    bool done = false;
-    bool edges = true;
-    bool tookone = false;
-    std::vector<SgGraphNode*> mkpath;
-    std::vector<SgGraphNode*> marks;
-    marks.push_back(n);
-    mkglobal.push_back(n);
-    SgGraphNode* currn = n;
-    SgGraphNode* took;
-    std::set<SgDirectedGraphEdge*> taken;
-    std::vector<SgGraphNode*> toTake;
-    std::vector<SgGraphNode*> path;
-    path.push_back(n);
-    mkpath.push_back(n);
-    int itr = 0;
-    int bifurcations = 0;
-    std::map<SgGraphNode*, bool> completed;
-    while (done == false) {
-             ROSE_ASSERT(currn != NULL);
-//check to see if we've hit the endnode or if we're done, if not continue, if so push the subpath into the "pathsAtMk" repository            
-               if (currn == endnode || completed.find(currn) != completed.end()) {
-                if (pathsAtMk.find(marks.back()) == pathsAtMk.end()) {
-                    std::vector<std::vector<SgGraphNode*> > emptypath;
-                    pathsAtMk[marks.back()] = emptypath;
-                }
-                edges = false;
-                pathsAtMk[marks.back()].push_back(mkpath);
-                //for (int mk = 0; mk < mkpath.size(); mk++) {
-                 //   std::set<SgDirectedGraphEdge*> iedg = g->computeEdgeSetIn(mkpath[mk]);
-                    //if (iedg.size() > 1) {
-                    //    ploops.insert(mkpath[mk]);
-                   // }
-                //}
-                ROSE_ASSERT(mkpath.front() == marks.back());
-                if (marks.size() == 0) {
-                    return;
-                }
-                mkpath.clear();
-                bool y = true;
-                bool haventtaken = false;
-                bool p = true;
-                int place;
-                bool found = false;
-                while (found == false) {
-                    if (marks.size() == 0) {
-                        return;
-                    }
-                    SgDirectedGraphEdge* tooked;
-                    SgGraphNode* mark1 = marks.back();
-                    std::set<SgDirectedGraphEdge*> oedg = g->computeEdgeSetOut(mark1);
-                    ROSE_ASSERT(oedg.size() > 1 || mark1 == n);
-                        for (std::set<SgDirectedGraphEdge*>::iterator j = oedg.begin(); j != oedg.end(); j++) {
-                            if (taken.find(*j) == taken.end() && haventtaken == false) {
-                                tooked = *j;
-                                haventtaken = true;
-                            }
-                        }
-                        if (haventtaken == true) {
-                            if (marks.back() == n) {
-                                path.clear();
-                            }
-                            path.push_back(marks.back());
-                            if ( mkpath.empty() || (mkpath.back() != marks.back()) ) {
-                                ROSE_ASSERT(!marks.empty());
-                                mkpath.push_back(marks.back());
-                            }
-                            taken.insert(tooked);
-                            took = tooked->get_to();
-                            found = true;
-                        }
-                        else {
-                            completed[marks.back()] = true;
-                            bifurcations++;
-                            marks.pop_back();
-                        }
-                    }
-                    if (marks.size() == 0) {
-                        return;
-                    } 
-                    haventtaken = false;
-                    found = false; 
-                                
-             }
-//if we haven't reached the endnode or completed, continue down the graph
-             else {
-            std::set<SgDirectedGraphEdge*> oedg = g->computeEdgeSetOut(currn);
-            std::set<SgDirectedGraphEdge*> iedg = g->computeEdgeSetIn(currn);
-            if (oedg.size() > 1) {
-                     if (mkpath.back() != currn) {
-                     mkpath.push_back(currn);
-                     }
-                     pathsAtMk[marks.back()].push_back(mkpath);
-                     mkpath.clear();
-                     mkpath.push_back(currn);
-                     marks.push_back(currn);
-                     if (find(mkglobal.begin(), mkglobal.end(), currn) == mkglobal.end()) {
-                         mkglobal.push_back(currn);
-                     }
-                     for (std::set<SgDirectedGraphEdge*>::iterator i = oedg.begin(); i != oedg.end(); i++) {
-                          if (taken.find(*i) == taken.end() && tookone == false) {
-                               taken.insert(*i);
-                               tookone = true;
-                               took = (*i)->get_to();
-                          }
-                          else if (taken.find(*i) == taken.end() && tookone == true) {
-                               //toTake.push_back((*i)->get_to());
-                          }
-                   }
-                   tookone = false;
-           }
-           else {
-                took = (*(oedg.begin()))->get_to();
-           }
-           }
-           itr++;
-           
-           if (find(path.begin(), path.end(), took) == path.end()) {
-               mkpath.push_back(took);
-               path.push_back(took);
-               currn = took;
-           }
-           else {
-               mkloops.insert(took);
-               std::vector<SgGraphNode*> lptemp;
-               lptemp.clear();
-               lptemp.push_back(took);
-               while (path.back() != took) {
-                   
-                   path.pop_back();
-                  
-                   lptemp.push_back(path.back());
-                   
-               }
-               (mkloopmap[took]).insert(lptemp);
-/*
-               if (lptemp.size() > 1) {
-               if (find(looppaths.begin(), looppaths.end(), lptemp) == looppaths.end() && find(lptemp.begin(), lptemp.end(), st) == lptemp.end() && find(lptemp.begin(), lptemp.end(), endnode) == lptemp.end()) {
-                   looppaths.push_back(lptemp);
-                   loopnum++;
-                   for (unsigned int i = 0; i < lptemp.size(); i++) {
-                       loopNumMap[lptemp[i]] = loopnum;
-                   }
-               }
-               }
-*/
-               path.push_back(took);
-               currn = path.back();
-               mkpath.push_back(took);
-           }
-           
-               
-}
-           return;
-}
-
-//not currently useful
-template <class InheritedAttributeType, class SynthesizedAttributeType>
-SynthesizedAttributeType
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-defaultSynthesizedAttribute(InheritedAttributeType inh)
-{
-    SynthesizedAttributeType s = SynthesizedAttributeType();
-    return s;
-}
-
-
-//computes the order in which to evaluate the nodes in nodal analysis so that you don't evaluate a node before you evaluate its parents
-
-template <class InheritedAttributeType, class SynthesizedAttributeType>
-void
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-computeOrder(SgIncidenceDirectedGraph* g, SgGraphNode* n, SgGraphNode* endnode) {
-    std::map<SgGraphNode*, int> incomputables;
-    std::set<SgGraphNode*> lpposs;
-    //std::set<SgGraphNode*> lps;
-    SgGraphNode* currn;
-    currn = n;
-    int orders = 0; 
-    while (true) {
-        if (orders % 10000 == 0) {
-            std::cout << "orders: " << orders << std::endl;
-        }
-        orders++;
-        if (currn == endnode) {
-        }
-        if (computable(g, currn) || currn == n) {
-            int mp;
-            if (oVals.find(currn) == oVals.end()) {
-                 oVals[currn] = currm++;
-                 iVals[currm++] = currn;
-                 currm += 1;
-            }
-            if (currn == endnode) {
-                
-                break;
-            }
-            std::pair<bool, SgGraphNode*> pbs = getNextChild(g, currn);
-            computedNodes.insert(currn);
-            ROSE_ASSERT(pbs.first == true);
-            currn = pbs.second;
-        }
-        else {
-            std::pair<bool, SgGraphNode*> pbp = getNextPar(g, currn);
-            ROSE_ASSERT(pbp.first == true);
-            currn = pbp.second;
-            
-        }
-        
-    }
-    std::cout << "required orders" << orders << std::endl;
-    std::cout << "incomputables.size() " << incomputables.size() << std::endl;
-}
-
-//simple fucntion to check the computability under nodal analysis
-template <class InheritedAttributeType, class SynthesizedAttributeType>
-bool
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-computable(SgIncidenceDirectedGraph* g, SgGraphNode* n) {
-    if (computedNodes.find(n) != computedNodes.end()) {
-        return true;
-    }
-    std::set<SgDirectedGraphEdge*> ed = g->computeEdgeSetIn(n);
-    bool comp = true;
-    for (std::set<SgDirectedGraphEdge*>::iterator i = ed.begin(); i != ed.end(); i++) {
-        if (oVals.find((*i)->get_from()) == oVals.end() && nullEdgesOrdered.find(*i) == nullEdgesOrdered.end()) {
-            comp = false;
-        }
-    }
-    return comp;
-}
-
-
-//computes the inherited attribute values in nodal analysis
-
-template <class InheritedAttributeType, class SynthesizedAttributeType>
-void
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-computeInheritedOrdered(SgIncidenceDirectedGraph* g, SgGraphNode* n) {
-    int runs = 0;
-//    std::ofstream mf;
-//    mf.open("analysis.dot");
-//    mf << "digraph defaultName { \n";
-    for (std::map<int, SgGraphNode*>::iterator i = iVals.begin(); i != iVals.end(); i++) {
-        runs++;
-        ROSE_ASSERT(canEval(g, (*i).second));
-        setPathVal(g, n);
-        //printNodePlusEdgesForAnalysis(g, (*i).second, loopNumMap[(*i).second], pathValMap[(*i).second], mf);
-        evalNodeOrdered(g, (*i).second);
-    }
-}
-
-//checks to see if evaluation is possible under nodal analysis
-template <class InheritedAttributeType, class SynthesizedAttributeType>
-bool
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-canEval(SgIncidenceDirectedGraph* g, SgGraphNode* n) {
-    bool evaled = true;
-    if (inhVals.find(n) == inhVals.end()) {
-    std::set<SgDirectedGraphEdge*> ins = g->computeEdgeSetIn(n);
-    for (std::set<SgDirectedGraphEdge*>::iterator i = ins.begin(); i != ins.end(); i++) {
-        if (inhVals.find((*i)->get_from()) == inhVals.end() && nullEdgesOrdered.find(*i) == nullEdgesOrdered.end()) {
-            evaled = false;
-        }
-    }
-    }
-    return evaled;
-}
-
-
-//actually does the evaluation
-template <class InheritedAttributeType, class SynthesizedAttributeType>
-void
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-evalNodeOrdered(SgIncidenceDirectedGraph* g, SgGraphNode* n) {
-    if (inhVals.find(n) != inhVals.end()) {
-        return;
-    }
-    std::set<SgDirectedGraphEdge*> par = g->computeEdgeSetIn(n);
-    std::vector<InheritedAttributeType> inh;
-    for (std::set<SgDirectedGraphEdge*>::iterator i = par.begin(); i != par.end(); i++) {
-        if (inhVals.find((*i)->get_from()) != inhVals.end()) {
-            inh.push_back(inhVals[(*i)->get_from()]);
-        }
-    }
-    
-    if (n != st || inh.size() > 0) {
-        InheritedAttributeType inhX;
-        inhX = evaluateInheritedAttribute(n, inh);
-        inhVals[n] = inhX;
-    }
-    //std::cout << "num of inhVals: " << inh.size() << std::endl;
-    
-}
-
-
-//debugging function, currently not useful for the end user
-template <class InheritedAttributeType, class SynthesizedAttributeType>
-void
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-setPathVal(SgIncidenceDirectedGraph* g, SgGraphNode* currn) {
-       if (pathValMap.find(currn) != pathValMap.end()) {
-           return;
-       }
-       std::set<SgDirectedGraphEdge*> ined = g->computeEdgeSetIn(currn);
-       int tmppathcount = 0;
-       for (std::set<SgDirectedGraphEdge*>::iterator i = ined.begin(); i != ined.end(); i++) {
-            ROSE_ASSERT(pathValMap.find((*i)->get_from()) != pathValMap.end() /*|| nullEdgesOrdered.find(*i) != nullEdgesOrdered.end()*/);
-            //if (nullEdgesOrdered.find(*i) != nullEdgesOrdered.end()) {
-            //    pathValMap[(*i)->get_from()] = 0;
-           // }
-            int pv = pathValMap[(*i)->get_from()];
-            if (pv != 0) {
-            tmppathcount += pv;
-            }
-        }
-        pathValMap[currn] = tmppathcount;
-        return;
-    }
-
-//computes the next child to be analyzed in nodal analysis
-template <class InheritedAttributeType, class SynthesizedAttributeType>
-std::pair<bool, SgGraphNode*>
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-getNextChild(SgIncidenceDirectedGraph* g, SgGraphNode* n) {
-    bool nullPoss = false;
-    //std::cout << "nextChild" << std::endl;
-    std::set<SgDirectedGraphEdge*> outs = g->computeEdgeSetOut(n);
-    //std::cout << "outs.size(): " << outs.size() << std::endl;
-    //std::cout << "outs: " << outs.size() << std::endl;
-    SgGraphNode* nextNode;
-    SgGraphNode* nullNode;
-    bool completed = false;
-    bool completeNull = false;
-    
-    for (std::set<SgDirectedGraphEdge*>::iterator i = outs.begin(); i != outs.end(); i++) {
-
-        if (outs.size() == 1) {
-            nextNode = (*i)->get_to();
-            if (nullEdgesOrdered.find(*i) != nullEdgesOrdered.end()) {
-                nullNum++;
-            }
-            //completedEdges.insert(*i);
-            completed = true;
-        }
-        else if (completed == false && computedNodes.find((*i)->get_to()) == computedNodes.end()) {
-            completed = true;
-            nextNode = (*i)->get_to();
-            if (nullEdgesOrdered.find(*i) != nullEdgesOrdered.end()) {
-                nullNum++;
-            }
-            completedEdgesOut.insert(*i);
-        }
-        
-            
-    }
-    std::pair<bool, SgGraphNode*> pr;
-    ROSE_ASSERT (completed == true || completeNull == true);
-    if (completed == true) {
-        pr.first = completed;
-        pr.second = nextNode;
-        return pr;
-    }
-    else {
-        pr.first = true;
-        pr.second = nullNode;
-        return pr;
-    } 
-    
-}
-
-//computes the next parent to be analyzed in nodal analysis
-template <class InheritedAttributeType, class SynthesizedAttributeType>
-std::pair<bool, SgGraphNode*>
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-getNextPar(SgIncidenceDirectedGraph* g, SgGraphNode* n) {
-    std::set<SgDirectedGraphEdge*> ins = g->computeEdgeSetIn(n);
-    SgGraphNode* nextPar;
-    SgDirectedGraphEdge* nullEdgeO;
-    bool completed = false;
-    bool completeNull = false;
-    for (std::set<SgDirectedGraphEdge*>::iterator i = ins.begin(); i != ins.end(); i++) {
-
-        if (ins.size() == 1 /*&& completedEdges.find(*i) == completedEdges.end()*/) {
-            completed = true;
-            completedEdges.insert(*i);
-            nextPar = (*i)->get_from();
-        }
-
-        else if (completedEdges.find(*i) == completedEdges.end() && completed == false) {
-            completed = true;
-            nextPar = (*i)->get_from();
-            completedEdges.insert(*i);
-        }
-
-        else if (completedEdges.find(*i) != completedEdges.end() && computedNodes.find((*i)->get_from()) == computedNodes.end() && completed == false /*&& nullEdgesOrdered.find(*i) == nullEdgesOrdered.end()*/) {
-            completeNull = true;
-            std::pair<SgGraphNode*, SgGraphNode*> lpp;
-            nextPar = n;
-            nullEdgesOrdered.insert(*i);
-            nullEdgesPaths++;
-            
-        }
-    }
-    ROSE_ASSERT(completed == true || completeNull == true);
-    std::pair<bool, SgGraphNode*> pr;
-    pr.first = completed;
-    pr.second = nextPar;
-
-    if (completeNull == true && completed == false) {
-        pr.first = completeNull;
-        pr.second = nextPar;
-    }
-   
-    return pr;
-}
- 
-    
-
-
-
-
-
-
- 
-    
-
-  
-        
-    
-            
diff --git a/src/midend/astProcessing/graphTemplate.h b/src/midend/astProcessing/graphTemplate.h
deleted file mode 100644
index e3075618ffb..00000000000
--- a/src/midend/astProcessing/graphTemplate.h
+++ /dev/null
@@ -1,533 +0,0 @@
-#ifndef BACKSTROKE_CFG_H
-#define BACKSTROKE_CFG_H
-
-
-#include <rose.h>
-#include <boost/graph/adjacency_list.hpp>
-#include <boost/bind.hpp>
-#include <boost/foreach.hpp>
-#include <boost/tuple/tuple.hpp>
-#include <boost/graph/graphviz.hpp>
-#include <boost/graph/dominator_tree.hpp>
-#include <boost/graph/reverse_graph.hpp>
-#include <boost/graph/transpose_graph.hpp>
-#include <boost/algorithm/string.hpp>
-
-
-namespace Backstroke
-{
-
-#define foreach BOOST_FOREACH
-
-
-//! This function helps to write the DOT file for vertices.
-template <class CFGNodeType>
-void writeCFGNode(std::ostream& out, const CFGNodeType& cfgNode)
-{
-        SgNode* node = cfgNode.getNode();
-        ROSE_ASSERT(node);
-
-        std::string nodeColor = "black";
-        if (isSgStatement(node))
-                nodeColor = "blue";
-        else if (isSgExpression(node))
-                nodeColor = "green";
-        else if (isSgInitializedName(node))
-                nodeColor = "red";
-
-        std::string label;
-
-        if (SgFunctionDefinition* funcDef = isSgFunctionDefinition(node))
-        {
-                std::string funcName = funcDef->get_declaration()->get_name().str();
-                if (cfgNode.getIndex() == 0)
-                        label = "Entry\\n" + funcName;
-                else if (cfgNode.getIndex() == 3)
-                        label = "Exit\\n" + funcName;
-        }
-        
-        if (!isSgScopeStatement(node) && !isSgCaseOptionStmt(node) && !isSgDefaultOptionStmt(node))
-        {
-                std::string content = node->unparseToString();
-                boost::replace_all(content, "\"", "\\\"");
-                boost::replace_all(content, "\\n", "\\\\n");
-                label += content;
-        }
-    else
-                label += "<" + node->class_name() + ">";
-    
-    if (label == "")
-                label += "<" + node->class_name() + ">";
-        
-        out << "[label=\""  << label << "\", color=\"" << nodeColor <<
-                "\", style=\"" << (cfgNode.isInteresting()? "solid" : "dotted") << "\"]";
-}
-
-
-//! This function helps to write the DOT file for edges.
-template <class CFGEdgeType>
-void writeCFGEdge(std::ostream& out, const CFGEdgeType& e)
-{
-        out << "[label=\"" << escapeString(e.toString()) <<
-                "\", style=\"" << "solid" << "\"]";
-}
-
-
-// Predeclaration of class CFG.
-template <class CFGNodeFilter> class CFG;
-
-struct FullCFGNodeFilter
-{
-        bool operator()(const VirtualCFG::CFGNode& cfgNode) const
-        { return true; }
-};
-
-struct InterestingCFGNodeFilter
-{
-        bool operator()(const VirtualCFG::CFGNode& cfgNode) const
-        { return cfgNode.isInteresting(); }
-};
-
-//! A full CFG without any filtered nodes.
-typedef CFG<FullCFGNodeFilter> FullCFG;
-
-
-//! A filtered CFG which only contains interesting nodes and edges.
-typedef CFG<InterestingCFGNodeFilter> FilteredCFG;
-
-
-
-
-
-/********************************************************************/
-//      The concept required to be fulfilled by CFGNodeFilter is
-//
-//      struct CFGNodeFilter
-//      {
-//              bool operator()(const VirtualCFG::CFGNode& cfgNode) const;
-//      };
-//
-/********************************************************************/
-
-//! A class holding a Control Flow Graph.
-        
-template <class CFGNodeFilter>
-class CFG : public boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, 
-                boost::shared_ptr<VirtualCFG::FilteredCFGNode<CFGNodeFilter> >,
-                boost::shared_ptr<VirtualCFG::FilteredCFGEdge<CFGNodeFilter> > >
-{
-        typedef typename boost::graph_traits<CFG<CFGNodeFilter> > GraphTraits;
-
-public:
-    typedef VirtualCFG::FilteredCFGNode<CFGNodeFilter> CFGNodeType;
-        typedef VirtualCFG::FilteredCFGEdge<CFGNodeFilter> CFGEdgeType;
-
-        typedef boost::shared_ptr<CFGNodeType> CFGNodePtr;
-        typedef boost::shared_ptr<CFGEdgeType> CFGEdgePtr;
-
-    typedef typename GraphTraits::vertex_descriptor Vertex;
-        typedef typename GraphTraits::edge_descriptor Edge;
-
-        typedef std::map<Vertex, Vertex> VertexVertexMap;
-        //! The entry node.
-        Vertex entry_;
-
-        //! The exit node.
-        Vertex exit_;
-
-
-protected:
-
-        //! The function definition of this CFG.
-        SgFunctionDefinition* funcDef_;
-
-
-        //! A map from a CFG node to the corresponding vertex
-        std::map<CFGNodeType, Vertex> nodesToVertices_;
-
-    //! The dominator tree of this CFG.
-    VertexVertexMap dominatorTree_;
-
-    //! The postdominator tree of this CFG.
-    VertexVertexMap postdominatorTree_;
-
-public:
-        std::map<CFGNodeType, Vertex> getNodeVert() {
-            return nodesToVertices_;
-        }
-
-        //! The default constructor.
-        CFG()
-        :       funcDef_(NULL),
-                entry_(GraphTraits::null_vertex()),
-                exit_(GraphTraits::null_vertex())
-        {
-        }
-
-        //! The constructor building the CFG.
-        explicit CFG(SgFunctionDefinition* funcDef)
-        :       funcDef_(funcDef),
-                entry_(GraphTraits::null_vertex()),
-                exit_(GraphTraits::null_vertex())
-        {
-                build(funcDef);
-        }
-
-        //! Build the actual CFG for the given function.
-        void build(SgFunctionDefinition* funcDef);
-
-        //! Get the function definition of this CFG.
-        SgFunctionDefinition* getFunctionDefinition() const
-        { return funcDef_; }
-
-        //! Get the entry node of the CFG
-        const Vertex& getEntry() const
-        { return entry_; }
-
-        //! Get the exit node of the CFG
-        const Vertex& getExit() const
-        { return exit_; }
-
-        //! Build the dominator tree of this CFG.
-        //! @returns A map from each node to its immediate dominator.
-        const VertexVertexMap& getDominatorTree();
-
-        //! Build the postdominator tree of this CFG.
-        const VertexVertexMap& getPostdominatorTree();
-
-        //! Build a reverse CFG.
-        CFG<CFGNodeFilter> makeReverseCopy() const;
-
-        //! Output the graph to a DOT file.
-        void toDot(const std::string& filename) const;
-
-        //! Get all CFG nodes in this graph.
-        std::vector<CFGNodePtr> getAllNodes() const;
-
-        //! Get all CFG edges in this graph.
-        std::vector<CFGEdgePtr> getAllEdges() const;
-
-        //! Given a CFG node, returns the corresponding vertex in the graph.
-        //! Returns Vertex::null_vertex() if the given node is not in the graph
-        Vertex getVertexForNode(const CFGNodeType &node) const;
-
-    //! Return if this CFG is reducible (if all loops are natural loops, the
-    //! CFG is reducible).
-    bool isReducible() const { return true; }
-
-    //! Get all back edges in the CFG. A back edge is one whose target dominates its source.
-    std::vector<Edge> getAllBackEdges();
-
-    //! Get all loop headers in this CFG. A natural loop only has one header.
-    std::vector<Vertex> getAllLoopHeaders();
-
-protected:
-
-        //! A internal funtion which builds the actual CFG (boost::graph).
-        void buildCFG(const CFGNodeType& node,
-                        std::map<CFGNodeType, Vertex>& nodesAdded,
-                        std::set<CFGNodeType>& nodesProcessed);
-
-        //! Find the entry and exit of this CFG and set the corresponding members.
-        void setEntryAndExit();
-
-        //! This function helps to write the DOT file for vertices.
-        void writeGraphNode(std::ostream& out, const Vertex& node) const
-        {
-                writeCFGNode(out, *(*this)[node]);
-                //VirtualCFG::printNode(out, (*this)[node]);
-        }
-
-        //! This function helps to write the DOT file for edges.
-        void writeGraphEdge(std::ostream& out, const Edge& edge) const
-        {
-                writeCFGEdge(out, *(*this)[edge]);
-                //VirtualCFG::printEdge(out, (*this)[edge], true);
-        }
-
-        //! This class is used to copy vertices when calling copy_graph().
-        struct VertexCopier
-        {
-                VertexCopier(const CFG<CFGNodeFilter>& g1, CFG<CFGNodeFilter>& g2)
-                : cfg1(g1), cfg2(g2) {}
-
-                void operator()(const Vertex& v1, Vertex& v2) const
-                { cfg2[v2] = cfg1[v1]; }
-                
-                const CFG<CFGNodeFilter>& cfg1;
-                CFG<CFGNodeFilter>& cfg2;
-        };
-
-        //! This class is used to copy edges when calling copy_graph().
-        struct EdgeCopier
-        {
-                EdgeCopier(const CFG<CFGNodeFilter>& g1, CFG<CFGNodeFilter>& g2)
-                : cfg1(g1), cfg2(g2) {}
-
-                void operator()(const Edge& e1, Edge& e2) const
-                { cfg2[e2] = cfg1[e1]; }
-
-                const CFG<CFGNodeFilter>& cfg1;
-                CFG<CFGNodeFilter>& cfg2;
-        };
-};
-
-
-
-template <class CFGNodeFilter>
-void CFG<CFGNodeFilter>::toDot(const std::string& filename) const
-{
-        std::ofstream ofile(filename.c_str(), std::ios::out);
-        boost::write_graphviz(ofile, *this,
-                        boost::bind(&CFG<CFGNodeFilter>::writeGraphNode, this, ::_1, ::_2),
-                        boost::bind(&CFG<CFGNodeFilter>::writeGraphEdge, this, ::_1, ::_2));
-}
-
-template <class CFGNodeFilter>
-void CFG<CFGNodeFilter>::build(SgFunctionDefinition* funcDef)
-{
-        ROSE_ASSERT(funcDef);
-        funcDef_ = funcDef;
-
-        // The following two variables are used to record the nodes traversed.
-        nodesToVertices_.clear();
-        std::set<CFGNodeType> nodesProcessed;
-
-        // Remove all nodes and edges first.
-        this->clear();
-        entry_ = GraphTraits::null_vertex();
-        exit_ = GraphTraits::null_vertex();
-
-        buildCFG(CFGNodeType(funcDef->cfgForBeginning()), nodesToVertices_, nodesProcessed);
-
-        // Find the entry and exit of this CFG.
-        setEntryAndExit();
-
-        ROSE_ASSERT(isSgFunctionDefinition((*this)[entry_]->getNode()));
-        ROSE_ASSERT(isSgFunctionDefinition((*this)[exit_]->getNode()));
-}
-
-template <class CFGNodeFilter>
-void CFG<CFGNodeFilter>::setEntryAndExit()
-{
-    foreach (Vertex v, boost::vertices(*this))
-        {
-                CFGNodePtr node = (*this)[v];
-                if (isSgFunctionDefinition(node->getNode()))
-                {
-                        if (node->getIndex() == 0)
-                                entry_ = v;
-                        else if (node->getIndex() == 3)
-                                exit_ = v;
-                }
-        }
-
-        //In graphs with an infinite loop, we might never get to the end vertex
-        //In those cases, we need to add it explicitly
-        if (exit_ == GraphTraits::null_vertex())
-        {
-                std::cerr << "This function may contain an infinite loop "
-                                "inside so that its CFG cannot be built" << std::endl;
-                exit_ = add_vertex(*this);
-                (*this)[exit_] = CFGNodePtr(new CFGNodeType(funcDef_->cfgForEnd()));
-        }
-
-        ROSE_ASSERT(entry_ != GraphTraits::null_vertex());
-        ROSE_ASSERT(exit_ != GraphTraits::null_vertex());
-}
-
-template <class CFGNodeFilter>
-void CFG<CFGNodeFilter>::buildCFG(
-                const CFGNodeType& node,
-                std::map<CFGNodeType, Vertex>& nodesAdded,
-                std::set<CFGNodeType>& nodesProcessed)
-{
-        ROSE_ASSERT(node.getNode());
-
-        if (nodesProcessed.count(node) > 0)
-                return;
-        nodesProcessed.insert(node);
-
-        typename std::map<CFGNodeType, Vertex>::iterator iter;
-        bool inserted;
-        Vertex from, to;
-
-        // Add the source node.
-        const CFGNodeType& src = node;
-        ROSE_ASSERT(src.getNode());
-
-        boost::tie(iter, inserted) = nodesAdded.insert(std::make_pair(src, Vertex()));
-
-        if (inserted)
-        {
-                from = add_vertex(*this);
-                (*this)[from] = CFGNodePtr(new CFGNodeType(src));
-                iter->second = from;
-        }
-        else
-        {
-                from = iter->second;
-        }
-
-        std::vector<CFGEdgeType> outEdges = node.outEdges();
-
-        foreach(const CFGEdgeType& cfgEdge, outEdges)
-        {
-                // For each out edge, add the target node.
-                CFGNodeType tar = cfgEdge.target();
-                ROSE_ASSERT(tar.getNode());
-
-                boost::tie(iter, inserted) = nodesAdded.insert(std::make_pair(tar, Vertex()));
-
-                if (inserted)
-                {
-                        to = add_vertex(*this);
-                        (*this)[to] = CFGNodePtr(new CFGNodeType(tar));
-                        iter->second = to;
-                }
-                else
-                {
-                        to = iter->second;
-                }
-
-                // Add the edge.
-                Edge edge = add_edge(from, to, *this).first;
-                (*this)[edge] = CFGEdgePtr(new CFGEdgeType(cfgEdge));
-
-                // Build the CFG recursively.
-                buildCFG(tar, nodesAdded, nodesProcessed);
-        }
-}
-
-template <class CFGNodeFilter>
-const typename CFG<CFGNodeFilter>::VertexVertexMap& CFG<CFGNodeFilter>::getDominatorTree()
-{
-    if (!dominatorTree_.empty())
-        return dominatorTree_;
-
-        boost::associative_property_map<VertexVertexMap> domTreePredMap(dominatorTree_);
-
-        // Here we use the algorithm in boost::graph to build a map from each node to its immediate dominator.
-        boost::lengauer_tarjan_dominator_tree(*this, entry_, domTreePredMap);
-        return dominatorTree_;
-}
-
-template <class CFGNodeFilter>
-const typename CFG<CFGNodeFilter>::VertexVertexMap& CFG<CFGNodeFilter>::getPostdominatorTree()
-{
-    if (!postdominatorTree_.empty())
-        return postdominatorTree_;
-    
-        boost::associative_property_map<VertexVertexMap> postdomTreePredMap(postdominatorTree_);
-
-        // Here we use the algorithm in boost::graph to build an map from each node to its immediate dominator.
-        boost::lengauer_tarjan_dominator_tree(boost::make_reverse_graph(*this), exit_, postdomTreePredMap);
-        return postdominatorTree_;
-}
-
-template <class CFGNodeFilter>
-CFG<CFGNodeFilter> CFG<CFGNodeFilter>::makeReverseCopy() const
-{
-        CFG<CFGNodeFilter> reverseCFG;
-        // The following function makes a reverse CFG copy.
-        boost::transpose_graph(*this, reverseCFG, 
-                boost::vertex_copy(VertexCopier(*this, reverseCFG)).
-                edge_copy(EdgeCopier(*this, reverseCFG)));
-
-        // Swap entry and exit.
-        reverseCFG.entry_ = this->exit_;
-        reverseCFG.exit_ = this->entry_;
-        return reverseCFG;
-}
-
-
-template <class CFGNodeFilter>
-std::vector<typename CFG<CFGNodeFilter>::CFGNodePtr>
-CFG<CFGNodeFilter>::getAllNodes() const
-{
-        std::vector<CFGNodePtr> allNodes;
-    foreach (Vertex v, boost::vertices(*this))
-                allNodes.push_back((*this)[v]);
-        return allNodes;
-}
-
-/*
-template <class CFGNodeFilter>
-std::vector<typename CFG<CFGNodeFilter>::CFGNodeType>
-CFG<CFGNodeFilter>::getAllNodesNoPtrs() const
-{
-        std::vector<CFGNodeType> allNodes;
-    foreach (Vertex v, boost::vertices(*this))
-                allNodes.push_back(&((*this)[v]));
-        return allNodes;
-}
-*/
-
-template <class CFGNodeFilter>
-std::vector<typename CFG<CFGNodeFilter>::CFGEdgePtr>
-CFG<CFGNodeFilter>::getAllEdges() const
-{
-        std::vector<CFGEdgePtr> allEdges;
-    foreach (const Edge& e, boost::edges(*this))
-                allEdges.push_back((*this)[e]);
-        return allEdges;
-}
-
-template <class CFGNodeFilter>
-typename CFG<CFGNodeFilter>::Vertex CFG<CFGNodeFilter>::getVertexForNode(const CFGNodeType &node) const
-{
-        typename std::map<CFGNodeType, Vertex>::const_iterator vertexIter = nodesToVertices_.find(node);
-        if (vertexIter == nodesToVertices_.end())
-                return GraphTraits::null_vertex();
-        else
-        {
-                ROSE_ASSERT(*(*this)[vertexIter->second] == node);
-                return vertexIter->second;
-        }
-}
-
-template <class CFGNodeFilter>
-std::vector<typename CFG<CFGNodeFilter>::Edge> CFG<CFGNodeFilter>::getAllBackEdges()
-{
-    std::vector<Edge> backEdges;
-
-    // If the dominator tree is not built yet, build it now.
-    getDominatorTree();
-
-    foreach (const Edge& e, boost::edges(*this))
-    {
-        Vertex src = boost::source(e, *this);
-        Vertex tar = boost::target(e, *this);
-
-        //Vertex v = *(dominatorTree.find(src));
-        typename VertexVertexMap::const_iterator iter = dominatorTree_.find(src);
-        while (iter != dominatorTree_.end())
-        {
-            if (iter->second == tar)
-            {
-                backEdges.push_back(e);
-                break; // break the while loop
-            }
-            iter = dominatorTree_.find(iter->second);
-        }
-    }
-
-    return backEdges;
-}
-
-template <class CFGNodeFilter>
-std::vector<typename CFG<CFGNodeFilter>::Vertex> CFG<CFGNodeFilter>::getAllLoopHeaders()
-{
-    std::vector<Edge> backEdges = getAllBackEdges();
-    std::vector<Vertex> headers;
-    foreach (Edge e, backEdges)
-        headers.push_back(boost::target(e, *this));
-    return headers;
-}
-
-#undef foreach
-
-} // End of namespace Backstroke
-
-
-#endif  /* BACKSTROKE_CFG_H */
diff --git a/tests/nonsmoke/functional/roseTests/CMakeLists.txt b/tests/nonsmoke/functional/roseTests/CMakeLists.txt
index 535c285e2f5..5c444e94781 100644
--- a/tests/nonsmoke/functional/roseTests/CMakeLists.txt
+++ b/tests/nonsmoke/functional/roseTests/CMakeLists.txt
@@ -4,7 +4,7 @@
 if(enable-c)
   add_subdirectory (astMergeTests)
   add_subdirectory (astPerformanceTests)
-  add_subdirectory (astProcessingTests)
+  #add_subdirectory (astProcessingTests)
   add_subdirectory (astQueryTests)
   add_subdirectory (astSymbolTableTests)
   add_subdirectory (astTokenStreamTests)
diff --git a/tests/nonsmoke/functional/roseTests/astProcessingTests/CMakeLists.txt b/tests/nonsmoke/functional/roseTests/astProcessingTests/CMakeLists.txt
index 53fb6e8172f..2c9f27c3634 100644
--- a/tests/nonsmoke/functional/roseTests/astProcessingTests/CMakeLists.txt
+++ b/tests/nonsmoke/functional/roseTests/astProcessingTests/CMakeLists.txt
@@ -161,18 +161,18 @@ if (HAVE_SYS_TIME_H)
   endforeach()
 
   #-----------------------------------------------------------------------------
-  add_executable(processnew3Down4SgIncGraph3 processnew3Down4SgIncGraph3.C)
-  target_link_libraries(processnew3Down4SgIncGraph3
-    ROSE_DLL EDG ${link_with_libraries})
-  set(processnew3Down4SgIncGraph3_SPECIMENS test11.C test12.C test13.C test14.C)
-
-  set(processnew3Down4SgIncGraph3_SPECIMENS eif.C eif2.C eif3.C eif4.C)
-  foreach(specimen ${processnew3Down4SgIncGraph3_SPECIMENS})
-    add_test(
-      NAME pnew2_${specimen}
-      COMMAND processnew3Down4SgIncGraph3 ${CMAKE_CURRENT_SOURCE_DIR}/${specimen}
-    )
-  endforeach()
+  #add_executable(processnew3Down4SgIncGraph3 processnew3Down4SgIncGraph3.C)
+  #target_link_libraries(processnew3Down4SgIncGraph3
+  #  ROSE_DLL EDG ${link_with_libraries})
+  #set(processnew3Down4SgIncGraph3_SPECIMENS test11.C test12.C test13.C test14.C)
+
+  #set(processnew3Down4SgIncGraph3_SPECIMENS eif.C eif2.C eif3.C eif4.C)
+  #foreach(specimen ${processnew3Down4SgIncGraph3_SPECIMENS})
+  #  add_test(
+  #    NAME pnew2_${specimen}
+  #    COMMAND processnew3Down4SgIncGraph3 ${CMAKE_CURRENT_SOURCE_DIR}/${specimen}
+  #  )
+  #endforeach()
 
   if (enable-binary-analysis)
     #---------------------------------------------------------------------------

From 2d3bf16db4df4afe44c50a95eff15e12e7b03e71 Mon Sep 17 00:00:00 2001
From: Patrick Flynn <pflynn157@gmail.com>
Date: Tue, 26 Sep 2023 10:15:15 -0400
Subject: [PATCH 13/42] Revert "Removed potentially dead midend code"

This reverts commit f9e8ad7bd34ea0db3daee2a3cb315b7a3608ec8f.
---
 src/midend/astProcessing/CMakeLists.txt       |    7 +-
 src/midend/astProcessing/SgGraphTemplate.h    |  201 ++
 src/midend/astProcessing/graphProcessing.h    | 1560 ++++++++++++++
 .../astProcessing/graphProcessingSgIncGraph.h | 1865 +++++++++++++++++
 src/midend/astProcessing/graphTemplate.h      |  533 +++++
 .../functional/roseTests/CMakeLists.txt       |    2 +-
 .../astProcessingTests/CMakeLists.txt         |   24 +-
 7 files changed, 4174 insertions(+), 18 deletions(-)
 create mode 100644 src/midend/astProcessing/SgGraphTemplate.h
 create mode 100644 src/midend/astProcessing/graphProcessing.h
 create mode 100644 src/midend/astProcessing/graphProcessingSgIncGraph.h
 create mode 100644 src/midend/astProcessing/graphTemplate.h

diff --git a/src/midend/astProcessing/CMakeLists.txt b/src/midend/astProcessing/CMakeLists.txt
index ec4582f4c22..075c79f514e 100644
--- a/src/midend/astProcessing/CMakeLists.txt
+++ b/src/midend/astProcessing/CMakeLists.txt
@@ -32,13 +32,10 @@ set(files_to_install
   AstReverseSimpleProcessing.h AstRestructure.h AstClearVisitFlags.h
   AstTraversal.h AstCombinedProcessing.h AstCombinedProcessingImpl.h
   AstCombinedSimpleProcessing.h StackFrameVector.h
-  #graphProcessing.h
-  #graphProcessingSgIncGraph.h
-  #graphTemplate.h
+  graphProcessing.h graphProcessingSgIncGraph.h graphTemplate.h
   AstSharedMemoryParallelProcessing.h AstSharedMemoryParallelProcessingImpl.h
   AstSharedMemoryParallelSimpleProcessing.h
-  #SgGraphTemplate.h
-  TreeTraversal.h)
+  SgGraphTemplate.h TreeTraversal.h)
 
 if(NOT WIN32)
   #tps commented out AstSharedMemoryParallelProcessing.h for Windows
diff --git a/src/midend/astProcessing/SgGraphTemplate.h b/src/midend/astProcessing/SgGraphTemplate.h
new file mode 100644
index 00000000000..9429026a6b4
--- /dev/null
+++ b/src/midend/astProcessing/SgGraphTemplate.h
@@ -0,0 +1,201 @@
+#include <boost/graph/adjacency_list.hpp>
+#include <boost/graph/astar_search.hpp>
+//#include <graphProcessing.h>
+#include <staticCFG.h>
+#include <interproceduralCFG.h>
+#include <rose.h>
+struct Vertex{
+    SgGraphNode* sg;
+    CFGNode cfgnd;
+};
+
+struct Edge {
+    SgDirectedGraphEdge* gedge;
+};
+
+typedef boost::adjacency_list<
+        boost::vecS,
+        boost::vecS,
+        boost::bidirectionalS,
+        Vertex,
+        Edge
+> myGraph;
+
+typedef myGraph::vertex_descriptor VertexID;
+typedef myGraph::edge_descriptor EdgeID;
+
+//myGraph* instantiateGraph(SgIncidencedDirectedGraph* g, StaticCFG::CFG cfg);
+std::pair<std::vector<SgGraphNode*>, std::vector<SgDirectedGraphEdge*> > getAllNodesAndEdges(SgIncidenceDirectedGraph* g, SgGraphNode* start);
+std::map<VertexID, SgGraphNode*> getGraphNode;
+std::map<SgGraphNode*, VertexID> VSlink;
+
+myGraph* instantiateGraph(SgIncidenceDirectedGraph*& g, StaticCFG::InterproceduralCFG& cfg, SgNode* pstart) {
+    //SgNode* prestart = cfg.getEntry();
+    //cfg.buildFullCFG();
+    CFGNode startN = cfg.getEntry();
+    SgGraphNode* start = cfg.toGraphNode(startN);
+    ROSE_ASSERT(startN != NULL);
+    ROSE_ASSERT(start != NULL);
+    myGraph* graph = new myGraph;
+    //std::map<SgGraphNode*, VertexID> VSlink;
+    std::pair<std::vector<SgGraphNode*>, std::vector<SgDirectedGraphEdge*> > alledsnds = getAllNodesAndEdges(g, start);
+    std::vector<SgGraphNode*> nods = alledsnds.first;
+    std::vector<SgDirectedGraphEdge*> eds = alledsnds.second;
+    std::set<std::pair<VertexID, VertexID> > prs;
+    //for (std::vector<vertex_descriptor> i = nods.begin(); i != nods.end(); i++) {
+    //    VertexID vID = boost::add_vertex(graph);
+    //    graph[vID].cfgnd = cfg->toCFGNode(*i);
+    //}
+    for (std::vector<SgDirectedGraphEdge*>::iterator j = eds.begin(); j != eds.end(); j++) {
+        SgDirectedGraphEdge* u = *j;
+        SgGraphNode* u1 = u->get_from();
+        SgGraphNode* u2 = u->get_to();
+        VertexID v1;
+        VertexID v2;
+        if (VSlink.find(u1) == VSlink.end()) {
+            v1 = boost::add_vertex(*graph);
+            getGraphNode[v1] = u1;
+            VSlink[u1] = v1;
+            (*graph)[v1].sg = u1;
+            (*graph)[v1].cfgnd = cfg.toCFGNode(u1);
+        }
+        else {
+            v1 = VSlink[u1];
+        }
+        if (VSlink.find(u2) != VSlink.end()) {
+            v2 = VSlink[u2];
+        }
+        else {
+            v2 = boost::add_vertex(*graph);
+            VSlink[u2] = v2;
+            (*graph)[v2].sg = u2;
+            getGraphNode[v2] = u2;
+            (*graph)[v2].cfgnd = cfg.toCFGNode(u2);
+        }
+        bool ok;
+        EdgeID uE;
+        std::pair<VertexID, VertexID> pr;
+        pr.first = v1;
+        pr.second = v2;
+        if (prs.find(pr) == prs.end()) {
+            prs.insert(pr);
+            boost::tie(uE, ok) = boost::add_edge(v1, v2, *graph);
+        }
+    }
+    //std::cout << "prs.size: " << prs.size() << std::endl;
+    return graph;
+}
+
+
+
+myGraph* instantiateGraph(SgIncidenceDirectedGraph*& g, StaticCFG::CFG& cfg) {
+    SgGraphNode* start = cfg.getEntry();
+    myGraph* graph = new myGraph;
+    //std::map<SgGraphNode*, VertexID> VSlink;
+    std::pair<std::vector<SgGraphNode*>, std::vector<SgDirectedGraphEdge*> > alledsnds = getAllNodesAndEdges(g, start);
+    std::vector<SgGraphNode*> nods = alledsnds.first;
+    std::vector<SgDirectedGraphEdge*> eds = alledsnds.second;
+    std::set<std::pair<VertexID, VertexID> > prs;
+    //for (std::vector<vertex_descriptor> i = nods.begin(); i != nods.end(); i++) {
+    //    VertexID vID = boost::add_vertex(graph);
+    //    graph[vID].cfgnd = cfg->toCFGNode(*i);
+    //}
+    for (std::vector<SgDirectedGraphEdge*>::iterator j = eds.begin(); j != eds.end(); j++) {
+        SgDirectedGraphEdge* u = *j;
+        SgGraphNode* u1 = u->get_from();
+        SgGraphNode* u2 = u->get_to();
+        VertexID v1;
+        VertexID v2;
+        if (VSlink.find(u1) == VSlink.end()) {
+            v1 = boost::add_vertex(*graph);
+            getGraphNode[v1] = u1;
+            VSlink[u1] = v1;
+            (*graph)[v1].sg = u1;
+            (*graph)[v1].cfgnd = cfg.toCFGNode(u1);
+        }
+        else {
+            v1 = VSlink[u1];
+        }
+        if (VSlink.find(u2) != VSlink.end()) {
+            v2 = VSlink[u2];
+        }
+        else {
+            v2 = boost::add_vertex(*graph);
+            VSlink[u2] = v2;
+            (*graph)[v2].sg = u2;
+            getGraphNode[v2] = u2;
+            (*graph)[v2].cfgnd = cfg.toCFGNode(u2);
+        }
+        bool ok;
+        EdgeID uE;
+        std::pair<VertexID, VertexID> pr;
+        pr.first = v1;
+        pr.second = v2;
+        if (prs.find(pr) == prs.end()) {
+            prs.insert(pr);
+            boost::tie(uE, ok) = boost::add_edge(v1, v2, *graph);
+        }
+    }
+    //std::cout << "prs.size: " << prs.size() << std::endl;
+    return graph;
+}
+
+
+    
+            
+std::pair<std::vector<SgGraphNode*>, std::vector<SgDirectedGraphEdge*> > getAllNodesAndEdges(SgIncidenceDirectedGraph* g, SgGraphNode* start) {
+    //for (int i = 0; i < starts.size(); i++) {
+    SgGraphNode* n = start;
+    std::vector<SgGraphNode*> nods;
+    std::vector<SgGraphNode*> newnods;
+    std::set<SgDirectedGraphEdge*> edsnew;
+    std::vector<SgDirectedGraphEdge*> eds;
+    std::vector<SgDirectedGraphEdge*> feds;
+    std::vector<SgGraphNode*> fnods;
+    std::set<std::pair<EdgeID, EdgeID> > prs;
+    std::set<SgDirectedGraphEdge*> oeds = g->computeEdgeSetOut(start);
+    fnods.push_back(start);
+    newnods.push_back(n);
+    
+    while (oeds.size() > 0) {
+        for (std::set<SgDirectedGraphEdge*>::iterator j = oeds.begin(); j != oeds.end(); j++) {
+            //if (find(eds.begin(), eds.end(), *j) == eds.end()) {
+                if (find(feds.begin(), feds.end(), *j) == feds.end()) {
+                    feds.push_back(*j);
+                    edsnew.insert(*j);
+                }
+                if (find(fnods.begin(), fnods.end(), (*j)->get_to()) == fnods.end()) {
+                    fnods.push_back((*j)->get_to());
+                }
+                newnods.push_back((*j)->get_to());
+            //}
+        }
+        
+        for (unsigned int i = 0; i < newnods.size(); i++) {
+           std::set<SgDirectedGraphEdge*> oedsp = g->computeEdgeSetOut(newnods[i]);
+           for (std::set<SgDirectedGraphEdge*>::iterator j = oedsp.begin(); j != oedsp.end(); j++) {
+               if (find(feds.begin(), feds.end(), *j) == feds.end()) {
+              //    feds.push_back(*j);
+                  edsnew.insert(*j);
+                  
+               }
+               //if (find(fnods.begin(), fnods.end(), (*j)->get_to()) == fnods.end()) {
+               //    fnods.push_back((*j)->get_to());
+               //    newnods.push_back((*j)->get_to());
+              // }
+    //           newnods.push_back((*j)->get_to());
+           }
+        }
+        nods = newnods;
+        oeds = edsnew;
+        edsnew.clear();
+        newnods.clear();
+    }
+    std::pair<std::vector<SgGraphNode*>, std::vector<SgDirectedGraphEdge*> > retpr;
+    retpr.first = fnods;
+    retpr.second = feds;
+    //std::cout << "fnods.size()" << fnods.size() << std::endl;
+    //std::cout << "feds.size()" << feds.size() << std::endl;
+    return retpr;
+}
+         
diff --git a/src/midend/astProcessing/graphProcessing.h b/src/midend/astProcessing/graphProcessing.h
new file mode 100644
index 00000000000..07cdbd35235
--- /dev/null
+++ b/src/midend/astProcessing/graphProcessing.h
@@ -0,0 +1,1560 @@
+/*
+
+FINISH TEMPFLATPATH CODE
+
+AS WRITTEN, THESE FUNCTIONS WILL ONLY WORK WITH GRAPHS THAT ARE IMPLEMENTED IN THE boost NAMESPACE.
+
+*/
+
+
+
+
+#define LP 1
+#define PERFDEBUG 0
+//#define FULLDEBUG 1
+#ifdef _OPENMP
+#include <omp.h>
+#endif
+#include <boost/regex.hpp>
+#include <iostream>
+#include <fstream>
+#include <string>
+#include <assert.h>
+#include <staticCFG.h>
+
+/**
+*@file graphProcessing.h
+
+*Brief Overview of Algorithm:
+
+***********************
+*Current Implementation
+***********************
+
+*This implementation uses BOOSTs graph structure to analyze the paths of the graph
+
+*The path analyzer sends the user paths to be evaluated by the "analyzePath" function that is user defined
+
+**************************
+*Further Improvements: TODO
+**************************
+
+@todo utilize BOOST visitors to take advantage of the BOOST graph structures abilities
+
+***************
+*Contact Info
+***************
+
+*Finally, blame can be assigned to and questions can be forwarded to the author, though response is not guaranteed
+
+*if I'm still at Lawrence
+*hoffman34 AT llnl DOT gov
+*@author Michael Hoffman
+*/
+
+
+#include <boost/graph/adjacency_list.hpp>
+#include <boost/bind.hpp>
+#include <boost/foreach.hpp>
+#include <boost/tuple/tuple.hpp>
+#include <boost/graph/graphviz.hpp>
+#include <boost/graph/dominator_tree.hpp>
+#include <boost/graph/reverse_graph.hpp>
+#include <boost/graph/transpose_graph.hpp>
+#include <boost/algorithm/string.hpp>
+
+
+
+#include <vector>
+#include <algorithm>
+#include <utility>
+#include <iostream>
+#include <sys/time.h>
+#include <sys/resource.h>
+#include <sys/time.h>
+
+
+
+
+
+
+template <class CFG>
+class SgGraphTraversal
+{
+public:
+
+  typedef typename boost::graph_traits<CFG>::vertex_descriptor Vertex;
+    typedef typename boost::graph_traits<CFG>:: edge_descriptor Edge;
+
+   void constructPathAnalyzer(CFG* g, bool unbounded=false, Vertex end=0, Vertex begin=0, bool ns = true);
+   virtual void analyzePath(std::vector<Vertex>& pth) = 0;
+    std::vector<int> getInEdges(int& node, CFG*& g);
+    std::vector<int> getOutEdges(int& node, CFG*& g);
+    int getTarget(int& n, CFG*& g);
+    int getSource(int& n, CFG*& g);
+    std::map<Vertex, int> vertintmap;
+    std::map<Edge, int> edgeintmap;
+    std::map<int, Vertex> intvertmap;
+    std::map<int, Edge> intedgemap;
+   SgGraphTraversal();
+    virtual ~SgGraphTraversal();
+   SgGraphTraversal( SgGraphTraversal &);
+    SgGraphTraversal &operator=( SgGraphTraversal &);
+   int pathnum;
+
+
+  void firstPrepGraph(CFG*& g);
+
+private:
+
+    int normals;
+    int abnormals;
+    bool needssafety;
+    int recursed;
+    int checkedfound;
+ //   typedef typename boost::graph_traits<CFG>::vertex_descriptor Vertex;
+ //   typedef typename boost::graph_traits<CFG>:: edge_descriptor Edge;
+   // std::vector<int> getInEdges(int& node, CFG*& g);
+   // std::vector<int> getOutEdges(int& node, CFG*& g);
+    void prepareGraph(CFG*& g);
+    void findClosuresAndMarkersAndEnumerate(CFG*& g);
+  //  void constructPathAnalyzer(CFG* g, bool unbounded=false, Vertex end=0, Vertex begin=0, bool ns = true);
+  //  virtual void analyzePath(std::vector<Vertex>& pth) = 0;
+  //  void firstPrepGraph(CFG*& g);
+    int stoppedpaths;
+    std::set<std::vector<int> >  traversePath(int begin, int end, CFG*& g, bool loop=false);
+    std::set<std::vector<int> > uTraversePath(int begin, int end, CFG*& g, bool loop, std::map<int, std::vector<std::vector<int> > >& localLoops);
+    std::vector<std::vector<int> > bfsTraversePath(int begin, int end, CFG*& g, bool loop=false);
+    std::vector<int> unzipPath(std::vector<int>&  path, CFG*& g, int start, int end);
+    std::vector<int>  zipPath(std::vector<int>& path, CFG*& g, int start, int end);
+    std::vector<int> zipPath2(std::vector<int>& path, CFG*& g);
+    void printCFGNode(int& cf, std::ofstream& o);
+    void printCFGNodeGeneric(int& cf, std::string prop, std::ofstream& o);
+    void printCFGEdge(int& cf, CFG*& cfg, std::ofstream& o);
+    void printHotness(CFG*& g);
+    void printPathDot(CFG*& g);
+    void computeOrder(CFG*& g, const int& begin);
+    void computeSubGraphs(const int& begin, const int &end, CFG*& g, int depthDifferential);
+    //int getTarget(int& n, CFG*& g);
+    //int getSource(int& n, CFG*& g);
+    std::vector<int> sources;
+    std::vector<int> sinks;
+    std::vector<int>  recursiveLoops;
+    std::vector<int> recurses;
+    std::map<int, int> ptsNum;
+    bool borrowed;
+    std::set<int> badloop;
+    std::map<int, std::vector<std::vector<int> > >  totalLoops;
+//    int pathnum;
+    std::map<int, std::string> nodeStrings;
+    int sourcenum;
+    unsigned long long evaledpaths;
+    int badpaths;
+    int workingthreadnum;
+    bool workingthread;
+    std::map<int, std::set<std::vector<int> > > loopStore;
+    std::vector<std::vector<int> >  pathStore;
+    std::map<int, std::vector<int> > subpathglobal;
+    std::map<std::vector<int>, int> subpathglobalinv;
+    int nextsubpath;
+    std::vector<int>  orderOfNodes;
+//    std::map<Vertex, int> vertintmap;
+//    std::map<Edge, int> edgeintmap;
+//    std::map<int, Vertex> intvertmap;
+//    std::map<int, Edge> intedgemap;
+    std::vector<std::map<Vertex, Vertex> > SubGraphGraphMap;
+    std::vector<std::map<Vertex, Vertex> > GraphSubGraphMap;
+    std::vector<CFG*> subGraphVector;
+    void getVertexPath(std::vector<int> path, CFG*& g, std::vector<Vertex>& vertexPath );
+    void storeCompact(std::vector<int> path);
+    int nextNode;
+    int nextEdge;
+    std::vector<int> markers;
+    std::vector<int> closures;
+    std::map<int, int> markerIndex;
+    std::map<int, std::vector<int> > pathsAtMarkers;
+    typedef typename boost::graph_traits<CFG>::vertex_iterator vertex_iterator;
+    typedef typename boost::graph_traits<CFG>::out_edge_iterator out_edge_iterator;
+    typedef typename boost::graph_traits<CFG>::in_edge_iterator in_edge_iterator;
+    typedef typename boost::graph_traits<CFG>::edge_iterator edge_iterator;
+    bool bound;
+//    SgGraphTraversal();
+//    virtual ~SgGraphTraversal();
+//   SgGraphTraversal( SgGraphTraversal &);
+//    SgGraphTraversal &operator=( SgGraphTraversal &);
+
+
+};
+
+
+template<class CFG>
+SgGraphTraversal<CFG>::
+SgGraphTraversal()
+{
+}
+
+
+
+template<class CFG>
+SgGraphTraversal<CFG> &
+SgGraphTraversal<CFG>::
+operator=( SgGraphTraversal &other)
+{
+    return *this;
+}
+
+#ifndef SWIG
+
+template<class CFG>
+SgGraphTraversal<CFG>::
+~SgGraphTraversal()
+{
+}
+
+#endif
+
+/**
+    Gets the source of an edge
+    SgGraphTraversal::getSource
+    Input:
+    @param[edge] int& integer representation of edge in question
+    @param[g] CFG*& the CFG used
+*/
+template<class CFG>
+inline int
+SgGraphTraversal<CFG>::
+getSource(int& edge, CFG*& g)
+{
+    Edge e = intedgemap[edge];
+    Vertex v = boost::source(e, *g);
+    return(vertintmap[v]);
+}
+
+/**
+    Gets the target of an edge
+    SgGraphTraversal::getTarget
+    Input:
+    @param[edge] int& integer representation of edge in quesution
+    @param[g] the CFG*& CFG used
+*/
+
+
+template<class CFG>
+inline int
+SgGraphTraversal<CFG>::
+getTarget(int& edge, CFG*& g)
+{
+    Edge e = intedgemap[edge];
+    Vertex v = boost::target(e, *g);
+    return(vertintmap[v]);
+}
+
+/**
+Gets out edges with integer inputs, internal use only
+SgGraphTraversal::getInEdges
+Input:
+@param[node] int, integer representation of the node to get the in edges from
+@param[g] CFG* g, CFG
+*/
+
+template<class CFG>
+std::vector<int>
+SgGraphTraversal<CFG>::
+getInEdges(int& node, CFG*& g)
+{
+    Vertex getIns = intvertmap[node];
+    std::vector<int> inedges;
+ // DQ (4/11/2017): Fix Klockworks issue of uninitialized variables.
+#if 1
+    in_edge_iterator i, j;
+#else
+ // This does not compile.
+    in_edge_iterator i = inedges.begin();
+    in_edge_iterator j = i;
+#endif
+    for (boost::tie(i, j) = boost::in_edges(getIns, *g); i != j; ++i)
+    {
+        inedges.push_back(edgeintmap[*i]);
+    }
+    return inedges;
+}
+
+/**
+Gets out edges with integer inputs, internal use only
+SgGraphTraversal::getOutEdges
+Input:
+@param[node] int, integer representation of the node to get the out edges from
+@param[g] CFG* g, CFG
+*/
+
+
+
+template<class CFG>
+std::vector<int>
+SgGraphTraversal<CFG>::
+getOutEdges(int &node, CFG*& g)
+{
+    Vertex getOuts = intvertmap[node];
+    std::vector<int> outedges;
+ // DQ (4/11/2017): Fix Klockworks issue of uninitialized variables.
+#if 1
+    out_edge_iterator i, j;
+#else
+ // This does not compile.
+    out_edge_iterator i = outedges.begin();
+    out_edge_iterator j = i;
+#endif
+    for (boost::tie(i, j) = boost::out_edges(getOuts, *g); i != j; ++i)
+    {
+        outedges.push_back(edgeintmap[*i]);
+    }
+    return outedges;
+}
+
+/**
+Condenses paths, currently deprecated...
+Input:
+@param[pth] std::vector<int> the original path
+@param[g] CFG*, the ambient graph
+Output:
+zipped path
+*/
+
+template<class CFG>
+inline
+std::vector<int>
+SgGraphTraversal<CFG>::
+zipPath2(std::vector<int>& pth, CFG*& g) {
+    std::vector<int> npth;
+    npth.push_back(pth[0]);
+    for (int i = 1; i < pth.size()-1; i++) {
+       if (find(closures.begin(), closures.end(), pth[i]) != closures.end()) {
+           npth.push_back(pth[i]);
+       }
+    }
+    npth.push_back(pth.back());
+    return npth;
+}
+
+/**
+Condenses paths to simply the first and last node and the ordered set of edges
+taken at nodes with more than 1 outedge
+Input:
+@param[pth] std::vector<int>, the original path
+@param[g] CFG*, the ambient graph
+@param[start] integer representation of the first node
+@param[end] integer representation of the last node
+*/
+
+
+template<class CFG>
+std::vector<int>
+SgGraphTraversal<CFG>::
+zipPath(std::vector<int>& pth, CFG*& g, int start, int end) {
+                        std::vector<int> subpath;
+                        std::vector<int> movepath;
+                        movepath.push_back(pth.front());
+                        movepath.push_back(pth.back());
+                        for (unsigned int qw = 0; qw < pth.size()-1; qw++) {
+                           if (find(markers.begin(), markers.end(), pth[qw]) != markers.end()) {
+                               std::vector<int> oeds = getOutEdges(pth[qw], g);
+                               for (unsigned int i = 0; i < oeds.size(); i++) {
+                                   if (getTarget(oeds[i], g) == pth[qw+1]) {
+                                       movepath.push_back(oeds[i]);
+                                   }
+                               }
+                            }
+                         }
+                         return movepath;
+             }
+
+
+
+
+
+
+/**
+unzips the paths zipped by zipPath
+Input:
+@param[pzipped] the zipped path
+@param[CFG] the ambient graph
+@param[start] the integer representation of the first node (used to check that zipPath is working correctly)
+@param[end] the integer representation of the end node
+*/
+
+
+template<class CFG>
+std::vector<int>
+SgGraphTraversal<CFG>::
+unzipPath(std::vector<int>& pzipped, CFG*& g, int start, int end) {
+     ROSE_ASSERT(pzipped[0] == start && (pzipped[1] == end || end == -1));
+     std::vector<int> zipped;
+     for (unsigned int i = 2; i < pzipped.size(); i++) {
+         zipped.push_back(pzipped[i]);
+     }
+     std::vector<int> unzipped;
+     unzipped.push_back(start);
+     std::vector<int> oeds = getOutEdges(start, g);
+     if (oeds.size() == 0) {
+         return unzipped;
+     }
+     for (unsigned int i = 0; i < zipped.size(); i++) {
+         oeds = getOutEdges(unzipped.back(), g);
+         while (oeds.size() == 1) {
+             if (getTarget(oeds[0], g) == end && unzipped.size() != 1) {
+                  unzipped.push_back(end);
+                  return unzipped;
+             }
+             unzipped.push_back(getTarget(oeds[0], g));
+             oeds = getOutEdges(unzipped.back(), g);
+         }
+         if (oeds.size() == 0) {
+             return unzipped;
+         }
+         if (oeds.size() > 1 && (unzipped.back() != end || (unzipped.size() == 1 && unzipped.back() == end))) {
+             ROSE_ASSERT(getSource(zipped[i], g) == unzipped.back());
+             unzipped.push_back(getTarget(zipped[i], g));
+         }
+         
+     }
+     std::vector<int> oeds2 = getOutEdges(unzipped.back(), g);
+     if (unzipped.back() != end && oeds2.size() != 0) { 
+         while (oeds2.size() == 1 && unzipped.back() != end) {
+             unzipped.push_back(getTarget(oeds2[0], g));
+             oeds2 = getOutEdges(unzipped.back(), g);
+         }
+     }
+     return unzipped;
+}
+
+/*
+Example Time
+
+    Example:
+             timeval tim;
+             gettimeofday(&tim, NULL);
+             double t1=tim.tv_sec+(tim.tv_usec/1000000.0);
+             do_something_long();
+             gettimeofday(&tim, NULL);
+             double t2=tim.tv_sec+(tim.tv_usec/1000000.0);
+             printf("%.6lf seconds elapsed\n", t2-t1);
+
+*/
+
+/**
+The function responsible for collecting all paths without loops, and all paths within lops that do not include other loops
+then sending those to uTraverse to assemble them into all paths with any combination of loops
+Input:
+@param[begin] integer representation of the first node
+@param[end] integer representation of the last node (or -1 if its not bounded)
+@param[g] CFG*, the ambient CFG
+@param[loop] boolean expressing whether or not we are calculating paths contained within a loop
+*/
+
+
+template<class CFG>
+std::vector<std::vector<int> >
+SgGraphTraversal<CFG>::
+bfsTraversePath(int begin, int end, CFG*& g, bool loop) {
+//perfdebug allows for examining the speed of traversal
+    #ifdef PERFDEBUG
+    //timeval tim;
+    //gettimeofday(&tim, NULL);
+    //double tim1 = tim.tv_sec+(tim.tv_usec/1000000.0);
+    #endif
+    bool recursedloop = loop;
+    std::map<int, std::vector<std::vector<int> > > PtP;
+    std::set<int> nodes;
+    std::vector<std::vector<int> > pathContainer;
+    //std::vector<std::vector<int> > oldPaths;
+    std::vector<int> completedLoops;
+    std::vector<std::vector<int> > npc;
+    std::vector<int> bgpath;
+    bgpath.push_back(begin);
+    pathContainer.push_back(bgpath);
+    std::vector<std::vector<int> > newPathContainer; 
+    std::vector<std::vector<int> > paths;
+    std::vector<int> localLoops;
+    std::map<int, std::vector<std::vector<int> > > globalLoopPaths;
+     //std::cout << "at the while" << std::endl;
+//To keep
+     while (pathContainer.size() != 0 /*|| oldPaths.size() != 0*/) {
+/*
+       unsigned int mpc = 50000;
+       if (pathContainer.size() == 0) {
+           unsigned int mxl = 0; 
+           if (oldPaths.size() > mpc) {
+               mxl = mpc/2;
+           }
+           else {
+               mxl = oldPaths.size();
+           }
+           for (unsigned int k = 0; k < mxl; k++) {
+               pathContainer.push_back(oldPaths.back());
+               oldPaths.pop_back();
+           }
+       }
+       if (pathContainer.size() > mpc) {
+           unsigned int j = 0;
+           while (j < mpc) {
+                npc.push_back(pathContainer.back());
+                pathContainer.pop_back();
+                j++;
+           }
+           oldPaths.insert(oldPaths.end(), pathContainer.begin(), pathContainer.end());   
+           pathContainer = npc;
+           npc.clear();
+       }
+*/
+
+//iterating through the currently discovered subpaths to build them up
+       for (unsigned int i = 0; i < pathContainer.size(); i++) {
+       std::vector<int> npth = pathContainer[i];
+        std::vector<int> oeds = getOutEdges(npth.back(), g);
+        std::vector<int> ieds = getInEdges(npth.back(), g);
+ 
+        npth = pathContainer[i];
+        oeds = getOutEdges(npth.back(), g);
+
+        if ((!recursedloop && ((bound && npth.back() == end && npth.size() != 1) || (!bound && oeds.size() == 0))) || (recursedloop && npth.back() == end && npth.size() != 1)) {
+            std::vector<int> newpth;
+            newpth = (pathContainer[i]);
+             std::vector<int> movepath = newpth;//zipPath(newpth, g);
+             if (recursedloop && newpth.back() == end && newpth.size() != 1) {
+             paths.push_back(movepath);
+             }
+             else if (!recursedloop) {
+             if (bound && newpth.size() != 1 && newpth.back() == end) {
+             paths.push_back(movepath);
+             }
+             else if (!bound) {
+             paths.push_back(movepath);
+             }
+             }
+             
+        }
+        else {
+std::vector<int> oeds = getOutEdges(pathContainer[i].back(), g);
+
+        for (unsigned int j = 0; j < oeds.size(); j++) {
+
+
+int tg = getTarget(oeds[j], g);
+            
+
+            std::vector<int> newpath = (pathContainer[i]);
+           //we split up paths into pieces so that they don't take up a lot of memory, basically this is when we run into a path
+           //more than once, so we attach all paths that go to that path to that particular node via PtP
+            if (nodes.find(tg) != nodes.end() && find(newpath.begin(), newpath.end(), tg) == newpath.end() && tg != end) {
+                if (PtP.find(tg) == PtP.end()) {
+                    std::vector<int> nv;
+                    nv.push_back(tg);
+                    newPathContainer.push_back(nv);
+                    PtP[tg].push_back(/*zipPath(*(*/newpath);//, g, newpath.front(), newpath.back()));
+                }
+                else {
+                    PtP[tg].push_back(/*zipPath(*/newpath);//, g, newpath.front(), newpath.back()));
+                }
+            }
+            else if (find(newpath.begin(), newpath.end(), getTarget(oeds[j], g)) == newpath.end() || getTarget(oeds[j], g) == end) {
+                newpath.push_back(tg);
+                std::vector<int> ieds = getInEdges(tg, g);
+                if (ieds.size() > 1) {//find(closures.begin(), closures.end(), tg) != closures.end()) {
+                nodes.insert(tg);
+                }
+                newPathContainer.push_back(newpath);
+            }
+            else if (tg == end  && recursedloop) {
+                newpath.push_back(tg);
+                newPathContainer.push_back(newpath);
+            }
+            else {//if (find(newpath.begin(), newpath.end(), tg) != newpath.end() && tg != end) { 
+                std::vector<int> ieds = getInEdges(tg, g);
+                if (ieds.size() > 1/*find(closures.begin(), closures.end(), tg) != closures.end()*/ && find(completedLoops.begin(), completedLoops.end(), tg) == completedLoops.end() /*&& find(localLoops.begin(), localLoops.end(), tg) == localLoops.end()*/ && find(recurses.begin(), recurses.end(), tg) == recurses.end()) {
+                   localLoops.push_back(tg);
+                   nodes.insert(tg);
+                }
+               // else if (find(recurses.begin(), recurses.end(), tg) != recurses.end()) {
+               // }
+           }
+           //else {
+           //    std::cout << "problem" << std::endl;
+           //    ROSE_ASSERT(false);
+          // }
+        }
+        }
+        }
+        pathContainer = newPathContainer;
+        newPathContainer.clear();
+        }
+       // std::cout << "done while" << std::endl;
+        pathContainer.clear();
+    std::vector<std::vector<int> > finnpts;
+    std::vector<std::vector<int> > npts;
+    while (true) {
+        if (paths.size() > 1000000) {
+           std::cout << "too many paths, consider a subgraph" << std::endl;
+           ROSE_ABORT();
+       }
+       //#pragma omp parallel for schedule(guided)
+       for (unsigned int qq = 0; qq < paths.size(); qq++) {
+            std::vector<int> pq = paths[qq];
+            std::vector<int> qp;
+            int ppf = paths[qq].front();
+            if (PtP.find(ppf) != PtP.end()) {
+                for (unsigned int kk = 0; kk < PtP[ppf].size(); kk++) {
+                    std::vector<int> newpath = /*unzipPath(*/PtP[ppf][kk];//, g, PtP[ppf][kk][0], PtP[ppf][kk][1]);
+                    bool good = true;
+                    if (newpath.back() == newpath.front() && newpath.front() != begin && newpath.size() > 1) {
+                        good = false;
+                    }
+                    else {
+
+                 //   if (find(pq.begin(), pq.end(), newpath.front()) != pq.end() && newpath.front() != begin) {
+                 //         good = false;
+                 //   }
+
+
+                   // else {
+                    for (unsigned int kk1 = 0; kk1 < newpath.size(); kk1++) {
+                       
+                      /*
+                       if (newpath.front() == newpath.back()) {
+                           good = false;
+                           break;
+                       }
+                       else */if (find(pq.begin(), pq.end(), newpath[kk1]) != pq.end() && newpath[kk1] != begin) {
+                           good = false;
+                           break;
+                          
+                       }
+                       }
+                    //}
+                    }
+                    if (good) {
+                       newpath.insert(newpath.end(), pq.begin(), pq.end());
+                       #pragma omp critical
+                       {
+                       npts.push_back(newpath);
+                       }
+                    }
+                }
+            }
+            else {
+                std::vector<int> ppq = pq;// zipPath(pq, g, pq.front(), pq.back());
+                #pragma omp critical
+                {
+                finnpts.push_back(ppq);
+                }
+            }
+        }
+        if (npts.size() == 0) {
+            break;
+        }
+        else {
+            paths = npts;
+            npts.clear();
+        }
+    }
+    paths = finnpts;    
+    finnpts.clear(); 
+    for (unsigned int k = 0; k < localLoops.size(); k++) {
+        int lk = localLoops[k];
+        std::vector<std::vector<int> > loopp;
+        if (loopStore.find(localLoops[k]) != loopStore.end()) {
+            loopp.insert(loopp.end(), loopStore[localLoops[k]].begin(), loopStore[localLoops[k]].end());
+        }
+        else {
+        std::map<int, std::vector<std::vector<int> > > localLoopPaths;
+        completedLoops.push_back(lk);
+        recurses.push_back(lk);
+        loopp = bfsTraversePath(lk, lk, g, true);
+        recurses.pop_back();
+        }
+        for (unsigned int ik = 0; ik < loopp.size(); ik++) {
+                
+                if (find(globalLoopPaths[lk].begin(), globalLoopPaths[lk].end(), loopp[ik]) == globalLoopPaths[lk].end()) {
+                globalLoopPaths[localLoops[k]].push_back(loopp[ik]);
+                }
+        }
+    
+
+ 
+    }
+    borrowed = true;
+    std::vector<std::vector<int> > lps2;
+    //unsigned int maxpaths = 1000;
+    //unsigned int pathdivisor = 1;//paths.size()/maxpaths;///paths.size();
+
+    //if (pathdivisor < 1) {
+        //pathdivisor = 1;
+        //maxpaths = paths.size();
+   // }
+/*
+    for (unsigned int j = 0; j < pathdivisor+1; j++) {
+        std::vector<std::vector<int> > npaths;
+        std::vector<int> dummyvec;
+        unsigned int mxpths;
+        if (j < pathdivisor) {
+            mxpths = maxpaths;
+        }
+        else {
+            mxpths = paths.size() % pathdivisor;
+        }
+        for (unsigned int k = 0; k < mxpths; k++) {
+              npaths.push_back(paths.back());//unzipPath(paths.back(), g, begin, end));
+              paths.pop_back();
+        }
+*/
+        pathStore = paths;
+        paths.clear();
+    if (!recursedloop) {
+    uTraversePath(begin, end, g, false, globalLoopPaths);
+    }
+    else {
+    recursed++;
+    
+    std::set<std::vector<int> > lps = uTraversePath(begin, end, g, true, globalLoopPaths);
+    recursed--;
+    for (std::set<std::vector<int> >::iterator ij = lps.begin(); ij != lps.end(); ij++) {
+    std::vector<int> ijk = (*ij);
+    
+    lps2.push_back(*ij);
+    }
+    } 
+    //}
+    #ifdef PERFDEBUG
+ //   timeval tim; 
+    //std::cout << "begin: " << begin << " end: " << end << std::endl;
+    //gettimeofday(&tim, NULL);
+    //double tim2 = tim.tv_sec+(tim.tv_usec/1000000);
+    //double timeRet = tim2 - tim1;
+    //std::cout << "bfs time elapsed: " << timeRet << std::endl;
+    #endif
+    return lps2;
+    
+}
+             
+        
+/**
+This function calculates all the permutations of loops on paths
+it also throws away duplicate paths
+Input:
+@param[begin] integer representation of first node
+@param[end] integer representation of the final node
+@param[g] ambient CFG
+@param[globalLoopPaths] connects an integer representation of a node to all possible loops starting at that node
+*/
+
+
+template<class CFG>
+std::set<std::vector<int> >
+SgGraphTraversal<CFG>::
+uTraversePath(int begin, int end, CFG*& g, bool loop, std::map<int, std::vector<std::vector<int> > >& globalLoopPaths) {
+    //std::cout << "uTraverse" << std::endl;
+    //int doubledpaths = 0;
+    int newmil = 1;
+    //#ifdef LP
+    //if (loop && loopStore.find(begin) != loopStore.end()) {
+    //    return loopStore[begin];
+    //}
+    //#endif
+    #ifdef PERFDEBUG
+    //timeval tim;
+    //gettimeofday(&tim, NULL);
+    //double t1 = tim.tv_sec+(tim.tv_usec/1000000);
+    #endif
+    std::set<std::vector<int> > newpaths;
+    std::set<std::vector<int> > npaths;
+    pathnum = 0;
+    std::vector<int> path;
+    std::vector<std::vector<int> > paths;
+    int truepaths = 0;
+    std::vector<std::vector<int> > checkpaths;
+    std::vector<std::vector<int> > npathchecker;
+    std::map<int, int> currents;
+    //int nnumpaths = 0;
+    std::set<std::vector<int> > loopPaths;
+    //bool threadsafe = true;
+    bool done = false;
+    std::set<std::vector<int> > fts;
+    //double ttfors = 0;
+    //double tperms = 0;
+    while (true) {
+        //std::cout << "paths.size() " << paths.size() << std::endl;
+        if (paths.size() > 1000000) {
+            std::cout << "nearly 1 million paths with no loops, stopping" << std::endl;
+            return loopPaths;
+            std::cout << "ended early" << std::endl;
+        }
+        if (done || borrowed) {
+     
+                if (borrowed) {
+                    paths = pathStore;
+                    pathStore.clear(); 
+                }   
+                //std::cout << "paths.size(): " << paths.size() << std::endl; 
+                if (paths.size() != 0) {
+                }
+                else {
+                return loopPaths;
+                }
+         
+               // #pragma omp parallel
+               // {
+                #pragma omp parallel for schedule(guided) 
+                for (unsigned int qqq = 0; qqq < paths.size(); qqq++) {
+  //             std::cout << "pathcheck" << std::endl;
+                //int pathevals = 0;
+                //std::vector<int> zpt = zipPath2(paths[qqq], g); 
+                //std::set<std::vector<int> > boxpaths;
+                std::set<std::vector<int> > movepaths;
+                std::vector<int> path;// = paths[qqq];
+                path = paths[qqq];//unzipPath(paths[qqq], g, begin, end);
+                truepaths++;
+                   int permnums = 1;
+                   std::vector<int> perms;
+                    std::vector<unsigned int> qs;
+                    std::map<int, std::vector<std::vector<int> > > localLoops;
+                    std::vector<int> takenLoops;
+                    takenLoops.push_back(path[0]);
+                    bool taken = false;
+                    //timeval timfor;
+                    int lost = 0;
+                    //gettimeofday(&timfor, NULL);
+                    //double t1for = timfor.tv_sec + (timfor.tv_usec/1000000); 
+                    for (unsigned int q = 1; q < path.size()-1; q++) {
+                    //if (find(closures.begin(), closures.end(), path[q]) != closures.end()) {
+                    if (globalLoopPaths.find(path[q]) != globalLoopPaths.end() /*&& find(lloops.begin(), lloops.end(), path[q]) != lloops.end()*/ && globalLoopPaths[path[q]].size() != 0 /*&& path[q] != begin && path[q] != end*/) {
+                        for (unsigned int qp1 = 0; qp1 < globalLoopPaths[path[q]].size(); qp1++) {
+                            
+                            std::vector<int> gp = globalLoopPaths[path[q]][qp1]; //unzipPath(globalLoopPaths[path[q]][qp1],g,path[q],path[q]);
+                           // std::vector<int> zgp = zipPath2(globalLoopPaths[zpt[q]][qp1], g);
+                            for (unsigned int qp2 = 0; qp2 < takenLoops.size(); qp2++) {
+                                if (find(gp.begin(),gp.end(), takenLoops[qp2]) != gp.end()) {
+                                    taken = true;
+                                }
+                            }
+
+                            if (!taken) {
+                                localLoops[path[q]].push_back(gp);
+                            }
+                            else {
+                               lost++;
+                               taken = false;
+                            }
+                        }
+                        if (localLoops[path[q]].size() != 0) {
+                        takenLoops.push_back(path[q]);
+                        permnums *= (localLoops[path[q]].size()+1);
+                        perms.push_back(permnums);
+                        qs.push_back(path[q]);
+                        }
+                    }
+                    }
+                    
+                    //}
+                    //if (loop) {
+                    //std::cout << "lostloop: " << lost << std::endl;
+                    //}
+                    //else {
+                    //std::cout << "lostpath: " << lost << std::endl;
+                    //}
+                    //std::cout << "endpathcheck" << std::endl;
+                    //std::cout << "rest" << std::endl;
+                    //std::cout << "permnums: " << permnums << std::endl;
+                    //gettimeofday(&timfor, NULL);
+                    //double t2for = timfor.tv_sec + (timfor.tv_usec/1000000);
+                    //double ttfor = t2for - t1for;
+                    //#pragma omp atomic
+                    //ttfors += ttfor;
+                    
+                    //std::set<std::vector<int> > movepaths2;
+                    std::set<std::vector<int> > movepathscheck;
+                    //timeval timperms;
+                    //gettimeofday(&timperms, NULL);
+                   // double t1perm = timperms.tv_sec + (timperms.tv_usec/1000000);
+                    std::vector<int> nvec;
+                    std::vector<std::vector<int> > boxpaths(permnums, nvec);
+                    //#pragma omp parallel for schedule(guided)
+                    for (int i = 1; i <= permnums; i++) {
+                        //bool goodthread = false;
+                        std::vector<int> loopsTaken;
+                        //bool stop = false;
+                        unsigned int j = 0;
+                        std::vector<int> npath;
+                        while (true) {
+                            if (j == perms.size() || perms[j] > i) {
+                                break;
+                            }
+                            else {
+                                j++;
+                            }
+                        }
+                        int pn = i;
+                        std::vector<int> pL;
+                        for (unsigned int j1 = 0; j1 <= j; j1++) {
+                            pL.push_back(-1);
+                        }
+                           for (unsigned int k = j; k > 0; k--) {
+                               int l = 1;
+                               while (perms[k-1]*l < pn) {
+                                   l++;
+                              }
+                               pL[k] = l-2;
+                               pn -= (perms[k-1]*(l-1));
+                           }
+                        pL[0] = pn-2;
+
+                        unsigned int q2 = 0;
+                        for (unsigned int q1 = 0; q1 < path.size(); q1++) {
+                            if (q2 < qs.size()) {
+                                if (qs.size() != 0 && (unsigned)path[q1] == qs[q2] && (size_t)q2 != pL.size()) {
+                                    if (pL[q2] == -1) {
+                                        npath.push_back(path[q1]);
+                                    }
+                                    else {
+                                        //   if (!stop) {
+                                        npath.insert(npath.end(), localLoops[path[q1]][pL[q2]].begin(),
+                                                     localLoops[path[q1]][pL[q2]].end());
+                                        //  }
+                                    }
+                                    q2++;
+                                }
+                                else {
+                                    npath.push_back(path[q1]);
+                                }
+                            }
+                            else {
+                                npath.push_back(path[q1]);
+                            }
+                        }
+                        #ifdef FULLDEBUG
+                        std::cout << "path: " << std::endl;
+                        for (int qe = 0; qe < npath.size(); qe++) {
+                            std::cout << ", " << npath[qe];
+                        }
+                        std::cout << std::endl;
+                        std::cout << "permnum: " << i << std::endl; 
+                        #endif
+                      //  bool addit = false;
+                        //if (!stop) {
+                      //  if (loop && npath.front() == npath.back()) {
+                      //      addit = true;
+                      //  }
+                      //  else if (!loop && bound && npath.front() == begin && npath.back() == end && npath.size() != 1) {
+                      //      addit = true;
+                      //  }
+                      //  else if (!loop && !bound) {
+                      //      addit = true;
+                      //  }
+                      // if (!addit) {
+                      //     std::cout << "bad path" << std::endl;
+                      // }
+                       //bool extra = false;
+                       //if (addit && !loop) {
+                            //if (movepathscheck.find(npath) == movepathscheck.end()) {
+                            //int mpc = movepathscheck.size();
+                            //std::set<std::vector<int> > movepathspre = movepathscheck;
+                    //        movepaths2.insert(npath);
+                            //movepathscheck.insert(npath);
+                            //ROSE_ASSERT(movepathscheck.size() == mpc || movepathspre.find(npath) == movepathspre.end());
+                            //if (movepathscheck.size() == mpc) {
+                            //    extra = true;
+                           // }
+                       
+                            //}
+                            //else {
+                            //#pragma omp atomic
+                           // doubledpaths++;
+                           // }
+                       //}
+                            
+                            //if (!workingthread || threadsafe) {
+                            //if ((newpaths.size() > 1 || i == permnums || threadsafe)) {
+                           // }
+                          // }
+                               
+                       // }
+                        //if (!extra)
+                       // {
+                        //if (movepaths2.size() > 0) //|| i == permnums || threadsafe)
+                       // #pragma omp critical
+                      // {
+                       boxpaths[i-1] = npath;
+                      // } 
+                      // }
+                       //std::cout << "endrest" << std::endl;
+                       }
+                        
+                       evaledpaths += boxpaths.size();
+                       if (evaledpaths > newmil*100000ull) {
+                           //std::cout << "evaledpaths: " << evaledpaths << std::endl;
+                           newmil++;
+                       }
+                       // #pragma omp critical
+                      // {
+                       if (!loop) {
+                       for (std::vector<std::vector<int> >::iterator box = boxpaths.begin(); box != boxpaths.end(); box++) {
+                       std::vector<Vertex> verts;
+                       getVertexPath((*box), g, verts);
+                       #pragma omp critical
+                       { 
+                       analyzePath(verts);
+                       }
+                       }
+                       }
+                       else {
+                       #pragma omp critical
+                       {
+                       loopPaths.insert(boxpaths.begin(), boxpaths.end());;
+                       }
+                       }
+                       }
+                       }
+                       //} 
+                       
+/* 
+                      #pragma omp atomic
+                      evaledpaths++; 
+                      //pathevals++;
+                      if (evaledpaths % 10000 == 0 && evaledpaths != 0) {
+                          std::cout << "evaled paths: " << evaledpaths << std::endl;
+                      }
+                      if (!loop) {
+                          std::vector<Vertex> verts;
+                          getVertexPath(npath, g, verts);
+                              #pragma omp critical
+                              {
+                              #ifdef FULLDEBUG
+                              for (unsigned int aa = 0; aa < npath.size(); aa++) {
+                                  if (ptsNum.find(npath[aa]) != ptsNum.end()) {
+                                  ptsNum[npath[aa]] += 1;
+                                  }
+                                  else {
+                                  ptsNum[npath[aa]] = 1;
+                                  }
+                              }
+                              #endif
+                              analyzePath(verts);
+                              }
+                      }
+                      else if (loop)
+                      { 
+                          //std::vector<int> zpth = zipPath(npath, g, npath.front(), npath.back());
+                          #pragma omp critical
+                          {
+                          loopPaths.insert(npath);//zipPath(npath, g, npath.front(), npath.back()));
+                          }
+                      }
+                      else {
+                      }
+                      
+                   }
+*/
+
+                  // movepaths2.clear();
+                  
+                 // std::cout << "permnums: " << permnums << std::endl;
+                //  std::cout << "evaledpaths final: " << pathevals << std::endl;  
+                  //gettimeofday(&timperms, NULL);
+                  //double t2perm = timperms.tv_sec+(timperms.tv_usec/1000000);
+                  //#pragma omp atomic
+                  //tperms += t2perm - t1perm;
+                 // }
+                  //}
+                  //}
+                  //}
+                  
+                  
+                  
+                    
+
+                    
+                    #ifdef PERFDEBUG
+                    //gettimeofday(&tim, NULL);
+                   // double t2 = tim.tv_sec+(tim.tv_usec/1000000.0);
+                   // double tperm = t2 - t1perm
+                    //double tX = t2 - t1;
+                    //std::cout << "begin: " << begin << " end: " << end << std::endl;
+                   // std::cout << "uTraverse time: " << tX << std::endl;
+                   // std::cout << "tperms: " << tperms << std::endl;
+                   // std::cout << "ttfors: " << ttfors << std::endl;
+                   // std::cout << "doubledpaths: " << doubledpaths << std::endl;
+                    #endif
+                    #ifdef LP
+                    if (loop) {
+                   #ifdef PERFDEBUG
+                   //  std::cout << "loopPaths: " << loopPaths.size() << std::endl;
+                   #endif
+                    loopStore[begin] = loopPaths;
+                    }
+                    #endif
+                    return loopPaths;
+                    
+                    }
+                    }
+                    
+         
+         
+                    
+            
+
+
+
+/**
+This is the function that is used by the user directly to start the algorithm. It is immediately available to the user
+
+SgGraphTraversal::constructPathAnalyzer
+Input:
+@param[begin] Vertex, starting node
+@param[end] Vertex, endnode
+@param[g] CFG* g, CFG calculated previously
+*/
+
+
+template<class CFG>
+void
+SgGraphTraversal<CFG>::
+constructPathAnalyzer(CFG* g, bool unbounded, Vertex begin, Vertex end, bool ns) {
+    abnormals = 0;
+    normals = 0;
+    if (ns) {
+        needssafety = true;
+    }
+    else {
+        needssafety = false;
+    }
+    checkedfound = 0;
+    recursed = 0;
+    nextsubpath = 0;
+    borrowed = true;
+    stoppedpaths = 0;
+    evaledpaths = 0;
+    badpaths = 0;
+    sourcenum = 0;
+    prepareGraph(g);
+    workingthread = false;
+    workingthreadnum = -1;
+    //std::cout << "markers: " << markers.size() << std::endl;
+    //std::cout << "closures: " << closures.size() << std::endl;
+    //std::cout << "sources: " << sources.size() << std::endl;
+    //std::cout << "sinks" << sinks.size() << std::endl;
+//    printHotness(g);
+    bool subgraph = false;
+    if (!subgraph) {
+            if (!unbounded) {
+                bound = true;
+                recursiveLoops.clear();
+                recurses.clear();
+                std::vector<std::vector<int> > spaths = bfsTraversePath(vertintmap[begin], vertintmap[end], g);
+      //          std::cout << "spaths: " << spaths.size() << std::endl;
+            }
+            else {
+                std::set<int> usedsources;
+                bound = false;
+                 std::vector<int> localLps;
+                for (unsigned int j = 0; j < sources.size(); j++) {
+                    sourcenum = sources[j];
+                    recursiveLoops.clear();
+                    recurses.clear();
+                    std::vector<std::vector<int> > spaths = bfsTraversePath(sources[j], -1, g);
+               
+                    
+                }
+           }
+    }
+    //std::cout << "checkedfound: " << checkedfound << std::endl;
+    printHotness(g);
+}
+
+/** DEPRECATED 
+This is a function to construct subgraphs for parallelization
+SgGraphTraversal::computeSubGraphs
+Input:
+@param[begin] const int, starting point
+@param[end] const int ending point
+@param[g] const CFG*, control flow graph to compute
+@param[depthDifferential] int, used to specify how large the subgraph should be
+ */
+
+template<class CFG>
+void
+SgGraphTraversal<CFG>::
+computeSubGraphs(const int& begin, const int &end, CFG*& g, int depthDifferential) {
+        int minDepth = 0;
+        int maxDepth = minDepth + depthDifferential;
+        int currSubGraph = 0;
+        CFG* subGraph;
+        std::set<int> foundNodes;
+        while (true) {
+            Vertex begin = boost::add_vertex(*subGraphVector[currSubGraph]);
+            GraphSubGraphMap[currSubGraph][intvertmap[orderOfNodes[minDepth]]] = intvertmap[begin];
+            SubGraphGraphMap[currSubGraph][intvertmap[begin]] = intvertmap[orderOfNodes[minDepth]];
+        for (int i = minDepth; i <= maxDepth; i++) {
+            Vertex v = GraphSubGraphMap[currSubGraph][intvertmap[orderOfNodes[i]]];
+            std::vector<int> outEdges = getOutEdges(orderOfNodes[i], g);
+            for (unsigned int j = 0; j < outEdges.size(); j++) {
+                Vertex u;
+                if (foundNodes.find(getTarget(outEdges[j], g)) == foundNodes.end()) {
+                        u = GraphSubGraphMap[currSubGraph][intvertmap[getTarget(outEdges[j], g)]];
+                }
+                else {
+                    u = boost::add_vertex(*subGraphVector[currSubGraph]);
+                    foundNodes.insert(getTarget(outEdges[j], g));
+                    SubGraphGraphMap[currSubGraph][u] = intvertmap[getTarget(outEdges[j], g)];
+                    GraphSubGraphMap[currSubGraph][intvertmap[getTarget(outEdges[j], g)]] = u;
+
+                }
+                Edge edge;
+                bool ok;
+                boost::tie(edge, ok) = boost::add_edge(v,u,*subGraphVector[currSubGraph]);
+            }
+        }
+        minDepth = maxDepth;
+        if ((unsigned int) minDepth == orderOfNodes.size()-1) {
+                break;
+        }
+        maxDepth += depthDifferential;
+        if ((unsigned int) maxDepth > orderOfNodes.size()-1)
+        {
+                maxDepth = orderOfNodes.size()-1;
+        }
+        CFG* newSubGraph;
+        subGraphVector.push_back(newSubGraph);
+        currSubGraph++;
+        }
+        return;
+}
+
+       
+/*
+These should NOT be used by the user. They are simply for writing interesting information on the DOT graphs of the CFG
+*/
+
+
+ 
+        template<class CFG>
+        void
+        SgGraphTraversal<CFG>::
+        printCFGNodeGeneric(int &cf, std::string prop, std::ofstream& o) {
+            std::string nodeColor = "black";
+            o << cf << " [label=\"" << " num:" << cf << " prop: " << prop <<  "\", color=\"" << nodeColor << "\", style=\"" << "solid" << "\"];\n";
+        }
+
+        template<class CFG>
+        void
+        SgGraphTraversal<CFG>::
+        printCFGNode(int& cf, std::ofstream& o)
+        {
+            #ifdef FULLDEBUG
+            int pts = ptsNum[cf];
+            std::string nodeColor = "black";
+            o << cf << " [label=\"" << " pts: " << pts <<  "\", color=\"" << nodeColor << "\", style=\"" << "solid" << "\"];\n";
+            #endif
+            #ifndef FULLDEBUG
+            std::string nodeColor = "black";
+            o << cf << " [label=\"" << " num:" << cf << "\", color=\"" << nodeColor << "\", style=\"" << "solid" << "\"];\n";
+            #endif
+
+        }
+
+        template<class CFG>
+        void
+        SgGraphTraversal<CFG>::
+        printCFGEdge(int& cf, CFG*& cfg, std::ofstream& o)
+        {
+            int src = getSource(cf, cfg);
+            int tar = getTarget(cf, cfg);
+            o << src << " -> " << tar << " [label=\"" << src << " " << tar << "\", style=\"" << "solid" << "\"];\n";
+        }
+
+        template<class CFG>
+        void
+        SgGraphTraversal<CFG>::
+        printHotness(CFG*& g)
+        {
+            const CFG* gc = g;
+            int currhot = 0;
+            std::ofstream mf;
+            std::stringstream filenam;
+            filenam << "hotness" << currhot << ".dot";
+            currhot++;
+            std::string fn = filenam.str();
+            mf.open(fn.c_str());
+
+            mf << "digraph defaultName { \n";
+         // DQ (4/11/2017): Fix Klockworks issue of uninitialized variables.
+#if 1
+            vertex_iterator v, vend;
+            edge_iterator e, eend;
+#else
+         // This does not compile.
+            vertex_iterator v    = vertices(*gc).begin();
+            vertex_iterator vend = v;
+            edge_iterator e    = edges(*gc).begin();
+            edge_iterator eend = e;
+#endif
+            for (boost::tie(v, vend) = vertices(*gc); v != vend; ++v)
+            {
+                printCFGNode(vertintmap[*v], mf);
+            }
+            for (tie(e, eend) = edges(*gc); e != eend; ++e)
+            {
+                printCFGEdge(edgeintmap[*e], g, mf);
+            }
+            mf.close();
+        }
+      template<class CFG>
+        void
+        SgGraphTraversal<CFG>::
+        printPathDot(CFG*& g)
+        {
+            const CFG* gc = g;
+            std::ofstream mf;
+            std::stringstream filenam;
+            filenam << "pathnums.dot";
+            std::string fn = filenam.str();
+            mf.open(fn.c_str());
+
+            mf << "digraph defaultName { \n";
+            vertex_iterator v, vend;
+            edge_iterator e, eend;
+            for (tie(v, vend) = vertices(*gc); v != vend; ++v)
+            {
+                if (nodeStrings.find(vertintmap[*v]) != nodeStrings.end()) {
+                    int nn = vertintmap[*v];
+                    printCFGNodeGeneric(vertintmap[*v], nodeStrings[nn], mf);
+                }
+                else {
+                    printCFGNodeGeneric(vertintmap[*v], "noprop", mf);
+                }
+            }
+           for (tie(e, eend) = edges(*gc); e != eend; ++e)
+            {
+                printCFGEdge(edgeintmap[*e], g, mf);
+            }
+
+            mf.close();
+        }
+
+
+
+/**
+This is the function that preps the graph for traversal
+
+SgGraphTraversal::prepareGraph
+Input:
+@param[g] CFG*& g, CFG calculated previously
+*/
+
+
+template<class CFG>
+void
+SgGraphTraversal<CFG>::
+prepareGraph(CFG*& g) {
+    nextNode = 1;
+    nextEdge = 1;
+    findClosuresAndMarkersAndEnumerate(g);
+}
+
+
+/**
+DEPRECATED 
+This is the function that preps the graph for traversal, currently this one isn't used but for many traversals on one visitor
+may necessitate
+ 
+SgGraphTraversal::firstPrepGraph 
+Input: 
+@param[g] CFG*& g, CFG calculated previously 
+*/ 
+
+
+template<class CFG>
+void
+SgGraphTraversal<CFG>::
+firstPrepGraph(CFG*& g) {
+    nextNode = 1;
+    nextEdge = 1;
+    findClosuresAndMarkersAndEnumerate(g);
+}
+
+/**
+This calculates nodes with more than one in edge or more than one out edge
+
+SgGraphTraversal::findClosuresAndMarkers
+Input:
+@param[g] CFG*& g, CFG calculated previously
+*/
+
+
+
+
+template<class CFG>
+void
+SgGraphTraversal<CFG>::
+findClosuresAndMarkersAndEnumerate(CFG*& g)
+{
+ // DQ (4/11/2017): Fix Klockworks issue of uninitialized variables.
+#if 1
+    edge_iterator e, eend;
+#else
+    edge_iterator e    = edges(*g).begin();
+    edge_iterator eend = e;
+#endif
+    for (tie(e, eend) = edges(*g); e != eend; ++e) {
+        intedgemap[nextEdge] = *e;
+        edgeintmap[*e] = nextEdge;
+        nextEdge++;
+    }
+ // DQ (4/11/2017): Fix Klockworks issue of uninitialized variables.
+#if 1
+    vertex_iterator v1, vend1;
+#else
+    vertex_iterator v1    = vertices(*g).begin();
+    vertex_iterator vend1 = v1;
+#endif
+    for (boost::tie(v1, vend1) = vertices(*g); v1 != vend1; ++v1)
+    {
+        vertintmap[*v1] = nextNode;
+        intvertmap[nextNode] = *v1;
+        nextNode++;
+    }
+ // DQ (4/11/2017): Fix Klockworks issue of uninitialized variables.
+#if 1
+    vertex_iterator v, vend;
+#else
+    vertex_iterator v    = vertices(*g).begin();
+    vertex_iterator vend = v;
+#endif
+    for (boost::tie(v, vend) = vertices(*g); v != vend; ++v) {
+        std::vector<int> outs = getOutEdges(vertintmap[*v], g);
+        std::vector<int> ins = getInEdges(vertintmap[*v], g);
+        if (outs.size() > 1)
+        {
+            markers.push_back(vertintmap[*v]);
+            
+            markerIndex[vertintmap[*v]] = markers.size()-1;
+            for (unsigned int i = 0; i < outs.size(); i++) {
+                pathsAtMarkers[vertintmap[*v]].push_back(getTarget(outs[i], g));
+            }
+        }
+        if (ins.size() > 1)
+        {
+            closures.push_back(vertintmap[*v]);
+        }
+        if (outs.size() == 0) {
+            sinks.push_back(vertintmap[*v]);
+        }
+        if (ins.size() == 0) {
+            sources.push_back(vertintmap[*v]);
+        }
+    }
+    return;
+}
+
+
+
+/** DEPRECATED 
+Currently unused but will be necessary for parallelization in progress
+SgGraphTraversal::computeOrder
+@param[g] CFG* cfg in question
+@parm[begin] const int, integer representation of source node
+*/
+template<class CFG>
+void
+SgGraphTraversal<CFG>::
+computeOrder(CFG*& g, const int& begin) {
+        std::vector<int> currentNodes;
+        std::vector<int> newCurrentNodes;
+        currentNodes.push_back(begin);
+        std::map<int, int> reverseCurrents;
+        orderOfNodes.push_back(begin);
+        std::set<int> heldBackNodes;
+        while (currentNodes.size() != 0) {
+                for (unsigned int j = 0; j < currentNodes.size(); j++) {
+                       
+                        std::vector<int> inEdges = getInEdges(currentNodes[j], g);
+                        if (inEdges.size() > 1) {
+                        if (reverseCurrents.find(currentNodes[j]) == reverseCurrents.end()) {
+                            reverseCurrents[currentNodes[j]] = 0;
+                        }
+                        if ((unsigned int) reverseCurrents[currentNodes[j]] == inEdges.size() - 1) {
+                                heldBackNodes.erase(currentNodes[j]);
+                                reverseCurrents[currentNodes[j]]++;
+                                std::vector<int> outEdges = getOutEdges(currentNodes[j], g);
+                                for (unsigned int k = 0; k < outEdges.size(); k++) {
+                                        newCurrentNodes.push_back(getTarget(outEdges[k], g));
+                                        orderOfNodes.push_back(getTarget(outEdges[k], g));
+                                }
+                        }
+                        else if (reverseCurrents[currentNodes[j]] < reverseCurrents.size()) {
+                                reverseCurrents[currentNodes[j]]++;
+                                if (heldBackNodes.find(currentNodes[j]) == heldBackNodes.end()) {
+                                    heldBackNodes.insert(currentNodes[j]);
+                                }
+                        }
+                        }
+                        else {
+                                std::vector<int> outEdges = getOutEdges(currentNodes[j], g);
+                                for (unsigned int k = 0; k < outEdges.size(); k++) {
+                                        newCurrentNodes.push_back(getTarget(outEdges[k], g));
+                                        orderOfNodes.push_back(getTarget(outEdges[k], g));
+
+                                }
+                        }
+                }
+                if (newCurrentNodes.size() == 0 && heldBackNodes.size() != 0) {
+                    for (std::set<int>::iterator q = heldBackNodes.begin(); q != heldBackNodes.end(); q++) {
+                        int qint = *q;
+                        std::vector<int> heldBackOutEdges = getOutEdges(qint, g);
+                        for (unsigned int p = 0; p < heldBackOutEdges.size(); p++) {
+                            newCurrentNodes.push_back(getTarget(heldBackOutEdges[p], g));
+                        }
+                   }
+                   heldBackNodes.clear();
+                }
+                currentNodes = newCurrentNodes;
+                newCurrentNodes.clear();
+        }
+        return;
+}
+
+/**
+Converts the path calculated by this algorithm to Vertices so users can
+access data
+SgGraphTraversal::getVertexPath
+@param[path] integer representation of path
+@param[g] CFG*, cfg in question
+@param[vertexPath] for some reason this can't be a return value so it is changed via pass by reference
+*/
+
+template<class CFG>
+void
+SgGraphTraversal<CFG>::
+getVertexPath(std::vector<int> path, CFG*& g, std::vector<Vertex>& vertexPath) {
+        for (unsigned int i = 0; i < path.size(); i++) {
+                            vertexPath.push_back(intvertmap[path[i]]);
+        }
+
+       
+        
+}
+
+/**
+DEPRECATED
+Currently unused, may eventually be modified for optimal storage purposes
+SgGraphTraversal::storeCompact
+@param[compactPath] path to be compactified
+*/
+template<class CFG>
+void
+SgGraphTraversal<CFG>::
+storeCompact(std::vector<int> compactPath) {
+return;
+}
+
+
+
+
+                  
diff --git a/src/midend/astProcessing/graphProcessingSgIncGraph.h b/src/midend/astProcessing/graphProcessingSgIncGraph.h
new file mode 100644
index 00000000000..382dc09079d
--- /dev/null
+++ b/src/midend/astProcessing/graphProcessingSgIncGraph.h
@@ -0,0 +1,1865 @@
+/*
+
+FINISH TEMPFLATPATH CODE
+
+*/
+
+
+
+
+// Original Author (SgGraphTraversal mechanisms): Michael Hoffman
+//$id$
+#include<omp.h>
+#include <boost/regex.hpp> 
+#include <iostream>
+#include <fstream>
+#include <string>
+
+/** 
+*@file graphProcessing.h
+
+*Brief Overview of Algorithm:
+
+***********************
+*Current Implementation
+***********************
+
+*The idea behind the algorithm here is to decompose the given Control Flow Graph into a Tree structure (still stored as a Control Flow Graph, though it may be possible to change this). This tree splits on children of a graph node, but does not connect in the case of multiple parents of a single node. In this we refer to out nodes as "children" and in nodes as "parents". However, we do this from the end node to the start node. This is best because then you get one value on the end node, and that value is the only one we want (however, the function takes a pointer to an empty SgIncidenceDirectedGraph as an argument, this can then be analyzed post traversal if that is wanted.
+
+*Also, following the algorithm explained above, one must realize that the tree has one leaf for EACH path. Thus small programs can lead from a small-ish graph to a VERY large tree. For example, a program with 20 if else statements would end with 2^20 paths, which means the number of nodes in the tree is greater than this. Thus with 32 or 64 you can overflow a 32 or 64 bit integer.
+
+*However, this can be partially resolved by setting the deleteTree boolean to true. This is set to false as the default, however if you don't need the tree then deleteTree will allow you to deal with much larger trees and thus much larger original graphs.
+
+*Realize that because of the potentially massive growth rate of path number, that in large cases path enumeration and counting is extremely prohibitive, as it is not difficult to create a program which has more paths than 2^64, thus an unsigned (signed?) 64 bit integer could not store the number.
+
+*Further, this is still a relatively compact method. You could just as easily force enumeration of paths, which could in some cases drastically increase the number of nodes necessary to store all the information.
+
+*The advantage of the tree structure is two-fold. First it relieves the algorithm of having to keep even more in memory than it has to at the moment, and if you want to deal with GoTo statements, one case can develop that cannot be solved otherwise, e.g.
+
+*Consider the four node tree with nodes a, b, c, d, and edges atb, atc, btc, ctb, btd, ctd. There are FOUR legitimate paths here (a, b, d; a, b, c, d; a, c, d; a, c, b, d), and any other method would recognize this as a loop and, without a special algorithm for loop behavior, this would be ignored.
+
+*The tree structure also allows for very strong parallelization, currently implemented in openMP. This is because depth has meaning in terms of a tree (it doesn't in terms of a general graph) and that you know you can evaluate all nodes at a certain depth if you have solved all the nodes at depth + 1.
+
+**************************
+*Further Improvements: TODO
+**************************
+
+@todo *One improvement that should be implemented ASAP is changing the algorithm from a recursive algorithm to an iterative algorithm. Keeping the memory requirements down is much easier in this form and would probably increase the size of graph that the algorithm can handle.
+
+@todo *Another improvement that should be implemented when possible is to allow for loop analysis. This could be implemented by simply running the algorithm on the loop, but there would need to be a provision that kept the algorithm from stopping as soon as it starts. This could be done by separating the node into two nodes, one with all the inedges and one with all the outedges. OR one could collect the loops when they are deleted (the whole loop is calculated necessarily), though nested loops would have to be considered further in order to find a way to deal with them.
+
+@todo *It is possible that graph matching algorithms might prove useful to distinguish different types of graphs contained within the CFG and optimize traversal over them. Look up graph matching algorithms or pattern matching (potentially) for more information on such algorithms, though I do not believe there is an existant literature on matching subgraphs for this purpose.
+
+@todo *The parallelism in this program should be optimized by someone experienced in parallelization optimization
+
+***************
+*Contact Info
+***************
+
+*Finally, blame can be assigned to and questions can be forwarded to the author, though response is not guaranteed
+
+*archangel DOT associate AT gmail DOT com
+*or, if I'm still at Lawrence
+*hoffman34 AT llnl DOT gov
+*@author Michael Hoffman
+*/
+
+
+
+
+
+#include "staticCFG.h"
+#include <vector>
+#include <algorithm>
+#include <utility>
+#include <iostream>
+#include <sys/time.h>
+#include <sys/resource.h>
+//#include "graphBot.h"
+
+//This is necessary for technical reasons with regards to the graphnodeinheritedmap
+
+
+
+struct Bot {
+    std::vector<std::vector<SgGraphNode*> > path;
+    std::vector<std::set<SgGraphNode*> > pthloops;
+    std::vector<SgGraphNode*> currpth;
+    std::vector<std::pair<SgGraphNode*, int> > nodelst;
+    bool on;
+    bool remove;
+};
+
+double timeDifference(const struct timeval& end, const struct timeval& begin)
+{
+    return (end.tv_sec + end.tv_usec / 1.0e6) - (begin.tv_sec + begin.tv_usec / 1.0e6);
+}
+
+static inline timeval getCPUTime() {
+  rusage ru;
+  getrusage(RUSAGE_SELF, &ru);
+  return ru.ru_utime;
+}
+
+
+struct compareSgGraphNode {
+    bool operator()(const SgGraphNode* a, const SgGraphNode* b) const
+    {
+        return a==b;
+    }
+};
+
+
+/* The SgGraphTraversal class is utilized specifically for StaticCFG traversals,
+though the input must be in terms of a SgIncidenceDirectedGraph*/
+template <class InheritedAttributeType, class SynthesizedAttributeType>
+class SgGraphTraversal
+{
+   public:
+    std::set<std::map<int, std::set<int> > > subpathmap;
+    int loopNum;
+    int nullNum;
+    std::set<SgDirectedGraphEdge*> nullEdgesOrdered;
+    std::map<SgGraphNode*, int> loopNumMap;
+    std::map<SgGraphNode*, int> pathValMap;
+    int nullloops;
+    std::vector<std::vector<SgGraphNode*> > looppaths;
+    std::vector<std::vector<SgGraphNode*> > iLoops;
+    std::vector<SgGraphNode*> ifstatements;
+    virtual ~SgGraphTraversal(); 
+    SgGraphTraversal(); 
+    // Copy operations
+    int nullEdgesPaths;
+    int turns;
+    SgGraphTraversal(const SgGraphTraversal &);
+    const SgGraphTraversal &operator=(const SgGraphTraversal &);
+    //This is not used, but will be important if SynthesizedAttributes become useful
+    typedef StackFrameVector<SynthesizedAttributeType> SynthesizedAttributesList;
+    //one of the most important structures in the algorithm, this attaches SgGraphNode*s to InheritedAttributeTypes so that
+    //looking up the values is possible.
+    //int numnodes;
+    //std::map<SgGraphNode*, InheritedAttributeType> seen;
+    int numnodes;
+    //InheritedAttributeType pthgraphinherit;
+    //StaticCFG::CFG* SgCFG;
+    SgGraphNode* nullnode;
+    std::map<SgGraphNode*, int> primenode;
+    bool done;
+    //std::set<SgGraphNode*> startnodes;
+    std::set<SgGraphNode*> lstN;
+    std::map<SgGraphNode*, std::vector<std::set<int> > > lstordmap;
+    std::set<SgGraphNode*> solvedLoops;
+    std::map<SgGraphNode*, std::vector<SgGraphNode*> > checkednodes; 
+    std::map<SgGraphNode*, std::set<SgGraphNode*> > downed;
+   
+    //std::map<SgGraphNode*, int> nodeinedgordmap;
+    //a value for nodes that have no value, set in the traverse function
+    InheritedAttributeType nullInherit;
+    //the user invoked function, runs the algorithm
+    InheritedAttributeType traverse(SgGraphNode* basenode, SgIncidenceDirectedGraph* g,
+            InheritedAttributeType inheritedValue, InheritedAttributeType nullInherit,
+            SgGraphNode* endnode, bool insep = false, bool pcHk = false);
+    std::set<SgGraphNode*> loopSet;
+
+   protected:
+    //User defined functions to do whatever is needed in evaluation
+    //All the user gets access to is the node in question
+    //and the values of the parent nodes (this should be all that is necessary)
+    virtual InheritedAttributeType evaluateInheritedAttribute(SgGraphNode* n,
+            std::vector<InheritedAttributeType> inheritedValues) = 0;
+    //Not used, but may be useful if SynthesizedAttributes become workable in this context
+    virtual SynthesizedAttributeType evaluateSynthesizedAttribute(SgGraphNode* n,
+            InheritedAttributeType in,
+            SynthesizedAttributesList l) = 0;
+
+#if !USE_ROSE
+ // DQ (11/3/2011): EDG compilains about this (but GNU allowed it, I think that EDG might be correct,
+ // namely that the value of a reference must be an lvalue (not NULL).  But since we are only trying 
+ // to compile ROSE with ROSE (using the new EDG 4.3 front-end as a tests) we can just skip this case for now.
+    virtual void pathAnalyze(std::vector<SgGraphNode*>& pth, bool loop=false, std::set<std::vector<SgGraphNode*> >& incloops=NULL) = 0;
+#else
+    virtual void pathAnalyze(std::vector<SgGraphNode*>& pth, bool loop, std::set<std::vector<SgGraphNode*> >& incloops) = 0;
+#endif
+
+    //also not used, but important for possible later use of SynthesizedAttributes
+    SynthesizedAttributeType defaultSynthesizedAttribute(InheritedAttributeType);
+   private:
+    double distime;
+    //std::set<std::pair<std::pair<SgGraphNode*, SgGraphNode*>, std::pair<SgGraphNode*, SgGraphNode*> > > flpset;
+    //std::set<std::pair<std::pair<SgGraphNode*, SgGraphNode*>, std::pair<SgGraphNode*, SgGraphNode*> > > goodset;
+    std::set<SgGraphNode*> ploops;
+    std::map<SgGraphNode*, std::set<std::vector<SgGraphNode*> > > lpbegins;
+    std::map<SgGraphNode*, int> frksLeft;
+    int currm;
+    int dpMax;
+    int repEval;
+    bool pathCheck;
+    int pathsSize;
+    //this constructs the graph tree for computation of inheritedValues
+
+
+    std::map<SgGraphNode*, InheritedAttributeType> known;
+    std::vector<InheritedAttributeType> connectNodes;
+    std::map<SgGraphNode*, bool> solved;
+    std::set<SgGraphNode*> solvedset;
+    //these two are not used, but will be important if SynthesizedAttributes are made reasonable in this context
+    SynthesizedAttributesList *synthesizedAttributes;
+    SynthesizedAttributeType traversalResult();
+    //finally we have two functions necessary for parallel processing if that is chosen to be used by the user
+ 
+
+    
+  
+    std::map<SgGraphNode*, int> nodeInEdgesNum;
+    int currprime;
+    std::vector<SgGraphNode*> endnodefakes;
+    std::map<SgGraphNode*, std::vector<std::vector<SgGraphNode*> > > pathsAtMk;
+    std::set<SgGraphNode*> mkloops;
+    std::map<SgGraphNode*, std::set<std::vector<SgGraphNode*> > > mkloopmap;
+    std::map<SgGraphNode*, std::set<std::vector<SgGraphNode*> > > subPathsAtMk;
+    std::vector<SgGraphNode*> mkglobal;
+    std::vector<SgGraphNode*> clglobal;
+    bool inseparable;
+    void solvePaths(SgIncidenceDirectedGraph* g, SgGraphNode* n, SgGraphNode* endnode);
+    std::vector<std::set<SgGraphNode*> > closuresVec;
+    void evaluatePaths(SgIncidenceDirectedGraph* g, SgGraphNode* realstartnode, SgGraphNode* endnode);
+    void evaluatePathsPar(SgIncidenceDirectedGraph* g, SgGraphNode* realstartnode, SgGraphNode* endnode);
+    bool disjoint(std::vector<SgGraphNode*>& path, std::vector<SgGraphNode*>& vec2) const;
+    std::set<std::vector<SgGraphNode*> > flatpaths;
+//    void evalNode(SgIncidenceDirectedGraph* g, SgGraphNode* n);
+    bool canSolve(SgIncidenceDirectedGraph* g, SgGraphNode* n);
+    std::map<SgGraphNode*, InheritedAttributeType> inhVals;
+    std::set<SgDirectedGraphEdge*> seenEdges;
+    std::set<SgDirectedGraphEdge*> nullEdges;
+    std::set<SgGraphNode*> clsT;
+    void computeOrder(SgIncidenceDirectedGraph* g, SgGraphNode* n, SgGraphNode* endnode);
+    void computeInheritedOrdered(SgIncidenceDirectedGraph* g, SgGraphNode* n);
+    std::pair<bool, SgGraphNode*> getNextPar(SgIncidenceDirectedGraph* g, SgGraphNode* n);
+    std::pair<bool, SgGraphNode*> getNextChild(SgIncidenceDirectedGraph* g, SgGraphNode* n);
+    bool computable(SgIncidenceDirectedGraph* g, SgGraphNode* n);
+    void evalNodeOrdered(SgIncidenceDirectedGraph* g, SgGraphNode* n);
+    std::map<SgGraphNode*, int> oVals;
+    bool canEval(SgIncidenceDirectedGraph* g, SgGraphNode* n);
+    void setPathVal(SgIncidenceDirectedGraph*g, SgGraphNode* n);
+    void printNodePlusEdgesForAnalysis(SgIncidenceDirectedGraph* g, SgGraphNode* n, int loopNum, int pathVal, std::ofstream& ss);
+    void printNodePlusEdgesForAnalysisPath(SgIncidenceDirectedGraph* g, std::vector<SgGraphNode*> n, int loopNum, int pathVal, std::ofstream& ss);
+    void printNodeForAnalysis(SgGraphNode* n, int loopNum, int pathNum, std::ofstream& ss);
+    std::set<SgGraphNode*> completedNodesPath;
+    std::set<std::pair<SgGraphNode*, SgGraphNode*> > completedEdgesPath;
+    void printEdgeForAnalysis(SgDirectedGraphEdge* e, bool isNullEdge, std::ofstream& ss);
+    void printEdgeForAnalysisPath(SgGraphNode* g1, SgGraphNode* g2, std::ofstream& ss);
+    std::map<int, SgGraphNode*> iVals;
+    
+    std::set<SgDirectedGraphEdge*> nullEdgesOrderedOut;
+    std::set<SgDirectedGraphEdge*> completedEdgesOut;
+    std::set<SgDirectedGraphEdge*> completedEdges;
+    std::set<SgGraphNode*> compPar;
+    std::set<SgGraphNode*> compChild;
+    std::set<SgGraphNode*> computedNodes;
+    SgGraphNode* st;
+    SgGraphNode* en;
+    double fllp;
+    int loopnum;
+    //std::set<SgGraphNode*> solved;
+    //InheritedAttributeType findAndReverse(SgGraphNode* n, SgIncidenceDirectedGraph* g);
+     //evaluateAllInheritedAttribute(std::vector<InheritedAttributeType> endNodeInhVec, SgGraphNode* endnode, std::vector<SgGraphNode*> nodes, std::vector<InheritedAttributeType> inh);
+//std::vector<InheritedAttributeType> getZeroInhs(std::vector<std::vector<std::vector<SgGraphNode*> > > qAnsSetSet, std::vector<InheritedAttributeType> endnodeInhVec, SgGraphNode* node);
+
+};
+
+
+
+/*
+template <class InheritedAttributeType, class SynthesizedAttributeType>
+void
+GraphBot<InheritedAttributeType, SynthesizedAttributeType>::
+travelDown(SgIncidenceDirectedGraph* g) {
+    std::set<SgDirectedGraphEdge*> oedgs = g->computeEdgeSetOut(iAmHere);
+    bool taken = false;
+    if (oedgs.size() > 1) {
+        std::set<SgDirectedGraphEdge*> edgeTrav = clEdgeTrav[iAmHere];
+        ROSE_ASSERT(clEdgeTrav.find(iAmHere) != clEdgeTrav.end());
+        for (std::set<SgDirectedGraphEdge*>::iterator i = oedgs.begin(); i != oedgs.end(); i++) {
+            if (edgTrav.find(*i) == edgTrav.end() || !taken) {
+                taken = true;
+                iAmHere = (*i)->get_to();
+                lastEdge = *i;
+            }
+        }
+    }
+    else {
+        iAmHere = (*(oedgs.begin())->get_to();
+    }
+}
+*/
+
+
+
+
+
+
+/*
+***************************
+Various Admin Functions
+***************************
+*/
+template<class InheritedAttributeType, class SynthesizedAttributeType>
+SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
+SgGraphTraversal()
+  : synthesizedAttributes(new SynthesizedAttributesList())
+{
+}
+
+#ifndef SWIG
+
+template<class InheritedAttributeType, class SynthesizedAttributeType>
+SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
+~SgGraphTraversal()
+{
+        ROSE_ASSERT(synthesizedAttributes != NULL);
+        delete synthesizedAttributes;
+        synthesizedAttributes = NULL;
+}
+
+#endif
+
+
+template<class InheritedAttributeType, class SynthesizedAttributeType>
+const SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType> &
+SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
+operator=(const SgGraphTraversal &other)
+{
+
+    ROSE_ASSERT(synthesizedAttributes != NULL);
+    delete synthesizedAttributes;
+    synthesizedAttributes = other.synthesizedAttributes->deepCopy();
+
+    return *this;
+}
+
+/**
+This is the function that is used by the user directly to start the algorithm. It is immediately available to the user
+
+SgGraphTraversal::traverse
+Input:
+@param[n] n starting node
+@param[g] SgIncidenceDirectedGraph* g, CFG calculated previously
+@param[inheritedValue] InheritedAttributeType inheritedValue, value of the starting node
+@param[nullI] InheritedAttributeType nullI, value of the null Attribute, i.e. what to attribute to a node with no value\
+@param[endnode] SgGraphNode* endnode, final node
+@param[insep] boolean to decide inseparability of the analysis function, not yet in use, set automatically to false
+@param[pCh] deprecated, set to false
+@return InheritedAttributeType, the value of the attribute at the end node
+
+*/
+
+
+template<class InheritedAttributeType, class SynthesizedAttributeType>
+InheritedAttributeType
+SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
+traverse(SgGraphNode* n, SgIncidenceDirectedGraph* g, InheritedAttributeType inheritedValue, InheritedAttributeType nullI, SgGraphNode* endnode, bool insep, bool pCh) {
+   //numnodes = 0;
+   //primes.clear();
+    looppaths.clear();
+    iLoops.clear();
+    completedEdgesPath.clear();
+    pathValMap.clear();
+    loopNumMap.clear();
+    nullloops = 0;
+    nullEdgesPaths = 0;
+    fllp = 0.0;
+    mkglobal.clear();
+    clglobal.clear();
+  
+    lpbegins.clear();
+    //currents.clear();
+   inhVals.clear();
+   iVals.clear();
+   oVals.clear();
+   //reservedEdges.clear();
+   completedEdges.clear();
+   completedEdgesOut.clear();
+   //completedNodes.clear();
+   computedNodes.clear();
+   nullEdgesOrdered.clear();
+   nullEdgesOrderedOut.clear();
+   loopSet.clear();
+   pathsAtMk.clear();
+   
+   st = n;
+   en = endnode;
+   distime = 0.0;
+   int currm = 1;
+   int turns = 0;
+   pathsSize = 0;
+   done = false;
+   numnodes = 1;
+   std::cout << "starting traversal" << std::endl;
+   pathCheck = pCh;
+   currprime = 1;
+   inseparable = insep;
+   synthesizedAttributes->resetStack();
+   ROSE_ASSERT(synthesizedAttributes->debugSize() == 0);
+   //SgCFG = cfg;
+   inhVals[n] = inheritedValue;
+   //GraphBot<InheritedAttributeType, SynthesizedAttributeType>::inhVals[n] = inheritedValue;
+   //primes = generatePrimesSieve();
+   
+  
+//   graphnodeinheritedordmap[ncpy] = inheritedValue;
+//   nodenodeordmap[ncpy] = n;
+//   std::vector<SgGraphNode*> lst;
+//   lst.push_back(n);
+//   lstordmap[ncpy] = lst;
+
+   nullInherit = nullI;
+InheritedAttributeType inh;
+   struct timeval t1, t2, t3, t4, t5, t6, t7, t8;
+   //else {
+       loopnum = 0;
+       //InheritedAttributeType inh;
+       t1 = getCPUTime();
+       
+       //this function essentially sets up for the evaluate later, it makes putting together the paths much easier
+       solvePaths(g, n, endnode);
+
+       t2 = getCPUTime();
+
+//making sure that endnode hasn't already been evaluated before the traversal starts, unlikely but just in case
+       ROSE_ASSERT(inhVals.find(endnode) == inhVals.end());
+
+       std::cout << "solvePaths done" << std::endl;
+       double diff = timeDifference(t2, t1);
+       t5 = getCPUTime();
+       //InheritedAttributeType pthgraphinherit = botTraverse(g, n, endnode);
+       oVals[n] = 0;
+       iVals[0] = n;
+       pathValMap[n] = 1;
+//inserting n as a computed node
+       computedNodes.insert(n);
+//computes the order in which the nodes must be evaluated, makes computeInheritedOrdered much faster
+       computeOrder(g, n, endnode);
+       std::cout << "order computed" << std::endl;
+//computes the nodal inheritance values
+       computeInheritedOrdered(g, n);
+       std::cout << "inheritance computed" << std::endl;
+       ROSE_ASSERT(oVals.find(endnode) != oVals.end());
+       ROSE_ASSERT(inhVals.find(endnode) != inhVals.end());
+//value at the endnode
+       InheritedAttributeType pthgraphinherit = inhVals[endnode];
+       //= evaluateGraph(g, n, endnode, inheritedValue);
+       t6 = getCPUTime();
+       std::cout << "evaluateGraph done" << std::endl;
+       double diff3 = timeDifference(t6, t5);
+       t3 = getCPUTime();
+//actually evaluates every path with a user defined pathAnalyze function
+       //for (int i = 0; i < 10; i++) {
+       evaluatePaths(g, n, endnode);
+       //}
+       t4 = getCPUTime();
+       
+       t7 = getCPUTime();
+       //evaluatePathsPar(g, n, endnode);
+       t8 = getCPUTime();
+       
+       std::cout << "evaluatePaths done " << std::endl;
+       double diff2 = timeDifference(t4, t3);
+       double diff2Par = timeDifference(t8, t7);
+       std::cout << "pathsolve took: " << diff << std::endl;
+       std::cout << "patheval took: " << diff2 << std::endl;
+       std::cout << "parpatheval took: " << diff2Par << std::endl;
+       std::cout << "grapheval took: " << diff3 << std::endl;
+       std::cout << "entire pathsolve took: " << diff+diff2+diff3+diff2Par << std::endl;
+       std::cout << "potential loops: " << nullEdgesOrdered.size() << std::endl;
+       std::cout << "nullNum: " << nullNum << std::endl;
+       //std::cout << "goodsets: " << goodset.size() << std::endl;
+       //std::cout << "flpsets: " << flpset.size() << std::endl;
+       std::cout << "mkloops: " << mkloops.size() << std::endl;
+       std::cout << "distime: " << distime << std::endl;
+       std::cout << "fllp: " << fllp << std::endl;
+       return pthgraphinherit;
+   //}
+   //std::cout << "number of endnodefakes: " << endnodefakes.size() << std::endl;
+   //std::cout << "should be number of nodes: " << currprime << std::endl;
+   //if (pathanalysis == true) {
+     // analyzepaths(endnode, g);
+   //}
+   //return inh;
+   //Currently this is not very useful, but it does nothing if traversalResult is not set.
+}
+
+/* WARNING:
+   This is not a general is_disjoint. It skips the 
+first element of the second set because in the way I assemble
+paths the last element of the path and the first element of addend
+must be the same. Hence I simply skip the first node
+*/
+bool is_disjoint(std::set<SgGraphNode*> set1, std::set<SgGraphNode*> set2) {
+ 
+   if (set1.empty() || set2.empty()) {
+       return true;
+   }
+   std::set<SgGraphNode*>::iterator it1 = set1.begin();
+   std::set<SgGraphNode*>::iterator it2 = set2.begin();
+   std::set<SgGraphNode*>::iterator it1End = set1.end();
+   std::set<SgGraphNode*>::iterator it2End = set2.end();
+
+    if (*it1 > *set2.rbegin() || *it2 > *set1.rbegin()) {
+        return true;
+    }
+    
+    while (it1 != it1End && it2 != it2End) {
+        if (*it1 == *it2) {
+            return false;
+        }
+        if (*it1 < *it2) {
+            it1++;
+        }
+        else {
+            it2++;
+        }
+     }
+     return true;
+}   
+
+
+
+//Checks for disjoint, necessary in computing the paths
+template<class InheritedAttributeType, class SynthesizedAttributeType>
+bool
+SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
+disjoint(std::vector<SgGraphNode*>& pthloops, std::vector<SgGraphNode*>& vec2) const {
+/*
+    time_t t1, t2;
+    time(&t1);
+    int a = 0;
+    std::set<SgGraphNode*> s1;
+    std::set<SgGraphNode*> s2;
+    std::vector<SgGraphNode*> mkloopvec;
+    bool goodsetbool;
+    bool pbool = true;
+    //std::cout << "calculating disjoint" << std::endl;
+    ROSE_ASSERT((path.back()).back() == vec2.front());
+
+    //copy(vec2.begin(), vec2.end(), inserter(s2, s2.end()));
+/*
+    for (int i = 0; i < vec2.size(); i++) {
+        if (ploops.find(vec2[i]) != ploops.end()) {
+            pbool = false;
+        }
+    }
+    if (pbool) {
+        return true;
+    }
+    if (
+*/  //for (int q = 0; q < pthloops->size(); q++) {
+        for (int i = 0; i < pthloops.size(); i++) {
+            if (find(vec2.begin(), vec2.end(), pthloops[i]) != vec2.end()) {
+                return false;
+            }
+        }
+        return true;
+}
+/*
+    if (pbool) {
+        time(&t2);
+        double diff = difftime(t2, t1);
+        distime += diff;
+        return true;
+    }
+    for (unsigned int k = 0; k < path.size(); k++) {
+        s1.clear();
+*/
+/*
+        pbool = true;
+        for (int p = 0; p < path[k].size(); p++) {
+            if (ploops.find(path[k][p]) != ploops.end()) {
+                pbool = false;
+            }
+        }
+//        copy(path[k].begin(), path[k].end(), inserter(s1, s1.end()));
+        if (!pbool) {
+*/
+/*
+        std::pair<std::pair<SgGraphNode*, SgGraphNode*>, std::pair<SgGraphNode*, SgGraphNode*> > flp;
+        flp.second.first = vec2[0];
+        flp.second.first = vec2[1];
+
+        flp.first.first = path[k][0];
+        flp.first.second = path[k][1];
+        if (vec2.front() == vec2.back()) {
+        time(&t2);
+        double diff = difftime(t2, t1);
+        distime += diff;
+
+            return false;
+        }
+        if (flpset.find(flp) != flpset.end()) {
+            //std::cout << "already seen" << std::endl;
+        time(&t2);
+        double diff = difftime(t2, t1);
+        distime += diff;
+
+            return false;
+        }
+*/
+/*
+        else if (goodset.find(flp) != goodset.end()) {
+            goodsetbool = true;
+        }
+*/
+/*
+        if (is_disjoint(s1,s2)) {
+            //goodset.insert(flp);
+            continue;
+        }
+        else {
+            return false;
+        }
+*/
+/*
+       else {
+        std::vector<SgGraphNode*> vec1 = path[k];
+        
+        //for (unsigned int i = 0; i < vec1.size(); i++) {
+            for (unsigned int j = 0; j < mkloopvec.size(); j++) {
+                std::vector<SgGraphNode*>::iterator q = find(vec1.begin(), vec1.end(), mkloopvec[j]);
+                if (q != vec1.end()) {
+                    if (*q != vec1[vec1.size() - 1] || j != 0) {
+                        
+                        flpset.insert(flp);
+      //                  std::cout << "not disjoint" << std::endl;
+        time(&t2);
+        double diff = difftime(t2, t1);
+        distime += diff;
+
+                        return false;
+                    }
+                }
+            }
+        //}
+        //goodset.insert(flp);
+    }
+    }
+    //}
+*/
+
+    
+/*
+    for (unsigned int p = 0; p < vec2.size(); p++) {
+        for (unsigned int q = 0; q < vec2.size(); q++) {
+            if (p != q) {
+                if (vec2[p] == vec2[q]) {
+                    return false;
+                }
+            }
+        }
+    }
+*/
+/*
+        time(&t2);
+        double diff = difftime(t2, t1);
+        distime += diff;
+
+    return true;
+}
+*/
+//checks for solvability of a node in nodal analysis
+
+template<class InheritedAttributeType, class SynthesizedAttributeType>
+bool
+SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
+canSolve(SgIncidenceDirectedGraph* g, SgGraphNode* n) {
+    bool loop = false;
+    if (inhVals.find(n) != inhVals.end()) {
+        return true;
+    }
+    std::set<SgDirectedGraphEdge*> oed = g->computeEdgeSetIn(n);
+    if (oed.size() == 0) {
+        return false;
+    }
+        for (std::set<SgDirectedGraphEdge*>::iterator i = oed.begin(); i != oed.end(); i++) {
+            if (inhVals.find((*i)->get_from()) == inhVals.end() && nullEdges.find(*i) == nullEdges.end()) {
+                return false;
+            }
+        }
+   return true;
+} 
+
+//this function evaluates values of paths via the user-defined pathAnalyze function
+
+template<class InheritedAttributeType, class SynthesizedAttributeType>
+void
+SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
+evaluatePathsPar(SgIncidenceDirectedGraph* g, SgGraphNode* realstartnode, SgGraphNode* endnode) {
+std::vector<std::vector<SgGraphNode*> > path;
+std::vector<SgGraphNode*> spath;
+SgGraphNode* n = realstartnode;
+int successes = 0;
+int failures = 0;
+int j = 0;
+std::vector<SgGraphNode*> currpthorg;
+int currint = 0;
+std::map<SgGraphNode*, int> intPath;
+intPath[n] = currint;
+currint++;
+std::map<SgGraphNode*, int> currents;
+SgGraphNode* currnode;
+bool step = false;
+bool midstep = false;
+
+//note: pathsAtMk is referring to subpaths connected to that marker, a marker is a split in the graph (usually an if statement)
+
+std::vector<std::vector<SgGraphNode*> > pth = pathsAtMk[realstartnode];
+std::vector<std::vector<SgGraphNode*> > cpth = pathsAtMk[realstartnode];
+    path.clear();
+    int disjoints = 0;
+    int disjointtrues = 0;
+    currpthorg = pth[0];
+    intPath[pth[0].front()] = currint;
+    std::set<SgGraphNode*> pthloopstmp;
+    SgGraphNode* fakenode;
+    pthloopstmp.insert(fakenode);
+    std::vector<std::set<SgGraphNode*> > pthloops;
+    pthloops.push_back(pthloopstmp);
+    pthloopstmp.clear();
+    currint++;
+    
+    int stepnum = 0;
+    std::vector<SgGraphNode*> rs;
+    rs.push_back(realstartnode);
+    path.push_back(rs);
+    currents.clear();
+
+    step = false;
+    std::vector<SgGraphNode*> sub;
+
+
+    std::set<std::vector<SgGraphNode*> > nullIncLoops;
+    std::vector<struct Bot*> todobotlst;
+    std::vector<struct Bot*> botlst;
+    struct Bot* rootBot = new Bot;
+    rootBot->remove = false;
+    
+    rootBot->path = path;
+    rootBot->currpth = currpthorg;
+    rootBot->pthloops = pthloops;
+    rootBot->on = true;
+     botlst.push_back(rootBot);
+    int tip = 1;
+    int ti = 1;
+    std::vector<std::pair<std::vector<SgGraphNode*>, std::vector<std::set<SgGraphNode*> > > > collectedPaths;
+    int maxlst = 0;
+    while (true) {
+    if (todobotlst.size()+botlst.size() > maxlst) {
+        maxlst = todobotlst.size()+botlst.size();
+        std::cout << "maxlst: " << maxlst << std::endl;
+        std::cout << "todobotlst.size(): " << todobotlst.size() << std::endl;
+        std::cout << "botlst.size(): " << botlst.size() << std::endl;
+    }
+    int MAXBOTS = 10000;
+    int MINPATHS = 1000;
+    int LOCALMAXBOTS = 10;
+    int LOCALMAXNODES = 0;
+    std::vector<struct Bot*> lstnullbot;
+    std::vector<std::vector<struct Bot*> > newbotlsts (MAXBOTS, lstnullbot);
+    //std::vector<struct Bot*> newbotlsts (MAXBOTS, lstnullbot);
+    //tip = ti;
+    //ti = 0;
+    ROSE_ASSERT(botlst.size() >= 0);
+    if (botlst.size() == 0) {
+        if (todobotlst.size() != 0) {
+            while (todobotlst.size() > 0 && botlst.size() < MAXBOTS) {
+                todobotlst.back()->on = true;
+                botlst.push_back(todobotlst.back());
+                todobotlst.pop_back();
+            }
+        }
+        else {
+            if (collectedPaths.size() > 0) {
+                  for (int i = 0; i < collectedPaths.size(); i++) {
+                  std::set<std::vector<SgGraphNode*> > incloops;
+                  std::vector<std::set<SgGraphNode*> > pthloops = collectedPaths[i].second;
+                  for (int q = 0; q < pthloops.size(); q++) {
+                  for (std::set<SgGraphNode*>::iterator p = pthloops[q].begin(); p != pthloops[q].end(); p++) {
+                    for (std::set<std::vector<SgGraphNode*> >::iterator o = mkloopmap[*p].begin(); o != mkloopmap[*p].end(); o++) {
+                        incloops.insert(*o);
+                    }
+                 }
+                 }
+
+
+        pathAnalyze(collectedPaths[i].first, false, incloops);
+    }
+    collectedPaths.clear();
+            }
+            break;
+        }
+    }
+    if (botlst.size() > 0) {
+    std::pair<std::vector<SgGraphNode*>, std::vector<std::set<SgGraphNode*> > > nullpr;
+    std::vector<std::pair<std::vector<SgGraphNode*>, std::vector<std::set<SgGraphNode*> > > > newpathslst (MAXBOTS, nullpr);
+    #pragma omp parallel for
+    for (int i = 0; i < botlst.size(); i++) {
+        //std::map<SgGraphNode*, std::set<std::vector<SgGraphNode*> > > mkloopmaptmp = mkloopmap;
+        std::vector<struct Bot*> localbotlst;
+        std::pair<std::vector<SgGraphNode*>, std::vector<std::set<SgGraphNode*> > > localnewpath;
+        struct Bot* currBot = botlst[i];
+        if (currBot->on) {
+        std::vector<SgGraphNode*> currpth = currBot->currpth;
+        std::vector<std::vector<SgGraphNode*> > path = currBot->path;
+        std::vector<std::set<SgGraphNode*> > pthloops = currBot->pthloops;
+        
+            if (currpth.back() == endnode) {
+            path.push_back(currpth);
+            std::vector<SgGraphNode*> flatpath;
+            std::set<std::vector<SgGraphNode*> > incloops;
+            struct timeval q1, q2;
+            ROSE_ASSERT(path.size() == pthloops.size() + 1);
+            q1 = getCPUTime();
+            for (unsigned int q = 0; q < pthloops.size(); q++) {
+                for (unsigned int r = 0; r < path[q].size(); r++) {
+                    flatpath.push_back(path[q][r]);
+                }
+
+/*
+#pragma omp critical
+{
+                for (std::set<SgGraphNode*>::iterator p = pthloops[q].begin(); p != pthloops[q].end(); p++) {
+                    for (std::set<std::vector<SgGraphNode*> >::iterator o = mkloopmap[*p].begin(); o != mkloopmap[*p].end(); o++) {
+                        incloops.insert(*o);
+                    }
+                 }
+}
+*/
+
+             }
+
+             for (unsigned int pt2 = 0; pt2 < path[path.size()-1].size(); pt2++) {
+                     flatpath.push_back(path[path.size()-1][pt2]);
+             }             
+             q2 = getCPUTime();
+             fllp += timeDifference(q2,q1);
+             flatpath.push_back(endnode);
+//user defined function, run on the final path, gives the user loops that are included via "incloops" a set of vectors that contain the individual loops
+/*
+             #pragma omp critical (analyze)
+{
+             pathAnalyze(flatpath, false, incloops);
+}
+*/
+             std::pair<std::vector<SgGraphNode*> , std::vector<std::set<SgGraphNode*> > > newcol;
+             newcol.first = flatpath;
+             newcol.second = pthloops;
+             localnewpath = newcol;
+             incloops.clear();
+
+             int pts = pathsSize++;
+             pathsSize += 1;
+            
+             flatpath.clear();
+             path.pop_back();
+             int rounds = 0;
+             bool starter = false;
+
+// This gets a bit complicated so here is an overview:
+// This is running down the graph and finding the endnode. Once it finds the endnode it goes back up to the last unevaluated subpath. It does this quickly with an integer that counts how many times that node has been used for a path. If this ends up being the number of outnodes, we don't need that node anymore, so we clear it to zero, then continue up the graph. We HAVE to reset because every time a new pathway is chosen above that node, it needs to have the ability to traverse that node.
+/*
+              if (currBot->nodelst.size() != 0) {
+                   while (path.back().back() != currBot->nodelst.back().first) {
+                       ROSE_ASSERT(path.size() != 0);
+                       path.pop_back();
+                       pthloops.pop_back();
+                       
+                   }
+                   currBot->path = path;
+                   currBot->pthloops = pthloops;
+                   currBot->currpth = pathsAtMk[(path.back()).back()][currBot->nodelst.back().second];
+                   currBot->nodelst.pop_back();
+                   localbotlst.push_back(currBot);
+             }
+             else {
+*/
+                 currBot->remove = true;
+                 localbotlst.push_back(currBot);
+             //}
+         }
+         else {
+
+//this checks first to see if we have any loops in our path. If not it continues down, if there is it goes back to the last nonloop node
+        bool disj = true;
+        struct timeval tdisb, tdise;
+        //tdisb = getCPUTime();
+        for (int x = 0; x < pthloops.size(); x++) {
+            for (std::set<SgGraphNode*>::iterator j = pthloops[x].begin(); j != pthloops[x].end(); j++) {
+                if (find(currpth.begin(), currpth.end(), *j) != currpth.end()) {
+                    disj = false;
+                }
+             }
+        }
+        //tdise = getCPUTime();
+        //distime += timeDifference(tdise, tdisb);
+        if (disj) {
+            
+            disjointtrues++;
+            //std::cout << "disjoints: " << disjointtrues << std::endl;
+            midstep = false;
+std::set<SgGraphNode*> pthloopstmp;
+            pthloopstmp.clear();
+                for (int i = 0; i < currpth.size(); i++) {
+                    //currflat.push_back(currpth[i]);
+                    if (mkloops.find(currpth[i]) != mkloops.end()) {
+                       pthloopstmp.insert(currpth[i]);
+                    }
+                }
+                pthloops.push_back(pthloopstmp);
+                path.push_back(currpth);
+                pthloopstmp.clear();
+                
+                //std::set<std::vector<SgGraphNode*> > lpth;
+                std::vector<SgGraphNode*> oldcurrpth = currpth;
+                currpth.clear();
+                        SgGraphNode* frontnode = (path.back()).front();
+                        SgGraphNode* backnode = (path.back()).back();
+     
+                        ROSE_ASSERT(pathsAtMk.find(backnode) != pathsAtMk.end() || backnode == endnode);
+                        ROSE_ASSERT(pathsAtMk.find(frontnode) != pathsAtMk.end());
+                        std::vector<std::vector<SgGraphNode*> > tmppths = pathsAtMk[backnode];
+                        currBot->currpth = tmppths[0];
+                        currBot->path = path;
+                        currBot->pthloops = pthloops;
+                        //newbotlst.push_back(currBot);
+                        for (int tp = 1; tp < tmppths.size(); tp++) {
+                            //if (localbotlst.size() < LOCALMAXBOTS) {
+/*
+                            if (currBot->nodelst.size() < LOCALMAXNODES) {
+                                std::pair<SgGraphNode*, int> cur;
+                                cur.second = tp;
+                                cur.first = path.back().back();
+                                currBot->nodelst.push_back(cur);
+                            }
+                            else {
+*/
+                                struct Bot* newBot = new Bot;
+                                newBot->remove = false;
+                                newBot->currpth = tmppths[tp];
+                                newBot->path = path;
+                                newBot->pthloops = pthloops;
+                                localbotlst.push_back(newBot);
+                                //ti++;
+ //                           }
+                        }
+                        localbotlst.push_back(currBot);
+                        //ti++;
+         }          
+         else {
+/*
+               if (currBot->nodelst.size() != 0) {
+                   while (path.back().back() != currBot->nodelst.back().first) {
+                       ROSE_ASSERT(path.size() != 0);
+                       path.pop_back();
+                       pthloops.pop_back();
+                       
+                   }
+                   currBot->path = path;
+                   currBot->pthloops = pthloops;
+                   currBot->currpth =  pathsAtMk[(path.back()).back()][currBot->nodelst.back().second];
+                   currBot->nodelst.pop_back();
+                   localbotlst.push_back(currBot);
+                   //ti++;
+             }
+
+             else {
+*/
+                 currBot->remove = true;
+                 localbotlst.push_back(currBot);
+                 //delete currBot;
+ //            }
+
+        }
+     }
+ newpathslst[i] = localnewpath;
+ newbotlsts[i] = localbotlst;
+ }
+}
+ botlst.clear();
+ int num = 0;
+
+ for (int i = 0; i < newbotlsts.size(); i++) {
+    if (newpathslst[i].first.size() > 0) {
+        collectedPaths.push_back(newpathslst[i]);
+    }
+    for (int j = 0; j < newbotlsts[i].size(); j++) {
+        if (newbotlsts[i][j]->remove == true) {
+            delete newbotlsts[i][j];
+        }
+        else if (num < MAXBOTS) {
+            newbotlsts[i][j]->on = true;
+            botlst.push_back(newbotlsts[i][j]);
+            num++;
+        }
+        else {
+            newbotlsts[i][j]->on = false;
+            todobotlst.push_back(newbotlsts[i][j]);
+        }
+    }
+}
+
+if (collectedPaths.size() > MINPATHS) {
+          
+    for (int i = 0; i < collectedPaths.size(); i++) {
+                 std::vector<std::set<SgGraphNode*> > pthloops;   
+                std::set<std::vector<SgGraphNode*> > incloops;
+                pthloops = collectedPaths[i].second;
+                for (int q = 0; q < pthloops.size(); q++) {
+                for (std::set<SgGraphNode*>::iterator p = pthloops[q].begin(); p != pthloops[q].end(); p++) {
+                    for (std::set<std::vector<SgGraphNode*> >::iterator o = mkloopmap[*p].begin(); o != mkloopmap[*p].end(); o++) {
+                        incloops.insert(*o);
+                    }
+                 }
+               }
+
+        pathAnalyze(collectedPaths[i].first, false, incloops);
+    }
+    collectedPaths.clear();
+}
+}
+ else {
+            if (collectedPaths.size() > 0) {
+            for (int i = 0; i < collectedPaths.size(); i++) {
+                std::set<std::vector<SgGraphNode*> > incloops;
+                pthloops = collectedPaths[i].second;
+                for (int q = 0; q < pthloops.size(); q++) {
+                for (std::set<SgGraphNode*>::iterator p = pthloops[q].begin(); p != pthloops[q].end(); p++) {
+                    for (std::set<std::vector<SgGraphNode*> >::iterator o = mkloopmap[*p].begin(); o != mkloopmap[*p].end(); o++) {
+                        incloops.insert(*o);
+                    }
+                 }
+               }
+ 
+        pathAnalyze(collectedPaths[i].first, false, incloops);
+    }
+    }
+    collectedPaths.clear();
+ break;
+ }
+}
+
+std::cout << "successes: " << successes << std::endl;
+std::cout << "failures: " << failures << std::endl;
+std::cout << "maxlst: " << maxlst << std::endl;
+return;
+}
+
+
+
+template<class InheritedAttributeType, class SynthesizedAttributeType>
+void
+SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
+evaluatePaths(SgIncidenceDirectedGraph* g, SgGraphNode* realstartnode, SgGraphNode* endnode) {
+//std::set<SgGraphNode*> seen;
+//for (std::map<SgGraphNode*, std::vector<std::vector<SgGraphNode*> > >::iterator i = pathsAtMk.begin(); i != pathsAtMk.end(); i++) {
+/*    
+    std::vector<std::vector<SgGraphNode*> > tocheck = (*i).second;
+    for (int j = 0; j < tocheck.size(); j++) {
+        for (int k = 0; k < tocheck[j].size(); k++) {
+            if (seen.find(tocheck[j][k]) != seen.end()) {
+                ploops.insert(tocheck[j][k]);
+            }
+            else {
+                seen.insert(tocheck[j][k]);
+            }
+        }
+    }
+}
+*/     
+std::vector<std::vector<SgGraphNode*> > path;
+std::vector<SgGraphNode*> spath;
+SgGraphNode* n = realstartnode;
+int successes = 0;
+int failures = 0;
+int j = 0;
+std::vector<SgGraphNode*> currpth;
+int currint = 0;
+std::map<SgGraphNode*, int> intPath;
+intPath[n] = currint;
+currint++;
+std::map<SgGraphNode*, int> currents;
+SgGraphNode* currnode;
+bool step = false;
+bool midstep = false;
+
+//note: pathsAtMk is referring to subpaths connected to that marker, a marker is a split in the graph (usually an if statement)
+
+std::vector<std::vector<SgGraphNode*> > pth = pathsAtMk[realstartnode];
+std::vector<std::vector<SgGraphNode*> > cpth = pathsAtMk[realstartnode];
+    path.clear();
+    int disjoints = 0;
+    int disjointtrues = 0;
+    currpth = pth[0];
+    intPath[pth[0].front()] = currint;
+    std::set<SgGraphNode*> pthloopstmp;
+    SgGraphNode* fakenode;
+    pthloopstmp.insert(fakenode);
+    std::vector<std::set<SgGraphNode*> > pthloops;
+    pthloops.push_back(pthloopstmp);
+    pthloopstmp.clear();
+    currint++;
+    
+    int stepnum = 0;
+    std::vector<SgGraphNode*> rs;
+    rs.push_back(realstartnode);
+    path.push_back(rs);
+    //currflat.push_back(realstartnode);
+    currents.clear();
+
+    step = false;
+    //std::vector<SgGraphNode*> currflat;
+    std::vector<SgGraphNode*> sub;
+
+/*
+    std::ofstream mz;
+    mz.open("pathanalysis.dot");
+    mz << "digraph defaultName { \n";
+*/
+    std::set<std::vector<SgGraphNode*> > nullIncLoops;
+
+/*
+    for (unsigned int p = 0; p < looppaths.size(); p++) {
+        std::vector<SgGraphNode*> lp = looppaths[p];
+
+        for (unsigned int i = 0; i < lp.size()-1; i++) {
+            for (unsigned int l = i+1; l < lp.size(); l++) {
+                if (lp[i] == lp[l] && lp[i] != realstartnode && lp[i] != endnode) {
+                std::vector<SgGraphNode*> interiorloop;
+                interiorloop.clear();
+                for (unsigned int j = i; j < l+1; j++) {
+                    interiorloop.push_back(lp[j]);
+                }
+                if (interiorloop.size() > 2) {
+                }
+                if (interiorloop.size() > 2 && interiorloop.back() != endnode) {
+                if (find(iLoops.begin(), iLoops.end(), interiorloop) == iLoops.end()) {
+                    if (find(looppaths.begin(), looppaths.end(), interiorloop) == looppaths.end()) {
+                        iLoops.push_back(interiorloop);
+                        loopnum++;
+                        for (unsigned int k = 0; k < interiorloop.size(); k++) {
+                             loopNumMap[interiorloop[k]] = loopnum;
+                        }
+                        lpbegins[interiorloop.front()].insert(interiorloop);
+                        pathAnalyze(interiorloop, true, nullIncLoops);
+                        
+                    }
+                }
+                }
+                }
+            }
+        }
+        if (lp.size() > 2) {   
+            lpbegins[lp.front()].insert(lp);      
+            pathAnalyze(lp, true, nullIncLoops);
+            //for (unsigned int i = 1; i < lp.size(); i++) {
+            //    printNodePlusEdgesForAnalysisPath(g, lp, p, p, mz);
+            //}
+        }
+    }
+*/
+    while (step == false) {
+        stepnum++;
+        
+        if (currpth.back() == endnode) {
+            path.push_back(currpth);
+            //for (int i = 0; i < currpth.size(); i++) {
+            //    currflat.push_back(currpth[i]);
+            //}
+            std::vector<SgGraphNode*> flatpath;
+            //std::vector<SgGraphNode*> sub;
+            std::set<std::vector<SgGraphNode*> > incloops;
+            struct timeval q1, q2;
+            //std::cout << "path.size(): " << path.size() << std::endl;
+            //std::cout << "pthloops.size(): " << pthloops.size() << std::endl;
+            ROSE_ASSERT(path.size() == pthloops.size() + 1);
+            q1 = getCPUTime();
+            for (unsigned int q = 0; q < pthloops.size(); q++) {
+                //sub = path[q];
+                //sub.pop_back();
+                for (unsigned int r = 0; r < path[q].size(); r++) {
+                    flatpath.push_back(path[q][r]);
+                }
+                for (std::set<SgGraphNode*>::iterator p = pthloops[q].begin(); p != pthloops[q].end(); p++) {
+                    for (std::set<std::vector<SgGraphNode*> >::iterator o = mkloopmap[*p].begin(); o != mkloopmap[*p].end(); o++) {
+                        incloops.insert(*o);
+                    }
+                 }
+             }
+             for (unsigned int pt2 = 0; pt2 < path[path.size()-1].size(); pt2++) {
+                     flatpath.push_back(path[path.size()-1][pt2]);
+             }
+             
+             q2 = getCPUTime();
+             fllp += timeDifference(q2,q1);
+             flatpath.push_back(endnode);
+/* 
+            for (unsigned int ps = 0; ps < flatpath.size(); ps++) {
+                 if (lpbegins.find(flatpath[ps]) != lpbegins.end()) {
+                     for (std::set<std::vector<SgGraphNode*> >::iterator sv = lpbegins[flatpath[ps]].begin(); sv != lpbegins[flatpath[ps]].end(); sv++) {
+                         incloops.insert(*sv);
+                     }
+                 }
+             }
+*/
+//user defined function, run on the final path, gives the user loops that are included via "incloops" a set of vectors that contain the individual loops
+             pathAnalyze(flatpath, false, incloops);
+             incloops.clear();
+                //printNodePlusEdgesForAnalysisPath(g, flatpath, -1, -1, mz);
+
+             int pts = pathsSize++;
+             pathsSize += 1;
+            
+             flatpath.clear();
+             path.pop_back();
+             int rounds = 0;
+             bool starter = false;
+
+// This gets a bit complicated so here is an overview:
+// This is running down the graph and finding the endnode. Once it finds the endnode it goes back up to the last unevaluated subpath. It does this quickly with an integer that counts how many times that node has been used for a path. If this ends up being the number of outnodes, we don't need that node anymore, so we clear it to zero, then continue up the graph. We HAVE to reset because every time a new pathway is chosen above that node, it needs to have the ability to traverse that node.
+
+
+              while (true) {
+                   rounds++;
+                   ROSE_ASSERT(pathsAtMk.find((path.back()).back()) != pathsAtMk.end());
+                   if ((path.back()).front() == realstartnode) {
+                       starter = true;
+                   }
+                   if (currents[(path.back()).back()] < (pathsAtMk[(path.back()).back()].size()) /*|| (path.back()).front() == realstartnode*/) {
+                              std::vector<std::vector<SgGraphNode*> > cpths = pathsAtMk[(path.back()).back()];
+                              currpth = cpths[currents[(path.back()).back()]];
+                              currents[(path.back()).back()]++;
+                              break;
+                   }
+                   else {
+                       currents[(path.back()).back()] = 0;
+                       path.pop_back();
+                       pthloops.pop_back();
+                   }
+                   if (starter == true) {
+                       step = true;
+                       break;
+                   }
+
+           }
+        }
+        else {
+
+//this checks first to see if we have any loops in our path. If not it continues down, if there is it goes back to the last nonloop node
+        bool disj = true;
+        struct timeval tdisb, tdise;
+        tdisb = getCPUTime();
+        for (int i = 0; i < pthloops.size(); i++) {
+            for (std::set<SgGraphNode*>::iterator j = pthloops[i].begin(); j != pthloops[i].end(); j++) {
+                if (find(currpth.begin(), currpth.end(), *j) != currpth.end()) {
+                    disj = false;
+                }
+             }
+        }
+/*
+        #pragma omp parallel for num_threads(4) private(i,j)
+        for (i = 0; i < pthloops.size(); i++) {
+            if (disj) {
+            for (std::set<SgGraphNode*>::iterator j = pthloops[i].begin(); j != pthloops[i].end(); j++) {
+                if (find(currpth.begin(), currpth.end(), *j) != currpth.end()) {
+                    disj = false;
+                    //j = pthloops[i].size();
+                }
+            }
+            }
+            
+        }
+*/
+        tdise = getCPUTime();
+        distime += timeDifference(tdise, tdisb);
+        if (disj) {
+            
+            disjointtrues++;
+            //std::cout << "disjoints: " << disjointtrues << std::endl;
+            midstep = false;
+            std::set<SgGraphNode*> pthloopstmp;
+            pthloopstmp.clear();
+                for (int i = 0; i < currpth.size(); i++) {
+                    //currflat.push_back(currpth[i]);
+                    if (mkloops.find(currpth[i]) != mkloops.end()) {
+                       pthloopstmp.insert(currpth[i]);
+                    }
+                }
+                pthloops.push_back(pthloopstmp);
+                path.push_back(currpth);
+                pthloopstmp.clear();
+                
+                //std::set<std::vector<SgGraphNode*> > lpth;
+                std::vector<SgGraphNode*> oldcurrpth = currpth;
+                currpth.clear();
+                if (currents.find((path.back()).back()) == currents.end()) {
+                    currents[(path.back()).back()] = 0;
+                }
+                        SgGraphNode* frontnode = (path.back()).front();
+                        SgGraphNode* backnode = (path.back()).back();
+     
+                        ROSE_ASSERT(pathsAtMk.find(backnode) != pathsAtMk.end() || backnode == endnode);
+                        ROSE_ASSERT(pathsAtMk.find(frontnode) != pathsAtMk.end());
+                        if (currents.find(backnode) == currents.end()) {
+                            currents[backnode] = 0;
+                        }
+                        else {
+                            ROSE_ASSERT(currents[backnode] == 0);
+                        }
+                        std::vector<std::vector<SgGraphNode*> > tmppths = pathsAtMk[backnode];
+                       
+                        currpth = tmppths[currents[backnode]];
+                        ROSE_ASSERT(currpth != oldcurrpth);
+                        currents[backnode]++;
+                    }        
+     else {
+        disjoints++;
+        //std::cout << "disjoint false: " << s << std::endl;
+        
+        while (true) {
+            if (currents[(path.back()).back()] < pathsAtMk[(path.back()).back()].size() || path.back().back() == realstartnode) {
+                break;
+            }
+            currents[(path.back()).back()] = 0;
+            path.pop_back();
+            pthloops.pop_back();
+        }
+        if ((path.back()).back() != realstartnode) {
+        currpth = (pathsAtMk[(path.back()).back()])[currents[(path.back()).back()]];
+        currents[(path.back()).back()]++;
+        }
+        else {
+        step = true;
+        }
+    }
+ }
+ }
+std::cout << "successes: " << successes << std::endl;
+std::cout << "failures: " << failures << std::endl;
+
+return;
+}
+    
+        
+//these are debugging functions, used to visually ascertain where the paths are going to check to make sure everything is evaluated
+
+
+/* DEBUGGING */
+
+template<class InheritedAttributeType, class SynthesizedAttributeType>
+void
+SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
+printNodePlusEdgesForAnalysis(SgIncidenceDirectedGraph* g, SgGraphNode* n, int loopNum, int pathVal, std::ofstream& ss) {
+  printNodeForAnalysis(n, loopNum, pathVal, ss);
+  std::set<SgDirectedGraphEdge*> outEdges = g->computeEdgeSetOut(n);
+  for (std::set<SgDirectedGraphEdge*>::iterator i = outEdges.begin(); i != outEdges.end(); i++) {
+    if (nullEdgesOrdered.find(*i) == nullEdgesOrdered.end()) {
+        printEdgeForAnalysis(*i, false, ss);
+    }
+    else {
+        printEdgeForAnalysis(*i, true, ss);
+    }   
+  }
+}
+
+template<class InheritedAttributeType, class SynthesizedAttributeType>
+void
+SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
+printNodePlusEdgesForAnalysisPath(SgIncidenceDirectedGraph* g, std::vector<SgGraphNode*> n, int loopNum, int pathVal, std::ofstream& ss) {
+  for (unsigned int i = 0; i < n.size()-1; i++) {
+     if (completedNodesPath.find(n[i]) == completedNodesPath.end()) {
+         printNodeForAnalysis(n[i], loopNum, pathVal, ss);
+         completedNodesPath.insert(n[i]);
+     }
+     std::pair<SgGraphNode*, SgGraphNode*> prnod;
+     prnod.first = n[i+1];
+     prnod.second = n[i];
+     if (completedEdgesPath.find(prnod) == completedEdgesPath.end()) {
+         printEdgeForAnalysisPath(n[i+1], n[i], ss);
+         completedEdgesPath.insert(prnod);
+     }
+  }
+  if (completedNodesPath.find(n[n.size() - 1]) == completedNodesPath.end()) {
+     printNodeForAnalysis(n[n.size()-1], loopNum, pathVal, ss);
+     completedNodesPath.insert(n[n.size() - 1]);
+  }
+
+}
+
+
+template<class InheritedAttributeType, class SynthesizedAttributeType>
+void
+SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
+printNodeForAnalysis(SgGraphNode* n, int loopNum, int pathNum, std::ofstream &ss) {
+  int id = n->get_index();
+  std::string nodeColor = "black";
+  if (loopNum != 0) {
+  ss << id << " [label=\"" << "LoopNumS" << loopNum << "\", color=\"" << "green" << "\", style=\"" << "solid" << "\"];\n";
+  }
+  else {
+  ss << id << " [label=\"" << "pathNumS" << pathNum << "\", color=\"" << "black" << "\", style=\"" << "dotted" << "\"];\n";
+  }
+  
+}
+template<class InheritedAttributeType, class SynthesizedAttributeType>
+void
+SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
+printEdgeForAnalysis(SgDirectedGraphEdge* e, bool isNullEdge, std::ofstream &ss) {
+  if (isNullEdge) {
+      ss << e->get_from()->get_index() << " -> " << e->get_to()->get_index() << " [label=\"" << "NullEdge" << "\", style=\"" << "dotted" << "\"];\n";
+  }
+  else {
+      ss << e->get_from()->get_index() << " -> " << e->get_to()->get_index() << " [label=\"" << "\", style=\"" << "solid" << "\"];\n";
+  }
+}
+template<class InheritedAttributeType, class SynthesizedAttributeType>
+void
+SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
+printEdgeForAnalysisPath(SgGraphNode* g1, SgGraphNode* g2, std::ofstream &ss) {
+      ss << g2->get_index() << " -> " << g1->get_index() << " [label=\"" << "Edge" << "\", style=\"" << "solid" << "\"];\n";
+}
+
+/* END DEBUGGING */
+
+//This function sets up the graph so that the evaluatePath function can easily traverse the paths
+
+template<class InheritedAttributeType, class SynthesizedAttributeType>
+void
+SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
+solvePaths(SgIncidenceDirectedGraph* g, SgGraphNode* n, SgGraphNode* endnode) {
+    bool done = false;
+    bool edges = true;
+    bool tookone = false;
+    std::vector<SgGraphNode*> mkpath;
+    std::vector<SgGraphNode*> marks;
+    marks.push_back(n);
+    mkglobal.push_back(n);
+    SgGraphNode* currn = n;
+    SgGraphNode* took;
+    std::set<SgDirectedGraphEdge*> taken;
+    std::vector<SgGraphNode*> toTake;
+    std::vector<SgGraphNode*> path;
+    path.push_back(n);
+    mkpath.push_back(n);
+    int itr = 0;
+    int bifurcations = 0;
+    std::map<SgGraphNode*, bool> completed;
+    while (done == false) {
+             ROSE_ASSERT(currn != NULL);
+//check to see if we've hit the endnode or if we're done, if not continue, if so push the subpath into the "pathsAtMk" repository            
+               if (currn == endnode || completed.find(currn) != completed.end()) {
+                if (pathsAtMk.find(marks.back()) == pathsAtMk.end()) {
+                    std::vector<std::vector<SgGraphNode*> > emptypath;
+                    pathsAtMk[marks.back()] = emptypath;
+                }
+                edges = false;
+                pathsAtMk[marks.back()].push_back(mkpath);
+                //for (int mk = 0; mk < mkpath.size(); mk++) {
+                 //   std::set<SgDirectedGraphEdge*> iedg = g->computeEdgeSetIn(mkpath[mk]);
+                    //if (iedg.size() > 1) {
+                    //    ploops.insert(mkpath[mk]);
+                   // }
+                //}
+                ROSE_ASSERT(mkpath.front() == marks.back());
+                if (marks.size() == 0) {
+                    return;
+                }
+                mkpath.clear();
+                bool y = true;
+                bool haventtaken = false;
+                bool p = true;
+                int place;
+                bool found = false;
+                while (found == false) {
+                    if (marks.size() == 0) {
+                        return;
+                    }
+                    SgDirectedGraphEdge* tooked;
+                    SgGraphNode* mark1 = marks.back();
+                    std::set<SgDirectedGraphEdge*> oedg = g->computeEdgeSetOut(mark1);
+                    ROSE_ASSERT(oedg.size() > 1 || mark1 == n);
+                        for (std::set<SgDirectedGraphEdge*>::iterator j = oedg.begin(); j != oedg.end(); j++) {
+                            if (taken.find(*j) == taken.end() && haventtaken == false) {
+                                tooked = *j;
+                                haventtaken = true;
+                            }
+                        }
+                        if (haventtaken == true) {
+                            if (marks.back() == n) {
+                                path.clear();
+                            }
+                            path.push_back(marks.back());
+                            if ( mkpath.empty() || (mkpath.back() != marks.back()) ) {
+                                ROSE_ASSERT(!marks.empty());
+                                mkpath.push_back(marks.back());
+                            }
+                            taken.insert(tooked);
+                            took = tooked->get_to();
+                            found = true;
+                        }
+                        else {
+                            completed[marks.back()] = true;
+                            bifurcations++;
+                            marks.pop_back();
+                        }
+                    }
+                    if (marks.size() == 0) {
+                        return;
+                    } 
+                    haventtaken = false;
+                    found = false; 
+                                
+             }
+//if we haven't reached the endnode or completed, continue down the graph
+             else {
+            std::set<SgDirectedGraphEdge*> oedg = g->computeEdgeSetOut(currn);
+            std::set<SgDirectedGraphEdge*> iedg = g->computeEdgeSetIn(currn);
+            if (oedg.size() > 1) {
+                     if (mkpath.back() != currn) {
+                     mkpath.push_back(currn);
+                     }
+                     pathsAtMk[marks.back()].push_back(mkpath);
+                     mkpath.clear();
+                     mkpath.push_back(currn);
+                     marks.push_back(currn);
+                     if (find(mkglobal.begin(), mkglobal.end(), currn) == mkglobal.end()) {
+                         mkglobal.push_back(currn);
+                     }
+                     for (std::set<SgDirectedGraphEdge*>::iterator i = oedg.begin(); i != oedg.end(); i++) {
+                          if (taken.find(*i) == taken.end() && tookone == false) {
+                               taken.insert(*i);
+                               tookone = true;
+                               took = (*i)->get_to();
+                          }
+                          else if (taken.find(*i) == taken.end() && tookone == true) {
+                               //toTake.push_back((*i)->get_to());
+                          }
+                   }
+                   tookone = false;
+           }
+           else {
+                took = (*(oedg.begin()))->get_to();
+           }
+           }
+           itr++;
+           
+           if (find(path.begin(), path.end(), took) == path.end()) {
+               mkpath.push_back(took);
+               path.push_back(took);
+               currn = took;
+           }
+           else {
+               mkloops.insert(took);
+               std::vector<SgGraphNode*> lptemp;
+               lptemp.clear();
+               lptemp.push_back(took);
+               while (path.back() != took) {
+                   
+                   path.pop_back();
+                  
+                   lptemp.push_back(path.back());
+                   
+               }
+               (mkloopmap[took]).insert(lptemp);
+/*
+               if (lptemp.size() > 1) {
+               if (find(looppaths.begin(), looppaths.end(), lptemp) == looppaths.end() && find(lptemp.begin(), lptemp.end(), st) == lptemp.end() && find(lptemp.begin(), lptemp.end(), endnode) == lptemp.end()) {
+                   looppaths.push_back(lptemp);
+                   loopnum++;
+                   for (unsigned int i = 0; i < lptemp.size(); i++) {
+                       loopNumMap[lptemp[i]] = loopnum;
+                   }
+               }
+               }
+*/
+               path.push_back(took);
+               currn = path.back();
+               mkpath.push_back(took);
+           }
+           
+               
+}
+           return;
+}
+
+//not currently useful
+template <class InheritedAttributeType, class SynthesizedAttributeType>
+SynthesizedAttributeType
+SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
+defaultSynthesizedAttribute(InheritedAttributeType inh)
+{
+    SynthesizedAttributeType s = SynthesizedAttributeType();
+    return s;
+}
+
+
+//computes the order in which to evaluate the nodes in nodal analysis so that you don't evaluate a node before you evaluate its parents
+
+template <class InheritedAttributeType, class SynthesizedAttributeType>
+void
+SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
+computeOrder(SgIncidenceDirectedGraph* g, SgGraphNode* n, SgGraphNode* endnode) {
+    std::map<SgGraphNode*, int> incomputables;
+    std::set<SgGraphNode*> lpposs;
+    //std::set<SgGraphNode*> lps;
+    SgGraphNode* currn;
+    currn = n;
+    int orders = 0; 
+    while (true) {
+        if (orders % 10000 == 0) {
+            std::cout << "orders: " << orders << std::endl;
+        }
+        orders++;
+        if (currn == endnode) {
+        }
+        if (computable(g, currn) || currn == n) {
+            int mp;
+            if (oVals.find(currn) == oVals.end()) {
+                 oVals[currn] = currm++;
+                 iVals[currm++] = currn;
+                 currm += 1;
+            }
+            if (currn == endnode) {
+                
+                break;
+            }
+            std::pair<bool, SgGraphNode*> pbs = getNextChild(g, currn);
+            computedNodes.insert(currn);
+            ROSE_ASSERT(pbs.first == true);
+            currn = pbs.second;
+        }
+        else {
+            std::pair<bool, SgGraphNode*> pbp = getNextPar(g, currn);
+            ROSE_ASSERT(pbp.first == true);
+            currn = pbp.second;
+            
+        }
+        
+    }
+    std::cout << "required orders" << orders << std::endl;
+    std::cout << "incomputables.size() " << incomputables.size() << std::endl;
+}
+
+//simple fucntion to check the computability under nodal analysis
+template <class InheritedAttributeType, class SynthesizedAttributeType>
+bool
+SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
+computable(SgIncidenceDirectedGraph* g, SgGraphNode* n) {
+    if (computedNodes.find(n) != computedNodes.end()) {
+        return true;
+    }
+    std::set<SgDirectedGraphEdge*> ed = g->computeEdgeSetIn(n);
+    bool comp = true;
+    for (std::set<SgDirectedGraphEdge*>::iterator i = ed.begin(); i != ed.end(); i++) {
+        if (oVals.find((*i)->get_from()) == oVals.end() && nullEdgesOrdered.find(*i) == nullEdgesOrdered.end()) {
+            comp = false;
+        }
+    }
+    return comp;
+}
+
+
+//computes the inherited attribute values in nodal analysis
+
+template <class InheritedAttributeType, class SynthesizedAttributeType>
+void
+SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
+computeInheritedOrdered(SgIncidenceDirectedGraph* g, SgGraphNode* n) {
+    int runs = 0;
+//    std::ofstream mf;
+//    mf.open("analysis.dot");
+//    mf << "digraph defaultName { \n";
+    for (std::map<int, SgGraphNode*>::iterator i = iVals.begin(); i != iVals.end(); i++) {
+        runs++;
+        ROSE_ASSERT(canEval(g, (*i).second));
+        setPathVal(g, n);
+        //printNodePlusEdgesForAnalysis(g, (*i).second, loopNumMap[(*i).second], pathValMap[(*i).second], mf);
+        evalNodeOrdered(g, (*i).second);
+    }
+}
+
+//checks to see if evaluation is possible under nodal analysis
+template <class InheritedAttributeType, class SynthesizedAttributeType>
+bool
+SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
+canEval(SgIncidenceDirectedGraph* g, SgGraphNode* n) {
+    bool evaled = true;
+    if (inhVals.find(n) == inhVals.end()) {
+    std::set<SgDirectedGraphEdge*> ins = g->computeEdgeSetIn(n);
+    for (std::set<SgDirectedGraphEdge*>::iterator i = ins.begin(); i != ins.end(); i++) {
+        if (inhVals.find((*i)->get_from()) == inhVals.end() && nullEdgesOrdered.find(*i) == nullEdgesOrdered.end()) {
+            evaled = false;
+        }
+    }
+    }
+    return evaled;
+}
+
+
+//actually does the evaluation
+template <class InheritedAttributeType, class SynthesizedAttributeType>
+void
+SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
+evalNodeOrdered(SgIncidenceDirectedGraph* g, SgGraphNode* n) {
+    if (inhVals.find(n) != inhVals.end()) {
+        return;
+    }
+    std::set<SgDirectedGraphEdge*> par = g->computeEdgeSetIn(n);
+    std::vector<InheritedAttributeType> inh;
+    for (std::set<SgDirectedGraphEdge*>::iterator i = par.begin(); i != par.end(); i++) {
+        if (inhVals.find((*i)->get_from()) != inhVals.end()) {
+            inh.push_back(inhVals[(*i)->get_from()]);
+        }
+    }
+    
+    if (n != st || inh.size() > 0) {
+        InheritedAttributeType inhX;
+        inhX = evaluateInheritedAttribute(n, inh);
+        inhVals[n] = inhX;
+    }
+    //std::cout << "num of inhVals: " << inh.size() << std::endl;
+    
+}
+
+
+//debugging function, currently not useful for the end user
+template <class InheritedAttributeType, class SynthesizedAttributeType>
+void
+SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
+setPathVal(SgIncidenceDirectedGraph* g, SgGraphNode* currn) {
+       if (pathValMap.find(currn) != pathValMap.end()) {
+           return;
+       }
+       std::set<SgDirectedGraphEdge*> ined = g->computeEdgeSetIn(currn);
+       int tmppathcount = 0;
+       for (std::set<SgDirectedGraphEdge*>::iterator i = ined.begin(); i != ined.end(); i++) {
+            ROSE_ASSERT(pathValMap.find((*i)->get_from()) != pathValMap.end() /*|| nullEdgesOrdered.find(*i) != nullEdgesOrdered.end()*/);
+            //if (nullEdgesOrdered.find(*i) != nullEdgesOrdered.end()) {
+            //    pathValMap[(*i)->get_from()] = 0;
+           // }
+            int pv = pathValMap[(*i)->get_from()];
+            if (pv != 0) {
+            tmppathcount += pv;
+            }
+        }
+        pathValMap[currn] = tmppathcount;
+        return;
+    }
+
+//computes the next child to be analyzed in nodal analysis
+template <class InheritedAttributeType, class SynthesizedAttributeType>
+std::pair<bool, SgGraphNode*>
+SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
+getNextChild(SgIncidenceDirectedGraph* g, SgGraphNode* n) {
+    bool nullPoss = false;
+    //std::cout << "nextChild" << std::endl;
+    std::set<SgDirectedGraphEdge*> outs = g->computeEdgeSetOut(n);
+    //std::cout << "outs.size(): " << outs.size() << std::endl;
+    //std::cout << "outs: " << outs.size() << std::endl;
+    SgGraphNode* nextNode;
+    SgGraphNode* nullNode;
+    bool completed = false;
+    bool completeNull = false;
+    
+    for (std::set<SgDirectedGraphEdge*>::iterator i = outs.begin(); i != outs.end(); i++) {
+
+        if (outs.size() == 1) {
+            nextNode = (*i)->get_to();
+            if (nullEdgesOrdered.find(*i) != nullEdgesOrdered.end()) {
+                nullNum++;
+            }
+            //completedEdges.insert(*i);
+            completed = true;
+        }
+        else if (completed == false && computedNodes.find((*i)->get_to()) == computedNodes.end()) {
+            completed = true;
+            nextNode = (*i)->get_to();
+            if (nullEdgesOrdered.find(*i) != nullEdgesOrdered.end()) {
+                nullNum++;
+            }
+            completedEdgesOut.insert(*i);
+        }
+        
+            
+    }
+    std::pair<bool, SgGraphNode*> pr;
+    ROSE_ASSERT (completed == true || completeNull == true);
+    if (completed == true) {
+        pr.first = completed;
+        pr.second = nextNode;
+        return pr;
+    }
+    else {
+        pr.first = true;
+        pr.second = nullNode;
+        return pr;
+    } 
+    
+}
+
+//computes the next parent to be analyzed in nodal analysis
+template <class InheritedAttributeType, class SynthesizedAttributeType>
+std::pair<bool, SgGraphNode*>
+SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
+getNextPar(SgIncidenceDirectedGraph* g, SgGraphNode* n) {
+    std::set<SgDirectedGraphEdge*> ins = g->computeEdgeSetIn(n);
+    SgGraphNode* nextPar;
+    SgDirectedGraphEdge* nullEdgeO;
+    bool completed = false;
+    bool completeNull = false;
+    for (std::set<SgDirectedGraphEdge*>::iterator i = ins.begin(); i != ins.end(); i++) {
+
+        if (ins.size() == 1 /*&& completedEdges.find(*i) == completedEdges.end()*/) {
+            completed = true;
+            completedEdges.insert(*i);
+            nextPar = (*i)->get_from();
+        }
+
+        else if (completedEdges.find(*i) == completedEdges.end() && completed == false) {
+            completed = true;
+            nextPar = (*i)->get_from();
+            completedEdges.insert(*i);
+        }
+
+        else if (completedEdges.find(*i) != completedEdges.end() && computedNodes.find((*i)->get_from()) == computedNodes.end() && completed == false /*&& nullEdgesOrdered.find(*i) == nullEdgesOrdered.end()*/) {
+            completeNull = true;
+            std::pair<SgGraphNode*, SgGraphNode*> lpp;
+            nextPar = n;
+            nullEdgesOrdered.insert(*i);
+            nullEdgesPaths++;
+            
+        }
+    }
+    ROSE_ASSERT(completed == true || completeNull == true);
+    std::pair<bool, SgGraphNode*> pr;
+    pr.first = completed;
+    pr.second = nextPar;
+
+    if (completeNull == true && completed == false) {
+        pr.first = completeNull;
+        pr.second = nextPar;
+    }
+   
+    return pr;
+}
+ 
+    
+
+
+
+
+
+
+ 
+    
+
+  
+        
+    
+            
diff --git a/src/midend/astProcessing/graphTemplate.h b/src/midend/astProcessing/graphTemplate.h
new file mode 100644
index 00000000000..e3075618ffb
--- /dev/null
+++ b/src/midend/astProcessing/graphTemplate.h
@@ -0,0 +1,533 @@
+#ifndef BACKSTROKE_CFG_H
+#define BACKSTROKE_CFG_H
+
+
+#include <rose.h>
+#include <boost/graph/adjacency_list.hpp>
+#include <boost/bind.hpp>
+#include <boost/foreach.hpp>
+#include <boost/tuple/tuple.hpp>
+#include <boost/graph/graphviz.hpp>
+#include <boost/graph/dominator_tree.hpp>
+#include <boost/graph/reverse_graph.hpp>
+#include <boost/graph/transpose_graph.hpp>
+#include <boost/algorithm/string.hpp>
+
+
+namespace Backstroke
+{
+
+#define foreach BOOST_FOREACH
+
+
+//! This function helps to write the DOT file for vertices.
+template <class CFGNodeType>
+void writeCFGNode(std::ostream& out, const CFGNodeType& cfgNode)
+{
+        SgNode* node = cfgNode.getNode();
+        ROSE_ASSERT(node);
+
+        std::string nodeColor = "black";
+        if (isSgStatement(node))
+                nodeColor = "blue";
+        else if (isSgExpression(node))
+                nodeColor = "green";
+        else if (isSgInitializedName(node))
+                nodeColor = "red";
+
+        std::string label;
+
+        if (SgFunctionDefinition* funcDef = isSgFunctionDefinition(node))
+        {
+                std::string funcName = funcDef->get_declaration()->get_name().str();
+                if (cfgNode.getIndex() == 0)
+                        label = "Entry\\n" + funcName;
+                else if (cfgNode.getIndex() == 3)
+                        label = "Exit\\n" + funcName;
+        }
+        
+        if (!isSgScopeStatement(node) && !isSgCaseOptionStmt(node) && !isSgDefaultOptionStmt(node))
+        {
+                std::string content = node->unparseToString();
+                boost::replace_all(content, "\"", "\\\"");
+                boost::replace_all(content, "\\n", "\\\\n");
+                label += content;
+        }
+    else
+                label += "<" + node->class_name() + ">";
+    
+    if (label == "")
+                label += "<" + node->class_name() + ">";
+        
+        out << "[label=\""  << label << "\", color=\"" << nodeColor <<
+                "\", style=\"" << (cfgNode.isInteresting()? "solid" : "dotted") << "\"]";
+}
+
+
+//! This function helps to write the DOT file for edges.
+template <class CFGEdgeType>
+void writeCFGEdge(std::ostream& out, const CFGEdgeType& e)
+{
+        out << "[label=\"" << escapeString(e.toString()) <<
+                "\", style=\"" << "solid" << "\"]";
+}
+
+
+// Predeclaration of class CFG.
+template <class CFGNodeFilter> class CFG;
+
+struct FullCFGNodeFilter
+{
+        bool operator()(const VirtualCFG::CFGNode& cfgNode) const
+        { return true; }
+};
+
+struct InterestingCFGNodeFilter
+{
+        bool operator()(const VirtualCFG::CFGNode& cfgNode) const
+        { return cfgNode.isInteresting(); }
+};
+
+//! A full CFG without any filtered nodes.
+typedef CFG<FullCFGNodeFilter> FullCFG;
+
+
+//! A filtered CFG which only contains interesting nodes and edges.
+typedef CFG<InterestingCFGNodeFilter> FilteredCFG;
+
+
+
+
+
+/********************************************************************/
+//      The concept required to be fulfilled by CFGNodeFilter is
+//
+//      struct CFGNodeFilter
+//      {
+//              bool operator()(const VirtualCFG::CFGNode& cfgNode) const;
+//      };
+//
+/********************************************************************/
+
+//! A class holding a Control Flow Graph.
+        
+template <class CFGNodeFilter>
+class CFG : public boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, 
+                boost::shared_ptr<VirtualCFG::FilteredCFGNode<CFGNodeFilter> >,
+                boost::shared_ptr<VirtualCFG::FilteredCFGEdge<CFGNodeFilter> > >
+{
+        typedef typename boost::graph_traits<CFG<CFGNodeFilter> > GraphTraits;
+
+public:
+    typedef VirtualCFG::FilteredCFGNode<CFGNodeFilter> CFGNodeType;
+        typedef VirtualCFG::FilteredCFGEdge<CFGNodeFilter> CFGEdgeType;
+
+        typedef boost::shared_ptr<CFGNodeType> CFGNodePtr;
+        typedef boost::shared_ptr<CFGEdgeType> CFGEdgePtr;
+
+    typedef typename GraphTraits::vertex_descriptor Vertex;
+        typedef typename GraphTraits::edge_descriptor Edge;
+
+        typedef std::map<Vertex, Vertex> VertexVertexMap;
+        //! The entry node.
+        Vertex entry_;
+
+        //! The exit node.
+        Vertex exit_;
+
+
+protected:
+
+        //! The function definition of this CFG.
+        SgFunctionDefinition* funcDef_;
+
+
+        //! A map from a CFG node to the corresponding vertex
+        std::map<CFGNodeType, Vertex> nodesToVertices_;
+
+    //! The dominator tree of this CFG.
+    VertexVertexMap dominatorTree_;
+
+    //! The postdominator tree of this CFG.
+    VertexVertexMap postdominatorTree_;
+
+public:
+        std::map<CFGNodeType, Vertex> getNodeVert() {
+            return nodesToVertices_;
+        }
+
+        //! The default constructor.
+        CFG()
+        :       funcDef_(NULL),
+                entry_(GraphTraits::null_vertex()),
+                exit_(GraphTraits::null_vertex())
+        {
+        }
+
+        //! The constructor building the CFG.
+        explicit CFG(SgFunctionDefinition* funcDef)
+        :       funcDef_(funcDef),
+                entry_(GraphTraits::null_vertex()),
+                exit_(GraphTraits::null_vertex())
+        {
+                build(funcDef);
+        }
+
+        //! Build the actual CFG for the given function.
+        void build(SgFunctionDefinition* funcDef);
+
+        //! Get the function definition of this CFG.
+        SgFunctionDefinition* getFunctionDefinition() const
+        { return funcDef_; }
+
+        //! Get the entry node of the CFG
+        const Vertex& getEntry() const
+        { return entry_; }
+
+        //! Get the exit node of the CFG
+        const Vertex& getExit() const
+        { return exit_; }
+
+        //! Build the dominator tree of this CFG.
+        //! @returns A map from each node to its immediate dominator.
+        const VertexVertexMap& getDominatorTree();
+
+        //! Build the postdominator tree of this CFG.
+        const VertexVertexMap& getPostdominatorTree();
+
+        //! Build a reverse CFG.
+        CFG<CFGNodeFilter> makeReverseCopy() const;
+
+        //! Output the graph to a DOT file.
+        void toDot(const std::string& filename) const;
+
+        //! Get all CFG nodes in this graph.
+        std::vector<CFGNodePtr> getAllNodes() const;
+
+        //! Get all CFG edges in this graph.
+        std::vector<CFGEdgePtr> getAllEdges() const;
+
+        //! Given a CFG node, returns the corresponding vertex in the graph.
+        //! Returns Vertex::null_vertex() if the given node is not in the graph
+        Vertex getVertexForNode(const CFGNodeType &node) const;
+
+    //! Return if this CFG is reducible (if all loops are natural loops, the
+    //! CFG is reducible).
+    bool isReducible() const { return true; }
+
+    //! Get all back edges in the CFG. A back edge is one whose target dominates its source.
+    std::vector<Edge> getAllBackEdges();
+
+    //! Get all loop headers in this CFG. A natural loop only has one header.
+    std::vector<Vertex> getAllLoopHeaders();
+
+protected:
+
+        //! A internal funtion which builds the actual CFG (boost::graph).
+        void buildCFG(const CFGNodeType& node,
+                        std::map<CFGNodeType, Vertex>& nodesAdded,
+                        std::set<CFGNodeType>& nodesProcessed);
+
+        //! Find the entry and exit of this CFG and set the corresponding members.
+        void setEntryAndExit();
+
+        //! This function helps to write the DOT file for vertices.
+        void writeGraphNode(std::ostream& out, const Vertex& node) const
+        {
+                writeCFGNode(out, *(*this)[node]);
+                //VirtualCFG::printNode(out, (*this)[node]);
+        }
+
+        //! This function helps to write the DOT file for edges.
+        void writeGraphEdge(std::ostream& out, const Edge& edge) const
+        {
+                writeCFGEdge(out, *(*this)[edge]);
+                //VirtualCFG::printEdge(out, (*this)[edge], true);
+        }
+
+        //! This class is used to copy vertices when calling copy_graph().
+        struct VertexCopier
+        {
+                VertexCopier(const CFG<CFGNodeFilter>& g1, CFG<CFGNodeFilter>& g2)
+                : cfg1(g1), cfg2(g2) {}
+
+                void operator()(const Vertex& v1, Vertex& v2) const
+                { cfg2[v2] = cfg1[v1]; }
+                
+                const CFG<CFGNodeFilter>& cfg1;
+                CFG<CFGNodeFilter>& cfg2;
+        };
+
+        //! This class is used to copy edges when calling copy_graph().
+        struct EdgeCopier
+        {
+                EdgeCopier(const CFG<CFGNodeFilter>& g1, CFG<CFGNodeFilter>& g2)
+                : cfg1(g1), cfg2(g2) {}
+
+                void operator()(const Edge& e1, Edge& e2) const
+                { cfg2[e2] = cfg1[e1]; }
+
+                const CFG<CFGNodeFilter>& cfg1;
+                CFG<CFGNodeFilter>& cfg2;
+        };
+};
+
+
+
+template <class CFGNodeFilter>
+void CFG<CFGNodeFilter>::toDot(const std::string& filename) const
+{
+        std::ofstream ofile(filename.c_str(), std::ios::out);
+        boost::write_graphviz(ofile, *this,
+                        boost::bind(&CFG<CFGNodeFilter>::writeGraphNode, this, ::_1, ::_2),
+                        boost::bind(&CFG<CFGNodeFilter>::writeGraphEdge, this, ::_1, ::_2));
+}
+
+template <class CFGNodeFilter>
+void CFG<CFGNodeFilter>::build(SgFunctionDefinition* funcDef)
+{
+        ROSE_ASSERT(funcDef);
+        funcDef_ = funcDef;
+
+        // The following two variables are used to record the nodes traversed.
+        nodesToVertices_.clear();
+        std::set<CFGNodeType> nodesProcessed;
+
+        // Remove all nodes and edges first.
+        this->clear();
+        entry_ = GraphTraits::null_vertex();
+        exit_ = GraphTraits::null_vertex();
+
+        buildCFG(CFGNodeType(funcDef->cfgForBeginning()), nodesToVertices_, nodesProcessed);
+
+        // Find the entry and exit of this CFG.
+        setEntryAndExit();
+
+        ROSE_ASSERT(isSgFunctionDefinition((*this)[entry_]->getNode()));
+        ROSE_ASSERT(isSgFunctionDefinition((*this)[exit_]->getNode()));
+}
+
+template <class CFGNodeFilter>
+void CFG<CFGNodeFilter>::setEntryAndExit()
+{
+    foreach (Vertex v, boost::vertices(*this))
+        {
+                CFGNodePtr node = (*this)[v];
+                if (isSgFunctionDefinition(node->getNode()))
+                {
+                        if (node->getIndex() == 0)
+                                entry_ = v;
+                        else if (node->getIndex() == 3)
+                                exit_ = v;
+                }
+        }
+
+        //In graphs with an infinite loop, we might never get to the end vertex
+        //In those cases, we need to add it explicitly
+        if (exit_ == GraphTraits::null_vertex())
+        {
+                std::cerr << "This function may contain an infinite loop "
+                                "inside so that its CFG cannot be built" << std::endl;
+                exit_ = add_vertex(*this);
+                (*this)[exit_] = CFGNodePtr(new CFGNodeType(funcDef_->cfgForEnd()));
+        }
+
+        ROSE_ASSERT(entry_ != GraphTraits::null_vertex());
+        ROSE_ASSERT(exit_ != GraphTraits::null_vertex());
+}
+
+template <class CFGNodeFilter>
+void CFG<CFGNodeFilter>::buildCFG(
+                const CFGNodeType& node,
+                std::map<CFGNodeType, Vertex>& nodesAdded,
+                std::set<CFGNodeType>& nodesProcessed)
+{
+        ROSE_ASSERT(node.getNode());
+
+        if (nodesProcessed.count(node) > 0)
+                return;
+        nodesProcessed.insert(node);
+
+        typename std::map<CFGNodeType, Vertex>::iterator iter;
+        bool inserted;
+        Vertex from, to;
+
+        // Add the source node.
+        const CFGNodeType& src = node;
+        ROSE_ASSERT(src.getNode());
+
+        boost::tie(iter, inserted) = nodesAdded.insert(std::make_pair(src, Vertex()));
+
+        if (inserted)
+        {
+                from = add_vertex(*this);
+                (*this)[from] = CFGNodePtr(new CFGNodeType(src));
+                iter->second = from;
+        }
+        else
+        {
+                from = iter->second;
+        }
+
+        std::vector<CFGEdgeType> outEdges = node.outEdges();
+
+        foreach(const CFGEdgeType& cfgEdge, outEdges)
+        {
+                // For each out edge, add the target node.
+                CFGNodeType tar = cfgEdge.target();
+                ROSE_ASSERT(tar.getNode());
+
+                boost::tie(iter, inserted) = nodesAdded.insert(std::make_pair(tar, Vertex()));
+
+                if (inserted)
+                {
+                        to = add_vertex(*this);
+                        (*this)[to] = CFGNodePtr(new CFGNodeType(tar));
+                        iter->second = to;
+                }
+                else
+                {
+                        to = iter->second;
+                }
+
+                // Add the edge.
+                Edge edge = add_edge(from, to, *this).first;
+                (*this)[edge] = CFGEdgePtr(new CFGEdgeType(cfgEdge));
+
+                // Build the CFG recursively.
+                buildCFG(tar, nodesAdded, nodesProcessed);
+        }
+}
+
+template <class CFGNodeFilter>
+const typename CFG<CFGNodeFilter>::VertexVertexMap& CFG<CFGNodeFilter>::getDominatorTree()
+{
+    if (!dominatorTree_.empty())
+        return dominatorTree_;
+
+        boost::associative_property_map<VertexVertexMap> domTreePredMap(dominatorTree_);
+
+        // Here we use the algorithm in boost::graph to build a map from each node to its immediate dominator.
+        boost::lengauer_tarjan_dominator_tree(*this, entry_, domTreePredMap);
+        return dominatorTree_;
+}
+
+template <class CFGNodeFilter>
+const typename CFG<CFGNodeFilter>::VertexVertexMap& CFG<CFGNodeFilter>::getPostdominatorTree()
+{
+    if (!postdominatorTree_.empty())
+        return postdominatorTree_;
+    
+        boost::associative_property_map<VertexVertexMap> postdomTreePredMap(postdominatorTree_);
+
+        // Here we use the algorithm in boost::graph to build an map from each node to its immediate dominator.
+        boost::lengauer_tarjan_dominator_tree(boost::make_reverse_graph(*this), exit_, postdomTreePredMap);
+        return postdominatorTree_;
+}
+
+template <class CFGNodeFilter>
+CFG<CFGNodeFilter> CFG<CFGNodeFilter>::makeReverseCopy() const
+{
+        CFG<CFGNodeFilter> reverseCFG;
+        // The following function makes a reverse CFG copy.
+        boost::transpose_graph(*this, reverseCFG, 
+                boost::vertex_copy(VertexCopier(*this, reverseCFG)).
+                edge_copy(EdgeCopier(*this, reverseCFG)));
+
+        // Swap entry and exit.
+        reverseCFG.entry_ = this->exit_;
+        reverseCFG.exit_ = this->entry_;
+        return reverseCFG;
+}
+
+
+template <class CFGNodeFilter>
+std::vector<typename CFG<CFGNodeFilter>::CFGNodePtr>
+CFG<CFGNodeFilter>::getAllNodes() const
+{
+        std::vector<CFGNodePtr> allNodes;
+    foreach (Vertex v, boost::vertices(*this))
+                allNodes.push_back((*this)[v]);
+        return allNodes;
+}
+
+/*
+template <class CFGNodeFilter>
+std::vector<typename CFG<CFGNodeFilter>::CFGNodeType>
+CFG<CFGNodeFilter>::getAllNodesNoPtrs() const
+{
+        std::vector<CFGNodeType> allNodes;
+    foreach (Vertex v, boost::vertices(*this))
+                allNodes.push_back(&((*this)[v]));
+        return allNodes;
+}
+*/
+
+template <class CFGNodeFilter>
+std::vector<typename CFG<CFGNodeFilter>::CFGEdgePtr>
+CFG<CFGNodeFilter>::getAllEdges() const
+{
+        std::vector<CFGEdgePtr> allEdges;
+    foreach (const Edge& e, boost::edges(*this))
+                allEdges.push_back((*this)[e]);
+        return allEdges;
+}
+
+template <class CFGNodeFilter>
+typename CFG<CFGNodeFilter>::Vertex CFG<CFGNodeFilter>::getVertexForNode(const CFGNodeType &node) const
+{
+        typename std::map<CFGNodeType, Vertex>::const_iterator vertexIter = nodesToVertices_.find(node);
+        if (vertexIter == nodesToVertices_.end())
+                return GraphTraits::null_vertex();
+        else
+        {
+                ROSE_ASSERT(*(*this)[vertexIter->second] == node);
+                return vertexIter->second;
+        }
+}
+
+template <class CFGNodeFilter>
+std::vector<typename CFG<CFGNodeFilter>::Edge> CFG<CFGNodeFilter>::getAllBackEdges()
+{
+    std::vector<Edge> backEdges;
+
+    // If the dominator tree is not built yet, build it now.
+    getDominatorTree();
+
+    foreach (const Edge& e, boost::edges(*this))
+    {
+        Vertex src = boost::source(e, *this);
+        Vertex tar = boost::target(e, *this);
+
+        //Vertex v = *(dominatorTree.find(src));
+        typename VertexVertexMap::const_iterator iter = dominatorTree_.find(src);
+        while (iter != dominatorTree_.end())
+        {
+            if (iter->second == tar)
+            {
+                backEdges.push_back(e);
+                break; // break the while loop
+            }
+            iter = dominatorTree_.find(iter->second);
+        }
+    }
+
+    return backEdges;
+}
+
+template <class CFGNodeFilter>
+std::vector<typename CFG<CFGNodeFilter>::Vertex> CFG<CFGNodeFilter>::getAllLoopHeaders()
+{
+    std::vector<Edge> backEdges = getAllBackEdges();
+    std::vector<Vertex> headers;
+    foreach (Edge e, backEdges)
+        headers.push_back(boost::target(e, *this));
+    return headers;
+}
+
+#undef foreach
+
+} // End of namespace Backstroke
+
+
+#endif  /* BACKSTROKE_CFG_H */
diff --git a/tests/nonsmoke/functional/roseTests/CMakeLists.txt b/tests/nonsmoke/functional/roseTests/CMakeLists.txt
index 5c444e94781..535c285e2f5 100644
--- a/tests/nonsmoke/functional/roseTests/CMakeLists.txt
+++ b/tests/nonsmoke/functional/roseTests/CMakeLists.txt
@@ -4,7 +4,7 @@
 if(enable-c)
   add_subdirectory (astMergeTests)
   add_subdirectory (astPerformanceTests)
-  #add_subdirectory (astProcessingTests)
+  add_subdirectory (astProcessingTests)
   add_subdirectory (astQueryTests)
   add_subdirectory (astSymbolTableTests)
   add_subdirectory (astTokenStreamTests)
diff --git a/tests/nonsmoke/functional/roseTests/astProcessingTests/CMakeLists.txt b/tests/nonsmoke/functional/roseTests/astProcessingTests/CMakeLists.txt
index 2c9f27c3634..53fb6e8172f 100644
--- a/tests/nonsmoke/functional/roseTests/astProcessingTests/CMakeLists.txt
+++ b/tests/nonsmoke/functional/roseTests/astProcessingTests/CMakeLists.txt
@@ -161,18 +161,18 @@ if (HAVE_SYS_TIME_H)
   endforeach()
 
   #-----------------------------------------------------------------------------
-  #add_executable(processnew3Down4SgIncGraph3 processnew3Down4SgIncGraph3.C)
-  #target_link_libraries(processnew3Down4SgIncGraph3
-  #  ROSE_DLL EDG ${link_with_libraries})
-  #set(processnew3Down4SgIncGraph3_SPECIMENS test11.C test12.C test13.C test14.C)
-
-  #set(processnew3Down4SgIncGraph3_SPECIMENS eif.C eif2.C eif3.C eif4.C)
-  #foreach(specimen ${processnew3Down4SgIncGraph3_SPECIMENS})
-  #  add_test(
-  #    NAME pnew2_${specimen}
-  #    COMMAND processnew3Down4SgIncGraph3 ${CMAKE_CURRENT_SOURCE_DIR}/${specimen}
-  #  )
-  #endforeach()
+  add_executable(processnew3Down4SgIncGraph3 processnew3Down4SgIncGraph3.C)
+  target_link_libraries(processnew3Down4SgIncGraph3
+    ROSE_DLL EDG ${link_with_libraries})
+  set(processnew3Down4SgIncGraph3_SPECIMENS test11.C test12.C test13.C test14.C)
+
+  set(processnew3Down4SgIncGraph3_SPECIMENS eif.C eif2.C eif3.C eif4.C)
+  foreach(specimen ${processnew3Down4SgIncGraph3_SPECIMENS})
+    add_test(
+      NAME pnew2_${specimen}
+      COMMAND processnew3Down4SgIncGraph3 ${CMAKE_CURRENT_SOURCE_DIR}/${specimen}
+    )
+  endforeach()
 
   if (enable-binary-analysis)
     #---------------------------------------------------------------------------

From 737a8d9afb2e19bb9a23d84594a9ce727b9f0790 Mon Sep 17 00:00:00 2001
From: Patrick Flynn <pflynn157@gmail.com>
Date: Tue, 26 Sep 2023 10:15:32 -0400
Subject: [PATCH 14/42] Revert "Removed more boost code; removed dead
 extractFunctionArgumentsNormalization"

This reverts commit 7ee15636dc04e5670090fa5312bfaef27b470ea8.
---
 .../programTransformation/CMakeLists.txt      |   1 +
 .../astOutlining/GenerateFunc.cc              |   5 +-
 .../astOutlining/PragmaInterface.cc           |   4 +-
 .../CMakeLists.txt                            |   3 +
 .../ExtractFunctionArguments.C                | 379 ++++++++++++++++++
 .../ExtractFunctionArguments.h                |  83 ++++
 .../Makefile.am                               |  22 +
 .../functionEvaluationOrderTraversal.C        | 166 ++++++++
 .../functionEvaluationOrderTraversal.h        |  89 ++++
 9 files changed, 747 insertions(+), 5 deletions(-)
 create mode 100644 src/midend/programTransformation/extractFunctionArgumentsNormalization/CMakeLists.txt
 create mode 100644 src/midend/programTransformation/extractFunctionArgumentsNormalization/ExtractFunctionArguments.C
 create mode 100644 src/midend/programTransformation/extractFunctionArgumentsNormalization/ExtractFunctionArguments.h
 create mode 100644 src/midend/programTransformation/extractFunctionArgumentsNormalization/Makefile.am
 create mode 100644 src/midend/programTransformation/extractFunctionArgumentsNormalization/functionEvaluationOrderTraversal.C
 create mode 100644 src/midend/programTransformation/extractFunctionArgumentsNormalization/functionEvaluationOrderTraversal.h

diff --git a/src/midend/programTransformation/CMakeLists.txt b/src/midend/programTransformation/CMakeLists.txt
index 6a28cf5c3c1..cba1b50a9ae 100644
--- a/src/midend/programTransformation/CMakeLists.txt
+++ b/src/midend/programTransformation/CMakeLists.txt
@@ -7,6 +7,7 @@ add_subdirectory(astInlining)
 add_subdirectory(astOutlining)
 add_subdirectory(ompLowering)
 add_subdirectory(transformationTracking)
+add_subdirectory(extractFunctionArgumentsNormalization)
 add_subdirectory(singleStatementToBlockNormalization)
 if(NOT enable-internalFrontendDevelopment)
   add_subdirectory(loopProcessing)
diff --git a/src/midend/programTransformation/astOutlining/GenerateFunc.cc b/src/midend/programTransformation/astOutlining/GenerateFunc.cc
index 57853a80c01..226b88b2f9f 100644
--- a/src/midend/programTransformation/astOutlining/GenerateFunc.cc
+++ b/src/midend/programTransformation/astOutlining/GenerateFunc.cc
@@ -22,7 +22,6 @@
 #include <sstream>
 #include <set>
 #include <map>
-#include <unordered_map>
 
 #include "Outliner.hh"
 #include "ASTtools.hh"
@@ -1398,8 +1397,8 @@ class SymbolMapOfTwoFiles
           dict[i1->second]=i2->second;
 #endif          
         rose_hash_multimap::iterator i1, i2;
-        std::unordered_map<string, SgVariableSymbol*> varSymDict; 
-        std::unordered_map<string, SgFunctionSymbol*> funcSymDict; 
+        boost::unordered_map<string, SgVariableSymbol*> varSymDict; 
+        boost::unordered_map<string, SgFunctionSymbol*> funcSymDict; 
 
         // cache mapping of new symbols,indexed by qualified name : qualified name to symbol
         for (i2=set2->begin(); i2!=set2->end(); i2++)
diff --git a/src/midend/programTransformation/astOutlining/PragmaInterface.cc b/src/midend/programTransformation/astOutlining/PragmaInterface.cc
index 4c9035e53d0..af02e2f3021 100644
--- a/src/midend/programTransformation/astOutlining/PragmaInterface.cc
+++ b/src/midend/programTransformation/astOutlining/PragmaInterface.cc
@@ -19,7 +19,7 @@
 #include "Outliner.hh"
 #include "ASTtools.hh"
 #include "PreprocessingInfo.hh"
-#include <StringUtility/Trim.h>
+#include <boost/algorithm/string/trim.hpp>
 
 //! Simplest outlining directives, applied to a single statement.
 static const std::string PRAGMA_OUTLINE ("rose_outline");
@@ -89,7 +89,7 @@ processFortranComment(SgLocatedNode* node)
     if ((*i)->getTypeOfDirective() == PreprocessingInfo::FortranStyleComment)
     {
       string commentString = (*i)->getString();
-      trim(commentString);
+      boost::algorithm::trim(commentString);
       if (   (commentString == "!$"+PRAGMA_OUTLINE) 
           || (commentString == "c$"+PRAGMA_OUTLINE) 
           || (commentString == "*$"+PRAGMA_OUTLINE)) 
diff --git a/src/midend/programTransformation/extractFunctionArgumentsNormalization/CMakeLists.txt b/src/midend/programTransformation/extractFunctionArgumentsNormalization/CMakeLists.txt
new file mode 100644
index 00000000000..859357b7396
--- /dev/null
+++ b/src/midend/programTransformation/extractFunctionArgumentsNormalization/CMakeLists.txt
@@ -0,0 +1,3 @@
+install(FILES
+    ExtractFunctionArguments.h functionEvaluationOrderTraversal.h
+  DESTINATION ${INCLUDE_INSTALL_DIR})
diff --git a/src/midend/programTransformation/extractFunctionArgumentsNormalization/ExtractFunctionArguments.C b/src/midend/programTransformation/extractFunctionArgumentsNormalization/ExtractFunctionArguments.C
new file mode 100644
index 00000000000..ff84237e9f8
--- /dev/null
+++ b/src/midend/programTransformation/extractFunctionArgumentsNormalization/ExtractFunctionArguments.C
@@ -0,0 +1,379 @@
+#include "ExtractFunctionArguments.h"
+#include <boost/foreach.hpp>
+#include <boost/tuple/tuple.hpp>
+#include <functionEvaluationOrderTraversal.h>
+#include "SingleStatementToBlockNormalization.h"
+
+#define foreach BOOST_FOREACH
+
+using namespace std;
+using namespace boost;
+
+
+/** Performs the function argument extraction on all function calls in the given subtree of the AST. */
+/** It does not do transofrmations in places where it is not safe. If you pass doUnsafeNormalization= true, we will normalize all callsites ignoring the safety (Suggested by Markus Schordan) */
+
+void ExtractFunctionArguments::NormalizeTree(SgNode* tree, bool doUnsafeNormalization) {
+    // First Normalize each single statememnt body into a block body
+    // This transformation is necessary to provide scope to newly created temporaries
+    // Note: if this transofrmation is already done, it is benign to rerun it
+    // and this would act as a NOP transformation.
+    
+    SingleStatementToBlockNormalizer singleStatementToBlockNormalizer;
+    singleStatementToBlockNormalizer.Normalize(tree);
+    
+
+    
+    // Obtain functions that are candidates for normalizing (first) and those which are not condidates (second)
+    // non candidates are those which are present in places from where it is unsafe to lift: e.g., : while(Foo(Bar())){}
+    this->functionCalls = FunctionEvaluationOrderTraversal::GetFunctionCalls(tree);
+    
+    // Normalize each function from safe place
+    foreach(const FunctionCallInfo& functionCallInfo, this->functionCalls.first) {
+        RewriteFunctionCallArguments(functionCallInfo);
+    }
+    
+    // if doUnsafeNormalization is true, we will normalize calls which are not safe
+    if(doUnsafeNormalization){
+        foreach(const FunctionCallInfo& functionCallInfo, this->functionCalls.second) {
+            RewriteFunctionCallArguments(functionCallInfo);
+        }        
+    }
+    
+}
+
+
+/*
+    return a vector of temporaries introduced during the translation process
+ */
+std::vector<SgVariableDeclaration*> ExtractFunctionArguments::GetTemporariesIntroduced() {
+    return this->temporariesIntroduced;
+}
+
+/** Returns true if the given expression refers to a variable. This could include using the
+ * dot and arrow operator to access member variables. A comma op counts as a variable references
+ * if all its members are variable references (not just the last expression in the list). */
+bool isVariableReference(SgExpression* expression)
+{
+    if (isSgVarRefExp(expression))
+    {
+        return true;
+    }
+    else if (isSgThisExp(expression))
+    {
+        return true;
+    }
+    else if (isSgDotExp(expression))
+    {
+        SgDotExp* dotExpression = isSgDotExp(expression);
+        return isVariableReference(dotExpression->get_lhs_operand()) &&
+        isVariableReference(dotExpression->get_rhs_operand());
+    }
+    else if (isSgArrowExp(expression))
+    {
+        SgArrowExp* arrowExpression = isSgArrowExp(expression);
+        return isVariableReference(arrowExpression->get_lhs_operand()) &&
+        isVariableReference(arrowExpression->get_rhs_operand());
+    }
+    else if (isSgCommaOpExp(expression))
+    {
+        //Comma op where both the lhs and th rhs are variable references.
+        //The lhs would be semantically meaningless since it doesn't have any side effects
+        SgCommaOpExp* commaOp = isSgCommaOpExp(expression);
+        return isVariableReference(commaOp->get_lhs_operand()) &&
+        isVariableReference(commaOp->get_rhs_operand());
+    }
+    else if (isSgPointerDerefExp(expression) || isSgCastExp(expression) || isSgAddressOfOp(expression))
+    {
+        return isVariableReference(isSgUnaryOp(expression)->get_operand());
+    }
+    else
+    {
+        return false;
+    }
+}
+
+/* Given the expression which is the argument to a function call, returns true if that
+    expression is trivial. Trivial expressions are those which are simple variable references or constants.
+ */
+
+bool ExtractFunctionArguments::IsFunctionArgumentTrivial(SgExpression* argument) {
+    while ((isSgPointerDerefExp(argument) || isSgCastExp(argument) || isSgAddressOfOp(argument))) {
+        argument = isSgUnaryOp(argument)->get_operand();
+    }
+    
+    SgArrowExp* arrowExp = isSgArrowExp(argument);
+    if (arrowExp && isSgThisExp(arrowExp->get_lhs_operand()))
+        return true;
+    
+    // We don't lift these simple types
+    if (isVariableReference(argument) || isSgValueExp(argument))
+        return true;
+    
+    return false;
+}
+
+
+/* Given a vector of function call sites returns true if every argument of every function call is a trivial expression
+    (IsFunctionArgumentTrivial). Such functions don't need to be normalized.
+ */
+bool ExtractFunctionArguments::AreAllFunctionCallsTrivial(std::vector<FunctionCallInfo> functions){
+    foreach(FunctionCallInfo functionCallInfo, functions){
+        foreach(SgExpression* arg, functionCallInfo.functionCall->get_args()->get_expressions()){
+            if (!IsFunctionArgumentTrivial(arg)) {
+                return false;
+            }
+        }
+    }
+    return true;
+}
+
+/* Given a vector of function call sites, returns true if every argument 
+   at every function call site is either trivial (IsFunctionArgumentTrivial) or can be normalized (FunctionArgumentCanBeNormalized).
+ */
+bool ExtractFunctionArguments::AreAllFunctionCallsNormalizable(std::vector<FunctionCallInfo> functions){
+    foreach(FunctionCallInfo functionCallInfo, functions){
+        foreach(SgExpression* arg, functionCallInfo.functionCall->get_args()->get_expressions()){
+            if (!IsFunctionArgumentTrivial(arg) && !FunctionArgumentCanBeNormalized(arg)) {
+                return false;
+            }
+        }
+    }
+    return true;
+}
+
+
+/*
+    IsNormalized: Given a subtree, returns true if every argument of every function call is a trivial arguemnt.
+*/
+
+bool ExtractFunctionArguments::IsNormalized(SgNode* tree){
+    // Obtain functions that are candidates for normalizing (first) and those which are not condidates (second)
+    // non candidates are those which are present in places from where it is unsafe to lift: e.g., : while(Foo(Bar())){}
+    pair< std::vector<FunctionCallInfo>, std::vector<FunctionCallInfo> > fCalls = FunctionEvaluationOrderTraversal::GetFunctionCalls(tree);
+
+    //Make sure all arguemnts of all SAFE place functions calls are trivial
+    if(!AreAllFunctionCallsTrivial(fCalls.first))
+       return false;
+
+    //Make sure all arguemnts of all NON-SAFE place functions calls are also trivial
+    if(!AreAllFunctionCallsTrivial(fCalls.second))
+        return false;
+
+    // All are trivial
+    return true;
+}
+
+
+/*
+    IsNormalizable: Given a subtree, returns true if every argument of every function call is a either trivial arguemnt or
+    present in a SAFE place from where lifting is possible. 
+*/
+
+bool ExtractFunctionArguments::IsNormalizable(SgNode* tree){
+    // Obtain functions that are candidates for normalizing (first) and those which are not condidates (second)
+    // non candidates are those which are present in places from where it is unsafe to lift: e.g., : while(Foo(Bar())){}
+    pair< std::vector<FunctionCallInfo>, std::vector<FunctionCallInfo> > fCalls = FunctionEvaluationOrderTraversal::GetFunctionCalls(tree);
+
+    //Make sure all arguemnts of all SAFE place functions calls are either trivial or normalizable
+    if(!AreAllFunctionCallsNormalizable(fCalls.first))
+        return false;
+    
+    // Must be trivail in NON SAFE places
+    if(!AreAllFunctionCallsTrivial(fCalls.second))
+        return false;
+    
+    // We can normalize
+    return true;
+}
+
+
+/** Given the information about a function call (obtained through a traversal), extract its arguments
+ * into temporary variables where it is necessary.
+ * Returns true on success, false on failure (unsupported code). */
+void ExtractFunctionArguments::RewriteFunctionCallArguments(const FunctionCallInfo& functionCallInfo)
+{
+    SgFunctionCallExp* functionCall = functionCallInfo.functionCall;
+    
+    // Force the function call to NOT use operator syntax
+    functionCall->set_uses_operator_syntax(false);
+    
+    SgExprListExp* functionArgs = functionCall->get_args();
+    ROSE_ASSERT(functionArgs != NULL);
+    
+    SgExpressionPtrList argumentList = functionArgs->get_expressions();
+    
+    // We also normalize the caller if the function called is a member function.
+    if (SgBinaryOp * binExp = isSgBinaryOp(functionCall->get_function())) {
+        argumentList.push_back(binExp->get_lhs_operand());
+    }
+    
+    //Go over all the function arguments, pull them out
+    
+    foreach(SgExpression* arg, argumentList)
+    {
+        //No need to pull out parameters that are not complex expressions and
+        //thus don't have side effects
+        if (!FunctionArgumentNeedsNormalization(arg))
+            continue;
+
+        //Build a declaration for the temporary variable
+        SgScopeStatement* scope = functionCallInfo.tempVarDeclarationLocation->get_scope();
+        ROSE_ASSERT(scope != NULL );
+
+     // DQ (3/1/2015): Added initialization to these local variables.
+     // SgVariableDeclaration* tempVarDeclaration;
+     // SgExpression* tempVarReference;
+        SgVariableDeclaration* tempVarDeclaration = NULL;
+        SgExpression* tempVarReference = NULL;
+
+     // DQ (3/1/2015): Avoid normalization of function arguments of type SgFunctionType (see inputBug317.C).
+     // This might be an issue more narrowly defined for compiler-generated functions, this is less clear.
+        SgFunctionType* functionType = isSgFunctionType(arg->get_type());
+        if (functionType == NULL)
+           {
+             tie(tempVarDeclaration, tempVarReference) = SageInterface::createTempVariableAndReferenceForExpression(arg, scope);
+        
+          // createTempVariableOrReferenceForExpression does not set the parent if the scope stack is empty. Hence set it manually to the currect scope.
+             tempVarDeclaration->set_parent(scope);
+#if 0
+                {
+                  std::cout<<"\n"<<functionCall->get_file_info()->get_filenameString () << ":" << functionCall->get_file_info()->get_line() << ":" << functionCall->get_file_info()->get_col();
+                  std::cout<<"\n Name = "<< tempVarDeclaration->get_mangled_name().getString()<< " : type : " << arg->get_type()->class_name() << " Expr class : " << arg->class_name();
+                }
+#endif
+             ROSE_ASSERT(tempVarDeclaration != NULL );
+
+          // DQ (3/1/2015): This is not always true (see inputBug317.C).
+             ROSE_ASSERT(tempVarDeclaration->get_definition(0) != NULL);
+             ROSE_ASSERT(isSgVariableDefinition(tempVarDeclaration->get_definition()) != NULL);
+        
+             //Insert the temporary variable declaration
+             InsertStatement(tempVarDeclaration, functionCallInfo.tempVarDeclarationLocation, functionCallInfo);
+        
+             // remember the introduced temp so that it can be queried
+             temporariesIntroduced.push_back(tempVarDeclaration);
+        
+             //Replace the argument with the new temporary variable
+             SageInterface::replaceExpression(arg, tempVarReference);
+           }
+          else
+           {
+             printf ("In ExtractFunctionArguments::RewriteFunctionCallArguments(): Skipping normalization of function arguments of type SgFunctionType \n");
+           }
+    }
+}
+
+
+// If we have a limitation in normalizing the function return false
+bool ExtractFunctionArguments::FunctionArgumentCanBeNormalized(SgExpression* argument)
+{
+    while ((isSgPointerDerefExp(argument) || isSgCastExp(argument) || isSgAddressOfOp(argument)))
+    {
+        argument = isSgUnaryOp(argument)->get_operand();
+    }
+    // Don't include SgConstructorInitializer since it will be called even on the temporary, so avoid double copy.
+    if (isSgFunctionRefExp(argument) || isSgMemberFunctionRefExp(argument) || isSgConstructorInitializer(argument))
+        return false;
+    
+    // Unknow Template type expressions can't be normalized.
+    if (isSgTypeUnknown(argument->get_type()) || isSgMemberFunctionType(argument->get_type())) {
+        //printf("\n Skipping over SgTypeUnknown/SgMemberFunctionType  expr");
+        return false;
+    }
+    
+    return true;
+}
+
+
+
+/** Given the expression which is the argument to a function call, returns true if that
+ * expression should be pulled out into a temporary variable on a separate line.
+ * E.g. if the expression contains a function call, it needs to be normalized, while if it
+ * is a constant, there is no need to change it. */
+
+bool ExtractFunctionArguments::FunctionArgumentNeedsNormalization(SgExpression* argument)
+{
+    // Trivial argument don't need to be listed
+    
+    if (IsFunctionArgumentTrivial(argument))
+        return false;
+
+    // true/false based on our ability to normalize the argument
+    return FunctionArgumentCanBeNormalized(argument);
+}
+
+
+/** Returns true if any of the arguments of the given function call will need to
+ * be extracted. */
+bool ExtractFunctionArguments::FunctionArgsNeedNormalization(SgExprListExp* functionArgs)
+{
+    ROSE_ASSERT(functionArgs != NULL);
+    SgExpressionPtrList& argumentList = functionArgs->get_expressions();
+    
+    foreach(SgExpression* functionArgument, argumentList)
+    {
+        if (FunctionArgumentNeedsNormalization(functionArgument))
+            return true;
+    }
+    return false;
+}
+
+/** Returns true if any function calls in the given subtree will need to be
+ * instrumented. (to extract function arguments). */
+bool ExtractFunctionArguments::SubtreeNeedsNormalization(SgNode* top)
+{
+    ROSE_ASSERT(top != NULL);
+    Rose_STL_Container<SgNode*> functionCalls = NodeQuery::querySubTree(top, V_SgFunctionCallExp);
+    for (Rose_STL_Container<SgNode*>::const_iterator iter = functionCalls.begin(); iter != functionCalls.end(); iter++)
+    {
+        SgExpression* functionCall = isSgFunctionCallExp(*iter);
+        ROSE_ASSERT(functionCall != NULL);
+        if (FunctionArgumentNeedsNormalization(functionCall))
+            return true;
+    }
+    
+    return false;
+}
+
+/** Insert a new statement in the specified location. The actual insertion can occur either before or after the location
+ * depending on the insertion mode. */
+void ExtractFunctionArguments::InsertStatement(SgStatement* newStatement, SgStatement* location, const FunctionCallInfo& insertionMode)
+{
+    switch (insertionMode.tempVarDeclarationInsertionMode)
+    {
+        case FunctionCallInfo::INSERT_BEFORE:
+            SageInterface::insertStatementBefore(location, newStatement);
+            break;
+        case FunctionCallInfo::APPEND_SCOPE:
+        {
+            SgScopeStatement* scopeStatement = isSgScopeStatement(location);
+            if (scopeStatement == NULL)
+            {
+                //scopeStatement = isSgScopeStatement(SageInterface::ensureBasicBlockAsParent(location));
+                if (SageInterface::isBodyStatement(location)) // if the location is a single body statement (not a basic block) at this point
+                    scopeStatement = SageInterface::makeSingleStatementBodyToBlock (location);
+                else
+                    scopeStatement = isSgScopeStatement(location->get_parent());
+            }
+            ROSE_ASSERT(scopeStatement != NULL);
+            
+            SageInterface::appendStatement(newStatement, scopeStatement);
+            break;
+        }
+        case FunctionCallInfo::INVALID:
+        default:
+            ROSE_ABORT();
+    }
+}
+
+/** Traverses the subtree of the given AST node and finds all function calls in
+ * function-evaluation order. */
+/*static*/pair< std::vector<FunctionCallInfo>, std::vector<FunctionCallInfo> > FunctionEvaluationOrderTraversal::GetFunctionCalls(SgNode* root)
+{
+    FunctionEvaluationOrderTraversal t;
+    FunctionCallInheritedAttribute rootAttribute;
+    t.traverse(root, rootAttribute);
+    
+    return pair< std::vector<FunctionCallInfo>, std::vector<FunctionCallInfo> > (t.normalizableFunctionCalls, t.nonNormalizableFunctionCalls);
+}
diff --git a/src/midend/programTransformation/extractFunctionArgumentsNormalization/ExtractFunctionArguments.h b/src/midend/programTransformation/extractFunctionArgumentsNormalization/ExtractFunctionArguments.h
new file mode 100644
index 00000000000..7bd0d37c3f3
--- /dev/null
+++ b/src/midend/programTransformation/extractFunctionArgumentsNormalization/ExtractFunctionArguments.h
@@ -0,0 +1,83 @@
+#pragma once
+
+// DQ (10/5/2014): This is more strict now that we include rose_config.h in the sage3basic.h.
+// #include "rose.h"
+#include "sage3basic.h"
+
+#include "functionEvaluationOrderTraversal.h"
+
+//class FunctionCallInfo;
+
+//! This normalization makes sure each function call argument is a side-effect free expression of only one variable.
+//! To accomplish this, temporary variables are declared and the arguments of a function are evaluated before the function itself.
+//! Note: Normalization is not performed if it is unsafe. E,g.: while(Foo(Bar()) {}  is not equal to t = Bar(); while(Foo(t) {}
+//! Note that only SgFunctionCall arguments are normalized. For example the arguments of the constructor initializer
+//! MyObject o(foo(), bar()) will not be extracted. 
+class ExtractFunctionArguments
+{
+public:
+
+    /** Performs the function argument extraction on all function calls in the given subtree of the AST. */
+    /** It does not do transofrmations in places where it is not safe. If you pass doUnsafeNormalization= true, we will normalize all call sites ignoring the safety (Suggested by Markus Schordan) */
+    void NormalizeTree(SgNode* tree, bool doUnsafeNormalization = false);
+
+    // returns a vector of newly introduced temporaries
+    std::vector<SgVariableDeclaration*> GetTemporariesIntroduced();
+    
+    /*
+     IsNormalized: Given a subtree, returns true if every argument of every function call is a trivial arguemnt.
+     */    
+    bool IsNormalized(SgNode* tree);
+    
+    /*
+     IsNormalizable: Given a subtree, returns true if every argument of every function call is a either trivial arguemnt or
+     is present in a SAFE place from where lifting is possible.
+     */    
+    bool IsNormalizable(SgNode* tree);
+
+    
+private:
+
+    std::vector<SgVariableDeclaration*> temporariesIntroduced;
+    std::pair< std::vector<FunctionCallInfo>, std::vector<FunctionCallInfo> > functionCalls;
+    
+    /** Given the expression which is the argument to a function call, returns true if that
+     * expression should be pulled out into a temporary variable on a separate line.
+     * E.g. if the expression contains a function call, it needs to be normalized, while if it
+     * is a constant, there is no need to change it. */
+    bool FunctionArgumentNeedsNormalization(SgExpression* argument);
+
+    /** Returns true if any of the arguments of the given function call will need to
+     * be extracted. */
+    bool FunctionArgsNeedNormalization(SgExprListExp* functionArgs);
+
+    /** Returns true if any function calls in the given subtree will need to be
+     * instrumented. (to extract function arguments). */
+    bool SubtreeNeedsNormalization(SgNode* top);
+
+    /** Given the information about a function call (obtained through a traversal), extract its arguments
+     * into temporary variables where it is necessary. */
+    void RewriteFunctionCallArguments(const FunctionCallInfo& functionCallInfo);
+
+    /** Insert a new statement in the specified location. The actual insertion can occur either before or after the location
+     * depending on the insertion mode. */
+    void InsertStatement(SgStatement* newStatement, SgStatement* location, const FunctionCallInfo& insertionMode);
+
+    bool FunctionArgumentCanBeNormalized(SgExpression* argument);
+    
+    
+    /* Given the expression which is the argument to a function call, returns true if that
+     expression is trivial. Trivial expressions are those which are simple variable references or constants.
+     */
+    bool IsFunctionArgumentTrivial(SgExpression* argument);
+
+    /* Given a vector of function call sites returns true if every argument of every function call is a trivial expression
+     (IsFunctionArgumentTrivial). Such functions don't need to be normalized.
+     */
+    bool AreAllFunctionCallsTrivial(std::vector<FunctionCallInfo> functions);
+    
+    /* Given a vector of function call sites, returns true if every argument
+     at every function call site is either trivial (IsFunctionArgumentTrivial) or can be normalized (FunctionArgumentCanBeNormalized).
+     */
+    bool AreAllFunctionCallsNormalizable(std::vector<FunctionCallInfo> functions);
+};
diff --git a/src/midend/programTransformation/extractFunctionArgumentsNormalization/Makefile.am b/src/midend/programTransformation/extractFunctionArgumentsNormalization/Makefile.am
new file mode 100644
index 00000000000..4d9b1a853a7
--- /dev/null
+++ b/src/midend/programTransformation/extractFunctionArgumentsNormalization/Makefile.am
@@ -0,0 +1,22 @@
+include $(top_srcdir)/config/Makefile.for.ROSE.includes.and.libs
+
+AM_CPPFLAGS = $(ROSE_INCLUDES)
+#LINK	 = $(CXXLINK)
+
+# noinst_LTLIBRARIES lists all the libraries that should be built, but not installed
+noinst_LTLIBRARIES =  libExtractFunctionArgumentsNormalization.la
+
+libExtractFunctionArgumentsNormalization_la_DEPENDENCIES = $(srcdir)/../singleStatementToBlockNormalization/SingleStatementToBlockNormalization.h
+libExtractFunctionArgumentsNormalization_la_CXXFLAGS = -I$(srcdir)/../singleStatementToBlockNormalization
+libExtractFunctionArgumentsNormalization_la_SOURCES = ExtractFunctionArguments.C functionEvaluationOrderTraversal.C
+pkginclude_HEADERS = ExtractFunctionArguments.h functionEvaluationOrderTraversal.h
+
+
+# EXTRA_DIST are files that are not compiled or installed. These include readme's, internal header files, etc.
+EXTRA_DIST = 
+
+CLEANFILES = 
+
+
+check-local:
+
diff --git a/src/midend/programTransformation/extractFunctionArgumentsNormalization/functionEvaluationOrderTraversal.C b/src/midend/programTransformation/extractFunctionArgumentsNormalization/functionEvaluationOrderTraversal.C
new file mode 100644
index 00000000000..175939503f8
--- /dev/null
+++ b/src/midend/programTransformation/extractFunctionArgumentsNormalization/functionEvaluationOrderTraversal.C
@@ -0,0 +1,166 @@
+#include "sage3basic.h"                                 // every librose .C file must start with this
+#include <functionEvaluationOrderTraversal.h>
+
+
+bool IsStatusSafe(int status){
+    if (status == FunctionCallInheritedAttribute::IN_SAFE_PLACE)
+        return true;
+    if (status == FunctionCallInheritedAttribute::INSIDE_FOR_INIT)
+        return true;
+    return false;
+}
+
+/** Visits AST nodes in pre-order */
+FunctionCallInheritedAttribute FunctionEvaluationOrderTraversal::evaluateInheritedAttribute(SgNode* astNode, FunctionCallInheritedAttribute parentAttribute)
+{
+    FunctionCallInheritedAttribute result = parentAttribute;
+    SgForStatement* parentForLoop = isSgForStatement(parentAttribute.currentScope);
+    SgWhileStmt* parentWhileLoop = isSgWhileStmt(parentAttribute.currentScope);
+    SgDoWhileStmt* parentDoWhileLoop = isSgDoWhileStmt(parentAttribute.currentScope);
+    
+    SgConditionalExp* parentSgConditionalExp = astNode->get_parent() ? isSgConditionalExp(astNode->get_parent()) : NULL;
+    SgAndOp* parentAndOp =  astNode->get_parent() ?isSgAndOp(astNode->get_parent()) : NULL;
+    SgOrOp* parentOrOp =  astNode->get_parent() ? isSgOrOp(astNode->get_parent()) : NULL;
+
+    if (isSgForStatement(astNode))
+        result.currentScope = isSgForStatement(astNode);
+    else if (isSgWhileStmt(astNode))
+        result.currentScope = isSgWhileStmt(astNode);
+    else if (isSgDoWhileStmt(astNode))
+        result.currentScope = isSgDoWhileStmt(astNode);
+    //else if (isSgConditionalExp(astNode))
+    //    result.currentScope = isSgConditionalExp(astNode);
+    //else if (isSgAndOp(astNode))
+    //    result.currentScope = isSgAndOp(astNode);
+    //else if (isSgOrOp(astNode))
+    //    result.currentScope = isSgOrOp(astNode);
+    else if (isSgForInitStatement(astNode)) {
+        ROSE_ASSERT(result.scopeStatus == FunctionCallInheritedAttribute::IN_SAFE_PLACE);
+        result.scopeStatus = FunctionCallInheritedAttribute::INSIDE_FOR_INIT;
+        ROSE_ASSERT(isSgForStatement(result.currentScope));
+    } else if (parentForLoop != NULL && parentForLoop->get_test() == astNode) {
+        ROSE_ASSERT(result.scopeStatus == FunctionCallInheritedAttribute::IN_SAFE_PLACE);
+        result.scopeStatus = FunctionCallInheritedAttribute::INSIDE_FOR_TEST;
+    } else if (parentForLoop != NULL && parentForLoop->get_increment() == astNode) {
+        ROSE_ASSERT(result.scopeStatus == FunctionCallInheritedAttribute::IN_SAFE_PLACE);
+        result.scopeStatus = FunctionCallInheritedAttribute::INSIDE_FOR_INCREMENT;
+    } else if (parentWhileLoop != NULL && parentWhileLoop->get_condition() == astNode) {
+        ROSE_ASSERT(result.scopeStatus == FunctionCallInheritedAttribute::IN_SAFE_PLACE);
+        result.scopeStatus = FunctionCallInheritedAttribute::INSIDE_WHILE_CONDITION;
+    } else if (parentDoWhileLoop != NULL && parentDoWhileLoop->get_condition() == astNode) {
+        ROSE_ASSERT(result.scopeStatus == FunctionCallInheritedAttribute::IN_SAFE_PLACE);
+        result.scopeStatus = FunctionCallInheritedAttribute::INSIDE_DO_WHILE_CONDITION;
+    } else if( parentSgConditionalExp != NULL && parentSgConditionalExp->get_true_exp() == astNode) {
+        // if the scope status was safe, turn it into unsafe
+        if (IsStatusSafe(result.scopeStatus))
+            result.scopeStatus = FunctionCallInheritedAttribute::INSIDE_CONDITIONAL_EXP_TRUE_ARM;
+    } else if(parentSgConditionalExp != NULL && parentSgConditionalExp->get_false_exp() == astNode) {
+        // if the scope status was safe, turn it into unsafe
+        if (IsStatusSafe(result.scopeStatus))
+            result.scopeStatus = FunctionCallInheritedAttribute::INSIDE_CONDITIONAL_EXP_FALSE_ARM;
+    } else if( parentOrOp != NULL && parentOrOp->get_rhs_operand () == astNode) {
+        // if the scope status was safe, turn it into unsafe
+        if (IsStatusSafe(result.scopeStatus))
+            result.scopeStatus = FunctionCallInheritedAttribute::INSIDE_SHORT_CIRCUIT_EXP_RHS;
+    } else if( parentAndOp != NULL && parentAndOp->get_rhs_operand () == astNode)  {
+        // if the scope status was safe, turn it into unsafe
+        if (IsStatusSafe(result.scopeStatus))
+            result.scopeStatus = FunctionCallInheritedAttribute::INSIDE_SHORT_CIRCUIT_EXP_RHS;
+    }
+    
+    //We can't insert variables before an expression statement that appears inside if(), switch, throw, etc.
+    if (isSgExprStatement(astNode) && !isSgBasicBlock(astNode->get_parent())) {
+        //We can't insert a variable declaration at these locations. Use the parent statement
+    } else if (isSgStatement(astNode)) {
+        result.lastStatement = isSgStatement(astNode);
+    }
+
+    return result;
+}
+
+// Returns false in the absence of any analysis information
+bool FunctionEvaluationOrderTraversal::IsFunctionCallSideEffectFree(SgFunctionCallExp* functionCall) {
+    return false;
+}
+
+
+/** Visits AST nodes in post-order. This is function-evaluation order. */
+bool FunctionEvaluationOrderTraversal::evaluateSynthesizedAttribute(SgNode* astNode, FunctionCallInheritedAttribute parentAttribute, SynthesizedAttributesList)
+{
+    SgFunctionCallExp* functionCall = isSgFunctionCallExp(astNode);
+    if (functionCall == NULL)
+        return false; //dummy return value
+    
+    FunctionCallInfo functionCallInfo(functionCall);
+
+    // Can't lift function call arguments from the following:
+    // 1. For loop test and increment
+    // 2. While loop test
+    // 3. Do-While loop test
+    // 4. Either arms of ternary op
+    // 5. RHS of any short circuit expression
+    // An alternative is to use comma operators and use assignemnt op as done by the original author. 
+    // for(;foo(bar());) ==> T i; for(;i=bar();foo(i);)
+    // But using assignement op is not always safe and it requires us to always have a default constructor
+    // There is also an issue when the return type is a reference and we'll have to use & op to get a pointer
+    // but if & op is overloaded we may not get the pointer.
+    // Taking all these in view, I am simpling not lifting such expressions.
+    
+    if (parentAttribute.scopeStatus == FunctionCallInheritedAttribute::INSIDE_FOR_TEST ||
+        parentAttribute.scopeStatus == FunctionCallInheritedAttribute::INSIDE_FOR_INCREMENT ||
+        parentAttribute.scopeStatus == FunctionCallInheritedAttribute::INSIDE_WHILE_CONDITION ||
+        parentAttribute.scopeStatus == FunctionCallInheritedAttribute::INSIDE_DO_WHILE_CONDITION) {
+
+        // ***** FOR UNSAFE TRANSFORMATION *******
+        //Temporary variables should be declared before the stmt
+        ROSE_ASSERT(isSgStatement(parentAttribute.currentScope));
+        functionCallInfo.tempVarDeclarationLocation = isSgStatement(parentAttribute.currentScope);
+        functionCallInfo.tempVarDeclarationInsertionMode = FunctionCallInfo::INSERT_BEFORE;
+
+        nonNormalizableFunctionCalls.push_back(functionCallInfo);
+        return false;
+    }
+
+    // In future, if the function call is assured to be side effect free, then we can lift it from short circuit and conditional expressions
+    if(parentAttribute.scopeStatus == FunctionCallInheritedAttribute::INSIDE_CONDITIONAL_EXP_TRUE_ARM ||
+       parentAttribute.scopeStatus == FunctionCallInheritedAttribute::INSIDE_CONDITIONAL_EXP_FALSE_ARM ||
+       parentAttribute.scopeStatus == FunctionCallInheritedAttribute::INSIDE_SHORT_CIRCUIT_EXP_RHS){
+        
+        if(!IsFunctionCallSideEffectFree(functionCall)) {
+            
+            // ***** FOR UNSAFE TRANSFORMATION *******
+            //Temporary variables should be declared before the stmt
+            ROSE_ASSERT(parentAttribute.lastStatement);
+            functionCallInfo.tempVarDeclarationLocation = parentAttribute.lastStatement;
+            functionCallInfo.tempVarDeclarationInsertionMode = FunctionCallInfo::INSERT_BEFORE;
+
+            nonNormalizableFunctionCalls.push_back(functionCallInfo);
+            return false;
+        }
+    }
+    
+    //Handle for loops (being inside the body of a for loop doesn't need special handling)
+    if (parentAttribute.scopeStatus == FunctionCallInheritedAttribute::INSIDE_FOR_INIT)
+    {
+        SgForStatement* forLoop = isSgForStatement(parentAttribute.currentScope);
+        ROSE_ASSERT(forLoop != NULL);
+        //Temporary variables should be declared before the loop
+        functionCallInfo.tempVarDeclarationLocation = forLoop;
+        functionCallInfo.tempVarDeclarationInsertionMode = FunctionCallInfo::INSERT_BEFORE;
+    }
+    else if (parentAttribute.scopeStatus == FunctionCallInheritedAttribute::IN_SAFE_PLACE)
+    {
+        //Assume we're in a basic block. Then just insert right before the current statement
+        ROSE_ASSERT(parentAttribute.scopeStatus = FunctionCallInheritedAttribute::IN_SAFE_PLACE);
+        functionCallInfo.tempVarDeclarationLocation = parentAttribute.lastStatement;
+        functionCallInfo.tempVarDeclarationInsertionMode = FunctionCallInfo::INSERT_BEFORE;
+    }
+    else
+    {
+        //Unhandled condition?!
+        ROSE_ABORT();
+    }
+
+    normalizableFunctionCalls.push_back(functionCallInfo);
+    return false; //dummy return value
+}
diff --git a/src/midend/programTransformation/extractFunctionArgumentsNormalization/functionEvaluationOrderTraversal.h b/src/midend/programTransformation/extractFunctionArgumentsNormalization/functionEvaluationOrderTraversal.h
new file mode 100644
index 00000000000..e00d7203382
--- /dev/null
+++ b/src/midend/programTransformation/extractFunctionArgumentsNormalization/functionEvaluationOrderTraversal.h
@@ -0,0 +1,89 @@
+#pragma once
+
+// DQ (10/5/2014): This is more strict now that we include rose_config.h in the sage3basic.h.
+// #include "rose.h"
+// rose.h and sage3basic.h should not be included in librose header files. [Robb P. Matzke 2014-10-15]
+// #include "sage3basic.h"
+
+struct FunctionCallInheritedAttribute
+{
+    /** The innermost scope inside of which this AST node resides. It is either a for-loop,
+         a do-loop,  a while-loop or a conditioanl expression. */
+    SgNode* currentScope;
+
+    /** The last statement encountered before the current node in the AST. */
+    SgStatement* lastStatement;
+
+    /** Is the current node inside a for loop or conditional expresion structure (not the body). */
+    enum
+    {
+        INSIDE_FOR_INIT, INSIDE_FOR_TEST, INSIDE_FOR_INCREMENT, INSIDE_WHILE_CONDITION,
+        INSIDE_DO_WHILE_CONDITION, IN_SAFE_PLACE, INSIDE_CONDITIONAL_EXP_TRUE_ARM, INSIDE_CONDITIONAL_EXP_FALSE_ARM, INSIDE_SHORT_CIRCUIT_EXP_RHS
+    }
+    scopeStatus;
+
+    /** Default constructor. Initializes everything to NULL. */
+    FunctionCallInheritedAttribute() : currentScope(NULL), lastStatement(NULL), scopeStatus(IN_SAFE_PLACE) { }
+};
+
+/** Stores a function call expression, along with associated information about its context. */
+struct FunctionCallInfo
+{
+    /** The function call expression. */
+    SgFunctionCallExp* functionCall;
+
+    /** When a variable is created to replace one of the arguments of this function, where should it be inserted?
+     * The declaration of the variable will occur right before this statement. */
+    SgStatement* tempVarDeclarationLocation;
+
+    /** How a statement should be inserted.   */
+    enum InsertionMode
+    {
+        /** Insert right before the given statement. */
+        INSERT_BEFORE,
+        /** Insert at the bottom of the scope defined by the given statement. */
+        APPEND_SCOPE,
+        INVALID
+    };
+
+    /** How to insert the temporary variable declaration. */
+    InsertionMode tempVarDeclarationInsertionMode;
+
+    FunctionCallInfo(SgFunctionCallExp * function) :
+    functionCall(function),
+    tempVarDeclarationLocation(NULL),
+    tempVarDeclarationInsertionMode(INVALID) { }
+};
+
+
+//! Traverses a given AST and finds all function calls in the order in which they're evaluated
+//! Also, for each function we find where to put declarations of temporary variables so that they're accessible at the function call
+
+class FunctionEvaluationOrderTraversal : public AstTopDownBottomUpProcessing<FunctionCallInheritedAttribute, bool>
+{
+public:
+    /** Traverses the subtree of the given AST node and finds all function calls in
+     * function-evaluation order. */
+    static std::pair< std::vector<FunctionCallInfo>, std::vector<FunctionCallInfo> > GetFunctionCalls(SgNode* root);
+
+    /** Visits AST nodes in pre-order */
+    FunctionCallInheritedAttribute evaluateInheritedAttribute(SgNode* astNode, FunctionCallInheritedAttribute parentAttribute);
+
+    /** Visits AST nodes in post-order. This is function-evaluation order. */
+    bool evaluateSynthesizedAttribute(SgNode* astNode, FunctionCallInheritedAttribute parentAttribute, SynthesizedAttributesList);
+
+    /// Returns true if the function call has no side effects.
+    virtual bool IsFunctionCallSideEffectFree(SgFunctionCallExp* functionCall);
+
+private:
+
+    //! Private constructor. Use the static method to access the functionality of this class.
+
+    FunctionEvaluationOrderTraversal() { }
+
+    /** All the function calls seen so far that can be normalized. */
+    std::vector<FunctionCallInfo> normalizableFunctionCalls;
+    /** All the function calls seen so far that can't be normalized. */
+    std::vector<FunctionCallInfo> nonNormalizableFunctionCalls;
+};
+

From 2dbc1bd6cf2389b46534b628c476bd4156f605bf Mon Sep 17 00:00:00 2001
From: Patrick Flynn <pflynn157@gmail.com>
Date: Tue, 26 Sep 2023 11:26:27 -0400
Subject: [PATCH 15/42] Removed boost serialization

---
 src/ROSETTA/Grammar/Node.code    |  4 ----
 src/ROSETTA/Grammar/Support.code | 20 --------------------
 2 files changed, 24 deletions(-)

diff --git a/src/ROSETTA/Grammar/Node.code b/src/ROSETTA/Grammar/Node.code
index d787ca122ea..9f690bdcc2c 100644
--- a/src/ROSETTA/Grammar/Node.code
+++ b/src/ROSETTA/Grammar/Node.code
@@ -7,10 +7,6 @@ HEADER_NODE_PREDECLARATION_START
 #include <unordered_set>
 #include <functional>
 
-#include <boost/serialization/access.hpp>
-#include <boost/serialization/base_object.hpp>
-#include <boost/serialization/nvp.hpp>
-
 // tps (01/27/10): Added essential files..
 //#include "sage3basic.h"
 #include <rosePublicConfig.h>
diff --git a/src/ROSETTA/Grammar/Support.code b/src/ROSETTA/Grammar/Support.code
index 71ded074a02..b81d5430e40 100644
--- a/src/ROSETTA/Grammar/Support.code
+++ b/src/ROSETTA/Grammar/Support.code
@@ -8,16 +8,6 @@ HEADER_START
      private:
           $CLASSNAME(const $CLASSNAME &); /* private so it can't be used. */
           $CLASSNAME & operator= ( const $CLASSNAME & X );
-
-        private:
-                friend class boost::serialization::access;
-                template<class S>
-                void serialize(S &s, const unsigned /*version*/) {
-                        s & BOOST_SERIALIZATION_BASE_OBJECT_NVP(SgNode);
-                        // No data members are serialized at this time, but this serialization function needs to be
-                        // defined because SgSupport is an indirect base class of SgBinaryComposite, which is
-                        // serializable.
-                }
 HEADER_END
 
 
@@ -6118,16 +6108,6 @@ HEADER_APPLICATION_FILE_PREDECLARATION_END
 
 HEADER_APPLICATION_FILE_START
 
-private:
-        friend class boost::serialization::access;
-
-        template<class S>
-        void serialize(S &s, const unsigned /*version*/) {
-             s & BOOST_SERIALIZATION_BASE_OBJECT_NVP(SgSupport);
-             // Most data members are not serialized yet, but this is here because SgFile is a base class of
-             // SgBinaryComposite whose fields are serialized.
-        }
-
 public:
 
        /*! \brief Enum type used to specify output of Fortran as fixed for free format.

From 0c95ac35a5869a779a8c6cba27b2d121f9243084 Mon Sep 17 00:00:00 2001
From: Yonghong Yan <yanyh15@gmail.com>
Date: Fri, 29 Sep 2023 07:31:42 -0400
Subject: [PATCH 16/42] [REX]: deBoost: replace the usage of BOOST_FOREACH with
 C++17 foreach. This is performed using a python script generated from ChatGPT
 and then manually checked each change one by one. The script replace
 BOOST_FOREACH/foreach with for, and the , with : in the same line.

---
 .../SageIII/sageInterface/sageBuilder.C       |   3 -
 .../SageIII/sageInterface/sageInterface.C     |  17 +-
 .../sageInterface/sageInterface_type.C        |  62 +++---
 src/frontend/SageIII/sage_support/cmdline.cpp |   7 +-
 .../SageIII/sage_support/keep_going.cpp       |  15 +-
 .../SageIII/sage_support/sage_support.cpp     |   7 +-
 .../SageIII/virtualCFG/customFilteredCFG.C    |  10 +-
 .../SageIII/virtualCFG/interproceduralCFG.C   |  10 +-
 .../SageIII/virtualCFG/memberFunctions.C      |   8 +-
 src/frontend/SageIII/virtualCFG/staticCFG.C   |  28 ++-
 src/midend/astDump/AstDOTGeneration.C         |  11 +-
 src/midend/astProcessing/graphProcessing.h    |   1 -
 src/midend/astProcessing/graphTemplate.h      |  16 +-
 .../CallGraphAnalysis/CallGraph.C             |  20 +-
 .../CallGraphAnalysis/CallGraph.h             |   7 +-
 .../CallGraphAnalysis/ClassHierarchyGraph.C   |   7 +-
 .../InterProcDataFlowAnalysis.C               |   5 +-
 .../IntraProcAliasAnalysis.C                  |  16 +-
 .../IntraProcAliasAnalysis.h                  |   6 -
 .../PtrAliasAnalysis.C                        |  15 +-
 .../VirtualFunctionAnalysis.C                 |   8 +-
 .../variableRenaming/VariableRenaming.C       | 201 +++++++++---------
 .../variableRenaming/VariableRenaming.h       |   3 +-
 .../ExtractFunctionArguments.C                |  21 +-
 src/rose-config.C                             |   7 +-
 src/util/StringUtility/FileNameClassifier.C   |   1 -
 src/util/StringUtility/FileUtility.C          |   1 -
 .../CompileTests/Cxx17_tests/test2018_25.C    |   2 +-
 .../CompileTests/Cxx_tests/test2011_10.C      |   2 +-
 .../CompileTests/Cxx_tests/test2011_13.C      |   3 +-
 .../CompileTests/Cxx_tests/test2014_103.C     |   4 +-
 .../CompileTests/Cxx_tests/test2014_104.C     |   4 +-
 .../CompileTests/Cxx_tests/test2014_105.C     |   4 +-
 .../CompileTests/Cxx_tests/test2014_106.C     |   4 +-
 .../CompileTests/Cxx_tests/test2014_108.C     |   2 +-
 .../CompileTests/Cxx_tests/test2015_55.C      |   4 +-
 .../CompileTests/Cxx_tests/test2015_56.h      |  38 ++--
 .../CompileTests/Cxx_tests/test2016_58.C      |  13 +-
 ...eDeclarationToInnermostScope_test2015_71.C |   4 +-
 .../astInliningTests/inlineEverything.C       |   2 +-
 .../roseTests/astLValueTests/runTest.C        |   7 +-
 .../VirtualFunctionAnalysisTest.C             |   6 -
 .../pointerAliasAnalysis.h                    |   1 -
 .../typeTraitExerciseWithRetCode.C            |   4 -
 .../typeTraitExerciseWithoutRetCode.C         |   2 -
 .../NormalizationTranslator.C                 |   4 +-
 .../translatorTests/testConstDeclarations.C   |   3 +-
 .../translatorTests/testDataMemberOfConst.C   |   3 +-
 .../translatorTests/testFortranParameter.C    |   3 +-
 .../translatorTests/testFortranProtected.C    |   6 +-
 .../translatorTests/testTranslator2010_03.C   |   3 +-
 tools/moveDeclarationToInnermostScope.C       |   3 +-
 tutorial/ASTGraphGeneratorCustomized.C        |   1 -
 tutorial/classHierarchyGraph.C                |   6 +-
 54 files changed, 278 insertions(+), 373 deletions(-)

diff --git a/src/frontend/SageIII/sageInterface/sageBuilder.C b/src/frontend/SageIII/sageInterface/sageBuilder.C
index 411f96b1b7f..34359b54958 100644
--- a/src/frontend/SageIII/sageInterface/sageBuilder.C
+++ b/src/frontend/SageIII/sageInterface/sageBuilder.C
@@ -12,13 +12,11 @@
 // #include "sageBuilder.h"
    #include <fstream>
    #include <boost/algorithm/string/trim.hpp>
-   #include <boost/foreach.hpp>
    #include "Outliner.hh"
 #else
 // #include "sageBuilder.h"
    #include <fstream>
    #include <boost/algorithm/string/trim.hpp>
-   #include <boost/foreach.hpp>
 #endif
 
 // DQ (4/3/2012): Added so that I can enforce some rules as the AST is constructed.
@@ -28,7 +26,6 @@
 #include "RoseAst.h"
 
 // DQ (3/31/2012): Is this going to be an issue for C++11 use with ROSE?
-#define foreach BOOST_FOREACH
 
 
 
diff --git a/src/frontend/SageIII/sageInterface/sageInterface.C b/src/frontend/SageIII/sageInterface/sageInterface.C
index 4719aee44a3..ed61908f756 100644
--- a/src/frontend/SageIII/sageInterface/sageInterface.C
+++ b/src/frontend/SageIII/sageInterface/sageInterface.C
@@ -49,7 +49,6 @@
 #endif
 
 #include <boost/lexical_cast.hpp>
-#include <boost/foreach.hpp>
 #include <sstream>
 #include <iostream>
 #include <algorithm> // for set operations
@@ -10610,7 +10609,7 @@ string SageInterface::generateUniqueVariableName(SgScopeStatement* scope, std::s
         //Look up the name in the children scopes
         Rose_STL_Container<SgNode*> childScopes = NodeQuery::querySubTree(scope, V_SgScopeStatement);
 
-        BOOST_FOREACH(SgNode* childScope, childScopes)
+        for(SgNode* childScope: childScopes)
         {
             SgScopeStatement* childScopeStatement = isSgScopeStatement(childScope);
 
@@ -14416,7 +14415,7 @@ void SageInterface::insertStatementBeforeFirstNonDeclaration(SgStatement *newStm
 {
     ROSE_ASSERT(newStmt!=NULL);
     ROSE_ASSERT(scope!=NULL);
-    BOOST_FOREACH (SgStatement *targetStmt, scope->generateStatementList()) {
+    for (SgStatement *targetStmt: scope->generateStatementList()) {
         if (!isSgDeclarationStatement(targetStmt)) {
             insertStatementBefore(targetStmt, newStmt, movePreprocessingInfo);
             return;
@@ -14428,7 +14427,7 @@ void SageInterface::insertStatementBeforeFirstNonDeclaration(SgStatement *newStm
 void SageInterface::insertStatementListBeforeFirstNonDeclaration(const std::vector<SgStatement*> &newStmts,SgScopeStatement *scope)
 {
     ROSE_ASSERT(scope!=NULL);
-    BOOST_FOREACH (SgStatement *targetStmt, scope->generateStatementList()) {
+    for (SgStatement *targetStmt: scope->generateStatementList()) {
         if (!isSgDeclarationStatement(targetStmt)) {
             insertStatementListBefore(targetStmt, newStmts);
             return;
@@ -18096,7 +18095,7 @@ void SageInterface::replaceSubexpressionWithStatement(SgExpression* from, Statem
   std::vector<SgInitializedName*> SageInterface::getInParameters(const SgInitializedNamePtrList &params)
   {
     std::vector<SgInitializedName*> in_params;
-    BOOST_FOREACH (SgInitializedName* name, params)
+    for (SgInitializedName* name: params)
       {
         if (!isMutable(name)) in_params.push_back(name);
       }
@@ -18108,7 +18107,7 @@ void SageInterface::replaceSubexpressionWithStatement(SgExpression* from, Statem
   std::vector<SgInitializedName*> SageInterface::getOutParameters(const SgInitializedNamePtrList &params)
   {
     std::vector<SgInitializedName*> out_params;
-    BOOST_FOREACH (SgInitializedName* name, params)
+    for (SgInitializedName* name: params)
       {
         if (isMutable(name)) out_params.push_back(name);
       }
@@ -20359,7 +20358,7 @@ SageInterface::deleteAST ( SgNode* n )
                                                         SgDeclarationStatement * template_decl1 = ((SgDeclarationStatement*)node)->get_definingDeclaration();
                                                         if((template_decl==templateInstantiate_defining||template_decl1==templateInstantiate_defining) && node!=templateInstantiate_defining){
                                                                 /*vector<SgTemplateArgument*> tempargs=  ((SgTemplateInstantiationDecl*)node)->get_templateArguments();
-                                                                foreach (SgTemplateArgument* element, tempargs){
+                                                                for (SgTemplateArgument* element: tempargs){
                                                                         SgTemplateArgument* temparg = isSgTemplateArgument(element);
                                                                         if(temparg){
                                                                                 delete temparg;
@@ -20996,7 +20995,7 @@ SageInterface::deleteAST ( SgNode* n )
                                         }
 
                                         vector<SgTemplateArgument*> tempargs=  ((SgTemplateInstantiationDecl*)node)->get_templateArguments();
-                                        foreach (SgTemplateArgument* element, tempargs){
+                                        for (SgTemplateArgument* element: tempargs){
                                                 SgTemplateArgument* temparg = isSgTemplateArgument(element);
                                                 if(temparg){
                                                         delete temparg;
@@ -21277,7 +21276,7 @@ static void moveOneStatement(SgScopeStatement* sourceBlock, SgScopeStatement* ta
           if (enum_decl) // Rasmussen (12/23/2020)
             {
               // Set the scope of the enumerators
-              BOOST_FOREACH (SgInitializedName* name, enum_decl->get_enumerators())
+              for (SgInitializedName* name: enum_decl->get_enumerators())
                 {
                   name->set_scope(targetBlock);
                 }
diff --git a/src/frontend/SageIII/sageInterface/sageInterface_type.C b/src/frontend/SageIII/sageInterface/sageInterface_type.C
index f21ca2aecc5..23d1e761a9e 100644
--- a/src/frontend/SageIII/sageInterface/sageInterface_type.C
+++ b/src/frontend/SageIII/sageInterface/sageInterface_type.C
@@ -3,10 +3,8 @@
 #include <iostream>
 #include "sageInterface.h"
 #include <map>
-#include <boost/foreach.hpp>
 using namespace std;
 
-#define foreach BOOST_FOREACH
 
 #define DEBUG_QUADRATIC_BEHAVIOR 0
 
@@ -822,7 +820,7 @@ bool isCopyConstructible(SgType* type)
             }
             
             //Check that all the bases classes are copy constructible
-            foreach (SgBaseClass* baseClass, defn->get_inheritances())
+            for (SgBaseClass* baseClass: defn->get_inheritances())
             {
                 SgClassDeclaration* baseClassDecl = baseClass->get_base_class();
                 if (!isCopyConstructible(baseClassDecl->get_type()))
@@ -1570,9 +1568,9 @@ bool isPureVirtualClass(SgType* type, const ClassHierarchyWrapper& classHierarch
     
     //Find all virtual and concrete functions
     set<SgMemberFunctionDeclaration*> concreteFunctions, pureVirtualFunctions;
-    foreach(SgClassDefinition* c, inclusiveAncestors)
+    for(SgClassDefinition* c: inclusiveAncestors)
     {
-        foreach(SgDeclarationStatement* memberDeclaration, c->get_members())
+        for(SgDeclarationStatement* memberDeclaration: c->get_members())
         {
             if (SgMemberFunctionDeclaration* memberFunction = isSgMemberFunctionDeclaration(memberDeclaration))
             {
@@ -1589,11 +1587,11 @@ bool isPureVirtualClass(SgType* type, const ClassHierarchyWrapper& classHierarch
     }
     
     //Check if each virtual function is implemented somewhere
-    foreach (SgMemberFunctionDeclaration* virtualFunction, pureVirtualFunctions)
+    for (SgMemberFunctionDeclaration* virtualFunction: pureVirtualFunctions)
     {
         bool foundConcrete = false;
         
-        foreach (SgMemberFunctionDeclaration* concreteFunction, concreteFunctions)
+        for (SgMemberFunctionDeclaration* concreteFunction: concreteFunctions)
         {
             if (concreteFunction->get_name() != virtualFunction->get_name())
                 continue;
@@ -1680,8 +1678,8 @@ if (!sgClassType) { \
         inclusiveAncestors.insert(classDef);
         
         //Find all member functions
-        foreach(SgClassDefinition* c, inclusiveAncestors) {
-            foreach(SgDeclarationStatement* memberDeclaration, c->get_members()) {
+        for(SgClassDefinition* c: inclusiveAncestors) {
+            for(SgDeclarationStatement* memberDeclaration: c->get_members()) {
                 if (SgMemberFunctionDeclaration* memberFunction = isSgMemberFunctionDeclaration(memberDeclaration)) {
                     allMemberFunctions.push_back(memberFunction);
                 }
@@ -1713,8 +1711,8 @@ if (!sgClassType) { \
         set<SgClassDefinition*> exclusiveAncestors(ancestors.begin(), ancestors.end());
         
         //Find all data members
-        foreach(SgClassDefinition* c, exclusiveAncestors) {
-            foreach(SgDeclarationStatement* memberDeclaration, c->get_members()) {
+        for(SgClassDefinition* c: exclusiveAncestors) {
+            for(SgDeclarationStatement* memberDeclaration: c->get_members()) {
                 if (SgVariableDeclaration * sgVariableDeclaration = isSgVariableDeclaration(memberDeclaration)) {
                     allVariableDeclarations.push_back(sgVariableDeclaration);
                 }
@@ -1783,7 +1781,7 @@ if (!sgClassType) { \
 #if DEBUG_QUADRATIC_BEHAVIOR
         printf ("In HasNoThrowAssign(): allMemberFunctions.size() = %zu \n",allMemberFunctions.size());
 #endif
-        foreach(SgMemberFunctionDeclaration* memberFunction,allMemberFunctions) {
+        for(SgMemberFunctionDeclaration* memberFunction:allMemberFunctions) {
             if (memberFunction->get_specialFunctionModifier().isOperator() && memberFunction->get_name().getString()=="operator="){
                 // check if the function has nothrow attribute
                 //TODO: C++11 accepts noexcept expression which we need to check when we support it.
@@ -1812,7 +1810,7 @@ if (!sgClassType) { \
 #if DEBUG_QUADRATIC_BEHAVIOR
         printf ("In HasNoThrowCopy(): allMemberFunctions.size() = %zu \n",allMemberFunctions.size());
 #endif
-        foreach(SgMemberFunctionDeclaration* memberFunction,allMemberFunctions) {
+        for(SgMemberFunctionDeclaration* memberFunction:allMemberFunctions) {
             if (memberFunction->get_specialFunctionModifier().isConstructor()){
                 // function must have exactly one argument and the argument type must match class type after stripping typedef, const, and ref
                 if(CheckIfFunctionAcceptsArgumentIgnoreConstRefAndTypedef(memberFunction)) {
@@ -1842,7 +1840,7 @@ if (!sgClassType) { \
 #if DEBUG_QUADRATIC_BEHAVIOR
         printf ("In HasNoThrowConstructor(): allMemberFunctions.size() = %zu \n",allMemberFunctions.size());
 #endif
-        foreach(SgMemberFunctionDeclaration* memberFunction,allMemberFunctions) {
+        for(SgMemberFunctionDeclaration* memberFunction:allMemberFunctions) {
             if (memberFunction->get_specialFunctionModifier().isConstructor()){
                 // function must have no args
                 if(memberFunction->get_args().size() == 0) {
@@ -1879,7 +1877,7 @@ if (!sgClassType) { \
 #if DEBUG_QUADRATIC_BEHAVIOR
         printf ("In HasTrivialAssign(): allMemberFunctions.size() = %zu \n",allMemberFunctions.size());
 #endif
-        foreach(SgMemberFunctionDeclaration* memberFunction,allMemberFunctions) {
+        for(SgMemberFunctionDeclaration* memberFunction:allMemberFunctions) {
             if (memberFunction->get_specialFunctionModifier().isOperator() && memberFunction->get_name().getString()=="operator="){
                 // function must have exactly one argument and the argument type after stripping typedef, const, and ref must match class type
                 if(CheckIfFunctionAcceptsArgumentIgnoreConstRefAndTypedef(memberFunction))
@@ -1915,7 +1913,7 @@ if (!sgClassType) { \
 #if DEBUG_QUADRATIC_BEHAVIOR
         printf ("In HasTrivialCopy(): allMemberFunctions.size() = %zu \n",allMemberFunctions.size());
 #endif
-        foreach(SgMemberFunctionDeclaration* memberFunction,allMemberFunctions) {
+        for(SgMemberFunctionDeclaration* memberFunction:allMemberFunctions) {
             if (memberFunction->get_specialFunctionModifier().isConstructor()){
                 // function must have exactly one argument and the argument type after stripping typedef, const, and ref must match passed-in type
                 if(CheckIfFunctionAcceptsArgumentIgnoreConstRefAndTypedef(memberFunction))
@@ -1947,7 +1945,7 @@ if (!sgClassType) { \
 #if DEBUG_QUADRATIC_BEHAVIOR
         printf ("In HasTrivialConstructor(): allMemberFunctions.size() = %zu \n",allMemberFunctions.size());
 #endif
-        foreach(SgMemberFunctionDeclaration* memberFunction,allMemberFunctions) {
+        for(SgMemberFunctionDeclaration* memberFunction:allMemberFunctions) {
             if (memberFunction->get_specialFunctionModifier().isConstructor()){
                 return false;
             }
@@ -1979,7 +1977,7 @@ if (!sgClassType) { \
 #if DEBUG_QUADRATIC_BEHAVIOR
         printf ("In HasTrivialDestructor(): allMemberFunctions.size() = %zu \n",allMemberFunctions.size());
 #endif
-        foreach(SgMemberFunctionDeclaration* memberFunction,allMemberFunctions) {
+        for(SgMemberFunctionDeclaration* memberFunction:allMemberFunctions) {
             if (memberFunction->get_specialFunctionModifier().isDestructor()){
                 return false;
             }
@@ -2011,7 +2009,7 @@ if (!sgClassType) { \
 #if DEBUG_QUADRATIC_BEHAVIOR
         printf ("In HasVirtualDestructor(): allMemberFunctions.size() = %zu \n",allMemberFunctions.size());
 #endif
-        foreach(SgMemberFunctionDeclaration* memberFunction,allMemberFunctions) {
+        for(SgMemberFunctionDeclaration* memberFunction:allMemberFunctions) {
             if (memberFunction->get_functionModifier().isVirtual() && memberFunction->get_specialFunctionModifier().isDestructor())
                 return true;
         }
@@ -2079,7 +2077,7 @@ if (!sgClassType) { \
 #endif
         
         // Match types
-        foreach(SgClassDefinition* c, inclusiveAncestors) {
+        for(SgClassDefinition* c: inclusiveAncestors) {
             if(c->get_declaration()->get_type()->stripType(SgType::STRIP_TYPEDEF_TYPE | SgType::STRIP_ARRAY_TYPE  | SgType::STRIP_MODIFIER_TYPE ) == baseClassType)
                 return true;
         }
@@ -2262,7 +2260,7 @@ if (!sgClassType) { \
 #if DEBUG_QUADRATIC_BEHAVIOR
         printf ("In IsPolymorphic(): allMemberFunctions.size() = %zu \n",allMemberFunctions.size());
 #endif
-        foreach(SgMemberFunctionDeclaration* memberFunction,allMemberFunctions) {
+        for(SgMemberFunctionDeclaration* memberFunction:allMemberFunctions) {
             if (memberFunction->get_functionModifier().isVirtual())
                 return true;
         }
@@ -2304,7 +2302,7 @@ if (!sgClassType) { \
         
         
         //If we have a virtual function, then it not OK
-        foreach(SgDeclarationStatement* memberDeclaration, classDef->get_members()) {
+        for(SgDeclarationStatement* memberDeclaration: classDef->get_members()) {
             if (SgMemberFunctionDeclaration* memberFunction = isSgMemberFunctionDeclaration(memberDeclaration)) {
                 if (memberFunction->get_functionModifier().isVirtual())
                     return false;
@@ -2329,7 +2327,7 @@ if (!sgClassType) { \
         //same access control (private, protected, public) for all its non-static data members
         bool first = true;
         SgAccessModifier::access_modifier_enum prevModifier=SgAccessModifier::e_unknown;
-        foreach(SgDeclarationStatement* memberDeclaration, classDef->get_members()) {
+        for(SgDeclarationStatement* memberDeclaration: classDef->get_members()) {
             //has no non-static data members with brace- or equal- initializers.
             if (SgVariableDeclaration* memberVariable = isSgVariableDeclaration(memberDeclaration)) {
                 if (memberVariable->get_declarationModifier().get_storageModifier().isStatic())
@@ -2343,7 +2341,7 @@ if (!sgClassType) { \
                 if (first) {
                     first = false;
                     firstNonStaticDataMember = NULL;
-                    foreach(SgInitializedName* name, memberVariable->get_variables ()) {
+                    for(SgInitializedName* name: memberVariable->get_variables ()) {
                         firstNonStaticDataMember = name->get_type();
                         break;
                     }
@@ -2360,7 +2358,7 @@ if (!sgClassType) { \
 #if DEBUG_QUADRATIC_BEHAVIOR
             printf ("In IsStandardLayout(): allVariableDeclarations.size() = %zu \n",allVariableDeclarations.size());
 #endif
-            foreach(SgVariableDeclaration* memberVariable, allVariableDeclarations) {
+            for(SgVariableDeclaration* memberVariable: allVariableDeclarations) {
                 if (memberVariable->get_declarationModifier().get_storageModifier().isStatic())
                     continue;
                 // ok, we have atleast one non-static data member in the ancestry
@@ -2380,8 +2378,8 @@ if (!sgClassType) { \
             
             // There can be atmost 1 base class with non-static data members
             int baseClassesWithNonStaticData = 0;
-            foreach(SgClassDefinition* c, exclusiveAncestors) {
-                foreach(SgDeclarationStatement* baseMemberDeclaration, c->get_members()) {
+            for(SgClassDefinition* c: exclusiveAncestors) {
+                for(SgDeclarationStatement* baseMemberDeclaration: c->get_members()) {
                     if (SgVariableDeclaration* baseMemberVariable = isSgVariableDeclaration(baseMemberDeclaration)) {
                         if (!baseMemberVariable->get_declarationModifier().get_storageModifier().isStatic()) {
                             baseClassesWithNonStaticData ++;
@@ -2395,7 +2393,7 @@ if (!sgClassType) { \
         }
         
         // All base classes have to be standard layout
-        foreach(SgBaseClass* baseClass, classDef->get_inheritances()) {
+        for(SgBaseClass* baseClass: classDef->get_inheritances()) {
             if(!IsStandardLayout(baseClass->get_base_class()->get_type()))
                 return false;
         }
@@ -2410,7 +2408,7 @@ if (!sgClassType) { \
 #if DEBUG_QUADRATIC_BEHAVIOR
             printf ("In IsStandardLayout(): exclusiveAncestors.size() = %zu \n",exclusiveAncestors.size());
 #endif
-            foreach(SgClassDefinition* c, exclusiveAncestors) {
+            for(SgClassDefinition* c: exclusiveAncestors) {
                 if(c->get_declaration()->get_type()->stripType(SgType::STRIP_TYPEDEF_TYPE) ==  firstNonStaticDataMember->stripType(SgType::STRIP_TYPEDEF_TYPE))
                     return false;
             }
@@ -2465,7 +2463,7 @@ if (!sgClassType) { \
             return false;
         
         
-        foreach(SgDeclarationStatement* memberDeclaration, classDef->get_members()) {
+        for(SgDeclarationStatement* memberDeclaration: classDef->get_members()) {
             // No virtual functions
             if (SgMemberFunctionDeclaration* memberFunction = isSgMemberFunctionDeclaration(memberDeclaration)) {
                 if (memberFunction->get_functionModifier().isVirtual())
@@ -2478,7 +2476,7 @@ if (!sgClassType) { \
                     continue;
                 
                 // each variable must be Trivial and must not have initializers
-                foreach(SgInitializedName* name, memberVariable->get_variables ()) {
+                for(SgInitializedName* name: memberVariable->get_variables ()) {
                     if(name->get_initializer())
                         return false;
                     if(!IsTrivial(name->get_type()))
@@ -2489,7 +2487,7 @@ if (!sgClassType) { \
         }
         
         // Base classes must be trivial too
-        foreach(SgBaseClass* baseClass, classDef->get_inheritances()) {
+        for(SgBaseClass* baseClass: classDef->get_inheritances()) {
             if(!IsTrivial(baseClass->get_base_class()->get_type()))
                 return false;
         }
diff --git a/src/frontend/SageIII/sage_support/cmdline.cpp b/src/frontend/SageIII/sage_support/cmdline.cpp
index a65366f484d..b806b856779 100644
--- a/src/frontend/SageIII/sage_support/cmdline.cpp
+++ b/src/frontend/SageIII/sage_support/cmdline.cpp
@@ -18,7 +18,6 @@
 
 #include "Outliner.hh"
 
-#include <boost/foreach.hpp>
 
 using namespace Rose;                                   // temporary, until this file lives in namespace Rose
 
@@ -1567,7 +1566,7 @@ NormalizeIncludePathOptions (std::vector<std::string>& argv)
   std::vector<std::string> r_argv;
 
   bool looking_for_include_path_arg = false;
-  BOOST_FOREACH(std::string arg, argv)
+  for(std::string arg: argv)
   {
       // Must be first since there could be, for example, "-I -I",
       // in which case, the else if branch checking for -I would
@@ -1801,7 +1800,7 @@ StripRoseOptions (std::vector<std::string>& argv)
           Cmdline::Fortran::option_prefix,    // Current prefix, e.g. "-rose:fortran:"
           "-");                               // New prefix, e.g. "-"
 
-  BOOST_FOREACH(std::string fortran_option, fortran_options)
+  for(std::string fortran_option: fortran_options)
   {
       // TOO1 (2/13/2014): There are no ROSE-specific Fortran options yet.
       // Skip ROSE-specific Fortran options
@@ -1879,7 +1878,7 @@ StripRoseOptions (std::vector<std::string>& argv)
   // TOO1 (2/13/2014): Skip ALL ROSE-specific OFP options;
   //                   at this stage, we only have "-rose:fortran:ofp:jvm_options",
   //                   and this is only inteded for the OFP frontend's JVM.
-  BOOST_FOREACH(std::string ofp_option, ofp_options)
+  for(std::string ofp_option: ofp_options)
   {
       if (SgProject::get_verbose() > 1)
       {
diff --git a/src/frontend/SageIII/sage_support/keep_going.cpp b/src/frontend/SageIII/sage_support/keep_going.cpp
index 9b7ff843008..cbd7eb6e28d 100644
--- a/src/frontend/SageIII/sage_support/keep_going.cpp
+++ b/src/frontend/SageIII/sage_support/keep_going.cpp
@@ -22,7 +22,6 @@
 #include <boost/algorithm/string/join.hpp>
 #include <boost/date_time/posix_time/posix_time.hpp>
 #include <boost/filesystem.hpp>
-#include <boost/foreach.hpp>
 #include <boost/interprocess/sync/file_lock.hpp>
 #include <boost/interprocess/sync/scoped_lock.hpp>
 
@@ -316,7 +315,7 @@ void Rose::KeepGoing::commandLineProcessing
           std::vector<std::string> filenames =
             GetSourceFilenamesFromCommandline(
                 std::vector<std::string>(argv, argv + argc));
-          BOOST_FOREACH(std::string filename, filenames)
+          for(std::string filename: filenames)
           {
             std::cout << filename << std::endl;
           }
@@ -477,7 +476,7 @@ void Rose::KeepGoing::setMidendErrorCode (SgProject* project, int errorCode)
   project->set_midendErrorCode(errorCode);
 
   SgFilePtrList files = project->get_files();
-  BOOST_FOREACH(SgFile* file, files)
+  for(SgFile* file: files)
   {
     file->set_midendErrorCode(errorCode);
   }
@@ -511,7 +510,7 @@ void Rose::KeepGoing::generate_reports(SgProject* project,
 
     AppendToFile (report_filename__fail, orig_command_str);
 
-    BOOST_FOREACH(SgFile* file, files_with_errors)
+    for(SgFile* file: files_with_errors)
     {
       std::string filename = file->getFileName();
       filename = StripPrefix(path_prefix, filename);
@@ -569,7 +568,7 @@ void Rose::KeepGoing::generate_reports(SgProject* project,
     ostamp << GetTimestamp()  << " " << getpid() << std::endl;
     AppendToFile (report_filename__pass, ostamp.str());
 
-    BOOST_FOREACH(SgFile* file, files_without_errors)
+    for(SgFile* file: files_without_errors)
     {
       std::string full_filename = file->getFileName();
       std::string filename = StripPrefix(path_prefix, full_filename);
@@ -607,7 +606,7 @@ void Rose::KeepGoing::generate_reports(SgProject* project,
     std::ostringstream ostamp;
     ostamp << GetTimestamp()  << " " << getpid() << std::endl;
 
-    BOOST_FOREACH(SgFile* file, files_with_errors)
+    for(SgFile* file: files_with_errors)
     {
       std::string filename = file->getFileName();
 
@@ -647,7 +646,7 @@ void Rose::KeepGoing::generate_reports(SgProject* project,
       //    exit(1);
       //}
 
-      BOOST_FOREACH(SgFile* file, files_with_errors)
+      for(SgFile* file: files_with_errors)
       {
           std::string filename = file->getFileName();
           filename = StripPrefix(path_prefix, filename);
@@ -694,7 +693,7 @@ void Rose::KeepGoing::generate_reports(SgProject* project,
       //    exit(1);
       //}
 
-      BOOST_FOREACH(SgFile* file, files_without_errors)
+      for(SgFile* file: files_without_errors)
       {
           std::string filename = file->getFileName();
           filename = StripPrefix(path_prefix, filename);
diff --git a/src/frontend/SageIII/sage_support/sage_support.cpp b/src/frontend/SageIII/sage_support/sage_support.cpp
index fb4642250a5..2a5ccbd6c4c 100644
--- a/src/frontend/SageIII/sage_support/sage_support.cpp
+++ b/src/frontend/SageIII/sage_support/sage_support.cpp
@@ -24,7 +24,6 @@
 #include <filesystem>
 
 #include <boost/algorithm/string/join.hpp>
-#include <boost/foreach.hpp>
 
 // DQ (12/22/2019): I don't need this now, and it is an issue for some compilers (e.g. GNU 4.9.4).
 // DQ (12/21/2019): Require hash table support for determining the shared nodes in the ASTs.
@@ -1801,7 +1800,7 @@ SgProject::parse()
 
 #if 0
   // DQ (4/24/2021): Debugging the handling of header_file_unparsing_optimization for non-optimized case.
-     BOOST_FOREACH(SgFile* file, files)
+     for(SgFile* file: files)
         {
           printf ("file = %s \n",file->getFileName().c_str());
           printf (" --- file->get_header_file_unparsing_optimization()             = %s \n",file->get_header_file_unparsing_optimization() ? "true" : "false");
@@ -1812,7 +1811,7 @@ SgProject::parse()
 
      bool unparse_using_tokens = false;
 
-     BOOST_FOREACH(SgFile* file, files)
+     for(SgFile* file: files)
         {
           ASSERT_not_null(file);
 
@@ -4456,7 +4455,7 @@ Rose::Frontend::RunSerial(SgProject* project)
               }
 #endif
           }
-      }//BOOST_FOREACH
+      }
   }//all_files->callFrontEnd
 
   ASSERT_not_null(project);
diff --git a/src/frontend/SageIII/virtualCFG/customFilteredCFG.C b/src/frontend/SageIII/virtualCFG/customFilteredCFG.C
index 7430cdd9303..63e38724346 100644
--- a/src/frontend/SageIII/virtualCFG/customFilteredCFG.C
+++ b/src/frontend/SageIII/virtualCFG/customFilteredCFG.C
@@ -1,6 +1,4 @@
 #include "customFilteredCFG.h"
-#include <boost/foreach.hpp>
-#define foreach BOOST_FOREACH
 
 namespace StaticCFG
 {
@@ -32,7 +30,7 @@ namespace StaticCFG
                 (start_->cfgForBeginning(), all_nodes, explored);
 
         typedef std::pair<VirtualCFG::FilteredCFGNode<_filter>, SgGraphNode*> pair_t;
-        foreach (const pair_t& p, all_nodes)
+        for (const pair_t& p: all_nodes)
             all_nodes_[VirtualCFG::CFGNode(p.first.getNode(), 0)] = p.second; 
     }
 
@@ -71,7 +69,7 @@ void CustomFilteredCFG<_filter>::buildTemplatedCFG(NodeT n, std::map<NodeT, SgGr
     }
 
     std::vector<EdgeT> outEdges = n.outEdges();
-    foreach (const EdgeT& edge, outEdges)
+    for (const EdgeT& edge: outEdges)
     {
         NodeT tar = edge.target();
 
@@ -102,14 +100,14 @@ void CustomFilteredCFG<_filter>::buildTemplatedCFG(NodeT n, std::map<NodeT, SgGr
         graph_->addDirectedEdge(new_edge);
     }
 
-    foreach (const EdgeT& edge, outEdges)
+    for (const EdgeT& edge: outEdges)
     {
         ROSE_ASSERT(edge.source() == n);
         buildTemplatedCFG<NodeT, EdgeT>(edge.target(), all_nodes, explored);
     }
 
     std::vector<EdgeT> inEdges = n.inEdges();
-    foreach (const EdgeT& edge, inEdges)
+    for (const EdgeT& edge: inEdges)
     {
         ROSE_ASSERT(edge.target() == n);
         buildTemplatedCFG<NodeT, EdgeT>(edge.source(), all_nodes, explored);
diff --git a/src/frontend/SageIII/virtualCFG/interproceduralCFG.C b/src/frontend/SageIII/virtualCFG/interproceduralCFG.C
index 46442468a79..c2d72cc541f 100644
--- a/src/frontend/SageIII/virtualCFG/interproceduralCFG.C
+++ b/src/frontend/SageIII/virtualCFG/interproceduralCFG.C
@@ -1,12 +1,8 @@
 #include "sage3basic.h"
 #include "CallGraph.h"
 #include "interproceduralCFG.h"
-#include <boost/foreach.hpp>
 #include <vector>
 
-#define foreach BOOST_FOREACH
-
-
 namespace StaticCFG
 {
 
@@ -113,7 +109,7 @@ void InterproceduralCFG::buildCFG(CFGNode n,
                       << std::endl;
             outEdges = n.outEdges();
           } else {
-            foreach (SgFunctionDefinition* def, defs) {
+            for (SgFunctionDefinition* def: defs) {
               addEdge(n, def->cfgForBeginning(), outEdges);
               addEdge(def->cfgForEnd(), CFGNode(sgnode, idx+1), outEdges);
             }
@@ -124,7 +120,7 @@ void InterproceduralCFG::buildCFG(CFGNode n,
     }
 
     std::set<CFGNode> targets; 
-    foreach (const CFGEdge& edge, outEdges)
+    for (const CFGEdge& edge: outEdges)
     {
         CFGNode tar = edge.target();
         targets.insert(tar);
@@ -146,7 +142,7 @@ void InterproceduralCFG::buildCFG(CFGNode n,
         graph_->addDirectedEdge(new_edge);
     }
 
-    foreach (const CFGNode& target, targets)
+    for (const CFGNode& target: targets)
     {
         buildCFG(target, all_nodes, explored, classHierarchy);
     }
diff --git a/src/frontend/SageIII/virtualCFG/memberFunctions.C b/src/frontend/SageIII/virtualCFG/memberFunctions.C
index 949435893d1..2b794162307 100644
--- a/src/frontend/SageIII/virtualCFG/memberFunctions.C
+++ b/src/frontend/SageIII/virtualCFG/memberFunctions.C
@@ -7,8 +7,6 @@
 #endif
 
 #include <vector>
-#include <boost/foreach.hpp>
-#define foreach BOOST_FOREACH
 using namespace std;
 
 #ifndef ROSE_USE_INTERNAL_FRONTEND_DEVELOPMENT
@@ -1170,7 +1168,7 @@ SgFunctionDefinition::cfgInEdges(unsigned int idx) {
         ClassHierarchyWrapper classHierarchy( SageInterface::getProject() );
         Rose_STL_Container<SgExpression*> exps;
         CallTargetSet::getExpressionsForDefinition(this, &classHierarchy, exps);
-        foreach (SgExpression* exp, exps)
+        for (SgExpression* exp: exps)
           makeEdge(exp->cfgForEnd(), CFGNode(this, idx), result);
       }
       break;
@@ -4139,7 +4137,7 @@ SgPseudoDestructorRefExp::cfgInEdges(unsigned int idx)
                   ClassHierarchyWrapper classHierarchy( SageInterface::getProject() );
                   Rose_STL_Container<SgFunctionDefinition*> defs;
                   CallTargetSet::getDefinitionsForExpression(this, &classHierarchy, defs);
-                  foreach (SgFunctionDefinition* def, defs)
+                  for (SgFunctionDefinition* def: defs)
                     makeEdge(CFGNode(this, idx), def->cfgForBeginning(), result);
                 }
                 else {
@@ -4165,7 +4163,7 @@ SgPseudoDestructorRefExp::cfgInEdges(unsigned int idx)
                   ClassHierarchyWrapper classHierarchy( SageInterface::getProject() );
                   Rose_STL_Container<SgFunctionDefinition*> defs;
                   CallTargetSet::getDefinitionsForExpression(this, &classHierarchy, defs);
-                  foreach (SgFunctionDefinition* def, defs)
+                  for (SgFunctionDefinition* def: defs)
                     makeEdge(def->cfgForEnd(), CFGNode(this, idx), result);
                 }
                 else
diff --git a/src/frontend/SageIII/virtualCFG/staticCFG.C b/src/frontend/SageIII/virtualCFG/staticCFG.C
index 7256b2d258b..720e781cc32 100644
--- a/src/frontend/SageIII/virtualCFG/staticCFG.C
+++ b/src/frontend/SageIII/virtualCFG/staticCFG.C
@@ -1,7 +1,5 @@
 #include "staticCFG.h"
-#include <boost/foreach.hpp>
 
-#define foreach BOOST_FOREACH
 
 
 namespace StaticCFG
@@ -27,9 +25,9 @@ void CFG::clearNodesAndEdges()
 {
     if (graph_ != NULL)
     {
-        foreach (SgGraphNode* node, graph_->computeNodeSet())
+        for (SgGraphNode* node: graph_->computeNodeSet())
         {
-            foreach (SgDirectedGraphEdge* edge, graph_->computeEdgeSetOut(node))
+            for (SgDirectedGraphEdge* edge: graph_->computeEdgeSetOut(node))
             {
                 // This would be so much simpler if the attribute used container-owns-attribute paradigm. In any case, we
                 // cannot delete the attribute without first removing it from the container because the container needs to be
@@ -121,7 +119,7 @@ void CFG::buildFilteredCFG()
             (VirtualCFG::makeInterestingCfg(start_), all_nodes, explored);
 
     typedef std::pair<VirtualCFG::InterestingNode, SgGraphNode*> pair_t;
-    foreach (const pair_t& p, all_nodes)
+    for (const pair_t& p: all_nodes)
         all_nodes_[VirtualCFG::CFGNode(p.first.getNode(), 0)] = p.second;
 }
 
@@ -149,7 +147,7 @@ void CFG::buildCFG(CFGNode n)
     }
 
     std::vector<VirtualCFG::CFGEdge> outEdges = n.outEdges();
-    foreach (const VirtualCFG::CFGEdge& edge, outEdges)
+    for (const VirtualCFG::CFGEdge& edge: outEdges)
     {
         CFGNode tar = edge.target();
 
@@ -168,7 +166,7 @@ void CFG::buildCFG(CFGNode n)
         graph_->addDirectedEdge(new SgDirectedGraphEdge(from, to));
     }
 
-    foreach (const VirtualCFG::CFGEdge& edge, outEdges)
+    for (const VirtualCFG::CFGEdge& edge: outEdges)
     {
         ROSE_ASSERT(edge.source() == n);
         buildCFG(edge.target());
@@ -176,7 +174,7 @@ void CFG::buildCFG(CFGNode n)
 
 #if 1
     std::vector<CFGEdge> inEdges = n.inEdges();
-    foreach (const VirtualCFG::CFGEdge& edge, inEdges)
+    for (const VirtualCFG::CFGEdge& edge: inEdges)
     {
         ROSE_ASSERT(edge.target() == n);
         buildCFG(edge.source());
@@ -241,7 +239,7 @@ void CFG::buildCFG(NodeT n, std::map<NodeT, SgGraphNode*>& all_nodes, std::set<N
     printf ("In CFG::buildCFG(): loop 1.1 \n");
 #endif
 
-    foreach (const EdgeT& edge, outEdges)
+    for (const EdgeT& edge: outEdges)
     {
         NodeT tar = edge.target();
 #if 0
@@ -293,7 +291,7 @@ void CFG::buildCFG(NodeT n, std::map<NodeT, SgGraphNode*>& all_nodes, std::set<N
     printf ("In CFG::buildCFG(): loop 2 \n");
 #endif
 
-    foreach (const EdgeT& edge, outEdges)
+    for (const EdgeT& edge: outEdges)
     {
         ROSE_ASSERT(edge.source() == n);
         buildCFG<NodeT, EdgeT>(edge.target(), all_nodes, explored);
@@ -304,7 +302,7 @@ void CFG::buildCFG(NodeT n, std::map<NodeT, SgGraphNode*>& all_nodes, std::set<N
 #endif
 
     std::vector<EdgeT> inEdges = n.inEdges();
-    foreach (const EdgeT& edge, inEdges)
+    for (const EdgeT& edge: inEdges)
     {
         ROSE_ASSERT(edge.target() == n);
         buildCFG<NodeT, EdgeT>(edge.source(), all_nodes, explored);
@@ -368,11 +366,11 @@ void CFG::processNodes(std::ostream & o, SgGraphNode* n, std::set<SgGraphNode*>&
     printNodePlusEdges(o, n);
 
     std::set<SgDirectedGraphEdge*> out_edges = graph_->computeEdgeSetOut(n);
-    foreach (SgDirectedGraphEdge* e, out_edges)
+    for (SgDirectedGraphEdge* e: out_edges)
         processNodes(o, e->get_to(), explored);
 
     std::set<SgDirectedGraphEdge*> in_edges = graph_->computeEdgeSetIn(n);
-    foreach (SgDirectedGraphEdge* e, in_edges)
+    for (SgDirectedGraphEdge* e: in_edges)
         processNodes(o, e->get_from(), explored);
 }
 
@@ -381,12 +379,12 @@ void CFG::printNodePlusEdges(std::ostream & o, SgGraphNode* node)
     printNode(o, node);
 
     std::set<SgDirectedGraphEdge*> out_edges = graph_->computeEdgeSetOut(node);
-    foreach (SgDirectedGraphEdge* e, out_edges)
+    for (SgDirectedGraphEdge* e: out_edges)
         printEdge(o, e, false);
 
 #ifdef DEBUG
     std::set<SgDirectedGraphEdge*> in_edges = graph_->computeEdgeSetIn(node);
-    foreach (SgDirectedGraphEdge* e, in_edges)
+    for (SgDirectedGraphEdge* e: in_edges)
         printEdge(o, e, true);
 #endif
 }
diff --git a/src/midend/astDump/AstDOTGeneration.C b/src/midend/astDump/AstDOTGeneration.C
index 4515f73c4cf..c3fc5d122c4 100644
--- a/src/midend/astDump/AstDOTGeneration.C
+++ b/src/midend/astDump/AstDOTGeneration.C
@@ -9,7 +9,6 @@
 #include "sage3basic.h"
 #include "AstDOTGeneration.h"
 #include "transformationTracking.h"
-#include <boost/foreach.hpp>
 
 // DQ (10/21/2010):  This should only be included by source files that require it.
 // This fixed a reported bug which caused conflicts with autoconf macros (e.g. PACKAGE_BUGREPORT).
@@ -251,7 +250,7 @@ void AstDOTGeneration::addAdditionalNodesAndEdges(SgNode* node)
      if (astAttributeContainer != NULL)
         {
        // Loop over all the attributes at this IR node
-          BOOST_FOREACH (const std::string &name, astAttributeContainer->getAttributeIdentifiers())
+          for (const std::string &name: astAttributeContainer->getAttributeIdentifiers())
              {
                AstAttribute* attribute = astAttributeContainer->operator[](name);
                ROSE_ASSERT(attribute != NULL);
@@ -759,7 +758,7 @@ AstDOTGeneration::evaluateSynthesizedAttribute(SgNode* node, DOTInheritedAttribu
      if (astAttributeContainer != NULL)
         {
        // Loop over all the attributes at this IR node
-          BOOST_FOREACH (const std::string &name, astAttributeContainer->getAttributeIdentifiers())
+          for (const std::string &name: astAttributeContainer->getAttributeIdentifiers())
              {
                AstAttribute* attribute = astAttributeContainer->operator[](name);
                ROSE_ASSERT(attribute != NULL);
@@ -1159,7 +1158,7 @@ AstDOTGeneration::additionalNodeInfo(SgNode* node)
      if (astAttributeContainer != NULL)
         {
           ss << "Attribute list (size=" << astAttributeContainer->size() << "):" << "\\n";
-          BOOST_FOREACH (const std::string &name, astAttributeContainer->getAttributeIdentifiers())
+          for (const std::string &name: astAttributeContainer->getAttributeIdentifiers())
              {
             // pair<std::string,AstAttribute*>
                AstAttribute* attribute = astAttributeContainer->operator[](name);
@@ -1219,7 +1218,7 @@ AstDOTGeneration::additionalNodeOptions(SgNode* node)
 #if 0
           printf ("In AstDOTGeneration::additionalNodeOptions(): astAttributeContainer = %p for node = %p = %s \n",astAttributeContainer,node,node->class_name().c_str());
 #endif
-          BOOST_FOREACH (const std::string &name, astAttributeContainer->getAttributeIdentifiers())
+          for (const std::string &name: astAttributeContainer->getAttributeIdentifiers())
              {
             // std::string name = i->first;
                AstAttribute* attribute = astAttributeContainer->operator[](name);
@@ -1257,7 +1256,7 @@ AstDOTGeneration::commentOutNodeInGraph(SgNode* node)
      AstAttributeMechanism* astAttributeContainer = node->get_attributeMechanism();
      if (astAttributeContainer != NULL)
         {
-          BOOST_FOREACH (const std::string &name, astAttributeContainer->getAttributeIdentifiers())
+          for (const std::string &name: astAttributeContainer->getAttributeIdentifiers())
              {
             // std::string name = i->first;
                AstAttribute* attribute = astAttributeContainer->operator[](name);
diff --git a/src/midend/astProcessing/graphProcessing.h b/src/midend/astProcessing/graphProcessing.h
index 07cdbd35235..0d8baadcf09 100644
--- a/src/midend/astProcessing/graphProcessing.h
+++ b/src/midend/astProcessing/graphProcessing.h
@@ -55,7 +55,6 @@ AS WRITTEN, THESE FUNCTIONS WILL ONLY WORK WITH GRAPHS THAT ARE IMPLEMENTED IN T
 
 #include <boost/graph/adjacency_list.hpp>
 #include <boost/bind.hpp>
-#include <boost/foreach.hpp>
 #include <boost/tuple/tuple.hpp>
 #include <boost/graph/graphviz.hpp>
 #include <boost/graph/dominator_tree.hpp>
diff --git a/src/midend/astProcessing/graphTemplate.h b/src/midend/astProcessing/graphTemplate.h
index e3075618ffb..a0935ffdb1b 100644
--- a/src/midend/astProcessing/graphTemplate.h
+++ b/src/midend/astProcessing/graphTemplate.h
@@ -5,7 +5,6 @@
 #include <rose.h>
 #include <boost/graph/adjacency_list.hpp>
 #include <boost/bind.hpp>
-#include <boost/foreach.hpp>
 #include <boost/tuple/tuple.hpp>
 #include <boost/graph/graphviz.hpp>
 #include <boost/graph/dominator_tree.hpp>
@@ -17,7 +16,6 @@
 namespace Backstroke
 {
 
-#define foreach BOOST_FOREACH
 
 
 //! This function helps to write the DOT file for vertices.
@@ -310,7 +308,7 @@ void CFG<CFGNodeFilter>::build(SgFunctionDefinition* funcDef)
 template <class CFGNodeFilter>
 void CFG<CFGNodeFilter>::setEntryAndExit()
 {
-    foreach (Vertex v, boost::vertices(*this))
+    for (Vertex v: boost::vertices(*this))
         {
                 CFGNodePtr node = (*this)[v];
                 if (isSgFunctionDefinition(node->getNode()))
@@ -371,7 +369,7 @@ void CFG<CFGNodeFilter>::buildCFG(
 
         std::vector<CFGEdgeType> outEdges = node.outEdges();
 
-        foreach(const CFGEdgeType& cfgEdge, outEdges)
+        for(const CFGEdgeType& cfgEdge: outEdges)
         {
                 // For each out edge, add the target node.
                 CFGNodeType tar = cfgEdge.target();
@@ -446,7 +444,7 @@ std::vector<typename CFG<CFGNodeFilter>::CFGNodePtr>
 CFG<CFGNodeFilter>::getAllNodes() const
 {
         std::vector<CFGNodePtr> allNodes;
-    foreach (Vertex v, boost::vertices(*this))
+    for (Vertex v: boost::vertices(*this))
                 allNodes.push_back((*this)[v]);
         return allNodes;
 }
@@ -457,7 +455,7 @@ std::vector<typename CFG<CFGNodeFilter>::CFGNodeType>
 CFG<CFGNodeFilter>::getAllNodesNoPtrs() const
 {
         std::vector<CFGNodeType> allNodes;
-    foreach (Vertex v, boost::vertices(*this))
+    for (Vertex v: boost::vertices(*this))
                 allNodes.push_back(&((*this)[v]));
         return allNodes;
 }
@@ -468,7 +466,7 @@ std::vector<typename CFG<CFGNodeFilter>::CFGEdgePtr>
 CFG<CFGNodeFilter>::getAllEdges() const
 {
         std::vector<CFGEdgePtr> allEdges;
-    foreach (const Edge& e, boost::edges(*this))
+    for (const Edge& e: boost::edges(*this))
                 allEdges.push_back((*this)[e]);
         return allEdges;
 }
@@ -494,7 +492,7 @@ std::vector<typename CFG<CFGNodeFilter>::Edge> CFG<CFGNodeFilter>::getAllBackEdg
     // If the dominator tree is not built yet, build it now.
     getDominatorTree();
 
-    foreach (const Edge& e, boost::edges(*this))
+    for (const Edge& e: boost::edges(*this))
     {
         Vertex src = boost::source(e, *this);
         Vertex tar = boost::target(e, *this);
@@ -520,7 +518,7 @@ std::vector<typename CFG<CFGNodeFilter>::Vertex> CFG<CFGNodeFilter>::getAllLoopH
 {
     std::vector<Edge> backEdges = getAllBackEdges();
     std::vector<Vertex> headers;
-    foreach (Edge e, backEdges)
+    for (Edge e: backEdges)
         headers.push_back(boost::target(e, *this));
     return headers;
 }
diff --git a/src/midend/programAnalysis/CallGraphAnalysis/CallGraph.C b/src/midend/programAnalysis/CallGraphAnalysis/CallGraph.C
index a703a86a141..5c9ae52a19f 100644
--- a/src/midend/programAnalysis/CallGraphAnalysis/CallGraph.C
+++ b/src/midend/programAnalysis/CallGraphAnalysis/CallGraph.C
@@ -11,8 +11,6 @@
 #ifndef _MSC_VER
 #include <err.h>
 #endif
-#include <boost/foreach.hpp>
-#define foreach BOOST_FOREACH
 
 using namespace std;
 using namespace Rose;
@@ -1075,7 +1073,7 @@ CallTargetSet::solveConstructorInitializer(SgConstructorInitializer* sgCtorInit)
                 continue;
             }
             
-            foreach(SgBaseClass* baseClass, currClass->get_inheritances())
+            for(SgBaseClass* baseClass: currClass->get_inheritances())
             {
                 ROSE_ASSERT(baseClass->get_base_class() != NULL);
                 SgMemberFunctionDeclaration* constructorCalled = SageInterface::getDefaultConstructor(baseClass->get_base_class());
@@ -1376,7 +1374,7 @@ void CallTargetSet::getDeclarationsForExpression(SgExpression* exp,
         Rose_STL_Container<SgFunctionDeclaration*> props;
         CallTargetSet::getPropertiesForExpression(exp, classHierarchy, props, includePureVirtualFunc);
 
-        foreach(SgFunctionDeclaration* candidateDecl, props)
+        for(SgFunctionDeclaration* candidateDecl: props)
         {
                 ROSE_ASSERT(candidateDecl);
                 assert(!isSgTemplateFunctionDeclaration(candidateDecl));
@@ -1392,7 +1390,7 @@ CallTargetSet::getDefinitionsForExpression(SgExpression* sgexp,
     Rose_STL_Container<SgFunctionDeclaration*> props;
     CallTargetSet::getPropertiesForExpression(sgexp, classHierarchy, props);
 
-    foreach(SgFunctionDeclaration* candidateDecl, props)
+    for(SgFunctionDeclaration* candidateDecl: props)
     {
         ROSE_ASSERT(candidateDecl);
         assert(!isSgTemplateFunctionDeclaration(candidateDecl));
@@ -1414,11 +1412,11 @@ CallTargetSet::getExpressionsForDefinition(SgFunctionDefinition* targetDef,
                                            Rose_STL_Container<SgExpression*>& exps) {
   VariantVector vv(V_SgFunctionCallExp);
   Rose_STL_Container<SgNode*> callCandidates = NodeQuery::queryMemoryPool(vv);
-  foreach (SgNode* callCandidate, callCandidates) {
+  for (SgNode* callCandidate: callCandidates) {
     SgFunctionCallExp* callexp = isSgFunctionCallExp(callCandidate);
     Rose_STL_Container<SgFunctionDefinition*> candidateDefs;
     CallTargetSet::getDefinitionsForExpression(callexp, classHierarchy, candidateDefs);
-    foreach (SgFunctionDefinition* candidateDef, candidateDefs) {
+    for (SgFunctionDefinition* candidateDef: candidateDefs) {
       if (candidateDef == targetDef) {
         exps.push_back(callexp);
         break;
@@ -1427,11 +1425,11 @@ CallTargetSet::getExpressionsForDefinition(SgFunctionDefinition* targetDef,
   }
   VariantVector vv2(V_SgConstructorInitializer);
   Rose_STL_Container<SgNode*> ctorCandidates = NodeQuery::queryMemoryPool(vv2);
-  foreach (SgNode* ctorCandidate, ctorCandidates) {
+  for (SgNode* ctorCandidate: ctorCandidates) {
     SgConstructorInitializer* ctorInit = isSgConstructorInitializer(ctorCandidate);
     Rose_STL_Container<SgFunctionDefinition*> candidateDefs;
     CallTargetSet::getDefinitionsForExpression(ctorInit, classHierarchy, candidateDefs);
-    foreach (SgFunctionDefinition* candidateDef, candidateDefs) {
+    for (SgFunctionDefinition* candidateDef: candidateDefs) {
       if (candidateDef == targetDef) {
         exps.push_back(ctorInit);
         break;
@@ -1470,13 +1468,13 @@ FunctionData::FunctionData ( SgFunctionDeclaration* inputFunctionDeclaration,
         hasDefinition = true;
 
         Rose_STL_Container<SgNode*> functionCallExpList = NodeQuery::querySubTree(defDecl, V_SgFunctionCallExp);
-        foreach(SgNode* functionCallExp, functionCallExpList)
+        for(SgNode* functionCallExp: functionCallExpList)
         {
             CallTargetSet::getPropertiesForExpression(isSgExpression(functionCallExp), classHierarchy,  functionList);
         }
 
         Rose_STL_Container<SgNode*> ctorInitList = NodeQuery::querySubTree(defDecl, V_SgConstructorInitializer);
-        foreach(SgNode* ctorInit, ctorInitList)
+        for(SgNode* ctorInit: ctorInitList)
         {
             CallTargetSet::getPropertiesForExpression(isSgExpression(ctorInit), classHierarchy, functionList);
         }
diff --git a/src/midend/programAnalysis/CallGraphAnalysis/CallGraph.h b/src/midend/programAnalysis/CallGraphAnalysis/CallGraph.h
index 69f472ee63a..28684ea4e01 100644
--- a/src/midend/programAnalysis/CallGraphAnalysis/CallGraph.h
+++ b/src/midend/programAnalysis/CallGraphAnalysis/CallGraph.h
@@ -13,7 +13,6 @@
 #include <string>
 #include <functional>
 #include <queue>
-#include <boost/foreach.hpp>
 #include <boost/unordered_map.hpp>
 
 class FunctionData;
@@ -211,7 +210,7 @@ CallGraphBuilder::buildCallGraph(Predicate pred)
     VariantVector vv(V_SgFunctionDeclaration);
     GetOneFuncDeclarationPerFunction defFunc;
     std::vector<SgNode*> fdecl_nodes = NodeQuery::queryMemoryPool(defFunc, &vv);
-    BOOST_FOREACH(SgNode *node, fdecl_nodes) {
+    for(SgNode *node: fdecl_nodes) {
         SgFunctionDeclaration *fdecl = isSgFunctionDeclaration(node);
         SgFunctionDeclaration *unique = isSgFunctionDeclaration(fdecl->get_firstNondefiningDeclaration());
 #if 0 //debug
@@ -243,13 +242,13 @@ CallGraphBuilder::buildCallGraph(Predicate pred)
     }
 
     // Add edges to the graph
-    BOOST_FOREACH(FunctionData &currentFunction, callGraphData) {
+    for(FunctionData &currentFunction: callGraphData) {
         SgFunctionDeclaration* curFuncDecl = currentFunction.functionDeclaration;
         std::string curFuncName = curFuncDecl->get_qualified_name().getString();
         SgGraphNode * srcNode = hasGraphNodeFor(currentFunction.functionDeclaration);
         ROSE_ASSERT(srcNode != NULL);
         std::vector<SgFunctionDeclaration*> & callees = currentFunction.functionList;
-        BOOST_FOREACH(SgFunctionDeclaration * callee, callees) {
+        for(SgFunctionDeclaration * callee: callees) {
             if (isSelected(pred)(callee)) {
                 SgGraphNode * dstNode = getGraphNodeFor(callee); //getGraphNode here, see function comment
                 ROSE_ASSERT(dstNode != NULL);
diff --git a/src/midend/programAnalysis/CallGraphAnalysis/ClassHierarchyGraph.C b/src/midend/programAnalysis/CallGraphAnalysis/ClassHierarchyGraph.C
index 27f410e64af..22d1333d9e0 100644
--- a/src/midend/programAnalysis/CallGraphAnalysis/ClassHierarchyGraph.C
+++ b/src/midend/programAnalysis/CallGraphAnalysis/ClassHierarchyGraph.C
@@ -1,13 +1,8 @@
 // tps : Switching from rose.h to sage3 changed size from 17,7 MB to 7,3MB
 #include "sage3basic.h"
-
 #include "CallGraph.h"
-#include <boost/foreach.hpp>
-#include <boost/tuple/tuple.hpp>
 
-#define foreach BOOST_FOREACH
 using namespace std;
-using namespace boost;
 
 ClassHierarchyWrapper::ClassHierarchyWrapper(SgNode *node)
    {
@@ -150,7 +145,7 @@ void findParents(const string& classMangledName,
     ClassHierarchyWrapper::ClassDefSet& currentTransitiveParents = transitiveParents[classMangledName];
 
     //Our transitive parents are simply the union of our parents' transitive parents
-    foreach(SgClassDefinition* parent, currentParents->second)
+    for(SgClassDefinition* parent: currentParents->second)
     {
         std::string parentName = parent->get_declaration()->get_mangled_name();
 
diff --git a/src/midend/programAnalysis/VirtualFunctionAnalysis/InterProcDataFlowAnalysis.C b/src/midend/programAnalysis/VirtualFunctionAnalysis/InterProcDataFlowAnalysis.C
index d3b5f9cf273..e068acd5890 100644
--- a/src/midend/programAnalysis/VirtualFunctionAnalysis/InterProcDataFlowAnalysis.C
+++ b/src/midend/programAnalysis/VirtualFunctionAnalysis/InterProcDataFlowAnalysis.C
@@ -1,8 +1,5 @@
 #include "sage3basic.h"
 #include "InterProcDataFlowAnalysis.h"
-#include <boost/foreach.hpp>
-#define foreach BOOST_FOREACH
-
 
 void InterProcDataFlowAnalysis::run () {
 
@@ -15,7 +12,7 @@ void InterProcDataFlowAnalysis::run () {
 
             getFunctionDeclarations(processingOrder);
            
-            foreach (SgFunctionDeclaration* funcDecl, processingOrder) {
+            for (SgFunctionDeclaration* funcDecl: processingOrder) {
 
                 change |= runAndCheckIntraProcAnalysis(funcDecl);
             
diff --git a/src/midend/programAnalysis/VirtualFunctionAnalysis/IntraProcAliasAnalysis.C b/src/midend/programAnalysis/VirtualFunctionAnalysis/IntraProcAliasAnalysis.C
index a85513ca759..db645b21a82 100644
--- a/src/midend/programAnalysis/VirtualFunctionAnalysis/IntraProcAliasAnalysis.C
+++ b/src/midend/programAnalysis/VirtualFunctionAnalysis/IntraProcAliasAnalysis.C
@@ -11,7 +11,7 @@ void CompactRepresentation::computeAliases (SgGraphNode *node, int derefLevel, v
     } else {
         
         std::set<SgDirectedGraphEdge *> edges = graph->computeEdgeSetOut(node);
-        foreach(SgDirectedGraphEdge *ed, edges) {
+        for(SgDirectedGraphEdge *ed: edges) {
             computeAliases(ed->get_to(), derefLevel-1, sol);
         }
         
@@ -38,10 +38,10 @@ void CompactRepresentation::merge(SgIncidenceDirectedGraph *thatGraph) {
         set<SgGraphNode *> nodes = thatGraph->computeNodeSet();
         SgGraphNode *g_from;
         
-        BOOST_FOREACH(SgGraphNode *node, nodes) {
+        for(SgGraphNode *node: nodes) {
             std::set<SgDirectedGraphEdge *> edges = thatGraph->computeEdgeSetOut(node);
             g_from = getGraphNode(node->get_SgNode());
-            BOOST_FOREACH(SgDirectedGraphEdge *ed, edges) {
+            for(SgDirectedGraphEdge *ed: edges) {
                 addEdge(g_from, getGraphNode(ed->get_to()->get_SgNode()));
             }
         }
@@ -196,7 +196,7 @@ void CompactRepresentation::toDot(const std::string& file_name) {
         
         ofile << "digraph defaultName {\n";
         std::set<SgGraphNode*> explored;
-        foreach(SgGraphNode *node, nodes)
+        for(SgGraphNode *node: nodes)
                 processNodes(ofile, node, explored);
                 
         ofile << "}\n";
@@ -210,11 +210,11 @@ void CompactRepresentation::processNodes(std::ostream & o, SgGraphNode* n, std::
         printNodePlusEdges(o, n);
 
         std::set<SgDirectedGraphEdge*> out_edges = graph->computeEdgeSetOut(n);
-        foreach (SgDirectedGraphEdge* e, out_edges)
+        for (SgDirectedGraphEdge* e: out_edges)
             processNodes(o, e->get_to(), explored);
 
         std::set<SgDirectedGraphEdge*> in_edges = graph->computeEdgeSetIn(n);
-        foreach (SgDirectedGraphEdge* e, in_edges)
+        for (SgDirectedGraphEdge* e: in_edges)
             processNodes(o, e->get_from(), explored);
     }
 
@@ -225,7 +225,7 @@ void CompactRepresentation::printNodePlusEdges(std::ostream & o, SgGraphNode* no
     printNode(o, node);
 
     std::set<SgDirectedGraphEdge*> out_edges = graph->computeEdgeSetOut(node);
-    foreach (SgDirectedGraphEdge* e, out_edges)
+    for (SgDirectedGraphEdge* e: out_edges)
         printEdge(o, e, false);
 
 }
@@ -1195,7 +1195,7 @@ void CollectAliasRelations::run() {
     
     boost::unordered_map<SgGraphNode*, COLOR> colors;
 
-    foreach(SgGraphNode *node, allNodes) {
+    for(SgGraphNode *node: allNodes) {
             colors[node] = WHITE;
     }
     
diff --git a/src/midend/programAnalysis/VirtualFunctionAnalysis/IntraProcAliasAnalysis.h b/src/midend/programAnalysis/VirtualFunctionAnalysis/IntraProcAliasAnalysis.h
index 5e7b75905a0..5c340b17700 100644
--- a/src/midend/programAnalysis/VirtualFunctionAnalysis/IntraProcAliasAnalysis.h
+++ b/src/midend/programAnalysis/VirtualFunctionAnalysis/IntraProcAliasAnalysis.h
@@ -4,16 +4,10 @@
 #include "customFilteredCFG.h"
 #include "ClassHierarchyGraph.h"
 #include "CallGraph.h"
-#include <boost/foreach.hpp>
 #include <boost/shared_ptr.hpp>
 #include <boost/unordered_map.hpp>
 #include <algorithm>
 
-// warning: poor practice and possible name conflicts according to Boost documentation
-#define foreach BOOST_FOREACH
-#define reverse_foreach BOOST_REVERSE_FOREACH
-
-
 using namespace boost;
 using namespace std;
 
diff --git a/src/midend/programAnalysis/VirtualFunctionAnalysis/PtrAliasAnalysis.C b/src/midend/programAnalysis/VirtualFunctionAnalysis/PtrAliasAnalysis.C
index 8ed5c9ad259..80727f8bbb7 100644
--- a/src/midend/programAnalysis/VirtualFunctionAnalysis/PtrAliasAnalysis.C
+++ b/src/midend/programAnalysis/VirtualFunctionAnalysis/PtrAliasAnalysis.C
@@ -2,11 +2,6 @@
 #include <CallGraph.h>
 #include "PtrAliasAnalysis.h"
 
-// warning: poor practice and possible name conflicts according to Boost documentation
-#define foreach BOOST_FOREACH
-#define reverse_foreach BOOST_REVERSE_FOREACH
-
-
 struct FunctionFilter
 {
         bool operator()(SgFunctionDeclaration* funcDecl)
@@ -69,7 +64,7 @@ struct OnlyNonCompilerGenerated : public std::unary_function<bool, SgFunctionDec
         dotgen.writeIncidenceGraphToDOTFile(cgBuilder->getGraph(), "init_call_graph.dot");
 #if 0        
         typedef boost::unordered_map<SgFunctionDeclaration*, SgGraphNode*> res_map;    
-        foreach (res_map::value_type it, cg2.getGraphNodesMapping()) {
+        for (res_map::value_type it: cg2.getGraphNodesMapping()) {
             std::cout << it.first <<" - "<< isSgFunctionDeclaration(it.first->get_definingDeclaration()) << " - " << it.first->get_name().getString() << std::endl;
         }
 #endif        
@@ -77,7 +72,7 @@ struct OnlyNonCompilerGenerated : public std::unary_function<bool, SgFunctionDec
  PtrAliasAnalysis::~PtrAliasAnalysis() {
 
         typedef boost::unordered_map<SgFunctionDeclaration *, IntraProcAliasAnalysis *> map;
-        foreach (map::value_type it, intraAliases) {
+        for (map::value_type it: intraAliases) {
                 delete ((IntraProcAliasAnalysis *)it.second);
         }
 }
@@ -145,7 +140,7 @@ void PtrAliasAnalysis:: SortCallGraphRecursive(SgFunctionDeclaration* targetFunc
         callGraph->getSuccessors(graphNode, callees);
 
         //Recursively process all the callees before adding this function to the list
-        foreach(SgGraphNode* calleeNode, callees)
+        for(SgGraphNode* calleeNode: callees)
         {
             if(colors.at(calleeNode)  == WHITE) {
                 SgFunctionDeclaration* calleeDecl = isSgFunctionDeclaration(calleeNode->get_SgNode());
@@ -181,7 +176,7 @@ void PtrAliasAnalysis::SortCallGraphNodes(SgFunctionDeclaration* targetFunction,
         boost::unordered_map<SgGraphNode*, COLOR> colors;
         typedef boost::unordered_map<SgFunctionDeclaration*, SgGraphNode*> my_map;
         
-        foreach(my_map::value_type item, graphNodeToFunction) {
+        for(my_map::value_type item: graphNodeToFunction) {
             colors[item.second] = WHITE;
         }
         
@@ -209,7 +204,7 @@ void PtrAliasAnalysis::run()  {
         std::set<SgGraphNode *>allNodes =  fullCallGraph.getGraph()->computeNodeSet();
 
         int counter = 0;
-        foreach(SgGraphNode *node, allNodes) {
+        for(SgGraphNode *node: allNodes) {
 #if 0
           printf ("In PtrAliasAnalysis::run(): in loop body: counter = %d \n",counter);
 #endif
diff --git a/src/midend/programAnalysis/VirtualFunctionAnalysis/VirtualFunctionAnalysis.C b/src/midend/programAnalysis/VirtualFunctionAnalysis/VirtualFunctionAnalysis.C
index fabe123fb3b..2c9b845a4c5 100644
--- a/src/midend/programAnalysis/VirtualFunctionAnalysis/VirtualFunctionAnalysis.C
+++ b/src/midend/programAnalysis/VirtualFunctionAnalysis/VirtualFunctionAnalysis.C
@@ -94,7 +94,7 @@ void VirtualFunctionAnalysis::pruneCallGraph(CallGraphBuilder& builder) {
         boost::unordered_map<SgFunctionDeclaration*, SgGraphNode*>node_mapping =  builder.getGraphNodesMapping();
         
         typedef boost::unordered_map<SgFunctionDeclaration *, SgGraphNode *> map;
-        foreach (map::value_type it, node_mapping) {
+        for (map::value_type it: node_mapping) {
             SgFunctionDeclaration *defDecl =
                 (
                     it.first->get_definition() != NULL ?
@@ -105,20 +105,20 @@ void VirtualFunctionAnalysis::pruneCallGraph(CallGraphBuilder& builder) {
             
             Rose_STL_Container<SgNode*> functionCallExpList = NodeQuery::querySubTree(defDecl, V_SgFunctionCallExp);
             std::vector<SgFunctionDeclaration *> functions;
-            foreach(SgNode* functionCallExp, functionCallExpList) {
+            for(SgNode* functionCallExp: functionCallExpList) {
                 functions.insert(functions.end(), resolver.at(isSgExpression(functionCallExp)).begin(), 
                                                 resolver.at(isSgExpression(functionCallExp)).end());
             }
 
             Rose_STL_Container<SgNode*> ctorInitList = NodeQuery::querySubTree(defDecl, V_SgConstructorInitializer);
-            foreach(SgNode* ctorInit, ctorInitList) {
+            for(SgNode* ctorInit: ctorInitList) {
                 functions.insert(functions.end(), resolver.at(isSgExpression(ctorInit)).begin(), 
                                                 resolver.at(isSgExpression(ctorInit)).end());
             }
             
             std::set<SgDirectedGraphEdge *>edges = graph->computeEdgeSetOut(it.second);
 
-            foreach(SgDirectedGraphEdge *edge, edges) {
+            for(SgDirectedGraphEdge *edge: edges) {
                 SgGraphNode *toNode = edge->get_to();
                 SgFunctionDeclaration *toDecl = isSgFunctionDeclaration(toNode->get_SgNode());
                 ROSE_ASSERT(toDecl != NULL);
diff --git a/src/midend/programAnalysis/variableRenaming/VariableRenaming.C b/src/midend/programAnalysis/variableRenaming/VariableRenaming.C
index 7b3377581ce..6db4fa56eb7 100644
--- a/src/midend/programAnalysis/variableRenaming/VariableRenaming.C
+++ b/src/midend/programAnalysis/variableRenaming/VariableRenaming.C
@@ -11,13 +11,8 @@
 #include <queue>
 #include <fstream>
 #include <stack>
-#include <boost/foreach.hpp>
 #include <boost/unordered_set.hpp>
 
-// warning: poor practice and possible name conflicts according to Boost documentation
-#define foreach BOOST_FOREACH
-#define reverse_foreach BOOST_REVERSE_FOREACH
-
 using namespace std;
 using namespace Rose;
 
@@ -34,7 +29,7 @@ std::string VariableRenaming::keyToString(const VarName& vec)
 {
     std::string name = "";
 
-    foreach(const VarName::value_type& iter, vec)
+    for(const VarName::value_type& iter: vec)
     {
         if (iter != vec.front())
         {
@@ -50,11 +45,11 @@ void VariableRenaming::printDefs(SgNode* node)
 {
     std::cout << "Def Table for [" << node->class_name() << ":" << node << "]:" << std::endl;
 
-    foreach(TableEntry::value_type& entry, defTable[node])
+    for(TableEntry::value_type& entry: defTable[node])
     {
         std::cout << "  Defs for [" << keyToString(entry.first) << "]:" << std::endl;
 
-        foreach(NodeVec::value_type& iter, entry.second)
+        for(NodeVec::value_type& iter: entry.second)
         {
             std::cout << "    -[" << iter->class_name() << ":" << iter << "]" << std::endl;
         }
@@ -65,11 +60,11 @@ void VariableRenaming::printDefs(const std::map< std::vector<SgInitializedName*>
 {
     std::cout << "Def Table:" << std::endl;
 
-    foreach(const TableEntry::value_type& entry, table)
+    for(const TableEntry::value_type& entry: table)
     {
         std::cout << "  Defs for [" << keyToString(entry.first) << "]:" << std::endl;
 
-        foreach(const NodeVec::value_type& iter, entry.second)
+        for(const NodeVec::value_type& iter: entry.second)
         {
             std::cout << "    -[" << iter->class_name() << ":" << iter << "]" << std::endl;
         }
@@ -80,11 +75,11 @@ void VariableRenaming::printOriginalDefs(SgNode* node)
 {
     std::cout << "Original Def Table for [" << node->class_name() << ":" << node << "]:" << std::endl;
 
-    foreach(TableEntry::value_type& entry, originalDefTable[node])
+    for(TableEntry::value_type& entry: originalDefTable[node])
     {
         std::cout << "  Defs for [" << keyToString(entry.first) << "]:" << std::endl;
 
-        foreach(NodeVec::value_type& iter, entry.second)
+        for(NodeVec::value_type& iter: entry.second)
         {
             std::cout << "    -[" << iter->class_name() << ":" << iter << "]" << std::endl;
         }
@@ -95,15 +90,15 @@ void VariableRenaming::printOriginalDefTable()
 {
     std::cout << "Original Def Table:" << endl;
 
-    foreach(DefUseTable::value_type& node, originalDefTable)
+    for(DefUseTable::value_type& node: originalDefTable)
     {
         std::cout << "  Original Def Table for [" << node.first->class_name() << ":" << node.first << "]:" << std::endl;
 
-        foreach(TableEntry::value_type& entry, originalDefTable[node.first])
+        for(TableEntry::value_type& entry: originalDefTable[node.first])
         {
             std::cout << "    Defs for [" << keyToString(entry.first) << "]:" << std::endl;
 
-            foreach(NodeVec::value_type& iter, entry.second)
+            for(NodeVec::value_type& iter: entry.second)
             {
                 std::cout << "      -[" << iter->class_name() << ":" << iter << "]" << std::endl;
             }
@@ -115,11 +110,11 @@ void VariableRenaming::printUses(SgNode* node)
 {
     std::cout << "Use Table for [" << node->class_name() << ":" << node << "]:" << std::endl;
 
-    foreach(TableEntry::value_type& entry, useTable[node])
+    for(TableEntry::value_type& entry: useTable[node])
     {
         std::cout << "  Uses for [" << keyToString(entry.first) << "]:" << std::endl;
 
-        foreach(NodeVec::value_type& iter, entry.second)
+        for(NodeVec::value_type& iter: entry.second)
         {
             std::cout << "    -[" << iter->class_name() << ":" << iter << "]" << std::endl;
         }
@@ -130,11 +125,11 @@ void VariableRenaming::printUses(const std::map< std::vector<SgInitializedName*>
 {
     std::cout << "Use Table:" << std::endl;
 
-    foreach(const TableEntry::value_type& entry, table)
+    for(const TableEntry::value_type& entry: table)
     {
         std::cout << "  Uses for [" << keyToString(entry.first) << "]:" << std::endl;
 
-        foreach(const NodeVec::value_type& iter, entry.second)
+        for(const NodeVec::value_type& iter: entry.second)
         {
             std::cout << "    -[" << iter->class_name() << ":" << iter << "]" << std::endl;
         }
@@ -159,7 +154,7 @@ void VariableRenaming::printRenameTable(const NodeNumRenameTable& table)
 
     //Iterate the table
 
-    foreach(const NodeNumRenameTable::value_type& entry, table)
+    for(const NodeNumRenameTable::value_type& entry: table)
     {
         cout << "  Names for [" << keyToString(entry.first) << "]:" << endl;
 
@@ -174,7 +169,7 @@ void VariableRenaming::printRenameTable(const NumNodeRenameTable& table)
 
     //Iterate the table
 
-    foreach(const NumNodeRenameTable::value_type& entry, table)
+    for(const NumNodeRenameTable::value_type& entry: table)
     {
         std::cout << "  Names for [" << keyToString(entry.first) << "]:" << std::endl;
 
@@ -190,7 +185,7 @@ void VariableRenaming::printRenameEntry(const NodeNumRenameEntry& entry)
 
     //Iterate the entry
 
-    foreach(const NodeNumRenameEntry::value_type& iter, entry)
+    for(const NodeNumRenameEntry::value_type& iter: entry)
     {
         if (start == 0 && end == 0)
         {
@@ -215,7 +210,7 @@ void VariableRenaming::printRenameEntry(const NodeNumRenameEntry& entry)
         SgNode* current = NULL;
         //Find the entry for start if it exists
 
-        foreach(const NodeNumRenameEntry::value_type& iter, entry)
+        for(const NodeNumRenameEntry::value_type& iter: entry)
         {
             if (iter.second == start)
             {
@@ -237,7 +232,7 @@ void VariableRenaming::printRenameEntry(const NumNodeRenameEntry& entry)
 {
     //Iterate the entry
 
-    foreach(const NumNodeRenameEntry::value_type& iter, entry)
+    for(const NumNodeRenameEntry::value_type& iter: entry)
     {
         cout << "      " << iter.first << ": " << iter.second << endl;
     }
@@ -402,7 +397,7 @@ void VariableRenaming::insertDefsForExternalVariables(SgFunctionDeclaration* fun
 
     //Iterate over each used variable and check it it is declared outside of the function scope
 
-    foreach(const VarName& usedVar, usedNames)
+    for(const VarName& usedVar: usedNames)
     {
         VarName rootName;
         rootName.assign(1, usedVar[0]);
@@ -476,7 +471,7 @@ set<VariableRenaming::VarName> VariableRenaming::getVarsUsedInSubtree(SgNode* ro
             if (defEntry != ssa->useTable.end())
             {
 
-                foreach(TableEntry::value_type& varDefsPair, ssa->useTable[node])
+                for(TableEntry::value_type& varDefsPair: ssa->useTable[node])
                 {
                     usedNames.insert(varDefsPair.first);
                 }
@@ -486,7 +481,7 @@ set<VariableRenaming::VarName> VariableRenaming::getVarsUsedInSubtree(SgNode* ro
             if (defEntry != ssa->originalDefTable.end())
             {
 
-                foreach(TableEntry::value_type& varDefsPair, ssa->originalDefTable[node])
+                for(TableEntry::value_type& varDefsPair: ssa->originalDefTable[node])
                 {
                     usedNames.insert(varDefsPair.first);
                 }
@@ -509,7 +504,7 @@ void VariableRenaming::toDOT(const std::string fileName)
 
     //print all the functions in each file
 
-    foreach(fileVec::value_type& file, files)
+    for(fileVec::value_type& file: files)
     {
         ofstream outFile((StringUtility::stripPathFromFileName(file->getFileName())
                 + "_" + fileName).c_str());
@@ -536,7 +531,7 @@ void VariableRenaming::toFilteredDOT(const std::string fileName)
 
     //print all the functions in each file
 
-    foreach(fileVec::value_type& file, files)
+    for(fileVec::value_type& file: files)
     {
         ofstream outFile((StringUtility::stripPathFromFileName(file->getFileName())
                 + "_filtered_" + fileName).c_str());
@@ -574,7 +569,7 @@ void VariableRenaming::printToDOT(SgSourceFile* source, std::ofstream &outFile)
 
     //Iterate all the functions and print them in the same file.
 
-    foreach(funcDefVec::value_type& func, funcs)
+    for(funcDefVec::value_type& func: funcs)
     {
         vector<cfgNode> visited;
         stack<cfgNode> traverse;
@@ -616,11 +611,11 @@ void VariableRenaming::printToDOT(SgSourceFile* source, std::ofstream &outFile)
                 //Print the defs to a string
                 std::stringstream defUse;
 
-                foreach(TableEntry::value_type& entry, defTable[current.getNode()])
+                for(TableEntry::value_type& entry: defTable[current.getNode()])
                 {
                     defUse << "Def [" << keyToString(entry.first) << "]: ";
 
-                    foreach(NodeVec::value_type& val, entry.second)
+                    for(NodeVec::value_type& val: entry.second)
                     {
                         defUse << getRenameNumberForNode(entry.first, val) << ": " << val << ", ";
                     }
@@ -628,11 +623,11 @@ void VariableRenaming::printToDOT(SgSourceFile* source, std::ofstream &outFile)
                 }
                 //Print the uses to a string
 
-                foreach(TableEntry::value_type& entry, useTable[current.getNode()])
+                for(TableEntry::value_type& entry: useTable[current.getNode()])
                 {
                     defUse << "Use [" << keyToString(entry.first) << "]: ";
 
-                    foreach(NodeVec::value_type& val, entry.second)
+                    for(NodeVec::value_type& val: entry.second)
                     {
                         defUse << getRenameNumberForNode(entry.first, val) << ": " << val << ", ";
                     }
@@ -654,7 +649,7 @@ void VariableRenaming::printToDOT(SgSourceFile* source, std::ofstream &outFile)
                 //Now print the out edges
                 std::vector<cfgEdge> outEdges = current.outEdges();
 
-                foreach(std::vector<cfgEdge>::value_type& edge, outEdges)
+                for(std::vector<cfgEdge>::value_type& edge: outEdges)
                 {
                     outFile << edge.source().id() << " -> " << edge.target().id()
                             << " [label=\"" << escapeString(edge.toString())
@@ -666,7 +661,7 @@ void VariableRenaming::printToDOT(SgSourceFile* source, std::ofstream &outFile)
 
             std::vector<cfgEdge> outEdges = current.outEdges();
 
-            foreach(std::vector<cfgEdge>::value_type& edge, outEdges)
+            for(std::vector<cfgEdge>::value_type& edge: outEdges)
             {
                 //If we haven't seen the target of this node yet, process the node
                 if (std::count(visited.begin(), visited.end(), edge.target()) == 0)
@@ -681,7 +676,7 @@ void VariableRenaming::printToDOT(SgSourceFile* source, std::ofstream &outFile)
             {
                 std::vector<cfgEdge> inEdges = current.inEdges();
 
-                foreach(std::vector<cfgEdge>::value_type& edge, inEdges)
+                for(std::vector<cfgEdge>::value_type& edge: inEdges)
                 {
                     //If we haven't seen the target of this node yet, process the node
                     if (std::count(visited.begin(), visited.end(), edge.target()) == 0)
@@ -724,7 +719,7 @@ void VariableRenaming::printToFilteredDOT(SgSourceFile* source, std::ofstream& o
 
     //Iterate all the functions and print them in the same file.
 
-    foreach(funcDefVec::value_type& func, funcs)
+    for(funcDefVec::value_type& func: funcs)
     {
         vector<cfgNode> visited;
         stack<cfgNode> traverse;
@@ -766,11 +761,11 @@ void VariableRenaming::printToFilteredDOT(SgSourceFile* source, std::ofstream& o
                 //Print the defs to a string
                 std::stringstream defUse;
 
-                foreach(TableEntry::value_type& entry, defTable[current.getNode()])
+                for(TableEntry::value_type& entry: defTable[current.getNode()])
                 {
                     defUse << "Def [" << keyToString(entry.first) << "]: ";
 
-                    foreach(NodeVec::value_type& val, entry.second)
+                    for(NodeVec::value_type& val: entry.second)
                     {
                         defUse << getRenameNumberForNode(entry.first, val) << ": " << val << ", ";
                     }
@@ -778,11 +773,11 @@ void VariableRenaming::printToFilteredDOT(SgSourceFile* source, std::ofstream& o
                 }
                 //Print the uses to a string
 
-                foreach(TableEntry::value_type& entry, useTable[current.getNode()])
+                for(TableEntry::value_type& entry: useTable[current.getNode()])
                 {
                     defUse << "Use [" << keyToString(entry.first) << "]: ";
 
-                    foreach(NodeVec::value_type& val, entry.second)
+                    for(NodeVec::value_type& val: entry.second)
                     {
                         defUse << getRenameNumberForNode(entry.first, val) << ": " << val << ", ";
                     }
@@ -804,7 +799,7 @@ void VariableRenaming::printToFilteredDOT(SgSourceFile* source, std::ofstream& o
                 //Now print the out edges
                 std::vector<cfgEdge> outEdges = current.outEdges();
 
-                foreach(std::vector<cfgEdge>::value_type& edge, outEdges)
+                for(std::vector<cfgEdge>::value_type& edge: outEdges)
                 {
                     outFile << edge.source().id() << " -> " << edge.target().id()
                             << " [label=\"" << escapeString(edge.toString())
@@ -816,7 +811,7 @@ void VariableRenaming::printToFilteredDOT(SgSourceFile* source, std::ofstream& o
 
             std::vector<cfgEdge> outEdges = current.outEdges();
 
-            foreach(std::vector<cfgEdge>::value_type& edge, outEdges)
+            for(std::vector<cfgEdge>::value_type& edge: outEdges)
             {
                 //If we haven't seen the target of this node yet, process the node
                 if (std::count(visited.begin(), visited.end(), edge.target()) == 0)
@@ -831,7 +826,7 @@ void VariableRenaming::printToFilteredDOT(SgSourceFile* source, std::ofstream& o
             {
                 std::vector<cfgEdge> inEdges = current.inEdges();
 
-                foreach(std::vector<cfgEdge>::value_type& edge, inEdges)
+                for(std::vector<cfgEdge>::value_type& edge: inEdges)
                 {
                     //If we haven't seen the target of this node yet, process the node
                     if (std::count(visited.begin(), visited.end(), edge.target()) == 0)
@@ -860,7 +855,7 @@ SgInitializedName* VariableRenaming::UniqueNameTraversal::resolveTemporaryInitNa
     if (isSgVarRefExp(name->get_parent()))
     {
 
-        foreach(SgInitializedName* otherName, allInitNames)
+        for(SgInitializedName* otherName: allInitNames)
         {
             if (otherName->get_prev_decl_item() == name)
                 return otherName;
@@ -1196,7 +1191,7 @@ void VariableRenaming::runDefUse(SgFunctionDefinition* func)
 
             //Insert each changed node into the list
 
-            foreach(SgNode* chNode, changedNodes)
+            for(SgNode* chNode: changedNodes)
             {
                 //Get the cfg node for this AST node
                 cfgNode nextNode;
@@ -1226,8 +1221,10 @@ void VariableRenaming::runDefUse(SgFunctionDefinition* func)
 
         //For every edge, add it to the worklist if it is not seen or something has changed
 
-        reverse_foreach(cfgEdgeVec::value_type& edge, outEdges)
+        //reverse_foreach(cfgEdgeVec::value_type& edge, outEdges)
+        for (auto it = outEdges.rbegin(); it != outEdges.rend(); ++it)
         {
+        	cfgEdgeVec::value_type& edge = *it;
             cfgNode nextNode = edge.target();
 
             //Only insert the node in the worklist if it isn't there already.
@@ -1338,7 +1335,7 @@ bool VariableRenaming::mergeDefs(cfgNode curNode, bool *memberRefInserted, NodeV
     if (!isSgFunctionDefinition(node) && (!isSgInitializedName(node) || isSgCtorInitializerList(node->get_parent())))
     {
 
-        foreach(TableEntry::value_type& entry, originalDefTable[node])
+        for(TableEntry::value_type& entry: originalDefTable[node])
         {
             if (propDefs.find(entry.first) == propDefs.end())
             {
@@ -1352,7 +1349,7 @@ bool VariableRenaming::mergeDefs(cfgNode curNode, bool *memberRefInserted, NodeV
     //Replace every entry in staging table that has definition in original defs
     //Also assign renaming numbers to any new definitions
 
-    foreach(TableEntry::value_type& entry, originalDefTable[node])
+    for(TableEntry::value_type& entry: originalDefTable[node])
     {
         //Replace the entry for this variable with the definitions at this node.
         propDefs[entry.first] = entry.second;
@@ -1360,7 +1357,7 @@ bool VariableRenaming::mergeDefs(cfgNode curNode, bool *memberRefInserted, NodeV
         //Now, iterate the definition vector for this node
         ROSE_ASSERT(entry.second.size() == 1);
 
-        foreach(NodeVec::value_type& defNode, entry.second)
+        for(NodeVec::value_type& defNode: entry.second)
         {
             //Assign a number to each new definition. The function will prevent duplicates
             addRenameNumberForNode(entry.first, defNode);
@@ -1371,10 +1368,10 @@ bool VariableRenaming::mergeDefs(cfgNode curNode, bool *memberRefInserted, NodeV
     //that have an originalDef as a prefix
     VarName expVar;
 
-    foreach(TableEntry::value_type& entry, originalDefTable[node])
+    for(TableEntry::value_type& entry: originalDefTable[node])
     {
 
-        foreach(TableEntry::value_type& propEntry, propDefs)
+        for(TableEntry::value_type& propEntry: propDefs)
         {
             //Don't insert a def if it is already originally defined.
             if (originalDefTable[node].count(propEntry.first) != 0)
@@ -1399,13 +1396,13 @@ bool VariableRenaming::mergeDefs(cfgNode curNode, bool *memberRefInserted, NodeV
     //Replace every entry in staging table that has definition in expandedDefs
     //Also assign renaming numbers to any new definitions
 
-    foreach(TableEntry::value_type& entry, expandedDefTable[node])
+    for(TableEntry::value_type& entry: expandedDefTable[node])
     {
         propDefs[entry.first] = entry.second;
 
         //Now, iterate the definition vector for this node
 
-        foreach(NodeVec::value_type& defNode, entry.second)
+        for(NodeVec::value_type& defNode: entry.second)
         {
             //Assign a number to each new definition. The function will prevent duplicates
             addRenameNumberForNode(entry.first, defNode);
@@ -1414,7 +1411,7 @@ bool VariableRenaming::mergeDefs(cfgNode curNode, bool *memberRefInserted, NodeV
 
     //If there is an initial definition of a name at this node, we should insert it in the table
 
-    foreach(TableEntry::value_type& entry, originalDefTable[node])
+    for(TableEntry::value_type& entry: originalDefTable[node])
     {
         //If the given variable name is not present in the first def table
         if (firstDefList.count(entry.first) == 0)
@@ -1492,7 +1489,7 @@ void VariableRenaming::aggregatePreviousDefs(cfgNode curNode, TableEntry& result
 
             //Perform the union of all the infoming definitions.
 
-            foreach(TableEntry::value_type& entry, defTable[prev])
+            for(TableEntry::value_type& entry: defTable[prev])
             {
                 //Insert the definitions for this node at the end of the list
                 results[entry.first].insert(results[entry.first].end(), entry.second.begin(), entry.second.end());
@@ -1502,7 +1499,7 @@ void VariableRenaming::aggregatePreviousDefs(cfgNode curNode, TableEntry& result
 
     //Sort every vector in propDefs and remove duplicates
 
-    foreach(TableEntry::value_type& entry, results)
+    for(TableEntry::value_type& entry: results)
     {
         std::sort(entry.second.begin(), entry.second.end());
         //Create new sequence of unique elements and remove duplicate ones
@@ -1534,7 +1531,7 @@ bool VariableRenaming::expandMemberDefinitions(cfgNode curNode)
 
     //We want to iterate the vars defined on this node, and expand them
 
-    foreach(TableEntry::value_type& entry, originalDefTable[node])
+    for(TableEntry::value_type& entry: originalDefTable[node])
     {
         if (DEBUG_MODE_EXTRA)
         {
@@ -1602,7 +1599,7 @@ bool VariableRenaming::resolveUses(FilteredCFGNode<IsDefUseFilter> curNode, bool
 
     //Iterate every use at the current node
 
-    foreach(TableEntry::value_type& entry, useTable[node])
+    for(TableEntry::value_type& entry: useTable[node])
     {
         //Check the defs that are active at the current node to find the reaching definition
         //We want to check if there is a definition entry for this use at the current node
@@ -1636,7 +1633,7 @@ bool VariableRenaming::resolveUses(FilteredCFGNode<IsDefUseFilter> curNode, bool
 
     //Iterate every use at the current node
 
-    foreach(TableEntry::value_type& entry, useTable[node])
+    for(TableEntry::value_type& entry: useTable[node])
     {
         //If any of these uses are for a variable defined at this node, we will
         //set the flag and correct it later.
@@ -1667,7 +1664,7 @@ bool VariableRenaming::expandMemberUses(cfgNode curNode)
 
     //We want to iterate the vars used on this node, and expand them
 
-    foreach(TableEntry::value_type& entry, useTable[node])
+    for(TableEntry::value_type& entry: useTable[node])
     {
         if (DEBUG_MODE_EXTRA)
         {
@@ -1955,7 +1952,7 @@ VariableRenaming::NodeVec VariableRenaming::getAllUsesForDef(const VarName& var,
 
     //Traverse the use Table looking for locations where the def is used
 
-    foreach(DefUseTable::value_type& entry, useTable)
+    for(DefUseTable::value_type& entry: useTable)
     {
         //If this entry contains the variable that we want
         if (entry.second.count(var) != 0)
@@ -1980,11 +1977,11 @@ VariableRenaming::NumNodeRenameTable VariableRenaming::getReachingDefsAtNode(SgN
 
     //Iterate every variable definition reaching this node
 
-    foreach(TableEntry::value_type& entry, defTable[node])
+    for(TableEntry::value_type& entry: defTable[node])
     {
         //Iterate every definition site for this variable
 
-        foreach(NodeVec::value_type& defEntry, entry.second)
+        for(NodeVec::value_type& defEntry: entry.second)
         {
             //Get the rename number for the current variable at the current def site
             int renameNum = getRenameNumberForNode(entry.first, defEntry);
@@ -2023,7 +2020,7 @@ VariableRenaming::NumNodeRenameEntry VariableRenaming::getReachingDefsAtNodeForN
 
     //Iterate every variable definition reaching this node
 
-    foreach(TableEntry::value_type& entry, defTable[node])
+    for(TableEntry::value_type& entry: defTable[node])
     {
         //Check that the current var is the one we want.
         if (entry.first != var)
@@ -2033,7 +2030,7 @@ VariableRenaming::NumNodeRenameEntry VariableRenaming::getReachingDefsAtNodeForN
 
         //Iterate every definition site for this variable
 
-        foreach(NodeVec::value_type& defEntry, entry.second)
+        for(NodeVec::value_type& defEntry: entry.second)
         {
             //Get the rename number for the current variable at the current def site
             int renameNum = getRenameNumberForNode(entry.first, defEntry);
@@ -2072,11 +2069,11 @@ VariableRenaming::NumNodeRenameTable VariableRenaming::getUsesAtNode(SgNode* nod
 
     //Iterate every variable definition used at this node
 
-    foreach(TableEntry::value_type& entry, useTable[node])
+    for(TableEntry::value_type& entry: useTable[node])
     {
         //Iterate every definition site for this variable
 
-        foreach(NodeVec::value_type& defEntry, entry.second)
+        for(NodeVec::value_type& defEntry: entry.second)
         {
             //Get the rename number for the current variable at the current def site
             int renameNum = getRenameNumberForNode(entry.first, defEntry);
@@ -2128,7 +2125,7 @@ VariableRenaming::NumNodeRenameEntry VariableRenaming::getUsesAtNodeForName(SgNo
 
     //Iterate every variable use at this node
 
-    foreach(TableEntry::value_type& entry, useTable[node])
+    for(TableEntry::value_type& entry: useTable[node])
     {
         //Check that the current var is the one we want.
         if (entry.first != var)
@@ -2138,7 +2135,7 @@ VariableRenaming::NumNodeRenameEntry VariableRenaming::getUsesAtNodeForName(SgNo
 
         //Iterate every definition site for this variable
 
-        foreach(NodeVec::value_type& defEntry, entry.second)
+        for(NodeVec::value_type& defEntry: entry.second)
         {
             //Get the rename number for the current variable at the current def site
             int renameNum = getRenameNumberForNode(entry.first, defEntry);
@@ -2217,7 +2214,7 @@ VariableRenaming::NumNodeRenameTable VariableRenaming::getOriginalUsesAtNode(SgN
 
     VariableRenaming::NumNodeRenameTable result;
 
-    foreach(VariableRenaming::VarName varName, originalVariableUsesTraversal.originalVariablesUsed)
+    for(VariableRenaming::VarName varName: originalVariableUsesTraversal.originalVariablesUsed)
     {
         ROSE_ASSERT(result.count(varName) == 0);
         VariableRenaming::NumNodeRenameEntry varDefs = getUsesAtNodeForName(node, varName);
@@ -2234,7 +2231,7 @@ VariableRenaming::NumNodeRenameTable VariableRenaming::getDefsAtNode(SgNode* nod
 
     //Loop the expanded table and insert it into the original table
 
-    foreach(NumNodeRenameTable::value_type& entry, expanded)
+    for(NumNodeRenameTable::value_type& entry: expanded)
     {
         //Insert the entry wholesale
         if (original.count(entry.first) == 0)
@@ -2245,7 +2242,7 @@ VariableRenaming::NumNodeRenameTable VariableRenaming::getDefsAtNode(SgNode* nod
         else
         {
 
-            foreach(NumNodeRenameEntry::value_type& tableEntry, entry.second)
+            for(NumNodeRenameEntry::value_type& tableEntry: entry.second)
             {
                 //Insert the entry wholesale
                 if (original[entry.first].count(tableEntry.first) == 0)
@@ -2276,7 +2273,7 @@ VariableRenaming::NumNodeRenameEntry VariableRenaming::getDefsAtNodeForName(SgNo
 
     //Loop the expanded table and insert it into the original table
 
-    foreach(NumNodeRenameEntry::value_type& tableEntry, expanded)
+    for(NumNodeRenameEntry::value_type& tableEntry: expanded)
     {
         //Insert the entry wholesale
         if (original.count(tableEntry.first) == 0)
@@ -2301,11 +2298,11 @@ VariableRenaming::NumNodeRenameTable VariableRenaming::getOriginalDefsAtNode(SgN
 
     //Iterate every variable definition reaching this node
 
-    foreach(TableEntry::value_type& entry, originalDefTable[node])
+    for(TableEntry::value_type& entry: originalDefTable[node])
     {
         //Iterate every definition site for this variable
 
-        foreach(NodeVec::value_type& defEntry, entry.second)
+        for(NodeVec::value_type& defEntry: entry.second)
         {
             //Get the rename number for the current variable at the current def site
             int renameNum = getRenameNumberForNode(entry.first, defEntry);
@@ -2357,7 +2354,7 @@ VariableRenaming::NumNodeRenameEntry VariableRenaming::getOriginalDefsAtNodeForN
 
     //Iterate every variable use at this node
 
-    foreach(TableEntry::value_type& entry, originalDefTable[node])
+    for(TableEntry::value_type& entry: originalDefTable[node])
     {
         //Check that the current var is the one we want.
         if (entry.first != var)
@@ -2367,7 +2364,7 @@ VariableRenaming::NumNodeRenameEntry VariableRenaming::getOriginalDefsAtNodeForN
 
         //Iterate every definition site for this variable
 
-        foreach(NodeVec::value_type& defEntry, entry.second)
+        for(NodeVec::value_type& defEntry: entry.second)
         {
             //Get the rename number for the current variable at the current def site
             int renameNum = getRenameNumberForNode(entry.first, defEntry);
@@ -2419,11 +2416,11 @@ VariableRenaming::NumNodeRenameTable VariableRenaming::getExpandedDefsAtNode(SgN
 
     //Iterate every variable definition expanded on this node
 
-    foreach(TableEntry::value_type& entry, expandedDefTable[node])
+    for(TableEntry::value_type& entry: expandedDefTable[node])
     {
         //Iterate every definition site for this variable
 
-        foreach(NodeVec::value_type& defEntry, entry.second)
+        for(NodeVec::value_type& defEntry: entry.second)
         {
             //Get the rename number for the current variable at the current def site
             int renameNum = getRenameNumberForNode(entry.first, defEntry);
@@ -2462,7 +2459,7 @@ VariableRenaming::NumNodeRenameEntry VariableRenaming::getExpandedDefsAtNodeForN
 
     //Iterate every variable use at this node
 
-    foreach(TableEntry::value_type& entry, expandedDefTable[node])
+    for(TableEntry::value_type& entry: expandedDefTable[node])
     {
         //Check that the current var is the one we want.
         if (entry.first != var)
@@ -2472,7 +2469,7 @@ VariableRenaming::NumNodeRenameEntry VariableRenaming::getExpandedDefsAtNodeForN
 
         //Iterate every definition site for this variable
 
-        foreach(NodeVec::value_type& defEntry, entry.second)
+        for(NodeVec::value_type& defEntry: entry.second)
         {
             //Get the rename number for the current variable at the current def site
             int renameNum = getRenameNumberForNode(entry.first, defEntry);
@@ -2519,7 +2516,7 @@ VariableRenaming::NumNodeRenameTable VariableRenaming::getDefsForSubtree(SgNode*
 
             //Traverse the defs
 
-            foreach(VariableRenaming::NumNodeRenameTable::value_type& entry, defsAtNode)
+            for(VariableRenaming::NumNodeRenameTable::value_type& entry: defsAtNode)
             {
                 //If this is the first time the var has been seen, add it wholesale
                 if (result.count(entry.first) == 0)
@@ -2529,7 +2526,7 @@ VariableRenaming::NumNodeRenameTable VariableRenaming::getDefsForSubtree(SgNode*
                 }
                 //Traverse each definition of the variable
 
-                foreach(VariableRenaming::NumNodeRenameEntry::value_type& tableEntry, entry.second)
+                for(VariableRenaming::NumNodeRenameEntry::value_type& tableEntry: entry.second)
                 {
                     if (result[entry.first].count(tableEntry.first) == 0)
                     {
@@ -2568,7 +2565,7 @@ VariableRenaming::NumNodeRenameTable VariableRenaming::getOriginalDefsForSubtree
 
             //Traverse the defs
 
-            foreach(VariableRenaming::NumNodeRenameTable::value_type& entry, defsAtNode)
+            for(VariableRenaming::NumNodeRenameTable::value_type& entry: defsAtNode)
             {
                 //If this is the first time the var has been seen, add it wholesale
                 if (result.count(entry.first) == 0)
@@ -2578,7 +2575,7 @@ VariableRenaming::NumNodeRenameTable VariableRenaming::getOriginalDefsForSubtree
                 }
                 //Traverse each definition of the variable
 
-                foreach(VariableRenaming::NumNodeRenameEntry::value_type& tableEntry, entry.second)
+                for(VariableRenaming::NumNodeRenameEntry::value_type& tableEntry: entry.second)
                 {
                     if (result[entry.first].count(tableEntry.first) == 0)
                     {
@@ -2631,7 +2628,7 @@ VariableRenaming::NumNodeRenameTable VariableRenaming::getReachingDefsAtScopeEnd
         //Find if any of the children exit the basic block.
         cfgEdgeVec outEdges = current.outEdges();
 
-        foreach(cfgEdge edge, outEdges)
+        for(cfgEdge edge: outEdges)
         {
             SgNode* targetNode = edge.target().getNode();
 
@@ -2648,7 +2645,7 @@ VariableRenaming::NumNodeRenameTable VariableRenaming::getReachingDefsAtScopeEnd
 
                 //Merge the tables
 
-                foreach(NumNodeRenameTable::value_type& entry, temp)
+                for(NumNodeRenameTable::value_type& entry: temp)
                 {
                     //Insert the entry wholesale
                     if (result.count(entry.first) == 0)
@@ -2659,7 +2656,7 @@ VariableRenaming::NumNodeRenameTable VariableRenaming::getReachingDefsAtScopeEnd
                     else
                     {
 
-                        foreach(NumNodeRenameEntry::value_type& tableEntry, entry.second)
+                        for(NumNodeRenameEntry::value_type& tableEntry: entry.second)
                         {
                             //Insert the entry wholesale
                             if (result[entry.first].count(tableEntry.first) == 0)
@@ -2710,13 +2707,13 @@ VariableRenaming::NumNodeRenameTable VariableRenaming::getReachingDefsAtFunction
     {
         //Iterate and merge each edge
 
-        foreach(cfgEdgeVec::value_type& edge, lastEdges)
+        for(cfgEdgeVec::value_type& edge: lastEdges)
         {
             NumNodeRenameTable temp = getReachingDefsAtNode(edge.source().getNode());
 
             //Merge the tables
 
-            foreach(NumNodeRenameTable::value_type& entry, temp)
+            for(NumNodeRenameTable::value_type& entry: temp)
             {
                 //Insert the entry wholesale
                 if (result.count(entry.first) == 0)
@@ -2727,7 +2724,7 @@ VariableRenaming::NumNodeRenameTable VariableRenaming::getReachingDefsAtFunction
                 else
                 {
 
-                    foreach(NumNodeRenameEntry::value_type& tableEntry, entry.second)
+                    for(NumNodeRenameEntry::value_type& tableEntry: entry.second)
                     {
                         //Insert the entry wholesale
                         if (result[entry.first].count(tableEntry.first) == 0)
@@ -2779,11 +2776,11 @@ VariableRenaming::NumNodeRenameEntry VariableRenaming::getReachingDefsAtFunction
     {
         //Iterate and merge each edge
 
-        foreach(cfgEdgeVec::value_type& edge, lastEdges)
+        for(cfgEdgeVec::value_type& edge: lastEdges)
         {
             NumNodeRenameEntry temp = getReachingDefsAtNodeForName(edge.source().getNode(), var);
 
-            foreach(NumNodeRenameEntry::value_type& tableEntry, temp)
+            for(NumNodeRenameEntry::value_type& tableEntry: temp)
             {
                 //Insert the entry wholesale
                 if (result.count(tableEntry.first) == 0)
@@ -2828,7 +2825,7 @@ VariableRenaming::NumNodeRenameTable VariableRenaming::getReachingDefsAtStatemen
 
     //Add all the unfiltered inEdges to the initial worklist
 
-    foreach(CFGEdge inEdge, inEdges)
+    for(CFGEdge inEdge: inEdges)
     {
         unfilteredNodes.push(inEdge.source());
     }
@@ -2849,7 +2846,7 @@ VariableRenaming::NumNodeRenameTable VariableRenaming::getReachingDefsAtStatemen
         else
         {
 
-            foreach(CFGEdge inEdge, node.inEdges())
+            for(CFGEdge inEdge: node.inEdges())
             {
                 CFGNode parentNode = inEdge.source();
                 if (visited.count(parentNode) == 0)
@@ -2862,7 +2859,7 @@ VariableRenaming::NumNodeRenameTable VariableRenaming::getReachingDefsAtStatemen
 
     //Merge in the defs from the reaching CFG nodes that are not children of the current statement
 
-    foreach(CFGNode cfgNode, filteredNodes)
+    for(CFGNode cfgNode: filteredNodes)
     {
         SgNode* sourceNode = cfgNode.getNode();
         if (statement == sourceNode || SageInterface::isAncestor(statement, sourceNode))
@@ -2875,7 +2872,7 @@ VariableRenaming::NumNodeRenameTable VariableRenaming::getReachingDefsAtStatemen
         //Merge the tables
         //TODO: Factor this out into a function
 
-        foreach(NumNodeRenameTable::value_type& entry, temp)
+        for(NumNodeRenameTable::value_type& entry: temp)
         {
             //Insert the entry wholesale
             if (result.count(entry.first) == 0)
@@ -2886,7 +2883,7 @@ VariableRenaming::NumNodeRenameTable VariableRenaming::getReachingDefsAtStatemen
             else
             {
 
-                foreach(NumNodeRenameEntry::value_type& tableEntry, entry.second)
+                for(NumNodeRenameEntry::value_type& tableEntry: entry.second)
                 {
                     //Insert the entry wholesale
                     if (result[entry.first].count(tableEntry.first) == 0)
@@ -3112,7 +3109,7 @@ VariableRenaming::ChildUses VariableRenaming::DefsAndUsesTraversal::evaluateSynt
             //In this case, there are no uses in the operand. We also want to delete any uses for the children
             vector<SgNode*> successors = SageInterface::querySubTree<SgNode > (unaryOp);
 
-            foreach(SgNode* successor, successors)
+            for(SgNode* successor: successors)
             {
                 ssa->getUseTable()[successor].clear();
             }
@@ -3203,7 +3200,7 @@ VariableRenaming::ChildUses VariableRenaming::DefsAndUsesTraversal::evaluateSynt
 void VariableRenaming::DefsAndUsesTraversal::addUsesToNode(SgNode* node, std::vector<SgNode*> uses)
 {
 
-    foreach(SgNode* useNode, uses)
+    for(SgNode* useNode: uses)
     {
         //Get the unique name of the def.
         VarUniqueName * uName = VariableRenaming::getUniqueName(useNode);
diff --git a/src/midend/programAnalysis/variableRenaming/VariableRenaming.h b/src/midend/programAnalysis/variableRenaming/VariableRenaming.h
index f7ddfcdcdef..c9bc2222a9d 100644
--- a/src/midend/programAnalysis/variableRenaming/VariableRenaming.h
+++ b/src/midend/programAnalysis/variableRenaming/VariableRenaming.h
@@ -11,7 +11,6 @@
 #include <ostream>
 #include <fstream>
 #include <sstream>
-#include <boost/foreach.hpp>
 #include "filteredCFG.h"
 #include <boost/unordered_map.hpp>
 
@@ -603,7 +602,7 @@ class VariableRenaming
         std::vector<T*> res;
         T* temp = NULL;
 
-        BOOST_FOREACH(NodeVec::value_type& val, vec)
+        for(NodeVec::value_type& val: vec)
         {
             temp = dynamic_cast<T*>(val);
             if(temp != NULL)
diff --git a/src/midend/programTransformation/extractFunctionArgumentsNormalization/ExtractFunctionArguments.C b/src/midend/programTransformation/extractFunctionArgumentsNormalization/ExtractFunctionArguments.C
index ff84237e9f8..9832c9e0cc3 100644
--- a/src/midend/programTransformation/extractFunctionArgumentsNormalization/ExtractFunctionArguments.C
+++ b/src/midend/programTransformation/extractFunctionArgumentsNormalization/ExtractFunctionArguments.C
@@ -1,15 +1,10 @@
 #include "ExtractFunctionArguments.h"
-#include <boost/foreach.hpp>
-#include <boost/tuple/tuple.hpp>
 #include <functionEvaluationOrderTraversal.h>
 #include "SingleStatementToBlockNormalization.h"
 
-#define foreach BOOST_FOREACH
-
 using namespace std;
 using namespace boost;
 
-
 /** Performs the function argument extraction on all function calls in the given subtree of the AST. */
 /** It does not do transofrmations in places where it is not safe. If you pass doUnsafeNormalization= true, we will normalize all callsites ignoring the safety (Suggested by Markus Schordan) */
 
@@ -29,13 +24,13 @@ void ExtractFunctionArguments::NormalizeTree(SgNode* tree, bool doUnsafeNormaliz
     this->functionCalls = FunctionEvaluationOrderTraversal::GetFunctionCalls(tree);
     
     // Normalize each function from safe place
-    foreach(const FunctionCallInfo& functionCallInfo, this->functionCalls.first) {
+    for(const FunctionCallInfo& functionCallInfo: this->functionCalls.first) {
         RewriteFunctionCallArguments(functionCallInfo);
     }
     
     // if doUnsafeNormalization is true, we will normalize calls which are not safe
     if(doUnsafeNormalization){
-        foreach(const FunctionCallInfo& functionCallInfo, this->functionCalls.second) {
+        for(const FunctionCallInfo& functionCallInfo: this->functionCalls.second) {
             RewriteFunctionCallArguments(functionCallInfo);
         }        
     }
@@ -118,8 +113,8 @@ bool ExtractFunctionArguments::IsFunctionArgumentTrivial(SgExpression* argument)
     (IsFunctionArgumentTrivial). Such functions don't need to be normalized.
  */
 bool ExtractFunctionArguments::AreAllFunctionCallsTrivial(std::vector<FunctionCallInfo> functions){
-    foreach(FunctionCallInfo functionCallInfo, functions){
-        foreach(SgExpression* arg, functionCallInfo.functionCall->get_args()->get_expressions()){
+    for(FunctionCallInfo functionCallInfo: functions){
+        for(SgExpression* arg: functionCallInfo.functionCall->get_args()->get_expressions()){
             if (!IsFunctionArgumentTrivial(arg)) {
                 return false;
             }
@@ -132,8 +127,8 @@ bool ExtractFunctionArguments::AreAllFunctionCallsTrivial(std::vector<FunctionCa
    at every function call site is either trivial (IsFunctionArgumentTrivial) or can be normalized (FunctionArgumentCanBeNormalized).
  */
 bool ExtractFunctionArguments::AreAllFunctionCallsNormalizable(std::vector<FunctionCallInfo> functions){
-    foreach(FunctionCallInfo functionCallInfo, functions){
-        foreach(SgExpression* arg, functionCallInfo.functionCall->get_args()->get_expressions()){
+    for(FunctionCallInfo functionCallInfo: functions){
+        for(SgExpression* arg: functionCallInfo.functionCall->get_args()->get_expressions()){
             if (!IsFunctionArgumentTrivial(arg) && !FunctionArgumentCanBeNormalized(arg)) {
                 return false;
             }
@@ -210,7 +205,7 @@ void ExtractFunctionArguments::RewriteFunctionCallArguments(const FunctionCallIn
     
     //Go over all the function arguments, pull them out
     
-    foreach(SgExpression* arg, argumentList)
+    for(SgExpression* arg: argumentList)
     {
         //No need to pull out parameters that are not complex expressions and
         //thus don't have side effects
@@ -311,7 +306,7 @@ bool ExtractFunctionArguments::FunctionArgsNeedNormalization(SgExprListExp* func
     ROSE_ASSERT(functionArgs != NULL);
     SgExpressionPtrList& argumentList = functionArgs->get_expressions();
     
-    foreach(SgExpression* functionArgument, argumentList)
+    for(SgExpression* functionArgument: argumentList)
     {
         if (FunctionArgumentNeedsNormalization(functionArgument))
             return true;
diff --git a/src/rose-config.C b/src/rose-config.C
index 69333919dab..098ede2ba58 100644
--- a/src/rose-config.C
+++ b/src/rose-config.C
@@ -35,7 +35,6 @@ static const char *description =
 #include <rose.h>                                       // POLICY_OK -- this is not a ROSE library source file
 #include <rose_getline.h>
 
-#include <boost/foreach.hpp>
 #include <regex>
 #include <map>
 #include <string>
@@ -165,7 +164,7 @@ readConfigFile(const std::filesystem::path &configName) {
   }
 
   bool hadError = false;
-  BOOST_FOREACH (const std::string &key, requiredKeys()) {
+  for (const std::string &key: requiredKeys()) {
     if (retval.find(key) == retval.end()) {
       MLOG_FATAL_CXX("rose-config") <<configName <<":" <<lineNumber <<": required key \"" <<key <<"\" is not defined\n";
       hadError = true;
@@ -186,7 +185,7 @@ readConfigFile(const Settings &settings) {
   std::vector<std::string> dirs;
   //boost::split(dirs, settings.searchDirs, boost::is_any_of(":;"));
   dirs = Rose::StringUtility::split(settings.searchDirs, ":;");
-  BOOST_FOREACH (const std::string &dir, dirs) {
+  for (const std::string &dir: dirs) {
     std::filesystem::path configFile = std::filesystem::path(dir) / CONFIG_NAME;
     if (std::filesystem::exists(configFile))
       return readConfigFile(configFile);
@@ -194,7 +193,7 @@ readConfigFile(const Settings &settings) {
 
   MLOG_FATAL_CXX("rose-config") <<"cannot find file \"" <<StringUtility::cEscape(CONFIG_NAME) <<"\"\n";
   MLOG_FATAL_CXX("rose-config")  <<"searched in these directories:\n";
-  BOOST_FOREACH (const std::string &dir, dirs)
+  for (const std::string &dir: dirs)
     MLOG_FATAL_CXX("rose-config") <<"  \"" <<StringUtility::cEscape(dir) <<"\"\n";
   exit(1);
 }
diff --git a/src/util/StringUtility/FileNameClassifier.C b/src/util/StringUtility/FileNameClassifier.C
index 4841b820f39..dec0a01d810 100644
--- a/src/util/StringUtility/FileNameClassifier.C
+++ b/src/util/StringUtility/FileNameClassifier.C
@@ -33,7 +33,6 @@
 #include <sys/utsname.h>
 #endif
 
-#include <boost/foreach.hpp>
 
 #include <boost/version.hpp>
 #if BOOST_VERSION >= 103600
diff --git a/src/util/StringUtility/FileUtility.C b/src/util/StringUtility/FileUtility.C
index 3accc18727a..6d194618308 100644
--- a/src/util/StringUtility/FileUtility.C
+++ b/src/util/StringUtility/FileUtility.C
@@ -10,7 +10,6 @@
 #include "mlog.h"
 
 // Other includes
-#include <boost/foreach.hpp>
 #include <boost/lexical_cast.hpp>
 #include <cstring>
 #include <errno.h>                                      // DQ (9/29/2006): This is required for 64-bit g++ 3.4.4 compiler.
diff --git a/tests/nonsmoke/functional/CompileTests/Cxx17_tests/test2018_25.C b/tests/nonsmoke/functional/CompileTests/Cxx17_tests/test2018_25.C
index 899299ebffd..00a502556d8 100644
--- a/tests/nonsmoke/functional/CompileTests/Cxx17_tests/test2018_25.C
+++ b/tests/nonsmoke/functional/CompileTests/Cxx17_tests/test2018_25.C
@@ -6,7 +6,7 @@ class Work
           void do_something() const
              {
             // for ( int i = 0 ; i < N ; ++i )
-               foreach( Parallel , 0 , N , [=,tmp=*this]( int i )
+               for( Parallel : 0 , N , [=,tmp=*this]( int i )
                   {
                  // A modestly long loop body where
                  // every reference to a member must be modified
diff --git a/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2011_10.C b/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2011_10.C
index 8e6885b754b..d68f0d565bb 100644
--- a/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2011_10.C
+++ b/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2011_10.C
@@ -24,7 +24,7 @@ int main(int argc, char** argv)
 
     vector<SgFunctionDeclaration*> funcs = SageInterface::querySubTree<SgFunctionDeclaration>(project,
 V_SgFunctionDeclaration);
-    BOOST_FOREACH (SgFunctionDeclaration* func, funcs)
+    for (SgFunctionDeclaration* func: funcs)
     {
         if (func->get_name() != "foo")
             continue;
diff --git a/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2011_13.C b/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2011_13.C
index 8024cba040a..3962ccd2e3b 100644
--- a/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2011_13.C
+++ b/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2011_13.C
@@ -25,14 +25,13 @@ To verify this is the case, you can use the following translator
 
 ----------------------------------------------
 #include "rose.h"
-#include <boost/foreach.hpp>
 int main(int argc, char** argv)
 {
     SgProject* project = frontend(argc, argv);
 
     vector<SgFunctionDeclaration*> functions = SageInterface::querySubTree<SgFunctionDeclaration>(project,
 V_SgFunctionDeclaration);
-    BOOST_FOREACH(SgFunctionDeclaration* function, functions)
+    for(SgFunctionDeclaration* function: functions)
     {
         //Process each function only once
         if (function != function->get_firstNondefiningDeclaration())
diff --git a/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2014_103.C b/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2014_103.C
index d2646598255..c59ca5c83c1 100644
--- a/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2014_103.C
+++ b/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2014_103.C
@@ -1,7 +1,5 @@
-
 #include <vector>
 
-#include "boost/foreach.hpp"
 #include "boost/cstdint.hpp"
 
 using std::vector;
@@ -20,7 +18,7 @@ uint64_t getNumberOfZones(const vector<Block>& blocks)
    {
      uint64_t numZones = 0;
 
-     BOOST_FOREACH(const Block& block, blocks) 
+     for(const Block& block: blocks) 
         {
           numZones += block.getSize();
         }
diff --git a/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2014_104.C b/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2014_104.C
index d3e7069abe1..95d30a3d5f9 100644
--- a/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2014_104.C
+++ b/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2014_104.C
@@ -1,7 +1,5 @@
-
 #include <vector>
 
-#include "boost/foreach.hpp"
 #include "boost/cstdint.hpp"
 
 using std::vector;
@@ -18,7 +16,7 @@ uint64_t getNumberOfZones(const vector<Block>& blocks)
    {
      uint64_t numZones = 0;
 
-     BOOST_FOREACH(const Block& block, blocks) 
+     for(const Block& block: blocks) 
         {
           numZones += block.getSize();
         }
diff --git a/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2014_105.C b/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2014_105.C
index 4a92711434a..ddfd6a3ce80 100644
--- a/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2014_105.C
+++ b/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2014_105.C
@@ -1,5 +1,3 @@
-
-
 #include <vector>
 
 #include "boost/foreach.hpp"
@@ -19,7 +17,7 @@ uint64_t getNumberOfZones(const vector<Block>& blocks)
    {
      uint64_t numZones = 0;
 
-     BOOST_FOREACH(const Block& block, blocks) 
+     for(const Block& block: blocks) 
         {
           numZones += block.getSize();
         }
diff --git a/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2014_106.C b/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2014_106.C
index 2a114c18c69..e2bd4691241 100644
--- a/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2014_106.C
+++ b/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2014_106.C
@@ -1,5 +1,3 @@
-
-
 #include <vector>
 
 #include "boost/foreach.hpp"
@@ -19,7 +17,7 @@ uint64_t getNumberOfZones(const vector<Block>& blocks)
    {
      uint64_t numZones = 0;
 
-     BOOST_FOREACH(const Block& block, blocks) 
+     for(const Block& block: blocks) 
         {
           numZones += block.getSize();
         }
diff --git a/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2014_108.C b/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2014_108.C
index 20f38fbb865..cafe7d61b76 100644
--- a/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2014_108.C
+++ b/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2014_108.C
@@ -26,7 +26,7 @@ uint64_t getNumberOfZones(const vector<Block>& blocks)
    {
      uint64_t numZones = 0;
 
-     BOOST_FOREACH(const Block& block, blocks) 
+     for(const Block& block: blocks) 
         {
           numZones += block.getSize();
         }
diff --git a/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2015_55.C b/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2015_55.C
index 7c51b700d4a..16f4d7c0445 100644
--- a/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2015_55.C
+++ b/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2015_55.C
@@ -2,8 +2,6 @@
 
 #include "boost/shared_ptr.hpp"
 
-#include "boost/foreach.hpp"
-
 class X;
 
 void foobar() 
@@ -11,7 +9,7 @@ void foobar()
      int num = 0;
      std::vector<boost::shared_ptr<X> > *X_ptr = 0L;
 
-     BOOST_FOREACH(boost::shared_ptr<X> procInfo, *X_ptr) 
+     for(boost::shared_ptr<X> procInfo: *X_ptr) 
         {
           num++;
         }
diff --git a/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2015_56.h b/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2015_56.h
index 9c269c42496..9c871309dd0 100644
--- a/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2015_56.h
+++ b/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2015_56.h
@@ -71402,23 +71402,23 @@ namespace foreach
 
 template<typename T>
 inline boost::foreach::is_lightweight_proxy<T> *
-boost_foreach_is_lightweight_proxy(T *&, boost::foreach::tag) { return 0; }
+boost_for_is_lightweight_proxy(T *&: boost::foreach::tag) { return 0; }
 
 template<typename T>
 inline boost::mpl::true_ *
-boost_foreach_is_lightweight_proxy(std::pair<T, T> *&, boost::foreach::tag) { return 0; }
+boost_for_is_lightweight_proxy(std::pair<T: T> *&, boost::foreach::tag) { return 0; }
 
 template<typename T>
 inline boost::mpl::true_ *
-boost_foreach_is_lightweight_proxy(boost::iterator_range<T> *&, boost::foreach::tag) { return 0; }
+boost_for_is_lightweight_proxy(boost::iterator_range<T> *&: boost::foreach::tag) { return 0; }
 
 template<typename T>
 inline boost::mpl::true_ *
-boost_foreach_is_lightweight_proxy(boost::sub_range<T> *&, boost::foreach::tag) { return 0; }
+boost_for_is_lightweight_proxy(boost::sub_range<T> *&: boost::foreach::tag) { return 0; }
 
 template<typename T>
 inline boost::mpl::true_ *
-boost_foreach_is_lightweight_proxy(T **&, boost::foreach::tag) { return 0; }
+boost_for_is_lightweight_proxy(T **&: boost::foreach::tag) { return 0; }
 
 
 
@@ -71427,7 +71427,7 @@ boost_foreach_is_lightweight_proxy(T **&, boost::foreach::tag) { return 0; }
 
 template<typename T>
 inline boost::foreach::is_noncopyable<T> *
-boost_foreach_is_noncopyable(T *&, boost::foreach::tag) { return 0; }
+boost_for_is_noncopyable(T *&: boost::foreach::tag) { return 0; }
 
 namespace boost
 {
@@ -71799,7 +71799,7 @@ template<typename T, typename C>
 inline auto_any<typename foreach_iterator<T, C>::type>
 begin(auto_any_t col, type2type<T, C> *, boost::mpl::true_ *) 
 {
-    return auto_any<typename foreach_iterator<T, C>::type>(
+    return auto_any<typename for_iterator<T: C>::type>(
         boost::begin(auto_any_cast<T, C>(col)));
 }
 
@@ -71809,7 +71809,7 @@ begin(auto_any_t col, type2type<T, C> *, boost::mpl::false_ *)
 {
     typedef typename type2type<T, C>::type type;
     typedef typename foreach_iterator<T, C>::type iterator;
-    return auto_any<typename foreach_iterator<T, C>::type>(
+    return auto_any<typename for_iterator<T: C>::type>(
         iterator(boost::begin((*(auto_any_cast<type *, boost::mpl::false_>(col))))));
 }
 
@@ -71817,7 +71817,7 @@ template<typename T>
 inline auto_any<typename foreach_iterator<T, const_>::type>
 begin(auto_any_t col, type2type<T, const_> *, bool *)
 {
-    return auto_any<typename foreach_iterator<T, const_>::type>(
+    return auto_any<typename for_iterator<T: const_>::type>(
         boost::begin(*auto_any_cast<simple_variant<T>, boost::mpl::false_>(col).get()));
 }
 
@@ -71835,7 +71835,7 @@ template<typename T, typename C>
 inline auto_any<typename foreach_iterator<T, C>::type>
 end(auto_any_t col, type2type<T, C> *, boost::mpl::true_ *) 
 {
-    return auto_any<typename foreach_iterator<T, C>::type>(
+    return auto_any<typename for_iterator<T: C>::type>(
         boost::end(auto_any_cast<T, C>(col)));
 }
 
@@ -71845,7 +71845,7 @@ end(auto_any_t col, type2type<T, C> *, boost::mpl::false_ *)
 {
     typedef typename type2type<T, C>::type type;
     typedef typename foreach_iterator<T, C>::type iterator;
-    return auto_any<typename foreach_iterator<T, C>::type>(
+    return auto_any<typename for_iterator<T: C>::type>(
         iterator(boost::end((*(auto_any_cast<type *, boost::mpl::false_>(col))))));
 }
 
@@ -71853,7 +71853,7 @@ template<typename T>
 inline auto_any<typename foreach_iterator<T, const_>::type>
 end(auto_any_t col, type2type<T, const_> *, bool *)
 {
-    return auto_any<typename foreach_iterator<T, const_>::type>(
+    return auto_any<typename for_iterator<T: const_>::type>(
         boost::end(*auto_any_cast<simple_variant<T>, boost::mpl::false_>(col).get()));
 }
 
@@ -71908,7 +71908,7 @@ template<typename T, typename C>
 inline auto_any<typename foreach_reverse_iterator<T, C>::type>
 rbegin(auto_any_t col, type2type<T, C> *, boost::mpl::true_ *) 
 {
-    return auto_any<typename foreach_reverse_iterator<T, C>::type>(
+    return auto_any<typename for_reverse_iterator<T: C>::type>(
         boost::rbegin(auto_any_cast<T, C>(col)));
 }
 
@@ -71918,7 +71918,7 @@ rbegin(auto_any_t col, type2type<T, C> *, boost::mpl::false_ *)
 {
     typedef typename type2type<T, C>::type type;
     typedef typename foreach_reverse_iterator<T, C>::type iterator;
-    return auto_any<typename foreach_reverse_iterator<T, C>::type>(
+    return auto_any<typename for_reverse_iterator<T: C>::type>(
         iterator(boost::rbegin((*(auto_any_cast<type *, boost::mpl::false_>(col))))));
 }
 
@@ -71926,7 +71926,7 @@ template<typename T>
 inline auto_any<typename foreach_reverse_iterator<T, const_>::type>
 rbegin(auto_any_t col, type2type<T, const_> *, bool *)
 {
-    return auto_any<typename foreach_reverse_iterator<T, const_>::type>(
+    return auto_any<typename for_reverse_iterator<T: const_>::type>(
         boost::rbegin(*auto_any_cast<simple_variant<T>, boost::mpl::false_>(col).get()));
 }
 
@@ -71947,7 +71947,7 @@ template<typename T, typename C>
 inline auto_any<typename foreach_reverse_iterator<T, C>::type>
 rend(auto_any_t col, type2type<T, C> *, boost::mpl::true_ *) 
 {
-    return auto_any<typename foreach_reverse_iterator<T, C>::type>(
+    return auto_any<typename for_reverse_iterator<T: C>::type>(
         boost::rend(auto_any_cast<T, C>(col)));
 }
 
@@ -71957,7 +71957,7 @@ rend(auto_any_t col, type2type<T, C> *, boost::mpl::false_ *)
 {
     typedef typename type2type<T, C>::type type;
     typedef typename foreach_reverse_iterator<T, C>::type iterator;
-    return auto_any<typename foreach_reverse_iterator<T, C>::type>(
+    return auto_any<typename for_reverse_iterator<T: C>::type>(
         iterator(boost::rend((*(auto_any_cast<type *, boost::mpl::false_>(col))))));
 }
 
@@ -71965,7 +71965,7 @@ template<typename T>
 inline auto_any<typename foreach_reverse_iterator<T, const_>::type>
 rend(auto_any_t col, type2type<T, const_> *, bool *)
 {
-    return auto_any<typename foreach_reverse_iterator<T, const_>::type>(
+    return auto_any<typename for_reverse_iterator<T: const_>::type>(
         boost::rend(*auto_any_cast<simple_variant<T>, boost::mpl::false_>(col).get()));
 }
 
@@ -72090,7 +72090,7 @@ void foobar()
      int num = 0;
      std::vector<boost::shared_ptr<X> > *X_ptr = 0L;
 
-      if (bool _foreach_is_rvalue14 = false) {} else if (boost::foreach_detail_::auto_any_t _foreach_col14 = boost::foreach_detail_::contain( (true ? boost::foreach_detail_::make_probe((*X_ptr), _foreach_is_rvalue14) : (*X_ptr)) , (boost::foreach_detail_::should_copy_impl( true ? 0 : boost::foreach_detail_::or_( boost::foreach_detail_::is_array_(*X_ptr) , boost_foreach_is_noncopyable( boost::foreach_detail_::to_ptr(*X_ptr) , boost_foreach_argument_dependent_lookup_hack_value) , boost::foreach_detail_::not_(boost::foreach_detail_::is_const_(*X_ptr))) , true ? 0 : boost::foreach_detail_::and_( boost::foreach_detail_::not_(boost_foreach_is_noncopyable( boost::foreach_detail_::to_ptr(*X_ptr) , boost_foreach_argument_dependent_lookup_hack_value)) , boost_foreach_is_lightweight_proxy( boost::foreach_detail_::to_ptr(*X_ptr) , boost_foreach_argument_dependent_lookup_hack_value)) , &_foreach_is_rvalue14)))) {} else if (boost::foreach_detail_::auto_any_t _foreach_cur14 = boost::foreach_detail_::begin( _foreach_col14 , (true ? 0 : boost::foreach_detail_::encode_type(*X_ptr, boost::foreach_detail_::is_const_(*X_ptr))) , (boost::foreach_detail_::should_copy_impl( true ? 0 : boost::foreach_detail_::or_( boost::foreach_detail_::is_array_(*X_ptr) , boost_foreach_is_noncopyable( boost::foreach_detail_::to_ptr(*X_ptr) , boost_foreach_argument_dependent_lookup_hack_value) , boost::foreach_detail_::not_(boost::foreach_detail_::is_const_(*X_ptr))) , true ? 0 : boost::foreach_detail_::and_( boost::foreach_detail_::not_(boost_foreach_is_noncopyable( boost::foreach_detail_::to_ptr(*X_ptr) , boost_foreach_argument_dependent_lookup_hack_value)) , boost_foreach_is_lightweight_proxy( boost::foreach_detail_::to_ptr(*X_ptr) , boost_foreach_argument_dependent_lookup_hack_value)) , &_foreach_is_rvalue14)))) {} else if (boost::foreach_detail_::auto_any_t _foreach_end14 = boost::foreach_detail_::end( _foreach_col14 , (true ? 0 : boost::foreach_detail_::encode_type(*X_ptr, boost::foreach_detail_::is_const_(*X_ptr))) , (boost::foreach_detail_::should_copy_impl( true ? 0 : boost::foreach_detail_::or_( boost::foreach_detail_::is_array_(*X_ptr) , boost_foreach_is_noncopyable( boost::foreach_detail_::to_ptr(*X_ptr) , boost_foreach_argument_dependent_lookup_hack_value) , boost::foreach_detail_::not_(boost::foreach_detail_::is_const_(*X_ptr))) , true ? 0 : boost::foreach_detail_::and_( boost::foreach_detail_::not_(boost_foreach_is_noncopyable( boost::foreach_detail_::to_ptr(*X_ptr) , boost_foreach_argument_dependent_lookup_hack_value)) , boost_foreach_is_lightweight_proxy( boost::foreach_detail_::to_ptr(*X_ptr) , boost_foreach_argument_dependent_lookup_hack_value)) , &_foreach_is_rvalue14)))) {} else for (bool _foreach_continue14 = true; _foreach_continue14 && !boost::foreach_detail_::done( _foreach_cur14 , _foreach_end14 , (true ? 0 : boost::foreach_detail_::encode_type(*X_ptr, boost::foreach_detail_::is_const_(*X_ptr)))); _foreach_continue14 ? boost::foreach_detail_::next( _foreach_cur14 , (true ? 0 : boost::foreach_detail_::encode_type(*X_ptr, boost::foreach_detail_::is_const_(*X_ptr)))) : (void)0) if (boost::foreach_detail_::set_false(_foreach_continue14)) {} else for (boost::shared_ptr<X> procInfo = boost::foreach_detail_::deref( _foreach_cur14 , (true ? 0 : boost::foreach_detail_::encode_type(*X_ptr, boost::foreach_detail_::is_const_(*X_ptr)))); !_foreach_continue14; _foreach_continue14 = true) 
+      if (bool _for_is_rvalue14 = false) {} else if (boost::foreach_detail_::auto_any_t _foreach_col14 = boost::foreach_detail_::contain( (true ? boost::foreach_detail_::make_probe((*X_ptr): _foreach_is_rvalue14) : (*X_ptr)) , (boost::foreach_detail_::should_copy_impl( true ? 0 : boost::foreach_detail_::or_( boost::foreach_detail_::is_array_(*X_ptr) , boost_foreach_is_noncopyable( boost::foreach_detail_::to_ptr(*X_ptr) , boost_foreach_argument_dependent_lookup_hack_value) , boost::foreach_detail_::not_(boost::foreach_detail_::is_const_(*X_ptr))) , true ? 0 : boost::foreach_detail_::and_( boost::foreach_detail_::not_(boost_foreach_is_noncopyable( boost::foreach_detail_::to_ptr(*X_ptr) , boost_foreach_argument_dependent_lookup_hack_value)) , boost_foreach_is_lightweight_proxy( boost::foreach_detail_::to_ptr(*X_ptr) , boost_foreach_argument_dependent_lookup_hack_value)) , &_foreach_is_rvalue14)))) {} else if (boost::foreach_detail_::auto_any_t _foreach_cur14 = boost::foreach_detail_::begin( _foreach_col14 , (true ? 0 : boost::foreach_detail_::encode_type(*X_ptr, boost::foreach_detail_::is_const_(*X_ptr))) , (boost::foreach_detail_::should_copy_impl( true ? 0 : boost::foreach_detail_::or_( boost::foreach_detail_::is_array_(*X_ptr) , boost_foreach_is_noncopyable( boost::foreach_detail_::to_ptr(*X_ptr) , boost_foreach_argument_dependent_lookup_hack_value) , boost::foreach_detail_::not_(boost::foreach_detail_::is_const_(*X_ptr))) , true ? 0 : boost::foreach_detail_::and_( boost::foreach_detail_::not_(boost_foreach_is_noncopyable( boost::foreach_detail_::to_ptr(*X_ptr) , boost_foreach_argument_dependent_lookup_hack_value)) , boost_foreach_is_lightweight_proxy( boost::foreach_detail_::to_ptr(*X_ptr) , boost_foreach_argument_dependent_lookup_hack_value)) , &_foreach_is_rvalue14)))) {} else if (boost::foreach_detail_::auto_any_t _foreach_end14 = boost::foreach_detail_::end( _foreach_col14 , (true ? 0 : boost::foreach_detail_::encode_type(*X_ptr, boost::foreach_detail_::is_const_(*X_ptr))) , (boost::foreach_detail_::should_copy_impl( true ? 0 : boost::foreach_detail_::or_( boost::foreach_detail_::is_array_(*X_ptr) , boost_foreach_is_noncopyable( boost::foreach_detail_::to_ptr(*X_ptr) , boost_foreach_argument_dependent_lookup_hack_value) , boost::foreach_detail_::not_(boost::foreach_detail_::is_const_(*X_ptr))) , true ? 0 : boost::foreach_detail_::and_( boost::foreach_detail_::not_(boost_foreach_is_noncopyable( boost::foreach_detail_::to_ptr(*X_ptr) , boost_foreach_argument_dependent_lookup_hack_value)) , boost_foreach_is_lightweight_proxy( boost::foreach_detail_::to_ptr(*X_ptr) , boost_foreach_argument_dependent_lookup_hack_value)) , &_foreach_is_rvalue14)))) {} else for (bool _foreach_continue14 = true; _foreach_continue14 && !boost::foreach_detail_::done( _foreach_cur14 , _foreach_end14 , (true ? 0 : boost::foreach_detail_::encode_type(*X_ptr, boost::foreach_detail_::is_const_(*X_ptr)))); _foreach_continue14 ? boost::foreach_detail_::next( _foreach_cur14 , (true ? 0 : boost::foreach_detail_::encode_type(*X_ptr, boost::foreach_detail_::is_const_(*X_ptr)))) : (void)0) if (boost::foreach_detail_::set_false(_foreach_continue14)) {} else for (boost::shared_ptr<X> procInfo = boost::foreach_detail_::deref( _foreach_cur14 , (true ? 0 : boost::foreach_detail_::encode_type(*X_ptr, boost::foreach_detail_::is_const_(*X_ptr)))); !_foreach_continue14; _foreach_continue14 = true) 
         {
           num++;
         }
diff --git a/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2016_58.C b/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2016_58.C
index 207e0806cc1..dcc78b32502 100644
--- a/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2016_58.C
+++ b/tests/nonsmoke/functional/CompileTests/Cxx_tests/test2016_58.C
@@ -1793,6 +1793,7 @@ class  SharedObject { };
 
 
 enum boost_foreach_argument_dependent_lookup_hack
+#include "boost/foreach.hpp"
 {
     boost_foreach_argument_dependent_lookup_hack_value
 };
@@ -2044,25 +2045,25 @@ contain(T const &t, bool *rvalue);
 template<typename T>
 inline auto_any<typename foreach_iterator<T, const_>::type>
 begin(auto_any_t col, type2type<T, const_> *, bool *);
-// { return auto_any<typename foreach_iterator<T, const_>::type>(boost::begin(*auto_any_cast<simple_variant<T>, boost::mpl::false_>(col).get())); }
+// { return auto_any<typename for_iterator<T: const_>::type>(boost::begin(*auto_any_cast<simple_variant<T>, boost::mpl::false_>(col).get())); }
 
 template<typename T>
 inline auto_any<typename foreach_iterator<T, const_>::type>
 end(auto_any_t col, type2type<T, const_> *, bool *);
-  // { return auto_any<typename foreach_iterator<T, const_>::type>(boost::end(*auto_any_cast<simple_variant<T>, boost::mpl::false_>(col).get())); }
+  // { return auto_any<typename for_iterator<T: const_>::type>(boost::end(*auto_any_cast<simple_variant<T>, boost::mpl::false_>(col).get())); }
 
 template<typename T, typename C>
 inline bool done(auto_any_t cur, auto_any_t end, type2type<T, C> *);
-  // { typedef typename foreach_iterator<T, C>::type iter_t; return auto_any_cast<iter_t, boost::mpl::false_>(cur) == auto_any_cast<iter_t, boost::mpl::false_>(end); }
+  // { typedef typename for_iterator<T: C>::type iter_t; return auto_any_cast<iter_t, boost::mpl::false_>(cur) == auto_any_cast<iter_t, boost::mpl::false_>(end); }
 
 template<typename T, typename C>
 inline void next(auto_any_t cur, type2type<T, C> *);
-// { typedef typename foreach_iterator<T, C>::type iter_t; ++auto_any_cast<iter_t, boost::mpl::false_>(cur); }
+// { typedef typename for_iterator<T: C>::type iter_t; ++auto_any_cast<iter_t, boost::mpl::false_>(cur); }
 
 template<typename T, typename C>
 inline typename foreach_reference<T, C>::type
 deref(auto_any_t cur, type2type<T, C> *);
-// { typedef typename foreach_iterator<T, C>::type iter_t; return *auto_any_cast<iter_t, boost::mpl::false_>(cur); }
+// { typedef typename for_iterator<T: C>::type iter_t; return *auto_any_cast<iter_t, boost::mpl::false_>(cur); }
 
 } 
 } 
@@ -2150,7 +2151,7 @@ void fromDecimal(Word *vec, const std::string &input)
      boost::uint64_t v = 0;
 
 #if 1
-     if (bool _foreach_is_rvalue1401 = false) {} else if (boost::foreach_detail_::auto_any_t _foreach_col1401 = boost::foreach_detail_::contain( (true ? boost::foreach_detail_::make_probe((input), _foreach_is_rvalue1401) : (input)) , (boost::foreach_detail_::should_copy_impl( true ? 0 : boost::foreach_detail_::or_( boost::foreach_detail_::is_array_(input) , boost_foreach_is_noncopyable( boost::foreach_detail_::to_ptr(input) , boost_foreach_argument_dependent_lookup_hack_value) , boost::foreach_detail_::not_(boost::foreach_detail_::is_const_(input))) , true ? 0 : boost::foreach_detail_::and_( boost::foreach_detail_::not_(boost_foreach_is_noncopyable( boost::foreach_detail_::to_ptr(input) , boost_foreach_argument_dependent_lookup_hack_value)) , boost_foreach_is_lightweight_proxy( boost::foreach_detail_::to_ptr(input) , boost_foreach_argument_dependent_lookup_hack_value)) , &_foreach_is_rvalue1401)))) {} else if (boost::foreach_detail_::auto_any_t _foreach_cur1401 = boost::foreach_detail_::begin( _foreach_col1401 , (true ? 0 : boost::foreach_detail_::encode_type(input, boost::foreach_detail_::is_const_(input))) , (boost::foreach_detail_::should_copy_impl( true ? 0 : boost::foreach_detail_::or_( boost::foreach_detail_::is_array_(input) , boost_foreach_is_noncopyable( boost::foreach_detail_::to_ptr(input) , boost_foreach_argument_dependent_lookup_hack_value) , boost::foreach_detail_::not_(boost::foreach_detail_::is_const_(input))) , true ? 0 : boost::foreach_detail_::and_( boost::foreach_detail_::not_(boost_foreach_is_noncopyable( boost::foreach_detail_::to_ptr(input) , boost_foreach_argument_dependent_lookup_hack_value)) , boost_foreach_is_lightweight_proxy( boost::foreach_detail_::to_ptr(input) , boost_foreach_argument_dependent_lookup_hack_value)) , &_foreach_is_rvalue1401)))) {} else if (boost::foreach_detail_::auto_any_t _foreach_end1401 = boost::foreach_detail_::end( _foreach_col1401 , (true ? 0 : boost::foreach_detail_::encode_type(input, boost::foreach_detail_::is_const_(input))) , (boost::foreach_detail_::should_copy_impl( true ? 0 : boost::foreach_detail_::or_( boost::foreach_detail_::is_array_(input) , boost_foreach_is_noncopyable( boost::foreach_detail_::to_ptr(input) , boost_foreach_argument_dependent_lookup_hack_value) , boost::foreach_detail_::not_(boost::foreach_detail_::is_const_(input))) , true ? 0 : boost::foreach_detail_::and_( boost::foreach_detail_::not_(boost_foreach_is_noncopyable( boost::foreach_detail_::to_ptr(input) , boost_foreach_argument_dependent_lookup_hack_value)) , boost_foreach_is_lightweight_proxy( boost::foreach_detail_::to_ptr(input) , boost_foreach_argument_dependent_lookup_hack_value)) , &_foreach_is_rvalue1401)))) {} else for (bool _foreach_continue1401 = true; _foreach_continue1401 && !boost::foreach_detail_::done( _foreach_cur1401 , _foreach_end1401 , (true ? 0 : boost::foreach_detail_::encode_type(input, boost::foreach_detail_::is_const_(input)))); _foreach_continue1401 ? boost::foreach_detail_::next( _foreach_cur1401 , (true ? 0 : boost::foreach_detail_::encode_type(input, boost::foreach_detail_::is_const_(input)))) : (void)0) if (boost::foreach_detail_::set_false(_foreach_continue1401)) {} else for (char ch = boost::foreach_detail_::deref( _foreach_cur1401 , (true ? 0 : boost::foreach_detail_::encode_type(input, boost::foreach_detail_::is_const_(input)))); !_foreach_continue1401; _foreach_continue1401 = true) {
+     if (bool _for_is_rvalue1401 = false) {} else if (boost::foreach_detail_::auto_any_t _foreach_col1401 = boost::foreach_detail_::contain( (true ? boost::foreach_detail_::make_probe((input): _foreach_is_rvalue1401) : (input)) , (boost::foreach_detail_::should_copy_impl( true ? 0 : boost::foreach_detail_::or_( boost::foreach_detail_::is_array_(input) , boost_foreach_is_noncopyable( boost::foreach_detail_::to_ptr(input) , boost_foreach_argument_dependent_lookup_hack_value) , boost::foreach_detail_::not_(boost::foreach_detail_::is_const_(input))) , true ? 0 : boost::foreach_detail_::and_( boost::foreach_detail_::not_(boost_foreach_is_noncopyable( boost::foreach_detail_::to_ptr(input) , boost_foreach_argument_dependent_lookup_hack_value)) , boost_foreach_is_lightweight_proxy( boost::foreach_detail_::to_ptr(input) , boost_foreach_argument_dependent_lookup_hack_value)) , &_foreach_is_rvalue1401)))) {} else if (boost::foreach_detail_::auto_any_t _foreach_cur1401 = boost::foreach_detail_::begin( _foreach_col1401 , (true ? 0 : boost::foreach_detail_::encode_type(input, boost::foreach_detail_::is_const_(input))) , (boost::foreach_detail_::should_copy_impl( true ? 0 : boost::foreach_detail_::or_( boost::foreach_detail_::is_array_(input) , boost_foreach_is_noncopyable( boost::foreach_detail_::to_ptr(input) , boost_foreach_argument_dependent_lookup_hack_value) , boost::foreach_detail_::not_(boost::foreach_detail_::is_const_(input))) , true ? 0 : boost::foreach_detail_::and_( boost::foreach_detail_::not_(boost_foreach_is_noncopyable( boost::foreach_detail_::to_ptr(input) , boost_foreach_argument_dependent_lookup_hack_value)) , boost_foreach_is_lightweight_proxy( boost::foreach_detail_::to_ptr(input) , boost_foreach_argument_dependent_lookup_hack_value)) , &_foreach_is_rvalue1401)))) {} else if (boost::foreach_detail_::auto_any_t _foreach_end1401 = boost::foreach_detail_::end( _foreach_col1401 , (true ? 0 : boost::foreach_detail_::encode_type(input, boost::foreach_detail_::is_const_(input))) , (boost::foreach_detail_::should_copy_impl( true ? 0 : boost::foreach_detail_::or_( boost::foreach_detail_::is_array_(input) , boost_foreach_is_noncopyable( boost::foreach_detail_::to_ptr(input) , boost_foreach_argument_dependent_lookup_hack_value) , boost::foreach_detail_::not_(boost::foreach_detail_::is_const_(input))) , true ? 0 : boost::foreach_detail_::and_( boost::foreach_detail_::not_(boost_foreach_is_noncopyable( boost::foreach_detail_::to_ptr(input) , boost_foreach_argument_dependent_lookup_hack_value)) , boost_foreach_is_lightweight_proxy( boost::foreach_detail_::to_ptr(input) , boost_foreach_argument_dependent_lookup_hack_value)) , &_foreach_is_rvalue1401)))) {} else for (bool _foreach_continue1401 = true; _foreach_continue1401 && !boost::foreach_detail_::done( _foreach_cur1401 , _foreach_end1401 , (true ? 0 : boost::foreach_detail_::encode_type(input, boost::foreach_detail_::is_const_(input)))); _foreach_continue1401 ? boost::foreach_detail_::next( _foreach_cur1401 , (true ? 0 : boost::foreach_detail_::encode_type(input, boost::foreach_detail_::is_const_(input)))) : (void)0) if (boost::foreach_detail_::set_false(_foreach_continue1401)) {} else for (char ch = boost::foreach_detail_::deref( _foreach_cur1401 , (true ? 0 : boost::foreach_detail_::encode_type(input, boost::foreach_detail_::is_const_(input)))); !_foreach_continue1401; _foreach_continue1401 = true) {
 
     }
 #endif
diff --git a/tests/nonsmoke/functional/moveDeclarationTool/inputmoveDeclarationToInnermostScope_test2015_71.C b/tests/nonsmoke/functional/moveDeclarationTool/inputmoveDeclarationToInnermostScope_test2015_71.C
index 384e735ecb2..246c056ae0d 100644
--- a/tests/nonsmoke/functional/moveDeclarationTool/inputmoveDeclarationToInnermostScope_test2015_71.C
+++ b/tests/nonsmoke/functional/moveDeclarationTool/inputmoveDeclarationToInnermostScope_test2015_71.C
@@ -1,7 +1,5 @@
-
 #include <vector>
 
-#include "boost/foreach.hpp"
 #include "boost/cstdint.hpp"
 
 using std::vector;
@@ -37,7 +35,7 @@ getNumberOfZones(const vector<Block>& blocks)
      uint64_t numZones = 0;
 #endif
 
-     BOOST_FOREACH(const Block& block, blocks) 
+     for(const Block& block: blocks) 
         {
           numZones += block.getSize();
         }
diff --git a/tests/nonsmoke/functional/roseTests/astInliningTests/inlineEverything.C b/tests/nonsmoke/functional/roseTests/astInliningTests/inlineEverything.C
index f9532b188ca..d456434a36e 100644
--- a/tests/nonsmoke/functional/roseTests/astInliningTests/inlineEverything.C
+++ b/tests/nonsmoke/functional/roseTests/astInliningTests/inlineEverything.C
@@ -153,7 +153,7 @@ main (int argc, char* argv[]) {
     for (int count=0; count<10; ++count) 
     {
       bool changed = false;
-      //    BOOST_FOREACH (SgFunctionCallExp *call, SageInterface::querySubTree<SgFunctionCallExp>(sageProject)) 
+      //    for (SgFunctionCallExp *call: SageInterface::querySubTree<SgFunctionCallExp>(sageProject)) 
       // interesting user loops are often located in the end of the source file    
       //BOOST_REVERSE_FOREACH (SgFunctionCallExp *call, SageInterface::querySubTree<SgFunctionCallExp>(sageProject)) 
       MLOG_WARN_C("astInliningTests", "reverse_foreach, e.g., BOOST_REVERSE_FOREACH should be used.\n"); 
diff --git a/tests/nonsmoke/functional/roseTests/astLValueTests/runTest.C b/tests/nonsmoke/functional/roseTests/astLValueTests/runTest.C
index f65622b925c..938837f4442 100644
--- a/tests/nonsmoke/functional/roseTests/astLValueTests/runTest.C
+++ b/tests/nonsmoke/functional/roseTests/astLValueTests/runTest.C
@@ -1,6 +1,5 @@
 #include <rose.h>
 #include <iostream>
-#include <boost/foreach.hpp>
 
 int main(int argc, char ** argv)
 {
@@ -15,14 +14,14 @@ int main(int argc, char ** argv)
 
 	bool success = true;
 	std::vector<SgFunctionDeclaration*> funs = SageInterface::querySubTree<SgFunctionDeclaration>(project, V_SgFunctionDeclaration);
-	BOOST_FOREACH(SgFunctionDeclaration* fun, funs)
+	for(SgFunctionDeclaration* fun: funs)
 	{
 		std::string funName = fun->get_qualified_name().getString();
 		// every expr statement should be an lvalue
 		if (funName == "HasLValues")
 		{
 			Rose_STL_Container<SgStatement*> bodystmts = fun->get_definition()->get_body()->get_statements();
-			BOOST_FOREACH(SgStatement* stmt, bodystmts)
+			for(SgStatement* stmt: bodystmts)
 			{
 				if (SgExprStatement* exprstmt = isSgExprStatement(stmt))
 				{
@@ -39,7 +38,7 @@ int main(int argc, char ** argv)
 		else if (funName == "NoLValues")
 		{
 			Rose_STL_Container<SgStatement*> bodystmts = fun->get_definition()->get_body()->get_statements();
-			BOOST_FOREACH(SgStatement* stmt, bodystmts)
+			for(SgStatement* stmt: bodystmts)
 			{
 				if (SgExprStatement* exprstmt = isSgExprStatement(stmt))
 				{
diff --git a/tests/nonsmoke/functional/roseTests/programAnalysisTests/VirtualFunctionAnalysisTest.C b/tests/nonsmoke/functional/roseTests/programAnalysisTests/VirtualFunctionAnalysisTest.C
index d20251899ac..5fb5d4aefec 100644
--- a/tests/nonsmoke/functional/roseTests/programAnalysisTests/VirtualFunctionAnalysisTest.C
+++ b/tests/nonsmoke/functional/roseTests/programAnalysisTests/VirtualFunctionAnalysisTest.C
@@ -4,13 +4,7 @@
 #include <iostream>
 #include <CommandOptions.h>
 #include <CallGraph.h>
-
 #include "VirtualFunctionAnalysis.h"
-using namespace boost;
-
-// warning: poor practice and possible name conflicts according to Boost documentation
-#define foreach BOOST_FOREACH
-#define reverse_foreach BOOST_REVERSE_FOREACH
 
 using namespace std;
 using namespace boost;
diff --git a/tests/nonsmoke/functional/roseTests/programAnalysisTests/generalDataFlowAnalysisTests/pointerAliasAnalysis.h b/tests/nonsmoke/functional/roseTests/programAnalysisTests/generalDataFlowAnalysisTests/pointerAliasAnalysis.h
index a3122b27268..228748f8a41 100644
--- a/tests/nonsmoke/functional/roseTests/programAnalysisTests/generalDataFlowAnalysisTests/pointerAliasAnalysis.h
+++ b/tests/nonsmoke/functional/roseTests/programAnalysisTests/generalDataFlowAnalysisTests/pointerAliasAnalysis.h
@@ -1,7 +1,6 @@
 #ifndef POINTERALIAS_ANALYSIS_H
 #define POINTERALIAS_ANALYSIS_H
 
-#include <boost/foreach.hpp>
 #include <boost/shared_ptr.hpp>
 #include <boost/unordered_map.hpp>
 #include <algorithm>
diff --git a/tests/nonsmoke/functional/roseTests/programAnalysisTests/typeTraitTests/typeTraitExerciseWithRetCode.C b/tests/nonsmoke/functional/roseTests/programAnalysisTests/typeTraitTests/typeTraitExerciseWithRetCode.C
index c3003fe67af..b4358c483db 100644
--- a/tests/nonsmoke/functional/roseTests/programAnalysisTests/typeTraitTests/typeTraitExerciseWithRetCode.C
+++ b/tests/nonsmoke/functional/roseTests/programAnalysisTests/typeTraitTests/typeTraitExerciseWithRetCode.C
@@ -7,14 +7,10 @@
 #include <map>
 #include <boost/tokenizer.hpp>
 #include <boost/algorithm/string.hpp>
-#include <boost/foreach.hpp>
 using namespace std;
 using namespace boost::algorithm;
 using namespace SageInterface;
 
-
-#define foreach BOOST_FOREACH
-
 class TypeTraitChecker : public AstSimpleProcessing {
 private:
     bool expectedValue;
diff --git a/tests/nonsmoke/functional/roseTests/programAnalysisTests/typeTraitTests/typeTraitExerciseWithoutRetCode.C b/tests/nonsmoke/functional/roseTests/programAnalysisTests/typeTraitTests/typeTraitExerciseWithoutRetCode.C
index f86081585a1..8db6b88b028 100644
--- a/tests/nonsmoke/functional/roseTests/programAnalysisTests/typeTraitTests/typeTraitExerciseWithoutRetCode.C
+++ b/tests/nonsmoke/functional/roseTests/programAnalysisTests/typeTraitTests/typeTraitExerciseWithoutRetCode.C
@@ -8,13 +8,11 @@
 // #include <map>
 // #include <boost/tokenizer.hpp>
 // #include <boost/algorithm/string.hpp>
-// #include <boost/foreach.hpp>
 
 using namespace std;
 
 // using namespace boost::algorithm;
 // using namespace SageInterface;
-// #define foreach BOOST_FOREACH
 
 #define DEBUG_QUADRATIC_BEHAVIOR 0
 
diff --git a/tests/nonsmoke/functional/roseTests/programTransformationTests/extractFunctionArgumentsTest/NormalizationTranslator.C b/tests/nonsmoke/functional/roseTests/programTransformationTests/extractFunctionArgumentsTest/NormalizationTranslator.C
index 3b3d23c6d75..daeca8b742d 100644
--- a/tests/nonsmoke/functional/roseTests/programTransformationTests/extractFunctionArgumentsTest/NormalizationTranslator.C
+++ b/tests/nonsmoke/functional/roseTests/programTransformationTests/extractFunctionArgumentsTest/NormalizationTranslator.C
@@ -1,9 +1,7 @@
 #include "rose.h"
 #include <ExtractFunctionArguments.h>
-#include <boost/foreach.hpp>
 #include <iostream>
 
-#define foreach BOOST_FOREACH
 
 int main(int argc, char** argv)
    {
@@ -12,7 +10,7 @@ int main(int argc, char** argv)
 	AstTests::runAllTests(project);
 	
 	std::vector<SgFunctionDefinition*> functions = SageInterface::querySubTree<SgFunctionDefinition>(project, V_SgFunctionDefinition);
-	foreach(SgFunctionDefinition* function, functions)
+	for(SgFunctionDefinition* function: functions)
       {
         ExtractFunctionArguments e;
 #if 0
diff --git a/tests/nonsmoke/functional/translatorTests/testConstDeclarations.C b/tests/nonsmoke/functional/translatorTests/testConstDeclarations.C
index cc67e36d1ed..c5069b1bb52 100644
--- a/tests/nonsmoke/functional/translatorTests/testConstDeclarations.C
+++ b/tests/nonsmoke/functional/translatorTests/testConstDeclarations.C
@@ -4,7 +4,6 @@
 // directory which demonstrates input codes that demonstrate bugs in ROSE.
 
 #include "rose.h"
-#include <boost/foreach.hpp>
 
 // using namespace SageBuilder;
 // using namespace SageInterface;
@@ -17,7 +16,7 @@ main(int argc, char* argv[])
      SgProject* project = frontend(argc, argv);
 
      std::vector<SgIfStmt*> ifs = SageInterface::querySubTree<SgIfStmt>(project, V_SgIfStmt);
-     BOOST_FOREACH(SgIfStmt* if_stmt, ifs)
+     for(SgIfStmt* if_stmt: ifs)
         {
           if (SgExpression *se = isSgExprStatement(if_stmt->get_conditional())->get_expression())
              {
diff --git a/tests/nonsmoke/functional/translatorTests/testDataMemberOfConst.C b/tests/nonsmoke/functional/translatorTests/testDataMemberOfConst.C
index 3ca119d522f..987a9da11b7 100644
--- a/tests/nonsmoke/functional/translatorTests/testDataMemberOfConst.C
+++ b/tests/nonsmoke/functional/translatorTests/testDataMemberOfConst.C
@@ -1,6 +1,5 @@
 // ROSE Translator to make sure that members of const data structures are const
 #include "rose.h"
-#include <boost/foreach.hpp>
 using namespace SageBuilder;
 using namespace SageInterface;
 
@@ -12,7 +11,7 @@ int main(int argc, char* argv[])
 	SgBasicBlock* body= mainFunc->get_definition()->get_body();
 
 	std::vector<SgDotExp*> dots = SageInterface::querySubTree<SgDotExp>(body, V_SgDotExp);
-	BOOST_FOREACH(SgDotExp* dot, dots)
+	for(SgDotExp* dot: dots)
 	{
 		std::string memberName = isSgVarRefExp(dot->get_rhs_operand())->get_symbol()->get_name().getString();
 		if (memberName == "i")
diff --git a/tests/nonsmoke/functional/translatorTests/testFortranParameter.C b/tests/nonsmoke/functional/translatorTests/testFortranParameter.C
index 4b7217839ee..175c349b425 100644
--- a/tests/nonsmoke/functional/translatorTests/testFortranParameter.C
+++ b/tests/nonsmoke/functional/translatorTests/testFortranParameter.C
@@ -1,6 +1,5 @@
 // ROSE Translator to make sure that Fortran parameters come through as const
 #include "rose.h"
-#include <boost/foreach.hpp>
 using namespace SageBuilder;
 using namespace SageInterface;
 
@@ -9,7 +8,7 @@ int main(int argc, char* argv[])
 	SgProject* project = frontend(argc, argv);
 
 	std::vector<SgInitializedName*> names = SageInterface::querySubTree<SgInitializedName>(project, V_SgInitializedName);
-	BOOST_FOREACH(SgInitializedName* name, names)
+	for(SgInitializedName* name: names)
 	{
 		if (name->get_qualified_name().getString() == "pi")
 		{
diff --git a/tests/nonsmoke/functional/translatorTests/testFortranProtected.C b/tests/nonsmoke/functional/translatorTests/testFortranProtected.C
index c9c3262a49b..8f6ea90dc3c 100644
--- a/tests/nonsmoke/functional/translatorTests/testFortranProtected.C
+++ b/tests/nonsmoke/functional/translatorTests/testFortranProtected.C
@@ -1,10 +1,8 @@
 // ROSE Translator to make sure that Fortran parameters come through as const
 #include "rose.h"
-#include <boost/foreach.hpp>
 using namespace SageBuilder;
 using namespace SageInterface;
 
-#define foreach BOOST_FOREACH
 
 int main(int argc, char* argv[])
 {
@@ -13,7 +11,7 @@ int main(int argc, char* argv[])
 	std::vector<SgInitializedName*> names = SageInterface::querySubTree<SgInitializedName>(project, V_SgInitializedName);
 	std::vector<SgInitializedName*> pnames;
 
-	foreach(SgInitializedName* name, names)
+	for(SgInitializedName* name: names)
 	{
 		std::cout << name->get_qualified_name().getString();
 		if (name->get_protected_declaration())
@@ -45,7 +43,7 @@ int main(int argc, char* argv[])
 	}
 
 	std::vector<SgAssignOp*> assigns = SageInterface::querySubTree<SgAssignOp>(project);
-	foreach(SgAssignOp* op, assigns)
+	for(SgAssignOp* op: assigns)
 	{
 		SgVarRefExp* var = isSgVarRefExp(op->get_lhs_operand());
 		SgInitializedName* decl = var->get_symbol()->get_declaration();
diff --git a/tests/nonsmoke/functional/translatorTests/testTranslator2010_03.C b/tests/nonsmoke/functional/translatorTests/testTranslator2010_03.C
index 5dd776021c5..7eb649943af 100644
--- a/tests/nonsmoke/functional/translatorTests/testTranslator2010_03.C
+++ b/tests/nonsmoke/functional/translatorTests/testTranslator2010_03.C
@@ -1,5 +1,4 @@
 #include "rose.h"
-#include <boost/foreach.hpp>
 
 int main(int argc, char** argv)
    {
@@ -15,7 +14,7 @@ int main(int argc, char** argv)
      backend(project);
 
      std::vector<SgFunctionDeclaration*> functions = SageInterface::querySubTree<SgFunctionDeclaration>(project,V_SgFunctionDeclaration);
-     BOOST_FOREACH(SgFunctionDeclaration* function, functions)
+     for(SgFunctionDeclaration* function: functions)
         {
        // Process each function only once
           if (function != function->get_firstNondefiningDeclaration())
diff --git a/tools/moveDeclarationToInnermostScope.C b/tools/moveDeclarationToInnermostScope.C
index fe764080738..ea91412e3f6 100644
--- a/tools/moveDeclarationToInnermostScope.C
+++ b/tools/moveDeclarationToInnermostScope.C
@@ -94,7 +94,6 @@
 #include <iostream>
 #include <queue> // used for a worklist of declarations to be moved 
 #include <stack> // used for a worklist of declarations to be moved , first found, last processing
-#include <boost/foreach.hpp>
 #include <map> // used to store special var reference's scope
 
 // another level of control over transformation tracking code
@@ -639,7 +638,7 @@ int main(int argc, char * argv[])
       std::vector<std::string> filenames =
           GetSourceFilenamesFromCommandline(
     	  std::vector<std::string>(argv, argv + argc));
-      BOOST_FOREACH(std::string filename, filenames)
+      for(std::string filename: filenames)
       {
           std::cout << filename << std::endl;
       }
diff --git a/tutorial/ASTGraphGeneratorCustomized.C b/tutorial/ASTGraphGeneratorCustomized.C
index 66bc42451a6..00190fdc097 100644
--- a/tutorial/ASTGraphGeneratorCustomized.C
+++ b/tutorial/ASTGraphGeneratorCustomized.C
@@ -3,7 +3,6 @@
 #include "rose.h"
 #include "AstDOTGeneration.h"
 #include "utility_functions.h"
-#include <boost/foreach.hpp>
 
 struct ExtraNodeInfo
 {
diff --git a/tutorial/classHierarchyGraph.C b/tutorial/classHierarchyGraph.C
index 840e60a510f..3ae559c44ec 100644
--- a/tutorial/classHierarchyGraph.C
+++ b/tutorial/classHierarchyGraph.C
@@ -1,8 +1,6 @@
 #include "rose.h"
 #include "CallGraph.h"
-#include <boost/foreach.hpp>
 
-#define foreach BOOST_FOREACH
 
 using namespace std;
 
@@ -15,10 +13,10 @@ int main(int argc, char * argv[])
 
 	//Display the ancestors of each class
 	vector<SgClassDefinition*> allClasses = SageInterface::querySubTree<SgClassDefinition>(project, V_SgClassDefinition);
-	foreach(SgClassDefinition* classDef, allClasses)
+	for(SgClassDefinition* classDef: allClasses)
 	{
 		printf("\n%s subclasses: ", classDef->get_declaration()->get_name().str());
-		foreach(SgClassDefinition* subclass, hier.getSubclasses(classDef))
+		for(SgClassDefinition* subclass: hier.getSubclasses(classDef))
 		{
 			printf("%s, ", subclass->get_declaration()->get_name().str());
 		}

From d200a8d8c7c793ac88924e0606efde84da3fc4a0 Mon Sep 17 00:00:00 2001
From: Yonghong Yan <yanyh15@gmail.com>
Date: Fri, 29 Sep 2023 15:15:36 -0400
Subject: [PATCH 17/42] [REX]: deBoost: removing boost from autotools building,
 work-in-progress.

---
 CMakeLists.txt                                |   3 +-
 Makefile.am                                   |   7 +-
 config/Makefile.for.ROSE.includes.and.libs    |  31 +-
 config/automake_conditional_display_makefile  |  60 ----
 config/ax_boost_asio.m4                       | 103 -------
 config/ax_boost_atomic.m4                     | 106 -------
 config/ax_boost_base.m4                       | 290 ------------------
 config/ax_boost_chrono.m4                     | 123 --------
 config/ax_boost_date_time.m4                  | 105 -------
 config/ax_boost_filesystem.m4                 | 112 -------
 config/ax_boost_iostreams.m4                  | 122 --------
 config/ax_boost_program_options.m4            | 101 ------
 config/ax_boost_python.m4                     | 127 --------
 config/ax_boost_random.m4                     |  97 ------
 config/ax_boost_regex.m4                      | 106 -------
 config/ax_boost_signals.m4                    | 106 -------
 config/ax_boost_system.m4                     | 114 -------
 config/ax_boost_test_exec_monitor.m4          | 132 --------
 config/ax_boost_thread.m4                     | 148 ---------
 config/ax_boost_unit_test_framework.m4        | 130 --------
 config/ax_boost_wave.m4                       | 119 -------
 config/ax_boost_wserialization.m4             | 109 -------
 config/ax_rose_lib.m4                         | 100 ------
 config/support-blacklist.m4                   | 123 --------
 config/support-boost.m4                       | 198 ------------
 config/support-rose.m4                        |   4 -
 config/support-summary.m4                     |  23 --
 configure.ac                                  |   1 -
 rose_config.h.in.cmake                        |  31 --
 src/Makefile.am                               |  26 +-
 src/ROSETTA/src/Makefile.am                   |   7 -
 src/frontend/SageIII/Makefile.am              |   8 +-
 .../SageIII/astTokenStream/Makefile.am        |   4 +-
 src/frontend/SageIII/rose_attributes_list.C   |  18 --
 src/frontend/SageIII/rose_attributes_list.h   |  68 ----
 src/rose.h                                    |   1 -
 .../CompileTests/Cxx_tests/Makefile.am        |   8 +-
 .../CompilerOptionsTests/testWave/Makefile.am |   4 +-
 .../RunTests/FortranTests/LANL_POP/.gitignore |   2 -
 .../programAnalysisTests/Makefile.am          |   4 +-
 40 files changed, 18 insertions(+), 2963 deletions(-)
 delete mode 100644 config/ax_boost_asio.m4
 delete mode 100644 config/ax_boost_atomic.m4
 delete mode 100644 config/ax_boost_base.m4
 delete mode 100644 config/ax_boost_chrono.m4
 delete mode 100644 config/ax_boost_date_time.m4
 delete mode 100644 config/ax_boost_filesystem.m4
 delete mode 100644 config/ax_boost_iostreams.m4
 delete mode 100644 config/ax_boost_program_options.m4
 delete mode 100644 config/ax_boost_python.m4
 delete mode 100644 config/ax_boost_random.m4
 delete mode 100644 config/ax_boost_regex.m4
 delete mode 100644 config/ax_boost_signals.m4
 delete mode 100644 config/ax_boost_system.m4
 delete mode 100644 config/ax_boost_test_exec_monitor.m4
 delete mode 100644 config/ax_boost_thread.m4
 delete mode 100644 config/ax_boost_unit_test_framework.m4
 delete mode 100644 config/ax_boost_wave.m4
 delete mode 100644 config/ax_boost_wserialization.m4
 delete mode 100644 config/ax_rose_lib.m4
 delete mode 100644 config/support-blacklist.m4
 delete mode 100644 config/support-boost.m4
 delete mode 100644 tests/nonsmoke/functional/RunTests/FortranTests/LANL_POP/.gitignore

diff --git a/CMakeLists.txt b/CMakeLists.txt
index 78f99030c86..e7292b5e3fc 100644
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -24,6 +24,7 @@
 # 8. If a CMakefile file needs to be conditionally enabled, do it in that CMake file rather than around the
 #    add_subdirectory in the level above. This keeps all the logic for a directory in a single file rather than
 #    split across two files. It is a bit unfortunate that CMake can't find the lower-level CMakeList files
+
 #    on its own, so some of the logic is still necessarily in the level above.  There are exceptions to this rule,
 #    and they're pretty obvious when they occur--as when a single if() protects a whole bunch of add_subdirectory.
 
@@ -112,8 +113,6 @@ if(WIN32)
   add_definitions(-D_CRT_SECURE_NO_WARNINGS)
 endif()
 
-#add_definitions(-DBOOST_ALL_NO_LIB=1)
-
 # FIXME: Why do we have to have a copy of some standard built-in modules inside rose?
 set(CMAKE_MODULE_PATH "${CMAKE_SOURCE_DIR}/cmake" "${CMAKE_SOURCE_DIR}/cmake/modules"  ${CMAKE_MODULE_PATH})
 
diff --git a/Makefile.am b/Makefile.am
index 66d280193f5..d8cfad4cc85 100644
--- a/Makefile.am
+++ b/Makefile.am
@@ -253,12 +253,7 @@ endif
 	@echo '***** make install-data rule complete (terminated normally) *****'
 	@echo '*****************************************************************'
 
-# DQ (4/22/2005): Set this so that make distcheck will use the same 
-# --with-edg_source_code=true/false option as were used at configure.
-# JJW (5/14/2008): Add the Boost flag the same way, using an internal
-# variable from AX_BOOST_* to find the argument to --with-boost when
-# this copy of ROSE was originally configured.
-DISTCHECK_CONFIGURE_FLAGS = --with-boost=$(ac_boost_path)
+DISTCHECK_CONFIGURE_FLAGS =
 
 # DQ (7/25/2008): If ROSE was originallly configured with Fortran (by tuning 
 # on the java support) then make sure it is tested as part of the distcheck rule.
diff --git a/config/Makefile.for.ROSE.includes.and.libs b/config/Makefile.for.ROSE.includes.and.libs
index fdb844c4ba6..f7ba097ab55 100644
--- a/config/Makefile.for.ROSE.includes.and.libs
+++ b/config/Makefile.for.ROSE.includes.and.libs
@@ -32,13 +32,6 @@ if USE_ROSE_IN_BUILD_TREE_VAR
 export ROSE_IN_BUILD_TREE=$(top_builddir)
 endif
 
-# DQ (12/22/2008): Specification of Boost path for use with "-isystem" option (may be GNU
-# specific).  We use this option only if the configuration of ROSE has detected a
-# previously installed version of Boost (which we do not want to use).
-# Note that only one of these will be non-empty makefile variables.
-ROSE_BOOST_PREINCLUDE_PATH        = @ROSE_BOOST_PREINCLUDE_PATH@
-ROSE_BOOST_NORMAL_INCLUDE_PATH    = @ROSE_BOOST_NORMAL_INCLUDE_PATH@
-
 # This is properly handled by automake even when specified in an include file
 EDG_LIBS = @EDG_LIBS@
 
@@ -129,8 +122,7 @@ ROSE_INCLUDES_WITHOUT_BOOST_ISYSTEM_PATH_ROSE_USE_INTERNAL_FRONTEND_DEVELOPMENT
      -I$(top_srcdir)/src/midend/programAnalysis \
      -I$(top_srcdir)/src/3rdPartyLibraries/json \
      -I$(top_srcdir)/src/util/graphs \
-     $(ROSE_FLANG_INCLUDES) \
-     $(ROSE_BOOST_NORMAL_INCLUDE_PATH)
+     $(ROSE_FLANG_INCLUDES)
 # else # ROSE_USE_INTERNAL_FRONTEND_DEVELOPMENT
 # ROSE_INCLUDES =
 #     $(ROSE_BOOST_PREINCLUDE_PATH)
@@ -209,9 +201,7 @@ ROSE_INCLUDES_WITHOUT_BOOST_ISYSTEM_PATH = \
      -I$(top_srcdir)/src/midend/astUtil/astInterface \
      -I$(top_srcdir)/libltdl \
      $(VALGRIND_CFLAGS) \
-     $(ROSE_BOOST_NORMAL_INCLUDE_PATH) \
-     $(ROSE_PCH_INCLUDE) \
-     $(BOOST_CPPFLAGS)
+     $(ROSE_PCH_INCLUDE)
 # endif # ROSE_USE_INTERNAL_FRONTEND_DEVELOPMENT
 
 # DQ (10/23/2015): These paths have been replaces with the following variables.
@@ -223,12 +213,7 @@ ROSE_INCLUDES_WITHOUT_BOOST_ISYSTEM_PATH = \
 #    $(ROSE_CLANG_INCLUDE)
 
 SWIG_ROSE_INCLUDES = $(ROSE_INCLUDES_WITHOUT_BOOST_ISYSTEM_PATH)
-ROSE_INCLUDES = -I$(top_builddir) -I$(top_builddir)/src $(ROSE_BOOST_PREINCLUDE_PATH) $(ROSE_INCLUDES_WITHOUT_BOOST_ISYSTEM_PATH)
-
-# DQ (12/22/2008): Move Boost directory to front and used "-isystem" option so
-# that a system with a previous (older) installation of boost does not interfer
-# with the use of ROSE (and the version of boost specified using "--with-boost").
-# $(BOOST_CPPFLAGS)
+ROSE_INCLUDES = -I$(top_builddir) -I$(top_builddir)/src $(ROSE_INCLUDES_WITHOUT_BOOST_ISYSTEM_PATH)
 
 # DQ (10/28/2008): I think these should be included, I don't know why they
 # were removed (used with Microsoft Windows tests, and Yices tests).
@@ -244,17 +229,7 @@ ROSE_INCLUDES = -I$(top_builddir) -I$(top_builddir)/src $(ROSE_BOOST_PREINCLUDE_
 # JJW 7/25/2008: This should probably just be the same as ROSE_LIBS
 ROSE_LIBS_WITH_PATH = $(ROSE_LIBS)
 
-# ROSE_LIBS = $(top_builddir)/src/librose.la -lm $(LEXLIB) $(WAVE_LDFLAGS) $(WAVE_LIBRARIES) $(WAVE_LIBS) $(JAVA_JVM_LIB) $(RT_LIBS)
-
-# MS 10/19/2015: added ROSE_BOOST_LIBS variable to share exact same
-# boost libs list in ROSE an in the ROSTTA Makefiles.
-ROSE_BOOST_LIBS=$(BOOST_LDFLAGS) $(BOOST_DATE_TIME_LIB) $(BOOST_CHRONO_LIB) \
-  $(BOOST_THREAD_LIB) $(BOOST_FILESYSTEM_LIB) $(BOOST_PROGRAM_OPTIONS_LIB) \
-  $(BOOST_RANDOM_LIB) $(BOOST_REGEX_LIB)  $(BOOST_SYSTEM_LIB) $(BOOST_SERIALIZATION_LIB)  \
-  $(BOOST_WAVE_LIB) $(BOOST_IOSTREAMS_LIB) $(BOOST_ATOMIC_LIB)
-
 ROSE_LIBS = $(abspath $(top_builddir)/src/librose.la) -lm $(JAVA_JVM_LINK) \
-  $(ROSE_BOOST_LIBS) \
   $(RT_LIBS) \
   $(ROSE_INTEL_COMPILER_MATH_LIBS) \
   $(ROSE_QUAD_FLOAT_MATH)
diff --git a/config/automake_conditional_display_makefile b/config/automake_conditional_display_makefile
index 6c444c033f9..2b53c52ead1 100644
--- a/config/automake_conditional_display_makefile
+++ b/config/automake_conditional_display_makefile
@@ -159,11 +159,6 @@ if ROSE_PCH
 else
 	@echo "Automake conditional ROSE_PCH: NOT defined"
 endif
-if ROSE_USE_BOOST_WAVE
-	@echo "Automake conditional ROSE_USE_BOOST_WAVE: DEFINED"
-else
-	@echo "Automake conditional ROSE_USE_BOOST_WAVE: NOT defined"
-endif
 if ROSE_USE_GCC_OMP
 	@echo "Automake conditional ROSE_USE_GCC_OMP: DEFINED"
 else
@@ -219,61 +214,6 @@ if ROSE_USE_WGET
 else
 	@echo "Automake conditional ROSE_USE_WGET: NOT defined"
 endif
-if ROSE_USING_BOOST_VERSION_1_35
-	@echo "Automake conditional ROSE_USING_BOOST_VERSION_1_35: DEFINED"
-else
-	@echo "Automake conditional ROSE_USING_BOOST_VERSION_1_35: NOT defined"
-endif
-if ROSE_USING_BOOST_VERSION_1_36
-	@echo "Automake conditional ROSE_USING_BOOST_VERSION_1_36: DEFINED"
-else
-	@echo "Automake conditional ROSE_USING_BOOST_VERSION_1_36: NOT defined"
-endif
-if ROSE_USING_BOOST_VERSION_1_37
-	@echo "Automake conditional ROSE_USING_BOOST_VERSION_1_37: DEFINED"
-else
-	@echo "Automake conditional ROSE_USING_BOOST_VERSION_1_37: NOT defined"
-endif
-if ROSE_USING_BOOST_VERSION_1_38
-	@echo "Automake conditional ROSE_USING_BOOST_VERSION_1_38: DEFINED"
-else
-	@echo "Automake conditional ROSE_USING_BOOST_VERSION_1_38: NOT defined"
-endif
-if ROSE_USING_BOOST_VERSION_1_39
-	@echo "Automake conditional ROSE_USING_BOOST_VERSION_1_39: DEFINED"
-else
-	@echo "Automake conditional ROSE_USING_BOOST_VERSION_1_39: NOT defined"
-endif
-if ROSE_USING_BOOST_VERSION_1_40
-	@echo "Automake conditional ROSE_USING_BOOST_VERSION_1_40: DEFINED"
-else
-	@echo "Automake conditional ROSE_USING_BOOST_VERSION_1_40: NOT defined"
-endif
-if ROSE_USING_BOOST_VERSION_1_41
-	@echo "Automake conditional ROSE_USING_BOOST_VERSION_1_41: DEFINED"
-else
-	@echo "Automake conditional ROSE_USING_BOOST_VERSION_1_41: NOT defined"
-endif
-if ROSE_USING_BOOST_VERSION_1_42
-	@echo "Automake conditional ROSE_USING_BOOST_VERSION_1_42: DEFINED"
-else
-	@echo "Automake conditional ROSE_USING_BOOST_VERSION_1_42: NOT defined"
-endif
-if ROSE_USING_BOOST_VERSION_1_43
-	@echo "Automake conditional ROSE_USING_BOOST_VERSION_1_43: DEFINED"
-else
-	@echo "Automake conditional ROSE_USING_BOOST_VERSION_1_43: NOT defined"
-endif
-if ROSE_USING_BOOST_VERSION_1_44
-	@echo "Automake conditional ROSE_USING_BOOST_VERSION_1_44: DEFINED"
-else
-	@echo "Automake conditional ROSE_USING_BOOST_VERSION_1_44: NOT defined"
-endif
-if ROSE_USING_BOOST_VERSION_1_45
-	@echo "Automake conditional ROSE_USING_BOOST_VERSION_1_45: DEFINED"
-else
-	@echo "Automake conditional ROSE_USING_BOOST_VERSION_1_45: NOT defined"
-endif
 if ROSE_USING_GFORTRAN_VERSION_4_0
 	@echo "Automake conditional ROSE_USING_GFORTRAN_VERSION_4_0: DEFINED"
 else
diff --git a/config/ax_boost_asio.m4 b/config/ax_boost_asio.m4
deleted file mode 100644
index 443fec35ca5..00000000000
--- a/config/ax_boost_asio.m4
+++ /dev/null
@@ -1,103 +0,0 @@
-##### http://autoconf-archive.cryp.to/ax_boost_asio.html
-#
-# SYNOPSIS
-#
-#   AX_BOOST_ASIO
-#
-# DESCRIPTION
-#
-#   Test for Asio library from the Boost C++ libraries. The macro
-#   requires a preceding call to AX_BOOST_BASE. Further documentation
-#   is available at <http://randspringer.de/boost/index.html>.
-#
-#   This macro calls:
-#
-#     AC_SUBST(BOOST_ASIO_LIB)
-#
-#   And sets:
-#
-#     HAVE_BOOST_ASIO
-#
-# COPYLEFT
-#
-#   Copyright (c) 2007 Thomas Porschberg <thomas@randspringer.de>
-#   Copyright (c) 2007 Pete Greenwell <pete@mu.org>
-#
-#   Copying and distribution of this file, with or without
-#   modification, are permitted in any medium without royalty provided
-#   the copyright notice and this notice are preserved.
-
-AC_DEFUN([AX_BOOST_ASIO],
-[
-	AC_ARG_WITH([boost-asio],
-	AS_HELP_STRING([--with-boost-asio@<:@=special-lib@:>@],
-                   [use the ASIO library from boost - it is possible to specify a certain library for the linker
-                        e.g. --with-boost-asio=boost_system-gcc41-mt-1_34 ]),
-        [
-        if test "$withval" = "no"; then
-			want_boost="no"
-        elif test "$withval" = "yes"; then
-            want_boost="yes"
-            ax_boost_user_asio_lib=""
-        else
-		    want_boost="yes"
-        	ax_boost_user_asio_lib="$withval"
-		fi
-        ],
-        [want_boost="yes"]
-	)
-
-	if test "x$want_boost" = "xyes"; then
-        AC_REQUIRE([AC_PROG_CC])
-		CPPFLAGS_SAVED="$CPPFLAGS"
-		CPPFLAGS="$CPPFLAGS $BOOST_CPPFLAGS"
-		export CPPFLAGS
-
-		LDFLAGS_SAVED="$LDFLAGS"
-		LDFLAGS="$LDFLAGS $BOOST_LDFLAGS"
-		export LDFLAGS
-
-        AC_CACHE_CHECK(whether the Boost::ASIO library is available,
-					   ax_cv_boost_asio,
-        [AC_LANG_PUSH([C++])
-		 AC_COMPILE_IFELSE(AC_LANG_PROGRAM([[ @%:@include <boost/asio.hpp>
-											]],
-                                  [[
-
-                                    boost::asio::io_service io;
-                                    boost::system::error_code timer_result;
-                                    boost::asio::deadline_timer t(io);
-                                    t.cancel();
-                                    io.run_one();
-									return 0;
-                                   ]]),
-                             ax_cv_boost_asio=yes, ax_cv_boost_asio=no)
-         AC_LANG_POP([C++])
-		])
-		if test "x$ax_cv_boost_asio" = "xyes"; then
-			AC_DEFINE(HAVE_BOOST_ASIO,,[define if the Boost::ASIO library is available])
-			BN=boost_system
-            if test "x$ax_boost_user_asio_lib" = "x"; then
-				for ax_lib in $BN $BN-$CC $BN-$CC-mt $BN-$CC-mt-s $BN-$CC-s \
-                              lib$BN lib$BN-$CC lib$BN-$CC-mt lib$BN-$CC-mt-s lib$BN-$CC-s \
-                              $BN-mgw $BN-mgw $BN-mgw-mt $BN-mgw-mt-s $BN-mgw-s ; do
-				    AC_CHECK_LIB($ax_lib, main, [BOOST_ASIO_LIB="-l$ax_lib" AC_SUBST(BOOST_ASIO_LIB) link_thread="yes" break],
-                                 [link_thread="no"])
-  				done
-            else
-               for ax_lib in $ax_boost_user_asio_lib $BN-$ax_boost_user_asio_lib; do
-				      AC_CHECK_LIB($ax_lib, main,
-                                   [BOOST_ASIO_LIB="-l$ax_lib" AC_SUBST(BOOST_ASIO_LIB) link_asio="yes" break],
-                                   [link_asio="no"])
-                  done
-
-            fi
-			if test "x$link_asio" = "xno"; then
-				AC_MSG_ERROR([could not link against "$ax_lib"])
-			fi
-		fi
-
-		CPPFLAGS="$CPPFLAGS_SAVED"
-    	LDFLAGS="$LDFLAGS_SAVED"
-	fi
-])
diff --git a/config/ax_boost_atomic.m4 b/config/ax_boost_atomic.m4
deleted file mode 100644
index a71d0c3f4b7..00000000000
--- a/config/ax_boost_atomic.m4
+++ /dev/null
@@ -1,106 +0,0 @@
-##### http://autoconf-archive.cryp.to/ax_boost_atomic.html
-#
-# SYNOPSIS
-#
-#   AX_BOOST_ATOMIC
-#
-# DESCRIPTION
-#
-#   Test for Atomic library from the Boost C++ libraries. The macro
-#   requires a preceding call to AX_BOOST_BASE. Further documentation
-#   is available at <http://randspringer.de/boost/index.html>.
-#
-#   This macro calls:
-#
-#     AC_SUBST(BOOST_ATOMIC_LIB)
-#
-#   And sets:
-#
-#     HAVE_BOOST_ATOMIC
-#
-# COPYLEFT
-#
-#   Copyright (c) 2007 Thomas Porschberg <thomas@randspringer.de>
-#   Copyright (c) 2007 Michael Tindal
-#
-#   Copying and distribution of this file, with or without
-#   modification, are permitted in any medium without royalty provided
-#   the copyright notice and this notice are preserved.
-
-AC_DEFUN([AX_BOOST_ATOMIC],
-[
-	AC_ARG_WITH([boost-atomic],
-	     AS_HELP_STRING([--with-boost-atomic@<:@=special-lib@:>@],
-                   [use the Atomic library from boost - it is possible to specify a certain library for the linker
-                        e.g. --with-boost-atomic=boost_atomic-gcc-mt-d-1_33_1 ]),
-                   [
-                   if test "$withval" = "no"; then
-	           		want_boost="no"
-                   elif test "$withval" = "yes"; then
-                       want_boost="yes"
-                       ax_boost_user_atomic_lib=""
-                   else
-	           	    want_boost="yes"
-                   	ax_boost_user_atomic_lib="$withval"
-	           fi
-                   ],
-                   [want_boost="yes"]
-	)
-
-     if test "x$want_boost" = "xyes"; then
-         AC_REQUIRE([AC_PROG_CC])
-	 CPPFLAGS_SAVED="$CPPFLAGS"
-	 CPPFLAGS="$CPPFLAGS $BOOST_CPPFLAGS"
-	 export CPPFLAGS
-
-	 LDFLAGS_SAVED="$LDFLAGS"
-	 LDFLAGS="$LDFLAGS $BOOST_LDFLAGS"
-         export LDFLAGS
-
-         AC_CACHE_CHECK(whether the Boost::Atomic library is available,
-					   ax_cv_boost_atomic,
-                   [AC_LANG_PUSH([C++])
-           			 AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[@%:@include <boost/atomic.hpp> ]],
-                                                   [[boost::atomic<int> r; return 0;]])],
-                                                    ax_cv_boost_atomic=yes, ax_cv_boost_atomic=no)
-                    AC_LANG_POP([C++])
-		])
-
-         if test "x$ax_cv_boost_atomic" = "xyes"; then
-	        AC_DEFINE(HAVE_BOOST_ATOMIC,,[define if the Boost::Atomic library is available])
-                BOOSTLIBDIR=`echo $BOOST_LDFLAGS | sed -e 's/@<:@^\/@:>@*//'`
-
-                if test "x$ax_boost_user_atomic_lib" = "x"; then
-
-                    for libextension in `ls $BOOSTLIBDIR/libboost_atomic*.{so,dylib,a}* 2>/dev/null | sed 's,.*/,,' | sed -e 's;^lib\(boost_atomic.*\)\.so.*$;\1;' -e 's;^lib\(boost_atomic.*\)\.a*$;\1;' -e 's;^lib\(boost_atomic.*\)\.dylib$;\1;'` ; do
-                         ax_lib=${libextension}
-	                 AC_CHECK_LIB($ax_lib, toupper,
-                                     [BOOST_ATOMIC_LIB="-l$ax_lib"; AC_SUBST(BOOST_ATOMIC_LIB) link_atomic="yes"; break],
-                                     [link_atomic="no"])
-  	            done
-
-                    if test "x$link_atomic" != "xyes"; then
-                        for libextension in `ls $BOOSTLIBDIR/boost_atomic*.{dll,a}* 2>/dev/null | sed 's,.*/,,' | sed -e 's;^\(boost_atomic.*\)\.dll.*$;\1;' -e 's;^\(boost_atomic.*\)\.a*$;\1;'` ; do
-                         ax_lib=${libextension}
-	                 AC_CHECK_LIB($ax_lib, toupper,
-                                     [BOOST_ATOMIC_LIB="-l$ax_lib"; AC_SUBST(BOOST_ATOMIC_LIB) link_atomic="yes"; break],
-                                     [link_atomic="no"])
-  	                done
-                    fi
-                else
-                    for ax_lib in $ax_boost_user_atomic_lib boost_atomic-$ax_boost_user_atomic_lib; do
-	            	AC_CHECK_LIB($ax_lib, main,
-                                    [BOOST_ATOMIC_LIB="-l$ax_lib"; AC_SUBST(BOOST_ATOMIC_LIB) link_atomic="yes"; break],
-                                    [link_atomic="no"])
-                    done
-                fi
-
-	        if test "x$link_atomic" != "xyes"; then
-	            AC_MSG_ERROR([could not link against "$ax_lib"])
-                fi
-         fi
-
-         CPPFLAGS="$CPPFLAGS_SAVED"
-    	 LDFLAGS="$LDFLAGS_SAVED"
-    fi
-])
diff --git a/config/ax_boost_base.m4 b/config/ax_boost_base.m4
deleted file mode 100644
index f4a2e086e89..00000000000
--- a/config/ax_boost_base.m4
+++ /dev/null
@@ -1,290 +0,0 @@
-##### http://autoconf-archive.cryp.to/ax_boost_base.html
-#
-# SYNOPSIS
-#
-#   AX_BOOST_BASE([MINIMUM-VERSION])
-#
-# DESCRIPTION
-#
-#   Test for the Boost C++ libraries of a particular version (or newer)
-#
-#   If no path to the installed boost library is given the macro
-#   searchs under /usr, /usr/local, /opt and /opt/local and evaluates
-#   the $BOOST_ROOT environment variable. Further documentation is
-#   available at <http://randspringer.de/boost/index.html>.
-#
-#   This macro calls:
-#
-#     AC_SUBST(BOOST_CPPFLAGS) / AC_SUBST(BOOST_LDFLAGS)
-#
-#   And sets:
-#
-#     HAVE_BOOST
-#
-# COPYLEFT
-#
-#   Copyright (c) 2008 Thomas Porschberg <thomas@randspringer.de>
-#
-#   Copying and distribution of this file, with or without
-#   modification, are permitted in any medium without royalty provided
-#   the copyright notice and this notice are preserved.
-
-AC_DEFUN([AX_BOOST_BASE],
-[
-AC_ARG_WITH([boost],
-	AS_HELP_STRING([--with-boost@<:@=DIR@:>@], [use boost (default is yes) - it is possible to specify the root directory for boost (optional)]),
-	[
-    if test "$withval" = "no"; then
-		want_boost="no"
-    elif test "$withval" = "yes"; then
-        want_boost="yes"
-        ac_boost_path=""
-    else
-	    want_boost="yes"
-        ac_boost_path="$withval"
-	fi
-    ],
-    [want_boost="yes"])
-
-
-AC_ARG_WITH([boost-libdir],
-        AS_HELP_STRING([--with-boost-libdir=LIB_DIR],
-        [Force given directory for boost libraries. Note that this will overwrite library path detection, so use this parameter only if default library detection fails and you know exactly where your boost libraries are located.]),
-        [
-        if test -d $withval
-        then
-                ac_boost_lib_path="$withval"
-        else
-                AC_MSG_ERROR([--with-boost-libdir expected directory name])
-        fi
-        ],
-        [ac_boost_lib_path=""]
-)
-
-if test "x$want_boost" = "xyes"; then
-	boost_lib_version_req=ifelse([$1], ,1.20.0,$1)
-	boost_lib_version_req_shorten=`expr $boost_lib_version_req : '\([[0-9]]*\.[[0-9]]*\)'`
-	boost_lib_version_req_major=`expr $boost_lib_version_req : '\([[0-9]]*\)'`
-	boost_lib_version_req_minor=`expr $boost_lib_version_req : '[[0-9]]*\.\([[0-9]]*\)'`
-	boost_lib_version_req_sub_minor=`expr $boost_lib_version_req : '[[0-9]]*\.[[0-9]]*\.\([[0-9]]*\)'`
-	if test "x$boost_lib_version_req_sub_minor" = "x" ; then
-		boost_lib_version_req_sub_minor="0"
-    	fi
-	WANT_BOOST_VERSION=`expr $boost_lib_version_req_major \* 100000 \+  $boost_lib_version_req_minor \* 100 \+ $boost_lib_version_req_sub_minor`
-	AC_MSG_CHECKING(for boostlib >= $boost_lib_version_req)
-	succeeded=no
-
- # DQ (2/4/2010): Added to support setting Automake conditionals for boost versions.
- # export boost_lib_version_req_major
- # export boost_lib_version_req_minor
- # export boost_lib_version_req_sub_minor
-
- # echo "In ax boost base macro: boost_lib_version_req_major     = $boost_lib_version_req_major"
- # echo "In ax boost base macro: boost_lib_version_req_minor     = $boost_lib_version_req_minor"
- # echo "In ax boost base macro: boost_lib_version_req_sub_minor = $boost_lib_version_req_sub_minor"
-
-	dnl first we check the system location for boost libraries
-	dnl this location ist chosen if boost libraries are installed with the --layout=system option
-	dnl or if you install boost with RPM
-	if test "$ac_boost_path" != ""; then
-		BOOST_LDFLAGS=" -L$ac_boost_path/lib"
-		BOOST_CPPFLAGS="-I$ac_boost_path/include"
-                ROSE_BOOST_INCLUDE_PATH="$ac_boost_path/include"
-	else
-		for ac_boost_path_tmp in /usr /usr/local /opt /opt/local ; do
-			if test -d "$ac_boost_path_tmp/include/boost" && test -r "$ac_boost_path_tmp/include/boost"; then
-				BOOST_LDFLAGS="-L$ac_boost_path_tmp/lib"
-				BOOST_CPPFLAGS="-I$ac_boost_path_tmp/include"
-                                ROSE_BOOST_INCLUDE_PATH="$ac_boost_path_tmp/include"
-				break;
-			fi
-		done
-	fi
-
-# echo "WANT_BOOST_VERSION = $WANT_BOOST_VERSION"
-# echo "boost_lib_version_req = $boost_lib_version_req"
-# echo "BOOST_LDFLAGS  = $BOOST_LDFLAGS"
-# echo "BOOST_CPPFLAGS = $BOOST_CPPFLAGS"
-
-# DQ (1/1/2009): Set the default value based on BOOST_CPPFLAGS
-# Liao (1/12/2009): ac_boost_path_tmp is one of the if's branches. 
-# Moved the assignment into the two branches above
-#   ROSE_BOOST_INCLUDE_PATH="$ac_boost_path_tmp/include"
-
- # DQ (1/1/2009): Added testing for previously installed Boost (always older version)
- # so that we can trigger the use of "-isystem" option (to g++) only when required
- # (it appears to be a problem for SWIG).
- # Use this set of paths, and the set including "/home/dquinlan" for testing this macro.
- # for ac_boost_path_tmp in /usr /usr/local /opt /opt/local /home/dquinlan; do
-   for ac_boost_path_tmp in /usr /usr/local /opt /opt/local ; do
-		if test "x${ac_boost_path_tmp}/include" != "x${ROSE_BOOST_INCLUDE_PATH}" && test -d "$ac_boost_path_tmp/include/boost" && test -r "$ac_boost_path_tmp/include/boost"; then
-			PREVIOUSLY_INSTALLED_BOOST="$ac_boost_path_tmp/include/boost"
-                        AC_MSG_WARN([detected a previously installed version of boost library: "$PREVIOUSLY_INSTALLED_BOOST"])
-			break;
-		fi
-	done
-
-    dnl overwrite ld flags if we have required special directory with
-    dnl --with-boost-libdir parameter
-    if test "$ac_boost_lib_path" != ""; then
-       BOOST_LDFLAGS="-L$ac_boost_lib_path"
-    fi
-
-	CPPFLAGS_SAVED="$CPPFLAGS"
-	CPPFLAGS="$CPPFLAGS $BOOST_CPPFLAGS"
-	export CPPFLAGS
-
-	LDFLAGS_SAVED="$LDFLAGS"
-	LDFLAGS="$LDFLAGS $BOOST_LDFLAGS"
-	export LDFLAGS
-
-	AC_LANG_PUSH(C++)
-     	AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[
-	@%:@include <boost/version.hpp>
-	]], [[
-	#if BOOST_VERSION >= $WANT_BOOST_VERSION
-	// Everything is okay
-	#else
-	#  error Boost version is too old
-	#endif
-	]])],[
-        AC_MSG_RESULT(yes)
-	succeeded=yes
-	found_system=yes
-       	],[
-       	])
-	AC_LANG_POP([C++])
-
-	dnl if we found no boost with system layout we search for boost libraries
-	dnl built and installed without the --layout=system option or for a staged(not installed) version
-	if test "x$succeeded" != "xyes"; then
-		_version=0
-		if test "$ac_boost_path" != ""; then
-			if test -d "$ac_boost_path" && test -r "$ac_boost_path"; then
-				for i in `ls -d $ac_boost_path/include/boost-* 2>/dev/null`; do
-					_version_tmp=`echo $i | sed "s#$ac_boost_path##" | sed 's/\/include\/boost-//' | sed 's/_/./'`
-					V_CHECK=`expr $_version_tmp \> $_version`
-					if test "$V_CHECK" = "1" ; then
-						_version=$_version_tmp
-					fi
-					VERSION_UNDERSCORE=`echo $_version | sed 's/\./_/'`
-					BOOST_CPPFLAGS="-I$ac_boost_path/include/boost-$VERSION_UNDERSCORE"
-             # DQ (12/22/2008): Modified macro to save the boost path so that it could be used with "-isystem" option (gcc).
-					ROSE_BOOST_INCLUDE_PATH="$ac_boost_path/include/boost-$VERSION_UNDERSCORE"
-				done
-			fi
-		else
-			for ac_boost_path in /usr /usr/local /opt /opt/local ; do
-				if test -d "$ac_boost_path" && test -r "$ac_boost_path"; then
-					for i in `ls -d $ac_boost_path/include/boost-* 2>/dev/null`; do
-						_version_tmp=`echo $i | sed "s#$ac_boost_path##" | sed 's/\/include\/boost-//' | sed 's/_/./'`
-						V_CHECK=`expr $_version_tmp \> $_version`
-						if test "$V_CHECK" = "1" ; then
-							_version=$_version_tmp
-	               					best_path=$ac_boost_path
-						fi
-					done
-				fi
-			done
-
-			VERSION_UNDERSCORE=`echo $_version | sed 's/\./_/'`
-			BOOST_CPPFLAGS="-I$best_path/include/boost-$VERSION_UNDERSCORE"
-            if test "$ac_boost_lib_path" = ""
-            then
-               BOOST_LDFLAGS="-L$best_path/lib"
-            fi
-
-	    		if test "x$BOOST_ROOT" != "x"; then
-				if test -d "$BOOST_ROOT" && test -r "$BOOST_ROOT" && test -d "$BOOST_ROOT/stage/lib" && test -r "$BOOST_ROOT/stage/lib"; then
-					version_dir=`expr //$BOOST_ROOT : '.*/\(.*\)'`
-					stage_version=`echo $version_dir | sed 's/boost_//' | sed 's/_/./g'`
-			        	stage_version_shorten=`expr $stage_version : '\([[0-9]]*\.[[0-9]]*\)'`
-					V_CHECK=`expr $stage_version_shorten \>\= $_version`
-                    if test "$V_CHECK" = "1" -a "$ac_boost_lib_path" = "" ; then
-						AC_MSG_NOTICE([will use a staged boost library from $BOOST_ROOT])
-						BOOST_CPPFLAGS="-I$BOOST_ROOT"
-						BOOST_LDFLAGS="-L$BOOST_ROOT/stage/lib"
-					fi
-				fi
-	    		fi
-		fi
-
-    # DQ (12/22/2008): Fixup Boost to not use the system (OS) installation of Boost
-    # BOOST_CPPFLAGS="$BOOST_CPPFLAGS/boost"
-
-		CPPFLAGS="$CPPFLAGS $BOOST_CPPFLAGS"
-		export CPPFLAGS
-		LDFLAGS="$LDFLAGS $BOOST_LDFLAGS"
-		export LDFLAGS
-
-		AC_LANG_PUSH(C++)
-	     	AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[
-		@%:@include <boost/version.hpp>
-		]], [[
-		#if BOOST_VERSION >= $WANT_BOOST_VERSION
-		// Everything is okay
-		#else
-		#  error Boost version is too old
-		#endif
-		]])],[
-        	AC_MSG_RESULT(yes)
-		succeeded=yes
-		found_system=yes
-       		],[
-	       	])
-		AC_LANG_POP([C++])
-	fi
-
- # DQ (2/4/2010): Added to get version information for what we are using.
-   AC_MSG_NOTICE([in boost base macro -- Boost version being used is: "$_version"])
- # rose_boost_version_number=$_version
- # export rose_boost_version_number
-
-	if test "$succeeded" != "yes" ; then
-		if test "$_version" = "0" ; then
-       # This was always a confusing error message so make it more explicit for users.
-       # AC_MSG_ERROR([[We could not detect the boost libraries (version $boost_lib_version_req_shorten or higher). If you have a staged boost library (still not installed) please specify \$BOOST_ROOT in your environment and do not give a PATH to --with-boost option.  If you are sure you have boost installed, then check your version number looking in <boost/version.hpp>. See http://randspringer.de/boost for more documentation.]])
-			AC_MSG_ERROR([Boost libraries (version $boost_lib_version_req_shorten or higher) must be specified on the configure line (using the --with-boost switch) and the boost libraries must be in your LD_LIBRARY_PATH])
-		else
-			AC_MSG_FAILURE([your boost libraries seems to old (version $_version)])
-		fi
-	else
-		AC_SUBST(BOOST_CPPFLAGS)
-		AC_SUBST(BOOST_LDFLAGS)
-		AC_DEFINE(HAVE_BOOST,,[define if the Boost library is available])
-	fi
-
-        CPPFLAGS="$CPPFLAGS_SAVED"
-       	LDFLAGS="$LDFLAGS_SAVED"
-fi
-
-# DQ (12/22/2008): Modified macro to save the boost path so that it could be used with "-isystem" 
-# option to include the boost path specified on the configure command ahead of "/usr/local/include" 
-# so that we can get the required version of Boost on systems that have it installed by default.
-# echo "Final Test: ROSE_BOOST_INCLUDE_PATH = $ROSE_BOOST_INCLUDE_PATH"
-# AC_SUBST(ROSE_BOOST_INCLUDE_PATH)
-
-# DQ (1/1/2009): This use of "-isystem" is not triggered only when there is
-# a previously installed version of ROSE detected (e.g. in /usr/liclude/boost).
-# Note that use of "-isystem" option with g++ will cause SWIG to fail.
-if test "$PREVIOUSLY_INSTALLED_BOOST" != ""; then
- # echo "Using the -isystem option of g++ to force the use of the specified version of Boost ahead of a previously installed version of boost on your system at: $PREVIOUSLY_INSTALLED_BOOST"
-   AC_MSG_NOTICE(using the -isystem option of g++ to force the use of the specified version of Boost ahead of a previously installed version of boost on your system at: $PREVIOUSLY_INSTALLED_BOOST)
-   AC_MSG_WARN([--with-javaport cannot be used with the -isystem option])
-   ROSE_BOOST_PREINCLUDE_PATH="-isystem $ROSE_BOOST_INCLUDE_PATH"
-   ROSE_BOOST_NORMAL_INCLUDE_PATH=""
-   AC_MSG_WARN([detected previously installed version of boost (please remove older version of Boost before installing ROSE); continuing but expect Boost to be a problem])
- # AC_MSG_ERROR([[Detected previously installed version of boost (please remove older version of Boost before installing ROSE) (continuing but expect Boost to be a problem...)]])
- # Remove this exit (as a test) after detecting what I expect is a problem...
- # exit 1
-else
-   AC_MSG_NOTICE(no previously installed version of boost detected: using boost include directories with normal -I option)
-   ROSE_BOOST_PREINCLUDE_PATH=""
-   ROSE_BOOST_NORMAL_INCLUDE_PATH="-I$ROSE_BOOST_INCLUDE_PATH"
-fi
-
-AC_SUBST(ROSE_BOOST_PREINCLUDE_PATH)
-AC_SUBST(ROSE_BOOST_NORMAL_INCLUDE_PATH)
-
-
-])
diff --git a/config/ax_boost_chrono.m4 b/config/ax_boost_chrono.m4
deleted file mode 100644
index 619b4e8b29e..00000000000
--- a/config/ax_boost_chrono.m4
+++ /dev/null
@@ -1,123 +0,0 @@
-# ===========================================================================
-#     https://www.gnu.org/software/autoconf-archive/ax_boost_chrono.html
-# ===========================================================================
-#
-# SYNOPSIS
-#
-#   AX_BOOST_CHRONO
-#
-# DESCRIPTION
-#
-#   Test for Chrono library from the Boost C++ libraries. The macro requires
-#   a preceding call to AX_BOOST_BASE. Further documentation is available at
-#   <http://randspringer.de/boost/index.html>.
-#
-#   This macro calls:
-#
-#     AC_SUBST(BOOST_CHRONO_LIB)
-#
-#   And sets:
-#
-#     HAVE_BOOST_CHRONO
-#
-# LICENSE
-#
-#   Copyright (c) 2012 Xiyue Deng <manphiz@gmail.com>
-#
-#   Copying and distribution of this file, with or without modification, are
-#   permitted in any medium without royalty provided the copyright notice
-#   and this notice are preserved. This file is offered as-is, without any
-#   warranty.
-
-#serial 3
-
-AC_DEFUN([AX_BOOST_CHRONO],
-[
-	AC_ARG_WITH([boost-chrono],
-	AS_HELP_STRING([--with-boost-chrono@<:@=special-lib@:>@],
-                   [use the Chrono library from boost - it is possible to specify a certain library for the linker
-                        e.g. --with-boost-chrono=boost_chrono-gcc-mt ]),
-        [
-        if test "$withval" = "no"; then
-			want_boost="no"
-        elif test "$withval" = "yes"; then
-            want_boost="yes"
-            ax_boost_user_chrono_lib=""
-        else
-		    want_boost="yes"
-		ax_boost_user_chrono_lib="$withval"
-		fi
-        ],
-        [want_boost="yes"]
-	)
-
-	if test "x$want_boost" = "xyes"; then
-        AC_REQUIRE([AC_PROG_CC])
-        AC_REQUIRE([AC_CANONICAL_BUILD])
-		CPPFLAGS_SAVED="$CPPFLAGS"
-		CPPFLAGS="$CPPFLAGS $BOOST_CPPFLAGS"
-		export CPPFLAGS
-
-		LDFLAGS_SAVED="$LDFLAGS"
-		LDFLAGS="$LDFLAGS $BOOST_LDFLAGS"
-		export LDFLAGS
-
-		LIBS_SAVED="$LIBS"
-		LIBS="$LIBS $BOOST_SYSTEM_LIB $BOOST_THREAD_LIB"
-		export LIBS
-
-        AC_CACHE_CHECK(whether the Boost::Chrono library is available,
-					   ax_cv_boost_chrono,
-        [AC_LANG_PUSH([C++])
-			 CXXFLAGS_SAVE=$CXXFLAGS
-
-			 AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[@%:@include <boost/chrono.hpp>]],
-                                   [[boost::chrono::system_clock::time_point time;]])],
-                   ax_cv_boost_chrono=yes, ax_cv_boost_chrono=no)
-			 CXXFLAGS=$CXXFLAGS_SAVE
-             AC_LANG_POP([C++])
-		])
-		if test "x$ax_cv_boost_chrono" = "xyes"; then
-			AC_SUBST(BOOST_CPPFLAGS)
-
-			AC_DEFINE(HAVE_BOOST_CHRONO,,[define if the Boost::Chrono library is available])
-            BOOSTLIBDIR=`echo $BOOST_LDFLAGS | sed -e 's/@<:@^\/@:>@*//'`
-
-			LDFLAGS_SAVE=$LDFLAGS
-            if test "x$ax_boost_user_chrono_lib" = "x"; then
-                for libextension in `ls $BOOSTLIBDIR/libboost_chrono*.so* $BOOSTLIBDIR/libboost_chrono*.dylib* $BOOSTLIBDIR/libboost_chrono*.a* 2>/dev/null | sed 's,.*/,,' | sed -e 's;^lib\(boost_chrono.*\)\.so.*$;\1;' -e 's;^lib\(boost_chrono.*\)\.dylib.*$;\1;' -e 's;^lib\(boost_chrono.*\)\.a.*$;\1;'` ; do
-                     ax_lib=${libextension}
-				    AC_CHECK_LIB($ax_lib, exit,
-                                 [BOOST_CHRONO_LIB="-l$ax_lib"; AC_SUBST(BOOST_CHRONO_LIB) link_chrono="yes"; break],
-                                 [link_chrono="no"])
-				done
-                if test "x$link_chrono" != "xyes"; then
-                for libextension in `ls $BOOSTLIBDIR/boost_chrono*.dll* $BOOSTLIBDIR/boost_chrono*.a* 2>/dev/null | sed 's,.*/,,' | sed -e 's;^\(boost_chrono.*\)\.dll.*$;\1;' -e 's;^\(boost_chrono.*\)\.a.*$;\1;'` ; do
-                     ax_lib=${libextension}
-				    AC_CHECK_LIB($ax_lib, exit,
-                                 [BOOST_CHRONO_LIB="-l$ax_lib"; AC_SUBST(BOOST_CHRONO_LIB) link_chrono="yes"; break],
-                                 [link_chrono="no"])
-				done
-                fi
-
-            else
-               for ax_lib in $ax_boost_user_chrono_lib boost_chrono-$ax_boost_user_chrono_lib; do
-				      AC_CHECK_LIB($ax_lib, exit,
-                                   [BOOST_CHRONO_LIB="-l$ax_lib"; AC_SUBST(BOOST_CHRONO_LIB) link_chrono="yes"; break],
-                                   [link_chrono="no"])
-                  done
-
-            fi
-            if test "x$ax_lib" = "x"; then
-                AC_MSG_ERROR([could not find a version of the library])
-            fi
-			if test "x$link_chrono" = "xno"; then
-				AC_MSG_ERROR([could not link against "$ax_lib"])
-			fi
-		fi
-
-		CPPFLAGS="$CPPFLAGS_SAVED"
-	LDFLAGS="$LDFLAGS_SAVED"
-	LIBS="$LIBS_SAVED"
-	fi
-])
diff --git a/config/ax_boost_date_time.m4 b/config/ax_boost_date_time.m4
deleted file mode 100644
index d93840f73ee..00000000000
--- a/config/ax_boost_date_time.m4
+++ /dev/null
@@ -1,105 +0,0 @@
-##### http://autoconf-archive.cryp.to/ax_boost_date_time.html
-#
-# SYNOPSIS
-#
-#   AX_BOOST_DATE_TIME
-#
-# DESCRIPTION
-#
-#   Test for Date_Time library from the Boost C++ libraries. The macro
-#   requires a preceding call to AX_BOOST_BASE. Further documentation
-#   is available at <http://randspringer.de/boost/index.html>.
-#
-#   This macro calls:
-#
-#     AC_SUBST(BOOST_DATE_TIME_LIB)
-#
-#   And sets:
-#
-#     HAVE_BOOST_DATE_TIME
-#
-# COPYLEFT
-#
-#   Copyright (c) 2007 Thomas Porschberg <thomas@randspringer.de>
-#   Copyright (c) 2007 Michael Tindal
-#
-#   Copying and distribution of this file, with or without
-#   modification, are permitted in any medium without royalty provided
-#   the copyright notice and this notice are preserved.
-
-AC_DEFUN([AX_BOOST_DATE_TIME],
-[
-	AC_ARG_WITH([boost-date-time],
-	AS_HELP_STRING([--with-boost-date-time@<:@=special-lib@:>@],
-                   [use the Date_Time library from boost - it is possible to specify a certain library for the linker
-                        e.g. --with-boost-date-time=boost_date_time-gcc-mt-d-1_33_1 ]),
-        [
-        if test "$withval" = "no"; then
-			want_boost="no"
-        elif test "$withval" = "yes"; then
-            want_boost="yes"
-            ax_boost_user_date_time_lib=""
-        else
-		    want_boost="yes"
-        	ax_boost_user_date_time_lib="$withval"
-		fi
-        ],
-        [want_boost="yes"]
-	)
-
-	if test "x$want_boost" = "xyes"; then
-        AC_REQUIRE([AC_PROG_CC])
-		CPPFLAGS_SAVED="$CPPFLAGS"
-		CPPFLAGS="$CPPFLAGS $BOOST_CPPFLAGS"
-		export CPPFLAGS
-
-		LDFLAGS_SAVED="$LDFLAGS"
-		LDFLAGS="$LDFLAGS $BOOST_LDFLAGS"
-		export LDFLAGS
-
-        AC_CACHE_CHECK(whether the Boost::Date_Time library is available,
-					   ax_cv_boost_date_time,
-        [AC_LANG_PUSH([C++])
-		 AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[@%:@include <boost/date_time/gregorian/gregorian_types.hpp>]],
-                                   [[using namespace boost::gregorian; date d(2002,Jan,10);
-                                     return 0;
-                                   ]])],
-         ax_cv_boost_date_time=yes, ax_cv_boost_date_time=no)
-         AC_LANG_POP([C++])
-		])
-		if test "x$ax_cv_boost_date_time" = "xyes"; then
-			AC_DEFINE(HAVE_BOOST_DATE_TIME,,[define if the Boost::Date_Time library is available])
-            BOOSTLIBDIR=`echo $BOOST_LDFLAGS | sed -e 's/@<:@^\/@:>@*//'`
-            if test "x$ax_boost_user_date_time_lib" = "x"; then
-                for libextension in `ls $BOOSTLIBDIR/libboost_date_time*.{so,dylib,a}* 2>/dev/null | sed 's,.*/,,' | sed -e 's;^lib\(boost_date_time.*\)\.so.*$;\1;' -e 's;^lib\(boost_date_time.*\)\.a*$;\1;' -e 's;^lib\(boost_date_time.*\)\.dylib$;\1;'` ; do
-                     ax_lib=${libextension}
-				    AC_CHECK_LIB($ax_lib, toupper,
-                                 [BOOST_DATE_TIME_LIB="-l$ax_lib"; AC_SUBST(BOOST_DATE_TIME_LIB) link_date_time="yes"; break],
-                                 [link_date_time="no"])
-  				done
-                if test "x$link_date_time" != "xyes"; then
-                for libextension in `ls $BOOSTLIBDIR/boost_date_time*.{dll,a}* 2>/dev/null | sed 's,.*/,,' | sed -e 's;^\(boost_date_time.*\)\.dll.*$;\1;' -e 's;^\(boost_date_time.*\)\.a*$;\1;'` ; do
-                     ax_lib=${libextension}
-				    AC_CHECK_LIB($ax_lib, toupper,
-                                 [BOOST_DATE_TIME_LIB="-l$ax_lib"; AC_SUBST(BOOST_DATE_TIME_LIB) link_date_time="yes"; break],
-                                 [link_date_time="no"])
-  				done
-                fi
-
-            else
-               for ax_lib in $ax_boost_user_date_time_lib boost_date_time-$ax_boost_user_date_time_lib; do
-				      AC_CHECK_LIB($ax_lib, main,
-                                   [BOOST_DATE_TIME_LIB="-l$ax_lib"; AC_SUBST(BOOST_DATE_TIME_LIB) link_date_time="yes"; break],
-                                   [link_date_time="no"])
-                  done
-
-            fi
-			if test "x$link_date_time" != "xyes"; then
-				AC_MSG_ERROR([could not link against "$ax_lib"])
-			fi
-		fi
-
-		CPPFLAGS="$CPPFLAGS_SAVED"
-    	LDFLAGS="$LDFLAGS_SAVED"
-	fi
-])
diff --git a/config/ax_boost_filesystem.m4 b/config/ax_boost_filesystem.m4
deleted file mode 100644
index 876db4b75e4..00000000000
--- a/config/ax_boost_filesystem.m4
+++ /dev/null
@@ -1,112 +0,0 @@
-# ===========================================================================
-#          http://autoconf-archive.cryp.to/ax_boost_filesystem.html
-# ===========================================================================
-#
-# SYNOPSIS
-#
-#   AX_BOOST_FILESYSTEM
-#
-# DESCRIPTION
-#
-#   Test for Filesystem library from the Boost C++ libraries. The macro
-#   requires a preceding call to AX_BOOST_BASE. Further documentation is
-#   available at <http://randspringer.de/boost/index.html>.
-#
-#   This macro calls:
-#
-#     AC_SUBST(BOOST_FILESYSTEM_LIB)
-#
-#   And sets:
-#
-#     HAVE_BOOST_FILESYSTEM
-#
-# COPYLEFT
-#
-#   Copyright (c) 2008 Thomas Porschberg <thomas@randspringer.de>
-#   Copyright (c) 2008 Michael Tindal
-#   Copyright (c) 2008 Roman Rybalko <libtorrent@romanr.info> (using BOOST_SYSTEM_LIB)
-#
-#   Copying and distribution of this file, with or without modification, are
-#   permitted in any medium without royalty provided the copyright notice
-#   and this notice are preserved.
-
-AC_DEFUN([AX_BOOST_FILESYSTEM],
-[
-	AC_ARG_WITH([boost-filesystem],
-	AS_HELP_STRING([--with-boost-filesystem@<:@=special-lib@:>@],
-                   [use the Filesystem library from boost - it is possible to specify a certain library for the linker
-                        e.g. --with-boost-filesystem=boost_filesystem-gcc-mt ]),
-        [
-        if test "$withval" = "no"; then
-			want_boost="no"
-        elif test "$withval" = "yes"; then
-            want_boost="yes"
-            ax_boost_user_filesystem_lib=""
-        else
-		    want_boost="yes"
-        	ax_boost_user_filesystem_lib="$withval"
-		fi
-        ],
-        [want_boost="yes"]
-	)
-
-	if test "x$want_boost" = "xyes"; then
-        AC_REQUIRE([AC_PROG_CC])
-		CPPFLAGS_SAVED="$CPPFLAGS"
-		CPPFLAGS="$CPPFLAGS $BOOST_CPPFLAGS"
-		export CPPFLAGS
-
-		LDFLAGS_SAVED="$LDFLAGS"
-		LDFLAGS="$LDFLAGS $BOOST_LDFLAGS"
-		export LDFLAGS
-		
-		LIBS_SAVED=$LIBS
-		LIBS="$LIBS $BOOST_SYSTEM_LIB"
-		export LIBS
-
-        AC_CACHE_CHECK(whether the Boost::Filesystem library is available,
-					   ax_cv_boost_filesystem,
-        [AC_LANG_PUSH([C++])
-         AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[@%:@include <boost/filesystem/path.hpp>]],
-                                   [[using namespace boost::filesystem;
-                                   path my_path( "foo/bar/data.txt" );
-                                   return 0;]])],
-            				       ax_cv_boost_filesystem=yes, ax_cv_boost_filesystem=no)
-         AC_LANG_POP([C++])
-		])
-		if test "x$ax_cv_boost_filesystem" = "xyes"; then
-			AC_DEFINE(HAVE_BOOST_FILESYSTEM,,[define if the Boost::Filesystem library is available])
-            BOOSTLIBDIR=`echo $BOOST_LDFLAGS | sed -e 's/@<:@^\/@:>@*//'`
-            if test "x$ax_boost_user_filesystem_lib" = "x"; then
-                for libextension in `ls $BOOSTLIBDIR/libboost_filesystem*.{so,dylib,a}* 2>/dev/null | sed 's,.*/,,' | sed -e 's;^lib\(boost_filesystem.*\)\.so.*$;\1;' -e 's;^lib\(boost_filesystem.*\)\.a*$;\1;' -e 's;^lib\(boost_filesystem.*\)\.dylib$;\1;'` ; do
-                     ax_lib=${libextension}
-				    AC_CHECK_LIB($ax_lib, toupper,
-                                 [BOOST_FILESYSTEM_LIB="-l$ax_lib"; AC_SUBST(BOOST_FILESYSTEM_LIB) link_filesystem="yes"; break],
-                                 [link_filesystem="no"])
-  				done
-                if test "x$link_program_options" != "xyes"; then
-                for libextension in `ls $BOOSTLIBDIR/boost_filesystem*.{dll,a}* 2>/dev/null | sed 's,.*/,,' | sed -e 's;^\(boost_filesystem.*\)\.dll.*$;\1;' -e 's;^\(boost_filesystem.*\)\.a*$;\1;'` ; do
-                     ax_lib=${libextension}
-				    AC_CHECK_LIB($ax_lib, toupper,
-                                 [BOOST_FILESYSTEM_LIB="-l$ax_lib"; AC_SUBST(BOOST_FILESYSTEM_LIB) link_filesystem="yes"; break],
-                                 [link_filesystem="no"])
-  				done
-	            fi
-            else
-               for ax_lib in $ax_boost_user_filesystem_lib boost_filesystem-$ax_boost_user_filesystem_lib; do
-				      AC_CHECK_LIB($ax_lib, toupper,
-                                   [BOOST_FILESYSTEM_LIB="-l$ax_lib"; AC_SUBST(BOOST_FILESYSTEM_LIB) link_filesystem="yes"; break],
-                                   [link_filesystem="no"])
-                  done
-
-            fi
-			if test "x$link_filesystem" != "xyes"; then
-				AC_MSG_ERROR([could not link against "$ax_lib"])
-			fi
-		fi
-
-		CPPFLAGS="$CPPFLAGS_SAVED"
-    		LDFLAGS="$LDFLAGS_SAVED"
-		LIBS="$LIBS_SAVED"
-	fi
-])
diff --git a/config/ax_boost_iostreams.m4 b/config/ax_boost_iostreams.m4
deleted file mode 100644
index 9cfe0904694..00000000000
--- a/config/ax_boost_iostreams.m4
+++ /dev/null
@@ -1,122 +0,0 @@
-##### http://autoconf-archive.cryp.to/ax_boost_iostreams.html
-#
-# SYNOPSIS
-#
-#   AX_BOOST_IOSTREAMS
-#
-# DESCRIPTION
-#
-#   Test for IOStreams library from the Boost C++ libraries. The macro
-#   requires a preceding call to AX_BOOST_BASE. Further documentation
-#   is available at <http://randspringer.de/boost/index.html>.
-#
-#   This macro calls:
-#
-#     AC_SUBST(BOOST_IOSTREAMS_LIB)
-#
-#   And sets:
-#
-#     HAVE_BOOST_IOSTREAMS
-#
-# COPYLEFT
-#
-#   Copyright (c) 2007 Thomas Porschberg <thomas@randspringer.de>
-#
-#   Copying and distribution of this file, with or without
-#   modification, are permitted in any medium without royalty provided
-#   the copyright notice and this notice are preserved.
-#
-# MODIFIED
-#  Robb Matzke, 2015-01: fixed indentation
-#  Robb Matzke, 2015-01: fixed message about "library not found" when it's the headers that aren't found
-#  Robb Matzke, 2015-01: it is not an error for the iostreams library to be missing when headers are present
-#  Robb Matzke, 2015-01: replaced test .C file with mapped_file_params since that's what ROSE needs from iostreams
-
-AC_DEFUN([AX_BOOST_IOSTREAMS],
-[
-    AC_ARG_WITH([boost-iostreams],
-        AS_HELP_STRING([--with-boost-iostreams@<:@=special-lib@:>@],
-            [use the IOStreams library from boost - it is possible to specify a certain library for the linker
-                        e.g. --with-boost-iostreams=boost_iostreams-gcc-mt-d-1_33_1 ]),
-        [
-            if test "$withval" = "no"; then
-                want_boost="no"
-            elif test "$withval" = "yes"; then
-                want_boost="yes"
-                ax_boost_user_iostreams_lib=""
-            else
-                want_boost="yes"
-                ax_boost_user_iostreams_lib="$withval"
-            fi
-        ],
-        [want_boost="yes"]
-    )
-
-    if test "x$want_boost" = "xyes"; then
-        AC_REQUIRE([AC_PROG_CC])
-        CPPFLAGS_SAVED="$CPPFLAGS"
-        CPPFLAGS="$CPPFLAGS $BOOST_CPPFLAGS"
-        export CPPFLAGS
-
-        LDFLAGS_SAVED="$LDFLAGS"
-        LDFLAGS="$LDFLAGS $BOOST_LDFLAGS"
-        export LDFLAGS
-
-        AC_CACHE_CHECK([whether the boost::iostreams headers are available],
-            ax_cv_boost_iostreams,
-            [
-                AC_LANG_PUSH([C++])
-                AC_COMPILE_IFELSE(
-                    [AC_LANG_PROGRAM(
-                        [[
-                            @%:@include <boost/iostreams/device/mapped_file.hpp>
-                        ]],
-                        [[
-                            boost::iostreams::mapped_file_params params;
-                            boost::iostreams::mapped_file f(params);
-                            f.const_data();
-                            return 0;
-                        ]])],
-                    ax_cv_boost_iostreams=yes,
-                    ax_cv_boost_iostreams=no)
-                AC_LANG_POP([C++])
-            ])
-
-
-        if test "x$ax_cv_boost_iostreams" = "xyes"; then
-            AC_DEFINE(HAVE_BOOST_IOSTREAMS,,[define if the Boost::IOStreams library is available])
-            BOOSTLIBDIR=`echo $BOOST_LDFLAGS | sed -e 's/@<:@^\/@:>@*//'`
-            if test "x$ax_boost_user_iostreams_lib" = "x"; then
-                for libextension in `ls $BOOSTLIBDIR/libboost_iostreams*.{so,dylib,a}* 2>/dev/null | sed 's,.*/,,' | sed -e 's;^lib\(boost_iostreams.*\)\.so.*$;\1;' -e 's;^lib\(boost_iostreams.*\)\.a*$;\1;' -e 's;^lib\(boost_iostreams.*\)\.dylib$;\1;'` ; do
-                    ax_lib=${libextension}
-                    AC_CHECK_LIB($ax_lib, toupper,
-                        [BOOST_IOSTREAMS_LIB="-l$ax_lib"; AC_SUBST(BOOST_IOSTREAMS_LIB) link_iostreams="yes"; break],
-                        [link_iostreams="no"])
-                done
-
-                if test "x$link_iostreams" != "xyes"; then
-                    for libextension in `ls $BOOSTLIBDIR/boost_iostreams*.{dll,a}* 2>/dev/null | sed 's,.*/,,' | sed -e 's;^\(boost_iostreams.*\)\.dll.*$;\1;' -e 's;^\(boost_iostreams.*\)\.a*$;\1;'` ; do
-                        ax_lib=${libextension}
-                        AC_CHECK_LIB($ax_lib, toupper,
-                            [BOOST_IOSTREAMS_LIB="-l$ax_lib"; AC_SUBST(BOOST_IOSTREAMS_LIB) link_iostreams="yes"; break],
-                            [link_iostreams="no"])
-                    done
-                fi
-            else
-                for ax_lib in $ax_boost_user_iostreams_lib boost_iostreams-$ax_boost_user_iostreams_lib; do
-                    AC_CHECK_LIB($ax_lib, main,
-                        [BOOST_IOSTREAMS_LIB="-l$ax_lib"; AC_SUBST(BOOST_IOSTREAMS_LIB) link_iostreams="yes"; break],
-                        [link_iostreams="no"])
-                done
-            fi
-            
-            dnl Failing to link against libiostreams should not be an error here; perhaps at a higher level it is.
-            if test "x$link_iostreams" != "xyes"; then
-                AC_MSG_NOTICE([boost::iostreams headers are available, but not the library])
-            fi
-        fi
-
-        CPPFLAGS="$CPPFLAGS_SAVED"
-        LDFLAGS="$LDFLAGS_SAVED"
-    fi
-])
diff --git a/config/ax_boost_program_options.m4 b/config/ax_boost_program_options.m4
deleted file mode 100644
index 8143e57ece7..00000000000
--- a/config/ax_boost_program_options.m4
+++ /dev/null
@@ -1,101 +0,0 @@
-##### http://autoconf-archive.cryp.to/ax_boost_program_options.html
-#
-# SYNOPSIS
-#
-#   AX_BOOST_PROGRAM_OPTIONS
-#
-# DESCRIPTION
-#
-#   Test for program options library from the Boost C++ libraries. The
-#   macro requires a preceding call to AX_BOOST_BASE. Further
-#   documentation is available at
-#   <http://randspringer.de/boost/index.html>.
-#
-#   This macro calls:
-#
-#     AC_SUBST(BOOST_PROGRAM_OPTIONS_LIB)
-#
-#   And sets:
-#
-#     HAVE_BOOST_PROGRAM_OPTIONS
-#
-# COPYLEFT
-#
-#   Copyright (c) 2007 Thomas Porschberg <thomas@randspringer.de>
-#
-#   Copying and distribution of this file, with or without
-#   modification, are permitted in any medium without royalty provided
-#   the copyright notice and this notice are preserved.
-
-AC_DEFUN([AX_BOOST_PROGRAM_OPTIONS],
-[
-	AC_ARG_WITH([boost-program-options],
-		AS_HELP_STRING([--with-boost-program-options@<:@=special-lib@:>@],
-                       [use the program options library from boost - it is possible to specify a certain library for the linker
-                        e.g. --with-boost-program-options=boost_program_options-gcc-mt-1_33_1 ]),
-        [
-        if test "$withval" = "no"; then
-			want_boost="no"
-        elif test "$withval" = "yes"; then
-            want_boost="yes"
-            ax_boost_user_program_options_lib=""
-        else
-		    want_boost="yes"
-        	ax_boost_user_program_options_lib="$withval"
-		fi
-        ],
-        [want_boost="yes"]
-	)
-
-	if test "x$want_boost" = "xyes"; then
-        AC_REQUIRE([AC_PROG_CC])
-	    export want_boost
-		CPPFLAGS_SAVED="$CPPFLAGS"
-		CPPFLAGS="$CPPFLAGS $BOOST_CPPFLAGS"
-		export CPPFLAGS
-		LDFLAGS_SAVED="$LDFLAGS"
-		LDFLAGS="$LDFLAGS $BOOST_LDFLAGS"
-		export LDFLAGS
-		AC_CACHE_CHECK([whether the Boost::Program_Options library is available],
-					   ax_cv_boost_program_options,
-					   [AC_LANG_PUSH(C++)
- 		                AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[@%:@include <boost/program_options.hpp>
-                                                          ]],
-                                  [[boost::program_options::options_description generic("Generic options");
-                                   return 0;]])],
-                           ax_cv_boost_program_options=yes, ax_cv_boost_program_options=no)
-			               	AC_LANG_POP([C++])
-		])
-		if test "$ax_cv_boost_program_options" = yes; then
-				AC_DEFINE(HAVE_BOOST_PROGRAM_OPTIONS,,[define if the Boost::PROGRAM_OPTIONS library is available])
-                  BOOSTLIBDIR=`echo $BOOST_LDFLAGS | sed -e 's/@<:@^\/@:>@*//'`
-                if test "x$ax_boost_user_program_options_lib" = "x"; then
-                for libextension in `ls $BOOSTLIBDIR/libboost_program_options*.{so,dylib,a}* 2>/dev/null | sed 's,.*/,,' | sed -e 's;^lib\(boost_program_options.*\)\.so.*$;\1;' -e 's;^lib\(boost_program_options.*\)\.a*$;\1;' -e 's;^lib\(boost_program_options.*\)\.dylib$;\1;'` ; do
-                     ax_lib=${libextension}
-				    AC_CHECK_LIB($ax_lib, toupper,
-                                 [BOOST_PROGRAM_OPTIONS_LIB="-l$ax_lib"; AC_SUBST(BOOST_PROGRAM_OPTIONS_LIB) link_program_options="yes"; break],
-                                 [link_program_options="no"])
-  				done
-                if test "x$link_program_options" != "xyes"; then
-                for libextension in `ls $BOOSTLIBDIR/boost_program_options*.{dll,a}* 2>/dev/null | sed 's,.*/,,' | sed -e 's;^\(boost_program_options.*\)\.dll.*$;\1;' -e 's;^\(boost_program_options.*\)\.a*$;\1;'` ; do
-                     ax_lib=${libextension}
-				    AC_CHECK_LIB($ax_lib, toupper,
-                                 [BOOST_PROGRAM_OPTIONS_LIB="-l$ax_lib"; AC_SUBST(BOOST_PROGRAM_OPTIONS_LIB) link_program_options="yes"; break],
-                                 [link_program_options="no"])
-  				done
-                fi
-                else
-                  for ax_lib in $ax_boost_user_program_options_lib boost_program_options-$ax_boost_user_program_options_lib; do
-				      AC_CHECK_LIB($ax_lib, main,
-                                   [BOOST_PROGRAM_OPTIONS_LIB="-l$ax_lib"; AC_SUBST(BOOST_PROGRAM_OPTIONS_LIB) link_program_options="yes"; break],
-                                   [link_program_options="no"])
-                  done
-                fi
-				if test "x$link_program_options" != "xyes"; then
-					AC_MSG_ERROR([could not link against "$ax_lib"])
-				fi
-		fi
-		CPPFLAGS="$CPPFLAGS_SAVED"
-    	LDFLAGS="$LDFLAGS_SAVED"
-	fi
-])
diff --git a/config/ax_boost_python.m4 b/config/ax_boost_python.m4
deleted file mode 100644
index c2d56e65b1d..00000000000
--- a/config/ax_boost_python.m4
+++ /dev/null
@@ -1,127 +0,0 @@
-# Copied and modified from ax_boost_chrono with ROSE-specific changes.
-#
-# SYNOPSIS
-#
-#   AX_BOOST_PYTHON
-#
-# DESCRIPTION
-#
-#   Test for Python library from the Boost C++ libraries. The macro requires
-#   a preceding call to AX_BOOST_BASE. Further documentation is available at
-#   <http://randspringer.de/boost/index.html>.
-#
-#   This macro calls:
-#
-#     AC_SUBST(BOOST_PYTHON_LIB)
-#
-#   And sets:
-#
-#     HAVE_BOOST_PYTHON
-#
-# LICENSE
-#
-#   Copyright (c) 2012 Xiyue Deng <manphiz@gmail.com>
-#
-#   Copying and distribution of this file, with or without modification, are
-#   permitted in any medium without royalty provided the copyright notice
-#   and this notice are preserved. This file is offered as-is, without any
-#   warranty.
-
-#serial 3
-
-AC_DEFUN([AX_BOOST_PYTHON],
-[
-    AC_ARG_WITH([boost-python],
-    AS_HELP_STRING([--with-boost-python@<:@=special-lib@:>@],
-        [use the Python library from boost - it is possible to specify a certain library for the linker
-         e.g. --with-boost-python=boost_python-gcc-mt ]),
-        [
-            if test "$withval" = "no"; then
-                want_boost="no"
-            elif test "$withval" = "yes"; then
-                want_boost="yes"
-                ax_boost_user_python_lib=""
-            else
-                want_boost="yes"
-                ax_boost_user_python_lib="$withval"
-            fi
-        ],
-        [want_boost="yes"])
-
-    if test "x$want_boost" = "xyes"; then
-        AC_REQUIRE([AC_PROG_CC])
-        AC_REQUIRE([AC_CANONICAL_BUILD])
-        CPPFLAGS_SAVED="$CPPFLAGS"
-        CPPFLAGS="$CPPFLAGS $BOOST_CPPFLAGS"
-        export CPPFLAGS
-
-        LDFLAGS_SAVED="$LDFLAGS"
-        LDFLAGS="$LDFLAGS $BOOST_LDFLAGS"
-        export LDFLAGS
-
-        LIBS_SAVED="$LIBS"
-        LIBS="$LIBS $BOOST_SYSTEM_LIB $BOOST_THREAD_LIB"
-        export LIBS
-
-        AC_CACHE_CHECK([whether the Boost::Python library is available], ax_cv_boost_python,
-            [
-                AC_LANG_PUSH([C++])
-                    CXXFLAGS_SAVE=$CXXFLAGS
-
-                    AC_COMPILE_IFELSE(
-                        [AC_LANG_PROGRAM([[@%:@include <boost/python.hpp>]], [[int dummy;]])],
-                        ax_cv_boost_python=yes,
-                        ax_cv_boost_python=no)
-                    CXXFLAGS=$CXXFLAGS_SAVE
-                AC_LANG_POP([C++])
-            ])
-
-        if test "x$ax_cv_boost_python" = "xyes"; then
-            AC_SUBST(BOOST_CPPFLAGS)
-
-            AC_DEFINE(HAVE_BOOST_PYTHON,,[define if the Boost::Python library is available])
-            BOOSTLIBDIR=`echo $BOOST_LDFLAGS | sed -e 's/@<:@^\/@:>@*//'`
-
-            LDFLAGS_SAVE=$LDFLAGS
-            if test "x$ax_boost_user_python_lib" = "x"; then
-                for libextension in `ls $BOOSTLIBDIR/libboost_python*.so* $BOOSTLIBDIR/libboost_python*.dylib* $BOOSTLIBDIR/libboost_python*.a* 2>/dev/null |\
-                                     sed 's,.*/,,' |\
-                                     sed -e 's;^lib\(boost_python.*\)\.so.*$;\1;' -e 's;^lib\(boost_python.*\)\.dylib.*$;\1;' -e 's;^lib\(boost_python.*\)\.a.*$;\1;'` ; do
-                    ax_lib=${libextension}
-                    AC_CHECK_LIB($ax_lib, exit,
-                        [BOOST_PYTHON_LIB="-l$ax_lib"; AC_SUBST(BOOST_PYTHON_LIB) link_python="yes"; break],
-                        [link_python="no"])
-                done
-
-                if test "x$link_python" != "xyes"; then
-                    for libextension in `ls $BOOSTLIBDIR/boost_python*.dll* $BOOSTLIBDIR/boost_python*.a* 2>/dev/null |\
-                                         sed 's,.*/,,' |\
-                                         sed -e 's;^\(boost_python.*\)\.dll.*$;\1;' -e 's;^\(boost_python.*\)\.a.*$;\1;'` ; do
-                        ax_lib=${libextension}
-                        AC_CHECK_LIB($ax_lib, exit,
-                            [BOOST_PYTHON_LIB="-l$ax_lib"; AC_SUBST(BOOST_PYTHON_LIB) link_python="yes"; break],
-                            [link_python="no"])
-                    done
-                fi
-            else
-                for ax_lib in $ax_boost_user_python_lib boost_python-$ax_boost_user_python_lib; do
-                    AC_CHECK_LIB($ax_lib, exit,
-                        [BOOST_PYTHON_LIB="-l$ax_lib"; AC_SUBST(BOOST_PYTHON_LIB) link_python="yes"; break],
-                        [link_python="no"])
-                done
-            fi
-
-            if test "x$ax_lib" = "x"; then
-                AC_MSG_ERROR([could not find a version of the library])
-            fi
-
-            if test "x$link_python" = "xno"; then
-                AC_MSG_ERROR([could not link against "$ax_lib"])
-            fi
-        fi
-
-        CPPFLAGS="$CPPFLAGS_SAVED"
-        LDFLAGS="$LDFLAGS_SAVED"
-        LIBS="$LIBS_SAVED"
-    fi
-])
diff --git a/config/ax_boost_random.m4 b/config/ax_boost_random.m4
deleted file mode 100644
index a8e1a33ee32..00000000000
--- a/config/ax_boost_random.m4
+++ /dev/null
@@ -1,97 +0,0 @@
-# Cut-n-pasted from boost_chrono.m4 instead of downloading from the original
-# location, in order to preserve any local bug fixes already applied by the
-# ROSE team to the boost_chrono detection.  All instances of "chrono" were
-# then replaced by "random" (preserving capitalizations) and a single occurrence
-# of "boost::chrono::system_clock::time_point time" was replaced by a suitable
-# type from boost::random.
-
-AC_DEFUN([AX_BOOST_RANDOM],
-[
-	AC_ARG_WITH([boost-random],
-	AS_HELP_STRING([--with-boost-random@<:@=special-lib@:>@],
-                   [use the Random library from boost - it is possible to specify a certain library for the linker
-                        e.g. --with-boost-random=boost_random-gcc-mt ]),
-        [
-        if test "$withval" = "no"; then
-			want_boost="no"
-        elif test "$withval" = "yes"; then
-            want_boost="yes"
-            ax_boost_user_random_lib=""
-        else
-		    want_boost="yes"
-		ax_boost_user_random_lib="$withval"
-		fi
-        ],
-        [want_boost="yes"]
-	)
-
-	if test "x$want_boost" = "xyes"; then
-        AC_REQUIRE([AC_PROG_CC])
-        AC_REQUIRE([AC_CANONICAL_BUILD])
-		CPPFLAGS_SAVED="$CPPFLAGS"
-		CPPFLAGS="$CPPFLAGS $BOOST_CPPFLAGS"
-		export CPPFLAGS
-
-		LDFLAGS_SAVED="$LDFLAGS"
-		LDFLAGS="$LDFLAGS $BOOST_LDFLAGS"
-		export LDFLAGS
-
-		LIBS_SAVED="$LIBS"
-		LIBS="$LIBS $BOOST_SYSTEM_LIB $BOOST_THREAD_LIB"
-		export LIBS
-
-        AC_CACHE_CHECK(whether the Boost::Random library is available,
-					   ax_cv_boost_random,
-        [AC_LANG_PUSH([C++])
-			 CXXFLAGS_SAVE=$CXXFLAGS
-
-			 AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[@%:@include <boost/random.hpp>]],
-                                   [[boost::random::mt19937 rng;]])],
-                   ax_cv_boost_random=yes, ax_cv_boost_random=no)
-			 CXXFLAGS=$CXXFLAGS_SAVE
-             AC_LANG_POP([C++])
-		])
-		if test "x$ax_cv_boost_random" = "xyes"; then
-			AC_SUBST(BOOST_CPPFLAGS)
-
-			AC_DEFINE(HAVE_BOOST_RANDOM,,[define if the Boost::Random library is available])
-            BOOSTLIBDIR=`echo $BOOST_LDFLAGS | sed -e 's/@<:@^\/@:>@*//'`
-
-			LDFLAGS_SAVE=$LDFLAGS
-            if test "x$ax_boost_user_random_lib" = "x"; then
-                for libextension in `ls $BOOSTLIBDIR/libboost_random*.so* $BOOSTLIBDIR/libboost_random*.dylib* $BOOSTLIBDIR/libboost_random*.a* 2>/dev/null | sed 's,.*/,,' | sed -e 's;^lib\(boost_random.*\)\.so.*$;\1;' -e 's;^lib\(boost_random.*\)\.dylib.*$;\1;' -e 's;^lib\(boost_random.*\)\.a.*$;\1;'` ; do
-                     ax_lib=${libextension}
-				    AC_CHECK_LIB($ax_lib, exit,
-                                 [BOOST_RANDOM_LIB="-l$ax_lib"; AC_SUBST(BOOST_RANDOM_LIB) link_random="yes"; break],
-                                 [link_random="no"])
-				done
-                if test "x$link_random" != "xyes"; then
-                for libextension in `ls $BOOSTLIBDIR/boost_random*.dll* $BOOSTLIBDIR/boost_random*.a* 2>/dev/null | sed 's,.*/,,' | sed -e 's;^\(boost_random.*\)\.dll.*$;\1;' -e 's;^\(boost_random.*\)\.a.*$;\1;'` ; do
-                     ax_lib=${libextension}
-				    AC_CHECK_LIB($ax_lib, exit,
-                                 [BOOST_RANDOM_LIB="-l$ax_lib"; AC_SUBST(BOOST_RANDOM_LIB) link_random="yes"; break],
-                                 [link_random="no"])
-				done
-                fi
-
-            else
-               for ax_lib in $ax_boost_user_random_lib boost_random-$ax_boost_user_random_lib; do
-				      AC_CHECK_LIB($ax_lib, exit,
-                                   [BOOST_RANDOM_LIB="-l$ax_lib"; AC_SUBST(BOOST_RANDOM_LIB) link_random="yes"; break],
-                                   [link_random="no"])
-                  done
-
-            fi
-            if test "x$ax_lib" = "x"; then
-                AC_MSG_ERROR([could not find a version of the library])
-            fi
-			if test "x$link_random" = "xno"; then
-				AC_MSG_ERROR([could not link against "$ax_lib"])
-			fi
-		fi
-
-		CPPFLAGS="$CPPFLAGS_SAVED"
-	LDFLAGS="$LDFLAGS_SAVED"
-	LIBS="$LIBS_SAVED"
-	fi
-])
diff --git a/config/ax_boost_regex.m4 b/config/ax_boost_regex.m4
deleted file mode 100644
index 9a44203cfeb..00000000000
--- a/config/ax_boost_regex.m4
+++ /dev/null
@@ -1,106 +0,0 @@
-##### http://autoconf-archive.cryp.to/ax_boost_regex.html
-#
-# SYNOPSIS
-#
-#   AX_BOOST_REGEX
-#
-# DESCRIPTION
-#
-#   Test for Regex library from the Boost C++ libraries. The macro
-#   requires a preceding call to AX_BOOST_BASE. Further documentation
-#   is available at <http://randspringer.de/boost/index.html>.
-#
-#   This macro calls:
-#
-#     AC_SUBST(BOOST_REGEX_LIB)
-#
-#   And sets:
-#
-#     HAVE_BOOST_REGEX
-#
-# COPYLEFT
-#
-#   Copyright (c) 2007 Thomas Porschberg <thomas@randspringer.de>
-#   Copyright (c) 2007 Michael Tindal
-#
-#   Copying and distribution of this file, with or without
-#   modification, are permitted in any medium without royalty provided
-#   the copyright notice and this notice are preserved.
-
-AC_DEFUN([AX_BOOST_REGEX],
-[
-	AC_ARG_WITH([boost-regex],
-	     AS_HELP_STRING([--with-boost-regex@<:@=special-lib@:>@],
-                   [use the Regex library from boost - it is possible to specify a certain library for the linker
-                        e.g. --with-boost-regex=boost_regex-gcc-mt-d-1_33_1 ]),
-                   [
-                   if test "$withval" = "no"; then
-	           		want_boost="no"
-                   elif test "$withval" = "yes"; then
-                       want_boost="yes"
-                       ax_boost_user_regex_lib=""
-                   else
-	           	    want_boost="yes"
-                   	ax_boost_user_regex_lib="$withval"
-	           fi
-                   ],
-                   [want_boost="yes"]
-	)
-
-     if test "x$want_boost" = "xyes"; then
-         AC_REQUIRE([AC_PROG_CC])
-	 CPPFLAGS_SAVED="$CPPFLAGS"
-	 CPPFLAGS="$CPPFLAGS $BOOST_CPPFLAGS"
-	 export CPPFLAGS
-
-	 LDFLAGS_SAVED="$LDFLAGS"
-	 LDFLAGS="$LDFLAGS $BOOST_LDFLAGS"
-         export LDFLAGS
-
-         AC_CACHE_CHECK(whether the Boost::Regex library is available,
-					   ax_cv_boost_regex,
-                   [AC_LANG_PUSH([C++])
-           			 AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[@%:@include <boost/regex.hpp> ]],
-                                                   [[boost::regex r(); return 0;]])],
-                                                    ax_cv_boost_regex=yes, ax_cv_boost_regex=no)
-                    AC_LANG_POP([C++])
-		])
-
-         if test "x$ax_cv_boost_regex" = "xyes"; then
-	        AC_DEFINE(HAVE_BOOST_REGEX,,[define if the Boost::Regex library is available])
-                BOOSTLIBDIR=`echo $BOOST_LDFLAGS | sed -e 's/@<:@^\/@:>@*//'`
-
-                if test "x$ax_boost_user_regex_lib" = "x"; then
-
-                    for libextension in `ls $BOOSTLIBDIR/libboost_regex*.{so,dylib,a}* 2>/dev/null | sed 's,.*/,,' | sed -e 's;^lib\(boost_regex.*\)\.so.*$;\1;' -e 's;^lib\(boost_regex.*\)\.a*$;\1;' -e 's;^lib\(boost_regex.*\)\.dylib$;\1;'` ; do
-                         ax_lib=${libextension}
-	                 AC_CHECK_LIB($ax_lib, toupper,
-                                     [BOOST_REGEX_LIB="-l$ax_lib"; AC_SUBST(BOOST_REGEX_LIB) link_regex="yes"; break],
-                                     [link_regex="no"])
-  	            done
-
-                    if test "x$link_regex" != "xyes"; then
-                        for libextension in `ls $BOOSTLIBDIR/boost_regex*.{dll,a}* 2>/dev/null | sed 's,.*/,,' | sed -e 's;^\(boost_regex.*\)\.dll.*$;\1;' -e 's;^\(boost_regex.*\)\.a*$;\1;'` ; do
-                         ax_lib=${libextension}
-	                 AC_CHECK_LIB($ax_lib, toupper,
-                                     [BOOST_REGEX_LIB="-l$ax_lib"; AC_SUBST(BOOST_REGEX_LIB) link_regex="yes"; break],
-                                     [link_regex="no"])
-  	                done
-                    fi
-                else
-                    for ax_lib in $ax_boost_user_regex_lib boost_regex-$ax_boost_user_regex_lib; do
-	            	AC_CHECK_LIB($ax_lib, main,
-                                    [BOOST_REGEX_LIB="-l$ax_lib"; AC_SUBST(BOOST_REGEX_LIB) link_regex="yes"; break],
-                                    [link_regex="no"])
-                    done
-                fi
-
-	        if test "x$link_regex" != "xyes"; then
-	            AC_MSG_ERROR([could not link against "$ax_lib"])
-                fi
-         fi
-
-         CPPFLAGS="$CPPFLAGS_SAVED"
-    	 LDFLAGS="$LDFLAGS_SAVED"
-    fi
-])
diff --git a/config/ax_boost_signals.m4 b/config/ax_boost_signals.m4
deleted file mode 100644
index ef1dd4a24bd..00000000000
--- a/config/ax_boost_signals.m4
+++ /dev/null
@@ -1,106 +0,0 @@
-##### http://autoconf-archive.cryp.to/ax_boost_signals.html
-#
-# SYNOPSIS
-#
-#   AX_BOOST_SIGNALS
-#
-# DESCRIPTION
-#
-#   Test for Signals library from the Boost C++ libraries. The macro
-#   requires a preceding call to AX_BOOST_BASE. Further documentation
-#   is available at <http://randspringer.de/boost/index.html>.
-#
-#   This macro calls:
-#
-#     AC_SUBST(BOOST_SIGNALS_LIB)
-#
-#   And sets:
-#
-#     HAVE_BOOST_SIGNALS
-#
-# COPYLEFT
-#
-#   Copyright (c) 2007 Thomas Porschberg <thomas@randspringer.de>
-#   Copyright (c) 2007 Michael Tindal
-#
-#   Copying and distribution of this file, with or without
-#   modification, are permitted in any medium without royalty provided
-#   the copyright notice and this notice are preserved.
-
-AC_DEFUN([AX_BOOST_SIGNALS],
-[
-	AC_ARG_WITH([boost-signals],
-	AS_HELP_STRING([--with-boost-signals@<:@=special-lib@:>@],
-                   [use the Signals library from boost - it is possible to specify a certain library for the linker
-                        e.g. --with-boost-signals=boost_signals-gcc-mt-d ]),
-        [
-        if test "$withval" = "no"; then
-			want_boost="no"
-        elif test "$withval" = "yes"; then
-            want_boost="yes"
-            ax_boost_user_signals_lib=""
-        else
-		    want_boost="yes"
-        	ax_boost_user_signals_lib="$withval"
-		fi
-        ],
-        [want_boost="yes"]
-	)
-
-	if test "x$want_boost" = "xyes"; then
-        AC_REQUIRE([AC_PROG_CC])
-		CPPFLAGS_SAVED="$CPPFLAGS"
-		CPPFLAGS="$CPPFLAGS $BOOST_CPPFLAGS"
-		export CPPFLAGS
-
-		LDFLAGS_SAVED="$LDFLAGS"
-		LDFLAGS="$LDFLAGS $BOOST_LDFLAGS"
-		export LDFLAGS
-
-        AC_CACHE_CHECK(whether the Boost::Signals library is available,
-					   ax_cv_boost_signals,
-        [AC_LANG_PUSH([C++])
-		 AC_COMPILE_IFELSE(AC_LANG_PROGRAM([[@%:@include <boost/signal.hpp>
-											]],
-                                  [[boost::signal<void ()> sig;
-                                    return 0;
-                                  ]]),
-                           ax_cv_boost_signals=yes, ax_cv_boost_signals=no)
-         AC_LANG_POP([C++])
-		])
-		if test "x$ax_cv_boost_signals" = "xyes"; then
-			AC_DEFINE(HAVE_BOOST_SIGNALS,,[define if the Boost::Signals library is available])
-            BOOSTLIBDIR=`echo $BOOST_LDFLAGS | sed -e 's/@<:@^\/@:>@*//'`
-            if test "x$ax_boost_user_signals_lib" = "x"; then
-                for libextension in `ls $BOOSTLIBDIR/libboost_signals*.{so,dylib,a}* 2>/dev/null | sed 's,.*/,,' | sed -e 's;^lib\(boost_signals.*\)\.so.*$;\1;' -e 's;^lib\(boost_signals.*\)\.a*$;\1;' -e 's;^lib\(boost_signals.*\)\.dylib$;\1;'` ; do
-                     ax_lib=${libextension}
-				    AC_CHECK_LIB($ax_lib, toupper,
-                                 [BOOST_SIGNALS_LIB="-l$ax_lib"; AC_SUBST(BOOST_SIGNALS_LIB) link_signals="yes"; break],
-                                 [link_signals="no"])
-  				done
-                if test "x$link_signals" != "xyes"; then
-                for libextension in `ls $BOOSTLIBDIR/boost_signals*.{dll,a}* 2>/dev/null | sed 's,.*/,,' | sed -e 's;^\(boost_signals.*\)\.dll.*$;\1;' -e 's;^\(boost_signals.*\)\.a*$;\1;'` ; do
-                     ax_lib=${libextension}
-				    AC_CHECK_LIB($ax_lib, toupper,
-                                 [BOOST_SIGNALS_LIB="-l$ax_lib"; AC_SUBST(BOOST_SIGNALS_LIB) link_signals="yes"; break],
-                                 [link_signals="no"])
-  				done
-                fi
-
-            else
-               for ax_lib in $ax_boost_user_signals_lib boost_signals-$ax_boost_user_signals_lib; do
-				      AC_CHECK_LIB($ax_lib, main,
-                                   [BOOST_SIGNALS_LIB="-l$ax_lib"; AC_SUBST(BOOST_SIGNALS_LIB) link_signals="yes"; break],
-                                   [link_signals="no"])
-                  done
-
-            fi
-			if test "x$link_signals" != "xyes"; then
-				AC_MSG_ERROR([could not link against "$ax_lib"])
-			fi
-		fi
-
-		CPPFLAGS="$CPPFLAGS_SAVED"
-    	LDFLAGS="$LDFLAGS_SAVED"
-	fi
-])
diff --git a/config/ax_boost_system.m4 b/config/ax_boost_system.m4
deleted file mode 100644
index b5f2f41061d..00000000000
--- a/config/ax_boost_system.m4
+++ /dev/null
@@ -1,114 +0,0 @@
-##### http://autoconf-archive.cryp.to/ax_boost_system.html
-#
-# SYNOPSIS
-#
-#   AX_BOOST_SYSTEM
-#
-# DESCRIPTION
-#
-#   Test for System library from the Boost C++ libraries. The macro
-#   requires a preceding call to AX_BOOST_BASE. Further documentation
-#   is available at <http://randspringer.de/boost/index.html>.
-#
-#   This macro calls:
-#
-#     AC_SUBST(BOOST_SYSTEM_LIB)
-#
-#   And sets:
-#
-#     HAVE_BOOST_SYSTEM
-#
-# COPYLEFT
-#
-#   Copyright (c) 2008 Thomas Porschberg <thomas@randspringer.de>
-#   Copyright (c) 2008 Michael Tindal
-#   Copyright (c) 2008 Daniel Casimiro <dan.casimiro@gmail.com>
-#
-#   Copying and distribution of this file, with or without
-#   modification, are permitted in any medium without royalty provided
-#   the copyright notice and this notice are preserved.
-
-AC_DEFUN([AX_BOOST_SYSTEM],
-[
-  AC_BEFORE([$0], [AX_BOOST_THREAD])
-
-	AC_ARG_WITH([boost-system],
-	AS_HELP_STRING([--with-boost-system@<:@=special-lib@:>@],
-                   [use the System library from boost - it is possible to specify a certain library for the linker
-                        e.g. --with-boost-system=boost_system-gcc-mt ]),
-        [
-        if test "$withval" = "no"; then
-			want_boost="no"
-        elif test "$withval" = "yes"; then
-            want_boost="yes"
-            ax_boost_user_system_lib=""
-        else
-		    want_boost="yes"
-        	ax_boost_user_system_lib="$withval"
-		fi
-        ],
-        [want_boost="yes"]
-	)
-
-	if test "x$want_boost" = "xyes"; then
-        AC_REQUIRE([AC_PROG_CC])
-        AC_REQUIRE([AC_CANONICAL_BUILD])
-		CPPFLAGS_SAVED="$CPPFLAGS"
-		CPPFLAGS="$CPPFLAGS $BOOST_CPPFLAGS"
-		export CPPFLAGS
-
-		LDFLAGS_SAVED="$LDFLAGS"
-		LDFLAGS="$LDFLAGS $BOOST_LDFLAGS"
-		export LDFLAGS
-
-        AC_CACHE_CHECK(whether the Boost::System library is available,
-					   ax_cv_boost_system,
-        [AC_LANG_PUSH([C++])
-			 CXXFLAGS_SAVE=$CXXFLAGS
-
-			 AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[@%:@include <boost/system/error_code.hpp>]],
-                                   [[boost::system::system_category]])],
-                   ax_cv_boost_system=yes, ax_cv_boost_system=no)
-			 CXXFLAGS=$CXXFLAGS_SAVE
-             AC_LANG_POP([C++])
-		])
-		if test "x$ax_cv_boost_system" = "xyes"; then
-			AC_SUBST(BOOST_CPPFLAGS)
-
-			AC_DEFINE(HAVE_BOOST_SYSTEM,,[define if the Boost::System library is available])
-            BOOSTLIBDIR=`echo $BOOST_LDFLAGS | sed -e 's/@<:@^\/@:>@*//'`
-
-			LDFLAGS_SAVE=$LDFLAGS
-            if test "x$ax_boost_user_system_lib" = "x"; then
-                for libextension in `ls $BOOSTLIBDIR/libboost_system*.{so,dylib,a}* 2>/dev/null | sed 's,.*/,,' | sed -e 's;^lib\(boost_system.*\)\.so.*$;\1;' -e 's;^lib\(boost_system.*\)\.a*$;\1;' -e 's;^lib\(boost_system.*\)\.dylib$;\1;'` ; do
-                     ax_lib=${libextension}
-				    AC_CHECK_LIB($ax_lib, toupper,
-                                 [BOOST_SYSTEM_LIB="-l$ax_lib"; AC_SUBST(BOOST_SYSTEM_LIB) link_system="yes"; break],
-                                 [link_system="no"])
-  				done
-                if test "x$link_system" != "xyes"; then
-                for libextension in `ls $BOOSTLIBDIR/boost_system*.{dll,a}* 2>/dev/null | sed 's,.*/,,' | sed -e 's;^\(boost_system.*\)\.dll.*$;\1;' -e 's;^\(boost_system.*\)\.a*$;\1;'` ; do
-                     ax_lib=${libextension}
-				    AC_CHECK_LIB($ax_lib, toupper,
-                                 [BOOST_SYSTEM_LIB="-l$ax_lib"; AC_SUBST(BOOST_SYSTEM_LIB) link_system="yes"; break],
-                                 [link_system="no"])
-  				done
-                fi
-
-            else
-               for ax_lib in $ax_boost_user_system_lib boost_system-$ax_boost_user_system_lib; do
-				      AC_CHECK_LIB($ax_lib, toupper,
-                                   [BOOST_SYSTEM_LIB="-l$ax_lib"; AC_SUBST(BOOST_SYSTEM_LIB) link_system="yes"; break],
-                                   [link_system="no"])
-                  done
-
-            fi
-			if test "x$link_system" = "xno"; then
-				AC_MSG_ERROR([could not link against "$ax_lib"])
-                AC_DEFINE([USE_ROSE_BOOST_WAVE_SUPPORT],1,[Controls use of BOOST WAVE support in ROSE.])
-			fi
-		fi
-		CPPFLAGS="$CPPFLAGS_SAVED"
-    	LDFLAGS="$LDFLAGS_SAVED"
-	fi
-])
diff --git a/config/ax_boost_test_exec_monitor.m4 b/config/ax_boost_test_exec_monitor.m4
deleted file mode 100644
index cd4293ea5dd..00000000000
--- a/config/ax_boost_test_exec_monitor.m4
+++ /dev/null
@@ -1,132 +0,0 @@
-##### http://autoconf-archive.cryp.to/ax_boost_test_exec_monitor.html
-#
-# SYNOPSIS
-#
-#   AX_BOOST_TEST_EXEC_MONITOR
-#
-# DESCRIPTION
-#
-#   Test for Test_Exec_Monitor library from the Boost C++ libraries.
-#   The macro requires a preceding call to AX_BOOST_BASE. Further
-#   documentation is available at
-#   <http://randspringer.de/boost/index.html>.
-#
-#   This macro calls:
-#
-#     AC_SUBST(BOOST_TEST_EXEC_MONITOR_LIB)
-#
-#   And sets:
-#
-#     HAVE_BOOST_TEST_EXEC_MONITOR
-#
-# COPYLEFT
-#
-#   Copyright (c) 2007 Dodji Seketeli <dodji@seketeli.org>
-#   Copyright (c) 2007 Thomas Porschberg <thomas@randspringer.de>
-#
-#   Copying and distribution of this file, with or without
-#   modification, are permitted in any medium without royalty provided
-#   the copyright notice and this notice are preserved.
-
-AC_DEFUN([AX_BOOST_TEST_EXEC_MONITOR],
-[
-	AC_ARG_WITH([boost-test-exec-monitor],
-	AS_HELP_STRING([--with-boost-test-exec-monitor@<:@=special-lib@:>@],
-                   [use the Test_Exec_Monitor library from boost - it is possible to specify a certain library for the linker
-                        e.g. --with-boost-test-exec-monitor=boost_test_exec_monitor-gcc ]),
-        [
-        if test "$withval" = "no"; then
-			want_boost="no"
-        elif test "$withval" = "yes"; then
-            want_boost="yes"
-            ax_boost_user_test_exec_monitor_lib=""
-        else
-		    want_boost="yes"
-        	ax_boost_user_test_exec_monitor_lib="$withval"
-		fi
-        ],
-        [want_boost="yes"]
-	)
-
-	if test "x$want_boost" = "xyes"; then
-        AC_REQUIRE([AC_PROG_CC])
-		CPPFLAGS_SAVED="$CPPFLAGS"
-		CPPFLAGS="$CPPFLAGS $BOOST_CPPFLAGS"
-		export CPPFLAGS
-
-		LDFLAGS_SAVED="$LDFLAGS"
-		LDFLAGS="$LDFLAGS $BOOST_LDFLAGS"
-		export LDFLAGS
-
-        AC_CACHE_CHECK(whether the Boost::Test_Exec_Monitor library is available,
-					   ax_cv_boost_test_exec_monitor,
-        [AC_LANG_PUSH([C++])
-			 AC_COMPILE_IFELSE(AC_LANG_PROGRAM([[@%:@include <boost/test/test_tools.hpp>]],
-                                    [[int i=1 ; BOOST_REQUIRE(i==1); ; return 0;]]),
-                   ax_cv_boost_test_exec_monitor=yes, ax_cv_boost_test_exec_monitor=no)
-         AC_LANG_POP([C++])
-		])
-		if test "x$ax_cv_boost_test_exec_monitor" = "xyes"; then
-			AC_DEFINE(HAVE_BOOST_TEST_EXEC_MONITOR,,[define if the Boost::Test_Exec_Monitor library is available])
-            BOOSTLIBDIR=`echo $BOOST_LDFLAGS | sed -e 's/@<:@^\/@:>@*//'`
-
-            if test "x$ax_boost_user_test_exec_monitor_lib" = "x"; then
-         		saved_ldflags="${LDFLAGS}"
-
-                for monitor_library in `ls $BOOSTLIBDIR/libboost_test_exec_monitor*.{so,dylib,a}* 2>/dev/null` ; do
-                    if test -r $monitor_library ; then
-                       libextension=`echo $monitor_library | sed 's,.*/,,' | sed -e 's;^lib\(boost_test_exec_monitor.*\)\.so.*$;\1;' -e 's;^lib\(boost_test_exec_monitor.*\)\.a*$;\1;' -e 's;^lib\(boost_test_exec_monitor.*\)\.dylib$;\1;'`
-                       ax_lib=${libextension}
-                       link_test_exec_monitor="yes"
-                    else
-                       link_test_exec_monitor="no"
-                    fi
-
-			      if test "x$link_test_exec_monitor" = "xyes"; then
-                      BOOST_TEST_EXEC_MONITOR_LIB="-l$ax_lib"
-                      AC_SUBST(BOOST_TEST_EXEC_MONITOR_LIB)
-					  break
-				  fi
-                done
-                if test "x$link_test_exec_monitor" != "xyes"; then
-                for libextension in `ls $BOOSTLIBDIR/boost_test_exec_monitor*.{dll,a}* 2>/dev/null | sed 's,.*/,,' | sed -e 's;^\(boost_test_exec_monitor.*\)\.dll.*$;\1;' -e 's;^\(boost_test_exec_monitor.*\)\.a*$;\1;'` ; do
-                     ax_lib=${libextension}
-				    AC_CHECK_LIB($ax_lib, toupper,
-                                 [BOOST_TEST_EXEC_MONITOR_LIB="-l$ax_lib"; AC_SUBST(BOOST_TEST_EXEC_MONITOR_LIB) link_test_exec_monitor="yes"; break],
-                                 [link_test_exec_monitor="no"])
-  				done
-                fi
-
-            else
-                link_test_exec_monitor="no"
-         		saved_ldflags="${LDFLAGS}"
-                for ax_lib in boost_test_exec_monitor-$ax_boost_user_test_exec_monitor_lib $ax_boost_user_test_exec_monitor_lib ; do
-                   if test "x$link_test_exec_monitor" = "xyes"; then
-                      break;
-                   fi
-                   for monitor_library in `ls $BOOSTLIBDIR/lib${ax_lib}.{so,dylib,a}* 2>/dev/null` ; do
-                   if test -r $monitor_library ; then
-                       libextension=`echo $monitor_library | sed 's,.*/,,' | sed -e 's;^lib\(boost_test_exec_monitor.*\)\.so.*$;\1;' -e 's;^lib\(boost_test_exec_monitor.*\)\.a*$;\1;' -e 's;^lib\(boost_test_exec_monitor.*\)\.dylib$;\1;'`
-                       ax_lib=${libextension}
-                       link_test_exec_monitor="yes"
-                    else
-                       link_test_exec_monitor="no"
-                    fi
-
-			        if test "x$link_test_exec_monitor" = "xyes"; then
-                        BOOST_TEST_EXEC_MONITOR_LIB="-l$ax_lib"
-                        AC_SUBST(BOOST_TEST_EXEC_MONITOR_LIB)
-					    break
-				    fi
-                  done
-               done
-            fi
-			if test "x$link_test_exec_monitor" != "xyes"; then
-				AC_MSG_ERROR([could not link against "$ax_lib"])
-			fi
-		fi
-
-		CPPFLAGS="$CPPFLAGS_SAVED"
-    	LDFLAGS="$LDFLAGS_SAVED"
-	fi
-])
diff --git a/config/ax_boost_thread.m4 b/config/ax_boost_thread.m4
deleted file mode 100644
index 230af2cbb46..00000000000
--- a/config/ax_boost_thread.m4
+++ /dev/null
@@ -1,148 +0,0 @@
-##### http://autoconf-archive.cryp.to/ax_boost_thread.html
-#
-# SYNOPSIS
-#
-#   AX_BOOST_THREAD
-#
-# DESCRIPTION
-#
-#   Test for Thread library from the Boost C++ libraries. The macro
-#   requires a preceding call to AX_BOOST_BASE. Further documentation
-#   is available at <http://randspringer.de/boost/index.html>.
-#
-#   This macro calls:
-#
-#     AC_SUBST(BOOST_THREAD_LIB)
-#
-#   And sets:
-#
-#     HAVE_BOOST_THREAD
-#
-# COPYLEFT
-#
-#   Copyright (c) 2007 Thomas Porschberg <thomas@randspringer.de>
-#   Copyright (c) 2007 Michael Tindal
-#
-#   Copying and distribution of this file, with or without
-#   modification, are permitted in any medium without royalty provided
-#   the copyright notice and this notice are preserved.
-
-AC_DEFUN([AX_BOOST_THREAD],
-[
-    AC_ARG_WITH([boost-thread],
-        AS_HELP_STRING([--with-boost-thread@<:@=special-lib@:>@],
-                       [Use the Thread library from Boost.  If the value is 'yes' or a certain library then ROSE will
-                        incorporate multi-thread support into some of its algorithms. The default is to incorporate
-                        multi-thread support into ROSE algorithms since Boost is compiled with thread support by default.
-                        If thread support is enabled then user code should also be compiled and linked with switches
-                        appropriate for multi-threading e.g., -pthread for GCC.  If the user compiles Boost without
-                        thread support, then --without-boost-thread can be given on the ROSE configure commandline. ]),
-        [
-            if test "$withval" = "no"; then
-                want_boost="no"
-            elif test "$withval" = "yes"; then
-                want_boost="yes"
-                ax_boost_user_thread_lib=""
-            else
-                want_boost="yes"
-                ax_boost_user_thread_lib="$withval"
-            fi
-        ],
-        [want_boost="yes"]
-    )
-
-    if test "x$want_boost" = "xyes"; then
-        AC_REQUIRE([AC_PROG_CC])
-        AC_REQUIRE([AC_CANONICAL_BUILD])
-        CPPFLAGS_SAVED="$CPPFLAGS"
-        CPPFLAGS="$CPPFLAGS $BOOST_CPPFLAGS"
-        export CPPFLAGS
-
-        LDFLAGS_SAVED="$LDFLAGS"
-        LDFLAGS="$LDFLAGS $BOOST_LDFLAGS"
-        export LDFLAGS
-
-        AC_CACHE_CHECK(whether the boost/thread/thread.hpp header is available,
-            ax_cv_boost_thread,
-            [
-                AC_LANG_PUSH([C++])
-                CXXFLAGS_SAVE=$CXXFLAGS
-
-                case "$build_os" in
-                    solaris ) CXXFLAGS="-pthreads $CXXFLAGS" ;;
-                    ming32 ) CXXFLAGS="-mthreads $CXXFLAGS" ;;
-                  # DQ (12/6/2016): Added pthread option since it appears that the default installation of Boost used pthread library.
-                  # Note that their is no "s" on the -pthread option for Clang or GNU g++.
-                  # Note that since boost appears to not be compiled on OSX with threading enabled, we don't want to specify -pthread option to the compiler.
-                  # darwin* ) CXXFLAGS="$CXXFLAGS" ;;
-                  # darwin* ) CXXFLAGS="-pthread $CXXFLAGS" ;;
-                    darwin* ) CXXFLAGS="$CXXFLAGS" ;;
-                    * ) CXXFLAGS="-pthread $CXXFLAGS" ;;
-                esac
-                AC_COMPILE_IFELSE(
-                    [AC_LANG_PROGRAM([[@%:@include <boost/thread/thread.hpp>]],
-                                     [[boost::thread_group thrds;
-                                     return 0;]])],
-                    ax_cv_boost_thread=yes,
-                    ax_cv_boost_thread=no)
-
-                CXXFLAGS=$CXXFLAGS_SAVE
-                AC_LANG_POP([C++])
-            ])
-
-        if test "x$ax_cv_boost_thread" = "xyes"; then
-	    AC_MSG_NOTICE([boost thread header found; checking for library...])
-            case "$build_os" in
-                solaris ) BOOST_CPPFLAGS="-pthreads $BOOST_CPPFLAGS" ;;
-                ming32 ) BOOST_CPPFLAGS="-mthreads $BOOST_CPPFLAGS" ;;
-                darwin* ) BOOST_CPPFLAGS="$BOOST_CPPFLAGS" ;;
-                * ) BOOST_CPPFLAGS="-pthread $BOOST_CPPFLAGS" ;;
-            esac
-
-            AC_SUBST(BOOST_CPPFLAGS)
-
-            AC_DEFINE(HAVE_BOOST_THREAD,,[define if the Boost::Thread library is available])
-            BOOSTLIBDIR=`echo $BOOST_LDFLAGS | sed -e 's/@<:@^\/@:>@*//'`
-
-            LDFLAGS_SAVE=$LDFLAGS
-            case "x$build_os" in
-                *bsd* ) LDFLAGS="-pthread $LDFLAGS" ;;
-            esac
-            if test "x$ax_boost_user_thread_lib" = "x"; then
-                for libextension in `ls $BOOSTLIBDIR/libboost_thread*.{so,dylib,a}* 2>/dev/null | sed 's,.*/,,' | sed -e 's;^lib\(boost_thread.*\)\.so.*$;\1;' -e 's;^lib\(boost_thread.*\)\.a*$;\1;' -e 's;^lib\(boost_thread.*\)\.dylib$;\1;'` ; do
-                    ax_lib=${libextension}
-                    AC_CHECK_LIB($ax_lib, toupper,
-                        [BOOST_THREAD_LIB="-l$ax_lib"; AC_SUBST(BOOST_THREAD_LIB) link_thread="yes"; break],
-                        [link_thread="no"], [${BOOST_SYSTEM_LIB}])
-                done
-                if test "x$link_thread" != "xyes"; then
-                    for libextension in `ls $BOOSTLIBDIR/boost_thread*.{dll,a}* 2>/dev/null | sed 's,.*/,,' | sed -e 's;^\(boost_thread.*\)\.dll.*$;\1;' -e 's;^\(boost_thread.*\)\.a*$;\1;'` ; do
-                        ax_lib=${libextension}
-                        AC_CHECK_LIB($ax_lib, toupper,
-                            [BOOST_THREAD_LIB="-l$ax_lib"; AC_SUBST(BOOST_THREAD_LIB) link_thread="yes"; break],
-                            [link_thread="no"], [${BOOST_SYSTEM_LIB}])
-                    done
-                fi
-            else
-               for ax_lib in $ax_boost_user_thread_lib boost_thread-$ax_boost_user_thread_lib; do
-                   AC_CHECK_LIB($ax_lib, toupper,
-                       [BOOST_THREAD_LIB="-l$ax_lib"; AC_SUBST(BOOST_THREAD_LIB) link_thread="yes"; break],
-                       [link_thread="no"], [${BOOST_SYSTEM_LIB}])
-               done
-            fi
-
-            if test "x$link_thread" != "xyes"; then
-                AC_MSG_ERROR([could not link against -lboost_thread; ROSE requires this library in "$BOOSTLIBDIR"])
-            else
-                case "x$build_os" in
-                    *bsd* ) BOOST_LDFLAGS="-pthread $BOOST_LDFLAGS" ;;
-                    *linux-gnu*) BOOST_LDFLAGS="-pthread $BOOST_LDFLAGS" ;;
-                esac
-                AC_MSG_RESULT([boost thread library found: $BOOST_LDFLAGS])
-            fi
-        fi
-
-        CPPFLAGS="$CPPFLAGS_SAVED"
-        LDFLAGS="$LDFLAGS_SAVED"
-    fi
-])
diff --git a/config/ax_boost_unit_test_framework.m4 b/config/ax_boost_unit_test_framework.m4
deleted file mode 100644
index a1add1657e9..00000000000
--- a/config/ax_boost_unit_test_framework.m4
+++ /dev/null
@@ -1,130 +0,0 @@
-##### http://autoconf-archive.cryp.to/ax_boost_unit_test_framework.html
-#
-# SYNOPSIS
-#
-#   AX_BOOST_UNIT_TEST_FRAMEWORK
-#
-# DESCRIPTION
-#
-#   Test for Unit_Test_Framework library from the Boost C++ libraries.
-#   The macro requires a preceding call to AX_BOOST_BASE. Further
-#   documentation is available at
-#   <http://randspringer.de/boost/index.html>.
-#
-#   This macro calls:
-#
-#     AC_SUBST(BOOST_UNIT_TEST_FRAMEWORK_LIB)
-#
-#   And sets:
-#
-#     HAVE_BOOST_UNIT_TEST_FRAMEWORK
-#
-# COPYLEFT
-#
-#   Copyright (c) 2007 Thomas Porschberg <thomas@randspringer.de>
-#
-#   Copying and distribution of this file, with or without
-#   modification, are permitted in any medium without royalty provided
-#   the copyright notice and this notice are preserved.
-
-AC_DEFUN([AX_BOOST_UNIT_TEST_FRAMEWORK],
-[
-	AC_ARG_WITH([boost-unit-test-framework],
-	AS_HELP_STRING([--with-boost-unit-test-framework@<:@=special-lib@:>@],
-                   [use the Unit_Test_Framework library from boost - it is possible to specify a certain library for the linker
-                        e.g. --with-boost-unit-test-framework=boost_unit_test_framework-gcc ]),
-        [
-        if test "$withval" = "no"; then
-			want_boost="no"
-        elif test "$withval" = "yes"; then
-            want_boost="yes"
-            ax_boost_user_unit_test_framework_lib=""
-        else
-		    want_boost="yes"
-        	ax_boost_user_unit_test_framework_lib="$withval"
-		fi
-        ],
-        [want_boost="yes"]
-	)
-
-	if test "x$want_boost" = "xyes"; then
-        AC_REQUIRE([AC_PROG_CC])
-		CPPFLAGS_SAVED="$CPPFLAGS"
-		CPPFLAGS="$CPPFLAGS $BOOST_CPPFLAGS"
-		export CPPFLAGS
-
-		LDFLAGS_SAVED="$LDFLAGS"
-		LDFLAGS="$LDFLAGS $BOOST_LDFLAGS"
-		export LDFLAGS
-
-        AC_CACHE_CHECK(whether the Boost::Unit_Test_Framework library is available,
-					   ax_cv_boost_unit_test_framework,
-        [AC_LANG_PUSH([C++])
-			 AC_COMPILE_IFELSE(AC_LANG_PROGRAM([[@%:@include <boost/test/unit_test.hpp>]],
-                                    [[using boost::unit_test::test_suite;
-					                 test_suite* test= BOOST_TEST_SUITE( "Unit test example 1" ); return 0;]]),
-                   ax_cv_boost_unit_test_framework=yes, ax_cv_boost_unit_test_framework=no)
-         AC_LANG_POP([C++])
-		])
-		if test "x$ax_cv_boost_unit_test_framework" = "xyes"; then
-			AC_DEFINE(HAVE_BOOST_UNIT_TEST_FRAMEWORK,,[define if the Boost::Unit_Test_Framework library is available])
-            BOOSTLIBDIR=`echo $BOOST_LDFLAGS | sed -e 's/@<:@^\/@:>@*//'`
-
-            if test "x$ax_boost_user_unit_test_framework_lib" = "x"; then
-         		saved_ldflags="${LDFLAGS}"
-                for monitor_library in `ls $BOOSTLIBDIR/libboost_unit_test_framework*.{so,dylib,a}* 2>/dev/null` ; do
-                    if test -r $monitor_library ; then
-                       libextension=`echo $monitor_library | sed 's,.*/,,' | sed -e 's;^lib\(boost_unit_test_framework.*\)\.so.*$;\1;' -e 's;^lib\(boost_unit_test_framework.*\)\.a*$;\1;' -e 's;^lib\(boost_unit_test_framework.*\)\.dylib$;\1;'`
-                       ax_lib=${libextension}
-                       link_unit_test_framework="yes"
-                    else
-                       link_unit_test_framework="no"
-                    fi
-
-        		    if test "x$link_unit_test_framework" = "xyes"; then
-                      BOOST_UNIT_TEST_FRAMEWORK_LIB="-l$ax_lib"
-                      AC_SUBST(BOOST_UNIT_TEST_FRAMEWORK_LIB)
-					  break
-				    fi
-                done
-                if test "x$link_unit_test_framework" != "xyes"; then
-                for libextension in `ls $BOOSTLIBDIR/boost_unit_test_framework*.{dll,a}* 2>/dev/null  | sed 's,.*/,,' | sed -e 's;^\(boost_unit_test_framework.*\)\.dll.*$;\1;' -e 's;^\(boost_unit_test_framework.*\)\.a*$;\1;'` ; do
-                     ax_lib=${libextension}
-				    AC_CHECK_LIB($ax_lib, toupper,
-                                 [BOOST_UNIT_TEST_FRAMEWORK_LIB="-l$ax_lib"; AC_SUBST(BOOST_UNIT_TEST_FRAMEWORK_LIB) link_unit_test_framework="yes"; break],
-                                 [link_unit_test_framework="no"])
-  				done
-                fi
-            else
-                link_unit_test_framework="no"
-         		saved_ldflags="${LDFLAGS}"
-                for ax_lib in boost_unit_test_framework-$ax_boost_user_unit_test_framework_lib $ax_boost_user_unit_test_framework_lib ; do
-                   if test "x$link_unit_test_framework" = "xyes"; then
-                      break;
-                   fi
-                   for unittest_library in `ls $BOOSTLIBDIR/lib${ax_lib}.{so,dylib,a}* 2>/dev/null` ; do
-                   if test -r $unittest_library ; then
-                       libextension=`echo $unittest_library | sed 's,.*/,,' | sed -e 's;^lib\(boost_unit_test_framework.*\)\.so.*$;\1;' -e 's;^lib\(boost_unit_test_framework.*\)\.a*$;\1;' -e 's;^lib\(boost_unit_test_framework.*\)\.dylib$;\1;'`
-                       ax_lib=${libextension}
-                       link_unit_test_framework="yes"
-                    else
-                       link_unit_test_framework="no"
-                    fi
-
-			        if test "x$link_unit_test_framework" = "xyes"; then
-                        BOOST_UNIT_TEST_FRAMEWORK_LIB="-l$ax_lib"
-                        AC_SUBST(BOOST_UNIT_TEST_FRAMEWORK_LIB)
-					    break
-				    fi
-                  done
-               done
-            fi
-			if test "x$link_unit_test_framework" != "xyes"; then
-				AC_MSG_ERROR([could not link against "$ax_lib"])
-			fi
-		fi
-
-		CPPFLAGS="$CPPFLAGS_SAVED"
-    	LDFLAGS="$LDFLAGS_SAVED"
-	fi
-])
diff --git a/config/ax_boost_wave.m4 b/config/ax_boost_wave.m4
deleted file mode 100644
index 4473ea8bee8..00000000000
--- a/config/ax_boost_wave.m4
+++ /dev/null
@@ -1,119 +0,0 @@
- http://autoconf-archive.cryp.to/ax_boost_regex.html
-#
-# SYNOPSIS
-#
-#   AX_BOOST_WAVE
-#
-# DESCRIPTION
-#
-#   Test for Wave library from the Boost C++ libraries. The macro
-#   requires a preceding call to AX_BOOST_BASE. Further documentation
-#   is available at <http://randspringer.de/boost/index.html>.
-#
-#   This macro calls:
-#
-#     AC_SUBST(BOOST_WAVE_LIB)
-#
-#   And sets:
-#
-#     HAVE_BOOST_WAVE
-#
-# COPYLEFT
-#
-#   Copyright (c) 2007 Thomas Porschberg <thomas@randspringer.de>
-#   Copyright (c) 2007 Michael Tindal
-#
-#   Copying and distribution of this file, with or without
-#   modification, are permitted in any medium without royalty provided
-#   the copyright notice and this notice are preserved.
-
-AC_DEFUN([AX_BOOST_WAVE],
-[
-	AC_ARG_WITH([boost-wave],
-	AS_HELP_STRING([--with-boost-wave@<:@=special-lib@:>@],
-                   [use the Wave library from boost - it is possible to specify a certain library for the linker
-                        e.g. --with-boost-wave=boost_wave-gcc-mt-d-1_33_1 ]),
-        [
-        if test "$withval" = "no"; then
-			want_boost="no"
-        elif test "$withval" = "yes"; then
-            want_boost="yes"
-            ax_boost_user_wave_lib=""
-        else
-		    want_boost="yes"
-        	ax_boost_user_wave_lib="$withval"
-		fi
-        ],
-        [want_boost="yes"]
-	)
-    AM_CONDITIONAL(ROSE_USE_BOOST_WAVE, test "x$want_boost" = "xyes"  )
-
-	if test "x$want_boost" = "xyes"; then
-        AC_REQUIRE([AC_PROG_CC])
-		CPPFLAGS_SAVED="$CPPFLAGS"
-		CPPFLAGS="$CPPFLAGS $BOOST_CPPFLAGS"
-		export CPPFLAGS
-
-		LDFLAGS_SAVED="$LDFLAGS"
-		LDFLAGS="$LDFLAGS $BOOST_LDFLAGS"
-		export LDFLAGS
-
-		LIBS_SAVED=$LIBS
-		LIBS="$LIBS $BOOST_SYSTEM_LIB $BOOST_THREAD_LIB"
-		export LIBS
-
-        AC_CACHE_CHECK(whether the Boost::Wave library is available,
-					   ax_cv_boost_wave,
-        [AC_LANG_PUSH([C++])
-			 AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[@%:@include <boost/wave.hpp>
-												]],
-                                   [[boost::wave::token_category r; return 0;]])],
-                   ax_cv_boost_wave=yes, ax_cv_boost_wave=no)
-         AC_LANG_POP([C++])
-		])
-		if test "x$ax_cv_boost_wave" = "xyes"; then
-
-			AC_DEFINE(HAVE_BOOST_WAVE,,[define if the Boost::Wave library is available])
-            BOOSTLIBDIR=`echo $BOOST_LDFLAGS | sed -e 's/@<:@^\/@:>@*//'`
-            if test "x$ax_boost_user_wave_lib" = "x"; then
-                for libextension in `ls $BOOSTLIBDIR/libboost_wave*.{so,dylib,a}* 2>/dev/null | sed 's,.*/,,' | sed -e 's;^lib\(boost_wave.*\)\.so.*$;\1;' -e 's;^lib\(boost_wave.*\)\.a*$;\1;' -e 's;^lib\(boost_wave.*\)\.dylib$;\1;'` ; do
-                     ax_lib=${libextension}
-				    AC_CHECK_LIB($ax_lib, toupper,
-                                 [BOOST_WAVE_LIB="-l$ax_lib"; AC_SUBST(BOOST_WAVE_LIB) link_wave="yes"; break],
-                                 [link_wave="no"])
-  				done
-                if test "x$link_wave" != "xyes"; then
-                for libextension in `ls $BOOSTLIBDIR/boost_wave*.{dll,a}* 2>/dev/null | sed 's,.*/,,' | sed -e 's;^\(boost_wave.*\)\.dll.*$;\1;' -e 's;^\(boost_wave.*\)\.a*$;\1;'` ; do
-                     ax_lib=${libextension}
-				    AC_CHECK_LIB($ax_lib, toupper,
-                                 [BOOST_WAVE_LIB="-l$ax_lib"; AC_SUBST(BOOST_WAVE_LIB) link_wave="yes"; break],
-                                 [link_wave="no"])
-  				done
-                fi
-
-            else
-               for ax_lib in $ax_boost_user_wave_lib boost_wave-$ax_boost_user_wave_lib; do
-				      AC_CHECK_LIB($ax_lib, main,
-                                   [BOOST_WAVE_LIB="-l$ax_lib"; AC_SUBST(BOOST_WAVE_LIB) link_wave="yes"; break],
-                                   [link_wave="no"])
-               done
-            fi
-			if test "x$link_wave" != "xyes"; then
-				AC_MSG_ERROR([could not link against "$ax_lib"])
-			fi
-            # DQ (4/7/2006): build a macro to use in source code to know when WAVE is to be used.
-            AC_DEFINE([USE_ROSE_BOOST_WAVE_SUPPORT],1,[Controls use of BOOST WAVE support in ROSE.])
-       
-		else
-            AC_DEFINE([USE_ROSE_BOOST_WAVE_SUPPORT],0,[Controls use of BOOST WAVE support in ROSE.])
-
-		fi
-
-
-
-		CPPFLAGS="$CPPFLAGS_SAVED"
-           	LDFLAGS="$LDFLAGS_SAVED"
-		LIBS="$LIBS_SAVED"
-
-	fi
-])
diff --git a/config/ax_boost_wserialization.m4 b/config/ax_boost_wserialization.m4
deleted file mode 100644
index 48f232d409f..00000000000
--- a/config/ax_boost_wserialization.m4
+++ /dev/null
@@ -1,109 +0,0 @@
-##### http://autoconf-archive.cryp.to/ax_boost_wserialization.html
-#
-# SYNOPSIS
-#
-#   AX_BOOST_WSERIALIZATION
-#
-# DESCRIPTION
-#
-#   Test for Serialization library from the Boost C++ libraries. The
-#   macro requires a preceding call to AX_BOOST_BASE. Further
-#   documentation is available at
-#   <http://randspringer.de/boost/index.html>.
-#
-#   This macro calls:
-#
-#     AC_SUBST(BOOST_WSERIALIZATION_LIB)
-#
-#   And sets:
-#
-#     HAVE_BOOST_WSERIALIZATION
-#
-# COPYLEFT
-#
-#   Copyright (c) 2007 Thomas Porschberg <thomas@randspringer.de>
-#
-#   Copying and distribution of this file, with or without
-#   modification, are permitted in any medium without royalty provided
-#   the copyright notice and this notice are preserved.
-
-AC_DEFUN([AX_BOOST_WSERIALIZATION],
-[
-	AC_ARG_WITH([boost-wserialization],
-	AS_HELP_STRING([--with-boost-wserialization@<:@=special-lib@:>@],
-                   [use the WSerialization library from boost -  it is possible to specify a certain library for the linker
-                        e.g. --with-boost-wserialization=boost_wserialization-gcc-mt-d-1_33_1 ]),
-        [
-        if test "$withval" = "no"; then
-			want_boost="no"
-        elif test "$withval" = "yes"; then
-            want_boost="yes"
-            ax_boost_user_wserialization_lib=""
-        else
-		    want_boost="yes"
-        	ax_boost_user_wserialization_lib="$withval"
-		fi
-        ],
-        [want_boost="yes"]
-	)
-
-	if test "x$want_boost" = "xyes"; then
-        AC_REQUIRE([AC_PROG_CC])
-		CPPFLAGS_SAVED="$CPPFLAGS"
-		CPPFLAGS="$CPPFLAGS $BOOST_CPPFLAGS"
-		export CPPFLAGS
-
-		LDFLAGS_SAVED="$LDFLAGS"
-		LDFLAGS="$LDFLAGS $BOOST_LDFLAGS"
-		export LDFLAGS
-
-        AC_CACHE_CHECK(whether the Boost::WSerialization library is available,
-					   ax_cv_boost_wserialization,
-        [AC_LANG_PUSH([C++])
-			 AC_COMPILE_IFELSE(AC_LANG_PROGRAM([[@%:@include <fstream>
-												 @%:@include <boost/archive/text_oarchive.hpp>
-                                                 @%:@include <boost/archive/text_iarchive.hpp>
-												]],
-                                   [[std::ofstream ofs("filename");
-									boost::archive::text_oarchive oa(ofs);
-									 return 0;
-                                   ]]),
-                   ax_cv_boost_wserialization=yes, ax_cv_boost_wserialization=no)
-         AC_LANG_POP([C++])
-		])
-		if test "x$ax_cv_boost_wserialization" = "xyes"; then
-			AC_DEFINE(HAVE_BOOST_WSERIALIZATION,,[define if the Boost::WSerialization library is available])
-            BOOSTLIBDIR=`echo $BOOST_LDFLAGS | sed -e 's/@<:@^\/@:>@*//'`
-            if test "x$ax_boost_user_wserialization_lib" = "x"; then
-                for libextension in `ls $BOOSTLIBDIR/libboost_wserialization*.{so,dylib,a}* 2>/dev/null | sed 's,.*/,,' | sed -e 's;^lib\(boost_wserialization.*\)\.so.*$;\1;' -e 's;^lib\(boost_wserialization.*\)\.a*$;\1;' -e 's;^lib\(boost_wserialization.*\)\.dylib$;\1;'` ; do
-                     ax_lib=${libextension}
-				    AC_CHECK_LIB($ax_lib, toupper,
-                                 [BOOST_WSERIALIZATION_LIB="-l$ax_lib"; AC_SUBST(BOOST_WSERIALIZATION_LIB) link_wserialization="yes"; break],
-                                 [link_wserialization="no"])
-  				done
-                if test "x$link_wserialization" != "xyes"; then
-                for libextension in `ls $BOOSTLIBDIR/boost_wserialization*.{dll,a}* 2>/dev/null | sed 's,.*/,,' | sed -e 's;^\(boost_wserialization.*\)\.dll.*$;\1;' -e 's;^\(boost_wserialization.*\)\.a*$;\1;'` ; do
-                     ax_lib=${libextension}
-				    AC_CHECK_LIB($ax_lib, toupper,
-                                 [BOOST_WSERIALIZATION_LIB="-l$ax_lib"; AC_SUBST(BOOST_WSERIALIZATION_LIB) link_wserialization="yes"; break],
-                                 [link_wserialization="no"])
-  				done
-                fi
-
-            else
-               for ax_lib in $ax_boost_user_wserialization_lib boost_wserialization-$ax_boost_user_wserialization_lib; do
-				      AC_CHECK_LIB($ax_lib, main,
-                                   [BOOST_WSERIALIZATION_LIB="-l$ax_lib"; AC_SUBST(BOOST_WSERIALIZATION_LIB) link_wserialization="yes"; break],
-                                   [link_wserialization="no"])
-                  done
-
-            fi
-			if test "x$link_wserialization" != "xyes"; then
-				AC_MSG_ERROR([could not link against "$ax_lib"])
-			fi
-		fi
-
-		CPPFLAGS="$CPPFLAGS_SAVED"
-    	LDFLAGS="$LDFLAGS_SAVED"
-	fi
-])
diff --git a/config/ax_rose_lib.m4 b/config/ax_rose_lib.m4
deleted file mode 100644
index 21924602e03..00000000000
--- a/config/ax_rose_lib.m4
+++ /dev/null
@@ -1,100 +0,0 @@
-##### http://autoconf-archive.cryp.to/ax_rose.html
-#
-# SYNOPSIS
-#
-#   AX_ROSE_LIB
-#
-# DESCRIPTION
-#
-#   Test for program options library from the Boost C++ libraries. The
-#   macro requires a preceding call to AX_ROSE_LIB_BASE. Further
-#   documentation is available at
-#   <http://randspringer.de/rose/index.html>.
-#
-#   This macro calls:
-#
-#     AC_SUBST(ROSE_LIB)
-#
-#   And sets:
-#
-#     HAVE_ROSE
-#
-# COPYLEFT
-#
-#   Copyright (c) 2007 Thomas Porschberg <thomas@randspringer.de>
-#
-#   Copying and distribution of this file, with or without
-#   modification, are permitted in any medium without royalty provided
-#   the copyright notice and this notice are preserved.
-
-AC_DEFUN([AX_ROSE_LIB],
-[
-	AC_ARG_WITH([rose-lib],
-		AS_HELP_STRING([--with-rose-lib@<:@=special-lib@:>@],
-                       [use the program options library from rose - it is possible to specify a certain library for the linker
-                        e.g. --with-rose-lib=rose-gcc-mt-1_33_1 ]),
-        [
-        if test "$withval" = "no"; then
-			want_rose="no"
-        elif test "$withval" = "yes"; then
-            want_rose="yes"
-            ax_rose_user_lib=""
-        else
-		    want_rose="yes"
-        	ax_rose_user_lib="$withval"
-		fi
-        ],
-        [want_rose="yes"]
-	)
-
-	if test "x$want_rose" = "xyes"; then
-        AC_REQUIRE([AC_PROG_CC])
-	    export want_rose
-		CPPFLAGS_SAVED="$CPPFLAGS"
-		CPPFLAGS="$CPPFLAGS $ROSE_CPPFLAGS $BOOST_CPPFLAGS "
-		export CPPFLAGS
-		LDFLAGS_SAVED="$LDFLAGS"
-		LDFLAGS="$LDFLAGS $ROSE_LDFLAGS $BOOST_LDFLAGS "
-		export LDFLAGS
-		AC_CACHE_CHECK([whether the Boost::Program_Options library is available],
-					   ax_cv_rose,
-					   [AC_LANG_PUSH(C++)
- 		                AC_COMPILE_IFELSE(AC_LANG_PROGRAM([[@%:@include <rose.h>
-                                                          ]],
-                                  [[ return 0;]]),
-                           ax_cv_rose=yes, ax_cv_rose=no)
-			               	AC_LANG_POP([C++])
-		])
-		if test "$ax_cv_rose" = yes; then
-				AC_DEFINE(HAVE_ROSE,,[define if the Boost::PROGRAM_OPTIONS library is available])
-                  ROSELIBDIR=`echo $ROSE_LDFLAGS | sed -e 's/@<:@^\/@:>@*//'`
-                if test "x$ax_rose_user_lib" = "x"; then
-                for libextension in `ls $ROSELIBDIR/librose*.{so,a}* 2>/dev/null | sed 's,.*/,,' | sed -e 's;^lib\(rose.*\)\.so.*$;\1;' -e 's;^lib\(rose.*\)\.a*$;\1;'` ; do
-                     ax_lib=${libextension}
-				    AC_CHECK_LIB($ax_lib, exit,
-                                 [ROSE_LIB="-l$ax_lib"; AC_SUBST(ROSE_LIB) link="yes"; break],
-                                 [link="no"])
-  				done
-                if test "x$link" != "xyes"; then
-                for libextension in `ls $ROSELIBDIR/rose*.{dll,a}* 2>/dev/null | sed 's,.*/,,' | sed -e 's;^\(rose.*\)\.dll.*$;\1;' -e 's;^\(rose.*\)\.a*$;\1;'` ; do
-                     ax_lib=${libextension}
-				    AC_CHECK_LIB($ax_lib, exit,
-                                 [ROSE_LIB="-l$ax_lib"; AC_SUBST(ROSE_LIB) link="yes"; break],
-                                 [link="no"])
-  				done
-                fi
-                else
-                  for ax_lib in $ax_rose_user_lib rose-$ax_rose_user_lib; do
-				      AC_CHECK_LIB($ax_lib, main,
-                                   [ROSE_LIB="-l$ax_lib"; AC_SUBST(ROSE_LIB) link="yes"; break],
-                                   [link="no"])
-                  done
-                fi
-				if test "x$link" != "xyes"; then
-					AC_MSG_ERROR([could not link against "$ax_lib"])
-				fi
-		fi
-		CPPFLAGS="$CPPFLAGS_SAVED"
-    	LDFLAGS="$LDFLAGS_SAVED"
-	fi
-])
diff --git a/config/support-blacklist.m4 b/config/support-blacklist.m4
deleted file mode 100644
index a1ff8faf1de..00000000000
--- a/config/support-blacklist.m4
+++ /dev/null
@@ -1,123 +0,0 @@
-# Support for gracefully bailing out of configure for certain combinations of dependency versions
-# or other situations.
-
-AC_DEFUN([ROSE_SUPPORT_BLACKLIST],[
-    prohibited=
-
-    # -----------------------
-    #    Versions we HAVE
-    # -----------------------
-
-    # Debugging blacklists... Spit out the values that will be needed by users when they're
-    # trying to figure out why their configuration is blacklisted. These are the versions they
-    # HAVE. The versions that are PROHIBITED will be emitted later in this function.  The version
-    # number variables should be set wherever we're detecting the dependency, not here.
-
-    # -----------------------
-    #  Versions we PROHIBIT
-    # -----------------------
-
-    ROSE_CONFIGURE_SECTION([Checking blacklisted configurations])
-    while true; do
-        # Boost 1.54 has numerous bugs related to threads. These manifest themselves as compile errors in
-        # the first ROSE source that happens to include boost thread support, usually something in the
-        # src/util/Sawyer directory.
-        if test "$rose_boost_version" = 105400 -a \
-                "$FRONTEND_CXX_COMPILER_VENDOR" = "gnu" -a \
-                "$FRONTEND_CXX_VERSION_MAJOR" = 4 -a \
-                "$FRONTEND_CXX_VERSION_MINOR" -ge 8; then
-            prohibited="boost 1.54 with gcc >= 4.8 and gcc < 5"
-            break
-        fi
-
-        # Boost-1.60.0 serialization cannot be compiled with GCC-6.1.0 because of ambiguous destructors. Also, when
-        # optimizations are disabled and assertions are enabled, the assembler ("as") takes about an hour to compile
-        # src/Rose/BinaryAnalysis/SerialIo.C on a fast machine (this is true of boost-1.61 with GCC-6.1.0 as well).
-        if test "$support_binaries_frontend" = yes -a \
-                "$rose_boost_version" = 106000 -a \
-                "$FRONTEND_CXX_COMPILER_VENDOR" = gnu -a \
-                "$FRONTEND_CXX_VERSION_MAJOR" = 6 -a \
-                "$FRONTEND_CXX_VERSION_MINOR" = 1; then
-            prohibited="binary analysis enabled with boost 1.60.x and GCC 6.1.x"
-            break
-        fi
-
-        # Boost-1.61 through 1.63 serialization cause link errors when compiled by Intel compilers. Binary analysis
-        # is the only thing that uses serialization at this time.
-        if test "$rose_boost_version" -ge 106100 -a "$rose_boost_version" -le 106300 -a \
-                "$FRONTEND_CXX_COMPILER_VENDOR" = "intel" -a \
-                "$support_binaries_frontend" = "yes"; then
-            prohibited="binary analysis enabled with boost 1.61 through 1.63 with Intel compiler"
-            break
-        fi
-
-        # Boost-1.65.x have segmentation faults in the destructors of some serialization static objects within the Boost
-        # library. I thought this was just for GCC 4 and 5, but after enabling wider testing, we're also getting the
-        # segmentation faults with GCC 7 and 8. Therefore, this version of boost is blacklisted if binary analysis
-        # support is enabled.
-        if test "$rose_boost_version" = 106500 -o "$rose_boost_version" = 106501; then
-            if test "$support_binaries_frontend" = yes -a "$FRONTEND_CXX_COMPILER_VENDOR" = gnu ; then
-                prohibited="binary analysis enabled with boost 1.65 with GCC compiler"
-                break
-            fi
-        fi
-
-        # Boost-1.68.0 has serialization bugs reported by numerous other projects. Within ROSE, 1.68.0 fails the
-        # basic boost serialization tests that we've written. These tests don't depend on ROSE, rather link only
-        # with boost.
-        if test "$rose_boost_version" = 106800; then
-            prohibited="boost-1.68.0"
-            break
-        fi
-
-        # Boost versions prior to 1.68.0 do not work with C++17 and GNU++17 compilers. They experience compiler
-        # errors when a program tries to use the two-argument version of boost::lock, which is needed by ROSE for
-        # thread synchronization.
-        if test "$rose_boost_version" -le 106800; then
-            if test "$HOST_CXX_LANGUAGE" = "c++17" -o "$HOST_CXX_LANGUAGE" = "gnu++17"; then
-                prohibited="boost-$rose_boost_version with $HOST_CXX_LANGUAGE (problems with boost::lock)"
-                break
-            fi
-        fi
-
-        # Z3 4.7.1 is blacklisted because it introduced an API change without any easy way to detect the change
-        # at compile time.
-        if test "$Z3_VERSION" = "4.7.1.0"; then
-            prohibited="z3-4.7.1"
-            break
-        fi
-
-        # Add more blacklist items right above this line with comments like the others. If you detect
-        # a combination that's blacklisted, then set the "prohibited" string to say what is blacklisted
-        # and then break out of the loop to avoid testing other combinations.
-        : whatever tests you like
-
-        # If we made it this far then this combination is not blacklisted
-        prohibited=
-        break
-    done
-
-    # -----------------------
-    #    Output results
-    # -----------------------
-    AC_ARG_ENABLE([blacklist],
-        AS_HELP_STRING([--disable-blacklist],
-                       [Disabling the blacklist check causes blacklist related messages to become non-fatal.
-                        The default --enable-blacklist, means trying to use a blacklisted configuration is fatal.]),
-        [should_die="$enableval"], [should_die=yes])
-
-    if test "$prohibited" != ""; then
-        if test "$should_die" != no; then
-            AC_MSG_FAILURE([blacklisted: $prohibited
-                The above combination of ROSE software dependencies is blacklisted. The ROSE
-                team occassionally blacklists combinations that are known to cause failures in
-                perhaps subtle ways. If you would like to continue with this configuration at your
-                own risk, then reconfigure with --disable-blacklist. (This message comes from
-                config/support-blacklist.m4, which also contains more information about the reason
-                for blacklisting.)])
-        else
-            AC_MSG_WARN([blacklisted: $prohibited])
-            AC_MSG_WARN([    continuing with unsafe configuration at user's request (--disable-blacklist)])
-        fi
-    fi
-])
diff --git a/config/support-boost.m4 b/config/support-boost.m4
deleted file mode 100644
index 39e89097d6f..00000000000
--- a/config/support-boost.m4
+++ /dev/null
@@ -1,198 +0,0 @@
-##### http://www.rosecompiler.org
-#
-# SYNOPSIS
-#
-#   ROSE_SUPPORT_BOOST([])
-#
-# DESCRIPTION
-#
-#   Handle Boost C++ Library settings.
-#
-#   This macro calls:
-#
-#     AC_SUBST(ac_boost_path)
-#
-#   And sets:
-#
-#     Automake conditionals:
-#     AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_X_XX)
-#
-#     CPP #defines:
-#     AC_DEFINE_UNQUOTED(ROSE_BOOST_PATH)
-#     AC_DEFINE_UNQUOTED(ROSE_WAVE_PATH)
-#
-# COPYLEFT
-#
-#   Copyright (c) 2013 Justin Too <too1@llnl.gov>
-#
-#   Copying and distribution of this file, with or without
-#   modification, are permitted in any medium without royalty provided
-#   the copyright notice and this notice are preserved.
-
-AC_DEFUN([ROSE_SUPPORT_BOOST],
-[
-  ROSE_CONFIGURE_SECTION([Checking Boost])
-
-
-  #============================================================================
-  # --enable-boost-version-check
-  #============================================================================
-  ROSE_ARG_ENABLE(
-    [boost-version-check],
-    [if we should validate your Boost version],
-    [validate version of Boost C++ libraries (default: yes)],
-    [yes]
-  )
-
-AX_BOOST_BASE([1.51.0], [], [echo "Boost 1.51.0 - 1.61.0 except 1.54 is required for ROSE" 1>&2; exit 1])
-
-dnl Hack using an internal variable from AX_BOOST_BASE -- this path should only
-dnl be used to set --with-boost in distcheck.
-AC_SUBST(ac_boost_path)
-
-BOOST_VERSION_HEADER="${ac_boost_path}/include/boost/version.hpp"
-
-# Liao, 2019/3/12. Check file existence before calling grep
-if test -f "$BOOST_VERSION_HEADER" ; then
-  rose_boost_version=`grep "#define BOOST_VERSION " ${ac_boost_path}/include/boost/version.hpp | cut -d" " -f 3 | tr -d '\r'`
-else
-  ROSE_MSG_ERROR([Unable to find $ac_boost_path/include/boost/version.hpp . Please specify the right boost installation path with --with-boost=/path/to/boost])
-fi
-
-AC_MSG_NOTICE([rose_boost_version = '$rose_boost_version'])
-
-if test "x$rose_boost_version" = "x"; then
-  ROSE_MSG_ERROR([Unable to compute the version of your Boost C++ libraries from '$ac_boost_path'/include/boost/version.hpp . Please make sure the file exists or specify the right path with --with-boost])
-fi
-
-# DQ (10/22/2015): Added more tests (1.55 through 1.62)
-# Define macros for conditional compilation of parts of ROSE based on version of boost
-# (this ONLY happens for the tests in tests/nonsmoke/functional/CompilerOptionsTests/testWave)
-#
-# !! We don't want conditional compilation or code in ROSE based on version numbers of Boost. !!
-#
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_1_35, test "$rose_boost_version" = "103500" -o "$_version" = "1.35")
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_1_36, test "$rose_boost_version" = "103600" -o "$_version" = "1.36")
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_1_37, test "$rose_boost_version" = "103700" -o "$_version" = "1.37")
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_1_38, test "$rose_boost_version" = "103800" -o "$_version" = "1.38")
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_1_39, test "$rose_boost_version" = "103900" -o "$_version" = "1.39")
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_1_40, test "$rose_boost_version" = "104000" -o "$_version" = "1.40")
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_1_41, test "$rose_boost_version" = "104100" -o "$_version" = "1.41")
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_1_42, test "$rose_boost_version" = "104200" -o "$_version" = "1.42")
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_1_43, test "$rose_boost_version" = "104300" -o "$_version" = "1.43")
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_1_44, test "$rose_boost_version" = "104400" -o "$_version" = "1.44")
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_1_45, test "$rose_boost_version" = "104500" -o "$_version" = "1.45")
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_1_46, test "$rose_boost_version" = "104600" -o "$_version" = "1.46")
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_1_46, test "$rose_boost_version" = "104601" -o "$_version" = "1.46")
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_1_47, test "$rose_boost_version" = "104700" -o "$_version" = "1.47")
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_1_48, test "$rose_boost_version" = "104800" -o "$_version" = "1.48")
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_1_49, test "$rose_boost_version" = "104900" -o "$_version" = "1.49")
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_1_50, test "$rose_boost_version" = "105000" -o "$_version" = "1.50")
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_1_51, test "$rose_boost_version" = "105100" -o "$_version" = "1.51")
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_1_52, test "$rose_boost_version" = "105200" -o "$_version" = "1.52")
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_1_53, test "$rose_boost_version" = "105300" -o "$_version" = "1.53")
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_1_54, test "$rose_boost_version" = "105400" -o "$_version" = "1.54")
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_1_55, test "$rose_boost_version" = "105500" -o "$_version" = "1.55")
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_1_56, test "$rose_boost_version" = "105600" -o "$_version" = "1.56")
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_1_57, test "$rose_boost_version" = "105700" -o "$_version" = "1.57")
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_1_58, test "$rose_boost_version" = "105800" -o "$_version" = "1.58")
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_1_59, test "$rose_boost_version" = "105900" -o "$_version" = "1.59")
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_1_60, test "$rose_boost_version" = "106000" -o "$_version" = "1.60")
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_1_61, test "$rose_boost_version" = "106100" -o "$_version" = "1.61")
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_1_62, test "$rose_boost_version" = "106200" -o "$_version" = "1.62")
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_1_63, test "$rose_boost_version" = "106300" -o "$_version" = "1.63")
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_1_64, test "$rose_boost_version" = "106400" -o "$_version" = "1.64")
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_1_65, test "$rose_boost_version" = "106500" -o "$_version" = "1.65")
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_1_66, test "$rose_boost_version" = "106600" -o "$_version" = "1.66")
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_1_67, test "$rose_boost_version" = "106700" -o "$_version" = "1.67")
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_1_68, test "$rose_boost_version" = "106800" -o "$_version" = "1.68")
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_1_69, test "$rose_boost_version" = "106900" -o "$_version" = "1.69")
-
-# DQ (10/22/2015): Added more tests (1.55 through 1.62)
-# TOO1 (3/16/2015):
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_GE_1_35, test $rose_boost_version -ge 103500)
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_GE_1_36, test $rose_boost_version -ge 103600)
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_GE_1_37, test $rose_boost_version -ge 103700)
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_GE_1_38, test $rose_boost_version -ge 103800)
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_GE_1_39, test $rose_boost_version -ge 103900)
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_GE_1_40, test $rose_boost_version -ge 104000)
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_GE_1_41, test $rose_boost_version -ge 104100)
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_GE_1_42, test $rose_boost_version -ge 104200)
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_GE_1_43, test $rose_boost_version -ge 104300)
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_GE_1_44, test $rose_boost_version -ge 104400)
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_GE_1_45, test $rose_boost_version -ge 104500)
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_GE_1_46, test $rose_boost_version -ge 104600)
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_GE_1_46, test $rose_boost_version -ge 104601)
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_GE_1_47, test $rose_boost_version -ge 104700)
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_GE_1_48, test $rose_boost_version -ge 104800)
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_GE_1_49, test $rose_boost_version -ge 104900)
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_GE_1_50, test $rose_boost_version -ge 105000)
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_GE_1_51, test $rose_boost_version -ge 105100)
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_GE_1_52, test $rose_boost_version -ge 105200)
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_GE_1_53, test $rose_boost_version -ge 105300)
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_GE_1_54, test $rose_boost_version -ge 105400)
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_GE_1_55, test $rose_boost_version -ge 105500)
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_GE_1_56, test $rose_boost_version -ge 105600)
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_GE_1_57, test $rose_boost_version -ge 105700)
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_GE_1_58, test $rose_boost_version -ge 105800)
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_GE_1_59, test $rose_boost_version -ge 105900)
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_GE_1_60, test $rose_boost_version -ge 106000)
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_GE_1_61, test $rose_boost_version -ge 106100)
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_GE_1_62, test $rose_boost_version -ge 106200)
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_GE_1_63, test $rose_boost_version -ge 106300)
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_GE_1_64, test $rose_boost_version -ge 106400)
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_GE_1_65, test $rose_boost_version -ge 106500)
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_GE_1_66, test $rose_boost_version -ge 106600)
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_GE_1_67, test $rose_boost_version -ge 106700)
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_GE_1_68, test $rose_boost_version -ge 106800)
-AM_CONDITIONAL(ROSE_USING_BOOST_VERSION_GE_1_69, test $rose_boost_version -ge 106900)
-
-# DQ (10/22/2015): Added acceptable case 1.54.
-# DQ (8/2/2016): Added acceptable case 1.55 through 1.61.
-# [Matzke, 2016-09-19] Acceptable cases now 1.49-1.53, 1.55-1.60 decided at Jun 17 meeting, but leaving in 1.61
-# [Matzke, 2019-01-31] Acceptable versions no 1.57-1.69. We decided to support only latest 10 versions from now on.
-boost_minimum_version=105700
-
-if test "$rose_boost_version" -lt "$boost_minimum_version"; then
-   if test "$ROSE_ENABLE_BOOST_VERSION_CHECK" = "yes"; then
-       AC_MSG_FAILURE([boost version $rose_boost_version is unsupported (need $boost_minimum_version or later)])
-   else      
-       AC_MSG_WARN([boost version $rose_boost_version is unsupported (need $boost_minimum_version or later)])
-   fi
-else
-   AC_MSG_NOTICE([reasonable version of Boost found: $rose_boost_version])
-fi
-
-# DQ (12/22/2008): Fix boost configure to handle OS with older version of Boost that will
-# not work with ROSE, and use the newer version specified by the user on the configure line.
-AC_MSG_NOTICE([in ROSE/configure: ac_boost_path = "$ac_boost_path"])
-#AC_DEFINE([ROSE_BOOST_PATH],"$ac_boost_path",[Location of Boost specified on configure line.])
-AC_DEFINE_UNQUOTED([ROSE_BOOST_PATH],"$ac_boost_path",[Location (unquoted) of Boost specified on configure line.])
-#AC_DEFINE([ROSE_WAVE_PATH],"$ac_boost_path/wave",[Location of Wave specified on configure line.])
-AC_DEFINE_UNQUOTED([ROSE_WAVE_PATH],"$ac_boost_path/wave",[Location (unquoted) of Wave specified on configure line.])
-
-AC_DEFINE_UNQUOTED([ROSE_BOOST_VERSION], $rose_boost_version, [Version of Boost specified on configure line.])
-
-AX_BOOST_ATOMIC
-AX_BOOST_SYSTEM
-AX_BOOST_THREAD
-AX_BOOST_DATE_TIME
-AX_BOOST_CHRONO
-AX_BOOST_RANDOM dnl needed by Wt and other libraries that use boost
-AX_BOOST_REGEX
-AX_BOOST_PROGRAM_OPTIONS
-#AX_BOOST_SERIALIZATION
-#AX_BOOST_ASIO
-#AX_BOOST_SIGNALS
-#AX_BOOST_TEST_EXEC_MONITOR
-AX_BOOST_FILESYSTEM
-AX_BOOST_WAVE
-#AX_BOOST_PYTHON
-AX_BOOST_IOSTREAMS
-
-# AM_CONDITIONAL(ROSE_USE_BOOST_WAVE,test "$with_wave" = true)
-AM_COND_IF([OS_MACOSX],[LDFLAGS="-Xlinker -rpath $ac_boost_path/lib $LDFLAGS"],[])
-
-# End macro ROSE_SUPPORT_BOOST.
-])
-
diff --git a/config/support-rose.m4 b/config/support-rose.m4
index 9692860956e..2eb08b38a7b 100644
--- a/config/support-rose.m4
+++ b/config/support-rose.m4
@@ -392,8 +392,6 @@ AC_SUBST(ROSE_HOME)
 
 AC_LANG(C++)
 
-ROSE_SUPPORT_BOOST
-
 # Rasmussen (12/16/2017): Added test for Bison version (Mac OSX Bison version may be too old)
 ROSE_SUPPORT_BISON
 
@@ -693,8 +691,6 @@ AC_PROG_MAKE_SET
 AC_MSG_NOTICE([testing the value of CC: (CC = "$CC")])
 AC_MSG_NOTICE([testing the value of CPPFLAGS: (CPPFLAGS = "$CPPFLAGS")])
 
-AX_BOOST_IOSTREAMS
-
 ROSE_SUPPORT_VECTORIZATION
 
 ROSE_SUPPORT_LIBHARU
diff --git a/config/support-summary.m4 b/config/support-summary.m4
index e844a4a1306..f2efd2486cd 100644
--- a/config/support-summary.m4
+++ b/config/support-summary.m4
@@ -58,29 +58,6 @@ ROSE_COMPILER_FEATURES([fortran], [$FC $FCLAGS], [HOST_FC_])
     echo "    Fortran                          ${support_fortran_frontend:-no}"
     echo "    OpenCL                           ${support_opencl_frontend:-no}"
 
-    #--------------------------------------------------------------------------------
-    ROSE_SUMMARY_HEADING([Boost library])
-    echo "    location                         ${ac_boost_path:-unknown}"
-    echo "    version constant                 ${rose_boost_version:-unknown}"
-    echo "    asio library                     ${BOOST_ASIO_LIB:-none}"
-    echo "    atomic library                   ${BOOST_ATOMIC_LIB:-none}"
-    echo "    chrono library                   ${BOOST_CHRONO_LIB:-none}"
-    echo "    date/time library                ${BOOST_DATE_TIME_LIB:-none}"
-    echo "    filesystem library               ${BOOST_FILESYSTEM_LIB:-none}"
-    echo "    iostreams library                ${BOOST_IOSTREAMS_LIB:-none}"
-    echo "    program options library          ${BOOST_PROGRAM_OPTIONS_LIB:-none}"
-    echo "    python library                   ${BOOST_PYTHON_LIB:-none}"
-    echo "    random library                   ${BOOST_RANDOM_LIB:-none}"
-    echo "    regex library                    ${BOOST_REGEX_LIB:-none}"
-    echo "    serialization library            ${BOOST_SERIALIZATION_LIB:-none}"
-    echo "    signals library                  ${BOOST_SIGNALS_LIB:-none}"
-    echo "    system library                   ${BOOST_SYSTEM_LIB:-none}"
-    echo "    test exec monitor library        ${BOOST_TEST_EXEC_MONITOR_LIB:-none}"
-    echo "    thread library                   ${BOOST_THREAD_LIB:-none}"
-    echo "    unit test framework library      ${BOOST_UNIT_TEST_FRAMEWORK_LIB:-none}"
-    echo "    wave library                     ${BOOST_WAVE_LIB:-none}"
-    echo "    wserialization library           ${BOOST_WSERIALIZATION_LIB:-none}"
-
     #--------------------------------------------------------------------------------
     if test -n "$support_cxx_frontend" -o -n "$verbose"; then
         ROSE_SUMMARY_HEADING([C/C++ analysis support])
diff --git a/configure.ac b/configure.ac
index 765bbe83ea0..39dd67585fc 100644
--- a/configure.ac
+++ b/configure.ac
@@ -143,7 +143,6 @@ ROSE_SUPPORT_ROSE_PART_6
 ROSE_SUPPORT_ROSE_PART_7
 
 dnl Fail gracefully for blacklisted dependencies and other situations
-ROSE_SUPPORT_BLACKLIST
 ROSE_SUPPORT_SUMMARY
 
 dnl Now generate all the output files (specified above)
diff --git a/rose_config.h.in.cmake b/rose_config.h.in.cmake
index c89cc8cf504..2cc322f3828 100644
--- a/rose_config.h.in.cmake
+++ b/rose_config.h.in.cmake
@@ -36,34 +36,6 @@
 /* Define to 1 if you have the <argz.h> header file. */
 #cmakedefine HAVE_ARGZ_H 1
 
-/* define if the Boost library is available , convert the cmake output Boost_FOUND to our custom HAVE_BOOST */
-#cmakedefine HAVE_BOOST
-
-/* define if the Boost::Date_Time library is available */
-#cmakedefine HAVE_BOOST_DATE_TIME
-
-/* define if the Boost::Filesystem library is available */
-#cmakedefine HAVE_BOOST_FILESYSTEM
-
-/* define if the Boost::PROGRAM_OPTIONS library is available */
-#cmakedefine HAVE_BOOST_PROGRAM_OPTIONS
-
-/* define if the Boost::Regex library is available */
-#cmakedefine HAVE_BOOST_REGEX
-
-/* define if the Boost::System library is available */
-#cmakedefine HAVE_BOOST_SYSTEM
-
-/* define if the Boost::Thread library is available */
-#cmakedefine HAVE_BOOST_THREAD
-
-/* define if the Boost::Wave library is available */
-#cmakedefine HAVE_BOOST_WAVE
-#cmakedefine USE_ROSE_BOOST_WAVE_SUPPORT
-
-/* Define if the boost::serialization library is available */
-#cmakedefine HAVE_BOOST_SERIALIZATION_LIB 1
-
 /* Define if Z3 library is available */
 #cmakedefine ROSE_HAVE_Z3
 
@@ -510,9 +482,6 @@
 //AS Don't know what to do with this
 #undef RETSIGTYPE
 
-/* Location (unquoted) of Boost specified on configure line. */
-#define ROSE_BOOST_PATH "${BOOST_ROOT}"
-
 /* Location of ROSE Compile Tree. */
 #define ROSE_COMPILE_TREE_PATH ${ROSE_TOP_BINARY_DIR}
 
diff --git a/src/Makefile.am b/src/Makefile.am
index 7012b41b2e8..ef9ef7ee547 100644
--- a/src/Makefile.am
+++ b/src/Makefile.am
@@ -90,12 +90,7 @@ endif
 
 librose_la_SOURCES = dummyCppFileForLibrose.C
 
-librose_la_LIBADD = $(BOOST_LDFLAGS) $(libroseLibraries) $(JAVA_JVM_FLAGS) -lm $(RT_LIBS) \
-          $(BOOST_DATE_TIME_LIB) \
-          $(BOOST_THREAD_LIB) $(BOOST_FILESYSTEM_LIB) \
-          $(BOOST_PROGRAM_OPTIONS_LIB) $(BOOST_REGEX_LIB) \
-          $(BOOST_SYSTEM_LIB) $(BOOST_SERIALIZATION_LIB) \
-          $(BOOST_WAVE_LIB) $(BOOST_IOSTREAMS_LIB)
+librose_la_LIBADD = $(libroseLibraries) $(JAVA_JVM_FLAGS) -lm $(RT_LIBS)
 
 if ROSE_USE_GCC_OMP
    librose_la_LIBADD += lgomp
@@ -143,22 +138,10 @@ rose_config_LDFLAGS += -fno-rtti
 
 rose_config_installed_cppflags =		\
 	-I@includedir@/rose			\
-	$(ROSE_PCH_INCLUDE)			\
-	$(BOOST_CPPFLAGS)
+	$(ROSE_PCH_INCLUDE)
 
 rose_config_installed_ldflags =			\
 	-L@libdir@ -lrose			\
-	$(BOOST_LDFLAGS)			\
-	$(BOOST_DATE_TIME_LIB)			\
-	$(BOOST_THREAD_LIB)			\
-	$(BOOST_FILESYSTEM_LIB)			\
-	$(BOOST_PROGRAM_OPTIONS_LIB)		\
-	$(BOOST_REGEX_LIB)			\
-	$(BOOST_SYSTEM_LIB)			\
-	$(BOOST_SERIALIZATION_LIB)		\
-	$(BOOST_WAVE_LIB)			\
-	$(BOOST_IOSTREAMS_LIB)			\
-	$(BOOST_CHRONO_LIB)			\
 	$(JAVA_JVM_LINK)			\
 	$(RT_LIBS)				\
 	$(ROSE_INTEL_COMPILER_MATH_LIBS)	\
@@ -237,10 +220,6 @@ rose_fortran_LDADD        = $(LDADD_ROSEBIN)
 ########################################################################################################################
 # Test that a simple ROSE program can run, and as a side effect, print some version numbers.
 
-check-boost:
-	@echo "  TEST     boost shared linkage [rose-compiler]"
-	${AM_V_at}$(top_srcdir)/scripts/check_boost_linkage.sh .libs/rose-compiler >&2
-
 check-dynload:
 	@echo "  TEST     whether a trivial ROSE program runs [rose-compiler]"
 	${AM_V_at}if ! ./rose-compiler --version; then                                           \
@@ -295,7 +274,6 @@ check-hello-fortran:
 endif
 
 check-local: $(bin_PROGRAMS)
-	${AM_V_at}$(MAKE) check-boost
 	${AM_V_at}$(MAKE) check-dynload
 	${AM_V_at}$(MAKE) check-config
 if ROSE_BUILD_C_LANGUAGE_SUPPORT
diff --git a/src/ROSETTA/src/Makefile.am b/src/ROSETTA/src/Makefile.am
index 150b858fe80..d45eee5e697 100644
--- a/src/ROSETTA/src/Makefile.am
+++ b/src/ROSETTA/src/Makefile.am
@@ -116,14 +116,7 @@ CxxGrammarMetaProgram_SOURCES = \
 
 # buildConstructorsWithoutSourcePositionInformation.o: buildConstructorsWithoutSourcePositionInformation.C
 
-BoostLibraries = \
-  $(BOOST_LDFLAGS) $(BOOST_DATE_TIME_LIB)           \
-  $(BOOST_THREAD_LIB) $(BOOST_FILESYSTEM_LIB) $(BOOST_PROGRAM_OPTIONS_LIB)  \
-  $(BOOST_REGEX_LIB)  $(BOOST_SYSTEM_LIB) $(BOOST_SERIALIZATION_LIB)    \
-  $(BOOST_WAVE_LIB) $(BOOST_IOSTREAMS_LIB)
-
 CxxGrammarMetaProgram_LDADD = \
-  $(ROSE_BOOST_LIBS) \
   $(top_builddir)/src/util/libroseutil.la \
   $(RT_LIBS)
 
diff --git a/src/frontend/SageIII/Makefile.am b/src/frontend/SageIII/Makefile.am
index 1d94a9aa561..9c76172d0ab 100644
--- a/src/frontend/SageIII/Makefile.am
+++ b/src/frontend/SageIII/Makefile.am
@@ -135,8 +135,8 @@ libsage3_la_SOURCES = $(libsage3Sources) preproc-c.ll omp_exprparser_lexer.ll om
 # nodist_libsage3_la_SOURCES = $(ROSETTA_GENERATED_SOURCE) $(top_builddir)/rose_config.h
 nodist_libsage3_la_SOURCES = $(ROSETTA_GENERATED_SOURCE) license_string.h
 
-if ROSE_USE_BOOST_WAVE
-libsage3_la_LIBADD= \
+#if ROSE_USE_BOOST_WAVE
+libsage3_la_LIBADD_not_used= \
   astFixup/libastFixup.la \
   accparser/libaccparser.la \
   ompparser/libompparser.la \
@@ -146,7 +146,7 @@ libsage3_la_LIBADD= \
   astHiddenTypeAndDeclarationLists/libastHiddenTypeAndDeclarationLists.la \
   includeDirectivesProcessing/libincludeDirectivesProcessing.la \
   astTokenStream/libastTokenStream.la
-else
+#else
 libsage3_la_LIBADD= \
   astFixup/libastFixup.la \
   accparser/libaccparser.la \
@@ -156,7 +156,7 @@ libsage3_la_LIBADD= \
   virtualCFG/libvirtualCFG.la \
   astHiddenTypeAndDeclarationLists/libastHiddenTypeAndDeclarationLists.la \
   includeDirectivesProcessing/libincludeDirectivesProcessing.la
-endif
+#endif
 
 # DQ (6/25/2011): Readded this directory so that we can support the older behavior as a default
 # although this will likely fail at least some of the nearly one hundred new name qualification tests.
diff --git a/src/frontend/SageIII/astTokenStream/Makefile.am b/src/frontend/SageIII/astTokenStream/Makefile.am
index eb8b3690451..ae7f5044221 100644
--- a/src/frontend/SageIII/astTokenStream/Makefile.am
+++ b/src/frontend/SageIII/astTokenStream/Makefile.am
@@ -2,7 +2,7 @@ include $(top_srcdir)/config/Makefile.for.ROSE.includes.and.libs
 
 AM_CPPFLAGS = $(ROSE_INCLUDES)
 
-if ROSE_USE_BOOST_WAVE
+#if ROSE_USE_BOOST_WAVE
 
 # DQ (10/27/2013): Commented out for now from this Makefile.am (experimenting with replacing with new implementation independent of WAVE).
 # libastTokenStream_la_SOURCES      = createMap.C  doCompleteMapping.C  linearizeAST.C unparseMacro.C
@@ -10,7 +10,7 @@ if ROSE_USE_BOOST_WAVE
 # libastTokenStream_la_DEPENDENCIES = 
 # include_HEADERS = createMap.h  doCompleteMapping.h  linearizeAST.h unparseMacro.h
 
-endif
+#endif
 
 
 # DQ (10/27/2013): This is a new definition of libastTokenStream
diff --git a/src/frontend/SageIII/rose_attributes_list.C b/src/frontend/SageIII/rose_attributes_list.C
index 318ba9fa833..0d9e80461a2 100644
--- a/src/frontend/SageIII/rose_attributes_list.C
+++ b/src/frontend/SageIII/rose_attributes_list.C
@@ -14,22 +14,6 @@
 // #if (CAN_NOT_COMPILE_WITH_ROSE == 0)
 // #ifndef USE_ROSE
 
-///////////////////////////////////////////////////////////////////////////////
-//  Include the token class from Wave
-///////////////////////////////////////////////////////////////////////////////
-
-#ifndef ROSE_SKIP_COMPILATION_OF_WAVE
-//  Include Wave itself
-#include <boost/wave.hpp>
-
-token_container wave_tokenStream;
-#endif
-
-// #include <boost/wave/grammars/cpp_xpression_grammar.hpp> //as_string
-
-// #endif
-
-
 // DQ (9/30/2013): This global variable is used in only the initial accumulation of
 // the CPP directives, comments and tokens by file name in the src/frontend/SageIII/preproc-c.ll
 // file.  Later after processin it is an empty map (e.g. in the unparsing phase).
@@ -39,8 +23,6 @@ token_container wave_tokenStream;
 // to get this by a traversal of the AST
 std::map<std::string,ROSEAttributesList* > mapFilenameToAttributes;
 
-
-
 // DQ (12/31/2005): This is OK if not declared in a header file
 using namespace std;
 using namespace Rose;
diff --git a/src/frontend/SageIII/rose_attributes_list.h b/src/frontend/SageIII/rose_attributes_list.h
index aae9c45fca6..8567fd3043b 100644
--- a/src/frontend/SageIII/rose_attributes_list.h
+++ b/src/frontend/SageIII/rose_attributes_list.h
@@ -30,74 +30,6 @@
 // #if !CAN_NOT_COMPILE_WITH_ROSE
 // #ifndef USE_ROSE
 
-// DQ (5/21/2010): I have built a separate macro for tuning off the compilation of WAVE
-// since it is done only for the purpose of allowing ROSE based projects:
-//     1) projects/DocumentationGenerator
-//     2) projects/haskellport
-// to process the ROSE files cleanly.  ROSE can however process and compile ROSE
-// (including a slightly modified version of WAVE that EDG will accept) and we
-// separately test this in noightly tests.  The previous 5/18/2010 fix to permit
-// the Haskell support to skip processign WAVE turned this off and broke the nightly
-// tests of ROSE compiling ROSE.  This use of the macro ROSE_SKIP_COMPILATION_OF_WAVE
-// it menat to be turned on by ROSE based tools that need to process the ROSE code
-// and which currently fail (because of Wave) and so turn of the processing of Wave
-// for those tools.
-// #ifdef USE_ROSE
-//  #define ROSE_SKIP_COMPILATION_OF_WAVE
-// #endif
-
-// DQ (2/27/2016): Check for DEBIAN and Boost 1.54 and disable WAVE (not found in
-// Boost 1.54, for Debian OS installations, as I understand it).  This is a fix
-// for a bug identified to be specific to Boost 1.54 on Debian systems, so that
-// is why it is so specific in deactivating boost::wave.  To support this the
-// boost::wave support had to be revisited to permit it to NOT be a dependence.
-// We shuld put in place tests that make sure it does not accedently become a
-// dependence in the future.
-#ifdef ROSE_DEBIAN_OS_VENDOR
-   #if (ROSE_BOOST_VERSION == 105400)
-      #define ROSE_SKIP_COMPILATION_OF_WAVE
-   #endif
-#endif
-
-#if __sun
-  // PP 05/16/19
-  // Continue skipping WAVE until it is needed
-  // (after boost 1.65 is working on Solaris, WAVE should also work)
-  #define ROSE_SKIP_COMPILATION_OF_WAVE
-#endif
-
-// DQ (2/27/2016): Test compilation of ROSE without boost::wave support.
-// #define ROSE_SKIP_COMPILATION_OF_WAVE
-
-#ifndef ROSE_SKIP_COMPILATION_OF_WAVE
-//  #if _MSC_VER < 1600  // 1600 == VC++ 10.0
-  #if (!defined(_MSC_VER) || (_MSC_VER > 1600))
-    #include <boost/preprocessor/iteration/iterate.hpp> // Liao, 7/10/2009, required by GCC 4.4.0 for a #define line of BOOST_PP_ITERATION_DEPTH
-    #ifdef _MSC_VER
-      #include <boost/wave.hpp> // CH (4/7/2010): Put this header here to avoid compiling error about mismatch between defination and declaration
-    #endif
-    #include <boost/wave/cpplexer/cpp_lex_token.hpp>    // token class
-    #include <boost/wave/cpplexer/cpp_lex_iterator.hpp>   // lexer type
-  #else
-// #warning "Setting CAN_NOT_COMPILE_WITH_ROSE to value = 1"
-// #define CAN_NOT_COMPILE_WITH_ROSE 1
-// tps (12/4/2009) : This is not found in VC++ 10.0 and Boost 1.4
-    #pragma message ("Boost preprocessor and wave not included yet for VC++ 10.0")
-
-  #endif
-#endif
-
-//template boost::wave::cpplexer::impl::token_data<std::string, boost::wave::util::file_position_type>::delete(std::size_t) ;
-// DQ (10/16/2002): Required for compiling with SUN 5.2 C++ compiler
-#ifndef NAMESPACE_IS_BROKEN
-// DQ (12/30/2005): This is a Bad Bad thing to do (I can explain)
-// it hides names in the global namespace and causes errors in
-// otherwise valid and useful code. Where it is needed it should
-// appear only in *.C files (and only ones not included for template
-// instantiation reasons) else they effect user who use ROSE unexpectedly.
-// using namespace std;
-#endif
-
 class ROSE_DLL_API PreprocessingInfo;
 class ROSEAttributesList;
 //AS(01/04/07) Global map of filenames to PreprocessingInfo*'s as it is inefficient
diff --git a/src/rose.h b/src/rose.h
index 1cd1fb21e57..e26a4451fec 100644
--- a/src/rose.h
+++ b/src/rose.h
@@ -9,7 +9,6 @@
 
 #include "sage3basic.hhh"
 // DQ (4/21/2009): Andreas needs to add a comment about what this is for...
-#define BOOST_WAVE_PREPROCESS_PRAGMA_BODY 1
 
 #include "rosedefs.h"
 
diff --git a/tests/nonsmoke/functional/CompileTests/Cxx_tests/Makefile.am b/tests/nonsmoke/functional/CompileTests/Cxx_tests/Makefile.am
index 814ab403dea..47a806f90b5 100644
--- a/tests/nonsmoke/functional/CompileTests/Cxx_tests/Makefile.am
+++ b/tests/nonsmoke/functional/CompileTests/Cxx_tests/Makefile.am
@@ -2488,15 +2488,9 @@ else
      rose-1701-1.C
 endif
 
-if ROSE_USING_BOOST_VERSION_1_57
-  TESTCODE_CURRENTLY_FAILING += \
-     test2014_77.C \
-     test2014_78.C 
-else
-  EXAMPLE_TESTCODES_REQUIRED_TO_PASS += \
+EXAMPLE_TESTCODES_REQUIRED_TO_PASS += \
      test2014_77.C \
      test2014_78.C 
-endif
 
 if USING_CLANG_COMPILER
   TESTCODE_CURRENTLY_FAILING += \
diff --git a/tests/nonsmoke/functional/CompilerOptionsTests/testWave/Makefile.am b/tests/nonsmoke/functional/CompilerOptionsTests/testWave/Makefile.am
index dea4d05ab9b..e147e1a742b 100644
--- a/tests/nonsmoke/functional/CompilerOptionsTests/testWave/Makefile.am
+++ b/tests/nonsmoke/functional/CompilerOptionsTests/testWave/Makefile.am
@@ -96,10 +96,10 @@ check-local:
 	@echo "************************************************************************************************"
 	@echo "*** ROSE/tests/nonsmoke/functional/CompilerOptionsTests/testWave: make check rule start                          ***"
 	@echo "************************************************************************************************"
-if ROSE_USING_BOOST_VERSION_1_35
+#if ROSE_USING_BOOST_VERSION_1_35
 #	It is not helpful to have Boost version dependent tests in ROSE.
 	@$(MAKE) $(PASSING_TEST_Objects)
-endif
+#endif
 	@echo "************************************************************************************************"
 	@echo "*** ROSE/tests/nonsmoke/functional/CompilerOptionsTests/testWave: make check rule complete (terminated normally) ***"
 	@echo "************************************************************************************************"
diff --git a/tests/nonsmoke/functional/RunTests/FortranTests/LANL_POP/.gitignore b/tests/nonsmoke/functional/RunTests/FortranTests/LANL_POP/.gitignore
deleted file mode 100644
index 70823417cae..00000000000
--- a/tests/nonsmoke/functional/RunTests/FortranTests/LANL_POP/.gitignore
+++ /dev/null
@@ -1,2 +0,0 @@
-!Makefile.in
-/Makefile.in
diff --git a/tests/nonsmoke/functional/roseTests/programAnalysisTests/Makefile.am b/tests/nonsmoke/functional/roseTests/programAnalysisTests/Makefile.am
index ed626e970d2..2ed697d950d 100644
--- a/tests/nonsmoke/functional/roseTests/programAnalysisTests/Makefile.am
+++ b/tests/nonsmoke/functional/roseTests/programAnalysisTests/Makefile.am
@@ -13,9 +13,9 @@ SUBDIRS = 					\
 
 # DQ (4/4/2017): Note that Boost 1.62 version is problematic and Boost suggests using an older version.
 # There is nothing that ROSE can do about this except skip some tests that require problem features of Boost 1.62.
-if !ROSE_USING_BOOST_VERSION_1_62
+#if !ROSE_USING_BOOST_VERSION_1_62
 SUBDIRS += staticInterproceduralSlicingTests
-endif
+#endif
 
 # ROSE Test Harness scripts
 #CHECK_ANSWER = $(top_srcdir)/scripts/test_against_answer

From 583e95501dbcdd0d5b5dab760184af481ec8f64e Mon Sep 17 00:00:00 2001
From: Yonghong Yan <yanyh15@gmail.com>
Date: Tue, 12 Nov 2024 23:16:55 -0500
Subject: [PATCH 18/42] deBoost: removing boost usage in src/util/StringUtility

---
 src/util/StringUtility/Escape.C             |  5 +--
 src/util/StringUtility/FileNameClassifier.C | 11 ++-----
 src/util/StringUtility/FileUtility.C        |  1 -
 src/util/StringUtility/NumberToString.C     | 34 ++++++++++-----------
 src/util/StringUtility/NumberToString.h     |  4 ++-
 src/util/StringUtility/Replace.C            | 24 +++++++++++++--
 src/util/StringUtility/Replace.h            |  4 ---
 src/util/StringUtility/StringUtility.h      |  5 +--
 src/util/StringUtility/Trim.h               |  1 -
 src/util/Unique.C                           | 27 ++++++++++++++++
 src/util/Unique.h                           | 13 ++++++++
 11 files changed, 90 insertions(+), 39 deletions(-)
 create mode 100644 src/util/Unique.C
 create mode 100644 src/util/Unique.h

diff --git a/src/util/StringUtility/Escape.C b/src/util/StringUtility/Escape.C
index 965ae282c4c..e36db6b1a20 100644
--- a/src/util/StringUtility/Escape.C
+++ b/src/util/StringUtility/Escape.C
@@ -4,7 +4,7 @@
 #include <iomanip>
 #include <cassert>
 #include <Replace.h>
-#include <boost/algorithm/string/case_conv.hpp>
+#include <cstring>
 
 namespace Rose {
 namespace StringUtility {
@@ -202,7 +202,8 @@ yamlEscape(const std::string &s) {
     } else if (s.find(':') != std::string::npos) {
         return "\"" + s + "\"";
     } else {
-        const std::string lc = boost::to_lower_copy(s);
+        std::string lc = s;
+        for (char&c: lc) c = std::tolower(c); //convert to lower case
         if ("yes" == lc || "true" == lc || "no" == lc || "false" == lc) {
             return"\"" + s + "\"";
         } else {
diff --git a/src/util/StringUtility/FileNameClassifier.C b/src/util/StringUtility/FileNameClassifier.C
index dec0a01d810..20028571ad8 100644
--- a/src/util/StringUtility/FileNameClassifier.C
+++ b/src/util/StringUtility/FileNameClassifier.C
@@ -23,6 +23,7 @@
 #include <algorithm>
 #include <map>
 #include <filesystem>
+#include <cassert>
 #include "FileUtility.h"
 #include <StringUtility.h>
 #include "mlog.h"
@@ -33,14 +34,6 @@
 #include <sys/utsname.h>
 #endif
 
-
-#include <boost/version.hpp>
-#if BOOST_VERSION >= 103600
-#  define BOOST_HAS_BRANCH_PATH has_parent_path
-#else
-#  define BOOST_HAS_BRANCH_PATH has_branch_path
-#endif
-
 using namespace std;
 using namespace Rose;
 
@@ -116,7 +109,7 @@ using namespace Rose;
             "execinfo.h", 
             "fcntl.h", 
             "features.h", 
-            "fenv.h", 
+            "fenv.h",
             "fmtmsg.h", 
             "fnmatch.h", 
             "fpu_control.h", 
diff --git a/src/util/StringUtility/FileUtility.C b/src/util/StringUtility/FileUtility.C
index 6d194618308..9ad36d1a9d1 100644
--- a/src/util/StringUtility/FileUtility.C
+++ b/src/util/StringUtility/FileUtility.C
@@ -10,7 +10,6 @@
 #include "mlog.h"
 
 // Other includes
-#include <boost/lexical_cast.hpp>
 #include <cstring>
 #include <errno.h>                                      // DQ (9/29/2006): This is required for 64-bit g++ 3.4.4 compiler.
 #include <inttypes.h>
diff --git a/src/util/StringUtility/NumberToString.C b/src/util/StringUtility/NumberToString.C
index 7445d8b6ace..f0c7b1752f1 100644
--- a/src/util/StringUtility/NumberToString.C
+++ b/src/util/StringUtility/NumberToString.C
@@ -1,8 +1,5 @@
 #include <NumberToString.h>
 
-#include <boost/format.hpp>
-#include <boost/lexical_cast.hpp>
-
 namespace Rose {
 namespace StringUtility {
 
@@ -12,32 +9,32 @@ namespace StringUtility {
 
 std::string
 numberToString(long long x) {
-    return boost::lexical_cast<std::string>(x);
+    return std::to_string(x);
 }
 
 std::string
 numberToString(unsigned long long x) {
-    return boost::lexical_cast<std::string>(x);
+    return std::to_string(x);
 }
 
 std::string
 numberToString(long x) {
-    return boost::lexical_cast<std::string>(x);
+    return std::to_string(x);
 }
 
 std::string
 numberToString(unsigned long x) {
-    return boost::lexical_cast<std::string>(x);
+    return std::to_string(x);
 }
 
 std::string
 numberToString(int x) {
-    return boost::lexical_cast<std::string>(x);
+    return std::to_string(x);
 }
 
 std::string
 numberToString(unsigned int x) {
-    return boost::lexical_cast<std::string>(x);
+    return std::to_string(x);
 }
 
 std::string
@@ -61,16 +58,14 @@ numberToString(double x) {
     __WORDSIZE == 64
 std::string
 numberToString( __int128 x) {
-    // DQ (2/22/2014): I don't think that the boost::lexical_cast can support __int128 yet.
     long long temp_x = (long long) x;
-    return boost::lexical_cast<std::string>(temp_x);
+    return std::to_string(temp_x);
 }
 
 std::string
 numberToString(unsigned __int128 x) {
-    // DQ (2/22/2014): I don't think that the boost::lexical_cast can support __int128 yet.
     unsigned long long temp_x = (unsigned long long) x;
-    return boost::lexical_cast<std::string>(temp_x);
+    return std::to_string(temp_x);
 }
 #endif
 
@@ -98,10 +93,15 @@ toHex2(uint64_t value, size_t nbits, bool show_unsigned_decimal, bool show_signe
     uint64_t sign_bit = ((uint64_t)1 << (nbits-1));
 
     // Hexadecimal value
-    std::string retval;
-    int nnibbles = (nbits+3)/4;
-    std::string fmt = "0x%0" + boost::lexical_cast<std::string>(nnibbles) + "x";
-    retval = (boost::format(fmt) % value).str();
+
+    //std::string retval;
+    //int nnibbles = (nbits+3)/4;
+    //std::string fmt = "0x%0" + std::to_string(nnibbles) + "x";
+    //retval = (boost::format(fmt) % value).str();
+
+    std::stringstream ss;
+    ss << "0x" << std::setw((nbits + 3) / 4) << std::setfill('0') << std::hex << value;
+    std::string retval = ss.str();
 
     // unsigned decimal
     bool showed_unsigned = false;
diff --git a/src/util/StringUtility/NumberToString.h b/src/util/StringUtility/NumberToString.h
index c4a74da8849..d6a9fab62b4 100644
--- a/src/util/StringUtility/NumberToString.h
+++ b/src/util/StringUtility/NumberToString.h
@@ -5,6 +5,9 @@
 #include <rosedll.h>
 
 #include <string>
+#include <sstream>
+#include <iomanip>
+#include <cassert>
 
 namespace Rose {
 namespace StringUtility {
@@ -15,7 +18,6 @@ namespace StringUtility {
 
 /** Convert an integer to a string.
  *
- *  These functions are wrappers around <code>boost::lexical_cast<std::string></code>.
  *
  *  @{ */
 ROSE_UTIL_API std::string numberToString(long long);
diff --git a/src/util/StringUtility/Replace.C b/src/util/StringUtility/Replace.C
index 89ca31997bf..3d2ffb5c6c5 100644
--- a/src/util/StringUtility/Replace.C
+++ b/src/util/StringUtility/Replace.C
@@ -7,8 +7,28 @@ namespace StringUtility {
 //                                     Replace
 ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 std::string replaceAllCopy(const std::string& input, const std::string& search, const std::string & replacedWith) {
-	return boost::replace_all_copy(input, search, replacedWith);
-	//TODO: for deBoost, this can be replaced with std::replace_copy when the compiler bumps to support c++17 by default
+	if (search.empty()) return input;  // Avoid infinite loop if 'search' is empty
+
+	std::string result;
+	result.reserve(input.size());  // Reserve space to avoid multiple allocations
+
+	std::size_t start_pos = 0;
+	std::size_t found_pos;
+
+	// Iterate through the input string
+	while ((found_pos = input.find(search, start_pos)) != std::string::npos) {
+	    // Append the part before the found substring
+	    result.append(input, start_pos, found_pos - start_pos);
+	    // Append the replacement substring
+	    result.append(replacedWith);
+	    // Update start position to continue after the found substring
+	    start_pos = found_pos + search.size();
+	}
+
+	// Append the rest of the string after the last found position
+	result.append(input, start_pos, input.size() - start_pos);
+
+	return result;
 }
 
 } // namespace
diff --git a/src/util/StringUtility/Replace.h b/src/util/StringUtility/Replace.h
index 8411d3852ce..430a934cde8 100644
--- a/src/util/StringUtility/Replace.h
+++ b/src/util/StringUtility/Replace.h
@@ -3,8 +3,6 @@
 
 #include <string>
 #include <rosedll.h>
-#include "boost/algorithm/string/replace.hpp"
-
 
 namespace Rose {
 namespace StringUtility {
@@ -14,8 +12,6 @@ namespace StringUtility {
 ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
 
 /** Replace a pattern with another one in a string
- *
- *  These functions are wrappers around <code>boost::replace_all_copy</code>.
  *
  *  @{ */
 ROSE_UTIL_API std::string replaceAllCopy(const std::string& input, const std::string& search, const std::string & replacedWith);
diff --git a/src/util/StringUtility/StringUtility.h b/src/util/StringUtility/StringUtility.h
index e5f99e24bde..6c9c64f1e9c 100644
--- a/src/util/StringUtility/StringUtility.h
+++ b/src/util/StringUtility/StringUtility.h
@@ -12,8 +12,9 @@ namespace Rose {
 
 /** Functions for operating on strings.
  *
- *  This name space provides functions for operating on strings.  See also, Boost String Algo
- *  [http://http://www.boost.org/doc/libs/1_78_0/doc/html/string_algo.html]. */
+ *  This name space provides functions for operating on strings.
+ *
+ */
 namespace StringUtility {}
 
 // DQ (1/21/2010): Use this to turn off the use of #line in ROSETTA generated code.
diff --git a/src/util/StringUtility/Trim.h b/src/util/StringUtility/Trim.h
index 8eaca6a8e77..7ae773d8dbe 100644
--- a/src/util/StringUtility/Trim.h
+++ b/src/util/StringUtility/Trim.h
@@ -3,7 +3,6 @@
 #include <string>
 #include <algorithm>
 
-// To replace boost::trim
 std::string trim(const std::string& str) {
     size_t start = str.find_first_not_of(" \t\n\r");
     if (start == std::string::npos)
diff --git a/src/util/Unique.C b/src/util/Unique.C
new file mode 100644
index 00000000000..63f71dc0023
--- /dev/null
+++ b/src/util/Unique.C
@@ -0,0 +1,27 @@
+#include <iostream>
+#include <fstream>
+#include <chrono>
+#include <iomanip>
+#include <sstream>
+
+namespace Rose {
+namespace Unique {
+
+std::string
+genUniqueID() {
+	// Get the current timestamp
+    auto now = std::chrono::system_clock::now();
+    auto duration = now.time_since_epoch();
+    auto timestamp = std::chrono::duration_cast<std::chrono::milliseconds>(duration).count();
+
+    // Use a counter to ensure uniqueness if generated within the same millisecond
+    static int counter = 0;
+
+    // Construct a unique id using a hex representation of the timestamp and counter
+    std::ostringstream oss;
+    oss << std::hex << timestamp << std::setw(4) << std::setfill('0') << counter++;
+    return oss.str();
+}
+
+} // namespace
+} // namespace
diff --git a/src/util/Unique.h b/src/util/Unique.h
new file mode 100644
index 00000000000..9f97825340e
--- /dev/null
+++ b/src/util/Unique.h
@@ -0,0 +1,13 @@
+#ifndef ROSE_UNIQUE_H
+#define ROSE_UNIQUE_H
+
+namespace Rose {
+
+namespace Unique {
+
+ROSE_UTIL_API std::string genUniqueID();
+
+} // namespace
+} // namespace
+
+#endif

From 86e5bd0f0fd7a43dddc0e3664b97b59de50525ea Mon Sep 17 00:00:00 2001
From: Yonghong Yan <yanyh15@gmail.com>
Date: Tue, 12 Nov 2024 23:40:36 -0500
Subject: [PATCH 19/42] deBoost: now boost usage are all removed from src/util

---
 src/util/CMakeLists.txt                                 | 3 ++-
 src/util/Makefile.am                                    | 4 ++--
 src/util/commandlineProcessing/commandline_processing.C | 2 --
 src/util/commandlineProcessing/sla++.C                  | 1 -
 src/util/mlog.C                                         | 7 -------
 src/util/rose_isnan.h                                   | 6 +++---
 src/util/support/FileHelper.h                           | 5 ++---
 7 files changed, 9 insertions(+), 19 deletions(-)

diff --git a/src/util/CMakeLists.txt b/src/util/CMakeLists.txt
index 37ec0ed2375..bbc56b798b9 100644
--- a/src/util/CMakeLists.txt
+++ b/src/util/CMakeLists.txt
@@ -55,6 +55,7 @@ add_subdirectory(support)
 set(rose_util_src
   ${CMAKE_BINARY_DIR}/src/util/rose_paths.C
   FileSystem.C
+  Unique.C
   mlog.C
   rose_getline.C
   processSupport.C
@@ -74,6 +75,6 @@ target_sources(roseUtil INTERFACE
 
 ########### install files ###############
 install(FILES
-  processSupport.h rose_paths.h mlog.h FileSystem.h
+  processSupport.h rose_paths.h mlog.h FileSystem.h Unique.h
   timing.h rose_getline.h rose_strtoull.h rose_isnan.h
   DESTINATION ${INCLUDE_INSTALL_DIR})
diff --git a/src/util/Makefile.am b/src/util/Makefile.am
index 490e2febc0c..1238a31ce64 100644
--- a/src/util/Makefile.am
+++ b/src/util/Makefile.am
@@ -30,7 +30,7 @@ noinst_LTLIBRARIES = libroseutil.la
 libroseutil_la_SOURCES =			\
 	processSupport.C			\
 	rose_getline.C				\
-	rose_strtoull.C mlog.C FileSystem.C
+	rose_strtoull.C mlog.C FileSystem.C Unique.C
 
 nodist_libroseutil_la_SOURCES = rose_paths.C
 libroseutil_la_LIBADD = \
@@ -54,7 +54,7 @@ pkginclude_HEADERS =				\
 	rose_isnan.h				\
 	rose_paths.h				\
 	rose_strtoull.h				\
-	mlog.h FileSystem.h
+	mlog.h FileSystem.h Unique.h
 
 EXTRA_DIST = CMakeLists.txt utilDocumentation.docs
 
diff --git a/src/util/commandlineProcessing/commandline_processing.C b/src/util/commandlineProcessing/commandline_processing.C
index 01ecd59390e..1fa080f4221 100644
--- a/src/util/commandlineProcessing/commandline_processing.C
+++ b/src/util/commandlineProcessing/commandline_processing.C
@@ -7,14 +7,12 @@
 #include "mlog.h"
 #include <vector>
 #include <algorithm>
-#include <boost/algorithm/string/predicate.hpp>
 #include <rose_paths.h>
 
 // Use Brian Gunney's String List Assignent (SLA) library
 #include "sla.h"
 
 #ifdef _MSC_VER
-# include <boost/lexical_cast.hpp>
 #else
 # include <time.h>
 #endif
diff --git a/src/util/commandlineProcessing/sla++.C b/src/util/commandlineProcessing/sla++.C
index 18bbe59d733..5028d1e6ba4 100644
--- a/src/util/commandlineProcessing/sla++.C
+++ b/src/util/commandlineProcessing/sla++.C
@@ -106,7 +106,6 @@ Return: The number of value found.  If pname is not a list, the number of
 #endif
 
 #if (_WIN32)
- #include <boost/regex.h>
 // #include <regex.h>
 #else
  #include <regex.h>
diff --git a/src/util/mlog.C b/src/util/mlog.C
index 26e41c5d985..cfaf638ac2a 100644
--- a/src/util/mlog.C
+++ b/src/util/mlog.C
@@ -8,10 +8,6 @@
 #include <stdio.h>
 #include "mlog.h"
 
-#if defined(REX_STACKTRACE_ABORT_BOOST)
-#include <boost/stacktrace.hpp>
-#endif
-
 int mlogLevel = DEFAULT_MLOG_LEVEL;
 
 /**
@@ -80,9 +76,6 @@ void mlogAssertFail_C(const char * subject, const char * expr, const char * file
 	    va_end(l);
 	    fflush(mlogFile);
 	}
-#if defined(REX_STACKTRACE_ABORT_BOOST)
-	std::cerr << boost::stacktrace::stacktrace();
-#endif
 	abort();
 }
 
diff --git a/src/util/rose_isnan.h b/src/util/rose_isnan.h
index 867853f60e7..76ecadc89cc 100644
--- a/src/util/rose_isnan.h
+++ b/src/util/rose_isnan.h
@@ -1,14 +1,14 @@
 #ifndef ROSE_isnan_H
 #define ROSE_isnan_H
 
+#include <cmath>
+
 // In case anyone included a C header file, since isnan is a macro in C
 #undef isnan
 
-#include <boost/math/special_functions/fpclassify.hpp>
-
 template<typename T>
 bool rose_isnan(T x) {
-    return boost::math::isnan(x);
+    return std::isnan(x);
 }
 
 #endif
diff --git a/src/util/support/FileHelper.h b/src/util/support/FileHelper.h
index 81c505d3527..29f2de0705e 100644
--- a/src/util/support/FileHelper.h
+++ b/src/util/support/FileHelper.h
@@ -16,7 +16,6 @@
 
 #include <FileSystem.h>
 
-#include <boost/algorithm/string.hpp>
 #include <string>
 #include <filesystem>
 
@@ -152,7 +151,7 @@ class FileHelper {
     }
 
     static bool endsWith(const std::string& str1, const std::string& str2) { //checks that str1 ends with str2
-        return boost::ends_with(str1, str2);
+        if (str2.size() > str1.size()) return false;
+        return str1.compare(str1.size() - str2.size(), str2.size(), str2) == 0;
     }
-
 };

From b40daa8d6a408dea874082280de061cdf2447838 Mon Sep 17 00:00:00 2001
From: Yonghong Yan <yanyh15@gmail.com>
Date: Wed, 13 Nov 2024 00:01:52 -0500
Subject: [PATCH 20/42] deBoost: remove boost usage in src/3rdPartyLibraries,
 mainly remove sarif support

---
 src/3rdPartyLibraries/json/Makefile.am   |    5 +-
 src/3rdPartyLibraries/json/README        |   28 +-
 src/3rdPartyLibraries/json/roseSarif.hpp |  311 --
 src/3rdPartyLibraries/json/sarif.hpp     | 6027 ----------------------
 4 files changed, 2 insertions(+), 6369 deletions(-)
 delete mode 100644 src/3rdPartyLibraries/json/roseSarif.hpp
 delete mode 100644 src/3rdPartyLibraries/json/sarif.hpp

diff --git a/src/3rdPartyLibraries/json/Makefile.am b/src/3rdPartyLibraries/json/Makefile.am
index bee50062fa2..55fce0ca8f8 100644
--- a/src/3rdPartyLibraries/json/Makefile.am
+++ b/src/3rdPartyLibraries/json/Makefile.am
@@ -1,4 +1 @@
-SUBDIRS=nlohmann
-
-SARIF_includedir=$(prefix)/include/rose
-SARIF_include_HEADERS=sarif.hpp roseSarif.hpp
+SUBDIRS=nlohmann
\ No newline at end of file
diff --git a/src/3rdPartyLibraries/json/README b/src/3rdPartyLibraries/json/README
index ed06a3d0944..0ccabf8b89b 100644
--- a/src/3rdPartyLibraries/json/README
+++ b/src/3rdPartyLibraries/json/README
@@ -6,30 +6,4 @@ nlohmann:
 This is the common nlohmann json library that is widely used in the
 C++ community.  The license allows it to be freely distributed with
 the constraint that the include file be in $(prefix)/nlohmann/json.hpp
--- the "nlohmann" part shall be preserved.
-
-sarif:
-
-This is an implementation of the Static Analysis Results Interchange
-Format (SARIF) v2.1.0 as defined here:
-
-  https://docs.oasis-open.org/sarif/sarif/v2.1.0/sarif-v2.1.0.html
-
-The sarif.hpp header was automatically generated using QuickType:
-
-  https://quicktype.io/
-
-Based on the JSON schema:
-
-  https://docs.oasis-open.org/sarif/sarif/v2.1.0/cos02/schemas/sarif-schema-2.1.0.json
-
-This automatically generated code has no license restrictions and
-only depends on the NLohmann JSON library.  The sarif.hpp header
-serves as a bridge between a C++-facing object model and the backing
-JSON representation.  An additional layer will be provided within
-ROSE that maps ROSE objects to the corresponding SARIF objects as well
-as sanitization of the emitted JSON to remove unnecessary null objects
-from appearing in the generated JSON.
-
-Note that the VERSION and SCHEMA constants were manually added after the code
-was generated by quicktype.
+-- the "nlohmann" part shall be preserved.
\ No newline at end of file
diff --git a/src/3rdPartyLibraries/json/roseSarif.hpp b/src/3rdPartyLibraries/json/roseSarif.hpp
deleted file mode 100644
index 5d545a203ac..00000000000
--- a/src/3rdPartyLibraries/json/roseSarif.hpp
+++ /dev/null
@@ -1,311 +0,0 @@
-//
-// ROSE/SARIF wrapper.  This provides an abstraction layer between
-// ROSE tools and the SARIF library that generates SARIF-formatted
-// JSON files.  This is intended to achieve two goals:
-//
-//   1. Insulate ROSE tools from the detail of SARIF.  Many
-//      seemingly simple things require layers of nested
-//      SARIF objects where the nesting structure requires
-//      some knowledge of the SARIF format.  Encapsulating
-//      that detail in the wrapper reduces the exposure of
-//      ROSE developers to the SARIF details.
-//
-//   2. Provide a stable ROSE-facing API if/when the SARIF
-//      specification changes.  As the SARIF specification
-//      evolves the nesting structure of SARIF objects may
-//      change and new SARIF objects may be introduced.
-//      In many simple use cases, this change will not affect
-//      how ROSE tools report their results - just the
-//      manner by which the results are represented in the
-//      SARIF file.  Hiding those details in this wrapper
-//      should minimize ROSE-tool breakage when the SARIF
-//      format changes as most necessary changes will be
-//      concentrated in this file.
-//
-// This API is intended to be relatively general, so there
-// will likely exist special cases in which a tool has objects
-// representing analysis results to serialize that are not
-// included in this API.  The recommendation is to either add
-// appropriate methods to the SARIFOutput class here, or use
-// methods here as a model for writing specialized serializers
-// to include in specific analyzers.
-//
-// SARIF schema -> C++ generated via https://github.com/quicktype/quicktype
-//
-#ifndef __ROSESARIF_HPP__
-#define __ROSESARIF_HPP__
-
-#include "sarif.hpp"
-#include "rose.h"
-
-using json = nlohmann::json;
-
-/**
- * This class manages SARIF output information.  A SARIF file contains
- * a description of the tool being run, the rules that correspond to
- * the analyses, and the results of rule application.  A result associates
- * a rule with a physical location within a file.
- *
- * This wrapper class does not attempt to provide a full mapping of the
- * SARIF schema - instead, the goal is to hide much of the detail in setting
- * up various objects within a SARIF file to insulate ROSE tool developers
- * from the complexity.
- */
-class SARIFOutput {
-private:
-  SARIF::Run run;
-
-  // this pass to remove null-valued keys is due to the
-  // way the automatically generated SARIF C++ objects
-  // implement to_json.  instead of skipping keys that
-  // have no value, it emits them with null values.
-  // there is no clean way according to the author of the
-  // JSON library to remove them other than traversing
-  // the JSON structure and removing them by hand...
-  void strip_nulls(nlohmann::json &j) {
-    std::vector<std::string> removals;
-
-    // accumulate up things to delete after iteration
-    for (auto iter = j.begin();
-         iter != j.end();
-         ++iter) {
-      if (iter.value().is_null()) {
-        removals.push_back(iter.key());
-      } else {
-        if (iter.value().is_structured()) {
-          strip_nulls(iter.value());
-        }
-      }
-    }
-    
-    for (std::string s: removals) {
-      j.erase(s);
-    }
-  }
-
-  //  typedef std::pair<std::string, std::string> mapkey_t;
-  //  std::map<mapkey_t, std::shared_ptr<SARIF::Result>> results;
-  std::vector<std::shared_ptr<SARIF::Result>> results;
-  std::map<std::string, SARIF::ReportingDescriptor> rules;
-  std::map<std::string, int> rule_indices;
-  SARIF::Tool *t;
-  SARIF::ToolComponent *tc;
-  int cur_index;
-  
-public:
-  // create a SARIF output object for a given tool component name.
-  // this creates a fresh SARIF file that represents results
-  // from a single tool component.  If we have a tool with more than
-  // one component we will need to generalize this interface (or split
-  // out a secondary object) that allows one tool to have multiple
-  // components.
-  SARIFOutput(const std::string &toolname) {
-    tc = new SARIF::ToolComponent();
-    tc->set_name(toolname);
-    t = new SARIF::Tool();
-    
-    std::vector<SARIF::Invocation> invocations;
-    run.set_invocations(std::make_shared<std::vector<SARIF::Invocation>>(invocations));
-
-    cur_index = 0;
-  }
-
-  // register a tool invocation with a command line specified as a single string
-  void register_invocation(const std::string &cmdline) {
-    SARIF::Invocation invoke;
-
-    invoke.set_command_line(std::make_shared<std::string>(cmdline));
-    auto invocations = this->run.get_invocations();
-    invocations->push_back(invoke);
-  }
-
-  // register a tool invocation with a vector of arguments
-  void register_invocation(const std::vector<std::string> &args) {
-    SARIF::Invocation invoke;
-
-    invoke.set_arguments(std::make_shared<std::vector<std::string>>(args));
-    auto invocations = this->run.get_invocations();
-    invocations->push_back(invoke);
-  }
-
-  // register a tool invocation with argc and argv
-  void register_invocation(int argc, char **argv) {
-    std::vector<std::string> args;
-    for (int i = 0; i < argc; i++)
-      args.push_back(std::string(argv[i]));
-    register_invocation(args);
-  }
-  
-  // this registers a named rule with the object with a rule description string.
-  // the rule name is later used to register results generated by the tool component.
-  void register_rule(const std::string &rule, const std::string &desc) {
-    if (rules.find(rule) == rules.end()) {
-      SARIF::ReportingDescriptor r;
-      r.set_id(rule);
-      auto msg = std::make_shared<SARIF::MultiformatMessageString>(SARIF::MultiformatMessageString());
-      msg->set_text(desc);
-      r.set_short_description(msg);
-      rules[rule] = r;
-      rule_indices[rule] = cur_index;
-      cur_index += 1;
-    }
-  }
-
-  SARIF::Location define_source_region(SgNode *n,
-                                       std::shared_ptr<SARIF::ArtifactLocation> artifact)
-  {
-    // extract the file info object from the SgNode to determine the extent of the
-    // program that the node represents.
-    Sg_File_Info *fi_start = n->get_startOfConstruct();
-    Sg_File_Info *fi_end = n->get_endOfConstruct();
-
-    auto r = std::make_shared<SARIF::Region>(SARIF::Region());
-    r->set_start_line(std::make_shared<long int>(fi_start->get_line()));
-    r->set_start_column(std::make_shared<long int>(fi_start->get_col()));
-    r->set_end_line(std::make_shared<long int>(fi_end->get_line()));
-    r->set_end_column(std::make_shared<long int>(fi_end->get_col()));
-
-    auto pl = std::make_shared<SARIF::PhysicalLocation>(SARIF::PhysicalLocation());
-    pl->set_region(r);
-    pl->set_artifact_location(artifact);
-    
-    SARIF::Location loc;
-    loc.set_physical_location(pl);
-
-    return loc;
-  }
-
-  // note: see SARIF spec 3.32.12 for expected valid values for address kind.  while any
-  // value is legal, a set of strings are specified that producers and consumers of
-  // SARIF can agree upon
-  SARIF::Location define_binary_location(const rose_addr_t &a,
-                                         std::shared_ptr<SARIF::ArtifactLocation> artifact,
-                                         int64_t length = 0,
-                                         std::string addrkind = "",
-                                         std::string name = "")
-  {
-    SARIF::Location loc;
-
-    auto pl = std::make_shared<SARIF::PhysicalLocation>(SARIF::PhysicalLocation());
-    loc.set_physical_location(pl);
-
-    auto addr = std::make_shared<SARIF::Address>(SARIF::Address());
-    addr->set_absolute_address(std::make_shared<int64_t>(a));
-    if (length != 0) {
-      addr->set_length(std::make_shared<int64_t>(length));
-    }
-    if (addrkind != "") {
-      addr->set_kind(std::make_shared<std::string>(addrkind));
-    }
-    if (name != "") {
-      addr->set_name(std::make_shared<std::string>(name));
-    }
-    pl->set_address(addr);
-    pl->set_artifact_location(artifact);
-
-    return loc;
-  }
-
-  // define a located artifact given some filename
-  std::shared_ptr<SARIF::ArtifactLocation> create_artifact_location(std::shared_ptr<std::string> filename) {
-    std::shared_ptr<SARIF::ArtifactLocation> artifact =
-      std::make_shared<SARIF::ArtifactLocation>(SARIF::ArtifactLocation());
-    artifact->set_uri(filename);
-    return artifact;
-  }
-  
-  // register a result for a given named rule.  the rule must have
-  // previously been registered with the register_rule method.
-  //
-  // the location passed in represents either a source or binary
-  // location created with the functions above.
-  //
-  // the artifact location represents the target of the analysis and
-  // is created with create_artifact_location.
-  //
-  // The result kind and level are optional : by default a result is
-  // given Kind=PASS and Level=WARNING.  The caller registering the
-  // result should pick those appropriately.
-  void result(const std::string &rule,
-              const std::string &mesg,
-              const SARIF::Location &loc,
-              const std::shared_ptr<SARIF::ArtifactLocation> &artifact,
-              const SARIF::ResultKind &kind = SARIF::ResultKind::PASS,
-              const SARIF::Level &lvl = SARIF::Level::WARNING)
-  {
-    // create the result object with a pointer to the given artifact location,
-    // and add it to the result collection.
-    std::shared_ptr<SARIF::Result> res;
-    res = std::make_shared<SARIF::Result>(SARIF::Result());
-    res->set_locations(std::make_shared<std::vector<SARIF::Location>>(std::vector<SARIF::Location>()));
-    res->set_analysis_target(artifact);
-    results.push_back(res);
-
-    // wrap the message in a Message object
-    auto msg = SARIF::Message();
-    msg.set_text(std::make_shared<std::string>(mesg));
-    res->set_message(msg);
-
-    // update the kind and level of the result
-    res->set_kind(std::make_shared<SARIF::ResultKind>(kind));
-    res->set_level(std::make_shared<SARIF::Level>(lvl));
-
-    // create the mapping between the result and the rule that
-    // it corresponds to
-    auto rdr = std::make_shared<SARIF::ReportingDescriptorReference>(SARIF::ReportingDescriptorReference());
-    rdr->set_id(std::make_shared<std::string>(rule));
-    rdr->set_index(std::make_shared<long int>(rule_indices[rule]));
-    res->set_rule(rdr);
-    res->set_rule_index(std::make_shared<long int>(rule_indices[rule]));
-    res->set_rule_id(std::make_shared<std::string>(rule));
-    
-    // add the location of the result to the result location vector
-    auto locs = res->get_locations();
-    locs->push_back(loc);
-  }
-
-  // emit the SARIF to the given ofstream
-  void emit(std::ofstream &ostr) {
-    json j;
-
-    std::vector<SARIF::ReportingDescriptor> rvec;
-    for (auto it = rules.begin(); it != rules.end(); ++it) {
-      rvec.push_back(it->second);
-    }
-    tc->set_rules(std::make_shared<std::vector<SARIF::ReportingDescriptor>>(rvec));
-    t->set_driver(*tc);
-    run.set_tool(*t);
-
-    // SARIF version and schema.
-    j["version"] = SARIF::VERSION;
-    j["$schema"] = SARIF::SCHEMA;
-    std::vector<json> runs;
-    
-    std::vector<SARIF::Result> res;
-    for (auto it = results.begin(); it != results.end(); ++it) {
-      res.push_back(*(*it));
-    }
-    this->run.set_results(std::make_shared<std::vector<SARIF::Result>>(res));
-
-    json jrun;
-    to_json(jrun, this->run);
-    strip_nulls(jrun);
-
-    runs.push_back(jrun);
-    j["runs"] = runs;
-    
-    // Note: setw() necessary to get the pretty printer to emit well formatted
-    // JSON.  Without it a giant flat string is produced that is syntactically
-    // correct but not exactly human readable.
-    ostr << std::setw(4) << j << std::endl;
-  }
-
-  // dump the JSON corresponding to the SARIF object to the named file.
-  void emit(const std::string &fname) {
-    std::ofstream o(fname);
-    emit(o);
-  }
-
-};
-
-#endif // __ROSESARIF_HPP__
diff --git a/src/3rdPartyLibraries/json/sarif.hpp b/src/3rdPartyLibraries/json/sarif.hpp
deleted file mode 100644
index 5bd2804e919..00000000000
--- a/src/3rdPartyLibraries/json/sarif.hpp
+++ /dev/null
@@ -1,6027 +0,0 @@
-//  Automatically generated code for the schema defined by:
-//
-//  https://docs.oasis-open.org/sarif/sarif/v2.1.0/cos02/schemas/sarif-schema-2.1.0.json
-//
-//  QuickType.io was used for the code generation
-//
-//  To parse this JSON data, first install
-//
-//      Boost     http://www.boost.org
-//      json.hpp  https://github.com/nlohmann/json
-//
-//  Then include this file, and then do
-//
-//     Coordinate data = nlohmann::json::parse(jsonString);
-
-#pragma once
-
-#include "nlohmann/json.hpp"
-
-#include <boost/optional.hpp>
-#include <stdexcept>
-#include <regex>
-#include <unordered_map>
-
-#ifndef NLOHMANN_OPT_HELPER
-#define NLOHMANN_OPT_HELPER
-namespace nlohmann {
-    template <typename T>
-    struct adl_serializer<std::shared_ptr<T>> {
-        static void to_json(json & j, const std::shared_ptr<T> & opt) {
-            if (!opt) j = nullptr; else j = *opt;
-        }
-
-        static std::shared_ptr<T> from_json(const json & j) {
-            if (j.is_null()) return std::unique_ptr<T>(); else return std::unique_ptr<T>(new T(j.get<T>()));
-        }
-    };
-}
-#endif
-
-namespace SARIF {
-    using nlohmann::json;
-
-    const std::string VERSION = "2.1.0";
-    const std::string SCHEMA = "https://docs.oasis-open.org/sarif/sarif/v2.1.0/cos02/schemas/sarif-schema-2.1.0.json";
-
-    class ClassMemberConstraints {
-        private:
-        boost::optional<int> min_value;
-        boost::optional<int> max_value;
-        boost::optional<size_t> min_length;
-        boost::optional<size_t> max_length;
-        boost::optional<std::string> pattern;
-
-        public:
-        ClassMemberConstraints(
-            boost::optional<int> min_value,
-            boost::optional<int> max_value,
-            boost::optional<size_t> min_length,
-            boost::optional<size_t> max_length,
-            boost::optional<std::string> pattern
-        ) : min_value(min_value), max_value(max_value), min_length(min_length), max_length(max_length), pattern(pattern) {}
-        ClassMemberConstraints() = default;
-        virtual ~ClassMemberConstraints() = default;
-
-        void set_min_value(int min_value) { this->min_value = min_value; }
-        auto get_min_value() const { return min_value; }
-
-        void set_max_value(int max_value) { this->max_value = max_value; }
-        auto get_max_value() const { return max_value; }
-
-        void set_min_length(size_t min_length) { this->min_length = min_length; }
-        auto get_min_length() const { return min_length; }
-
-        void set_max_length(size_t max_length) { this->max_length = max_length; }
-        auto get_max_length() const { return max_length; }
-
-        void set_pattern(const std::string &  pattern) { this->pattern = pattern; }
-        auto get_pattern() const { return pattern; }
-    };
-
-    class ClassMemberConstraintException : public std::runtime_error {
-        public:
-        ClassMemberConstraintException(const std::string &  msg) : std::runtime_error(msg) {}
-    };
-
-    class ValueTooLowException : public ClassMemberConstraintException {
-        public:
-        ValueTooLowException(const std::string &  msg) : ClassMemberConstraintException(msg) {}
-    };
-
-    class ValueTooHighException : public ClassMemberConstraintException {
-        public:
-        ValueTooHighException(const std::string &  msg) : ClassMemberConstraintException(msg) {}
-    };
-
-    class ValueTooShortException : public ClassMemberConstraintException {
-        public:
-        ValueTooShortException(const std::string &  msg) : ClassMemberConstraintException(msg) {}
-    };
-
-    class ValueTooLongException : public ClassMemberConstraintException {
-        public:
-        ValueTooLongException(const std::string &  msg) : ClassMemberConstraintException(msg) {}
-    };
-
-    class InvalidPatternException : public ClassMemberConstraintException {
-        public:
-        InvalidPatternException(const std::string &  msg) : ClassMemberConstraintException(msg) {}
-    };
-
-    void CheckConstraint(const std::string &  name, const ClassMemberConstraints & c, int64_t value) {
-        if (c.get_min_value() != boost::none && value < *c.get_min_value()) {
-            throw ValueTooLowException ("Value too low for " + name + " (" + std::to_string(value) + "<" + std::to_string(*c.get_min_value()) + ")");
-        }
-
-        if (c.get_max_value() != boost::none && value > *c.get_max_value()) {
-            throw ValueTooHighException ("Value too high for " + name + " (" + std::to_string(value) + ">" + std::to_string(*c.get_max_value()) + ")");
-        }
-    }
-
-    void CheckConstraint(const std::string &  name, const ClassMemberConstraints & c, const std::string &  value) {
-        if (c.get_min_length() != boost::none && value.length() < *c.get_min_length()) {
-            throw ValueTooShortException ("Value too short for " + name + " (" + std::to_string(value.length()) + "<" + std::to_string(*c.get_min_length()) + ")");
-        }
-
-        if (c.get_max_length() != boost::none && value.length() > *c.get_max_length()) {
-            throw ValueTooLongException ("Value too long for " + name + " (" + std::to_string(value.length()) + ">" + std::to_string(*c.get_max_length()) + ")");
-        }
-
-        if (c.get_pattern() != boost::none) {
-            std::smatch result;
-            std::regex_search(value, result, std::regex( *c.get_pattern() ));
-            if (result.empty()) {
-                throw InvalidPatternException ("Value doesn't match pattern for " + name + " (" + value +" != " + *c.get_pattern() + ")");
-            }
-        }
-    }
-
-    inline json get_untyped(const json & j, const char * property) {
-        if (j.find(property) != j.end()) {
-            return j.at(property).get<json>();
-        }
-        return json();
-    }
-
-    inline json get_untyped(const json & j, std::string property) {
-        return get_untyped(j, property.data());
-    }
-
-    template <typename T>
-    inline std::shared_ptr<T> get_optional(const json & j, const char * property) {
-        if (j.find(property) != j.end()) {
-            return j.at(property).get<std::shared_ptr<T>>();
-        }
-        return std::shared_ptr<T>();
-    }
-
-    template <typename T>
-    inline std::shared_ptr<T> get_optional(const json & j, std::string property) {
-        return get_optional<T>(j, property.data());
-    }
-
-    /**
-     * Key/value pairs that provide additional information about the address.
-     *
-     * Key/value pairs that provide additional information about the object.
-     *
-     * Key/value pairs that provide additional information about the artifact content.
-     *
-     * Key/value pairs that provide additional information about the message.
-     *
-     * Key/value pairs that provide additional information about the artifact location.
-     *
-     * Key/value pairs that provide additional information about the artifact.
-     *
-     * Contains configuration information specific to a report.
-     *
-     * Key/value pairs that provide additional information about the reporting configuration.
-     *
-     * Key/value pairs that provide additional information about the reporting descriptor
-     * reference.
-     *
-     * Key/value pairs that provide additional information about the toolComponentReference.
-     *
-     * Key/value pairs that provide additional information about the configuration override.
-     *
-     * Key/value pairs that provide additional information about the invocation.
-     *
-     * Key/value pairs that provide additional information about the exception.
-     *
-     * Key/value pairs that provide additional information about the region.
-     *
-     * Key/value pairs that provide additional information about the logical location.
-     *
-     * Key/value pairs that provide additional information about the physical location.
-     *
-     * Key/value pairs that provide additional information about the location.
-     *
-     * Key/value pairs that provide additional information about the location relationship.
-     *
-     * Key/value pairs that provide additional information about the stack frame.
-     *
-     * Key/value pairs that provide additional information about the stack.
-     *
-     * Key/value pairs that provide additional information about the notification.
-     *
-     * Key/value pairs that provide additional information about the conversion.
-     *
-     * Key/value pairs that provide additional information about the report.
-     *
-     * Key/value pairs that provide additional information about the tool component.
-     *
-     * Key/value pairs that provide additional information about the translation metadata.
-     *
-     * Key/value pairs that provide additional information about the tool.
-     *
-     * Key/value pairs that provide additional information that will be merged with a separate
-     * run.
-     *
-     * Key/value pairs that provide additional information about the edge.
-     *
-     * Key/value pairs that provide additional information about the node.
-     *
-     * Key/value pairs that provide additional information about the graph.
-     *
-     * Key/value pairs that provide additional information about the external properties.
-     *
-     * Key/value pairs that provide additional information about the attachment.
-     *
-     * Key/value pairs that provide additional information about the rectangle.
-     *
-     * Key/value pairs that provide additional information about the code flow.
-     *
-     * Key/value pairs that provide additional information about the threadflow location.
-     *
-     * Key/value pairs that provide additional information about the request.
-     *
-     * Key/value pairs that provide additional information about the response.
-     *
-     * Key/value pairs that provide additional information about the thread flow.
-     *
-     * Key/value pairs that provide additional information about the change.
-     *
-     * Key/value pairs that provide additional information about the replacement.
-     *
-     * Key/value pairs that provide additional information about the fix.
-     *
-     * Key/value pairs that provide additional information about the edge traversal.
-     *
-     * Key/value pairs that provide additional information about the graph traversal.
-     *
-     * Key/value pairs that provide additional information about the result.
-     *
-     * Key/value pairs that provide additional information about the suppression.
-     *
-     * Key/value pairs that provide additional information about the log file.
-     *
-     * Key/value pairs that provide additional information about the run automation details.
-     *
-     * Key/value pairs that provide additional information about the external property file.
-     *
-     * Key/value pairs that provide additional information about the external property files.
-     *
-     * Key/value pairs that provide additional information about the run.
-     *
-     * Key/value pairs that provide additional information about the special locations.
-     *
-     * Key/value pairs that provide additional information about the version control details.
-     */
-    class PropertyBag {
-        public:
-        PropertyBag() = default;
-        virtual ~PropertyBag() = default;
-
-        private:
-        std::shared_ptr<std::vector<std::string>> tags;
-
-        public:
-        /**
-         * A set of distinct strings that provide additional information.
-         */
-        std::shared_ptr<std::vector<std::string>> get_tags() const { return tags; }
-        void set_tags(std::shared_ptr<std::vector<std::string>> value) { this->tags = value; }
-    };
-
-    /**
-     * A physical or virtual address, or a range of addresses, in an 'addressable region'
-     * (memory or a binary file).
-     *
-     * The address of the location.
-     */
-    class Address {
-        public:
-        Address() :
-            absolute_address_constraint(-1, boost::none, boost::none, boost::none, boost::none),
-            index_constraint(-1, boost::none, boost::none, boost::none, boost::none),
-            parent_index_constraint(-1, boost::none, boost::none, boost::none, boost::none)
-        {}
-        virtual ~Address() = default;
-
-        private:
-        std::shared_ptr<int64_t> absolute_address;
-        ClassMemberConstraints absolute_address_constraint;
-        std::shared_ptr<std::string> fully_qualified_name;
-        std::shared_ptr<int64_t> index;
-        ClassMemberConstraints index_constraint;
-        std::shared_ptr<std::string> kind;
-        std::shared_ptr<int64_t> length;
-        std::shared_ptr<std::string> name;
-        std::shared_ptr<int64_t> offset_from_parent;
-        std::shared_ptr<int64_t> parent_index;
-        ClassMemberConstraints parent_index_constraint;
-        std::shared_ptr<PropertyBag> properties;
-        std::shared_ptr<int64_t> relative_address;
-
-        public:
-        /**
-         * The address expressed as a byte offset from the start of the addressable region.
-         */
-        std::shared_ptr<int64_t> get_absolute_address() const { return absolute_address; }
-        void set_absolute_address(std::shared_ptr<int64_t> value) { if (value) CheckConstraint("absolute_address", absolute_address_constraint, *value); this->absolute_address = value; }
-
-        /**
-         * A human-readable fully qualified name that is associated with the address.
-         */
-        std::shared_ptr<std::string> get_fully_qualified_name() const { return fully_qualified_name; }
-        void set_fully_qualified_name(std::shared_ptr<std::string> value) { this->fully_qualified_name = value; }
-
-        /**
-         * The index within run.addresses of the cached object for this address.
-         */
-        std::shared_ptr<int64_t> get_index() const { return index; }
-        void set_index(std::shared_ptr<int64_t> value) { if (value) CheckConstraint("index", index_constraint, *value); this->index = value; }
-
-        /**
-         * An open-ended string that identifies the address kind. 'data', 'function',
-         * 'header','instruction', 'module', 'page', 'section', 'segment', 'stack', 'stackFrame',
-         * 'table' are well-known values.
-         */
-        std::shared_ptr<std::string> get_kind() const { return kind; }
-        void set_kind(std::shared_ptr<std::string> value) { this->kind = value; }
-
-        /**
-         * The number of bytes in this range of addresses.
-         */
-        std::shared_ptr<int64_t> get_length() const { return length; }
-        void set_length(std::shared_ptr<int64_t> value) { this->length = value; }
-
-        /**
-         * A name that is associated with the address, e.g., '.text'.
-         */
-        std::shared_ptr<std::string> get_name() const { return name; }
-        void set_name(std::shared_ptr<std::string> value) { this->name = value; }
-
-        /**
-         * The byte offset of this address from the absolute or relative address of the parent
-         * object.
-         */
-        std::shared_ptr<int64_t> get_offset_from_parent() const { return offset_from_parent; }
-        void set_offset_from_parent(std::shared_ptr<int64_t> value) { this->offset_from_parent = value; }
-
-        /**
-         * The index within run.addresses of the parent object.
-         */
-        std::shared_ptr<int64_t> get_parent_index() const { return parent_index; }
-        void set_parent_index(std::shared_ptr<int64_t> value) { if (value) CheckConstraint("parent_index", parent_index_constraint, *value); this->parent_index = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the address.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-
-        /**
-         * The address expressed as a byte offset from the absolute address of the top-most parent
-         * object.
-         */
-        std::shared_ptr<int64_t> get_relative_address() const { return relative_address; }
-        void set_relative_address(std::shared_ptr<int64_t> value) { this->relative_address = value; }
-    };
-
-    /**
-     * An alternate rendered representation of the artifact (e.g., a decompiled representation
-     * of a binary region).
-     *
-     * A message string or message format string rendered in multiple formats.
-     *
-     * A comprehensive description of the tool component.
-     *
-     * A description of the report. Should, as far as possible, provide details sufficient to
-     * enable resolution of any problem indicated by the result.
-     *
-     * Provides the primary documentation for the report, useful when there is no online
-     * documentation.
-     *
-     * A concise description of the report. Should be a single sentence that is understandable
-     * when visible space is limited to a single line of text.
-     *
-     * A brief description of the tool component.
-     *
-     * A comprehensive description of the translation metadata.
-     *
-     * A brief description of the translation metadata.
-     */
-    class MultiformatMessageString {
-        public:
-        MultiformatMessageString() = default;
-        virtual ~MultiformatMessageString() = default;
-
-        private:
-        std::shared_ptr<std::string> markdown;
-        std::shared_ptr<PropertyBag> properties;
-        std::string text;
-
-        public:
-        /**
-         * A Markdown message string or format string.
-         */
-        std::shared_ptr<std::string> get_markdown() const { return markdown; }
-        void set_markdown(std::shared_ptr<std::string> value) { this->markdown = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the message.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-
-        /**
-         * A plain text message string or format string.
-         */
-        const std::string & get_text() const { return text; }
-        std::string & get_mutable_text() { return text; }
-        void set_text(const std::string & value) { this->text = value; }
-    };
-
-    /**
-     * The contents of the artifact.
-     *
-     * Represents the contents of an artifact.
-     *
-     * The portion of the artifact contents within the specified region.
-     *
-     * The body of the request.
-     *
-     * The body of the response.
-     *
-     * The content to insert at the location specified by the 'deletedRegion' property.
-     */
-    class ArtifactContent {
-        public:
-        ArtifactContent() = default;
-        virtual ~ArtifactContent() = default;
-
-        private:
-        std::shared_ptr<std::string> binary;
-        std::shared_ptr<PropertyBag> properties;
-        std::shared_ptr<MultiformatMessageString> rendered;
-        std::shared_ptr<std::string> text;
-
-        public:
-        /**
-         * MIME Base64-encoded content from a binary artifact, or from a text artifact in its
-         * original encoding.
-         */
-        std::shared_ptr<std::string> get_binary() const { return binary; }
-        void set_binary(std::shared_ptr<std::string> value) { this->binary = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the artifact content.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-
-        /**
-         * An alternate rendered representation of the artifact (e.g., a decompiled representation
-         * of a binary region).
-         */
-        std::shared_ptr<MultiformatMessageString> get_rendered() const { return rendered; }
-        void set_rendered(std::shared_ptr<MultiformatMessageString> value) { this->rendered = value; }
-
-        /**
-         * UTF-8-encoded content from a text artifact.
-         */
-        std::shared_ptr<std::string> get_text() const { return text; }
-        void set_text(std::shared_ptr<std::string> value) { this->text = value; }
-    };
-
-    /**
-     * A short description of the artifact.
-     *
-     * A short description of the artifact location.
-     *
-     * A message relevant to the region.
-     *
-     * A message relevant to the location.
-     *
-     * A description of the location relationship.
-     *
-     * A message relevant to this call stack.
-     *
-     * A message that describes the condition that was encountered.
-     *
-     * A description of the reporting descriptor relationship.
-     *
-     * A description of the graph.
-     *
-     * A short description of the edge.
-     *
-     * A short description of the node.
-     *
-     * A message describing the role played by the attachment.
-     *
-     * A message relevant to the rectangle.
-     *
-     * A message relevant to the code flow.
-     *
-     * A message relevant to the thread flow.
-     *
-     * A message that describes the proposed fix, enabling viewers to present the proposed
-     * change to an end user.
-     *
-     * A description of this graph traversal.
-     *
-     * A message to display to the user as the edge is traversed.
-     *
-     * A message that describes the result. The first sentence of the message only will be
-     * displayed when visible space is limited.
-     *
-     * A description of the identity and role played within the engineering system by this
-     * object's containing run object.
-     *
-     * Encapsulates a message intended to be read by the end user.
-     */
-    class Message {
-        public:
-        Message() = default;
-        virtual ~Message() = default;
-
-        private:
-        std::shared_ptr<std::vector<std::string>> arguments;
-        std::shared_ptr<std::string> id;
-        std::shared_ptr<std::string> markdown;
-        std::shared_ptr<PropertyBag> properties;
-        std::shared_ptr<std::string> text;
-
-        public:
-        /**
-         * An array of strings to substitute into the message string.
-         */
-        std::shared_ptr<std::vector<std::string>> get_arguments() const { return arguments; }
-        void set_arguments(std::shared_ptr<std::vector<std::string>> value) { this->arguments = value; }
-
-        /**
-         * The identifier for this message.
-         */
-        std::shared_ptr<std::string> get_id() const { return id; }
-        void set_id(std::shared_ptr<std::string> value) { this->id = value; }
-
-        /**
-         * A Markdown message string.
-         */
-        std::shared_ptr<std::string> get_markdown() const { return markdown; }
-        void set_markdown(std::shared_ptr<std::string> value) { this->markdown = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the message.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-
-        /**
-         * A plain text message string.
-         */
-        std::shared_ptr<std::string> get_text() const { return text; }
-        void set_text(std::shared_ptr<std::string> value) { this->text = value; }
-    };
-
-    /**
-     * The location of the artifact.
-     *
-     * Specifies the location of an artifact.
-     *
-     * An absolute URI specifying the location of the executable that was invoked.
-     *
-     * A file containing the standard error stream from the process that was invoked.
-     *
-     * A file containing the standard input stream to the process that was invoked.
-     *
-     * A file containing the standard output stream from the process that was invoked.
-     *
-     * A file containing the interleaved standard output and standard error stream from the
-     * process that was invoked.
-     *
-     * The working directory for the invocation.
-     *
-     * Identifies the artifact that the analysis tool was instructed to scan. This need not be
-     * the same as the artifact where the result actually occurred.
-     *
-     * The location of the attachment.
-     *
-     * The location of the artifact to change.
-     *
-     * The location of the external property file.
-     *
-     * Provides a suggestion to SARIF consumers to display file paths relative to the specified
-     * location.
-     *
-     * The location in the local file system to which the root of the repository was mapped at
-     * the time of the analysis.
-     */
-    class ArtifactLocation {
-        public:
-        ArtifactLocation() :
-            index_constraint(-1, boost::none, boost::none, boost::none, boost::none)
-        {}
-        virtual ~ArtifactLocation() = default;
-
-        private:
-        std::shared_ptr<Message> description;
-        std::shared_ptr<int64_t> index;
-        ClassMemberConstraints index_constraint;
-        std::shared_ptr<PropertyBag> properties;
-        std::shared_ptr<std::string> uri;
-        std::shared_ptr<std::string> uri_base_id;
-
-        public:
-        /**
-         * A short description of the artifact location.
-         */
-        std::shared_ptr<Message> get_description() const { return description; }
-        void set_description(std::shared_ptr<Message> value) { this->description = value; }
-
-        /**
-         * The index within the run artifacts array of the artifact object associated with the
-         * artifact location.
-         */
-        std::shared_ptr<int64_t> get_index() const { return index; }
-        void set_index(std::shared_ptr<int64_t> value) { if (value) CheckConstraint("index", index_constraint, *value); this->index = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the artifact location.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-
-        /**
-         * A string containing a valid relative or absolute URI.
-         */
-        std::shared_ptr<std::string> get_uri() const { return uri; }
-        void set_uri(std::shared_ptr<std::string> value) { this->uri = value; }
-
-        /**
-         * A string which indirectly specifies the absolute URI with respect to which a relative URI
-         * in the "uri" property is interpreted.
-         */
-        std::shared_ptr<std::string> get_uri_base_id() const { return uri_base_id; }
-        void set_uri_base_id(std::shared_ptr<std::string> value) { this->uri_base_id = value; }
-    };
-
-    enum class Role : int { ADDED, ANALYSIS_TARGET, ATTACHMENT, DEBUG_OUTPUT_FILE, DELETED, DIRECTORY, DRIVER, EXTENSION, MEMORY_CONTENTS, MODIFIED, POLICY, REFERENCED_ON_COMMAND_LINE, RENAMED, RESPONSE_FILE, RESULT_FILE, STANDARD_STREAM, TAXONOMY, TOOL_SPECIFIED_CONFIGURATION, TRACED_FILE, TRANSLATION, UNCONTROLLED, UNMODIFIED, USER_SPECIFIED_CONFIGURATION };
-
-    /**
-     * A single artifact. In some cases, this artifact might be nested within another artifact.
-     */
-    class Artifact {
-        public:
-        Artifact() :
-            length_constraint(-1, boost::none, boost::none, boost::none, boost::none),
-            mime_type_constraint(boost::none, boost::none, boost::none, boost::none, std::string("[^/]+/.+")),
-            offset_constraint(0, boost::none, boost::none, boost::none, boost::none),
-            parent_index_constraint(-1, boost::none, boost::none, boost::none, boost::none)
-        {}
-        virtual ~Artifact() = default;
-
-        private:
-        std::shared_ptr<ArtifactContent> contents;
-        std::shared_ptr<Message> description;
-        std::shared_ptr<std::string> encoding;
-        std::shared_ptr<std::map<std::string, std::string>> hashes;
-        std::shared_ptr<std::string> last_modified_time_utc;
-        std::shared_ptr<int64_t> length;
-        ClassMemberConstraints length_constraint;
-        std::shared_ptr<ArtifactLocation> location;
-        std::shared_ptr<std::string> mime_type;
-        ClassMemberConstraints mime_type_constraint;
-        std::shared_ptr<int64_t> offset;
-        ClassMemberConstraints offset_constraint;
-        std::shared_ptr<int64_t> parent_index;
-        ClassMemberConstraints parent_index_constraint;
-        std::shared_ptr<PropertyBag> properties;
-        std::shared_ptr<std::vector<Role>> roles;
-        std::shared_ptr<std::string> source_language;
-
-        public:
-        /**
-         * The contents of the artifact.
-         */
-        std::shared_ptr<ArtifactContent> get_contents() const { return contents; }
-        void set_contents(std::shared_ptr<ArtifactContent> value) { this->contents = value; }
-
-        /**
-         * A short description of the artifact.
-         */
-        std::shared_ptr<Message> get_description() const { return description; }
-        void set_description(std::shared_ptr<Message> value) { this->description = value; }
-
-        /**
-         * Specifies the encoding for an artifact object that refers to a text file.
-         */
-        std::shared_ptr<std::string> get_encoding() const { return encoding; }
-        void set_encoding(std::shared_ptr<std::string> value) { this->encoding = value; }
-
-        /**
-         * A dictionary, each of whose keys is the name of a hash function and each of whose values
-         * is the hashed value of the artifact produced by the specified hash function.
-         */
-        std::shared_ptr<std::map<std::string, std::string>> get_hashes() const { return hashes; }
-        void set_hashes(std::shared_ptr<std::map<std::string, std::string>> value) { this->hashes = value; }
-
-        /**
-         * The Coordinated Universal Time (UTC) date and time at which the artifact was most
-         * recently modified. See "Date/time properties" in the SARIF spec for the required format.
-         */
-        std::shared_ptr<std::string> get_last_modified_time_utc() const { return last_modified_time_utc; }
-        void set_last_modified_time_utc(std::shared_ptr<std::string> value) { this->last_modified_time_utc = value; }
-
-        /**
-         * The length of the artifact in bytes.
-         */
-        std::shared_ptr<int64_t> get_length() const { return length; }
-        void set_length(std::shared_ptr<int64_t> value) { if (value) CheckConstraint("length", length_constraint, *value); this->length = value; }
-
-        /**
-         * The location of the artifact.
-         */
-        std::shared_ptr<ArtifactLocation> get_location() const { return location; }
-        void set_location(std::shared_ptr<ArtifactLocation> value) { this->location = value; }
-
-        /**
-         * The MIME type (RFC 2045) of the artifact.
-         */
-        std::shared_ptr<std::string> get_mime_type() const { return mime_type; }
-        void set_mime_type(std::shared_ptr<std::string> value) { if (value) CheckConstraint("mime_type", mime_type_constraint, *value); this->mime_type = value; }
-
-        /**
-         * The offset in bytes of the artifact within its containing artifact.
-         */
-        std::shared_ptr<int64_t> get_offset() const { return offset; }
-        void set_offset(std::shared_ptr<int64_t> value) { if (value) CheckConstraint("offset", offset_constraint, *value); this->offset = value; }
-
-        /**
-         * Identifies the index of the immediate parent of the artifact, if this artifact is nested.
-         */
-        std::shared_ptr<int64_t> get_parent_index() const { return parent_index; }
-        void set_parent_index(std::shared_ptr<int64_t> value) { if (value) CheckConstraint("parent_index", parent_index_constraint, *value); this->parent_index = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the artifact.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-
-        /**
-         * The role or roles played by the artifact in the analysis.
-         */
-        std::shared_ptr<std::vector<Role>> get_roles() const { return roles; }
-        void set_roles(std::shared_ptr<std::vector<Role>> value) { this->roles = value; }
-
-        /**
-         * Specifies the source language for any artifact object that refers to a text file that
-         * contains source code.
-         */
-        std::shared_ptr<std::string> get_source_language() const { return source_language; }
-        void set_source_language(std::shared_ptr<std::string> value) { this->source_language = value; }
-    };
-
-    /**
-     * Specifies the failure level for the report.
-     *
-     * A value specifying the severity level of the notification.
-     *
-     * A value specifying the severity level of the result.
-     */
-    enum class Level : int { ERROR, NONE, NOTE, WARNING };
-
-    /**
-     * Specifies how the rule or notification was configured during the scan.
-     *
-     * Information about a rule or notification that can be configured at runtime.
-     *
-     * Default reporting configuration information.
-     */
-    class ReportingConfiguration {
-        public:
-        ReportingConfiguration() :
-            rank_constraint(-1, 100, boost::none, boost::none, boost::none)
-        {}
-        virtual ~ReportingConfiguration() = default;
-
-        private:
-        std::shared_ptr<bool> enabled;
-        std::shared_ptr<Level> level;
-        std::shared_ptr<PropertyBag> parameters;
-        std::shared_ptr<PropertyBag> properties;
-        std::shared_ptr<double> rank;
-        ClassMemberConstraints rank_constraint;
-
-        public:
-        /**
-         * Specifies whether the report may be produced during the scan.
-         */
-        std::shared_ptr<bool> get_enabled() const { return enabled; }
-        void set_enabled(std::shared_ptr<bool> value) { this->enabled = value; }
-
-        /**
-         * Specifies the failure level for the report.
-         */
-        std::shared_ptr<Level> get_level() const { return level; }
-        void set_level(std::shared_ptr<Level> value) { this->level = value; }
-
-        /**
-         * Contains configuration information specific to a report.
-         */
-        std::shared_ptr<PropertyBag> get_parameters() const { return parameters; }
-        void set_parameters(std::shared_ptr<PropertyBag> value) { this->parameters = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the reporting configuration.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-
-        /**
-         * Specifies the relative priority of the report. Used for analysis output only.
-         */
-        std::shared_ptr<double> get_rank() const { return rank; }
-        void set_rank(std::shared_ptr<double> value) { if (value) CheckConstraint("rank", rank_constraint, *value); this->rank = value; }
-    };
-
-    /**
-     * A reference used to locate the toolComponent associated with the descriptor.
-     *
-     * Identifies a particular toolComponent object, either the driver or an extension.
-     *
-     * The component which is strongly associated with this component. For a translation, this
-     * refers to the component which has been translated. For an extension, this is the driver
-     * that provides the extension's plugin model.
-     */
-    class ToolComponentReference {
-        public:
-        ToolComponentReference() :
-            guid_constraint(boost::none, boost::none, boost::none, boost::none, std::string("^[0-9a-fA-F]{8}-[0-9a-fA-F]{4}-[1-5][0-9a-fA-F]{3}-[89abAB][0-9a-fA-F]{3}-[0-9a-fA-F]{12}$")),
-            index_constraint(-1, boost::none, boost::none, boost::none, boost::none)
-        {}
-        virtual ~ToolComponentReference() = default;
-
-        private:
-        std::shared_ptr<std::string> guid;
-        ClassMemberConstraints guid_constraint;
-        std::shared_ptr<int64_t> index;
-        ClassMemberConstraints index_constraint;
-        std::shared_ptr<std::string> name;
-        std::shared_ptr<PropertyBag> properties;
-
-        public:
-        /**
-         * The 'guid' property of the referenced toolComponent.
-         */
-        std::shared_ptr<std::string> get_guid() const { return guid; }
-        void set_guid(std::shared_ptr<std::string> value) { if (value) CheckConstraint("guid", guid_constraint, *value); this->guid = value; }
-
-        /**
-         * An index into the referenced toolComponent in tool.extensions.
-         */
-        std::shared_ptr<int64_t> get_index() const { return index; }
-        void set_index(std::shared_ptr<int64_t> value) { if (value) CheckConstraint("index", index_constraint, *value); this->index = value; }
-
-        /**
-         * The 'name' property of the referenced toolComponent.
-         */
-        std::shared_ptr<std::string> get_name() const { return name; }
-        void set_name(std::shared_ptr<std::string> value) { this->name = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the toolComponentReference.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-    };
-
-    /**
-     * A reference used to locate the descriptor whose configuration was overridden.
-     *
-     * A reference used to locate the rule descriptor associated with this notification.
-     *
-     * A reference used to locate the descriptor relevant to this notification.
-     *
-     * A reference to the related reporting descriptor.
-     *
-     * A reference used to locate the rule descriptor relevant to this result.
-     *
-     * Information about how to locate a relevant reporting descriptor.
-     */
-    class ReportingDescriptorReference {
-        public:
-        ReportingDescriptorReference() :
-            guid_constraint(boost::none, boost::none, boost::none, boost::none, std::string("^[0-9a-fA-F]{8}-[0-9a-fA-F]{4}-[1-5][0-9a-fA-F]{3}-[89abAB][0-9a-fA-F]{3}-[0-9a-fA-F]{12}$")),
-            index_constraint(-1, boost::none, boost::none, boost::none, boost::none)
-        {}
-        virtual ~ReportingDescriptorReference() = default;
-
-        private:
-        std::shared_ptr<std::string> guid;
-        ClassMemberConstraints guid_constraint;
-        std::shared_ptr<std::string> id;
-        std::shared_ptr<int64_t> index;
-        ClassMemberConstraints index_constraint;
-        std::shared_ptr<PropertyBag> properties;
-        std::shared_ptr<ToolComponentReference> tool_component;
-
-        public:
-        /**
-         * A guid that uniquely identifies the descriptor.
-         */
-        std::shared_ptr<std::string> get_guid() const { return guid; }
-        void set_guid(std::shared_ptr<std::string> value) { if (value) CheckConstraint("guid", guid_constraint, *value); this->guid = value; }
-
-        /**
-         * The id of the descriptor.
-         */
-        std::shared_ptr<std::string> get_id() const { return id; }
-        void set_id(std::shared_ptr<std::string> value) { this->id = value; }
-
-        /**
-         * The index into an array of descriptors in toolComponent.ruleDescriptors,
-         * toolComponent.notificationDescriptors, or toolComponent.taxonomyDescriptors, depending on
-         * context.
-         */
-        std::shared_ptr<int64_t> get_index() const { return index; }
-        void set_index(std::shared_ptr<int64_t> value) { if (value) CheckConstraint("index", index_constraint, *value); this->index = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the reporting descriptor
-         * reference.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-
-        /**
-         * A reference used to locate the toolComponent associated with the descriptor.
-         */
-        std::shared_ptr<ToolComponentReference> get_tool_component() const { return tool_component; }
-        void set_tool_component(std::shared_ptr<ToolComponentReference> value) { this->tool_component = value; }
-    };
-
-    /**
-     * Information about how a specific rule or notification was reconfigured at runtime.
-     */
-    class ConfigurationOverride {
-        public:
-        ConfigurationOverride() = default;
-        virtual ~ConfigurationOverride() = default;
-
-        private:
-        ReportingConfiguration configuration;
-        ReportingDescriptorReference descriptor;
-        std::shared_ptr<PropertyBag> properties;
-
-        public:
-        /**
-         * Specifies how the rule or notification was configured during the scan.
-         */
-        const ReportingConfiguration & get_configuration() const { return configuration; }
-        ReportingConfiguration & get_mutable_configuration() { return configuration; }
-        void set_configuration(const ReportingConfiguration & value) { this->configuration = value; }
-
-        /**
-         * A reference used to locate the descriptor whose configuration was overridden.
-         */
-        const ReportingDescriptorReference & get_descriptor() const { return descriptor; }
-        ReportingDescriptorReference & get_mutable_descriptor() { return descriptor; }
-        void set_descriptor(const ReportingDescriptorReference & value) { this->descriptor = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the configuration override.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-    };
-
-    /**
-     * A region within an artifact where a result was detected.
-     *
-     * Specifies a portion of the artifact that encloses the region. Allows a viewer to display
-     * additional context around the region.
-     *
-     * Specifies a portion of the artifact.
-     *
-     * The region of the artifact to delete.
-     */
-    class Region {
-        public:
-        Region() :
-            byte_length_constraint(0, boost::none, boost::none, boost::none, boost::none),
-            byte_offset_constraint(-1, boost::none, boost::none, boost::none, boost::none),
-            char_length_constraint(0, boost::none, boost::none, boost::none, boost::none),
-            char_offset_constraint(-1, boost::none, boost::none, boost::none, boost::none),
-            end_column_constraint(1, boost::none, boost::none, boost::none, boost::none),
-            end_line_constraint(1, boost::none, boost::none, boost::none, boost::none),
-            start_column_constraint(1, boost::none, boost::none, boost::none, boost::none),
-            start_line_constraint(1, boost::none, boost::none, boost::none, boost::none)
-        {}
-        virtual ~Region() = default;
-
-        private:
-        std::shared_ptr<int64_t> byte_length;
-        ClassMemberConstraints byte_length_constraint;
-        std::shared_ptr<int64_t> byte_offset;
-        ClassMemberConstraints byte_offset_constraint;
-        std::shared_ptr<int64_t> char_length;
-        ClassMemberConstraints char_length_constraint;
-        std::shared_ptr<int64_t> char_offset;
-        ClassMemberConstraints char_offset_constraint;
-        std::shared_ptr<int64_t> end_column;
-        ClassMemberConstraints end_column_constraint;
-        std::shared_ptr<int64_t> end_line;
-        ClassMemberConstraints end_line_constraint;
-        std::shared_ptr<Message> message;
-        std::shared_ptr<PropertyBag> properties;
-        std::shared_ptr<ArtifactContent> snippet;
-        std::shared_ptr<std::string> source_language;
-        std::shared_ptr<int64_t> start_column;
-        ClassMemberConstraints start_column_constraint;
-        std::shared_ptr<int64_t> start_line;
-        ClassMemberConstraints start_line_constraint;
-
-        public:
-        /**
-         * The length of the region in bytes.
-         */
-        std::shared_ptr<int64_t> get_byte_length() const { return byte_length; }
-        void set_byte_length(std::shared_ptr<int64_t> value) { if (value) CheckConstraint("byte_length", byte_length_constraint, *value); this->byte_length = value; }
-
-        /**
-         * The zero-based offset from the beginning of the artifact of the first byte in the region.
-         */
-        std::shared_ptr<int64_t> get_byte_offset() const { return byte_offset; }
-        void set_byte_offset(std::shared_ptr<int64_t> value) { if (value) CheckConstraint("byte_offset", byte_offset_constraint, *value); this->byte_offset = value; }
-
-        /**
-         * The length of the region in characters.
-         */
-        std::shared_ptr<int64_t> get_char_length() const { return char_length; }
-        void set_char_length(std::shared_ptr<int64_t> value) { if (value) CheckConstraint("char_length", char_length_constraint, *value); this->char_length = value; }
-
-        /**
-         * The zero-based offset from the beginning of the artifact of the first character in the
-         * region.
-         */
-        std::shared_ptr<int64_t> get_char_offset() const { return char_offset; }
-        void set_char_offset(std::shared_ptr<int64_t> value) { if (value) CheckConstraint("char_offset", char_offset_constraint, *value); this->char_offset = value; }
-
-        /**
-         * The column number of the character following the end of the region.
-         */
-        std::shared_ptr<int64_t> get_end_column() const { return end_column; }
-        void set_end_column(std::shared_ptr<int64_t> value) { if (value) CheckConstraint("end_column", end_column_constraint, *value); this->end_column = value; }
-
-        /**
-         * The line number of the last character in the region.
-         */
-        std::shared_ptr<int64_t> get_end_line() const { return end_line; }
-        void set_end_line(std::shared_ptr<int64_t> value) { if (value) CheckConstraint("end_line", end_line_constraint, *value); this->end_line = value; }
-
-        /**
-         * A message relevant to the region.
-         */
-        std::shared_ptr<Message> get_message() const { return message; }
-        void set_message(std::shared_ptr<Message> value) { this->message = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the region.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-
-        /**
-         * The portion of the artifact contents within the specified region.
-         */
-        std::shared_ptr<ArtifactContent> get_snippet() const { return snippet; }
-        void set_snippet(std::shared_ptr<ArtifactContent> value) { this->snippet = value; }
-
-        /**
-         * Specifies the source language, if any, of the portion of the artifact specified by the
-         * region object.
-         */
-        std::shared_ptr<std::string> get_source_language() const { return source_language; }
-        void set_source_language(std::shared_ptr<std::string> value) { this->source_language = value; }
-
-        /**
-         * The column number of the first character in the region.
-         */
-        std::shared_ptr<int64_t> get_start_column() const { return start_column; }
-        void set_start_column(std::shared_ptr<int64_t> value) { if (value) CheckConstraint("start_column", start_column_constraint, *value); this->start_column = value; }
-
-        /**
-         * The line number of the first character in the region.
-         */
-        std::shared_ptr<int64_t> get_start_line() const { return start_line; }
-        void set_start_line(std::shared_ptr<int64_t> value) { if (value) CheckConstraint("start_line", start_line_constraint, *value); this->start_line = value; }
-    };
-
-    /**
-     * A logical location of a construct that produced a result.
-     */
-    class LogicalLocation {
-        public:
-        LogicalLocation() :
-            index_constraint(-1, boost::none, boost::none, boost::none, boost::none),
-            parent_index_constraint(-1, boost::none, boost::none, boost::none, boost::none)
-        {}
-        virtual ~LogicalLocation() = default;
-
-        private:
-        std::shared_ptr<std::string> decorated_name;
-        std::shared_ptr<std::string> fully_qualified_name;
-        std::shared_ptr<int64_t> index;
-        ClassMemberConstraints index_constraint;
-        std::shared_ptr<std::string> kind;
-        std::shared_ptr<std::string> name;
-        std::shared_ptr<int64_t> parent_index;
-        ClassMemberConstraints parent_index_constraint;
-        std::shared_ptr<PropertyBag> properties;
-
-        public:
-        /**
-         * The machine-readable name for the logical location, such as a mangled function name
-         * provided by a C++ compiler that encodes calling convention, return type and other details
-         * along with the function name.
-         */
-        std::shared_ptr<std::string> get_decorated_name() const { return decorated_name; }
-        void set_decorated_name(std::shared_ptr<std::string> value) { this->decorated_name = value; }
-
-        /**
-         * The human-readable fully qualified name of the logical location.
-         */
-        std::shared_ptr<std::string> get_fully_qualified_name() const { return fully_qualified_name; }
-        void set_fully_qualified_name(std::shared_ptr<std::string> value) { this->fully_qualified_name = value; }
-
-        /**
-         * The index within the logical locations array.
-         */
-        std::shared_ptr<int64_t> get_index() const { return index; }
-        void set_index(std::shared_ptr<int64_t> value) { if (value) CheckConstraint("index", index_constraint, *value); this->index = value; }
-
-        /**
-         * The type of construct this logical location component refers to. Should be one of
-         * 'function', 'member', 'module', 'namespace', 'parameter', 'resource', 'returnType',
-         * 'type', 'variable', 'object', 'array', 'property', 'value', 'element', 'text',
-         * 'attribute', 'comment', 'declaration', 'dtd' or 'processingInstruction', if any of those
-         * accurately describe the construct.
-         */
-        std::shared_ptr<std::string> get_kind() const { return kind; }
-        void set_kind(std::shared_ptr<std::string> value) { this->kind = value; }
-
-        /**
-         * Identifies the construct in which the result occurred. For example, this property might
-         * contain the name of a class or a method.
-         */
-        std::shared_ptr<std::string> get_name() const { return name; }
-        void set_name(std::shared_ptr<std::string> value) { this->name = value; }
-
-        /**
-         * Identifies the index of the immediate parent of the construct in which the result was
-         * detected. For example, this property might point to a logical location that represents
-         * the namespace that holds a type.
-         */
-        std::shared_ptr<int64_t> get_parent_index() const { return parent_index; }
-        void set_parent_index(std::shared_ptr<int64_t> value) { if (value) CheckConstraint("parent_index", parent_index_constraint, *value); this->parent_index = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the logical location.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-    };
-
-    /**
-     * Identifies the artifact and region.
-     *
-     * A physical location relevant to a result. Specifies a reference to a programming artifact
-     * together with a range of bytes or characters within that artifact.
-     */
-    class PhysicalLocation {
-        public:
-        PhysicalLocation() = default;
-        virtual ~PhysicalLocation() = default;
-
-        private:
-        std::shared_ptr<Address> address;
-        std::shared_ptr<ArtifactLocation> artifact_location;
-        std::shared_ptr<Region> context_region;
-        std::shared_ptr<PropertyBag> properties;
-        std::shared_ptr<Region> region;
-
-        public:
-        /**
-         * The address of the location.
-         */
-        std::shared_ptr<Address> get_address() const { return address; }
-        void set_address(std::shared_ptr<Address> value) { this->address = value; }
-
-        /**
-         * The location of the artifact.
-         */
-        std::shared_ptr<ArtifactLocation> get_artifact_location() const { return artifact_location; }
-        void set_artifact_location(std::shared_ptr<ArtifactLocation> value) { this->artifact_location = value; }
-
-        /**
-         * Specifies a portion of the artifact that encloses the region. Allows a viewer to display
-         * additional context around the region.
-         */
-        std::shared_ptr<Region> get_context_region() const { return context_region; }
-        void set_context_region(std::shared_ptr<Region> value) { this->context_region = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the physical location.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-
-        /**
-         * Specifies a portion of the artifact.
-         */
-        std::shared_ptr<Region> get_region() const { return region; }
-        void set_region(std::shared_ptr<Region> value) { this->region = value; }
-    };
-
-    /**
-     * Information about the relation of one location to another.
-     */
-    class LocationRelationship {
-        public:
-        LocationRelationship() :
-            target_constraint(0, boost::none, boost::none, boost::none, boost::none)
-        {}
-        virtual ~LocationRelationship() = default;
-
-        private:
-        std::shared_ptr<Message> description;
-        std::shared_ptr<std::vector<std::string>> kinds;
-        std::shared_ptr<PropertyBag> properties;
-        int64_t target;
-        ClassMemberConstraints target_constraint;
-
-        public:
-        /**
-         * A description of the location relationship.
-         */
-        std::shared_ptr<Message> get_description() const { return description; }
-        void set_description(std::shared_ptr<Message> value) { this->description = value; }
-
-        /**
-         * A set of distinct strings that categorize the relationship. Well-known kinds include
-         * 'includes', 'isIncludedBy' and 'relevant'.
-         */
-        std::shared_ptr<std::vector<std::string>> get_kinds() const { return kinds; }
-        void set_kinds(std::shared_ptr<std::vector<std::string>> value) { this->kinds = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the location relationship.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-
-        /**
-         * A reference to the related location.
-         */
-        const int64_t & get_target() const { return target; }
-        int64_t & get_mutable_target() { return target; }
-        void set_target(const int64_t & value) { CheckConstraint("target", target_constraint, value); this->target = value; }
-    };
-
-    /**
-     * The location to which this stack frame refers.
-     *
-     * A location within a programming artifact.
-     *
-     * A code location associated with the node.
-     *
-     * The code location.
-     *
-     * Identifies the location associated with the suppression.
-     */
-    class Location {
-        public:
-        Location() :
-            id_constraint(-1, boost::none, boost::none, boost::none, boost::none)
-        {}
-        virtual ~Location() = default;
-
-        private:
-        std::shared_ptr<std::vector<Region>> annotations;
-        std::shared_ptr<int64_t> id;
-        ClassMemberConstraints id_constraint;
-        std::shared_ptr<std::vector<LogicalLocation>> logical_locations;
-        std::shared_ptr<Message> message;
-        std::shared_ptr<PhysicalLocation> physical_location;
-        std::shared_ptr<PropertyBag> properties;
-        std::shared_ptr<std::vector<LocationRelationship>> relationships;
-
-        public:
-        /**
-         * A set of regions relevant to the location.
-         */
-        std::shared_ptr<std::vector<Region>> get_annotations() const { return annotations; }
-        void set_annotations(std::shared_ptr<std::vector<Region>> value) { this->annotations = value; }
-
-        /**
-         * Value that distinguishes this location from all other locations within a single result
-         * object.
-         */
-        std::shared_ptr<int64_t> get_id() const { return id; }
-        void set_id(std::shared_ptr<int64_t> value) { if (value) CheckConstraint("id", id_constraint, *value); this->id = value; }
-
-        /**
-         * The logical locations associated with the result.
-         */
-        std::shared_ptr<std::vector<LogicalLocation>> get_logical_locations() const { return logical_locations; }
-        void set_logical_locations(std::shared_ptr<std::vector<LogicalLocation>> value) { this->logical_locations = value; }
-
-        /**
-         * A message relevant to the location.
-         */
-        std::shared_ptr<Message> get_message() const { return message; }
-        void set_message(std::shared_ptr<Message> value) { this->message = value; }
-
-        /**
-         * Identifies the artifact and region.
-         */
-        std::shared_ptr<PhysicalLocation> get_physical_location() const { return physical_location; }
-        void set_physical_location(std::shared_ptr<PhysicalLocation> value) { this->physical_location = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the location.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-
-        /**
-         * An array of objects that describe relationships between this location and others.
-         */
-        std::shared_ptr<std::vector<LocationRelationship>> get_relationships() const { return relationships; }
-        void set_relationships(std::shared_ptr<std::vector<LocationRelationship>> value) { this->relationships = value; }
-    };
-
-    /**
-     * A function call within a stack trace.
-     */
-    class StackFrame {
-        public:
-        StackFrame() = default;
-        virtual ~StackFrame() = default;
-
-        private:
-        std::shared_ptr<Location> location;
-        std::shared_ptr<std::string> stack_frame_module;
-        std::shared_ptr<std::vector<std::string>> parameters;
-        std::shared_ptr<PropertyBag> properties;
-        std::shared_ptr<int64_t> thread_id;
-
-        public:
-        /**
-         * The location to which this stack frame refers.
-         */
-        std::shared_ptr<Location> get_location() const { return location; }
-        void set_location(std::shared_ptr<Location> value) { this->location = value; }
-
-        /**
-         * The name of the module that contains the code of this stack frame.
-         */
-        std::shared_ptr<std::string> get_stack_frame_module() const { return stack_frame_module; }
-        void set_stack_frame_module(std::shared_ptr<std::string> value) { this->stack_frame_module = value; }
-
-        /**
-         * The parameters of the call that is executing.
-         */
-        std::shared_ptr<std::vector<std::string>> get_parameters() const { return parameters; }
-        void set_parameters(std::shared_ptr<std::vector<std::string>> value) { this->parameters = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the stack frame.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-
-        /**
-         * The thread identifier of the stack frame.
-         */
-        std::shared_ptr<int64_t> get_thread_id() const { return thread_id; }
-        void set_thread_id(std::shared_ptr<int64_t> value) { this->thread_id = value; }
-    };
-
-    /**
-     * The sequence of function calls leading to the exception.
-     *
-     * A call stack that is relevant to a result.
-     *
-     * The call stack leading to this location.
-     */
-    class Stack {
-        public:
-        Stack() = default;
-        virtual ~Stack() = default;
-
-        private:
-        std::vector<StackFrame> frames;
-        std::shared_ptr<Message> message;
-        std::shared_ptr<PropertyBag> properties;
-
-        public:
-        /**
-         * An array of stack frames that represents a sequence of calls, rendered in reverse
-         * chronological order, that comprise the call stack.
-         */
-        const std::vector<StackFrame> & get_frames() const { return frames; }
-        std::vector<StackFrame> & get_mutable_frames() { return frames; }
-        void set_frames(const std::vector<StackFrame> & value) { this->frames = value; }
-
-        /**
-         * A message relevant to this call stack.
-         */
-        std::shared_ptr<Message> get_message() const { return message; }
-        void set_message(std::shared_ptr<Message> value) { this->message = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the stack.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-    };
-
-    /**
-     * The runtime exception, if any, relevant to this notification.
-     *
-     * Describes a runtime exception encountered during the execution of an analysis tool.
-     */
-    class Exception {
-        public:
-        Exception() = default;
-        virtual ~Exception() = default;
-
-        private:
-        std::shared_ptr<std::vector<Exception>> inner_exceptions;
-        std::shared_ptr<std::string> kind;
-        std::shared_ptr<std::string> message;
-        std::shared_ptr<PropertyBag> properties;
-        std::shared_ptr<Stack> stack;
-
-        public:
-        /**
-         * An array of exception objects each of which is considered a cause of this exception.
-         */
-        std::shared_ptr<std::vector<Exception>> get_inner_exceptions() const { return inner_exceptions; }
-        void set_inner_exceptions(std::shared_ptr<std::vector<Exception>> value) { this->inner_exceptions = value; }
-
-        /**
-         * A string that identifies the kind of exception, for example, the fully qualified type
-         * name of an object that was thrown, or the symbolic name of a signal.
-         */
-        std::shared_ptr<std::string> get_kind() const { return kind; }
-        void set_kind(std::shared_ptr<std::string> value) { this->kind = value; }
-
-        /**
-         * A message that describes the exception.
-         */
-        std::shared_ptr<std::string> get_message() const { return message; }
-        void set_message(std::shared_ptr<std::string> value) { this->message = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the exception.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-
-        /**
-         * The sequence of function calls leading to the exception.
-         */
-        std::shared_ptr<Stack> get_stack() const { return stack; }
-        void set_stack(std::shared_ptr<Stack> value) { this->stack = value; }
-    };
-
-    /**
-     * Describes a condition relevant to the tool itself, as opposed to being relevant to a
-     * target being analyzed by the tool.
-     */
-    class Notification {
-        public:
-        Notification() = default;
-        virtual ~Notification() = default;
-
-        private:
-        std::shared_ptr<ReportingDescriptorReference> associated_rule;
-        std::shared_ptr<ReportingDescriptorReference> descriptor;
-        std::shared_ptr<Exception> exception;
-        std::shared_ptr<Level> level;
-        std::shared_ptr<std::vector<Location>> locations;
-        Message message;
-        std::shared_ptr<PropertyBag> properties;
-        std::shared_ptr<int64_t> thread_id;
-        std::shared_ptr<std::string> time_utc;
-
-        public:
-        /**
-         * A reference used to locate the rule descriptor associated with this notification.
-         */
-        std::shared_ptr<ReportingDescriptorReference> get_associated_rule() const { return associated_rule; }
-        void set_associated_rule(std::shared_ptr<ReportingDescriptorReference> value) { this->associated_rule = value; }
-
-        /**
-         * A reference used to locate the descriptor relevant to this notification.
-         */
-        std::shared_ptr<ReportingDescriptorReference> get_descriptor() const { return descriptor; }
-        void set_descriptor(std::shared_ptr<ReportingDescriptorReference> value) { this->descriptor = value; }
-
-        /**
-         * The runtime exception, if any, relevant to this notification.
-         */
-        std::shared_ptr<Exception> get_exception() const { return exception; }
-        void set_exception(std::shared_ptr<Exception> value) { this->exception = value; }
-
-        /**
-         * A value specifying the severity level of the notification.
-         */
-        std::shared_ptr<Level> get_level() const { return level; }
-        void set_level(std::shared_ptr<Level> value) { this->level = value; }
-
-        /**
-         * The locations relevant to this notification.
-         */
-        std::shared_ptr<std::vector<Location>> get_locations() const { return locations; }
-        void set_locations(std::shared_ptr<std::vector<Location>> value) { this->locations = value; }
-
-        /**
-         * A message that describes the condition that was encountered.
-         */
-        const Message & get_message() const { return message; }
-        Message & get_mutable_message() { return message; }
-        void set_message(const Message & value) { this->message = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the notification.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-
-        /**
-         * The thread identifier of the code that generated the notification.
-         */
-        std::shared_ptr<int64_t> get_thread_id() const { return thread_id; }
-        void set_thread_id(std::shared_ptr<int64_t> value) { this->thread_id = value; }
-
-        /**
-         * The Coordinated Universal Time (UTC) date and time at which the analysis tool generated
-         * the notification.
-         */
-        std::shared_ptr<std::string> get_time_utc() const { return time_utc; }
-        void set_time_utc(std::shared_ptr<std::string> value) { this->time_utc = value; }
-    };
-
-    /**
-     * An invocation object that describes the invocation of the converter.
-     *
-     * The runtime environment of the analysis tool run.
-     */
-    class Invocation {
-        public:
-        Invocation() = default;
-        virtual ~Invocation() = default;
-
-        private:
-        std::shared_ptr<std::string> account;
-        std::shared_ptr<std::vector<std::string>> arguments;
-        std::shared_ptr<std::string> command_line;
-        std::shared_ptr<std::string> end_time_utc;
-        std::shared_ptr<std::map<std::string, std::string>> environment_variables;
-        std::shared_ptr<ArtifactLocation> executable_location;
-        bool execution_successful;
-        std::shared_ptr<int64_t> exit_code;
-        std::shared_ptr<std::string> exit_code_description;
-        std::shared_ptr<std::string> exit_signal_name;
-        std::shared_ptr<int64_t> exit_signal_number;
-        std::shared_ptr<std::string> machine;
-        std::shared_ptr<std::vector<ConfigurationOverride>> notification_configuration_overrides;
-        std::shared_ptr<int64_t> process_id;
-        std::shared_ptr<std::string> process_start_failure_message;
-        std::shared_ptr<PropertyBag> properties;
-        std::shared_ptr<std::vector<ArtifactLocation>> response_files;
-        std::shared_ptr<std::vector<ConfigurationOverride>> rule_configuration_overrides;
-        std::shared_ptr<std::string> start_time_utc;
-        std::shared_ptr<ArtifactLocation> stderr;
-        std::shared_ptr<ArtifactLocation> stdin;
-        std::shared_ptr<ArtifactLocation> stdout;
-        std::shared_ptr<ArtifactLocation> stdout_stderr;
-        std::shared_ptr<std::vector<Notification>> tool_configuration_notifications;
-        std::shared_ptr<std::vector<Notification>> tool_execution_notifications;
-        std::shared_ptr<ArtifactLocation> working_directory;
-
-        public:
-        /**
-         * The account under which the invocation occurred.
-         */
-        std::shared_ptr<std::string> get_account() const { return account; }
-        void set_account(std::shared_ptr<std::string> value) { this->account = value; }
-
-        /**
-         * An array of strings, containing in order the command line arguments passed to the tool
-         * from the operating system.
-         */
-        std::shared_ptr<std::vector<std::string>> get_arguments() const { return arguments; }
-        void set_arguments(std::shared_ptr<std::vector<std::string>> value) { this->arguments = value; }
-
-        /**
-         * The command line used to invoke the tool.
-         */
-        std::shared_ptr<std::string> get_command_line() const { return command_line; }
-        void set_command_line(std::shared_ptr<std::string> value) { this->command_line = value; }
-
-        /**
-         * The Coordinated Universal Time (UTC) date and time at which the invocation ended. See
-         * "Date/time properties" in the SARIF spec for the required format.
-         */
-        std::shared_ptr<std::string> get_end_time_utc() const { return end_time_utc; }
-        void set_end_time_utc(std::shared_ptr<std::string> value) { this->end_time_utc = value; }
-
-        /**
-         * The environment variables associated with the analysis tool process, expressed as
-         * key/value pairs.
-         */
-        std::shared_ptr<std::map<std::string, std::string>> get_environment_variables() const { return environment_variables; }
-        void set_environment_variables(std::shared_ptr<std::map<std::string, std::string>> value) { this->environment_variables = value; }
-
-        /**
-         * An absolute URI specifying the location of the executable that was invoked.
-         */
-        std::shared_ptr<ArtifactLocation> get_executable_location() const { return executable_location; }
-        void set_executable_location(std::shared_ptr<ArtifactLocation> value) { this->executable_location = value; }
-
-        /**
-         * Specifies whether the tool's execution completed successfully.
-         */
-        const bool & get_execution_successful() const { return execution_successful; }
-        bool & get_mutable_execution_successful() { return execution_successful; }
-        void set_execution_successful(const bool & value) { this->execution_successful = value; }
-
-        /**
-         * The process exit code.
-         */
-        std::shared_ptr<int64_t> get_exit_code() const { return exit_code; }
-        void set_exit_code(std::shared_ptr<int64_t> value) { this->exit_code = value; }
-
-        /**
-         * The reason for the process exit.
-         */
-        std::shared_ptr<std::string> get_exit_code_description() const { return exit_code_description; }
-        void set_exit_code_description(std::shared_ptr<std::string> value) { this->exit_code_description = value; }
-
-        /**
-         * The name of the signal that caused the process to exit.
-         */
-        std::shared_ptr<std::string> get_exit_signal_name() const { return exit_signal_name; }
-        void set_exit_signal_name(std::shared_ptr<std::string> value) { this->exit_signal_name = value; }
-
-        /**
-         * The numeric value of the signal that caused the process to exit.
-         */
-        std::shared_ptr<int64_t> get_exit_signal_number() const { return exit_signal_number; }
-        void set_exit_signal_number(std::shared_ptr<int64_t> value) { this->exit_signal_number = value; }
-
-        /**
-         * The machine on which the invocation occurred.
-         */
-        std::shared_ptr<std::string> get_machine() const { return machine; }
-        void set_machine(std::shared_ptr<std::string> value) { this->machine = value; }
-
-        /**
-         * An array of configurationOverride objects that describe notifications related runtime
-         * overrides.
-         */
-        std::shared_ptr<std::vector<ConfigurationOverride>> get_notification_configuration_overrides() const { return notification_configuration_overrides; }
-        void set_notification_configuration_overrides(std::shared_ptr<std::vector<ConfigurationOverride>> value) { this->notification_configuration_overrides = value; }
-
-        /**
-         * The id of the process in which the invocation occurred.
-         */
-        std::shared_ptr<int64_t> get_process_id() const { return process_id; }
-        void set_process_id(std::shared_ptr<int64_t> value) { this->process_id = value; }
-
-        /**
-         * The reason given by the operating system that the process failed to start.
-         */
-        std::shared_ptr<std::string> get_process_start_failure_message() const { return process_start_failure_message; }
-        void set_process_start_failure_message(std::shared_ptr<std::string> value) { this->process_start_failure_message = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the invocation.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-
-        /**
-         * The locations of any response files specified on the tool's command line.
-         */
-        std::shared_ptr<std::vector<ArtifactLocation>> get_response_files() const { return response_files; }
-        void set_response_files(std::shared_ptr<std::vector<ArtifactLocation>> value) { this->response_files = value; }
-
-        /**
-         * An array of configurationOverride objects that describe rules related runtime overrides.
-         */
-        std::shared_ptr<std::vector<ConfigurationOverride>> get_rule_configuration_overrides() const { return rule_configuration_overrides; }
-        void set_rule_configuration_overrides(std::shared_ptr<std::vector<ConfigurationOverride>> value) { this->rule_configuration_overrides = value; }
-
-        /**
-         * The Coordinated Universal Time (UTC) date and time at which the invocation started. See
-         * "Date/time properties" in the SARIF spec for the required format.
-         */
-        std::shared_ptr<std::string> get_start_time_utc() const { return start_time_utc; }
-        void set_start_time_utc(std::shared_ptr<std::string> value) { this->start_time_utc = value; }
-
-        /**
-         * A file containing the standard error stream from the process that was invoked.
-         */
-        std::shared_ptr<ArtifactLocation> get_stderr() const { return stderr; }
-        void set_stderr(std::shared_ptr<ArtifactLocation> value) { this->stderr = value; }
-
-        /**
-         * A file containing the standard input stream to the process that was invoked.
-         */
-        std::shared_ptr<ArtifactLocation> get_stdin() const { return stdin; }
-        void set_stdin(std::shared_ptr<ArtifactLocation> value) { this->stdin = value; }
-
-        /**
-         * A file containing the standard output stream from the process that was invoked.
-         */
-        std::shared_ptr<ArtifactLocation> get_stdout() const { return stdout; }
-        void set_stdout(std::shared_ptr<ArtifactLocation> value) { this->stdout = value; }
-
-        /**
-         * A file containing the interleaved standard output and standard error stream from the
-         * process that was invoked.
-         */
-        std::shared_ptr<ArtifactLocation> get_stdout_stderr() const { return stdout_stderr; }
-        void set_stdout_stderr(std::shared_ptr<ArtifactLocation> value) { this->stdout_stderr = value; }
-
-        /**
-         * A list of conditions detected by the tool that are relevant to the tool's configuration.
-         */
-        std::shared_ptr<std::vector<Notification>> get_tool_configuration_notifications() const { return tool_configuration_notifications; }
-        void set_tool_configuration_notifications(std::shared_ptr<std::vector<Notification>> value) { this->tool_configuration_notifications = value; }
-
-        /**
-         * A list of runtime conditions detected by the tool during the analysis.
-         */
-        std::shared_ptr<std::vector<Notification>> get_tool_execution_notifications() const { return tool_execution_notifications; }
-        void set_tool_execution_notifications(std::shared_ptr<std::vector<Notification>> value) { this->tool_execution_notifications = value; }
-
-        /**
-         * The working directory for the invocation.
-         */
-        std::shared_ptr<ArtifactLocation> get_working_directory() const { return working_directory; }
-        void set_working_directory(std::shared_ptr<ArtifactLocation> value) { this->working_directory = value; }
-    };
-
-    enum class Content : int { LOCALIZED_DATA, NON_LOCALIZED_DATA };
-
-    /**
-     * Information about the relation of one reporting descriptor to another.
-     */
-    class ReportingDescriptorRelationship {
-        public:
-        ReportingDescriptorRelationship() = default;
-        virtual ~ReportingDescriptorRelationship() = default;
-
-        private:
-        std::shared_ptr<Message> description;
-        std::shared_ptr<std::vector<std::string>> kinds;
-        std::shared_ptr<PropertyBag> properties;
-        ReportingDescriptorReference target;
-
-        public:
-        /**
-         * A description of the reporting descriptor relationship.
-         */
-        std::shared_ptr<Message> get_description() const { return description; }
-        void set_description(std::shared_ptr<Message> value) { this->description = value; }
-
-        /**
-         * A set of distinct strings that categorize the relationship. Well-known kinds include
-         * 'canPrecede', 'canFollow', 'willPrecede', 'willFollow', 'superset', 'subset', 'equal',
-         * 'disjoint', 'relevant', and 'incomparable'.
-         */
-        std::shared_ptr<std::vector<std::string>> get_kinds() const { return kinds; }
-        void set_kinds(std::shared_ptr<std::vector<std::string>> value) { this->kinds = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the reporting descriptor
-         * reference.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-
-        /**
-         * A reference to the related reporting descriptor.
-         */
-        const ReportingDescriptorReference & get_target() const { return target; }
-        ReportingDescriptorReference & get_mutable_target() { return target; }
-        void set_target(const ReportingDescriptorReference & value) { this->target = value; }
-    };
-
-    /**
-     * Metadata that describes a specific report produced by the tool, as part of the analysis
-     * it provides or its runtime reporting.
-     */
-    class ReportingDescriptor {
-        public:
-        ReportingDescriptor() :
-            guid_constraint(boost::none, boost::none, boost::none, boost::none, std::string("^[0-9a-fA-F]{8}-[0-9a-fA-F]{4}-[1-5][0-9a-fA-F]{3}-[89abAB][0-9a-fA-F]{3}-[0-9a-fA-F]{12}$"))
-        {}
-        virtual ~ReportingDescriptor() = default;
-
-        private:
-        std::shared_ptr<ReportingConfiguration> default_configuration;
-        std::shared_ptr<std::vector<std::string>> deprecated_guids;
-        std::shared_ptr<std::vector<std::string>> deprecated_ids;
-        std::shared_ptr<std::vector<std::string>> deprecated_names;
-        std::shared_ptr<MultiformatMessageString> full_description;
-        std::shared_ptr<std::string> guid;
-        ClassMemberConstraints guid_constraint;
-        std::shared_ptr<MultiformatMessageString> help;
-        std::shared_ptr<std::string> help_uri;
-        std::string id;
-        std::shared_ptr<std::map<std::string, MultiformatMessageString>> message_strings;
-        std::shared_ptr<std::string> name;
-        std::shared_ptr<PropertyBag> properties;
-        std::shared_ptr<std::vector<ReportingDescriptorRelationship>> relationships;
-        std::shared_ptr<MultiformatMessageString> short_description;
-
-        public:
-        /**
-         * Default reporting configuration information.
-         */
-        std::shared_ptr<ReportingConfiguration> get_default_configuration() const { return default_configuration; }
-        void set_default_configuration(std::shared_ptr<ReportingConfiguration> value) { this->default_configuration = value; }
-
-        /**
-         * An array of unique identifies in the form of a GUID by which this report was known in
-         * some previous version of the analysis tool.
-         */
-        std::shared_ptr<std::vector<std::string>> get_deprecated_guids() const { return deprecated_guids; }
-        void set_deprecated_guids(std::shared_ptr<std::vector<std::string>> value) { this->deprecated_guids = value; }
-
-        /**
-         * An array of stable, opaque identifiers by which this report was known in some previous
-         * version of the analysis tool.
-         */
-        std::shared_ptr<std::vector<std::string>> get_deprecated_ids() const { return deprecated_ids; }
-        void set_deprecated_ids(std::shared_ptr<std::vector<std::string>> value) { this->deprecated_ids = value; }
-
-        /**
-         * An array of readable identifiers by which this report was known in some previous version
-         * of the analysis tool.
-         */
-        std::shared_ptr<std::vector<std::string>> get_deprecated_names() const { return deprecated_names; }
-        void set_deprecated_names(std::shared_ptr<std::vector<std::string>> value) { this->deprecated_names = value; }
-
-        /**
-         * A description of the report. Should, as far as possible, provide details sufficient to
-         * enable resolution of any problem indicated by the result.
-         */
-        std::shared_ptr<MultiformatMessageString> get_full_description() const { return full_description; }
-        void set_full_description(std::shared_ptr<MultiformatMessageString> value) { this->full_description = value; }
-
-        /**
-         * A unique identifer for the reporting descriptor in the form of a GUID.
-         */
-        std::shared_ptr<std::string> get_guid() const { return guid; }
-        void set_guid(std::shared_ptr<std::string> value) { if (value) CheckConstraint("guid", guid_constraint, *value); this->guid = value; }
-
-        /**
-         * Provides the primary documentation for the report, useful when there is no online
-         * documentation.
-         */
-        std::shared_ptr<MultiformatMessageString> get_help() const { return help; }
-        void set_help(std::shared_ptr<MultiformatMessageString> value) { this->help = value; }
-
-        /**
-         * A URI where the primary documentation for the report can be found.
-         */
-        std::shared_ptr<std::string> get_help_uri() const { return help_uri; }
-        void set_help_uri(std::shared_ptr<std::string> value) { this->help_uri = value; }
-
-        /**
-         * A stable, opaque identifier for the report.
-         */
-        const std::string & get_id() const { return id; }
-        std::string & get_mutable_id() { return id; }
-        void set_id(const std::string & value) { this->id = value; }
-
-        /**
-         * A set of name/value pairs with arbitrary names. Each value is a multiformatMessageString
-         * object, which holds message strings in plain text and (optionally) Markdown format. The
-         * strings can include placeholders, which can be used to construct a message in combination
-         * with an arbitrary number of additional string arguments.
-         */
-        std::shared_ptr<std::map<std::string, MultiformatMessageString>> get_message_strings() const { return message_strings; }
-        void set_message_strings(std::shared_ptr<std::map<std::string, MultiformatMessageString>> value) { this->message_strings = value; }
-
-        /**
-         * A report identifier that is understandable to an end user.
-         */
-        std::shared_ptr<std::string> get_name() const { return name; }
-        void set_name(std::shared_ptr<std::string> value) { this->name = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the report.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-
-        /**
-         * An array of objects that describe relationships between this reporting descriptor and
-         * others.
-         */
-        std::shared_ptr<std::vector<ReportingDescriptorRelationship>> get_relationships() const { return relationships; }
-        void set_relationships(std::shared_ptr<std::vector<ReportingDescriptorRelationship>> value) { this->relationships = value; }
-
-        /**
-         * A concise description of the report. Should be a single sentence that is understandable
-         * when visible space is limited to a single line of text.
-         */
-        std::shared_ptr<MultiformatMessageString> get_short_description() const { return short_description; }
-        void set_short_description(std::shared_ptr<MultiformatMessageString> value) { this->short_description = value; }
-    };
-
-    /**
-     * Translation metadata, required for a translation, not populated by other component
-     * types.
-     *
-     * Provides additional metadata related to translation.
-     */
-    class TranslationMetadata {
-        public:
-        TranslationMetadata() = default;
-        virtual ~TranslationMetadata() = default;
-
-        private:
-        std::shared_ptr<std::string> download_uri;
-        std::shared_ptr<MultiformatMessageString> full_description;
-        std::shared_ptr<std::string> full_name;
-        std::shared_ptr<std::string> information_uri;
-        std::string name;
-        std::shared_ptr<PropertyBag> properties;
-        std::shared_ptr<MultiformatMessageString> short_description;
-
-        public:
-        /**
-         * The absolute URI from which the translation metadata can be downloaded.
-         */
-        std::shared_ptr<std::string> get_download_uri() const { return download_uri; }
-        void set_download_uri(std::shared_ptr<std::string> value) { this->download_uri = value; }
-
-        /**
-         * A comprehensive description of the translation metadata.
-         */
-        std::shared_ptr<MultiformatMessageString> get_full_description() const { return full_description; }
-        void set_full_description(std::shared_ptr<MultiformatMessageString> value) { this->full_description = value; }
-
-        /**
-         * The full name associated with the translation metadata.
-         */
-        std::shared_ptr<std::string> get_full_name() const { return full_name; }
-        void set_full_name(std::shared_ptr<std::string> value) { this->full_name = value; }
-
-        /**
-         * The absolute URI from which information related to the translation metadata can be
-         * downloaded.
-         */
-        std::shared_ptr<std::string> get_information_uri() const { return information_uri; }
-        void set_information_uri(std::shared_ptr<std::string> value) { this->information_uri = value; }
-
-        /**
-         * The name associated with the translation metadata.
-         */
-        const std::string & get_name() const { return name; }
-        std::string & get_mutable_name() { return name; }
-        void set_name(const std::string & value) { this->name = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the translation metadata.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-
-        /**
-         * A brief description of the translation metadata.
-         */
-        std::shared_ptr<MultiformatMessageString> get_short_description() const { return short_description; }
-        void set_short_description(std::shared_ptr<MultiformatMessageString> value) { this->short_description = value; }
-    };
-
-    /**
-     * The analysis tool that was run.
-     *
-     * A component, such as a plug-in or the driver, of the analysis tool that was run.
-     *
-     * The analysis tool object that will be merged with a separate run.
-     */
-    class ToolComponent {
-        public:
-        ToolComponent() :
-            dotted_quad_file_version_constraint(boost::none, boost::none, boost::none, boost::none, std::string("[0-9]+(\\.[0-9]+){3}")),
-            guid_constraint(boost::none, boost::none, boost::none, boost::none, std::string("^[0-9a-fA-F]{8}-[0-9a-fA-F]{4}-[1-5][0-9a-fA-F]{3}-[89abAB][0-9a-fA-F]{3}-[0-9a-fA-F]{12}$")),
-            language_constraint(boost::none, boost::none, boost::none, boost::none, std::string("^[a-zA-Z]{2}|^[a-zA-Z]{2}-[a-zA-Z]{2}]?$"))
-        {}
-        virtual ~ToolComponent() = default;
-
-        private:
-        std::shared_ptr<ToolComponentReference> associated_component;
-        std::shared_ptr<std::vector<Content>> contents;
-        std::shared_ptr<std::string> dotted_quad_file_version;
-        ClassMemberConstraints dotted_quad_file_version_constraint;
-        std::shared_ptr<std::string> download_uri;
-        std::shared_ptr<MultiformatMessageString> full_description;
-        std::shared_ptr<std::string> full_name;
-        std::shared_ptr<std::map<std::string, MultiformatMessageString>> global_message_strings;
-        std::shared_ptr<std::string> guid;
-        ClassMemberConstraints guid_constraint;
-        std::shared_ptr<std::string> information_uri;
-        std::shared_ptr<bool> is_comprehensive;
-        std::shared_ptr<std::string> language;
-        ClassMemberConstraints language_constraint;
-        std::shared_ptr<std::string> localized_data_semantic_version;
-        std::shared_ptr<std::vector<ArtifactLocation>> locations;
-        std::shared_ptr<std::string> minimum_required_localized_data_semantic_version;
-        std::string name;
-        std::shared_ptr<std::vector<ReportingDescriptor>> notifications;
-        std::shared_ptr<std::string> organization;
-        std::shared_ptr<std::string> product;
-        std::shared_ptr<std::string> product_suite;
-        std::shared_ptr<PropertyBag> properties;
-        std::shared_ptr<std::string> release_date_utc;
-        std::shared_ptr<std::vector<ReportingDescriptor>> rules;
-        std::shared_ptr<std::string> semantic_version;
-        std::shared_ptr<MultiformatMessageString> short_description;
-        std::shared_ptr<std::vector<ToolComponentReference>> supported_taxonomies;
-        std::shared_ptr<std::vector<ReportingDescriptor>> taxa;
-        std::shared_ptr<TranslationMetadata> translation_metadata;
-        std::shared_ptr<std::string> version;
-
-        public:
-        /**
-         * The component which is strongly associated with this component. For a translation, this
-         * refers to the component which has been translated. For an extension, this is the driver
-         * that provides the extension's plugin model.
-         */
-        std::shared_ptr<ToolComponentReference> get_associated_component() const { return associated_component; }
-        void set_associated_component(std::shared_ptr<ToolComponentReference> value) { this->associated_component = value; }
-
-        /**
-         * The kinds of data contained in this object.
-         */
-        std::shared_ptr<std::vector<Content>> get_contents() const { return contents; }
-        void set_contents(std::shared_ptr<std::vector<Content>> value) { this->contents = value; }
-
-        /**
-         * The binary version of the tool component's primary executable file expressed as four
-         * non-negative integers separated by a period (for operating systems that express file
-         * versions in this way).
-         */
-        std::shared_ptr<std::string> get_dotted_quad_file_version() const { return dotted_quad_file_version; }
-        void set_dotted_quad_file_version(std::shared_ptr<std::string> value) { if (value) CheckConstraint("dotted_quad_file_version", dotted_quad_file_version_constraint, *value); this->dotted_quad_file_version = value; }
-
-        /**
-         * The absolute URI from which the tool component can be downloaded.
-         */
-        std::shared_ptr<std::string> get_download_uri() const { return download_uri; }
-        void set_download_uri(std::shared_ptr<std::string> value) { this->download_uri = value; }
-
-        /**
-         * A comprehensive description of the tool component.
-         */
-        std::shared_ptr<MultiformatMessageString> get_full_description() const { return full_description; }
-        void set_full_description(std::shared_ptr<MultiformatMessageString> value) { this->full_description = value; }
-
-        /**
-         * The name of the tool component along with its version and any other useful identifying
-         * information, such as its locale.
-         */
-        std::shared_ptr<std::string> get_full_name() const { return full_name; }
-        void set_full_name(std::shared_ptr<std::string> value) { this->full_name = value; }
-
-        /**
-         * A dictionary, each of whose keys is a resource identifier and each of whose values is a
-         * multiformatMessageString object, which holds message strings in plain text and
-         * (optionally) Markdown format. The strings can include placeholders, which can be used to
-         * construct a message in combination with an arbitrary number of additional string
-         * arguments.
-         */
-        std::shared_ptr<std::map<std::string, MultiformatMessageString>> get_global_message_strings() const { return global_message_strings; }
-        void set_global_message_strings(std::shared_ptr<std::map<std::string, MultiformatMessageString>> value) { this->global_message_strings = value; }
-
-        /**
-         * A unique identifer for the tool component in the form of a GUID.
-         */
-        std::shared_ptr<std::string> get_guid() const { return guid; }
-        void set_guid(std::shared_ptr<std::string> value) { if (value) CheckConstraint("guid", guid_constraint, *value); this->guid = value; }
-
-        /**
-         * The absolute URI at which information about this version of the tool component can be
-         * found.
-         */
-        std::shared_ptr<std::string> get_information_uri() const { return information_uri; }
-        void set_information_uri(std::shared_ptr<std::string> value) { this->information_uri = value; }
-
-        /**
-         * Specifies whether this object contains a complete definition of the localizable and/or
-         * non-localizable data for this component, as opposed to including only data that is
-         * relevant to the results persisted to this log file.
-         */
-        std::shared_ptr<bool> get_is_comprehensive() const { return is_comprehensive; }
-        void set_is_comprehensive(std::shared_ptr<bool> value) { this->is_comprehensive = value; }
-
-        /**
-         * The language of the messages emitted into the log file during this run (expressed as an
-         * ISO 639-1 two-letter lowercase language code) and an optional region (expressed as an ISO
-         * 3166-1 two-letter uppercase subculture code associated with a country or region). The
-         * casing is recommended but not required (in order for this data to conform to RFC5646).
-         */
-        std::shared_ptr<std::string> get_language() const { return language; }
-        void set_language(std::shared_ptr<std::string> value) { if (value) CheckConstraint("language", language_constraint, *value); this->language = value; }
-
-        /**
-         * The semantic version of the localized strings defined in this component; maintained by
-         * components that provide translations.
-         */
-        std::shared_ptr<std::string> get_localized_data_semantic_version() const { return localized_data_semantic_version; }
-        void set_localized_data_semantic_version(std::shared_ptr<std::string> value) { this->localized_data_semantic_version = value; }
-
-        /**
-         * An array of the artifactLocation objects associated with the tool component.
-         */
-        std::shared_ptr<std::vector<ArtifactLocation>> get_locations() const { return locations; }
-        void set_locations(std::shared_ptr<std::vector<ArtifactLocation>> value) { this->locations = value; }
-
-        /**
-         * The minimum value of localizedDataSemanticVersion required in translations consumed by
-         * this component; used by components that consume translations.
-         */
-        std::shared_ptr<std::string> get_minimum_required_localized_data_semantic_version() const { return minimum_required_localized_data_semantic_version; }
-        void set_minimum_required_localized_data_semantic_version(std::shared_ptr<std::string> value) { this->minimum_required_localized_data_semantic_version = value; }
-
-        /**
-         * The name of the tool component.
-         */
-        const std::string & get_name() const { return name; }
-        std::string & get_mutable_name() { return name; }
-        void set_name(const std::string & value) { this->name = value; }
-
-        /**
-         * An array of reportingDescriptor objects relevant to the notifications related to the
-         * configuration and runtime execution of the tool component.
-         */
-        std::shared_ptr<std::vector<ReportingDescriptor>> get_notifications() const { return notifications; }
-        void set_notifications(std::shared_ptr<std::vector<ReportingDescriptor>> value) { this->notifications = value; }
-
-        /**
-         * The organization or company that produced the tool component.
-         */
-        std::shared_ptr<std::string> get_organization() const { return organization; }
-        void set_organization(std::shared_ptr<std::string> value) { this->organization = value; }
-
-        /**
-         * A product suite to which the tool component belongs.
-         */
-        std::shared_ptr<std::string> get_product() const { return product; }
-        void set_product(std::shared_ptr<std::string> value) { this->product = value; }
-
-        /**
-         * A localizable string containing the name of the suite of products to which the tool
-         * component belongs.
-         */
-        std::shared_ptr<std::string> get_product_suite() const { return product_suite; }
-        void set_product_suite(std::shared_ptr<std::string> value) { this->product_suite = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the tool component.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-
-        /**
-         * A string specifying the UTC date (and optionally, the time) of the component's release.
-         */
-        std::shared_ptr<std::string> get_release_date_utc() const { return release_date_utc; }
-        void set_release_date_utc(std::shared_ptr<std::string> value) { this->release_date_utc = value; }
-
-        /**
-         * An array of reportingDescriptor objects relevant to the analysis performed by the tool
-         * component.
-         */
-        std::shared_ptr<std::vector<ReportingDescriptor>> get_rules() const { return rules; }
-        void set_rules(std::shared_ptr<std::vector<ReportingDescriptor>> value) { this->rules = value; }
-
-        /**
-         * The tool component version in the format specified by Semantic Versioning 2.0.
-         */
-        std::shared_ptr<std::string> get_semantic_version() const { return semantic_version; }
-        void set_semantic_version(std::shared_ptr<std::string> value) { this->semantic_version = value; }
-
-        /**
-         * A brief description of the tool component.
-         */
-        std::shared_ptr<MultiformatMessageString> get_short_description() const { return short_description; }
-        void set_short_description(std::shared_ptr<MultiformatMessageString> value) { this->short_description = value; }
-
-        /**
-         * An array of toolComponentReference objects to declare the taxonomies supported by the
-         * tool component.
-         */
-        std::shared_ptr<std::vector<ToolComponentReference>> get_supported_taxonomies() const { return supported_taxonomies; }
-        void set_supported_taxonomies(std::shared_ptr<std::vector<ToolComponentReference>> value) { this->supported_taxonomies = value; }
-
-        /**
-         * An array of reportingDescriptor objects relevant to the definitions of both standalone
-         * and tool-defined taxonomies.
-         */
-        std::shared_ptr<std::vector<ReportingDescriptor>> get_taxa() const { return taxa; }
-        void set_taxa(std::shared_ptr<std::vector<ReportingDescriptor>> value) { this->taxa = value; }
-
-        /**
-         * Translation metadata, required for a translation, not populated by other component types.
-         */
-        std::shared_ptr<TranslationMetadata> get_translation_metadata() const { return translation_metadata; }
-        void set_translation_metadata(std::shared_ptr<TranslationMetadata> value) { this->translation_metadata = value; }
-
-        /**
-         * The tool component version, in whatever format the component natively provides.
-         */
-        std::shared_ptr<std::string> get_version() const { return version; }
-        void set_version(std::shared_ptr<std::string> value) { this->version = value; }
-    };
-
-    /**
-     * A tool object that describes the converter.
-     *
-     * The analysis tool that was run.
-     *
-     * Information about the tool or tool pipeline that generated the results in this run. A run
-     * can only contain results produced by a single tool or tool pipeline. A run can aggregate
-     * results from multiple log files, as long as context around the tool run (tool
-     * command-line arguments and the like) is identical for all aggregated files.
-     */
-    class Tool {
-        public:
-        Tool() = default;
-        virtual ~Tool() = default;
-
-        private:
-        ToolComponent driver;
-        std::shared_ptr<std::vector<ToolComponent>> extensions;
-        std::shared_ptr<PropertyBag> properties;
-
-        public:
-        /**
-         * The analysis tool that was run.
-         */
-        const ToolComponent & get_driver() const { return driver; }
-        ToolComponent & get_mutable_driver() { return driver; }
-        void set_driver(const ToolComponent & value) { this->driver = value; }
-
-        /**
-         * Tool extensions that contributed to or reconfigured the analysis tool that was run.
-         */
-        std::shared_ptr<std::vector<ToolComponent>> get_extensions() const { return extensions; }
-        void set_extensions(std::shared_ptr<std::vector<ToolComponent>> value) { this->extensions = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the tool.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-    };
-
-    /**
-     * A conversion object that will be merged with a separate run.
-     *
-     * Describes how a converter transformed the output of a static analysis tool from the
-     * analysis tool's native output format into the SARIF format.
-     *
-     * A conversion object that describes how a converter transformed an analysis tool's native
-     * reporting format into the SARIF format.
-     */
-    class Conversion {
-        public:
-        Conversion() = default;
-        virtual ~Conversion() = default;
-
-        private:
-        std::shared_ptr<std::vector<ArtifactLocation>> analysis_tool_log_files;
-        std::shared_ptr<Invocation> invocation;
-        std::shared_ptr<PropertyBag> properties;
-        Tool tool;
-
-        public:
-        /**
-         * The locations of the analysis tool's per-run log files.
-         */
-        std::shared_ptr<std::vector<ArtifactLocation>> get_analysis_tool_log_files() const { return analysis_tool_log_files; }
-        void set_analysis_tool_log_files(std::shared_ptr<std::vector<ArtifactLocation>> value) { this->analysis_tool_log_files = value; }
-
-        /**
-         * An invocation object that describes the invocation of the converter.
-         */
-        std::shared_ptr<Invocation> get_invocation() const { return invocation; }
-        void set_invocation(std::shared_ptr<Invocation> value) { this->invocation = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the conversion.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-
-        /**
-         * A tool object that describes the converter.
-         */
-        const Tool & get_tool() const { return tool; }
-        Tool & get_mutable_tool() { return tool; }
-        void set_tool(const Tool & value) { this->tool = value; }
-    };
-
-    /**
-     * Represents a directed edge in a graph.
-     */
-    class Edge {
-        public:
-        Edge() = default;
-        virtual ~Edge() = default;
-
-        private:
-        std::string id;
-        std::shared_ptr<Message> label;
-        std::shared_ptr<PropertyBag> properties;
-        std::string source_node_id;
-        std::string target_node_id;
-
-        public:
-        /**
-         * A string that uniquely identifies the edge within its graph.
-         */
-        const std::string & get_id() const { return id; }
-        std::string & get_mutable_id() { return id; }
-        void set_id(const std::string & value) { this->id = value; }
-
-        /**
-         * A short description of the edge.
-         */
-        std::shared_ptr<Message> get_label() const { return label; }
-        void set_label(std::shared_ptr<Message> value) { this->label = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the edge.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-
-        /**
-         * Identifies the source node (the node at which the edge starts).
-         */
-        const std::string & get_source_node_id() const { return source_node_id; }
-        std::string & get_mutable_source_node_id() { return source_node_id; }
-        void set_source_node_id(const std::string & value) { this->source_node_id = value; }
-
-        /**
-         * Identifies the target node (the node at which the edge ends).
-         */
-        const std::string & get_target_node_id() const { return target_node_id; }
-        std::string & get_mutable_target_node_id() { return target_node_id; }
-        void set_target_node_id(const std::string & value) { this->target_node_id = value; }
-    };
-
-    /**
-     * Represents a node in a graph.
-     */
-    class Node {
-        public:
-        Node() = default;
-        virtual ~Node() = default;
-
-        private:
-        std::shared_ptr<std::vector<Node>> children;
-        std::string id;
-        std::shared_ptr<Message> label;
-        std::shared_ptr<Location> location;
-        std::shared_ptr<PropertyBag> properties;
-
-        public:
-        /**
-         * Array of child nodes.
-         */
-        std::shared_ptr<std::vector<Node>> get_children() const { return children; }
-        void set_children(std::shared_ptr<std::vector<Node>> value) { this->children = value; }
-
-        /**
-         * A string that uniquely identifies the node within its graph.
-         */
-        const std::string & get_id() const { return id; }
-        std::string & get_mutable_id() { return id; }
-        void set_id(const std::string & value) { this->id = value; }
-
-        /**
-         * A short description of the node.
-         */
-        std::shared_ptr<Message> get_label() const { return label; }
-        void set_label(std::shared_ptr<Message> value) { this->label = value; }
-
-        /**
-         * A code location associated with the node.
-         */
-        std::shared_ptr<Location> get_location() const { return location; }
-        void set_location(std::shared_ptr<Location> value) { this->location = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the node.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-    };
-
-    /**
-     * A network of nodes and directed edges that describes some aspect of the structure of the
-     * code (for example, a call graph).
-     */
-    class Graph {
-        public:
-        Graph() = default;
-        virtual ~Graph() = default;
-
-        private:
-        std::shared_ptr<Message> description;
-        std::shared_ptr<std::vector<Edge>> edges;
-        std::shared_ptr<std::vector<Node>> nodes;
-        std::shared_ptr<PropertyBag> properties;
-
-        public:
-        /**
-         * A description of the graph.
-         */
-        std::shared_ptr<Message> get_description() const { return description; }
-        void set_description(std::shared_ptr<Message> value) { this->description = value; }
-
-        /**
-         * An array of edge objects representing the edges of the graph.
-         */
-        std::shared_ptr<std::vector<Edge>> get_edges() const { return edges; }
-        void set_edges(std::shared_ptr<std::vector<Edge>> value) { this->edges = value; }
-
-        /**
-         * An array of node objects representing the nodes of the graph.
-         */
-        std::shared_ptr<std::vector<Node>> get_nodes() const { return nodes; }
-        void set_nodes(std::shared_ptr<std::vector<Node>> value) { this->nodes = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the graph.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-    };
-
-    /**
-     * An area within an image.
-     */
-    class Rectangle {
-        public:
-        Rectangle() = default;
-        virtual ~Rectangle() = default;
-
-        private:
-        std::shared_ptr<double> bottom;
-        std::shared_ptr<double> left;
-        std::shared_ptr<Message> message;
-        std::shared_ptr<PropertyBag> properties;
-        std::shared_ptr<double> right;
-        std::shared_ptr<double> top;
-
-        public:
-        /**
-         * The Y coordinate of the bottom edge of the rectangle, measured in the image's natural
-         * units.
-         */
-        std::shared_ptr<double> get_bottom() const { return bottom; }
-        void set_bottom(std::shared_ptr<double> value) { this->bottom = value; }
-
-        /**
-         * The X coordinate of the left edge of the rectangle, measured in the image's natural units.
-         */
-        std::shared_ptr<double> get_left() const { return left; }
-        void set_left(std::shared_ptr<double> value) { this->left = value; }
-
-        /**
-         * A message relevant to the rectangle.
-         */
-        std::shared_ptr<Message> get_message() const { return message; }
-        void set_message(std::shared_ptr<Message> value) { this->message = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the rectangle.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-
-        /**
-         * The X coordinate of the right edge of the rectangle, measured in the image's natural
-         * units.
-         */
-        std::shared_ptr<double> get_right() const { return right; }
-        void set_right(std::shared_ptr<double> value) { this->right = value; }
-
-        /**
-         * The Y coordinate of the top edge of the rectangle, measured in the image's natural units.
-         */
-        std::shared_ptr<double> get_top() const { return top; }
-        void set_top(std::shared_ptr<double> value) { this->top = value; }
-    };
-
-    /**
-     * An artifact relevant to a result.
-     */
-    class Attachment {
-        public:
-        Attachment() = default;
-        virtual ~Attachment() = default;
-
-        private:
-        ArtifactLocation artifact_location;
-        std::shared_ptr<Message> description;
-        std::shared_ptr<PropertyBag> properties;
-        std::shared_ptr<std::vector<Rectangle>> rectangles;
-        std::shared_ptr<std::vector<Region>> regions;
-
-        public:
-        /**
-         * The location of the attachment.
-         */
-        const ArtifactLocation & get_artifact_location() const { return artifact_location; }
-        ArtifactLocation & get_mutable_artifact_location() { return artifact_location; }
-        void set_artifact_location(const ArtifactLocation & value) { this->artifact_location = value; }
-
-        /**
-         * A message describing the role played by the attachment.
-         */
-        std::shared_ptr<Message> get_description() const { return description; }
-        void set_description(std::shared_ptr<Message> value) { this->description = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the attachment.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-
-        /**
-         * An array of rectangles specifying areas of interest within the image.
-         */
-        std::shared_ptr<std::vector<Rectangle>> get_rectangles() const { return rectangles; }
-        void set_rectangles(std::shared_ptr<std::vector<Rectangle>> value) { this->rectangles = value; }
-
-        /**
-         * An array of regions of interest within the attachment.
-         */
-        std::shared_ptr<std::vector<Region>> get_regions() const { return regions; }
-        void set_regions(std::shared_ptr<std::vector<Region>> value) { this->regions = value; }
-    };
-
-    /**
-     * The state of a result relative to a baseline of a previous run.
-     */
-    enum class BaselineState : int { ABSENT, NEW, UNCHANGED, UPDATED };
-
-    /**
-     * Specifies the importance of this location in understanding the code flow in which it
-     * occurs. The order from most to least important is "essential", "important",
-     * "unimportant". Default: "important".
-     */
-    enum class Importance : int { ESSENTIAL, IMPORTANT, UNIMPORTANT };
-
-    /**
-     * A web request associated with this thread flow location.
-     *
-     * Describes an HTTP request.
-     *
-     * A web request associated with this result.
-     */
-    class WebRequest {
-        public:
-        WebRequest() :
-            index_constraint(-1, boost::none, boost::none, boost::none, boost::none)
-        {}
-        virtual ~WebRequest() = default;
-
-        private:
-        std::shared_ptr<ArtifactContent> body;
-        std::shared_ptr<std::map<std::string, std::string>> headers;
-        std::shared_ptr<int64_t> index;
-        ClassMemberConstraints index_constraint;
-        std::shared_ptr<std::string> method;
-        std::shared_ptr<std::map<std::string, std::string>> parameters;
-        std::shared_ptr<PropertyBag> properties;
-        std::shared_ptr<std::string> protocol;
-        std::shared_ptr<std::string> target;
-        std::shared_ptr<std::string> version;
-
-        public:
-        /**
-         * The body of the request.
-         */
-        std::shared_ptr<ArtifactContent> get_body() const { return body; }
-        void set_body(std::shared_ptr<ArtifactContent> value) { this->body = value; }
-
-        /**
-         * The request headers.
-         */
-        std::shared_ptr<std::map<std::string, std::string>> get_headers() const { return headers; }
-        void set_headers(std::shared_ptr<std::map<std::string, std::string>> value) { this->headers = value; }
-
-        /**
-         * The index within the run.webRequests array of the request object associated with this
-         * result.
-         */
-        std::shared_ptr<int64_t> get_index() const { return index; }
-        void set_index(std::shared_ptr<int64_t> value) { if (value) CheckConstraint("index", index_constraint, *value); this->index = value; }
-
-        /**
-         * The HTTP method. Well-known values are 'GET', 'PUT', 'POST', 'DELETE', 'PATCH', 'HEAD',
-         * 'OPTIONS', 'TRACE', 'CONNECT'.
-         */
-        std::shared_ptr<std::string> get_method() const { return method; }
-        void set_method(std::shared_ptr<std::string> value) { this->method = value; }
-
-        /**
-         * The request parameters.
-         */
-        std::shared_ptr<std::map<std::string, std::string>> get_parameters() const { return parameters; }
-        void set_parameters(std::shared_ptr<std::map<std::string, std::string>> value) { this->parameters = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the request.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-
-        /**
-         * The request protocol. Example: 'http'.
-         */
-        std::shared_ptr<std::string> get_protocol() const { return protocol; }
-        void set_protocol(std::shared_ptr<std::string> value) { this->protocol = value; }
-
-        /**
-         * The target of the request.
-         */
-        std::shared_ptr<std::string> get_target() const { return target; }
-        void set_target(std::shared_ptr<std::string> value) { this->target = value; }
-
-        /**
-         * The request version. Example: '1.1'.
-         */
-        std::shared_ptr<std::string> get_version() const { return version; }
-        void set_version(std::shared_ptr<std::string> value) { this->version = value; }
-    };
-
-    /**
-     * A web response associated with this thread flow location.
-     *
-     * Describes the response to an HTTP request.
-     *
-     * A web response associated with this result.
-     */
-    class WebResponse {
-        public:
-        WebResponse() :
-            index_constraint(-1, boost::none, boost::none, boost::none, boost::none)
-        {}
-        virtual ~WebResponse() = default;
-
-        private:
-        std::shared_ptr<ArtifactContent> body;
-        std::shared_ptr<std::map<std::string, std::string>> headers;
-        std::shared_ptr<int64_t> index;
-        ClassMemberConstraints index_constraint;
-        std::shared_ptr<bool> no_response_received;
-        std::shared_ptr<PropertyBag> properties;
-        std::shared_ptr<std::string> protocol;
-        std::shared_ptr<std::string> reason_phrase;
-        std::shared_ptr<int64_t> status_code;
-        std::shared_ptr<std::string> version;
-
-        public:
-        /**
-         * The body of the response.
-         */
-        std::shared_ptr<ArtifactContent> get_body() const { return body; }
-        void set_body(std::shared_ptr<ArtifactContent> value) { this->body = value; }
-
-        /**
-         * The response headers.
-         */
-        std::shared_ptr<std::map<std::string, std::string>> get_headers() const { return headers; }
-        void set_headers(std::shared_ptr<std::map<std::string, std::string>> value) { this->headers = value; }
-
-        /**
-         * The index within the run.webResponses array of the response object associated with this
-         * result.
-         */
-        std::shared_ptr<int64_t> get_index() const { return index; }
-        void set_index(std::shared_ptr<int64_t> value) { if (value) CheckConstraint("index", index_constraint, *value); this->index = value; }
-
-        /**
-         * Specifies whether a response was received from the server.
-         */
-        std::shared_ptr<bool> get_no_response_received() const { return no_response_received; }
-        void set_no_response_received(std::shared_ptr<bool> value) { this->no_response_received = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the response.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-
-        /**
-         * The response protocol. Example: 'http'.
-         */
-        std::shared_ptr<std::string> get_protocol() const { return protocol; }
-        void set_protocol(std::shared_ptr<std::string> value) { this->protocol = value; }
-
-        /**
-         * The response reason. Example: 'Not found'.
-         */
-        std::shared_ptr<std::string> get_reason_phrase() const { return reason_phrase; }
-        void set_reason_phrase(std::shared_ptr<std::string> value) { this->reason_phrase = value; }
-
-        /**
-         * The response status code. Example: 451.
-         */
-        std::shared_ptr<int64_t> get_status_code() const { return status_code; }
-        void set_status_code(std::shared_ptr<int64_t> value) { this->status_code = value; }
-
-        /**
-         * The response version. Example: '1.1'.
-         */
-        std::shared_ptr<std::string> get_version() const { return version; }
-        void set_version(std::shared_ptr<std::string> value) { this->version = value; }
-    };
-
-    /**
-     * A location visited by an analysis tool while simulating or monitoring the execution of a
-     * program.
-     */
-    class ThreadFlowLocation {
-        public:
-        ThreadFlowLocation() :
-            execution_order_constraint(-1, boost::none, boost::none, boost::none, boost::none),
-            index_constraint(-1, boost::none, boost::none, boost::none, boost::none),
-            nesting_level_constraint(0, boost::none, boost::none, boost::none, boost::none)
-        {}
-        virtual ~ThreadFlowLocation() = default;
-
-        private:
-        std::shared_ptr<int64_t> execution_order;
-        ClassMemberConstraints execution_order_constraint;
-        std::shared_ptr<std::string> execution_time_utc;
-        std::shared_ptr<Importance> importance;
-        std::shared_ptr<int64_t> index;
-        ClassMemberConstraints index_constraint;
-        std::shared_ptr<std::vector<std::string>> kinds;
-        std::shared_ptr<Location> location;
-        std::shared_ptr<std::string> thread_flow_location_module;
-        std::shared_ptr<int64_t> nesting_level;
-        ClassMemberConstraints nesting_level_constraint;
-        std::shared_ptr<PropertyBag> properties;
-        std::shared_ptr<Stack> stack;
-        std::shared_ptr<std::map<std::string, MultiformatMessageString>> state;
-        std::shared_ptr<std::vector<ReportingDescriptorReference>> taxa;
-        std::shared_ptr<WebRequest> web_request;
-        std::shared_ptr<WebResponse> web_response;
-
-        public:
-        /**
-         * An integer representing the temporal order in which execution reached this location.
-         */
-        std::shared_ptr<int64_t> get_execution_order() const { return execution_order; }
-        void set_execution_order(std::shared_ptr<int64_t> value) { if (value) CheckConstraint("execution_order", execution_order_constraint, *value); this->execution_order = value; }
-
-        /**
-         * The Coordinated Universal Time (UTC) date and time at which this location was executed.
-         */
-        std::shared_ptr<std::string> get_execution_time_utc() const { return execution_time_utc; }
-        void set_execution_time_utc(std::shared_ptr<std::string> value) { this->execution_time_utc = value; }
-
-        /**
-         * Specifies the importance of this location in understanding the code flow in which it
-         * occurs. The order from most to least important is "essential", "important",
-         * "unimportant". Default: "important".
-         */
-        std::shared_ptr<Importance> get_importance() const { return importance; }
-        void set_importance(std::shared_ptr<Importance> value) { this->importance = value; }
-
-        /**
-         * The index within the run threadFlowLocations array.
-         */
-        std::shared_ptr<int64_t> get_index() const { return index; }
-        void set_index(std::shared_ptr<int64_t> value) { if (value) CheckConstraint("index", index_constraint, *value); this->index = value; }
-
-        /**
-         * A set of distinct strings that categorize the thread flow location. Well-known kinds
-         * include 'acquire', 'release', 'enter', 'exit', 'call', 'return', 'branch', 'implicit',
-         * 'false', 'true', 'caution', 'danger', 'unknown', 'unreachable', 'taint', 'function',
-         * 'handler', 'lock', 'memory', 'resource', 'scope' and 'value'.
-         */
-        std::shared_ptr<std::vector<std::string>> get_kinds() const { return kinds; }
-        void set_kinds(std::shared_ptr<std::vector<std::string>> value) { this->kinds = value; }
-
-        /**
-         * The code location.
-         */
-        std::shared_ptr<Location> get_location() const { return location; }
-        void set_location(std::shared_ptr<Location> value) { this->location = value; }
-
-        /**
-         * The name of the module that contains the code that is executing.
-         */
-        std::shared_ptr<std::string> get_thread_flow_location_module() const { return thread_flow_location_module; }
-        void set_thread_flow_location_module(std::shared_ptr<std::string> value) { this->thread_flow_location_module = value; }
-
-        /**
-         * An integer representing a containment hierarchy within the thread flow.
-         */
-        std::shared_ptr<int64_t> get_nesting_level() const { return nesting_level; }
-        void set_nesting_level(std::shared_ptr<int64_t> value) { if (value) CheckConstraint("nesting_level", nesting_level_constraint, *value); this->nesting_level = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the threadflow location.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-
-        /**
-         * The call stack leading to this location.
-         */
-        std::shared_ptr<Stack> get_stack() const { return stack; }
-        void set_stack(std::shared_ptr<Stack> value) { this->stack = value; }
-
-        /**
-         * A dictionary, each of whose keys specifies a variable or expression, the associated value
-         * of which represents the variable or expression value. For an annotation of kind
-         * 'continuation', for example, this dictionary might hold the current assumed values of a
-         * set of global variables.
-         */
-        std::shared_ptr<std::map<std::string, MultiformatMessageString>> get_state() const { return state; }
-        void set_state(std::shared_ptr<std::map<std::string, MultiformatMessageString>> value) { this->state = value; }
-
-        /**
-         * An array of references to rule or taxonomy reporting descriptors that are applicable to
-         * the thread flow location.
-         */
-        std::shared_ptr<std::vector<ReportingDescriptorReference>> get_taxa() const { return taxa; }
-        void set_taxa(std::shared_ptr<std::vector<ReportingDescriptorReference>> value) { this->taxa = value; }
-
-        /**
-         * A web request associated with this thread flow location.
-         */
-        std::shared_ptr<WebRequest> get_web_request() const { return web_request; }
-        void set_web_request(std::shared_ptr<WebRequest> value) { this->web_request = value; }
-
-        /**
-         * A web response associated with this thread flow location.
-         */
-        std::shared_ptr<WebResponse> get_web_response() const { return web_response; }
-        void set_web_response(std::shared_ptr<WebResponse> value) { this->web_response = value; }
-    };
-
-    /**
-     * Describes a sequence of code locations that specify a path through a single thread of
-     * execution such as an operating system or fiber.
-     */
-    class ThreadFlow {
-        public:
-        ThreadFlow() = default;
-        virtual ~ThreadFlow() = default;
-
-        private:
-        std::shared_ptr<std::string> id;
-        std::shared_ptr<std::map<std::string, MultiformatMessageString>> immutable_state;
-        std::shared_ptr<std::map<std::string, MultiformatMessageString>> initial_state;
-        std::vector<ThreadFlowLocation> locations;
-        std::shared_ptr<Message> message;
-        std::shared_ptr<PropertyBag> properties;
-
-        public:
-        /**
-         * An string that uniquely identifies the threadFlow within the codeFlow in which it occurs.
-         */
-        std::shared_ptr<std::string> get_id() const { return id; }
-        void set_id(std::shared_ptr<std::string> value) { this->id = value; }
-
-        /**
-         * Values of relevant expressions at the start of the thread flow that remain constant.
-         */
-        std::shared_ptr<std::map<std::string, MultiformatMessageString>> get_immutable_state() const { return immutable_state; }
-        void set_immutable_state(std::shared_ptr<std::map<std::string, MultiformatMessageString>> value) { this->immutable_state = value; }
-
-        /**
-         * Values of relevant expressions at the start of the thread flow that may change during
-         * thread flow execution.
-         */
-        std::shared_ptr<std::map<std::string, MultiformatMessageString>> get_initial_state() const { return initial_state; }
-        void set_initial_state(std::shared_ptr<std::map<std::string, MultiformatMessageString>> value) { this->initial_state = value; }
-
-        /**
-         * A temporally ordered array of 'threadFlowLocation' objects, each of which describes a
-         * location visited by the tool while producing the result.
-         */
-        const std::vector<ThreadFlowLocation> & get_locations() const { return locations; }
-        std::vector<ThreadFlowLocation> & get_mutable_locations() { return locations; }
-        void set_locations(const std::vector<ThreadFlowLocation> & value) { this->locations = value; }
-
-        /**
-         * A message relevant to the thread flow.
-         */
-        std::shared_ptr<Message> get_message() const { return message; }
-        void set_message(std::shared_ptr<Message> value) { this->message = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the thread flow.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-    };
-
-    /**
-     * A set of threadFlows which together describe a pattern of code execution relevant to
-     * detecting a result.
-     */
-    class CodeFlow {
-        public:
-        CodeFlow() = default;
-        virtual ~CodeFlow() = default;
-
-        private:
-        std::shared_ptr<Message> message;
-        std::shared_ptr<PropertyBag> properties;
-        std::vector<ThreadFlow> thread_flows;
-
-        public:
-        /**
-         * A message relevant to the code flow.
-         */
-        std::shared_ptr<Message> get_message() const { return message; }
-        void set_message(std::shared_ptr<Message> value) { this->message = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the code flow.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-
-        /**
-         * An array of one or more unique threadFlow objects, each of which describes the progress
-         * of a program through a thread of execution.
-         */
-        const std::vector<ThreadFlow> & get_thread_flows() const { return thread_flows; }
-        std::vector<ThreadFlow> & get_mutable_thread_flows() { return thread_flows; }
-        void set_thread_flows(const std::vector<ThreadFlow> & value) { this->thread_flows = value; }
-    };
-
-    /**
-     * The replacement of a single region of an artifact.
-     */
-    class Replacement {
-        public:
-        Replacement() = default;
-        virtual ~Replacement() = default;
-
-        private:
-        Region deleted_region;
-        std::shared_ptr<ArtifactContent> inserted_content;
-        std::shared_ptr<PropertyBag> properties;
-
-        public:
-        /**
-         * The region of the artifact to delete.
-         */
-        const Region & get_deleted_region() const { return deleted_region; }
-        Region & get_mutable_deleted_region() { return deleted_region; }
-        void set_deleted_region(const Region & value) { this->deleted_region = value; }
-
-        /**
-         * The content to insert at the location specified by the 'deletedRegion' property.
-         */
-        std::shared_ptr<ArtifactContent> get_inserted_content() const { return inserted_content; }
-        void set_inserted_content(std::shared_ptr<ArtifactContent> value) { this->inserted_content = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the replacement.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-    };
-
-    /**
-     * A change to a single artifact.
-     */
-    class ArtifactChange {
-        public:
-        ArtifactChange() = default;
-        virtual ~ArtifactChange() = default;
-
-        private:
-        ArtifactLocation artifact_location;
-        std::shared_ptr<PropertyBag> properties;
-        std::vector<Replacement> replacements;
-
-        public:
-        /**
-         * The location of the artifact to change.
-         */
-        const ArtifactLocation & get_artifact_location() const { return artifact_location; }
-        ArtifactLocation & get_mutable_artifact_location() { return artifact_location; }
-        void set_artifact_location(const ArtifactLocation & value) { this->artifact_location = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the change.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-
-        /**
-         * An array of replacement objects, each of which represents the replacement of a single
-         * region in a single artifact specified by 'artifactLocation'.
-         */
-        const std::vector<Replacement> & get_replacements() const { return replacements; }
-        std::vector<Replacement> & get_mutable_replacements() { return replacements; }
-        void set_replacements(const std::vector<Replacement> & value) { this->replacements = value; }
-    };
-
-    /**
-     * A proposed fix for the problem represented by a result object. A fix specifies a set of
-     * artifacts to modify. For each artifact, it specifies a set of bytes to remove, and
-     * provides a set of new bytes to replace them.
-     */
-    class Fix {
-        public:
-        Fix() = default;
-        virtual ~Fix() = default;
-
-        private:
-        std::vector<ArtifactChange> artifact_changes;
-        std::shared_ptr<Message> description;
-        std::shared_ptr<PropertyBag> properties;
-
-        public:
-        /**
-         * One or more artifact changes that comprise a fix for a result.
-         */
-        const std::vector<ArtifactChange> & get_artifact_changes() const { return artifact_changes; }
-        std::vector<ArtifactChange> & get_mutable_artifact_changes() { return artifact_changes; }
-        void set_artifact_changes(const std::vector<ArtifactChange> & value) { this->artifact_changes = value; }
-
-        /**
-         * A message that describes the proposed fix, enabling viewers to present the proposed
-         * change to an end user.
-         */
-        std::shared_ptr<Message> get_description() const { return description; }
-        void set_description(std::shared_ptr<Message> value) { this->description = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the fix.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-    };
-
-    /**
-     * Represents the traversal of a single edge during a graph traversal.
-     */
-    class EdgeTraversal {
-        public:
-        EdgeTraversal() :
-            step_over_edge_count_constraint(0, boost::none, boost::none, boost::none, boost::none)
-        {}
-        virtual ~EdgeTraversal() = default;
-
-        private:
-        std::string edge_id;
-        std::shared_ptr<std::map<std::string, MultiformatMessageString>> final_state;
-        std::shared_ptr<Message> message;
-        std::shared_ptr<PropertyBag> properties;
-        std::shared_ptr<int64_t> step_over_edge_count;
-        ClassMemberConstraints step_over_edge_count_constraint;
-
-        public:
-        /**
-         * Identifies the edge being traversed.
-         */
-        const std::string & get_edge_id() const { return edge_id; }
-        std::string & get_mutable_edge_id() { return edge_id; }
-        void set_edge_id(const std::string & value) { this->edge_id = value; }
-
-        /**
-         * The values of relevant expressions after the edge has been traversed.
-         */
-        std::shared_ptr<std::map<std::string, MultiformatMessageString>> get_final_state() const { return final_state; }
-        void set_final_state(std::shared_ptr<std::map<std::string, MultiformatMessageString>> value) { this->final_state = value; }
-
-        /**
-         * A message to display to the user as the edge is traversed.
-         */
-        std::shared_ptr<Message> get_message() const { return message; }
-        void set_message(std::shared_ptr<Message> value) { this->message = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the edge traversal.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-
-        /**
-         * The number of edge traversals necessary to return from a nested graph.
-         */
-        std::shared_ptr<int64_t> get_step_over_edge_count() const { return step_over_edge_count; }
-        void set_step_over_edge_count(std::shared_ptr<int64_t> value) { if (value) CheckConstraint("step_over_edge_count", step_over_edge_count_constraint, *value); this->step_over_edge_count = value; }
-    };
-
-    /**
-     * Represents a path through a graph.
-     */
-    class GraphTraversal {
-        public:
-        GraphTraversal() :
-            result_graph_index_constraint(-1, boost::none, boost::none, boost::none, boost::none),
-            run_graph_index_constraint(-1, boost::none, boost::none, boost::none, boost::none)
-        {}
-        virtual ~GraphTraversal() = default;
-
-        private:
-        std::shared_ptr<Message> description;
-        std::shared_ptr<std::vector<EdgeTraversal>> edge_traversals;
-        std::shared_ptr<std::map<std::string, MultiformatMessageString>> immutable_state;
-        std::shared_ptr<std::map<std::string, MultiformatMessageString>> initial_state;
-        std::shared_ptr<PropertyBag> properties;
-        std::shared_ptr<int64_t> result_graph_index;
-        ClassMemberConstraints result_graph_index_constraint;
-        std::shared_ptr<int64_t> run_graph_index;
-        ClassMemberConstraints run_graph_index_constraint;
-
-        public:
-        /**
-         * A description of this graph traversal.
-         */
-        std::shared_ptr<Message> get_description() const { return description; }
-        void set_description(std::shared_ptr<Message> value) { this->description = value; }
-
-        /**
-         * The sequences of edges traversed by this graph traversal.
-         */
-        std::shared_ptr<std::vector<EdgeTraversal>> get_edge_traversals() const { return edge_traversals; }
-        void set_edge_traversals(std::shared_ptr<std::vector<EdgeTraversal>> value) { this->edge_traversals = value; }
-
-        /**
-         * Values of relevant expressions at the start of the graph traversal that remain constant
-         * for the graph traversal.
-         */
-        std::shared_ptr<std::map<std::string, MultiformatMessageString>> get_immutable_state() const { return immutable_state; }
-        void set_immutable_state(std::shared_ptr<std::map<std::string, MultiformatMessageString>> value) { this->immutable_state = value; }
-
-        /**
-         * Values of relevant expressions at the start of the graph traversal that may change during
-         * graph traversal.
-         */
-        std::shared_ptr<std::map<std::string, MultiformatMessageString>> get_initial_state() const { return initial_state; }
-        void set_initial_state(std::shared_ptr<std::map<std::string, MultiformatMessageString>> value) { this->initial_state = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the graph traversal.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-
-        /**
-         * The index within the result.graphs to be associated with the result.
-         */
-        std::shared_ptr<int64_t> get_result_graph_index() const { return result_graph_index; }
-        void set_result_graph_index(std::shared_ptr<int64_t> value) { if (value) CheckConstraint("result_graph_index", result_graph_index_constraint, *value); this->result_graph_index = value; }
-
-        /**
-         * The index within the run.graphs to be associated with the result.
-         */
-        std::shared_ptr<int64_t> get_run_graph_index() const { return run_graph_index; }
-        void set_run_graph_index(std::shared_ptr<int64_t> value) { if (value) CheckConstraint("run_graph_index", run_graph_index_constraint, *value); this->run_graph_index = value; }
-    };
-
-    /**
-     * A value that categorizes results by evaluation state.
-     */
-    enum class ResultKind : int { FAIL, INFORMATIONAL, NOT_APPLICABLE, OPEN, PASS, REVIEW };
-
-    /**
-     * Information about how and when the result was detected.
-     *
-     * Contains information about how and when a result was detected.
-     */
-    class ResultProvenance {
-        public:
-        ResultProvenance() :
-            first_detection_run_guid_constraint(boost::none, boost::none, boost::none, boost::none, std::string("^[0-9a-fA-F]{8}-[0-9a-fA-F]{4}-[1-5][0-9a-fA-F]{3}-[89abAB][0-9a-fA-F]{3}-[0-9a-fA-F]{12}$")),
-            invocation_index_constraint(-1, boost::none, boost::none, boost::none, boost::none),
-            last_detection_run_guid_constraint(boost::none, boost::none, boost::none, boost::none, std::string("^[0-9a-fA-F]{8}-[0-9a-fA-F]{4}-[1-5][0-9a-fA-F]{3}-[89abAB][0-9a-fA-F]{3}-[0-9a-fA-F]{12}$"))
-        {}
-        virtual ~ResultProvenance() = default;
-
-        private:
-        std::shared_ptr<std::vector<PhysicalLocation>> conversion_sources;
-        std::shared_ptr<std::string> first_detection_run_guid;
-        ClassMemberConstraints first_detection_run_guid_constraint;
-        std::shared_ptr<std::string> first_detection_time_utc;
-        std::shared_ptr<int64_t> invocation_index;
-        ClassMemberConstraints invocation_index_constraint;
-        std::shared_ptr<std::string> last_detection_run_guid;
-        ClassMemberConstraints last_detection_run_guid_constraint;
-        std::shared_ptr<std::string> last_detection_time_utc;
-        std::shared_ptr<PropertyBag> properties;
-
-        public:
-        /**
-         * An array of physicalLocation objects which specify the portions of an analysis tool's
-         * output that a converter transformed into the result.
-         */
-        std::shared_ptr<std::vector<PhysicalLocation>> get_conversion_sources() const { return conversion_sources; }
-        void set_conversion_sources(std::shared_ptr<std::vector<PhysicalLocation>> value) { this->conversion_sources = value; }
-
-        /**
-         * A GUID-valued string equal to the automationDetails.guid property of the run in which the
-         * result was first detected.
-         */
-        std::shared_ptr<std::string> get_first_detection_run_guid() const { return first_detection_run_guid; }
-        void set_first_detection_run_guid(std::shared_ptr<std::string> value) { if (value) CheckConstraint("first_detection_run_guid", first_detection_run_guid_constraint, *value); this->first_detection_run_guid = value; }
-
-        /**
-         * The Coordinated Universal Time (UTC) date and time at which the result was first
-         * detected. See "Date/time properties" in the SARIF spec for the required format.
-         */
-        std::shared_ptr<std::string> get_first_detection_time_utc() const { return first_detection_time_utc; }
-        void set_first_detection_time_utc(std::shared_ptr<std::string> value) { this->first_detection_time_utc = value; }
-
-        /**
-         * The index within the run.invocations array of the invocation object which describes the
-         * tool invocation that detected the result.
-         */
-        std::shared_ptr<int64_t> get_invocation_index() const { return invocation_index; }
-        void set_invocation_index(std::shared_ptr<int64_t> value) { if (value) CheckConstraint("invocation_index", invocation_index_constraint, *value); this->invocation_index = value; }
-
-        /**
-         * A GUID-valued string equal to the automationDetails.guid property of the run in which the
-         * result was most recently detected.
-         */
-        std::shared_ptr<std::string> get_last_detection_run_guid() const { return last_detection_run_guid; }
-        void set_last_detection_run_guid(std::shared_ptr<std::string> value) { if (value) CheckConstraint("last_detection_run_guid", last_detection_run_guid_constraint, *value); this->last_detection_run_guid = value; }
-
-        /**
-         * The Coordinated Universal Time (UTC) date and time at which the result was most recently
-         * detected. See "Date/time properties" in the SARIF spec for the required format.
-         */
-        std::shared_ptr<std::string> get_last_detection_time_utc() const { return last_detection_time_utc; }
-        void set_last_detection_time_utc(std::shared_ptr<std::string> value) { this->last_detection_time_utc = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the result.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-    };
-
-    /**
-     * A string that indicates where the suppression is persisted.
-     */
-    enum class SuppressionKind : int { EXTERNAL, IN_SOURCE };
-
-    /**
-     * A string that indicates the review status of the suppression.
-     */
-    enum class Status : int { ACCEPTED, REJECTED, UNDER_REVIEW };
-
-    /**
-     * A suppression that is relevant to a result.
-     */
-    class Suppression {
-        public:
-        Suppression() :
-            guid_constraint(boost::none, boost::none, boost::none, boost::none, std::string("^[0-9a-fA-F]{8}-[0-9a-fA-F]{4}-[1-5][0-9a-fA-F]{3}-[89abAB][0-9a-fA-F]{3}-[0-9a-fA-F]{12}$"))
-        {}
-        virtual ~Suppression() = default;
-
-        private:
-        std::shared_ptr<std::string> guid;
-        ClassMemberConstraints guid_constraint;
-        std::shared_ptr<std::string> justification;
-        SuppressionKind kind;
-        std::shared_ptr<Location> location;
-        std::shared_ptr<PropertyBag> properties;
-        std::shared_ptr<Status> status;
-
-        public:
-        /**
-         * A stable, unique identifer for the suprression in the form of a GUID.
-         */
-        std::shared_ptr<std::string> get_guid() const { return guid; }
-        void set_guid(std::shared_ptr<std::string> value) { if (value) CheckConstraint("guid", guid_constraint, *value); this->guid = value; }
-
-        /**
-         * A string representing the justification for the suppression.
-         */
-        std::shared_ptr<std::string> get_justification() const { return justification; }
-        void set_justification(std::shared_ptr<std::string> value) { this->justification = value; }
-
-        /**
-         * A string that indicates where the suppression is persisted.
-         */
-        const SuppressionKind & get_kind() const { return kind; }
-        SuppressionKind & get_mutable_kind() { return kind; }
-        void set_kind(const SuppressionKind & value) { this->kind = value; }
-
-        /**
-         * Identifies the location associated with the suppression.
-         */
-        std::shared_ptr<Location> get_location() const { return location; }
-        void set_location(std::shared_ptr<Location> value) { this->location = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the suppression.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-
-        /**
-         * A string that indicates the review status of the suppression.
-         */
-        std::shared_ptr<Status> get_status() const { return status; }
-        void set_status(std::shared_ptr<Status> value) { this->status = value; }
-    };
-
-    /**
-     * A result produced by an analysis tool.
-     */
-    class Result {
-        public:
-        Result() :
-            correlation_guid_constraint(boost::none, boost::none, boost::none, boost::none, std::string("^[0-9a-fA-F]{8}-[0-9a-fA-F]{4}-[1-5][0-9a-fA-F]{3}-[89abAB][0-9a-fA-F]{3}-[0-9a-fA-F]{12}$")),
-            guid_constraint(boost::none, boost::none, boost::none, boost::none, std::string("^[0-9a-fA-F]{8}-[0-9a-fA-F]{4}-[1-5][0-9a-fA-F]{3}-[89abAB][0-9a-fA-F]{3}-[0-9a-fA-F]{12}$")),
-            occurrence_count_constraint(1, boost::none, boost::none, boost::none, boost::none),
-            rank_constraint(-1, 100, boost::none, boost::none, boost::none),
-            rule_index_constraint(-1, boost::none, boost::none, boost::none, boost::none)
-        {}
-        virtual ~Result() = default;
-
-        private:
-        std::shared_ptr<ArtifactLocation> analysis_target;
-        std::shared_ptr<std::vector<Attachment>> attachments;
-        std::shared_ptr<BaselineState> baseline_state;
-        std::shared_ptr<std::vector<CodeFlow>> code_flows;
-        std::shared_ptr<std::string> correlation_guid;
-        ClassMemberConstraints correlation_guid_constraint;
-        std::shared_ptr<std::map<std::string, std::string>> fingerprints;
-        std::shared_ptr<std::vector<Fix>> fixes;
-        std::shared_ptr<std::vector<Graph>> graphs;
-        std::shared_ptr<std::vector<GraphTraversal>> graph_traversals;
-        std::shared_ptr<std::string> guid;
-        ClassMemberConstraints guid_constraint;
-        std::shared_ptr<std::string> hosted_viewer_uri;
-        std::shared_ptr<ResultKind> kind;
-        std::shared_ptr<Level> level;
-        std::shared_ptr<std::vector<Location>> locations;
-        Message message;
-        std::shared_ptr<int64_t> occurrence_count;
-        ClassMemberConstraints occurrence_count_constraint;
-        std::shared_ptr<std::map<std::string, std::string>> partial_fingerprints;
-        std::shared_ptr<PropertyBag> properties;
-        std::shared_ptr<ResultProvenance> provenance;
-        std::shared_ptr<double> rank;
-        ClassMemberConstraints rank_constraint;
-        std::shared_ptr<std::vector<Location>> related_locations;
-        std::shared_ptr<ReportingDescriptorReference> rule;
-        std::shared_ptr<std::string> rule_id;
-        std::shared_ptr<int64_t> rule_index;
-        ClassMemberConstraints rule_index_constraint;
-        std::shared_ptr<std::vector<Stack>> stacks;
-        std::shared_ptr<std::vector<Suppression>> suppressions;
-        std::shared_ptr<std::vector<ReportingDescriptorReference>> taxa;
-        std::shared_ptr<WebRequest> web_request;
-        std::shared_ptr<WebResponse> web_response;
-        std::shared_ptr<std::vector<std::string>> work_item_uris;
-
-        public:
-        /**
-         * Identifies the artifact that the analysis tool was instructed to scan. This need not be
-         * the same as the artifact where the result actually occurred.
-         */
-        std::shared_ptr<ArtifactLocation> get_analysis_target() const { return analysis_target; }
-        void set_analysis_target(std::shared_ptr<ArtifactLocation> value) { this->analysis_target = value; }
-
-        /**
-         * A set of artifacts relevant to the result.
-         */
-        std::shared_ptr<std::vector<Attachment>> get_attachments() const { return attachments; }
-        void set_attachments(std::shared_ptr<std::vector<Attachment>> value) { this->attachments = value; }
-
-        /**
-         * The state of a result relative to a baseline of a previous run.
-         */
-        std::shared_ptr<BaselineState> get_baseline_state() const { return baseline_state; }
-        void set_baseline_state(std::shared_ptr<BaselineState> value) { this->baseline_state = value; }
-
-        /**
-         * An array of 'codeFlow' objects relevant to the result.
-         */
-        std::shared_ptr<std::vector<CodeFlow>> get_code_flows() const { return code_flows; }
-        void set_code_flows(std::shared_ptr<std::vector<CodeFlow>> value) { this->code_flows = value; }
-
-        /**
-         * A stable, unique identifier for the equivalence class of logically identical results to
-         * which this result belongs, in the form of a GUID.
-         */
-        std::shared_ptr<std::string> get_correlation_guid() const { return correlation_guid; }
-        void set_correlation_guid(std::shared_ptr<std::string> value) { if (value) CheckConstraint("correlation_guid", correlation_guid_constraint, *value); this->correlation_guid = value; }
-
-        /**
-         * A set of strings each of which individually defines a stable, unique identity for the
-         * result.
-         */
-        std::shared_ptr<std::map<std::string, std::string>> get_fingerprints() const { return fingerprints; }
-        void set_fingerprints(std::shared_ptr<std::map<std::string, std::string>> value) { this->fingerprints = value; }
-
-        /**
-         * An array of 'fix' objects, each of which represents a proposed fix to the problem
-         * indicated by the result.
-         */
-        std::shared_ptr<std::vector<Fix>> get_fixes() const { return fixes; }
-        void set_fixes(std::shared_ptr<std::vector<Fix>> value) { this->fixes = value; }
-
-        /**
-         * An array of zero or more unique graph objects associated with the result.
-         */
-        std::shared_ptr<std::vector<Graph>> get_graphs() const { return graphs; }
-        void set_graphs(std::shared_ptr<std::vector<Graph>> value) { this->graphs = value; }
-
-        /**
-         * An array of one or more unique 'graphTraversal' objects.
-         */
-        std::shared_ptr<std::vector<GraphTraversal>> get_graph_traversals() const { return graph_traversals; }
-        void set_graph_traversals(std::shared_ptr<std::vector<GraphTraversal>> value) { this->graph_traversals = value; }
-
-        /**
-         * A stable, unique identifer for the result in the form of a GUID.
-         */
-        std::shared_ptr<std::string> get_guid() const { return guid; }
-        void set_guid(std::shared_ptr<std::string> value) { if (value) CheckConstraint("guid", guid_constraint, *value); this->guid = value; }
-
-        /**
-         * An absolute URI at which the result can be viewed.
-         */
-        std::shared_ptr<std::string> get_hosted_viewer_uri() const { return hosted_viewer_uri; }
-        void set_hosted_viewer_uri(std::shared_ptr<std::string> value) { this->hosted_viewer_uri = value; }
-
-        /**
-         * A value that categorizes results by evaluation state.
-         */
-        std::shared_ptr<ResultKind> get_kind() const { return kind; }
-        void set_kind(std::shared_ptr<ResultKind> value) { this->kind = value; }
-
-        /**
-         * A value specifying the severity level of the result.
-         */
-        std::shared_ptr<Level> get_level() const { return level; }
-        void set_level(std::shared_ptr<Level> value) { this->level = value; }
-
-        /**
-         * The set of locations where the result was detected. Specify only one location unless the
-         * problem indicated by the result can only be corrected by making a change at every
-         * specified location.
-         */
-        std::shared_ptr<std::vector<Location>> get_locations() const { return locations; }
-        void set_locations(std::shared_ptr<std::vector<Location>> value) { this->locations = value; }
-
-        /**
-         * A message that describes the result. The first sentence of the message only will be
-         * displayed when visible space is limited.
-         */
-        const Message & get_message() const { return message; }
-        Message & get_mutable_message() { return message; }
-        void set_message(const Message & value) { this->message = value; }
-
-        /**
-         * A positive integer specifying the number of times this logically unique result was
-         * observed in this run.
-         */
-        std::shared_ptr<int64_t> get_occurrence_count() const { return occurrence_count; }
-        void set_occurrence_count(std::shared_ptr<int64_t> value) { if (value) CheckConstraint("occurrence_count", occurrence_count_constraint, *value); this->occurrence_count = value; }
-
-        /**
-         * A set of strings that contribute to the stable, unique identity of the result.
-         */
-        std::shared_ptr<std::map<std::string, std::string>> get_partial_fingerprints() const { return partial_fingerprints; }
-        void set_partial_fingerprints(std::shared_ptr<std::map<std::string, std::string>> value) { this->partial_fingerprints = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the result.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-
-        /**
-         * Information about how and when the result was detected.
-         */
-        std::shared_ptr<ResultProvenance> get_provenance() const { return provenance; }
-        void set_provenance(std::shared_ptr<ResultProvenance> value) { this->provenance = value; }
-
-        /**
-         * A number representing the priority or importance of the result.
-         */
-        std::shared_ptr<double> get_rank() const { return rank; }
-        void set_rank(std::shared_ptr<double> value) { if (value) CheckConstraint("rank", rank_constraint, *value); this->rank = value; }
-
-        /**
-         * A set of locations relevant to this result.
-         */
-        std::shared_ptr<std::vector<Location>> get_related_locations() const { return related_locations; }
-        void set_related_locations(std::shared_ptr<std::vector<Location>> value) { this->related_locations = value; }
-
-        /**
-         * A reference used to locate the rule descriptor relevant to this result.
-         */
-        std::shared_ptr<ReportingDescriptorReference> get_rule() const { return rule; }
-        void set_rule(std::shared_ptr<ReportingDescriptorReference> value) { this->rule = value; }
-
-        /**
-         * The stable, unique identifier of the rule, if any, to which this result is relevant.
-         */
-        std::shared_ptr<std::string> get_rule_id() const { return rule_id; }
-        void set_rule_id(std::shared_ptr<std::string> value) { this->rule_id = value; }
-
-        /**
-         * The index within the tool component rules array of the rule object associated with this
-         * result.
-         */
-        std::shared_ptr<int64_t> get_rule_index() const { return rule_index; }
-        void set_rule_index(std::shared_ptr<int64_t> value) { if (value) CheckConstraint("rule_index", rule_index_constraint, *value); this->rule_index = value; }
-
-        /**
-         * An array of 'stack' objects relevant to the result.
-         */
-        std::shared_ptr<std::vector<Stack>> get_stacks() const { return stacks; }
-        void set_stacks(std::shared_ptr<std::vector<Stack>> value) { this->stacks = value; }
-
-        /**
-         * A set of suppressions relevant to this result.
-         */
-        std::shared_ptr<std::vector<Suppression>> get_suppressions() const { return suppressions; }
-        void set_suppressions(std::shared_ptr<std::vector<Suppression>> value) { this->suppressions = value; }
-
-        /**
-         * An array of references to taxonomy reporting descriptors that are applicable to the
-         * result.
-         */
-        std::shared_ptr<std::vector<ReportingDescriptorReference>> get_taxa() const { return taxa; }
-        void set_taxa(std::shared_ptr<std::vector<ReportingDescriptorReference>> value) { this->taxa = value; }
-
-        /**
-         * A web request associated with this result.
-         */
-        std::shared_ptr<WebRequest> get_web_request() const { return web_request; }
-        void set_web_request(std::shared_ptr<WebRequest> value) { this->web_request = value; }
-
-        /**
-         * A web response associated with this result.
-         */
-        std::shared_ptr<WebResponse> get_web_response() const { return web_response; }
-        void set_web_response(std::shared_ptr<WebResponse> value) { this->web_response = value; }
-
-        /**
-         * The URIs of the work items associated with this result.
-         */
-        std::shared_ptr<std::vector<std::string>> get_work_item_uris() const { return work_item_uris; }
-        void set_work_item_uris(std::shared_ptr<std::vector<std::string>> value) { this->work_item_uris = value; }
-    };
-
-    /**
-     * The SARIF format version of this external properties object.
-     *
-     * The SARIF format version of this log file.
-     */
-    enum class Version : int { THE_210 };
-
-    /**
-     * The top-level element of an external property file.
-     */
-    class ExternalProperties {
-        public:
-        ExternalProperties() :
-            guid_constraint(boost::none, boost::none, boost::none, boost::none, std::string("^[0-9a-fA-F]{8}-[0-9a-fA-F]{4}-[1-5][0-9a-fA-F]{3}-[89abAB][0-9a-fA-F]{3}-[0-9a-fA-F]{12}$")),
-            run_guid_constraint(boost::none, boost::none, boost::none, boost::none, std::string("^[0-9a-fA-F]{8}-[0-9a-fA-F]{4}-[1-5][0-9a-fA-F]{3}-[89abAB][0-9a-fA-F]{3}-[0-9a-fA-F]{12}$"))
-        {}
-        virtual ~ExternalProperties() = default;
-
-        private:
-        std::shared_ptr<std::vector<Address>> addresses;
-        std::shared_ptr<std::vector<Artifact>> artifacts;
-        std::shared_ptr<Conversion> conversion;
-        std::shared_ptr<ToolComponent> driver;
-        std::shared_ptr<std::vector<ToolComponent>> extensions;
-        std::shared_ptr<PropertyBag> externalized_properties;
-        std::shared_ptr<std::vector<Graph>> graphs;
-        std::shared_ptr<std::string> guid;
-        ClassMemberConstraints guid_constraint;
-        std::shared_ptr<std::vector<Invocation>> invocations;
-        std::shared_ptr<std::vector<LogicalLocation>> logical_locations;
-        std::shared_ptr<std::vector<ToolComponent>> policies;
-        std::shared_ptr<PropertyBag> properties;
-        std::shared_ptr<std::vector<Result>> results;
-        std::shared_ptr<std::string> run_guid;
-        ClassMemberConstraints run_guid_constraint;
-        std::shared_ptr<std::string> schema;
-        std::shared_ptr<std::vector<ToolComponent>> taxonomies;
-        std::shared_ptr<std::vector<ThreadFlowLocation>> thread_flow_locations;
-        std::shared_ptr<std::vector<ToolComponent>> translations;
-        std::shared_ptr<Version> version;
-        std::shared_ptr<std::vector<WebRequest>> web_requests;
-        std::shared_ptr<std::vector<WebResponse>> web_responses;
-
-        public:
-        /**
-         * Addresses that will be merged with a separate run.
-         */
-        std::shared_ptr<std::vector<Address>> get_addresses() const { return addresses; }
-        void set_addresses(std::shared_ptr<std::vector<Address>> value) { this->addresses = value; }
-
-        /**
-         * An array of artifact objects that will be merged with a separate run.
-         */
-        std::shared_ptr<std::vector<Artifact>> get_artifacts() const { return artifacts; }
-        void set_artifacts(std::shared_ptr<std::vector<Artifact>> value) { this->artifacts = value; }
-
-        /**
-         * A conversion object that will be merged with a separate run.
-         */
-        std::shared_ptr<Conversion> get_conversion() const { return conversion; }
-        void set_conversion(std::shared_ptr<Conversion> value) { this->conversion = value; }
-
-        /**
-         * The analysis tool object that will be merged with a separate run.
-         */
-        std::shared_ptr<ToolComponent> get_driver() const { return driver; }
-        void set_driver(std::shared_ptr<ToolComponent> value) { this->driver = value; }
-
-        /**
-         * Tool extensions that will be merged with a separate run.
-         */
-        std::shared_ptr<std::vector<ToolComponent>> get_extensions() const { return extensions; }
-        void set_extensions(std::shared_ptr<std::vector<ToolComponent>> value) { this->extensions = value; }
-
-        /**
-         * Key/value pairs that provide additional information that will be merged with a separate
-         * run.
-         */
-        std::shared_ptr<PropertyBag> get_externalized_properties() const { return externalized_properties; }
-        void set_externalized_properties(std::shared_ptr<PropertyBag> value) { this->externalized_properties = value; }
-
-        /**
-         * An array of graph objects that will be merged with a separate run.
-         */
-        std::shared_ptr<std::vector<Graph>> get_graphs() const { return graphs; }
-        void set_graphs(std::shared_ptr<std::vector<Graph>> value) { this->graphs = value; }
-
-        /**
-         * A stable, unique identifer for this external properties object, in the form of a GUID.
-         */
-        std::shared_ptr<std::string> get_guid() const { return guid; }
-        void set_guid(std::shared_ptr<std::string> value) { if (value) CheckConstraint("guid", guid_constraint, *value); this->guid = value; }
-
-        /**
-         * Describes the invocation of the analysis tool that will be merged with a separate run.
-         */
-        std::shared_ptr<std::vector<Invocation>> get_invocations() const { return invocations; }
-        void set_invocations(std::shared_ptr<std::vector<Invocation>> value) { this->invocations = value; }
-
-        /**
-         * An array of logical locations such as namespaces, types or functions that will be merged
-         * with a separate run.
-         */
-        std::shared_ptr<std::vector<LogicalLocation>> get_logical_locations() const { return logical_locations; }
-        void set_logical_locations(std::shared_ptr<std::vector<LogicalLocation>> value) { this->logical_locations = value; }
-
-        /**
-         * Tool policies that will be merged with a separate run.
-         */
-        std::shared_ptr<std::vector<ToolComponent>> get_policies() const { return policies; }
-        void set_policies(std::shared_ptr<std::vector<ToolComponent>> value) { this->policies = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the external properties.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-
-        /**
-         * An array of result objects that will be merged with a separate run.
-         */
-        std::shared_ptr<std::vector<Result>> get_results() const { return results; }
-        void set_results(std::shared_ptr<std::vector<Result>> value) { this->results = value; }
-
-        /**
-         * A stable, unique identifer for the run associated with this external properties object,
-         * in the form of a GUID.
-         */
-        std::shared_ptr<std::string> get_run_guid() const { return run_guid; }
-        void set_run_guid(std::shared_ptr<std::string> value) { if (value) CheckConstraint("run_guid", run_guid_constraint, *value); this->run_guid = value; }
-
-        /**
-         * The URI of the JSON schema corresponding to the version of the external property file
-         * format.
-         */
-        std::shared_ptr<std::string> get_schema() const { return schema; }
-        void set_schema(std::shared_ptr<std::string> value) { this->schema = value; }
-
-        /**
-         * Tool taxonomies that will be merged with a separate run.
-         */
-        std::shared_ptr<std::vector<ToolComponent>> get_taxonomies() const { return taxonomies; }
-        void set_taxonomies(std::shared_ptr<std::vector<ToolComponent>> value) { this->taxonomies = value; }
-
-        /**
-         * An array of threadFlowLocation objects that will be merged with a separate run.
-         */
-        std::shared_ptr<std::vector<ThreadFlowLocation>> get_thread_flow_locations() const { return thread_flow_locations; }
-        void set_thread_flow_locations(std::shared_ptr<std::vector<ThreadFlowLocation>> value) { this->thread_flow_locations = value; }
-
-        /**
-         * Tool translations that will be merged with a separate run.
-         */
-        std::shared_ptr<std::vector<ToolComponent>> get_translations() const { return translations; }
-        void set_translations(std::shared_ptr<std::vector<ToolComponent>> value) { this->translations = value; }
-
-        /**
-         * The SARIF format version of this external properties object.
-         */
-        std::shared_ptr<Version> get_version() const { return version; }
-        void set_version(std::shared_ptr<Version> value) { this->version = value; }
-
-        /**
-         * Requests that will be merged with a separate run.
-         */
-        std::shared_ptr<std::vector<WebRequest>> get_web_requests() const { return web_requests; }
-        void set_web_requests(std::shared_ptr<std::vector<WebRequest>> value) { this->web_requests = value; }
-
-        /**
-         * Responses that will be merged with a separate run.
-         */
-        std::shared_ptr<std::vector<WebResponse>> get_web_responses() const { return web_responses; }
-        void set_web_responses(std::shared_ptr<std::vector<WebResponse>> value) { this->web_responses = value; }
-    };
-
-    /**
-     * Automation details that describe this run.
-     *
-     * Information that describes a run's identity and role within an engineering system process.
-     */
-    class RunAutomationDetails {
-        public:
-        RunAutomationDetails() :
-            correlation_guid_constraint(boost::none, boost::none, boost::none, boost::none, std::string("^[0-9a-fA-F]{8}-[0-9a-fA-F]{4}-[1-5][0-9a-fA-F]{3}-[89abAB][0-9a-fA-F]{3}-[0-9a-fA-F]{12}$")),
-            guid_constraint(boost::none, boost::none, boost::none, boost::none, std::string("^[0-9a-fA-F]{8}-[0-9a-fA-F]{4}-[1-5][0-9a-fA-F]{3}-[89abAB][0-9a-fA-F]{3}-[0-9a-fA-F]{12}$"))
-        {}
-        virtual ~RunAutomationDetails() = default;
-
-        private:
-        std::shared_ptr<std::string> correlation_guid;
-        ClassMemberConstraints correlation_guid_constraint;
-        std::shared_ptr<Message> description;
-        std::shared_ptr<std::string> guid;
-        ClassMemberConstraints guid_constraint;
-        std::shared_ptr<std::string> id;
-        std::shared_ptr<PropertyBag> properties;
-
-        public:
-        /**
-         * A stable, unique identifier for the equivalence class of runs to which this object's
-         * containing run object belongs in the form of a GUID.
-         */
-        std::shared_ptr<std::string> get_correlation_guid() const { return correlation_guid; }
-        void set_correlation_guid(std::shared_ptr<std::string> value) { if (value) CheckConstraint("correlation_guid", correlation_guid_constraint, *value); this->correlation_guid = value; }
-
-        /**
-         * A description of the identity and role played within the engineering system by this
-         * object's containing run object.
-         */
-        std::shared_ptr<Message> get_description() const { return description; }
-        void set_description(std::shared_ptr<Message> value) { this->description = value; }
-
-        /**
-         * A stable, unique identifer for this object's containing run object in the form of a GUID.
-         */
-        std::shared_ptr<std::string> get_guid() const { return guid; }
-        void set_guid(std::shared_ptr<std::string> value) { if (value) CheckConstraint("guid", guid_constraint, *value); this->guid = value; }
-
-        /**
-         * A hierarchical string that uniquely identifies this object's containing run object.
-         */
-        std::shared_ptr<std::string> get_id() const { return id; }
-        void set_id(std::shared_ptr<std::string> value) { this->id = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the run automation details.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-    };
-
-    /**
-     * Specifies the unit in which the tool measures columns.
-     */
-    enum class ColumnKind : int { UNICODE_CODE_POINTS, UTF16_CODE_UNITS };
-
-    /**
-     * An external property file containing a run.conversion object to be merged with the root
-     * log file.
-     *
-     * An external property file containing a run.driver object to be merged with the root log
-     * file.
-     *
-     * An external property file containing a run.properties object to be merged with the root
-     * log file.
-     *
-     * Contains information that enables a SARIF consumer to locate the external property file
-     * that contains the value of an externalized property associated with the run.
-     */
-    class ExternalPropertyFileReference {
-        public:
-        ExternalPropertyFileReference() :
-            guid_constraint(boost::none, boost::none, boost::none, boost::none, std::string("^[0-9a-fA-F]{8}-[0-9a-fA-F]{4}-[1-5][0-9a-fA-F]{3}-[89abAB][0-9a-fA-F]{3}-[0-9a-fA-F]{12}$")),
-            item_count_constraint(-1, boost::none, boost::none, boost::none, boost::none)
-        {}
-        virtual ~ExternalPropertyFileReference() = default;
-
-        private:
-        std::shared_ptr<std::string> guid;
-        ClassMemberConstraints guid_constraint;
-        std::shared_ptr<int64_t> item_count;
-        ClassMemberConstraints item_count_constraint;
-        std::shared_ptr<ArtifactLocation> location;
-        std::shared_ptr<PropertyBag> properties;
-
-        public:
-        /**
-         * A stable, unique identifer for the external property file in the form of a GUID.
-         */
-        std::shared_ptr<std::string> get_guid() const { return guid; }
-        void set_guid(std::shared_ptr<std::string> value) { if (value) CheckConstraint("guid", guid_constraint, *value); this->guid = value; }
-
-        /**
-         * A non-negative integer specifying the number of items contained in the external property
-         * file.
-         */
-        std::shared_ptr<int64_t> get_item_count() const { return item_count; }
-        void set_item_count(std::shared_ptr<int64_t> value) { if (value) CheckConstraint("item_count", item_count_constraint, *value); this->item_count = value; }
-
-        /**
-         * The location of the external property file.
-         */
-        std::shared_ptr<ArtifactLocation> get_location() const { return location; }
-        void set_location(std::shared_ptr<ArtifactLocation> value) { this->location = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the external property file.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-    };
-
-    /**
-     * References to external property files that should be inlined with the content of a root
-     * log file.
-     */
-    class ExternalPropertyFileReferences {
-        public:
-        ExternalPropertyFileReferences() = default;
-        virtual ~ExternalPropertyFileReferences() = default;
-
-        private:
-        std::shared_ptr<std::vector<ExternalPropertyFileReference>> addresses;
-        std::shared_ptr<std::vector<ExternalPropertyFileReference>> artifacts;
-        std::shared_ptr<ExternalPropertyFileReference> conversion;
-        std::shared_ptr<ExternalPropertyFileReference> driver;
-        std::shared_ptr<std::vector<ExternalPropertyFileReference>> extensions;
-        std::shared_ptr<ExternalPropertyFileReference> externalized_properties;
-        std::shared_ptr<std::vector<ExternalPropertyFileReference>> graphs;
-        std::shared_ptr<std::vector<ExternalPropertyFileReference>> invocations;
-        std::shared_ptr<std::vector<ExternalPropertyFileReference>> logical_locations;
-        std::shared_ptr<std::vector<ExternalPropertyFileReference>> policies;
-        std::shared_ptr<PropertyBag> properties;
-        std::shared_ptr<std::vector<ExternalPropertyFileReference>> results;
-        std::shared_ptr<std::vector<ExternalPropertyFileReference>> taxonomies;
-        std::shared_ptr<std::vector<ExternalPropertyFileReference>> thread_flow_locations;
-        std::shared_ptr<std::vector<ExternalPropertyFileReference>> translations;
-        std::shared_ptr<std::vector<ExternalPropertyFileReference>> web_requests;
-        std::shared_ptr<std::vector<ExternalPropertyFileReference>> web_responses;
-
-        public:
-        /**
-         * An array of external property files containing run.addresses arrays to be merged with the
-         * root log file.
-         */
-        std::shared_ptr<std::vector<ExternalPropertyFileReference>> get_addresses() const { return addresses; }
-        void set_addresses(std::shared_ptr<std::vector<ExternalPropertyFileReference>> value) { this->addresses = value; }
-
-        /**
-         * An array of external property files containing run.artifacts arrays to be merged with the
-         * root log file.
-         */
-        std::shared_ptr<std::vector<ExternalPropertyFileReference>> get_artifacts() const { return artifacts; }
-        void set_artifacts(std::shared_ptr<std::vector<ExternalPropertyFileReference>> value) { this->artifacts = value; }
-
-        /**
-         * An external property file containing a run.conversion object to be merged with the root
-         * log file.
-         */
-        std::shared_ptr<ExternalPropertyFileReference> get_conversion() const { return conversion; }
-        void set_conversion(std::shared_ptr<ExternalPropertyFileReference> value) { this->conversion = value; }
-
-        /**
-         * An external property file containing a run.driver object to be merged with the root log
-         * file.
-         */
-        std::shared_ptr<ExternalPropertyFileReference> get_driver() const { return driver; }
-        void set_driver(std::shared_ptr<ExternalPropertyFileReference> value) { this->driver = value; }
-
-        /**
-         * An array of external property files containing run.extensions arrays to be merged with
-         * the root log file.
-         */
-        std::shared_ptr<std::vector<ExternalPropertyFileReference>> get_extensions() const { return extensions; }
-        void set_extensions(std::shared_ptr<std::vector<ExternalPropertyFileReference>> value) { this->extensions = value; }
-
-        /**
-         * An external property file containing a run.properties object to be merged with the root
-         * log file.
-         */
-        std::shared_ptr<ExternalPropertyFileReference> get_externalized_properties() const { return externalized_properties; }
-        void set_externalized_properties(std::shared_ptr<ExternalPropertyFileReference> value) { this->externalized_properties = value; }
-
-        /**
-         * An array of external property files containing a run.graphs object to be merged with the
-         * root log file.
-         */
-        std::shared_ptr<std::vector<ExternalPropertyFileReference>> get_graphs() const { return graphs; }
-        void set_graphs(std::shared_ptr<std::vector<ExternalPropertyFileReference>> value) { this->graphs = value; }
-
-        /**
-         * An array of external property files containing run.invocations arrays to be merged with
-         * the root log file.
-         */
-        std::shared_ptr<std::vector<ExternalPropertyFileReference>> get_invocations() const { return invocations; }
-        void set_invocations(std::shared_ptr<std::vector<ExternalPropertyFileReference>> value) { this->invocations = value; }
-
-        /**
-         * An array of external property files containing run.logicalLocations arrays to be merged
-         * with the root log file.
-         */
-        std::shared_ptr<std::vector<ExternalPropertyFileReference>> get_logical_locations() const { return logical_locations; }
-        void set_logical_locations(std::shared_ptr<std::vector<ExternalPropertyFileReference>> value) { this->logical_locations = value; }
-
-        /**
-         * An array of external property files containing run.policies arrays to be merged with the
-         * root log file.
-         */
-        std::shared_ptr<std::vector<ExternalPropertyFileReference>> get_policies() const { return policies; }
-        void set_policies(std::shared_ptr<std::vector<ExternalPropertyFileReference>> value) { this->policies = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the external property files.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-
-        /**
-         * An array of external property files containing run.results arrays to be merged with the
-         * root log file.
-         */
-        std::shared_ptr<std::vector<ExternalPropertyFileReference>> get_results() const { return results; }
-        void set_results(std::shared_ptr<std::vector<ExternalPropertyFileReference>> value) { this->results = value; }
-
-        /**
-         * An array of external property files containing run.taxonomies arrays to be merged with
-         * the root log file.
-         */
-        std::shared_ptr<std::vector<ExternalPropertyFileReference>> get_taxonomies() const { return taxonomies; }
-        void set_taxonomies(std::shared_ptr<std::vector<ExternalPropertyFileReference>> value) { this->taxonomies = value; }
-
-        /**
-         * An array of external property files containing run.threadFlowLocations arrays to be
-         * merged with the root log file.
-         */
-        std::shared_ptr<std::vector<ExternalPropertyFileReference>> get_thread_flow_locations() const { return thread_flow_locations; }
-        void set_thread_flow_locations(std::shared_ptr<std::vector<ExternalPropertyFileReference>> value) { this->thread_flow_locations = value; }
-
-        /**
-         * An array of external property files containing run.translations arrays to be merged with
-         * the root log file.
-         */
-        std::shared_ptr<std::vector<ExternalPropertyFileReference>> get_translations() const { return translations; }
-        void set_translations(std::shared_ptr<std::vector<ExternalPropertyFileReference>> value) { this->translations = value; }
-
-        /**
-         * An array of external property files containing run.requests arrays to be merged with the
-         * root log file.
-         */
-        std::shared_ptr<std::vector<ExternalPropertyFileReference>> get_web_requests() const { return web_requests; }
-        void set_web_requests(std::shared_ptr<std::vector<ExternalPropertyFileReference>> value) { this->web_requests = value; }
-
-        /**
-         * An array of external property files containing run.responses arrays to be merged with the
-         * root log file.
-         */
-        std::shared_ptr<std::vector<ExternalPropertyFileReference>> get_web_responses() const { return web_responses; }
-        void set_web_responses(std::shared_ptr<std::vector<ExternalPropertyFileReference>> value) { this->web_responses = value; }
-    };
-
-    /**
-     * A specialLocations object that defines locations of special significance to SARIF
-     * consumers.
-     *
-     * Defines locations of special significance to SARIF consumers.
-     */
-    class SpecialLocations {
-        public:
-        SpecialLocations() = default;
-        virtual ~SpecialLocations() = default;
-
-        private:
-        std::shared_ptr<ArtifactLocation> display_base;
-        std::shared_ptr<PropertyBag> properties;
-
-        public:
-        /**
-         * Provides a suggestion to SARIF consumers to display file paths relative to the specified
-         * location.
-         */
-        std::shared_ptr<ArtifactLocation> get_display_base() const { return display_base; }
-        void set_display_base(std::shared_ptr<ArtifactLocation> value) { this->display_base = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the special locations.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-    };
-
-    /**
-     * Specifies the information necessary to retrieve a desired revision from a version control
-     * system.
-     */
-    class VersionControlDetails {
-        public:
-        VersionControlDetails() = default;
-        virtual ~VersionControlDetails() = default;
-
-        private:
-        std::shared_ptr<std::string> as_of_time_utc;
-        std::shared_ptr<std::string> branch;
-        std::shared_ptr<ArtifactLocation> mapped_to;
-        std::shared_ptr<PropertyBag> properties;
-        std::string repository_uri;
-        std::shared_ptr<std::string> revision_id;
-        std::shared_ptr<std::string> revision_tag;
-
-        public:
-        /**
-         * A Coordinated Universal Time (UTC) date and time that can be used to synchronize an
-         * enlistment to the state of the repository at that time.
-         */
-        std::shared_ptr<std::string> get_as_of_time_utc() const { return as_of_time_utc; }
-        void set_as_of_time_utc(std::shared_ptr<std::string> value) { this->as_of_time_utc = value; }
-
-        /**
-         * The name of a branch containing the revision.
-         */
-        std::shared_ptr<std::string> get_branch() const { return branch; }
-        void set_branch(std::shared_ptr<std::string> value) { this->branch = value; }
-
-        /**
-         * The location in the local file system to which the root of the repository was mapped at
-         * the time of the analysis.
-         */
-        std::shared_ptr<ArtifactLocation> get_mapped_to() const { return mapped_to; }
-        void set_mapped_to(std::shared_ptr<ArtifactLocation> value) { this->mapped_to = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the version control details.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-
-        /**
-         * The absolute URI of the repository.
-         */
-        const std::string & get_repository_uri() const { return repository_uri; }
-        std::string & get_mutable_repository_uri() { return repository_uri; }
-        void set_repository_uri(const std::string & value) { this->repository_uri = value; }
-
-        /**
-         * A string that uniquely and permanently identifies the revision within the repository.
-         */
-        std::shared_ptr<std::string> get_revision_id() const { return revision_id; }
-        void set_revision_id(std::shared_ptr<std::string> value) { this->revision_id = value; }
-
-        /**
-         * A tag that has been applied to the revision.
-         */
-        std::shared_ptr<std::string> get_revision_tag() const { return revision_tag; }
-        void set_revision_tag(std::shared_ptr<std::string> value) { this->revision_tag = value; }
-    };
-
-    /**
-     * Describes a single run of an analysis tool, and contains the reported output of that run.
-     */
-    class Run {
-        public:
-        Run() :
-            baseline_guid_constraint(boost::none, boost::none, boost::none, boost::none, std::string("^[0-9a-fA-F]{8}-[0-9a-fA-F]{4}-[1-5][0-9a-fA-F]{3}-[89abAB][0-9a-fA-F]{3}-[0-9a-fA-F]{12}$")),
-            language_constraint(boost::none, boost::none, boost::none, boost::none, std::string("^[a-zA-Z]{2}|^[a-zA-Z]{2}-[a-zA-Z]{2}]?$"))
-        {}
-        virtual ~Run() = default;
-
-        private:
-        std::shared_ptr<std::vector<Address>> addresses;
-        std::shared_ptr<std::vector<Artifact>> artifacts;
-        std::shared_ptr<RunAutomationDetails> automation_details;
-        std::shared_ptr<std::string> baseline_guid;
-        ClassMemberConstraints baseline_guid_constraint;
-        std::shared_ptr<ColumnKind> column_kind;
-        std::shared_ptr<Conversion> conversion;
-        std::shared_ptr<std::string> default_encoding;
-        std::shared_ptr<std::string> default_source_language;
-        std::shared_ptr<ExternalPropertyFileReferences> external_property_file_references;
-        std::shared_ptr<std::vector<Graph>> graphs;
-        std::shared_ptr<std::vector<Invocation>> invocations;
-        std::shared_ptr<std::string> language;
-        ClassMemberConstraints language_constraint;
-        std::shared_ptr<std::vector<LogicalLocation>> logical_locations;
-        std::shared_ptr<std::vector<std::string>> newline_sequences;
-        std::shared_ptr<std::map<std::string, ArtifactLocation>> original_uri_base_ids;
-        std::shared_ptr<std::vector<ToolComponent>> policies;
-        std::shared_ptr<PropertyBag> properties;
-        std::shared_ptr<std::vector<std::string>> redaction_tokens;
-        std::shared_ptr<std::vector<Result>> results;
-        std::shared_ptr<std::vector<RunAutomationDetails>> run_aggregates;
-        std::shared_ptr<SpecialLocations> special_locations;
-        std::shared_ptr<std::vector<ToolComponent>> taxonomies;
-        std::shared_ptr<std::vector<ThreadFlowLocation>> thread_flow_locations;
-        Tool tool;
-        std::shared_ptr<std::vector<ToolComponent>> translations;
-        std::shared_ptr<std::vector<VersionControlDetails>> version_control_provenance;
-        std::shared_ptr<std::vector<WebRequest>> web_requests;
-        std::shared_ptr<std::vector<WebResponse>> web_responses;
-
-        public:
-        /**
-         * Addresses associated with this run instance, if any.
-         */
-        std::shared_ptr<std::vector<Address>> get_addresses() const { return addresses; }
-        void set_addresses(std::shared_ptr<std::vector<Address>> value) { this->addresses = value; }
-
-        /**
-         * An array of artifact objects relevant to the run.
-         */
-        std::shared_ptr<std::vector<Artifact>> get_artifacts() const { return artifacts; }
-        void set_artifacts(std::shared_ptr<std::vector<Artifact>> value) { this->artifacts = value; }
-
-        /**
-         * Automation details that describe this run.
-         */
-        std::shared_ptr<RunAutomationDetails> get_automation_details() const { return automation_details; }
-        void set_automation_details(std::shared_ptr<RunAutomationDetails> value) { this->automation_details = value; }
-
-        /**
-         * The 'guid' property of a previous SARIF 'run' that comprises the baseline that was used
-         * to compute result 'baselineState' properties for the run.
-         */
-        std::shared_ptr<std::string> get_baseline_guid() const { return baseline_guid; }
-        void set_baseline_guid(std::shared_ptr<std::string> value) { if (value) CheckConstraint("baseline_guid", baseline_guid_constraint, *value); this->baseline_guid = value; }
-
-        /**
-         * Specifies the unit in which the tool measures columns.
-         */
-        std::shared_ptr<ColumnKind> get_column_kind() const { return column_kind; }
-        void set_column_kind(std::shared_ptr<ColumnKind> value) { this->column_kind = value; }
-
-        /**
-         * A conversion object that describes how a converter transformed an analysis tool's native
-         * reporting format into the SARIF format.
-         */
-        std::shared_ptr<Conversion> get_conversion() const { return conversion; }
-        void set_conversion(std::shared_ptr<Conversion> value) { this->conversion = value; }
-
-        /**
-         * Specifies the default encoding for any artifact object that refers to a text file.
-         */
-        std::shared_ptr<std::string> get_default_encoding() const { return default_encoding; }
-        void set_default_encoding(std::shared_ptr<std::string> value) { this->default_encoding = value; }
-
-        /**
-         * Specifies the default source language for any artifact object that refers to a text file
-         * that contains source code.
-         */
-        std::shared_ptr<std::string> get_default_source_language() const { return default_source_language; }
-        void set_default_source_language(std::shared_ptr<std::string> value) { this->default_source_language = value; }
-
-        /**
-         * References to external property files that should be inlined with the content of a root
-         * log file.
-         */
-        std::shared_ptr<ExternalPropertyFileReferences> get_external_property_file_references() const { return external_property_file_references; }
-        void set_external_property_file_references(std::shared_ptr<ExternalPropertyFileReferences> value) { this->external_property_file_references = value; }
-
-        /**
-         * An array of zero or more unique graph objects associated with the run.
-         */
-        std::shared_ptr<std::vector<Graph>> get_graphs() const { return graphs; }
-        void set_graphs(std::shared_ptr<std::vector<Graph>> value) { this->graphs = value; }
-
-        /**
-         * Describes the invocation of the analysis tool.
-         */
-        std::shared_ptr<std::vector<Invocation>> get_invocations() const { return invocations; }
-        void set_invocations(std::shared_ptr<std::vector<Invocation>> value) { this->invocations = value; }
-
-        /**
-         * The language of the messages emitted into the log file during this run (expressed as an
-         * ISO 639-1 two-letter lowercase culture code) and an optional region (expressed as an ISO
-         * 3166-1 two-letter uppercase subculture code associated with a country or region). The
-         * casing is recommended but not required (in order for this data to conform to RFC5646).
-         */
-        std::shared_ptr<std::string> get_language() const { return language; }
-        void set_language(std::shared_ptr<std::string> value) { if (value) CheckConstraint("language", language_constraint, *value); this->language = value; }
-
-        /**
-         * An array of logical locations such as namespaces, types or functions.
-         */
-        std::shared_ptr<std::vector<LogicalLocation>> get_logical_locations() const { return logical_locations; }
-        void set_logical_locations(std::shared_ptr<std::vector<LogicalLocation>> value) { this->logical_locations = value; }
-
-        /**
-         * An ordered list of character sequences that were treated as line breaks when computing
-         * region information for the run.
-         */
-        std::shared_ptr<std::vector<std::string>> get_newline_sequences() const { return newline_sequences; }
-        void set_newline_sequences(std::shared_ptr<std::vector<std::string>> value) { this->newline_sequences = value; }
-
-        /**
-         * The artifact location specified by each uriBaseId symbol on the machine where the tool
-         * originally ran.
-         */
-        std::shared_ptr<std::map<std::string, ArtifactLocation>> get_original_uri_base_ids() const { return original_uri_base_ids; }
-        void set_original_uri_base_ids(std::shared_ptr<std::map<std::string, ArtifactLocation>> value) { this->original_uri_base_ids = value; }
-
-        /**
-         * Contains configurations that may potentially override both
-         * reportingDescriptor.defaultConfiguration (the tool's default severities) and
-         * invocation.configurationOverrides (severities established at run-time from the command
-         * line).
-         */
-        std::shared_ptr<std::vector<ToolComponent>> get_policies() const { return policies; }
-        void set_policies(std::shared_ptr<std::vector<ToolComponent>> value) { this->policies = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the run.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-
-        /**
-         * An array of strings used to replace sensitive information in a redaction-aware property.
-         */
-        std::shared_ptr<std::vector<std::string>> get_redaction_tokens() const { return redaction_tokens; }
-        void set_redaction_tokens(std::shared_ptr<std::vector<std::string>> value) { this->redaction_tokens = value; }
-
-        /**
-         * The set of results contained in an SARIF log. The results array can be omitted when a run
-         * is solely exporting rules metadata. It must be present (but may be empty) if a log file
-         * represents an actual scan.
-         */
-        std::shared_ptr<std::vector<Result>> get_results() const { return results; }
-        void set_results(std::shared_ptr<std::vector<Result>> value) { this->results = value; }
-
-        /**
-         * Automation details that describe the aggregate of runs to which this run belongs.
-         */
-        std::shared_ptr<std::vector<RunAutomationDetails>> get_run_aggregates() const { return run_aggregates; }
-        void set_run_aggregates(std::shared_ptr<std::vector<RunAutomationDetails>> value) { this->run_aggregates = value; }
-
-        /**
-         * A specialLocations object that defines locations of special significance to SARIF
-         * consumers.
-         */
-        std::shared_ptr<SpecialLocations> get_special_locations() const { return special_locations; }
-        void set_special_locations(std::shared_ptr<SpecialLocations> value) { this->special_locations = value; }
-
-        /**
-         * An array of toolComponent objects relevant to a taxonomy in which results are categorized.
-         */
-        std::shared_ptr<std::vector<ToolComponent>> get_taxonomies() const { return taxonomies; }
-        void set_taxonomies(std::shared_ptr<std::vector<ToolComponent>> value) { this->taxonomies = value; }
-
-        /**
-         * An array of threadFlowLocation objects cached at run level.
-         */
-        std::shared_ptr<std::vector<ThreadFlowLocation>> get_thread_flow_locations() const { return thread_flow_locations; }
-        void set_thread_flow_locations(std::shared_ptr<std::vector<ThreadFlowLocation>> value) { this->thread_flow_locations = value; }
-
-        /**
-         * Information about the tool or tool pipeline that generated the results in this run. A run
-         * can only contain results produced by a single tool or tool pipeline. A run can aggregate
-         * results from multiple log files, as long as context around the tool run (tool
-         * command-line arguments and the like) is identical for all aggregated files.
-         */
-        const Tool & get_tool() const { return tool; }
-        Tool & get_mutable_tool() { return tool; }
-        void set_tool(const Tool & value) { this->tool = value; }
-
-        /**
-         * The set of available translations of the localized data provided by the tool.
-         */
-        std::shared_ptr<std::vector<ToolComponent>> get_translations() const { return translations; }
-        void set_translations(std::shared_ptr<std::vector<ToolComponent>> value) { this->translations = value; }
-
-        /**
-         * Specifies the revision in version control of the artifacts that were scanned.
-         */
-        std::shared_ptr<std::vector<VersionControlDetails>> get_version_control_provenance() const { return version_control_provenance; }
-        void set_version_control_provenance(std::shared_ptr<std::vector<VersionControlDetails>> value) { this->version_control_provenance = value; }
-
-        /**
-         * An array of request objects cached at run level.
-         */
-        std::shared_ptr<std::vector<WebRequest>> get_web_requests() const { return web_requests; }
-        void set_web_requests(std::shared_ptr<std::vector<WebRequest>> value) { this->web_requests = value; }
-
-        /**
-         * An array of response objects cached at run level.
-         */
-        std::shared_ptr<std::vector<WebResponse>> get_web_responses() const { return web_responses; }
-        void set_web_responses(std::shared_ptr<std::vector<WebResponse>> value) { this->web_responses = value; }
-    };
-
-    /**
-     * Static Analysis Results Format (SARIF) Version 2.1.0 JSON Schema: a standard format for
-     * the output of static analysis tools.
-     */
-    class Coordinate {
-        public:
-        Coordinate() = default;
-        virtual ~Coordinate() = default;
-
-        private:
-        std::shared_ptr<std::string> schema;
-        std::shared_ptr<std::vector<ExternalProperties>> inline_external_properties;
-        std::shared_ptr<PropertyBag> properties;
-        std::vector<Run> runs;
-        Version version;
-
-        public:
-        /**
-         * The URI of the JSON schema corresponding to the version.
-         */
-        std::shared_ptr<std::string> get_schema() const { return schema; }
-        void set_schema(std::shared_ptr<std::string> value) { this->schema = value; }
-
-        /**
-         * References to external property files that share data between runs.
-         */
-        std::shared_ptr<std::vector<ExternalProperties>> get_inline_external_properties() const { return inline_external_properties; }
-        void set_inline_external_properties(std::shared_ptr<std::vector<ExternalProperties>> value) { this->inline_external_properties = value; }
-
-        /**
-         * Key/value pairs that provide additional information about the log file.
-         */
-        std::shared_ptr<PropertyBag> get_properties() const { return properties; }
-        void set_properties(std::shared_ptr<PropertyBag> value) { this->properties = value; }
-
-        /**
-         * The set of runs contained in this log file.
-         */
-        const std::vector<Run> & get_runs() const { return runs; }
-        std::vector<Run> & get_mutable_runs() { return runs; }
-        void set_runs(const std::vector<Run> & value) { this->runs = value; }
-
-        /**
-         * The SARIF format version of this log file.
-         */
-        const Version & get_version() const { return version; }
-        Version & get_mutable_version() { return version; }
-        void set_version(const Version & value) { this->version = value; }
-    };
-}
-
-namespace nlohmann {
-    void from_json(const json & j, SARIF::PropertyBag & x);
-    void to_json(json & j, const SARIF::PropertyBag & x);
-
-    void from_json(const json & j, SARIF::Address & x);
-    void to_json(json & j, const SARIF::Address & x);
-
-    void from_json(const json & j, SARIF::MultiformatMessageString & x);
-    void to_json(json & j, const SARIF::MultiformatMessageString & x);
-
-    void from_json(const json & j, SARIF::ArtifactContent & x);
-    void to_json(json & j, const SARIF::ArtifactContent & x);
-
-    void from_json(const json & j, SARIF::Message & x);
-    void to_json(json & j, const SARIF::Message & x);
-
-    void from_json(const json & j, SARIF::ArtifactLocation & x);
-    void to_json(json & j, const SARIF::ArtifactLocation & x);
-
-    void from_json(const json & j, SARIF::Artifact & x);
-    void to_json(json & j, const SARIF::Artifact & x);
-
-    void from_json(const json & j, SARIF::ReportingConfiguration & x);
-    void to_json(json & j, const SARIF::ReportingConfiguration & x);
-
-    void from_json(const json & j, SARIF::ToolComponentReference & x);
-    void to_json(json & j, const SARIF::ToolComponentReference & x);
-
-    void from_json(const json & j, SARIF::ReportingDescriptorReference & x);
-    void to_json(json & j, const SARIF::ReportingDescriptorReference & x);
-
-    void from_json(const json & j, SARIF::ConfigurationOverride & x);
-    void to_json(json & j, const SARIF::ConfigurationOverride & x);
-
-    void from_json(const json & j, SARIF::Region & x);
-    void to_json(json & j, const SARIF::Region & x);
-
-    void from_json(const json & j, SARIF::LogicalLocation & x);
-    void to_json(json & j, const SARIF::LogicalLocation & x);
-
-    void from_json(const json & j, SARIF::PhysicalLocation & x);
-    void to_json(json & j, const SARIF::PhysicalLocation & x);
-
-    void from_json(const json & j, SARIF::LocationRelationship & x);
-    void to_json(json & j, const SARIF::LocationRelationship & x);
-
-    void from_json(const json & j, SARIF::Location & x);
-    void to_json(json & j, const SARIF::Location & x);
-
-    void from_json(const json & j, SARIF::StackFrame & x);
-    void to_json(json & j, const SARIF::StackFrame & x);
-
-    void from_json(const json & j, SARIF::Stack & x);
-    void to_json(json & j, const SARIF::Stack & x);
-
-    void from_json(const json & j, SARIF::Exception & x);
-    void to_json(json & j, const SARIF::Exception & x);
-
-    void from_json(const json & j, SARIF::Notification & x);
-    void to_json(json & j, const SARIF::Notification & x);
-
-    void from_json(const json & j, SARIF::Invocation & x);
-    void to_json(json & j, const SARIF::Invocation & x);
-
-    void from_json(const json & j, SARIF::ReportingDescriptorRelationship & x);
-    void to_json(json & j, const SARIF::ReportingDescriptorRelationship & x);
-
-    void from_json(const json & j, SARIF::ReportingDescriptor & x);
-    void to_json(json & j, const SARIF::ReportingDescriptor & x);
-
-    void from_json(const json & j, SARIF::TranslationMetadata & x);
-    void to_json(json & j, const SARIF::TranslationMetadata & x);
-
-    void from_json(const json & j, SARIF::ToolComponent & x);
-    void to_json(json & j, const SARIF::ToolComponent & x);
-
-    void from_json(const json & j, SARIF::Tool & x);
-    void to_json(json & j, const SARIF::Tool & x);
-
-    void from_json(const json & j, SARIF::Conversion & x);
-    void to_json(json & j, const SARIF::Conversion & x);
-
-    void from_json(const json & j, SARIF::Edge & x);
-    void to_json(json & j, const SARIF::Edge & x);
-
-    void from_json(const json & j, SARIF::Node & x);
-    void to_json(json & j, const SARIF::Node & x);
-
-    void from_json(const json & j, SARIF::Graph & x);
-    void to_json(json & j, const SARIF::Graph & x);
-
-    void from_json(const json & j, SARIF::Rectangle & x);
-    void to_json(json & j, const SARIF::Rectangle & x);
-
-    void from_json(const json & j, SARIF::Attachment & x);
-    void to_json(json & j, const SARIF::Attachment & x);
-
-    void from_json(const json & j, SARIF::WebRequest & x);
-    void to_json(json & j, const SARIF::WebRequest & x);
-
-    void from_json(const json & j, SARIF::WebResponse & x);
-    void to_json(json & j, const SARIF::WebResponse & x);
-
-    void from_json(const json & j, SARIF::ThreadFlowLocation & x);
-    void to_json(json & j, const SARIF::ThreadFlowLocation & x);
-
-    void from_json(const json & j, SARIF::ThreadFlow & x);
-    void to_json(json & j, const SARIF::ThreadFlow & x);
-
-    void from_json(const json & j, SARIF::CodeFlow & x);
-    void to_json(json & j, const SARIF::CodeFlow & x);
-
-    void from_json(const json & j, SARIF::Replacement & x);
-    void to_json(json & j, const SARIF::Replacement & x);
-
-    void from_json(const json & j, SARIF::ArtifactChange & x);
-    void to_json(json & j, const SARIF::ArtifactChange & x);
-
-    void from_json(const json & j, SARIF::Fix & x);
-    void to_json(json & j, const SARIF::Fix & x);
-
-    void from_json(const json & j, SARIF::EdgeTraversal & x);
-    void to_json(json & j, const SARIF::EdgeTraversal & x);
-
-    void from_json(const json & j, SARIF::GraphTraversal & x);
-    void to_json(json & j, const SARIF::GraphTraversal & x);
-
-    void from_json(const json & j, SARIF::ResultProvenance & x);
-    void to_json(json & j, const SARIF::ResultProvenance & x);
-
-    void from_json(const json & j, SARIF::Suppression & x);
-    void to_json(json & j, const SARIF::Suppression & x);
-
-    void from_json(const json & j, SARIF::Result & x);
-    void to_json(json & j, const SARIF::Result & x);
-
-    void from_json(const json & j, SARIF::ExternalProperties & x);
-    void to_json(json & j, const SARIF::ExternalProperties & x);
-
-    void from_json(const json & j, SARIF::RunAutomationDetails & x);
-    void to_json(json & j, const SARIF::RunAutomationDetails & x);
-
-    void from_json(const json & j, SARIF::ExternalPropertyFileReference & x);
-    void to_json(json & j, const SARIF::ExternalPropertyFileReference & x);
-
-    void from_json(const json & j, SARIF::ExternalPropertyFileReferences & x);
-    void to_json(json & j, const SARIF::ExternalPropertyFileReferences & x);
-
-    void from_json(const json & j, SARIF::SpecialLocations & x);
-    void to_json(json & j, const SARIF::SpecialLocations & x);
-
-    void from_json(const json & j, SARIF::VersionControlDetails & x);
-    void to_json(json & j, const SARIF::VersionControlDetails & x);
-
-    void from_json(const json & j, SARIF::Run & x);
-    void to_json(json & j, const SARIF::Run & x);
-
-    void from_json(const json & j, SARIF::Coordinate & x);
-    void to_json(json & j, const SARIF::Coordinate & x);
-
-    void from_json(const json & j, SARIF::Role & x);
-    void to_json(json & j, const SARIF::Role & x);
-
-    void from_json(const json & j, SARIF::Level & x);
-    void to_json(json & j, const SARIF::Level & x);
-
-    void from_json(const json & j, SARIF::Content & x);
-    void to_json(json & j, const SARIF::Content & x);
-
-    void from_json(const json & j, SARIF::BaselineState & x);
-    void to_json(json & j, const SARIF::BaselineState & x);
-
-    void from_json(const json & j, SARIF::Importance & x);
-    void to_json(json & j, const SARIF::Importance & x);
-
-    void from_json(const json & j, SARIF::ResultKind & x);
-    void to_json(json & j, const SARIF::ResultKind & x);
-
-    void from_json(const json & j, SARIF::SuppressionKind & x);
-    void to_json(json & j, const SARIF::SuppressionKind & x);
-
-    void from_json(const json & j, SARIF::Status & x);
-    void to_json(json & j, const SARIF::Status & x);
-
-    void from_json(const json & j, SARIF::Version & x);
-    void to_json(json & j, const SARIF::Version & x);
-
-    void from_json(const json & j, SARIF::ColumnKind & x);
-    void to_json(json & j, const SARIF::ColumnKind & x);
-
-    inline void from_json(const json & j, SARIF::PropertyBag& x) {
-        x.set_tags(SARIF::get_optional<std::vector<std::string>>(j, "tags"));
-    }
-
-    inline void to_json(json & j, const SARIF::PropertyBag & x) {
-        j = json::object();
-        j["tags"] = x.get_tags();
-    }
-
-    inline void from_json(const json & j, SARIF::Address& x) {
-        x.set_absolute_address(SARIF::get_optional<int64_t>(j, "absoluteAddress"));
-        x.set_fully_qualified_name(SARIF::get_optional<std::string>(j, "fullyQualifiedName"));
-        x.set_index(SARIF::get_optional<int64_t>(j, "index"));
-        x.set_kind(SARIF::get_optional<std::string>(j, "kind"));
-        x.set_length(SARIF::get_optional<int64_t>(j, "length"));
-        x.set_name(SARIF::get_optional<std::string>(j, "name"));
-        x.set_offset_from_parent(SARIF::get_optional<int64_t>(j, "offsetFromParent"));
-        x.set_parent_index(SARIF::get_optional<int64_t>(j, "parentIndex"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-        x.set_relative_address(SARIF::get_optional<int64_t>(j, "relativeAddress"));
-    }
-
-    inline void to_json(json & j, const SARIF::Address & x) {
-        j = json::object();
-        j["absoluteAddress"] = x.get_absolute_address();
-        j["fullyQualifiedName"] = x.get_fully_qualified_name();
-        j["index"] = x.get_index();
-        j["kind"] = x.get_kind();
-        j["length"] = x.get_length();
-        j["name"] = x.get_name();
-        j["offsetFromParent"] = x.get_offset_from_parent();
-        j["parentIndex"] = x.get_parent_index();
-        j["properties"] = x.get_properties();
-        j["relativeAddress"] = x.get_relative_address();
-    }
-
-    inline void from_json(const json & j, SARIF::MultiformatMessageString& x) {
-        x.set_markdown(SARIF::get_optional<std::string>(j, "markdown"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-        x.set_text(j.at("text").get<std::string>());
-    }
-
-    inline void to_json(json & j, const SARIF::MultiformatMessageString & x) {
-        j = json::object();
-        j["markdown"] = x.get_markdown();
-        j["properties"] = x.get_properties();
-        j["text"] = x.get_text();
-    }
-
-    inline void from_json(const json & j, SARIF::ArtifactContent& x) {
-        x.set_binary(SARIF::get_optional<std::string>(j, "binary"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-        x.set_rendered(SARIF::get_optional<SARIF::MultiformatMessageString>(j, "rendered"));
-        x.set_text(SARIF::get_optional<std::string>(j, "text"));
-    }
-
-    inline void to_json(json & j, const SARIF::ArtifactContent & x) {
-        j = json::object();
-        j["binary"] = x.get_binary();
-        j["properties"] = x.get_properties();
-        j["rendered"] = x.get_rendered();
-        j["text"] = x.get_text();
-    }
-
-    inline void from_json(const json & j, SARIF::Message& x) {
-        x.set_arguments(SARIF::get_optional<std::vector<std::string>>(j, "arguments"));
-        x.set_id(SARIF::get_optional<std::string>(j, "id"));
-        x.set_markdown(SARIF::get_optional<std::string>(j, "markdown"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-        x.set_text(SARIF::get_optional<std::string>(j, "text"));
-    }
-
-    inline void to_json(json & j, const SARIF::Message & x) {
-        j = json::object();
-        j["arguments"] = x.get_arguments();
-        j["id"] = x.get_id();
-        j["markdown"] = x.get_markdown();
-        j["properties"] = x.get_properties();
-        j["text"] = x.get_text();
-    }
-
-    inline void from_json(const json & j, SARIF::ArtifactLocation& x) {
-        x.set_description(SARIF::get_optional<SARIF::Message>(j, "description"));
-        x.set_index(SARIF::get_optional<int64_t>(j, "index"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-        x.set_uri(SARIF::get_optional<std::string>(j, "uri"));
-        x.set_uri_base_id(SARIF::get_optional<std::string>(j, "uriBaseId"));
-    }
-
-    inline void to_json(json & j, const SARIF::ArtifactLocation & x) {
-        j = json::object();
-        j["description"] = x.get_description();
-        j["index"] = x.get_index();
-        j["properties"] = x.get_properties();
-        j["uri"] = x.get_uri();
-        j["uriBaseId"] = x.get_uri_base_id();
-    }
-
-    inline void from_json(const json & j, SARIF::Artifact& x) {
-        x.set_contents(SARIF::get_optional<SARIF::ArtifactContent>(j, "contents"));
-        x.set_description(SARIF::get_optional<SARIF::Message>(j, "description"));
-        x.set_encoding(SARIF::get_optional<std::string>(j, "encoding"));
-        x.set_hashes(SARIF::get_optional<std::map<std::string, std::string>>(j, "hashes"));
-        x.set_last_modified_time_utc(SARIF::get_optional<std::string>(j, "lastModifiedTimeUtc"));
-        x.set_length(SARIF::get_optional<int64_t>(j, "length"));
-        x.set_location(SARIF::get_optional<SARIF::ArtifactLocation>(j, "location"));
-        x.set_mime_type(SARIF::get_optional<std::string>(j, "mimeType"));
-        x.set_offset(SARIF::get_optional<int64_t>(j, "offset"));
-        x.set_parent_index(SARIF::get_optional<int64_t>(j, "parentIndex"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-        x.set_roles(SARIF::get_optional<std::vector<SARIF::Role>>(j, "roles"));
-        x.set_source_language(SARIF::get_optional<std::string>(j, "sourceLanguage"));
-    }
-
-    inline void to_json(json & j, const SARIF::Artifact & x) {
-        j = json::object();
-        j["contents"] = x.get_contents();
-        j["description"] = x.get_description();
-        j["encoding"] = x.get_encoding();
-        j["hashes"] = x.get_hashes();
-        j["lastModifiedTimeUtc"] = x.get_last_modified_time_utc();
-        j["length"] = x.get_length();
-        j["location"] = x.get_location();
-        j["mimeType"] = x.get_mime_type();
-        j["offset"] = x.get_offset();
-        j["parentIndex"] = x.get_parent_index();
-        j["properties"] = x.get_properties();
-        j["roles"] = x.get_roles();
-        j["sourceLanguage"] = x.get_source_language();
-    }
-
-    inline void from_json(const json & j, SARIF::ReportingConfiguration& x) {
-        x.set_enabled(SARIF::get_optional<bool>(j, "enabled"));
-        x.set_level(SARIF::get_optional<SARIF::Level>(j, "level"));
-        x.set_parameters(SARIF::get_optional<SARIF::PropertyBag>(j, "parameters"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-        x.set_rank(SARIF::get_optional<double>(j, "rank"));
-    }
-
-    inline void to_json(json & j, const SARIF::ReportingConfiguration & x) {
-        j = json::object();
-        j["enabled"] = x.get_enabled();
-        j["level"] = x.get_level();
-        j["parameters"] = x.get_parameters();
-        j["properties"] = x.get_properties();
-        j["rank"] = x.get_rank();
-    }
-
-    inline void from_json(const json & j, SARIF::ToolComponentReference& x) {
-        x.set_guid(SARIF::get_optional<std::string>(j, "guid"));
-        x.set_index(SARIF::get_optional<int64_t>(j, "index"));
-        x.set_name(SARIF::get_optional<std::string>(j, "name"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-    }
-
-    inline void to_json(json & j, const SARIF::ToolComponentReference & x) {
-        j = json::object();
-        j["guid"] = x.get_guid();
-        j["index"] = x.get_index();
-        j["name"] = x.get_name();
-        j["properties"] = x.get_properties();
-    }
-
-    inline void from_json(const json & j, SARIF::ReportingDescriptorReference& x) {
-        x.set_guid(SARIF::get_optional<std::string>(j, "guid"));
-        x.set_id(SARIF::get_optional<std::string>(j, "id"));
-        x.set_index(SARIF::get_optional<int64_t>(j, "index"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-        x.set_tool_component(SARIF::get_optional<SARIF::ToolComponentReference>(j, "toolComponent"));
-    }
-
-    inline void to_json(json & j, const SARIF::ReportingDescriptorReference & x) {
-        j = json::object();
-        j["guid"] = x.get_guid();
-        j["id"] = x.get_id();
-        j["index"] = x.get_index();
-        j["properties"] = x.get_properties();
-        j["toolComponent"] = x.get_tool_component();
-    }
-
-    inline void from_json(const json & j, SARIF::ConfigurationOverride& x) {
-        x.set_configuration(j.at("configuration").get<SARIF::ReportingConfiguration>());
-        x.set_descriptor(j.at("descriptor").get<SARIF::ReportingDescriptorReference>());
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-    }
-
-    inline void to_json(json & j, const SARIF::ConfigurationOverride & x) {
-        j = json::object();
-        j["configuration"] = x.get_configuration();
-        j["descriptor"] = x.get_descriptor();
-        j["properties"] = x.get_properties();
-    }
-
-    inline void from_json(const json & j, SARIF::Region& x) {
-        x.set_byte_length(SARIF::get_optional<int64_t>(j, "byteLength"));
-        x.set_byte_offset(SARIF::get_optional<int64_t>(j, "byteOffset"));
-        x.set_char_length(SARIF::get_optional<int64_t>(j, "charLength"));
-        x.set_char_offset(SARIF::get_optional<int64_t>(j, "charOffset"));
-        x.set_end_column(SARIF::get_optional<int64_t>(j, "endColumn"));
-        x.set_end_line(SARIF::get_optional<int64_t>(j, "endLine"));
-        x.set_message(SARIF::get_optional<SARIF::Message>(j, "message"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-        x.set_snippet(SARIF::get_optional<SARIF::ArtifactContent>(j, "snippet"));
-        x.set_source_language(SARIF::get_optional<std::string>(j, "sourceLanguage"));
-        x.set_start_column(SARIF::get_optional<int64_t>(j, "startColumn"));
-        x.set_start_line(SARIF::get_optional<int64_t>(j, "startLine"));
-    }
-
-    inline void to_json(json & j, const SARIF::Region & x) {
-        j = json::object();
-        j["byteLength"] = x.get_byte_length();
-        j["byteOffset"] = x.get_byte_offset();
-        j["charLength"] = x.get_char_length();
-        j["charOffset"] = x.get_char_offset();
-        j["endColumn"] = x.get_end_column();
-        j["endLine"] = x.get_end_line();
-        j["message"] = x.get_message();
-        j["properties"] = x.get_properties();
-        j["snippet"] = x.get_snippet();
-        j["sourceLanguage"] = x.get_source_language();
-        j["startColumn"] = x.get_start_column();
-        j["startLine"] = x.get_start_line();
-    }
-
-    inline void from_json(const json & j, SARIF::LogicalLocation& x) {
-        x.set_decorated_name(SARIF::get_optional<std::string>(j, "decoratedName"));
-        x.set_fully_qualified_name(SARIF::get_optional<std::string>(j, "fullyQualifiedName"));
-        x.set_index(SARIF::get_optional<int64_t>(j, "index"));
-        x.set_kind(SARIF::get_optional<std::string>(j, "kind"));
-        x.set_name(SARIF::get_optional<std::string>(j, "name"));
-        x.set_parent_index(SARIF::get_optional<int64_t>(j, "parentIndex"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-    }
-
-    inline void to_json(json & j, const SARIF::LogicalLocation & x) {
-        j = json::object();
-        j["decoratedName"] = x.get_decorated_name();
-        j["fullyQualifiedName"] = x.get_fully_qualified_name();
-        j["index"] = x.get_index();
-        j["kind"] = x.get_kind();
-        j["name"] = x.get_name();
-        j["parentIndex"] = x.get_parent_index();
-        j["properties"] = x.get_properties();
-    }
-
-    inline void from_json(const json & j, SARIF::PhysicalLocation& x) {
-        x.set_address(SARIF::get_optional<SARIF::Address>(j, "address"));
-        x.set_artifact_location(SARIF::get_optional<SARIF::ArtifactLocation>(j, "artifactLocation"));
-        x.set_context_region(SARIF::get_optional<SARIF::Region>(j, "contextRegion"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-        x.set_region(SARIF::get_optional<SARIF::Region>(j, "region"));
-    }
-
-    inline void to_json(json & j, const SARIF::PhysicalLocation & x) {
-        j = json::object();
-        j["address"] = x.get_address();
-        j["artifactLocation"] = x.get_artifact_location();
-        j["contextRegion"] = x.get_context_region();
-        j["properties"] = x.get_properties();
-        j["region"] = x.get_region();
-    }
-
-    inline void from_json(const json & j, SARIF::LocationRelationship& x) {
-        x.set_description(SARIF::get_optional<SARIF::Message>(j, "description"));
-        x.set_kinds(SARIF::get_optional<std::vector<std::string>>(j, "kinds"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-        x.set_target(j.at("target").get<int64_t>());
-    }
-
-    inline void to_json(json & j, const SARIF::LocationRelationship & x) {
-        j = json::object();
-        j["description"] = x.get_description();
-        j["kinds"] = x.get_kinds();
-        j["properties"] = x.get_properties();
-        j["target"] = x.get_target();
-    }
-
-    inline void from_json(const json & j, SARIF::Location& x) {
-        x.set_annotations(SARIF::get_optional<std::vector<SARIF::Region>>(j, "annotations"));
-        x.set_id(SARIF::get_optional<int64_t>(j, "id"));
-        x.set_logical_locations(SARIF::get_optional<std::vector<SARIF::LogicalLocation>>(j, "logicalLocations"));
-        x.set_message(SARIF::get_optional<SARIF::Message>(j, "message"));
-        x.set_physical_location(SARIF::get_optional<SARIF::PhysicalLocation>(j, "physicalLocation"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-        x.set_relationships(SARIF::get_optional<std::vector<SARIF::LocationRelationship>>(j, "relationships"));
-    }
-
-    inline void to_json(json & j, const SARIF::Location & x) {
-        j = json::object();
-        j["annotations"] = x.get_annotations();
-        j["id"] = x.get_id();
-        j["logicalLocations"] = x.get_logical_locations();
-        j["message"] = x.get_message();
-        j["physicalLocation"] = x.get_physical_location();
-        j["properties"] = x.get_properties();
-        j["relationships"] = x.get_relationships();
-    }
-
-    inline void from_json(const json & j, SARIF::StackFrame& x) {
-        x.set_location(SARIF::get_optional<SARIF::Location>(j, "location"));
-        x.set_stack_frame_module(SARIF::get_optional<std::string>(j, "module"));
-        x.set_parameters(SARIF::get_optional<std::vector<std::string>>(j, "parameters"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-        x.set_thread_id(SARIF::get_optional<int64_t>(j, "threadId"));
-    }
-
-    inline void to_json(json & j, const SARIF::StackFrame & x) {
-        j = json::object();
-        j["location"] = x.get_location();
-        j["module"] = x.get_stack_frame_module();
-        j["parameters"] = x.get_parameters();
-        j["properties"] = x.get_properties();
-        j["threadId"] = x.get_thread_id();
-    }
-
-    inline void from_json(const json & j, SARIF::Stack& x) {
-        x.set_frames(j.at("frames").get<std::vector<SARIF::StackFrame>>());
-        x.set_message(SARIF::get_optional<SARIF::Message>(j, "message"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-    }
-
-    inline void to_json(json & j, const SARIF::Stack & x) {
-        j = json::object();
-        j["frames"] = x.get_frames();
-        j["message"] = x.get_message();
-        j["properties"] = x.get_properties();
-    }
-
-    inline void from_json(const json & j, SARIF::Exception& x) {
-        x.set_inner_exceptions(SARIF::get_optional<std::vector<SARIF::Exception>>(j, "innerExceptions"));
-        x.set_kind(SARIF::get_optional<std::string>(j, "kind"));
-        x.set_message(SARIF::get_optional<std::string>(j, "message"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-        x.set_stack(SARIF::get_optional<SARIF::Stack>(j, "stack"));
-    }
-
-    inline void to_json(json & j, const SARIF::Exception & x) {
-        j = json::object();
-        j["innerExceptions"] = x.get_inner_exceptions();
-        j["kind"] = x.get_kind();
-        j["message"] = x.get_message();
-        j["properties"] = x.get_properties();
-        j["stack"] = x.get_stack();
-    }
-
-    inline void from_json(const json & j, SARIF::Notification& x) {
-        x.set_associated_rule(SARIF::get_optional<SARIF::ReportingDescriptorReference>(j, "associatedRule"));
-        x.set_descriptor(SARIF::get_optional<SARIF::ReportingDescriptorReference>(j, "descriptor"));
-        x.set_exception(SARIF::get_optional<SARIF::Exception>(j, "exception"));
-        x.set_level(SARIF::get_optional<SARIF::Level>(j, "level"));
-        x.set_locations(SARIF::get_optional<std::vector<SARIF::Location>>(j, "locations"));
-        x.set_message(j.at("message").get<SARIF::Message>());
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-        x.set_thread_id(SARIF::get_optional<int64_t>(j, "threadId"));
-        x.set_time_utc(SARIF::get_optional<std::string>(j, "timeUtc"));
-    }
-
-    inline void to_json(json & j, const SARIF::Notification & x) {
-        j = json::object();
-        j["associatedRule"] = x.get_associated_rule();
-        j["descriptor"] = x.get_descriptor();
-        j["exception"] = x.get_exception();
-        j["level"] = x.get_level();
-        j["locations"] = x.get_locations();
-        j["message"] = x.get_message();
-        j["properties"] = x.get_properties();
-        j["threadId"] = x.get_thread_id();
-        j["timeUtc"] = x.get_time_utc();
-    }
-
-    inline void from_json(const json & j, SARIF::Invocation& x) {
-        x.set_account(SARIF::get_optional<std::string>(j, "account"));
-        x.set_arguments(SARIF::get_optional<std::vector<std::string>>(j, "arguments"));
-        x.set_command_line(SARIF::get_optional<std::string>(j, "commandLine"));
-        x.set_end_time_utc(SARIF::get_optional<std::string>(j, "endTimeUtc"));
-        x.set_environment_variables(SARIF::get_optional<std::map<std::string, std::string>>(j, "environmentVariables"));
-        x.set_executable_location(SARIF::get_optional<SARIF::ArtifactLocation>(j, "executableLocation"));
-        x.set_execution_successful(j.at("executionSuccessful").get<bool>());
-        x.set_exit_code(SARIF::get_optional<int64_t>(j, "exitCode"));
-        x.set_exit_code_description(SARIF::get_optional<std::string>(j, "exitCodeDescription"));
-        x.set_exit_signal_name(SARIF::get_optional<std::string>(j, "exitSignalName"));
-        x.set_exit_signal_number(SARIF::get_optional<int64_t>(j, "exitSignalNumber"));
-        x.set_machine(SARIF::get_optional<std::string>(j, "machine"));
-        x.set_notification_configuration_overrides(SARIF::get_optional<std::vector<SARIF::ConfigurationOverride>>(j, "notificationConfigurationOverrides"));
-        x.set_process_id(SARIF::get_optional<int64_t>(j, "processId"));
-        x.set_process_start_failure_message(SARIF::get_optional<std::string>(j, "processStartFailureMessage"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-        x.set_response_files(SARIF::get_optional<std::vector<SARIF::ArtifactLocation>>(j, "responseFiles"));
-        x.set_rule_configuration_overrides(SARIF::get_optional<std::vector<SARIF::ConfigurationOverride>>(j, "ruleConfigurationOverrides"));
-        x.set_start_time_utc(SARIF::get_optional<std::string>(j, "startTimeUtc"));
-        x.set_stderr(SARIF::get_optional<SARIF::ArtifactLocation>(j, "stderr"));
-        x.set_stdin(SARIF::get_optional<SARIF::ArtifactLocation>(j, "stdin"));
-        x.set_stdout(SARIF::get_optional<SARIF::ArtifactLocation>(j, "stdout"));
-        x.set_stdout_stderr(SARIF::get_optional<SARIF::ArtifactLocation>(j, "stdoutStderr"));
-        x.set_tool_configuration_notifications(SARIF::get_optional<std::vector<SARIF::Notification>>(j, "toolConfigurationNotifications"));
-        x.set_tool_execution_notifications(SARIF::get_optional<std::vector<SARIF::Notification>>(j, "toolExecutionNotifications"));
-        x.set_working_directory(SARIF::get_optional<SARIF::ArtifactLocation>(j, "workingDirectory"));
-    }
-
-    inline void to_json(json & j, const SARIF::Invocation & x) {
-        j = json::object();
-        j["account"] = x.get_account();
-        j["arguments"] = x.get_arguments();
-        j["commandLine"] = x.get_command_line();
-        j["endTimeUtc"] = x.get_end_time_utc();
-        j["environmentVariables"] = x.get_environment_variables();
-        j["executableLocation"] = x.get_executable_location();
-        j["executionSuccessful"] = x.get_execution_successful();
-        j["exitCode"] = x.get_exit_code();
-        j["exitCodeDescription"] = x.get_exit_code_description();
-        j["exitSignalName"] = x.get_exit_signal_name();
-        j["exitSignalNumber"] = x.get_exit_signal_number();
-        j["machine"] = x.get_machine();
-        j["notificationConfigurationOverrides"] = x.get_notification_configuration_overrides();
-        j["processId"] = x.get_process_id();
-        j["processStartFailureMessage"] = x.get_process_start_failure_message();
-        j["properties"] = x.get_properties();
-        j["responseFiles"] = x.get_response_files();
-        j["ruleConfigurationOverrides"] = x.get_rule_configuration_overrides();
-        j["startTimeUtc"] = x.get_start_time_utc();
-        j["stderr"] = x.get_stderr();
-        j["stdin"] = x.get_stdin();
-        j["stdout"] = x.get_stdout();
-        j["stdoutStderr"] = x.get_stdout_stderr();
-        j["toolConfigurationNotifications"] = x.get_tool_configuration_notifications();
-        j["toolExecutionNotifications"] = x.get_tool_execution_notifications();
-        j["workingDirectory"] = x.get_working_directory();
-    }
-
-    inline void from_json(const json & j, SARIF::ReportingDescriptorRelationship& x) {
-        x.set_description(SARIF::get_optional<SARIF::Message>(j, "description"));
-        x.set_kinds(SARIF::get_optional<std::vector<std::string>>(j, "kinds"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-        x.set_target(j.at("target").get<SARIF::ReportingDescriptorReference>());
-    }
-
-    inline void to_json(json & j, const SARIF::ReportingDescriptorRelationship & x) {
-        j = json::object();
-        j["description"] = x.get_description();
-        j["kinds"] = x.get_kinds();
-        j["properties"] = x.get_properties();
-        j["target"] = x.get_target();
-    }
-
-    inline void from_json(const json & j, SARIF::ReportingDescriptor& x) {
-        x.set_default_configuration(SARIF::get_optional<SARIF::ReportingConfiguration>(j, "defaultConfiguration"));
-        x.set_deprecated_guids(SARIF::get_optional<std::vector<std::string>>(j, "deprecatedGuids"));
-        x.set_deprecated_ids(SARIF::get_optional<std::vector<std::string>>(j, "deprecatedIds"));
-        x.set_deprecated_names(SARIF::get_optional<std::vector<std::string>>(j, "deprecatedNames"));
-        x.set_full_description(SARIF::get_optional<SARIF::MultiformatMessageString>(j, "fullDescription"));
-        x.set_guid(SARIF::get_optional<std::string>(j, "guid"));
-        x.set_help(SARIF::get_optional<SARIF::MultiformatMessageString>(j, "help"));
-        x.set_help_uri(SARIF::get_optional<std::string>(j, "helpUri"));
-        x.set_id(j.at("id").get<std::string>());
-        x.set_message_strings(SARIF::get_optional<std::map<std::string, SARIF::MultiformatMessageString>>(j, "messageStrings"));
-        x.set_name(SARIF::get_optional<std::string>(j, "name"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-        x.set_relationships(SARIF::get_optional<std::vector<SARIF::ReportingDescriptorRelationship>>(j, "relationships"));
-        x.set_short_description(SARIF::get_optional<SARIF::MultiformatMessageString>(j, "shortDescription"));
-    }
-
-    inline void to_json(json & j, const SARIF::ReportingDescriptor & x) {
-        j = json::object();
-        j["defaultConfiguration"] = x.get_default_configuration();
-        j["deprecatedGuids"] = x.get_deprecated_guids();
-        j["deprecatedIds"] = x.get_deprecated_ids();
-        j["deprecatedNames"] = x.get_deprecated_names();
-        j["fullDescription"] = x.get_full_description();
-        j["guid"] = x.get_guid();
-        j["help"] = x.get_help();
-        j["helpUri"] = x.get_help_uri();
-        j["id"] = x.get_id();
-        j["messageStrings"] = x.get_message_strings();
-        j["name"] = x.get_name();
-        j["properties"] = x.get_properties();
-        j["relationships"] = x.get_relationships();
-        j["shortDescription"] = x.get_short_description();
-    }
-
-    inline void from_json(const json & j, SARIF::TranslationMetadata& x) {
-        x.set_download_uri(SARIF::get_optional<std::string>(j, "downloadUri"));
-        x.set_full_description(SARIF::get_optional<SARIF::MultiformatMessageString>(j, "fullDescription"));
-        x.set_full_name(SARIF::get_optional<std::string>(j, "fullName"));
-        x.set_information_uri(SARIF::get_optional<std::string>(j, "informationUri"));
-        x.set_name(j.at("name").get<std::string>());
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-        x.set_short_description(SARIF::get_optional<SARIF::MultiformatMessageString>(j, "shortDescription"));
-    }
-
-    inline void to_json(json & j, const SARIF::TranslationMetadata & x) {
-        j = json::object();
-        j["downloadUri"] = x.get_download_uri();
-        j["fullDescription"] = x.get_full_description();
-        j["fullName"] = x.get_full_name();
-        j["informationUri"] = x.get_information_uri();
-        j["name"] = x.get_name();
-        j["properties"] = x.get_properties();
-        j["shortDescription"] = x.get_short_description();
-    }
-
-    inline void from_json(const json & j, SARIF::ToolComponent& x) {
-        x.set_associated_component(SARIF::get_optional<SARIF::ToolComponentReference>(j, "associatedComponent"));
-        x.set_contents(SARIF::get_optional<std::vector<SARIF::Content>>(j, "contents"));
-        x.set_dotted_quad_file_version(SARIF::get_optional<std::string>(j, "dottedQuadFileVersion"));
-        x.set_download_uri(SARIF::get_optional<std::string>(j, "downloadUri"));
-        x.set_full_description(SARIF::get_optional<SARIF::MultiformatMessageString>(j, "fullDescription"));
-        x.set_full_name(SARIF::get_optional<std::string>(j, "fullName"));
-        x.set_global_message_strings(SARIF::get_optional<std::map<std::string, SARIF::MultiformatMessageString>>(j, "globalMessageStrings"));
-        x.set_guid(SARIF::get_optional<std::string>(j, "guid"));
-        x.set_information_uri(SARIF::get_optional<std::string>(j, "informationUri"));
-        x.set_is_comprehensive(SARIF::get_optional<bool>(j, "isComprehensive"));
-        x.set_language(SARIF::get_optional<std::string>(j, "language"));
-        x.set_localized_data_semantic_version(SARIF::get_optional<std::string>(j, "localizedDataSemanticVersion"));
-        x.set_locations(SARIF::get_optional<std::vector<SARIF::ArtifactLocation>>(j, "locations"));
-        x.set_minimum_required_localized_data_semantic_version(SARIF::get_optional<std::string>(j, "minimumRequiredLocalizedDataSemanticVersion"));
-        x.set_name(j.at("name").get<std::string>());
-        x.set_notifications(SARIF::get_optional<std::vector<SARIF::ReportingDescriptor>>(j, "notifications"));
-        x.set_organization(SARIF::get_optional<std::string>(j, "organization"));
-        x.set_product(SARIF::get_optional<std::string>(j, "product"));
-        x.set_product_suite(SARIF::get_optional<std::string>(j, "productSuite"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-        x.set_release_date_utc(SARIF::get_optional<std::string>(j, "releaseDateUtc"));
-        x.set_rules(SARIF::get_optional<std::vector<SARIF::ReportingDescriptor>>(j, "rules"));
-        x.set_semantic_version(SARIF::get_optional<std::string>(j, "semanticVersion"));
-        x.set_short_description(SARIF::get_optional<SARIF::MultiformatMessageString>(j, "shortDescription"));
-        x.set_supported_taxonomies(SARIF::get_optional<std::vector<SARIF::ToolComponentReference>>(j, "supportedTaxonomies"));
-        x.set_taxa(SARIF::get_optional<std::vector<SARIF::ReportingDescriptor>>(j, "taxa"));
-        x.set_translation_metadata(SARIF::get_optional<SARIF::TranslationMetadata>(j, "translationMetadata"));
-        x.set_version(SARIF::get_optional<std::string>(j, "version"));
-    }
-
-    inline void to_json(json & j, const SARIF::ToolComponent & x) {
-        j = json::object();
-        j["associatedComponent"] = x.get_associated_component();
-        j["contents"] = x.get_contents();
-        j["dottedQuadFileVersion"] = x.get_dotted_quad_file_version();
-        j["downloadUri"] = x.get_download_uri();
-        j["fullDescription"] = x.get_full_description();
-        j["fullName"] = x.get_full_name();
-        j["globalMessageStrings"] = x.get_global_message_strings();
-        j["guid"] = x.get_guid();
-        j["informationUri"] = x.get_information_uri();
-        j["isComprehensive"] = x.get_is_comprehensive();
-        j["language"] = x.get_language();
-        j["localizedDataSemanticVersion"] = x.get_localized_data_semantic_version();
-        j["locations"] = x.get_locations();
-        j["minimumRequiredLocalizedDataSemanticVersion"] = x.get_minimum_required_localized_data_semantic_version();
-        j["name"] = x.get_name();
-        j["notifications"] = x.get_notifications();
-        j["organization"] = x.get_organization();
-        j["product"] = x.get_product();
-        j["productSuite"] = x.get_product_suite();
-        j["properties"] = x.get_properties();
-        j["releaseDateUtc"] = x.get_release_date_utc();
-        j["rules"] = x.get_rules();
-        j["semanticVersion"] = x.get_semantic_version();
-        j["shortDescription"] = x.get_short_description();
-        j["supportedTaxonomies"] = x.get_supported_taxonomies();
-        j["taxa"] = x.get_taxa();
-        j["translationMetadata"] = x.get_translation_metadata();
-        j["version"] = x.get_version();
-    }
-
-    inline void from_json(const json & j, SARIF::Tool& x) {
-        x.set_driver(j.at("driver").get<SARIF::ToolComponent>());
-        x.set_extensions(SARIF::get_optional<std::vector<SARIF::ToolComponent>>(j, "extensions"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-    }
-
-    inline void to_json(json & j, const SARIF::Tool & x) {
-        j = json::object();
-        j["driver"] = x.get_driver();
-        j["extensions"] = x.get_extensions();
-        j["properties"] = x.get_properties();
-    }
-
-    inline void from_json(const json & j, SARIF::Conversion& x) {
-        x.set_analysis_tool_log_files(SARIF::get_optional<std::vector<SARIF::ArtifactLocation>>(j, "analysisToolLogFiles"));
-        x.set_invocation(SARIF::get_optional<SARIF::Invocation>(j, "invocation"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-        x.set_tool(j.at("tool").get<SARIF::Tool>());
-    }
-
-    inline void to_json(json & j, const SARIF::Conversion & x) {
-        j = json::object();
-        j["analysisToolLogFiles"] = x.get_analysis_tool_log_files();
-        j["invocation"] = x.get_invocation();
-        j["properties"] = x.get_properties();
-        j["tool"] = x.get_tool();
-    }
-
-    inline void from_json(const json & j, SARIF::Edge& x) {
-        x.set_id(j.at("id").get<std::string>());
-        x.set_label(SARIF::get_optional<SARIF::Message>(j, "label"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-        x.set_source_node_id(j.at("sourceNodeId").get<std::string>());
-        x.set_target_node_id(j.at("targetNodeId").get<std::string>());
-    }
-
-    inline void to_json(json & j, const SARIF::Edge & x) {
-        j = json::object();
-        j["id"] = x.get_id();
-        j["label"] = x.get_label();
-        j["properties"] = x.get_properties();
-        j["sourceNodeId"] = x.get_source_node_id();
-        j["targetNodeId"] = x.get_target_node_id();
-    }
-
-    inline void from_json(const json & j, SARIF::Node& x) {
-        x.set_children(SARIF::get_optional<std::vector<SARIF::Node>>(j, "children"));
-        x.set_id(j.at("id").get<std::string>());
-        x.set_label(SARIF::get_optional<SARIF::Message>(j, "label"));
-        x.set_location(SARIF::get_optional<SARIF::Location>(j, "location"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-    }
-
-    inline void to_json(json & j, const SARIF::Node & x) {
-        j = json::object();
-        j["children"] = x.get_children();
-        j["id"] = x.get_id();
-        j["label"] = x.get_label();
-        j["location"] = x.get_location();
-        j["properties"] = x.get_properties();
-    }
-
-    inline void from_json(const json & j, SARIF::Graph& x) {
-        x.set_description(SARIF::get_optional<SARIF::Message>(j, "description"));
-        x.set_edges(SARIF::get_optional<std::vector<SARIF::Edge>>(j, "edges"));
-        x.set_nodes(SARIF::get_optional<std::vector<SARIF::Node>>(j, "nodes"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-    }
-
-    inline void to_json(json & j, const SARIF::Graph & x) {
-        j = json::object();
-        j["description"] = x.get_description();
-        j["edges"] = x.get_edges();
-        j["nodes"] = x.get_nodes();
-        j["properties"] = x.get_properties();
-    }
-
-    inline void from_json(const json & j, SARIF::Rectangle& x) {
-        x.set_bottom(SARIF::get_optional<double>(j, "bottom"));
-        x.set_left(SARIF::get_optional<double>(j, "left"));
-        x.set_message(SARIF::get_optional<SARIF::Message>(j, "message"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-        x.set_right(SARIF::get_optional<double>(j, "right"));
-        x.set_top(SARIF::get_optional<double>(j, "top"));
-    }
-
-    inline void to_json(json & j, const SARIF::Rectangle & x) {
-        j = json::object();
-        j["bottom"] = x.get_bottom();
-        j["left"] = x.get_left();
-        j["message"] = x.get_message();
-        j["properties"] = x.get_properties();
-        j["right"] = x.get_right();
-        j["top"] = x.get_top();
-    }
-
-    inline void from_json(const json & j, SARIF::Attachment& x) {
-        x.set_artifact_location(j.at("artifactLocation").get<SARIF::ArtifactLocation>());
-        x.set_description(SARIF::get_optional<SARIF::Message>(j, "description"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-        x.set_rectangles(SARIF::get_optional<std::vector<SARIF::Rectangle>>(j, "rectangles"));
-        x.set_regions(SARIF::get_optional<std::vector<SARIF::Region>>(j, "regions"));
-    }
-
-    inline void to_json(json & j, const SARIF::Attachment & x) {
-        j = json::object();
-        j["artifactLocation"] = x.get_artifact_location();
-        j["description"] = x.get_description();
-        j["properties"] = x.get_properties();
-        j["rectangles"] = x.get_rectangles();
-        j["regions"] = x.get_regions();
-    }
-
-    inline void from_json(const json & j, SARIF::WebRequest& x) {
-        x.set_body(SARIF::get_optional<SARIF::ArtifactContent>(j, "body"));
-        x.set_headers(SARIF::get_optional<std::map<std::string, std::string>>(j, "headers"));
-        x.set_index(SARIF::get_optional<int64_t>(j, "index"));
-        x.set_method(SARIF::get_optional<std::string>(j, "method"));
-        x.set_parameters(SARIF::get_optional<std::map<std::string, std::string>>(j, "parameters"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-        x.set_protocol(SARIF::get_optional<std::string>(j, "protocol"));
-        x.set_target(SARIF::get_optional<std::string>(j, "target"));
-        x.set_version(SARIF::get_optional<std::string>(j, "version"));
-    }
-
-    inline void to_json(json & j, const SARIF::WebRequest & x) {
-        j = json::object();
-        j["body"] = x.get_body();
-        j["headers"] = x.get_headers();
-        j["index"] = x.get_index();
-        j["method"] = x.get_method();
-        j["parameters"] = x.get_parameters();
-        j["properties"] = x.get_properties();
-        j["protocol"] = x.get_protocol();
-        j["target"] = x.get_target();
-        j["version"] = x.get_version();
-    }
-
-    inline void from_json(const json & j, SARIF::WebResponse& x) {
-        x.set_body(SARIF::get_optional<SARIF::ArtifactContent>(j, "body"));
-        x.set_headers(SARIF::get_optional<std::map<std::string, std::string>>(j, "headers"));
-        x.set_index(SARIF::get_optional<int64_t>(j, "index"));
-        x.set_no_response_received(SARIF::get_optional<bool>(j, "noResponseReceived"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-        x.set_protocol(SARIF::get_optional<std::string>(j, "protocol"));
-        x.set_reason_phrase(SARIF::get_optional<std::string>(j, "reasonPhrase"));
-        x.set_status_code(SARIF::get_optional<int64_t>(j, "statusCode"));
-        x.set_version(SARIF::get_optional<std::string>(j, "version"));
-    }
-
-    inline void to_json(json & j, const SARIF::WebResponse & x) {
-        j = json::object();
-        j["body"] = x.get_body();
-        j["headers"] = x.get_headers();
-        j["index"] = x.get_index();
-        j["noResponseReceived"] = x.get_no_response_received();
-        j["properties"] = x.get_properties();
-        j["protocol"] = x.get_protocol();
-        j["reasonPhrase"] = x.get_reason_phrase();
-        j["statusCode"] = x.get_status_code();
-        j["version"] = x.get_version();
-    }
-
-    inline void from_json(const json & j, SARIF::ThreadFlowLocation& x) {
-        x.set_execution_order(SARIF::get_optional<int64_t>(j, "executionOrder"));
-        x.set_execution_time_utc(SARIF::get_optional<std::string>(j, "executionTimeUtc"));
-        x.set_importance(SARIF::get_optional<SARIF::Importance>(j, "importance"));
-        x.set_index(SARIF::get_optional<int64_t>(j, "index"));
-        x.set_kinds(SARIF::get_optional<std::vector<std::string>>(j, "kinds"));
-        x.set_location(SARIF::get_optional<SARIF::Location>(j, "location"));
-        x.set_thread_flow_location_module(SARIF::get_optional<std::string>(j, "module"));
-        x.set_nesting_level(SARIF::get_optional<int64_t>(j, "nestingLevel"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-        x.set_stack(SARIF::get_optional<SARIF::Stack>(j, "stack"));
-        x.set_state(SARIF::get_optional<std::map<std::string, SARIF::MultiformatMessageString>>(j, "state"));
-        x.set_taxa(SARIF::get_optional<std::vector<SARIF::ReportingDescriptorReference>>(j, "taxa"));
-        x.set_web_request(SARIF::get_optional<SARIF::WebRequest>(j, "webRequest"));
-        x.set_web_response(SARIF::get_optional<SARIF::WebResponse>(j, "webResponse"));
-    }
-
-    inline void to_json(json & j, const SARIF::ThreadFlowLocation & x) {
-        j = json::object();
-        j["executionOrder"] = x.get_execution_order();
-        j["executionTimeUtc"] = x.get_execution_time_utc();
-        j["importance"] = x.get_importance();
-        j["index"] = x.get_index();
-        j["kinds"] = x.get_kinds();
-        j["location"] = x.get_location();
-        j["module"] = x.get_thread_flow_location_module();
-        j["nestingLevel"] = x.get_nesting_level();
-        j["properties"] = x.get_properties();
-        j["stack"] = x.get_stack();
-        j["state"] = x.get_state();
-        j["taxa"] = x.get_taxa();
-        j["webRequest"] = x.get_web_request();
-        j["webResponse"] = x.get_web_response();
-    }
-
-    inline void from_json(const json & j, SARIF::ThreadFlow& x) {
-        x.set_id(SARIF::get_optional<std::string>(j, "id"));
-        x.set_immutable_state(SARIF::get_optional<std::map<std::string, SARIF::MultiformatMessageString>>(j, "immutableState"));
-        x.set_initial_state(SARIF::get_optional<std::map<std::string, SARIF::MultiformatMessageString>>(j, "initialState"));
-        x.set_locations(j.at("locations").get<std::vector<SARIF::ThreadFlowLocation>>());
-        x.set_message(SARIF::get_optional<SARIF::Message>(j, "message"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-    }
-
-    inline void to_json(json & j, const SARIF::ThreadFlow & x) {
-        j = json::object();
-        j["id"] = x.get_id();
-        j["immutableState"] = x.get_immutable_state();
-        j["initialState"] = x.get_initial_state();
-        j["locations"] = x.get_locations();
-        j["message"] = x.get_message();
-        j["properties"] = x.get_properties();
-    }
-
-    inline void from_json(const json & j, SARIF::CodeFlow& x) {
-        x.set_message(SARIF::get_optional<SARIF::Message>(j, "message"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-        x.set_thread_flows(j.at("threadFlows").get<std::vector<SARIF::ThreadFlow>>());
-    }
-
-    inline void to_json(json & j, const SARIF::CodeFlow & x) {
-        j = json::object();
-        j["message"] = x.get_message();
-        j["properties"] = x.get_properties();
-        j["threadFlows"] = x.get_thread_flows();
-    }
-
-    inline void from_json(const json & j, SARIF::Replacement& x) {
-        x.set_deleted_region(j.at("deletedRegion").get<SARIF::Region>());
-        x.set_inserted_content(SARIF::get_optional<SARIF::ArtifactContent>(j, "insertedContent"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-    }
-
-    inline void to_json(json & j, const SARIF::Replacement & x) {
-        j = json::object();
-        j["deletedRegion"] = x.get_deleted_region();
-        j["insertedContent"] = x.get_inserted_content();
-        j["properties"] = x.get_properties();
-    }
-
-    inline void from_json(const json & j, SARIF::ArtifactChange& x) {
-        x.set_artifact_location(j.at("artifactLocation").get<SARIF::ArtifactLocation>());
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-        x.set_replacements(j.at("replacements").get<std::vector<SARIF::Replacement>>());
-    }
-
-    inline void to_json(json & j, const SARIF::ArtifactChange & x) {
-        j = json::object();
-        j["artifactLocation"] = x.get_artifact_location();
-        j["properties"] = x.get_properties();
-        j["replacements"] = x.get_replacements();
-    }
-
-    inline void from_json(const json & j, SARIF::Fix& x) {
-        x.set_artifact_changes(j.at("artifactChanges").get<std::vector<SARIF::ArtifactChange>>());
-        x.set_description(SARIF::get_optional<SARIF::Message>(j, "description"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-    }
-
-    inline void to_json(json & j, const SARIF::Fix & x) {
-        j = json::object();
-        j["artifactChanges"] = x.get_artifact_changes();
-        j["description"] = x.get_description();
-        j["properties"] = x.get_properties();
-    }
-
-    inline void from_json(const json & j, SARIF::EdgeTraversal& x) {
-        x.set_edge_id(j.at("edgeId").get<std::string>());
-        x.set_final_state(SARIF::get_optional<std::map<std::string, SARIF::MultiformatMessageString>>(j, "finalState"));
-        x.set_message(SARIF::get_optional<SARIF::Message>(j, "message"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-        x.set_step_over_edge_count(SARIF::get_optional<int64_t>(j, "stepOverEdgeCount"));
-    }
-
-    inline void to_json(json & j, const SARIF::EdgeTraversal & x) {
-        j = json::object();
-        j["edgeId"] = x.get_edge_id();
-        j["finalState"] = x.get_final_state();
-        j["message"] = x.get_message();
-        j["properties"] = x.get_properties();
-        j["stepOverEdgeCount"] = x.get_step_over_edge_count();
-    }
-
-    inline void from_json(const json & j, SARIF::GraphTraversal& x) {
-        x.set_description(SARIF::get_optional<SARIF::Message>(j, "description"));
-        x.set_edge_traversals(SARIF::get_optional<std::vector<SARIF::EdgeTraversal>>(j, "edgeTraversals"));
-        x.set_immutable_state(SARIF::get_optional<std::map<std::string, SARIF::MultiformatMessageString>>(j, "immutableState"));
-        x.set_initial_state(SARIF::get_optional<std::map<std::string, SARIF::MultiformatMessageString>>(j, "initialState"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-        x.set_result_graph_index(SARIF::get_optional<int64_t>(j, "resultGraphIndex"));
-        x.set_run_graph_index(SARIF::get_optional<int64_t>(j, "runGraphIndex"));
-    }
-
-    inline void to_json(json & j, const SARIF::GraphTraversal & x) {
-        j = json::object();
-        j["description"] = x.get_description();
-        j["edgeTraversals"] = x.get_edge_traversals();
-        j["immutableState"] = x.get_immutable_state();
-        j["initialState"] = x.get_initial_state();
-        j["properties"] = x.get_properties();
-        j["resultGraphIndex"] = x.get_result_graph_index();
-        j["runGraphIndex"] = x.get_run_graph_index();
-    }
-
-    inline void from_json(const json & j, SARIF::ResultProvenance& x) {
-        x.set_conversion_sources(SARIF::get_optional<std::vector<SARIF::PhysicalLocation>>(j, "conversionSources"));
-        x.set_first_detection_run_guid(SARIF::get_optional<std::string>(j, "firstDetectionRunGuid"));
-        x.set_first_detection_time_utc(SARIF::get_optional<std::string>(j, "firstDetectionTimeUtc"));
-        x.set_invocation_index(SARIF::get_optional<int64_t>(j, "invocationIndex"));
-        x.set_last_detection_run_guid(SARIF::get_optional<std::string>(j, "lastDetectionRunGuid"));
-        x.set_last_detection_time_utc(SARIF::get_optional<std::string>(j, "lastDetectionTimeUtc"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-    }
-
-    inline void to_json(json & j, const SARIF::ResultProvenance & x) {
-        j = json::object();
-        j["conversionSources"] = x.get_conversion_sources();
-        j["firstDetectionRunGuid"] = x.get_first_detection_run_guid();
-        j["firstDetectionTimeUtc"] = x.get_first_detection_time_utc();
-        j["invocationIndex"] = x.get_invocation_index();
-        j["lastDetectionRunGuid"] = x.get_last_detection_run_guid();
-        j["lastDetectionTimeUtc"] = x.get_last_detection_time_utc();
-        j["properties"] = x.get_properties();
-    }
-
-    inline void from_json(const json & j, SARIF::Suppression& x) {
-        x.set_guid(SARIF::get_optional<std::string>(j, "guid"));
-        x.set_justification(SARIF::get_optional<std::string>(j, "justification"));
-        x.set_kind(j.at("kind").get<SARIF::SuppressionKind>());
-        x.set_location(SARIF::get_optional<SARIF::Location>(j, "location"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-        x.set_status(SARIF::get_optional<SARIF::Status>(j, "status"));
-    }
-
-    inline void to_json(json & j, const SARIF::Suppression & x) {
-        j = json::object();
-        j["guid"] = x.get_guid();
-        j["justification"] = x.get_justification();
-        j["kind"] = x.get_kind();
-        j["location"] = x.get_location();
-        j["properties"] = x.get_properties();
-        j["status"] = x.get_status();
-    }
-
-    inline void from_json(const json & j, SARIF::Result& x) {
-        x.set_analysis_target(SARIF::get_optional<SARIF::ArtifactLocation>(j, "analysisTarget"));
-        x.set_attachments(SARIF::get_optional<std::vector<SARIF::Attachment>>(j, "attachments"));
-        x.set_baseline_state(SARIF::get_optional<SARIF::BaselineState>(j, "baselineState"));
-        x.set_code_flows(SARIF::get_optional<std::vector<SARIF::CodeFlow>>(j, "codeFlows"));
-        x.set_correlation_guid(SARIF::get_optional<std::string>(j, "correlationGuid"));
-        x.set_fingerprints(SARIF::get_optional<std::map<std::string, std::string>>(j, "fingerprints"));
-        x.set_fixes(SARIF::get_optional<std::vector<SARIF::Fix>>(j, "fixes"));
-        x.set_graphs(SARIF::get_optional<std::vector<SARIF::Graph>>(j, "graphs"));
-        x.set_graph_traversals(SARIF::get_optional<std::vector<SARIF::GraphTraversal>>(j, "graphTraversals"));
-        x.set_guid(SARIF::get_optional<std::string>(j, "guid"));
-        x.set_hosted_viewer_uri(SARIF::get_optional<std::string>(j, "hostedViewerUri"));
-        x.set_kind(SARIF::get_optional<SARIF::ResultKind>(j, "kind"));
-        x.set_level(SARIF::get_optional<SARIF::Level>(j, "level"));
-        x.set_locations(SARIF::get_optional<std::vector<SARIF::Location>>(j, "locations"));
-        x.set_message(j.at("message").get<SARIF::Message>());
-        x.set_occurrence_count(SARIF::get_optional<int64_t>(j, "occurrenceCount"));
-        x.set_partial_fingerprints(SARIF::get_optional<std::map<std::string, std::string>>(j, "partialFingerprints"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-        x.set_provenance(SARIF::get_optional<SARIF::ResultProvenance>(j, "provenance"));
-        x.set_rank(SARIF::get_optional<double>(j, "rank"));
-        x.set_related_locations(SARIF::get_optional<std::vector<SARIF::Location>>(j, "relatedLocations"));
-        x.set_rule(SARIF::get_optional<SARIF::ReportingDescriptorReference>(j, "rule"));
-        x.set_rule_id(SARIF::get_optional<std::string>(j, "ruleId"));
-        x.set_rule_index(SARIF::get_optional<int64_t>(j, "ruleIndex"));
-        x.set_stacks(SARIF::get_optional<std::vector<SARIF::Stack>>(j, "stacks"));
-        x.set_suppressions(SARIF::get_optional<std::vector<SARIF::Suppression>>(j, "suppressions"));
-        x.set_taxa(SARIF::get_optional<std::vector<SARIF::ReportingDescriptorReference>>(j, "taxa"));
-        x.set_web_request(SARIF::get_optional<SARIF::WebRequest>(j, "webRequest"));
-        x.set_web_response(SARIF::get_optional<SARIF::WebResponse>(j, "webResponse"));
-        x.set_work_item_uris(SARIF::get_optional<std::vector<std::string>>(j, "workItemUris"));
-    }
-
-    inline void to_json(json & j, const SARIF::Result & x) {
-        j = json::object();
-        j["analysisTarget"] = x.get_analysis_target();
-        j["attachments"] = x.get_attachments();
-        j["baselineState"] = x.get_baseline_state();
-        j["codeFlows"] = x.get_code_flows();
-        j["correlationGuid"] = x.get_correlation_guid();
-        j["fingerprints"] = x.get_fingerprints();
-        j["fixes"] = x.get_fixes();
-        j["graphs"] = x.get_graphs();
-        j["graphTraversals"] = x.get_graph_traversals();
-        j["guid"] = x.get_guid();
-        j["hostedViewerUri"] = x.get_hosted_viewer_uri();
-        j["kind"] = x.get_kind();
-        j["level"] = x.get_level();
-        j["locations"] = x.get_locations();
-        j["message"] = x.get_message();
-        j["occurrenceCount"] = x.get_occurrence_count();
-        j["partialFingerprints"] = x.get_partial_fingerprints();
-        j["properties"] = x.get_properties();
-        j["provenance"] = x.get_provenance();
-        j["rank"] = x.get_rank();
-        j["relatedLocations"] = x.get_related_locations();
-        j["rule"] = x.get_rule();
-        j["ruleId"] = x.get_rule_id();
-        j["ruleIndex"] = x.get_rule_index();
-        j["stacks"] = x.get_stacks();
-        j["suppressions"] = x.get_suppressions();
-        j["taxa"] = x.get_taxa();
-        j["webRequest"] = x.get_web_request();
-        j["webResponse"] = x.get_web_response();
-        j["workItemUris"] = x.get_work_item_uris();
-    }
-
-    inline void from_json(const json & j, SARIF::ExternalProperties& x) {
-        x.set_addresses(SARIF::get_optional<std::vector<SARIF::Address>>(j, "addresses"));
-        x.set_artifacts(SARIF::get_optional<std::vector<SARIF::Artifact>>(j, "artifacts"));
-        x.set_conversion(SARIF::get_optional<SARIF::Conversion>(j, "conversion"));
-        x.set_driver(SARIF::get_optional<SARIF::ToolComponent>(j, "driver"));
-        x.set_extensions(SARIF::get_optional<std::vector<SARIF::ToolComponent>>(j, "extensions"));
-        x.set_externalized_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "externalizedProperties"));
-        x.set_graphs(SARIF::get_optional<std::vector<SARIF::Graph>>(j, "graphs"));
-        x.set_guid(SARIF::get_optional<std::string>(j, "guid"));
-        x.set_invocations(SARIF::get_optional<std::vector<SARIF::Invocation>>(j, "invocations"));
-        x.set_logical_locations(SARIF::get_optional<std::vector<SARIF::LogicalLocation>>(j, "logicalLocations"));
-        x.set_policies(SARIF::get_optional<std::vector<SARIF::ToolComponent>>(j, "policies"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-        x.set_results(SARIF::get_optional<std::vector<SARIF::Result>>(j, "results"));
-        x.set_run_guid(SARIF::get_optional<std::string>(j, "runGuid"));
-        x.set_schema(SARIF::get_optional<std::string>(j, "schema"));
-        x.set_taxonomies(SARIF::get_optional<std::vector<SARIF::ToolComponent>>(j, "taxonomies"));
-        x.set_thread_flow_locations(SARIF::get_optional<std::vector<SARIF::ThreadFlowLocation>>(j, "threadFlowLocations"));
-        x.set_translations(SARIF::get_optional<std::vector<SARIF::ToolComponent>>(j, "translations"));
-        x.set_version(SARIF::get_optional<SARIF::Version>(j, "version"));
-        x.set_web_requests(SARIF::get_optional<std::vector<SARIF::WebRequest>>(j, "webRequests"));
-        x.set_web_responses(SARIF::get_optional<std::vector<SARIF::WebResponse>>(j, "webResponses"));
-    }
-
-    inline void to_json(json & j, const SARIF::ExternalProperties & x) {
-        j = json::object();
-        j["addresses"] = x.get_addresses();
-        j["artifacts"] = x.get_artifacts();
-        j["conversion"] = x.get_conversion();
-        j["driver"] = x.get_driver();
-        j["extensions"] = x.get_extensions();
-        j["externalizedProperties"] = x.get_externalized_properties();
-        j["graphs"] = x.get_graphs();
-        j["guid"] = x.get_guid();
-        j["invocations"] = x.get_invocations();
-        j["logicalLocations"] = x.get_logical_locations();
-        j["policies"] = x.get_policies();
-        j["properties"] = x.get_properties();
-        j["results"] = x.get_results();
-        j["runGuid"] = x.get_run_guid();
-        j["schema"] = x.get_schema();
-        j["taxonomies"] = x.get_taxonomies();
-        j["threadFlowLocations"] = x.get_thread_flow_locations();
-        j["translations"] = x.get_translations();
-        j["version"] = x.get_version();
-        j["webRequests"] = x.get_web_requests();
-        j["webResponses"] = x.get_web_responses();
-    }
-
-    inline void from_json(const json & j, SARIF::RunAutomationDetails& x) {
-        x.set_correlation_guid(SARIF::get_optional<std::string>(j, "correlationGuid"));
-        x.set_description(SARIF::get_optional<SARIF::Message>(j, "description"));
-        x.set_guid(SARIF::get_optional<std::string>(j, "guid"));
-        x.set_id(SARIF::get_optional<std::string>(j, "id"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-    }
-
-    inline void to_json(json & j, const SARIF::RunAutomationDetails & x) {
-        j = json::object();
-        j["correlationGuid"] = x.get_correlation_guid();
-        j["description"] = x.get_description();
-        j["guid"] = x.get_guid();
-        j["id"] = x.get_id();
-        j["properties"] = x.get_properties();
-    }
-
-    inline void from_json(const json & j, SARIF::ExternalPropertyFileReference& x) {
-        x.set_guid(SARIF::get_optional<std::string>(j, "guid"));
-        x.set_item_count(SARIF::get_optional<int64_t>(j, "itemCount"));
-        x.set_location(SARIF::get_optional<SARIF::ArtifactLocation>(j, "location"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-    }
-
-    inline void to_json(json & j, const SARIF::ExternalPropertyFileReference & x) {
-        j = json::object();
-        j["guid"] = x.get_guid();
-        j["itemCount"] = x.get_item_count();
-        j["location"] = x.get_location();
-        j["properties"] = x.get_properties();
-    }
-
-    inline void from_json(const json & j, SARIF::ExternalPropertyFileReferences& x) {
-        x.set_addresses(SARIF::get_optional<std::vector<SARIF::ExternalPropertyFileReference>>(j, "addresses"));
-        x.set_artifacts(SARIF::get_optional<std::vector<SARIF::ExternalPropertyFileReference>>(j, "artifacts"));
-        x.set_conversion(SARIF::get_optional<SARIF::ExternalPropertyFileReference>(j, "conversion"));
-        x.set_driver(SARIF::get_optional<SARIF::ExternalPropertyFileReference>(j, "driver"));
-        x.set_extensions(SARIF::get_optional<std::vector<SARIF::ExternalPropertyFileReference>>(j, "extensions"));
-        x.set_externalized_properties(SARIF::get_optional<SARIF::ExternalPropertyFileReference>(j, "externalizedProperties"));
-        x.set_graphs(SARIF::get_optional<std::vector<SARIF::ExternalPropertyFileReference>>(j, "graphs"));
-        x.set_invocations(SARIF::get_optional<std::vector<SARIF::ExternalPropertyFileReference>>(j, "invocations"));
-        x.set_logical_locations(SARIF::get_optional<std::vector<SARIF::ExternalPropertyFileReference>>(j, "logicalLocations"));
-        x.set_policies(SARIF::get_optional<std::vector<SARIF::ExternalPropertyFileReference>>(j, "policies"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-        x.set_results(SARIF::get_optional<std::vector<SARIF::ExternalPropertyFileReference>>(j, "results"));
-        x.set_taxonomies(SARIF::get_optional<std::vector<SARIF::ExternalPropertyFileReference>>(j, "taxonomies"));
-        x.set_thread_flow_locations(SARIF::get_optional<std::vector<SARIF::ExternalPropertyFileReference>>(j, "threadFlowLocations"));
-        x.set_translations(SARIF::get_optional<std::vector<SARIF::ExternalPropertyFileReference>>(j, "translations"));
-        x.set_web_requests(SARIF::get_optional<std::vector<SARIF::ExternalPropertyFileReference>>(j, "webRequests"));
-        x.set_web_responses(SARIF::get_optional<std::vector<SARIF::ExternalPropertyFileReference>>(j, "webResponses"));
-    }
-
-    inline void to_json(json & j, const SARIF::ExternalPropertyFileReferences & x) {
-        j = json::object();
-        j["addresses"] = x.get_addresses();
-        j["artifacts"] = x.get_artifacts();
-        j["conversion"] = x.get_conversion();
-        j["driver"] = x.get_driver();
-        j["extensions"] = x.get_extensions();
-        j["externalizedProperties"] = x.get_externalized_properties();
-        j["graphs"] = x.get_graphs();
-        j["invocations"] = x.get_invocations();
-        j["logicalLocations"] = x.get_logical_locations();
-        j["policies"] = x.get_policies();
-        j["properties"] = x.get_properties();
-        j["results"] = x.get_results();
-        j["taxonomies"] = x.get_taxonomies();
-        j["threadFlowLocations"] = x.get_thread_flow_locations();
-        j["translations"] = x.get_translations();
-        j["webRequests"] = x.get_web_requests();
-        j["webResponses"] = x.get_web_responses();
-    }
-
-    inline void from_json(const json & j, SARIF::SpecialLocations& x) {
-        x.set_display_base(SARIF::get_optional<SARIF::ArtifactLocation>(j, "displayBase"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-    }
-
-    inline void to_json(json & j, const SARIF::SpecialLocations & x) {
-        j = json::object();
-        j["displayBase"] = x.get_display_base();
-        j["properties"] = x.get_properties();
-    }
-
-    inline void from_json(const json & j, SARIF::VersionControlDetails& x) {
-        x.set_as_of_time_utc(SARIF::get_optional<std::string>(j, "asOfTimeUtc"));
-        x.set_branch(SARIF::get_optional<std::string>(j, "branch"));
-        x.set_mapped_to(SARIF::get_optional<SARIF::ArtifactLocation>(j, "mappedTo"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-        x.set_repository_uri(j.at("repositoryUri").get<std::string>());
-        x.set_revision_id(SARIF::get_optional<std::string>(j, "revisionId"));
-        x.set_revision_tag(SARIF::get_optional<std::string>(j, "revisionTag"));
-    }
-
-    inline void to_json(json & j, const SARIF::VersionControlDetails & x) {
-        j = json::object();
-        j["asOfTimeUtc"] = x.get_as_of_time_utc();
-        j["branch"] = x.get_branch();
-        j["mappedTo"] = x.get_mapped_to();
-        j["properties"] = x.get_properties();
-        j["repositoryUri"] = x.get_repository_uri();
-        j["revisionId"] = x.get_revision_id();
-        j["revisionTag"] = x.get_revision_tag();
-    }
-
-    inline void from_json(const json & j, SARIF::Run& x) {
-        x.set_addresses(SARIF::get_optional<std::vector<SARIF::Address>>(j, "addresses"));
-        x.set_artifacts(SARIF::get_optional<std::vector<SARIF::Artifact>>(j, "artifacts"));
-        x.set_automation_details(SARIF::get_optional<SARIF::RunAutomationDetails>(j, "automationDetails"));
-        x.set_baseline_guid(SARIF::get_optional<std::string>(j, "baselineGuid"));
-        x.set_column_kind(SARIF::get_optional<SARIF::ColumnKind>(j, "columnKind"));
-        x.set_conversion(SARIF::get_optional<SARIF::Conversion>(j, "conversion"));
-        x.set_default_encoding(SARIF::get_optional<std::string>(j, "defaultEncoding"));
-        x.set_default_source_language(SARIF::get_optional<std::string>(j, "defaultSourceLanguage"));
-        x.set_external_property_file_references(SARIF::get_optional<SARIF::ExternalPropertyFileReferences>(j, "externalPropertyFileReferences"));
-        x.set_graphs(SARIF::get_optional<std::vector<SARIF::Graph>>(j, "graphs"));
-        x.set_invocations(SARIF::get_optional<std::vector<SARIF::Invocation>>(j, "invocations"));
-        x.set_language(SARIF::get_optional<std::string>(j, "language"));
-        x.set_logical_locations(SARIF::get_optional<std::vector<SARIF::LogicalLocation>>(j, "logicalLocations"));
-        x.set_newline_sequences(SARIF::get_optional<std::vector<std::string>>(j, "newlineSequences"));
-        x.set_original_uri_base_ids(SARIF::get_optional<std::map<std::string, SARIF::ArtifactLocation>>(j, "originalUriBaseIds"));
-        x.set_policies(SARIF::get_optional<std::vector<SARIF::ToolComponent>>(j, "policies"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-        x.set_redaction_tokens(SARIF::get_optional<std::vector<std::string>>(j, "redactionTokens"));
-        x.set_results(SARIF::get_optional<std::vector<SARIF::Result>>(j, "results"));
-        x.set_run_aggregates(SARIF::get_optional<std::vector<SARIF::RunAutomationDetails>>(j, "runAggregates"));
-        x.set_special_locations(SARIF::get_optional<SARIF::SpecialLocations>(j, "specialLocations"));
-        x.set_taxonomies(SARIF::get_optional<std::vector<SARIF::ToolComponent>>(j, "taxonomies"));
-        x.set_thread_flow_locations(SARIF::get_optional<std::vector<SARIF::ThreadFlowLocation>>(j, "threadFlowLocations"));
-        x.set_tool(j.at("tool").get<SARIF::Tool>());
-        x.set_translations(SARIF::get_optional<std::vector<SARIF::ToolComponent>>(j, "translations"));
-        x.set_version_control_provenance(SARIF::get_optional<std::vector<SARIF::VersionControlDetails>>(j, "versionControlProvenance"));
-        x.set_web_requests(SARIF::get_optional<std::vector<SARIF::WebRequest>>(j, "webRequests"));
-        x.set_web_responses(SARIF::get_optional<std::vector<SARIF::WebResponse>>(j, "webResponses"));
-    }
-
-    inline void to_json(json & j, const SARIF::Run & x) {
-        j = json::object();
-        j["addresses"] = x.get_addresses();
-        j["artifacts"] = x.get_artifacts();
-        j["automationDetails"] = x.get_automation_details();
-        j["baselineGuid"] = x.get_baseline_guid();
-        j["columnKind"] = x.get_column_kind();
-        j["conversion"] = x.get_conversion();
-        j["defaultEncoding"] = x.get_default_encoding();
-        j["defaultSourceLanguage"] = x.get_default_source_language();
-        j["externalPropertyFileReferences"] = x.get_external_property_file_references();
-        j["graphs"] = x.get_graphs();
-        j["invocations"] = x.get_invocations();
-        j["language"] = x.get_language();
-        j["logicalLocations"] = x.get_logical_locations();
-        j["newlineSequences"] = x.get_newline_sequences();
-        j["originalUriBaseIds"] = x.get_original_uri_base_ids();
-        j["policies"] = x.get_policies();
-        j["properties"] = x.get_properties();
-        j["redactionTokens"] = x.get_redaction_tokens();
-        j["results"] = x.get_results();
-        j["runAggregates"] = x.get_run_aggregates();
-        j["specialLocations"] = x.get_special_locations();
-        j["taxonomies"] = x.get_taxonomies();
-        j["threadFlowLocations"] = x.get_thread_flow_locations();
-        j["tool"] = x.get_tool();
-        j["translations"] = x.get_translations();
-        j["versionControlProvenance"] = x.get_version_control_provenance();
-        j["webRequests"] = x.get_web_requests();
-        j["webResponses"] = x.get_web_responses();
-    }
-
-    inline void from_json(const json & j, SARIF::Coordinate& x) {
-        x.set_schema(SARIF::get_optional<std::string>(j, "$schema"));
-        x.set_inline_external_properties(SARIF::get_optional<std::vector<SARIF::ExternalProperties>>(j, "inlineExternalProperties"));
-        x.set_properties(SARIF::get_optional<SARIF::PropertyBag>(j, "properties"));
-        x.set_runs(j.at("runs").get<std::vector<SARIF::Run>>());
-        x.set_version(j.at("version").get<SARIF::Version>());
-    }
-
-    inline void to_json(json & j, const SARIF::Coordinate & x) {
-        j = json::object();
-        j["$schema"] = x.get_schema();
-        j["inlineExternalProperties"] = x.get_inline_external_properties();
-        j["properties"] = x.get_properties();
-        j["runs"] = x.get_runs();
-        j["version"] = x.get_version();
-    }
-
-    inline void from_json(const json & j, SARIF::Role & x) {
-        static std::unordered_map<std::string, SARIF::Role> enumValues {
-            {"added", SARIF::Role::ADDED},
-            {"analysisTarget", SARIF::Role::ANALYSIS_TARGET},
-            {"attachment", SARIF::Role::ATTACHMENT},
-            {"debugOutputFile", SARIF::Role::DEBUG_OUTPUT_FILE},
-            {"deleted", SARIF::Role::DELETED},
-            {"directory", SARIF::Role::DIRECTORY},
-            {"driver", SARIF::Role::DRIVER},
-            {"extension", SARIF::Role::EXTENSION},
-            {"memoryContents", SARIF::Role::MEMORY_CONTENTS},
-            {"modified", SARIF::Role::MODIFIED},
-            {"policy", SARIF::Role::POLICY},
-            {"referencedOnCommandLine", SARIF::Role::REFERENCED_ON_COMMAND_LINE},
-            {"renamed", SARIF::Role::RENAMED},
-            {"responseFile", SARIF::Role::RESPONSE_FILE},
-            {"resultFile", SARIF::Role::RESULT_FILE},
-            {"standardStream", SARIF::Role::STANDARD_STREAM},
-            {"taxonomy", SARIF::Role::TAXONOMY},
-            {"toolSpecifiedConfiguration", SARIF::Role::TOOL_SPECIFIED_CONFIGURATION},
-            {"tracedFile", SARIF::Role::TRACED_FILE},
-            {"translation", SARIF::Role::TRANSLATION},
-            {"uncontrolled", SARIF::Role::UNCONTROLLED},
-            {"unmodified", SARIF::Role::UNMODIFIED},
-            {"userSpecifiedConfiguration", SARIF::Role::USER_SPECIFIED_CONFIGURATION},
-        };
-        auto iter = enumValues.find(j);
-        if (iter != enumValues.end()) {
-            x = iter->second;
-        }
-    }
-
-    inline void to_json(json & j, const SARIF::Role & x) {
-        switch (x) {
-            case SARIF::Role::ADDED: j = "added"; break;
-            case SARIF::Role::ANALYSIS_TARGET: j = "analysisTarget"; break;
-            case SARIF::Role::ATTACHMENT: j = "attachment"; break;
-            case SARIF::Role::DEBUG_OUTPUT_FILE: j = "debugOutputFile"; break;
-            case SARIF::Role::DELETED: j = "deleted"; break;
-            case SARIF::Role::DIRECTORY: j = "directory"; break;
-            case SARIF::Role::DRIVER: j = "driver"; break;
-            case SARIF::Role::EXTENSION: j = "extension"; break;
-            case SARIF::Role::MEMORY_CONTENTS: j = "memoryContents"; break;
-            case SARIF::Role::MODIFIED: j = "modified"; break;
-            case SARIF::Role::POLICY: j = "policy"; break;
-            case SARIF::Role::REFERENCED_ON_COMMAND_LINE: j = "referencedOnCommandLine"; break;
-            case SARIF::Role::RENAMED: j = "renamed"; break;
-            case SARIF::Role::RESPONSE_FILE: j = "responseFile"; break;
-            case SARIF::Role::RESULT_FILE: j = "resultFile"; break;
-            case SARIF::Role::STANDARD_STREAM: j = "standardStream"; break;
-            case SARIF::Role::TAXONOMY: j = "taxonomy"; break;
-            case SARIF::Role::TOOL_SPECIFIED_CONFIGURATION: j = "toolSpecifiedConfiguration"; break;
-            case SARIF::Role::TRACED_FILE: j = "tracedFile"; break;
-            case SARIF::Role::TRANSLATION: j = "translation"; break;
-            case SARIF::Role::UNCONTROLLED: j = "uncontrolled"; break;
-            case SARIF::Role::UNMODIFIED: j = "unmodified"; break;
-            case SARIF::Role::USER_SPECIFIED_CONFIGURATION: j = "userSpecifiedConfiguration"; break;
-            default: throw "This should not happen";
-        }
-    }
-
-    inline void from_json(const json & j, SARIF::Level & x) {
-        if (j == "error") x = SARIF::Level::ERROR;
-        else if (j == "none") x = SARIF::Level::NONE;
-        else if (j == "note") x = SARIF::Level::NOTE;
-        else if (j == "warning") x = SARIF::Level::WARNING;
-        else throw "Input JSON does not conform to schema";
-    }
-
-    inline void to_json(json & j, const SARIF::Level & x) {
-        switch (x) {
-            case SARIF::Level::ERROR: j = "error"; break;
-            case SARIF::Level::NONE: j = "none"; break;
-            case SARIF::Level::NOTE: j = "note"; break;
-            case SARIF::Level::WARNING: j = "warning"; break;
-            default: throw "This should not happen";
-        }
-    }
-
-    inline void from_json(const json & j, SARIF::Content & x) {
-        if (j == "localizedData") x = SARIF::Content::LOCALIZED_DATA;
-        else if (j == "nonLocalizedData") x = SARIF::Content::NON_LOCALIZED_DATA;
-        else throw "Input JSON does not conform to schema";
-    }
-
-    inline void to_json(json & j, const SARIF::Content & x) {
-        switch (x) {
-            case SARIF::Content::LOCALIZED_DATA: j = "localizedData"; break;
-            case SARIF::Content::NON_LOCALIZED_DATA: j = "nonLocalizedData"; break;
-            default: throw "This should not happen";
-        }
-    }
-
-    inline void from_json(const json & j, SARIF::BaselineState & x) {
-        if (j == "absent") x = SARIF::BaselineState::ABSENT;
-        else if (j == "new") x = SARIF::BaselineState::NEW;
-        else if (j == "unchanged") x = SARIF::BaselineState::UNCHANGED;
-        else if (j == "updated") x = SARIF::BaselineState::UPDATED;
-        else throw "Input JSON does not conform to schema";
-    }
-
-    inline void to_json(json & j, const SARIF::BaselineState & x) {
-        switch (x) {
-            case SARIF::BaselineState::ABSENT: j = "absent"; break;
-            case SARIF::BaselineState::NEW: j = "new"; break;
-            case SARIF::BaselineState::UNCHANGED: j = "unchanged"; break;
-            case SARIF::BaselineState::UPDATED: j = "updated"; break;
-            default: throw "This should not happen";
-        }
-    }
-
-    inline void from_json(const json & j, SARIF::Importance & x) {
-        if (j == "essential") x = SARIF::Importance::ESSENTIAL;
-        else if (j == "important") x = SARIF::Importance::IMPORTANT;
-        else if (j == "unimportant") x = SARIF::Importance::UNIMPORTANT;
-        else throw "Input JSON does not conform to schema";
-    }
-
-    inline void to_json(json & j, const SARIF::Importance & x) {
-        switch (x) {
-            case SARIF::Importance::ESSENTIAL: j = "essential"; break;
-            case SARIF::Importance::IMPORTANT: j = "important"; break;
-            case SARIF::Importance::UNIMPORTANT: j = "unimportant"; break;
-            default: throw "This should not happen";
-        }
-    }
-
-    inline void from_json(const json & j, SARIF::ResultKind & x) {
-        if (j == "fail") x = SARIF::ResultKind::FAIL;
-        else if (j == "informational") x = SARIF::ResultKind::INFORMATIONAL;
-        else if (j == "notApplicable") x = SARIF::ResultKind::NOT_APPLICABLE;
-        else if (j == "open") x = SARIF::ResultKind::OPEN;
-        else if (j == "pass") x = SARIF::ResultKind::PASS;
-        else if (j == "review") x = SARIF::ResultKind::REVIEW;
-        else throw "Input JSON does not conform to schema";
-    }
-
-    inline void to_json(json & j, const SARIF::ResultKind & x) {
-        switch (x) {
-            case SARIF::ResultKind::FAIL: j = "fail"; break;
-            case SARIF::ResultKind::INFORMATIONAL: j = "informational"; break;
-            case SARIF::ResultKind::NOT_APPLICABLE: j = "notApplicable"; break;
-            case SARIF::ResultKind::OPEN: j = "open"; break;
-            case SARIF::ResultKind::PASS: j = "pass"; break;
-            case SARIF::ResultKind::REVIEW: j = "review"; break;
-            default: throw "This should not happen";
-        }
-    }
-
-    inline void from_json(const json & j, SARIF::SuppressionKind & x) {
-        if (j == "external") x = SARIF::SuppressionKind::EXTERNAL;
-        else if (j == "inSource") x = SARIF::SuppressionKind::IN_SOURCE;
-        else throw "Input JSON does not conform to schema";
-    }
-
-    inline void to_json(json & j, const SARIF::SuppressionKind & x) {
-        switch (x) {
-            case SARIF::SuppressionKind::EXTERNAL: j = "external"; break;
-            case SARIF::SuppressionKind::IN_SOURCE: j = "inSource"; break;
-            default: throw "This should not happen";
-        }
-    }
-
-    inline void from_json(const json & j, SARIF::Status & x) {
-        if (j == "accepted") x = SARIF::Status::ACCEPTED;
-        else if (j == "rejected") x = SARIF::Status::REJECTED;
-        else if (j == "underReview") x = SARIF::Status::UNDER_REVIEW;
-        else throw "Input JSON does not conform to schema";
-    }
-
-    inline void to_json(json & j, const SARIF::Status & x) {
-        switch (x) {
-            case SARIF::Status::ACCEPTED: j = "accepted"; break;
-            case SARIF::Status::REJECTED: j = "rejected"; break;
-            case SARIF::Status::UNDER_REVIEW: j = "underReview"; break;
-            default: throw "This should not happen";
-        }
-    }
-
-    inline void from_json(const json & j, SARIF::Version & x) {
-        if (j == "2.1.0") x = SARIF::Version::THE_210;
-        else throw "Input JSON does not conform to schema";
-    }
-
-    inline void to_json(json & j, const SARIF::Version & x) {
-        switch (x) {
-            case SARIF::Version::THE_210: j = "2.1.0"; break;
-            default: throw "This should not happen";
-        }
-    }
-
-    inline void from_json(const json & j, SARIF::ColumnKind & x) {
-        if (j == "unicodeCodePoints") x = SARIF::ColumnKind::UNICODE_CODE_POINTS;
-        else if (j == "utf16CodeUnits") x = SARIF::ColumnKind::UTF16_CODE_UNITS;
-        else throw "Input JSON does not conform to schema";
-    }
-
-    inline void to_json(json & j, const SARIF::ColumnKind & x) {
-        switch (x) {
-            case SARIF::ColumnKind::UNICODE_CODE_POINTS: j = "unicodeCodePoints"; break;
-            case SARIF::ColumnKind::UTF16_CODE_UNITS: j = "utf16CodeUnits"; break;
-            default: throw "This should not happen";
-        }
-    }
-}

From 2b80afd5f89dc8993f6c0cff016ad9931bdabd0d Mon Sep 17 00:00:00 2001
From: Yonghong Yan <yanyh15@gmail.com>
Date: Wed, 13 Nov 2024 00:07:26 -0500
Subject: [PATCH 21/42] deBoost: remove several boost usage in non-src folder

---
 scripts/build_boost            |  2 -
 scripts/check_boost_linkage.sh | 85 ----------------------------------
 tools/makefile.external        | 10 +---
 tutorial/buildVFA.C            |  3 --
 4 files changed, 2 insertions(+), 98 deletions(-)
 delete mode 100644 scripts/build_boost
 delete mode 100755 scripts/check_boost_linkage.sh

diff --git a/scripts/build_boost b/scripts/build_boost
deleted file mode 100644
index 66862d85cab..00000000000
--- a/scripts/build_boost
+++ /dev/null
@@ -1,2 +0,0 @@
-bjam --prefix=/home/dquinlan/local/boost_64bit_3.4.6
-    --builddir=/home/dquinlan/local/boost_64bit_3.4.6 install -j8
diff --git a/scripts/check_boost_linkage.sh b/scripts/check_boost_linkage.sh
deleted file mode 100755
index d088b83f5e3..00000000000
--- a/scripts/check_boost_linkage.sh
+++ /dev/null
@@ -1,85 +0,0 @@
-#!/bin/bash
-
-#-------------------------------------------------------------------------------
-#  Default global variables
-#-------------------------------------------------------------------------------
-: ${OS_MACOSX:=false}
-: ${LIBRARY:=}
-
-#-------------------------------------------------------------------------------
-#  Utilities
-#-------------------------------------------------------------------------------
-function usage() {
-  echo "Usage: $0 <path-to-library:string>"
-}
-
-function how_to_fix() {
-    echo "  If this is an issue with only the Boost libraries (and not the Boost include files) and"
-    echo "  you're using dynamic linking, then you should be able to fix this simply by adjusting"
-    echo "  environment variables; otherwise you may need to reconfigure, \"make clean\" and re-make ROSE."
-}
-
-#-------------------------------------------------------------------------------
-#  Main
-#-------------------------------------------------------------------------------
-
-if test $# -lt 1 -o $# -gt 2; then
-    usage
-    exit 1
-else
-    LIBRARY="$1"
-    if [ -n "$(type ldd 2>/dev/null)" ]; then
-        OS_MACOSX=false
-    else
-        if [ -n "$(type otool 2>/dev/null)" ]; then
-            OS_MACOSX=true
-        else
-            echo "[ERROR] [${0}] ldd/otool does not exist. Can't determine Boost dependencies in '${LIBRARY}'."
-            exit 1
-        fi
-    fi
-fi
-
-#-------------------------------------------------------------------------------
-#  Check linkage of [Boost C++ library]
-#-------------------------------------------------------------------------------
-if $OS_MACOSX; then
-    cmd="otool -L \"$LIBRARY\" | grep libboost | sed -n 's/\(.*\)libboost_.*/\1/p' | sort | uniq"
-else
-    cmd="ldd \"$LIBRARY\" | grep libboost | sed 's/.* => \(.*\)\/libboost_.* (.*)/\1/' | sort | uniq"
-fi
-
-boostlibdirs="$(eval $cmd)"
-
-if test "$boostlibdirs" = ""; then
-    : no dynamic boost linkage at all
-elif test -n "$boostlibdirs"; then
-    : echo "$0: info: Boost is being linked from '$(echo "$boostlibdirs" | xargs)' in '$LIBRARY'"
-else
-    echo "$0: error: Boost link dependencies not found in '${LIBRARY}'."
-    echo "  It looks like the directory you specified during ROSE's configure step for Boost libraries"
-    echo "  is not being used in the ROSE test executable we just compiled.  Perhaps some other Boost"
-    echo "  is being picked up instead?"
-    how_to_fix
-    echo
-    echo "  \$ $cmd"
-    echo
-    exit 1
-fi
-
-if test $(echo "$boostlibdirs" | wc -l) -gt 1; then
-    echo "$0: error: Boost libraries are being linked from multiple directories in '${LIBRARY}'."
-    echo "  This is probably an error; it's not likely that you would have libraries from one version"
-    echo "  of Boost spread into multiple directories.  Perhaps one of the installed Boost versions is"
-    echo "  not complete?"
-    how_to_fix
-    echo
-    echo "  \$ $cmd"
-    if $OS_MACOSX; then
-          otool -L "$LIBRARY" | grep libboost
-    else
-          ldd "$LIBRARY" | sed -n --posix '/libboost/p'
-    fi
-    echo
-fi
-
diff --git a/tools/makefile.external b/tools/makefile.external
index 57a2413f064..9064f0819d3 100644
--- a/tools/makefile.external
+++ b/tools/makefile.external
@@ -11,9 +11,6 @@
 ##   * headers, e.g. "rose.h"
 ROSE_INSTALL=/home/liao6/workspace/raja/rose/install
 
-## ROSE uses the BOOST C++ libraries
-BOOST_INSTALL=/nfs/casc/overture/ROSE/opt/rhel7/x86_64/boost/1_55_0/gcc/4.9.3/
-
 ## Your translator
 TRANSLATOR=rajaChecker
 TRANSLATOR_SOURCE=$(TRANSLATOR).C
@@ -21,10 +18,8 @@ TRANSLATOR_SOURCE=$(TRANSLATOR).C
 ## Input testcode for your translator
 TESTCODE=hello.cpp
 
-#BOOST_LIBS
 # the Sawyer lib uses a long list of boost libs
-BOOST_LIBS=-lboost_date_time -lboost_thread -lboost_filesystem -lboost_program_options -lboost_regex -lboost_system -lboost_serialization -lboost_wave -lboost_iostreams 
-LINK_FLAGS=-Wl,-rpath=$(ROSE_INSTALL)/lib -L$(ROSE_INSTALL)/lib -lrose -pthread -Wl,-rpath=$(BOOST_INSTALL)/lib -L$(BOOST_INSTALL)/lib $(BOOST_LIBS) -lm
+LINK_FLAGS=-Wl,-rpath=$(ROSE_INSTALL)/lib -L$(ROSE_INSTALL)/lib -lrose -pthread -lm
 #-------------------------------------------------------------
 # Makefile Targets
 #-------------------------------------------------------------
@@ -33,9 +28,8 @@ all: $(TRANSLATOR)
 
 # compile the translator and generate an executable
 # -g is recommended to be used by default to enable debugging your code
-# Note: depending on the version of boost, you may have to use something like -I $(BOOST_ROOT)/include/boost-1_40 instead. 
 $(TRANSLATOR): $(TRANSLATOR_SOURCE)
-	g++ -g $(TRANSLATOR_SOURCE) -I$(BOOST_INSTALL)/include -I$(ROSE_INSTALL)/include/rose $(LINK_FLAGS) -o $(TRANSLATOR)
+	g++ -g $(TRANSLATOR_SOURCE) -I$(ROSE_INSTALL)/include/rose $(LINK_FLAGS) -o $(TRANSLATOR)
 
 # test the translator
 check: $(TRANSLATOR)
diff --git a/tutorial/buildVFA.C b/tutorial/buildVFA.C
index 0ba32cb8265..bde2f4d45d4 100644
--- a/tutorial/buildVFA.C
+++ b/tutorial/buildVFA.C
@@ -4,11 +4,8 @@
 #include <iostream>
 
 #include "VirtualFunctionAnalysis.h"
-using namespace boost;
-
 
 using namespace std;
-using namespace boost;
 // A Function object used as a predicate that determines which functions are 
 // to be represented in the call graph.
 // Liao 1/23/2013. It turns out there is another FunctionFilter used in src/midend/programAnalysis/VirtualFunctionAnalysis/PtrAliasAnalysis.C

From 6e526c5c5706af8723319465647e586f4e1fee2b Mon Sep 17 00:00:00 2001
From: Yonghong Yan <yanyh15@gmail.com>
Date: Wed, 13 Nov 2024 01:22:16 -0500
Subject: [PATCH 22/42] deBoost: remove boost usage in src/frontend/SageIII,
 WIP. done with subfolder files, but not the top folder

---
 src/ROSETTA/Grammar/Support.code              | 26 ++--------
 src/featureTests.h                            |  1 -
 .../astTokenStream/doCompleteMapping.h        |  1 -
 .../SageIII/astTokenStream/linearizeAST.C     |  7 ++-
 src/frontend/SageIII/rose_attributes_list.h   |  1 +
 .../SageIII/sageInterface/CMakeLists.txt      |  2 +-
 .../SageIII/sageInterface/Makefile.am         |  1 -
 .../SageIII/sageInterface/sageBuilder.C       |  5 +-
 .../sageInterface/sageBuilder_fortran.C       |  1 -
 .../SageIII/sageInterface/sageInterface.C     |  3 +-
 .../SageIII/sage_support/keep_going.cpp       | 48 +++++++++----------
 .../SageIII/sage_support/sage_support.cpp     |  6 +--
 .../SageIII/sage_support/utility_functions.C  | 38 ---------------
 .../SageIII/sage_support/utility_functions.h  |  7 ---
 src/util/StringUtility/CMakeLists.txt         |  2 +-
 src/util/StringUtility/Convert.C              |  2 +-
 src/util/StringUtility/FileUtility.C          |  2 +-
 .../StringUtility/IntegerOps.h}               | 13 +++--
 src/util/StringUtility/Makefile.am            |  1 +
 19 files changed, 45 insertions(+), 122 deletions(-)
 rename src/{frontend/SageIII/sageInterface/integerOps.h => util/StringUtility/IntegerOps.h} (96%)

diff --git a/src/ROSETTA/Grammar/Support.code b/src/ROSETTA/Grammar/Support.code
index b81d5430e40..9663080669e 100644
--- a/src/ROSETTA/Grammar/Support.code
+++ b/src/ROSETTA/Grammar/Support.code
@@ -10,17 +10,13 @@ HEADER_START
           $CLASSNAME & operator= ( const $CLASSNAME & X );
 HEADER_END
 
+#define ROSE_SKIP_COMPILATION_OF_WAVE 1
 
 // ****************************************************
 // ************ Support for Graph IR nodes ************
 // ****************************************************
 HEADER_GRAPH_PREDECLARATION_START
 
-#if 0
-// Required for Boost Spanning Tree support.
-#include <boost/graph/adjacency_list.hpp>
-#include <boost/graph/kruskal_min_spanning_tree.hpp>
-#endif
 /*!
     Doxygen documentation for graph class (should maybe be put with the rest of the
 doxygen documentation in docs/testDoxygen directory instead).
@@ -517,23 +513,6 @@ HEADER_GRAPH_START
                e_last_property      /*!< last value (unused, serves as upper bound on values) */
              };
 
-
-
-#if 0
-
-  // DQ (4/29/2009): Boost graph Type
- //! Boost Graph Type used to represent ROSE graphs within Boost Graph Algorithms.
-     typedef boost::adjacency_list < boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property < boost::edge_weight_t, int > > BoostGraphType;
-
- //! Supporting graph types required by Boost Graph Library.
-     typedef boost::graph_traits < BoostGraphType >::edge_descriptor   BoostEdgeDescriptor;
-
-  // DQ (4/29/2009): We might need this in the future, but not now!
-  // typedef boost::graph_traits < BoostGraphType >::vertex_descriptor BoostVertexDescriptor;
-
-#endif
-
-
  //! Simple edge type used to input data to Boost algorithms
      typedef std::pair<int, int> BoostEdgeType;
 
@@ -4634,7 +4613,8 @@ class rose_hash_multimap : public rose_hash::unordered_multimap<SgName, SgSymbol
        // DQ (11/27/2010): Older version of code before adding support for case insensitive behavior.
           rose_hash_multimap(bool case_insensitive_semantics = false)
           // : rose_hash::unordered_multimap<SgName, SgSymbol*, hash_Name, eqstr>(), parent(NULL)
-             : rose_hash::unordered_multimap<SgName, SgSymbol*, hash_Name, eqstr>(boost::unordered_detail::default_bucket_count,hash_Name(),eqstr(case_insensitive_semantics)), parent(NULL)
+          // : rose_hash::unordered_multimap<SgName, SgSymbol*, hash_Name, eqstr>(boost::unordered_detail::default_bucket_count,hash_Name(),eqstr(case_insensitive_semantics)), parent(NULL)
+             : rose_hash::unordered_multimap<SgName, SgSymbol*, hash_Name, eqstr>(11,hash_Name(),eqstr(case_insensitive_semantics)), parent(NULL)
              {}
 
          rose_hash_multimap(int sz, bool case_insensitive_semantics = false)
diff --git a/src/featureTests.h b/src/featureTests.h
index 82c93f1cba8..0a7997c9064 100644
--- a/src/featureTests.h
+++ b/src/featureTests.h
@@ -15,7 +15,6 @@
 // and fast as possible because its purpose is to be able to quickly compile (by skipping over) source code that's not
 // necessary in a particular ROSE configuration.
 #include <rosePublicConfig.h>
-#include <boost/version.hpp>
 
 #if defined(_MSC_VER)
     // Microsoft Visual C++ Compiler erroneously advertises that it's a C++98 compiler. The "fix" for Visual Studio 2017
diff --git a/src/frontend/SageIII/astTokenStream/doCompleteMapping.h b/src/frontend/SageIII/astTokenStream/doCompleteMapping.h
index 02c532272a6..8a1c92cdf16 100644
--- a/src/frontend/SageIII/astTokenStream/doCompleteMapping.h
+++ b/src/frontend/SageIII/astTokenStream/doCompleteMapping.h
@@ -4,7 +4,6 @@
 #include <functional>
 #include "linearizeAST.h"
 #include <vector>
-#include <boost/tuple/tuple.hpp>
 
 struct separator
    {
diff --git a/src/frontend/SageIII/astTokenStream/linearizeAST.C b/src/frontend/SageIII/astTokenStream/linearizeAST.C
index db156b2dd2c..a04e68f7f3e 100644
--- a/src/frontend/SageIII/astTokenStream/linearizeAST.C
+++ b/src/frontend/SageIII/astTokenStream/linearizeAST.C
@@ -9,7 +9,6 @@
 #include "rose_config.h"
 
 #include "linearizeAST.h"
-#include <boost/lexical_cast.hpp>
 
 class PostSynthesizedAttribute
    {
@@ -41,11 +40,11 @@ class PostAST : public SgBottomUpProcessing<PostSynthesizedAttribute>
             {
               std::string correspondingString =astNode->class_name()+ " ";
               correspondingString+=(astNode)->unparseToString()+" ";
-              correspondingString+=boost::lexical_cast<std::string>((astNode)->get_file_info()->get_filenameString());
+              correspondingString+=(astNode)->get_file_info()->get_filenameString();
               correspondingString+= " ";
-              correspondingString+=boost::lexical_cast<std::string>((astNode)->get_file_info()->get_line());
+              correspondingString+=std::to_string((astNode)->get_file_info()->get_line());
               correspondingString+= " ";
-              correspondingString+=boost::lexical_cast<std::string>((astNode)->get_file_info()->get_col());
+              correspondingString+=std::to_string((astNode)->get_file_info()->get_col());
 
               if(isSgConditionalExp(astNode) != NULL)
                 std::cout << "Found conditional exp" << std::endl;
diff --git a/src/frontend/SageIII/rose_attributes_list.h b/src/frontend/SageIII/rose_attributes_list.h
index 8567fd3043b..99bd034b113 100644
--- a/src/frontend/SageIII/rose_attributes_list.h
+++ b/src/frontend/SageIII/rose_attributes_list.h
@@ -9,6 +9,7 @@
 
 // Include the ROSE lex specific definitions of tokens
 #include "general_token_defs.h"
+#define ROSE_SKIP_COMPILATION_OF_WAVE 1
 
 // #ifdef CAN_NOT_COMPILE_WITH_ROSE
 //    #warning "CAN_NOT_COMPILE_WITH_ROSE IS defined"
diff --git a/src/frontend/SageIII/sageInterface/CMakeLists.txt b/src/frontend/SageIII/sageInterface/CMakeLists.txt
index 48ce79c5d2a..5fe4d741f1f 100644
--- a/src/frontend/SageIII/sageInterface/CMakeLists.txt
+++ b/src/frontend/SageIII/sageInterface/CMakeLists.txt
@@ -11,7 +11,7 @@ add_library(sageInterface OBJECT
 add_dependencies(sageInterface rosetta_generated)
 
 install(
-  FILES  sageInterface.h sageBuilder.h integerOps.h abiStuff.h
+  FILES  sageInterface.h sageBuilder.h abiStuff.h
          sageFunctors.h sageGeneric.h
   DESTINATION ${INCLUDE_INSTALL_DIR}
   )
diff --git a/src/frontend/SageIII/sageInterface/Makefile.am b/src/frontend/SageIII/sageInterface/Makefile.am
index 0f805c5cffc..e9ec817faaf 100644
--- a/src/frontend/SageIII/sageInterface/Makefile.am
+++ b/src/frontend/SageIII/sageInterface/Makefile.am
@@ -21,7 +21,6 @@ pkginclude_HEADERS = \
      sageBuilder.h \
      sageGeneric.h \
      sageFunctors.h \
-     integerOps.h \
      abiStuff.h
 
 EXTRA_DIST = CMakeLists.txt
diff --git a/src/frontend/SageIII/sageInterface/sageBuilder.C b/src/frontend/SageIII/sageInterface/sageBuilder.C
index 34359b54958..7954ae25cf6 100644
--- a/src/frontend/SageIII/sageInterface/sageBuilder.C
+++ b/src/frontend/SageIII/sageInterface/sageBuilder.C
@@ -11,13 +11,12 @@
    #include "markLhsValues.h"
 // #include "sageBuilder.h"
    #include <fstream>
-   #include <boost/algorithm/string/trim.hpp>
    #include "Outliner.hh"
 #else
 // #include "sageBuilder.h"
    #include <fstream>
-   #include <boost/algorithm/string/trim.hpp>
 #endif
+#include "Trim.h"
 
 // DQ (4/3/2012): Added so that I can enforce some rules as the AST is constructed.
 #include "AstConsistencyTests.h"
@@ -16946,7 +16945,7 @@ PreprocessingInfo* SageBuilder::buildCpreprocessorDefineDeclaration(SgLocatedNod
     ROSE_ASSERT(target != NULL); //dangling #define xxx is not allowed in the ROSE AST
     // simple input verification
     std::string content2 = content;
-    boost::algorithm::trim(content2);
+    trim(content2);
     string prefix = "#define";
     string::size_type pos = content2.find(prefix, 0);
     ROSE_ASSERT (pos == 0);
diff --git a/src/frontend/SageIII/sageInterface/sageBuilder_fortran.C b/src/frontend/SageIII/sageInterface/sageBuilder_fortran.C
index cdada507090..0b4ccc93471 100644
--- a/src/frontend/SageIII/sageInterface/sageBuilder_fortran.C
+++ b/src/frontend/SageIII/sageInterface/sageBuilder_fortran.C
@@ -6,7 +6,6 @@
 #include "markLhsValues.h"
 #include "sageBuilder.h"
 #include <fstream>
-#include <boost/algorithm/string/trim.hpp>
 #include "Outliner.hh"
 #endif
 
diff --git a/src/frontend/SageIII/sageInterface/sageInterface.C b/src/frontend/SageIII/sageInterface/sageInterface.C
index ed61908f756..7d612076b00 100644
--- a/src/frontend/SageIII/sageInterface/sageInterface.C
+++ b/src/frontend/SageIII/sageInterface/sageInterface.C
@@ -48,7 +48,6 @@
 #include "LoopUnroll.h"
 #endif
 
-#include <boost/lexical_cast.hpp>
 #include <sstream>
 #include <iostream>
 #include <algorithm> // for set operations
@@ -10598,7 +10597,7 @@ string SageInterface::generateUniqueVariableName(SgScopeStatement* scope, std::s
     bool collision = false;
     do
     {
-        name = "__" + baseName + boost::lexical_cast<string > (counter++) + "__";
+        name = "__" + baseName + std::to_string (counter++) + "__";
 
      // DQ (8/16/2013): Modified to reflect new API.
      // Look up the name in the parent scopes
diff --git a/src/frontend/SageIII/sage_support/keep_going.cpp b/src/frontend/SageIII/sage_support/keep_going.cpp
index cbd7eb6e28d..16c2bfb4cd0 100644
--- a/src/frontend/SageIII/sage_support/keep_going.cpp
+++ b/src/frontend/SageIII/sage_support/keep_going.cpp
@@ -7,6 +7,7 @@
 
 #include <iostream>
 #include <filesystem>
+#include <fcntl.h>
 
 #include "keep_going.h"
 #include "processSupport.h" // ROSE_ASSERT in ROSE/src/util
@@ -14,19 +15,17 @@
 #include <map>
 #include <fstream>
 #include <sstream>
+#include <chrono>
+#include <ctime>
+#include <iomanip>
+#include <string>
 #include <string>
 #include <vector>
 #ifdef __linux__
 #include <utime.h>
 #endif
-#include <boost/algorithm/string/join.hpp>
-#include <boost/date_time/posix_time/posix_time.hpp>
-#include <boost/filesystem.hpp>
-#include <boost/interprocess/sync/file_lock.hpp>
-#include <boost/interprocess/sync/scoped_lock.hpp>
 
 using namespace std; 
-using namespace boost::interprocess; 
 
 namespace Rose {
 namespace KeepGoing {
@@ -462,10 +461,13 @@ void Rose::KeepGoing::commandLineProcessing
 
     if (verbose)
     {
-      std::cout
-        << "[INFO] ROSE Commandline: "
-        << boost::algorithm::join(rose_cmdline, " ")
-        << std::endl;
+      std::ostringstream oss;
+      for (size_t i = 0; i < rose_cmdline.size(); ++i) {
+         if (i != 0) oss << " ";
+         oss << rose_cmdline[i];
+      }
+
+      std::cout << "[INFO] ROSE Commandline: " << oss.str() << std::endl;
     }
   }// CLI
 
@@ -763,18 +765,14 @@ Rose::KeepGoing::StripPrefix(const std::string& prefix, const std::string& str)
 std::string
 Rose::KeepGoing::GetTimestamp(const std::string& format)
 {
-  using namespace boost::posix_time;
-
-  //ptime now = second_clock::universal_time();
-  // Using local time instead to be user-friendly.
-  ptime now = second_clock::local_time();
-
-  static std::locale loc(std::cout.getloc(),
-                         new time_facet(format.c_str()));
+  // Get the current time
+  auto now = std::chrono::system_clock::now();
+  std::time_t now_c = std::chrono::system_clock::to_time_t(now);
+  std::tm local_tm = *std::localtime(&now_c);  // Use local time for user-friendliness
 
-  std::basic_stringstream<char> ss;
-  ss.imbue(loc);
-  ss << now;
+  // Create a stringstream to format the output
+  std::ostringstream ss;
+  ss << std::put_time(&local_tm, format.c_str());
 
   return ss.str();
 }
@@ -828,12 +826,10 @@ Rose::KeepGoing::AppendToFile(const std::string& filename, const std::string& ms
  // use a separated file for the file lock
   string lock_file_name = filename+".lock"; 
   touch(filename);
-  touch(lock_file_name); //this lock file must exist. Or later flock() will fail.
 
-  boost::interprocess::file_lock flock (lock_file_name.c_str());
-  // introduce a scope to use the scoped lock, which automatically unlock when existing the scope
+  while (std::filesystem::exists(lock_file_name)); //busy wait until it acquires lock
+  touch(lock_file_name); //acquire the lock file
   {
-    boost::interprocess::scoped_lock<file_lock> e_lock(flock);
     std::ofstream fout(filename.c_str(), std::ios::app);
     if(!fout.is_open())
     {
@@ -857,7 +853,7 @@ Rose::KeepGoing::AppendToFile(const std::string& filename, const std::string& ms
       fout.close();
     }
   } // end scope for the scoped lock
-  std::filesystem::remove (lock_file_name);
+  std::filesystem::remove (lock_file_name); //release the lock by deleting the file
 }
 
 std::map<std::string, std::string>
diff --git a/src/frontend/SageIII/sage_support/sage_support.cpp b/src/frontend/SageIII/sage_support/sage_support.cpp
index 2a5ccbd6c4c..8115d263f54 100644
--- a/src/frontend/SageIII/sage_support/sage_support.cpp
+++ b/src/frontend/SageIII/sage_support/sage_support.cpp
@@ -13,6 +13,7 @@
 #include "cmdline.h"
 #include "processSupport.h"
 #include <FileSystem.h>
+#include "Unique.h"
 
 #ifdef ROSE_BUILD_FORTRAN_LANGUAGE_SUPPORT
 #   include "FortranModuleInfo.h"
@@ -23,8 +24,6 @@
 #include <algorithm>
 #include <filesystem>
 
-#include <boost/algorithm/string/join.hpp>
-
 // DQ (12/22/2019): I don't need this now, and it is an issue for some compilers (e.g. GNU 4.9.4).
 // DQ (12/21/2019): Require hash table support for determining the shared nodes in the ASTs.
 // #include <unordered_map>
@@ -3607,7 +3606,6 @@ SgSourceFile::build_Fortran_AST( vector<string> argv, vector<string> inputComman
 #elif BACKEND_FORTRAN_IS_PGI_COMPILER
      // Pei-Hung 12/09/2019 This is for PGI Fortran compiler, add others if necessary
           fortran_C_preprocessor_commandLine.push_back("-Mcpp");
-
 #endif
 
        // add source file name
@@ -3618,7 +3616,7 @@ SgSourceFile::build_Fortran_AST( vector<string> argv, vector<string> inputComman
           FileSystem::Path abs_path = FileSystem::makeAbsolute(this->get_unparse_output_filename());
           FileSystem::Path abs_dir = abs_path.parent_path();
           FileSystem::Path base = abs_dir.filename().stem();
-          string preprocessFilename = (abs_dir / std::filesystem::unique_path(base.string() + "-%%%%%%%%.F90")).string();
+          string preprocessFilename = (abs_dir / (base.string() + "-" + Rose::Unique::genUniqueID() + ".F90")).string();
 
           // The Sawyer::FileSystem::TemporaryFile d'tor will delete the file. We close the file after it's created because
           // Rose::FileSystem::copyFile will reopen it in binary mode anyway.
diff --git a/src/frontend/SageIII/sage_support/utility_functions.C b/src/frontend/SageIII/sage_support/utility_functions.C
index 267dc7ba90e..9815ae6cc84 100644
--- a/src/frontend/SageIII/sage_support/utility_functions.C
+++ b/src/frontend/SageIII/sage_support/utility_functions.C
@@ -20,9 +20,6 @@
 
 #include <time.h>
 
-// Headers required only to obtain version numbers
-#include <boost/version.hpp>
-
 // DQ (10/11/2007): This is commented out to avoid use of this mechanism.
 // #include <copy_unparser.h>
 
@@ -224,14 +221,6 @@ std::string ofpVersionString()
      return ofp_version;
    }
 
-// similar to rose_boost_version_id but intended for human consumption (i.e., "1.50.0" rather than 105000).
-static std::string
-boostVersionString() {
-    return (StringUtility::numberToString(BOOST_VERSION / 100000) + "." +
-            StringUtility::numberToString(BOOST_VERSION / 100 % 1000) + "." +
-            StringUtility::numberToString(BOOST_VERSION % 100));
-}
-
 // DQ (11/1/2009): replaced "version()" with separate "version_number()" and "version_message()" functions.
 std::string version_message() {
     std::ostringstream ss;
@@ -262,8 +251,6 @@ std::string version_message() {
     ss <<"  --- full optimization:          disabled\n";
 #endif
 
-    ss <<"  --- boost library:              " <<boostVersionString() <<" (" <<rose_boost_version_path() <<")\n";
-
     //-----------------------------------------------------------------------
     // Information related to any source language analysis (not binary analysis).
     //-----------------------------------------------------------------------
@@ -369,28 +356,6 @@ std::string version_number()
 #endif
    }
 
-unsigned int rose_boost_version_id()
-  {
-#ifdef ROSE_BOOST_VERSION
-  // generated by automake
-    return ROSE_BOOST_VERSION;
-#else
-  ROSE_ASSERT(! "Expected CPP macro ROSE_BOOST_VERSION to be defined");
-  return 0; // Windows compiler requires return value
-#endif
-  }
-
-std::string rose_boost_version_path()
-  {
-#ifdef ROSE_BOOST_PATH
-  // generated by automake
-    return ROSE_BOOST_PATH;
-#else
-  ROSE_ASSERT(! "Expected CPP macro ROSE_BOOST_PATH to be defined");
-  return ""; // Windows compiler requires return value
-#endif
-  }
-
 // DQ (4/17/2010): This function must be defined if C++ support in ROSE is disabled.
 void
 outputPredefinedMacros()
@@ -402,9 +367,6 @@ outputPredefinedMacros()
 #ifdef __GNUC_MINOR__
       printf ("   macro: __GNUC_MINOR__ = %d \n",__GNUC_MINOR__);
 #endif
-#ifdef BOOST_COMPILER
-      printf ("   macro: BOOST_COMPILER = %s \n",BOOST_COMPILER);
-#endif
 #ifdef __VERSION__
       printf ("   macro: __VERSION__ = %s \n",__VERSION__);
 #endif
diff --git a/src/frontend/SageIII/sage_support/utility_functions.h b/src/frontend/SageIII/sage_support/utility_functions.h
index dc3d1f6215c..1c9cab0d9fe 100644
--- a/src/frontend/SageIII/sage_support/utility_functions.h
+++ b/src/frontend/SageIII/sage_support/utility_functions.h
@@ -16,17 +16,10 @@ std::string version_message();
 // returns a string containing the current version number
 std::string version_number();
 
-//! Boost version identifier (numeric)
-unsigned int rose_boost_version_id();
-
-//! Boost version path
-std::string rose_boost_version_path();
-
 // DQ (7/3/2013): Added support to output pre-defined macro settings.
 //! Output at least some of the predefined macro settings.
 void outputPredefinedMacros();
 
-
 // Simple interface for ROSE (error codes are in SgProject.frontendErrorCode(), backendErrorCode() )
 // tps : Need to make this function (DLL) public 
 ROSE_DLL_API SgProject* frontend ( int argc, char** argv, bool frontendConstantFolding = false );
diff --git a/src/util/StringUtility/CMakeLists.txt b/src/util/StringUtility/CMakeLists.txt
index 056bed2f07e..44ecbfe532b 100644
--- a/src/util/StringUtility/CMakeLists.txt
+++ b/src/util/StringUtility/CMakeLists.txt
@@ -2,5 +2,5 @@ add_library(util_StringUtility OBJECT
   Convert.C Escape.C FileNameClassifier.C FileUtility.C NumberToString.C Predicate.C Replace.C SplitJoin.C StringToNumber.C)
 
 install(
-  FILES Convert.h Escape.h FileUtility.h NumberToString.h Predicate.h Replace.h SplitJoin.h StringToNumber.h BitOps.h Constants.h StringUtility.h
+  FILES Convert.h Escape.h FileUtility.h NumberToString.h IntegerOps.h Predicate.h Replace.h SplitJoin.h StringToNumber.h BitOps.h Constants.h StringUtility.h
   DESTINATION ${INCLUDE_INSTALL_DIR}/util/StringUtility)
\ No newline at end of file
diff --git a/src/util/StringUtility/Convert.C b/src/util/StringUtility/Convert.C
index 3657d8d533c..060ccf38870 100644
--- a/src/util/StringUtility/Convert.C
+++ b/src/util/StringUtility/Convert.C
@@ -2,7 +2,7 @@
 
 #include <Predicate.h>
 #include <SplitJoin.h>
-#include <integerOps.h>                                 // rose
+#include <IntegerOps.h>                                 // rose
 
 #include <regex>
 #include <cassert>
diff --git a/src/util/StringUtility/FileUtility.C b/src/util/StringUtility/FileUtility.C
index 9ad36d1a9d1..02592e226cb 100644
--- a/src/util/StringUtility/FileUtility.C
+++ b/src/util/StringUtility/FileUtility.C
@@ -5,7 +5,7 @@
 #include <FileUtility.h>
 
 #include <rose_config.h>
-#include <integerOps.h>
+#include <IntegerOps.h>
 #include "rose_msvc.h"                                  // DQ (3/22/2009): Added MSVS support for ROSE.
 #include "mlog.h"
 
diff --git a/src/frontend/SageIII/sageInterface/integerOps.h b/src/util/StringUtility/IntegerOps.h
similarity index 96%
rename from src/frontend/SageIII/sageInterface/integerOps.h
rename to src/util/StringUtility/IntegerOps.h
index b5b2082f748..3b64bdf58f7 100644
--- a/src/frontend/SageIII/sageInterface/integerOps.h
+++ b/src/util/StringUtility/IntegerOps.h
@@ -3,15 +3,14 @@
 
 #include <cassert>
 #include <limits>
-#include <boost/static_assert.hpp>
-#include <boost/optional.hpp>
+#include <optional>
 
 namespace IntegerOpsPrivate {
 
     template <typename T>
     struct NumBits {
-        BOOST_STATIC_ASSERT (std::numeric_limits<T>::radix == 2);
-        BOOST_STATIC_ASSERT (std::numeric_limits<T>::is_integer);
+        static_assert (std::numeric_limits<T>::radix == 2);
+        static_assert (std::numeric_limits<T>::is_integer);
         static const size_t value = std::numeric_limits<T>::digits;
     };
 
@@ -300,15 +299,15 @@ inline size_t countClear(T val)
 
 /** Optionally returns the zero-origin position of the most significant set bit.  Returns nothing if no bits are set. */
 template<typename T>
-inline boost::optional<size_t> msb_set(T val)
+inline std::optional<size_t> msb_set(T val)
 {
     if (val!=0) {
         for (size_t bitno = 8*sizeof(T); bitno>0; --bitno) {
             if (0 != (val & shl1<T>(bitno-1)))
-                return boost::optional<size_t>(bitno-1);
+                return std::optional<size_t>(bitno-1);
         }
     }
-    return boost::optional<size_t>();
+    return std::optional<size_t>();
 }
 
 } // namespace
diff --git a/src/util/StringUtility/Makefile.am b/src/util/StringUtility/Makefile.am
index 8bb02f57c83..64d93330881 100644
--- a/src/util/StringUtility/Makefile.am
+++ b/src/util/StringUtility/Makefile.am
@@ -23,6 +23,7 @@ pkginclude_HEADERS = \
 	Convert.h					\
 	Escape.h					\
 	FileUtility.h								\
+	IntegerOps.h								\
 	NumberToString.h				\
 	Predicate.h					\
 	Replace.h					\

From bc19089a43021b0457e00fe7f99b69f770e2c768 Mon Sep 17 00:00:00 2001
From: Yonghong Yan <yanyh15@gmail.com>
Date: Wed, 13 Nov 2024 01:24:39 -0500
Subject: [PATCH 23/42] deBoost: remove all usage in src/backend

---
 src/backend/unparser/unparser.C | 5 -----
 1 file changed, 5 deletions(-)

diff --git a/src/backend/unparser/unparser.C b/src/backend/unparser/unparser.C
index 66bb664816b..ec431662504 100644
--- a/src/backend/unparser/unparser.C
+++ b/src/backend/unparser/unparser.C
@@ -28,11 +28,6 @@
 #include "IncludedFilesUnparser.h"
 #include "FileHelper.h"
 
-#include <boost/algorithm/string.hpp>
-
-// DQ (3/19/2014): Used for BOOST_CHECK_EQUAL_COLLECTIONS
-// #include <boost/test/unit_test.hpp>
-
 // DQ (9/26/2018): Added so that we can call the display function for TokenStreamSequenceToNodeMapping (for debugging).
 #include "tokenStreamMapping.h"
 

From 9a5e78bce9124909e5d71530b8d74b7d893fc348 Mon Sep 17 00:00:00 2001
From: Yonghong Yan <yanyh15@gmail.com>
Date: Wed, 13 Nov 2024 14:09:53 -0500
Subject: [PATCH 24/42] deBoost: remove boost usage in
 src/midend/astDiagnostics and astQuery

---
 src/midend/astDiagnostics/AstPerformance.C |  4 +--
 src/midend/astQuery/nodeQuery.C            |  6 ++---
 src/midend/astQuery/nodeQuery.h            |  2 --
 src/midend/astQuery/queryVariant.C         | 31 ----------------------
 4 files changed, 4 insertions(+), 39 deletions(-)

diff --git a/src/midend/astDiagnostics/AstPerformance.C b/src/midend/astDiagnostics/AstPerformance.C
index 97269df8f9d..32dc0318502 100644
--- a/src/midend/astDiagnostics/AstPerformance.C
+++ b/src/midend/astDiagnostics/AstPerformance.C
@@ -12,15 +12,13 @@
 #include <unistd.h>
 #ifndef _MSC_VER
 #include <sys/resource.h>
+#include <sys/time.h>
 #else
 #include <windows.h>            // getpagesize()
 #include "timing.h"             // gettimeofday()
 #endif
 #endif
 
-
-#include <boost/thread.hpp>     // sleep()
-
 #include "AstStatistics.h"
 
 // DQ (12/8/2006): Linux memory usage mechanism (no longer used, implemented internally (below)).
diff --git a/src/midend/astQuery/nodeQuery.C b/src/midend/astQuery/nodeQuery.C
index 063008394d0..51d2d64aa8e 100644
--- a/src/midend/astQuery/nodeQuery.C
+++ b/src/midend/astQuery/nodeQuery.C
@@ -10,7 +10,7 @@
 // string class used if compiler does not contain a C++ string class
 // include <roseString.h>
 
-#include <boost/bind.hpp>
+#include <functional>
 
 #include "nodeQuery.h"
 #define DEBUG_NODEQUERY 0
@@ -1001,7 +1001,7 @@ NodeQuerySynthesizedAttributeType NodeQuery::querySubTree ( SgNode * subTree, Va
      printf ("Inside of NodeQuery::querySubTree #5 \n");
 #endif
 
-     AstQueryNamespace::querySubTree(subTree, boost::bind(querySolverGrammarElementFromVariantVector, _1, targetVariantVector, &returnList), defineQueryType);
+     AstQueryNamespace::querySubTree(subTree, std::bind(querySolverGrammarElementFromVariantVector, std::placeholders::_1, targetVariantVector, &returnList), defineQueryType);
 
      return returnList;
    }
@@ -1010,7 +1010,7 @@ NodeQuerySynthesizedAttributeType NodeQuery::queryNodeList ( NodeQuerySynthesize
    {
      NodeQuerySynthesizedAttributeType returnList;
 
-     AstQueryNamespace::queryRange(nodeList.begin(), nodeList.end(), boost::bind(querySolverGrammarElementFromVariantVector, _1, targetVariantVector, &returnList));
+     AstQueryNamespace::queryRange(nodeList.begin(), nodeList.end(), std::bind(querySolverGrammarElementFromVariantVector, std::placeholders::_1, targetVariantVector, &returnList));
 
      return returnList;
    }
diff --git a/src/midend/astQuery/nodeQuery.h b/src/midend/astQuery/nodeQuery.h
index c867a5c2726..37adf2f3fcb 100644
--- a/src/midend/astQuery/nodeQuery.h
+++ b/src/midend/astQuery/nodeQuery.h
@@ -186,8 +186,6 @@ namespace NodeQuery
   // Functions supporting the query of variants
   void pushNewNode ( NodeQuerySynthesizedAttributeType* nodeList, const VariantVector & targetVariantVector, SgNode * astNode);
   void* querySolverGrammarElementFromVariantVector ( SgNode * astNode, VariantVector targetVariantVector,  NodeQuerySynthesizedAttributeType* returnNodeList );
-  NodeQuerySynthesizedAttributeType querySolverGrammarElementFromVariantVector ( SgNode * astNode, VariantVector targetVariantVector );
-
 
    /********************************************************************************************
    *
diff --git a/src/midend/astQuery/queryVariant.C b/src/midend/astQuery/queryVariant.C
index 27a36beb726..474d5db80d5 100644
--- a/src/midend/astQuery/queryVariant.C
+++ b/src/midend/astQuery/queryVariant.C
@@ -226,36 +226,5 @@ void* querySolverGrammarElementFromVariantVector ( SgNode * astNode, VariantVect
      return NULL;
    } /* End function querySolverUnionFields() */
 
-NodeQuerySynthesizedAttributeType
-querySolverGrammarElementFromVariantVector ( 
-   SgNode * astNode, 
-   VariantVector targetVariantVector )
-   {
-  // This function extracts type nodes that would not be traversed so that they can
-  // accumulated to a list.  The specific nodes collected into the list is controlled
-  // by targetVariantVector.
-
-     ROSE_ASSERT (astNode != NULL);
-     NodeQuerySynthesizedAttributeType returnNodeList;
-
-     Rose_STL_Container<SgNode*> nodesToVisitTraverseOnlyOnce;
-
-     pushNewNode (&returnNodeList,targetVariantVector,astNode);
-
-     vector<SgNode*>               succContainer      = astNode->get_traversalSuccessorContainer();
-     vector<pair<SgNode*,string> > allNodesInSubtree  = astNode->returnDataMemberPointers();
-
-     if( succContainer.size() != allNodesInSubtree.size() )
-     for(vector<pair<SgNode*,string> >::iterator iItr = allNodesInSubtree.begin(); iItr!= allNodesInSubtree.end();
-         ++iItr )
-       if( isSgType(iItr->first) != NULL  )
-         if(std::find(succContainer.begin(),succContainer.end(),iItr->first) == succContainer.end() )
-           pushNewNode (&returnNodeList,targetVariantVector,iItr->first);
-
-     
-     return returnNodeList;
-   } /* End function querySolverUnionFields() */
-
-
 }//END NAMESPACE NODEQUERY
 

From 871834ca7bfb9f6c572b6470eba78c62187b1354 Mon Sep 17 00:00:00 2001
From: Yonghong Yan <yanyh15@gmail.com>
Date: Wed, 13 Nov 2024 14:27:19 -0500
Subject: [PATCH 25/42] deBoost: remove boost usage in
 src/midend/programTransformation

---
 .../programTransformation/astOutlining/GenerateFunc.cc       | 5 +++--
 .../programTransformation/astOutlining/PragmaInterface.cc    | 4 ++--
 .../ExtractFunctionArguments.C                               | 1 -
 3 files changed, 5 insertions(+), 5 deletions(-)

diff --git a/src/midend/programTransformation/astOutlining/GenerateFunc.cc b/src/midend/programTransformation/astOutlining/GenerateFunc.cc
index 226b88b2f9f..57853a80c01 100644
--- a/src/midend/programTransformation/astOutlining/GenerateFunc.cc
+++ b/src/midend/programTransformation/astOutlining/GenerateFunc.cc
@@ -22,6 +22,7 @@
 #include <sstream>
 #include <set>
 #include <map>
+#include <unordered_map>
 
 #include "Outliner.hh"
 #include "ASTtools.hh"
@@ -1397,8 +1398,8 @@ class SymbolMapOfTwoFiles
           dict[i1->second]=i2->second;
 #endif          
         rose_hash_multimap::iterator i1, i2;
-        boost::unordered_map<string, SgVariableSymbol*> varSymDict; 
-        boost::unordered_map<string, SgFunctionSymbol*> funcSymDict; 
+        std::unordered_map<string, SgVariableSymbol*> varSymDict; 
+        std::unordered_map<string, SgFunctionSymbol*> funcSymDict; 
 
         // cache mapping of new symbols,indexed by qualified name : qualified name to symbol
         for (i2=set2->begin(); i2!=set2->end(); i2++)
diff --git a/src/midend/programTransformation/astOutlining/PragmaInterface.cc b/src/midend/programTransformation/astOutlining/PragmaInterface.cc
index af02e2f3021..6dcec90eb2c 100644
--- a/src/midend/programTransformation/astOutlining/PragmaInterface.cc
+++ b/src/midend/programTransformation/astOutlining/PragmaInterface.cc
@@ -19,7 +19,7 @@
 #include "Outliner.hh"
 #include "ASTtools.hh"
 #include "PreprocessingInfo.hh"
-#include <boost/algorithm/string/trim.hpp>
+#include "Trim.h"
 
 //! Simplest outlining directives, applied to a single statement.
 static const std::string PRAGMA_OUTLINE ("rose_outline");
@@ -89,7 +89,7 @@ processFortranComment(SgLocatedNode* node)
     if ((*i)->getTypeOfDirective() == PreprocessingInfo::FortranStyleComment)
     {
       string commentString = (*i)->getString();
-      boost::algorithm::trim(commentString);
+      trim(commentString);
       if (   (commentString == "!$"+PRAGMA_OUTLINE) 
           || (commentString == "c$"+PRAGMA_OUTLINE) 
           || (commentString == "*$"+PRAGMA_OUTLINE)) 
diff --git a/src/midend/programTransformation/extractFunctionArgumentsNormalization/ExtractFunctionArguments.C b/src/midend/programTransformation/extractFunctionArgumentsNormalization/ExtractFunctionArguments.C
index 9832c9e0cc3..aa0bcea39dd 100644
--- a/src/midend/programTransformation/extractFunctionArgumentsNormalization/ExtractFunctionArguments.C
+++ b/src/midend/programTransformation/extractFunctionArgumentsNormalization/ExtractFunctionArguments.C
@@ -3,7 +3,6 @@
 #include "SingleStatementToBlockNormalization.h"
 
 using namespace std;
-using namespace boost;
 
 /** Performs the function argument extraction on all function calls in the given subtree of the AST. */
 /** It does not do transofrmations in places where it is not safe. If you pass doUnsafeNormalization= true, we will normalize all callsites ignoring the safety (Suggested by Markus Schordan) */

From a880ef197a6c44389396b66a95fb8643e9ffa578 Mon Sep 17 00:00:00 2001
From: Yonghong Yan <yanyh15@gmail.com>
Date: Wed, 13 Nov 2024 17:38:42 -0500
Subject: [PATCH 26/42] deBoost: remove boost usage in midend/programAnalysis

---
 src/backend/unparser/unparser.C               | 30 ------------------
 .../astTokenStream/doCompleteMapping.C        |  3 --
 .../CompilerOutputParser.C                    |  2 ++
 src/frontend/SageIII/memory-pool-snapshot.C   |  1 +
 src/frontend/SageIII/sage3basic.h             |  2 ++
 .../SageIII/sageInterface/sageBuilder.C       |  3 +-
 .../SageIII/sageInterface/sageInterface.C     |  1 +
 .../SageIII/sage_support/keep_going.cpp       |  3 +-
 src/midend/abstractLayer/SgNodeHelper.C       |  3 +-
 src/midend/astDump/AstPDFGeneration.C         |  4 +--
 .../astProcessing/AstAttributeMechanism.C     |  1 +
 .../astUtil/astInterface/CPPAstInterface.C    |  1 +
 .../CallGraphAnalysis/CMakeLists.txt          |  2 +-
 .../CallGraphAnalysis/CallGraph.h             |  6 ++--
 .../CallGraphAnalysis/ClassHierarchyGraph.h   |  8 ++---
 .../CallGraphAnalysis/Makefile.am             |  2 +-
 .../CallGraphAnalysis/Makefile_variables      |  3 +-
 .../CallGraphAnalysis/newCallGraph.C          |  3 +-
 src/midend/programAnalysis/OAWrap/OAWrap.h    |  1 +
 .../IntraProcAliasAnalysis.C                  | 14 ++++-----
 .../IntraProcAliasAnalysis.h                  | 31 +++++++++----------
 .../PtrAliasAnalysis.C                        | 16 +++++-----
 .../PtrAliasAnalysis.h                        | 10 +++---
 .../VirtualFunctionAnalysis.C                 |  4 +--
 .../defUseAnalysis/DefUseAnalysis.cpp         | 13 +++++---
 .../defUseAnalysis/DefUseAnalysis.h           |  5 ---
 .../defUseAnalysis/LivenessAnalysis.cpp       |  2 --
 .../genericDataflow/analysis/dataflow.C       |  7 ++---
 .../genericDataflow/analysis/dataflow.h       |  8 ++---
 .../rwAccessLabeler/rwAccessLabeler.C         |  1 +
 .../simpleAnalyses/divAnalysis.C              | 13 ++++----
 .../simpleAnalyses/divAnalysis.h              |  7 +++--
 .../simpleAnalyses/liveDeadVarAnalysis.h      |  7 +++--
 .../programAnalysis/pointerAnal/PtrAnal.h     |  6 ++--
 .../variableRenaming/VariableRenaming.C       |  5 +--
 .../variableRenaming/VariableRenaming.h       | 22 ++++++++++---
 .../astOutlining/PragmaInterface.cc           |  3 +-
 .../constantFolding/constantFolding.h         |  2 ++
 src/rose-config.C                             |  8 ++---
 src/util/StringUtility/Trim.h                 | 16 ----------
 40 files changed, 121 insertions(+), 158 deletions(-)
 delete mode 100644 src/util/StringUtility/Trim.h

diff --git a/src/backend/unparser/unparser.C b/src/backend/unparser/unparser.C
index ec431662504..f6ceb3bf61f 100644
--- a/src/backend/unparser/unparser.C
+++ b/src/backend/unparser/unparser.C
@@ -2987,36 +2987,6 @@ unparseFile ( SgFile* file, UnparseFormatHelp *unparseHelp, UnparseDelegate* unp
             outputFilename = StringUtility::stripFileSuffixFromFileName (outputFilename);
             outputFilename += ".cu";
         }
-        else if (file->get_X10_only())
-        {
-            // X10 is Java source code; see Java file/class naming conventions.
-            // Filenames are based on the Java Class name contained in the file.
-            SgSourceFile *sourcefile = isSgSourceFile(file);
-            ROSE_ASSERT(sourcefile && "Try to unparse an SgFile not being an SgSourceFile using the x10 unparser");
-
-            SgProject *project = sourcefile -> get_project();
-            ASSERT_not_null(project);
-
-            SgJavaPackageStatement *package_statement = sourcefile -> get_package();
-            string package_name = (package_statement ? package_statement -> get_name().getString() : "");
-            //NOTE: Default package equals the empty string ""
-            //ROSE_ASSERT((packageDecl != NULL) && "Couldn't find the package definition of the java source file");
-            string outFolder = "";
-            string ds = project -> get_Java_source_destdir();
-            if (ds != "") {
-                outFolder = ds;
-                outFolder += "/";
-            }
-            outFolder += "rose-output/";
-            boost::replace_all(package_name, ".", "/");
-            outFolder += package_name;
-            outFolder += (package_name.size() > 0 ? "/" : "");
-            // Create package folder structure
-            string mkdirCommand = string("mkdir -p ") + outFolder;
-            int status = system (mkdirCommand.c_str());
-            ROSE_ASSERT(status == 0);
-            outputFilename = outFolder + file -> get_sourceFileNameWithoutPath();
-        }
         else
         {
             //ROSE_ASSERT (! "Not implemented, or unknown file type");
diff --git a/src/frontend/SageIII/astTokenStream/doCompleteMapping.C b/src/frontend/SageIII/astTokenStream/doCompleteMapping.C
index c4a3098266e..329bffb95fc 100644
--- a/src/frontend/SageIII/astTokenStream/doCompleteMapping.C
+++ b/src/frontend/SageIII/astTokenStream/doCompleteMapping.C
@@ -3,10 +3,7 @@
 #include "sage3basic.h"
 #include "doCompleteMapping.h"
 
-
-
 using namespace std;
-using namespace boost;
 
 separator::separator(int bp, int ep){
         begin_pos = bp;
diff --git a/src/frontend/SageIII/includeDirectivesProcessing/CompilerOutputParser.C b/src/frontend/SageIII/includeDirectivesProcessing/CompilerOutputParser.C
index f0050fea3c7..6d3389c8fdf 100644
--- a/src/frontend/SageIII/includeDirectivesProcessing/CompilerOutputParser.C
+++ b/src/frontend/SageIII/includeDirectivesProcessing/CompilerOutputParser.C
@@ -1,6 +1,8 @@
 // DQ (10/5/2014): This is more strict now that we include rose_config.h in the sage3basic.h.
 // #include <rose.h>
 #include "sage3basic.h"
+#include <unistd.h>     // For fork and execv
+#include <sys/types.h>  // For pid_t
 
 #include <rose_config.h>
 
diff --git a/src/frontend/SageIII/memory-pool-snapshot.C b/src/frontend/SageIII/memory-pool-snapshot.C
index fe41044a7cb..16466ac51b5 100644
--- a/src/frontend/SageIII/memory-pool-snapshot.C
+++ b/src/frontend/SageIII/memory-pool-snapshot.C
@@ -1,6 +1,7 @@
 
 #include "sage3basic.h"
 #include "memory-pool-snapshot.h"
+#include <iterator>
 
 namespace Rose {
 
diff --git a/src/frontend/SageIII/sage3basic.h b/src/frontend/SageIII/sage3basic.h
index d26fd3ec4b8..9e87b3ec079 100644
--- a/src/frontend/SageIII/sage3basic.h
+++ b/src/frontend/SageIII/sage3basic.h
@@ -127,6 +127,8 @@
 //#include <cstdlib> // For abort()
 #include <algorithm>
 #include <fstream>
+#include <cstring>
+#include <unistd.h>
 
 // DQ (8/25/2014): Added logic to isTemplateDeclaration(a_routine_ptr) to force isTemplateDeclaration 
 // in ROSE/EDG connection to be false where the topScopeStack() is a template class instantaition scope.
diff --git a/src/frontend/SageIII/sageInterface/sageBuilder.C b/src/frontend/SageIII/sageInterface/sageBuilder.C
index 7954ae25cf6..6acbe05d16a 100644
--- a/src/frontend/SageIII/sageInterface/sageBuilder.C
+++ b/src/frontend/SageIII/sageInterface/sageBuilder.C
@@ -16,7 +16,6 @@
 // #include "sageBuilder.h"
    #include <fstream>
 #endif
-#include "Trim.h"
 
 // DQ (4/3/2012): Added so that I can enforce some rules as the AST is constructed.
 #include "AstConsistencyTests.h"
@@ -16945,7 +16944,7 @@ PreprocessingInfo* SageBuilder::buildCpreprocessorDefineDeclaration(SgLocatedNod
     ROSE_ASSERT(target != NULL); //dangling #define xxx is not allowed in the ROSE AST
     // simple input verification
     std::string content2 = content;
-    trim(content2);
+    Rose::StringUtility::trim(content2);
     string prefix = "#define";
     string::size_type pos = content2.find(prefix, 0);
     ROSE_ASSERT (pos == 0);
diff --git a/src/frontend/SageIII/sageInterface/sageInterface.C b/src/frontend/SageIII/sageInterface/sageInterface.C
index 7d612076b00..cb6c1c0bcf3 100644
--- a/src/frontend/SageIII/sageInterface/sageInterface.C
+++ b/src/frontend/SageIII/sageInterface/sageInterface.C
@@ -53,6 +53,7 @@
 #include <algorithm> // for set operations
 #include <numeric>   // for std::accumulate
 #include <map>
+#include <cstring>
 
 // DQ (11/5/2019): Added to support SageInterface::statementCanBeTransformed().
 namespace EDG_ROSE_Translation
diff --git a/src/frontend/SageIII/sage_support/keep_going.cpp b/src/frontend/SageIII/sage_support/keep_going.cpp
index 16c2bfb4cd0..e0c02b157db 100644
--- a/src/frontend/SageIII/sage_support/keep_going.cpp
+++ b/src/frontend/SageIII/sage_support/keep_going.cpp
@@ -19,7 +19,8 @@
 #include <ctime>
 #include <iomanip>
 #include <string>
-#include <string>
+#include <cstring>
+#include <signal.h>  // For signal constants like SIGSEGV, SIGINT, etc.
 #include <vector>
 #ifdef __linux__
 #include <utime.h>
diff --git a/src/midend/abstractLayer/SgNodeHelper.C b/src/midend/abstractLayer/SgNodeHelper.C
index 10e57a52061..12b5e920db1 100644
--- a/src/midend/abstractLayer/SgNodeHelper.C
+++ b/src/midend/abstractLayer/SgNodeHelper.C
@@ -4,7 +4,8 @@
 #include <list>
 #include <sstream>
 #include "SgNodeHelper.h"
-#include "limits.h"
+#include <limits>
+#include <climits>
 #include "RoseAst.h"
 
 using namespace std;
diff --git a/src/midend/astDump/AstPDFGeneration.C b/src/midend/astDump/AstPDFGeneration.C
index 4aa46c09bef..4e72903e3c2 100644
--- a/src/midend/astDump/AstPDFGeneration.C
+++ b/src/midend/astDump/AstPDFGeneration.C
@@ -12,8 +12,8 @@
 #include <assert.h>
 #include <iostream>
 
-// #include <string>
-// #include <sstream>
+#include <cstring>
+#include <sstream>
 
 #include "PDFGeneration.h"
 #include "AstPDFGeneration.h"
diff --git a/src/midend/astProcessing/AstAttributeMechanism.C b/src/midend/astProcessing/AstAttributeMechanism.C
index 785c8c60ce6..efe32fcc848 100644
--- a/src/midend/astProcessing/AstAttributeMechanism.C
+++ b/src/midend/astProcessing/AstAttributeMechanism.C
@@ -4,6 +4,7 @@
 #include "roseInternal.h"
 #include <sstream>
 #include <cstddef>
+#include <cstring>
 
 using namespace Rose;
 
diff --git a/src/midend/astUtil/astInterface/CPPAstInterface.C b/src/midend/astUtil/astInterface/CPPAstInterface.C
index 92caccc0e0c..41efd2463f4 100644
--- a/src/midend/astUtil/astInterface/CPPAstInterface.C
+++ b/src/midend/astUtil/astInterface/CPPAstInterface.C
@@ -8,6 +8,7 @@
 
 #include "CPPAstInterface.h"
 #include "AstInterface_ROSE.h"
+#include <cstring>
 using namespace std;
 //! Check if a node is a data member access function for an object, 
 // such as dot (object.a) or arrow (objectptr->a)expression
diff --git a/src/midend/programAnalysis/CallGraphAnalysis/CMakeLists.txt b/src/midend/programAnalysis/CallGraphAnalysis/CMakeLists.txt
index 5f180c51193..173c8317c3a 100644
--- a/src/midend/programAnalysis/CallGraphAnalysis/CMakeLists.txt
+++ b/src/midend/programAnalysis/CallGraphAnalysis/CMakeLists.txt
@@ -17,7 +17,7 @@ install(FILES  CallGraph.h ClassHierarchyGraph.h DESTINATION ${INCLUDE_INSTALL_D
 #
 #
 #
-#INCLUDES = $(ROSE_INCLUDES) $(BOOST_CPPFLAGS) 
+#INCLUDES = $(ROSE_INCLUDES)
 #libCallGraphSources =  CallGraph.C ClassHierarchyGraph.C
 #
 #noinst_LTLIBRARIES = libCallGraph.la
diff --git a/src/midend/programAnalysis/CallGraphAnalysis/CallGraph.h b/src/midend/programAnalysis/CallGraphAnalysis/CallGraph.h
index 28684ea4e01..2f480e8bfbf 100644
--- a/src/midend/programAnalysis/CallGraphAnalysis/CallGraph.h
+++ b/src/midend/programAnalysis/CallGraphAnalysis/CallGraph.h
@@ -13,7 +13,7 @@
 #include <string>
 #include <functional>
 #include <queue>
-#include <boost/unordered_map.hpp>
+#include <unordered_map>
 
 class FunctionData;
 
@@ -153,7 +153,7 @@ class ROSE_DLL_API CallGraphBuilder
     //void classifyCallGraph();
 
     //We map each function to the corresponding graph node
-    boost::unordered_map<SgFunctionDeclaration*, SgGraphNode*>& getGraphNodesMapping(){ return graphNodes; }
+    std::unordered_map<SgFunctionDeclaration*, SgGraphNode*>& getGraphNodesMapping(){ return graphNodes; }
 
     //! Retrieve the node matching a function declaration using firstNondefiningDeclaration (does not work across translation units)
     SgGraphNode * hasGraphNodeFor(SgFunctionDeclaration * fdecl) const;
@@ -164,7 +164,7 @@ class ROSE_DLL_API CallGraphBuilder
     SgProject *project;
     SgIncidenceDirectedGraph *graph;
     //We map each function to the corresponding graph node
-    typedef boost::unordered_map<SgFunctionDeclaration*, SgGraphNode*> GraphNodes;
+    typedef std::unordered_map<SgFunctionDeclaration*, SgGraphNode*> GraphNodes;
     GraphNodes graphNodes;
 
 };
diff --git a/src/midend/programAnalysis/CallGraphAnalysis/ClassHierarchyGraph.h b/src/midend/programAnalysis/CallGraphAnalysis/ClassHierarchyGraph.h
index 6c6be563ded..963a5467777 100644
--- a/src/midend/programAnalysis/CallGraphAnalysis/ClassHierarchyGraph.h
+++ b/src/midend/programAnalysis/CallGraphAnalysis/ClassHierarchyGraph.h
@@ -3,18 +3,18 @@
 
 #include <vector>
 #include <map>
-#include <boost/unordered_set.hpp>
+#include <unordered_map>
+#include <unordered_set>
 
 class ROSE_DLL_API ClassHierarchyWrapper
 {
 public:
-    typedef boost::unordered_set<SgClassDefinition*> ClassDefSet;
+    typedef std::unordered_set<SgClassDefinition*> ClassDefSet;
 
-    typedef boost::unordered_map<std::string, ClassDefSet> MangledNameToClassDefsMap;
+    typedef std::unordered_map<std::string, ClassDefSet> MangledNameToClassDefsMap;
 
 private:
 
-
     /** Map from each class to all its immediate superclasses. */
     MangledNameToClassDefsMap directParents;
 
diff --git a/src/midend/programAnalysis/CallGraphAnalysis/Makefile.am b/src/midend/programAnalysis/CallGraphAnalysis/Makefile.am
index 3f87164978a..5731f0524f0 100644
--- a/src/midend/programAnalysis/CallGraphAnalysis/Makefile.am
+++ b/src/midend/programAnalysis/CallGraphAnalysis/Makefile.am
@@ -2,7 +2,7 @@ include $(top_srcdir)/config/Makefile.for.ROSE.includes.and.libs
 
 
 
-AM_CPPFLAGS = $(ROSE_INCLUDES) $(BOOST_CPPFLAGS) 
+AM_CPPFLAGS = $(ROSE_INCLUDES)
 libCallGraphSources =  newCallGraph.C CallGraph.C ClassHierarchyGraph.C
 
 noinst_LTLIBRARIES = libCallGraph.la
diff --git a/src/midend/programAnalysis/CallGraphAnalysis/Makefile_variables b/src/midend/programAnalysis/CallGraphAnalysis/Makefile_variables
index 22b93421780..f3153ae53c9 100644
--- a/src/midend/programAnalysis/CallGraphAnalysis/Makefile_variables
+++ b/src/midend/programAnalysis/CallGraphAnalysis/Makefile_variables
@@ -1,7 +1,6 @@
 # Non-recursive Makefile
 
-mpaCallGraphAnalysis_includes=\
-	$(BOOST_CPPFLAGS)
+mpaCallGraphAnalysis_includes=
 
 
 mpaCallGraphAnalysis_la_sources=\
diff --git a/src/midend/programAnalysis/CallGraphAnalysis/newCallGraph.C b/src/midend/programAnalysis/CallGraphAnalysis/newCallGraph.C
index 827a66a8c7e..094af1c95d5 100644
--- a/src/midend/programAnalysis/CallGraphAnalysis/newCallGraph.C
+++ b/src/midend/programAnalysis/CallGraphAnalysis/newCallGraph.C
@@ -16,6 +16,7 @@
 #include <errno.h>
 #include <stdio.h>
 #include <fcntl.h>
+#include <cstring>
 #include <unistd.h>
 #ifndef _MSC_VER
 #include <sys/resource.h>
@@ -25,8 +26,6 @@
 #endif
 #endif
 
-#include <boost/thread.hpp>     // sleep()
-
 #define DEBUG_CALLGRAPH 0
 
 using namespace std;
diff --git a/src/midend/programAnalysis/OAWrap/OAWrap.h b/src/midend/programAnalysis/OAWrap/OAWrap.h
index f446a91dfb3..c0fc9ee53c1 100644
--- a/src/midend/programAnalysis/OAWrap/OAWrap.h
+++ b/src/midend/programAnalysis/OAWrap/OAWrap.h
@@ -5,6 +5,7 @@
 #include <list>
 #include <map>
 #include <string>
+#include <cstring>
 
 #include <OAConfig.h>
 namespace OpenAnalysis {
diff --git a/src/midend/programAnalysis/VirtualFunctionAnalysis/IntraProcAliasAnalysis.C b/src/midend/programAnalysis/VirtualFunctionAnalysis/IntraProcAliasAnalysis.C
index db645b21a82..279bda4e788 100644
--- a/src/midend/programAnalysis/VirtualFunctionAnalysis/IntraProcAliasAnalysis.C
+++ b/src/midend/programAnalysis/VirtualFunctionAnalysis/IntraProcAliasAnalysis.C
@@ -1,6 +1,6 @@
 #include "sage3basic.h"
 #include "IntraProcAliasAnalysis.h"
-
+#include <unordered_map>
 
 void CompactRepresentation::computeAliases (SgGraphNode *node, int derefLevel, vector<SgGraphNode *> & sol) {
     
@@ -333,7 +333,7 @@ void IntraProcAliasAnalysis::buildCFG() {
         // run a bfs and list the nodes
         cfgNodes.clear();
         std::queue<SgGraphNode *> workQ;
-        //boost::unordered_map<SgGraphNode* , bool> visited;
+        //std::unordered_map<SgGraphNode* , bool> visited;
         vector<SgGraphNode *>visited;
         workQ.push(cfg->getEntry());
         visited.push_back(cfg->getEntry());
@@ -364,8 +364,8 @@ void IntraProcAliasAnalysis::buildCFG() {
 
 
 IntraProcAliasAnalysis::IntraProcAliasAnalysis(SgNode *head, ClassHierarchyWrapper *_classHierarchy, CallGraphBuilder *_cgBuilder,
-                    boost::unordered_map<SgFunctionDeclaration *, IntraProcAliasAnalysis *> &_mapping,
-                    boost::unordered_map<SgExpression*, std::vector<SgFunctionDeclaration*> > &_resolver) :
+                    std::unordered_map<SgFunctionDeclaration *, IntraProcAliasAnalysis *> &_mapping,
+                    std::unordered_map<SgExpression*, std::vector<SgFunctionDeclaration*> > &_resolver) :
            IntraProcDataFlowAnalysis<SgGraphNode, CompReprPtr>(head), classHierarchy(_classHierarchy), cfg(0), cgBuilder(_cgBuilder), mapping(_mapping), resolver(_resolver) {
 
         ROSE_ASSERT(isSgFunctionDeclaration(head));    
@@ -952,7 +952,7 @@ void ProcessExpression::processRHS(SgNode *node, struct AliasRelationNode &arNod
     SgVarRefExp *var_exp;
     int derefLevel = 0;
     static int new_index;
-    static boost::unordered_map<SgExpression*, SgVariableSymbol *> new_variables;
+    static std::unordered_map<SgExpression*, SgVariableSymbol *> new_variables;
     
     switch (node->variantT()) {
     
@@ -1162,7 +1162,7 @@ void CollectAliasRelations::processNode(SgGraphNode* g_node){
 
 }
 
-void CollectAliasRelations::recursiveCollect(SgGraphNode *node, boost::unordered_map<SgGraphNode*, COLOR> &colors){
+void CollectAliasRelations::recursiveCollect(SgGraphNode *node, std::unordered_map<SgGraphNode*, COLOR> &colors){
 
     if(node == NULL) return;
     
@@ -1193,7 +1193,7 @@ void CollectAliasRelations::run() {
     
     set<SgGraphNode*> allNodes = graph->computeNodeSet();
     
-    boost::unordered_map<SgGraphNode*, COLOR> colors;
+    std::unordered_map<SgGraphNode*, COLOR> colors;
 
     for(SgGraphNode *node: allNodes) {
             colors[node] = WHITE;
diff --git a/src/midend/programAnalysis/VirtualFunctionAnalysis/IntraProcAliasAnalysis.h b/src/midend/programAnalysis/VirtualFunctionAnalysis/IntraProcAliasAnalysis.h
index 5c340b17700..06532ba26e7 100644
--- a/src/midend/programAnalysis/VirtualFunctionAnalysis/IntraProcAliasAnalysis.h
+++ b/src/midend/programAnalysis/VirtualFunctionAnalysis/IntraProcAliasAnalysis.h
@@ -4,11 +4,10 @@
 #include "customFilteredCFG.h"
 #include "ClassHierarchyGraph.h"
 #include "CallGraph.h"
-#include <boost/shared_ptr.hpp>
-#include <boost/unordered_map.hpp>
+#include <memory>
+#include <unordered_map>
 #include <algorithm>
 
-using namespace boost;
 using namespace std;
 
 //! A struct to hold the information about an alias node
@@ -110,7 +109,7 @@ class CompReprBase{
 class CompactRepresentation : public CompReprBase{
     
     //! A Map to hold the SgNode to SgGraphNode mapping
-    boost::unordered_map<SgNode *,SgGraphNode *> all_nodes;
+    std::unordered_map<SgNode *,SgGraphNode *> all_nodes;
     
     //! Get Graph Node from SgNode
     SgGraphNode * getGraphNode(SgNode *node);
@@ -142,7 +141,7 @@ class CompactRepresentation : public CompReprBase{
     
 public:
     //! Get the Mapping from SgNode to SgGraphNode
-    boost::unordered_map<SgNode *,SgGraphNode *>  getNodesMapping(){ return all_nodes;}
+    std::unordered_map<SgNode *,SgGraphNode *>  getNodesMapping(){ return all_nodes;}
     CompactRepresentation() {  init(); }
     
     //! Get the Graph
@@ -185,13 +184,13 @@ class CompactRepresentation : public CompReprBase{
 //! A Shared Pointer Wrapper for CompactRepresentation
 class CompReprPtr  {
     //! The shared pointer holding th CompactRepresentation
-     boost::shared_ptr<CompReprBase> ptr;
+     std::shared_ptr<CompReprBase> ptr;
 public:
     //! Constructor
-    CompReprPtr() { ptr = boost::shared_ptr<CompReprBase>(); }
+    CompReprPtr() { ptr = std::shared_ptr<CompReprBase>(); }
     
     //! Constructor
-    CompReprPtr(CompactRepresentation *repr)   { ptr = boost::shared_ptr<CompReprBase>(repr);  }
+    CompReprPtr(CompactRepresentation *repr)   { ptr = std::shared_ptr<CompReprBase>(repr);  }
     
     //! get the actual pointer to compact representation
     CompReprBase * get() const{ return ptr.get();  }
@@ -209,16 +208,16 @@ class CompReprPtr  {
 //! Helper class to hold Alias Information
 class AliasInfoGenerator {
     //!  IN of every CFG Node
-    boost::unordered_map<SgGraphNode *, CompReprPtr> ins;
+    std::unordered_map<SgGraphNode *, CompReprPtr> ins;
     
     //!  OUT of every CFG Node
-    boost::unordered_map<SgGraphNode *, CompReprPtr> outs;
+    std::unordered_map<SgGraphNode *, CompReprPtr> outs;
     
     //! All the Return Stmts
     std::vector <AliasRelationNode > returnStmts;
     
     //! All the AliasRelations for every CFG Node 
-    boost::unordered_map<SgGraphNode *, std::vector <std::pair<AliasRelationNode, AliasRelationNode> > >aliasRelations;    
+    std::unordered_map<SgGraphNode *, std::vector <std::pair<AliasRelationNode, AliasRelationNode> > >aliasRelations;    
     
 public :
     AliasInfoGenerator();
@@ -278,7 +277,7 @@ class CollectAliasRelations {
       void run();
   private:
       //! recursively Collect Alias Information from the CFG Nodes
-      void recursiveCollect(SgGraphNode *, boost::unordered_map<SgGraphNode*, CollectAliasRelations::COLOR> &);
+      void recursiveCollect(SgGraphNode *, std::unordered_map<SgGraphNode*, CollectAliasRelations::COLOR> &);
 };
 
 //! IntraProcedurial DataFlow Analysis to compute exit and entry from all the function which
@@ -316,10 +315,10 @@ class IntraProcAliasAnalysis :
    virtual void buildCFG() ;
    
    //! A mapping to hold SgFunctionDeclaration to IntraProcAliasAnalysis 
-   boost::unordered_map<SgFunctionDeclaration *, IntraProcAliasAnalysis *> &mapping;
+   std::unordered_map<SgFunctionDeclaration *, IntraProcAliasAnalysis *> &mapping;
    
    //! A mapping to hold function resolve data
-   boost::unordered_map<SgExpression*, std::vector<SgFunctionDeclaration*> > &resolver;
+   std::unordered_map<SgExpression*, std::vector<SgFunctionDeclaration*> > &resolver;
    
    //! Retrieve Alias Relations from Function Parameters. Map data between actual and formal parameters.
    //! Handles return values as well.
@@ -343,8 +342,8 @@ class IntraProcAliasAnalysis :
 public:
     //ReachingDefinitionAnalysis(SgNode *head) : DataFlowAnalysis<ReachingDefNode, ReachingDefinitions>(head),  g(0) {
     IntraProcAliasAnalysis(SgNode *head, ClassHierarchyWrapper *_classHierarchy, CallGraphBuilder *_cgB, 
-                boost::unordered_map<SgFunctionDeclaration *, IntraProcAliasAnalysis *> &mapping,
-                boost::unordered_map<SgExpression*, std::vector<SgFunctionDeclaration*> > &resolver);
+                std::unordered_map<SgFunctionDeclaration *, IntraProcAliasAnalysis *> &mapping,
+                std::unordered_map<SgExpression*, std::vector<SgFunctionDeclaration*> > &resolver);
     
     //! Get the Entry CompactRepresentation Graph for the function
     CompReprPtr getFunctionEntry() {return entry;}
diff --git a/src/midend/programAnalysis/VirtualFunctionAnalysis/PtrAliasAnalysis.C b/src/midend/programAnalysis/VirtualFunctionAnalysis/PtrAliasAnalysis.C
index 80727f8bbb7..9b0316d3116 100644
--- a/src/midend/programAnalysis/VirtualFunctionAnalysis/PtrAliasAnalysis.C
+++ b/src/midend/programAnalysis/VirtualFunctionAnalysis/PtrAliasAnalysis.C
@@ -63,7 +63,7 @@ struct OnlyNonCompilerGenerated : public std::unary_function<bool, SgFunctionDec
         AstDOTGeneration dotgen;
         dotgen.writeIncidenceGraphToDOTFile(cgBuilder->getGraph(), "init_call_graph.dot");
 #if 0        
-        typedef boost::unordered_map<SgFunctionDeclaration*, SgGraphNode*> res_map;    
+        typedef std::unordered_map<SgFunctionDeclaration*, SgGraphNode*> res_map;    
         for (res_map::value_type it: cg2.getGraphNodesMapping()) {
             std::cout << it.first <<" - "<< isSgFunctionDeclaration(it.first->get_definingDeclaration()) << " - " << it.first->get_name().getString() << std::endl;
         }
@@ -71,7 +71,7 @@ struct OnlyNonCompilerGenerated : public std::unary_function<bool, SgFunctionDec
  }
  PtrAliasAnalysis::~PtrAliasAnalysis() {
 
-        typedef boost::unordered_map<SgFunctionDeclaration *, IntraProcAliasAnalysis *> map;
+        typedef std::unordered_map<SgFunctionDeclaration *, IntraProcAliasAnalysis *> map;
         for (map::value_type it: intraAliases) {
                 delete ((IntraProcAliasAnalysis *)it.second);
         }
@@ -105,7 +105,7 @@ struct OnlyNonCompilerGenerated : public std::unary_function<bool, SgFunctionDec
  }
 
 void PtrAliasAnalysis:: SortCallGraphRecursive(SgFunctionDeclaration* targetFunction, SgIncidenceDirectedGraph* callGraph,
-               boost::unordered_map<SgFunctionDeclaration*, SgGraphNode*> &graphNodeToFunction, boost::unordered_map<SgGraphNode*, COLOR> &colors,
+               std::unordered_map<SgFunctionDeclaration*, SgGraphNode*> &graphNodeToFunction, std::unordered_map<SgGraphNode*, COLOR> &colors,
                vector<SgFunctionDeclaration*> &processingOrder, TRAVERSAL_TYPE order) {
         
                 //If the function is already in the list of functions to be processed, don't add it again.
@@ -116,7 +116,7 @@ void PtrAliasAnalysis:: SortCallGraphRecursive(SgFunctionDeclaration* targetFunc
         {
           printf("The function %s has no vertex in the call graph!\n", targetFunction->get_name().str());
           printf("graphNodeToFunction contains:\n");
-          boost::unordered_map<SgFunctionDeclaration*, SgGraphNode*>::const_iterator iter;
+          std::unordered_map<SgFunctionDeclaration*, SgGraphNode*>::const_iterator iter;
           for (iter= graphNodeToFunction.begin(); iter != graphNodeToFunction.end(); iter ++)
           {
             SgFunctionDeclaration* func = (*iter).first;
@@ -170,11 +170,11 @@ void PtrAliasAnalysis:: SortCallGraphRecursive(SgFunctionDeclaration* targetFunc
  * @param order: 0-topological, 1- reverse
  */
 void PtrAliasAnalysis::SortCallGraphNodes(SgFunctionDeclaration* targetFunction, SgIncidenceDirectedGraph* callGraph,
-                boost::unordered_map<SgFunctionDeclaration*, SgGraphNode*> &graphNodeToFunction,
+                std::unordered_map<SgFunctionDeclaration*, SgGraphNode*> &graphNodeToFunction,
                 vector<SgFunctionDeclaration*> &processingOrder, TRAVERSAL_TYPE order) {
         
-        boost::unordered_map<SgGraphNode*, COLOR> colors;
-        typedef boost::unordered_map<SgFunctionDeclaration*, SgGraphNode*> my_map;
+        std::unordered_map<SgGraphNode*, COLOR> colors;
+        typedef std::unordered_map<SgFunctionDeclaration*, SgGraphNode*> my_map;
         
         for(my_map::value_type item: graphNodeToFunction) {
             colors[item.second] = WHITE;
@@ -188,7 +188,7 @@ void PtrAliasAnalysis::SortCallGraphNodes(SgFunctionDeclaration* targetFunction,
 void PtrAliasAnalysis::computeCallGraphNodes(SgFunctionDeclaration* targetFunction, SgIncidenceDirectedGraph* callGraph,
                 vector<SgFunctionDeclaration*> &processingOrder, TRAVERSAL_TYPE order) {
 
-        boost::unordered_map<SgFunctionDeclaration*, SgGraphNode*> graphNodeToFunction ;
+        std::unordered_map<SgFunctionDeclaration*, SgGraphNode*> graphNodeToFunction ;
 
         SortCallGraphNodes(targetFunction, callGraph, cgBuilder->getGraphNodesMapping(), processingOrder, order);
 
diff --git a/src/midend/programAnalysis/VirtualFunctionAnalysis/PtrAliasAnalysis.h b/src/midend/programAnalysis/VirtualFunctionAnalysis/PtrAliasAnalysis.h
index 9e1a08d1db2..ac9ed333782 100644
--- a/src/midend/programAnalysis/VirtualFunctionAnalysis/PtrAliasAnalysis.h
+++ b/src/midend/programAnalysis/VirtualFunctionAnalysis/PtrAliasAnalysis.h
@@ -4,9 +4,7 @@
 #include "InterProcDataFlowAnalysis.h"
 #include "IntraProcAliasAnalysis.h"
 
-
 using namespace std;
-using namespace boost;
 
 //! PtrAliasAnalysis computes Alias Information, which is used for 
 //! Virtual Function Resolving.
@@ -17,10 +15,10 @@ class ROSE_DLL_API PtrAliasAnalysis : public InterProcDataFlowAnalysis{
     SgIncidenceDirectedGraph *callGraph;
     
     //! A map from SgFunctionDeclaration to IntraProcAliasAnalysis
-    boost::unordered_map<SgFunctionDeclaration *, IntraProcAliasAnalysis *> intraAliases;
+    std::unordered_map<SgFunctionDeclaration *, IntraProcAliasAnalysis *> intraAliases;
     
     //! A map which stores the function call resolve information 
-    boost::unordered_map<SgExpression *, std::vector<SgFunctionDeclaration*> > resolver;
+    std::unordered_map<SgExpression *, std::vector<SgFunctionDeclaration*> > resolver;
     
     //! ClassHierarchy of the project
     ClassHierarchyWrapper *classHierarchy;
@@ -42,12 +40,12 @@ class ROSE_DLL_API PtrAliasAnalysis : public InterProcDataFlowAnalysis{
 
 private:
     void SortCallGraphRecursive(SgFunctionDeclaration* targetFunction, SgIncidenceDirectedGraph* callGraph,
-                boost::unordered_map<SgFunctionDeclaration*, SgGraphNode*> &graphNodeToFunction, boost::unordered_map<SgGraphNode*, 
+                std::unordered_map<SgFunctionDeclaration*, SgGraphNode*> &graphNodeToFunction, std::unordered_map<SgGraphNode*, 
                 PtrAliasAnalysis::COLOR> &colors, std::vector<SgFunctionDeclaration*> &processingOrder, 
                 PtrAliasAnalysis::TRAVERSAL_TYPE order) ;
     
     void SortCallGraphNodes(SgFunctionDeclaration* targetFunction, SgIncidenceDirectedGraph* callGraph,
-                boost::unordered_map<SgFunctionDeclaration*, SgGraphNode*> &graphNodeToFunction,
+                std::unordered_map<SgFunctionDeclaration*, SgGraphNode*> &graphNodeToFunction,
                 std::vector<SgFunctionDeclaration*> &processingOrder, PtrAliasAnalysis::TRAVERSAL_TYPE order);
 
     void computeCallGraphNodes(SgFunctionDeclaration* targetFunction, SgIncidenceDirectedGraph* callGraph,
diff --git a/src/midend/programAnalysis/VirtualFunctionAnalysis/VirtualFunctionAnalysis.C b/src/midend/programAnalysis/VirtualFunctionAnalysis/VirtualFunctionAnalysis.C
index 2c9b845a4c5..8eaced7bf78 100644
--- a/src/midend/programAnalysis/VirtualFunctionAnalysis/VirtualFunctionAnalysis.C
+++ b/src/midend/programAnalysis/VirtualFunctionAnalysis/VirtualFunctionAnalysis.C
@@ -91,9 +91,9 @@ void VirtualFunctionAnalysis::pruneCallGraph(CallGraphBuilder& builder) {
         SgIncidenceDirectedGraph *graph =  builder.getGraph();
               
         ROSE_ASSERT(graph != NULL);
-        boost::unordered_map<SgFunctionDeclaration*, SgGraphNode*>node_mapping =  builder.getGraphNodesMapping();
+        std::unordered_map<SgFunctionDeclaration*, SgGraphNode*>node_mapping =  builder.getGraphNodesMapping();
         
-        typedef boost::unordered_map<SgFunctionDeclaration *, SgGraphNode *> map;
+        typedef std::unordered_map<SgFunctionDeclaration *, SgGraphNode *> map;
         for (map::value_type it: node_mapping) {
             SgFunctionDeclaration *defDecl =
                 (
diff --git a/src/midend/programAnalysis/defUseAnalysis/DefUseAnalysis.cpp b/src/midend/programAnalysis/defUseAnalysis/DefUseAnalysis.cpp
index eba5260dd92..5358ee4edb4 100644
--- a/src/midend/programAnalysis/defUseAnalysis/DefUseAnalysis.cpp
+++ b/src/midend/programAnalysis/defUseAnalysis/DefUseAnalysis.cpp
@@ -9,9 +9,7 @@
 #include "DefUseAnalysis.h"
 #include "DefUseAnalysis_perFunction.h"
 #include "GlobalVarAnalysis.h"
-#include <boost/config.hpp>
-#include <boost/bind.hpp>
-
+#include <functional>
 
 using namespace std;
 // static counter for the node numbering (for visualization)
@@ -123,7 +121,10 @@ void DefUseAnalysis::replaceElement(SgNode* sgNode,
     //    table[sgNode].insert(make_pair(initName,sgNode));
 
     multitype& map = table[sgNode];
-    map.erase(std::remove_if(map.begin(), map.end(), boost::bind(boost::type<bool>(), DefUseAnalysismycond, _1, initName)), map.end());
+    //map.erase(std::remove_if(map.begin(), map.end(), std::bind(boost::type<bool>(), DefUseAnalysismycond, std::placeholders::_1, initName)), map.end());
+    map.erase(std::remove_if(map.begin(), map.end(), [initName](const auto& pair) {
+            return DefUseAnalysismycond(pair, initName);
+        }), map.end());
     //         table[sgNode].erase(it);
 
     table[sgNode].push_back(make_pair(initName,sgNode));
@@ -142,7 +143,9 @@ void DefUseAnalysis::clearUseOfElement(SgNode* sgNode,
   //  usetable[sgNode].erase(initName);
 
     multitype& map = usetable[sgNode];
-    map.erase(std::remove_if(map.begin(), map.end(), boost::bind(boost::type<bool>(), DefUseAnalysismycond, _1, initName)), map.end());
+    map.erase(std::remove_if(map.begin(), map.end(), [initName](const auto& pair) {
+      return DefUseAnalysismycond(pair, initName);
+    }), map.end());
 
   }
 }
diff --git a/src/midend/programAnalysis/defUseAnalysis/DefUseAnalysis.h b/src/midend/programAnalysis/defUseAnalysis/DefUseAnalysis.h
index 6539d20bded..47202030cce 100644
--- a/src/midend/programAnalysis/defUseAnalysis/DefUseAnalysis.h
+++ b/src/midend/programAnalysis/defUseAnalysis/DefUseAnalysis.h
@@ -15,10 +15,6 @@
 
 #include <iostream>
 
-// CH (4/9/2010): Use boost::unordered instead
-#include <boost/unordered_map.hpp>
-#include <boost/unordered_set.hpp>
-
 #if 0
 #ifdef _MSC_VER
 #include <hash_map>
@@ -73,7 +69,6 @@ class ROSE_DLL_API DefUseAnalysis : public DFAnalysis, Support {
 
   typedef std::map< SgNode* , multitype > tabletype;
   // typedef std::map< SgNode* , int > convtype;
-// CH (4/9/2010): Use boost::unordered instead  
 //#ifdef _MSC_VER
 #if 0
   typedef hash_map< SgNode* , int > convtype;
diff --git a/src/midend/programAnalysis/defUseAnalysis/LivenessAnalysis.cpp b/src/midend/programAnalysis/defUseAnalysis/LivenessAnalysis.cpp
index d6564a68301..ef139d2637d 100644
--- a/src/midend/programAnalysis/defUseAnalysis/LivenessAnalysis.cpp
+++ b/src/midend/programAnalysis/defUseAnalysis/LivenessAnalysis.cpp
@@ -21,8 +21,6 @@
 #include "LivenessAnalysis.h"
 #include "DefUseAnalysis_perFunction.h"
 #include "GlobalVarAnalysis.h"
-#include <boost/config.hpp>
-#include <boost/bind.hpp>
 #include "BottomUpTraversalLiveness.h"
 using namespace std;
 
diff --git a/src/midend/programAnalysis/genericDataflow/analysis/dataflow.C b/src/midend/programAnalysis/genericDataflow/analysis/dataflow.C
index fda69a433fc..8f9982b9616 100644
--- a/src/midend/programAnalysis/genericDataflow/analysis/dataflow.C
+++ b/src/midend/programAnalysis/genericDataflow/analysis/dataflow.C
@@ -12,9 +12,6 @@ using std::auto_ptr;
 using std::pair;
 using std::make_pair;
 
-#include <boost/mem_fn.hpp>
-using boost::mem_fn;
-
 NodeState* IntraBWDataflow::initializeFunctionNodeState(const Function &func, NodeState *fState)
 {
 // DQ (12/10/2016): Eliminating a warning that we want to be an error: -Werror=unused-but-set-variable.
@@ -161,7 +158,7 @@ vector<DataflowNode> IntraUniDirectionalDataflow::gatherDescendants(vector<Dataf
 
   for(vector<DataflowEdge>::const_iterator ei = edges.begin(); ei!=edges.end(); ei++)
   {
-    descendants.push_back(mem_fn(edgeFn)(*ei));
+    descendants.push_back(std::mem_fn(edgeFn)(*ei));
   }
 
   return descendants;
@@ -308,7 +305,7 @@ bool IntraUniDirectionalDataflow::runAnalysis(const Function& func, NodeState* f
                         if (isSgFunctionCallExp(sgn))
                           transferFunctionCall(func, n, state);
 
-                        boost::shared_ptr<IntraDFTransferVisitor> transferVisitor = getTransferVisitor(func, n, *state, dfInfoPost);
+                        std::shared_ptr<IntraDFTransferVisitor> transferVisitor = getTransferVisitor(func, n, *state, dfInfoPost);
                         sgn->accept(*transferVisitor);
                         modified = transferVisitor->finish() || modified;
 
diff --git a/src/midend/programAnalysis/genericDataflow/analysis/dataflow.h b/src/midend/programAnalysis/genericDataflow/analysis/dataflow.h
index 2fc520f0411..39c835120be 100644
--- a/src/midend/programAnalysis/genericDataflow/analysis/dataflow.h
+++ b/src/midend/programAnalysis/genericDataflow/analysis/dataflow.h
@@ -10,7 +10,7 @@
 #include "analysis.h"
 #include "lattice.h"
 
-#include <boost/shared_ptr.hpp>
+#include <memory>
 #include <vector>
 #include <set>
 #include <map>
@@ -135,7 +135,7 @@ class IntraUnitDataflow : virtual public IntraProceduralDataflow
     // \todo \pp IMO. the function getTransferVisitor is not necessary and can be removed.
     //           Users wanting to write the analysis based on visitors can do so
     //           in the transfer function. (This safes one memory allocation, deallocation,
-    //           and boost::shared_pointer management overhead per transfer).
+    //           and std::shared_pointer management overhead per transfer).
     //           A transfer function using the visitor would look like (if desired this can be
     //           simplified by providing a convenience function taking a visitor as argument):
     // \code
@@ -146,9 +146,9 @@ class IntraUnitDataflow : virtual public IntraProceduralDataflow
     //             return visitor.finish();
     //           }
     // \endcode
-    virtual boost::shared_ptr<IntraDFTransferVisitor> getTransferVisitor(const Function& func, const DataflowNode& n,
+    virtual std::shared_ptr<IntraDFTransferVisitor> getTransferVisitor(const Function& func, const DataflowNode& n,
                                                                   NodeState& state, const std::vector<Lattice*>& dfInfo)
-  { return boost::shared_ptr<IntraDFTransferVisitor>(new DefaultTransfer(func, n, state, dfInfo, this)); }
+  { return std::shared_ptr<IntraDFTransferVisitor>(new DefaultTransfer(func, n, state, dfInfo, this)); }
 };
 
 class InterProceduralDataflow : virtual public InterProceduralAnalysis
diff --git a/src/midend/programAnalysis/genericDataflow/rwAccessLabeler/rwAccessLabeler.C b/src/midend/programAnalysis/genericDataflow/rwAccessLabeler/rwAccessLabeler.C
index 01b05dea98d..866c77246f2 100644
--- a/src/midend/programAnalysis/genericDataflow/rwAccessLabeler/rwAccessLabeler.C
+++ b/src/midend/programAnalysis/genericDataflow/rwAccessLabeler/rwAccessLabeler.C
@@ -3,6 +3,7 @@
 
 #include "sage3basic.h"
 #include "rwAccessLabeler.h"
+#include <cstring>
 
 using namespace std;
 
diff --git a/src/midend/programAnalysis/genericDataflow/simpleAnalyses/divAnalysis.C b/src/midend/programAnalysis/genericDataflow/simpleAnalyses/divAnalysis.C
index ca165fd13f1..c21f9431814 100644
--- a/src/midend/programAnalysis/genericDataflow/simpleAnalyses/divAnalysis.C
+++ b/src/midend/programAnalysis/genericDataflow/simpleAnalyses/divAnalysis.C
@@ -3,8 +3,7 @@
 
 #include "divAnalysis.h"
 
-#include <boost/bind.hpp>
-#include <boost/mem_fn.hpp>
+#include <functional>
 
 int divAnalysisDebugLevel=0;
 
@@ -598,10 +597,10 @@ void DivAnalysisTransfer::transferAdditive(DivLattice *arg1Lat, DivLattice *arg2
   else   // Else => Top
     updateModified(resLat->setTop());
 }
-void DivAnalysisTransfer::visit(SgPlusAssignOp *sgn)  { transferArith(sgn, boost::bind(&DivAnalysisTransfer::transferAdditive, _1, _2, _3, _4, true )); }
-void DivAnalysisTransfer::visit(SgMinusAssignOp *sgn) { transferArith(sgn, boost::bind(&DivAnalysisTransfer::transferAdditive, _1, _2, _3, _4, false)); }
-void DivAnalysisTransfer::visit(SgAddOp *sgn)         { transferArith(sgn, boost::bind(&DivAnalysisTransfer::transferAdditive, _1, _2, _3, _4, true )); }
-void DivAnalysisTransfer::visit(SgSubtractOp *sgn)    { transferArith(sgn, boost::bind(&DivAnalysisTransfer::transferAdditive, _1, _2, _3, _4, false)); }
+void DivAnalysisTransfer::visit(SgPlusAssignOp *sgn)  { transferArith(sgn, std::bind(&DivAnalysisTransfer::transferAdditive, std::placeholders::_1, std::placeholders::_2, std::placeholders::_3, std::placeholders::_4, true )); }
+void DivAnalysisTransfer::visit(SgMinusAssignOp *sgn) { transferArith(sgn, std::bind(&DivAnalysisTransfer::transferAdditive, std::placeholders::_1, std::placeholders::_2, std::placeholders::_3, std::placeholders::_4, false)); }
+void DivAnalysisTransfer::visit(SgAddOp *sgn)         { transferArith(sgn, std::bind(&DivAnalysisTransfer::transferAdditive, std::placeholders::_1, std::placeholders::_2, std::placeholders::_3, std::placeholders::_4, true )); }
+void DivAnalysisTransfer::visit(SgSubtractOp *sgn)    { transferArith(sgn, std::bind(&DivAnalysisTransfer::transferAdditive, std::placeholders::_1, std::placeholders::_2, std::placeholders::_3, std::placeholders::_4, false)); }
 
 void DivAnalysisTransfer::transferIncrement(SgUnaryOp *sgn) {
   DivLattice *arg1Lat, *arg2Lat, *resLat;
@@ -736,7 +735,7 @@ void DivAnalysisTransfer::transferArith(SgBinaryOp *sgn, T transferOp) {
       arg1Lat->copy(resLat);
   }
 }
-void DivAnalysisTransfer::transferArith(SgBinaryOp *sgn, TransferOp transferOp) { transferArith(sgn, boost::mem_fn(transferOp)); }
+void DivAnalysisTransfer::transferArith(SgBinaryOp *sgn, TransferOp transferOp) { transferArith(sgn, std::mem_fn(transferOp)); }
 
 void DivAnalysisTransfer::transferMod(DivLattice *arg1Lat, DivLattice *arg2Lat, DivLattice *resLat) {
   if(divAnalysisDebugLevel>=1) Dbg::dbg << "   case i = j %% k\n";
diff --git a/src/midend/programAnalysis/genericDataflow/simpleAnalyses/divAnalysis.h b/src/midend/programAnalysis/genericDataflow/simpleAnalyses/divAnalysis.h
index f79fac2fd9a..8116d7800f9 100644
--- a/src/midend/programAnalysis/genericDataflow/simpleAnalyses/divAnalysis.h
+++ b/src/midend/programAnalysis/genericDataflow/simpleAnalyses/divAnalysis.h
@@ -19,6 +19,7 @@
 #include <map>
 #include <string>
 #include <vector>
+#include <memory>
 
 extern int divAnalysisDebugLevel;
 
@@ -233,9 +234,9 @@ class DivAnalysis : public IntraFWDataflow
                 
   bool transfer(const Function& func, const DataflowNode& n, NodeState& state, const std::vector<Lattice*>& dfInfo)
   { ROSE_ABORT(); }
-  boost::shared_ptr<IntraDFTransferVisitor> getTransferVisitor(const Function& func, const DataflowNode& n,
-                                                            NodeState& state, const std::vector<Lattice*>& dfInfo)
-  { return boost::shared_ptr<IntraDFTransferVisitor>(new DivAnalysisTransfer(func, n, state, dfInfo)); }
+std::shared_ptr<IntraDFTransferVisitor> getTransferVisitor(const Function& func, const DataflowNode& n,
+                                                                                                                                                                                                                                        NodeState& state, const std::vector<Lattice*>& dfInfo)
+{ return std::shared_ptr<IntraDFTransferVisitor>(new DivAnalysisTransfer(func, n, state, dfInfo)); }
 };
 
 // prints the Lattices set by the given DivAnalysis 
diff --git a/src/midend/programAnalysis/genericDataflow/simpleAnalyses/liveDeadVarAnalysis.h b/src/midend/programAnalysis/genericDataflow/simpleAnalyses/liveDeadVarAnalysis.h
index 2d4defab944..9b2fee43863 100644
--- a/src/midend/programAnalysis/genericDataflow/simpleAnalyses/liveDeadVarAnalysis.h
+++ b/src/midend/programAnalysis/genericDataflow/simpleAnalyses/liveDeadVarAnalysis.h
@@ -19,6 +19,7 @@
 #include <vector>
 #include <string>
 #include <iostream>
+#include <memory>
 
 extern int liveDeadAnalysisDebugLevel;
 
@@ -171,9 +172,9 @@ class LiveDeadVarsAnalysis : public IntraBWDataflow
         void genInitState(const Function& func, const DataflowNode& n, const NodeState& state,
                           std::vector<Lattice*>& initLattices, std::vector<NodeFact*>& initFacts);
         
-  boost::shared_ptr<IntraDFTransferVisitor> getTransferVisitor(const Function& func, const DataflowNode& n,
-                                                               NodeState& state, const std::vector<Lattice*>& dfInfo)
-  { return boost::shared_ptr<IntraDFTransferVisitor>(new LiveDeadVarsTransfer(func, n, state, dfInfo, fseu)); }
+  std::shared_ptr<IntraDFTransferVisitor> getTransferVisitor(const Function& func, const DataflowNode& n,
+                                                             NodeState& state, const std::vector<Lattice*>& dfInfo)
+  { return std::shared_ptr<IntraDFTransferVisitor>(new LiveDeadVarsTransfer(func, n, state, dfInfo, fseu)); }
 
   bool transfer(const Function& func, const DataflowNode& n, NodeState& state, const std::vector<Lattice*>& dfInfo) { ROSE_ABORT(); }
 };
diff --git a/src/midend/programAnalysis/pointerAnal/PtrAnal.h b/src/midend/programAnalysis/pointerAnal/PtrAnal.h
index 26cff3a5ef9..80a0cb4a717 100644
--- a/src/midend/programAnalysis/pointerAnal/PtrAnal.h
+++ b/src/midend/programAnalysis/pointerAnal/PtrAnal.h
@@ -1,6 +1,6 @@
 #ifndef PTR_ANAL_H
 #define PTR_ANAL_H
-#include <boost/unordered_map.hpp>
+#include <unordered_map>
 #include <ProcessAstTree.h>
 #include <AstInterface.h>
 #include <StmtInfoCollect.h>
@@ -53,8 +53,8 @@ class PtrAnal
     public:
       size_t operator()(void * p) const { return (size_t) p; }
    };
-  typedef boost::unordered_map<void*, VarRef, PtrAnal::hash> NameMap;
-  typedef boost::unordered_map<void*, std::pair<size_t,size_t>, PtrAnal::hash> StmtMap;
+  typedef std::unordered_map<void*, VarRef, PtrAnal::hash> NameMap;
+  typedef std::unordered_map<void*, std::pair<size_t,size_t>, PtrAnal::hash> StmtMap;
 
   std::list<std::string> fdefined;
   NameMap namemap;
diff --git a/src/midend/programAnalysis/variableRenaming/VariableRenaming.C b/src/midend/programAnalysis/variableRenaming/VariableRenaming.C
index 6db4fa56eb7..71a187b5404 100644
--- a/src/midend/programAnalysis/variableRenaming/VariableRenaming.C
+++ b/src/midend/programAnalysis/variableRenaming/VariableRenaming.C
@@ -11,7 +11,8 @@
 #include <queue>
 #include <fstream>
 #include <stack>
-#include <boost/unordered_set.hpp>
+#include <unordered_set>
+#include <unordered_map>
 
 using namespace std;
 using namespace Rose;
@@ -1149,7 +1150,7 @@ VariableRenaming::VarRefSynthAttr VariableRenaming::UniqueNameTraversal::evaluat
 void VariableRenaming::runDefUse(SgFunctionDefinition* func)
 {
     //Keep track of visited nodes
-    boost::unordered_set<SgNode*> visited;
+    std::unordered_set<SgNode*> visited;
 
     //Reset the first def list to prevent errors with global vars.
     firstDefList.clear();
diff --git a/src/midend/programAnalysis/variableRenaming/VariableRenaming.h b/src/midend/programAnalysis/variableRenaming/VariableRenaming.h
index c9bc2222a9d..af5a8366231 100644
--- a/src/midend/programAnalysis/variableRenaming/VariableRenaming.h
+++ b/src/midend/programAnalysis/variableRenaming/VariableRenaming.h
@@ -12,7 +12,7 @@
 #include <fstream>
 #include <sstream>
 #include "filteredCFG.h"
-#include <boost/unordered_map.hpp>
+#include <unordered_map>
 
 /** Class holding a unique name for a variable. Is attached to varRefs as a persistent attribute.
  * This is used to assign absolute names to VarRefExp nodes during VariableRenaming.
@@ -181,6 +181,18 @@ struct IsDefUseFilter
         }
 };
 
+template <typename T>
+struct VectorHash {
+    std::size_t operator()(const std::vector<T>& vec) const {
+        std::hash<T> hasher;
+        std::size_t seed = 0;
+        for (const T& elem : vec) {
+            seed ^= hasher(elem) + 0x9e3779b9 + (seed << 6) + (seed >> 2);
+        }
+        return seed;
+    }
+};
+
 /** Class that defines an VariableRenaming of a program
  *
  * Contains all the functionality to implement variable renaming on a given program.
@@ -210,10 +222,10 @@ class VariableRenaming
     typedef std::map<VarName, NodeVec> TableEntry;
     /** A table storing the name->node mappings for every node in the program.
      */
-    typedef boost::unordered_map<SgNode*, TableEntry> DefUseTable;
+    typedef std::unordered_map<SgNode*, TableEntry> DefUseTable;
     /** A table mapping a name to a single node.
      */
-    typedef boost::unordered_map<VarName, SgNode*> FirstDefTable;
+    typedef std::unordered_map<VarName, SgNode*, VectorHash<SgInitializedName*>> FirstDefTable;
 
     /** A vector of SgInitializedName*
      */
@@ -235,13 +247,13 @@ class VariableRenaming
     typedef std::map<SgNode*, int> NodeNumRenameEntry;
     /** A table that maps a name to it's node->number renamings.
      */
-    typedef boost::unordered_map<VarName, NodeNumRenameEntry> NodeNumRenameTable;
+    typedef std::unordered_map<VarName, NodeNumRenameEntry, VectorHash<SgInitializedName*>> NodeNumRenameTable;
     /** An entry in the rename table that maps a number to a node.
      */
     typedef std::map<int, SgNode*> NumNodeRenameEntry;
     /** A table that maps a name to it's number->node renamings.
      */
-    typedef boost::unordered_map<VarName, NumNodeRenameEntry> NumNodeRenameTable;
+    typedef std::unordered_map<VarName, NumNodeRenameEntry, VectorHash<SgInitializedName*>> NumNodeRenameTable;
 
 
 private:
diff --git a/src/midend/programTransformation/astOutlining/PragmaInterface.cc b/src/midend/programTransformation/astOutlining/PragmaInterface.cc
index 6dcec90eb2c..504342349ca 100644
--- a/src/midend/programTransformation/astOutlining/PragmaInterface.cc
+++ b/src/midend/programTransformation/astOutlining/PragmaInterface.cc
@@ -19,7 +19,6 @@
 #include "Outliner.hh"
 #include "ASTtools.hh"
 #include "PreprocessingInfo.hh"
-#include "Trim.h"
 
 //! Simplest outlining directives, applied to a single statement.
 static const std::string PRAGMA_OUTLINE ("rose_outline");
@@ -89,7 +88,7 @@ processFortranComment(SgLocatedNode* node)
     if ((*i)->getTypeOfDirective() == PreprocessingInfo::FortranStyleComment)
     {
       string commentString = (*i)->getString();
-      trim(commentString);
+      Rose::StringUtility::trim(commentString);
       if (   (commentString == "!$"+PRAGMA_OUTLINE) 
           || (commentString == "c$"+PRAGMA_OUTLINE) 
           || (commentString == "*$"+PRAGMA_OUTLINE)) 
diff --git a/src/midend/programTransformation/constantFolding/constantFolding.h b/src/midend/programTransformation/constantFolding/constantFolding.h
index ec501e8f1d8..2aa32a983fb 100644
--- a/src/midend/programTransformation/constantFolding/constantFolding.h
+++ b/src/midend/programTransformation/constantFolding/constantFolding.h
@@ -9,6 +9,8 @@
 #ifndef ROSE_CONSTANT_FOLDING_H
 #define ROSE_CONSTANT_FOLDING_H
 
+#include <cmath>
+
 namespace ConstantFolding {
 
 // Build an inherited attribute for the tree traversal to skip constant folded expressions
diff --git a/src/rose-config.C b/src/rose-config.C
index 098ede2ba58..27c9596f710 100644
--- a/src/rose-config.C
+++ b/src/rose-config.C
@@ -40,8 +40,6 @@ static const char *description =
 #include <string>
 #include <vector>
 
-#include <util/StringUtility/Trim.h>
-
 using namespace Rose;
 
 typedef std::map<std::string, std::string> Configuration;
@@ -133,16 +131,16 @@ readConfigFile(const std::filesystem::path &configName) {
     }
 
     std::string s = r.line;
-    s = trim(s);
+    s = Rose::StringUtility::trim(s);
     if (s.empty() || '#' == s[0])
       continue;
 
     // Parse the "key=value" line
     size_t equal = s.find('=');
     std::string key = s.substr(0, equal);
-    key = trim(key);
+    key = Rose::StringUtility::trim(key);
     std::string value = equal == std::string::npos ? std::string() : s.substr(equal+1);
-    value = trim(value);
+    value = Rose::StringUtility::trim(value);
     if (equal == std::string::npos || !std::regex_match(key, keyRe)) {
       MLOG_FATAL_CXX("rose-config")  <<configName <<":" <<lineNumber <<": syntax error: expected KEY = VALUE\n";
       exit(1);
diff --git a/src/util/StringUtility/Trim.h b/src/util/StringUtility/Trim.h
deleted file mode 100644
index 7ae773d8dbe..00000000000
--- a/src/util/StringUtility/Trim.h
+++ /dev/null
@@ -1,16 +0,0 @@
-#pragma once
-
-#include <string>
-#include <algorithm>
-
-std::string trim(const std::string& str) {
-    size_t start = str.find_first_not_of(" \t\n\r");
-    if (start == std::string::npos)
-        return "";
-    
-    size_t end = str.find_last_not_of(" \t\n\r");
-    size_t length = end - start + 1;
-    
-    return str.substr(start, length);
-}
-

From 62a7c4b579117820b44e6ef317bcd91087d75d03 Mon Sep 17 00:00:00 2001
From: Yonghong Yan <yanyh15@gmail.com>
Date: Thu, 14 Nov 2024 21:57:57 -0500
Subject: [PATCH 27/42] deBoost: remove the use of
 ROSE_USING_GRAPH_IR_NODES_FOR_BACKWARD_COMPATABILITY and related graph
 support that rely on boost

---
 config/automake_conditional_display_makefile |   5 -
 config/support-rose.m4                       |   9 -
 rose_config.h.in.cmake                       |   4 -
 src/ROSETTA/Grammar/Support.code             |  12 --
 src/ROSETTA/src/support.C                    |  22 ---
 src/frontend/SageIII/rose_graph_support.C    | 178 -------------------
 src/frontend/SageIII/rtiHelpers.h            |  25 ---
 src/util/rose_paths.h                        |  11 --
 8 files changed, 266 deletions(-)

diff --git a/config/automake_conditional_display_makefile b/config/automake_conditional_display_makefile
index 2b53c52ead1..d2bf6b48d8a 100644
--- a/config/automake_conditional_display_makefile
+++ b/config/automake_conditional_display_makefile
@@ -224,11 +224,6 @@ if ROSE_USING_GFORTRAN_VERSION_4_1
 else
 	@echo "Automake conditional ROSE_USING_GFORTRAN_VERSION_4_1: NOT defined"
 endif
-if ROSE_USING_GRAPH_IR_NODES_FOR_BACKWARD_COMPATABILITY
-	@echo "Automake conditional ROSE_USING_GRAPH_IR_NODES_FOR_BACKWARD_COMPATABILITY: DEFINED"
-else
-	@echo "Automake conditional ROSE_USING_GRAPH_IR_NODES_FOR_BACKWARD_COMPATABILITY: NOT defined"
-endif
 if ROSE_USING_ROSE
 	@echo "Automake conditional ROSE_USING_ROSE: DEFINED"
 else
diff --git a/config/support-rose.m4 b/config/support-rose.m4
index 2eb08b38a7b..85eeed6bb09 100644
--- a/config/support-rose.m4
+++ b/config/support-rose.m4
@@ -262,15 +262,6 @@ fi
 #  AC_DEFINE([ROSE_USE_NEW_GRAPH_NODES], [], [Whether to use the new graph IR nodes])
 #fi
 
-# DQ (5/2/2009): Added support for backward compatability of new IR nodes with older API.
-AC_ARG_ENABLE(use_new_graph_node_backward_compatability,
-    AS_HELP_STRING([--enable-use_new_graph_node_backward_compatability], [Enable new (experimental) graph IR nodes backward compatability API]))
-AM_CONDITIONAL(ROSE_USING_GRAPH_IR_NODES_FOR_BACKWARD_COMPATABILITY, [test "x$enable_use_new_graph_node_backward_compatability" = xyes])
-if test "x$enable_use_new_graph_node_backward_compatability" = "xyes"; then
-  AC_MSG_WARN([using the new graph IR nodes in ROSE (experimental)!])
-  AC_DEFINE([ROSE_USING_GRAPH_IR_NODES_FOR_BACKWARD_COMPATABILITY], [], [Whether to use the new graph IR nodes compatability option with older API])
-fi
-
 # Set the value of srcdir so that it will be an absolute path instead of a relative path
 # srcdir=`dirname "$0"`
 # echo "In ROSE/con figure: srcdir = $srcdir"
diff --git a/rose_config.h.in.cmake b/rose_config.h.in.cmake
index 2cc322f3828..350eb72e8b4 100644
--- a/rose_config.h.in.cmake
+++ b/rose_config.h.in.cmake
@@ -501,10 +501,6 @@
 //AS Don't know what to do with this
 #undef ROSE_USE_VALGRIND
 
-/* Whether to use the new graph IR nodes compatability option with older API
-   */
-//#undef ROSE_USING_GRAPH_IR_NODES_FOR_BACKWARD_COMPATABILITY
-
 /* Simple preprocessor as default in ROSE */
 //AS Need configure option to allow wave to be default
 #define ROSE_WAVE_DEFAULT false
diff --git a/src/ROSETTA/Grammar/Support.code b/src/ROSETTA/Grammar/Support.code
index 9663080669e..21498919c6f 100644
--- a/src/ROSETTA/Grammar/Support.code
+++ b/src/ROSETTA/Grammar/Support.code
@@ -601,11 +601,6 @@ HEADER_GRAPH_START
      void display_string_to_node_index_multimap() const;
      void display_string_to_edge_index_multimap() const;
 
-#ifdef ROSE_USING_GRAPH_IR_NODES_FOR_BACKWARD_COMPATABILITY
-     void display_nodes() const;
-     void display_edges() const;
-#endif
-
 //! Resize the internal hash tables based on the number of nodes (hash_maps and hash_multimaps for edges are made larger by multiplying by the value "numberOfEdges" ).
      void resize_hash_maps( size_t numberOfNodes, size_t numberOfEdges = 10 );
 
@@ -22182,16 +22177,9 @@ SOURCE_GRAPHEDGE_END
 
 SOURCE_GRAPH_START
 
-//#if defined(ROSE_USE_NEW_GRAPH_NODES) && !defined(ROSE_USING_GRAPH_IR_NODES_FOR_BACKWARD_COMPATABILITY)
-//#warning "ROSE_USING_GRAPH_IR_NODES_FOR_BACKWARD_COMPATABILITY not set"
-//#endif
-
-
 // DQ (4/29/2009): Declaration of space for static data member.
 int SgGraph::p_index_counter = 0;
 
-
-
 // tps : todo : remove me -----------------------------------------
 void
 SgGraph::append_properties( int addr, const std::string & prop )
diff --git a/src/ROSETTA/src/support.C b/src/ROSETTA/src/support.C
index c3bef046688..00e39698502 100644
--- a/src/ROSETTA/src/support.C
+++ b/src/ROSETTA/src/support.C
@@ -1548,13 +1548,6 @@ Grammar::setUpSupport ()
 //       in favor of the same API, but implemented using a map of maps at
 //       the SgGraph indexed by integer values.
 
-// DQ (5/2/2009): This is put into rose_paths.h
-// the warning macro is causing problems in Windows
-#if !_MSC_VER
-#ifndef ROSE_USING_GRAPH_IR_NODES_FOR_BACKWARD_COMPATABILITY
-#warning "ROSE_USING_GRAPH_IR_NODES_FOR_BACKWARD_COMPATABILITY not set"
-#endif
-#endif
   // ******************************************************************************
   //                                SgGraphNode
   // ******************************************************************************
@@ -1653,21 +1646,6 @@ Grammar::setUpSupport ()
      UndirectedGraphEdge.setFunctionPrototype ( "HEADER_UNDIRECTED_GRAPH_EDGE", "../Grammar/Support.code");
 
 
-
-  // These IR nodes might be eliminated in favor of just a function to generate the same level
-  // of support using a combination of two maps in SgGraph.
-
-#ifdef ROSE_USING_GRAPH_IR_NODES_FOR_BACKWARD_COMPATABILITY
-     GraphNodeList.setFunctionPrototype ( "HEADER_GRAPH_NODE_LIST", "../Grammar/Support.code");
-     GraphNodeList.setDataPrototype("rose_graph_hash_multimap","nodes","",
-                           NO_CONSTRUCTOR_PARAMETER, BUILD_LIST_ACCESS_FUNCTIONS, NO_TRAVERSAL, NO_DELETE);
-
-     GraphEdgeList.setFunctionPrototype ( "HEADER_GRAPH_EDGE_LIST", "../Grammar/Support.code");
-     GraphEdgeList.setDataPrototype("rose_graph_node_edge_hash_multimap","edges","",
-                           NO_CONSTRUCTOR_PARAMETER, BUILD_LIST_ACCESS_FUNCTIONS, NO_TRAVERSAL, NO_DELETE);
-#endif
-
-
   // ******************************************************************************
   //                                  SgGraph
   // ******************************************************************************
diff --git a/src/frontend/SageIII/rose_graph_support.C b/src/frontend/SageIII/rose_graph_support.C
index 27b06b6ce44..917e4549e6d 100644
--- a/src/frontend/SageIII/rose_graph_support.C
+++ b/src/frontend/SageIII/rose_graph_support.C
@@ -570,12 +570,6 @@ SgGraph::display_node_index_to_edge_multimap() const
 // #endif
    }
 
-#ifdef ROSE_USING_GRAPH_IR_NODES_FOR_BACKWARD_COMPATABILITY
-void display_nodes();
-void display_edges();
-#endif
-
-
 void
 SgGraph::resize_hash_maps( size_t numberOfNodes, size_t numberOfEdges )
    {
@@ -657,178 +651,6 @@ SgGraph::memory_usage()
      return memory_usage;
    }
 
-
-// #ifdef ROSE_USE_NEW_GRAPH_NODES
-// Required for Boost Spanning Tree support.
-#include <boost/graph/adjacency_list.hpp>
-#include <boost/graph/kruskal_min_spanning_tree.hpp>
-
-int
-source(boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>& edge_descriptor, SgGraph&)
-   {
-     int edge_source_node = edge_descriptor.m_source;
-     return edge_source_node;
-   }
-
-int
-target(boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>& edge_descriptor, SgGraph&)
-   {
-     int edge_target_node = edge_descriptor.m_target;
-     return edge_target_node;
-   }
-// #endif
-
-
-
-// std::vector <SgGraph::BoostEdgeDescriptor>
-std::vector <SgGraphEdge*>
-SgGraph::generateSpanningTree()
-   {
-     ROSE_ASSERT(this != NULL);
-
-  // return rose_spanning_tree;
-     std::vector <SgGraphEdge*> returnEdgeList;
-
-
-
-#ifdef ROSE_USING_GRAPH_IR_NODES_FOR_BACKWARD_COMPATABILITY
-     ROSE_ABORT();
-     // tps , commented this out because it is baded on the old graph structure
-     // Dan needs to look at this later
-#if 0
-     ROSE_ASSERT(get_edges() != NULL);
-
-  // Assemble the representation of the edges for Boost.
-     SgGraphEdgeList::iterator edgeIt = get_edges()->get_edges().begin();
-     while(edgeIt != get_edges()->get_edges().end())
-        {
-       // We want the edges to have an index ordering (could be computed or saved, for now we will save it explicitly).
-          int i = edgeIt->second->get_node_A()->get_index();
-          int j = edgeIt->second->get_node_B()->get_index();
-
-       // Generate the edge vector for MST (required for many BGL algorithms)
-          p_boost_edges.push_back(BoostEdgeType(i,j));
-
-       // Use constant edge weight for now (I think that the edge weights are required by the MST algorithm)
-          p_boost_edge_weights.push_back(1);
-
-          edgeIt++;
-        }
-
-     ROSE_ASSERT(get_nodes() != NULL);
-
-  // DQ (4/29/2009): Boost Graph Type used to represent ROSE graphs within Boost Graph Algorithms.
-     typedef boost::adjacency_list < boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property < boost::edge_weight_t, int > > BoostGraphType;
-
-  // Supporting graph type required by Boost Graph Library.
-     typedef boost::graph_traits < BoostGraphType >::edge_descriptor   BoostEdgeDescriptor;
-
-     BoostGraphType rose_BGL_graph(p_boost_edges.begin(), p_boost_edges.end(), p_boost_edge_weights.begin(), get_nodes()->get_nodes().size());
-
-  // If we want to add edge weights then this is now we have to do it.
-  // property_map < Graph, edge_weight_t >::type weight = get(edge_weight, g);
-
-  // Result
-     std::vector < BoostEdgeDescriptor > rose_spanning_tree;
-
-#if 1
-  // printf ("Computing the kruskal_minimum_spanning_tree() \n");
-     boost::kruskal_minimum_spanning_tree(rose_BGL_graph, std::back_inserter(rose_spanning_tree));
-  // printf ("DONE: Computing the kruskal_minimum_spanning_tree() \n");
-
-     printf ("rose_spanning_tree.size() = %" PRIuPTR " \n",rose_spanning_tree.size());
-#endif
-
-#if 0
-     std::cout << "Print the edges in the MST:" << std::endl;
-     for (std::vector < Edge >::iterator ei = spanning_tree.begin(); ei != spanning_tree.end(); ++ei)
-        {
-          cout << source(*ei, g) << " <--> " << target(*ei, g)
-               << " with weight of " << weight[*ei]
-               << endl;
-
-          int s = source(*ei, g);
-          int t = target(*ei, g);
-          SgGraphNode* nodeA = get_nodes()->get_nodes()[s];
-          SgGraphNode* nodeB = get_nodes()->get_nodes()[t];
-
-       // Now to we find the edge?
-       // SgGraphEdge* edge = nodeA->get_edges()[s];
-
-       // How to I get the edge that ends at t?
-
-          returnEdgeList.push_back(*ei);
-        }
-#endif
-
-#else
-  // This implementation uses the future ROSE Graph API.
-  // ROSE_USING_GRAPH_IR_NODES_FOR_BACKWARD_COMPATABILITY is undefined
-
-  // A BoostEdgeType is a "std::pair<int, int>"
-  // A SgBoostEdgeList is a "std::vector<BoostEdgeType>"
-     SgBoostEdgeList boost_edges;
-     SgBoostEdgeWeightList boost_edge_weights;
-     rose_graph_integerpair_edge_hash_multimap::iterator i = p_node_index_pair_to_edge_multimap.begin();
-     while (i != p_node_index_pair_to_edge_multimap.end())
-        {
-       // printf ("Building up the boost_edges (%d,%d) \n",i->first.first,i->first.second);
-
-          boost_edges.push_back(i->first);
-          boost_edge_weights.push_back(1);
-          i++;
-        }
-
-  // DQ (4/29/2009): Boost Graph Type used to represent ROSE graphs within Boost Graph Algorithms.
-     typedef boost::adjacency_list < boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property < boost::edge_weight_t, int > > BoostGraphType;
-
-  // Supporting graph type required by Boost Graph Library.
-     typedef boost::graph_traits < BoostGraphType >::edge_descriptor BoostEdgeDescriptor;
-
-     BoostGraphType rose_BGL_graph(p_boost_edges.begin(), p_boost_edges.end(), p_boost_edge_weights.begin(), numberOfGraphNodes());
-
-  // If we want to add edge weights then this is now we have to do it.
-  // property_map < Graph, edge_weight_t >::type weight = get(edge_weight, g);
-
-  // Result
-     std::vector < BoostEdgeDescriptor > rose_spanning_tree;
-
-#if 1
-  // printf ("Computing the kruskal_minimum_spanning_tree() \n");
-     boost::kruskal_minimum_spanning_tree(rose_BGL_graph, std::back_inserter(rose_spanning_tree));
-  // printf ("DONE: Computing the kruskal_minimum_spanning_tree() \n");
-
-     printf ("rose_spanning_tree.size() = %" PRIuPTR " \n",rose_spanning_tree.size());
-#endif
-
-#if 1
-     std::cout << "Print the edges in the MST:" << std::endl;
-     for (std::vector < BoostEdgeDescriptor >::iterator ei = rose_spanning_tree.begin(); ei != rose_spanning_tree.end(); ++ei)
-        {
-#if 1
-       // Use the source() and target() functions defined above to extract the node index values from the edge.
-          int source_node = source(*ei, *this);
-          int target_node = target(*ei, *this);
-
-          printf ("rose_spanning_tree: source_node = %d target_node = %d \n",source_node,target_node);
-#endif
-        }
-#endif
-
-
-// endif for ROSE_USING_GRAPH_IR_NODES_FOR_BACKWARD_COMPATABILITY
-#endif
-
-// endif for ROSE_USING_GRAPH_IR_NODES_FOR_BACKWARD_COMPATABILITY
-#endif
-
-
-     return returnEdgeList;
-   }
-
-
-
-
 //! Generate a set of SgGraphEdge pointers associated with a given SgGraphNode.
 std::set<SgDirectedGraphEdge*>
 SgIncidenceDirectedGraph::computeEdgeSetIn( SgGraphNode* node )
diff --git a/src/frontend/SageIII/rtiHelpers.h b/src/frontend/SageIII/rtiHelpers.h
index d99bc5abe24..b30f4a6ff8e 100644
--- a/src/frontend/SageIII/rtiHelpers.h
+++ b/src/frontend/SageIII/rtiHelpers.h
@@ -165,18 +165,6 @@ static std::string toStringForRTI(const std::map<uint64_t ,std::pair<int,std::pa
 //#ifdef ROSE_USE_NEW_GRAPH_NODES
 // DQ (8/18/2008): Added support for new Graph IR node.
 
-#ifdef ROSE_USING_GRAPH_IR_NODES_FOR_BACKWARD_COMPATABILITY
-// static std::string toStringForRTI(const SgGraphNodeDirectedGraphEdgeMultimapPtrList & x)
-static std::string toStringForRTI(const rose_graph_node_edge_hash_multimap & x)
-{
-  std::ostringstream ss;
-  ss << "[";
-// for (SgGraphNodeUndirectedGraphEdgeMultimapPtrList::const_iterator i = x.begin(); i != x.end(); ++i) {if (i != x.begin()) ss << ", "; ss << i->first << "->" << i->second;}
-  ss << "]";
-  return ss.str();
-}
-#endif
-
 static std::string toStringForRTI(const rose_graph_integer_node_hash_map & x)
 {
   std::ostringstream ss;
@@ -246,19 +234,6 @@ static std::string toStringForRTI(const rose_directed_graph_hash_multimap & x)
 }
 #endif
 
-#ifdef ROSE_USING_GRAPH_IR_NODES_FOR_BACKWARD_COMPATABILITY
-// DQ (8/18/2008): Added support for new Graph IR node.
-// static std::string toStringForRTI(const SgStringGraphNodeMapPtrList & x)
-static std::string toStringForRTI(const rose_graph_hash_multimap & x)
-{
-  std::ostringstream ss;
-  ss << "[";
-// for (SgStringGraphNodeMapPtrList::const_iterator i = x.begin(); i != x.end(); ++i) {if (i != x.begin()) ss << ", "; ss << i->first << "->" << i->second;}
-  ss << "]";
-  return ss.str();
-}
-#endif
-
 #if 0
 // DQ (5/1/2009): This is no longer used and is replaced by an implementation using a hash_map.
 // DQ (8/18/2008): Added support for new Graph IR node.
diff --git a/src/util/rose_paths.h b/src/util/rose_paths.h
index fd3ecdc01da..774e6aa231c 100644
--- a/src/util/rose_paths.h
+++ b/src/util/rose_paths.h
@@ -59,16 +59,5 @@ ROSE_UTIL_API extern const std::string ROSE_OFP_VERSION_STRING;
  * @endcode */
 extern const unsigned long ROSE_NUMERIC_VERSION;
 
-
-// DQ (5/2/2009): This is temporary while we work out the details of the new Graph IR nodes.
-// #define USING_GRAPH_IR_NODES_FOR_BACKWARD_COMPATABILITY 0
-
-//#ifdef ROSE_USE_NEW_GRAPH_NODES
-//#ifndef ROSE_USING_GRAPH_IR_NODES_FOR_BACKWARD_COMPATABILITY
-//#warning "ROSE_USING_GRAPH_IR_NODES_FOR_BACKWARD_COMPATABILITY IS NOT SET"
-//#endif
-//#endif
-
-
 #endif /* ROSE_PATHS_H */
 

From b00e4cc39c98fa77d8832f27fd34459375197557 Mon Sep 17 00:00:00 2001
From: Yonghong Yan <yanyh15@gmail.com>
Date: Thu, 14 Nov 2024 23:15:36 -0500
Subject: [PATCH 28/42] deBoost: remove boost related test and fix wave-related
 linking errors before we figure out how to keep or remove boost::wave

---
 config/support-rose.m4                        |   2 -
 scripts/Makefile.am                           |   1 -
 src/frontend/SageIII/Makefile.am              |   3 +-
 .../SageIII/astTokenStream/Makefile.am        |   2 -
 src/frontend/SageIII/rose_attributes_list.h   |   5 +-
 .../functional/CompileTests/CMakeLists.txt    |   1 -
 .../functional/CompileTests/Makefile.am       |   4 +-
 .../CompileTests/boost_tests/CMakeLists.txt   |  18 ---
 .../CompileTests/boost_tests/Makefile.am      | 115 ------------------
 .../CompileTests/boost_tests/README           |  15 ---
 .../boost_tests/include_ordering.C            |  43 -------
 .../boost_tests/test_boost_lambda.C           |  37 ------
 .../boost_tests/test_boost_macro_include.cpp  |  16 ---
 .../boost_tests/test_boost_phoenix_v1.C       |  29 -----
 .../boost_tests/test_boost_phoenix_v2.C       |  50 --------
 .../boost_tests/test_unordered_map_include.C  |   4 -
 tests/smoke/unit/Boost/Makefile.am            |  61 ----------
 tests/smoke/unit/Boost/testBoost.C            |  53 --------
 tests/smoke/unit/Boost/testBoostRegex.C       |  15 ---
 tests/smoke/unit/Boost/testBoostThreads.C     |  41 -------
 tests/smoke/unit/Makefile.am                  |   2 +-
 21 files changed, 8 insertions(+), 509 deletions(-)
 delete mode 100644 tests/nonsmoke/functional/CompileTests/boost_tests/CMakeLists.txt
 delete mode 100644 tests/nonsmoke/functional/CompileTests/boost_tests/Makefile.am
 delete mode 100644 tests/nonsmoke/functional/CompileTests/boost_tests/README
 delete mode 100644 tests/nonsmoke/functional/CompileTests/boost_tests/include_ordering.C
 delete mode 100644 tests/nonsmoke/functional/CompileTests/boost_tests/test_boost_lambda.C
 delete mode 100644 tests/nonsmoke/functional/CompileTests/boost_tests/test_boost_macro_include.cpp
 delete mode 100644 tests/nonsmoke/functional/CompileTests/boost_tests/test_boost_phoenix_v1.C
 delete mode 100644 tests/nonsmoke/functional/CompileTests/boost_tests/test_boost_phoenix_v2.C
 delete mode 100644 tests/nonsmoke/functional/CompileTests/boost_tests/test_unordered_map_include.C
 delete mode 100644 tests/smoke/unit/Boost/Makefile.am
 delete mode 100644 tests/smoke/unit/Boost/testBoost.C
 delete mode 100644 tests/smoke/unit/Boost/testBoostRegex.C
 delete mode 100644 tests/smoke/unit/Boost/testBoostThreads.C

diff --git a/config/support-rose.m4 b/config/support-rose.m4
index 85eeed6bb09..b41ca8a2ab1 100644
--- a/config/support-rose.m4
+++ b/config/support-rose.m4
@@ -1277,7 +1277,6 @@ tests/nonsmoke/functional/CompileTests/RoseExample_tests/Makefile
 tests/nonsmoke/functional/CompileTests/STL_tests/Makefile
 tests/nonsmoke/functional/CompileTests/UnparseHeadersTests/Makefile
 tests/nonsmoke/functional/CompileTests/UnparseHeadersUsingTokenStream_tests/Makefile
-tests/nonsmoke/functional/CompileTests/boost_tests/Makefile
 tests/nonsmoke/functional/CompileTests/colorAST_tests/Makefile
 tests/nonsmoke/functional/CompileTests/copyAST_tests/Makefile
 tests/nonsmoke/functional/CompileTests/frontend_integration/Makefile
@@ -1371,7 +1370,6 @@ tests/smoke/specimens/Makefile
 tests/smoke/specimens/c++/Makefile
 tests/smoke/specimens/c/Makefile
 tests/smoke/specimens/fortran/Makefile
-tests/smoke/unit/Boost/Makefile
 tests/smoke/unit/Makefile
 tests/smoke/unit/Utility/Makefile
 tools/Makefile
diff --git a/scripts/Makefile.am b/scripts/Makefile.am
index 21383a026b0..8dfc7bcb86b 100644
--- a/scripts/Makefile.am
+++ b/scripts/Makefile.am
@@ -7,7 +7,6 @@ distributedScripts =				 \
 	Git.pm					 \
 	buildExampleRoseWorkspaceScript.sh	 \
 	check-dist-file dotgenLetter		 \
-	check_boost_linkage.sh			 \
 	dotgen					 \
 	dotgen2					 \
 	dotgenLetterPDF				 \
diff --git a/src/frontend/SageIII/Makefile.am b/src/frontend/SageIII/Makefile.am
index 9c76172d0ab..1908cfbb067 100644
--- a/src/frontend/SageIII/Makefile.am
+++ b/src/frontend/SageIII/Makefile.am
@@ -155,7 +155,8 @@ libsage3_la_LIBADD= \
   sageInterface/libsageInterface.la \
   virtualCFG/libvirtualCFG.la \
   astHiddenTypeAndDeclarationLists/libastHiddenTypeAndDeclarationLists.la \
-  includeDirectivesProcessing/libincludeDirectivesProcessing.la
+  includeDirectivesProcessing/libincludeDirectivesProcessing.la \
+  astTokenStream/libastTokenStream.la
 #endif
 
 # DQ (6/25/2011): Readded this directory so that we can support the older behavior as a default
diff --git a/src/frontend/SageIII/astTokenStream/Makefile.am b/src/frontend/SageIII/astTokenStream/Makefile.am
index ae7f5044221..283b7d58397 100644
--- a/src/frontend/SageIII/astTokenStream/Makefile.am
+++ b/src/frontend/SageIII/astTokenStream/Makefile.am
@@ -33,7 +33,5 @@ pkginclude_HEADERS = createMap.h  doCompleteMapping.h  linearizeAST.h unparseMac
    tokenStreamMapping.h frontierDetection.h simpleFrontierDetection.h previousAndNextNode.h \
    maxExtents.h detectMacroOrIncludeFileExpansions.h detectMacroExpansionsToBeUnparsedAsAstTransformations.h
 
-
-
 EXTRA_DIST = CMakeLists.txt
 
diff --git a/src/frontend/SageIII/rose_attributes_list.h b/src/frontend/SageIII/rose_attributes_list.h
index 99bd034b113..3ff264a0729 100644
--- a/src/frontend/SageIII/rose_attributes_list.h
+++ b/src/frontend/SageIII/rose_attributes_list.h
@@ -6,10 +6,11 @@
 //#include <list>
 //#include <vector>
 #include <map>
-
+#include <boost/wave.hpp>
+#include <boost/wave/cpplexer/cpp_lex_token.hpp>
 // Include the ROSE lex specific definitions of tokens
 #include "general_token_defs.h"
-#define ROSE_SKIP_COMPILATION_OF_WAVE 1
+//#define ROSE_SKIP_COMPILATION_OF_WAVE 1
 
 // #ifdef CAN_NOT_COMPILE_WITH_ROSE
 //    #warning "CAN_NOT_COMPILE_WITH_ROSE IS defined"
diff --git a/tests/nonsmoke/functional/CompileTests/CMakeLists.txt b/tests/nonsmoke/functional/CompileTests/CMakeLists.txt
index 756ba777b77..d198da5bcdf 100644
--- a/tests/nonsmoke/functional/CompileTests/CMakeLists.txt
+++ b/tests/nonsmoke/functional/CompileTests/CMakeLists.txt
@@ -74,7 +74,6 @@ else()
       add_subdirectory(colorAST_tests)
       add_subdirectory(unparseToString_tests)
       add_subdirectory(sourcePosition_tests)
-      add_subdirectory(boost_tests)
       # requires Valgrind
       #add_subdirectory(uninitializedField_tests)
       add_subdirectory(OvertureCode)
diff --git a/tests/nonsmoke/functional/CompileTests/Makefile.am b/tests/nonsmoke/functional/CompileTests/Makefile.am
index a69d2e8808e..84b5bc56459 100644
--- a/tests/nonsmoke/functional/CompileTests/Makefile.am
+++ b/tests/nonsmoke/functional/CompileTests/Makefile.am
@@ -7,7 +7,7 @@ include $(top_srcdir)/config/Makefile.for.ROSE.includes.and.libs
 #      copyAST_tests RoseExample_tests PythonExample_tests \
 #      colorAST_tests mergeAST_tests unparseToString_tests \
 #      sourcePosition_tests OpenMP_tests \
-#      boost_tests virtualCFG_tests uninitializedField_tests \
+#      virtualCFG_tests uninitializedField_tests \
 #      A++Tests OvertureCode P++Tests A++Code ElsaTestCases \
 #      ExpressionTemplateExample_tests hiddenTypeAndDeclarationListTests \
 #      sizeofOperation_tests MicrosoftWindows_tests nameQualificationAndTypeElaboration_tests \
@@ -106,7 +106,7 @@ if ROSE_BUILD_CXX_LANGUAGE_SUPPORT
       copyAST_tests \
       colorAST_tests unparseToString_tests \
       sourcePosition_tests \
-      boost_tests uninitializedField_tests \
+      uninitializedField_tests \
       OvertureCode \
       ExpressionTemplateExample_tests hiddenTypeAndDeclarationListTests \
       sizeofOperation_tests nameQualificationAndTypeElaboration_tests \
diff --git a/tests/nonsmoke/functional/CompileTests/boost_tests/CMakeLists.txt b/tests/nonsmoke/functional/CompileTests/boost_tests/CMakeLists.txt
deleted file mode 100644
index 0b14cdfbc7d..00000000000
--- a/tests/nonsmoke/functional/CompileTests/boost_tests/CMakeLists.txt
+++ /dev/null
@@ -1,18 +0,0 @@
-set(ROSE_FLAGS --edg:no_warnings -w -rose:verbose 0 --edg:restrict)
-
-# the following tests either fail or take too long to run
-#test_boost_lambda.C
-#test_boost_phoenix_v1.C
-#test_boost_phoenix_v2.C
-
-if(EDG_VERSION STREQUAL "4.3")
-  set(files_to_test
-    test_boost_lambda.C
-    test_boost_phoenix_v1.C
-  )
-  set(translator testFrontEnd)
-endif()
-
-foreach(file_to_test ${files_to_test})
-  compile_test(${file_to_test} BOOSTTEST)
-endforeach()
diff --git a/tests/nonsmoke/functional/CompileTests/boost_tests/Makefile.am b/tests/nonsmoke/functional/CompileTests/boost_tests/Makefile.am
deleted file mode 100644
index 780c3a62163..00000000000
--- a/tests/nonsmoke/functional/CompileTests/boost_tests/Makefile.am
+++ /dev/null
@@ -1,115 +0,0 @@
-include $(top_srcdir)/config/Makefile.for.ROSE.includes.and.libs
-EXTRA_DIST =
-TEST_TARGETS =
-
-########################################################################################################################
-# Input specimens for the tests
-
-# All input specimens for the tests, regardless of whether they are expected to pass or fail.
-SPECIMENS_all =					\
-	test_unordered_map_include.C		\
-	test_boost_lambda.C			\
-	test_boost_phoenix_v1.C			\
-	test_boost_phoenix_v2.C
-
-EXTRA_DIST += $(SPECIMENS_all)
-
-########################################################################################################################
-# STUFF FOR THE "testTranslator" TESTS RUN ON EACH INPUT SPECIMEN
-
-# The test executable which runs some test (encoded in the executable) on each specimen.
-TRANSLATOR = ../../testTranslator
-
-../../testTranslator:
-	make -C ../.. testTranslator
-
-# Flags to use when running the tests.  Note that we need both the preinclude and normal include directories for
-# boost because the pre-include path might be empty in some configurations (e.g., when configuring with
-# --with-boost=NON_SYSTEM_DIRECTORY as of 2014-04-08).
-TRANSLATOR_FLAGS =				\
-	--edg:no_warnings			\
-	-w					\
-	-rose:verbose 0				\
-	--edg:restrict				\
-	$(ROSE_BOOST_PREINCLUDE_PATH)		\
-	$(ROSE_BOOST_NORMAL_INCLUDE_PATH)
-
-# Split specimens into separate lists.  The "special" are those specimens that must be run differently than all the rest (i.e.,
-# they need to be run with different command-line switches).
-TRANSLATOR_SPECIMENS_special =			\
-	test_boost_phoenix_v2.C
-TRANSLATOR_SPECIMENS_normal = 			\
-	$(filter-out $(TRANSLATOR_SPECIMENS_special), $(SPECIMENS_all))
-TRANSLATOR_SPECIMENS_failing =			\
-	test_boost_lambda.C			\
-	test_boost_phoenix_v1.C			\
-	test_boost_phoenix_v2.C
-TRANSLATOR_SPECIMENS_passing =			\
-	$(filter-out $(TRANSLATOR_SPECIMENS_failing), $(SPECIMENS_all))
-
-
-# Makefile targets for running tests.  The "special" things need to be separated out because they need different
-# rules.  If they appear as the target for multiple rules then we'll get warnings from make.
-TRANSLATOR_TARGETS_special = $(addprefix translator-, $(addsuffix .passed, $(TRANSLATOR_SPECIMENS_special)))
-TRANSLATOR_TARGETS_normal  = $(addprefix translator-, $(addsuffix .passed, $(TRANSLATOR_SPECIMENS_normal)))
-TRANSLATOR_TARGETS_failing = $(addprefix translator-, $(addsuffix .passed, $(TRANSLATOR_SPECIMENS_failing)))
-TRANSLATOR_TARGETS_passing = $(addprefix translator-, $(addsuffix .passed, $(TRANSLATOR_SPECIMENS_passing)))
-
-# Rules for testing normal specimens regardless of whether we expect them to pass or fail.
-$(TRANSLATOR_TARGETS_normal): translator-%.passed: % $(TRANSLATOR)
-	@$(RTH_RUN)									\
-		TITLE="testTranslator $* [$@]"						\
-		USE_SUBDIR=yes								\
-		CMD="$(abspath $(TRANSLATOR)) $(TRANSLATOR_FLAGS) -c $(srcdir)/$*"	\
-		$(top_srcdir)/scripts/test_exit_status $@
-
-# Rules for the special specimens regardless of whether we expect them to pass or fail.
-test_boost_phoenix_v2_flags =					\
-	-rose:verbose 0						\
-	-I$(srcdir)/usr/local/mstools/include			\
-	-I$(srcdir)/usr/local/mstools/include/phoenix_v2	\
-	$(ROSE_BOOST_PREINCLUDE_PATH)				\
-	$(ROSE_BOOST_NORMAL_INCLUDE_PATH)
-translator-test_boost_phoenix_v2.C.passed: test_boost_phoenix_v2.C $(TRANSLATOR)
-	@$(RTH_RUN)										\
-		TITLE="testTranslator $< [$@]"							\
-		USE_SUBDIR=yes									\
-		CMD="$(abspath $(TRANSLATOR)) $(test_boost_phoenix_v2_flags) -c $(abspath $<)"	\
-		$(top_srcdir)/scripts/test_exit_status $@
-
-# These are the targets that are run by "make check", those that we expect to pass.
-TEST_TARGETS += $(TRANSLATOR_TARGETS_passing)
-
-# These are targets that we might want to run manually.
-.PHONY: check-translator-passing check-translator-failing check-translator
-check-translator-passing: $(TRANSLATOR_TARGETS_passing)
-check-translator-failing: $(TRANSLATOR_TARGETS_failing)
-check-translator: check-translator-passing check-translator-failing
-
-# DQ (8/17/2015): This could be made less boost specific, I think.
-test_boost_include_ordering:
-	../../testTranslator -I/nfs/casc/overture/ROSE/opt/rhel6/x86_64/boost/1_53_0/gcc/4.4.7/include -c $(srcdir)/include_ordering.C
-
-
-########################################################################################################################
-# The original makefile also had $(QMTEST_Objects) which were test targets, but the rules did not work and they were
-# not run by "make check".  See the Git commit if you're interested. [Robb P Matzke 2014-04-08]
-
-
-########################################################################################################################
-# Automake boilerplate
-
-# check-local: $(TEST_TARGETS)
-check-local: 
-	@echo "Tests for boot specific regresstion tests operation."
-if USING_GNU_COMPILER
-	@echo "USING_GCC_COMPILER == true"
-	@$(MAKE) $(TEST_TARGETS)
-endif
-	@echo "*********************************************************************************************************************"
-	@echo "****** ROSE/tests/nonsmoke/functional/CompileTests/boost_tests: make check rule complete (terminated normally) ******"
-	@echo "*********************************************************************************************************************"
-
-clean-local:
-	rm -f $(TEST_TARGETS) $(TEST_TARGETS:.passed=.failed)
-	rm -f $(TRANSLATOR_TARGETS_failing) $(TRANSLATOR_TARGETS_failing:.passed=.failed)
diff --git a/tests/nonsmoke/functional/CompileTests/boost_tests/README b/tests/nonsmoke/functional/CompileTests/boost_tests/README
deleted file mode 100644
index fabb644e20b..00000000000
--- a/tests/nonsmoke/functional/CompileTests/boost_tests/README
+++ /dev/null
@@ -1,15 +0,0 @@
-ROSE Tests: Markus Schordan
-Here is a short summary of the encountered problems and files that demonstrate it. See the test files for detailed problem descriptions.
-
-test_boost_lambda.C
-ROSE 0.8.7a source: OK
-ROSE 0.8.8a binary: FAIL
-
-test_boost_phoenix_v1.C [use phoenix V1 for testing!]
-ROSE 0.8.7a source: OK
-ROSE 0.8.8a binary: OK
-
-test_boost_phoenix_v2.C [use phoenix V2 for testing!]
-ROSE 0.8.7a source: FAIL
-ROSE 0.8.8a binary: FAIL
-
diff --git a/tests/nonsmoke/functional/CompileTests/boost_tests/include_ordering.C b/tests/nonsmoke/functional/CompileTests/boost_tests/include_ordering.C
deleted file mode 100644
index ea5b59c0616..00000000000
--- a/tests/nonsmoke/functional/CompileTests/boost_tests/include_ordering.C
+++ /dev/null
@@ -1,43 +0,0 @@
-
-#include <boost/shared_ptr.hpp>
-
-// boost 1.53.0 and later moved to dynamic_pointer_cast from dynamic_cast_tag
-#include "boost/version.hpp"
-
-// #if 1
-#if BOOST_VERSION > 105200
-   #define SHARED_PTR_CAST(TYPE,VAR) boost::dynamic_pointer_cast<TYPE>(VAR)
-#else
-   #define SHARED_PTR_CAST(TYPE,VAR) VAR, boost::detail::dynamic_cast_tag()
-#endif
-
-#if BOOST_VERSION > 105200
-   #warning "using later version of boost"
-#else
-   #warning "using earlier version of boost"
-#endif
-
-struct TTT {};
-
-
-template<class T> class df_shared_ptr: public boost::shared_ptr<T>
-   {
-     public:
-          df_shared_ptr() {}
-
-          template<class Y>
-          explicit df_shared_ptr(Y * p)
-             {
-               boost::shared_ptr<T>::reset(p);
-             }
-
-       // template<class Y> df_shared_ptr(df_shared_ptr<Y> const & r) : boost::shared_ptr<T>(r,boost::detail::dynamic_cast_tag()) {}
-          template<class Y> df_shared_ptr(df_shared_ptr<Y> const & r) : boost::shared_ptr<T>(SHARED_PTR_CAST(df_shared_ptr<Y>,r)) {}
-
-   };
-
-
-void foobar()
-   {
-     df_shared_ptr<TTT> tt;
-   }
diff --git a/tests/nonsmoke/functional/CompileTests/boost_tests/test_boost_lambda.C b/tests/nonsmoke/functional/CompileTests/boost_tests/test_boost_lambda.C
deleted file mode 100644
index 8182b2f07ed..00000000000
--- a/tests/nonsmoke/functional/CompileTests/boost_tests/test_boost_lambda.C
+++ /dev/null
@@ -1,37 +0,0 @@
-/*
-  This file demonstrates that ROSE 0.8.8a fails processing a for_each loop with
-  the boost lambda library
-  BUT ROSE 0.8.7a CAN process this file without problems!
-
-  ROSE 0.8.8a binary: defaultTranslator -3 FAILS (Aborted)
-  ROSE 0.8.7a source: defaultTranslator -5 OK
-
-  Author: Markus Schordan, 17-Aug-2006
-*/
-
-#include<iostream>
-#include<algorithm>
-#include<vector>
-#include<list>
-#include<boost/lambda/lambda.hpp>
-
-
-using namespace boost;
-
-int main()
-{
-	typedef double numeric_type;
-
-	// container ======
-	//
-	std::vector<numeric_type> mycontainer(4);
-
-	// -------------------------------------------------
-	//
-	// == Lambda
-	//
-	std::for_each(mycontainer.begin(), mycontainer.end(), 
-			boost::lambda::_1 +=1.0 );			
-
-	return 0;
-}
diff --git a/tests/nonsmoke/functional/CompileTests/boost_tests/test_boost_macro_include.cpp b/tests/nonsmoke/functional/CompileTests/boost_tests/test_boost_macro_include.cpp
deleted file mode 100644
index 355f86b8451..00000000000
--- a/tests/nonsmoke/functional/CompileTests/boost_tests/test_boost_macro_include.cpp
+++ /dev/null
@@ -1,16 +0,0 @@
-#include <stdio.h>
-
-#include <boost/preprocessor/slot/slot.hpp>
-#include <boost/preprocessor/stringize.hpp>
-
-#define X() 4
-
-#define BOOST_PP_VALUE 1 + 2 + 3 + X()
-#include BOOST_PP_ASSIGN_SLOT(1)
-
-#undef X
-
-int main(int argc, char** argv) {
-   printf("%s\n", BOOST_PP_STRINGIZE(BOOST_PP_SLOT(1)));
-   return 0;
-}
\ No newline at end of file
diff --git a/tests/nonsmoke/functional/CompileTests/boost_tests/test_boost_phoenix_v1.C b/tests/nonsmoke/functional/CompileTests/boost_tests/test_boost_phoenix_v1.C
deleted file mode 100644
index 157b48eeba0..00000000000
--- a/tests/nonsmoke/functional/CompileTests/boost_tests/test_boost_phoenix_v1.C
+++ /dev/null
@@ -1,29 +0,0 @@
-/*
-  This file demonstrates that ROSE 0.8.8a can process Boost Phoenix V1.0
-  Note: this test fails with Phoenix V2.0, see test_phoenix_v2.cc
-  Author: Markus Schordan, 17-Aug-2006
-*/
-
-#include<iostream>
-#include<algorithm>
-#include<vector>
-#include<list>
-
-#include<boost/spirit/phoenix.hpp>
-
-using namespace boost;
-
-int main()
-{
-	typedef double numeric_type;
-
-	// container ======
-	//
-	std::vector<numeric_type> mycontainer(4);
-	std::vector<numeric_type>::iterator it;
-
-	std::for_each(mycontainer.begin(), mycontainer.end(), 
-			phoenix::arg1 += 1.0 );
-
-	return 0;
-}
diff --git a/tests/nonsmoke/functional/CompileTests/boost_tests/test_boost_phoenix_v2.C b/tests/nonsmoke/functional/CompileTests/boost_tests/test_boost_phoenix_v2.C
deleted file mode 100644
index 18c40b52d70..00000000000
--- a/tests/nonsmoke/functional/CompileTests/boost_tests/test_boost_phoenix_v2.C
+++ /dev/null
@@ -1,50 +0,0 @@
-/*
-  This file demonstrates a problem with ROSE 0.8.8a:
-  The Boost Phoenix library V2.0 is using template template parameters. 
-  The EDG-ROSE connection does not handle such parameters.
-
-  Error: case tak_template reached in sage_form_template_args()
-         ROSE/src/frontend/EDG_SAGE_Connection/sage_il_to_str.C:347: SgTemplateArgumentPtrList* sage_form_template_args(a_template_arg*, an_il_to_str_output_control_block*): Assertion `false' failed.
-
-  Code from EDG-ROSE connection from sage_il_to_str.C, line 347:
-
-                  case tak_template: // A template template argument.
-                  {
-                 // form_template(tap->variant.templ.ptr, octl);
-                    printf ("Error: case tak_template reached in sage_form_template_args() \n");
-                    ROSE_ASSERT (false);
-                    break;
-                  }
-
-
-  Remark: Note that the Boost Phoenix Library V1.0 does work with the same user code.
-          See test_phoenix_v1.cc
-
-  Bug reported: Markus Schordan, 17-Aug-2006
-*/
-
-#include<iostream>
-#include<algorithm>
-#include<vector>
-#include<list>
-
-#include<boost/spirit/phoenix/core.hpp>
-#include<boost/spirit/phoenix/function.hpp>
-#include<boost/spirit/phoenix/operator.hpp>
-
-using namespace boost;
-
-int main()
-{
-	typedef double numeric_type;
-
-	// container ======
-	//
-	std::vector<numeric_type> mycontainer(4);
-	std::vector<numeric_type>::iterator it;
-
-	std::for_each(mycontainer.begin(), mycontainer.end(), 
-			phoenix::arg1 += 1.0 );
-
-	return 0;
-}
diff --git a/tests/nonsmoke/functional/CompileTests/boost_tests/test_unordered_map_include.C b/tests/nonsmoke/functional/CompileTests/boost_tests/test_unordered_map_include.C
deleted file mode 100644
index 2b525d74168..00000000000
--- a/tests/nonsmoke/functional/CompileTests/boost_tests/test_unordered_map_include.C
+++ /dev/null
@@ -1,4 +0,0 @@
-// Test this boost header file.
-
-#include <boost/unordered_map.hpp>
-
diff --git a/tests/smoke/unit/Boost/Makefile.am b/tests/smoke/unit/Boost/Makefile.am
deleted file mode 100644
index 3ed6c968ec4..00000000000
--- a/tests/smoke/unit/Boost/Makefile.am
+++ /dev/null
@@ -1,61 +0,0 @@
-include $(top_srcdir)/config/Makefile.for.ROSE.includes.and.libs
-SUBDIRS =
-
-noinst_PROGRAMS =
-TEST_TARGETS =
-
-AM_CPPFLAGS = $(ROSE_INCLUDES)
-AM_LDFLAGS = $(ROSE_RPATHS)
-LDADD = $(ROSE_LIBS)
-
-###############################################################################################################################
-# Check boost library linkage consistency
-###############################################################################################################################
-
-noinst_PROGRAMS += testBoost
-testBoost_SOURCES = testBoost.C
-
-TEST_TARGETS += testBoost.passed
-
-testBoost.passed: $(top_srcdir)/scripts/test_exit_status testBoost
-	@$(RTH_RUN)				\
-		TITLE="boost linkage [$@]"	\
-		CMD="./testBoost"		\
-		$< $@
-
-
-###############################################################################################################################
-# Test that boost::regex works. Also ensures that boost hasn't been compiled with -DBOOST_REGEX_MATCH_EXTRA
-###############################################################################################################################
-
-noinst_PROGRAMS += testBoostRegex
-testBoostRegex_SOURCES = testBoostRegex.C
-
-TEST_TARGETS += testBoostRegex.passed
-
-testBoostRegex.passed: $(top_srcdir)/scripts/test_exit_status testBoostRegex
-	@$(RTH_RUN)					\
-		TITLE="boost regex library [$@]"	\
-		CMD=./testBoostRegex			\
-		$< $@
-
-###############################################################################################################################
-# Test that boost::thread works.
-###############################################################################################################################
-
-noinst_PROGRAMS += testBoostThreads
-testBoostThreads_SOURCES = testBoostThreads.C
-
-TEST_TARGETS += testBoostThreads.passed
-
-testBoostThreads.passed: $(top_srcdir)/scripts/test_exit_status testBoostThreads
-	@$(RTH_RUN)				\
-		TITLE="boost threads [$@]"	\
-		CMD=./testBoostThreads		\
-		$< $@
-
-###############################################################################################################################
-# Boilerplate
-###############################################################################################################################
-
-check-local: $(TEST_TARGETS)
diff --git a/tests/smoke/unit/Boost/testBoost.C b/tests/smoke/unit/Boost/testBoost.C
deleted file mode 100644
index a57477ecad7..00000000000
--- a/tests/smoke/unit/Boost/testBoost.C
+++ /dev/null
@@ -1,53 +0,0 @@
-#include "rose_getline.h"
-
-#include <cctype>
-#include <cstdlib>
-#include <cstring>
-#include <boost/version.hpp>
-#include <iostream>
-
-int
-main(int argc, char *argv[])
-{
-    size_t nchecked=0, nerrors=0;
-    
-    // What version of boost headers was I compiled with?
-    char hdr_version[64];
-    sprintf(hdr_version, "%d.%d.%d", BOOST_VERSION/100000, (BOOST_VERSION/100)%1000, BOOST_VERSION%100);
-
-    // What version of boost libraries was I compiled with?  We want to check every boost library individually, so we look at
-    // our memory map rather than calling a particular boost library function.
-    FILE *f = fopen("/proc/self/maps", "r");
-    if (!f)
-        return 0;
-    char *line = NULL;
-    size_t linesz = 0;
-    ssize_t n;
-    while ((n=rose_getline(&line, &linesz, f))>0) {
-        while (n>0 && isspace(line[n-1]))
-            line[--n]='\0';
-        char *basename = strrchr(line, '/');
-        basename = basename ? basename+1 : line;
-        if (strncmp(basename, "libboost", 8))
-            continue; 
-        char *so = strstr(basename, ".so.");
-        if (!so)
-            continue;
-        char *lib_ver = so+4;
-
-        ++nchecked;
-        if (strcmp(hdr_version, lib_ver)) {
-            std::cerr <<argv[0] <<": error: compiled with boost " <<hdr_version <<" but linked with " <<basename <<"\n"
-                      <<"    " <<line <<"\n";
-            ++nerrors;
-        }
-    }
-    fclose(f);
-    if (line)
-        free(line);
-
-    std::cout <<"checked " <<nchecked <<" boost " <<(1==nchecked?"library":"libraries")
-              <<" and found " <<nerrors <<(1==nerrors?" error":" errors") <<"\n";
-    return nerrors ? 1 : 0;
-}
-
diff --git a/tests/smoke/unit/Boost/testBoostRegex.C b/tests/smoke/unit/Boost/testBoostRegex.C
deleted file mode 100644
index e384b56b39c..00000000000
--- a/tests/smoke/unit/Boost/testBoostRegex.C
+++ /dev/null
@@ -1,15 +0,0 @@
-// Tests that boost::regex is usable within ROSE.  For instance, this test will fail miserably (segfault,
-// throw std::bad_alloc, failed assertion, etc. depending on compiler flags) if the ROSE (and this file
-// in particular) is compiled with -DBOOST_REGEX_MATCH_EXTRA but libboost_regex.so is compiled without
-// any special features.
-#include <boost/regex.hpp>
-
-int main() {
-    const char *s = "[;,]\\s*";
-    const char *t = "one, two";
-    boost::regex re(s);
-    boost::cmatch matched;
-    if (regex_search(t, matched, re) && 3==matched.position())
-        return 0;
-    return 1;
-}
diff --git a/tests/smoke/unit/Boost/testBoostThreads.C b/tests/smoke/unit/Boost/testBoostThreads.C
deleted file mode 100644
index ad406f67db7..00000000000
--- a/tests/smoke/unit/Boost/testBoostThreads.C
+++ /dev/null
@@ -1,41 +0,0 @@
-#include <boost/thread.hpp>
-#include <boost/cstdint.hpp>
-#include <iostream>
-
-#define NWORKERS 12ul
-#define WORKER_MAJOR 10000ul
-#define WORKER_MINOR 1000ul
-
-boost::mutex globalAccumulatorMutex;
-static boost::uint64_t globalAccumulator = 0;
-
-void
-worker() {
-    for (boost::uint64_t i = 0; i < WORKER_MAJOR; ++i) {
-        boost::uint64_t accum = 0;
-        for (boost::uint64_t j = 0; j < WORKER_MINOR; ++j) {
-            accum = (accum << 13) ^ (accum >> 7);
-            accum += j;
-        }
-
-        boost::lock_guard<boost::mutex> lock(globalAccumulatorMutex);
-        globalAccumulator += accum;
-    }
-}
-
-int
-main() {
-    boost::thread *workers = new boost::thread[NWORKERS];
-    for (size_t i = 0; i < NWORKERS; ++i)
-        workers[i] = boost::thread(worker);
-    for (size_t i = 0; i < NWORKERS; ++i)
-        workers[i].join();
-    delete[] workers;
-    std::cout <<globalAccumulator <<"\n";
-
-    // Done this way for 32-bit compilers
-    return
-        (( globalAccumulator        & 0xfffffffful) == 0xe257aec0ul &&
-         ((globalAccumulator >> 32) & 0xfffffffful) == 0x0a31b218ul)
-        ? 0 : 1;
-}
diff --git a/tests/smoke/unit/Makefile.am b/tests/smoke/unit/Makefile.am
index c14d049081f..c0aff38eefe 100644
--- a/tests/smoke/unit/Makefile.am
+++ b/tests/smoke/unit/Makefile.am
@@ -4,4 +4,4 @@ include $(top_srcdir)/config/Makefile.for.ROSE.includes.and.libs
 # Matzke (4/21/2017): None of these tests do anything with EDG, so this complicated logic shouldn't be necessary here. Reverting.
 
 # These unit test directories should be listed so lower software layers are tested before higher layers.
-SUBDIRS = Boost
+SUBDIRS =

From 99e67627f8e9a16d94272697ce792bf0b90b60ed Mon Sep 17 00:00:00 2001
From: Yonghong Yan <yanyh15@gmail.com>
Date: Fri, 15 Nov 2024 01:03:35 -0500
Subject: [PATCH 29/42] deBoost: remove boost-based useless graph processing
 headers

---
 .../Tokens.h                                  |   12 +-
 .../astProcessing/Makefile.am-recursive       |    4 +-
 src/midend/astProcessing/Makefile_variables   |    4 -
 src/midend/astProcessing/SgGraphTemplate.h    |  201 --
 src/midend/astProcessing/graphProcessing.h    | 1559 --------------
 .../astProcessing/graphProcessingSgIncGraph.h | 1865 -----------------
 src/midend/astProcessing/graphTemplate.h      |  531 -----
 .../astProcessingTests/processnew3Down4.C     |   68 -
 8 files changed, 8 insertions(+), 4236 deletions(-)
 delete mode 100644 src/midend/astProcessing/SgGraphTemplate.h
 delete mode 100644 src/midend/astProcessing/graphProcessing.h
 delete mode 100644 src/midend/astProcessing/graphProcessingSgIncGraph.h
 delete mode 100644 src/midend/astProcessing/graphTemplate.h
 delete mode 100644 tests/nonsmoke/functional/roseTests/astProcessingTests/processnew3Down4.C

diff --git a/src/frontend/Experimental_General_Language_Support/Tokens.h b/src/frontend/Experimental_General_Language_Support/Tokens.h
index dfc46531800..c1b8ed0816d 100644
--- a/src/frontend/Experimental_General_Language_Support/Tokens.h
+++ b/src/frontend/Experimental_General_Language_Support/Tokens.h
@@ -10,7 +10,7 @@
 #include <fstream>
 #include <string>
 #include <vector>
-#include <boost/optional.hpp>
+#include <optional>
 
 namespace Rose {
   namespace builder {
@@ -67,15 +67,15 @@ class TokenStream {
   TokenStream() = delete;
   TokenStream(std::istringstream &);
 
-  boost::optional<const Token&> const getNextToken() {
+  std::optional<const Token&> const getNextToken() {
     if (next_ < tokens_.size()) {
-      return boost::optional<const Token&>(tokens_[next_]);
+      return std::optional<const Token&>(tokens_[next_]);
     }
-    return boost::none;
+    return std::nullopt;
   }
 
-  boost::optional<const Token&> consumeNextToken() {
-    boost::optional<const Token&> nextToken{getNextToken()};
+  std::optional<const Token&> consumeNextToken() {
+    std::optional<const Token&> nextToken{getNextToken()};
     next_ += 1;
     return nextToken;
   }
diff --git a/src/midend/astProcessing/Makefile.am-recursive b/src/midend/astProcessing/Makefile.am-recursive
index 9c5f1317410..ce0b756cecd 100644
--- a/src/midend/astProcessing/Makefile.am-recursive
+++ b/src/midend/astProcessing/Makefile.am-recursive
@@ -15,8 +15,8 @@ include_HEADERS = \
    AstReverseSimpleProcessing.h AstRestructure.h AstClearVisitFlags.h \
    AstTraversal.h AstCombinedProcessing.h AstCombinedProcessingImpl.h \
    AstCombinedSimpleProcessing.h StackFrameVector.h AstSharedMemoryParallelProcessing.h \
-   AstSharedMemoryParallelProcessingImpl.h AstSharedMemoryParallelSimpleProcessing.h graphProcessing.h \
-   graphTemplate.h SgGraphTemplate.h TreeTraversal.h plugin.h
+   AstSharedMemoryParallelProcessingImpl.h AstSharedMemoryParallelSimpleProcessing.h \
+   TreeTraversal.h plugin.h
 
 
 libastprocessingSources = \
diff --git a/src/midend/astProcessing/Makefile_variables b/src/midend/astProcessing/Makefile_variables
index 4160261d8c6..d3b38ec7bb6 100644
--- a/src/midend/astProcessing/Makefile_variables
+++ b/src/midend/astProcessing/Makefile_variables
@@ -41,10 +41,6 @@ mAstProcessing_includeHeaders=\
 	$(mAstProcessingPath)/AstSharedMemoryParallelProcessing.h \
 	$(mAstProcessingPath)/AstSharedMemoryParallelProcessingImpl.h \
 	$(mAstProcessingPath)/AstSharedMemoryParallelSimpleProcessing.h \
-	$(mAstProcessingPath)/graphProcessing.h \
-	$(mAstProcessingPath)/graphProcessingSgIncGraph.h \
-	$(mAstProcessingPath)/graphTemplate.h \
-        $(mAstProcessingPath)/SgGraphTemplate.h \
         $(mAstProcessingPath)/TreeTraversal.h
 
 mAstProcessing_extraDist=\
diff --git a/src/midend/astProcessing/SgGraphTemplate.h b/src/midend/astProcessing/SgGraphTemplate.h
deleted file mode 100644
index 9429026a6b4..00000000000
--- a/src/midend/astProcessing/SgGraphTemplate.h
+++ /dev/null
@@ -1,201 +0,0 @@
-#include <boost/graph/adjacency_list.hpp>
-#include <boost/graph/astar_search.hpp>
-//#include <graphProcessing.h>
-#include <staticCFG.h>
-#include <interproceduralCFG.h>
-#include <rose.h>
-struct Vertex{
-    SgGraphNode* sg;
-    CFGNode cfgnd;
-};
-
-struct Edge {
-    SgDirectedGraphEdge* gedge;
-};
-
-typedef boost::adjacency_list<
-        boost::vecS,
-        boost::vecS,
-        boost::bidirectionalS,
-        Vertex,
-        Edge
-> myGraph;
-
-typedef myGraph::vertex_descriptor VertexID;
-typedef myGraph::edge_descriptor EdgeID;
-
-//myGraph* instantiateGraph(SgIncidencedDirectedGraph* g, StaticCFG::CFG cfg);
-std::pair<std::vector<SgGraphNode*>, std::vector<SgDirectedGraphEdge*> > getAllNodesAndEdges(SgIncidenceDirectedGraph* g, SgGraphNode* start);
-std::map<VertexID, SgGraphNode*> getGraphNode;
-std::map<SgGraphNode*, VertexID> VSlink;
-
-myGraph* instantiateGraph(SgIncidenceDirectedGraph*& g, StaticCFG::InterproceduralCFG& cfg, SgNode* pstart) {
-    //SgNode* prestart = cfg.getEntry();
-    //cfg.buildFullCFG();
-    CFGNode startN = cfg.getEntry();
-    SgGraphNode* start = cfg.toGraphNode(startN);
-    ROSE_ASSERT(startN != NULL);
-    ROSE_ASSERT(start != NULL);
-    myGraph* graph = new myGraph;
-    //std::map<SgGraphNode*, VertexID> VSlink;
-    std::pair<std::vector<SgGraphNode*>, std::vector<SgDirectedGraphEdge*> > alledsnds = getAllNodesAndEdges(g, start);
-    std::vector<SgGraphNode*> nods = alledsnds.first;
-    std::vector<SgDirectedGraphEdge*> eds = alledsnds.second;
-    std::set<std::pair<VertexID, VertexID> > prs;
-    //for (std::vector<vertex_descriptor> i = nods.begin(); i != nods.end(); i++) {
-    //    VertexID vID = boost::add_vertex(graph);
-    //    graph[vID].cfgnd = cfg->toCFGNode(*i);
-    //}
-    for (std::vector<SgDirectedGraphEdge*>::iterator j = eds.begin(); j != eds.end(); j++) {
-        SgDirectedGraphEdge* u = *j;
-        SgGraphNode* u1 = u->get_from();
-        SgGraphNode* u2 = u->get_to();
-        VertexID v1;
-        VertexID v2;
-        if (VSlink.find(u1) == VSlink.end()) {
-            v1 = boost::add_vertex(*graph);
-            getGraphNode[v1] = u1;
-            VSlink[u1] = v1;
-            (*graph)[v1].sg = u1;
-            (*graph)[v1].cfgnd = cfg.toCFGNode(u1);
-        }
-        else {
-            v1 = VSlink[u1];
-        }
-        if (VSlink.find(u2) != VSlink.end()) {
-            v2 = VSlink[u2];
-        }
-        else {
-            v2 = boost::add_vertex(*graph);
-            VSlink[u2] = v2;
-            (*graph)[v2].sg = u2;
-            getGraphNode[v2] = u2;
-            (*graph)[v2].cfgnd = cfg.toCFGNode(u2);
-        }
-        bool ok;
-        EdgeID uE;
-        std::pair<VertexID, VertexID> pr;
-        pr.first = v1;
-        pr.second = v2;
-        if (prs.find(pr) == prs.end()) {
-            prs.insert(pr);
-            boost::tie(uE, ok) = boost::add_edge(v1, v2, *graph);
-        }
-    }
-    //std::cout << "prs.size: " << prs.size() << std::endl;
-    return graph;
-}
-
-
-
-myGraph* instantiateGraph(SgIncidenceDirectedGraph*& g, StaticCFG::CFG& cfg) {
-    SgGraphNode* start = cfg.getEntry();
-    myGraph* graph = new myGraph;
-    //std::map<SgGraphNode*, VertexID> VSlink;
-    std::pair<std::vector<SgGraphNode*>, std::vector<SgDirectedGraphEdge*> > alledsnds = getAllNodesAndEdges(g, start);
-    std::vector<SgGraphNode*> nods = alledsnds.first;
-    std::vector<SgDirectedGraphEdge*> eds = alledsnds.second;
-    std::set<std::pair<VertexID, VertexID> > prs;
-    //for (std::vector<vertex_descriptor> i = nods.begin(); i != nods.end(); i++) {
-    //    VertexID vID = boost::add_vertex(graph);
-    //    graph[vID].cfgnd = cfg->toCFGNode(*i);
-    //}
-    for (std::vector<SgDirectedGraphEdge*>::iterator j = eds.begin(); j != eds.end(); j++) {
-        SgDirectedGraphEdge* u = *j;
-        SgGraphNode* u1 = u->get_from();
-        SgGraphNode* u2 = u->get_to();
-        VertexID v1;
-        VertexID v2;
-        if (VSlink.find(u1) == VSlink.end()) {
-            v1 = boost::add_vertex(*graph);
-            getGraphNode[v1] = u1;
-            VSlink[u1] = v1;
-            (*graph)[v1].sg = u1;
-            (*graph)[v1].cfgnd = cfg.toCFGNode(u1);
-        }
-        else {
-            v1 = VSlink[u1];
-        }
-        if (VSlink.find(u2) != VSlink.end()) {
-            v2 = VSlink[u2];
-        }
-        else {
-            v2 = boost::add_vertex(*graph);
-            VSlink[u2] = v2;
-            (*graph)[v2].sg = u2;
-            getGraphNode[v2] = u2;
-            (*graph)[v2].cfgnd = cfg.toCFGNode(u2);
-        }
-        bool ok;
-        EdgeID uE;
-        std::pair<VertexID, VertexID> pr;
-        pr.first = v1;
-        pr.second = v2;
-        if (prs.find(pr) == prs.end()) {
-            prs.insert(pr);
-            boost::tie(uE, ok) = boost::add_edge(v1, v2, *graph);
-        }
-    }
-    //std::cout << "prs.size: " << prs.size() << std::endl;
-    return graph;
-}
-
-
-    
-            
-std::pair<std::vector<SgGraphNode*>, std::vector<SgDirectedGraphEdge*> > getAllNodesAndEdges(SgIncidenceDirectedGraph* g, SgGraphNode* start) {
-    //for (int i = 0; i < starts.size(); i++) {
-    SgGraphNode* n = start;
-    std::vector<SgGraphNode*> nods;
-    std::vector<SgGraphNode*> newnods;
-    std::set<SgDirectedGraphEdge*> edsnew;
-    std::vector<SgDirectedGraphEdge*> eds;
-    std::vector<SgDirectedGraphEdge*> feds;
-    std::vector<SgGraphNode*> fnods;
-    std::set<std::pair<EdgeID, EdgeID> > prs;
-    std::set<SgDirectedGraphEdge*> oeds = g->computeEdgeSetOut(start);
-    fnods.push_back(start);
-    newnods.push_back(n);
-    
-    while (oeds.size() > 0) {
-        for (std::set<SgDirectedGraphEdge*>::iterator j = oeds.begin(); j != oeds.end(); j++) {
-            //if (find(eds.begin(), eds.end(), *j) == eds.end()) {
-                if (find(feds.begin(), feds.end(), *j) == feds.end()) {
-                    feds.push_back(*j);
-                    edsnew.insert(*j);
-                }
-                if (find(fnods.begin(), fnods.end(), (*j)->get_to()) == fnods.end()) {
-                    fnods.push_back((*j)->get_to());
-                }
-                newnods.push_back((*j)->get_to());
-            //}
-        }
-        
-        for (unsigned int i = 0; i < newnods.size(); i++) {
-           std::set<SgDirectedGraphEdge*> oedsp = g->computeEdgeSetOut(newnods[i]);
-           for (std::set<SgDirectedGraphEdge*>::iterator j = oedsp.begin(); j != oedsp.end(); j++) {
-               if (find(feds.begin(), feds.end(), *j) == feds.end()) {
-              //    feds.push_back(*j);
-                  edsnew.insert(*j);
-                  
-               }
-               //if (find(fnods.begin(), fnods.end(), (*j)->get_to()) == fnods.end()) {
-               //    fnods.push_back((*j)->get_to());
-               //    newnods.push_back((*j)->get_to());
-              // }
-    //           newnods.push_back((*j)->get_to());
-           }
-        }
-        nods = newnods;
-        oeds = edsnew;
-        edsnew.clear();
-        newnods.clear();
-    }
-    std::pair<std::vector<SgGraphNode*>, std::vector<SgDirectedGraphEdge*> > retpr;
-    retpr.first = fnods;
-    retpr.second = feds;
-    //std::cout << "fnods.size()" << fnods.size() << std::endl;
-    //std::cout << "feds.size()" << feds.size() << std::endl;
-    return retpr;
-}
-         
diff --git a/src/midend/astProcessing/graphProcessing.h b/src/midend/astProcessing/graphProcessing.h
deleted file mode 100644
index 0d8baadcf09..00000000000
--- a/src/midend/astProcessing/graphProcessing.h
+++ /dev/null
@@ -1,1559 +0,0 @@
-/*
-
-FINISH TEMPFLATPATH CODE
-
-AS WRITTEN, THESE FUNCTIONS WILL ONLY WORK WITH GRAPHS THAT ARE IMPLEMENTED IN THE boost NAMESPACE.
-
-*/
-
-
-
-
-#define LP 1
-#define PERFDEBUG 0
-//#define FULLDEBUG 1
-#ifdef _OPENMP
-#include <omp.h>
-#endif
-#include <boost/regex.hpp>
-#include <iostream>
-#include <fstream>
-#include <string>
-#include <assert.h>
-#include <staticCFG.h>
-
-/**
-*@file graphProcessing.h
-
-*Brief Overview of Algorithm:
-
-***********************
-*Current Implementation
-***********************
-
-*This implementation uses BOOSTs graph structure to analyze the paths of the graph
-
-*The path analyzer sends the user paths to be evaluated by the "analyzePath" function that is user defined
-
-**************************
-*Further Improvements: TODO
-**************************
-
-@todo utilize BOOST visitors to take advantage of the BOOST graph structures abilities
-
-***************
-*Contact Info
-***************
-
-*Finally, blame can be assigned to and questions can be forwarded to the author, though response is not guaranteed
-
-*if I'm still at Lawrence
-*hoffman34 AT llnl DOT gov
-*@author Michael Hoffman
-*/
-
-
-#include <boost/graph/adjacency_list.hpp>
-#include <boost/bind.hpp>
-#include <boost/tuple/tuple.hpp>
-#include <boost/graph/graphviz.hpp>
-#include <boost/graph/dominator_tree.hpp>
-#include <boost/graph/reverse_graph.hpp>
-#include <boost/graph/transpose_graph.hpp>
-#include <boost/algorithm/string.hpp>
-
-
-
-#include <vector>
-#include <algorithm>
-#include <utility>
-#include <iostream>
-#include <sys/time.h>
-#include <sys/resource.h>
-#include <sys/time.h>
-
-
-
-
-
-
-template <class CFG>
-class SgGraphTraversal
-{
-public:
-
-  typedef typename boost::graph_traits<CFG>::vertex_descriptor Vertex;
-    typedef typename boost::graph_traits<CFG>:: edge_descriptor Edge;
-
-   void constructPathAnalyzer(CFG* g, bool unbounded=false, Vertex end=0, Vertex begin=0, bool ns = true);
-   virtual void analyzePath(std::vector<Vertex>& pth) = 0;
-    std::vector<int> getInEdges(int& node, CFG*& g);
-    std::vector<int> getOutEdges(int& node, CFG*& g);
-    int getTarget(int& n, CFG*& g);
-    int getSource(int& n, CFG*& g);
-    std::map<Vertex, int> vertintmap;
-    std::map<Edge, int> edgeintmap;
-    std::map<int, Vertex> intvertmap;
-    std::map<int, Edge> intedgemap;
-   SgGraphTraversal();
-    virtual ~SgGraphTraversal();
-   SgGraphTraversal( SgGraphTraversal &);
-    SgGraphTraversal &operator=( SgGraphTraversal &);
-   int pathnum;
-
-
-  void firstPrepGraph(CFG*& g);
-
-private:
-
-    int normals;
-    int abnormals;
-    bool needssafety;
-    int recursed;
-    int checkedfound;
- //   typedef typename boost::graph_traits<CFG>::vertex_descriptor Vertex;
- //   typedef typename boost::graph_traits<CFG>:: edge_descriptor Edge;
-   // std::vector<int> getInEdges(int& node, CFG*& g);
-   // std::vector<int> getOutEdges(int& node, CFG*& g);
-    void prepareGraph(CFG*& g);
-    void findClosuresAndMarkersAndEnumerate(CFG*& g);
-  //  void constructPathAnalyzer(CFG* g, bool unbounded=false, Vertex end=0, Vertex begin=0, bool ns = true);
-  //  virtual void analyzePath(std::vector<Vertex>& pth) = 0;
-  //  void firstPrepGraph(CFG*& g);
-    int stoppedpaths;
-    std::set<std::vector<int> >  traversePath(int begin, int end, CFG*& g, bool loop=false);
-    std::set<std::vector<int> > uTraversePath(int begin, int end, CFG*& g, bool loop, std::map<int, std::vector<std::vector<int> > >& localLoops);
-    std::vector<std::vector<int> > bfsTraversePath(int begin, int end, CFG*& g, bool loop=false);
-    std::vector<int> unzipPath(std::vector<int>&  path, CFG*& g, int start, int end);
-    std::vector<int>  zipPath(std::vector<int>& path, CFG*& g, int start, int end);
-    std::vector<int> zipPath2(std::vector<int>& path, CFG*& g);
-    void printCFGNode(int& cf, std::ofstream& o);
-    void printCFGNodeGeneric(int& cf, std::string prop, std::ofstream& o);
-    void printCFGEdge(int& cf, CFG*& cfg, std::ofstream& o);
-    void printHotness(CFG*& g);
-    void printPathDot(CFG*& g);
-    void computeOrder(CFG*& g, const int& begin);
-    void computeSubGraphs(const int& begin, const int &end, CFG*& g, int depthDifferential);
-    //int getTarget(int& n, CFG*& g);
-    //int getSource(int& n, CFG*& g);
-    std::vector<int> sources;
-    std::vector<int> sinks;
-    std::vector<int>  recursiveLoops;
-    std::vector<int> recurses;
-    std::map<int, int> ptsNum;
-    bool borrowed;
-    std::set<int> badloop;
-    std::map<int, std::vector<std::vector<int> > >  totalLoops;
-//    int pathnum;
-    std::map<int, std::string> nodeStrings;
-    int sourcenum;
-    unsigned long long evaledpaths;
-    int badpaths;
-    int workingthreadnum;
-    bool workingthread;
-    std::map<int, std::set<std::vector<int> > > loopStore;
-    std::vector<std::vector<int> >  pathStore;
-    std::map<int, std::vector<int> > subpathglobal;
-    std::map<std::vector<int>, int> subpathglobalinv;
-    int nextsubpath;
-    std::vector<int>  orderOfNodes;
-//    std::map<Vertex, int> vertintmap;
-//    std::map<Edge, int> edgeintmap;
-//    std::map<int, Vertex> intvertmap;
-//    std::map<int, Edge> intedgemap;
-    std::vector<std::map<Vertex, Vertex> > SubGraphGraphMap;
-    std::vector<std::map<Vertex, Vertex> > GraphSubGraphMap;
-    std::vector<CFG*> subGraphVector;
-    void getVertexPath(std::vector<int> path, CFG*& g, std::vector<Vertex>& vertexPath );
-    void storeCompact(std::vector<int> path);
-    int nextNode;
-    int nextEdge;
-    std::vector<int> markers;
-    std::vector<int> closures;
-    std::map<int, int> markerIndex;
-    std::map<int, std::vector<int> > pathsAtMarkers;
-    typedef typename boost::graph_traits<CFG>::vertex_iterator vertex_iterator;
-    typedef typename boost::graph_traits<CFG>::out_edge_iterator out_edge_iterator;
-    typedef typename boost::graph_traits<CFG>::in_edge_iterator in_edge_iterator;
-    typedef typename boost::graph_traits<CFG>::edge_iterator edge_iterator;
-    bool bound;
-//    SgGraphTraversal();
-//    virtual ~SgGraphTraversal();
-//   SgGraphTraversal( SgGraphTraversal &);
-//    SgGraphTraversal &operator=( SgGraphTraversal &);
-
-
-};
-
-
-template<class CFG>
-SgGraphTraversal<CFG>::
-SgGraphTraversal()
-{
-}
-
-
-
-template<class CFG>
-SgGraphTraversal<CFG> &
-SgGraphTraversal<CFG>::
-operator=( SgGraphTraversal &other)
-{
-    return *this;
-}
-
-#ifndef SWIG
-
-template<class CFG>
-SgGraphTraversal<CFG>::
-~SgGraphTraversal()
-{
-}
-
-#endif
-
-/**
-    Gets the source of an edge
-    SgGraphTraversal::getSource
-    Input:
-    @param[edge] int& integer representation of edge in question
-    @param[g] CFG*& the CFG used
-*/
-template<class CFG>
-inline int
-SgGraphTraversal<CFG>::
-getSource(int& edge, CFG*& g)
-{
-    Edge e = intedgemap[edge];
-    Vertex v = boost::source(e, *g);
-    return(vertintmap[v]);
-}
-
-/**
-    Gets the target of an edge
-    SgGraphTraversal::getTarget
-    Input:
-    @param[edge] int& integer representation of edge in quesution
-    @param[g] the CFG*& CFG used
-*/
-
-
-template<class CFG>
-inline int
-SgGraphTraversal<CFG>::
-getTarget(int& edge, CFG*& g)
-{
-    Edge e = intedgemap[edge];
-    Vertex v = boost::target(e, *g);
-    return(vertintmap[v]);
-}
-
-/**
-Gets out edges with integer inputs, internal use only
-SgGraphTraversal::getInEdges
-Input:
-@param[node] int, integer representation of the node to get the in edges from
-@param[g] CFG* g, CFG
-*/
-
-template<class CFG>
-std::vector<int>
-SgGraphTraversal<CFG>::
-getInEdges(int& node, CFG*& g)
-{
-    Vertex getIns = intvertmap[node];
-    std::vector<int> inedges;
- // DQ (4/11/2017): Fix Klockworks issue of uninitialized variables.
-#if 1
-    in_edge_iterator i, j;
-#else
- // This does not compile.
-    in_edge_iterator i = inedges.begin();
-    in_edge_iterator j = i;
-#endif
-    for (boost::tie(i, j) = boost::in_edges(getIns, *g); i != j; ++i)
-    {
-        inedges.push_back(edgeintmap[*i]);
-    }
-    return inedges;
-}
-
-/**
-Gets out edges with integer inputs, internal use only
-SgGraphTraversal::getOutEdges
-Input:
-@param[node] int, integer representation of the node to get the out edges from
-@param[g] CFG* g, CFG
-*/
-
-
-
-template<class CFG>
-std::vector<int>
-SgGraphTraversal<CFG>::
-getOutEdges(int &node, CFG*& g)
-{
-    Vertex getOuts = intvertmap[node];
-    std::vector<int> outedges;
- // DQ (4/11/2017): Fix Klockworks issue of uninitialized variables.
-#if 1
-    out_edge_iterator i, j;
-#else
- // This does not compile.
-    out_edge_iterator i = outedges.begin();
-    out_edge_iterator j = i;
-#endif
-    for (boost::tie(i, j) = boost::out_edges(getOuts, *g); i != j; ++i)
-    {
-        outedges.push_back(edgeintmap[*i]);
-    }
-    return outedges;
-}
-
-/**
-Condenses paths, currently deprecated...
-Input:
-@param[pth] std::vector<int> the original path
-@param[g] CFG*, the ambient graph
-Output:
-zipped path
-*/
-
-template<class CFG>
-inline
-std::vector<int>
-SgGraphTraversal<CFG>::
-zipPath2(std::vector<int>& pth, CFG*& g) {
-    std::vector<int> npth;
-    npth.push_back(pth[0]);
-    for (int i = 1; i < pth.size()-1; i++) {
-       if (find(closures.begin(), closures.end(), pth[i]) != closures.end()) {
-           npth.push_back(pth[i]);
-       }
-    }
-    npth.push_back(pth.back());
-    return npth;
-}
-
-/**
-Condenses paths to simply the first and last node and the ordered set of edges
-taken at nodes with more than 1 outedge
-Input:
-@param[pth] std::vector<int>, the original path
-@param[g] CFG*, the ambient graph
-@param[start] integer representation of the first node
-@param[end] integer representation of the last node
-*/
-
-
-template<class CFG>
-std::vector<int>
-SgGraphTraversal<CFG>::
-zipPath(std::vector<int>& pth, CFG*& g, int start, int end) {
-                        std::vector<int> subpath;
-                        std::vector<int> movepath;
-                        movepath.push_back(pth.front());
-                        movepath.push_back(pth.back());
-                        for (unsigned int qw = 0; qw < pth.size()-1; qw++) {
-                           if (find(markers.begin(), markers.end(), pth[qw]) != markers.end()) {
-                               std::vector<int> oeds = getOutEdges(pth[qw], g);
-                               for (unsigned int i = 0; i < oeds.size(); i++) {
-                                   if (getTarget(oeds[i], g) == pth[qw+1]) {
-                                       movepath.push_back(oeds[i]);
-                                   }
-                               }
-                            }
-                         }
-                         return movepath;
-             }
-
-
-
-
-
-
-/**
-unzips the paths zipped by zipPath
-Input:
-@param[pzipped] the zipped path
-@param[CFG] the ambient graph
-@param[start] the integer representation of the first node (used to check that zipPath is working correctly)
-@param[end] the integer representation of the end node
-*/
-
-
-template<class CFG>
-std::vector<int>
-SgGraphTraversal<CFG>::
-unzipPath(std::vector<int>& pzipped, CFG*& g, int start, int end) {
-     ROSE_ASSERT(pzipped[0] == start && (pzipped[1] == end || end == -1));
-     std::vector<int> zipped;
-     for (unsigned int i = 2; i < pzipped.size(); i++) {
-         zipped.push_back(pzipped[i]);
-     }
-     std::vector<int> unzipped;
-     unzipped.push_back(start);
-     std::vector<int> oeds = getOutEdges(start, g);
-     if (oeds.size() == 0) {
-         return unzipped;
-     }
-     for (unsigned int i = 0; i < zipped.size(); i++) {
-         oeds = getOutEdges(unzipped.back(), g);
-         while (oeds.size() == 1) {
-             if (getTarget(oeds[0], g) == end && unzipped.size() != 1) {
-                  unzipped.push_back(end);
-                  return unzipped;
-             }
-             unzipped.push_back(getTarget(oeds[0], g));
-             oeds = getOutEdges(unzipped.back(), g);
-         }
-         if (oeds.size() == 0) {
-             return unzipped;
-         }
-         if (oeds.size() > 1 && (unzipped.back() != end || (unzipped.size() == 1 && unzipped.back() == end))) {
-             ROSE_ASSERT(getSource(zipped[i], g) == unzipped.back());
-             unzipped.push_back(getTarget(zipped[i], g));
-         }
-         
-     }
-     std::vector<int> oeds2 = getOutEdges(unzipped.back(), g);
-     if (unzipped.back() != end && oeds2.size() != 0) { 
-         while (oeds2.size() == 1 && unzipped.back() != end) {
-             unzipped.push_back(getTarget(oeds2[0], g));
-             oeds2 = getOutEdges(unzipped.back(), g);
-         }
-     }
-     return unzipped;
-}
-
-/*
-Example Time
-
-    Example:
-             timeval tim;
-             gettimeofday(&tim, NULL);
-             double t1=tim.tv_sec+(tim.tv_usec/1000000.0);
-             do_something_long();
-             gettimeofday(&tim, NULL);
-             double t2=tim.tv_sec+(tim.tv_usec/1000000.0);
-             printf("%.6lf seconds elapsed\n", t2-t1);
-
-*/
-
-/**
-The function responsible for collecting all paths without loops, and all paths within lops that do not include other loops
-then sending those to uTraverse to assemble them into all paths with any combination of loops
-Input:
-@param[begin] integer representation of the first node
-@param[end] integer representation of the last node (or -1 if its not bounded)
-@param[g] CFG*, the ambient CFG
-@param[loop] boolean expressing whether or not we are calculating paths contained within a loop
-*/
-
-
-template<class CFG>
-std::vector<std::vector<int> >
-SgGraphTraversal<CFG>::
-bfsTraversePath(int begin, int end, CFG*& g, bool loop) {
-//perfdebug allows for examining the speed of traversal
-    #ifdef PERFDEBUG
-    //timeval tim;
-    //gettimeofday(&tim, NULL);
-    //double tim1 = tim.tv_sec+(tim.tv_usec/1000000.0);
-    #endif
-    bool recursedloop = loop;
-    std::map<int, std::vector<std::vector<int> > > PtP;
-    std::set<int> nodes;
-    std::vector<std::vector<int> > pathContainer;
-    //std::vector<std::vector<int> > oldPaths;
-    std::vector<int> completedLoops;
-    std::vector<std::vector<int> > npc;
-    std::vector<int> bgpath;
-    bgpath.push_back(begin);
-    pathContainer.push_back(bgpath);
-    std::vector<std::vector<int> > newPathContainer; 
-    std::vector<std::vector<int> > paths;
-    std::vector<int> localLoops;
-    std::map<int, std::vector<std::vector<int> > > globalLoopPaths;
-     //std::cout << "at the while" << std::endl;
-//To keep
-     while (pathContainer.size() != 0 /*|| oldPaths.size() != 0*/) {
-/*
-       unsigned int mpc = 50000;
-       if (pathContainer.size() == 0) {
-           unsigned int mxl = 0; 
-           if (oldPaths.size() > mpc) {
-               mxl = mpc/2;
-           }
-           else {
-               mxl = oldPaths.size();
-           }
-           for (unsigned int k = 0; k < mxl; k++) {
-               pathContainer.push_back(oldPaths.back());
-               oldPaths.pop_back();
-           }
-       }
-       if (pathContainer.size() > mpc) {
-           unsigned int j = 0;
-           while (j < mpc) {
-                npc.push_back(pathContainer.back());
-                pathContainer.pop_back();
-                j++;
-           }
-           oldPaths.insert(oldPaths.end(), pathContainer.begin(), pathContainer.end());   
-           pathContainer = npc;
-           npc.clear();
-       }
-*/
-
-//iterating through the currently discovered subpaths to build them up
-       for (unsigned int i = 0; i < pathContainer.size(); i++) {
-       std::vector<int> npth = pathContainer[i];
-        std::vector<int> oeds = getOutEdges(npth.back(), g);
-        std::vector<int> ieds = getInEdges(npth.back(), g);
- 
-        npth = pathContainer[i];
-        oeds = getOutEdges(npth.back(), g);
-
-        if ((!recursedloop && ((bound && npth.back() == end && npth.size() != 1) || (!bound && oeds.size() == 0))) || (recursedloop && npth.back() == end && npth.size() != 1)) {
-            std::vector<int> newpth;
-            newpth = (pathContainer[i]);
-             std::vector<int> movepath = newpth;//zipPath(newpth, g);
-             if (recursedloop && newpth.back() == end && newpth.size() != 1) {
-             paths.push_back(movepath);
-             }
-             else if (!recursedloop) {
-             if (bound && newpth.size() != 1 && newpth.back() == end) {
-             paths.push_back(movepath);
-             }
-             else if (!bound) {
-             paths.push_back(movepath);
-             }
-             }
-             
-        }
-        else {
-std::vector<int> oeds = getOutEdges(pathContainer[i].back(), g);
-
-        for (unsigned int j = 0; j < oeds.size(); j++) {
-
-
-int tg = getTarget(oeds[j], g);
-            
-
-            std::vector<int> newpath = (pathContainer[i]);
-           //we split up paths into pieces so that they don't take up a lot of memory, basically this is when we run into a path
-           //more than once, so we attach all paths that go to that path to that particular node via PtP
-            if (nodes.find(tg) != nodes.end() && find(newpath.begin(), newpath.end(), tg) == newpath.end() && tg != end) {
-                if (PtP.find(tg) == PtP.end()) {
-                    std::vector<int> nv;
-                    nv.push_back(tg);
-                    newPathContainer.push_back(nv);
-                    PtP[tg].push_back(/*zipPath(*(*/newpath);//, g, newpath.front(), newpath.back()));
-                }
-                else {
-                    PtP[tg].push_back(/*zipPath(*/newpath);//, g, newpath.front(), newpath.back()));
-                }
-            }
-            else if (find(newpath.begin(), newpath.end(), getTarget(oeds[j], g)) == newpath.end() || getTarget(oeds[j], g) == end) {
-                newpath.push_back(tg);
-                std::vector<int> ieds = getInEdges(tg, g);
-                if (ieds.size() > 1) {//find(closures.begin(), closures.end(), tg) != closures.end()) {
-                nodes.insert(tg);
-                }
-                newPathContainer.push_back(newpath);
-            }
-            else if (tg == end  && recursedloop) {
-                newpath.push_back(tg);
-                newPathContainer.push_back(newpath);
-            }
-            else {//if (find(newpath.begin(), newpath.end(), tg) != newpath.end() && tg != end) { 
-                std::vector<int> ieds = getInEdges(tg, g);
-                if (ieds.size() > 1/*find(closures.begin(), closures.end(), tg) != closures.end()*/ && find(completedLoops.begin(), completedLoops.end(), tg) == completedLoops.end() /*&& find(localLoops.begin(), localLoops.end(), tg) == localLoops.end()*/ && find(recurses.begin(), recurses.end(), tg) == recurses.end()) {
-                   localLoops.push_back(tg);
-                   nodes.insert(tg);
-                }
-               // else if (find(recurses.begin(), recurses.end(), tg) != recurses.end()) {
-               // }
-           }
-           //else {
-           //    std::cout << "problem" << std::endl;
-           //    ROSE_ASSERT(false);
-          // }
-        }
-        }
-        }
-        pathContainer = newPathContainer;
-        newPathContainer.clear();
-        }
-       // std::cout << "done while" << std::endl;
-        pathContainer.clear();
-    std::vector<std::vector<int> > finnpts;
-    std::vector<std::vector<int> > npts;
-    while (true) {
-        if (paths.size() > 1000000) {
-           std::cout << "too many paths, consider a subgraph" << std::endl;
-           ROSE_ABORT();
-       }
-       //#pragma omp parallel for schedule(guided)
-       for (unsigned int qq = 0; qq < paths.size(); qq++) {
-            std::vector<int> pq = paths[qq];
-            std::vector<int> qp;
-            int ppf = paths[qq].front();
-            if (PtP.find(ppf) != PtP.end()) {
-                for (unsigned int kk = 0; kk < PtP[ppf].size(); kk++) {
-                    std::vector<int> newpath = /*unzipPath(*/PtP[ppf][kk];//, g, PtP[ppf][kk][0], PtP[ppf][kk][1]);
-                    bool good = true;
-                    if (newpath.back() == newpath.front() && newpath.front() != begin && newpath.size() > 1) {
-                        good = false;
-                    }
-                    else {
-
-                 //   if (find(pq.begin(), pq.end(), newpath.front()) != pq.end() && newpath.front() != begin) {
-                 //         good = false;
-                 //   }
-
-
-                   // else {
-                    for (unsigned int kk1 = 0; kk1 < newpath.size(); kk1++) {
-                       
-                      /*
-                       if (newpath.front() == newpath.back()) {
-                           good = false;
-                           break;
-                       }
-                       else */if (find(pq.begin(), pq.end(), newpath[kk1]) != pq.end() && newpath[kk1] != begin) {
-                           good = false;
-                           break;
-                          
-                       }
-                       }
-                    //}
-                    }
-                    if (good) {
-                       newpath.insert(newpath.end(), pq.begin(), pq.end());
-                       #pragma omp critical
-                       {
-                       npts.push_back(newpath);
-                       }
-                    }
-                }
-            }
-            else {
-                std::vector<int> ppq = pq;// zipPath(pq, g, pq.front(), pq.back());
-                #pragma omp critical
-                {
-                finnpts.push_back(ppq);
-                }
-            }
-        }
-        if (npts.size() == 0) {
-            break;
-        }
-        else {
-            paths = npts;
-            npts.clear();
-        }
-    }
-    paths = finnpts;    
-    finnpts.clear(); 
-    for (unsigned int k = 0; k < localLoops.size(); k++) {
-        int lk = localLoops[k];
-        std::vector<std::vector<int> > loopp;
-        if (loopStore.find(localLoops[k]) != loopStore.end()) {
-            loopp.insert(loopp.end(), loopStore[localLoops[k]].begin(), loopStore[localLoops[k]].end());
-        }
-        else {
-        std::map<int, std::vector<std::vector<int> > > localLoopPaths;
-        completedLoops.push_back(lk);
-        recurses.push_back(lk);
-        loopp = bfsTraversePath(lk, lk, g, true);
-        recurses.pop_back();
-        }
-        for (unsigned int ik = 0; ik < loopp.size(); ik++) {
-                
-                if (find(globalLoopPaths[lk].begin(), globalLoopPaths[lk].end(), loopp[ik]) == globalLoopPaths[lk].end()) {
-                globalLoopPaths[localLoops[k]].push_back(loopp[ik]);
-                }
-        }
-    
-
- 
-    }
-    borrowed = true;
-    std::vector<std::vector<int> > lps2;
-    //unsigned int maxpaths = 1000;
-    //unsigned int pathdivisor = 1;//paths.size()/maxpaths;///paths.size();
-
-    //if (pathdivisor < 1) {
-        //pathdivisor = 1;
-        //maxpaths = paths.size();
-   // }
-/*
-    for (unsigned int j = 0; j < pathdivisor+1; j++) {
-        std::vector<std::vector<int> > npaths;
-        std::vector<int> dummyvec;
-        unsigned int mxpths;
-        if (j < pathdivisor) {
-            mxpths = maxpaths;
-        }
-        else {
-            mxpths = paths.size() % pathdivisor;
-        }
-        for (unsigned int k = 0; k < mxpths; k++) {
-              npaths.push_back(paths.back());//unzipPath(paths.back(), g, begin, end));
-              paths.pop_back();
-        }
-*/
-        pathStore = paths;
-        paths.clear();
-    if (!recursedloop) {
-    uTraversePath(begin, end, g, false, globalLoopPaths);
-    }
-    else {
-    recursed++;
-    
-    std::set<std::vector<int> > lps = uTraversePath(begin, end, g, true, globalLoopPaths);
-    recursed--;
-    for (std::set<std::vector<int> >::iterator ij = lps.begin(); ij != lps.end(); ij++) {
-    std::vector<int> ijk = (*ij);
-    
-    lps2.push_back(*ij);
-    }
-    } 
-    //}
-    #ifdef PERFDEBUG
- //   timeval tim; 
-    //std::cout << "begin: " << begin << " end: " << end << std::endl;
-    //gettimeofday(&tim, NULL);
-    //double tim2 = tim.tv_sec+(tim.tv_usec/1000000);
-    //double timeRet = tim2 - tim1;
-    //std::cout << "bfs time elapsed: " << timeRet << std::endl;
-    #endif
-    return lps2;
-    
-}
-             
-        
-/**
-This function calculates all the permutations of loops on paths
-it also throws away duplicate paths
-Input:
-@param[begin] integer representation of first node
-@param[end] integer representation of the final node
-@param[g] ambient CFG
-@param[globalLoopPaths] connects an integer representation of a node to all possible loops starting at that node
-*/
-
-
-template<class CFG>
-std::set<std::vector<int> >
-SgGraphTraversal<CFG>::
-uTraversePath(int begin, int end, CFG*& g, bool loop, std::map<int, std::vector<std::vector<int> > >& globalLoopPaths) {
-    //std::cout << "uTraverse" << std::endl;
-    //int doubledpaths = 0;
-    int newmil = 1;
-    //#ifdef LP
-    //if (loop && loopStore.find(begin) != loopStore.end()) {
-    //    return loopStore[begin];
-    //}
-    //#endif
-    #ifdef PERFDEBUG
-    //timeval tim;
-    //gettimeofday(&tim, NULL);
-    //double t1 = tim.tv_sec+(tim.tv_usec/1000000);
-    #endif
-    std::set<std::vector<int> > newpaths;
-    std::set<std::vector<int> > npaths;
-    pathnum = 0;
-    std::vector<int> path;
-    std::vector<std::vector<int> > paths;
-    int truepaths = 0;
-    std::vector<std::vector<int> > checkpaths;
-    std::vector<std::vector<int> > npathchecker;
-    std::map<int, int> currents;
-    //int nnumpaths = 0;
-    std::set<std::vector<int> > loopPaths;
-    //bool threadsafe = true;
-    bool done = false;
-    std::set<std::vector<int> > fts;
-    //double ttfors = 0;
-    //double tperms = 0;
-    while (true) {
-        //std::cout << "paths.size() " << paths.size() << std::endl;
-        if (paths.size() > 1000000) {
-            std::cout << "nearly 1 million paths with no loops, stopping" << std::endl;
-            return loopPaths;
-            std::cout << "ended early" << std::endl;
-        }
-        if (done || borrowed) {
-     
-                if (borrowed) {
-                    paths = pathStore;
-                    pathStore.clear(); 
-                }   
-                //std::cout << "paths.size(): " << paths.size() << std::endl; 
-                if (paths.size() != 0) {
-                }
-                else {
-                return loopPaths;
-                }
-         
-               // #pragma omp parallel
-               // {
-                #pragma omp parallel for schedule(guided) 
-                for (unsigned int qqq = 0; qqq < paths.size(); qqq++) {
-  //             std::cout << "pathcheck" << std::endl;
-                //int pathevals = 0;
-                //std::vector<int> zpt = zipPath2(paths[qqq], g); 
-                //std::set<std::vector<int> > boxpaths;
-                std::set<std::vector<int> > movepaths;
-                std::vector<int> path;// = paths[qqq];
-                path = paths[qqq];//unzipPath(paths[qqq], g, begin, end);
-                truepaths++;
-                   int permnums = 1;
-                   std::vector<int> perms;
-                    std::vector<unsigned int> qs;
-                    std::map<int, std::vector<std::vector<int> > > localLoops;
-                    std::vector<int> takenLoops;
-                    takenLoops.push_back(path[0]);
-                    bool taken = false;
-                    //timeval timfor;
-                    int lost = 0;
-                    //gettimeofday(&timfor, NULL);
-                    //double t1for = timfor.tv_sec + (timfor.tv_usec/1000000); 
-                    for (unsigned int q = 1; q < path.size()-1; q++) {
-                    //if (find(closures.begin(), closures.end(), path[q]) != closures.end()) {
-                    if (globalLoopPaths.find(path[q]) != globalLoopPaths.end() /*&& find(lloops.begin(), lloops.end(), path[q]) != lloops.end()*/ && globalLoopPaths[path[q]].size() != 0 /*&& path[q] != begin && path[q] != end*/) {
-                        for (unsigned int qp1 = 0; qp1 < globalLoopPaths[path[q]].size(); qp1++) {
-                            
-                            std::vector<int> gp = globalLoopPaths[path[q]][qp1]; //unzipPath(globalLoopPaths[path[q]][qp1],g,path[q],path[q]);
-                           // std::vector<int> zgp = zipPath2(globalLoopPaths[zpt[q]][qp1], g);
-                            for (unsigned int qp2 = 0; qp2 < takenLoops.size(); qp2++) {
-                                if (find(gp.begin(),gp.end(), takenLoops[qp2]) != gp.end()) {
-                                    taken = true;
-                                }
-                            }
-
-                            if (!taken) {
-                                localLoops[path[q]].push_back(gp);
-                            }
-                            else {
-                               lost++;
-                               taken = false;
-                            }
-                        }
-                        if (localLoops[path[q]].size() != 0) {
-                        takenLoops.push_back(path[q]);
-                        permnums *= (localLoops[path[q]].size()+1);
-                        perms.push_back(permnums);
-                        qs.push_back(path[q]);
-                        }
-                    }
-                    }
-                    
-                    //}
-                    //if (loop) {
-                    //std::cout << "lostloop: " << lost << std::endl;
-                    //}
-                    //else {
-                    //std::cout << "lostpath: " << lost << std::endl;
-                    //}
-                    //std::cout << "endpathcheck" << std::endl;
-                    //std::cout << "rest" << std::endl;
-                    //std::cout << "permnums: " << permnums << std::endl;
-                    //gettimeofday(&timfor, NULL);
-                    //double t2for = timfor.tv_sec + (timfor.tv_usec/1000000);
-                    //double ttfor = t2for - t1for;
-                    //#pragma omp atomic
-                    //ttfors += ttfor;
-                    
-                    //std::set<std::vector<int> > movepaths2;
-                    std::set<std::vector<int> > movepathscheck;
-                    //timeval timperms;
-                    //gettimeofday(&timperms, NULL);
-                   // double t1perm = timperms.tv_sec + (timperms.tv_usec/1000000);
-                    std::vector<int> nvec;
-                    std::vector<std::vector<int> > boxpaths(permnums, nvec);
-                    //#pragma omp parallel for schedule(guided)
-                    for (int i = 1; i <= permnums; i++) {
-                        //bool goodthread = false;
-                        std::vector<int> loopsTaken;
-                        //bool stop = false;
-                        unsigned int j = 0;
-                        std::vector<int> npath;
-                        while (true) {
-                            if (j == perms.size() || perms[j] > i) {
-                                break;
-                            }
-                            else {
-                                j++;
-                            }
-                        }
-                        int pn = i;
-                        std::vector<int> pL;
-                        for (unsigned int j1 = 0; j1 <= j; j1++) {
-                            pL.push_back(-1);
-                        }
-                           for (unsigned int k = j; k > 0; k--) {
-                               int l = 1;
-                               while (perms[k-1]*l < pn) {
-                                   l++;
-                              }
-                               pL[k] = l-2;
-                               pn -= (perms[k-1]*(l-1));
-                           }
-                        pL[0] = pn-2;
-
-                        unsigned int q2 = 0;
-                        for (unsigned int q1 = 0; q1 < path.size(); q1++) {
-                            if (q2 < qs.size()) {
-                                if (qs.size() != 0 && (unsigned)path[q1] == qs[q2] && (size_t)q2 != pL.size()) {
-                                    if (pL[q2] == -1) {
-                                        npath.push_back(path[q1]);
-                                    }
-                                    else {
-                                        //   if (!stop) {
-                                        npath.insert(npath.end(), localLoops[path[q1]][pL[q2]].begin(),
-                                                     localLoops[path[q1]][pL[q2]].end());
-                                        //  }
-                                    }
-                                    q2++;
-                                }
-                                else {
-                                    npath.push_back(path[q1]);
-                                }
-                            }
-                            else {
-                                npath.push_back(path[q1]);
-                            }
-                        }
-                        #ifdef FULLDEBUG
-                        std::cout << "path: " << std::endl;
-                        for (int qe = 0; qe < npath.size(); qe++) {
-                            std::cout << ", " << npath[qe];
-                        }
-                        std::cout << std::endl;
-                        std::cout << "permnum: " << i << std::endl; 
-                        #endif
-                      //  bool addit = false;
-                        //if (!stop) {
-                      //  if (loop && npath.front() == npath.back()) {
-                      //      addit = true;
-                      //  }
-                      //  else if (!loop && bound && npath.front() == begin && npath.back() == end && npath.size() != 1) {
-                      //      addit = true;
-                      //  }
-                      //  else if (!loop && !bound) {
-                      //      addit = true;
-                      //  }
-                      // if (!addit) {
-                      //     std::cout << "bad path" << std::endl;
-                      // }
-                       //bool extra = false;
-                       //if (addit && !loop) {
-                            //if (movepathscheck.find(npath) == movepathscheck.end()) {
-                            //int mpc = movepathscheck.size();
-                            //std::set<std::vector<int> > movepathspre = movepathscheck;
-                    //        movepaths2.insert(npath);
-                            //movepathscheck.insert(npath);
-                            //ROSE_ASSERT(movepathscheck.size() == mpc || movepathspre.find(npath) == movepathspre.end());
-                            //if (movepathscheck.size() == mpc) {
-                            //    extra = true;
-                           // }
-                       
-                            //}
-                            //else {
-                            //#pragma omp atomic
-                           // doubledpaths++;
-                           // }
-                       //}
-                            
-                            //if (!workingthread || threadsafe) {
-                            //if ((newpaths.size() > 1 || i == permnums || threadsafe)) {
-                           // }
-                          // }
-                               
-                       // }
-                        //if (!extra)
-                       // {
-                        //if (movepaths2.size() > 0) //|| i == permnums || threadsafe)
-                       // #pragma omp critical
-                      // {
-                       boxpaths[i-1] = npath;
-                      // } 
-                      // }
-                       //std::cout << "endrest" << std::endl;
-                       }
-                        
-                       evaledpaths += boxpaths.size();
-                       if (evaledpaths > newmil*100000ull) {
-                           //std::cout << "evaledpaths: " << evaledpaths << std::endl;
-                           newmil++;
-                       }
-                       // #pragma omp critical
-                      // {
-                       if (!loop) {
-                       for (std::vector<std::vector<int> >::iterator box = boxpaths.begin(); box != boxpaths.end(); box++) {
-                       std::vector<Vertex> verts;
-                       getVertexPath((*box), g, verts);
-                       #pragma omp critical
-                       { 
-                       analyzePath(verts);
-                       }
-                       }
-                       }
-                       else {
-                       #pragma omp critical
-                       {
-                       loopPaths.insert(boxpaths.begin(), boxpaths.end());;
-                       }
-                       }
-                       }
-                       }
-                       //} 
-                       
-/* 
-                      #pragma omp atomic
-                      evaledpaths++; 
-                      //pathevals++;
-                      if (evaledpaths % 10000 == 0 && evaledpaths != 0) {
-                          std::cout << "evaled paths: " << evaledpaths << std::endl;
-                      }
-                      if (!loop) {
-                          std::vector<Vertex> verts;
-                          getVertexPath(npath, g, verts);
-                              #pragma omp critical
-                              {
-                              #ifdef FULLDEBUG
-                              for (unsigned int aa = 0; aa < npath.size(); aa++) {
-                                  if (ptsNum.find(npath[aa]) != ptsNum.end()) {
-                                  ptsNum[npath[aa]] += 1;
-                                  }
-                                  else {
-                                  ptsNum[npath[aa]] = 1;
-                                  }
-                              }
-                              #endif
-                              analyzePath(verts);
-                              }
-                      }
-                      else if (loop)
-                      { 
-                          //std::vector<int> zpth = zipPath(npath, g, npath.front(), npath.back());
-                          #pragma omp critical
-                          {
-                          loopPaths.insert(npath);//zipPath(npath, g, npath.front(), npath.back()));
-                          }
-                      }
-                      else {
-                      }
-                      
-                   }
-*/
-
-                  // movepaths2.clear();
-                  
-                 // std::cout << "permnums: " << permnums << std::endl;
-                //  std::cout << "evaledpaths final: " << pathevals << std::endl;  
-                  //gettimeofday(&timperms, NULL);
-                  //double t2perm = timperms.tv_sec+(timperms.tv_usec/1000000);
-                  //#pragma omp atomic
-                  //tperms += t2perm - t1perm;
-                 // }
-                  //}
-                  //}
-                  //}
-                  
-                  
-                  
-                    
-
-                    
-                    #ifdef PERFDEBUG
-                    //gettimeofday(&tim, NULL);
-                   // double t2 = tim.tv_sec+(tim.tv_usec/1000000.0);
-                   // double tperm = t2 - t1perm
-                    //double tX = t2 - t1;
-                    //std::cout << "begin: " << begin << " end: " << end << std::endl;
-                   // std::cout << "uTraverse time: " << tX << std::endl;
-                   // std::cout << "tperms: " << tperms << std::endl;
-                   // std::cout << "ttfors: " << ttfors << std::endl;
-                   // std::cout << "doubledpaths: " << doubledpaths << std::endl;
-                    #endif
-                    #ifdef LP
-                    if (loop) {
-                   #ifdef PERFDEBUG
-                   //  std::cout << "loopPaths: " << loopPaths.size() << std::endl;
-                   #endif
-                    loopStore[begin] = loopPaths;
-                    }
-                    #endif
-                    return loopPaths;
-                    
-                    }
-                    }
-                    
-         
-         
-                    
-            
-
-
-
-/**
-This is the function that is used by the user directly to start the algorithm. It is immediately available to the user
-
-SgGraphTraversal::constructPathAnalyzer
-Input:
-@param[begin] Vertex, starting node
-@param[end] Vertex, endnode
-@param[g] CFG* g, CFG calculated previously
-*/
-
-
-template<class CFG>
-void
-SgGraphTraversal<CFG>::
-constructPathAnalyzer(CFG* g, bool unbounded, Vertex begin, Vertex end, bool ns) {
-    abnormals = 0;
-    normals = 0;
-    if (ns) {
-        needssafety = true;
-    }
-    else {
-        needssafety = false;
-    }
-    checkedfound = 0;
-    recursed = 0;
-    nextsubpath = 0;
-    borrowed = true;
-    stoppedpaths = 0;
-    evaledpaths = 0;
-    badpaths = 0;
-    sourcenum = 0;
-    prepareGraph(g);
-    workingthread = false;
-    workingthreadnum = -1;
-    //std::cout << "markers: " << markers.size() << std::endl;
-    //std::cout << "closures: " << closures.size() << std::endl;
-    //std::cout << "sources: " << sources.size() << std::endl;
-    //std::cout << "sinks" << sinks.size() << std::endl;
-//    printHotness(g);
-    bool subgraph = false;
-    if (!subgraph) {
-            if (!unbounded) {
-                bound = true;
-                recursiveLoops.clear();
-                recurses.clear();
-                std::vector<std::vector<int> > spaths = bfsTraversePath(vertintmap[begin], vertintmap[end], g);
-      //          std::cout << "spaths: " << spaths.size() << std::endl;
-            }
-            else {
-                std::set<int> usedsources;
-                bound = false;
-                 std::vector<int> localLps;
-                for (unsigned int j = 0; j < sources.size(); j++) {
-                    sourcenum = sources[j];
-                    recursiveLoops.clear();
-                    recurses.clear();
-                    std::vector<std::vector<int> > spaths = bfsTraversePath(sources[j], -1, g);
-               
-                    
-                }
-           }
-    }
-    //std::cout << "checkedfound: " << checkedfound << std::endl;
-    printHotness(g);
-}
-
-/** DEPRECATED 
-This is a function to construct subgraphs for parallelization
-SgGraphTraversal::computeSubGraphs
-Input:
-@param[begin] const int, starting point
-@param[end] const int ending point
-@param[g] const CFG*, control flow graph to compute
-@param[depthDifferential] int, used to specify how large the subgraph should be
- */
-
-template<class CFG>
-void
-SgGraphTraversal<CFG>::
-computeSubGraphs(const int& begin, const int &end, CFG*& g, int depthDifferential) {
-        int minDepth = 0;
-        int maxDepth = minDepth + depthDifferential;
-        int currSubGraph = 0;
-        CFG* subGraph;
-        std::set<int> foundNodes;
-        while (true) {
-            Vertex begin = boost::add_vertex(*subGraphVector[currSubGraph]);
-            GraphSubGraphMap[currSubGraph][intvertmap[orderOfNodes[minDepth]]] = intvertmap[begin];
-            SubGraphGraphMap[currSubGraph][intvertmap[begin]] = intvertmap[orderOfNodes[minDepth]];
-        for (int i = minDepth; i <= maxDepth; i++) {
-            Vertex v = GraphSubGraphMap[currSubGraph][intvertmap[orderOfNodes[i]]];
-            std::vector<int> outEdges = getOutEdges(orderOfNodes[i], g);
-            for (unsigned int j = 0; j < outEdges.size(); j++) {
-                Vertex u;
-                if (foundNodes.find(getTarget(outEdges[j], g)) == foundNodes.end()) {
-                        u = GraphSubGraphMap[currSubGraph][intvertmap[getTarget(outEdges[j], g)]];
-                }
-                else {
-                    u = boost::add_vertex(*subGraphVector[currSubGraph]);
-                    foundNodes.insert(getTarget(outEdges[j], g));
-                    SubGraphGraphMap[currSubGraph][u] = intvertmap[getTarget(outEdges[j], g)];
-                    GraphSubGraphMap[currSubGraph][intvertmap[getTarget(outEdges[j], g)]] = u;
-
-                }
-                Edge edge;
-                bool ok;
-                boost::tie(edge, ok) = boost::add_edge(v,u,*subGraphVector[currSubGraph]);
-            }
-        }
-        minDepth = maxDepth;
-        if ((unsigned int) minDepth == orderOfNodes.size()-1) {
-                break;
-        }
-        maxDepth += depthDifferential;
-        if ((unsigned int) maxDepth > orderOfNodes.size()-1)
-        {
-                maxDepth = orderOfNodes.size()-1;
-        }
-        CFG* newSubGraph;
-        subGraphVector.push_back(newSubGraph);
-        currSubGraph++;
-        }
-        return;
-}
-
-       
-/*
-These should NOT be used by the user. They are simply for writing interesting information on the DOT graphs of the CFG
-*/
-
-
- 
-        template<class CFG>
-        void
-        SgGraphTraversal<CFG>::
-        printCFGNodeGeneric(int &cf, std::string prop, std::ofstream& o) {
-            std::string nodeColor = "black";
-            o << cf << " [label=\"" << " num:" << cf << " prop: " << prop <<  "\", color=\"" << nodeColor << "\", style=\"" << "solid" << "\"];\n";
-        }
-
-        template<class CFG>
-        void
-        SgGraphTraversal<CFG>::
-        printCFGNode(int& cf, std::ofstream& o)
-        {
-            #ifdef FULLDEBUG
-            int pts = ptsNum[cf];
-            std::string nodeColor = "black";
-            o << cf << " [label=\"" << " pts: " << pts <<  "\", color=\"" << nodeColor << "\", style=\"" << "solid" << "\"];\n";
-            #endif
-            #ifndef FULLDEBUG
-            std::string nodeColor = "black";
-            o << cf << " [label=\"" << " num:" << cf << "\", color=\"" << nodeColor << "\", style=\"" << "solid" << "\"];\n";
-            #endif
-
-        }
-
-        template<class CFG>
-        void
-        SgGraphTraversal<CFG>::
-        printCFGEdge(int& cf, CFG*& cfg, std::ofstream& o)
-        {
-            int src = getSource(cf, cfg);
-            int tar = getTarget(cf, cfg);
-            o << src << " -> " << tar << " [label=\"" << src << " " << tar << "\", style=\"" << "solid" << "\"];\n";
-        }
-
-        template<class CFG>
-        void
-        SgGraphTraversal<CFG>::
-        printHotness(CFG*& g)
-        {
-            const CFG* gc = g;
-            int currhot = 0;
-            std::ofstream mf;
-            std::stringstream filenam;
-            filenam << "hotness" << currhot << ".dot";
-            currhot++;
-            std::string fn = filenam.str();
-            mf.open(fn.c_str());
-
-            mf << "digraph defaultName { \n";
-         // DQ (4/11/2017): Fix Klockworks issue of uninitialized variables.
-#if 1
-            vertex_iterator v, vend;
-            edge_iterator e, eend;
-#else
-         // This does not compile.
-            vertex_iterator v    = vertices(*gc).begin();
-            vertex_iterator vend = v;
-            edge_iterator e    = edges(*gc).begin();
-            edge_iterator eend = e;
-#endif
-            for (boost::tie(v, vend) = vertices(*gc); v != vend; ++v)
-            {
-                printCFGNode(vertintmap[*v], mf);
-            }
-            for (tie(e, eend) = edges(*gc); e != eend; ++e)
-            {
-                printCFGEdge(edgeintmap[*e], g, mf);
-            }
-            mf.close();
-        }
-      template<class CFG>
-        void
-        SgGraphTraversal<CFG>::
-        printPathDot(CFG*& g)
-        {
-            const CFG* gc = g;
-            std::ofstream mf;
-            std::stringstream filenam;
-            filenam << "pathnums.dot";
-            std::string fn = filenam.str();
-            mf.open(fn.c_str());
-
-            mf << "digraph defaultName { \n";
-            vertex_iterator v, vend;
-            edge_iterator e, eend;
-            for (tie(v, vend) = vertices(*gc); v != vend; ++v)
-            {
-                if (nodeStrings.find(vertintmap[*v]) != nodeStrings.end()) {
-                    int nn = vertintmap[*v];
-                    printCFGNodeGeneric(vertintmap[*v], nodeStrings[nn], mf);
-                }
-                else {
-                    printCFGNodeGeneric(vertintmap[*v], "noprop", mf);
-                }
-            }
-           for (tie(e, eend) = edges(*gc); e != eend; ++e)
-            {
-                printCFGEdge(edgeintmap[*e], g, mf);
-            }
-
-            mf.close();
-        }
-
-
-
-/**
-This is the function that preps the graph for traversal
-
-SgGraphTraversal::prepareGraph
-Input:
-@param[g] CFG*& g, CFG calculated previously
-*/
-
-
-template<class CFG>
-void
-SgGraphTraversal<CFG>::
-prepareGraph(CFG*& g) {
-    nextNode = 1;
-    nextEdge = 1;
-    findClosuresAndMarkersAndEnumerate(g);
-}
-
-
-/**
-DEPRECATED 
-This is the function that preps the graph for traversal, currently this one isn't used but for many traversals on one visitor
-may necessitate
- 
-SgGraphTraversal::firstPrepGraph 
-Input: 
-@param[g] CFG*& g, CFG calculated previously 
-*/ 
-
-
-template<class CFG>
-void
-SgGraphTraversal<CFG>::
-firstPrepGraph(CFG*& g) {
-    nextNode = 1;
-    nextEdge = 1;
-    findClosuresAndMarkersAndEnumerate(g);
-}
-
-/**
-This calculates nodes with more than one in edge or more than one out edge
-
-SgGraphTraversal::findClosuresAndMarkers
-Input:
-@param[g] CFG*& g, CFG calculated previously
-*/
-
-
-
-
-template<class CFG>
-void
-SgGraphTraversal<CFG>::
-findClosuresAndMarkersAndEnumerate(CFG*& g)
-{
- // DQ (4/11/2017): Fix Klockworks issue of uninitialized variables.
-#if 1
-    edge_iterator e, eend;
-#else
-    edge_iterator e    = edges(*g).begin();
-    edge_iterator eend = e;
-#endif
-    for (tie(e, eend) = edges(*g); e != eend; ++e) {
-        intedgemap[nextEdge] = *e;
-        edgeintmap[*e] = nextEdge;
-        nextEdge++;
-    }
- // DQ (4/11/2017): Fix Klockworks issue of uninitialized variables.
-#if 1
-    vertex_iterator v1, vend1;
-#else
-    vertex_iterator v1    = vertices(*g).begin();
-    vertex_iterator vend1 = v1;
-#endif
-    for (boost::tie(v1, vend1) = vertices(*g); v1 != vend1; ++v1)
-    {
-        vertintmap[*v1] = nextNode;
-        intvertmap[nextNode] = *v1;
-        nextNode++;
-    }
- // DQ (4/11/2017): Fix Klockworks issue of uninitialized variables.
-#if 1
-    vertex_iterator v, vend;
-#else
-    vertex_iterator v    = vertices(*g).begin();
-    vertex_iterator vend = v;
-#endif
-    for (boost::tie(v, vend) = vertices(*g); v != vend; ++v) {
-        std::vector<int> outs = getOutEdges(vertintmap[*v], g);
-        std::vector<int> ins = getInEdges(vertintmap[*v], g);
-        if (outs.size() > 1)
-        {
-            markers.push_back(vertintmap[*v]);
-            
-            markerIndex[vertintmap[*v]] = markers.size()-1;
-            for (unsigned int i = 0; i < outs.size(); i++) {
-                pathsAtMarkers[vertintmap[*v]].push_back(getTarget(outs[i], g));
-            }
-        }
-        if (ins.size() > 1)
-        {
-            closures.push_back(vertintmap[*v]);
-        }
-        if (outs.size() == 0) {
-            sinks.push_back(vertintmap[*v]);
-        }
-        if (ins.size() == 0) {
-            sources.push_back(vertintmap[*v]);
-        }
-    }
-    return;
-}
-
-
-
-/** DEPRECATED 
-Currently unused but will be necessary for parallelization in progress
-SgGraphTraversal::computeOrder
-@param[g] CFG* cfg in question
-@parm[begin] const int, integer representation of source node
-*/
-template<class CFG>
-void
-SgGraphTraversal<CFG>::
-computeOrder(CFG*& g, const int& begin) {
-        std::vector<int> currentNodes;
-        std::vector<int> newCurrentNodes;
-        currentNodes.push_back(begin);
-        std::map<int, int> reverseCurrents;
-        orderOfNodes.push_back(begin);
-        std::set<int> heldBackNodes;
-        while (currentNodes.size() != 0) {
-                for (unsigned int j = 0; j < currentNodes.size(); j++) {
-                       
-                        std::vector<int> inEdges = getInEdges(currentNodes[j], g);
-                        if (inEdges.size() > 1) {
-                        if (reverseCurrents.find(currentNodes[j]) == reverseCurrents.end()) {
-                            reverseCurrents[currentNodes[j]] = 0;
-                        }
-                        if ((unsigned int) reverseCurrents[currentNodes[j]] == inEdges.size() - 1) {
-                                heldBackNodes.erase(currentNodes[j]);
-                                reverseCurrents[currentNodes[j]]++;
-                                std::vector<int> outEdges = getOutEdges(currentNodes[j], g);
-                                for (unsigned int k = 0; k < outEdges.size(); k++) {
-                                        newCurrentNodes.push_back(getTarget(outEdges[k], g));
-                                        orderOfNodes.push_back(getTarget(outEdges[k], g));
-                                }
-                        }
-                        else if (reverseCurrents[currentNodes[j]] < reverseCurrents.size()) {
-                                reverseCurrents[currentNodes[j]]++;
-                                if (heldBackNodes.find(currentNodes[j]) == heldBackNodes.end()) {
-                                    heldBackNodes.insert(currentNodes[j]);
-                                }
-                        }
-                        }
-                        else {
-                                std::vector<int> outEdges = getOutEdges(currentNodes[j], g);
-                                for (unsigned int k = 0; k < outEdges.size(); k++) {
-                                        newCurrentNodes.push_back(getTarget(outEdges[k], g));
-                                        orderOfNodes.push_back(getTarget(outEdges[k], g));
-
-                                }
-                        }
-                }
-                if (newCurrentNodes.size() == 0 && heldBackNodes.size() != 0) {
-                    for (std::set<int>::iterator q = heldBackNodes.begin(); q != heldBackNodes.end(); q++) {
-                        int qint = *q;
-                        std::vector<int> heldBackOutEdges = getOutEdges(qint, g);
-                        for (unsigned int p = 0; p < heldBackOutEdges.size(); p++) {
-                            newCurrentNodes.push_back(getTarget(heldBackOutEdges[p], g));
-                        }
-                   }
-                   heldBackNodes.clear();
-                }
-                currentNodes = newCurrentNodes;
-                newCurrentNodes.clear();
-        }
-        return;
-}
-
-/**
-Converts the path calculated by this algorithm to Vertices so users can
-access data
-SgGraphTraversal::getVertexPath
-@param[path] integer representation of path
-@param[g] CFG*, cfg in question
-@param[vertexPath] for some reason this can't be a return value so it is changed via pass by reference
-*/
-
-template<class CFG>
-void
-SgGraphTraversal<CFG>::
-getVertexPath(std::vector<int> path, CFG*& g, std::vector<Vertex>& vertexPath) {
-        for (unsigned int i = 0; i < path.size(); i++) {
-                            vertexPath.push_back(intvertmap[path[i]]);
-        }
-
-       
-        
-}
-
-/**
-DEPRECATED
-Currently unused, may eventually be modified for optimal storage purposes
-SgGraphTraversal::storeCompact
-@param[compactPath] path to be compactified
-*/
-template<class CFG>
-void
-SgGraphTraversal<CFG>::
-storeCompact(std::vector<int> compactPath) {
-return;
-}
-
-
-
-
-                  
diff --git a/src/midend/astProcessing/graphProcessingSgIncGraph.h b/src/midend/astProcessing/graphProcessingSgIncGraph.h
deleted file mode 100644
index 382dc09079d..00000000000
--- a/src/midend/astProcessing/graphProcessingSgIncGraph.h
+++ /dev/null
@@ -1,1865 +0,0 @@
-/*
-
-FINISH TEMPFLATPATH CODE
-
-*/
-
-
-
-
-// Original Author (SgGraphTraversal mechanisms): Michael Hoffman
-//$id$
-#include<omp.h>
-#include <boost/regex.hpp> 
-#include <iostream>
-#include <fstream>
-#include <string>
-
-/** 
-*@file graphProcessing.h
-
-*Brief Overview of Algorithm:
-
-***********************
-*Current Implementation
-***********************
-
-*The idea behind the algorithm here is to decompose the given Control Flow Graph into a Tree structure (still stored as a Control Flow Graph, though it may be possible to change this). This tree splits on children of a graph node, but does not connect in the case of multiple parents of a single node. In this we refer to out nodes as "children" and in nodes as "parents". However, we do this from the end node to the start node. This is best because then you get one value on the end node, and that value is the only one we want (however, the function takes a pointer to an empty SgIncidenceDirectedGraph as an argument, this can then be analyzed post traversal if that is wanted.
-
-*Also, following the algorithm explained above, one must realize that the tree has one leaf for EACH path. Thus small programs can lead from a small-ish graph to a VERY large tree. For example, a program with 20 if else statements would end with 2^20 paths, which means the number of nodes in the tree is greater than this. Thus with 32 or 64 you can overflow a 32 or 64 bit integer.
-
-*However, this can be partially resolved by setting the deleteTree boolean to true. This is set to false as the default, however if you don't need the tree then deleteTree will allow you to deal with much larger trees and thus much larger original graphs.
-
-*Realize that because of the potentially massive growth rate of path number, that in large cases path enumeration and counting is extremely prohibitive, as it is not difficult to create a program which has more paths than 2^64, thus an unsigned (signed?) 64 bit integer could not store the number.
-
-*Further, this is still a relatively compact method. You could just as easily force enumeration of paths, which could in some cases drastically increase the number of nodes necessary to store all the information.
-
-*The advantage of the tree structure is two-fold. First it relieves the algorithm of having to keep even more in memory than it has to at the moment, and if you want to deal with GoTo statements, one case can develop that cannot be solved otherwise, e.g.
-
-*Consider the four node tree with nodes a, b, c, d, and edges atb, atc, btc, ctb, btd, ctd. There are FOUR legitimate paths here (a, b, d; a, b, c, d; a, c, d; a, c, b, d), and any other method would recognize this as a loop and, without a special algorithm for loop behavior, this would be ignored.
-
-*The tree structure also allows for very strong parallelization, currently implemented in openMP. This is because depth has meaning in terms of a tree (it doesn't in terms of a general graph) and that you know you can evaluate all nodes at a certain depth if you have solved all the nodes at depth + 1.
-
-**************************
-*Further Improvements: TODO
-**************************
-
-@todo *One improvement that should be implemented ASAP is changing the algorithm from a recursive algorithm to an iterative algorithm. Keeping the memory requirements down is much easier in this form and would probably increase the size of graph that the algorithm can handle.
-
-@todo *Another improvement that should be implemented when possible is to allow for loop analysis. This could be implemented by simply running the algorithm on the loop, but there would need to be a provision that kept the algorithm from stopping as soon as it starts. This could be done by separating the node into two nodes, one with all the inedges and one with all the outedges. OR one could collect the loops when they are deleted (the whole loop is calculated necessarily), though nested loops would have to be considered further in order to find a way to deal with them.
-
-@todo *It is possible that graph matching algorithms might prove useful to distinguish different types of graphs contained within the CFG and optimize traversal over them. Look up graph matching algorithms or pattern matching (potentially) for more information on such algorithms, though I do not believe there is an existant literature on matching subgraphs for this purpose.
-
-@todo *The parallelism in this program should be optimized by someone experienced in parallelization optimization
-
-***************
-*Contact Info
-***************
-
-*Finally, blame can be assigned to and questions can be forwarded to the author, though response is not guaranteed
-
-*archangel DOT associate AT gmail DOT com
-*or, if I'm still at Lawrence
-*hoffman34 AT llnl DOT gov
-*@author Michael Hoffman
-*/
-
-
-
-
-
-#include "staticCFG.h"
-#include <vector>
-#include <algorithm>
-#include <utility>
-#include <iostream>
-#include <sys/time.h>
-#include <sys/resource.h>
-//#include "graphBot.h"
-
-//This is necessary for technical reasons with regards to the graphnodeinheritedmap
-
-
-
-struct Bot {
-    std::vector<std::vector<SgGraphNode*> > path;
-    std::vector<std::set<SgGraphNode*> > pthloops;
-    std::vector<SgGraphNode*> currpth;
-    std::vector<std::pair<SgGraphNode*, int> > nodelst;
-    bool on;
-    bool remove;
-};
-
-double timeDifference(const struct timeval& end, const struct timeval& begin)
-{
-    return (end.tv_sec + end.tv_usec / 1.0e6) - (begin.tv_sec + begin.tv_usec / 1.0e6);
-}
-
-static inline timeval getCPUTime() {
-  rusage ru;
-  getrusage(RUSAGE_SELF, &ru);
-  return ru.ru_utime;
-}
-
-
-struct compareSgGraphNode {
-    bool operator()(const SgGraphNode* a, const SgGraphNode* b) const
-    {
-        return a==b;
-    }
-};
-
-
-/* The SgGraphTraversal class is utilized specifically for StaticCFG traversals,
-though the input must be in terms of a SgIncidenceDirectedGraph*/
-template <class InheritedAttributeType, class SynthesizedAttributeType>
-class SgGraphTraversal
-{
-   public:
-    std::set<std::map<int, std::set<int> > > subpathmap;
-    int loopNum;
-    int nullNum;
-    std::set<SgDirectedGraphEdge*> nullEdgesOrdered;
-    std::map<SgGraphNode*, int> loopNumMap;
-    std::map<SgGraphNode*, int> pathValMap;
-    int nullloops;
-    std::vector<std::vector<SgGraphNode*> > looppaths;
-    std::vector<std::vector<SgGraphNode*> > iLoops;
-    std::vector<SgGraphNode*> ifstatements;
-    virtual ~SgGraphTraversal(); 
-    SgGraphTraversal(); 
-    // Copy operations
-    int nullEdgesPaths;
-    int turns;
-    SgGraphTraversal(const SgGraphTraversal &);
-    const SgGraphTraversal &operator=(const SgGraphTraversal &);
-    //This is not used, but will be important if SynthesizedAttributes become useful
-    typedef StackFrameVector<SynthesizedAttributeType> SynthesizedAttributesList;
-    //one of the most important structures in the algorithm, this attaches SgGraphNode*s to InheritedAttributeTypes so that
-    //looking up the values is possible.
-    //int numnodes;
-    //std::map<SgGraphNode*, InheritedAttributeType> seen;
-    int numnodes;
-    //InheritedAttributeType pthgraphinherit;
-    //StaticCFG::CFG* SgCFG;
-    SgGraphNode* nullnode;
-    std::map<SgGraphNode*, int> primenode;
-    bool done;
-    //std::set<SgGraphNode*> startnodes;
-    std::set<SgGraphNode*> lstN;
-    std::map<SgGraphNode*, std::vector<std::set<int> > > lstordmap;
-    std::set<SgGraphNode*> solvedLoops;
-    std::map<SgGraphNode*, std::vector<SgGraphNode*> > checkednodes; 
-    std::map<SgGraphNode*, std::set<SgGraphNode*> > downed;
-   
-    //std::map<SgGraphNode*, int> nodeinedgordmap;
-    //a value for nodes that have no value, set in the traverse function
-    InheritedAttributeType nullInherit;
-    //the user invoked function, runs the algorithm
-    InheritedAttributeType traverse(SgGraphNode* basenode, SgIncidenceDirectedGraph* g,
-            InheritedAttributeType inheritedValue, InheritedAttributeType nullInherit,
-            SgGraphNode* endnode, bool insep = false, bool pcHk = false);
-    std::set<SgGraphNode*> loopSet;
-
-   protected:
-    //User defined functions to do whatever is needed in evaluation
-    //All the user gets access to is the node in question
-    //and the values of the parent nodes (this should be all that is necessary)
-    virtual InheritedAttributeType evaluateInheritedAttribute(SgGraphNode* n,
-            std::vector<InheritedAttributeType> inheritedValues) = 0;
-    //Not used, but may be useful if SynthesizedAttributes become workable in this context
-    virtual SynthesizedAttributeType evaluateSynthesizedAttribute(SgGraphNode* n,
-            InheritedAttributeType in,
-            SynthesizedAttributesList l) = 0;
-
-#if !USE_ROSE
- // DQ (11/3/2011): EDG compilains about this (but GNU allowed it, I think that EDG might be correct,
- // namely that the value of a reference must be an lvalue (not NULL).  But since we are only trying 
- // to compile ROSE with ROSE (using the new EDG 4.3 front-end as a tests) we can just skip this case for now.
-    virtual void pathAnalyze(std::vector<SgGraphNode*>& pth, bool loop=false, std::set<std::vector<SgGraphNode*> >& incloops=NULL) = 0;
-#else
-    virtual void pathAnalyze(std::vector<SgGraphNode*>& pth, bool loop, std::set<std::vector<SgGraphNode*> >& incloops) = 0;
-#endif
-
-    //also not used, but important for possible later use of SynthesizedAttributes
-    SynthesizedAttributeType defaultSynthesizedAttribute(InheritedAttributeType);
-   private:
-    double distime;
-    //std::set<std::pair<std::pair<SgGraphNode*, SgGraphNode*>, std::pair<SgGraphNode*, SgGraphNode*> > > flpset;
-    //std::set<std::pair<std::pair<SgGraphNode*, SgGraphNode*>, std::pair<SgGraphNode*, SgGraphNode*> > > goodset;
-    std::set<SgGraphNode*> ploops;
-    std::map<SgGraphNode*, std::set<std::vector<SgGraphNode*> > > lpbegins;
-    std::map<SgGraphNode*, int> frksLeft;
-    int currm;
-    int dpMax;
-    int repEval;
-    bool pathCheck;
-    int pathsSize;
-    //this constructs the graph tree for computation of inheritedValues
-
-
-    std::map<SgGraphNode*, InheritedAttributeType> known;
-    std::vector<InheritedAttributeType> connectNodes;
-    std::map<SgGraphNode*, bool> solved;
-    std::set<SgGraphNode*> solvedset;
-    //these two are not used, but will be important if SynthesizedAttributes are made reasonable in this context
-    SynthesizedAttributesList *synthesizedAttributes;
-    SynthesizedAttributeType traversalResult();
-    //finally we have two functions necessary for parallel processing if that is chosen to be used by the user
- 
-
-    
-  
-    std::map<SgGraphNode*, int> nodeInEdgesNum;
-    int currprime;
-    std::vector<SgGraphNode*> endnodefakes;
-    std::map<SgGraphNode*, std::vector<std::vector<SgGraphNode*> > > pathsAtMk;
-    std::set<SgGraphNode*> mkloops;
-    std::map<SgGraphNode*, std::set<std::vector<SgGraphNode*> > > mkloopmap;
-    std::map<SgGraphNode*, std::set<std::vector<SgGraphNode*> > > subPathsAtMk;
-    std::vector<SgGraphNode*> mkglobal;
-    std::vector<SgGraphNode*> clglobal;
-    bool inseparable;
-    void solvePaths(SgIncidenceDirectedGraph* g, SgGraphNode* n, SgGraphNode* endnode);
-    std::vector<std::set<SgGraphNode*> > closuresVec;
-    void evaluatePaths(SgIncidenceDirectedGraph* g, SgGraphNode* realstartnode, SgGraphNode* endnode);
-    void evaluatePathsPar(SgIncidenceDirectedGraph* g, SgGraphNode* realstartnode, SgGraphNode* endnode);
-    bool disjoint(std::vector<SgGraphNode*>& path, std::vector<SgGraphNode*>& vec2) const;
-    std::set<std::vector<SgGraphNode*> > flatpaths;
-//    void evalNode(SgIncidenceDirectedGraph* g, SgGraphNode* n);
-    bool canSolve(SgIncidenceDirectedGraph* g, SgGraphNode* n);
-    std::map<SgGraphNode*, InheritedAttributeType> inhVals;
-    std::set<SgDirectedGraphEdge*> seenEdges;
-    std::set<SgDirectedGraphEdge*> nullEdges;
-    std::set<SgGraphNode*> clsT;
-    void computeOrder(SgIncidenceDirectedGraph* g, SgGraphNode* n, SgGraphNode* endnode);
-    void computeInheritedOrdered(SgIncidenceDirectedGraph* g, SgGraphNode* n);
-    std::pair<bool, SgGraphNode*> getNextPar(SgIncidenceDirectedGraph* g, SgGraphNode* n);
-    std::pair<bool, SgGraphNode*> getNextChild(SgIncidenceDirectedGraph* g, SgGraphNode* n);
-    bool computable(SgIncidenceDirectedGraph* g, SgGraphNode* n);
-    void evalNodeOrdered(SgIncidenceDirectedGraph* g, SgGraphNode* n);
-    std::map<SgGraphNode*, int> oVals;
-    bool canEval(SgIncidenceDirectedGraph* g, SgGraphNode* n);
-    void setPathVal(SgIncidenceDirectedGraph*g, SgGraphNode* n);
-    void printNodePlusEdgesForAnalysis(SgIncidenceDirectedGraph* g, SgGraphNode* n, int loopNum, int pathVal, std::ofstream& ss);
-    void printNodePlusEdgesForAnalysisPath(SgIncidenceDirectedGraph* g, std::vector<SgGraphNode*> n, int loopNum, int pathVal, std::ofstream& ss);
-    void printNodeForAnalysis(SgGraphNode* n, int loopNum, int pathNum, std::ofstream& ss);
-    std::set<SgGraphNode*> completedNodesPath;
-    std::set<std::pair<SgGraphNode*, SgGraphNode*> > completedEdgesPath;
-    void printEdgeForAnalysis(SgDirectedGraphEdge* e, bool isNullEdge, std::ofstream& ss);
-    void printEdgeForAnalysisPath(SgGraphNode* g1, SgGraphNode* g2, std::ofstream& ss);
-    std::map<int, SgGraphNode*> iVals;
-    
-    std::set<SgDirectedGraphEdge*> nullEdgesOrderedOut;
-    std::set<SgDirectedGraphEdge*> completedEdgesOut;
-    std::set<SgDirectedGraphEdge*> completedEdges;
-    std::set<SgGraphNode*> compPar;
-    std::set<SgGraphNode*> compChild;
-    std::set<SgGraphNode*> computedNodes;
-    SgGraphNode* st;
-    SgGraphNode* en;
-    double fllp;
-    int loopnum;
-    //std::set<SgGraphNode*> solved;
-    //InheritedAttributeType findAndReverse(SgGraphNode* n, SgIncidenceDirectedGraph* g);
-     //evaluateAllInheritedAttribute(std::vector<InheritedAttributeType> endNodeInhVec, SgGraphNode* endnode, std::vector<SgGraphNode*> nodes, std::vector<InheritedAttributeType> inh);
-//std::vector<InheritedAttributeType> getZeroInhs(std::vector<std::vector<std::vector<SgGraphNode*> > > qAnsSetSet, std::vector<InheritedAttributeType> endnodeInhVec, SgGraphNode* node);
-
-};
-
-
-
-/*
-template <class InheritedAttributeType, class SynthesizedAttributeType>
-void
-GraphBot<InheritedAttributeType, SynthesizedAttributeType>::
-travelDown(SgIncidenceDirectedGraph* g) {
-    std::set<SgDirectedGraphEdge*> oedgs = g->computeEdgeSetOut(iAmHere);
-    bool taken = false;
-    if (oedgs.size() > 1) {
-        std::set<SgDirectedGraphEdge*> edgeTrav = clEdgeTrav[iAmHere];
-        ROSE_ASSERT(clEdgeTrav.find(iAmHere) != clEdgeTrav.end());
-        for (std::set<SgDirectedGraphEdge*>::iterator i = oedgs.begin(); i != oedgs.end(); i++) {
-            if (edgTrav.find(*i) == edgTrav.end() || !taken) {
-                taken = true;
-                iAmHere = (*i)->get_to();
-                lastEdge = *i;
-            }
-        }
-    }
-    else {
-        iAmHere = (*(oedgs.begin())->get_to();
-    }
-}
-*/
-
-
-
-
-
-
-/*
-***************************
-Various Admin Functions
-***************************
-*/
-template<class InheritedAttributeType, class SynthesizedAttributeType>
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-SgGraphTraversal()
-  : synthesizedAttributes(new SynthesizedAttributesList())
-{
-}
-
-#ifndef SWIG
-
-template<class InheritedAttributeType, class SynthesizedAttributeType>
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-~SgGraphTraversal()
-{
-        ROSE_ASSERT(synthesizedAttributes != NULL);
-        delete synthesizedAttributes;
-        synthesizedAttributes = NULL;
-}
-
-#endif
-
-
-template<class InheritedAttributeType, class SynthesizedAttributeType>
-const SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType> &
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-operator=(const SgGraphTraversal &other)
-{
-
-    ROSE_ASSERT(synthesizedAttributes != NULL);
-    delete synthesizedAttributes;
-    synthesizedAttributes = other.synthesizedAttributes->deepCopy();
-
-    return *this;
-}
-
-/**
-This is the function that is used by the user directly to start the algorithm. It is immediately available to the user
-
-SgGraphTraversal::traverse
-Input:
-@param[n] n starting node
-@param[g] SgIncidenceDirectedGraph* g, CFG calculated previously
-@param[inheritedValue] InheritedAttributeType inheritedValue, value of the starting node
-@param[nullI] InheritedAttributeType nullI, value of the null Attribute, i.e. what to attribute to a node with no value\
-@param[endnode] SgGraphNode* endnode, final node
-@param[insep] boolean to decide inseparability of the analysis function, not yet in use, set automatically to false
-@param[pCh] deprecated, set to false
-@return InheritedAttributeType, the value of the attribute at the end node
-
-*/
-
-
-template<class InheritedAttributeType, class SynthesizedAttributeType>
-InheritedAttributeType
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-traverse(SgGraphNode* n, SgIncidenceDirectedGraph* g, InheritedAttributeType inheritedValue, InheritedAttributeType nullI, SgGraphNode* endnode, bool insep, bool pCh) {
-   //numnodes = 0;
-   //primes.clear();
-    looppaths.clear();
-    iLoops.clear();
-    completedEdgesPath.clear();
-    pathValMap.clear();
-    loopNumMap.clear();
-    nullloops = 0;
-    nullEdgesPaths = 0;
-    fllp = 0.0;
-    mkglobal.clear();
-    clglobal.clear();
-  
-    lpbegins.clear();
-    //currents.clear();
-   inhVals.clear();
-   iVals.clear();
-   oVals.clear();
-   //reservedEdges.clear();
-   completedEdges.clear();
-   completedEdgesOut.clear();
-   //completedNodes.clear();
-   computedNodes.clear();
-   nullEdgesOrdered.clear();
-   nullEdgesOrderedOut.clear();
-   loopSet.clear();
-   pathsAtMk.clear();
-   
-   st = n;
-   en = endnode;
-   distime = 0.0;
-   int currm = 1;
-   int turns = 0;
-   pathsSize = 0;
-   done = false;
-   numnodes = 1;
-   std::cout << "starting traversal" << std::endl;
-   pathCheck = pCh;
-   currprime = 1;
-   inseparable = insep;
-   synthesizedAttributes->resetStack();
-   ROSE_ASSERT(synthesizedAttributes->debugSize() == 0);
-   //SgCFG = cfg;
-   inhVals[n] = inheritedValue;
-   //GraphBot<InheritedAttributeType, SynthesizedAttributeType>::inhVals[n] = inheritedValue;
-   //primes = generatePrimesSieve();
-   
-  
-//   graphnodeinheritedordmap[ncpy] = inheritedValue;
-//   nodenodeordmap[ncpy] = n;
-//   std::vector<SgGraphNode*> lst;
-//   lst.push_back(n);
-//   lstordmap[ncpy] = lst;
-
-   nullInherit = nullI;
-InheritedAttributeType inh;
-   struct timeval t1, t2, t3, t4, t5, t6, t7, t8;
-   //else {
-       loopnum = 0;
-       //InheritedAttributeType inh;
-       t1 = getCPUTime();
-       
-       //this function essentially sets up for the evaluate later, it makes putting together the paths much easier
-       solvePaths(g, n, endnode);
-
-       t2 = getCPUTime();
-
-//making sure that endnode hasn't already been evaluated before the traversal starts, unlikely but just in case
-       ROSE_ASSERT(inhVals.find(endnode) == inhVals.end());
-
-       std::cout << "solvePaths done" << std::endl;
-       double diff = timeDifference(t2, t1);
-       t5 = getCPUTime();
-       //InheritedAttributeType pthgraphinherit = botTraverse(g, n, endnode);
-       oVals[n] = 0;
-       iVals[0] = n;
-       pathValMap[n] = 1;
-//inserting n as a computed node
-       computedNodes.insert(n);
-//computes the order in which the nodes must be evaluated, makes computeInheritedOrdered much faster
-       computeOrder(g, n, endnode);
-       std::cout << "order computed" << std::endl;
-//computes the nodal inheritance values
-       computeInheritedOrdered(g, n);
-       std::cout << "inheritance computed" << std::endl;
-       ROSE_ASSERT(oVals.find(endnode) != oVals.end());
-       ROSE_ASSERT(inhVals.find(endnode) != inhVals.end());
-//value at the endnode
-       InheritedAttributeType pthgraphinherit = inhVals[endnode];
-       //= evaluateGraph(g, n, endnode, inheritedValue);
-       t6 = getCPUTime();
-       std::cout << "evaluateGraph done" << std::endl;
-       double diff3 = timeDifference(t6, t5);
-       t3 = getCPUTime();
-//actually evaluates every path with a user defined pathAnalyze function
-       //for (int i = 0; i < 10; i++) {
-       evaluatePaths(g, n, endnode);
-       //}
-       t4 = getCPUTime();
-       
-       t7 = getCPUTime();
-       //evaluatePathsPar(g, n, endnode);
-       t8 = getCPUTime();
-       
-       std::cout << "evaluatePaths done " << std::endl;
-       double diff2 = timeDifference(t4, t3);
-       double diff2Par = timeDifference(t8, t7);
-       std::cout << "pathsolve took: " << diff << std::endl;
-       std::cout << "patheval took: " << diff2 << std::endl;
-       std::cout << "parpatheval took: " << diff2Par << std::endl;
-       std::cout << "grapheval took: " << diff3 << std::endl;
-       std::cout << "entire pathsolve took: " << diff+diff2+diff3+diff2Par << std::endl;
-       std::cout << "potential loops: " << nullEdgesOrdered.size() << std::endl;
-       std::cout << "nullNum: " << nullNum << std::endl;
-       //std::cout << "goodsets: " << goodset.size() << std::endl;
-       //std::cout << "flpsets: " << flpset.size() << std::endl;
-       std::cout << "mkloops: " << mkloops.size() << std::endl;
-       std::cout << "distime: " << distime << std::endl;
-       std::cout << "fllp: " << fllp << std::endl;
-       return pthgraphinherit;
-   //}
-   //std::cout << "number of endnodefakes: " << endnodefakes.size() << std::endl;
-   //std::cout << "should be number of nodes: " << currprime << std::endl;
-   //if (pathanalysis == true) {
-     // analyzepaths(endnode, g);
-   //}
-   //return inh;
-   //Currently this is not very useful, but it does nothing if traversalResult is not set.
-}
-
-/* WARNING:
-   This is not a general is_disjoint. It skips the 
-first element of the second set because in the way I assemble
-paths the last element of the path and the first element of addend
-must be the same. Hence I simply skip the first node
-*/
-bool is_disjoint(std::set<SgGraphNode*> set1, std::set<SgGraphNode*> set2) {
- 
-   if (set1.empty() || set2.empty()) {
-       return true;
-   }
-   std::set<SgGraphNode*>::iterator it1 = set1.begin();
-   std::set<SgGraphNode*>::iterator it2 = set2.begin();
-   std::set<SgGraphNode*>::iterator it1End = set1.end();
-   std::set<SgGraphNode*>::iterator it2End = set2.end();
-
-    if (*it1 > *set2.rbegin() || *it2 > *set1.rbegin()) {
-        return true;
-    }
-    
-    while (it1 != it1End && it2 != it2End) {
-        if (*it1 == *it2) {
-            return false;
-        }
-        if (*it1 < *it2) {
-            it1++;
-        }
-        else {
-            it2++;
-        }
-     }
-     return true;
-}   
-
-
-
-//Checks for disjoint, necessary in computing the paths
-template<class InheritedAttributeType, class SynthesizedAttributeType>
-bool
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-disjoint(std::vector<SgGraphNode*>& pthloops, std::vector<SgGraphNode*>& vec2) const {
-/*
-    time_t t1, t2;
-    time(&t1);
-    int a = 0;
-    std::set<SgGraphNode*> s1;
-    std::set<SgGraphNode*> s2;
-    std::vector<SgGraphNode*> mkloopvec;
-    bool goodsetbool;
-    bool pbool = true;
-    //std::cout << "calculating disjoint" << std::endl;
-    ROSE_ASSERT((path.back()).back() == vec2.front());
-
-    //copy(vec2.begin(), vec2.end(), inserter(s2, s2.end()));
-/*
-    for (int i = 0; i < vec2.size(); i++) {
-        if (ploops.find(vec2[i]) != ploops.end()) {
-            pbool = false;
-        }
-    }
-    if (pbool) {
-        return true;
-    }
-    if (
-*/  //for (int q = 0; q < pthloops->size(); q++) {
-        for (int i = 0; i < pthloops.size(); i++) {
-            if (find(vec2.begin(), vec2.end(), pthloops[i]) != vec2.end()) {
-                return false;
-            }
-        }
-        return true;
-}
-/*
-    if (pbool) {
-        time(&t2);
-        double diff = difftime(t2, t1);
-        distime += diff;
-        return true;
-    }
-    for (unsigned int k = 0; k < path.size(); k++) {
-        s1.clear();
-*/
-/*
-        pbool = true;
-        for (int p = 0; p < path[k].size(); p++) {
-            if (ploops.find(path[k][p]) != ploops.end()) {
-                pbool = false;
-            }
-        }
-//        copy(path[k].begin(), path[k].end(), inserter(s1, s1.end()));
-        if (!pbool) {
-*/
-/*
-        std::pair<std::pair<SgGraphNode*, SgGraphNode*>, std::pair<SgGraphNode*, SgGraphNode*> > flp;
-        flp.second.first = vec2[0];
-        flp.second.first = vec2[1];
-
-        flp.first.first = path[k][0];
-        flp.first.second = path[k][1];
-        if (vec2.front() == vec2.back()) {
-        time(&t2);
-        double diff = difftime(t2, t1);
-        distime += diff;
-
-            return false;
-        }
-        if (flpset.find(flp) != flpset.end()) {
-            //std::cout << "already seen" << std::endl;
-        time(&t2);
-        double diff = difftime(t2, t1);
-        distime += diff;
-
-            return false;
-        }
-*/
-/*
-        else if (goodset.find(flp) != goodset.end()) {
-            goodsetbool = true;
-        }
-*/
-/*
-        if (is_disjoint(s1,s2)) {
-            //goodset.insert(flp);
-            continue;
-        }
-        else {
-            return false;
-        }
-*/
-/*
-       else {
-        std::vector<SgGraphNode*> vec1 = path[k];
-        
-        //for (unsigned int i = 0; i < vec1.size(); i++) {
-            for (unsigned int j = 0; j < mkloopvec.size(); j++) {
-                std::vector<SgGraphNode*>::iterator q = find(vec1.begin(), vec1.end(), mkloopvec[j]);
-                if (q != vec1.end()) {
-                    if (*q != vec1[vec1.size() - 1] || j != 0) {
-                        
-                        flpset.insert(flp);
-      //                  std::cout << "not disjoint" << std::endl;
-        time(&t2);
-        double diff = difftime(t2, t1);
-        distime += diff;
-
-                        return false;
-                    }
-                }
-            }
-        //}
-        //goodset.insert(flp);
-    }
-    }
-    //}
-*/
-
-    
-/*
-    for (unsigned int p = 0; p < vec2.size(); p++) {
-        for (unsigned int q = 0; q < vec2.size(); q++) {
-            if (p != q) {
-                if (vec2[p] == vec2[q]) {
-                    return false;
-                }
-            }
-        }
-    }
-*/
-/*
-        time(&t2);
-        double diff = difftime(t2, t1);
-        distime += diff;
-
-    return true;
-}
-*/
-//checks for solvability of a node in nodal analysis
-
-template<class InheritedAttributeType, class SynthesizedAttributeType>
-bool
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-canSolve(SgIncidenceDirectedGraph* g, SgGraphNode* n) {
-    bool loop = false;
-    if (inhVals.find(n) != inhVals.end()) {
-        return true;
-    }
-    std::set<SgDirectedGraphEdge*> oed = g->computeEdgeSetIn(n);
-    if (oed.size() == 0) {
-        return false;
-    }
-        for (std::set<SgDirectedGraphEdge*>::iterator i = oed.begin(); i != oed.end(); i++) {
-            if (inhVals.find((*i)->get_from()) == inhVals.end() && nullEdges.find(*i) == nullEdges.end()) {
-                return false;
-            }
-        }
-   return true;
-} 
-
-//this function evaluates values of paths via the user-defined pathAnalyze function
-
-template<class InheritedAttributeType, class SynthesizedAttributeType>
-void
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-evaluatePathsPar(SgIncidenceDirectedGraph* g, SgGraphNode* realstartnode, SgGraphNode* endnode) {
-std::vector<std::vector<SgGraphNode*> > path;
-std::vector<SgGraphNode*> spath;
-SgGraphNode* n = realstartnode;
-int successes = 0;
-int failures = 0;
-int j = 0;
-std::vector<SgGraphNode*> currpthorg;
-int currint = 0;
-std::map<SgGraphNode*, int> intPath;
-intPath[n] = currint;
-currint++;
-std::map<SgGraphNode*, int> currents;
-SgGraphNode* currnode;
-bool step = false;
-bool midstep = false;
-
-//note: pathsAtMk is referring to subpaths connected to that marker, a marker is a split in the graph (usually an if statement)
-
-std::vector<std::vector<SgGraphNode*> > pth = pathsAtMk[realstartnode];
-std::vector<std::vector<SgGraphNode*> > cpth = pathsAtMk[realstartnode];
-    path.clear();
-    int disjoints = 0;
-    int disjointtrues = 0;
-    currpthorg = pth[0];
-    intPath[pth[0].front()] = currint;
-    std::set<SgGraphNode*> pthloopstmp;
-    SgGraphNode* fakenode;
-    pthloopstmp.insert(fakenode);
-    std::vector<std::set<SgGraphNode*> > pthloops;
-    pthloops.push_back(pthloopstmp);
-    pthloopstmp.clear();
-    currint++;
-    
-    int stepnum = 0;
-    std::vector<SgGraphNode*> rs;
-    rs.push_back(realstartnode);
-    path.push_back(rs);
-    currents.clear();
-
-    step = false;
-    std::vector<SgGraphNode*> sub;
-
-
-    std::set<std::vector<SgGraphNode*> > nullIncLoops;
-    std::vector<struct Bot*> todobotlst;
-    std::vector<struct Bot*> botlst;
-    struct Bot* rootBot = new Bot;
-    rootBot->remove = false;
-    
-    rootBot->path = path;
-    rootBot->currpth = currpthorg;
-    rootBot->pthloops = pthloops;
-    rootBot->on = true;
-     botlst.push_back(rootBot);
-    int tip = 1;
-    int ti = 1;
-    std::vector<std::pair<std::vector<SgGraphNode*>, std::vector<std::set<SgGraphNode*> > > > collectedPaths;
-    int maxlst = 0;
-    while (true) {
-    if (todobotlst.size()+botlst.size() > maxlst) {
-        maxlst = todobotlst.size()+botlst.size();
-        std::cout << "maxlst: " << maxlst << std::endl;
-        std::cout << "todobotlst.size(): " << todobotlst.size() << std::endl;
-        std::cout << "botlst.size(): " << botlst.size() << std::endl;
-    }
-    int MAXBOTS = 10000;
-    int MINPATHS = 1000;
-    int LOCALMAXBOTS = 10;
-    int LOCALMAXNODES = 0;
-    std::vector<struct Bot*> lstnullbot;
-    std::vector<std::vector<struct Bot*> > newbotlsts (MAXBOTS, lstnullbot);
-    //std::vector<struct Bot*> newbotlsts (MAXBOTS, lstnullbot);
-    //tip = ti;
-    //ti = 0;
-    ROSE_ASSERT(botlst.size() >= 0);
-    if (botlst.size() == 0) {
-        if (todobotlst.size() != 0) {
-            while (todobotlst.size() > 0 && botlst.size() < MAXBOTS) {
-                todobotlst.back()->on = true;
-                botlst.push_back(todobotlst.back());
-                todobotlst.pop_back();
-            }
-        }
-        else {
-            if (collectedPaths.size() > 0) {
-                  for (int i = 0; i < collectedPaths.size(); i++) {
-                  std::set<std::vector<SgGraphNode*> > incloops;
-                  std::vector<std::set<SgGraphNode*> > pthloops = collectedPaths[i].second;
-                  for (int q = 0; q < pthloops.size(); q++) {
-                  for (std::set<SgGraphNode*>::iterator p = pthloops[q].begin(); p != pthloops[q].end(); p++) {
-                    for (std::set<std::vector<SgGraphNode*> >::iterator o = mkloopmap[*p].begin(); o != mkloopmap[*p].end(); o++) {
-                        incloops.insert(*o);
-                    }
-                 }
-                 }
-
-
-        pathAnalyze(collectedPaths[i].first, false, incloops);
-    }
-    collectedPaths.clear();
-            }
-            break;
-        }
-    }
-    if (botlst.size() > 0) {
-    std::pair<std::vector<SgGraphNode*>, std::vector<std::set<SgGraphNode*> > > nullpr;
-    std::vector<std::pair<std::vector<SgGraphNode*>, std::vector<std::set<SgGraphNode*> > > > newpathslst (MAXBOTS, nullpr);
-    #pragma omp parallel for
-    for (int i = 0; i < botlst.size(); i++) {
-        //std::map<SgGraphNode*, std::set<std::vector<SgGraphNode*> > > mkloopmaptmp = mkloopmap;
-        std::vector<struct Bot*> localbotlst;
-        std::pair<std::vector<SgGraphNode*>, std::vector<std::set<SgGraphNode*> > > localnewpath;
-        struct Bot* currBot = botlst[i];
-        if (currBot->on) {
-        std::vector<SgGraphNode*> currpth = currBot->currpth;
-        std::vector<std::vector<SgGraphNode*> > path = currBot->path;
-        std::vector<std::set<SgGraphNode*> > pthloops = currBot->pthloops;
-        
-            if (currpth.back() == endnode) {
-            path.push_back(currpth);
-            std::vector<SgGraphNode*> flatpath;
-            std::set<std::vector<SgGraphNode*> > incloops;
-            struct timeval q1, q2;
-            ROSE_ASSERT(path.size() == pthloops.size() + 1);
-            q1 = getCPUTime();
-            for (unsigned int q = 0; q < pthloops.size(); q++) {
-                for (unsigned int r = 0; r < path[q].size(); r++) {
-                    flatpath.push_back(path[q][r]);
-                }
-
-/*
-#pragma omp critical
-{
-                for (std::set<SgGraphNode*>::iterator p = pthloops[q].begin(); p != pthloops[q].end(); p++) {
-                    for (std::set<std::vector<SgGraphNode*> >::iterator o = mkloopmap[*p].begin(); o != mkloopmap[*p].end(); o++) {
-                        incloops.insert(*o);
-                    }
-                 }
-}
-*/
-
-             }
-
-             for (unsigned int pt2 = 0; pt2 < path[path.size()-1].size(); pt2++) {
-                     flatpath.push_back(path[path.size()-1][pt2]);
-             }             
-             q2 = getCPUTime();
-             fllp += timeDifference(q2,q1);
-             flatpath.push_back(endnode);
-//user defined function, run on the final path, gives the user loops that are included via "incloops" a set of vectors that contain the individual loops
-/*
-             #pragma omp critical (analyze)
-{
-             pathAnalyze(flatpath, false, incloops);
-}
-*/
-             std::pair<std::vector<SgGraphNode*> , std::vector<std::set<SgGraphNode*> > > newcol;
-             newcol.first = flatpath;
-             newcol.second = pthloops;
-             localnewpath = newcol;
-             incloops.clear();
-
-             int pts = pathsSize++;
-             pathsSize += 1;
-            
-             flatpath.clear();
-             path.pop_back();
-             int rounds = 0;
-             bool starter = false;
-
-// This gets a bit complicated so here is an overview:
-// This is running down the graph and finding the endnode. Once it finds the endnode it goes back up to the last unevaluated subpath. It does this quickly with an integer that counts how many times that node has been used for a path. If this ends up being the number of outnodes, we don't need that node anymore, so we clear it to zero, then continue up the graph. We HAVE to reset because every time a new pathway is chosen above that node, it needs to have the ability to traverse that node.
-/*
-              if (currBot->nodelst.size() != 0) {
-                   while (path.back().back() != currBot->nodelst.back().first) {
-                       ROSE_ASSERT(path.size() != 0);
-                       path.pop_back();
-                       pthloops.pop_back();
-                       
-                   }
-                   currBot->path = path;
-                   currBot->pthloops = pthloops;
-                   currBot->currpth = pathsAtMk[(path.back()).back()][currBot->nodelst.back().second];
-                   currBot->nodelst.pop_back();
-                   localbotlst.push_back(currBot);
-             }
-             else {
-*/
-                 currBot->remove = true;
-                 localbotlst.push_back(currBot);
-             //}
-         }
-         else {
-
-//this checks first to see if we have any loops in our path. If not it continues down, if there is it goes back to the last nonloop node
-        bool disj = true;
-        struct timeval tdisb, tdise;
-        //tdisb = getCPUTime();
-        for (int x = 0; x < pthloops.size(); x++) {
-            for (std::set<SgGraphNode*>::iterator j = pthloops[x].begin(); j != pthloops[x].end(); j++) {
-                if (find(currpth.begin(), currpth.end(), *j) != currpth.end()) {
-                    disj = false;
-                }
-             }
-        }
-        //tdise = getCPUTime();
-        //distime += timeDifference(tdise, tdisb);
-        if (disj) {
-            
-            disjointtrues++;
-            //std::cout << "disjoints: " << disjointtrues << std::endl;
-            midstep = false;
-std::set<SgGraphNode*> pthloopstmp;
-            pthloopstmp.clear();
-                for (int i = 0; i < currpth.size(); i++) {
-                    //currflat.push_back(currpth[i]);
-                    if (mkloops.find(currpth[i]) != mkloops.end()) {
-                       pthloopstmp.insert(currpth[i]);
-                    }
-                }
-                pthloops.push_back(pthloopstmp);
-                path.push_back(currpth);
-                pthloopstmp.clear();
-                
-                //std::set<std::vector<SgGraphNode*> > lpth;
-                std::vector<SgGraphNode*> oldcurrpth = currpth;
-                currpth.clear();
-                        SgGraphNode* frontnode = (path.back()).front();
-                        SgGraphNode* backnode = (path.back()).back();
-     
-                        ROSE_ASSERT(pathsAtMk.find(backnode) != pathsAtMk.end() || backnode == endnode);
-                        ROSE_ASSERT(pathsAtMk.find(frontnode) != pathsAtMk.end());
-                        std::vector<std::vector<SgGraphNode*> > tmppths = pathsAtMk[backnode];
-                        currBot->currpth = tmppths[0];
-                        currBot->path = path;
-                        currBot->pthloops = pthloops;
-                        //newbotlst.push_back(currBot);
-                        for (int tp = 1; tp < tmppths.size(); tp++) {
-                            //if (localbotlst.size() < LOCALMAXBOTS) {
-/*
-                            if (currBot->nodelst.size() < LOCALMAXNODES) {
-                                std::pair<SgGraphNode*, int> cur;
-                                cur.second = tp;
-                                cur.first = path.back().back();
-                                currBot->nodelst.push_back(cur);
-                            }
-                            else {
-*/
-                                struct Bot* newBot = new Bot;
-                                newBot->remove = false;
-                                newBot->currpth = tmppths[tp];
-                                newBot->path = path;
-                                newBot->pthloops = pthloops;
-                                localbotlst.push_back(newBot);
-                                //ti++;
- //                           }
-                        }
-                        localbotlst.push_back(currBot);
-                        //ti++;
-         }          
-         else {
-/*
-               if (currBot->nodelst.size() != 0) {
-                   while (path.back().back() != currBot->nodelst.back().first) {
-                       ROSE_ASSERT(path.size() != 0);
-                       path.pop_back();
-                       pthloops.pop_back();
-                       
-                   }
-                   currBot->path = path;
-                   currBot->pthloops = pthloops;
-                   currBot->currpth =  pathsAtMk[(path.back()).back()][currBot->nodelst.back().second];
-                   currBot->nodelst.pop_back();
-                   localbotlst.push_back(currBot);
-                   //ti++;
-             }
-
-             else {
-*/
-                 currBot->remove = true;
-                 localbotlst.push_back(currBot);
-                 //delete currBot;
- //            }
-
-        }
-     }
- newpathslst[i] = localnewpath;
- newbotlsts[i] = localbotlst;
- }
-}
- botlst.clear();
- int num = 0;
-
- for (int i = 0; i < newbotlsts.size(); i++) {
-    if (newpathslst[i].first.size() > 0) {
-        collectedPaths.push_back(newpathslst[i]);
-    }
-    for (int j = 0; j < newbotlsts[i].size(); j++) {
-        if (newbotlsts[i][j]->remove == true) {
-            delete newbotlsts[i][j];
-        }
-        else if (num < MAXBOTS) {
-            newbotlsts[i][j]->on = true;
-            botlst.push_back(newbotlsts[i][j]);
-            num++;
-        }
-        else {
-            newbotlsts[i][j]->on = false;
-            todobotlst.push_back(newbotlsts[i][j]);
-        }
-    }
-}
-
-if (collectedPaths.size() > MINPATHS) {
-          
-    for (int i = 0; i < collectedPaths.size(); i++) {
-                 std::vector<std::set<SgGraphNode*> > pthloops;   
-                std::set<std::vector<SgGraphNode*> > incloops;
-                pthloops = collectedPaths[i].second;
-                for (int q = 0; q < pthloops.size(); q++) {
-                for (std::set<SgGraphNode*>::iterator p = pthloops[q].begin(); p != pthloops[q].end(); p++) {
-                    for (std::set<std::vector<SgGraphNode*> >::iterator o = mkloopmap[*p].begin(); o != mkloopmap[*p].end(); o++) {
-                        incloops.insert(*o);
-                    }
-                 }
-               }
-
-        pathAnalyze(collectedPaths[i].first, false, incloops);
-    }
-    collectedPaths.clear();
-}
-}
- else {
-            if (collectedPaths.size() > 0) {
-            for (int i = 0; i < collectedPaths.size(); i++) {
-                std::set<std::vector<SgGraphNode*> > incloops;
-                pthloops = collectedPaths[i].second;
-                for (int q = 0; q < pthloops.size(); q++) {
-                for (std::set<SgGraphNode*>::iterator p = pthloops[q].begin(); p != pthloops[q].end(); p++) {
-                    for (std::set<std::vector<SgGraphNode*> >::iterator o = mkloopmap[*p].begin(); o != mkloopmap[*p].end(); o++) {
-                        incloops.insert(*o);
-                    }
-                 }
-               }
- 
-        pathAnalyze(collectedPaths[i].first, false, incloops);
-    }
-    }
-    collectedPaths.clear();
- break;
- }
-}
-
-std::cout << "successes: " << successes << std::endl;
-std::cout << "failures: " << failures << std::endl;
-std::cout << "maxlst: " << maxlst << std::endl;
-return;
-}
-
-
-
-template<class InheritedAttributeType, class SynthesizedAttributeType>
-void
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-evaluatePaths(SgIncidenceDirectedGraph* g, SgGraphNode* realstartnode, SgGraphNode* endnode) {
-//std::set<SgGraphNode*> seen;
-//for (std::map<SgGraphNode*, std::vector<std::vector<SgGraphNode*> > >::iterator i = pathsAtMk.begin(); i != pathsAtMk.end(); i++) {
-/*    
-    std::vector<std::vector<SgGraphNode*> > tocheck = (*i).second;
-    for (int j = 0; j < tocheck.size(); j++) {
-        for (int k = 0; k < tocheck[j].size(); k++) {
-            if (seen.find(tocheck[j][k]) != seen.end()) {
-                ploops.insert(tocheck[j][k]);
-            }
-            else {
-                seen.insert(tocheck[j][k]);
-            }
-        }
-    }
-}
-*/     
-std::vector<std::vector<SgGraphNode*> > path;
-std::vector<SgGraphNode*> spath;
-SgGraphNode* n = realstartnode;
-int successes = 0;
-int failures = 0;
-int j = 0;
-std::vector<SgGraphNode*> currpth;
-int currint = 0;
-std::map<SgGraphNode*, int> intPath;
-intPath[n] = currint;
-currint++;
-std::map<SgGraphNode*, int> currents;
-SgGraphNode* currnode;
-bool step = false;
-bool midstep = false;
-
-//note: pathsAtMk is referring to subpaths connected to that marker, a marker is a split in the graph (usually an if statement)
-
-std::vector<std::vector<SgGraphNode*> > pth = pathsAtMk[realstartnode];
-std::vector<std::vector<SgGraphNode*> > cpth = pathsAtMk[realstartnode];
-    path.clear();
-    int disjoints = 0;
-    int disjointtrues = 0;
-    currpth = pth[0];
-    intPath[pth[0].front()] = currint;
-    std::set<SgGraphNode*> pthloopstmp;
-    SgGraphNode* fakenode;
-    pthloopstmp.insert(fakenode);
-    std::vector<std::set<SgGraphNode*> > pthloops;
-    pthloops.push_back(pthloopstmp);
-    pthloopstmp.clear();
-    currint++;
-    
-    int stepnum = 0;
-    std::vector<SgGraphNode*> rs;
-    rs.push_back(realstartnode);
-    path.push_back(rs);
-    //currflat.push_back(realstartnode);
-    currents.clear();
-
-    step = false;
-    //std::vector<SgGraphNode*> currflat;
-    std::vector<SgGraphNode*> sub;
-
-/*
-    std::ofstream mz;
-    mz.open("pathanalysis.dot");
-    mz << "digraph defaultName { \n";
-*/
-    std::set<std::vector<SgGraphNode*> > nullIncLoops;
-
-/*
-    for (unsigned int p = 0; p < looppaths.size(); p++) {
-        std::vector<SgGraphNode*> lp = looppaths[p];
-
-        for (unsigned int i = 0; i < lp.size()-1; i++) {
-            for (unsigned int l = i+1; l < lp.size(); l++) {
-                if (lp[i] == lp[l] && lp[i] != realstartnode && lp[i] != endnode) {
-                std::vector<SgGraphNode*> interiorloop;
-                interiorloop.clear();
-                for (unsigned int j = i; j < l+1; j++) {
-                    interiorloop.push_back(lp[j]);
-                }
-                if (interiorloop.size() > 2) {
-                }
-                if (interiorloop.size() > 2 && interiorloop.back() != endnode) {
-                if (find(iLoops.begin(), iLoops.end(), interiorloop) == iLoops.end()) {
-                    if (find(looppaths.begin(), looppaths.end(), interiorloop) == looppaths.end()) {
-                        iLoops.push_back(interiorloop);
-                        loopnum++;
-                        for (unsigned int k = 0; k < interiorloop.size(); k++) {
-                             loopNumMap[interiorloop[k]] = loopnum;
-                        }
-                        lpbegins[interiorloop.front()].insert(interiorloop);
-                        pathAnalyze(interiorloop, true, nullIncLoops);
-                        
-                    }
-                }
-                }
-                }
-            }
-        }
-        if (lp.size() > 2) {   
-            lpbegins[lp.front()].insert(lp);      
-            pathAnalyze(lp, true, nullIncLoops);
-            //for (unsigned int i = 1; i < lp.size(); i++) {
-            //    printNodePlusEdgesForAnalysisPath(g, lp, p, p, mz);
-            //}
-        }
-    }
-*/
-    while (step == false) {
-        stepnum++;
-        
-        if (currpth.back() == endnode) {
-            path.push_back(currpth);
-            //for (int i = 0; i < currpth.size(); i++) {
-            //    currflat.push_back(currpth[i]);
-            //}
-            std::vector<SgGraphNode*> flatpath;
-            //std::vector<SgGraphNode*> sub;
-            std::set<std::vector<SgGraphNode*> > incloops;
-            struct timeval q1, q2;
-            //std::cout << "path.size(): " << path.size() << std::endl;
-            //std::cout << "pthloops.size(): " << pthloops.size() << std::endl;
-            ROSE_ASSERT(path.size() == pthloops.size() + 1);
-            q1 = getCPUTime();
-            for (unsigned int q = 0; q < pthloops.size(); q++) {
-                //sub = path[q];
-                //sub.pop_back();
-                for (unsigned int r = 0; r < path[q].size(); r++) {
-                    flatpath.push_back(path[q][r]);
-                }
-                for (std::set<SgGraphNode*>::iterator p = pthloops[q].begin(); p != pthloops[q].end(); p++) {
-                    for (std::set<std::vector<SgGraphNode*> >::iterator o = mkloopmap[*p].begin(); o != mkloopmap[*p].end(); o++) {
-                        incloops.insert(*o);
-                    }
-                 }
-             }
-             for (unsigned int pt2 = 0; pt2 < path[path.size()-1].size(); pt2++) {
-                     flatpath.push_back(path[path.size()-1][pt2]);
-             }
-             
-             q2 = getCPUTime();
-             fllp += timeDifference(q2,q1);
-             flatpath.push_back(endnode);
-/* 
-            for (unsigned int ps = 0; ps < flatpath.size(); ps++) {
-                 if (lpbegins.find(flatpath[ps]) != lpbegins.end()) {
-                     for (std::set<std::vector<SgGraphNode*> >::iterator sv = lpbegins[flatpath[ps]].begin(); sv != lpbegins[flatpath[ps]].end(); sv++) {
-                         incloops.insert(*sv);
-                     }
-                 }
-             }
-*/
-//user defined function, run on the final path, gives the user loops that are included via "incloops" a set of vectors that contain the individual loops
-             pathAnalyze(flatpath, false, incloops);
-             incloops.clear();
-                //printNodePlusEdgesForAnalysisPath(g, flatpath, -1, -1, mz);
-
-             int pts = pathsSize++;
-             pathsSize += 1;
-            
-             flatpath.clear();
-             path.pop_back();
-             int rounds = 0;
-             bool starter = false;
-
-// This gets a bit complicated so here is an overview:
-// This is running down the graph and finding the endnode. Once it finds the endnode it goes back up to the last unevaluated subpath. It does this quickly with an integer that counts how many times that node has been used for a path. If this ends up being the number of outnodes, we don't need that node anymore, so we clear it to zero, then continue up the graph. We HAVE to reset because every time a new pathway is chosen above that node, it needs to have the ability to traverse that node.
-
-
-              while (true) {
-                   rounds++;
-                   ROSE_ASSERT(pathsAtMk.find((path.back()).back()) != pathsAtMk.end());
-                   if ((path.back()).front() == realstartnode) {
-                       starter = true;
-                   }
-                   if (currents[(path.back()).back()] < (pathsAtMk[(path.back()).back()].size()) /*|| (path.back()).front() == realstartnode*/) {
-                              std::vector<std::vector<SgGraphNode*> > cpths = pathsAtMk[(path.back()).back()];
-                              currpth = cpths[currents[(path.back()).back()]];
-                              currents[(path.back()).back()]++;
-                              break;
-                   }
-                   else {
-                       currents[(path.back()).back()] = 0;
-                       path.pop_back();
-                       pthloops.pop_back();
-                   }
-                   if (starter == true) {
-                       step = true;
-                       break;
-                   }
-
-           }
-        }
-        else {
-
-//this checks first to see if we have any loops in our path. If not it continues down, if there is it goes back to the last nonloop node
-        bool disj = true;
-        struct timeval tdisb, tdise;
-        tdisb = getCPUTime();
-        for (int i = 0; i < pthloops.size(); i++) {
-            for (std::set<SgGraphNode*>::iterator j = pthloops[i].begin(); j != pthloops[i].end(); j++) {
-                if (find(currpth.begin(), currpth.end(), *j) != currpth.end()) {
-                    disj = false;
-                }
-             }
-        }
-/*
-        #pragma omp parallel for num_threads(4) private(i,j)
-        for (i = 0; i < pthloops.size(); i++) {
-            if (disj) {
-            for (std::set<SgGraphNode*>::iterator j = pthloops[i].begin(); j != pthloops[i].end(); j++) {
-                if (find(currpth.begin(), currpth.end(), *j) != currpth.end()) {
-                    disj = false;
-                    //j = pthloops[i].size();
-                }
-            }
-            }
-            
-        }
-*/
-        tdise = getCPUTime();
-        distime += timeDifference(tdise, tdisb);
-        if (disj) {
-            
-            disjointtrues++;
-            //std::cout << "disjoints: " << disjointtrues << std::endl;
-            midstep = false;
-            std::set<SgGraphNode*> pthloopstmp;
-            pthloopstmp.clear();
-                for (int i = 0; i < currpth.size(); i++) {
-                    //currflat.push_back(currpth[i]);
-                    if (mkloops.find(currpth[i]) != mkloops.end()) {
-                       pthloopstmp.insert(currpth[i]);
-                    }
-                }
-                pthloops.push_back(pthloopstmp);
-                path.push_back(currpth);
-                pthloopstmp.clear();
-                
-                //std::set<std::vector<SgGraphNode*> > lpth;
-                std::vector<SgGraphNode*> oldcurrpth = currpth;
-                currpth.clear();
-                if (currents.find((path.back()).back()) == currents.end()) {
-                    currents[(path.back()).back()] = 0;
-                }
-                        SgGraphNode* frontnode = (path.back()).front();
-                        SgGraphNode* backnode = (path.back()).back();
-     
-                        ROSE_ASSERT(pathsAtMk.find(backnode) != pathsAtMk.end() || backnode == endnode);
-                        ROSE_ASSERT(pathsAtMk.find(frontnode) != pathsAtMk.end());
-                        if (currents.find(backnode) == currents.end()) {
-                            currents[backnode] = 0;
-                        }
-                        else {
-                            ROSE_ASSERT(currents[backnode] == 0);
-                        }
-                        std::vector<std::vector<SgGraphNode*> > tmppths = pathsAtMk[backnode];
-                       
-                        currpth = tmppths[currents[backnode]];
-                        ROSE_ASSERT(currpth != oldcurrpth);
-                        currents[backnode]++;
-                    }        
-     else {
-        disjoints++;
-        //std::cout << "disjoint false: " << s << std::endl;
-        
-        while (true) {
-            if (currents[(path.back()).back()] < pathsAtMk[(path.back()).back()].size() || path.back().back() == realstartnode) {
-                break;
-            }
-            currents[(path.back()).back()] = 0;
-            path.pop_back();
-            pthloops.pop_back();
-        }
-        if ((path.back()).back() != realstartnode) {
-        currpth = (pathsAtMk[(path.back()).back()])[currents[(path.back()).back()]];
-        currents[(path.back()).back()]++;
-        }
-        else {
-        step = true;
-        }
-    }
- }
- }
-std::cout << "successes: " << successes << std::endl;
-std::cout << "failures: " << failures << std::endl;
-
-return;
-}
-    
-        
-//these are debugging functions, used to visually ascertain where the paths are going to check to make sure everything is evaluated
-
-
-/* DEBUGGING */
-
-template<class InheritedAttributeType, class SynthesizedAttributeType>
-void
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-printNodePlusEdgesForAnalysis(SgIncidenceDirectedGraph* g, SgGraphNode* n, int loopNum, int pathVal, std::ofstream& ss) {
-  printNodeForAnalysis(n, loopNum, pathVal, ss);
-  std::set<SgDirectedGraphEdge*> outEdges = g->computeEdgeSetOut(n);
-  for (std::set<SgDirectedGraphEdge*>::iterator i = outEdges.begin(); i != outEdges.end(); i++) {
-    if (nullEdgesOrdered.find(*i) == nullEdgesOrdered.end()) {
-        printEdgeForAnalysis(*i, false, ss);
-    }
-    else {
-        printEdgeForAnalysis(*i, true, ss);
-    }   
-  }
-}
-
-template<class InheritedAttributeType, class SynthesizedAttributeType>
-void
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-printNodePlusEdgesForAnalysisPath(SgIncidenceDirectedGraph* g, std::vector<SgGraphNode*> n, int loopNum, int pathVal, std::ofstream& ss) {
-  for (unsigned int i = 0; i < n.size()-1; i++) {
-     if (completedNodesPath.find(n[i]) == completedNodesPath.end()) {
-         printNodeForAnalysis(n[i], loopNum, pathVal, ss);
-         completedNodesPath.insert(n[i]);
-     }
-     std::pair<SgGraphNode*, SgGraphNode*> prnod;
-     prnod.first = n[i+1];
-     prnod.second = n[i];
-     if (completedEdgesPath.find(prnod) == completedEdgesPath.end()) {
-         printEdgeForAnalysisPath(n[i+1], n[i], ss);
-         completedEdgesPath.insert(prnod);
-     }
-  }
-  if (completedNodesPath.find(n[n.size() - 1]) == completedNodesPath.end()) {
-     printNodeForAnalysis(n[n.size()-1], loopNum, pathVal, ss);
-     completedNodesPath.insert(n[n.size() - 1]);
-  }
-
-}
-
-
-template<class InheritedAttributeType, class SynthesizedAttributeType>
-void
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-printNodeForAnalysis(SgGraphNode* n, int loopNum, int pathNum, std::ofstream &ss) {
-  int id = n->get_index();
-  std::string nodeColor = "black";
-  if (loopNum != 0) {
-  ss << id << " [label=\"" << "LoopNumS" << loopNum << "\", color=\"" << "green" << "\", style=\"" << "solid" << "\"];\n";
-  }
-  else {
-  ss << id << " [label=\"" << "pathNumS" << pathNum << "\", color=\"" << "black" << "\", style=\"" << "dotted" << "\"];\n";
-  }
-  
-}
-template<class InheritedAttributeType, class SynthesizedAttributeType>
-void
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-printEdgeForAnalysis(SgDirectedGraphEdge* e, bool isNullEdge, std::ofstream &ss) {
-  if (isNullEdge) {
-      ss << e->get_from()->get_index() << " -> " << e->get_to()->get_index() << " [label=\"" << "NullEdge" << "\", style=\"" << "dotted" << "\"];\n";
-  }
-  else {
-      ss << e->get_from()->get_index() << " -> " << e->get_to()->get_index() << " [label=\"" << "\", style=\"" << "solid" << "\"];\n";
-  }
-}
-template<class InheritedAttributeType, class SynthesizedAttributeType>
-void
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-printEdgeForAnalysisPath(SgGraphNode* g1, SgGraphNode* g2, std::ofstream &ss) {
-      ss << g2->get_index() << " -> " << g1->get_index() << " [label=\"" << "Edge" << "\", style=\"" << "solid" << "\"];\n";
-}
-
-/* END DEBUGGING */
-
-//This function sets up the graph so that the evaluatePath function can easily traverse the paths
-
-template<class InheritedAttributeType, class SynthesizedAttributeType>
-void
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-solvePaths(SgIncidenceDirectedGraph* g, SgGraphNode* n, SgGraphNode* endnode) {
-    bool done = false;
-    bool edges = true;
-    bool tookone = false;
-    std::vector<SgGraphNode*> mkpath;
-    std::vector<SgGraphNode*> marks;
-    marks.push_back(n);
-    mkglobal.push_back(n);
-    SgGraphNode* currn = n;
-    SgGraphNode* took;
-    std::set<SgDirectedGraphEdge*> taken;
-    std::vector<SgGraphNode*> toTake;
-    std::vector<SgGraphNode*> path;
-    path.push_back(n);
-    mkpath.push_back(n);
-    int itr = 0;
-    int bifurcations = 0;
-    std::map<SgGraphNode*, bool> completed;
-    while (done == false) {
-             ROSE_ASSERT(currn != NULL);
-//check to see if we've hit the endnode or if we're done, if not continue, if so push the subpath into the "pathsAtMk" repository            
-               if (currn == endnode || completed.find(currn) != completed.end()) {
-                if (pathsAtMk.find(marks.back()) == pathsAtMk.end()) {
-                    std::vector<std::vector<SgGraphNode*> > emptypath;
-                    pathsAtMk[marks.back()] = emptypath;
-                }
-                edges = false;
-                pathsAtMk[marks.back()].push_back(mkpath);
-                //for (int mk = 0; mk < mkpath.size(); mk++) {
-                 //   std::set<SgDirectedGraphEdge*> iedg = g->computeEdgeSetIn(mkpath[mk]);
-                    //if (iedg.size() > 1) {
-                    //    ploops.insert(mkpath[mk]);
-                   // }
-                //}
-                ROSE_ASSERT(mkpath.front() == marks.back());
-                if (marks.size() == 0) {
-                    return;
-                }
-                mkpath.clear();
-                bool y = true;
-                bool haventtaken = false;
-                bool p = true;
-                int place;
-                bool found = false;
-                while (found == false) {
-                    if (marks.size() == 0) {
-                        return;
-                    }
-                    SgDirectedGraphEdge* tooked;
-                    SgGraphNode* mark1 = marks.back();
-                    std::set<SgDirectedGraphEdge*> oedg = g->computeEdgeSetOut(mark1);
-                    ROSE_ASSERT(oedg.size() > 1 || mark1 == n);
-                        for (std::set<SgDirectedGraphEdge*>::iterator j = oedg.begin(); j != oedg.end(); j++) {
-                            if (taken.find(*j) == taken.end() && haventtaken == false) {
-                                tooked = *j;
-                                haventtaken = true;
-                            }
-                        }
-                        if (haventtaken == true) {
-                            if (marks.back() == n) {
-                                path.clear();
-                            }
-                            path.push_back(marks.back());
-                            if ( mkpath.empty() || (mkpath.back() != marks.back()) ) {
-                                ROSE_ASSERT(!marks.empty());
-                                mkpath.push_back(marks.back());
-                            }
-                            taken.insert(tooked);
-                            took = tooked->get_to();
-                            found = true;
-                        }
-                        else {
-                            completed[marks.back()] = true;
-                            bifurcations++;
-                            marks.pop_back();
-                        }
-                    }
-                    if (marks.size() == 0) {
-                        return;
-                    } 
-                    haventtaken = false;
-                    found = false; 
-                                
-             }
-//if we haven't reached the endnode or completed, continue down the graph
-             else {
-            std::set<SgDirectedGraphEdge*> oedg = g->computeEdgeSetOut(currn);
-            std::set<SgDirectedGraphEdge*> iedg = g->computeEdgeSetIn(currn);
-            if (oedg.size() > 1) {
-                     if (mkpath.back() != currn) {
-                     mkpath.push_back(currn);
-                     }
-                     pathsAtMk[marks.back()].push_back(mkpath);
-                     mkpath.clear();
-                     mkpath.push_back(currn);
-                     marks.push_back(currn);
-                     if (find(mkglobal.begin(), mkglobal.end(), currn) == mkglobal.end()) {
-                         mkglobal.push_back(currn);
-                     }
-                     for (std::set<SgDirectedGraphEdge*>::iterator i = oedg.begin(); i != oedg.end(); i++) {
-                          if (taken.find(*i) == taken.end() && tookone == false) {
-                               taken.insert(*i);
-                               tookone = true;
-                               took = (*i)->get_to();
-                          }
-                          else if (taken.find(*i) == taken.end() && tookone == true) {
-                               //toTake.push_back((*i)->get_to());
-                          }
-                   }
-                   tookone = false;
-           }
-           else {
-                took = (*(oedg.begin()))->get_to();
-           }
-           }
-           itr++;
-           
-           if (find(path.begin(), path.end(), took) == path.end()) {
-               mkpath.push_back(took);
-               path.push_back(took);
-               currn = took;
-           }
-           else {
-               mkloops.insert(took);
-               std::vector<SgGraphNode*> lptemp;
-               lptemp.clear();
-               lptemp.push_back(took);
-               while (path.back() != took) {
-                   
-                   path.pop_back();
-                  
-                   lptemp.push_back(path.back());
-                   
-               }
-               (mkloopmap[took]).insert(lptemp);
-/*
-               if (lptemp.size() > 1) {
-               if (find(looppaths.begin(), looppaths.end(), lptemp) == looppaths.end() && find(lptemp.begin(), lptemp.end(), st) == lptemp.end() && find(lptemp.begin(), lptemp.end(), endnode) == lptemp.end()) {
-                   looppaths.push_back(lptemp);
-                   loopnum++;
-                   for (unsigned int i = 0; i < lptemp.size(); i++) {
-                       loopNumMap[lptemp[i]] = loopnum;
-                   }
-               }
-               }
-*/
-               path.push_back(took);
-               currn = path.back();
-               mkpath.push_back(took);
-           }
-           
-               
-}
-           return;
-}
-
-//not currently useful
-template <class InheritedAttributeType, class SynthesizedAttributeType>
-SynthesizedAttributeType
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-defaultSynthesizedAttribute(InheritedAttributeType inh)
-{
-    SynthesizedAttributeType s = SynthesizedAttributeType();
-    return s;
-}
-
-
-//computes the order in which to evaluate the nodes in nodal analysis so that you don't evaluate a node before you evaluate its parents
-
-template <class InheritedAttributeType, class SynthesizedAttributeType>
-void
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-computeOrder(SgIncidenceDirectedGraph* g, SgGraphNode* n, SgGraphNode* endnode) {
-    std::map<SgGraphNode*, int> incomputables;
-    std::set<SgGraphNode*> lpposs;
-    //std::set<SgGraphNode*> lps;
-    SgGraphNode* currn;
-    currn = n;
-    int orders = 0; 
-    while (true) {
-        if (orders % 10000 == 0) {
-            std::cout << "orders: " << orders << std::endl;
-        }
-        orders++;
-        if (currn == endnode) {
-        }
-        if (computable(g, currn) || currn == n) {
-            int mp;
-            if (oVals.find(currn) == oVals.end()) {
-                 oVals[currn] = currm++;
-                 iVals[currm++] = currn;
-                 currm += 1;
-            }
-            if (currn == endnode) {
-                
-                break;
-            }
-            std::pair<bool, SgGraphNode*> pbs = getNextChild(g, currn);
-            computedNodes.insert(currn);
-            ROSE_ASSERT(pbs.first == true);
-            currn = pbs.second;
-        }
-        else {
-            std::pair<bool, SgGraphNode*> pbp = getNextPar(g, currn);
-            ROSE_ASSERT(pbp.first == true);
-            currn = pbp.second;
-            
-        }
-        
-    }
-    std::cout << "required orders" << orders << std::endl;
-    std::cout << "incomputables.size() " << incomputables.size() << std::endl;
-}
-
-//simple fucntion to check the computability under nodal analysis
-template <class InheritedAttributeType, class SynthesizedAttributeType>
-bool
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-computable(SgIncidenceDirectedGraph* g, SgGraphNode* n) {
-    if (computedNodes.find(n) != computedNodes.end()) {
-        return true;
-    }
-    std::set<SgDirectedGraphEdge*> ed = g->computeEdgeSetIn(n);
-    bool comp = true;
-    for (std::set<SgDirectedGraphEdge*>::iterator i = ed.begin(); i != ed.end(); i++) {
-        if (oVals.find((*i)->get_from()) == oVals.end() && nullEdgesOrdered.find(*i) == nullEdgesOrdered.end()) {
-            comp = false;
-        }
-    }
-    return comp;
-}
-
-
-//computes the inherited attribute values in nodal analysis
-
-template <class InheritedAttributeType, class SynthesizedAttributeType>
-void
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-computeInheritedOrdered(SgIncidenceDirectedGraph* g, SgGraphNode* n) {
-    int runs = 0;
-//    std::ofstream mf;
-//    mf.open("analysis.dot");
-//    mf << "digraph defaultName { \n";
-    for (std::map<int, SgGraphNode*>::iterator i = iVals.begin(); i != iVals.end(); i++) {
-        runs++;
-        ROSE_ASSERT(canEval(g, (*i).second));
-        setPathVal(g, n);
-        //printNodePlusEdgesForAnalysis(g, (*i).second, loopNumMap[(*i).second], pathValMap[(*i).second], mf);
-        evalNodeOrdered(g, (*i).second);
-    }
-}
-
-//checks to see if evaluation is possible under nodal analysis
-template <class InheritedAttributeType, class SynthesizedAttributeType>
-bool
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-canEval(SgIncidenceDirectedGraph* g, SgGraphNode* n) {
-    bool evaled = true;
-    if (inhVals.find(n) == inhVals.end()) {
-    std::set<SgDirectedGraphEdge*> ins = g->computeEdgeSetIn(n);
-    for (std::set<SgDirectedGraphEdge*>::iterator i = ins.begin(); i != ins.end(); i++) {
-        if (inhVals.find((*i)->get_from()) == inhVals.end() && nullEdgesOrdered.find(*i) == nullEdgesOrdered.end()) {
-            evaled = false;
-        }
-    }
-    }
-    return evaled;
-}
-
-
-//actually does the evaluation
-template <class InheritedAttributeType, class SynthesizedAttributeType>
-void
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-evalNodeOrdered(SgIncidenceDirectedGraph* g, SgGraphNode* n) {
-    if (inhVals.find(n) != inhVals.end()) {
-        return;
-    }
-    std::set<SgDirectedGraphEdge*> par = g->computeEdgeSetIn(n);
-    std::vector<InheritedAttributeType> inh;
-    for (std::set<SgDirectedGraphEdge*>::iterator i = par.begin(); i != par.end(); i++) {
-        if (inhVals.find((*i)->get_from()) != inhVals.end()) {
-            inh.push_back(inhVals[(*i)->get_from()]);
-        }
-    }
-    
-    if (n != st || inh.size() > 0) {
-        InheritedAttributeType inhX;
-        inhX = evaluateInheritedAttribute(n, inh);
-        inhVals[n] = inhX;
-    }
-    //std::cout << "num of inhVals: " << inh.size() << std::endl;
-    
-}
-
-
-//debugging function, currently not useful for the end user
-template <class InheritedAttributeType, class SynthesizedAttributeType>
-void
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-setPathVal(SgIncidenceDirectedGraph* g, SgGraphNode* currn) {
-       if (pathValMap.find(currn) != pathValMap.end()) {
-           return;
-       }
-       std::set<SgDirectedGraphEdge*> ined = g->computeEdgeSetIn(currn);
-       int tmppathcount = 0;
-       for (std::set<SgDirectedGraphEdge*>::iterator i = ined.begin(); i != ined.end(); i++) {
-            ROSE_ASSERT(pathValMap.find((*i)->get_from()) != pathValMap.end() /*|| nullEdgesOrdered.find(*i) != nullEdgesOrdered.end()*/);
-            //if (nullEdgesOrdered.find(*i) != nullEdgesOrdered.end()) {
-            //    pathValMap[(*i)->get_from()] = 0;
-           // }
-            int pv = pathValMap[(*i)->get_from()];
-            if (pv != 0) {
-            tmppathcount += pv;
-            }
-        }
-        pathValMap[currn] = tmppathcount;
-        return;
-    }
-
-//computes the next child to be analyzed in nodal analysis
-template <class InheritedAttributeType, class SynthesizedAttributeType>
-std::pair<bool, SgGraphNode*>
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-getNextChild(SgIncidenceDirectedGraph* g, SgGraphNode* n) {
-    bool nullPoss = false;
-    //std::cout << "nextChild" << std::endl;
-    std::set<SgDirectedGraphEdge*> outs = g->computeEdgeSetOut(n);
-    //std::cout << "outs.size(): " << outs.size() << std::endl;
-    //std::cout << "outs: " << outs.size() << std::endl;
-    SgGraphNode* nextNode;
-    SgGraphNode* nullNode;
-    bool completed = false;
-    bool completeNull = false;
-    
-    for (std::set<SgDirectedGraphEdge*>::iterator i = outs.begin(); i != outs.end(); i++) {
-
-        if (outs.size() == 1) {
-            nextNode = (*i)->get_to();
-            if (nullEdgesOrdered.find(*i) != nullEdgesOrdered.end()) {
-                nullNum++;
-            }
-            //completedEdges.insert(*i);
-            completed = true;
-        }
-        else if (completed == false && computedNodes.find((*i)->get_to()) == computedNodes.end()) {
-            completed = true;
-            nextNode = (*i)->get_to();
-            if (nullEdgesOrdered.find(*i) != nullEdgesOrdered.end()) {
-                nullNum++;
-            }
-            completedEdgesOut.insert(*i);
-        }
-        
-            
-    }
-    std::pair<bool, SgGraphNode*> pr;
-    ROSE_ASSERT (completed == true || completeNull == true);
-    if (completed == true) {
-        pr.first = completed;
-        pr.second = nextNode;
-        return pr;
-    }
-    else {
-        pr.first = true;
-        pr.second = nullNode;
-        return pr;
-    } 
-    
-}
-
-//computes the next parent to be analyzed in nodal analysis
-template <class InheritedAttributeType, class SynthesizedAttributeType>
-std::pair<bool, SgGraphNode*>
-SgGraphTraversal<InheritedAttributeType, SynthesizedAttributeType>::
-getNextPar(SgIncidenceDirectedGraph* g, SgGraphNode* n) {
-    std::set<SgDirectedGraphEdge*> ins = g->computeEdgeSetIn(n);
-    SgGraphNode* nextPar;
-    SgDirectedGraphEdge* nullEdgeO;
-    bool completed = false;
-    bool completeNull = false;
-    for (std::set<SgDirectedGraphEdge*>::iterator i = ins.begin(); i != ins.end(); i++) {
-
-        if (ins.size() == 1 /*&& completedEdges.find(*i) == completedEdges.end()*/) {
-            completed = true;
-            completedEdges.insert(*i);
-            nextPar = (*i)->get_from();
-        }
-
-        else if (completedEdges.find(*i) == completedEdges.end() && completed == false) {
-            completed = true;
-            nextPar = (*i)->get_from();
-            completedEdges.insert(*i);
-        }
-
-        else if (completedEdges.find(*i) != completedEdges.end() && computedNodes.find((*i)->get_from()) == computedNodes.end() && completed == false /*&& nullEdgesOrdered.find(*i) == nullEdgesOrdered.end()*/) {
-            completeNull = true;
-            std::pair<SgGraphNode*, SgGraphNode*> lpp;
-            nextPar = n;
-            nullEdgesOrdered.insert(*i);
-            nullEdgesPaths++;
-            
-        }
-    }
-    ROSE_ASSERT(completed == true || completeNull == true);
-    std::pair<bool, SgGraphNode*> pr;
-    pr.first = completed;
-    pr.second = nextPar;
-
-    if (completeNull == true && completed == false) {
-        pr.first = completeNull;
-        pr.second = nextPar;
-    }
-   
-    return pr;
-}
- 
-    
-
-
-
-
-
-
- 
-    
-
-  
-        
-    
-            
diff --git a/src/midend/astProcessing/graphTemplate.h b/src/midend/astProcessing/graphTemplate.h
deleted file mode 100644
index a0935ffdb1b..00000000000
--- a/src/midend/astProcessing/graphTemplate.h
+++ /dev/null
@@ -1,531 +0,0 @@
-#ifndef BACKSTROKE_CFG_H
-#define BACKSTROKE_CFG_H
-
-
-#include <rose.h>
-#include <boost/graph/adjacency_list.hpp>
-#include <boost/bind.hpp>
-#include <boost/tuple/tuple.hpp>
-#include <boost/graph/graphviz.hpp>
-#include <boost/graph/dominator_tree.hpp>
-#include <boost/graph/reverse_graph.hpp>
-#include <boost/graph/transpose_graph.hpp>
-#include <boost/algorithm/string.hpp>
-
-
-namespace Backstroke
-{
-
-
-
-//! This function helps to write the DOT file for vertices.
-template <class CFGNodeType>
-void writeCFGNode(std::ostream& out, const CFGNodeType& cfgNode)
-{
-        SgNode* node = cfgNode.getNode();
-        ROSE_ASSERT(node);
-
-        std::string nodeColor = "black";
-        if (isSgStatement(node))
-                nodeColor = "blue";
-        else if (isSgExpression(node))
-                nodeColor = "green";
-        else if (isSgInitializedName(node))
-                nodeColor = "red";
-
-        std::string label;
-
-        if (SgFunctionDefinition* funcDef = isSgFunctionDefinition(node))
-        {
-                std::string funcName = funcDef->get_declaration()->get_name().str();
-                if (cfgNode.getIndex() == 0)
-                        label = "Entry\\n" + funcName;
-                else if (cfgNode.getIndex() == 3)
-                        label = "Exit\\n" + funcName;
-        }
-        
-        if (!isSgScopeStatement(node) && !isSgCaseOptionStmt(node) && !isSgDefaultOptionStmt(node))
-        {
-                std::string content = node->unparseToString();
-                boost::replace_all(content, "\"", "\\\"");
-                boost::replace_all(content, "\\n", "\\\\n");
-                label += content;
-        }
-    else
-                label += "<" + node->class_name() + ">";
-    
-    if (label == "")
-                label += "<" + node->class_name() + ">";
-        
-        out << "[label=\""  << label << "\", color=\"" << nodeColor <<
-                "\", style=\"" << (cfgNode.isInteresting()? "solid" : "dotted") << "\"]";
-}
-
-
-//! This function helps to write the DOT file for edges.
-template <class CFGEdgeType>
-void writeCFGEdge(std::ostream& out, const CFGEdgeType& e)
-{
-        out << "[label=\"" << escapeString(e.toString()) <<
-                "\", style=\"" << "solid" << "\"]";
-}
-
-
-// Predeclaration of class CFG.
-template <class CFGNodeFilter> class CFG;
-
-struct FullCFGNodeFilter
-{
-        bool operator()(const VirtualCFG::CFGNode& cfgNode) const
-        { return true; }
-};
-
-struct InterestingCFGNodeFilter
-{
-        bool operator()(const VirtualCFG::CFGNode& cfgNode) const
-        { return cfgNode.isInteresting(); }
-};
-
-//! A full CFG without any filtered nodes.
-typedef CFG<FullCFGNodeFilter> FullCFG;
-
-
-//! A filtered CFG which only contains interesting nodes and edges.
-typedef CFG<InterestingCFGNodeFilter> FilteredCFG;
-
-
-
-
-
-/********************************************************************/
-//      The concept required to be fulfilled by CFGNodeFilter is
-//
-//      struct CFGNodeFilter
-//      {
-//              bool operator()(const VirtualCFG::CFGNode& cfgNode) const;
-//      };
-//
-/********************************************************************/
-
-//! A class holding a Control Flow Graph.
-        
-template <class CFGNodeFilter>
-class CFG : public boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, 
-                boost::shared_ptr<VirtualCFG::FilteredCFGNode<CFGNodeFilter> >,
-                boost::shared_ptr<VirtualCFG::FilteredCFGEdge<CFGNodeFilter> > >
-{
-        typedef typename boost::graph_traits<CFG<CFGNodeFilter> > GraphTraits;
-
-public:
-    typedef VirtualCFG::FilteredCFGNode<CFGNodeFilter> CFGNodeType;
-        typedef VirtualCFG::FilteredCFGEdge<CFGNodeFilter> CFGEdgeType;
-
-        typedef boost::shared_ptr<CFGNodeType> CFGNodePtr;
-        typedef boost::shared_ptr<CFGEdgeType> CFGEdgePtr;
-
-    typedef typename GraphTraits::vertex_descriptor Vertex;
-        typedef typename GraphTraits::edge_descriptor Edge;
-
-        typedef std::map<Vertex, Vertex> VertexVertexMap;
-        //! The entry node.
-        Vertex entry_;
-
-        //! The exit node.
-        Vertex exit_;
-
-
-protected:
-
-        //! The function definition of this CFG.
-        SgFunctionDefinition* funcDef_;
-
-
-        //! A map from a CFG node to the corresponding vertex
-        std::map<CFGNodeType, Vertex> nodesToVertices_;
-
-    //! The dominator tree of this CFG.
-    VertexVertexMap dominatorTree_;
-
-    //! The postdominator tree of this CFG.
-    VertexVertexMap postdominatorTree_;
-
-public:
-        std::map<CFGNodeType, Vertex> getNodeVert() {
-            return nodesToVertices_;
-        }
-
-        //! The default constructor.
-        CFG()
-        :       funcDef_(NULL),
-                entry_(GraphTraits::null_vertex()),
-                exit_(GraphTraits::null_vertex())
-        {
-        }
-
-        //! The constructor building the CFG.
-        explicit CFG(SgFunctionDefinition* funcDef)
-        :       funcDef_(funcDef),
-                entry_(GraphTraits::null_vertex()),
-                exit_(GraphTraits::null_vertex())
-        {
-                build(funcDef);
-        }
-
-        //! Build the actual CFG for the given function.
-        void build(SgFunctionDefinition* funcDef);
-
-        //! Get the function definition of this CFG.
-        SgFunctionDefinition* getFunctionDefinition() const
-        { return funcDef_; }
-
-        //! Get the entry node of the CFG
-        const Vertex& getEntry() const
-        { return entry_; }
-
-        //! Get the exit node of the CFG
-        const Vertex& getExit() const
-        { return exit_; }
-
-        //! Build the dominator tree of this CFG.
-        //! @returns A map from each node to its immediate dominator.
-        const VertexVertexMap& getDominatorTree();
-
-        //! Build the postdominator tree of this CFG.
-        const VertexVertexMap& getPostdominatorTree();
-
-        //! Build a reverse CFG.
-        CFG<CFGNodeFilter> makeReverseCopy() const;
-
-        //! Output the graph to a DOT file.
-        void toDot(const std::string& filename) const;
-
-        //! Get all CFG nodes in this graph.
-        std::vector<CFGNodePtr> getAllNodes() const;
-
-        //! Get all CFG edges in this graph.
-        std::vector<CFGEdgePtr> getAllEdges() const;
-
-        //! Given a CFG node, returns the corresponding vertex in the graph.
-        //! Returns Vertex::null_vertex() if the given node is not in the graph
-        Vertex getVertexForNode(const CFGNodeType &node) const;
-
-    //! Return if this CFG is reducible (if all loops are natural loops, the
-    //! CFG is reducible).
-    bool isReducible() const { return true; }
-
-    //! Get all back edges in the CFG. A back edge is one whose target dominates its source.
-    std::vector<Edge> getAllBackEdges();
-
-    //! Get all loop headers in this CFG. A natural loop only has one header.
-    std::vector<Vertex> getAllLoopHeaders();
-
-protected:
-
-        //! A internal funtion which builds the actual CFG (boost::graph).
-        void buildCFG(const CFGNodeType& node,
-                        std::map<CFGNodeType, Vertex>& nodesAdded,
-                        std::set<CFGNodeType>& nodesProcessed);
-
-        //! Find the entry and exit of this CFG and set the corresponding members.
-        void setEntryAndExit();
-
-        //! This function helps to write the DOT file for vertices.
-        void writeGraphNode(std::ostream& out, const Vertex& node) const
-        {
-                writeCFGNode(out, *(*this)[node]);
-                //VirtualCFG::printNode(out, (*this)[node]);
-        }
-
-        //! This function helps to write the DOT file for edges.
-        void writeGraphEdge(std::ostream& out, const Edge& edge) const
-        {
-                writeCFGEdge(out, *(*this)[edge]);
-                //VirtualCFG::printEdge(out, (*this)[edge], true);
-        }
-
-        //! This class is used to copy vertices when calling copy_graph().
-        struct VertexCopier
-        {
-                VertexCopier(const CFG<CFGNodeFilter>& g1, CFG<CFGNodeFilter>& g2)
-                : cfg1(g1), cfg2(g2) {}
-
-                void operator()(const Vertex& v1, Vertex& v2) const
-                { cfg2[v2] = cfg1[v1]; }
-                
-                const CFG<CFGNodeFilter>& cfg1;
-                CFG<CFGNodeFilter>& cfg2;
-        };
-
-        //! This class is used to copy edges when calling copy_graph().
-        struct EdgeCopier
-        {
-                EdgeCopier(const CFG<CFGNodeFilter>& g1, CFG<CFGNodeFilter>& g2)
-                : cfg1(g1), cfg2(g2) {}
-
-                void operator()(const Edge& e1, Edge& e2) const
-                { cfg2[e2] = cfg1[e1]; }
-
-                const CFG<CFGNodeFilter>& cfg1;
-                CFG<CFGNodeFilter>& cfg2;
-        };
-};
-
-
-
-template <class CFGNodeFilter>
-void CFG<CFGNodeFilter>::toDot(const std::string& filename) const
-{
-        std::ofstream ofile(filename.c_str(), std::ios::out);
-        boost::write_graphviz(ofile, *this,
-                        boost::bind(&CFG<CFGNodeFilter>::writeGraphNode, this, ::_1, ::_2),
-                        boost::bind(&CFG<CFGNodeFilter>::writeGraphEdge, this, ::_1, ::_2));
-}
-
-template <class CFGNodeFilter>
-void CFG<CFGNodeFilter>::build(SgFunctionDefinition* funcDef)
-{
-        ROSE_ASSERT(funcDef);
-        funcDef_ = funcDef;
-
-        // The following two variables are used to record the nodes traversed.
-        nodesToVertices_.clear();
-        std::set<CFGNodeType> nodesProcessed;
-
-        // Remove all nodes and edges first.
-        this->clear();
-        entry_ = GraphTraits::null_vertex();
-        exit_ = GraphTraits::null_vertex();
-
-        buildCFG(CFGNodeType(funcDef->cfgForBeginning()), nodesToVertices_, nodesProcessed);
-
-        // Find the entry and exit of this CFG.
-        setEntryAndExit();
-
-        ROSE_ASSERT(isSgFunctionDefinition((*this)[entry_]->getNode()));
-        ROSE_ASSERT(isSgFunctionDefinition((*this)[exit_]->getNode()));
-}
-
-template <class CFGNodeFilter>
-void CFG<CFGNodeFilter>::setEntryAndExit()
-{
-    for (Vertex v: boost::vertices(*this))
-        {
-                CFGNodePtr node = (*this)[v];
-                if (isSgFunctionDefinition(node->getNode()))
-                {
-                        if (node->getIndex() == 0)
-                                entry_ = v;
-                        else if (node->getIndex() == 3)
-                                exit_ = v;
-                }
-        }
-
-        //In graphs with an infinite loop, we might never get to the end vertex
-        //In those cases, we need to add it explicitly
-        if (exit_ == GraphTraits::null_vertex())
-        {
-                std::cerr << "This function may contain an infinite loop "
-                                "inside so that its CFG cannot be built" << std::endl;
-                exit_ = add_vertex(*this);
-                (*this)[exit_] = CFGNodePtr(new CFGNodeType(funcDef_->cfgForEnd()));
-        }
-
-        ROSE_ASSERT(entry_ != GraphTraits::null_vertex());
-        ROSE_ASSERT(exit_ != GraphTraits::null_vertex());
-}
-
-template <class CFGNodeFilter>
-void CFG<CFGNodeFilter>::buildCFG(
-                const CFGNodeType& node,
-                std::map<CFGNodeType, Vertex>& nodesAdded,
-                std::set<CFGNodeType>& nodesProcessed)
-{
-        ROSE_ASSERT(node.getNode());
-
-        if (nodesProcessed.count(node) > 0)
-                return;
-        nodesProcessed.insert(node);
-
-        typename std::map<CFGNodeType, Vertex>::iterator iter;
-        bool inserted;
-        Vertex from, to;
-
-        // Add the source node.
-        const CFGNodeType& src = node;
-        ROSE_ASSERT(src.getNode());
-
-        boost::tie(iter, inserted) = nodesAdded.insert(std::make_pair(src, Vertex()));
-
-        if (inserted)
-        {
-                from = add_vertex(*this);
-                (*this)[from] = CFGNodePtr(new CFGNodeType(src));
-                iter->second = from;
-        }
-        else
-        {
-                from = iter->second;
-        }
-
-        std::vector<CFGEdgeType> outEdges = node.outEdges();
-
-        for(const CFGEdgeType& cfgEdge: outEdges)
-        {
-                // For each out edge, add the target node.
-                CFGNodeType tar = cfgEdge.target();
-                ROSE_ASSERT(tar.getNode());
-
-                boost::tie(iter, inserted) = nodesAdded.insert(std::make_pair(tar, Vertex()));
-
-                if (inserted)
-                {
-                        to = add_vertex(*this);
-                        (*this)[to] = CFGNodePtr(new CFGNodeType(tar));
-                        iter->second = to;
-                }
-                else
-                {
-                        to = iter->second;
-                }
-
-                // Add the edge.
-                Edge edge = add_edge(from, to, *this).first;
-                (*this)[edge] = CFGEdgePtr(new CFGEdgeType(cfgEdge));
-
-                // Build the CFG recursively.
-                buildCFG(tar, nodesAdded, nodesProcessed);
-        }
-}
-
-template <class CFGNodeFilter>
-const typename CFG<CFGNodeFilter>::VertexVertexMap& CFG<CFGNodeFilter>::getDominatorTree()
-{
-    if (!dominatorTree_.empty())
-        return dominatorTree_;
-
-        boost::associative_property_map<VertexVertexMap> domTreePredMap(dominatorTree_);
-
-        // Here we use the algorithm in boost::graph to build a map from each node to its immediate dominator.
-        boost::lengauer_tarjan_dominator_tree(*this, entry_, domTreePredMap);
-        return dominatorTree_;
-}
-
-template <class CFGNodeFilter>
-const typename CFG<CFGNodeFilter>::VertexVertexMap& CFG<CFGNodeFilter>::getPostdominatorTree()
-{
-    if (!postdominatorTree_.empty())
-        return postdominatorTree_;
-    
-        boost::associative_property_map<VertexVertexMap> postdomTreePredMap(postdominatorTree_);
-
-        // Here we use the algorithm in boost::graph to build an map from each node to its immediate dominator.
-        boost::lengauer_tarjan_dominator_tree(boost::make_reverse_graph(*this), exit_, postdomTreePredMap);
-        return postdominatorTree_;
-}
-
-template <class CFGNodeFilter>
-CFG<CFGNodeFilter> CFG<CFGNodeFilter>::makeReverseCopy() const
-{
-        CFG<CFGNodeFilter> reverseCFG;
-        // The following function makes a reverse CFG copy.
-        boost::transpose_graph(*this, reverseCFG, 
-                boost::vertex_copy(VertexCopier(*this, reverseCFG)).
-                edge_copy(EdgeCopier(*this, reverseCFG)));
-
-        // Swap entry and exit.
-        reverseCFG.entry_ = this->exit_;
-        reverseCFG.exit_ = this->entry_;
-        return reverseCFG;
-}
-
-
-template <class CFGNodeFilter>
-std::vector<typename CFG<CFGNodeFilter>::CFGNodePtr>
-CFG<CFGNodeFilter>::getAllNodes() const
-{
-        std::vector<CFGNodePtr> allNodes;
-    for (Vertex v: boost::vertices(*this))
-                allNodes.push_back((*this)[v]);
-        return allNodes;
-}
-
-/*
-template <class CFGNodeFilter>
-std::vector<typename CFG<CFGNodeFilter>::CFGNodeType>
-CFG<CFGNodeFilter>::getAllNodesNoPtrs() const
-{
-        std::vector<CFGNodeType> allNodes;
-    for (Vertex v: boost::vertices(*this))
-                allNodes.push_back(&((*this)[v]));
-        return allNodes;
-}
-*/
-
-template <class CFGNodeFilter>
-std::vector<typename CFG<CFGNodeFilter>::CFGEdgePtr>
-CFG<CFGNodeFilter>::getAllEdges() const
-{
-        std::vector<CFGEdgePtr> allEdges;
-    for (const Edge& e: boost::edges(*this))
-                allEdges.push_back((*this)[e]);
-        return allEdges;
-}
-
-template <class CFGNodeFilter>
-typename CFG<CFGNodeFilter>::Vertex CFG<CFGNodeFilter>::getVertexForNode(const CFGNodeType &node) const
-{
-        typename std::map<CFGNodeType, Vertex>::const_iterator vertexIter = nodesToVertices_.find(node);
-        if (vertexIter == nodesToVertices_.end())
-                return GraphTraits::null_vertex();
-        else
-        {
-                ROSE_ASSERT(*(*this)[vertexIter->second] == node);
-                return vertexIter->second;
-        }
-}
-
-template <class CFGNodeFilter>
-std::vector<typename CFG<CFGNodeFilter>::Edge> CFG<CFGNodeFilter>::getAllBackEdges()
-{
-    std::vector<Edge> backEdges;
-
-    // If the dominator tree is not built yet, build it now.
-    getDominatorTree();
-
-    for (const Edge& e: boost::edges(*this))
-    {
-        Vertex src = boost::source(e, *this);
-        Vertex tar = boost::target(e, *this);
-
-        //Vertex v = *(dominatorTree.find(src));
-        typename VertexVertexMap::const_iterator iter = dominatorTree_.find(src);
-        while (iter != dominatorTree_.end())
-        {
-            if (iter->second == tar)
-            {
-                backEdges.push_back(e);
-                break; // break the while loop
-            }
-            iter = dominatorTree_.find(iter->second);
-        }
-    }
-
-    return backEdges;
-}
-
-template <class CFGNodeFilter>
-std::vector<typename CFG<CFGNodeFilter>::Vertex> CFG<CFGNodeFilter>::getAllLoopHeaders()
-{
-    std::vector<Edge> backEdges = getAllBackEdges();
-    std::vector<Vertex> headers;
-    for (Edge e: backEdges)
-        headers.push_back(boost::target(e, *this));
-    return headers;
-}
-
-#undef foreach
-
-} // End of namespace Backstroke
-
-
-#endif  /* BACKSTROKE_CFG_H */
diff --git a/tests/nonsmoke/functional/roseTests/astProcessingTests/processnew3Down4.C b/tests/nonsmoke/functional/roseTests/astProcessingTests/processnew3Down4.C
deleted file mode 100644
index 92f87c1a585..00000000000
--- a/tests/nonsmoke/functional/roseTests/astProcessingTests/processnew3Down4.C
+++ /dev/null
@@ -1,68 +0,0 @@
-#include <iostream>
-#include <fstream>
-#include <rose.h>
-#include <string>
-#include <err.h>
-#include "graphProcessing.h"
-#include "graphTemplate.h"
-
-
-using namespace std;
-using namespace boost;
-using namespace Rose;
-
-using namespace Backstroke;
-
-struct CFGNodeFilter2
-{
-	bool operator()(const VirtualCFG::CFGNode& cfgNode) const
-	{
-		return true;
-	}
-};
-
-
-
-typedef CFG<CFGNodeFilter2> CFGforT;
-
-
-
-class visitorTraversal : public SgGraphTraversal<CFGforT>
-   {
-     public: 
-          int tltnodes;
-          virtual void analyzePath(vector<CFGforT::Vertex>& pth);
-          int pths;
-   };
-
-
-void visitorTraversal::analyzePath(vector<CFGforT::Vertex>& pth) {   
-        tltnodes += pth.size();
-        pths++;
-        std::cout << "pth" << std::endl;
-        for (int i = 0; i < pth.size(); i++) {
-            std::cout << intvertmap[pth[i]] << ", ";
-        }
-        std::cout << "end" << std::endl;
-}
-
-
-int main(int argc, char *argv[]) {
- 
-    SgProject* proj = frontend(argc,argv);
-    ROSE_ASSERT (proj != NULL); 
-    SgFunctionDeclaration* mainDefDecl = SageInterface::findMain(proj);
-    SgFunctionDefinition* mainDef = mainDefDecl->get_definition();
-    CFGforT* cfggraph = new CFGforT;
-    cfggraph->build(mainDef);
-     visitorTraversal* vis = new visitorTraversal;
-    string fileName= StringUtility::stripPathFromFileName(mainDef->get_file_info()->get_filenameString());
-    cfggraph->toDot("dotcheck.dot");
-    vis->pths = 0;
-    vis->tltnodes = 0;
-    vis->firstPrepGraph(cfggraph)
-    vis->constructPathAnalyzer(cfggraph);
-    cout << "path creation solution: " << vis->pths << std::endl;
-    cout << "total nodes traversed (including duplications): " << vis->tltnodes << std::endl;
-    return 0;
-}

From c0b190fac0d7d947de9f22655faaf8cfdadfb18b Mon Sep 17 00:00:00 2001
From: Yonghong Yan <yanyh15@gmail.com>
Date: Fri, 15 Nov 2024 01:32:07 -0500
Subject: [PATCH 30/42] remove
 src/frontend/Experimental_General_Language_Support and
 src/frontend/SageIII/sageInterface/untypedBuilder.h.C

---
 config/support-rose.m4                        |   1 -
 .../Makefile.am                               |  11 -
 .../PosInfo.C                                 |  20 -
 .../PosInfo.h                                 |  44 --
 .../Tokens.C                                  |  90 ----
 .../Tokens.h                                  |  95 ----
 .../general_language_translation.h            | 271 -----------
 .../SageIII/sageInterface/untypedBuilder.C    | 458 ------------------
 .../SageIII/sageInterface/untypedBuilder.h    |  66 ---
 9 files changed, 1056 deletions(-)
 delete mode 100644 src/frontend/Experimental_General_Language_Support/Makefile.am
 delete mode 100644 src/frontend/Experimental_General_Language_Support/PosInfo.C
 delete mode 100644 src/frontend/Experimental_General_Language_Support/PosInfo.h
 delete mode 100644 src/frontend/Experimental_General_Language_Support/Tokens.C
 delete mode 100644 src/frontend/Experimental_General_Language_Support/Tokens.h
 delete mode 100644 src/frontend/Experimental_General_Language_Support/general_language_translation.h
 delete mode 100644 src/frontend/SageIII/sageInterface/untypedBuilder.C
 delete mode 100644 src/frontend/SageIII/sageInterface/untypedBuilder.h

diff --git a/config/support-rose.m4 b/config/support-rose.m4
index b41ca8a2ab1..48b8860e950 100644
--- a/config/support-rose.m4
+++ b/config/support-rose.m4
@@ -1209,7 +1209,6 @@ src/ROSETTA/src/Makefile
 src/backend/Makefile
 src/frontend/CxxFrontend/Clang/Makefile
 src/frontend/CxxFrontend/Makefile
-src/frontend/Experimental_General_Language_Support/Makefile
 src/frontend/Makefile
 src/frontend/OpenFortranParser_SAGE_Connection/Makefile
 src/frontend/SageIII/GENERATED_CODE_DIRECTORY_Cxx_Grammar/Makefile
diff --git a/src/frontend/Experimental_General_Language_Support/Makefile.am b/src/frontend/Experimental_General_Language_Support/Makefile.am
deleted file mode 100644
index 5d18d6e436c..00000000000
--- a/src/frontend/Experimental_General_Language_Support/Makefile.am
+++ /dev/null
@@ -1,11 +0,0 @@
-include $(top_srcdir)/config/Makefile.for.ROSE.includes.and.libs
-
-AM_CPPFLAGS = $(ROSE_INCLUDES) 
-
-noinst_LTLIBRARIES = libexperimentalRoseGeneralLanguage.la
-
-libexperimentalRoseGeneralLanguage_la_SOURCES = \
-  SageTreeBuilder.C ModuleBuilder.C PosInfo.C Tokens.C
-
-noinst_HEADERS = \
-  SageTreeBuilder.h ModuleBuilder.h PosInfo.h Tokens.h
diff --git a/src/frontend/Experimental_General_Language_Support/PosInfo.C b/src/frontend/Experimental_General_Language_Support/PosInfo.C
deleted file mode 100644
index 84681090561..00000000000
--- a/src/frontend/Experimental_General_Language_Support/PosInfo.C
+++ /dev/null
@@ -1,20 +0,0 @@
-#include "sage3basic.h"
-#include "PosInfo.h"
-
-namespace Rose {
-namespace builder {
-
-PosInfo::PosInfo(SgLocatedNode* fromNode) {
-  ROSE_ASSERT(fromNode != NULL);
-  ROSE_ASSERT(fromNode->get_startOfConstruct() != NULL);
-  ROSE_ASSERT(fromNode->get_endOfConstruct()   != NULL);
-
-  startLine_ = fromNode->get_startOfConstruct()->get_line();
-  startCol_  = fromNode->get_startOfConstruct()->get_col();
-  endLine_   = fromNode->get_endOfConstruct()->get_line();
-  endCol_    = fromNode->get_endOfConstruct()->get_col();
- }
- 
-} // namespace builder
-} // namespace Rose
- 
diff --git a/src/frontend/Experimental_General_Language_Support/PosInfo.h b/src/frontend/Experimental_General_Language_Support/PosInfo.h
deleted file mode 100644
index 57d3713e774..00000000000
--- a/src/frontend/Experimental_General_Language_Support/PosInfo.h
+++ /dev/null
@@ -1,44 +0,0 @@
-#ifndef POS_INFO_H_
-#define POS_INFO_H_
-
-class SgLocatedNode;
-
-namespace Rose {
-namespace builder {
-
-class PosInfo {
-public:
-  PosInfo() : startLine_(0), startCol_(0), endLine_(0), endCol_(0) {
-  }
-
-  PosInfo(int strtLine, int strtCol, int endLine, int endCol)
-    : startLine_{strtLine}, startCol_{strtCol}, endLine_{endLine}, endCol_{endCol} {
-  }
-
-  PosInfo(SgLocatedNode* fromNode);
-
-  int  getStartLine() const     { return startLine_; }
-  int  getStartCol()  const     { return startCol_;  }
-  int  getEndLine()   const     { return endLine_;   }
-  int  getEndCol()    const     { return endCol_;    }
-
-  void setStartLine (int line)  { startLine_ = line; }
-  void setStartCol  (int col )  { startCol_  = col;  }
-  void setEndLine   (int line)  { endLine_   = line; }
-  void setEndCol    (int col )  { endCol_    = col;  }
-
-  friend std::ostream& operator<< (std::ostream &os, const PosInfo &p) {
-    os << "(" << p.startLine_ << ',' << p.startCol_
-       << "," << p.endLine_   << ',' << p.endCol_ << ")";
-    return os;
-  }
-
-protected:
-  int startLine_, startCol_;  // location (line,col) of first character ( 1 based)
-  int endLine_,   endCol_;    // location (line,col) of last  character (+1 col)
-};
-
-} // namespace builder
-} // namespace Rose
-
-#endif // POS_INFO_H_
diff --git a/src/frontend/Experimental_General_Language_Support/Tokens.C b/src/frontend/Experimental_General_Language_Support/Tokens.C
deleted file mode 100644
index 0591291c41f..00000000000
--- a/src/frontend/Experimental_General_Language_Support/Tokens.C
+++ /dev/null
@@ -1,90 +0,0 @@
-//===-- src/frontend/Experimental_General_Language_Support/Tokens.C ----*- C++ -*-===//
-//
-// Supports reading tokens from files (for now)
-//
-//===-----------------------------------------------------------------------------===//
-
-#include "Tokens.h"
-#include <iostream>
-#include <sstream>
-
-namespace Rose {
-  namespace builder {
-
-TokenStream::TokenStream(std::istringstream &is) {
-  std::vector<std::string> row(6);
-  int error = 0;
-
-  while (is.peek() != std::istream::traits_type::eof()) {
-    // Read type and line,column information
-    for (int i = 0; i < 5; i++) {
-      row[i].clear(); // clear old string
-      if ((error = getTokenElement(is,row[i])) < 0) break;
-    }
-
-    // Read lexeme
-    JovialEnum type = static_cast<JE>(std::stoi(row[0]));
-    if (!error && type == JovialEnum::comment) {
-      row[5].clear(); // clear old string
-      error = getTokenComment(is,row[5]);
-    }
-
-    if (!error) {
-      // Append the token
-      tokens_.emplace_back(Token{row});
-    }
-    else {
-      std::cerr << "TokenStream:: WARNING, error occurred, skipping row\n";
-      break;
-    }
-  }
-  next_ = 0;
-}
-
-int TokenStream::getTokenElement(std::istream &is, std::string &word) {
-  char c;
-
-  while (is.get(c)) {
-    if (c != ',') word.append(1,c);
-    else return 0; // success
-  }
-  std::cerr << "TokenStream::getTokenElement: WARNING, error finding token element\n";
-  return 1; // failure
-}
-
-int TokenStream::getTokenComment(std::istream &is, std::string &comment) {
-  char c, terminal;
-  int error = 1;
-
-  // Get comment terminal ('%' or '"' for Jovial)
-  if (is.get(terminal)) {
-    if (terminal == '%' || terminal == '"') {
-      comment.append(1,terminal);
-    }
-    error = 0;
-  }
-
-  if (!error) {
-    while (is.get(c)) {
-      comment.append(1,c);
-      if (c == terminal && is.get(c)) {
-        if (c == '\n') return 0; // success
-      }
-    }
-  }
-
-  // Report an error
-  std::cerr << "TokenStream::getTokenComment: WARNING, error finding comment, lexeme will be empty\n";
-  comment.clear();
-  return 1; // failure
-}
-
-std::ostream& operator<< (std::ostream &os, const Token &tk) {
-  os << static_cast<int>(tk.type_) << ','
-     << tk.bLine_ << ',' << tk.bCol_ << ','
-     << tk.eLine_ << ',' << tk.eCol_ << ',' << tk.lexeme_;
-  return os;
-}
-
-  } // namespace builder
-} // namespace Rose
diff --git a/src/frontend/Experimental_General_Language_Support/Tokens.h b/src/frontend/Experimental_General_Language_Support/Tokens.h
deleted file mode 100644
index c1b8ed0816d..00000000000
--- a/src/frontend/Experimental_General_Language_Support/Tokens.h
+++ /dev/null
@@ -1,95 +0,0 @@
-//===-- src/frontend/Experimental_General_Language_Support/Tokens.h ----*- C++ -*-===//
-//
-// Reads tokens from a file into a TokenStream (vector)
-//
-//===-----------------------------------------------------------------------------===//
-
-#ifndef ROSE_EXPERIMENTAL_GENERAL_TOKENS_H_
-#define ROSE_EXPERIMENTAL_GENERAL_TOKENS_H_
-
-#include <fstream>
-#include <string>
-#include <vector>
-#include <optional>
-
-namespace Rose {
-  namespace builder {
-
-enum class JovialEnum {
-  unknown = 0,
-  define = 98,
-  comment = 99
-};
-
-using JE = JovialEnum;
-
-class Token {
-public:
-
-//Need to explore C++17 move (see SageTreeBuilder::consumePrecedingComments())
-//Token(Token &&) = default;
-//Token &operator=(Token &&) = default;
-//Token(const Token &) = delete;
-//Token &operator=(const Token &) = delete;
-  Token() = delete;
-
- Token(std::vector<std::string> row)
-  : type_{JE::unknown}, bLine_{0},eLine_{0},bCol_{0},eCol_{0} {
-    if (row.size() == 6) {
-      type_ = static_cast<JE>(std::stoi(row[0]));
-      bLine_ = std::stoi(row[1]);
-      eLine_ = std::stoi(row[3]);
-      bCol_ = std::stoi(row[2]);
-      eCol_ = std::stoi(row[4]);
-      lexeme_ = row[5];
-    }
-  }
-
-  friend std::ostream& operator<< (std::ostream &os, const Token &tk);
-
-  int getStartLine() const { return bLine_; }
-  int getStartCol()  const { return bCol_;  }
-  int getEndLine()   const { return eLine_; }
-  int getEndCol()    const { return eCol_;  }
-  
-  JovialEnum getTokenType() const { return type_; }
-  const std::string & getLexeme() const { return lexeme_; }
-
-private:
-  enum JovialEnum type_; // token type
-  int bLine_, eLine_;    // beginning and ending line
-  int bCol_, eCol_;      // beginning and ending column
-  std::string lexeme_;  
-}; // Token
-
-class TokenStream {
-public:
-  TokenStream() = delete;
-  TokenStream(std::istringstream &);
-
-  std::optional<const Token&> const getNextToken() {
-    if (next_ < tokens_.size()) {
-      return std::optional<const Token&>(tokens_[next_]);
-    }
-    return std::nullopt;
-  }
-
-  std::optional<const Token&> consumeNextToken() {
-    std::optional<const Token&> nextToken{getNextToken()};
-    next_ += 1;
-    return nextToken;
-  }
-
-private:
-  std::vector<Token> tokens_;
-  int next_;
-
-  int getTokenElement(std::istream &, std::string &);
-  int getTokenComment(std::istream &, std::string &);
-};
-
-  } // namespace builder
-} // namespace Rose
-
-
-#endif // ROSE_EXPERIMENTAL_GENERAL_TOKENS_H_
diff --git a/src/frontend/Experimental_General_Language_Support/general_language_translation.h b/src/frontend/Experimental_General_Language_Support/general_language_translation.h
deleted file mode 100644
index bf0f3ac730a..00000000000
--- a/src/frontend/Experimental_General_Language_Support/general_language_translation.h
+++ /dev/null
@@ -1,271 +0,0 @@
-#ifndef GENERAL_LANGUAGE_TRANSLATION_H
-#define GENERAL_LANGUAGE_TRANSLATION_H
-
-class SgExpression;
-
-namespace LanguageTranslation
-   {
-  // Forward declarations
-     struct FormalParameter;
-     struct LocationSpecifier;
-     struct StructureSpecifier;
-
-
-     enum FunctionModifier
-        {
-           e_function_modifier_none = 0,
-
-           e_function_modifier_reentrant,
-           e_function_modifier_recursive,
-
-        // Jovial
-           e_function_modifier_definition,
-           e_function_modifier_reference,
-
-        // Fortran
-        // e_function_modifier_list,
-           e_function_modifier_elemental,
-           e_function_modifier_impure,
-           e_function_modifier_module,
-           e_function_modifier_pure,
-
-           e_function_modifier_last
-        };
-
-     enum PackingSpecifier
-        {
-           e_packing_spec_unknown = 0,
-           e_packing_spec_none,    // "N" from grammar
-           e_packing_spec_mixed,   // "M" from grammar
-           e_packing_spec_dense,   // "D" from grammar
-        };
-
-  // Enum for different types of expressions (used with untyped IR nodes).
-  //
-     enum ExpressionKind
-        {
-          e_none = 0,
-          e_unknown = 1,
-
-       // Access modifiers
-       // --------------
-          e_access_modifier_public,
-          e_access_modifier_private,
-
-       // Storage modifiers
-       // --------------
-          e_storage_modifier_contiguous,
-          e_storage_modifier_external,
-          e_storage_modifier_static,
-          e_storage_modifier_location,
-          e_storage_modifier_jovial_def,     /* SimpleDef or CompoundDef */
-          e_storage_modifier_jovial_ref,     /* SimpleRef or CompoundRef */
-
-       // Type modifiers
-       // --------------
-          e_type_modifier_list,
-          e_type_modifier_allocatable,
-          e_type_modifier_asynchronous,
-          e_type_modifier_const,
-          e_type_modifier_intent_in,
-          e_type_modifier_intent_out,
-          e_type_modifier_intent_inout,
-          e_type_modifier_intrinsic,
-          e_type_modifier_optional,
-          e_type_modifier_pointer,
-          e_type_modifier_protected,
-          e_type_modifier_round,
-          e_type_modifier_save,
-          e_type_modifier_target,
-          e_type_modifier_truncate,
-          e_type_modifier_volatile,
-          e_type_modifier_z,
-
-       // Function formal parameters
-       // --------------------------
-          e_param_binding_value,
-          e_param_binding_reference,
-          e_param_binding_result,
-
-       // Structure modifiers
-          e_struct_modifier_list,
-          e_struct_item_modifier_list,
-
-       // Operators
-       // ---------
-
-       // Assignment operator
-          e_operator_assign,
-
-       // Arithmetic operators
-          e_operator_exponentiate,
-          e_operator_concatenate,
-          e_operator_add,
-          e_operator_subtract,
-          e_operator_mod,
-          e_operator_multiply,
-          e_operator_divide,
-
-       // Logical operators
-          e_operator_and,
-          e_operator_or,
-          e_operator_xor,
-          e_operator_equiv,
-
-       // Relational operators
-          e_operator_less_than,
-          e_operator_greater_than,
-          e_operator_less_or_equal,
-          e_operator_greater_or_equal,
-          e_operator_equality,
-          e_operator_not_equal,
-          e_operator_eqv,           // equivalent for relational expressions
-          e_operator_not_eqv,       // not equivalent for relational expressions
-
-       // Unary operators
-          e_operator_unary_plus,
-          e_operator_unary_minus,
-          e_operator_unary_not,
-
-       // for optional sign
-          e_operator_unity,
-
-       // Expressions
-       // -----------
-
-          e_literalExpression,
-
-          e_function_reference,
-          e_procedure_call,
-          e_argument_list,
-          e_argument_keyword,
-
-          e_variable_reference,
-          e_array_reference,
-
-          e_case_range,
-          e_case_selector,
-
-       // Special expressions denoting array declaration type
-          e_array_shape,
-          e_explicit_shape,
-          e_assumed_or_implied_shape,
-          e_assumed_shape,
-          e_assumed_size,
-
-       // Expressions for array indexing
-          e_array_subscripts,
-          e_array_index_triplet,
-          e_section_subscripts,
-
-       // Explicitly for Jovial but try to reuse for Fortran
-          e_explicit_dimension,
-          e_star_dimension,
-
-          e_star_expression,
-
-       // Expressions for initialization (preset in Jovial)
-          e_initializer,
-          e_struct_initializer,
-
-       // Statements
-       // ----------
-
-       // General
-          e_switch_stmt,
-          e_end_switch_stmt,
-          e_case_option_stmt,
-          e_case_default_option_stmt,
-
-          e_end_proc_ref_stmt,
-          e_end_proc_def_stmt,
-
-          e_define_directive_stmt,
-
-       // Fortran specific
-          e_fortran_dimension_stmt,
-          e_fortran_import_stmt,
-
-          e_fortran_if_stmt,
-          e_fortran_if_then_stmt,
-          e_fortran_else_if_stmt,
-          e_fortran_else_stmt,
-          e_fortran_end_do_stmt,
-
-          e_fortran_do_concurrent_stmt,
-          e_fortran_concurrent_header,
-          e_fortran_concurrent_control,
-          e_fortran_concurrent_locality,
-
-          e_fortran_forall_stmt,
-          e_fortran_end_forall_stmt,
-
-          e_fortran_sync_all_stmt,
-          e_fortran_sync_images_stmt,
-          e_fortran_sync_memory_stmt,
-          e_fortran_sync_team_stmt,
-          e_fortran_lock_stmt,
-          e_fortran_unlock_stmt,
-
-          e_fortran_sync_stat_list,
-          e_fortran_sync_stat_stat,
-          e_fortran_sync_stat_errmsg,
-          e_fortran_stat_acquired_lock,
-
-       // Jovial specific
-          e_jovial_compool_stmt,
-
-       // CUDA Attributes
-       // ---------------
-          e_cuda_host,
-          e_cuda_device,
-          e_cuda_global_function,
-          e_cuda_grid_global, /* all threads within a thread group guaranteed to be coresident */
-
-          e_cuda_global,
-          e_cuda_device_memory,
-          e_cuda_managed,
-          e_cuda_constant,
-          e_cuda_shared,
-          e_cuda_pinned,
-          e_cuda_texture,
-
-          e_last
-        };
-
-      struct FormalParameter
-        {
-           FormalParameter()
-             : name(std::string("")), output(false), binding(LanguageTranslation::e_none) {} // want to use C++11 = delete
-           FormalParameter(const std::string &param_name, bool out, const ExpressionKind &param_binding)
-             : name(param_name), output(out), binding(param_binding) {}
-           std::string name;
-           bool output;
-           ExpressionKind binding;
-        };
-
-      struct LocationSpecifier {
-         LocationSpecifier() : start_bit(NULL), start_word(NULL) {}
-         LocationSpecifier(SgExpression* sbit, SgExpression* sword) : start_bit(sbit), start_word(sword) {}
-         SgExpression* start_bit;
-         SgExpression* start_word;
-      };
-
-      struct StructureSpecifier {
-         StructureSpecifier() : is_parallel(false), is_tight(false), bits_per_entry(0) {}
-         bool is_parallel;
-         bool is_tight;
-         int  bits_per_entry;
-      };
-
-      struct TableSpecifier {
-         TableSpecifier() : packing_spec(e_packing_spec_unknown) {}
-         StructureSpecifier struct_spec;
-         PackingSpecifier packing_spec;
-      };
-
-     typedef std::list<LanguageTranslation::FunctionModifier> FunctionModifierList;
-
-   } // namespace LanguageTranslation
-
-#endif
diff --git a/src/frontend/SageIII/sageInterface/untypedBuilder.C b/src/frontend/SageIII/sageInterface/untypedBuilder.C
deleted file mode 100644
index 0f73993d508..00000000000
--- a/src/frontend/SageIII/sageInterface/untypedBuilder.C
+++ /dev/null
@@ -1,458 +0,0 @@
-#include "sage3basic.h"
-
-#include "untypedBuilder.h"
-#include "general_language_translation.h"
-
-namespace UntypedBuilder {
-
-SgFile::languageOption_enum language_enum = SgFile::e_error_language;
-
-void set_language(SgFile::languageOption_enum current_language)
-{
-   language_enum = current_language;
-}
-
-
-template <class ScopeClass>
-ScopeClass* buildScope()
-{
-   return buildScope<ScopeClass>("");
-}
-
-template <class ScopeClass>
-ScopeClass* buildScope(const std::string & label)
-{
-   SgUntypedDeclarationStatementList* decl_list = new SgUntypedDeclarationStatementList();
-   ROSE_ASSERT(decl_list);
-   SageInterface::setSourcePosition(decl_list);
-
-   SgUntypedStatementList* stmt_list = new SgUntypedStatementList();
-   ROSE_ASSERT(stmt_list);
-   SageInterface::setSourcePosition(stmt_list);
-
-   SgUntypedFunctionDeclarationList* func_list = new SgUntypedFunctionDeclarationList();
-   ROSE_ASSERT(func_list);
-   SageInterface::setSourcePosition(func_list);
-
-   ScopeClass* scope = new ScopeClass(label, decl_list, stmt_list, func_list);
-   ROSE_ASSERT(scope);
-   SageInterface::setSourcePosition(scope);
-
-   return scope;
-}
-
-// Explicit instantiations for library usage
-//
-template SgUntypedScope* buildScope<SgUntypedScope>();
-template SgUntypedScope* buildScope<SgUntypedScope>(const std::string & label);
-
-template SgUntypedGlobalScope* buildScope<SgUntypedGlobalScope>();
-template SgUntypedGlobalScope* buildScope<SgUntypedGlobalScope>(const std::string & label);
-
-template SgUntypedFunctionScope* buildScope<SgUntypedFunctionScope>();
-template SgUntypedFunctionScope* buildScope<SgUntypedFunctionScope>(const std::string & label);
-
-
-SgUntypedType* buildType(SgUntypedType::type_enum type_enum, std::string name)
-{
-   SgUntypedExpression* type_kind = NULL;
-   bool has_kind = false;
-   bool is_literal = false;
-   bool is_class = false;
-   bool is_intrinsic = true;
-   bool is_constant = false;
-   bool is_user_defined = false;
-   SgUntypedExpression* char_length_expr = NULL;
-   std::string char_length;
-   bool char_length_is_string = false;
-
-   SgUntypedExprListExpression* modifiers = new SgUntypedExprListExpression();
-   ROSE_ASSERT(modifiers);
-   SageInterface::setSourcePosition(modifiers);
-
-   SgUntypedType* type = NULL;
-
-   switch(language_enum)
-    {
-      case SgFile::e_Fortran_language:
-        {
-          switch(type_enum)
-            {
-             case SgUntypedType::e_unknown:
-               {
-                 type = new SgUntypedType("UNKNOWN",type_kind,has_kind,is_literal,is_class,is_intrinsic,is_constant,
-                                          is_user_defined,char_length_expr,char_length,char_length_is_string,modifiers,type_enum);
-                 break;
-               }
-             case SgUntypedType::e_implicit:
-               {
-                 type = new SgUntypedType("IMPLICIT",type_kind,has_kind,is_literal,is_class,is_intrinsic,is_constant,
-                                          is_user_defined,char_length_expr,char_length,char_length_is_string,modifiers,type_enum);
-                 break;
-               }
-             case SgUntypedType::e_void:
-               {
-                 type = new SgUntypedType("void",type_kind,has_kind,is_literal,is_class,is_intrinsic,is_constant,
-                                          is_user_defined,char_length_expr,char_length,char_length_is_string,modifiers,type_enum);
-                 break;
-               }
-             case SgUntypedType::e_int:
-               {
-                 type = new SgUntypedType("integer",type_kind,has_kind,is_literal,is_class,is_intrinsic,is_constant,
-                                          is_user_defined,char_length_expr,char_length,char_length_is_string,modifiers,type_enum);
-                 break;
-               }
-             case SgUntypedType::e_float:
-               {
-                 type = new SgUntypedType("real",type_kind,has_kind,is_literal,is_class,is_intrinsic,is_constant,
-                                          is_user_defined,char_length_expr,char_length,char_length_is_string,modifiers,type_enum);
-                 break;
-               }
-             case SgUntypedType::e_complex:
-               {
-                 type = new SgUntypedType("complex",type_kind,has_kind,is_literal,is_class,is_intrinsic,is_constant,
-                                          is_user_defined,char_length_expr,char_length,char_length_is_string,modifiers,type_enum);
-                 break;
-               }
-             case SgUntypedType::e_bool:
-               {
-                 type = new SgUntypedType("logical",type_kind,has_kind,is_literal,is_class,is_intrinsic,is_constant,
-                                          is_user_defined,char_length_expr,char_length,char_length_is_string,modifiers,type_enum);
-                 break;
-               }
-             case SgUntypedType::e_char:
-             case SgUntypedType::e_string:
-               {
-                 type = new SgUntypedType("character",type_kind,has_kind,is_literal,is_class,is_intrinsic,is_constant,
-                                          is_user_defined,char_length_expr,char_length,char_length_is_string,modifiers,type_enum);
-                 break;
-               }
-             case SgUntypedType::e_user_defined:
-               {
-                 is_user_defined = true;
-                 is_intrinsic = false;
-                 type = new SgUntypedType(name,type_kind,has_kind,is_literal,is_class,is_intrinsic,is_constant,
-                                          is_user_defined,char_length_expr,char_length,char_length_is_string,modifiers,type_enum);
-                 break;
-               }
-             default:
-               {
-                 fprintf(stderr, "UntypedBuilder::buildType: unimplemented for Fortran type_enum %d \n", type_enum);
-                 ROSE_ABORT();  // NOT IMPLEMENTED
-               }
-            }
-          break;
-        }
-
-      default:
-        {
-          fprintf(stderr, "UntypedBuilder::buildType: unimplemented for language_enum %d \n", language_enum);
-          ROSE_ABORT();  // NOT IMPLEMENTED
-        }
-
-    } // switch(language_enum)
-
-   return type;
-}
-
-SgUntypedArrayType* buildArrayType(SgUntypedType::type_enum type_enum, SgUntypedExprListExpression* shape, int rank)
-{
-   SgUntypedExpression* type_kind = NULL;
-   bool has_kind = false;
-   bool is_literal = false;
-   bool is_class = false;
-   bool is_intrinsic = true;
-   bool is_constant = false;
-   bool is_user_defined = false;
-   SgUntypedExpression* char_length_expr = NULL;
-   std::string char_length;
-   bool char_length_is_string = false;
-
-   SgUntypedExprListExpression* modifiers = new SgUntypedExprListExpression();
-   ROSE_ASSERT(modifiers);
-   SageInterface::setSourcePosition(modifiers);
-
-   SgUntypedArrayType* type = NULL;
-
-   ROSE_ASSERT(shape != NULL);
-
-   switch(language_enum)
-    {
-      case SgFile::e_Fortran_language:
-        {
-          switch(type_enum)
-            {
-             case SgUntypedType::e_unknown:
-               {
-                 type = new SgUntypedArrayType("UNKNOWN",type_kind,has_kind,is_literal,is_class,is_intrinsic,is_constant,
-                                          is_user_defined,char_length_expr,char_length,char_length_is_string,modifiers,type_enum,
-                                          shape, rank);
-                 break;
-               }
-             case SgUntypedType::e_implicit:
-               {
-                 type = new SgUntypedArrayType("IMPLICIT",type_kind,has_kind,is_literal,is_class,is_intrinsic,is_constant,
-                                          is_user_defined,char_length_expr,char_length,char_length_is_string,modifiers,type_enum,
-                                          shape, rank);
-                 break;
-               }
-             case SgUntypedType::e_void:
-               {
-                 type = new SgUntypedArrayType("void",type_kind,has_kind,is_literal,is_class,is_intrinsic,is_constant,
-                                          is_user_defined,char_length_expr,char_length,char_length_is_string,modifiers,type_enum,
-                                          shape, rank);
-                 break;
-               }
-             case SgUntypedType::e_int:
-               {
-                 type = new SgUntypedArrayType("integer",type_kind,has_kind,is_literal,is_class,is_intrinsic,is_constant,
-                                          is_user_defined,char_length_expr,char_length,char_length_is_string,modifiers,type_enum,
-                                          shape, rank);
-                 break;
-               }
-             case SgUntypedType::e_float:
-               {
-                 type = new SgUntypedArrayType("real",type_kind,has_kind,is_literal,is_class,is_intrinsic,is_constant,
-                                          is_user_defined,char_length_expr,char_length,char_length_is_string,modifiers,type_enum,
-                                          shape, rank);
-                 break;
-               }
-             case SgUntypedType::e_bool:
-               {
-                 type = new SgUntypedArrayType("logical",type_kind,has_kind,is_literal,is_class,is_intrinsic,is_constant,
-                                          is_user_defined,char_length_expr,char_length,char_length_is_string,modifiers,type_enum,
-                                          shape, rank);
-                 break;
-               }
-             default:
-               {
-                 fprintf(stderr, "UntypedBuilder::buildArrayType: unimplemented for Fortran type_enum %d \n", type_enum);
-                 ROSE_ABORT();  // NOT IMPLEMENTED
-               }
-            }
-          break;
-        }
-
-      default:
-        {
-          fprintf(stderr, "UntypedBuilder::buildArrayType: unimplemented for language_enum %d \n", language_enum);
-          ROSE_ABORT();  // NOT IMPLEMENTED
-        }
-
-    } // switch(language_enum)
-
-   return type;
-}
-
-
-SgUntypedInitializedName*
-buildInitializedName(const std::string & name, SgUntypedType* type, SgUntypedExpression* initializer)
-{
-   ROSE_ASSERT(type);
-
-   SgUntypedInitializedName* initialized_name = new SgUntypedInitializedName(type, name);
-   ROSE_ASSERT(initialized_name);
-   SageInterface::setSourcePosition(initialized_name);
-
-   if (initializer != NULL) {
-      initialized_name->set_has_initializer(true);
-      initialized_name->set_initializer(initializer);
-   }
-
-   return initialized_name;
-}
-
-
-SgUntypedInitializedNameList*
-buildInitializedNameList(SgUntypedInitializedName* initialized_name)
-{
-   SgUntypedInitializedNameList* name_list = new SgUntypedInitializedNameList();
-   ROSE_ASSERT(name_list);
-   SageInterface::setSourcePosition(name_list);
-
-   if (initialized_name != NULL)
-      {
-      // This case works when there is only one variable
-         name_list->get_name_list().push_back(initialized_name);
-      }
-
-   return name_list;
-}
-
-
-SgUntypedVariableDeclaration*
-buildVariableDeclaration(const std::string & name, SgUntypedType* type, SgUntypedExprListExpression* attr_list, SgUntypedExpression* initializer)
-{
-   ROSE_ASSERT(type);
-   ROSE_ASSERT(attr_list);
-
-   std::string label = "";
-
-   bool has_base_type = false;
-   SgUntypedDeclarationStatement* base_type_decl = NULL;
-
-   SgUntypedInitializedName* initialized_name = buildInitializedName(name, type, initializer);
-   ROSE_ASSERT(initialized_name);
-
-   SgUntypedInitializedNameList* var_name_list = buildInitializedNameList(initialized_name);
-   ROSE_ASSERT(var_name_list);
-
-   SgUntypedVariableDeclaration*
-   variable_decl = new SgUntypedVariableDeclaration(label, type, base_type_decl, has_base_type, attr_list, var_name_list);
-   ROSE_ASSERT(variable_decl);
-   SageInterface::setSourcePosition(variable_decl);
-
-   return variable_decl;
-}
-
-SgUntypedVariableDeclaration*
-buildVariableDeclaration(const std::string & name, SgUntypedType* type, SgUntypedStructureDeclaration* base_type_decl, SgUntypedExprListExpression* attr_list, SgUntypedExpression* initializer)
-{
-   ROSE_ASSERT(type);
-   ROSE_ASSERT(base_type_decl);
-   ROSE_ASSERT(attr_list);
-
-   SgUntypedVariableDeclaration* variable_decl = buildVariableDeclaration(name, type, attr_list, initializer);
-   ROSE_ASSERT(variable_decl != NULL);
-
-   // Set the base-type declaration
-   variable_decl->set_has_base_type(true);
-   variable_decl->set_base_type_declaration(base_type_decl);
-
-   return variable_decl;
-}
-
-// Build an untyped StructureDeclaration. This version builds a contained StructureDefinition with a type name created
-// based on the declared variable name.
-SgUntypedStructureDeclaration* buildStructureDeclaration(const std::string struct_name)
-{
-   SgUntypedStructureDeclaration* struct_decl = NULL;
-   std::string struct_type_name = "";
-   bool has_body = true;
-
-   struct_decl = buildStructureDeclaration(struct_name, struct_type_name, has_body);
-   ROSE_ASSERT(struct_decl != NULL);
-
-   return struct_decl;
-}
-
-
-// Build an untyped StructureDeclaration.
-// If the has_body flag is true an untyped StructureDefinition is created.
-// Source position for the initializer and structure definition should be set after construction.
-SgUntypedStructureDeclaration* buildStructureDeclaration(const std::string struct_name,
-                                                         const std::string struct_type_name, bool has_body)
-{
-   SgUntypedStructureDeclaration* struct_decl = NULL;
-   SgUntypedStructureDefinition*  struct_def  = NULL;
-   SgUntypedExprListExpression*     modifiers = NULL;
-   SgUntypedExprListExpression*         shape = NULL;
-
-   std::string type_name = struct_type_name;
-
-   if (struct_type_name.length() < 1) {
-   // There should be a function created for this
-      type_name = "_anon_typeof_" + struct_type_name;
-   }
-
-   if (has_body) {
-      struct_def = buildStructureDefinition(type_name, has_body, /*scope*/NULL);
-      ROSE_ASSERT(struct_def != NULL);
-      SageInterface::setSourcePosition(struct_def);
-   }
-
-   modifiers = new SgUntypedExprListExpression(LanguageTranslation::e_struct_modifier_list);
-   ROSE_ASSERT(modifiers != NULL);
-   SageInterface::setSourcePosition(modifiers);
-
-// There may be a shape if a Jovial table
-   shape = new SgUntypedExprListExpression(LanguageTranslation::e_array_shape);
-   ROSE_ASSERT(shape);
-   SageInterface::setSourcePosition(shape);
-
-   std::string label = "";
-   int stmt_enum = LanguageTranslation::e_unknown;
-   struct_decl = new SgUntypedStructureDeclaration(label, stmt_enum, type_name, modifiers, shape, struct_def);
-   ROSE_ASSERT(struct_decl);
-   SageInterface::setSourcePosition(struct_decl);
-
-   return struct_decl;
-}
-
-
-// Build an untyped StructureDefinition. This version has a body and thus a scope.
-// Source position for the initializer and modifier lists and table description should be set after construction.
-SgUntypedStructureDefinition* buildStructureDefinition()
-{
-   SgUntypedStructureDefinition* struct_def = buildStructureDefinition("", /*has_body*/true, /*scope*/NULL);
-   ROSE_ASSERT(struct_def);
-
-   ROSE_ASSERT(struct_def->get_has_body() == true);
-   ROSE_ASSERT(struct_def->get_scope() != NULL);
-
-   return struct_def;
-}
-
-
-// Build an untyped StructureDefinition. This version has a type name and body/scope (default is NULL).
-// If the has_body flag is true and the scope is NULL, a scope will be created.
-// Source position for the initializer and table description should be set after construction.
-SgUntypedStructureDefinition* buildStructureDefinition(const std::string type_name, bool has_body, SgUntypedScope* scope)
-{
-   int expr_enum;
-   bool has_type_name = true;
-   SgUntypedStructureDefinition* struct_def = NULL;
-
-   if (type_name.length() == 0)
-      {
-         has_type_name = false;
-      }
-
-   if (has_body == true && scope == NULL)
-      {
-         scope = UntypedBuilder::buildScope<SgUntypedScope>();
-         ROSE_ASSERT(scope != NULL);
-      }
-
-   expr_enum = LanguageTranslation::e_struct_modifier_list;
-   SgUntypedExprListExpression* modifier_list = new SgUntypedExprListExpression(expr_enum);
-   ROSE_ASSERT(modifier_list);
-   SageInterface::setSourcePosition(modifier_list);
-
-   expr_enum = LanguageTranslation::e_struct_initializer;
-   SgUntypedExprListExpression* struct_init = new SgUntypedExprListExpression(expr_enum);
-   ROSE_ASSERT(struct_init);
-   SageInterface::setSourcePosition(struct_init);
-
-   struct_def = new SgUntypedStructureDefinition(type_name, has_type_name, has_body, struct_init, modifier_list, /*base_type*/NULL, scope);
-   ROSE_ASSERT(struct_def);
-   SageInterface::setSourcePosition(struct_def);
-
-   return struct_def;
-}
-
-
-// Build an untyped directive declaration statement (SgUntypedDirectiveDeclaration)
-SgUntypedDirectiveDeclaration* buildDirectiveDeclaration(std::string directive_string)
-{
-   int statement_enum = LanguageTranslation::e_define_directive_stmt;
-
-   SgUntypedDirectiveDeclaration* define_decl = new SgUntypedDirectiveDeclaration(statement_enum, directive_string);
-   ROSE_ASSERT(define_decl);
-   SageInterface::setSourcePosition(define_decl);
-
-   return define_decl;
-}
-
-
-SgUntypedNullExpression* buildUntypedNullExpression()
-{
-   SgUntypedNullExpression* expr = new SgUntypedNullExpression();
-   ROSE_ASSERT(expr);
-   SageInterface::setSourcePosition(expr);
-
-   return expr;
-}
-
-
-} // namespace UntypedBuilder
diff --git a/src/frontend/SageIII/sageInterface/untypedBuilder.h b/src/frontend/SageIII/sageInterface/untypedBuilder.h
deleted file mode 100644
index 70776ba4f40..00000000000
--- a/src/frontend/SageIII/sageInterface/untypedBuilder.h
+++ /dev/null
@@ -1,66 +0,0 @@
-#ifndef UNTYPED_BUILDER_H
-#define UNTYPED_BUILDER_H
-
-namespace UntypedBuilder {
-
-void set_language(SgFile::languageOption_enum language);
-
-//! Build an untyped scope including empty lists contained in the scope
-template <class ScopeClass>
-ScopeClass* buildScope();
-
-//! Build an untyped scope including empty lists contained in the scope
-template <class ScopeClass>
-ScopeClass* buildScope(const std::string & label);
-
-//! Build an untyped type
-SgUntypedType* buildType (SgUntypedType::type_enum type_enum = SgUntypedType::e_unknown, std::string name = "");
-
-//! Build an untyped array type
-SgUntypedArrayType* buildArrayType (SgUntypedType::type_enum type_enum, SgUntypedExprListExpression* shape, int rank);
-
-//! Build an untyped initialized name for the given name and type.  The initializer may be a nullptr.
-SgUntypedInitializedName* buildInitializedName(const std::string & name, SgUntypedType* type, SgUntypedExpression* initializer = NULL);
-
-//! Build an untyped initialized name list with potentially one name. The list will be empty if the initialized name parameter is a nullptr.
-SgUntypedInitializedNameList* buildInitializedNameList(SgUntypedInitializedName* initialized_name = NULL);
-
-//! Build a variable declaration for only one variable with the given name and type.
-SgUntypedVariableDeclaration* buildVariableDeclaration(const std::string & name, SgUntypedType* type,
-                                                       SgUntypedExprListExpression* attr_list,
-                                                       SgUntypedExpression* initializer = NULL);
-
- //! Build a variable declaration for only one variable with the given name and base-type declaration.
-SgUntypedVariableDeclaration* buildVariableDeclaration(const std::string & name, SgUntypedType* type,
-                                                       SgUntypedStructureDeclaration* base_type_decl,
-                                                       SgUntypedExprListExpression* attr_list,
-                                                       SgUntypedExpression* initializer = NULL);
-
-//! Build an untyped StructureDefinition. This version has a body and thus a scope.
-//! Source position for the initializer and modifier lists and table description should be set after construction.
-SgUntypedStructureDefinition* buildStructureDefinition();
-
-//! Build an untyped StructureDefinition. This version has a type name and body/scope (default is NULL).
-//! If the has_body flag is true and the scope is NULL, a scope will be created.
-//! Source position for the initializer and table description should be set after construction.
-SgUntypedStructureDefinition* buildStructureDefinition(const std::string type_name, bool has_body=false, SgUntypedScope* scope=NULL);
-
-//! Build an untyped StructureDeclaration. This version builds a contained StructureDefinition with a type name created
-//! based on the declared variable name.
-SgUntypedStructureDeclaration* buildStructureDeclaration(const std::string struct_name);
-
-//! Build an untyped StructureDeclaration.
-//! If the has_body flag is true an untyped StructureDefinition is created.
-//! Source position for the initializer and structure definition should be set after construction.
-SgUntypedStructureDeclaration* buildStructureDeclaration(const std::string struct_name,
-                                                         const std::string struct_type_name, bool has_body=false);
-
-//! Build an untyped directive declaration statement (SgUntypedDirectiveDeclaration)
-SgUntypedDirectiveDeclaration* buildDirectiveDeclaration(std::string directive_string);
-
-//! Build a null expression, set file info as the default one
-ROSE_DLL_API SgUntypedNullExpression* buildUntypedNullExpression();
-
-}  // namespace UntypedBuilder
-
-#endif

From 07eaad017e55886436f567e2a6071c0a99f5bb90 Mon Sep 17 00:00:00 2001
From: Yonghong Yan <yanyh15@gmail.com>
Date: Sat, 16 Nov 2024 00:08:27 -0500
Subject: [PATCH 31/42] cleaning up doxygen-based doc systems, still not yet
 finish

---
 config/support-rose.m4                    |    1 -
 docs/CMakeLists.txt                       |   38 +-
 docs/Makefile.am                          |   17 +-
 docs/Rose/BinaryTutorial.dox              |  434 ----
 docs/Rose/CMakeLists.txt                  |    2 +-
 docs/Rose/Makefile.am                     |   11 -
 docs/Rose/Tutorial/CMakeLists.txt         |    4 +-
 docs/Rose/Tutorial/Makefile.am            |    7 +-
 docs/Rose/Tutorial/binaryAnalysis.tex     |  347 ---
 docs/Rose/Tutorial/binaryConstruction.tex |  416 ---
 docs/Rose/Tutorial/dwarfDebugSupport.tex  |  179 --
 docs/Rose/Tutorial/roseHPCT.tex           |  496 ----
 docs/Rose/Tutorial/tutorial.tex.in        |   14 -
 docs/Rose/UPCsupport.tex                  |  432 ----
 docs/Rose/binaryAnalysis.tex              |  486 ----
 docs/Rose/documents.html                  |    5 -
 docs/Rose/projects.html                   |   66 -
 docs/Rose/rose.cfg.in                     | 2797 ++++++++++++--------
 docs/Rose/roseQtWidgets.doxygen.in        | 1254 ---------
 docs/Rose/rose_exam_1.tex                 |   19 -
 docs/Rose/sage.cfg.in                     | 2867 ++++++++++++++++-----
 21 files changed, 4014 insertions(+), 5878 deletions(-)
 delete mode 100644 docs/Rose/BinaryTutorial.dox
 delete mode 100644 docs/Rose/Tutorial/binaryAnalysis.tex
 delete mode 100644 docs/Rose/Tutorial/binaryConstruction.tex
 delete mode 100644 docs/Rose/Tutorial/dwarfDebugSupport.tex
 delete mode 100644 docs/Rose/Tutorial/roseHPCT.tex
 delete mode 100644 docs/Rose/UPCsupport.tex
 delete mode 100644 docs/Rose/binaryAnalysis.tex
 delete mode 100644 docs/Rose/projects.html
 delete mode 100644 docs/Rose/roseQtWidgets.doxygen.in

diff --git a/config/support-rose.m4 b/config/support-rose.m4
index 48b8860e950..8a068ecb22b 100644
--- a/config/support-rose.m4
+++ b/config/support-rose.m4
@@ -1184,7 +1184,6 @@ docs/Rose/leftmenu.html
 docs/Rose/manual.tex
 docs/Rose/rose-install-demo.cfg
 docs/Rose/rose.cfg
-docs/Rose/roseQtWidgets.doxygen
 docs/Rose/sage.cfg
 docs/testDoxygen/Makefile
 docs/testDoxygen/test.cfg
diff --git a/docs/CMakeLists.txt b/docs/CMakeLists.txt
index f68f0994b4c..fd85a65dcfa 100644
--- a/docs/CMakeLists.txt
+++ b/docs/CMakeLists.txt
@@ -1,38 +1,6 @@
 
-include_directories(${KDE4_INCLUDES} ${KDE4_INCLUDE_DIR} ${QT_INCLUDES} )
-
 add_subdirectory(Rose)
+# add_subdirectory(Rosetta)
+# add_subdirectory(testDoxygen)
 
-message(STATUS "${CMAKE_CURRENT_SOURCE_DIR}: skipped subdir $(DEVELOPER_DISTRIBUTION_DIRECTORY)")
-
-########### install files ###############
-
-
-
-
-#original Makefile.am contents follow:
-
-#
-## DQ (7/24/2008): Only the developer version needs the test directory specific to Doxygen support
-## JJW (8/3/2008): This line will be removed in binary distributions
-#DEVELOPER_DISTRIBUTION_DIRECTORY = testDoxygen
-#
-## Later we will add ROSETTA documentation here ...
-## SUBDIRS = Rose Rosetta testDoxygen
-#
-## DQ (9/11/2006): Removed Rosetta directory, an internal tool not documented 
-## within ROSE for use externally.
-## SUBDIRS = Rose Rosetta testDoxygen
-## SUBDIRS = Rose testDoxygen
-#SUBDIRS = Rose $(DEVELOPER_DISTRIBUTION_DIRECTORY)
-#
-## New rule to simplify generation of documentation (we want to avoid using the
-## automake generated "docs" rule because the generation of documentation is
-## dependent upon separate tools which the user might not have available
-## (true for bothe the LaTeX and html documentation).
-## documentation:
-#docs:
-#	@echo "    Generate all possible documentation cd Rose; make documentation;"
-#	@cd Rose; $(MAKE) docs;
-#
-#EXTRA_DIST =
+message(STATUS "${CMAKE_CURRENT_SOURCE_DIR}: skipped subdir Rosetta and testDoxygen")
\ No newline at end of file
diff --git a/docs/Makefile.am b/docs/Makefile.am
index 29f9f33aaaa..6f005587b37 100644
--- a/docs/Makefile.am
+++ b/docs/Makefile.am
@@ -1,22 +1,7 @@
-
-# DQ (7/24/2008): Only the developer version needs the test directory specific to Doxygen support
-# JJW (8/3/2008): This line will be removed in binary distributions
-DEVELOPER_DISTRIBUTION_DIRECTORY = testDoxygen
-
-# Later we will add ROSETTA documentation here ...
-# SUBDIRS = Rose Rosetta testDoxygen
-
-# DQ (9/11/2006): Removed Rosetta directory, an internal tool not documented 
-# within ROSE for use externally.
 # SUBDIRS = Rose Rosetta testDoxygen
 # SUBDIRS = Rose testDoxygen
-SUBDIRS = Rose $(DEVELOPER_DISTRIBUTION_DIRECTORY)
+SUBDIRS = Rose 
 
-# New rule to simplify generation of documentation (we want to avoid using the
-# automake generated "docs" rule because the generation of documentation is
-# dependent upon separate tools which the user might not have available
-# (true for bothe the LaTeX and html documentation).
-# documentation:
 docs:
 	@echo "    Generate all possible documentation cd Rose; make documentation;"
 	@cd Rose; $(MAKE) docs;
diff --git a/docs/Rose/BinaryTutorial.dox b/docs/Rose/BinaryTutorial.dox
deleted file mode 100644
index 55f36a6cf9f..00000000000
--- a/docs/Rose/BinaryTutorial.dox
+++ /dev/null
@@ -1,434 +0,0 @@
-// -*- c++ -*-
-
-namespace Rose {
-namespace BinaryAnalysis {
-
-/** @page binary_tutorial Binary analysis tutorial
- *
- *  Getting started guide for binary analysis.
- *
- *  @section bintut_why Why binary analysis?
- *
- *  ROSE was originally designed as a source-to-source analysis and transformation system, but it turns out that parsing and
- *  analyzing a binary specimen shares many of the same basic ideas:
- *
- *  @li A binary specimen usually lives in a container that describes areas of memory, symbols, and other things needed when
- *      the specimen is executed or linked. These various containers (executables, libraries, object files, core dumps) can be
- *      parsed by a ROSE frontend and result in an abstract syntax tree (AST) much like parsing of source code.
- *
- *  @li The machine instructions of a binary specimen can be parsed an have semantics similar to statements in a source
- *      language. They also result in abstract syntax trees.
- *
- *  @li Data areas in the specimen can be parsed and are similar to initialized data in a source language. These also become
- *      abstract syntax trees.
- *
- *  @li %Analysis can be performed on an intermediate representation (IR) for both binaries and source code. One such
- *      intermediate representation is the abstract syntax tree.
- *
- *  @li Transformations modify the AST and the resulting AST can be "unparsed" to create a new binary specimen, much like
- *      unparsing transformed source code results in a new implementation.
- *
- *  Of course there are also many differences between source code and binary specimens, but ROSE is situated in the unique
- *  position of being able to process both.  On the one hand, it can operate on a specimen for which no source code is
- *  available, and on the other it can perform analysis and transformations where both source and binary are available at
- *  once.
- *
- *
- *
- *
- *  @section bintut_features What binary analysis features are available?
- * 
- *  ROSE can parse a variety of binary inputs. It can parse executable formats such as Linux ELF executables, shared libraries,
- *  core dumps, object files, and library archives; and Microsoft Windows PE and DOS executables and libraries. It can parse
- *  memory initialization formats such as Motorola S-Records, Intel HEX files, and raw memory dumps. It can analyze running or
- *  paused programs on Linux. ROSE can also analyze combinations of these formats&emdash;such as an ELF file extended by
- *  providing additional initialized memory from an S-Record file&emdash;and has a mini command-line language for specifying
- *  this for all binary analysis tools.
- *
- *  The ROSE disassembler uses a hybrid linear sweep and recursive descent approach that handles things like overlapping
- *  instructions (on architectures where that's possible), interleaved functions, rewritten execution flow, and more.  ROSE has
- *  instruction decoders for ARM, AMD64 (x86_64), Intel x86, MIPS, Motorola 68k, and PowerPC (32- and 64-bit). ROSE is designed
- *  so that most analysis is architecture independent.
- *
- *  ROSE understands semantics for common subsets of AMD64, Intel x86, Motorola 68k, and PowerPC (32- and 64-bit) and can
- *  therefore reason about how execution of instructions affects a machine's state. It can perform this reasoning symbolically,
- *  using only concrete values, using sets of intervals of concrete values, and many more special-purpose domains. If an
- *  Satisfiability Modulo Theory (SMT) solver is available, ROSE can use it to increase the fidelity of its analyses, including
- *  reasoning that's employed during the disassembly phase.
- *
- *  ROSE is able to construct control flow graphs and call graphs and has a number of pre-built analysis capabilities such as
- *  tainted flow analysis, edit distances, code statistics, memory maps, reasoning about register interactions, address usage
- *  maps, execution paths and their feasibility, generic inlining and interprocedural data-flow, no-op sequence detection,
- *  opaque predicate detection, algorithmic CFG rewriting, calling convention detection, function may-return analysis, address
- *  labeling passes, thunk detection and manipulating, switch statement analysis, interrupt vector processing, overlapping
- *  instructions, cross referencing, function stack delta analysis, register and memory usage analysis, magic numbers, static
- *  and dynamic string decoding, control flow dominance, pointer detection, DWARF parsing, library identification, etc.
- *
- *  %Analysis results are available in a number of formats, depending on the analysis: through various APIs, decoration of the
- *  abstract syntax tree or control flow graph, commentary in assembly listings, databases, or to a certain extent as a new
- *  translated binary specimen.
- *
- *  This document only attempts to describe a few of the easiest features to get you started.
- *
- *
- *
- *
- *  @section bintut_config Installing and confguring ROSE for binary analysis
- *
- *  The binary analysis features have a large number of software dependencies beyond what the source-to-source side of ROSE
- *  uses, but fortunately all of them are optional.  If a software dependency is not available then the analysis that uses it
- *  is simply not available. In a few cases cases the analysis can use a different dependency or a slower or less accurate
- *  implementation.  See @ref installation for instructions on how to install ROSE.  ROSE must be configured with "binaries"
- *  being one of the "--enable-languages" values.
- *
- *
- *
- *
- *  @section bintut_helloworld Hello, World!
- *
- *  Every system needs a basic "Hello, World!" example, so here's that example for binary analysis within the ROSE
- *  framework. It parses a specimen from a variety of formats (see its "--help" output), then disassembles the instructions
- *  optionally using instruction semantics to help drive the disassembly, then partitions the instructions into functional
- *  units, and finally displays an assembly listing.
- *
- *  @snippet binaryHelloWorld.C rose include
- *
- *  All programs start by including the main ROSE include file that declares most things that are common to source and binary
- *  analysis. This must be the first ROSE header to be included.
- *
- *  @snippet binaryHelloWorld.C other includes
- *
- *  ROSE's binary components are declared in individual header files that can only be included after including "rose.h".  The
- *  binary headers themselves can be included in any order (after rose.h) since each header includes those other headers on
- *  which it depends.  The binary analysis headers usually have the same names as the primary class they contain.
- *
- *  @snippet binaryHelloWorld.C commandline
- *
- *  The binary analysis uses a different command-line processor than most of the rest of ROSE because the command-line options
- *  for these tools don't typically interact with a compiler and therefore don't need to parse the host of compiler switches
- *  that the source tools need to recognize.  This also frees the binary tool's command-line parser to be able to generate Unix
- *  man pages on the fly.  For instance, if you invoke this tool with "--help" (or just "-h") you should see quite lengthy
- *  documentation about how to invoke the tool and what all its switches mean.  A tool more advanced than "Hello, World!" can
- *  modify the command-line parser.
- *
- *  @snippet binaryHelloWorld.C disassembly
- *
- *  ROSE divides disassembly into two phases. Within ROSE, a @ref Disassembler is responsible for parsing the bytes of a single
- *  machine instruction and turning them into an abstract syntax tree, while the @ref Partitioner2 namespace contains the
- *  machinery for driving disassembly.  The partitioner partitions the specimen's memory image into parts that are either
- *  instructions or data (actually, "partitioner" is a bit of a misnomer since instructions and data can also overlap, although
- *  they seldom do in practice).
- *
- *  The Partitioner2 namespace contains many classes, but @ref Partitioner2::Engine "Engine" and @ref Partitioner2::Partitioner
- *  "Partitioner" are the two most important classes. The @ref Partitioner2::Engine "Engine" is used to drive the disassembly
- *  process and create a @ref Partitioner2::Partitioner "Partitioner", which holds the results in data structures that have
- *  better time complexities than an AST when it comes to most forms of analysis.  In this example, we are invoking the @ref
- *  Partitioner2::Engine::frontend "Engine::frontend", which is similar in nature to ROSE's global @ref ::frontend in that it
- *  does everything necessary to make ROSE ready to do analysis: it parses, loads, disassembles, partitions, runs basic
- *  analysis, and checks consistency. In the end, it returns an abstract syntax tree (AST) instead of a @ref
- *  Partitioner2::Partitioner "Partitioner".
- *
- *  AST nodes in ROSE all begin with the letters "Sg" (from "Sage"). Those nodes that are specific to binary analysis begin
- *  with "SgAsm" (from "Sage assembly").  Within source code analysis, source files combine to form a single @ref SgProject
- *  node, and the same is often true with binary analysis also.  For specimens that have a container, like Linux ELF and
- *  Windows PE files, the AST has two large subtrees: one subtree describes the containers (there may be more than one), and
- *  another subtree describes the instructions organized into interpretation subtrees (@ref SgAsmInterpretation).
- *  Interpretations organize instructions into coherent sets, such as the PE32 and DOS subcomponents of a Windows PE
- *  file. However not all specimen formats have containers, in which case the AST is abbreviated and contains only the
- *  instructions rooted at a "global block" (SgAsmBlock).
- *
- *  @snippet binaryHelloWorld.C unparsing
- *
- *  Now that an abstract syntax tree has been created we can "unparse" it. Unparsing in a binary is slightly different
- *  than unparsing source code. Binary specimens are usually not transformed like source code, so the unparser for a binary
- *  generates a human-readable pseudo-assembly listing instead.  We could have also called the global @ref ::backend (same as
- *  source code) which would have produced a number of output files including a new executable, but backend only works on
- *  SgProject nodes which might not be present (see above). Note that there are better ways to obtain an unparser, and we'll
- *  see them later.
- *
- *  Here's the entire "Hello, World!" program:
- *
- *  @includelineno binaryHelloWorld.C
- *
- *
- *
- *  @section bintut_compile Compiling programs that use ROSE
- *
- *  To compile this program you'll want to use the same compiler, preprocessor switches, compiler switches, and loader switches
- *  as are used when compiling ROSE.  This is important! Since C++ has no official, documented application binary interface,
- *  mixing libraries compiled with different compilers, compiler versions, compiler optimization levels, or even other
- *  seemingly benign compiler switches is not guaranteed to work.  The easiest way to compile the above example is to change
- *  directories to <code>$ROSE_BUILD/tutorial</code>, where $ROSE_BUILD is the top of your build tree, and run <code>make
- *  binaryHelloWorld</code>. Similar commands will work for the other examples in this tutorial.
- *
- *  On the other hand, if you've already installed the ROSE library and blown away your build tree, or if you're writing your
- *  own programs that use ROSE, you won't be able to leverage ROSE's own build system to compile your program, and you probably
- *  have no idea what compiler command was used to compile ROSE. Fear not, ROSE installed a "rose-config.cfg" file that has the
- *  information you need, and in a format that can be included directly into GNU make files. See @ref tooldev for an example
- *  Makefile.
- *
- *
- *
- *  @section bintut_fcfg Generating a function control flow graph.
- *
- *  This example shows how to load a specimen into analysis space and generate a control flow graph for each function. First we
- *  include @c rose.h and then any additional binary analysis header files:
- *
- *  @snippet binaryFunctionCfg.C prologue
- *
- *  Then, in the @c main program, we create a disassembling and partitioning engine and use it to parse the command-line. This
- *  allows our tool to easily support the multitude of partitioner settings and container formats. The command-line parser and
- *  its documentation is easily customizable for more advanced tools, but the following works fine for this tool:
- *
- *  @snippet binaryFunctionCfg.C setup
- *
- *  The "mlog[FATAL]" in the previous code uses ROSE's diagnostics facility, a large set of coordinated streams for different
- *  software components and message severity levels, all of which can be controlled from the command-line.
- *
- *  Next, now that the engine is configured and we know the name(s) or resources for the specimen, we can parse the specimen
- *  container, load the specimen into memory, disassemble, and discover functions. The results are stored in a @ref
- *  Partitioner2::Partitioner "Partitioner" object:
- *
- *  @snippet binaryFunctionCfg.C partition
- *
- *  Finally, we'll iterate over those functions to create function control flow graphs and print each graph.  The @ref
- *  Partitioner2::Partitioner::cfg "cfg" method returns a const reference to a global control flow graph, which normally serves
- *  as the starting point for many analyses. But in this case, we want only the subgraph that represents an individual
- *  function, so we copy the global CFG and then remove those vertices and edges that are uninteresting:
- *
- *  @snippet binaryFunctionCfg.C function cfg
- *
- *  In the above code, the @ref Partitioner2::ControlFlowGraph is a specialization of @ref Sawyer::Graph, which is a generic
- *  yet easy-to-use graph implementation with very good time complexity for most operations. So the previous "for" loop has
- *  linear time complexity with respect to the total number of vertices and edges.
- *
- *  The @ref Partitioner2::DataFlow namespace has a @ref Partitioner2::DataFlow::buildDfCfg "buldDfCfg" function that creates a
- *  slightly different kind of control flow graph--one that's more useful for data-flow--which also permits intra- and
- *  inter-procedural analysis based on user criteria.
- *
- *  Here's the entire program:
- *
- *  @includelineno binaryFunctionCfg.C
- *
- *
- *
- *  @section bintut_cg Generating a binary function call graph in GraphViz format.
- *
- *  This example is similar to the @ref bintut_helloworld example, but demonstrates how to analyze function call information to
- *  construct a function call graph (CG) and then emit that graph as a GraphViz file.  The output can be converted to a picture
- *  with the "dot" command, or visualized interactively with ZGRViewer.
- *
- *  @snippet binaryCallGraph.C headers
- *
- *  As before, the "rose.h" header is the first of the ROSE headers to be included, followed by the binary analysis headers in
- *  any order.
- *
- *  @snippet binaryCallGraph.C namespaces
- *
- *  This time we'll use a few namespaces to reduce our typing. The @ref Rose::Diagnostics namespace brings into scope the
- *  diagnostic support (@c mlog and @c FATAL in this example) which is accessed through the "--log" command-line switches and
- *  controls what kinds of diagnostic output is produced. If you run this program with "--log=all" you'll get traces and
- *  debugging from all the ROSE components that use this mechanism (lots of output); see "--log=help" for info about fine
- *  tuning this.
- *
- *  @snippet binaryCallGraph.C settings
- *
- *  Many of the binary analysis tools find that holding all command-line settings in a single struct is a convenient way to
- *  organize things.  This example only has one tool-specific setting--the name of the output file for the call graph.
- *
- *  @snippet binaryCallGraph.C commandline
- *
- *  The @ref bintut_helloworld example showed the simplest way to parse a command-line, but this time we'll do something a
- *  little more complex.  This time we want to augment the command-line parser so it knows about the switches that this tool
- *  supports.  The parser itself comes from the [Sawyer](https://github.com/matzke1/sawyer) library, part of which is
- *  distributed along with the ROSE source code.  We obtain the default parser from the disassembly and partitioning engine,
- *  and augment it with a switch group containing the switches specific to this tool.  Our "--output" or "-O" switch takes a
- *  single argument, a file name that can be any string.  The "doc" property is the documentation for our switch and will
- *  appear in the Unix man page produced by running with "--help".  Finally, we invoke the parser with our additional switch
- *  group on the argument list in @c argv. If the parsing is successful we apply the results to our @c settings and then return
- *  the rest of the command line (probably information about the specimen).
- *
- *  @snippet binaryCallGraph.C setup
- *
- *  In the @p main program we initialize our @p settings and instantiate a disassembly/partitioning engine, then parse the
- *  command-line and get the list of non-switch arguments. If there are none, give the user some help; this is often an
- *  indication that the user invoked the command with no arguments at all in order to get an error message that hopefully
- *  contains some usage hints.
- *
- *  @snippet binaryCallGraph.C partition
- *
- *  Instead of calling @ref Partitioner2::Engine::frontend "engine.frontend", this time we call @ref
- *  Partitioner2::Engine::partition "engine.partition" in order to get access to the partitioning analysis results. No AST is
- *  created in this case, although we could get one if we wanted by querying the engine for it.  The data structures used by
- *  the partitioner are much more efficiently tuned for analysis than an AST, so we'll stick with the partitioner.
- *
- *  @snippet binaryCallGraph.C callgraph
- *
- *  The partitioner knows how to construct a call graph from its internal data structures.  The @ref
- *  Partitioner2::FunctionCallGraph "FunctionCallGraph" class can also be manipulated directly.  Now's a good time to point out
- *  that many binary analysis data structures use pointers to shared objects. The objects are reference counted and deleted
- *  automatically. Classes that are used in this way do not have public constructors, but rather @c instance methods (and
- *  sometimes additional factories as well) that allocate and initialize the object and return a smart pointer.  In this
- *  example, if we were to delete the @c partitioner or @c engine the @c callgraph would still point to valid functions, which
- *  still point to valid instructions, etc.
- *
- *  @snippet binaryCallGraph.C emit
- *
- *  Finally we can emit the call graph as a GraphViz file. This is done through a @ref Partitioner2::GraphViz::CgEmitter
- *  "CgEmitter" that specializes a more general GraphViz emitter.  The emitter API allows you to fine tune the output by
- *  adjusting colors and other GraphViz edge and vertex properties.
- *
- *  Here's the full listing. Compile it using the same instructions as for the @ref bintut_helloworld example.
- *
- *  @includelineno binaryCallGraph.C
- *
- *
- *
- *
- *  @section bintut_strings Finding static strings in a binary specimen
- *
- *  This example parses and disassembles a binary specimen and search for all static strings, similar to the Unix "strings"
- *  command. This simple example can be a starting point for a more in depth strings analysis than what's possible with the
- *  Unix command.
- *
- *  @snippet binaryStrings.C headers
- *
- *  Include headers. The "rose.h" must always be before other ROSE headers.
- *
- *  @snippet binaryStrings.C commandline
- *
- *  Yet another way to parse a command-line.  This time we're trying to avoid calling @ref Partitioner2::Engine::frontend
- *  because we don't actually need to disassemble or partition anything--string searching operates on raw memory rather than
- *  instructions, so we can save some time.
- *
- *  @snippet binaryStrings.C load
- *
- *  The @ref Partitioner2::Engine::loadSpecimens "engine.loadSpecimens" method parses the speicmen container if present (e.g.,
- *  Linux ELF) and determines how the specimen should be mapped into memory.  The result is a @ref MemoryMap that describes
- *  memory segments with addresses, permissions, names, etc.  Try inserting a call to @ref MemoryMap::dump here to get an
- *  idea of what it contains.
- *
- *  The byte order will be needed by the string decoder in order to know how to decode the multi-byte length fields. We could
- *  have gotten this same information any number of other ways, but this is the most convenient in this situation. Note that
- *  knowledge of the byte order depends upon knowledge of the specimen architecture even though we don't actually need to
- *  disassemble anything.
- *
- *  @snippet binaryStrings.C analysis
- *
- *  Here we perform the string searching. Most binary analysis algorithms are packaged into a class. The idea is that one
- *  instantiates the analyzer, configures it, calls some method to perform the analysis (here it's @ref
- *  Strings::StringFinder::find "find"), and then queries the results.
- *
- *  The @ref MemoryMap::require and @ref MemoryMap::prohibit methods are a form of filtering. They're filtering the memory
- *  map so that the string analyzer only sees memory that's readable but not writable.
- *
- *  @snippet binaryStrings.C output
- *
- *  Generating the output is a matter of iterating over the strings that were found and printing some information. Most
- *  analyzer objects also know how to print themselves although those defaults are not always suitable for a polished tool.
- *
- *  Here's the entire program:
- *
- *  @includelineno binaryStrings.C
- *
- *
- *
- *  @section bintut_dominators Graph dominators and post dominators
- *
- *  Loosely speaking, the dominator of a vertex of a graph is another vertex that's visited on every path from some
- *  starting vertex to the vertex in question.  Most of the time, we're interested in an immediate dominator, which is the
- *  closest dominator to the vertex in question. A more rigorous definition can be found in Wikipedia, among other places.
- *  Post-dominators are similar in that a post dominator of a vertex is some other vertex that's visited on every path from the
- *  vertex in question to some ending vertex.
- *
- *  ROSE uses the @ref Sawyer::Container::Graph "Sawyer Graph API" for all binary analysis graphs, and Sawyer has functions for
- *  calculating dominators and post-dominators. The following example is a tool that finds the dominator for each vertex in the
- *  control flow graph of each function.
- *
- *  @snippet binaryDominance.C headers
- *
- *  The first step, above, is to include the appropriate declarations. Our convention for writing tools is to describe the tool
- *  with a couple of strings that appear at the very top of the source code. These strings are used later in the program to
- *  generate the documentation for the "--help" output.
- *
- *  This tool is so simple that everything else is in "main". First we initialize things:
- *
- *  @snippet binaryDominance.C init
- *
- *  The @ref Rose::initialize "ROSE_INITIALIZE" macro is always the first ROSE-related statement and checks that this tool was
- *  compiled with header files that are binary compatible with the ROSE library.  Then we create a partitioning engine to parse
- *  the command-line to get the specimen resources. The specimen is some combination of a ELF or PE file name, raw memory
- *  dumps, S-Records, and/or process IDs.  The @ref Rose::BinaryAnalysis::Partitioner2::Engine::partition "engine.partition"
- *  call does all the hard work of parsing containers, loading data into the virtual address space, decoding CPU instructions,
- *  and creating basic blocks and functions. It returns a @ref Rose::BinaryAnalysis::Partitioner2::Partitioner "partitioner"
- *  object that stores all the results, which include a global control flow graph.
- *
- *  Then we iterate over the functions:
- *
- *  @snippet binaryDominance.C iterate
- *
- *  We want to create a function CFG, but all we have from the partitioner is a global CFG. We can use the fact that a function
- *  CFG is a subset of the global CFG and therefore create the function CFG by copying the global CFG and removing all vertices
- *  and edges that are not part of the function CFG. Although this isn't the most efficient way to create function CFGs in a
- *  loop over all functions, it is very simple.
- *
- *  We'll need to know the entry vertex of the function's CFG:
- *
- *  @snippet binaryDominance.C cfg_enter
- *
- *  We found the entry vertex in the function CFG by first finding it in the global CFG and then using a feature of Sawyer
- *  graphs, namely, when a graph is copied its vertices and edges have the same IDs as those in the source graph, and we can
- *  obtain a vertex pointer (iterator) in constant time if we know its ID.  We have to convert the ID to a vertex pointer
- *  before removing the non-function vertices because IDs are not stable across erase operations, but iterators are.
- *
- *  Next we erase the non-function vertices and edges:
- *
- *  @snippet binaryDominance.C cfg_build
- *
- *  This is the simple way to build a function CFG from a global CFG. It's important to use a post-increment in the
- *  @c eraseVertex call. Since we're inside a loop iterating over every function, a more efficient implementation would have
- *  created all the function CFGs in a single pass over the global CFG. As of June 2017, ROSE does not have functions for
- *  returning function CFGs -- it only has a global CFG -- because there are many details that need to be considered depending
- *  on the situation (e.g., function calls and returns are two cases that typically need massaging in a function CFG depending
- *  on the purpose of the CFG).
- *
- *  Finally, we get to the real meat of this example: finding the immediate dominator for every vertex in the function CFG
- *  given the CFG's entry vertex:
- *
- *  @snippet binaryDominance.C dominators
- *
- *  The @ref Sawyer::Container::Algorithm::graphDominators "graphDominators" function can handle any type of Sawyer graph, thus
- *  we could also pass a function call graph or a data-flow graph.
- *
- *  The return value is a vector indexed by vertex ID, whose values point to either the corresponding immediate dominator or
- *  the vertex end iterator (not all vertices have an immediate dominator).  Using a vector indexed by vertex ID is an idiom
- *  used throughout ROSE whenever we need to associated extra data with an existing graph. Since a vertex pointer (iterator)
- *  can be converted to a vertex ID in constant time, and indexing into the vector is constant time, we can always find the
- *  extra data in constant time. And since vertex IDs are consecutive integers beginning at zero, this is also a
- *  space-efficient way to represent data that's present for most, if not all, vertices.
- *
- *  Finally, let us iterate over the results to print them:
- *
- *  @snippet binaryDominance.C results
- *
- *  Since vector indexes are equivalent to vertex IDs, we can obtain a vertex with a constant-time @c findVertex call and a
- *  constant-time iterator dereference.  Since this is a CFG from the partitioner (or at least a copy thereof), we can use the
- *  @ref Rose::BinaryAnalysis::Partitioner2::Partitioner::vertexName "vertexName" static method to print some info about
- *  it. Using the static method (that takes a vertex value) is important; the non-static method (that takes a vertex iterator)
- *  will think that we're handing it a pointer to some vertex in the partitioner's own global CFG.
- *
- *  Here's the entire program:
- *
- *  @includelineno binaryDominance.C
- *
- *
- *  
- *  @section bintut_next Next steps
- *
- *  Most binary analysis capabilities are documented in the @ref Rose::BinaryAnalysis namespace. The test directory,
- *  "$ROSE_SOURCE/tests/nonsmoke/functional/roseTests/BinaryTests", also has many examples, some of which are slightly hard to read since there
- *  main purpose is to test rather than demonstrate.  The "$ROSE_SOURCE/projects/BinaryAnalysisTools" directory (as well as
- *  some other project directories) has real programs that use the binary analysis interface. */
-
-} // namespace
-} // namespace
diff --git a/docs/Rose/CMakeLists.txt b/docs/Rose/CMakeLists.txt
index 4e1187b6acc..232a9b0d462 100644
--- a/docs/Rose/CMakeLists.txt
+++ b/docs/Rose/CMakeLists.txt
@@ -1,4 +1,4 @@
 
-include_directories(${KDE4_INCLUDES} ${KDE4_INCLUDE_DIR} ${QT_INCLUDES} )
+# include_directories()
 
 add_subdirectory(Tutorial)
diff --git a/docs/Rose/Makefile.am b/docs/Rose/Makefile.am
index daa7f8bd303..081eba13b65 100644
--- a/docs/Rose/Makefile.am
+++ b/docs/Rose/Makefile.am
@@ -192,17 +192,11 @@ make-web-pages: $(RoseDoxygenDocumentation) $(PACKAGE_NAME)-$(PACKAGE_VERSION)-U
 	cp -f footer.html ROSE_WebPages/footer.html
 	cp -f $(srcdir)/rose.html ROSE_WebPages/rose.html
 	cp -f $(srcdir)/rose.html ROSE_WebPages/index.html
-	cp -f $(srcdir)/projects.html ROSE_WebPages/projects.html
 	cp -f $(srcdir)/FAQ.html ROSE_WebPages/FAQ.html
 	cp -f $(srcdir)/documents.html ROSE_WebPages/documents.html
 	cp -f $(srcdir)/highlights.html ROSE_WebPages/highlights.html
 	cp -f $(srcdir)/news.html ROSE_WebPages/news.html
 	cp -f $(srcdir)/regressionTest.html ROSE_WebPages/regressionTest.html
-	cp -f $(COMPASS_MANUAL) ROSE_WebPages/
-	cp -f $(AUTOTUNING_MANUAL) ROSE_WebPages/
-	cp -f $(QROSE_MANUAL) ROSE_WebPages/
-#	mkdir -p ROSE_WebPages/ROSE_HaskellAPI
-#	cp -fr $(HASKELLPORT_APIDOCS)/* ROSE_WebPages/ROSE_HaskellAPI/
 	cp -fr $(srcdir)/powerpoints ROSE_WebPages/
 	cp -f ROSE_InstallationInstructions.pdf ROSE_WebPages/ROSE_InstallationInstructions.pdf
 	cp -f ROSE_Exam.pdf ROSE_WebPages/ROSE_Exam.pdf
@@ -217,12 +211,7 @@ make-web-pages: $(RoseDoxygenDocumentation) $(PACKAGE_NAME)-$(PACKAGE_VERSION)-U
 
 # Upload web pages to the LBL server 
 copyWebPages: make-web-pages
-#       Liao 5/6/2010 migrate to the new web server
-#	Liao, 7/13/2009, must ensure the file permissions here
-#	Liao, 12/8/2010, use dedicated data transferring node dtn01 
 	cd ROSE_WebPages; chmod -R a+rx *; rsync -avz * liaoch@dtn01.nersc.gov:/project/projectdirs/rosecompiler/www.rosecompiler.org
-#	cd ROSE_WebPages; chmod -R a+rx *; rsync -avz * liaoch@portal-auth.nersc.gov:/project/projectdirs/rosecompiler/www.rosecompiler.org
-#	cd ROSE_WebPages; chmod -R a+rx *; rsync -avz * liaoch@web-dev.nersc.gov:/www/host/rosecompiler
 #	scp $(PACKAGE_NAME)-$(PACKAGE_VERSION)-HTML-Docs.tar.gz quinlan1@cmg-1.llnl.gov:/green_dev/www/casc/rose
 
 # Liao 12/7/2009, we mirror the content of the internal 
diff --git a/docs/Rose/Tutorial/CMakeLists.txt b/docs/Rose/Tutorial/CMakeLists.txt
index 9fd4aa54267..7936f8ffdf9 100644
--- a/docs/Rose/Tutorial/CMakeLists.txt
+++ b/docs/Rose/Tutorial/CMakeLists.txt
@@ -23,14 +23,14 @@ include_directories(${KDE4_INCLUDES} ${KDE4_INCLUDE_DIR} ${QT_INCLUDES} )
 #   templateParameter.tex instrumentationExample.tex addVariableDeclaration.tex \
 #   addAssignmentStmt.tex addExpression.tex\
 #   addFunctionDeclaration.tex buildCFG.tex parallelChecker.tex defuseAnalysis.tex \
-#   binaryAnalysis.tex buildCallGraph.tex classHierarchyGraph.tex loopOptimization.tex inliner.tex outliner.tex \
+#   buildCallGraph.tex classHierarchyGraph.tex loopOptimization.tex inliner.tex outliner.tex \
 #   parser-docs.tex codeCoverage.tex globalVariableHandling.tex scopeInformation.tex sideeffect-docs.tex \
 #   tauInstrumentation.tex templateSupport.tex dataBaseSupport.tex recognitionOfAbstractions.tex \
 #   debuggingSupport.tex commandlineProcessing.tex customGraphs.tex tutorialMakefile.tex wrapup.tex \
 #   appendix.tex astFileIO.tex uniqueNames.tex wholeGraphAST.tex addingComments.tex \
 #   partialRedundancyElimination.tex codeGenerationFormatControl.tex copyHelp.tex \
 #   roseHPCT.tex sharedMemoryTraversals.tex distributedMemoryTraversals.tex bugSeeding.tex \
-#   modifiers.tex howToContribute.tex virtualCFG.tex binaryConstruction.tex reductionRecognition.tex \
+#   modifiers.tex howToContribute.tex virtualCFG.tex reductionRecognition.tex \
 #   haskell.tex
 #
 ## This is an evolving list, but these are a few of the required files
diff --git a/docs/Rose/Tutorial/Makefile.am b/docs/Rose/Tutorial/Makefile.am
index 8241c103387..b1120147484 100644
--- a/docs/Rose/Tutorial/Makefile.am
+++ b/docs/Rose/Tutorial/Makefile.am
@@ -11,14 +11,14 @@ latexFiles = \
    traversal.tex loopRecognition.tex typeInfoFromFunctionParameters.tex resolveOverloadedFunction.tex \
    templateParameter.tex \
    buildCFG.tex parallelChecker.tex defuseAnalysis.tex \
-   binaryAnalysis.tex GenericDFA.tex buildCallGraph.tex buildVFA.tex classHierarchyGraph.tex loopOptimization.tex inliner.tex outliner.tex \
+   GenericDFA.tex buildCallGraph.tex buildVFA.tex classHierarchyGraph.tex loopOptimization.tex inliner.tex outliner.tex \
    parser-docs.tex codeCoverage.tex scopeInformation.tex sideeffect-docs.tex \
    tauInstrumentation.tex templateSupport.tex dataBaseSupport.tex recognitionOfAbstractions.tex \
    debuggingSupport.tex commandlineProcessing.tex customGraphs.tex tutorialMakefile.tex wrapup.tex \
    appendix.tex astFileIO.tex uniqueNames.tex wholeGraphAST.tex addingComments.tex \
    partialRedundancyElimination.tex codeGenerationFormatControl.tex copyHelp.tex \
-   roseHPCT.tex sharedMemoryTraversals.tex distributedMemoryTraversals.tex bugSeeding.tex \
-   modifiers.tex howToContribute.tex virtualCFG.tex binaryConstruction.tex reductionRecognition.tex \
+   sharedMemoryTraversals.tex distributedMemoryTraversals.tex bugSeeding.tex \
+   modifiers.tex howToContribute.tex virtualCFG.tex reductionRecognition.tex \
    livenessAnalysis.tex CFGTraversalTutorial.tex parserBuildingBlocks.tex astConstruction.tex
 
 # This is an evolving list, but these are a few of the required files
@@ -35,7 +35,6 @@ generatedCodeExamples = \
    $(top_builddir)/tutorial/codeCoverage.out \
    $(top_builddir)/tutorial/vcfg.pdf \
    $(top_builddir)/tutorial/rose_inputCode_inlineTransformations.C \
-   $(top_builddir)/tutorial/roseHPCT/profiled.out \
    $(top_builddir)/tutorial/sourceTraversalTutorial.C \
    $(top_builddir)/tutorial/binaryTraversalTutorial.C
 
diff --git a/docs/Rose/Tutorial/binaryAnalysis.tex b/docs/Rose/Tutorial/binaryAnalysis.tex
deleted file mode 100644
index b213187a0f0..00000000000
--- a/docs/Rose/Tutorial/binaryAnalysis.tex
+++ /dev/null
@@ -1,347 +0,0 @@
-\chapter{Binary Analysis}
-
-% This tutorial has been replaced by a doxygen version.
-
-See doxgyen ``Getting started with binary analysis'' chapter.
-
-\section{DataFlow Analysis}
-
-%\begin{figure}
-%%\centerline{\epsfig{file=\TutorialExampleBuildDirectory/controlFlowGraph.ps,
-%%                    height=1.3\linewidth,width=1.0\linewidth,angle=0}}
-%\includegraphics[scale=0.7]{\TutorialExampleBuildDirectory/binaryAnalysis_pic2}
-%\caption{Dataflowflow graph for example program.}
-%\label{Tutorial:examplefig2}
-%\end{figure}
-
-Based on the control flow many forms of dataflow analysis may be performed.
-Dataflow analyses available are:
- 
-\subsection{Def-Use Analysis}
-
-Definition-Usage is one way to compute dataflow information about a binary program.
-
-\subsection{Variable Analysis}
-
-This analysis helps to detect different types within a binary.
-Currently, we use this analysis to detect interrupt calls and their parameters together with the def-use analysis.
-This allows us to track back the value of parameters to the calls, such as eax and therefore 
-determine whether a interrupt call is for instance a write or read.
-Another feature is the buffer overflow analysis. By traversing the CFG, we can detect buffer overflows.
-
-
-\section{Dynamic Analysis}
-
-   ROSE has support for dynamic analysis and for mixing of dynamic
-and static analysis using the Intel Pin framework. This optional support in ROSE
-requires a configure option ({\tt --with-IntelPin=$<path$>}).  The {\tt path} in
-the configure option is the {\bf absolute path} to the top level directory of the location of
-the Intel Pin distribution.  This support for Intel Pin has only been tested
-on a 64bit Linux system using the most recent distribution of Intel Pin (version 2.6).
-
-Note: The dwarf support in ROSE is currently incompatable with the dwarf support in
-Intel Pin.  A message in the configuration of ROSE will detect if both support for
-Dwarf and Intel Pin are both specified and exit with an error message that they
-are incompatable options.
-
-See {\tt tutorial/intelPin} directory for examples using static and dynamic analysis.
-These example will be improved in the future, at the moment they just call the
-generation of the binary AST.
-
-
-Note: We have added a fix to Intel Pin pin.H file:
-\begin{verbatim}
-// DQ (3/9/2009): Avoid letting "using" declarations into header files.
-#ifndef REQUIRE_PIN_TO_USE_NAMESPACES
-using namespace LEVEL_PINCLIENT;
-#endif
-\end{verbatim}
-so that the namespace of Intel Pin would not be a problem for ROSE.
-The development team have suggested that they may fix their use of "using" 
-declarations for namespaces in their header files.
-
-Also note that the path must be absolute since it will be the
-prefix for the {\bf pin} executable to be run in the internal tests and
-anything else might be a problem if the path does not contain the 
-current directory ({\bf "."}). Or, perhaps we should test for this
-in the future.
-
-Note 2: Linking to libdwarf.a is a special problem.  
-Both ROSE and Intel Pin use libdwarf.a and both build shred libraries 
-that link to the static version of the library (libdwarf.a).  This is 
-a problem im building Pin Tools since both the PinTool and librose.so will use 
-a statically linked dwarf library (internally).  This causes the first
-use of dwarf to fail, because there are then two versions of the same 
-library in place.  The solution is to force at most one static version 
-of the library and let the other one be a shared library.
-
-   Alternatively both the Pin tool and librose.so can be
-built using the shared version of dwarf (libdwarf.so).
-There is a makefile rule in libdwarf to build the shared
-version of the library, but the default is to only build the
-static library (libdwarf.a), so use {\tt make make libdwarf.so}
-to build the shared library.  So we allow ROSE to link to
-the libdwarf.a (statically), which is how ROSE has always
-worked (this may be revisited in the future).  And we force 
-the Pin tool to link using the shared dwarf library (libdwarf.so).
-% but with rpath so that we don't require the user to modify the LD\_LIBRARY\_PATH.
-{\em Note: The specification of the location of libdwarf.so in the Intel Pin 
-directory structure is problematic using {\bf rpath}, so for the case of 
-using the Intel Pin package with ROSE please set the {\bf LD\_LIBRARY\_PATH}
-explicitly (a better solution using {\bf rpath} may be made available in 
-the future).}
-
-
- 
-\section{Analysis and Transformations on Binaries}
-
-   This section demonstrates how the binary can be analyized and
-transformed via operations on the AST. In this tutorial example we will
-recognize sequences of NOP (No OPeration) instructions (both single byte
-and less common multi-byte NOPs) and replace them in the binary with as 
-few multi-byte NOP instructions as required to overwrite the identified
-NOP sequence (also called a {\em nop sled}).
-
-In the following subsections we will demonstrate three example codes that
-work together to demonstrate aspects of the binary analysis and transforamation using
-ROSE.  All of these codes are located in the directory {\em tutorial/binaryAnalysis}
-of the ROSE distribution. We show specifically:
-\begin{enumerate}
-   \item How to insert NOP sequences into binaries via source-to-source transformations.
-         The tutorial example will demonstrate the trival insertion of random length
-         nop sequences into all functions of an input source code application.
-         The purpose of this is to really just generate arbitrary test codes
-         upon which to use in sperately demonstrating (and testing) the binary analysis 
-         support and the binary transformation support (next).  This example is
-         shown in figure~\ref{Tutorial:exampleTransformSourceToInsertNOPs}.
-         The file name is: 
-   \item How to identify sequences of NOP instructions in the binary ({\em nop sleds}).
-         The tutorial example show how to identify arbitrary NOP sequences in the 
-         binary.  Note that our approach looks only for single instructions that have
-         no side-effect operations and thus qualify as a NOP, and specifically does not
-         look at collections of multiple statements that taken togehter have no
-         side-effect and thus could be considered a NOP sequence. Our test on each 
-         instruciton is isolated to the {\tt SageInterface::isNOP(SgAsmInstruction*)} 
-         function.  Initially this function only detects NOP instructions that are
-         single and multi-byte Intel x86 suggested NOP instructions.  The catagory of
-         NOP instructions that have no side-effects is broader than this and will
-         be addressed more completely in the future. This example is
-         shown in figures \ref{Tutorial:exampleTransformBinaryToDetectNOPs_header},
-         \ref{Tutorial:exampleTransformBinaryToDetectNOPs_source}, and
-         \ref{Tutorial:exampleTransformBinaryToDetectNOPs_main}.
-   \item How transformations on the binary executable are done to support rewriting
-         all identified NOP sequences as Intel x86 suggested NOP instructions.
-         Importantly, this tutorial example of an AST rewrite does not change the 
-         size of any part of the final executable. This example is
-         shown in figure~\ref{Tutorial:exampleTransformBinaryToInsertNOPs}.
-\end{enumerate}
-
-\begin{figure}[!h]
-{\indent
-{\mySmallFontSize
-
-% Do this when processing latex to generate non-html (not using latex2html)
-\begin{latexonly}
-   \lstinputlisting{\TutorialExampleDirectory/binaryAnalysis/nopSourceTransform.C}
-\end{latexonly}
-
-% Do this when processing latex to build html (using latex2html)
-\begin{htmlonly}
-   \verbatiminput{\TutorialExampleDirectory/binaryAnalysis/nopSourceTransform.C}
-\end{htmlonly}
-
-% end of scope in font size
-}
-% End of scope in indentation
-}
-\caption{Source-to-source transformation to introduce NOP assemble instructions in the
-    generated binary executable.}
-\label{Tutorial:exampleTransformSourceToInsertNOPs}
-\end{figure}
-
-
-\subsection{Source-to-source transformations to introduce NOPs}
-
-   This tutorial example (see figure~\ref{Tutorial:exampleTransformSourceToInsertNOPs})
-is a source-to-source trnasformation that is used to
-generate test codes for the binary NOP sequence detection example and the 
-NOP sequence transformation example (the next two tutorial examples).
-This tutorial uses C language {\em asm} statements that are inserted into
-each function in the source code, the resulting generated source code (with {\em asm}
-statements) is then compiled to generate inputs to use in our detection and
-transformation of NOP sequences.  Although it is possible, the backend
-compiler (at least the one we are using), does not optimize away these 
-{\em asm} statements that represent NOP instructions.  In general all
-C and C++ compilers turn off optimizations upon encountering the {\em asm}
-language construct, so it is easy to use this approach to build binaries
-from arbitrary source code that have a range of properties.  Seeding 
-the source code with such properties causes the binary to have the similar
-properties.  We include this example in the tutorial because it is a cute
-example of how we can combine source code analsys with binary analysis
-(in this case we are only supporting testing of the binary analysis).
-Much more interesting example of the connection of source code and
-binary analysis are available.
-
-
-\begin{figure}[!h]
-{\indent
-{\mySmallFontSize
-
-% Do this when processing latex to generate non-html (not using latex2html)
-\begin{latexonly}
-   \lstinputlisting{\TutorialExampleDirectory/binaryAnalysis/detectNopSequencesTraversal.h}
-\end{latexonly}
-
-% Do this when processing latex to build html (using latex2html)
-\begin{htmlonly}
-   \verbatiminput{\TutorialExampleDirectory/binaryAnalysis/detectNopSequencesTraversal.h}
-\end{htmlonly}
-
-% end of scope in font size
-}
-% End of scope in indentation
-}
-\caption{Header file for the traversal used to identify the NOP sequences in the binary executable.}
-\label{Tutorial:exampleTransformBinaryToDetectNOPs_header}
-\end{figure}
-
-
-\begin{figure}[!h]
-{\indent
-{\mySmallFontSize
-
-% Do this when processing latex to generate non-html (not using latex2html)
-\begin{latexonly}
-   \lstinputlisting{\TutorialExampleDirectory/binaryAnalysis/detectNopSequencesTraversal.C}
-\end{latexonly}
-
-% Do this when processing latex to build html (using latex2html)
-\begin{htmlonly}
-   \verbatiminput{\TutorialExampleDirectory/binaryAnalysis/detectNopSequencesTraversal.C}
-\end{htmlonly}
-
-% end of scope in font size
-}
-% End of scope in indentation
-}
-\caption{Example code to identify the NOP sequences in the binary executable.}
-\label{Tutorial:exampleTransformBinaryToDetectNOPs_source}
-\end{figure}
-
-
-
-
-
-
-
-
-\begin{figure}[!h]
-{\indent
-{\mySmallFontSize
-
-% Do this when processing latex to generate non-html (not using latex2html)
-\begin{latexonly}
-   \lstinputlisting{\TutorialExampleDirectory/binaryAnalysis/detectNopSequences.C}
-\end{latexonly}
-
-% Do this when processing latex to build html (using latex2html)
-\begin{htmlonly}
-   \verbatiminput{\TutorialExampleDirectory/binaryAnalysis/detectNopSequences.C}
-\end{htmlonly}
-
-% end of scope in font size
-}
-% End of scope in indentation
-}
-\caption{Main program using the traversal to identify the NOP sequences in the binary executable.}
-\label{Tutorial:exampleTransformBinaryToDetectNOPs_main}
-\end{figure}
-
-
-\subsection{Detection of NOP sequences in the binary AST}
-
-   The tutorial example (see figures \ref{Tutorial:exampleTransformBinaryToDetectNOPs_header},
-\ref{Tutorial:exampleTransformBinaryToDetectNOPs_source}, and
-\ref{Tutorial:exampleTransformBinaryToDetectNOPs_main})
-shows the detection of NOP sequences and is separated into three
-figures (the header file, the source code, and the main program).  The header file
-and source file will be reused in the next tutorial example to demonstrate the
-transformation of the NOP sequences that this tutorial identifies.  The
-transformation will be done on the AST (and a new modified executable generated
-by unparsing the AST). 
-
-    Using a simple preorder traversal over the AST we identify independent sequences of
-NOP instructions.  This traversal save the sequence so that it can be used in both the
-tutorial example that detects the NOP sequences and also the tutorial example that 
-will transform them to be more compact multi-byte NOP sequences that will use the
-suggested Intel x86 multi-byte NOP instructions.
-
-   In this example, the sequence of a NOP sequence is saved as the address of the 
-starting NOP instruction and the number of instructions in the sequence.  The function
-{\tt SageInterface::isNOP(SgAsmInstruction*)} is used to test of an instruction is
-a NOP.  Presently this test only identifies single or multi-byte NOP instrucitons
-that have been suggested for use as single and multi-byte NOP instructions by Intel.
-Other instruction may semantically be equivalent to a NOP instruction and they are
-not identified in this initial work.  Later work may include this capability and
-for this purpose we have isolated out the {\tt SageInterface::isNOP(SgAsmInstruction*)}.
-Note also that sequences of instructions may be semantically equivalent to a 
-NOP sequence and we also do not attempt to identify these (separate interface 
-functions in the {\tt SageInterface} namespace have been defined to support this
-work; these functions are presently unimplemented.
-
-\begin{figure}[!h]
-{\indent
-{
-% \mySmallFontSize
-\tiny
-
-% Do this when processing latex to generate non-html (not using latex2html)
-\begin{latexonly}
-   \lstinputlisting{\TutorialExampleDirectory/binaryAnalysis/nopBinaryTransform.C}
-\end{latexonly}
-
-% Do this when processing latex to build html (using latex2html)
-\begin{htmlonly}
-   \verbatiminput{\TutorialExampleDirectory/binaryAnalysis/nopBinaryTransform.C}
-\end{htmlonly}
-
-% end of scope in font size
-}
-% End of scope in indentation
-}
-\caption{Example code showing the transformation of the binary executable.}
-\label{Tutorial:exampleTransformBinaryToInsertNOPs}
-\end{figure}
-
-\subsection{Transformations on the NOP sequences in the binary AST}
-
-   Using the results from the previously presented traversal to identify
-NOP sequences, we demonstrate the transformation to change these 
-locations of the binary (in the AST) and then regenerate the executable 
-to have a different representation. The new representation is a more clear
-(obvious within manual binary analysis) and likely more compressed 
-representation using only the suggested Intel x86 multi-byte NOP.
-
-
-
-\subsection{Conclusions}
-
-\fixme{Not sure if the resulting executable will use the assembler on each
-instruction in the generated binary from the unparsing within ROSE. This might 
-require some more work. So at the moment the AST is transformed and I have
-to look into if the binary sees the effect of the transformation in the AST.}
-
-   The identification and transformation have been deomonstrated on the AST
-and can be expressed in the binary binary by calling the {\em backend()} 
-function in ROSE; which will regenerate the executable.  The capability to
-regenerate the executable will not always result in a properly formed
-executable that can be executed, this depends upon the transformations done
-and does ROSE does not have specialized support for this beyond regnerating
-the binary executable from the AST.  In the case of this NOP transformation
-we have not changed the size of any part of the binary so any relative offsets 
-need not be fixed up. Assumeing we have not accedentaly interpreted data that
-had values that matched parts of the opcodes that were transformed, then resulting
-binary executable should execute without problems.  This transformation however
-makes clear how critical it is that data not be interpreted as instructions
-(which could randomly be interpreted as NOPs in the case of this tutorial example).
-
diff --git a/docs/Rose/Tutorial/binaryConstruction.tex b/docs/Rose/Tutorial/binaryConstruction.tex
deleted file mode 100644
index 351cc90878f..00000000000
--- a/docs/Rose/Tutorial/binaryConstruction.tex
+++ /dev/null
@@ -1,416 +0,0 @@
-\chapter{Binary Construction}
-
-ROSE is normally used in such a way that a file (source code or
-binary) is parsed to construct an AST, then operations are performed
-on the AST, and the modified AST is unparsed to create a new source or
-binary file.  However, it is also possible to construct an AST
-explicitly without parsing and then use that AST to generate the
-output.  The AST construction interface for binary files was designed
-so that working files could be created simply, while still providing
-methods to control the finer details of the resulting file.
-
-The example in this chapter shows how to construct a statically linked
-ELF executable containing a small ``.text'' section that simply causes
-the process to exit with a specific non-zero value.
-
-\section{Constructors}
-
-The AST node constructors are designed to construct the tree from the
-root down, and thus generally take the parent node as an
-argument. Nodes that refer to other nodes as prerequisites also take
-those prerequisites as arguments. For instance, an ELF Relocation
-Section is a child of the ELF File Header but also needs an ELF Symbol
-Table and therefore takes both objects as constructor arguments.
-
-\section{Read-Only Data Members}
-
-When two or more file formats have a similar notion then that notion
-is represented in a base class. However, part of the information may
-continue to survive in the specialized class. In these situations
-modifications to the specilized data will probably be overridden by
-the generic values from the base class.  For instance, all formats
-have a notion of byte order which is represented in the base class
-SgAsmGenericHeader as little- or big-endian (an enumeration
-constant). The ELF specification provides an 8-bit unsigned field to
-store the byte order and therefore has potentially more than two
-possibilities. Any value assigned to the ELF-specific byte order will
-likely be overwritten by the generic byte order before the AST is
-unparsed.
-
-A similar situation arises with section offsets, sizes, memory
-mappings, permissions, etc. The SgAsmGenericSection class represents
-ELF Sections, ELF Segments, PE Objects, and other contiguous regions
-of a file and has methods for obtaining/setting these values. In
-addition, many of the formats have some sort of table that describes
-these sections and which also contains similar information (e.g., the
-ELF Segment Table, a.k.a., the ELF Program Header Table). As above,
-the generic representation of these notions (stored in
-SgAsmGenericSection) override the format-specific values (stored in
-SgAsmElfSegmentEntry).
-
-ROSETTA doesn't make a distinction between data members that can be
-user-modified and data members that should be modified only by the
-parser. Therefore it is up to the user to be aware that certain data
-members will have their values computed or copied from other locations
-in the AST during the unparsing phase.
-
-\section{Constructing the Executable File Container}
-
-All executable files are stored as children of an SgAsmGenericFile
-node. The children are file format headers (SgAsmGenericHeader) such
-as an ELF File Header (SgAsmElfFileHeader). This design allows a
-single executable file to potentially contain more than one executable
-and is used by formats like Windows-PE where the file contains a DOS
-File Header as well as a PE File Header.
-
-For the purposes of this example the SgAsmGenericFile node will serve
-as the root of the AST and therefore we do not need to specify a
-parent in the constructor argument list.
-
-\begin{verbatim}
-SgAsmGenericFile *ef = new SgAsmGenericFile;
-\end{verbatim}
-
-\section{Constructing the ELF File Header}
-
-The ELF File Header is the first thing in the file, always at offset
-zero. File headers are always children of an SgAsmGenericFile which is
-specified as the constructor argument.
-
-The section constructors (a file header is a kind of section) always
-create the new section so it begins at the current end-of-file and
-contains at least one byte. This ensures that each section has a
-unique starting address, which will be important when file memory is
-actually allocated and sections need to be moved around--the allocator
-needs to know the relative positions of the sections in order to
-correctly relocate them.
-
-If we were parsing an ELF file we would usually use ROSE's frontend()
-method. However, one can also parse the file by first constructing the
-SgAsmElfFileHeader and then invoking its parse() method, which parses
-the ELF File Header and everything that can be reached from that
-header.
-
-We use the typical 0x400000 as the virtual address of the main LOAD
-segment, which occupies the first part of the file up through the end
-of the ``.text'' section (see below). ELF File Headers don't actually
-store a base address, so instead of assigning one to the
-SgAsmElfFileHeader we'll leave the header's base address at the
-default zero and add base\_va explicitly whenever we need to.
-
-\begin{verbatim}
-SgAsmElfFileHeader *fhdr = new SgAsmElfFileHeader(ef);
-fhdr->get_exec_format()->set_word_size(8);                  /* default is 32-bit; we want 64-bit */
-fhdr->set_isa(SgAsmExecutableFileFormat::ISA_X8664_Family); /* instruction set architecture; default is ISA_IA32_386 */
-rose_addr_t base_va = 0x400000;                             /* base virtual address */
-\end{verbatim}
-
-\section{Constructing the ELF Segment Table}
-
-ELF executable files always have an ELF Segment Table (also called the
-ELF Program Header Table), which usually appears immediately after the
-ELF File Header. The ELF Segment Table describes contiguous regions of
-the file that should be memory mapped by the loader. ELF Segments
-don't have names--names are imparted to the segment by virtue of the
-segment also being described by the ELF Section Table, which we'll
-create later.
-
-Being a contiguous region of the file, an ELF Segment Table
-(SgAsmElfSegmentTable) is derived from SgAsmGenericSection. All
-non-header sections have a header as a parent, which we supply as an
-argument to the constructor. Since all ELF Segments will be children of
-the ELF File Header rather than children of the ELF Segment Table, we
-could define the ELF Segment Table at the end rather than here. But
-defining it now is an easy way to get it located in its usuall
-location immediately after the ELF File Header.
-
-\begin{verbatim}
-SgAsmElfSegmentTable *segtab = new SgAsmElfSegmentTable(fhdr);
-\end{verbatim}
-
-\section{Constructing the .text Section}
-
-ROSE doesn't treat a ``.text'' section as being anything particularly
-special--it's just a regular SgAsmElfSection, which derives from
-SgAsmGenericSection. However, in this example, we want to make sure
-that our ``.text'' section gets initialized with some
-instructions. The easiest way to do that is to specialize
-SgAsmElfSection and override or augment a few of the virtual
-functions.
-
-We need to override two functions. First, the calculate\_sizes()
-function should return the size we need to store the
-instructions. We'll treat the instructions as an array of entries each
-entry being one byte of the instruction stream. In other words, each
-``entry'' is one byte in length consisting of one required byte and no
-optional bytes.
-
-We need to also override the unparse() method since the base class
-will just fill the ``.text'' section with zeros. The
-SgAsmGenericSection::write method we use will write the instructions
-starting at the first byte of the section.
-
-Finally, we need to augment the reallocate() method. This method is
-reponsible for allocating space in the file for the section and
-performing any other necessary pre-unparsing actions. We don't need to
-allocate space since the base class's method will take care of that in
-conjuction with our version of calculate\_sizes(), but we do need to
-set a special ELF flag (SHF\_ALLOC) in the ELF Segment Table entry for
-this section. There's a few ways to accomplish this. We do it this way
-because the ELF Section Table Entry is not created until later and we
-want to demonstrate how to keep all .text-related code in close
-proximity.
-
-\begin{verbatim}
-class TextSection : public SgAsmElfSection {
-public:
-    TextSection(SgAsmElfFileHeader *fhdr, size_t ins_size, const unsigned char *ins_bytes)
-	: SgAsmElfSection(fhdr), ins_size(ins_size), ins_bytes(ins_bytes)
-	{}
-    virtual rose_addr_t calculate_sizes(size_t *entsize, size_t *required, size_t *optional, size_t *entcount) const {
-	if (entsize)  *entsize  = 1;                        /* an "entry" is one byte of instruction */
-	if (required) *required = 1;                        /* each "entry" is also stored in one byte of the file */
-	if (optional) *optional = 0;                        /* there is no extra data per instruction byte */
-	if (entcount) *entcount = ins_size;                 /* number of "entries" is the total instruction bytes */
-	return ins_size;                                    /* return value is section size required */
-    }
-    virtual bool reallocate() {
-	bool retval = SgAsmElfSection::reallocate();        /* returns true if size or position of any section changed */
-	SgAsmElfSectionTableEntry *ste = get_section_entry();
-	ste->set_sh_flags(ste->get_sh_flags() | 0x02); /* set the SHF_ALLOC bit */
-	return retval;
-    }
-    virtual void unparse(std::ostream &f) const {
-	write(f, 0, ins_size, ins_bytes);                   /* Write the instructions at offset zero in section */
-    }
-    size_t ins_size;
-    const unsigned char *ins_bytes;
-};
-\end{verbatim}
-
-The section constructors and reallocators don't worry about alignment
-issues--they always allocate from the next available byte. However,
-instructions typically need to satisfy some alignment constraints. We
-can easily adjust the file offset chosen by the constructor, but we
-also need to tell the reallocator about the alignment constraint. Even
-if we didn't ever resize the ``.text'' section the reallocator could
-be called for some other section in such a way that it needs to move
-the ``.text'' section to a new file offset.
-
-For the purpose of this tutorial we want to be very picky about the
-location of the ELF Segment Table. We want it to immediately follow
-the ELF File Header without any intervening bytes of padding. At the
-current time, the ELF File Header has a size of one byte and will
-eventually be reallocated. When we reallocate the header the
-subsequent sections will need to be shifted to higher file
-offsets. When this happens, the allocator shifts them all by the same
-amount taking care to satisfy all alignment constraints, which means
-that an alignment constraint of byte bytes on the ``.text'' section
-will induce a similar alignment on the ELF Segment Table. Since we
-don't want that, the best practice is to call reallocate() now, before
-we create the ``.text'' section.
-
-\begin{verbatim}
-ef->reallocate();                                           /* Give existing sections a chance to allocate file space */
-static const unsigned char instructions[] = {0xb8, 0x01, 0x00, 0x00, 0x00, 0xbb, 0x56, 0x00, 0x00, 0x00, 0xcd, 0x80};
-SgAsmElfSection *text = new TextSection(fhdr, NELMTS(instructions), instructions);
-text->set_purpose(SgAsmGenericSection::SP_PROGRAM);         /* Program-supplied text/data/etc. */
-text->set_offset(alignUp(text->get_offset(), 4));           /* Align on an 8-byte boundary */
-text->set_file_alignment(4);                                /* Tell reallocator about alignment constraint */
-text->set_mapped_alignment(4);                              /* Alignment constraint for memory mapping */
-text->set_mapped_rva(base_va+text->get_offset());           /* Mapped address is based on file offset */
-text->set_mapped_size(text->get_size());                    /* Mapped size is same as file size */
-text->set_mapped_rperm(true);                               /* Readable */
-text->set_mapped_wperm(false);                              /* Not writable */
-text->set_mapped_xperm(true);                               /* Executable */
-\end{verbatim}
-
-At this point the text section doesn't have a name. We want to name it
-``.text'' and we want those characters to eventually be stored in the
-ELF file in a string table which we'll provide later. In ELF, section
-names are represented by the section's entry in the ELF Section Table
-as an offset into an ELF String Table for a NUL-terminated ASCII
-string. ROSE manages strings using the SgAsmGenericString class, which
-has two subclasses: one for strings that aren't stored in the
-executable file (SgAsmBasicString) and one for strings that are stored
-in the file (SgAsmStoredString). Both are capable of string an
-std::string value and querying its byte offset (although
-SgAsmBasicString::get\_offset() will always return
-SgAsmGenericString::unallocated).  Since we haven't added the
-``.text'' section to the ELF Section Table yet the new section has an
-SgAsmBasicString name. We can assign a string to the name now and the
-string will be allocated in the ELF file when we've provided further
-information.
-
-\begin{verbatim}
-text->get_name()->set_string(".text");
-\end{verbatim}
-
-The ELF File Header needs to know the virtual address at which to
-start running the program. In ROSE, virtual addresses can be attached
-to a specific section so that if the section is ever moved the address
-is automatically updated. Some formats allow more than one entry
-address which is why the method is called add\_entry\_rva() rather than
-set\_entry\_rva(). ELF, however, only allows one entry address.
-
-\begin{verbatim}
-rose_rva_t entry_rva(text->get_mapped_rva(), text);
-fhdr->add_entry_rva(entry_rva);
-\end{verbatim}
-
-\section{Constructing a LOAD Segment}
-
-ELF Segments define parts of an executable file that should be mapped
-into memory by the loader.  A program will typically have a LOAD
-segment that begins at the first byte of the file and continues
-through the last instruction (in our case, the end of the ``.text''
-section) and which is mapped to virtual address 0x400000.
-
-We've already created the ELF Segment Table, so all we need to do now
-is create an ELF Segment and add it to the ELF Segment Table. ELF
-Segments, like ELF Sections, are represented by SgAsmElfSection. An
-SgAsmElfSection is an ELF Section if it has an entry in the ELF
-Section Table, and/or it's an ELF Segment if it has an entry in the
-ELF Segment Table. The methods get\_section\_entry() and
-get\_segment\_entry() retrieve the actual entries in those tables.
-
-Recall that the constructor creates new sections located at the
-current end-of-file and containing one byte. Our LOAD segment needs to
-have a different offset and size.
-
-\begin{verbatim}
-SgAsmElfSection *seg1 = new SgAsmElfSection(fhdr);          /* ELF Segments are represented by SgAsmElfSection */
-seg1->get_name()->set_string("LOAD");                       /* Segment names aren't saved (but useful for debugging) */
-seg1->set_offset(0);                                        /* Starts at beginning of file */
-seg1->set_size(text->get_offset() + text->get_size());      /* Extends to end of .text section */
-seg1->set_mapped_rva(base_va);                              /* Typically mapped by loader to this memory address */
-seg1->set_mapped_size(seg1->get_size());                    /* Make mapped size match size in the file */
-seg1->set_mapped_rperm(true);                               /* Readable */
-seg1->set_mapped_wperm(false);                              /* Not writable */
-seg1->set_mapped_xperm(true);                               /* Executable */
-segtab->add_section(seg1);                                  /* Add definition to ELF Segment Table */
-\end{verbatim}
-
-\section{Constructing a PAX Segment}
-
-This documentation shows how to construct a generic ELF Segment,
-giving it a particular file offset and size. ELF Segments don't have
-names stored in the file, but we can assign a name to the AST node to
-aid in debugging--it just won't be written out. When parsing an ELF
-file, segment names are generated based on the type stored in the
-entry of the ELF Segment Table. For a PAX segment we want this type to
-be PT\_PAX\_FLAGS (the default is PT\_LOAD).
-
-\begin{verbatim}
-SgAsmElfSection *pax = new SgAsmElfSection(fhdr);
-pax->get_name()->set_string("PAX Flags");                   /* Name just for debugging */
-pax->set_offset(0);                                         /* Override address to be at zero rather than EOF */
-pax->set_size(0);                                           /* Override size to be zero rather than one byte */
-segtab->add_section(pax);                                   /* Add definition to ELF Segment Table */
-pax->get_segment_entry()->set_type(SgAsmElfSegmentTableEntry::PT_PAX_FLAGS);
-\end{verbatim}
-
-\section{Constructing a String Table}
-
-An ELF String Table always corresponds to a single ELF Section of
-class SgAsmElfStringSection and thus you'll often see the term ``ELF
-String Section'' used interchangeably with ``ELF String Table'' even
-though they're two unique but closely tied classes internally.
-
-When the ELF String Section is created a corresponding ELF String
-Table is also created under the covers. Since string tables manage
-their own memory in reponse to the strings they contain, one should
-never adjust the size of the ELF String Section (it's actually fine to
-enlarge the section and the new space will become free space in the
-string table).
-
-ELF files typically have multiple string tables so that section names
-are in a different section than symbol names, etc. In this tutorial
-we'll create the section names string table, typically called
-``.shstrtab'', but use it for all string storage.
-
-\begin{verbatim}
-SgAsmElfStringSection *shstrtab = new SgAsmElfStringSection(fhdr);
-shstrtab->get_name()->set_string(".shstrtab");
-\end{verbatim}
-
-\section{Constructing an ELF Section Table}
-
-We do this last because we want the ELF Section Table to appear at the
-end of the file and this is the easiest way to achieve that. There's
-really not much one needs to do to create the ELF Section Table other
-than provide the ELF File Header as a parent and supply a string
-table.
-
-The string table we created above isn't activated until we assign it
-to the ELF Section Table. The first SgAsmElfStringSection added to the
-SgAsmElfSectionTable becomes the string table for storing section
-names. It is permissible to add other sections to the table before
-adding the string table.
-
-\begin{verbatim}
-SgAsmElfSectionTable *sectab = new SgAsmElfSectionTable(fhdr);
-sectab->add_section(text);                                  /* Add the .text section */
-sectab->add_section(shstrtab);                              /* Add the string table to store section names. */
-\end{verbatim}
-
-\section{Allocating Space}
-
-Prior to calling unparse(), we need to make sure that all sections
-have a chance to allocate space for themselves, and perform any other
-operations necessary. It's not always possible to determine sizes at
-an earlier time, and most constructors would have declared sizes of
-only one byte.
-
-The reallocate() method is defined in the SgAsmGenericFile class since
-it operates over the entire collection of sections simultaneously. In
-other words, if a section needs to grow then all the sections located
-after it in the file need to be shifted to higher file offsets.
-
-\begin{verbatim}
-ef->reallocate();
-\end{verbatim}
-
-The reallocate() method has a shortcoming (as of 2008-12-19) in that
-it might not correctly update memory mappings in the case when the
-mapping for a section is inferred from the mapping of a containing
-segment. This can happen in our example since the ``.text'' section's
-memory mapping is a function of the LOAD Segment mapping. The
-work-around is to adjust mappings for these situations and then call
-reallocate() one final time. This final reallocate() call won't move
-any sections, but should always be the last thing to call before
-unparsing() (it gives sections a chance to update data dependencies
-which is not possible during unparse() due to its const nature).
-
-\begin{verbatim}
-text->set_mapped_rva(seg1->get_mapped_rva()+(text->get_offset()-seg1->get_offset()));
-ef->reallocate(); /*won't resize or move things this time since we didn't modify much since the last call to reallocate()*/
-\end{verbatim}
-
-\section{Produce a Debugging Dump}
-
-A debugging dump can be made with the following code. This dump will
-not be identical to the one produced by parsing and dumping the
-resulting file since we never parsed a file (a dump contains some
-information that's parser-specific).
-
-\begin{verbatim}
-ef->dump(stdout);
-SgAsmGenericSectionPtrList all = ef->get_sections(true);
-for (size_t i=0; i<all.size(); i++) {
-    fprintf(stdout, "Section %zu:\n", i);
-    all[i]->dump(stdout, "    ", -1);
-}
-\end{verbatim}
-
-\section{Produce the Executable File}
-
-The executable file is produced by unparsing the AST.
-
-\begin{verbatim}
-std::ofstream f("a.out");
-ef->unparse(f);
-\end{verbatim}
-
-Note that the resulting file will not be created with execute
-permission--that must be added manually.
diff --git a/docs/Rose/Tutorial/dwarfDebugSupport.tex b/docs/Rose/Tutorial/dwarfDebugSupport.tex
deleted file mode 100644
index 8a21fc737a1..00000000000
--- a/docs/Rose/Tutorial/dwarfDebugSupport.tex
+++ /dev/null
@@ -1,179 +0,0 @@
-\chapter{Dwarf Debug Support}
-
-% Copied from the Dwarf wikipedia page.
-DWARF is a widely used, standardized debugging data format. DWARF was originally designed
-along with ELF, although it is independent of object file formats. The name is a
-pun on "ELF" that has no official meaning but "may be an acronym for 'Debug With
-Attributed Record Format'".  See Wikipedia for more information about the Dwarf 
-debug format.
-
-This chapter presents the support in ROSE for Dwarf 3 debug information; its 
-representation in the AST and its use in binary analysis tools.  This work is part of
-general work to support as much information as possible about binaries.
-
-In the following sections we use a small example (see figure \ref{Tutorial:dwarfAnalysisExampleSourceCode}) 
-that demonstrates various features of Dwarf. The source code of our binary example is:
-
-\commentout{
-\begin{figure}[!h]
-{\indent
-{\mySmallFontSize
-
-% Do this when processing latex to generate non-html (not using latex2html)
-\begin{latexonly}
-   \lstinputlisting{\TutorialExampleDirectory/dwarfAnalysis.C}
-\end{latexonly}
-
-% Do this when processing latex to build html (using latex2html)
-\begin{htmlonly}
-   \verbatiminput{\TutorialExampleDirectory/dwarfAnalysis.C}
-\end{htmlonly}
-
-% end of scope in font size
-}
-% End of scope in indentation
-}
-\caption{Example source code (typical for reading in a binary or source file).}
-\label{Tutorial:dwarfAnalysisExampleSourceCode}
-\end{figure}
-}
-
-\begin{figure}[!h]
-{\indent
-{\mySmallFontSize
-
-% Do this when processing latex to generate non-html (not using latex2html)
-\begin{latexonly}
-   \lstinputlisting{\TutorialExampleDirectory/inputCode_dwarfAnalysis.C}
-\end{latexonly}
-
-% Do this when processing latex to build html (using latex2html)
-\begin{htmlonly}
-   \verbatiminput{\TutorialExampleDirectory/inputCode_dwarfAnalysis.C}
-\end{htmlonly}
-
-% end of scope in font size
-}
-% End of scope in indentation
-}
-\caption{Example source code used to generate Dwarf AST for analysis.}
-\label{Tutorial:dwarfAnalysisExampleSourceCode}
-\end{figure}
-
-
-Much larger binaries can be analyzed, but such larger binary executables are more
-difficult to present (in this tutorial).
-
-
-\section{ROSE AST of Dwarf IR nodes}
-
-   ROSE tools process the binary into an AST that is used to represent all the
-information in the binary executable.  Figure \ref{Tutorial:Dwarf_AST_example}
-shows the subset of that AST (which includes the rest of the binary file format
-and the disassembled instructions) that is specific to Dwarf.  A command line option
-({\em -rose:visualize\_dwarf\_only}) is used to restrict the generated dot file 
-visualization to just the Dwarf information. This option is used in combination with 
-{\em -rose:read\_executable\_file\_format\_only} to process only the binary file format
-(thus skipping the instruction disassembly).
-
-\begin{figure}[h]
-{\indent
-{\mySmallFontSize
-
-% Do this when processing latex to generate non-html (not using latex2html)
-\begin{latexonly}
-%  \includegraphics[scale=0.9]{\TutorialExampleBuildDirectory/inputCode_dwarfAnalysis}
-   \includegraphics[viewport=5 1 50 500,scale=0.9]{\TutorialExampleBuildDirectory/inputCode_dwarfAnalysis}
-\end{latexonly}
-
-% Do this when processing latex to build html (using latex2html)
-\begin{htmlonly}
-   \includegraphics{\TutorialExampleBuildDirectory/inputCode_dwarfAnalysis}
-\end{htmlonly}
-
-% end of scope in font size
-}
-% End of scope in indentation
-}
-\caption{Dwarf AST (subset of ROSE binary AST).}
-\label{Tutorial:Dwarf_AST_example}
-\end{figure}
-
-
-
-\section{Source Position to Instruction Address Mapping}
-
-   One of the valuable parts of Dwarf is the mapping between the 
-source lines and the instruction addresses at a statement level
-(provided in the {\em .debug\_line} section).
-Even though Dwarf does not represent all statements in the source
-code, the mapping is significantly finer granularity than that
-provided at only the function level by the symbol table (which
-identifies the functions by instruction address, but not the 
-source file line numbers; the later requires source code analysis).
-
-The example code in \ref{Tutorial:dwarfInstructionAddressToSourceLineExampleSourceCode}
-shows the mapping between the source code lines and the instruction addresses.
-
-\fixme{This need to be improved to correctly return sets of lines and sets of addresses in
-       what might be a second interface.}
-
-\begin{figure}[!h]
-{\indent
-{\mySmallFontSize
-
-% Do this when processing latex to generate non-html (not using latex2html)
-\begin{latexonly}
-   \lstinputlisting{\TutorialExampleDirectory/dwarfInstructionAddressToSourceLineAnalysis.C}
-\end{latexonly}
-
-% Do this when processing latex to build html (using latex2html)
-\begin{htmlonly}
-   \verbatiminput{\TutorialExampleDirectory/dwarfInstructionAddressToSourceLineAnalysis.C}
-\end{htmlonly}
-
-% end of scope in font size
-}
-% End of scope in indentation
-}
-\caption{Example source code (typical for reading in a binary or source file).}
-\label{Tutorial:dwarfInstructionAddressToSourceLineExampleSourceCode}
-\end{figure}
-
-Output from the compilation of this test code and running it with the example input
-results in the output shown in figure \ref{Tutorial:dwarfInstructionAddressToSourceLineExampleOutput}.
-This output shows the binary executables instruction address range (binary compiled on
-Linux x86 system), the range of lines of source code used by the binary executable,
-the mapping of a source code range of line numbers to the instruction addresses,
-and the mapping of a range of instruction addresses to the source code line numbers.
-
-%\fixme{Need to handle case of were each query can return a set of line or set of
-%       addresses.  This may be a different interface for simplicty.}
-
-\begin{figure}[!h]
-{\indent
-{\mySmallFontSize
-
-% Do this when processing latex to generate non-html (not using latex2html)
-\begin{latexonly}
-   \lstinputlisting{\TutorialExampleBuildDirectory/inputCode_dwarfAnalysis.out}
-\end{latexonly}
-
-% Do this when processing latex to build html (using latex2html)
-\begin{htmlonly}
-   \verbatiminput{\TutorialExampleBuildDirectory/inputCode_dwarfAnalysis.out}
-\end{htmlonly}
-
-% end of scope in font size
-}
-% End of scope in indentation
-}
-\caption{Example source code (typical for reading in a binary or source file).}
-\label{Tutorial:dwarfInstructionAddressToSourceLineExampleOutput}
-\end{figure}
-
-
-
-
-
-
diff --git a/docs/Rose/Tutorial/roseHPCT.tex b/docs/Rose/Tutorial/roseHPCT.tex
deleted file mode 100644
index 2ce177095e7..00000000000
--- a/docs/Rose/Tutorial/roseHPCT.tex
+++ /dev/null
@@ -1,496 +0,0 @@
-%==========================================================================
-\chapter{ROSE-HPCToolKit Interface}
-\label{chap:rosehpct}
-ROSE-HPCToolKit is designed to read in performance data generated
-by HPCToolkit (and recently GNU gprof) and annotate ROSE AST with performance
-metrics.
-It is included in the ROSE distribution and 
-enabled by default if  an existing installation of the Gnome XML library, libxml2
-(\url{http://xmlsoft.org}) can be detected by ROSE's configure script.
-Or it can be enabled explicitly by specifying the \texttt{--enable-rosehpct} option
-when running configure.
-% and be sure that you have an existing installation of the Gnome XML library, libxml2 (\url{http://xmlsoft.org}).
-
-The HPCToolkit (\url{http://www.hipersoft.rice.edu/hpctoolkit}) is a
-set of tools for analyzing the dynamic performance behavior of
-applications. It includes a tool that instruments a program's binary,
-in order to observe CPU hardware counters during execution; additional
-post-processing tools attribute the observed data to statements in the
-original source code. HPCToolkit stores this data and the source
-attributions in XML files. In this chapter, we give an overview of
-simple interfaces in ROSE that can read this data and attach it to the
-AST.
-
-GNU gprof is a basic but easy to use profiling tool.
-It produces an execution profile of applications. 
-gprof's output is a flat profile for each function by default, which is not
-very interesting to us.  
-We use a line-by-line output with full file path information generated by using
-option {\tt -l -L} with gprof.
-
-\input{\TutorialExampleBuildDirectory/roseHPCT/is-static}
-
-%==========================================================================
-\section{An HPCToolkit Example Run}
-\label{chap:rosehpct:run}
-
-%--------------------------------------------------------------------------
-\begin{figure}[!h]
-{\indent
-{\mySmallFontSize
-% Do this when processing latex to generate non-html (not using latex2html)
-\begin{latexonly}
-   \lstinputlisting[language=C,numbers=left,stepnumber=5]{\TutorialExampleBuildDirectory/roseHPCT/profiled.c.aa}
-\end{latexonly}
-
-% Do this when processing latex to build html (using latex2html)
-\begin{htmlonly}
-   \verbatiminput{\TutorialExampleBuildDirectory/roseHPCT/profiled.c.aa}
-\end{htmlonly}
-
-% end of scope in font size
-}
-% End of scope in indentation
-}
-\caption{profiled.c (part 1 of 2): Sample input program, profiled using the HPCToolkit.}
-\label{Tutorial:roseHPCT:profiled:aa}
-\end{figure}
-%--------------------------------------------------------------------------
-
-%--------------------------------------------------------------------------
-\begin{figure}[!h]
-{\indent
-{\mySmallFontSize
-% Do this when processing latex to generate non-html (not using latex2html)
-\begin{latexonly}
-   \lstinputlisting[language=C,numbers=left,stepnumber=5,firstnumber=66]{\TutorialExampleBuildDirectory/roseHPCT/profiled.c.ab}
-\end{latexonly}
-
-% Do this when processing latex to build html (using latex2html)
-\begin{htmlonly}
-   \verbatiminput{\TutorialExampleBuildDirectory/roseHPCT/profiled.c.ab}
-\end{htmlonly}
-
-% end of scope in font size
-}
-% End of scope in indentation
-}
-\caption{profiled.c (part 2 of 2): Sample input program, profiled using the HPCToolkit.}
-\label{Tutorial:roseHPCT:profiled:ab}
-\end{figure}
-%--------------------------------------------------------------------------
-
-Consider the sample source program shown in
-Figures~\ref{Tutorial:roseHPCT:profiled:aa}--\ref{Tutorial:roseHPCT:profiled:ab}.
-This program takes an integer $n$ on the command line, and has a
-number of loops whose flop and memory-operation complexity are either
-$\Theta(n)$ or $\Theta(n^2)$. For this example, we would expect the
-loop nest at line 56, which has $O(n^2)$ cost, to be the most
-expensive loop in the program for large $n$.
-
-%--------------------------------------------------------------------------
-\begin{figure}[!h]
-{\indent
-{\mySmallFontSize
-% Do this when processing latex to generate non-html (not using latex2html)
-\begin{latexonly}
-   \lstinputlisting[language=XML,numbers=left,stepnumber=5]{\TutorialExampleBuildDirectory/roseHPCT/PAPI_TOT_CYC.xml.aa}
-\end{latexonly}
-
-% Do this when processing latex to build html (using latex2html)
-\begin{htmlonly}
-   \verbatiminput{\TutorialExampleBuildDirectory/roseHPCT/PAPI_TOT_CYC.xml.aa}
-\end{htmlonly}
-
-% end of scope in font size
-}
-% End of scope in indentation
-}
-\caption{XML schema for HPCToolkit data files: This schema, prepended
-to each of the HPCToolkit-generated XML files, describes the format of
-the profiling data. This particular schema was generated by HPCToolkit
-1.0.4.}
-\label{Tutorial:roseHPCT:xml:schema}
-\end{figure}
-%--------------------------------------------------------------------------
-
-%--------------------------------------------------------------------------
-\begin{figure}[!h]
-{\indent
-{\mySmallFontSize
-% Do this when processing latex to generate non-html (not using latex2html)
-\begin{latexonly}
-   \lstinputlisting[language=XML,numbers=left,stepnumber=5,firstnumber=62]{\TutorialExampleBuildDirectory/roseHPCT/PAPI_TOT_CYC.xml.ab}
-\end{latexonly}
-
-% Do this when processing latex to build html (using latex2html)
-\begin{htmlonly}
-   \verbatiminput{\TutorialExampleBuildDirectory/roseHPCT/PAPI_TOT_CYC.xml.ab}
-\end{htmlonly}
-
-% end of scope in font size
-}
-% End of scope in indentation
-}
-\caption{PAPI\_TOT\_CYC.xml: Sample cycle counts observed during
-profiling, generated from running the HPCToolkit on profiled.c
-(Figures~\ref{Tutorial:roseHPCT:profiled:aa}--\ref{Tutorial:roseHPCT:profiled:ab}.)
-These lines would appear after the schema shown in
-Figure~\ref{Tutorial:roseHPCT:xml:schema}.}
-\label{Tutorial:roseHPCT:xml:cycles}
-\end{figure}
-%--------------------------------------------------------------------------
-
-%--------------------------------------------------------------------------
-\begin{figure}[!h]
-{\indent
-{\mySmallFontSize
-% Do this when processing latex to generate non-html (not using latex2html)
-\begin{latexonly}
-   \lstinputlisting[language=XML,numbers=left,stepnumber=5,firstnumber=62]{\TutorialExampleBuildDirectory/roseHPCT/PAPI_FP_OPS.xml.ab}
-\end{latexonly}
-
-% Do this when processing latex to build html (using latex2html)
-\begin{htmlonly}
-   \verbatiminput{\TutorialExampleBuildDirectory/roseHPCT/PAPI_FP_OPS.xml.ab}
-\end{htmlonly}
-
-% end of scope in font size
-}
-% End of scope in indentation
-}
-\caption{PAPI\_FP\_OPS.xml: Sample flop counts observed during
-profiling, generated from running the HPCToolkit on profiled.c
-(Figures~\ref{Tutorial:roseHPCT:profiled:aa}--\ref{Tutorial:roseHPCT:profiled:ab}.)
-These lines would appear after the schema shown in
-Figure~\ref{Tutorial:roseHPCT:xml:schema}.}
-\label{Tutorial:roseHPCT:xml:flops}
-\end{figure}
-%--------------------------------------------------------------------------
-
-Suppose we use the HPCToolkit to profile this program, collecting
-cycle counts and floating-point instructions.\footnote{In this
-example, HPCToolkit uses the PAPI to read CPU counters
-(\url{http://icl.cs.utk.edu/papi}).} HPCToolkit will generate one XML
-file for each metric.
-
-A schema specifying the format of these XML files appears in
-Figure~\ref{Tutorial:roseHPCT:xml:schema}. In essence, this schema
-specifies that the XML file will contain a structured, abstract
-representation of the program in terms of abstract program entities
-such as ``modules,'' ``procedures,'' ``loops,'' and ``statements.''
-Each of these entities may have line number information and a
-``metric'' value. (Refer to the HPCToolkit documentation for more
-information.) This schema is always the first part of an
-HPCToolkit-generated XML profile data file.
-
-We ran HPCToolkit on the program in
-Figures~\ref{Tutorial:roseHPCT:profiled:aa}--\ref{Tutorial:roseHPCT:profiled:ab},
-and collected cycle and flop counter data. The actual XML files
-storing this data appear in Figures~\ref{Tutorial:roseHPCT:xml:cycles}
-and~\ref{Tutorial:roseHPCT:xml:flops}. By convention, these metrics
-are named according to their PAPI symbolic name, as shown on line 67
-in both Figures~\ref{Tutorial:roseHPCT:xml:cycles}
-and~\ref{Tutorial:roseHPCT:xml:flops}. According to the cycle data on
-line 90 of Figure~\ref{Tutorial:roseHPCT:xml:cycles}, the most
-expensive statement in profiled.c is line 62 of
-Figure~\ref{Tutorial:roseHPCT:profiled:aa}, as expected.
-
-%==========================================================================
-\clearpage
-\section{Attaching HPCToolkit Data to the ROSE AST}
-\label{chap:rosehpct:attach}
-
-To attach the data of Figures~\ref{Tutorial:roseHPCT:xml:cycles}
-and~\ref{Tutorial:roseHPCT:xml:flops} to the AST, we augment a basic
-ROSE translator with two additional calls, as shown in
-Figure~\ref{Tutorial:roseHPCT:attach}, lines 47--48 and 54. We
-describe these calls below.
-
-%--------------------------------------------------------------------------
-\begin{figure}[!h]
-{\indent
-{\mySmallFontSize
-
-
-% Do this when processing latex to generate non-html (not using latex2html)
-\begin{latexonly}
-   \lstinputlisting[numbers=left,stepnumber=5]{\TutorialExampleDirectory/roseHPCT/attachMetrics.cc}
-\end{latexonly}
-
-% Do this when processing latex to build html (using latex2html)
-\begin{htmlonly}
-   \verbatiminput{\TutorialExampleDirectory/roseHPCT/attachMetrics.cc}
-\end{htmlonly}
-
-% end of scope in font size
-}
-% End of scope in indentation
-}
-\caption{attachMetrics.cc: Sample translator to attach HPCToolkit metrics to the AST.}
-\label{Tutorial:roseHPCT:attach}
-\end{figure}
-%--------------------------------------------------------------------------
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-\subsection{Calling ROSE-HPCT}
-
-We must first include rosehpct/rosehpct.hh, as shown on line 6 of
-Figure~\ref{Tutorial:roseHPCT:attach}. All ROSE-HPCT routines and
-intermediate data structures reside in the RoseHPCT namespace.
-
-Next, lines 47--48 of Figure~\ref{Tutorial:roseHPCT:attach} store the
-contents of the raw XML file into an intermediate data structure of
-type RoseHPCT::ProgramTreeList\_t. The RoseHPCT::loadProfilingFiles()
-routine processes command-line arguments, extracting
-ROSE-HPCT-specific options that specify the files. We discuss these
-options in Section~\ref{sec:rosehpct:cmdlineopts}.
-
-Line 54 of Figure~\ref{Tutorial:roseHPCT:attach}, attaches the
-intermediate profile data structure to the ROSE AST. The
-RoseHPCT::attachMetrics() routine creates new persistent attributes
-that store the counter data.\footnote{The last parameter to
-RoseHPCT::attachMetrics() is a boolean that, when true, enables
-verbose (debugging) messages to standard error.}  The attributes are
-named using the metric name taken from the XML file (see lines 67 of
-Figures~\ref{Tutorial:roseHPCT:xml:cycles}--\ref{Tutorial:roseHPCT:xml:flops});
-in this example, the attributes are named PAPI\_TOT\_CYC and
-PAPI\_FP\_OPS. Following the conventions of persistent attribute
-mechanism as described in Chapter~\ref{chap:traversals}, the
-attributes themselves are of type RoseHPCT::MetricAttr, which derives
-from the AstAttribute type.
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-\subsection{Retrieving the attribute values}
-
-We retrieve the attribute values as described in
-Chapter~\ref{chap:traversals}.  In particular, given a located node
-with cycle and flop attribute values, the printFlopRate() routine
-defined in lines 11--42 of Figure~\ref{Tutorial:roseHPCT:attach}
-prints the source position, AST node type, and estimated flops per
-cycle. We call printFlopRate() for each expression statement
-(SgExpressionStmt), for-initializer (SgForInitStatement), and
-for-statement (SgForStatement) in lines 59--66 of
-Figure~\ref{Tutorial:roseHPCT:attach}. The output is shown in
-Figure~\ref{Tutorial:roseHPCT:profiled:out}.
-
-Inspecting the output carefully, you may notice seeming discrepancies
-between the values shown and the values that appear in the XML files,
-or other values which seem unintuitive. We explain how these values
-are derived in Section~\ref{sec:rosehpct:metprop}.
-
-This example dumps the AST as a PDF file, as shown on line 68 of
-Figure~\ref{Tutorial:roseHPCT:attach}. You can inspect this file to
-confirm where attributes have been attached. We show an example of
-such a page in Figure~\ref{Tutorial:roseHPCT:pdf}. This page is the
-SgExprStatement node representing the sum-accumulate on line 26 of
-Figure~\ref{Tutorial:roseHPCT:profiled:aa}.
-
-\begin{figure}[!ht]
-{\mySmallFontSize
-  \verbatiminput{\TutorialExampleBuildDirectory/roseHPCT/profiled.out}
-}
-\caption{Sample output, when running attachMetrics.cc
-(Figure~\ref{Tutorial:roseHPCT:attach}) with the XML inputs in
-Figures~\ref{Tutorial:roseHPCT:xml:cycles}--\ref{Tutorial:roseHPCT:xml:flops}. Here,
-we only show the output sent to standard output (\emph{i.e.}, cout and
-not cerr).}
-\label{Tutorial:roseHPCT:profiled:out}
-\end{figure}
-
-\begin{figure}[!hb]
-\includegraphics[width=6in,trim=0in 7.8in 2in 0in, clip]{\TutorialExampleBuildDirectory/roseHPCT/profiled-p93.pdf}
-\caption{Sample PDF showing attributes.}
-\label{Tutorial:roseHPCT:pdf}
-\end{figure}
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-\subsection{Metric propagation}
-\label{sec:rosehpct:metprop}
-
-The example program in Figure~\ref{Tutorial:roseHPCT:attach} dumps
-metric values at each expression statement, for-initializer, and
-for-statement, but the input XML files in
-Figure~\ref{Tutorial:roseHPCT:xml:cycles}--\ref{Tutorial:roseHPCT:xml:flops}
-only attribute the profile data to ``statements'' that are not loop
-constructs. (The \texttt{<S \ldots>} XML tags refer to statements,
-intended to be ``simple'' non-scoping executable statements; a
-separate \texttt{<L \ldots>} tag would refer to a loop.) Since the XML
-file specifies statements only by source line number,
-RoseHPCT::attachMetrics() attributes measurements to AST nodes in a
-heuristic way.
-
-For example, lines 78--80 of Figure~\ref{Tutorial:roseHPCT:xml:cycles}
-indicate that all executions of the ``simple statements'' of line 25
-of the original source (Figure~\ref{Tutorial:roseHPCT:profiled:aa})
-accounted for 65534 observed cycles, and that line 26 accounted for an
-additional 65534 cycles. In the AST, there are multiple ``statement''
-and expression nodes that occur on line 25; indeed,
-Figure~\ref{Tutorial:roseHPCT:profiled:out} lists 4 such
-statements.
-
-The ROSE-HPCT modules uses a heuristic which only assigns \texttt{<S
-\ldots>} metric values to non-scoping nodes derived from
-SgStatement. When multiple SgStatement nodes occur at a particular
-source line, 
-%ROSE-HPCT simply divides the observed metric equally among all the SgStatement nodes on that line.
-ROSE-HPCT simply attaches the metric to each of them. 
-But only one of them will be used for propagating metrics to parent scopes.
-
-How is the measurement of 65534 cycles attributed to all of the AST
-nodes corresponding to line 25 of
-Figure~\ref{Tutorial:roseHPCT:profiled:aa}? Indeed, line 25 actually
-``contains'' four different SgStatement nodes: an SgForStatement
-representing the whole loop on lines 25--26, an SgForInitStatement
-(initializer), and two SgExprStatements (one which is a child of the
-SgForInitStatement, and another for the for-loop's test
-expression). The loop's increment is stored in the SgForStatement node
-as an SgExpression, not an SgStatement. The SgForStatement node is a
-scoping statement, and so it ``receives'' none of the 65534
-cycles. Since the increment is not a statement and one of the
-SgExprStatements is a child of the initializer, this leaves only two
-direct descendants of the SgForStatement---the initializer and the
-test expression statement---among which to divide the 65534
-cycles. Thus, each receives 32767 cycles. The initializer's
-SgExprStatement child gets the same 32767 as its parent, since the two
-nodes are equivalent (see first two cases of
-Figure~\ref{Tutorial:roseHPCT:profiled:out}).
-
-For the entire loop on lines 25--26 of
-Figure~\ref{Tutorial:roseHPCT:profiled:aa}, the original XML files
-attribute 65534 cycles to line 25, and another 65534 cycles to line 26
-(see Figure~\ref{Tutorial:roseHPCT:xml:cycles}). Moreover, the XML
-files do not attribute any costs to this loop \emph{via} an explicit
-\texttt{<L \ldots>} tag. Thus, the best we can infer is that the
-entire for-statement's costs is the sum of its immediate child costs;
-in this case, 131068 cycles. The RoseHPCT::attachMetrics() routine
-will heuristically accumulate and propagate metrics in this way to
-assign higher-level scopes approximate costs.
-
-The RoseHPCT::attachMetrics() routine automatically propagates metric
-values through parent scopes. A given metric attribute,
-RoseHPCT::MetricAttr* x, is ``derived'' through propagation if
-x-$>$isDerived() returns true. In fact, if you call x-$>$toString() to
-obtain a string representation of the metric's value, two asterisks
-will be appended to the string as a visual indicator that the metric
-is derived. We called RoseHPCT::MetricAttr::toString() on lines 27 and
-29 of Figure~\ref{Tutorial:roseHPCT:attach}, and all of the
-SgForStatement nodes appearing in the output in
-Figure~\ref{Tutorial:roseHPCT:profiled:out} are marked as derived.
-
-Alternatively, you cann call RoseHPCT::attachMetricsRaw(), rather than
-calling RoseHPCT::attachMetrics().  The ``raw'' routine takes the same
-arguments but only attaches the raw data, \emph{i.e.}, without
-attempting to propagate metric values through parent scopes.
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-\section{Working with GNU gprof}
-ROSE-HPCT can also accept the line-by-line profiling output generated by
-GNU gprof. 
-Currently, we only use the self seconds associated with each line
-and attach them to ROSE AST as AST attributes named {\tt WALLCLK}.
-
-A typical session to generate compatible gprof profiling file for ROSE-HPCT
-is given below:
-\begin{verbatim}
-[liao@codes]$ gcc -g seq-pi.c -pg
-[liao@codes]$ ./a.out
-[liao@codes]$ gprof -l -L a.out gmon.out &>profile.result
-\end{verbatim}
-
-{\tt -l} tells gprof to output line-by-line profiling information and {\tt
--L} causes gprof to output full file path information. 
-
-An excerpt of an output file looks like the following:
-{\scriptsize
-\begin{verbatim}
-Flat profile:
-
-Each sample counts as 0.01 seconds.
-  %   cumulative   self              self     total
- time   seconds   seconds    calls  Ts/call  Ts/call  name
- 38.20      8.84     8.84                             jacobi (/home/liao6/temp/jacobi.c:193 @ 804899c)
- 36.43     17.27     8.43                             jacobi (/home/liao6/temp/jacobi.c:196 @ 8048a3f)
- 11.00     19.82     2.54                             jacobi (/home/liao6/temp/jacobi.c:188 @ 804893e)
-  5.66     21.12     1.31                             jacobi (/home/liao6/temp/jacobi.c:187 @ 8048968)
-  3.93     22.04     0.91                             jacobi (/home/liao6/temp/jacobi.c:197 @ 8048a71)
-  3.24     22.79     0.75                             jacobi (/home/liao6/temp/jacobi.c:191 @ 8048a7f)
-  0.95     23.00     0.22                             jacobi (/home/liao6/temp/jacobi.c:186 @ 8048976)
-  0.50     23.12     0.12                             jacobi (/home/liao6/temp/jacobi.c:187 @ 8048935)
-  0.09     23.14     0.02                             jacobi (/home/liao6/temp/jacobi.c:190 @ 8048a94)
-  0.00     23.14     0.00        1     0.00     0.00  driver (/home/liao6/temp/jacobi.c:91 @ 8048660)
-  0.00     23.14     0.00        1     0.00     0.00  error_check (/home/liao6/temp/jacobi.c:220 @ 8048b7c)
-  0.00     23.14     0.00        1     0.00     0.00  initialize (/home/liao6/temp/jacobi.c:116 @ 8048722)
-  0.00     23.14     0.00        1     0.00     0.00  jacobi (/home/liao6/temp/jacobi.c:160 @ 8048892)
-\end{verbatim}
-}
-
-%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-\section{Command-line options}
-\label{sec:rosehpct:cmdlineopts}
-
-The call to RoseHPCT::loadProfilingFiles() on line 49 of
-Figure~\ref{Tutorial:roseHPCT:attach} processes and extracts
-ROSE-HPCT-specific command-line options. To generate the output in
-this chapter, we invoked Figure~\ref{Tutorial:roseHPCT:attach} with
-the following command-line:
-
-\verbatiminput{\TutorialExampleBuildDirectory/roseHPCT/command-line}
-
-The main option is \texttt{-rose:hpct:prof <file>}, which specifies
-the HPCToolkit-generated XML file containing metric data. Here, we use
-this option twice to specify the names of the cycle and flop data
-files
-(Figures~\ref{Tutorial:roseHPCT:xml:cycles}--\ref{Tutorial:roseHPCT:xml:flops}).
-To accept gprof output file, please use another option \texttt{-rose:gprof:linebyline <file>}. 
-This option cannot be used with \texttt{-rose:hpct:prof <file>} currently.
-
-We need the other option, \texttt{-rose:hpct:eqpath <A>=<B>}, to
-specify how paths in the HPCToolkit XML files can be mapped to file
-paths in the ROSE AST. 
-This option allows users to generate performance files on one machine and 
-analyze the results on another machine.
-In this example, the XML
-files specify the source file as, ``./profiled.c'' (line 73 of
-Figures~\ref{Tutorial:roseHPCT:xml:cycles}
-and~\ref{Tutorial:roseHPCT:xml:flops}); the ``eqpath'' command-line
-option above remaps the relative path ``.'' to an absolute path as it
-would appear in the ROSE AST.
-Another example is to use the same performance file even after the original source tree is moved to another location.
-ROSE-HPCT can still correctly match performance data if the root source paths are given as \texttt{-rose:hpct:eqpath <oldRootPath>=<newRootPath>}.
-
-Yet another option  \texttt{-rose:hpct:enable\_debug} is provided to display runtime debugging information
-such as metrics reading, attaching, and propagating.
-It also adds performance metrics into the ROSE output source file as source comments as shown below. 
-Users can examine the source comments to make sure performance metrics are attached and propagated properly.
-As we can see, ROSE-HPCT attaches each performance metric to each matching statement. 
-If there are multiple statements showing in the same line, the same metric will be attached to each of them.
-The metric propagation step will only propagate one of them to upper-level language constructs to ensure the correctness.
-
-{\scriptsize
-\begin{verbatim}
-/* ROSE-HPCT propagated metrics WALLCLK:18.95[SgForStatement at 0xb7beb218] */
-  for (
-/* ROSE-HPCT raw data: Statement  WALLCLK:0.02@File jacobi.c  190-0 -> SgForInitStatement 0x94e8d08 at 190 */
-i = 1;
-/* ROSE-HPCT raw data: Statement  WALLCLK:0.02@File jacobi.c  190-0 -> SgExprStatement 0x94516d8 at 190 */
-i < (n - 1); i++)
-/* ROSE-HPCT propagated metrics WALLCLK:18.93[SgForStatement at 0xb7beb29c] */
-    for (
-/* ROSE-HPCT raw data: Statement  WALLCLK:0.75@File jacobi.c  191-0 -> SgForInitStatement 0x94e8d38 at 191 */
-j = 1;
-/* ROSE-HPCT raw data: Statement  WALLCLK:0.75@File jacobi.c  191-0 -> SgExprStatement 0x9451728 at 191 */
-j < (m - 1); j++)
-/* ROSE-HPCT propagated metrics WALLCLK:18.18[SgBasicBlock at 0x93f60b4] */
-{
-/* ROSE-HPCT raw data: Statement  WALLCLK:8.84@File jacobi.c  193-0 -> SgExprStatement 0x9451750 at 193 */
-      resid = (((((ax * (((( *uold)[i - 1])[j]) + ((( *uold)[i + 1])[j]))) + (ay * (((( *uold)[i])[j - 1]) 
-               + ((( *uold)[i])[j + 1])))) + (b * ((( *uold)[i])[j]))) - ((( *f)[i])[j])) / b);
-/* ROSE-HPCT raw data: Statement  WALLCLK:8.43@File jacobi.c  196-0 -> SgExprStatement 0x9451778 at 196 */
-      (( *u)[i])[j] = (((( *uold)[i])[j]) - (omega * resid));
-/* ROSE-HPCT raw data: Statement  WALLCLK:0.91@File jacobi.c  197-0 -> SgExprStatement 0x94517a0 at 197 */
-      error = (error + (resid * resid));
-    }
-\end{verbatim}
-}
-% eof
diff --git a/docs/Rose/Tutorial/tutorial.tex.in b/docs/Rose/Tutorial/tutorial.tex.in
index 23dba4dde73..d781e726f57 100644
--- a/docs/Rose/Tutorial/tutorial.tex.in
+++ b/docs/Rose/Tutorial/tutorial.tex.in
@@ -331,18 +331,6 @@ debugging.}
 \input{codeCoverage}
 \input{bugSeeding}
 
-%-----------------------------------------------------------
-%          Binary Support
-%-----------------------------------------------------------
-\part[Binary Support]{ Binary Support \\
-\vspace{1.0in}
-\normalsize{Tutorials of using ROSE to handle binary executable files.}
-}
-\input{instructionSemantics}
-\input{binaryAnalysis}
-\input{binaryConstruction}
-\input{dwarfDebugSupport}
-
 %-----------------------------------------------------------
 %          Interacting with Other Tools
 %-----------------------------------------------------------
@@ -351,8 +339,6 @@ debugging.}
 \normalsize{How to build interoperable tools using ROSE.}
 }
 \input{abstractHandle}
-\input{roseHPCT}
-\input{tauInstrumentation}
 
 %-----------------------------------------------------------
 %          Parallelism
diff --git a/docs/Rose/UPCsupport.tex b/docs/Rose/UPCsupport.tex
deleted file mode 100644
index 633c18ae9d8..00000000000
--- a/docs/Rose/UPCsupport.tex
+++ /dev/null
@@ -1,432 +0,0 @@
-\chapter{UPC Support}
-\label{chap::upcsupport}
-
-%-------------------------------------------------------------
-%-------------------------------------------------------------
-\section{Introduction}
-ROSE supports Unified Parallel C (UPC) programs.
-UPC~\cite{UPC:Web} is a famous extension of the C99 programming language to support high performance computing using a partitioned global address space (PGAS) memory model.
-ROSE leverages the EDG frontend to parse input UPC programs and generate EDG IR with UPC extensions.
-It then converts the EDG IR into ROSE's internal AST and provides unparsing support for the AST.
-An example UPC-to-C translator is also provided to demonstrate how one can use ROSE to 
-translate UPC programs into C programs with runtime calls to the Berkeley UPC (BUPC) runtime system V. 2.6.0~\cite{BUPC:Web}.
-More information on UPC is availalbe from the language specification at: 
-\htmladdnormallink{UPC Language Specifications (pdf)}{http://www.gwu.edu/~upc/publications/LBNL-59208.pdf}.
-
-%-------------------------------------------------------------
-%-------------------------------------------------------------
-\section{Supported UPC Constructs}
-% ROSE currently supports all UPC constructs as defined in UPC 1.1.1.
-ROSE currently supports all UPC constructs as defined in UPC 1.2, using
-all the standard header files: {\em upc.h}, {\em upc\_relaxed.h}, {\em upc\_strict.h}, 
-{\em upc\_collective.h}, {\em upc\_io.h}. Additional Non-standard Berkeley 
-UPC extensions are supported using the UCB {\em bupc\_extensions.h} header file.
-
-\footnote{
-The supported version is limited by the EDG
-frontend, which only supports UPC 1.1.1 (\lstinline{__UPC_VERSION__} string
-is defined as 200310L).
-ROSE uses EDG 3.3 currently and it originally only supported UPC 1.0.
-We merged the UPC 1.1.1 support from EDG 3.10 into our EDG 3.3 frontend. 
-%It seems like that the latest EDG 4.0 still only supports UPC 1.1.1 but we
-%can easily extend it to support UPC 1.2 given the minor language changes from 1.1.1 to 1.2.
-We have also added the required wotk to support UPC 1.2. Please let us know if anything is
-left out and we will fix it.}.
-A list of those UPC constructs and their corresponding ROSE AST representations are given below:
-\begin{verbatim}
-MYTHREAD                SgUpcMythread
-THREADS                 SgUpcThreads
-upc_barrier             SgUpcBarrierStatement
-upc_blocksizeof         SgUpcBlocksizeofExpression
-upc_elemsizeof          SgUpcElemsizeofExpression
-upc_fence               SgUpcFenceStatement
-upc_forall              SgUpcForAllStatement
-upc_localsizeof         SgUpcLocalsizeofExpression
-upc_notify              SgUpcNotifyStatement
-upc_wait                SgUpcWaitStatement
-strict/relaxed/shared   SgUPC_AccessModifier
-UPC_MAX_BLOCKSIZE       1073741823 (~1GB)
-\end{verbatim}
-As we can see, most UPC constructs are represented by their corresponding dedicated ROSE AST nodes. 
-A few others, such as \lstinline{strict}, \lstinline{relaxed} and
-\lstinline{shared}, are represented as instances of \lstinline{SgUPC_AccessModifier}.
-\lstinline{UPC_MAX_BLOCKSIZE} is treated as a macro and is expanded to a predefined integer constant value.
-
-Much of the UPC language is supported via UPC specific language runtime
-libraries.  These calls are simply normal functions and not represented 
-as special UPC specific IR nodes.  
-Such runtime library function calls are, in general, 
-not a property of the UPC grammar and thus not represented in the AST 
-as specialized IR nodes.
-The function names are those from the 
-UPC Langauge Specifications and so must be detected based on the function
-name.  No specialized support in currently present in ROSE to classify 
-these function or identify them as UPC secific, but such functionality
-could be easily written. Such support could be added to the SageInteface.
-If users write such specific support they are welcme to contribute it 
-back to ROSE.
-
-Alternatively ROSE provides function identification based on header files
-where the declarations occured and this would be used to automate the recognition of UPC 
-specific runtime support functions.  See the use of the {\em classifyFileName()}
-function in {\em tests/nonsmoke/functional/roseTests/fileLocation\_tests}
-directory for examples of how file names can be classified.  Alternatively,
-just the infomation in the source position reports the file name of the
-original declaration and this can be used to identify specific functions as 
-defined in there associated header files, e.g. {\em upc\_collective.h}, 
-{\em upc\_io.h}, or {\em bupc\_extensions.h}.
-
-%-------------------------------------------------------------
-%-------------------------------------------------------------
-\section{Command Line Options}
-ROSE can automatically recognize a source file with a suffix of \textit{.upc} as a UPC input and turn on its UPC support.
-For other UPC files without the \textit{.upc} extension, a command line
-option (\textit{-rose:UPC\_only or -rose:UPC}) is available to turn on the
-UPC support explicitly.
-In addition, \textit{-rose:upc\_threads n} can be used to enable ROSE's
-support for UPC static threads compilation with n threads.
-
-%-------------------------------------------------------------
-%-------------------------------------------------------------
-\section{Example UPC Code Acceptable for ROSE}
-We give some output after ROSE's source-to-source translation of some example UPC input. 
-These UPC input are actually some of ROSE's daily regression test input available from \textit{ROSE/tests/nonsmoke/functional/CompileTests/UPC\_tests}.
-
-Figure~\ref{Manual:UPC:hello} shows the output of the ROSE
-identityTranslator handling a hello program in UPC.
-\begin{figure}[!h]
-{\indent
-  {\mySmallFontSize
-    \begin{latexonly}
-    \lstinputlisting{\TopBuildDirectory/tests/nonsmoke/functional/CompileTests/UPC_tests/rose_hello.upc}
-    \end{latexonly}
-    \begin{htmlonly}
-    \verbatiminput{\TopBuildDirectory/tests/tests/nonsmoke/functional/CompileTests/UPC_tests/rose_hello.upc}
-    \end{htmlonly}
-  }
-}
-\caption{Output of an UPC hello program}
-\label{Manual:UPC:hello}
-\end{figure}
-
-Figure~\ref{Manual:UPC:strict} shows the handling of UPC language
-constructs related to memory consistency. 
-\begin{figure}[!h]
-{\indent
-  {\mySmallFontSize
-    \begin{latexonly}
-    \lstinputlisting{\TopBuildDirectory/tests/nonsmoke/functional/CompileTests/UPC_tests/rose_consistency.upc}
-    \end{latexonly}
-    \begin{htmlonly}
-    \verbatiminput{\TopBuildDirectory/tests/tests/nonsmoke/functional/CompileTests/UPC_tests/rose_consistency.upc}
-    \end{htmlonly}
-  }
-}
-\caption{Output for UPC strict}
-\label{Manual:UPC:strict}
-\end{figure}
-
-
-Figure~\ref{Manual:UPC:forall1} shows the use of \lstinline{upc_forall}
-with \lstinline{continue} and Figure~\ref{Manual:UPC:forall2} shows the use
-of \lstinline{upc_forall} with \lstinline{affinity}.
-
-\begin{figure}[!h]
-{\indent
-  {\mySmallFontSize
-    \begin{latexonly}
-    \lstinputlisting{\TopBuildDirectory/tests/nonsmoke/functional/CompileTests/UPC_tests/rose_forall_continue.upc}
-    \end{latexonly}
-    \begin{htmlonly}
-    \verbatiminput{\TopBuildDirectory/tests/tests/nonsmoke/functional/CompileTests/UPC_tests/rose_forall_continue.upc}
-    \end{htmlonly}
-  }
-}
-\caption{Output for upc\_forall with continue}
-\label{Manual:UPC:forall1}
-\end{figure}
-
-\begin{figure}[!h]
-{\indent
-  {\mySmallFontSize
-    \begin{latexonly}
-    \lstinputlisting{\TopBuildDirectory/tests/nonsmoke/functional/CompileTests/UPC_tests/rose_forall_affinity.upc}
-    \end{latexonly}
-    \begin{htmlonly}
-    \verbatiminput{\TopBuildDirectory/tests/tests/nonsmoke/functional/CompileTests/UPC_tests/rose_forall_affinity.upc}
-    \end{htmlonly}
-  }
-}
-\caption{Output for upc\_forall with affinity }
-\label{Manual:UPC:forall2}
-\end{figure}
-
-\clearpage
-ROSE's support for various uses of \lstinline{shared} and unshared UPC
-variables is given in
-Figure~\ref{Manual:UPC:sharedaa} and Figure~\ref{Manual:UPC:sharedab}. 
-All kinds of shared, shared to shared, shared to private, and private to
-shared variables can be correctly parsed and unparsed.
-\begin{figure}[!h]
-{\indent
-  {\mySmallFontSize
-    \begin{latexonly}
-    \lstinputlisting{\TopBuildDirectory/tests/nonsmoke/functional/CompileTests/UPC_tests/rose_shared.upc.aa}
-    \end{latexonly}
-    \begin{htmlonly}
-    \verbatiminput{\TopBuildDirectory/tests/tests/nonsmoke/functional/CompileTests/UPC_tests/rose_shared.upc.aa}
-    \end{htmlonly}
-  }
-}
-\caption{Output for UPC shared: part A}
-\label{Manual:UPC:sharedaa}
-\end{figure}
-
-\begin{figure}[!h]
-{\indent
-  {\mySmallFontSize
-    \begin{latexonly}
-    \lstinputlisting{\TopBuildDirectory/tests/nonsmoke/functional/CompileTests/UPC_tests/rose_shared.upc.ab}
-    \end{latexonly}
-    \begin{htmlonly}
-    \verbatiminput{\TopBuildDirectory/tests/tests/nonsmoke/functional/CompileTests/UPC_tests/rose_shared.upc.ab}
-    \end{htmlonly}
-  }
-}
-\caption{Output for UPC shared: part B}
-\label{Manual:UPC:sharedab}
-\end{figure}
-
-\clearpage
-Support for UPC \lstinline{lock}s is demonstrated in
-Figure~\ref{Manual:UPC:lock}. 
-\begin{figure}[!h]
-{\indent
-  {\mySmallFontSize
-    \begin{latexonly}
-    \lstinputlisting{\TopBuildDirectory/tests/nonsmoke/functional/CompileTests/UPC_tests/rose_lock.upc}
-    \end{latexonly}
-    \begin{htmlonly}
-    \verbatiminput{\TopBuildDirectory/tests/tests/nonsmoke/functional/CompileTests/UPC_tests/rose_lock.upc}
-    \end{htmlonly}
-  }
-}
-\caption{Output for UPC Locks}
-\label{Manual:UPC:lock}
-\end{figure}
-
-%-------------------------------------------------------------
-%-------------------------------------------------------------
-\clearpage
-\section{An Example UPC-to-C Translator Using ROSE}
-An example UPC-to-C translator, namely roseupcc, is provided to 
-demonstrate how one can use ROSE to build a translator translating UPC
-programs into C programs with runtime calls to the Berkeley UPC (BUPC)
-runtime system V. 2.6.0. 
-The source files of roseupcc are located in
-\textit{ROSE/projects/UpcTranslation}.
-%roseupcc follows the BUPC runtime interface specification
-%3.10~\cite{BUPC3.10}.
-%we don't reiterate details about why the translation is done in a certain way here. 
-Please be advised that only a subset of UPC (including variable handling) is
-translated currently since the translator is meant to be a starting example.
-Also variable handling is arguably the most difficult part of a UPC
-implementation.
-
-Translation result for the UPC hello program (shown in
-Figure~\ref{Manual:UPC:hello}) is given in Figure~\ref{Manual:UPC:hello-trans}. 
-Mostly, high level \lstinline{SageInterface} functions are used to
-easily translate the ROSE AST. 
-BUPC-specified preprocessing directives, such as \lstinline{#include "upcr.h"} 
-and \lstinline{#define UPCR_WANT_MAJOR 3}, are inserted.
-The original user main function is rewritten to \lstinline{user_main} with
-runtime initialization (\lstinline{UPCR_BEGIN_FUNCTION}) and termination 
-(\lstinline{UPCR_EXIT_FUNCTION}) functions. 
-\lstinline{upc_barrier} is simply replaced with a call to its corresponding
-runtime function \lstinline{upcr_barrier()}.
-\lstinline{UPCRI_ALLOC_filename_xxx()} handles per file UPCRI allocation of
-possible shared variables (none here).  
-\lstinline{UPCRI_INIT_filename_xxx()} function is used for per-file initialization of
-shared and unshared (thread local) data.
-
-\begin{figure}[!h]
-{\indent
-  {\mySmallFontSize
-    \begin{latexonly}
-    \lstinputlisting{\TopBuildDirectory/projects/UpcTranslation/tests/rose_hello.c}
-    \end{latexonly}
-    \begin{htmlonly}
-    \verbatiminput{\TopBuildDirectory/projects/UpcTranslation/tests/rose_hello.c}
-    \end{htmlonly}
-  }
-}
-\caption{Translation of upc hello}
-\label{Manual:UPC:hello-trans}
-\end{figure}
-
-
-%\clearpage
-Implementing various UPC variable accesses is complex due to the two level
-memory scheme used by the partitioned global memory address space.
-The translation has to handle variable declaration, memory allocation,
-value initialization, variable access, and so on. 
-
-UPC variables can be roughly categorized as shared and unshared (or thread
-local) variables. 
-For shared variables, they can be divided into two categories:
-statically allocated shared variables (including global shared variables
-and local static shared variables) and dynamically allocated shared
-variables. 
-%Runtime library routines are sufficient to support dynamically allocated
-%shared variables. 
-We focus on statically allocated shared variables here as
-an example.
-%But extra compiler translation is needed for
-%implementing statically allocated shared variables. 
-Translation of statically allocated \lstinline{shared} variables is demonstrated in
-Figure~\ref{Manual:UPC:shared1-transaa} and
-Figure~\ref{Manual:UPC:shared1-transab} for an input code shown in
-Figure~\ref{Manual:UPC:shared1}.
-\begin{figure}[!h]
-{\indent
-  {\mySmallFontSize
-    \begin{latexonly}
-    \lstinputlisting{\TopSourceDirectory/projects/UpcTranslation/tests/shared_1.upc}
-    \end{latexonly}
-    \begin{htmlonly}
-    \verbatiminput{\TopSourceDirectory/projects/UpcTranslation/tests/shared_1.upc}
-    \end{htmlonly}
-  }
-}
-\caption{Example input for shared variables}
-\label{Manual:UPC:shared1}
-\end{figure}
-
-\begin{figure}[!h]
-{\indent
-  {\mySmallFontSize
-    \begin{latexonly}
-    \lstinputlisting{\TopBuildDirectory/projects/UpcTranslation/tests/rose_shared_1.c.aaf}
-    \end{latexonly}
-    \begin{htmlonly}
-    \verbatiminput{\TopBuildDirectory/projects/UpcTranslation/tests/rose_shared_1.c.aaf}
-    \end{htmlonly}
-  }
-}
-\caption{Translation of UPC shared variables, part A}
-\label{Manual:UPC:shared1-transaa}
-\end{figure}
-
-The BUPC runtime distinguishes between phaseless (blocksize ==1 or 0 or
-unspecified) and phased (all other cases) shared
-pointers for better performance. 
-So two types of global scoped proxy pointers (\lstinline{upcr_pshared_ptr_t}
-and \lstinline{upcr_shared_ptr_t}) are used to represent static shared variables. 
-Global static shared variables directly use their names as the proxy
-pointer names (such as \lstinline{global_counter}).
-Local static variables use their mangled name (e.g. \lstinline{_lsscounter3769188422_}) for those pointers to
-avoid name collision.
-Accesses to shared variables are implemented by a set of runtime library
-calls, such as \lstinline{UPCR_GET_SHARED()} and
-\lstinline{UPCR_PUT_SHARED_VAL}.
-Again, as shown in Figure~\ref{Manual:UPC:shared1-transab}, \lstinline{UPCRI_ALLOC_filename_xxx()} handles per file UPCRI allocation of shared variables and 
-\lstinline{UPCRI_INIT_filename_xxx()} function is used for per-file
-initialization of those data.
-
-ROSE provides a set of AST interface functions to help developers handle
-UPC-specific types and facilitate translation. Those functions include 
-\lstinline{bool isUpcSharedType()}, 
-\lstinline{bool isUpcSharedArrayType()}, 
-\lstinline{bool isUpcPhaseLessSharedType()}, 
-\lstinline{bool isUpcPrivateToSharedType()}, etc. 
-A type mangling function (\lstinline{mangleType()}) is also provided
-to implement the Itanium C++ ABI specification~\cite{ItaniumCppABI}. 
-
-Unshared variables in UPC (also called Thread local data, or TLD) consists
-of local auto variables and global ( and static local) variables.
-Local auto variables do not need special translation. 
-But global and static local variables do. 
-Implementation details for them vary depending on their scope, internal or
-external linkage, if they are scalar or array types, if they point to
-shared data, if they have initializers, and so on.
-But the basic scheme for variable declaration, allocation/initialization, and
-accesses is similar to the handling of shared UPC variables.
-Please refer to the BUPC runtime interface specification
-3.10~\cite{BUPC3.10} for details.
-We only provide a translation example in
-Figure~\ref{Manual:UPC:unshared1-transaa} and
-Figure~\ref{Manual:UPC:unshared1-transab} for an input code shown in
-Figure~\ref{Manual:UPC:unshared1}.
-
-%No translations are needed for extern global unshared variables unless they
-%are pointers to shared data. 
-%Local static unshared variables are promoted to non-static type at global
-%scope using lstinline{UPCR_TLD_DEFINE or UPCR_TLD_DEFINE_TENTATIVE})
-%Unshared pointer to shared data 
-
-
-\begin{figure}[!h]
-{\indent
-  {\mySmallFontSize
-    \begin{latexonly}
-    \lstinputlisting{\TopBuildDirectory/projects/UpcTranslation/tests/rose_shared_1.c.abf}
-    \end{latexonly}
-    \begin{htmlonly}
-    \verbatiminput{\TopBuildDirectory/projects/UpcTranslation/tests/rose_shared_1.c.abf}
-    \end{htmlonly}
-  }
-}
-\caption{Translation of UPC shared variables, part B}
-\label{Manual:UPC:shared1-transab}
-\end{figure}
-
-\begin{figure}[!h]
-{\indent
-  {\mySmallFontSize
-    \begin{latexonly}
-    \lstinputlisting{\TopSourceDirectory/projects/UpcTranslation/tests/unshared_1.upc}
-    \end{latexonly}
-    \begin{htmlonly}
-    \verbatiminput{\TopSourceDirectory/projects/UpcTranslation/tests/unshared_1.upc}
-    \end{htmlonly}
-  }
-}
-\caption{Example input for non-shared variables}
-\label{Manual:UPC:unshared1}
-\end{figure}
-
-\begin{figure}[!h]
-{\indent
-  {\mySmallFontSize
-    \begin{latexonly}
-    \lstinputlisting{\TopBuildDirectory/projects/UpcTranslation/tests/rose_unshared_1.c.aaf}
-    \end{latexonly}
-    \begin{htmlonly}
-    \verbatiminput{\TopBuildDirectory/projects/UpcTranslation/tests/rose_unshared_1.c.aaf}
-    \end{htmlonly}
-  }
-}
-\caption{Translation of UPC unshared variables, part A}
-\label{Manual:UPC:unshared1-transaa}
-\end{figure}
-
-\begin{figure}[!h]
-{\indent
-  {\mySmallFontSize
-    \begin{latexonly}
-    \lstinputlisting{\TopBuildDirectory/projects/UpcTranslation/tests/rose_unshared_1.c.abf}
-    \end{latexonly}
-    \begin{htmlonly}
-    \verbatiminput{\TopBuildDirectory/projects/UpcTranslation/tests/rose_unshared_1.c.abf}
-    \end{htmlonly}
-  }
-}
-\caption{Translation of UPC unshared variables, part B}
-\label{Manual:UPC:unshared1-transab}
-\end{figure}
-
-
-%-------------------------------------------------------------
-%-------------------------------------------------------------
-%\section{Summary}
-
diff --git a/docs/Rose/binaryAnalysis.tex b/docs/Rose/binaryAnalysis.tex
deleted file mode 100644
index e1ed871ba7a..00000000000
--- a/docs/Rose/binaryAnalysis.tex
+++ /dev/null
@@ -1,486 +0,0 @@
-
-\chapter{Binary Analysis: Support for the Analysis of Binary Executables}
-
-\label{binaryAnalysis::overview}
-
-\section{Introduction}
-
-   ROSE supports the disassembly and analysis of binary executables for x86, PowerPC, and AMR
-instruction sets.  ROSE implements this support as part of general research work
-to support combining analysis for source code and analysis for binaries and supporting
-performance analysis and optimization.  Through this support ROSE addresses the
-requirements for the analysis and transformation of software in a general context useful
-to as wide a group of users as possible.
-
-   ROSE handles a number of binary executable file formats and also reads Dwarf information
-into the AST to support additional analysis.
-
-   Recent work in ROSE has added support for dynamic analysis and for mixing of dynamic
-and static analysis using the Intel Pin framework. 
-Intel Pin support in ROSE is presented in section~\ref{intel_pin}.
-
-\section{The Binary AST}
-
-\subsection{The Binary Executable Format}
-
-    ROSE handles Linux and Windows binary formats; thus ELF format for Linux and PE, NE,
-LE, DOS formats for Windows.  The details of each format are represented in IR nodes in
-the AST (using structures common to the representation of such low level data).  About
-60 IR nodes have been added to ROSE to support the binary executable formats; this
-support allows the analysis of any Linux, Windows, OS\/2, or DOS binary executable.
-
-   The binary executable file format can be analyzed separately from the instructions
-using the command line option: {\tt -rose:read\_executable\_file\_format\_only}.  This
-allows graphs generated using the ROSE visualization mechanisms (and even some analysis) 
-to be easily restricted (in size) to the just the IR nodes specific to the binary
-executable file format.
-
-% \fixme{We need an example of the binary executable format AST.}
-
-\begin{figure}
-% \includegraphics[angle=90,scale=0.75,width=5in,height=1in]{\TopSourceDirectory/src/frontend/ExecFormats/BinaryFileFormat}
-\includegraphics[angle=90,width=7.5in,height=8.5in]{\TopSourceDirectory/src/frontend/BinaryFormats/BinaryFileFormat}
-\caption{The class design of the IR nodes for the binary file format.} 
-
-\label{binaryAnalysis:BinaryExecutableFormatDesign}
-\end{figure}
-
-Figure \ref{binaryAnalysis:BinaryExecutableFormatDesign} shows the class design of the IR
-nodes for the binary file format address the
-requirements of ELF (Linux, and others), PE (MS Windows), NE (older MS Windows), 
-LE (OS\/2), and DOS (MS Dos) executable formats.  The colors represent different
-executable formats, brown classes are used as base classes for more than one
-format. Dark colors represent principle IR nodes in the AST, lighter color IR nodes
-represent supporting infrastructure in the AST.  Arrows are either dark colored or
-light colored; dark colors represent class derivation, and light colors represent
-member relationships.
-
-% DQ (10/29/2008): Added documentation for file format (plus examples).
-% This figure uses a saved (static) pdf file (not generated during the ``make docs'' rule).
-% This was done because it is cropped using predefined pixel values which would not be
-% easy to generate for a pdf that might be constantly changed.
-\begin{figure}
-% \includegraphics[angle=90,scale=0.75,width=5in,height=1in]{\TopSourceDirectory/src/frontend/ExecFormats/BinaryFileFormat}
-% \includegraphics[scale=0.50]{\TopSourceDirectory/docs/Rose/asm_code_samples_gcc}
-\includegraphics[,viewport=5 1 100 30,scale=2]{\TopSourceDirectory/docs/Rose/asm_code_samples_gcc}
-\caption{The AST for a PE (Windows) binary executable (binary file format only), with long
-    list of symbols (half of which are clipped on the right side of the image).} 
-
-\label{binaryAnalysis:BinaryExecutableFormatAST_1}
-\end{figure}
-
-Figure \ref{binaryAnalysis:BinaryExecutableFormatAST_1} shows the graph of the AST
-formed by just the binary file format (sections, symbols, etc.).  This figure shows
-the different IR nodes used to represent the binary file format (without the disassembled 
-instructions, in this case) and the large list of symbols within the symbol table (the 
-long list that is partially truncated on the right edge of the figure).
-This graph is quite large and does not fit well on the page, the next figure
-\ref{binaryAnalysis:BinaryExecutableFormatAST_2} shows a clipped image with more detail.
-
-
-\begin{figure}
-% \includegraphics[angle=90,scale=0.75,width=5in,height=1in]{\TopSourceDirectory/src/frontend/ExecFormats/BinaryFileFormat}
-\includegraphics*[angle=90,viewport=5 1 40 30,scale=18]{\TopSourceDirectory/docs/Rose/asm_code_samples_gcc}
-\caption{The CROPPED AST for a PE (Windows) binary executable (binary file format only).} 
-
-\label{binaryAnalysis:BinaryExecutableFormatAST_2}
-\end{figure}
-
-Figure \ref{binaryAnalysis:BinaryExecutableFormatAST_2} shows a cropped view of the graph
-of the AST formed by just the binary file format (sections, symbols, etc.).  This figure
-shows two {\em SgAsmInterpretation} IR nodes; this is a Windows PE binary and all windows
-PE binaries contain both a 16-bit MS-DOS header (and some 16-bit code) and a 32-bit Windows
-PE header (with sections that have 32-bit code); thus there are two SgAsmInterpretation IR
-nodes (one for the 16-bit interpretation of the instructions and one for the 32-bit 
-interpretation of the instructions).  Note that ELF format files will have only one
-SgAsmInterpretation IR nodes (because there is only a single interpretation possible), but
-other file formats can contain many interpretations; formed form a composite of code to
-support wide ranges of portability.
-
-*Note: The actually file used is in these figures is: {\tt ROSE/docs/Rose/asm\_code\_samples\_gcc.pdf}.
-
-\subsection{Instruction Disassembly}
-
-See API documentation for Rose::BinaryAnalysis::Disassemble.
-
-\subsection{Instruction Partitioning}
-
-See API documentation for Rose::BinaryAnalysis::Partitioner2.
-
-\subsection{Dwarf Debug Support}
-% NOTE:
-
-   ROSE can now read the Dwarf debug information stored into binary executables (ELF only
-at this point). This information is represented as Dwarf specific IR nodes in the AST and
-thus can be optionally used (when it is available in the binary) as part of any binary 
-analysis.  Only a few sections are supported at present: {\em .debug\_info},
-{\em .debug\_line}, etc.  The dwarf support in ROSE uses {\em libdwarf} and is enabled in
-ROSE using a configuration option: {\tt (configure --with-dwarf={\em<path to libdwarf>}}.
-Note that {\em libdwarf} is optional, must be separately installed by the user, and
-thus is obviously not distributed within ROSE.  
-% The future of the Dwarf support in ROSE is not clear, 
-We anticipate the Dwarf information in the AST to be useful for performance tools that
-operate on the binary executable when the binary executable has been generated to include 
-Dwarf debug information.
-
-\section{Binary Analysis}
-
-See API documentation for Rose::BinaryAnalysis.
-
-\section{Compass as a Binary Analysis Tool}
-
-   Compass is a tool framework for building software analysis tools using rules (on source
-code and alternatively directly on binary executables). Compass
-reports violations of the rules in the evaluation of the software.  Compass is a
-relatively simple application built on top of ROSE.  Most of the complexity and code 
-within Compass is that it includes a large collection to rules, each rule has its
-own implementation of an arbitrary test over the source code or the binary.  Rules
-(checkers) may be defined over the AST or any other graph built within ROSE to store 
-program analysis information. See the Compass manual for more details on supported
-binary analysis.  The ability to perform analysis of binary executables using Compass 
-makes no assumptions that it is compiled with any specific options or that it contains
-debug information, symbols, etc.
-
-
-\section{Static Binary Rewriting}
-   As part of general research on transformations of binaries (separate from analysis)
-a number of techniques have been developed to support classes of transformations.
-This static rewriting of the binary permits the development of performance tools 
-that could support the analysis and rewriting of binaries for support of High 
-Performance Computing (HPC). A principal focus is on IBM BGL and Cray XT support 
-(DOE Office of Science supercomputers).
-
-\subsection{Generic Section/Segment Modifications}
-%===============================================================================================================================
-%Generic Section/Segment Modifications
-%===============================================================================================================================
-
-\subsubsection{1a. Section/Segment file address shifting (low-level)}
-
-   The low-level movement of an ELF Section or Segment within the file address space is performed with
-   SgAsmGenericSection::set\_offset.  It changes the location of the section in the file and updates all relative virtual
-   addresses (RVAs) that were primarily associated with the moved section.
-
-   The main problems with this function are that it doesn't take into account the file locations of other sections, the file
-   alignment constraints of the moved section, or the memory mapping. Specifically, after calling this function to move {\bf.text}
-   one byte later in the file:
-\begin{itemize}
-   \item {\bf.text} might not satisfy its file alignment constraint.
-
-   \item The end of {\bf.text} might overlap with the following section. The ELF unparser has undefined behavior when two sections
-     overlap without storing identical bytes at the overlapping regions.
-
-   \item {\bf.text}, if memory mapped (which it surely is), might not be consistent with the mapping of other adjacent or overlapping
-     sections. For instance, {\bf.text} is contained in "ELF Load Segment 2" both in the file address space and in the mapped
-     memory space. The offset from ELF Load Segment 2 to {\bf.text} must be identical in both file and memory.
-
-   \item RVAs that point to instructions in {\bf.text} can be associated with the {\bf.text} section or with ELF Load Segment 2,
-     depending on how they were parsed. Normally it doesn't matter which since the relationship between file address space and
-     memory address space is consistent. But if you change the file addresses without changing memory addresses then the byte
-     to which the RVA points could be ambiguous.
-\end{itemize}
-
-   Changes to ELF Section or Segment file addresses are reflected in the ELF Section Table and/or ELF Segment Table. If the
-   particular SgAsmGenericSection is present in both tables then modifying its file address will result in updates to both
-   tables.
-
-   NOTE: Do not modify section offsets and sizes by modifying the section table entries. Changes to these values will be
-   overwritten with actual, current section offsets and sizes when the section table is unparsed:
-\begin{itemize}
-	\item SgAsmElfSectionTableEntry::set\_sh\_offset
-	\item SgAsmElfSectionTableEntry::set\_sh\_size
-	\item SgAsmElfSectionTableEntry::set\_sh\_addr
-\end{itemize}
-
-   NOTE: Do not modify segment offsets and sizes by modifying the segment table entries. Changes to these values will be
-   overwritten with actual, current segment offsets and sizes when the segment table is unparsed:
-\begin{itemize}
-   \item SgAsmElfSegmentTableEntry::set\_offset
-   \item SgAsmElfSegmentTableEntry::set\_filesz
-   \item SgAsmElfSegmentTableEntry::set\_vaddr
-   \item SgAsmElfSegmentTableEntry::set\_memsz
-\end{itemize}
-
-\subsubsection{1b. Section/Segment file address shifting (high-level)}
-   
-   The SgAsmGenericFile::shift\_extend method is the preferred way to make minor offset and/or size adjustments to an ELF
-   Section or Segment. It is able to shift a section to a high file and/or memory address and/or extend the segment:
-\begin{itemize}
-   \item It takes into account all sections in the file, adjusting their offsets and/or sizes accordingly.
-
-   \item Sections to the right of the the section in question (Sq) are shifted upward to make room and prevent overlaps.
-
-   \item Sections overlapping with Sq are extended to contain all of what they previously contained.
-
-   \item The shift amounts are adjusted to satisfy alignment constraints of all affected sections.
-
-   \item Unreferenced areas of the file can optionally be utilized as unused address space.
-
-   \item Adjusting file address spaces also adjusts the memory address spaces in a compatible manner.
-\end{itemize}
-
-   NOTE: Do not modify section offsets and sizes by modifying the section table entries. Changes to these values will be
-   overwritten with actual, current section offsets and sizes when the section table is unparsed:
-\begin{itemize}
-	\item SgAsmElfSectionTableEntry::set\_sh\_offset
-	\item SgAsmElfSectionTableEntry::set\_sh\_size
-	\item SgAsmElfSectionTableEntry::set\_sh\_addr
-\end{itemize}
-
-   NOTE: Do not modify segment offsets and sizes by modifying the segment table entries. Changes to these values will be
-   overwritten with actual, current segment offsets and sizes when the segment table is unparsed:
-\begin{itemize}
-   \item SgAsmElfSegmentTableEntry::set\_offset
-   \item SgAsmElfSegmentTableEntry::set\_filesz
-   \item SgAsmElfSegmentTableEntry::set\_vaddr
-   \item SgAsmElfSegmentTableEntry::set\_memsz
-\end{itemize}
-
-\subsubsection{2a. Section/Segment resizing (low-level)}
-
-   The size of an ELF Section or Segment can be modified by calling SgAsmGenericSection::set\_size (for file size) and
-   set\_mapped\_size (for mapped memory). However, this is a low-level interface that doesn't take into account other sections in
-   the same file.  The preferred way to resize a section is with SgAsmGenericFile::shift\_extend.
-
-   NOTE: For many kinds of sections, making the section larger will create an unreferenced area ("internal hole") at the end of
-   the section. Other sections will automatically do something with the new address space (e.g., SgAsmElfStringSection will
-   add the new address space to its free list).
-
-\subsubsection{2b. Section/Segment resizing (high-level)}
-
-   The preferred way to extend a section is to call SgAsmGenericFile::shift\_extend, which extends sections that contain the
-   resized-section and shifts sections that are right (higher address) of the resized-section.  This function also takes into
-   account alignment constraints, memory address space, and (optionally) holes in the address space.
-
-\subsection{Modifications to the ELF File Header}
-%===============================================================================================================================
-%Modifications to the ELF File Header
-%===============================================================================================================================
-
-\subsubsection{1. Entry Point RVA}
-
-   The entry RVA stored in the ELF File Header is adjusted whenever the section into which it points is moved in memory. It is
-   also possible to adjust this address explicitly by modifying the first (and only) entry in SgAsmGenericHeader::entry\_rvas.
-
-   NOTE: An RVA (rose\_rva\_t) is an offset with respect to the beginning of some section. If the section starting memory address
-   changes then the RVA implicitly changes (RVA's are virtual addresses relative to some format-wide base address). Multiple
-   sections can be mapped to the same memory (e.g., {\bf.text} and {\bf ELF Load Segment 2} are typically overlap in memory), but
-   since an RVA is associated with only one section, modifying the other section(s) has no effect on the RVA even if the RVA
-   happens to be inside the other sections as well.
-
-   NOTE: The binding between an RVA and a section can be modified with rose\_rva\_t::set\_section. In fact, the link can be
-   completely broken by passing a null section pointer, in which case the RVA is not relative to any section.
-
-\subsubsection{2. File Format Byte order}
-
-   File byte order can be changed by modifying the SgAsmGenericFormat object pointed to by the file header:
-
-      SgAsmGenericHeader *fhdr = ....;
-      fhdr->get\_exec\_format()->set\_sex(ORDER\_MSB);
-
-   NOTE: Modifying the byte order affects only those sections that are actually parsed. If the ELF file contains a section
-   whose purpose we don't recognize then the original section data is written to the new file.
-
-\fixme{If the byte order is not specified in the ELF header (e\_ident\_data\_encoding other than 1 or 2) then the parser will
-   make an educated guess and assign a byte order.  The unparsed file will differ from the original in this case at the sixth
-   byte of the file.}
-
-\subsubsection{3. ELF Word Size}
-
-   File word size can be changed between 4 bytes and 8 bytes by modifying the SgAsmGenericFormat object pointed to by the file
-   header:
-
-      SgAsmGenericHeader *fhdr = ....;
-      fhdr->get\_exec\_format()->set\_word\_size(4);
-
-   When changing word sizes, any fields that have values too large to represent in the new word size will cause the unparser
-   to abort.
-
-   NOTE: Modifying the word size affects only those sections that are actually parsed. If the ELF file contains a section whose
-   purpose we don't recognize then the original section data is written to the new file.
-
-\fixme{Increasing word size probably requires allocating more space for many of the sections. Vice versa for decreasing the
-   word size.}
-
-\subsubsection{4. ELF Header Magic Number}
-
-   An ELF header has a four-byte magic number, usually 0x7f, 'E', 'L', 'F'.  The magic number can be modified by changing the
-   string from SgAsmGenericHeader::get\_magic.  It must be exactly four characters in length.
-
-\subsubsection{5. ELF File Purpose (lib, executable, core, etc.)}
-
-   The file purpose should be modified by setting two fields, using
-
-\begin{enumerate}
-      \item SgAsmElfFileHeader::set\_p\_e\_type
-      \item SgAsmGenericFormat::set\_purpose
-\end{enumerate}
-
-   Both members should be set to compatible values. The former is the value from the ELF specification and the latter is a
-   constant: PURPOSE\_UNSPECIFIED, PURPOSE\_LIBRARY, PURPOSE\_EXECUTABLE, PURPOSE\_CORE\_DUMP, PURPOSE\_PROC\_SPECIFIC, PURPOSE\_OTHER.
-
-\fixme{set\_p\_e\_type should probably call set\_purpose, but we can't go the other direction because the mapping is N:1.}
-
-\subsubsection{6. ELF Version}
-
-   To change the ELF version assign a new value by calling set\_version on the object returned by
-   SgAsmGenericHeader::get\_exec\_format.  This doesn't have any effect on the code generated by the unparser since the parser
-   only knows about ELF format 1.
-   
-\subsubsection{7. ELF Target Architecture}
-
-   Modify the target architecture by calling two functions:
-
-       SgAsmElfHeader::set\_e\_machine -- sets the ELF specific value
-       SgAsmGenericHeader::set\_isa   -- sets the generic value
-
-   You should call both with consistent values.
-
-\subsubsection{8. ELF Section or Segment Table location}
-
-   The SgAsmElfFileHeader::set\_e\_shoff and set\_e\_phoff methods have been removed since calling them had no lasting effect
-   anyway. Instead, if you want to change one of these values for unparsing, then modify the actual SgAsmGenericSection that
-   holds the table (e.g., calling SgAsmGenericFile::shift\_extend).
-
-\subsubsection{9. ELF Section or Segment Table size}
-
-   The number of entries in the section or segment table cannot be modified by calling set\_e\_shnum or set\_e\_phnum on the
-   SgAsmElfFileHeader \fixme{Remove these functions.}. Rather, the sizes are obtained by looking at what sections and segments
-   are currently defined and writing an entry to the file for each one.
-
-\subsubsection{10. ELF Section Names}
-
-   Elf section names can be modified. Doing so may cause extensive changes to the executable due to reallocation of the section
-   holding the string table.
-
-   Do not call SgAsmElfSectionTableEntry::set\_sh\_name since that value will be overwritten based on the actual, current
-   location of the name in the associated string table.
-
-\subsubsection{11. ELF Segment Names}
-
-   ELF segment names are often parser-generated based on constants in the ELF Segment Table. However, if the segment
-   corresponds to an actual ELF Section defined in the ELF Section Table then the segment and section share the same
-   SgAsmGenericSection object and changing the name causes the ELF Section name to change with no effect on the segment table.
-
-\subsubsection{12. ELF Section Name Table}
-
-   The section that holds the section names is identified in the ELF File Header (get\_e\_shstrndx). Although it is possible to
-   change this value, doing so will have no effect on the currently-defined sections: they will continue to use the original
-   string table for their names.
-
-\subsection{Modifications to ELF String Tables and their Containing Sections}
-%===============================================================================================================================
-%Modifications to ELF String Tables and their Containing Sections
-%===============================================================================================================================
-
-\subsubsection{1. Move/Extend}
-
-   See SgGenericFile::shift\_extend.  When a string table is extended the new address space is added to the table's free list.
-
-\subsubsection{2. New String}
-
-   A new string can be created by calling the SgAsmStoredString allocator and passing a string table (something derived from
-   SgAsmGenericStrtab) and the initial string value.  The string is not actually allocated space in the file until the new file
-   is unparsed or until someone calls SgAsmStoredString::get\_offset.
-
-\subsubsection{3. Value modification}
-
-   A string can be modified by assigning a new value via SgAsmStoredString::set\_string. Storage is not allocated for the new
-   value until the AST is unparsed or someone calls SgAsmStoredString::get\_offset.  The previous value is freed.
-
-\subsubsection{4. Shared strings}
-
-   Three forms of sharing are supported:
-
-\begin{enumerate}
-   \item Two objects (section names, symbol names, etc) share the same string and changing one string causes the other to change
-      as well. This kind of sharing is not typically encountered in ELF although the underlying string table classes support
-      it.
-
-   \item Two objects have independent strings that happen to have the same value and point to the same offset in the string
-      table. In this case, changing one string doesn't change the other. This kind of sharing is often encountered in ELF.
-
-   \item Two objects have independent strings and one is an ending substring of another (e.g., "main" and "domain"). Changing one
-      string does not affect the other. This kind of sharing is also common in ELF.
-\end{enumerate}
-
-\subsubsection{5. String table internal holes}
-
-   If a sequence of bytes in a string table is not referenced by anything known to the parser, then those bytes are marked as
-   internal holes and are prevented from moving with respect to the beginning of the string table. Internal holes are not
-   placed on the string table free list (because something we didn't parse might be pointing to them).  The internal holes are
-   available with SgAsmGenericSection::congeal.
-
-\subsubsection{6. Reallocation of all strings}
-
-   A string table can be repacked by freeing all it's strings and then reallocating.  We can reallocate around the internal
-   holes or through the internal holes.
-
-       strtab.free\_all\_strings();   /* free\_all\_strings(true) blows away internal holes */
-       strtab.reallocate();
-
-   The ELF allocator will do its best to overlap storage (e.g., "domain" overlaps with "main").
-
-\subsubsection{7. Deletion of a string}
-
-   A string is deleted by changing its value to the empty string.
-
-\subsubsection{8. Stored strings vs. non-stored strings.}
-
-   If a string value has storage space in a file (such as an ELF Section name), then it's an instance of
-   SgAsmStoredString. Otherwise the string is either an std::string or SgAsmBasicString. SgAsmBasicString and SgAsmStoredString
-   both derive from SgAsmGenericString.  Changing the value of an SgAsmBasicString has no effect on the unparsed file.
-
-\subsection{Modifications ELF Section Table Entries}
-%===============================================================================================================================
-%Modifications ELF Section Table Entries
-%===============================================================================================================================
-
-Every ELF Section defined by the ELF Section Table is parsed as an SgAsmElfSection, which is derived from SgAsmGenericSection.
-The SgAsmElfSection::get\_section\_entry returns a pointer to the ELF Section Table Entry (SgAsmElfSectionTableEntry). Some
-members of these objects can be modified and some can't.
-
-\subsubsection{1. These functions should not be called since their values are overwritten during the unparse phase:}
-
-\begin{itemize}
-   \item SgAsmElfSectionTableEntry::set\_sh\_name   -- see SgAsmGenericSection::set\_name
-   \item SgAsmElfSectionTableEntry::set\_sh\_addr   -- see SgAsmGenericFile::shift\_extend
-   \item SgAsmElfSectionTableEntry::set\_sh\_offset -- see SgAsmGenericFile::shift\_extend
-   \item SgAsmElfSectionTableEntry::set\_sh\_size   -- see SgAsmGenericFile::shift\_extend
-   \item SgAsmElfSectionTableEntry::set\_sh\_link   -- don't call (no alternative yet)
-\end{itemize}
-   
-\subsubsection{2. Can modify}
-
-\fixme{What text should go here?}
-
-\begin{itemize}
-   \item SgAsmElfSectionTableEntry::set\_sh\_type
-   \item SgAsmElfSectionTableEntry::set\_sh\_flags, although the Write and Execute bits are ignored
-   \item SgAsmElfSectionTableEntry::set\_sh\_info      \fixme{Is this complete?}
-   \item SgAsmElfSectionTableEntry::set\_sh\_addralign \fixme{Is this complete?}
-   \item SgAsmElfSectionTableEntry::set\_sh\_entsize   \fixme{Is this complete?}
-\end{itemize}
-
-
-\section{Dynamic Analysis Support}
-\label{intel_pin}
-
-   Recent work in ROSE has added support for dynamic analysis and for mixing of dynamic
-and static analysis using the Intel Pin framework. This optional support in ROSE
-requires a configure option ({\tt --with-IntelPin=$<path$>}.  The {\tt path} in
-the configure option is the path to the top level directory of the location of
-the Intel Pin distribution.  This support for Intel Pin has only been tested
-on a 64bit Linux system using the most recent distribution of Intel Pin (version 2.6).
-
-Note: The dwarf support in ROSE is currently incompatible with the dwarf support in
-Intel Pin.  A message in the configuration of ROSE will detect if both support for
-Dwarf and Intel Pin are both specified and exit with an error message that they
-are incompatible options.
-
-
-\section{Usage}
-     See the ROSE Tutorial for examples.
-
-
-
diff --git a/docs/Rose/documents.html b/docs/Rose/documents.html
index 49bcd0222a0..951a154ccdd 100644
--- a/docs/Rose/documents.html
+++ b/docs/Rose/documents.html
@@ -39,11 +39,6 @@
         <LI> <a href="ROSE_UserManual/ROSE-UserManual.pdf">User Manual (pdf)</a>  </LI>
         <LI> <a href="ROSE_Tutorial/ROSE-Tutorial.pdf">Tutorials (pdf)</a>  </LI>
         <LI> <a href="ROSE_HTML_Reference/index.html" target=_blank>Doxygen Documentation ROSE (html)</a>  </LI>
-        <LI> <a href="RoseQtWidgets/index.html" target=_blank>Doxygen Documentation for ROSE Qt Widgets (html)</a>  </LI>
-        <LI> <a href="ROSE_HaskellAPI/index.html" target=_blank>Doxygen Documentation for ROSE Haskell Binding API (html)</a>  </LI>
-        <LI> <a href="compass.pdf">Compass Manual (pdf)</a>  </LI>
-        <LI> <a href="autoTuning.pdf">Autotuning Tutorials (pdf)</a>  </LI>
-        <LI> <a href="QROSE.pdf">QROSE Manual (pdf)</a>  </LI>
         </p>
         <p> &nbsp; </p>
         <p> &nbsp; </p>
diff --git a/docs/Rose/projects.html b/docs/Rose/projects.html
deleted file mode 100644
index 8067accd645..00000000000
--- a/docs/Rose/projects.html
+++ /dev/null
@@ -1,66 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
-"http://www.w3.org/TR/html4/loose.dtd">
-<html>
-<head>
-<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
-<title>ROSE Projects</title>
-<link href="../Templates/css_audim.css" rel="stylesheet" type="text/css">
-<link href="../css.css" rel="stylesheet" type="text/css">
-<style type="text/css">
-<!--
-.style3 {color: #CC6600}
-.style4 {font-size: 10px}
--->
-</style>
-</head>
-
-<body>
-
-<IFRAME id="iframe1" width="800" height="250" src="header.html"  frameborder="0" marginheight="0" marginwidth="0" scrolling="no"></IFRAME>
-
-<table width="800" border="0" cellpadding="0" cellspacing="0">
-  <!--DWLayoutTable-->
-  <tr>
-    <td width="221" height="600" valign="top">
-
-<IFRAME id="iframe2" width="221" height="600" src="leftmenu.html"  frameborder="0" marginheight="0" marginwidth="0" scrolling="no"></IFRAME>
-      
-      </td>
-    <td width="12">&nbsp;</td>
-    <td width="567" valign="top"><table width="100%" border="0" cellpadding="0" cellspacing="0">
-      <!--DWLayoutTable-->
-      <tr>
-        <td width="567" height="450" class="plaintext14">    
-        <p> ROSE has been used to facilitate a number of projects for exploring program analyses and optimizations, supporting new programming languages, and building correctness and performance tools. Representative examples include:
-        </p>
-        <p> <UL>
-        <LI> Compass: a tool for the checking of source code. 
-        Compass is based on the ROSE compiler infrastructure and demonstrates the use of ROSE 
-        to build many simple pattern detectors for analysis of C, C++, and Fortran 
-        source code. See the current <a href="compass.pdf">Compass Manual</a> for details. </LI>
-        <LI> Whole-program empirical optimization: participation in the <a href="http://www.peri-scidac.org/perci/">PERI</a> project.
-        ROSE is a central component in the PERI project to enable performance portability of DOE applications 
-        through an empirical optimization system, 
-        which incorporates a set of external tools interacting with ROSE to 
-        support the entire life-cycle of automated empirical optimization.
-        See the current draft <a href="autoTuning.pdf">autotuning tutorial</a> for details.
-        </LI>
-        <LI> Loop optimizer: support for aggressive loop optimizations such as loop fusion,
-        fission, unrolling and blocking. An extended dependence analysis algorithm has been implemented to support both perfectly nested loops and irregular loop nests. </LI>
-        <LI> OpenMP: a project to support OpenMP using ROSE. ROSE already has a lightweight parser for OpenMP C/C++ pragmas and a translator for OpenMP 2.5 constructs. We are extending it to support Fortran and the new OpenMP 3.0 specification. </LI>
-        <LI> UPC: ongoing work to support UPC using ROSE. We are leveraging the existing UPC support available in the EDG frontend to build an environment for program analysis and optimizations for UPC applications. </LI>
-        <LI> Haskellport: an interface to ROSE's IR for the Haskell programming language.  See the tutorial (a chapter of the ROSE Tutorial) and <a href="ROSE_HaskellAPI/index.html">API documentation</a> for details.
-        <LI> Windows support: We are currently working to support ROSE under Windows using Visual Studio (via CMake generation of the MSVC Solutions file) </LI>
-        </UL></p>
-      </td>
-      </tr>
-    </table></td>
-  </tr>
-  <tr>
-    <td height="100" colspan="3" valign="top">
-<IFRAME id="iframe3" width="800" height="150" src="footer.html"  frameborder="0" marginheight="0" marginwidth="0" scrolling="no"></IFRAME>
-	</td>
-  </tr>
-    </table>
-</body>
-</html>
diff --git a/docs/Rose/rose.cfg.in b/docs/Rose/rose.cfg.in
index f71223e73a0..cde451f6382 100644
--- a/docs/Rose/rose.cfg.in
+++ b/docs/Rose/rose.cfg.in
@@ -1,117 +1,137 @@
-# Doxyfile 1.8.1.1
-#
-# This is the minimum doxygen version supported by ROSE. Newer
-# versions of doxygen will probably produce warnings about certain
-# things in this file. Do not regenerate this file to a newer version
-# without prior discussion. [The ROSE Team]
-
-
+# Doxyfile 1.9.1
 
 # This file describes the settings to be used by the documentation system
 # doxygen (www.doxygen.org) for a project.
 #
-# All text after a hash (#) is considered a comment and will be ignored.
+# All text after a double hash (##) is considered a comment and is placed in
+# front of the TAG it is preceding.
+#
+# All text after a single hash (#) is considered a comment and will be ignored.
 # The format is:
-#       TAG = value [value, ...]
-# For lists items can also be appended using:
-#       TAG += value [value, ...]
-# Values that contain spaces should be placed between quotes (" ").
+# TAG = value [value, ...]
+# For lists, items can also be appended using:
+# TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (\" \").
 
 #---------------------------------------------------------------------------
 # Project related configuration options
 #---------------------------------------------------------------------------
 
-# This tag specifies the encoding used for all characters in the config file
-# that follow. The default is UTF-8 which is also the encoding used for all
+# This tag specifies the encoding used for all characters in the configuration
+# file that follow. The default is UTF-8 which is also the encoding used for all
 # text before the first occurrence of this tag. Doxygen uses libiconv (or the
 # iconv built into libc) for the transcoding. See
-# http://www.gnu.org/software/libiconv for the list of possible encodings.
+# https://www.gnu.org/software/libiconv/ for the list of possible encodings.
+# The default value is: UTF-8.
 
 DOXYFILE_ENCODING      = UTF-8
 
-# The PROJECT_NAME tag is a single word (or sequence of words) that should
-# identify the project. Note that if you do not use Doxywizard you need
-# to put quotes around the project name if it contains spaces.
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
+# double-quotes, unless you are using Doxywizard) that should identify the
+# project for which the documentation is generated. This name is used in the
+# title of most generated pages and in a few other places.
+# The default value is: My Project.
 
 PROJECT_NAME           = ROSE
 
-# The PROJECT_NUMBER tag can be used to enter a project or revision number.
-# This could be handy for archiving the generated documentation or
-# if some version control system is used.
+# The PROJECT_NUMBER tag can be used to enter a project or revision number. This
+# could be handy for archiving the generated documentation or if some version
+# control system is used.
 
 PROJECT_NUMBER         = @VERSION@
 
 # Using the PROJECT_BRIEF tag one can provide an optional one line description
-# for a project that appears at the top of each page and should give viewer
-# a quick idea about the purpose of the project. Keep the description short.
+# for a project that appears at the top of each page and should give viewer a
+# quick idea about the purpose of the project. Keep the description short.
 
 PROJECT_BRIEF          =
 
-# With the PROJECT_LOGO tag one can specify an logo or icon that is
-# included in the documentation. The maximum height of the logo should not
-# exceed 55 pixels and the maximum width should not exceed 200 pixels.
-# Doxygen will copy the logo to the output directory.
+# With the PROJECT_LOGO tag one can specify a logo or an icon that is included
+# in the documentation. The maximum height of the logo should not exceed 55
+# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy
+# the logo to the output directory.
 
 PROJECT_LOGO           =
 
-# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute)
-# base path where the generated documentation will be put.
-# If a relative path is entered, it will be relative to the location
-# where doxygen was started. If left blank the current directory will be used.
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path
+# into which the generated documentation will be written. If a relative path is
+# entered, it will be relative to the location where doxygen was started. If
+# left blank the current directory will be used.
 
 OUTPUT_DIRECTORY       = ./ROSE_WebPages
 
-# If the CREATE_SUBDIRS tag is set to YES, then doxygen will create
-# 4096 sub-directories (in 2 levels) under the output directory of each output
-# format and will distribute the generated files over these directories.
-# Enabling this option can be useful when feeding doxygen a huge amount of
-# source files, where putting all generated files in the same directory would
-# otherwise cause performance problems for the file system.
+# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub-
+# directories (in 2 levels) under the output directory of each output format and
+# will distribute the generated files over these directories. Enabling this
+# option can be useful when feeding doxygen a huge amount of source files, where
+# putting all generated files in the same directory would otherwise causes
+# performance problems for the file system.
+# The default value is: NO.
+
+CREATE_SUBDIRS         = YES
+
+# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII
+# characters to appear in the names of generated files. If set to NO, non-ASCII
+# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode
+# U+3044.
+# The default value is: NO.
 
-CREATE_SUBDIRS         = NO
+ALLOW_UNICODE_NAMES    = NO
 
 # The OUTPUT_LANGUAGE tag is used to specify the language in which all
 # documentation generated by doxygen is written. Doxygen will use this
 # information to generate all constant output in the proper language.
-# The default language is English, other supported languages are:
-# Afrikaans, Arabic, Brazilian, Catalan, Chinese, Chinese-Traditional,
-# Croatian, Czech, Danish, Dutch, Esperanto, Farsi, Finnish, French, German,
-# Greek, Hungarian, Italian, Japanese, Japanese-en (Japanese with English
-# messages), Korean, Korean-en, Lithuanian, Norwegian, Macedonian, Persian,
-# Polish, Portuguese, Romanian, Russian, Serbian, Serbian-Cyrillic, Slovak,
-# Slovene, Spanish, Swedish, Ukrainian, and Vietnamese.
+# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,
+# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),
+# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,
+# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),
+# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,
+# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,
+# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,
+# Ukrainian and Vietnamese.
+# The default value is: English.
 
 OUTPUT_LANGUAGE        = English
 
-# If the BRIEF_MEMBER_DESC tag is set to YES (the default) Doxygen will
-# include brief member descriptions after the members that are listed in
-# the file and class documentation (similar to JavaDoc).
-# Set to NO to disable this.
+# The OUTPUT_TEXT_DIRECTION tag is used to specify the direction in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all generated output in the proper direction.
+# Possible values are: None, LTR, RTL and Context.
+# The default value is: None.
+
+OUTPUT_TEXT_DIRECTION  = None
+
+# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member
+# descriptions after the members that are listed in the file and class
+# documentation (similar to Javadoc). Set to NO to disable this.
+# The default value is: YES.
 
 BRIEF_MEMBER_DESC      = YES
 
-# If the REPEAT_BRIEF tag is set to YES (the default) Doxygen will prepend
-# the brief description of a member or function before the detailed description.
-# Note: if both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
+# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief
+# description of a member or function before the detailed description
+#
+# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
 # brief descriptions will be completely suppressed.
+# The default value is: YES.
 
 REPEAT_BRIEF           = YES
 
-# This tag implements a quasi-intelligent brief description abbreviator
-# that is used to form the text in various listings. Each string
-# in this list, if found as the leading text of the brief description, will be
-# stripped from the text and the result after processing the whole list, is
-# used as the annotated text. Otherwise, the brief description is used as-is.
-# If left blank, the following values are used ("$name" is automatically
-# replaced with the name of the entity): "The $name class" "The $name widget"
-# "The $name file" "is" "provides" "specifies" "contains"
-# "represents" "a" "an" "the"
+# This tag implements a quasi-intelligent brief description abbreviator that is
+# used to form the text in various listings. Each string in this list, if found
+# as the leading text of the brief description, will be stripped from the text
+# and the result, after processing the whole list, is used as the annotated
+# text. Otherwise, the brief description is used as-is. If left blank, the
+# following values are used ($name is automatically replaced with the name of
+# the entity):The $name class, The $name widget, The $name file, is, provides,
+# specifies, contains, represents, a, an and the.
 
 ABBREVIATE_BRIEF       =
 
 # If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
-# Doxygen will generate a detailed section even if there is only a brief
+# doxygen will generate a detailed section even if there is only a brief
 # description.
+# The default value is: NO.
 
 ALWAYS_DETAILED_SEC    = NO
 
@@ -119,581 +139,754 @@ ALWAYS_DETAILED_SEC    = NO
 # inherited members of a class in the documentation of that class as if those
 # members were ordinary class members. Constructors, destructors and assignment
 # operators of the base classes will not be shown.
+# The default value is: NO.
 
 INLINE_INHERITED_MEMB  = NO
 
-# If the FULL_PATH_NAMES tag is set to YES then Doxygen will prepend the full
-# path before files name in the file list and in the header files. If set
-# to NO the shortest path that makes the file name unique will be used.
+# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path
+# before files name in the file list and in the header files. If set to NO the
+# shortest path that makes the file name unique will be used
+# The default value is: YES.
 
 FULL_PATH_NAMES        = NO
 
-# If the FULL_PATH_NAMES tag is set to YES then the STRIP_FROM_PATH tag
-# can be used to strip a user-defined part of the path. Stripping is
-# only done if one of the specified strings matches the left-hand part of
-# the path. The tag can be used to show relative paths in the file list.
-# If left blank the directory from which doxygen is run is used as the
-# path to strip.
+# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.
+# Stripping is only done if one of the specified strings matches the left-hand
+# part of the path. The tag can be used to show relative paths in the file list.
+# If left blank the directory from which doxygen is run is used as the path to
+# strip.
+#
+# Note that you can specify absolute paths here, but also relative paths, which
+# will be relative from the directory where doxygen is started.
+# This tag requires that the tag FULL_PATH_NAMES is set to YES.
 
 STRIP_FROM_PATH        =
 
-# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of
-# the path mentioned in the documentation of a class, which tells
-# the reader which header file to include in order to use a class.
-# If left blank only the name of the header file containing the class
-# definition is used. Otherwise one should specify the include paths that
-# are normally passed to the compiler using the -I flag.
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the
+# path mentioned in the documentation of a class, which tells the reader which
+# header file to include in order to use a class. If left blank only the name of
+# the header file containing the class definition is used. Otherwise one should
+# specify the list of include paths that are normally passed to the compiler
+# using the -I flag.
 
 STRIP_FROM_INC_PATH    =
 
-# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter
-# (but less readable) file names. This can be useful if your file system
-# doesn't support long names like on DOS, Mac, or CD-ROM.
+# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but
+# less readable) file names. This can be useful is your file systems doesn't
+# support long names like on DOS, Mac, or CD-ROM.
+# The default value is: NO.
 
 SHORT_NAMES            = NO
 
-# If the JAVADOC_AUTOBRIEF tag is set to YES then Doxygen
-# will interpret the first line (until the first dot) of a JavaDoc-style
-# comment as the brief description. If set to NO, the JavaDoc
-# comments will behave just like regular Qt-style comments
-# (thus requiring an explicit @brief command for a brief description.)
+# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the
+# first line (until the first dot) of a Javadoc-style comment as the brief
+# description. If set to NO, the Javadoc-style will behave just like regular Qt-
+# style comments (thus requiring an explicit @brief command for a brief
+# description.)
+# The default value is: NO.
 
 JAVADOC_AUTOBRIEF      = YES
 
-# If the QT_AUTOBRIEF tag is set to YES then Doxygen will
-# interpret the first line (until the first dot) of a Qt-style
-# comment as the brief description. If set to NO, the comments
-# will behave just like regular Qt-style comments (thus requiring
-# an explicit \brief command for a brief description.)
+# If the JAVADOC_BANNER tag is set to YES then doxygen will interpret a line
+# such as
+# /***************
+# as being the beginning of a Javadoc-style comment "banner". If set to NO, the
+# Javadoc-style will behave just like regular comments and it will not be
+# interpreted by doxygen.
+# The default value is: NO.
+
+JAVADOC_BANNER         = NO
+
+# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first
+# line (until the first dot) of a Qt-style comment as the brief description. If
+# set to NO, the Qt-style will behave just like regular Qt-style comments (thus
+# requiring an explicit \brief command for a brief description.)
+# The default value is: NO.
 
 QT_AUTOBRIEF           = NO
 
-# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make Doxygen
-# treat a multi-line C++ special comment block (i.e. a block of //! or ///
-# comments) as a brief description. This used to be the default behaviour.
-# The new default is to treat a multi-line C++ comment block as a detailed
-# description. Set this tag to YES if you prefer the old behaviour instead.
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a
+# multi-line C++ special comment block (i.e. a block of //! or /// comments) as
+# a brief description. This used to be the default behavior. The new default is
+# to treat a multi-line C++ comment block as a detailed description. Set this
+# tag to YES if you prefer the old behavior instead.
+#
+# Note that setting this tag to YES also means that rational rose comments are
+# not recognized any more.
+# The default value is: NO.
 
 MULTILINE_CPP_IS_BRIEF = NO
 
-# If the INHERIT_DOCS tag is set to YES (the default) then an undocumented
-# member inherits the documentation from any documented member that it
-# re-implements.
+# By default Python docstrings are displayed as preformatted text and doxygen's
+# special commands cannot be used. By setting PYTHON_DOCSTRING to NO the
+# doxygen's special commands can be used and the contents of the docstring
+# documentation blocks is shown as doxygen documentation.
+# The default value is: YES.
+
+PYTHON_DOCSTRING       = YES
+
+# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the
+# documentation from any documented member that it re-implements.
+# The default value is: YES.
 
 INHERIT_DOCS           = YES
 
-# If the SEPARATE_MEMBER_PAGES tag is set to YES, then doxygen will produce
-# a new page for each member. If set to NO, the documentation of a member will
-# be part of the file/class/namespace that contains it.
+# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new
+# page for each member. If set to NO, the documentation of a member will be part
+# of the file/class/namespace that contains it.
+# The default value is: NO.
 
 SEPARATE_MEMBER_PAGES  = NO
 
-# The TAB_SIZE tag can be used to set the number of spaces in a tab.
-# Doxygen uses this value to replace tabs by spaces in code fragments.
+# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen
+# uses this value to replace tabs by spaces in code fragments.
+# Minimum value: 1, maximum value: 16, default value: 4.
 
 TAB_SIZE               = 8
 
-# This tag can be used to specify a number of aliases that acts
-# as commands in the documentation. An alias has the form "name=value".
-# For example adding "sideeffect=\par Side Effects:\n" will allow you to
-# put the command \sideeffect (or @sideeffect) in the documentation, which
-# will result in a user-defined paragraph with heading "Side Effects:".
-# You can put \n's in the value part of an alias to insert newlines.
+# This tag can be used to specify a number of aliases that act as commands in
+# the documentation. An alias has the form:
+# name=value
+# For example adding
+# "sideeffect=@par Side Effects:\n"
+# will allow you to put the command \sideeffect (or @sideeffect) in the
+# documentation, which will result in a user-defined paragraph with heading
+# "Side Effects:". You can put \n's in the value part of an alias to insert
+# newlines (in the resulting output). You can put ^^ in the value part of an
+# alias to insert a newline as if a physical newline was in the original file.
+# When you need a literal { or } or , in the value part of an alias you have to
+# escape them by means of a backslash (\), this can lead to conflicts with the
+# commands \{ and \} for these it is advised to use the version @{ and @} or use
+# a double escape (\\{ and \\})
 
 ALIASES                =
 
-# This tag can be used to specify a number of word-keyword mappings (TCL only).
-# A mapping has the form "name=value". For example adding
-# "class=itcl::class" will allow you to use the command class in the
-# itcl::class meaning.
-
-TCL_SUBST              =
-
-# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C
-# sources only. Doxygen will then generate output that is more tailored for C.
-# For instance, some of the names that are used will be different. The list
-# of all members will be omitted, etc.
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
+# only. Doxygen will then generate output that is more tailored for C. For
+# instance, some of the names that are used will be different. The list of all
+# members will be omitted, etc.
+# The default value is: NO.
 
 OPTIMIZE_OUTPUT_FOR_C  = NO
 
-# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java
-# sources only. Doxygen will then generate output that is more tailored for
-# Java. For instance, namespaces will be presented as packages, qualified
-# scopes will look different, etc.
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or
+# Python sources only. Doxygen will then generate output that is more tailored
+# for that language. For instance, namespaces will be presented as packages,
+# qualified scopes will look different, etc.
+# The default value is: NO.
 
 OPTIMIZE_OUTPUT_JAVA   = NO
 
 # Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
-# sources only. Doxygen will then generate output that is more tailored for
-# Fortran.
+# sources. Doxygen will then generate output that is tailored for Fortran.
+# The default value is: NO.
 
 OPTIMIZE_FOR_FORTRAN   = NO
 
 # Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
-# sources. Doxygen will then generate output that is tailored for
-# VHDL.
+# sources. Doxygen will then generate output that is tailored for VHDL.
+# The default value is: NO.
 
 OPTIMIZE_OUTPUT_VHDL   = NO
 
+# Set the OPTIMIZE_OUTPUT_SLICE tag to YES if your project consists of Slice
+# sources only. Doxygen will then generate output that is more tailored for that
+# language. For instance, namespaces will be presented as modules, types will be
+# separated into more groups, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_SLICE  = NO
+
 # Doxygen selects the parser to use depending on the extension of the files it
-# parses. With this tag you can assign which parser to use for a given extension.
-# Doxygen has a built-in mapping, but you can override or extend it using this
-# tag. The format is ext=language, where ext is a file extension, and language
-# is one of the parsers supported by doxygen: IDL, Java, Javascript, CSharp, C,
-# C++, D, PHP, Objective-C, Python, Fortran, VHDL, C, C++. For instance to make
-# doxygen treat .inc files as Fortran files (default is PHP), and .f files as C
-# (default is Fortran), use: inc=Fortran f=C. Note that for custom extensions
-# you also need to set FILE_PATTERNS otherwise the files are not read by doxygen.
+# parses. With this tag you can assign which parser to use for a given
+# extension. Doxygen has a built-in mapping, but you can override or extend it
+# using this tag. The format is ext=language, where ext is a file extension, and
+# language is one of the parsers supported by doxygen: IDL, Java, JavaScript,
+# Csharp (C#), C, C++, D, PHP, md (Markdown), Objective-C, Python, Slice, VHDL,
+# Fortran (fixed format Fortran: FortranFixed, free formatted Fortran:
+# FortranFree, unknown formatted Fortran: Fortran. In the later case the parser
+# tries to guess whether the code is fixed or free formatted code, this is the
+# default for Fortran type files). For instance to make doxygen treat .inc files
+# as Fortran files (default is PHP), and .f files as C (default is Fortran),
+# use: inc=Fortran f=C.
+#
+# Note: For files without extension you can use no_extension as a placeholder.
+#
+# Note that for custom extensions you also need to set FILE_PATTERNS otherwise
+# the files are not read by doxygen. When specifying no_extension you should add
+# * to the FILE_PATTERNS.
+#
+# Note see also the list of default file extension mappings.
 
 EXTENSION_MAPPING      =
 
-# If MARKDOWN_SUPPORT is enabled (the default) then doxygen pre-processes all
-# comments according to the Markdown format, which allows for more readable
-# documentation. See http://daringfireball.net/projects/markdown/ for details.
-# The output of markdown processing is further processed by doxygen, so you
-# can mix doxygen, HTML, and XML commands with Markdown formatting.
-# Disable only in case of backward compatibilities issues.
+# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
+# according to the Markdown format, which allows for more readable
+# documentation. See https://daringfireball.net/projects/markdown/ for details.
+# The output of markdown processing is further processed by doxygen, so you can
+# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
+# case of backward compatibilities issues.
+# The default value is: YES.
 
 MARKDOWN_SUPPORT       = YES
 
+# When the TOC_INCLUDE_HEADINGS tag is set to a non-zero value, all headings up
+# to that level are automatically included in the table of contents, even if
+# they do not have an id attribute.
+# Note: This feature currently applies only to Markdown headings.
+# Minimum value: 0, maximum value: 99, default value: 5.
+# This tag requires that the tag MARKDOWN_SUPPORT is set to YES.
+
+TOC_INCLUDE_HEADINGS   = 5
+
+# When enabled doxygen tries to link words that correspond to documented
+# classes, or namespaces to their corresponding documentation. Such a link can
+# be prevented in individual cases by putting a % sign in front of the word or
+# globally by setting AUTOLINK_SUPPORT to NO.
+# The default value is: YES.
+
+AUTOLINK_SUPPORT       = YES
+
 # If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
-# to include (a tag file for) the STL sources as input, then you should
-# set this tag to YES in order to let doxygen match functions declarations and
-# definitions whose arguments contain STL classes (e.g. func(std::string); v.s.
-# func(std::string) {}). This also makes the inheritance and collaboration
+# to include (a tag file for) the STL sources as input, then you should set this
+# tag to YES in order to let doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string);
+# versus func(std::string) {}). This also make the inheritance and collaboration
 # diagrams that involve STL classes more complete and accurate.
+# The default value is: NO.
 
 BUILTIN_STL_SUPPORT    = YES
 
 # If you use Microsoft's C++/CLI language, you should set this option to YES to
 # enable parsing support.
+# The default value is: NO.
 
 CPP_CLI_SUPPORT        = NO
 
-# Set the SIP_SUPPORT tag to YES if your project consists of sip sources only.
-# Doxygen will parse them like normal C++ but will assume all classes use public
-# instead of private inheritance when no explicit protection keyword is present.
+# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
+# https://www.riverbankcomputing.com/software/sip/intro) sources only. Doxygen
+# will parse them like normal C++ but will assume all classes use public instead
+# of private inheritance when no explicit protection keyword is present.
+# The default value is: NO.
 
 SIP_SUPPORT            = NO
 
-# For Microsoft's IDL there are propget and propput attributes to indicate getter
-# and setter methods for a property. Setting this option to YES (the default)
-# will make doxygen replace the get and set methods by a property in the
-# documentation. This will only work if the methods are indeed getting or
-# setting a simple type. If this is not the case, or you want to show the
-# methods anyway, you should set this option to NO.
+# For Microsoft's IDL there are propget and propput attributes to indicate
+# getter and setter methods for a property. Setting this option to YES will make
+# doxygen to replace the get and set methods by a property in the documentation.
+# This will only work if the methods are indeed getting or setting a simple
+# type. If this is not the case, or you want to show the methods anyway, you
+# should set this option to NO.
+# The default value is: YES.
 
 IDL_PROPERTY_SUPPORT   = YES
 
 # If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
-# tag is set to YES, then doxygen will reuse the documentation of the first
+# tag is set to YES then doxygen will reuse the documentation of the first
 # member in the group (if any) for the other members of the group. By default
 # all members of a group must be documented explicitly.
+# The default value is: NO.
 
 DISTRIBUTE_GROUP_DOC   = YES
 
-# Set the SUBGROUPING tag to YES (the default) to allow class member groups of
-# the same type (for instance a group of public functions) to be put as a
-# subgroup of that type (e.g. under the Public Functions section). Set it to
-# NO to prevent subgrouping. Alternatively, this can be done per class using
-# the \nosubgrouping command.
+# If one adds a struct or class to a group and this option is enabled, then also
+# any nested class or struct is added to the same group. By default this option
+# is disabled and one has to add nested compounds explicitly via \ingroup.
+# The default value is: NO.
+
+GROUP_NESTED_COMPOUNDS = NO
+
+# Set the SUBGROUPING tag to YES to allow class member groups of the same type
+# (for instance a group of public functions) to be put as a subgroup of that
+# type (e.g. under the Public Functions section). Set it to NO to prevent
+# subgrouping. Alternatively, this can be done per class using the
+# \nosubgrouping command.
+# The default value is: YES.
 
 SUBGROUPING            = YES
 
-# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and
-# unions are shown inside the group in which they are included (e.g. using
-# @ingroup) instead of on a separate page (for HTML and Man pages) or
-# section (for LaTeX and RTF).
+# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions
+# are shown inside the group in which they are included (e.g. using \ingroup)
+# instead of on a separate page (for HTML and Man pages) or section (for LaTeX
+# and RTF).
+#
+# Note that this feature does not work in combination with
+# SEPARATE_MEMBER_PAGES.
+# The default value is: NO.
 
 INLINE_GROUPED_CLASSES = NO
 
-# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and
-# unions with only public data fields will be shown inline in the documentation
-# of the scope in which they are defined (i.e. file, namespace, or group
-# documentation), provided this scope is documented. If set to NO (the default),
-# structs, classes, and unions are shown on a separate page (for HTML and Man
-# pages) or section (for LaTeX and RTF).
+# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions
+# with only public data fields or simple typedef fields will be shown inline in
+# the documentation of the scope in which they are defined (i.e. file,
+# namespace, or group documentation), provided this scope is documented. If set
+# to NO, structs, classes, and unions are shown on a separate page (for HTML and
+# Man pages) or section (for LaTeX and RTF).
+# The default value is: NO.
 
 INLINE_SIMPLE_STRUCTS  = NO
 
-# When TYPEDEF_HIDES_STRUCT is enabled, a typedef of a struct, union, or enum
-# is documented as struct, union, or enum with the name of the typedef. So
+# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or
+# enum is documented as struct, union, or enum with the name of the typedef. So
 # typedef struct TypeS {} TypeT, will appear in the documentation as a struct
 # with name TypeT. When disabled the typedef will appear as a member of a file,
-# namespace, or class. And the struct will be named TypeS. This can typically
-# be useful for C code in case the coding convention dictates that all compound
+# namespace, or class. And the struct will be named TypeS. This can typically be
+# useful for C code in case the coding convention dictates that all compound
 # types are typedef'ed and only the typedef is referenced, never the tag name.
+# The default value is: NO.
 
 TYPEDEF_HIDES_STRUCT   = NO
 
-# The SYMBOL_CACHE_SIZE determines the size of the internal cache use to
-# determine which symbols to keep in memory and which to flush to disk.
-# When the cache is full, less often used symbols will be written to disk.
-# For small to medium size projects (<1000 input files) the default value is
-# probably good enough. For larger projects a too small cache size can cause
-# doxygen to be busy swapping symbols to and from disk most of the time
-# causing a significant performance penalty.
-# If the system has enough physical memory increasing the cache will improve the
-# performance by keeping more symbols in memory. Note that the value works on
-# a logarithmic scale so increasing the size by one will roughly double the
-# memory usage. The cache size is given by this formula:
-# 2^(16+SYMBOL_CACHE_SIZE). The valid range is 0..9, the default is 0,
-# corresponding to a cache size of 2^16 = 65536 symbols.
-
-# DQ (12/19/2015): This is no longer used (reported as a warning by doxygen).
-# SYMBOL_CACHE_SIZE      = 0
-
-# Similar to the SYMBOL_CACHE_SIZE the size of the symbol lookup cache can be
-# set using LOOKUP_CACHE_SIZE. This cache is used to resolve symbols given
-# their name and scope. Since this can be an expensive process and often the
-# same symbol appear multiple times in the code, doxygen keeps a cache of
-# pre-resolved symbols. If the cache is too small doxygen will become slower.
-# If the cache is too large, memory is wasted. The cache size is given by this
-# formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range is 0..9, the default is 0,
-# corresponding to a cache size of 2^16 = 65536 symbols.
+# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This
+# cache is used to resolve symbols given their name and scope. Since this can be
+# an expensive process and often the same symbol appears multiple times in the
+# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small
+# doxygen will become slower. If the cache is too large, memory is wasted. The
+# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range
+# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536
+# symbols. At the end of a run doxygen will report the cache usage and suggest
+# the optimal cache size from a speed point of view.
+# Minimum value: 0, maximum value: 9, default value: 0.
 
 LOOKUP_CACHE_SIZE      = 0
 
+# The NUM_PROC_THREADS specifies the number threads doxygen is allowed to use
+# during processing. When set to 0 doxygen will based this on the number of
+# cores available in the system. You can set it explicitly to a value larger
+# than 0 to get more control over the balance between CPU load and processing
+# speed. At this moment only the input processing can be done using multiple
+# threads. Since this is still an experimental feature the default is set to 1,
+# which efficively disables parallel processing. Please report any issues you
+# encounter. Generating dot graphs in parallel is controlled by the
+# DOT_NUM_THREADS setting.
+# Minimum value: 0, maximum value: 32, default value: 1.
+
+NUM_PROC_THREADS       = 1
+
 #---------------------------------------------------------------------------
 # Build related configuration options
 #---------------------------------------------------------------------------
 
-# If the EXTRACT_ALL tag is set to YES doxygen will assume all entities in
-# documentation are documented, even if no documentation was available.
-# Private class members and static file members will be hidden unless
-# the EXTRACT_PRIVATE and EXTRACT_STATIC tags are set to YES
+# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in
+# documentation are documented, even if no documentation was available. Private
+# class members and static file members will be hidden unless the
+# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.
+# Note: This will also disable the warnings about undocumented members that are
+# normally produced when WARNINGS is set to YES.
+# The default value is: NO.
 
 EXTRACT_ALL            = @DOXYGEN_EXTRACT_ALL@
 
-# If the EXTRACT_PRIVATE tag is set to YES all private members of a class
-# will be included in the documentation.
+# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will
+# be included in the documentation.
+# The default value is: NO.
 
 EXTRACT_PRIVATE        = @DOXYGEN_EXTRACT_PRIVATE@
 
-# If the EXTRACT_PACKAGE tag is set to YES all members with package or internal scope will be included in the documentation.
+# If the EXTRACT_PRIV_VIRTUAL tag is set to YES, documented private virtual
+# methods of a class will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIV_VIRTUAL   = NO
+
+# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal
+# scope will be included in the documentation.
+# The default value is: NO.
 
 EXTRACT_PACKAGE        = NO
 
-# If the EXTRACT_STATIC tag is set to YES all static members of a file
-# will be included in the documentation.
+# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be
+# included in the documentation.
+# The default value is: NO.
 
 EXTRACT_STATIC         = @DOXYGEN_EXTRACT_STATIC@
 
-# If the EXTRACT_LOCAL_CLASSES tag is set to YES classes (and structs)
-# defined locally in source files will be included in the documentation.
-# If set to NO only classes defined in header files are included.
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined
+# locally in source files will be included in the documentation. If set to NO,
+# only classes defined in header files are included. Does not have any effect
+# for Java sources.
+# The default value is: YES.
 
 EXTRACT_LOCAL_CLASSES  = YES
 
-# This flag is only useful for Objective-C code. When set to YES local
-# methods, which are defined in the implementation section but not in
-# the interface are included in the documentation.
-# If set to NO (the default) only methods in the interface are included.
+# This flag is only useful for Objective-C code. If set to YES, local methods,
+# which are defined in the implementation section but not in the interface are
+# included in the documentation. If set to NO, only methods in the interface are
+# included.
+# The default value is: NO.
 
 EXTRACT_LOCAL_METHODS  = NO
 
 # If this flag is set to YES, the members of anonymous namespaces will be
 # extracted and appear in the documentation as a namespace called
-# 'anonymous_namespace{file}', where file will be replaced with the base
-# name of the file that contains the anonymous namespace. By default
-# anonymous namespaces are hidden.
+# 'anonymous_namespace{file}', where file will be replaced with the base name of
+# the file that contains the anonymous namespace. By default anonymous namespace
+# are hidden.
+# The default value is: NO.
 
 EXTRACT_ANON_NSPACES   = NO
 
-# If the HIDE_UNDOC_MEMBERS tag is set to YES, Doxygen will hide all
-# undocumented members of documented classes, files or namespaces.
-# If set to NO (the default) these members will be included in the
-# various overviews, but no documentation section is generated.
-# This option has no effect if EXTRACT_ALL is enabled.
+# If this flag is set to YES, the name of an unnamed parameter in a declaration
+# will be determined by the corresponding definition. By default unnamed
+# parameters remain unnamed in the output.
+# The default value is: YES.
+
+RESOLVE_UNNAMED_PARAMS = YES
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all
+# undocumented members inside documented classes or files. If set to NO these
+# members will be included in the various overviews, but no documentation
+# section is generated. This option has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
 
 HIDE_UNDOC_MEMBERS     = @DOXYGEN_HIDE_UNDOC_MEMBERS@
 
-# If the HIDE_UNDOC_CLASSES tag is set to YES, Doxygen will hide all
-# undocumented classes that are normally visible in the class hierarchy.
-# If set to NO (the default) these classes will be included in the various
-# overviews. This option has no effect if EXTRACT_ALL is enabled.
+# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all
+# undocumented classes that are normally visible in the class hierarchy. If set
+# to NO, these classes will be included in the various overviews. This option
+# has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
 
 HIDE_UNDOC_CLASSES     = @DOXYGEN_HIDE_UNDOC_CLASSES@
 
-# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, Doxygen will hide all
-# friend (class|struct|union) declarations.
-# If set to NO (the default) these declarations will be included in the
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend
+# declarations. If set to NO, these declarations will be included in the
 # documentation.
+# The default value is: NO.
 
 HIDE_FRIEND_COMPOUNDS  = @DOXYGEN_HIDE_FRIEND_COMPOUNDS@
 
-# If the HIDE_IN_BODY_DOCS tag is set to YES, Doxygen will hide any
-# documentation blocks found inside the body of a function.
-# If set to NO (the default) these blocks will be appended to the
-# function's detailed documentation block.
+# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any
+# documentation blocks found inside the body of a function. If set to NO, these
+# blocks will be appended to the function's detailed documentation block.
+# The default value is: NO.
 
 HIDE_IN_BODY_DOCS      = NO
 
-# The INTERNAL_DOCS tag determines if documentation
-# that is typed after a \internal command is included. If the tag is set
-# to NO (the default) then the documentation will be excluded.
-# Set it to YES to include the internal documentation.
+# The INTERNAL_DOCS tag determines if documentation that is typed after a
+# \internal command is included. If the tag is set to NO then the documentation
+# will be excluded. Set it to YES to include the internal documentation.
+# The default value is: NO.
 
 INTERNAL_DOCS          = @DOXYGEN_INTERNAL_DOCS@
 
-# If the CASE_SENSE_NAMES tag is set to NO then Doxygen will only generate
-# file names in lower-case letters. If set to YES upper-case letters are also
-# allowed. This is useful if you have classes or files whose names only differ
-# in case and if your file system supports case sensitive file names. Windows
-# and Mac users are advised to set this option to NO.
+# With the correct setting of option CASE_SENSE_NAMES doxygen will better be
+# able to match the capabilities of the underlying filesystem. In case the
+# filesystem is case sensitive (i.e. it supports files in the same directory
+# whose names only differ in casing), the option must be set to YES to properly
+# deal with such files in case they appear in the input. For filesystems that
+# are not case sensitive the option should be be set to NO to properly deal with
+# output files written for symbols that only differ in casing, such as for two
+# classes, one named CLASS and the other named Class, and to also support
+# references to files without having to specify the exact matching casing. On
+# Windows (including Cygwin) and MacOS, users should typically set this option
+# to NO, whereas on Linux or other Unix flavors it should typically be set to
+# YES.
+# The default value is: system dependent.
 
 CASE_SENSE_NAMES       = YES
 
-# If the HIDE_SCOPE_NAMES tag is set to NO (the default) then Doxygen
-# will show members with their full class and namespace scopes in the
-# documentation. If set to YES the scope will be hidden.
+# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with
+# their full class and namespace scopes in the documentation. If set to YES, the
+# scope will be hidden.
+# The default value is: NO.
 
 HIDE_SCOPE_NAMES       = NO
 
-# If the SHOW_INCLUDE_FILES tag is set to YES (the default) then Doxygen
-# will put a list of the files that are included by a file in the documentation
-# of that file.
+# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will
+# append additional text to a page's title, such as Class Reference. If set to
+# YES the compound reference will be hidden.
+# The default value is: NO.
+
+HIDE_COMPOUND_REFERENCE= NO
+
+# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of
+# the files that are included by a file in the documentation of that file.
+# The default value is: YES.
 
 SHOW_INCLUDE_FILES     = YES
 
-# If the FORCE_LOCAL_INCLUDES tag is set to YES then Doxygen
-# will list include files with double quotes in the documentation
-# rather than with sharp brackets.
+# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each
+# grouped member an include statement to the documentation, telling the reader
+# which file to include in order to use the member.
+# The default value is: NO.
+
+SHOW_GROUPED_MEMB_INC  = NO
+
+# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include
+# files with double quotes in the documentation rather than with sharp brackets.
+# The default value is: NO.
 
 FORCE_LOCAL_INCLUDES   = NO
 
-# If the INLINE_INFO tag is set to YES (the default) then a tag [inline]
-# is inserted in the documentation for inline members.
+# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the
+# documentation for inline members.
+# The default value is: YES.
 
 INLINE_INFO            = YES
 
-# If the SORT_MEMBER_DOCS tag is set to YES (the default) then doxygen
-# will sort the (detailed) documentation of file and class members
-# alphabetically by member name. If set to NO the members will appear in
-# declaration order.
+# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the
+# (detailed) documentation of file and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order.
+# The default value is: YES.
 
 SORT_MEMBER_DOCS       = NO
 
-# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the
-# brief documentation of file, namespace and class members alphabetically
-# by member name. If set to NO (the default) the members will appear in
-# declaration order.
+# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief
+# descriptions of file, namespace and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order. Note that
+# this will also influence the order of the classes in the class list.
+# The default value is: NO.
 
 SORT_BRIEF_DOCS        = NO
 
-# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen
-# will sort the (brief and detailed) documentation of class members so that
-# constructors and destructors are listed first. If set to NO (the default)
-# the constructors will appear in the respective orders defined by
-# SORT_MEMBER_DOCS and SORT_BRIEF_DOCS.
-# This tag will be ignored for brief docs if SORT_BRIEF_DOCS is set to NO
-# and ignored for detailed docs if SORT_MEMBER_DOCS is set to NO.
+# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the
+# (brief and detailed) documentation of class members so that constructors and
+# destructors are listed first. If set to NO the constructors will appear in the
+# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.
+# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief
+# member documentation.
+# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting
+# detailed member documentation.
+# The default value is: NO.
 
 SORT_MEMBERS_CTORS_1ST = YES
 
-# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the
-# hierarchy of group names into alphabetical order. If set to NO (the default)
-# the group names will appear in their defined order.
+# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy
+# of group names into alphabetical order. If set to NO the group names will
+# appear in their defined order.
+# The default value is: NO.
 
 SORT_GROUP_NAMES       = NO
 
-# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be
-# sorted by fully-qualified names, including namespaces. If set to
-# NO (the default), the class list will be sorted only by class name,
-# not including the namespace part.
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by
+# fully-qualified names, including namespaces. If set to NO, the class list will
+# be sorted only by class name, not including the namespace part.
 # Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
-# Note: This option applies only to the class list, not to the
-# alphabetical list.
+# Note: This option applies only to the class list, not to the alphabetical
+# list.
+# The default value is: NO.
 
 SORT_BY_SCOPE_NAME     = NO
 
-# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to
-# do proper type resolution of all parameters of a function it will reject a
-# match between the prototype and the implementation of a member function even
-# if there is only one candidate or it is obvious which candidate to choose
-# by doing a simple string match. By disabling STRICT_PROTO_MATCHING doxygen
-# will still accept a match between prototype and implementation in such cases.
+# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper
+# type resolution of all parameters of a function it will reject a match between
+# the prototype and the implementation of a member function even if there is
+# only one candidate or it is obvious which candidate to choose by doing a
+# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still
+# accept a match between prototype and implementation in such cases.
+# The default value is: NO.
 
 STRICT_PROTO_MATCHING  = NO
 
-# The GENERATE_TODOLIST tag can be used to enable (YES) or
-# disable (NO) the todo list. This list is created by putting \todo
-# commands in the documentation.
+# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo
+# list. This list is created by putting \todo commands in the documentation.
+# The default value is: YES.
 
 GENERATE_TODOLIST      = NO
 
-# The GENERATE_TESTLIST tag can be used to enable (YES) or
-# disable (NO) the test list. This list is created by putting \test
-# commands in the documentation.
+# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test
+# list. This list is created by putting \test commands in the documentation.
+# The default value is: YES.
 
 GENERATE_TESTLIST      = NO
 
-# The GENERATE_BUGLIST tag can be used to enable (YES) or
-# disable (NO) the bug list. This list is created by putting \bug
-# commands in the documentation.
+# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug
+# list. This list is created by putting \bug commands in the documentation.
+# The default value is: YES.
 
 GENERATE_BUGLIST       = NO
 
-# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or
-# disable (NO) the deprecated list. This list is created by putting
-# \deprecated commands in the documentation.
+# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)
+# the deprecated list. This list is created by putting \deprecated commands in
+# the documentation.
+# The default value is: YES.
 
 GENERATE_DEPRECATEDLIST= NO
 
-# The ENABLED_SECTIONS tag can be used to enable conditional
-# documentation sections, marked by \if sectionname ... \endif.
+# The ENABLED_SECTIONS tag can be used to enable conditional documentation
+# sections, marked by \if <section_label> ... \endif and \cond <section_label>
+# ... \endcond blocks.
 
 ENABLED_SECTIONS       = @DOXYGEN_ENABLED_SECTIONS@
 
-# The MAX_INITIALIZER_LINES tag determines the maximum number of lines
-# the initial value of a variable or macro consists of for it to appear in
-# the documentation. If the initializer consists of more lines than specified
-# here it will be hidden. Use a value of 0 to hide initializers completely.
-# The appearance of the initializer of individual variables and macros in the
-# documentation can be controlled using \showinitializer or \hideinitializer
-# command in the documentation regardless of this setting.
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the
+# initial value of a variable or macro / define can have for it to appear in the
+# documentation. If the initializer consists of more lines than specified here
+# it will be hidden. Use a value of 0 to hide initializers completely. The
+# appearance of the value of individual variables and macros / defines can be
+# controlled using \showinitializer or \hideinitializer command in the
+# documentation regardless of this setting.
+# Minimum value: 0, maximum value: 10000, default value: 30.
 
 MAX_INITIALIZER_LINES  = 30
 
-# Set the SHOW_USED_FILES tag to NO to disable the list of files generated
-# at the bottom of the documentation of classes and structs. If set to YES the
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at
+# the bottom of the documentation of classes and structs. If set to YES, the
 # list will mention the files that were used to generate the documentation.
+# The default value is: YES.
 
 SHOW_USED_FILES        = YES
 
-# Set the SHOW_FILES tag to NO to disable the generation of the Files page.
-# This will remove the Files entry from the Quick Index and from the
-# Folder Tree View (if specified). The default is YES.
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This
+# will remove the Files entry from the Quick Index and from the Folder Tree View
+# (if specified).
+# The default value is: YES.
 
 SHOW_FILES             = YES
 
-# Set the SHOW_NAMESPACES tag to NO to disable the generation of the
-# Namespaces page.
-# This will remove the Namespaces entry from the Quick Index
-# and from the Folder Tree View (if specified). The default is YES.
+# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces
+# page. This will remove the Namespaces entry from the Quick Index and from the
+# Folder Tree View (if specified).
+# The default value is: YES.
 
 SHOW_NAMESPACES        = YES
 
 # The FILE_VERSION_FILTER tag can be used to specify a program or script that
 # doxygen should invoke to get the current version for each file (typically from
 # the version control system). Doxygen will invoke the program by executing (via
-# popen()) the command <command> <input-file>, where <command> is the value of
-# the FILE_VERSION_FILTER tag, and <input-file> is the name of an input file
-# provided by doxygen. Whatever the program writes to standard output
-# is used as the file version. See the manual for examples.
+# popen()) the command command input-file, where command is the value of the
+# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided
+# by doxygen. Whatever the program writes to standard output is used as the file
+# version. For an example see the documentation.
 
 FILE_VERSION_FILTER    =
 
 # The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
 # by doxygen. The layout file controls the global structure of the generated
 # output files in an output format independent way. To create the layout file
-# that represents doxygen's defaults, run doxygen with the -l option.
-# You can optionally specify a file name after the option, if omitted
-# DoxygenLayout.xml will be used as the name of the layout file.
+# that represents doxygen's defaults, run doxygen with the -l option. You can
+# optionally specify a file name after the option, if omitted DoxygenLayout.xml
+# will be used as the name of the layout file.
+#
+# Note that if you run doxygen from a directory containing a file called
+# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE
+# tag is left empty.
 
 LAYOUT_FILE            = @top_srcdir@/docs/Rose/roseDoxygenLayout.xml
 
-# The CITE_BIB_FILES tag can be used to specify one or more bib files
-# containing the references data. This must be a list of .bib files. The
-# .bib extension is automatically appended if omitted. Using this command
-# requires the bibtex tool to be installed. See also
-# http://en.wikipedia.org/wiki/BibTeX for more info. For LaTeX the style
-# of the bibliography can be controlled using LATEX_BIB_STYLE. To use this
-# feature you need bibtex and perl available in the search path.
+# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
+# the reference definitions. This must be a list of .bib files. The .bib
+# extension is automatically appended if omitted. This requires the bibtex tool
+# to be installed. See also https://en.wikipedia.org/wiki/BibTeX for more info.
+# For LaTeX the style of the bibliography can be controlled using
+# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
+# search path. See also \cite for info how to create references.
 
 CITE_BIB_FILES         =
 
 #---------------------------------------------------------------------------
-# configuration options related to warning and progress messages
+# Configuration options related to warning and progress messages
 #---------------------------------------------------------------------------
 
-# The QUIET tag can be used to turn on/off the messages that are generated
-# by doxygen. Possible values are YES and NO. If left blank NO is used.
+# The QUIET tag can be used to turn on/off the messages that are generated to
+# standard output by doxygen. If QUIET is set to YES this implies that the
+# messages are off.
+# The default value is: NO.
 
 QUIET                  = YES
 
 # The WARNINGS tag can be used to turn on/off the warning messages that are
-# generated by doxygen. Possible values are YES and NO. If left blank
-# NO is used.
+# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES
+# this implies that the warnings are on.
+#
+# Tip: Turn warnings on while writing the documentation.
+# The default value is: YES.
 
 WARNINGS               = YES
 
-# If WARN_IF_UNDOCUMENTED is set to YES, then doxygen will generate warnings
-# for undocumented members. If EXTRACT_ALL is set to YES then this flag will
-# automatically be disabled.
+# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate
+# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag
+# will automatically be disabled.
+# The default value is: YES.
 
 WARN_IF_UNDOCUMENTED   = YES
 
-# If WARN_IF_DOC_ERROR is set to YES, doxygen will generate warnings for
-# potential errors in the documentation, such as not documenting some
-# parameters in a documented function, or documenting parameters that
-# don't exist or using markup commands wrongly.
+# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for
+# potential errors in the documentation, such as not documenting some parameters
+# in a documented function, or documenting parameters that don't exist or using
+# markup commands wrongly.
+# The default value is: YES.
 
 WARN_IF_DOC_ERROR      = YES
 
-# The WARN_NO_PARAMDOC option can be enabled to get warnings for
-# functions that are documented, but have no documentation for their parameters
-# or return value. If set to NO (the default) doxygen will only warn about
-# wrong or incomplete parameter documentation, but not about the absence of
-# documentation.
+# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that
+# are documented, but have no documentation for their parameters or return
+# value. If set to NO, doxygen will only warn about wrong or incomplete
+# parameter documentation, but not about the absence of documentation. If
+# EXTRACT_ALL is set to YES then this flag will automatically be disabled.
+# The default value is: NO.
 
 WARN_NO_PARAMDOC       = NO
 
-# The WARN_FORMAT tag determines the format of the warning messages that
-# doxygen can produce. The string should contain the $file, $line, and $text
-# tags, which will be replaced by the file and line number from which the
-# warning originated and the warning text. Optionally the format may contain
-# $version, which will be replaced by the version of the file (if it could
-# be obtained via FILE_VERSION_FILTER)
+# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when
+# a warning is encountered. If the WARN_AS_ERROR tag is set to FAIL_ON_WARNINGS
+# then doxygen will continue running as if WARN_AS_ERROR tag is set to NO, but
+# at the end of the doxygen process doxygen will return with a non-zero status.
+# Possible values are: NO, YES and FAIL_ON_WARNINGS.
+# The default value is: NO.
+
+WARN_AS_ERROR          = NO
+
+# The WARN_FORMAT tag determines the format of the warning messages that doxygen
+# can produce. The string should contain the $file, $line, and $text tags, which
+# will be replaced by the file and line number from which the warning originated
+# and the warning text. Optionally the format may contain $version, which will
+# be replaced by the version of the file (if it could be obtained via
+# FILE_VERSION_FILTER)
+# The default value is: $file:$line: $text.
 
 WARN_FORMAT            = "$file:$line: $text"
 
-# The WARN_LOGFILE tag can be used to specify a file to which warning
-# and error messages should be written. If left blank the output is written
-# to stderr.
+# The WARN_LOGFILE tag can be used to specify a file to which warning and error
+# messages should be written. If left blank the output is written to standard
+# error (stderr).
 
 WARN_LOGFILE           =
 
 #---------------------------------------------------------------------------
-# configuration options related to the input files
+# Configuration options related to the input files
 #---------------------------------------------------------------------------
 
-# The INPUT tag can be used to specify the files and/or directories that contain
-# documented source files. You may enter file names like "myfile.cpp" or
-# directories like "/usr/src/myproject". Separate the files or directories
-# with spaces.
-
-# NOTE: If your file isn't being picked up by doxygen, then perhaps it's listed
-#       in the EXCLUDE variable below.
-
-# NOTE: Do not add EDG source files to this list or else source code may leak
-#       into the documentation.
-
-# NOTE: The order of the files/directories listed here is generally the same order
-#       they'll appear in the documentation except when some other sort order
-#       prevails (e.g., alphabetical or source-order).
+# The INPUT tag is used to specify the files and/or directories that contain
+# documented source files. You may enter file names like myfile.cpp or
+# directories like /usr/src/myproject. Separate the files or directories with
+# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING
+# Note: If this tag is empty the current directory is searched.
 
 INPUT                  = @top_srcdir@/docs/Rose/MainPage.dox \
-			 @top_srcdir@/docs/Rose/ToolDevelopment \
-			 @top_srcdir@/docs/Rose/LibraryGeneralPrinciples.dox \
-			 @top_srcdir@/docs/Rose/BinaryTutorial.dox \
-			 @top_srcdir@/docs/Rose/Developers.dox \
+                         @top_srcdir@/docs/Rose/ToolDevelopment \
+                         @top_srcdir@/docs/Rose/LibraryGeneralPrinciples.dox \
+                         @top_srcdir@/docs/Rose/Developers.dox \
                          @top_srcdir@/docs/Rose \
                          @top_pwd@/src/frontend/SageIII \
                          @top_srcdir@/src/frontend/frontend.docs \
                          @top_srcdir@/docs/testDoxygen \
-			 @top_srcdir@/src/Rose \
-			 @top_srcdir@/src/Rose/CommandLine \
-			 @top_srcdir@/src/Rose/StringUtility \
-			 @top_srcdir@/src/Rose/AST \
+                         @top_srcdir@/src/frontend/CxxFrontend/EDG/edgRose \
+                         @top_srcdir@/src/frontend/OpenFortranParser_SAGE_Connection \
                          @top_srcdir@/src/frontend/SageIII/ \
+                         @top_srcdir@/src/frontend/SageIII/sage.docs \
                          @top_srcdir@/src/frontend/SageIII/docs \
-                         @top_srcdir@/src/frontend/SageIII/astPostProcessing/checkIsModifiedFlag.C \
+                         @top_srcdir@/src/frontend/SageIII/astFixup \
+                         @top_srcdir@/src/frontend/SageIII/astHiddenTypeAndDeclarationLists \
+                         @top_srcdir@/src/frontend/SageIII/astPostProcessing \
+                         @top_srcdir@/src/frontend/SageIII/astTokenStream \
+                         @top_srcdir@/src/frontend/SageIII/includeDirectivesProcessing \
+                         @top_srcdir@/src/frontend/SageIII/sage_support \
                          @top_srcdir@/src/frontend/SageIII/sageInterface \
                          @top_srcdir@/src/frontend/SageIII/virtualCFG \
                          @top_srcdir@/src/midend/programTransformation/ompLowering \
                          @top_srcdir@/src/midend/midend.docs \
+                         @top_srcdir@/src/midend/abstractLayer \
+                         @top_srcdir@/src/midend/astDiagnostics \
                          @top_srcdir@/src/midend/astDiagnostics/AstDiagnostics.docs \
+                         @top_srcdir@/src/midend/astDump \
+                         @top_srcdir@/src/midend/astDump/MSTL.docs \
+                         @top_srcdir@/src/midend/astProcessing \
+                         @top_srcdir@/src/midend/astProcessing/AstProcessing.docs \
+                         @top_srcdir@/src/midend/astQuery \
+                         @top_srcdir@/src/midend/astQuery/QueryLib.docs \
+                         @top_srcdir@/src/midend/astUtil \
                          @top_srcdir@/src/midend/programAnalysis/CallGraphAnalysis \
                          @top_srcdir@/src/midend/programAnalysis/genericDataflow \
                          @top_srcdir@/src/midend/programAnalysis/genericDataflow/analysis \
@@ -707,8 +900,6 @@ INPUT                  = @top_srcdir@/docs/Rose/MainPage.dox \
                          @top_srcdir@/src/midend/programTransformation/documentation.docs \
                          @top_srcdir@/src/midend/programTransformation/extractFunctionArgumentsNormalization \
                          @top_srcdir@/src/midend/programTransformation/ompLowering/omp_lowering.h \
-                         @top_srcdir@/src/midend/astProcessing \
-                         @top_srcdir@/src/midend/astQuery/QueryLib.docs \
                          @top_srcdir@/src/backend/backend.docs \
                          @top_srcdir@/src/backend/unparser/unparser.docs \
                          @top_srcdir@/src/backend/unparser/languageIndependenceSupport/documentation.docs \
@@ -716,57 +907,60 @@ INPUT                  = @top_srcdir@/docs/Rose/MainPage.dox \
                          @top_srcdir@/src/backend/unparser/FortranCodeGeneration/documentation.docs \
                          @top_srcdir@/src/util \
                          @top_srcdir@/src/util/utilDocumentation.docs \
-                         @top_srcdir@/src/util/stringSupport/stringSupportDocumentation.docs \
-                         @top_srcdir@/src/util/stringSupport/ \
                          @top_srcdir@/src/util/commandlineProcessing \
+                         @top_srcdir@/src/util/graphs \
+                         @top_srcdir@/src/util/StringUtility/stringSupportDocumentation.docs \
+                         @top_srcdir@/src/util/StringUtility \
+                         @top_srcdir@/src/util/support \
                          @top_srcdir@/src/3rdPartyLibraries/3rdPartyLibraries.docs \
-                         @top_srcdir@/src/3rdPartyLibraries/MSTL/MSTL.docs \
                          @top_srcdir@/src/extra.docs
 
 # This tag can be used to specify the character encoding of the source files
-# that doxygen parses. Internally doxygen uses the UTF-8 encoding, which is
-# also the default input encoding. Doxygen uses libiconv (or the iconv built
-# into libc) for the transcoding. See http://www.gnu.org/software/libiconv for
-# the list of possible encodings.
+# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
+# libiconv (or the iconv built into libc) for the transcoding. See the libiconv
+# documentation (see:
+# https://www.gnu.org/software/libiconv/) for the list of possible encodings.
+# The default value is: UTF-8.
 
 INPUT_ENCODING         = UTF-8
 
 # If the value of the INPUT tag contains directories, you can use the
-# FILE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp
-# and *.h) to filter out the source-files in the directories. If left
-# blank the following patterns are tested:
-# *.c *.cc *.cxx *.cpp *.c++ *.d *.java *.ii *.ixx *.ipp *.i++ *.inl *.h *.hh
-# *.hxx *.hpp *.h++ *.idl *.odl *.cs *.php *.php3 *.inc *.m *.mm *.dox *.py
-# *.f90 *.f *.for *.vhd *.vhdl
+# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and
+# *.h) to filter out the source-files in the directories.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# read by doxygen.
+#
+# Note the list of default checked file patterns might differ from the list of
+# default file extension mappings.
+#
+# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,
+# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,
+# *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc,
+# *.m, *.markdown, *.md, *.mm, *.dox (to be provided as doxygen C comment),
+# *.py, *.pyw, *.f90, *.f95, *.f03, *.f08, *.f18, *.f, *.for, *.vhd, *.vhdl,
+# *.ucf, *.qsf and *.ice.
 
 FILE_PATTERNS          = *.h \
                          *.docs \
                          *.dox \
                          *.hh
 
-# The RECURSIVE tag can be used to turn specify whether or not subdirectories
-# should be searched for input files as well. Possible values are YES and NO.
-# If left blank NO is used.
+# The RECURSIVE tag can be used to specify whether or not subdirectories should
+# be searched for input files as well.
+# The default value is: NO.
 
 RECURSIVE              = NO
 
 # The EXCLUDE tag can be used to specify files and/or directories that should be
 # excluded from the INPUT source files. This way you can easily exclude a
 # subdirectory from a directory tree whose root is specified with the INPUT tag.
+#
 # Note that relative paths are relative to the directory from which doxygen is
 # run.
 
-# Use this to "comment out" whole files that are deprecated. [Robb Matzke, 2015-10-01]
-
 EXCLUDE                = @top_srcdir@/src/frontend/CxxFrontend/EDG \
-                         @top_srcdir@/AST_RewriteMechanism/testRewrite.h \
-                         @top_srcdir@/AST_RewriteMechanism/testRewrite.C \
-                         @top_srcdir@/AST_RewriteMechanism/testNewRewrite.h \
-                         @top_srcdir@/AST_RewriteMechanism/testNewRewrite.C \
-                         @top_srcdir@/AST_RewriteMechanism/testRewritePermutations.C \
-                         @top_srcdir@/AST_RewriteMechanism/testRewriteReplacementPermutations.C \
-                         @top_srcdir@/AST_RewriteMechanism/test1.C \
-                         @top_srcdir@/AST_RewriteMechanism/inputProgram1.C \
                          @top_srcdir@/src/frontend/SageIII/sageInterface/highLevelInterface.h \
                          @top_srcdir@/src/midend/ompLowering/libgomp_g.h \
                          @top_srcdir@/util/testStrings.C \
@@ -779,14 +973,16 @@ EXCLUDE                = @top_srcdir@/src/frontend/CxxFrontend/EDG \
 # The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
 # directories that are symbolic links (a Unix file system feature) are excluded
 # from the input.
+# The default value is: NO.
 
 EXCLUDE_SYMLINKS       = NO
 
 # If the value of the INPUT tag contains directories, you can use the
 # EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
-# certain files from those directories. Note that the wildcards are matched
-# against the file with absolute path, so to exclude all test directories
-# for example use the pattern */test/*
+# certain files from those directories.
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories for example use the pattern */test/*
 
 EXCLUDE_PATTERNS       =
 
@@ -795,761 +991,1226 @@ EXCLUDE_PATTERNS       =
 # output. The symbol name can be a fully qualified name, a word, or if the
 # wildcard * is used, a substring. Examples: ANamespace, AClass,
 # AClass::ANamespace, ANamespace::*Test
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories use the pattern */test/*
 
 EXCLUDE_SYMBOLS        =
 
-# The EXAMPLE_PATH tag can be used to specify one or more files or
-# directories that contain example code fragments that are included (see
-# the \include command).
+# The EXAMPLE_PATH tag can be used to specify one or more files or directories
+# that contain example code fragments that are included (see the \include
+# command).
 
 EXAMPLE_PATH           = @top_srcdir@ \
-			 @top_srcdir@/tutorial \
-                         @top_srcdir@/src/util/Sawyer/docs/examples
+                         @top_srcdir@/tutorial
 
 # If the value of the EXAMPLE_PATH tag contains directories, you can use the
-# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp
-# and *.h) to filter out the source-files in the directories. If left
-# blank all files are included.
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
+# *.h) to filter out the source-files in the directories. If left blank all
+# files are included.
 
 EXAMPLE_PATTERNS       =
 
 # If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
-# searched for input files to be used with the \include or \dontinclude
-# commands irrespective of the value of the RECURSIVE tag.
-# Possible values are YES and NO. If left blank NO is used.
+# searched for input files to be used with the \include or \dontinclude commands
+# irrespective of the value of the RECURSIVE tag.
+# The default value is: NO.
 
 EXAMPLE_RECURSIVE      = NO
 
-# The IMAGE_PATH tag can be used to specify one or more files or
-# directories that contain image that are included in the documentation (see
-# the \image command).
+# The IMAGE_PATH tag can be used to specify one or more files or directories
+# that contain images that are to be included in the documentation (see the
+# \image command).
 
 IMAGE_PATH             = @top_srcdir@/docs/Rose
 
 # The INPUT_FILTER tag can be used to specify a program that doxygen should
 # invoke to filter for each input file. Doxygen will invoke the filter program
-# by executing (via popen()) the command <filter> <input-file>, where <filter>
-# is the value of the INPUT_FILTER tag, and <input-file> is the name of an
-# input file. Doxygen will then use the output that the filter program writes
-# to standard output.
-# If FILTER_PATTERNS is specified, this tag will be
-# ignored.
+# by executing (via popen()) the command:
+#
+# <filter> <input-file>
+#
+# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the
+# name of an input file. Doxygen will then use the output that the filter
+# program writes to standard output. If FILTER_PATTERNS is specified, this tag
+# will be ignored.
+#
+# Note that the filter must not add or remove lines; it is applied before the
+# code is scanned, but not when the output code is generated. If lines are added
+# or removed, the anchors will not be placed correctly.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
 
 INPUT_FILTER           =
 
 # The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
-# basis.
-# Doxygen will compare the file name with each pattern and apply the
-# filter if there is a match.
-# The filters are a list of the form:
-# pattern=filter (like *.cpp=my_cpp_filter). See INPUT_FILTER for further
-# info on how filters are used. If FILTER_PATTERNS is empty or if
-# non of the patterns match the file name, INPUT_FILTER is applied.
+# basis. Doxygen will compare the file name with each pattern and apply the
+# filter if there is a match. The filters are a list of the form: pattern=filter
+# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how
+# filters are used. If the FILTER_PATTERNS tag is empty or if none of the
+# patterns match the file name, INPUT_FILTER is applied.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
 
 FILTER_PATTERNS        =
 
 # If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
-# INPUT_FILTER) will be used to filter the input files when producing source
-# files to browse (i.e. when SOURCE_BROWSER is set to YES).
+# INPUT_FILTER) will also be used to filter the input files that are used for
+# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).
+# The default value is: NO.
 
 FILTER_SOURCE_FILES    = NO
 
 # The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
-# pattern. A pattern will override the setting for FILTER_PATTERN (if any)
-# and it is also possible to disable source filtering for a specific pattern
-# using *.ext= (so without naming a filter). This option only has effect when
-# FILTER_SOURCE_FILES is enabled.
+# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and
+# it is also possible to disable source filtering for a specific pattern using
+# *.ext= (so without naming a filter).
+# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.
 
 FILTER_SOURCE_PATTERNS =
 
+# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that
+# is part of the input, its contents will be placed on the main page
+# (index.html). This can be useful if you have a project on for instance GitHub
+# and want to reuse the introduction page also for the doxygen output.
+
+USE_MDFILE_AS_MAINPAGE =
+
 #---------------------------------------------------------------------------
-# configuration options related to source browsing
+# Configuration options related to source browsing
 #---------------------------------------------------------------------------
 
-# If the SOURCE_BROWSER tag is set to YES then a list of source files will
-# be generated. Documented entities will be cross-referenced with these sources.
-# Note: To get rid of all source code in the generated output, make sure also
-# VERBATIM_HEADERS is set to NO.
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will be
+# generated. Documented entities will be cross-referenced with these sources.
+#
+# Note: To get rid of all source code in the generated output, make sure that
+# also VERBATIM_HEADERS is set to NO.
+# The default value is: NO.
 
 SOURCE_BROWSER         = YES
 
-# Setting the INLINE_SOURCES tag to YES will include the body
-# of functions and classes directly in the documentation.
+# Setting the INLINE_SOURCES tag to YES will include the body of functions,
+# classes and enums directly into the documentation.
+# The default value is: NO.
 
 INLINE_SOURCES         = NO
 
-# Setting the STRIP_CODE_COMMENTS tag to YES (the default) will instruct
-# doxygen to hide any special comment blocks from generated source code
-# fragments. Normal C, C++ and Fortran comments will always remain visible.
+# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any
+# special comment blocks from generated source code fragments. Normal C, C++ and
+# Fortran comments will always remain visible.
+# The default value is: YES.
 
 STRIP_CODE_COMMENTS    = YES
 
-# If the REFERENCED_BY_RELATION tag is set to YES
-# then for each documented function all documented
-# functions referencing it will be listed.
+# If the REFERENCED_BY_RELATION tag is set to YES then for each documented
+# entity all documented functions referencing it will be listed.
+# The default value is: NO.
 
 REFERENCED_BY_RELATION = YES
 
-# If the REFERENCES_RELATION tag is set to YES
-# then for each documented function all documented entities
-# called/used by that function will be listed.
+# If the REFERENCES_RELATION tag is set to YES then for each documented function
+# all documented entities called/used by that function will be listed.
+# The default value is: NO.
 
 REFERENCES_RELATION    = YES
 
-# If the REFERENCES_LINK_SOURCE tag is set to YES (the default)
-# and SOURCE_BROWSER tag is set to YES, then the hyperlinks from
-# functions in REFERENCES_RELATION and REFERENCED_BY_RELATION lists will
-# link to the source code.
-# Otherwise they will link to the documentation.
+# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set
+# to YES then the hyperlinks from functions in REFERENCES_RELATION and
+# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will
+# link to the documentation.
+# The default value is: YES.
 
 REFERENCES_LINK_SOURCE = YES
 
-# If the USE_HTAGS tag is set to YES then the references to source code
-# will point to the HTML generated by the htags(1) tool instead of doxygen
-# built-in source browser. The htags tool is part of GNU's global source
-# tagging system (see http://www.gnu.org/software/global/global.html). You
-# will need version 4.8.6 or higher.
+# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the
+# source code will show a tooltip with additional information such as prototype,
+# brief description and links to the definition and documentation. Since this
+# will make the HTML file larger and loading of large files a bit slower, you
+# can opt to disable this feature.
+# The default value is: YES.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+SOURCE_TOOLTIPS        = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code will
+# point to the HTML generated by the htags(1) tool instead of doxygen built-in
+# source browser. The htags tool is part of GNU's global source tagging system
+# (see https://www.gnu.org/software/global/global.html). You will need version
+# 4.8.6 or higher.
+#
+# To use it do the following:
+# - Install the latest version of global
+# - Enable SOURCE_BROWSER and USE_HTAGS in the configuration file
+# - Make sure the INPUT points to the root of the source tree
+# - Run doxygen as normal
+#
+# Doxygen will invoke htags (and that will in turn invoke gtags), so these
+# tools must be available from the command line (i.e. in the search path).
+#
+# The result: instead of the source browser generated by doxygen, the links to
+# source code will now point to the output of htags.
+# The default value is: NO.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
 
 USE_HTAGS              = NO
 
-# If the VERBATIM_HEADERS tag is set to YES (the default) then Doxygen
-# will generate a verbatim copy of the header file for each class for
-# which an include is specified. Set to NO to disable this.
+# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a
+# verbatim copy of the header file for each class for which an include is
+# specified. Set to NO to disable this.
+# See also: Section \class.
+# The default value is: YES.
 
 VERBATIM_HEADERS       = YES
 
+# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the
+# clang parser (see:
+# http://clang.llvm.org/) for more accurate parsing at the cost of reduced
+# performance. This can be particularly helpful with template rich C++ code for
+# which doxygen's built-in parser lacks the necessary type information.
+# Note: The availability of this option depends on whether or not doxygen was
+# generated with the -Duse_libclang=ON option for CMake.
+# The default value is: NO.
+
+CLANG_ASSISTED_PARSING = NO
+
+# If clang assisted parsing is enabled and the CLANG_ADD_INC_PATHS tag is set to
+# YES then doxygen will add the directory of each input to the include path.
+# The default value is: YES.
+
+CLANG_ADD_INC_PATHS    = YES
+
+# If clang assisted parsing is enabled you can provide the compiler with command
+# line options that you would normally use when invoking the compiler. Note that
+# the include paths will already be set by doxygen for the files and directories
+# specified with INPUT and INCLUDE_PATH.
+# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.
+
+CLANG_OPTIONS          =
+
+# If clang assisted parsing is enabled you can provide the clang parser with the
+# path to the directory containing a file called compile_commands.json. This
+# file is the compilation database (see:
+# http://clang.llvm.org/docs/HowToSetupToolingForLLVM.html) containing the
+# options used when the source files were built. This is equivalent to
+# specifying the -p option to a clang tool, such as clang-check. These options
+# will then be passed to the parser. Any options specified with CLANG_OPTIONS
+# will be added as well.
+# Note: The availability of this option depends on whether or not doxygen was
+# generated with the -Duse_libclang=ON option for CMake.
+
+CLANG_DATABASE_PATH    =
+
 #---------------------------------------------------------------------------
-# configuration options related to the alphabetical class index
+# Configuration options related to the alphabetical class index
 #---------------------------------------------------------------------------
 
-# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index
-# of all compounds will be generated. Enable this if the project
-# contains a lot of classes, structs, unions or interfaces.
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all
+# compounds will be generated. Enable this if the project contains a lot of
+# classes, structs, unions or interfaces.
+# The default value is: YES.
 
 ALPHABETICAL_INDEX     = YES
 
-# If the alphabetical index is enabled (see ALPHABETICAL_INDEX) then
-# the COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns
-# in which this list will be split (can be a number in the range [1..20])
-
-COLS_IN_ALPHA_INDEX    = 5
-
-# In case all classes in a project start with a common prefix, all
-# classes will be put under the same header in the alphabetical index.
-# The IGNORE_PREFIX tag can be used to specify one or more prefixes that
-# should be ignored while generating the index headers.
+# In case all classes in a project start with a common prefix, all classes will
+# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag
+# can be used to specify a prefix (or a list of prefixes) that should be ignored
+# while generating the index headers.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
 
 IGNORE_PREFIX          =
 
 #---------------------------------------------------------------------------
-# configuration options related to the HTML output
+# Configuration options related to the HTML output
 #---------------------------------------------------------------------------
 
-# If the GENERATE_HTML tag is set to YES (the default) Doxygen will
-# generate HTML output.
+# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output
+# The default value is: YES.
 
 GENERATE_HTML          = YES
 
-# The HTML_OUTPUT tag is used to specify where the HTML docs will be put.
-# If a relative path is entered the value of OUTPUT_DIRECTORY will be
-# put in front of it. If left blank `html' will be used as the default path.
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
 
 HTML_OUTPUT            = ROSE_HTML_Reference
 
-# The HTML_FILE_EXTENSION tag can be used to specify the file extension for
-# each generated HTML page (for example: .htm,.php,.asp). If it is left blank
-# doxygen will generate files with .html extension.
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each
+# generated HTML page (for example: .htm, .php, .asp).
+# The default value is: .html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
 
 HTML_FILE_EXTENSION    = .html
 
-# The HTML_HEADER tag can be used to specify a personal HTML header for
-# each generated HTML page. If it is left blank doxygen will generate a
-# standard header. Note that when using a custom header you are responsible
-#  for the proper inclusion of any scripts and style sheets that doxygen
-# needs, which is dependent on the configuration options used.
-# It is advised to generate a default header using "doxygen -w html
-# header.html footer.html stylesheet.css YourConfigFile" and then modify
-# that header. Note that the header is subject to change so you typically
-# have to redo this when upgrading to a newer version of doxygen or when
-# changing the value of configuration settings such as GENERATE_TREEVIEW!
+# The HTML_HEADER tag can be used to specify a user-defined HTML header file for
+# each generated HTML page. If the tag is left blank doxygen will generate a
+# standard header.
+#
+# To get valid HTML the header file that includes any scripts and style sheets
+# that doxygen needs, which is dependent on the configuration options used (e.g.
+# the setting GENERATE_TREEVIEW). It is highly recommended to start with a
+# default header using
+# doxygen -w html new_header.html new_footer.html new_stylesheet.css
+# YourConfigFile
+# and then modify the file new_header.html. See also section "Doxygen usage"
+# for information on how to generate the default header that doxygen normally
+# uses.
+# Note: The header is subject to change so you typically have to regenerate the
+# default header when upgrading to a newer version of doxygen. For a description
+# of the possible markers and block names see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
 
 HTML_HEADER            =
 
-# The HTML_FOOTER tag can be used to specify a personal HTML footer for
-# each generated HTML page. If it is left blank doxygen will generate a
-# standard footer.
+# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
+# generated HTML page. If the tag is left blank doxygen will generate a standard
+# footer. See HTML_HEADER for more information on how to generate a default
+# footer and what special commands can be used inside the footer. See also
+# section "Doxygen usage" for information on how to generate the default footer
+# that doxygen normally uses.
+# This tag requires that the tag GENERATE_HTML is set to YES.
 
 HTML_FOOTER            =
 
-# The HTML_STYLESHEET tag can be used to specify a user-defined cascading
-# style sheet that is used by each HTML page. It can be used to
-# fine-tune the look of the HTML output. If the tag is left blank doxygen
-# will generate a default style sheet. Note that doxygen will try to copy
-# the style sheet file to the HTML output directory, so don't put your own
-# style sheet in the HTML output directory as well, or it will be erased!
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style
+# sheet that is used by each HTML page. It can be used to fine-tune the look of
+# the HTML output. If left blank doxygen will generate a default style sheet.
+# See also section "Doxygen usage" for information on how to generate the style
+# sheet that doxygen normally uses.
+# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as
+# it is more robust and this tag (HTML_STYLESHEET) will in the future become
+# obsolete.
+# This tag requires that the tag GENERATE_HTML is set to YES.
 
 HTML_STYLESHEET        = @top_srcdir@/docs/Rose/roseDoxygen.css
 
+# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# cascading style sheets that are included after the standard style sheets
+# created by doxygen. Using this option one can overrule certain style aspects.
+# This is preferred over using HTML_STYLESHEET since it does not replace the
+# standard style sheet and is therefore more robust against future updates.
+# Doxygen will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list). For an example see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_STYLESHEET  =
+
 # The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
 # other source files which should be copied to the HTML output directory. Note
 # that these files will be copied to the base HTML output directory. Use the
-# $relpath$ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
-# files. In the HTML_STYLESHEET file, use the file name only. Also note that
-# the files will be copied as-is; there are no commands or markers available.
+# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
+# files. In the HTML_STYLESHEET file, use the file name only. Also note that the
+# files will be copied as-is; there are no commands or markers available.
+# This tag requires that the tag GENERATE_HTML is set to YES.
 
 HTML_EXTRA_FILES       =
 
-# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output.
-# Doxygen will adjust the colors in the style sheet and background images
-# according to this color. Hue is specified as an angle on a colorwheel,
-# see http://en.wikipedia.org/wiki/Hue for more information.
-# For instance the value 0 represents red, 60 is yellow, 120 is green,
-# 180 is cyan, 240 is blue, 300 purple, and 360 is red again.
-# The allowed range is 0 to 359.
+# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
+# will adjust the colors in the style sheet and background images according to
+# this color. Hue is specified as an angle on a colorwheel, see
+# https://en.wikipedia.org/wiki/Hue for more information. For instance the value
+# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
+# purple, and 360 is red again.
+# Minimum value: 0, maximum value: 359, default value: 220.
+# This tag requires that the tag GENERATE_HTML is set to YES.
 
 HTML_COLORSTYLE_HUE    = 220
 
-# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of
-# the colors in the HTML output. For a value of 0 the output will use
-# grayscales only. A value of 255 will produce the most vivid colors.
+# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors
+# in the HTML output. For a value of 0 the output will use grayscales only. A
+# value of 255 will produce the most vivid colors.
+# Minimum value: 0, maximum value: 255, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
 
 HTML_COLORSTYLE_SAT    = 100
 
-# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to
-# the luminance component of the colors in the HTML output. Values below
-# 100 gradually make the output lighter, whereas values above 100 make
-# the output darker. The value divided by 100 is the actual gamma applied,
-# so 80 represents a gamma of 0.8, The value 220 represents a gamma of 2.2,
-# and 100 does not change the gamma.
+# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the
+# luminance component of the colors in the HTML output. Values below 100
+# gradually make the output lighter, whereas values above 100 make the output
+# darker. The value divided by 100 is the actual gamma applied, so 80 represents
+# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not
+# change the gamma.
+# Minimum value: 40, maximum value: 240, default value: 80.
+# This tag requires that the tag GENERATE_HTML is set to YES.
 
 HTML_COLORSTYLE_GAMMA  = 80
 
 # If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
-# page will contain the date and time when the page was generated. Setting
-# this to NO can help when comparing the output of multiple runs.
+# page will contain the date and time when the page was generated. Setting this
+# to YES can help to show when doxygen was last run and thus if the
+# documentation is up to date.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
 
 HTML_TIMESTAMP         = YES
 
+# If the HTML_DYNAMIC_MENUS tag is set to YES then the generated HTML
+# documentation will contain a main index with vertical navigation menus that
+# are dynamically created via JavaScript. If disabled, the navigation index will
+# consists of multiple levels of tabs that are statically embedded in every HTML
+# page. Disable this option to support browsers that do not have JavaScript,
+# like the Qt help browser.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_MENUS     = YES
+
 # If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
 # documentation will contain sections that can be hidden and shown after the
 # page has loaded.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
 
 HTML_DYNAMIC_SECTIONS  = NO
 
-# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of
-# entries shown in the various tree structured indices initially; the user
-# can expand and collapse entries dynamically later on. Doxygen will expand
-# the tree to such a level that at most the specified number of entries are
-# visible (unless a fully collapsed tree already exceeds this amount).
-# So setting the number of entries 1 will produce a full collapsed tree by
-# default. 0 is a special value representing an infinite number of entries
-# and will result in a full expanded tree by default.
+# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries
+# shown in the various tree structured indices initially; the user can expand
+# and collapse entries dynamically later on. Doxygen will expand the tree to
+# such a level that at most the specified number of entries are visible (unless
+# a fully collapsed tree already exceeds this amount). So setting the number of
+# entries 1 will produce a full collapsed tree by default. 0 is a special value
+# representing an infinite number of entries and will result in a full expanded
+# tree by default.
+# Minimum value: 0, maximum value: 9999, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
 
 HTML_INDEX_NUM_ENTRIES = 100
 
-# If the GENERATE_DOCSET tag is set to YES, additional index files
-# will be generated that can be used as input for Apple's Xcode 3
-# integrated development environment, introduced with OSX 10.5 (Leopard).
-# To create a documentation set, doxygen will generate a Makefile in the
-# HTML output directory. Running make will produce the docset in that
-# directory and running "make install" will install the docset in
-# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find
-# it at startup.
-# See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html
-# for more information.
+# If the GENERATE_DOCSET tag is set to YES, additional index files will be
+# generated that can be used as input for Apple's Xcode 3 integrated development
+# environment (see:
+# https://developer.apple.com/xcode/), introduced with OSX 10.5 (Leopard). To
+# create a documentation set, doxygen will generate a Makefile in the HTML
+# output directory. Running make will produce the docset in that directory and
+# running make install will install the docset in
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at
+# startup. See https://developer.apple.com/library/archive/featuredarticles/Doxy
+# genXcode/_index.html for more information.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
 
 GENERATE_DOCSET        = NO
 
-# When GENERATE_DOCSET tag is set to YES, this tag determines the name of the
-# feed. A documentation feed provides an umbrella under which multiple
-# documentation sets from a single provider (such as a company or product suite)
-# can be grouped.
+# This tag determines the name of the docset feed. A documentation feed provides
+# an umbrella under which multiple documentation sets from a single provider
+# (such as a company or product suite) can be grouped.
+# The default value is: Doxygen generated docs.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
 
 DOCSET_FEEDNAME        = "Doxygen generated docs"
 
-# When GENERATE_DOCSET tag is set to YES, this tag specifies a string that
-# should uniquely identify the documentation set bundle. This should be a
-# reverse domain-name style string, e.g. com.mycompany.MyDocSet. Doxygen
-# will append .docset to the name.
+# This tag specifies a string that should uniquely identify the documentation
+# set bundle. This should be a reverse domain-name style string, e.g.
+# com.mycompany.MyDocSet. Doxygen will append .docset to the name.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
 
 DOCSET_BUNDLE_ID       = org.doxygen.Project
 
-# When GENERATE_PUBLISHER_ID tag specifies a string that should uniquely identify
+# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify
 # the documentation publisher. This should be a reverse domain-name style
 # string, e.g. com.mycompany.MyDocSet.documentation.
+# The default value is: org.doxygen.Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
 
 DOCSET_PUBLISHER_ID    = org.doxygen.Publisher
 
-# The GENERATE_PUBLISHER_NAME tag identifies the documentation publisher.
+# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.
+# The default value is: Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
 
 DOCSET_PUBLISHER_NAME  = Publisher
 
-# If the GENERATE_HTMLHELP tag is set to YES, additional index files
-# will be generated that can be used as input for tools like the
-# Microsoft HTML help workshop to generate a compiled HTML help file (.chm)
-# of the generated HTML documentation.
+# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three
+# additional HTML index files: index.hhp, index.hhc, and index.hhk. The
+# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
+# (see:
+# https://www.microsoft.com/en-us/download/details.aspx?id=21138) on Windows.
+#
+# The HTML Help Workshop contains a compiler that can convert all HTML output
+# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML
+# files are now used as the Windows 98 help format, and will replace the old
+# Windows help format (.hlp) on all Windows platforms in the future. Compressed
+# HTML files also contain an index, a table of contents, and you can search for
+# words in the documentation. The HTML workshop also contains a viewer for
+# compressed HTML files.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
 
 GENERATE_HTMLHELP      = NO
 
-# If the GENERATE_HTMLHELP tag is set to YES, the CHM_FILE tag can
-# be used to specify the file name of the resulting .chm file. You
-# can add a path in front of the file if the result should not be
+# The CHM_FILE tag can be used to specify the file name of the resulting .chm
+# file. You can add a path in front of the file if the result should not be
 # written to the html output directory.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
 
 CHM_FILE               =
 
-# If the GENERATE_HTMLHELP tag is set to YES, the HHC_LOCATION tag can
-# be used to specify the location (absolute path including file name) of
-# the HTML help compiler (hhc.exe). If non-empty doxygen will try to run
-# the HTML help compiler on the generated index.hhp.
+# The HHC_LOCATION tag can be used to specify the location (absolute path
+# including file name) of the HTML help compiler (hhc.exe). If non-empty,
+# doxygen will try to run the HTML help compiler on the generated index.hhp.
+# The file has to be specified with full path.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
 
 HHC_LOCATION           =
 
-# If the GENERATE_HTMLHELP tag is set to YES, the GENERATE_CHI flag
-# controls if a separate .chi index file is generated (YES) or that
-# it should be included in the master .chm file (NO).
+# The GENERATE_CHI flag controls if a separate .chi index file is generated
+# (YES) or that it should be included in the main .chm file (NO).
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
 
 GENERATE_CHI           = NO
 
-# If the GENERATE_HTMLHELP tag is set to YES, the CHM_INDEX_ENCODING
-# is used to encode HtmlHelp index (hhk), content (hhc) and project file
-# content.
+# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)
+# and project file content.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
 
 CHM_INDEX_ENCODING     =
 
-# If the GENERATE_HTMLHELP tag is set to YES, the BINARY_TOC flag
-# controls whether a binary table of contents is generated (YES) or a
-# normal table of contents (NO) in the .chm file.
+# The BINARY_TOC flag controls whether a binary table of contents is generated
+# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it
+# enables the Previous and Next buttons.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
 
 BINARY_TOC             = NO
 
-# The TOC_EXPAND flag can be set to YES to add extra items for group members
-# to the contents of the HTML help documentation and to the tree view.
+# The TOC_EXPAND flag can be set to YES to add extra items for group members to
+# the table of contents of the HTML help documentation and to the tree view.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
 
 TOC_EXPAND             = NO
 
 # If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
-# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated
-# that can be used as input for Qt's qhelpgenerator to generate a
-# Qt Compressed Help (.qch) of the generated HTML documentation.
+# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that
+# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help
+# (.qch) of the generated HTML documentation.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
 
 GENERATE_QHP           = NO
 
-# If the QHG_LOCATION tag is specified, the QCH_FILE tag can
-# be used to specify the file name of the resulting .qch file.
-# The path specified is relative to the HTML output folder.
+# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify
+# the file name of the resulting .qch file. The path specified is relative to
+# the HTML output folder.
+# This tag requires that the tag GENERATE_QHP is set to YES.
 
 QCH_FILE               =
 
-# The QHP_NAMESPACE tag specifies the namespace to use when generating
-# Qt Help Project output. For more information please see
-# http://doc.trolltech.com/qthelpproject.html#namespace
+# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
+# Project output. For more information please see Qt Help Project / Namespace
+# (see:
+# https://doc.qt.io/archives/qt-4.8/qthelpproject.html#namespace).
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_QHP is set to YES.
 
 QHP_NAMESPACE          = org.doxygen.Project
 
-# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating
-# Qt Help Project output. For more information please see
-# http://doc.trolltech.com/qthelpproject.html#virtual-folders
+# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
+# Help Project output. For more information please see Qt Help Project / Virtual
+# Folders (see:
+# https://doc.qt.io/archives/qt-4.8/qthelpproject.html#virtual-folders).
+# The default value is: doc.
+# This tag requires that the tag GENERATE_QHP is set to YES.
 
 QHP_VIRTUAL_FOLDER     = doc
 
-# If QHP_CUST_FILTER_NAME is set, it specifies the name of a custom filter to
-# add. For more information please see
-# http://doc.trolltech.com/qthelpproject.html#custom-filters
+# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
+# filter to add. For more information please see Qt Help Project / Custom
+# Filters (see:
+# https://doc.qt.io/archives/qt-4.8/qthelpproject.html#custom-filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
 
 QHP_CUST_FILTER_NAME   =
 
-# The QHP_CUST_FILT_ATTRS tag specifies the list of the attributes of the
-# custom filter to add. For more information please see
-# <a href="http://doc.trolltech.com/qthelpproject.html#custom-filters">
-# Qt Help Project / Custom Filters</a>.
+# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
+# custom filter to add. For more information please see Qt Help Project / Custom
+# Filters (see:
+# https://doc.qt.io/archives/qt-4.8/qthelpproject.html#custom-filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
 
 QHP_CUST_FILTER_ATTRS  =
 
 # The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
-# project's
-# filter section matches.
-# <a href="http://doc.trolltech.com/qthelpproject.html#filter-attributes">
-# Qt Help Project / Filter Attributes</a>.
+# project's filter section matches. Qt Help Project / Filter Attributes (see:
+# https://doc.qt.io/archives/qt-4.8/qthelpproject.html#filter-attributes).
+# This tag requires that the tag GENERATE_QHP is set to YES.
 
 QHP_SECT_FILTER_ATTRS  =
 
-# If the GENERATE_QHP tag is set to YES, the QHG_LOCATION tag can
-# be used to specify the location of Qt's qhelpgenerator.
-# If non-empty doxygen will try to run qhelpgenerator on the generated
-# .qhp file.
+# The QHG_LOCATION tag can be used to specify the location (absolute path
+# including file name) of Qt's qhelpgenerator. If non-empty doxygen will try to
+# run qhelpgenerator on the generated .qhp file.
+# This tag requires that the tag GENERATE_QHP is set to YES.
 
 QHG_LOCATION           =
 
-# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files
-#  will be generated, which together with the HTML files, form an Eclipse help
-# plugin. To install this plugin and make it available under the help contents
-# menu in Eclipse, the contents of the directory containing the HTML and XML
-# files needs to be copied into the plugins directory of eclipse. The name of
-# the directory within the plugins directory should be the same as
-# the ECLIPSE_DOC_ID value. After copying Eclipse needs to be restarted before
-# the help appears.
+# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be
+# generated, together with the HTML files, they form an Eclipse help plugin. To
+# install this plugin and make it available under the help contents menu in
+# Eclipse, the contents of the directory containing the HTML and XML files needs
+# to be copied into the plugins directory of eclipse. The name of the directory
+# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.
+# After copying Eclipse needs to be restarted before the help appears.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
 
 GENERATE_ECLIPSEHELP   = NO
 
-# A unique identifier for the eclipse help plugin. When installing the plugin
-# the directory name containing the HTML and XML files should also have
-# this name.
+# A unique identifier for the Eclipse help plugin. When installing the plugin
+# the directory name containing the HTML and XML files should also have this
+# name. Each documentation set should have its own identifier.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.
 
 ECLIPSE_DOC_ID         = org.doxygen.Project
 
-# The DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs)
-# at top of each HTML page. The value NO (the default) enables the index and
-# the value YES disables it. Since the tabs have the same information as the
-# navigation tree you can set this option to NO if you already set
-# GENERATE_TREEVIEW to YES.
+# If you want full control over the layout of the generated HTML pages it might
+# be necessary to disable the index and replace it with your own. The
+# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top
+# of each HTML page. A value of NO enables the index and the value YES disables
+# it. Since the tabs in the index contain the same information as the navigation
+# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
 
 DISABLE_INDEX          = NO
 
 # The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
-# structure should be generated to display hierarchical information.
-# If the tag value is set to YES, a side panel will be generated
-# containing a tree-like index structure (just like the one that
-# is generated for HTML Help). For this to work a browser that supports
-# JavaScript, DHTML, CSS and frames is required (i.e. any modern browser).
-# Windows users are probably better off using the HTML help feature.
-# Since the tree basically has the same information as the tab index you
-# could consider to set DISABLE_INDEX to NO when enabling this option.
+# structure should be generated to display hierarchical information. If the tag
+# value is set to YES, a side panel will be generated containing a tree-like
+# index structure (just like the one that is generated for HTML Help). For this
+# to work a browser that supports JavaScript, DHTML, CSS and frames is required
+# (i.e. any modern browser). Windows users are probably better off using the
+# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can
+# further fine-tune the look of the index. As an example, the default style
+# sheet generated by doxygen has an example that shows how to put an image at
+# the root of the tree instead of the PROJECT_NAME. Since the tree basically has
+# the same information as the tab index, you could consider setting
+# DISABLE_INDEX to YES when enabling this option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
 
 GENERATE_TREEVIEW      = NO
 
-# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values
-# (range [0,1..20]) that doxygen will group on one line in the generated HTML
-# documentation. Note that a value of 0 will completely suppress the enum
-# values from appearing in the overview section.
+# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that
+# doxygen will group on one line in the generated HTML documentation.
+#
+# Note that a value of 0 will completely suppress the enum values from appearing
+# in the overview section.
+# Minimum value: 0, maximum value: 20, default value: 4.
+# This tag requires that the tag GENERATE_HTML is set to YES.
 
 ENUM_VALUES_PER_LINE   = 1
 
-# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be
-# used to set the initial width (in pixels) of the frame in which the tree
-# is shown.
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used
+# to set the initial width (in pixels) of the frame in which the tree is shown.
+# Minimum value: 0, maximum value: 1500, default value: 250.
+# This tag requires that the tag GENERATE_HTML is set to YES.
 
 TREEVIEW_WIDTH         = 250
 
-# When the EXT_LINKS_IN_WINDOW option is set to YES doxygen will open
-# links to external symbols imported via tag files in a separate window.
+# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to
+# external symbols imported via tag files in a separate window.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
 
 EXT_LINKS_IN_WINDOW    = NO
 
-# Use this tag to change the font size of Latex formulas included
-# as images in the HTML documentation. The default is 10. Note that
-# when you change the font size after a successful doxygen run you need
-# to manually remove any form_*.png images from the HTML output directory
-# to force them to be regenerated.
+# If the HTML_FORMULA_FORMAT option is set to svg, doxygen will use the pdf2svg
+# tool (see https://github.com/dawbarton/pdf2svg) or inkscape (see
+# https://inkscape.org) to generate formulas as SVG images instead of PNGs for
+# the HTML output. These images will generally look nicer at scaled resolutions.
+# Possible values are: png (the default) and svg (looks nicer but requires the
+# pdf2svg or inkscape tool).
+# The default value is: png.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FORMULA_FORMAT    = png
+
+# Use this tag to change the font size of LaTeX formulas included as images in
+# the HTML documentation. When you change the font size after a successful
+# doxygen run you need to manually remove any form_*.png images from the HTML
+# output directory to force them to be regenerated.
+# Minimum value: 8, maximum value: 50, default value: 10.
+# This tag requires that the tag GENERATE_HTML is set to YES.
 
 FORMULA_FONTSIZE       = 10
 
-# Use the FORMULA_TRANPARENT tag to determine whether or not the images
-# generated for formulas are transparent PNGs. Transparent PNGs are
-# not supported properly for IE 6.0, but are supported on all modern browsers.
-# Note that when changing this option you need to delete any form_*.png files
-# in the HTML output before the changes have effect.
+# Use the FORMULA_TRANSPARENT tag to determine whether or not the images
+# generated for formulas are transparent PNGs. Transparent PNGs are not
+# supported properly for IE 6.0, but are supported on all modern browsers.
+#
+# Note that when changing this option you need to delete any form_*.png files in
+# the HTML output directory before the changes have effect.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
 
 FORMULA_TRANSPARENT    = YES
 
-# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax
-# (see http://www.mathjax.org) which uses client side Javascript for the
-# rendering instead of using prerendered bitmaps. Use this if you do not
-# have LaTeX installed or if you want to formulas look prettier in the HTML
-# output. When enabled you may also need to install MathJax separately and
-# configure the path to it using the MATHJAX_RELPATH option.
+# The FORMULA_MACROFILE can contain LaTeX \newcommand and \renewcommand commands
+# to create new LaTeX commands to be used in formulas as building blocks. See
+# the section "Including formulas" for details.
+
+FORMULA_MACROFILE      =
+
+# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
+# https://www.mathjax.org) which uses client side JavaScript for the rendering
+# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX
+# installed or if you want to formulas look prettier in the HTML output. When
+# enabled you may also need to install MathJax separately and configure the path
+# to it using the MATHJAX_RELPATH option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
 
 USE_MATHJAX            = NO
 
-# When MathJax is enabled you need to specify the location relative to the
-# HTML output directory using the MATHJAX_RELPATH option. The destination
-# directory should contain the MathJax.js script. For instance, if the mathjax
-# directory is located at the same level as the HTML output directory, then
-# MATHJAX_RELPATH should be ../mathjax. The default value points to
-# the MathJax Content Delivery Network so you can quickly see the result without
-# installing MathJax.
-# However, it is strongly recommended to install a local
-# copy of MathJax from http://www.mathjax.org before deployment.
+# When MathJax is enabled you can set the default output format to be used for
+# the MathJax output. See the MathJax site (see:
+# http://docs.mathjax.org/en/v2.7-latest/output.html) for more details.
+# Possible values are: HTML-CSS (which is slower, but has the best
+# compatibility), NativeMML (i.e. MathML) and SVG.
+# The default value is: HTML-CSS.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_FORMAT         = HTML-CSS
+
+# When MathJax is enabled you need to specify the location relative to the HTML
+# output directory using the MATHJAX_RELPATH option. The destination directory
+# should contain the MathJax.js script. For instance, if the mathjax directory
+# is located at the same level as the HTML output directory, then
+# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
+# Content Delivery Network so you can quickly see the result without installing
+# MathJax. However, it is strongly recommended to install a local copy of
+# MathJax from https://www.mathjax.org before deployment.
+# The default value is: https://cdn.jsdelivr.net/npm/mathjax@2.
+# This tag requires that the tag USE_MATHJAX is set to YES.
 
 MATHJAX_RELPATH        = http://cdn.mathjax.org/mathjax/latest
 
-# The MATHJAX_EXTENSIONS tag can be used to specify one or MathJax extension
-# names that should be enabled during MathJax rendering.
+# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax
+# extension names that should be enabled during MathJax rendering. For example
+# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
+# This tag requires that the tag USE_MATHJAX is set to YES.
 
 MATHJAX_EXTENSIONS     =
 
-# When the SEARCHENGINE tag is enabled doxygen will generate a search box
-# for the HTML output. The underlying search engine uses javascript
-# and DHTML and should work on any modern browser. Note that when using
-# HTML help (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets
-# (GENERATE_DOCSET) there is already a search function so this one should
-# typically be disabled. For large projects the javascript based search engine
-# can be slow, then enabling SERVER_BASED_SEARCH may provide a better solution.
+# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
+# of code that will be used on startup of the MathJax code. See the MathJax site
+# (see:
+# http://docs.mathjax.org/en/v2.7-latest/output.html) for more details. For an
+# example see the documentation.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_CODEFILE       =
+
+# When the SEARCHENGINE tag is enabled doxygen will generate a search box for
+# the HTML output. The underlying search engine uses javascript and DHTML and
+# should work on any modern browser. Note that when using HTML help
+# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)
+# there is already a search function so this one should typically be disabled.
+# For large projects the javascript based search engine can be slow, then
+# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to
+# search using the keyboard; to jump to the search box use <access key> + S
+# (what the <access key> is depends on the OS and browser, but it is typically
+# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down
+# key> to jump into the search results window, the results can be navigated
+# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel
+# the search. The filter options can be selected when the cursor is inside the
+# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>
+# to select a filter and <Enter> or <escape> to activate or cancel the filter
+# option.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
 
 SEARCHENGINE           = YES
 
 # When the SERVER_BASED_SEARCH tag is enabled the search engine will be
-# implemented using a PHP enabled web server instead of at the web client
-# using Javascript. Doxygen will generate the search PHP script and index
-# file to put on the web server. The advantage of the server
-# based approach is that it scales better to large projects and allows
-# full text search. The disadvantages are that it is more difficult to setup
-# and does not have live searching capabilities.
+# implemented using a web server instead of a web client using JavaScript. There
+# are two flavors of web server based searching depending on the EXTERNAL_SEARCH
+# setting. When disabled, doxygen will generate a PHP script for searching and
+# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing
+# and searching needs to be provided by external tools. See the section
+# "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
 
 SERVER_BASED_SEARCH    = YES
 
-# The following needs doxygen 1.8.3 or later. [Matzke 2015-09-14]
-EXTERNAL_SEARCH = YES
-SEARCHENGINE_URL = http://rosecompiler.org/cgi-bin/doxysearch.cgi
+# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP
+# script for searching. Instead the search results are written to an XML file
+# which needs to be processed by an external indexer. Doxygen will invoke an
+# external search engine pointed to by the SEARCHENGINE_URL option to obtain the
+# search results.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see:
+# https://xapian.org/).
+#
+# See the section "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH        = YES
+
+# The SEARCHENGINE_URL should point to a search engine hosted by a web server
+# which will return the search results when EXTERNAL_SEARCH is enabled.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see:
+# https://xapian.org/). See the section "External Indexing and Searching" for
+# details.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHENGINE_URL       = http://rosecompiler.org/cgi-bin/doxysearch.cgi
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed
+# search data is written to a file for indexing by an external tool. With the
+# SEARCHDATA_FILE tag the name of this file can be specified.
+# The default file is: searchdata.xml.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHDATA_FILE        = searchdata.xml
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the
+# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is
+# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple
+# projects and redirect the results back to the right project.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH_ID     =
+
+# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen
+# projects other than the one defined by this configuration file, but that are
+# all added to the same external search index. Each project needs to have a
+# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of
+# to a relative location where the documentation can be found. The format is:
+# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTRA_SEARCH_MAPPINGS  =
 
 #---------------------------------------------------------------------------
-# configuration options related to the LaTeX output
+# Configuration options related to the LaTeX output
 #---------------------------------------------------------------------------
 
-# If the GENERATE_LATEX tag is set to YES (the default) Doxygen will
-# generate Latex output.
+# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output.
+# The default value is: YES.
 
 GENERATE_LATEX         = YES
 
-# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put.
-# If a relative path is entered the value of OUTPUT_DIRECTORY will be
-# put in front of it. If left blank `latex' will be used as the default path.
+# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
 
 LATEX_OUTPUT           = ROSE_LaTeX_Reference
 
 # The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
-# invoked. If left blank `latex' will be used as the default command name.
-# Note that when enabling USE_PDFLATEX this option is only used for
-# generating bitmaps for formulas in the HTML output, but not in the
-# Makefile that is written to the output directory.
+# invoked.
+#
+# Note that when not enabling USE_PDFLATEX the default is latex when enabling
+# USE_PDFLATEX the default is pdflatex and when in the later case latex is
+# chosen this is overwritten by pdflatex. For specific output languages the
+# default can have been set differently, this depends on the implementation of
+# the output language.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
 
 LATEX_CMD_NAME         = latex
 
-# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to
-# generate index for LaTeX. If left blank `makeindex' will be used as the
-# default command name.
+# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate
+# index for LaTeX.
+# Note: This tag is used in the Makefile / make.bat.
+# See also: LATEX_MAKEINDEX_CMD for the part in the generated output file
+# (.tex).
+# The default file is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
 
 MAKEINDEX_CMD_NAME     = makeindex
 
-# If the COMPACT_LATEX tag is set to YES Doxygen generates more compact
-# LaTeX documents. This may be useful for small projects and may help to
-# save some trees in general.
+# The LATEX_MAKEINDEX_CMD tag can be used to specify the command name to
+# generate index for LaTeX. In case there is no backslash (\) as first character
+# it will be automatically added in the LaTeX code.
+# Note: This tag is used in the generated output file (.tex).
+# See also: MAKEINDEX_CMD_NAME for the part in the Makefile / make.bat.
+# The default value is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
 
-COMPACT_LATEX          = NO
+LATEX_MAKEINDEX_CMD    = makeindex
 
-# The PAPER_TYPE tag can be used to set the paper type that is used
-# by the printer. Possible values are: a4, letter, legal and
-# executive. If left blank a4wide will be used.
+# If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
 
-PAPER_TYPE             = a4wide
+COMPACT_LATEX          = NO
 
-# The EXTRA_PACKAGES tag can be to specify one or more names of LaTeX
-# packages that should be included in the LaTeX output.
+# The PAPER_TYPE tag can be used to set the paper type that is used by the
+# printer.
+# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x
+# 14 inches) and executive (7.25 x 10.5 inches).
+# The default value is: a4.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PAPER_TYPE             = a4
+
+# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names
+# that should be included in the LaTeX output. The package can be specified just
+# by its name or with the correct syntax as to be used with the LaTeX
+# \usepackage command. To get the times font for instance you can specify :
+# EXTRA_PACKAGES=times or EXTRA_PACKAGES={times}
+# To use the option intlimits with the amsmath package you can specify:
+# EXTRA_PACKAGES=[intlimits]{amsmath}
+# If left blank no extra packages will be included.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
 
 EXTRA_PACKAGES         =
 
-# The LATEX_HEADER tag can be used to specify a personal LaTeX header for
-# the generated latex document. The header should contain everything until
-# the first chapter. If it is left blank doxygen will generate a
-# standard header. Notice: only use this tag if you know what you are doing!
+# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the
+# generated LaTeX document. The header should contain everything until the first
+# chapter. If it is left blank doxygen will generate a standard header. See
+# section "Doxygen usage" for information on how to let doxygen write the
+# default header to a separate file.
+#
+# Note: Only use a user-defined header if you know what you are doing! The
+# following commands have a special meaning inside the header: $title,
+# $datetime, $date, $doxygenversion, $projectname, $projectnumber,
+# $projectbrief, $projectlogo. Doxygen will replace $title with the empty
+# string, for the replacement values of the other commands the user is referred
+# to HTML_HEADER.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
 
 LATEX_HEADER           =
 
-# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for
-# the generated latex document. The footer should contain everything after
-# the last chapter. If it is left blank doxygen will generate a
-# standard footer. Notice: only use this tag if you know what you are doing!
+# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the
+# generated LaTeX document. The footer should contain everything after the last
+# chapter. If it is left blank doxygen will generate a standard footer. See
+# LATEX_HEADER for more information on how to generate a default footer and what
+# special commands can be used inside the footer.
+#
+# Note: Only use a user-defined footer if you know what you are doing!
+# This tag requires that the tag GENERATE_LATEX is set to YES.
 
 LATEX_FOOTER           =
 
-# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated
-# is prepared for conversion to pdf (using ps2pdf). The pdf file will
-# contain links (just like the HTML output) instead of page references
-# This makes the output suitable for online browsing using a pdf viewer.
+# The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# LaTeX style sheets that are included after the standard style sheets created
+# by doxygen. Using this option one can overrule certain style aspects. Doxygen
+# will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list).
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_STYLESHEET =
+
+# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the LATEX_OUTPUT output
+# directory. Note that the files will be copied as-is; there are no commands or
+# markers available.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_FILES      =
+
+# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is
+# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will
+# contain links (just like the HTML output) instead of page references. This
+# makes the output suitable for online browsing using a PDF viewer.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
 
 PDF_HYPERLINKS         = NO
 
-# If the USE_PDFLATEX tag is set to YES, pdflatex will be used instead of
-# plain latex in the generated Makefile. Set this option to YES to get a
-# higher quality PDF documentation.
+# If the USE_PDFLATEX tag is set to YES, doxygen will use the engine as
+# specified with LATEX_CMD_NAME to generate the PDF file directly from the LaTeX
+# files. Set this option to YES, to get a higher quality PDF documentation.
+#
+# See also section LATEX_CMD_NAME for selecting the engine.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
 
 USE_PDFLATEX           = NO
 
-# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \\batchmode.
-# command to the generated LaTeX files. This will instruct LaTeX to keep
-# running if errors occur, instead of asking the user for help.
-# This option is also used when generating formulas in HTML.
+# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \batchmode
+# command to the generated LaTeX files. This will instruct LaTeX to keep running
+# if errors occur, instead of asking the user for help. This option is also used
+# when generating formulas in HTML.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
 
 LATEX_BATCHMODE        = NO
 
-# If LATEX_HIDE_INDICES is set to YES then doxygen will not
-# include the index chapters (such as File Index, Compound Index, etc.)
-# in the output.
+# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the
+# index chapters (such as File Index, Compound Index, etc.) in the output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
 
 LATEX_HIDE_INDICES     = NO
 
-# If LATEX_SOURCE_CODE is set to YES then doxygen will include
-# source code with syntax highlighting in the LaTeX output.
-# Note that which sources are shown also depends on other settings
-# such as SOURCE_BROWSER.
+# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source
+# code with syntax highlighting in the LaTeX output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
 
 LATEX_SOURCE_CODE      = NO
 
 # The LATEX_BIB_STYLE tag can be used to specify the style to use for the
-# bibliography, e.g. plainnat, or ieeetr. The default style is "plain". See
-# http://en.wikipedia.org/wiki/BibTeX for more info.
+# bibliography, e.g. plainnat, or ieeetr. See
+# https://en.wikipedia.org/wiki/BibTeX and \cite for more info.
+# The default value is: plain.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
 
 LATEX_BIB_STYLE        = plain
 
+# If the LATEX_TIMESTAMP tag is set to YES then the footer of each generated
+# page will contain the date and time when the page was generated. Setting this
+# to NO can help when comparing the output of multiple runs.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_TIMESTAMP        = NO
+
+# The LATEX_EMOJI_DIRECTORY tag is used to specify the (relative or absolute)
+# path from which the emoji images will be read. If a relative path is entered,
+# it will be relative to the LATEX_OUTPUT directory. If left blank the
+# LATEX_OUTPUT directory will be used.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EMOJI_DIRECTORY  =
+
 #---------------------------------------------------------------------------
-# configuration options related to the RTF output
+# Configuration options related to the RTF output
 #---------------------------------------------------------------------------
 
-# If the GENERATE_RTF tag is set to YES Doxygen will generate RTF output
-# The RTF output is optimized for Word 97 and may not look very pretty with
-# other RTF readers or editors.
+# If the GENERATE_RTF tag is set to YES, doxygen will generate RTF output. The
+# RTF output is optimized for Word 97 and may not look too pretty with other RTF
+# readers/editors.
+# The default value is: NO.
 
 GENERATE_RTF           = NO
 
-# The RTF_OUTPUT tag is used to specify where the RTF docs will be put.
-# If a relative path is entered the value of OUTPUT_DIRECTORY will be
-# put in front of it. If left blank `rtf' will be used as the default path.
+# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: rtf.
+# This tag requires that the tag GENERATE_RTF is set to YES.
 
 RTF_OUTPUT             = rtf
 
-# If the COMPACT_RTF tag is set to YES Doxygen generates more compact
-# RTF documents. This may be useful for small projects and may help to
-# save some trees in general.
+# If the COMPACT_RTF tag is set to YES, doxygen generates more compact RTF
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
 
 COMPACT_RTF            = NO
 
-# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated
-# will contain hyperlink fields. The RTF file will
-# contain links (just like the HTML output) instead of page references.
-# This makes the output suitable for online browsing using WORD or other
-# programs which support those fields.
-# Note: wordpad (write) and others do not support links.
+# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will
+# contain hyperlink fields. The RTF file will contain links (just like the HTML
+# output) instead of page references. This makes the output suitable for online
+# browsing using Word or some other Word compatible readers that support those
+# fields.
+#
+# Note: WordPad (write) and others do not support links.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
 
 RTF_HYPERLINKS         = NO
 
-# Load style sheet definitions from file. Syntax is similar to doxygen's
-# config file, i.e. a series of assignments. You only have to provide
+# Load stylesheet definitions from file. Syntax is similar to doxygen's
+# configuration file, i.e. a series of assignments. You only have to provide
 # replacements, missing definitions are set to their default value.
+#
+# See also section "Doxygen usage" for information on how to generate the
+# default style sheet that doxygen normally uses.
+# This tag requires that the tag GENERATE_RTF is set to YES.
 
 RTF_STYLESHEET_FILE    =
 
-# Set optional variables used in the generation of an rtf document.
-# Syntax is similar to doxygen's config file.
+# Set optional variables used in the generation of an RTF document. Syntax is
+# similar to doxygen's configuration file. A template extensions file can be
+# generated using doxygen -e rtf extensionFile.
+# This tag requires that the tag GENERATE_RTF is set to YES.
 
 RTF_EXTENSIONS_FILE    =
 
+# If the RTF_SOURCE_CODE tag is set to YES then doxygen will include source code
+# with syntax highlighting in the RTF output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_SOURCE_CODE        = NO
+
 #---------------------------------------------------------------------------
-# configuration options related to the man page output
+# Configuration options related to the man page output
 #---------------------------------------------------------------------------
 
-# If the GENERATE_MAN tag is set to YES (the default) Doxygen will
-# generate man pages
+# If the GENERATE_MAN tag is set to YES, doxygen will generate man pages for
+# classes and files.
+# The default value is: NO.
 
 GENERATE_MAN           = NO
 
-# The MAN_OUTPUT tag is used to specify where the man pages will be put.
-# If a relative path is entered the value of OUTPUT_DIRECTORY will be
-# put in front of it. If left blank `man' will be used as the default path.
+# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it. A directory man3 will be created inside the directory specified by
+# MAN_OUTPUT.
+# The default directory is: man.
+# This tag requires that the tag GENERATE_MAN is set to YES.
 
 MAN_OUTPUT             = man
 
-# The MAN_EXTENSION tag determines the extension that is added to
-# the generated man pages (default is the subroutine's section .3)
+# The MAN_EXTENSION tag determines the extension that is added to the generated
+# man pages. In case the manual section does not start with a number, the number
+# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is
+# optional.
+# The default value is: .3.
+# This tag requires that the tag GENERATE_MAN is set to YES.
 
 MAN_EXTENSION          = .3
 
-# If the MAN_LINKS tag is set to YES and Doxygen generates man output,
-# then it will generate one additional man file for each entity
-# documented in the real man page(s). These additional files
-# only source the real man page, but without them the man command
-# would be unable to find the correct page. The default is NO.
+# The MAN_SUBDIR tag determines the name of the directory created within
+# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by
+# MAN_EXTENSION with the initial . removed.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_SUBDIR             =
+
+# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it
+# will generate one additional man file for each entity documented in the real
+# man page(s). These additional files only source the real man page, but without
+# them the man command would be unable to find the correct page.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_MAN is set to YES.
 
 MAN_LINKS              = NO
 
 #---------------------------------------------------------------------------
-# configuration options related to the XML output
+# Configuration options related to the XML output
 #---------------------------------------------------------------------------
 
-# If the GENERATE_XML tag is set to YES Doxygen will
-# generate an XML file that captures the structure of
-# the code including all documentation.
+# If the GENERATE_XML tag is set to YES, doxygen will generate an XML file that
+# captures the structure of the code including all documentation.
+# The default value is: NO.
 
-GENERATE_XML           = NO
+GENERATE_XML           = YES
 
-# The XML_OUTPUT tag is used to specify where the XML pages will be put.
-# If a relative path is entered the value of OUTPUT_DIRECTORY will be
-# put in front of it. If left blank `xml' will be used as the default path.
+# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: xml.
+# This tag requires that the tag GENERATE_XML is set to YES.
 
 XML_OUTPUT             = xml
 
-# The XML_SCHEMA tag can be used to specify an XML schema,
-# which can be used by a validating XML parser to check the
-# syntax of the XML files.
+# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program
+# listings (including syntax highlighting and cross-referencing information) to
+# the XML output. Note that enabling this will significantly increase the size
+# of the XML output.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_XML is set to YES.
 
-XML_SCHEMA             =
+XML_PROGRAMLISTING     = YES
 
-# The XML_DTD tag can be used to specify an XML DTD,
-# which can be used by a validating XML parser to check the
-# syntax of the XML files.
+# If the XML_NS_MEMB_FILE_SCOPE tag is set to YES, doxygen will include
+# namespace members in file scope as well, matching the HTML output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_XML is set to YES.
 
-XML_DTD                =
+XML_NS_MEMB_FILE_SCOPE = NO
 
-# If the XML_PROGRAMLISTING tag is set to YES Doxygen will
-# dump the program listings (including syntax highlighting
-# and cross-referencing information) to the XML output. Note that
-# enabling this will significantly increase the size of the XML output.
+#---------------------------------------------------------------------------
+# Configuration options related to the DOCBOOK output
+#---------------------------------------------------------------------------
 
-XML_PROGRAMLISTING     = YES
+# If the GENERATE_DOCBOOK tag is set to YES, doxygen will generate Docbook files
+# that can be used to generate PDF.
+# The default value is: NO.
+
+GENERATE_DOCBOOK       = NO
+
+# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in
+# front of it.
+# The default directory is: docbook.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_OUTPUT         = docbook
+
+# If the DOCBOOK_PROGRAMLISTING tag is set to YES, doxygen will include the
+# program listings (including syntax highlighting and cross-referencing
+# information) to the DOCBOOK output. Note that enabling this will significantly
+# increase the size of the DOCBOOK output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_PROGRAMLISTING = NO
 
 #---------------------------------------------------------------------------
-# configuration options for the AutoGen Definitions output
+# Configuration options for the AutoGen Definitions output
 #---------------------------------------------------------------------------
 
-# If the GENERATE_AUTOGEN_DEF tag is set to YES Doxygen will
-# generate an AutoGen Definitions (see autogen.sf.net) file
-# that captures the structure of the code including all
-# documentation. Note that this feature is still experimental
-# and incomplete at the moment.
+# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
+# AutoGen Definitions (see http://autogen.sourceforge.net/) file that captures
+# the structure of the code including all documentation. Note that this feature
+# is still experimental and incomplete at the moment.
+# The default value is: NO.
 
 GENERATE_AUTOGEN_DEF   = NO
 
 #---------------------------------------------------------------------------
-# configuration options related to the Perl module output
+# Configuration options related to the Perl module output
 #---------------------------------------------------------------------------
 
-# If the GENERATE_PERLMOD tag is set to YES Doxygen will
-# generate a Perl module file that captures the structure of
-# the code including all documentation. Note that this
-# feature is still experimental and incomplete at the
-# moment.
+# If the GENERATE_PERLMOD tag is set to YES, doxygen will generate a Perl module
+# file that captures the structure of the code including all documentation.
+#
+# Note that this feature is still experimental and incomplete at the moment.
+# The default value is: NO.
 
 GENERATE_PERLMOD       = NO
 
-# If the PERLMOD_LATEX tag is set to YES Doxygen will generate
-# the necessary Makefile rules, Perl scripts and LaTeX code to be able
-# to generate PDF and DVI output from the Perl module output.
+# If the PERLMOD_LATEX tag is set to YES, doxygen will generate the necessary
+# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI
+# output from the Perl module output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
 
 PERLMOD_LATEX          = NO
 
-# If the PERLMOD_PRETTY tag is set to YES the Perl module output will be
-# nicely formatted so it can be parsed by a human reader.
-# This is useful
-# if you want to understand what is going on.
-# On the other hand, if this
-# tag is set to NO the size of the Perl module output will be much smaller
-# and Perl will parse it just the same.
+# If the PERLMOD_PRETTY tag is set to YES, the Perl module output will be nicely
+# formatted so it can be parsed by a human reader. This is useful if you want to
+# understand what is going on. On the other hand, if this tag is set to NO, the
+# size of the Perl module output will be much smaller and Perl will parse it
+# just the same.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
 
 PERLMOD_PRETTY         = YES
 
-# The names of the make variables in the generated doxyrules.make file
-# are prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX.
-# This is useful so different doxyrules.make files included by the same
-# Makefile don't overwrite each other's variables.
+# The names of the make variables in the generated doxyrules.make file are
+# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful
+# so different doxyrules.make files included by the same Makefile don't
+# overwrite each other's variables.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
 
 PERLMOD_MAKEVAR_PREFIX =
 
@@ -1557,347 +2218,469 @@ PERLMOD_MAKEVAR_PREFIX =
 # Configuration options related to the preprocessor
 #---------------------------------------------------------------------------
 
-# If the ENABLE_PREPROCESSING tag is set to YES (the default) Doxygen will
-# evaluate all C-preprocessor directives found in the sources and include
-# files.
+# If the ENABLE_PREPROCESSING tag is set to YES, doxygen will evaluate all
+# C-preprocessor directives found in the sources and include files.
+# The default value is: YES.
 
 ENABLE_PREPROCESSING   = YES
 
-# If the MACRO_EXPANSION tag is set to YES Doxygen will expand all macro
-# names in the source code. If set to NO (the default) only conditional
-# compilation will be performed. Macro expansion can be done in a controlled
-# way by setting EXPAND_ONLY_PREDEF to YES.
+# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names
+# in the source code. If set to NO, only conditional compilation will be
+# performed. Macro expansion can be done in a controlled way by setting
+# EXPAND_ONLY_PREDEF to YES.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
 
 MACRO_EXPANSION        = YES
 
-# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES
-# then the macro expansion is limited to the macros specified with the
-# PREDEFINED and EXPAND_AS_DEFINED tags.
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then
+# the macro expansion is limited to the macros specified with the PREDEFINED and
+# EXPAND_AS_DEFINED tags.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
 
 EXPAND_ONLY_PREDEF     = NO
 
-# If the SEARCH_INCLUDES tag is set to YES (the default) the includes files
-# pointed to by INCLUDE_PATH will be searched when a #include is found.
+# If the SEARCH_INCLUDES tag is set to YES, the include files in the
+# INCLUDE_PATH will be searched if a #include is found.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
 
 SEARCH_INCLUDES        = YES
 
 # The INCLUDE_PATH tag can be used to specify one or more directories that
-# contain include files that are not input files but should be processed by
-# the preprocessor.
+# contain include files that are not input files but should be processed by the
+# preprocessor.
+# This tag requires that the tag SEARCH_INCLUDES is set to YES.
 
 INCLUDE_PATH           = @top_pwd@ \
                          @top_pwd@/src/frontend/SageIII \
                          @top_srcdir@/src/midend/astProcessing \
                          @top_srcdir@/src \
                          @top_srcdir@/src/backend/unparser \
-                         @top_srcdir@/src/midend/astRewriteMechanism \
-                         @top_srcdir@/src/util \
-                         @top_srcdir@/src/3rdPartyLibraries/MSTL \
-                         @top_srcdir@/src/midend/astQuery \
-                         @top_srcdir@/src/roseExtensions/roseHPCToolkit
+                         @top_srcdir@/src/util
 
 # You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
 # patterns (like *.h and *.hpp) to filter out the header-files in the
-# directories. If left blank, the patterns specified with FILE_PATTERNS will
-# be used.
+# directories. If left blank, the patterns specified with FILE_PATTERNS will be
+# used.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
 
 INCLUDE_FILE_PATTERNS  =
 
-# The PREDEFINED tag can be used to specify one or more macro names that
-# are defined before the preprocessor is started (similar to the -D option of
-# gcc). The argument of the tag is a list of macros of the form: name
-# or name=definition (no spaces). If the definition and the = are
-# omitted =1 is assumed. To prevent a macro definition from being
-# undefined via #undef or recursively expanded use the := operator
-# instead of the = operator.
+# The PREDEFINED tag can be used to specify one or more macro names that are
+# defined before the preprocessor is started (similar to the -D option of e.g.
+# gcc). The argument of the tag is a list of macros of the form: name or
+# name=definition (no spaces). If the definition and the "=" are omitted, "=1"
+# is assumed. To prevent a macro definition from being undefined via #undef or
+# recursively expanded use the := operator instead of the = operator.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
 
 PREDEFINED             = HAVE_EXPLICIT_TEMPLATE_INSTANTIATION \
                          __EXTERN_C__ \
                          ROSE_USE_NEW_GRAPH_NODES \
-			 DOCUMENTATION
-
-# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then
-# this tag can be used to specify a list of macro names that should be expanded.
-# The macro definition that is found in the sources will be used.
-# Use the PREDEFINED tag if you want to use a different macro definition that
-# overrules the definition found in the source code.
-
-EXPAND_AS_DEFINED      = DECLARE_LEAF_CLASS DECLARE_HEADERS DECLARE_OTHERS IS_SERIALIZABLE
-
-# If the SKIP_FUNCTION_MACROS tag is set to YES (the default) then
-# doxygen's preprocessor will remove all references to function-like macros
-# that are alone on a line, have an all uppercase name, and do not end with a
-# semicolon, because these will confuse the parser if not removed.
+                         DOCUMENTATION
+
+# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
+# tag can be used to specify a list of macro names that should be expanded. The
+# macro definition that is found in the sources will be used. Use the PREDEFINED
+# tag if you want to use a different macro definition that overrules the
+# definition found in the source code.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_AS_DEFINED      = DECLARE_LEAF_CLASS \
+                         DECLARE_HEADERS \
+                         DECLARE_OTHERS \
+                         IS_SERIALIZABLE
+
+# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will
+# remove all references to function-like macros that are alone on a line, have
+# an all uppercase name, and do not end with a semicolon. Such function macros
+# are typically used for boiler-plate code, and will confuse the parser if not
+# removed.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
 
 SKIP_FUNCTION_MACROS   = YES
 
 #---------------------------------------------------------------------------
-# Configuration::additions related to external references
+# Configuration options related to external references
 #---------------------------------------------------------------------------
 
-# The TAGFILES option can be used to specify one or more tagfiles. For each
-# tag file the location of the external documentation should be added. The
-# format of a tag file without this location is as follows:
-#
+# The TAGFILES tag can be used to specify one or more tag files. For each tag
+# file the location of the external documentation should be added. The format of
+# a tag file without this location is as follows:
 # TAGFILES = file1 file2 ...
 # Adding location for the tag files is done as follows:
-#
 # TAGFILES = file1=loc1 "file2 = loc2" ...
-# where "loc1" and "loc2" can be relative or absolute paths
-# or URLs. Note that each tag file must have a unique name (where the name does
-# NOT include the path). If a tag file is not located in the directory in which
-# doxygen is run, you must also specify the path to the tagfile here.
+# where loc1 and loc2 can be relative or absolute paths or URLs. See the
+# section "Linking to external documentation" for more information about the use
+# of tag files.
+# Note: Each tag file must have a unique name (where the name does NOT include
+# the path). If a tag file is not located in the directory in which doxygen is
+# run, you must also specify the path to the tagfile here.
 
 TAGFILES               = @DOXYGEN_USE_TAG_FILE@
 
-# When a file name is specified after GENERATE_TAGFILE, doxygen will create
-# a tag file that is based on the input files it reads.
+# When a file name is specified after GENERATE_TAGFILE, doxygen will create a
+# tag file that is based on the input files it reads. See section "Linking to
+# external documentation" for more information about the usage of tag files.
 
 GENERATE_TAGFILE       = @top_pwd@/docs/Rose/roseDoxygen.tags
 
-# If the ALLEXTERNALS tag is set to YES all external classes will be listed
-# in the class index. If set to NO only the inherited external classes
-# will be listed.
+# If the ALLEXTERNALS tag is set to YES, all external class will be listed in
+# the class index. If set to NO, only the inherited external classes will be
+# listed.
+# The default value is: NO.
 
 ALLEXTERNALS           = YES
 
-# If the EXTERNAL_GROUPS tag is set to YES all external groups will be listed
-# in the modules index. If set to NO, only the current project's groups will
-# be listed.
+# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed
+# in the modules index. If set to NO, only the current project's groups will be
+# listed.
+# The default value is: YES.
 
 EXTERNAL_GROUPS        = YES
 
-# The PERL_PATH should be the absolute path and name of the perl script
-# interpreter (i.e. the result of `which perl').
+# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in
+# the related pages index. If set to NO, only the current project's pages will
+# be listed.
+# The default value is: YES.
 
-PERL_PATH              = /usr/bin/perl
+EXTERNAL_PAGES         = YES
 
 #---------------------------------------------------------------------------
 # Configuration options related to the dot tool
 #---------------------------------------------------------------------------
 
-# If the CLASS_DIAGRAMS tag is set to YES (the default) Doxygen will
-# generate a inheritance diagram (in HTML, RTF and LaTeX) for classes with base
-# or super classes. Setting the tag to NO turns the diagrams off. Note that
-# this option also works with HAVE_DOT disabled, but it is recommended to
-# install and use dot, since it yields more powerful graphs.
+# If the CLASS_DIAGRAMS tag is set to YES, doxygen will generate a class diagram
+# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to
+# NO turns the diagrams off. Note that this option also works with HAVE_DOT
+# disabled, but it is recommended to install and use dot, since it yields more
+# powerful graphs.
+# The default value is: YES.
 
 CLASS_DIAGRAMS         = YES
 
-# You can define message sequence charts within doxygen comments using the \msc
-# command. Doxygen will then run the mscgen tool (see
-# http://www.mcternan.me.uk/mscgen/) to produce the chart and insert it in the
-# documentation. The MSCGEN_PATH tag allows you to specify the directory where
-# the mscgen tool resides. If left empty the tool is assumed to be found in the
-# default search path.
+# You can include diagrams made with dia in doxygen documentation. Doxygen will
+# then run dia to produce the diagram and insert it in the documentation. The
+# DIA_PATH tag allows you to specify the directory where the dia binary resides.
+# If left empty dia is assumed to be found in the default search path.
 
-MSCGEN_PATH            =
+DIA_PATH               =
 
-# If set to YES, the inheritance and collaboration graphs will hide
-# inheritance and usage relations if the target is undocumented
-# or is not a class.
+# If set to YES the inheritance and collaboration graphs will hide inheritance
+# and usage relations if the target is undocumented or is not a class.
+# The default value is: YES.
 
 HIDE_UNDOC_RELATIONS   = YES
 
 # If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
-# available from the path. This tool is part of Graphviz, a graph visualization
-# toolkit from AT&T and Lucent Bell Labs. The other options in this section
-# have no effect if this option is set to NO (the default)
+# available from the path. This tool is part of Graphviz (see:
+# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
+# Bell Labs. The other options in this section have no effect if this option is
+# set to NO
+# The default value is: YES.
 
 HAVE_DOT               = YES
 
-# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is
-# allowed to run in parallel. When set to 0 (the default) doxygen will
-# base this on the number of processors available in the system. You can set it
-# explicitly to a value larger than 0 to get control over the balance
-# between CPU load and processing speed.
+# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed
+# to run in parallel. When set to 0 doxygen will base this on the number of
+# processors available in the system. You can set it explicitly to a value
+# larger than 0 to get control over the balance between CPU load and processing
+# speed.
+# Minimum value: 0, maximum value: 32, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
 
 DOT_NUM_THREADS        = 0
 
-# By default doxygen will use the Helvetica font for all dot files that
-# doxygen generates. When you want a differently looking font you can specify
-# the font name using DOT_FONTNAME. You need to make sure dot is able to find
-# the font, which can be done by putting it in a standard location or by setting
-# the DOTFONTPATH environment variable or by setting DOT_FONTPATH to the
-# directory containing the font.
+# When you want a differently looking font in the dot files that doxygen
+# generates you can specify the font name using DOT_FONTNAME. You need to make
+# sure dot is able to find the font, which can be done by putting it in a
+# standard location or by setting the DOTFONTPATH environment variable or by
+# setting DOT_FONTPATH to the directory containing the font.
+# The default value is: Helvetica.
+# This tag requires that the tag HAVE_DOT is set to YES.
 
 DOT_FONTNAME           = Helvetica
 
-# The DOT_FONTSIZE tag can be used to set the size of the font of dot graphs.
-# The default size is 10pt.
+# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of
+# dot graphs.
+# Minimum value: 4, maximum value: 24, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
 
 DOT_FONTSIZE           = 10
 
-# By default doxygen will tell dot to use the Helvetica font.
-# If you specify a different font using DOT_FONTNAME you can use DOT_FONTPATH to
-# set the path where dot can find it.
+# By default doxygen will tell dot to use the default font as specified with
+# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set
+# the path where dot can find it using this tag.
+# This tag requires that the tag HAVE_DOT is set to YES.
 
 DOT_FONTPATH           =
 
-# If the CLASS_GRAPH and HAVE_DOT tags are set to YES then doxygen
-# will generate a graph for each documented class showing the direct and
-# indirect inheritance relations. Setting this tag to YES will force the
-# CLASS_DIAGRAMS tag to NO.
+# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
+# each documented class showing the direct and indirect inheritance relations.
+# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
 
 CLASS_GRAPH            = YES
 
-# If the COLLABORATION_GRAPH and HAVE_DOT tags are set to YES then doxygen
-# will generate a graph for each documented class showing the direct and
-# indirect implementation dependencies (inheritance, containment, and
-# class references variables) of the class with other documented classes.
+# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a
+# graph for each documented class showing the direct and indirect implementation
+# dependencies (inheritance, containment, and class references variables) of the
+# class with other documented classes.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
 
 COLLABORATION_GRAPH    = YES
 
-# If the GROUP_GRAPHS and HAVE_DOT tags are set to YES then doxygen
-# will generate a graph for groups, showing the direct groups dependencies
+# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
+# groups, showing the direct groups dependencies.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
 
 GROUP_GRAPHS           = YES
 
-# If the UML_LOOK tag is set to YES doxygen will generate inheritance and
+# If the UML_LOOK tag is set to YES, doxygen will generate inheritance and
 # collaboration diagrams in a style similar to the OMG's Unified Modeling
 # Language.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
 
 UML_LOOK               = NO
 
-# If the UML_LOOK tag is enabled, the fields and methods are shown inside
-# the class node. If there are many fields or methods and many nodes the
-# graph may become too big to be useful. The UML_LIMIT_NUM_FIELDS
-# threshold limits the number of items for each type to make the size more
-# managable. Set this to 0 for no limit. Note that the threshold may be
-# exceeded by 50% before the limit is enforced.
+# If the UML_LOOK tag is enabled, the fields and methods are shown inside the
+# class node. If there are many fields or methods and many nodes the graph may
+# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the
+# number of items for each type to make the size more manageable. Set this to 0
+# for no limit. Note that the threshold may be exceeded by 50% before the limit
+# is enforced. So when you set the threshold to 10, up to 15 fields may appear,
+# but if the number exceeds 15, the total amount of fields shown is limited to
+# 10.
+# Minimum value: 0, maximum value: 100, default value: 10.
+# This tag requires that the tag UML_LOOK is set to YES.
 
 UML_LIMIT_NUM_FIELDS   = 10
 
-# If set to YES, the inheritance and collaboration graphs will show the
-# relations between templates and their instances.
+# If the DOT_UML_DETAILS tag is set to NO, doxygen will show attributes and
+# methods without types and arguments in the UML graphs. If the DOT_UML_DETAILS
+# tag is set to YES, doxygen will add type and arguments for attributes and
+# methods in the UML graphs. If the DOT_UML_DETAILS tag is set to NONE, doxygen
+# will not generate fields with class member information in the UML graphs. The
+# class diagrams will look similar to the default class diagrams but using UML
+# notation for the relationships.
+# Possible values are: NO, YES and NONE.
+# The default value is: NO.
+# This tag requires that the tag UML_LOOK is set to YES.
+
+DOT_UML_DETAILS        = NO
+
+# The DOT_WRAP_THRESHOLD tag can be used to set the maximum number of characters
+# to display on a single line. If the actual line length exceeds this threshold
+# significantly it will wrapped across multiple lines. Some heuristics are apply
+# to avoid ugly line breaks.
+# Minimum value: 0, maximum value: 1000, default value: 17.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_WRAP_THRESHOLD     = 17
+
+# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and
+# collaboration graphs will show the relations between templates and their
+# instances.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
 
 TEMPLATE_RELATIONS     = YES
 
-# If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDE_GRAPH, and HAVE_DOT
-# tags are set to YES then doxygen will generate a graph for each documented
-# file showing the direct and indirect include dependencies of the file with
-# other documented files.
+# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to
+# YES then doxygen will generate a graph for each documented file showing the
+# direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
 
 INCLUDE_GRAPH          = YES
 
-# If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDED_BY_GRAPH, and
-# HAVE_DOT tags are set to YES then doxygen will generate a graph for each
-# documented header file showing the documented files that directly or
-# indirectly include this file.
+# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are
+# set to YES then doxygen will generate a graph for each documented file showing
+# the direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
 
 INCLUDED_BY_GRAPH      = YES
 
-# If the CALL_GRAPH and HAVE_DOT options are set to YES then
-# doxygen will generate a call dependency graph for every global function
-# or class method. Note that enabling this option will significantly increase
-# the time of a run. So in most cases it will be better to enable call graphs
-# for selected functions only using the \callgraph command.
+# If the CALL_GRAPH tag is set to YES then doxygen will generate a call
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable call graphs for selected
+# functions only using the \callgraph command. Disabling a call graph can be
+# accomplished by means of the command \hidecallgraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
 
-CALL_GRAPH             = YES 
+CALL_GRAPH             = YES
 
-# If the CALLER_GRAPH and HAVE_DOT tags are set to YES then
-# doxygen will generate a caller dependency graph for every global function
-# or class method. Note that enabling this option will significantly increase
-# the time of a run. So in most cases it will be better to enable caller
-# graphs for selected functions only using the \callergraph command.
+# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable caller graphs for selected
+# functions only using the \callergraph command. Disabling a caller graph can be
+# accomplished by means of the command \hidecallergraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
 
-CALLER_GRAPH           = YES 
+CALLER_GRAPH           = YES
 
-# If the GRAPHICAL_HIERARCHY and HAVE_DOT tags are set to YES then doxygen
-# will generate a graphical hierarchy of all classes instead of a textual one.
+# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical
+# hierarchy of all classes instead of a textual one.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
 
 GRAPHICAL_HIERARCHY    = YES
 
-# If the DIRECTORY_GRAPH and HAVE_DOT tags are set to YES
-# then doxygen will show the dependencies a directory has on other directories
-# in a graphical way. The dependency relations are determined by the #include
-# relations between the files in the directories.
+# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the
+# dependencies a directory has on other directories in a graphical way. The
+# dependency relations are determined by the #include relations between the
+# files in the directories.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
 
 DIRECTORY_GRAPH        = YES
 
 # The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
-# generated by dot. Possible values are svg, png, jpg, or gif.
-# If left blank png will be used. If you choose svg you need to set
-# HTML_FILE_EXTENSION to xhtml in order to make the SVG files
-# visible in IE 9+ (other browsers do not have this requirement).
+# generated by dot. For an explanation of the image formats see the section
+# output formats in the documentation of the dot tool (Graphviz (see:
+# http://www.graphviz.org/)).
+# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
+# to make the SVG files visible in IE 9+ (other browsers do not have this
+# requirement).
+# Possible values are: png, png:cairo, png:cairo:cairo, png:cairo:gd, png:gd,
+# png:gd:gd, jpg, jpg:cairo, jpg:cairo:gd, jpg:gd, jpg:gd:gd, gif, gif:cairo,
+# gif:cairo:gd, gif:gd, gif:gd:gd, svg, png:gd, png:gd:gd, png:cairo,
+# png:cairo:gd, png:cairo:cairo, png:cairo:gdiplus, png:gdiplus and
+# png:gdiplus:gdiplus.
+# The default value is: png.
+# This tag requires that the tag HAVE_DOT is set to YES.
 
 DOT_IMAGE_FORMAT       = png
 
 # If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
 # enable generation of interactive SVG images that allow zooming and panning.
-# Note that this requires a modern browser other than Internet Explorer.
-# Tested and working are Firefox, Chrome, Safari, and Opera. For IE 9+ you
-# need to set HTML_FILE_EXTENSION to xhtml in order to make the SVG files
-# visible. Older versions of IE do not have SVG support.
+#
+# Note that this requires a modern browser other than Internet Explorer. Tested
+# and working are Firefox, Chrome, Safari, and Opera.
+# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make
+# the SVG files visible. Older versions of IE do not have SVG support.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
 
 INTERACTIVE_SVG        = NO
 
-# The tag DOT_PATH can be used to specify the path where the dot tool can be
+# The DOT_PATH tag can be used to specify the path where the dot tool can be
 # found. If left blank, it is assumed the dot tool can be found in the path.
+# This tag requires that the tag HAVE_DOT is set to YES.
 
 DOT_PATH               =
 
 # The DOTFILE_DIRS tag can be used to specify one or more directories that
-# contain dot files that are included in the documentation (see the
-# \dotfile command).
+# contain dot files that are included in the documentation (see the \dotfile
+# command).
+# This tag requires that the tag HAVE_DOT is set to YES.
 
 DOTFILE_DIRS           =
 
 # The MSCFILE_DIRS tag can be used to specify one or more directories that
-# contain msc files that are included in the documentation (see the
-# \mscfile command).
+# contain msc files that are included in the documentation (see the \mscfile
+# command).
 
 MSCFILE_DIRS           =
 
-# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of
-# nodes that will be shown in the graph. If the number of nodes in a graph
-# becomes larger than this value, doxygen will truncate the graph, which is
-# visualized by representing a node as a red box. Note that doxygen if the
-# number of direct children of the root node in a graph is already larger than
-# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note
-# that the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+# The DIAFILE_DIRS tag can be used to specify one or more directories that
+# contain dia files that are included in the documentation (see the \diafile
+# command).
+
+DIAFILE_DIRS           =
+
+# When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the
+# path where java can find the plantuml.jar file. If left blank, it is assumed
+# PlantUML is not used or called during a preprocessing step. Doxygen will
+# generate a warning when it encounters a \startuml command in this case and
+# will not generate output for the diagram.
+
+PLANTUML_JAR_PATH      =
+
+# When using plantuml, the PLANTUML_CFG_FILE tag can be used to specify a
+# configuration file for plantuml.
+
+PLANTUML_CFG_FILE      =
+
+# When using plantuml, the specified paths are searched for files specified by
+# the !include statement in a plantuml block.
+
+PLANTUML_INCLUDE_PATH  =
+
+# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes
+# that will be shown in the graph. If the number of nodes in a graph becomes
+# larger than this value, doxygen will truncate the graph, which is visualized
+# by representing a node as a red box. Note that doxygen if the number of direct
+# children of the root node in a graph is already larger than
+# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that
+# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+# Minimum value: 0, maximum value: 10000, default value: 50.
+# This tag requires that the tag HAVE_DOT is set to YES.
 
-# DQ (12/19/2015): Modified to support more children (e.g. there are approximately 65 direct children to a SgExpression IR node).
-# DOT_GRAPH_MAX_NODES    = 50
 DOT_GRAPH_MAX_NODES    = 200
 
-# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the
-# graphs generated by dot. A depth value of 3 means that only nodes reachable
-# from the root by following a path via at most 3 edges will be shown. Nodes
-# that lay further from the root node will be omitted. Note that setting this
-# option to 1 or 2 may greatly reduce the computation time needed for large
-# code bases. Also note that the size of a graph can be further restricted by
+# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs
+# generated by dot. A depth value of 3 means that only nodes reachable from the
+# root by following a path via at most 3 edges will be shown. Nodes that lay
+# further from the root node will be omitted. Note that setting this option to 1
+# or 2 may greatly reduce the computation time needed for large code bases. Also
+# note that the size of a graph can be further restricted by
 # DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
+# Minimum value: 0, maximum value: 1000, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
 
-# DQ (12/19/2015): Modified to reduce the number of levels to output only direct
-# children (previously this dropped children from the graph when the unlimited depth
-# caused more nodes in the graph than permitted by DOT_GRAPH_MAX_NODES (above)).
-# MAX_DOT_GRAPH_DEPTH    = 0
 MAX_DOT_GRAPH_DEPTH    = 1
 
 # Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
-# background. This is disabled by default, because dot on Windows does not
-# seem to support this out of the box. Warning: Depending on the platform used,
-# enabling this option may lead to badly anti-aliased labels on the edges of
-# a graph (i.e. they become hard to read).
+# background. This is disabled by default, because dot on Windows does not seem
+# to support this out of the box.
+#
+# Warning: Depending on the platform used, enabling this option may lead to
+# badly anti-aliased labels on the edges of a graph (i.e. they become hard to
+# read).
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
 
 DOT_TRANSPARENT        = NO
 
-# Set the DOT_MULTI_TARGETS tag to YES allow dot to generate multiple output
+# Set the DOT_MULTI_TARGETS tag to YES to allow dot to generate multiple output
 # files in one run (i.e. multiple -o and -T options on the command line). This
-# makes dot run faster, but since only newer versions of dot (>1.8.10)
-# support this, this feature is disabled by default.
+# makes dot run faster, but since only newer versions of dot (>1.8.10) support
+# this, this feature is disabled by default.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
 
 DOT_MULTI_TARGETS      = NO
 
-# If the GENERATE_LEGEND tag is set to YES (the default) Doxygen will
-# generate a legend page explaining the meaning of the various boxes and
-# arrows in the dot generated graphs.
+# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page
+# explaining the meaning of the various boxes and arrows in the dot generated
+# graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
 
 GENERATE_LEGEND        = YES
 
-# If the DOT_CLEANUP tag is set to YES (the default) Doxygen will
-# remove the intermediate dot files that are used to generate
-# the various graphs.
+# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate
+# files that are used to generate the various graphs.
+#
+# Note: This setting is not only used for dot files but also for msc and
+# plantuml temporary files.
+# The default value is: YES.
 
 DOT_CLEANUP            = YES
diff --git a/docs/Rose/roseQtWidgets.doxygen.in b/docs/Rose/roseQtWidgets.doxygen.in
deleted file mode 100644
index 05f6e1ec275..00000000000
--- a/docs/Rose/roseQtWidgets.doxygen.in
+++ /dev/null
@@ -1,1254 +0,0 @@
-# Doxyfile 1.5.2
-
-# This file describes the settings to be used by the documentation system
-# doxygen (www.doxygen.org) for a project
-#
-# All text after a hash (#) is considered a comment and will be ignored
-# The format is:
-#       TAG = value [value, ...]
-# For lists items can also be appended using:
-#       TAG += value [value, ...]
-# Values that contain spaces should be placed between quotes (" ")
-
-#---------------------------------------------------------------------------
-# Project related configuration options
-#---------------------------------------------------------------------------
-
-# This tag specifies the encoding used for all characters in the config file that 
-# follow. The default is UTF-8 which is also the encoding used for all text before 
-# the first occurrence of this tag. Doxygen uses libiconv (or the iconv built into 
-# libc) for the transcoding. See http://www.gnu.org/software/libiconv for the list of 
-# possible encodings.
-
-DOXYFILE_ENCODING = UTF-8
-
-# The PROJECT_NAME tag is a single word (or a sequence of words surrounded 
-# by quotes) that should identify the project.
-
-PROJECT_NAME = RoseQtWidgets
-
-# The PROJECT_NUMBER tag can be used to enter a project or revision number. 
-# This could be handy for archiving the generated documentation or 
-# if some version control system is used.
-
-PROJECT_NUMBER = 
-
-# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) 
-# base path where the generated documentation will be put. 
-# If a relative path is entered, it will be relative to the location 
-# where doxygen was started. If left blank the current directory will be used.
-
-OUTPUT_DIRECTORY = ROSE_WebPages
-
-# If the CREATE_SUBDIRS tag is set to YES, then doxygen will create 
-# 4096 sub-directories (in 2 levels) under the output directory of each output 
-# format and will distribute the generated files over these directories. 
-# Enabling this option can be useful when feeding doxygen a huge amount of 
-# source files, where putting all generated files in the same directory would 
-# otherwise cause performance problems for the file system.
-
-CREATE_SUBDIRS = NO
-
-# The OUTPUT_LANGUAGE tag is used to specify the language in which all 
-# documentation generated by doxygen is written. Doxygen will use this 
-# information to generate all constant output in the proper language. 
-# The default language is English, other supported languages are: 
-# Afrikaans, Arabic, Brazilian, Catalan, Chinese, Chinese-Traditional, 
-# Croatian, Czech, Danish, Dutch, Finnish, French, German, Greek, Hungarian, 
-# Italian, Japanese, Japanese-en (Japanese with English messages), Korean, 
-# Korean-en, Lithuanian, Norwegian, Polish, Portuguese, Romanian, Russian, 
-# Serbian, Slovak, Slovene, Spanish, Swedish, and Ukrainian.
-
-OUTPUT_LANGUAGE = English
-
-# If the BRIEF_MEMBER_DESC tag is set to YES (the default) Doxygen will 
-# include brief member descriptions after the members that are listed in 
-# the file and class documentation (similar to JavaDoc). 
-# Set to NO to disable this.
-
-BRIEF_MEMBER_DESC = YES
-
-# If the REPEAT_BRIEF tag is set to YES (the default) Doxygen will prepend 
-# the brief description of a member or function before the detailed description. 
-# Note: if both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the 
-# brief descriptions will be completely suppressed.
-
-REPEAT_BRIEF = YES
-
-# This tag implements a quasi-intelligent brief description abbreviator 
-# that is used to form the text in various listings. Each string 
-# in this list, if found as the leading text of the brief description, will be 
-# stripped from the text and the result after processing the whole list, is 
-# used as the annotated text. Otherwise, the brief description is used as-is. 
-# If left blank, the following values are used ("$name" is automatically 
-# replaced with the name of the entity): "The $name class" "The $name widget" 
-# "The $name file" "is" "provides" "specifies" "contains" 
-# "represents" "a" "an" "the"
-
-ABBREVIATE_BRIEF = 
-
-# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then 
-# Doxygen will generate a detailed section even if there is only a brief 
-# description.
-
-ALWAYS_DETAILED_SEC = NO
-
-# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all 
-# inherited members of a class in the documentation of that class as if those 
-# members were ordinary class members. Constructors, destructors and assignment 
-# operators of the base classes will not be shown.
-
-INLINE_INHERITED_MEMB = YES
-
-# If the FULL_PATH_NAMES tag is set to YES then Doxygen will prepend the full 
-# path before files name in the file list and in the header files. If set 
-# to NO the shortest path that makes the file name unique will be used.
-
-FULL_PATH_NAMES = NO
-
-# If the FULL_PATH_NAMES tag is set to YES then the STRIP_FROM_PATH tag 
-# can be used to strip a user-defined part of the path. Stripping is 
-# only done if one of the specified strings matches the left-hand part of 
-# the path. The tag can be used to show relative paths in the file list. 
-# If left blank the directory from which doxygen is run is used as the 
-# path to strip.
-
-STRIP_FROM_PATH = 
-
-# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of 
-# the path mentioned in the documentation of a class, which tells 
-# the reader which header file to include in order to use a class. 
-# If left blank only the name of the header file containing the class 
-# definition is used. Otherwise one should specify the include paths that 
-# are normally passed to the compiler using the -I flag.
-
-STRIP_FROM_INC_PATH = 
-
-# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter 
-# (but less readable) file names. This can be useful is your file systems 
-# doesn't support long names like on DOS, Mac, or CD-ROM.
-
-SHORT_NAMES = NO
-
-# If the JAVADOC_AUTOBRIEF tag is set to YES then Doxygen 
-# will interpret the first line (until the first dot) of a JavaDoc-style 
-# comment as the brief description. If set to NO, the JavaDoc 
-# comments will behave just like the Qt-style comments (thus requiring an 
-# explicit @brief command for a brief description.
-
-JAVADOC_AUTOBRIEF = NO
-
-# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make Doxygen 
-# treat a multi-line C++ special comment block (i.e. a block of //! or /// 
-# comments) as a brief description. This used to be the default behaviour. 
-# The new default is to treat a multi-line C++ comment block as a detailed 
-# description. Set this tag to YES if you prefer the old behaviour instead.
-
-MULTILINE_CPP_IS_BRIEF = NO
-
-# If the INHERIT_DOCS tag is set to YES (the default) then an undocumented 
-# member inherits the documentation from any documented member that it 
-# re-implements.
-
-INHERIT_DOCS = YES
-
-# If the SEPARATE_MEMBER_PAGES tag is set to YES, then doxygen will produce 
-# a new page for each member. If set to NO, the documentation of a member will 
-# be part of the file/class/namespace that contains it.
-
-SEPARATE_MEMBER_PAGES = NO
-
-# The TAB_SIZE tag can be used to set the number of spaces in a tab. 
-# Doxygen uses this value to replace tabs by spaces in code fragments.
-
-TAB_SIZE = 4
-
-# This tag can be used to specify a number of aliases that acts 
-# as commands in the documentation. An alias has the form "name=value". 
-# For example adding "sideeffect=\par Side Effects:\n" will allow you to 
-# put the command \sideeffect (or @sideeffect) in the documentation, which 
-# will result in a user-defined paragraph with heading "Side Effects:". 
-# You can put \n's in the value part of an alias to insert newlines.
-
-ALIASES = 
-
-# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C 
-# sources only. Doxygen will then generate output that is more tailored for C. 
-# For instance, some of the names that are used will be different. The list 
-# of all members will be omitted, etc.
-
-OPTIMIZE_OUTPUT_FOR_C = NO
-
-# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java 
-# sources only. Doxygen will then generate output that is more tailored for Java. 
-# For instance, namespaces will be presented as packages, qualified scopes 
-# will look different, etc.
-
-OPTIMIZE_OUTPUT_JAVA = NO
-
-# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want to 
-# include (a tag file for) the STL sources as input, then you should 
-# set this tag to YES in order to let doxygen match functions declarations and 
-# definitions whose arguments contain STL classes (e.g. func(std::string); v.s. 
-# func(std::string) {}). This also make the inheritance and collaboration 
-# diagrams that involve STL classes more complete and accurate.
-
-BUILTIN_STL_SUPPORT = YES
-
-# If you use Microsoft's C++/CLI language, you should set this option to YES to
-# enable parsing support.
-
-CPP_CLI_SUPPORT = NO
-
-# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC 
-# tag is set to YES, then doxygen will reuse the documentation of the first 
-# member in the group (if any) for the other members of the group. By default 
-# all members of a group must be documented explicitly.
-
-DISTRIBUTE_GROUP_DOC = NO
-
-# Set the SUBGROUPING tag to YES (the default) to allow class member groups of 
-# the same type (for instance a group of public functions) to be put as a 
-# subgroup of that type (e.g. under the Public Functions section). Set it to 
-# NO to prevent subgrouping. Alternatively, this can be done per class using 
-# the \nosubgrouping command.
-
-SUBGROUPING = YES
-
-#---------------------------------------------------------------------------
-# Build related configuration options
-#---------------------------------------------------------------------------
-
-# If the EXTRACT_ALL tag is set to YES doxygen will assume all entities in 
-# documentation are documented, even if no documentation was available. 
-# Private class members and static file members will be hidden unless 
-# the EXTRACT_PRIVATE and EXTRACT_STATIC tags are set to YES
-
-EXTRACT_ALL = YES
-
-# If the EXTRACT_PRIVATE tag is set to YES all private members of a class 
-# will be included in the documentation.
-
-EXTRACT_PRIVATE = YES
-
-# If the EXTRACT_STATIC tag is set to YES all static members of a file 
-# will be included in the documentation.
-
-EXTRACT_STATIC = YES
-
-# If the EXTRACT_LOCAL_CLASSES tag is set to YES classes (and structs) 
-# defined locally in source files will be included in the documentation. 
-# If set to NO only classes defined in header files are included.
-
-EXTRACT_LOCAL_CLASSES = YES
-
-# This flag is only useful for Objective-C code. When set to YES local 
-# methods, which are defined in the implementation section but not in 
-# the interface are included in the documentation. 
-# If set to NO (the default) only methods in the interface are included.
-
-EXTRACT_LOCAL_METHODS = NO
-
-# If the HIDE_UNDOC_MEMBERS tag is set to YES, Doxygen will hide all 
-# undocumented members of documented classes, files or namespaces. 
-# If set to NO (the default) these members will be included in the 
-# various overviews, but no documentation section is generated. 
-# This option has no effect if EXTRACT_ALL is enabled.
-
-HIDE_UNDOC_MEMBERS = NO
-
-# If the HIDE_UNDOC_CLASSES tag is set to YES, Doxygen will hide all 
-# undocumented classes that are normally visible in the class hierarchy. 
-# If set to NO (the default) these classes will be included in the various 
-# overviews. This option has no effect if EXTRACT_ALL is enabled.
-
-HIDE_UNDOC_CLASSES = NO
-
-# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, Doxygen will hide all 
-# friend (class|struct|union) declarations. 
-# If set to NO (the default) these declarations will be included in the 
-# documentation.
-
-HIDE_FRIEND_COMPOUNDS = NO
-
-# If the HIDE_IN_BODY_DOCS tag is set to YES, Doxygen will hide any 
-# documentation blocks found inside the body of a function. 
-# If set to NO (the default) these blocks will be appended to the 
-# function's detailed documentation block.
-
-HIDE_IN_BODY_DOCS = NO
-
-# The INTERNAL_DOCS tag determines if documentation 
-# that is typed after a \internal command is included. If the tag is set 
-# to NO (the default) then the documentation will be excluded. 
-# Set it to YES to include the internal documentation.
-
-INTERNAL_DOCS = NO
-
-# If the CASE_SENSE_NAMES tag is set to NO then Doxygen will only generate 
-# file names in lower-case letters. If set to YES upper-case letters are also 
-# allowed. This is useful if you have classes or files whose names only differ 
-# in case and if your file system supports case sensitive file names. Windows 
-# and Mac users are advised to set this option to NO.
-
-CASE_SENSE_NAMES = YES
-
-# If the HIDE_SCOPE_NAMES tag is set to NO (the default) then Doxygen 
-# will show members with their full class and namespace scopes in the 
-# documentation. If set to YES the scope will be hidden.
-
-HIDE_SCOPE_NAMES = NO
-
-# If the SHOW_INCLUDE_FILES tag is set to YES (the default) then Doxygen 
-# will put a list of the files that are included by a file in the documentation 
-# of that file.
-
-SHOW_INCLUDE_FILES = YES
-
-# If the INLINE_INFO tag is set to YES (the default) then a tag [inline] 
-# is inserted in the documentation for inline members.
-
-INLINE_INFO = YES
-
-# If the SORT_MEMBER_DOCS tag is set to YES (the default) then doxygen 
-# will sort the (detailed) documentation of file and class members 
-# alphabetically by member name. If set to NO the members will appear in 
-# declaration order.
-
-SORT_MEMBER_DOCS = YES
-
-# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the 
-# brief documentation of file, namespace and class members alphabetically 
-# by member name. If set to NO (the default) the members will appear in 
-# declaration order.
-
-SORT_BRIEF_DOCS = NO
-
-# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be 
-# sorted by fully-qualified names, including namespaces. If set to 
-# NO (the default), the class list will be sorted only by class name, 
-# not including the namespace part. 
-# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
-# Note: This option applies only to the class list, not to the 
-# alphabetical list.
-
-SORT_BY_SCOPE_NAME = NO
-
-# The GENERATE_TODOLIST tag can be used to enable (YES) or 
-# disable (NO) the todo list. This list is created by putting \todo 
-# commands in the documentation.
-
-GENERATE_TODOLIST = YES
-
-# The GENERATE_TESTLIST tag can be used to enable (YES) or 
-# disable (NO) the test list. This list is created by putting \test 
-# commands in the documentation.
-
-GENERATE_TESTLIST = YES
-
-# The GENERATE_BUGLIST tag can be used to enable (YES) or 
-# disable (NO) the bug list. This list is created by putting \bug 
-# commands in the documentation.
-
-GENERATE_BUGLIST = YES
-
-# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or 
-# disable (NO) the deprecated list. This list is created by putting 
-# \deprecated commands in the documentation.
-
-GENERATE_DEPRECATEDLIST = YES
-
-# The ENABLED_SECTIONS tag can be used to enable conditional 
-# documentation sections, marked by \if sectionname ... \endif.
-
-ENABLED_SECTIONS = 
-
-# The MAX_INITIALIZER_LINES tag determines the maximum number of lines 
-# the initial value of a variable or define consists of for it to appear in 
-# the documentation. If the initializer consists of more lines than specified 
-# here it will be hidden. Use a value of 0 to hide initializers completely. 
-# The appearance of the initializer of individual variables and defines in the 
-# documentation can be controlled using \showinitializer or \hideinitializer 
-# command in the documentation regardless of this setting.
-
-MAX_INITIALIZER_LINES = 30
-
-# Set the SHOW_USED_FILES tag to NO to disable the list of files generated 
-# at the bottom of the documentation of classes and structs. If set to YES the 
-# list will mention the files that were used to generate the documentation.
-
-SHOW_USED_FILES = YES
-
-# If the sources in your project are distributed over multiple directories 
-# then setting the SHOW_DIRECTORIES tag to YES will show the directory hierarchy 
-# in the documentation. The default is NO.
-
-SHOW_DIRECTORIES = YES
-
-# The FILE_VERSION_FILTER tag can be used to specify a program or script that 
-# doxygen should invoke to get the current version for each file (typically from the 
-# version control system). Doxygen will invoke the program by executing (via 
-# popen()) the command <command> <input-file>, where <command> is the value of 
-# the FILE_VERSION_FILTER tag, and <input-file> is the name of an input file 
-# provided by doxygen. Whatever the program writes to standard output 
-# is used as the file version. See the manual for examples.
-
-FILE_VERSION_FILTER = 
-
-#---------------------------------------------------------------------------
-# configuration options related to warning and progress messages
-#---------------------------------------------------------------------------
-
-# The QUIET tag can be used to turn on/off the messages that are generated 
-# by doxygen. Possible values are YES and NO. If left blank NO is used.
-
-QUIET = YES
-
-# The WARNINGS tag can be used to turn on/off the warning messages that are 
-# generated by doxygen. Possible values are YES and NO. If left blank 
-# NO is used.
-
-WARNINGS = NO
-
-# If WARN_IF_UNDOCUMENTED is set to YES, then doxygen will generate warnings 
-# for undocumented members. If EXTRACT_ALL is set to YES then this flag will 
-# automatically be disabled.
-
-WARN_IF_UNDOCUMENTED = YES
-
-# If WARN_IF_DOC_ERROR is set to YES, doxygen will generate warnings for 
-# potential errors in the documentation, such as not documenting some 
-# parameters in a documented function, or documenting parameters that 
-# don't exist or using markup commands wrongly.
-
-WARN_IF_DOC_ERROR = YES
-
-# This WARN_NO_PARAMDOC option can be abled to get warnings for 
-# functions that are documented, but have no documentation for their parameters 
-# or return value. If set to NO (the default) doxygen will only warn about 
-# wrong or incomplete parameter documentation, but not about the absence of 
-# documentation.
-
-WARN_NO_PARAMDOC = NO
-
-# The WARN_FORMAT tag determines the format of the warning messages that 
-# doxygen can produce. The string should contain the $file, $line, and $text 
-# tags, which will be replaced by the file and line number from which the 
-# warning originated and the warning text. Optionally the format may contain 
-# $version, which will be replaced by the version of the file (if it could 
-# be obtained via FILE_VERSION_FILTER)
-
-WARN_FORMAT = 
-
-# The WARN_LOGFILE tag can be used to specify a file to which warning 
-# and error messages should be written. If left blank the output is written 
-# to stderr.
-
-WARN_LOGFILE = 
-
-#---------------------------------------------------------------------------
-# configuration options related to the input files
-#---------------------------------------------------------------------------
-
-# The INPUT tag can be used to specify the files and/or directories that contain 
-# documented source files. You may enter file names like "myfile.cpp" or 
-# directories like "/usr/src/myproject". Separate the files or directories 
-# with spaces.
-
-INPUT = @top_srcdir@/src/roseExtensions/qtWidgets
-
-# This tag can be used to specify the character encoding of the source files that 
-# doxygen parses. Internally doxygen uses the UTF-8 encoding, which is also the default 
-# input encoding. Doxygen uses libiconv (or the iconv built into libc) for the transcoding. 
-# See http://www.gnu.org/software/libiconv for the list of possible encodings.
-
-INPUT_ENCODING = UTF-8
-
-# If the value of the INPUT tag contains directories, you can use the 
-# FILE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp 
-# and *.h) to filter out the source-files in the directories. If left 
-# blank the following patterns are tested: 
-# *.c *.cc *.cxx *.cpp *.c++ *.java *.ii *.ixx *.ipp *.i++ *.inl *.h *.hh *.hxx 
-# *.hpp *.h++ *.idl *.odl *.cs *.php *.php3 *.inc *.m *.mm *.py
-
-FILE_PATTERNS = *.cpp *.doc *.h *.dox
-
-# The RECURSIVE tag can be used to turn specify whether or not subdirectories 
-# should be searched for input files as well. Possible values are YES and NO. 
-# If left blank NO is used.
-
-RECURSIVE = YES
-
-# The EXCLUDE tag can be used to specify files and/or directories that should 
-# excluded from the INPUT source files. This way you can easily exclude a 
-# subdirectory from a directory tree whose root is specified with the INPUT tag.
-
-EXCLUDE  = @top_srcdir@/src/roseExtensions/qtWidgets/QCodeEditWidget/QCodeEdit  
-EXCLUDE += @top_srcdir@/src/roseExtensions/qtWidgets/QtGradientEditor
-EXCLUDE += @top_srcdir@/src/roseExtensions/qtWidgets/AstProcessing
-EXCLUDE += @top_srcdir@/src/roseExtensions/qtWidgets/cmakeBuildEnvironment
-
-
-# The EXCLUDE_SYMLINKS tag can be used select whether or not files or 
-# directories that are symbolic links (a Unix filesystem feature) are excluded 
-# from the input.
-
-EXCLUDE_SYMLINKS = NO
-
-# If the value of the INPUT tag contains directories, you can use the 
-# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude 
-# certain files from those directories. Note that the wildcards are matched 
-# against the file with absolute path, so to exclude all test directories 
-# for example use the pattern */test/*
-
-EXCLUDE_PATTERNS = inputTest.cpp ui_* moc_*
-
-# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names 
-# (namespaces, classes, functions, etc.) that should be excluded from the output. 
-# The symbol name can be a fully qualified name, a word, or if the wildcard * is used, 
-# a substring. Examples: ANamespace, AClass, AClass::ANamespace, ANamespace::*Test
-
-EXCLUDE_SYMBOLS = 
-
-# The EXAMPLE_PATH tag can be used to specify one or more files or 
-# directories that contain example code fragments that are included (see 
-# the \include command).
-
-EXAMPLE_PATH = 
-
-# If the value of the EXAMPLE_PATH tag contains directories, you can use the 
-# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp 
-# and *.h) to filter out the source-files in the directories. If left 
-# blank all files are included.
-
-EXAMPLE_PATTERNS = 
-
-# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be 
-# searched for input files to be used with the \include or \dontinclude 
-# commands irrespective of the value of the RECURSIVE tag. 
-# Possible values are YES and NO. If left blank NO is used.
-
-EXAMPLE_RECURSIVE = NO
-
-# The IMAGE_PATH tag can be used to specify one or more files or 
-# directories that contain image that are included in the documentation (see 
-# the \image command).
-
-IMAGE_PATH = @top_srcdir@/src/roseExtensions/qtWidgets/doc/images
-
-# The INPUT_FILTER tag can be used to specify a program that doxygen should 
-# invoke to filter for each input file. Doxygen will invoke the filter program 
-# by executing (via popen()) the command <filter> <input-file>, where <filter> 
-# is the value of the INPUT_FILTER tag, and <input-file> is the name of an 
-# input file. Doxygen will then use the output that the filter program writes 
-# to standard output.  If FILTER_PATTERNS is specified, this tag will be 
-# ignored.
-
-INPUT_FILTER = 
-
-# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern 
-# basis.  Doxygen will compare the file name with each pattern and apply the 
-# filter if there is a match.  The filters are a list of the form: 
-# pattern=filter (like *.cpp=my_cpp_filter). See INPUT_FILTER for further 
-# info on how filters are used. If FILTER_PATTERNS is empty, INPUT_FILTER 
-# is applied to all files.
-
-FILTER_PATTERNS = 
-
-# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using 
-# INPUT_FILTER) will be used to filter the input files when producing source 
-# files to browse (i.e. when SOURCE_BROWSER is set to YES).
-
-FILTER_SOURCE_FILES = NO
-
-#---------------------------------------------------------------------------
-# configuration options related to source browsing
-#---------------------------------------------------------------------------
-
-# If the SOURCE_BROWSER tag is set to YES then a list of source files will 
-# be generated. Documented entities will be cross-referenced with these sources. 
-# Note: To get rid of all source code in the generated output, make sure also 
-# VERBATIM_HEADERS is set to NO.
-
-SOURCE_BROWSER = YES
-
-# Setting the INLINE_SOURCES tag to YES will include the body 
-# of functions and classes directly in the documentation.
-
-INLINE_SOURCES = 
-
-# Setting the STRIP_CODE_COMMENTS tag to YES (the default) will instruct 
-# doxygen to hide any special comment blocks from generated source code 
-# fragments. Normal C and C++ comments will always remain visible.
-
-STRIP_CODE_COMMENTS = YES
-
-# If the REFERENCED_BY_RELATION tag is set to YES (the default) 
-# then for each documented function all documented 
-# functions referencing it will be listed.
-
-REFERENCED_BY_RELATION = YES
-
-# If the REFERENCES_RELATION tag is set to YES (the default) 
-# then for each documented function all documented entities 
-# called/used by that function will be listed.
-
-REFERENCES_RELATION = NO
-
-# If the REFERENCES_LINK_SOURCE tag is set to YES (the default)
-# and SOURCE_BROWSER tag is set to YES, then the hyperlinks from
-# functions in REFERENCES_RELATION and REFERENCED_BY_RELATION lists will
-# link to the source code.  Otherwise they will link to the documentstion.
-
-REFERENCES_LINK_SOURCE = YES
-
-# If the USE_HTAGS tag is set to YES then the references to source code 
-# will point to the HTML generated by the htags(1) tool instead of doxygen 
-# built-in source browser. The htags tool is part of GNU's global source 
-# tagging system (see http://www.gnu.org/software/global/global.html). You 
-# will need version 4.8.6 or higher.
-
-USE_HTAGS = NO
-
-# If the VERBATIM_HEADERS tag is set to YES (the default) then Doxygen 
-# will generate a verbatim copy of the header file for each class for 
-# which an include is specified. Set to NO to disable this.
-
-VERBATIM_HEADERS = YES
-
-#---------------------------------------------------------------------------
-# configuration options related to the alphabetical class index
-#---------------------------------------------------------------------------
-
-# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index 
-# of all compounds will be generated. Enable this if the project 
-# contains a lot of classes, structs, unions or interfaces.
-
-ALPHABETICAL_INDEX = YES
-
-# If the alphabetical index is enabled (see ALPHABETICAL_INDEX) then 
-# the COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns 
-# in which this list will be split (can be a number in the range [1..20])
-
-COLS_IN_ALPHA_INDEX = 3
-
-# In case all classes in a project start with a common prefix, all 
-# classes will be put under the same header in the alphabetical index. 
-# The IGNORE_PREFIX tag can be used to specify one or more prefixes that 
-# should be ignored while generating the index headers.
-
-IGNORE_PREFIX = 
-
-#---------------------------------------------------------------------------
-# configuration options related to the HTML output
-#---------------------------------------------------------------------------
-
-# If the GENERATE_HTML tag is set to YES (the default) Doxygen will 
-# generate HTML output.
-
-GENERATE_HTML = YES
-
-# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. 
-# If a relative path is entered the value of OUTPUT_DIRECTORY will be 
-# put in front of it. If left blank `html' will be used as the default path.
-
-HTML_OUTPUT = RoseQtWidgets
-
-# The HTML_FILE_EXTENSION tag can be used to specify the file extension for 
-# each generated HTML page (for example: .htm,.php,.asp). If it is left blank 
-# doxygen will generate files with .html extension.
-
-HTML_FILE_EXTENSION = .html
-
-# The HTML_HEADER tag can be used to specify a personal HTML header for 
-# each generated HTML page. If it is left blank doxygen will generate a 
-# standard header.
-
-HTML_HEADER = 
-
-# The HTML_FOOTER tag can be used to specify a personal HTML footer for 
-# each generated HTML page. If it is left blank doxygen will generate a 
-# standard footer.
-
-HTML_FOOTER = 
-
-# The HTML_STYLESHEET tag can be used to specify a user-defined cascading 
-# style sheet that is used by each HTML page. It can be used to 
-# fine-tune the look of the HTML output. If the tag is left blank doxygen 
-# will generate a default style sheet. Note that doxygen will try to copy 
-# the style sheet file to the HTML output directory, so don't put your own 
-# stylesheet in the HTML output directory as well, or it will be erased!
-
-HTML_STYLESHEET = @top_srcdir@/src/roseExtensions/qtWidgets/doc/doxygen.css
-
-# If the HTML_ALIGN_MEMBERS tag is set to YES, the members of classes, 
-# files or namespaces will be aligned in HTML using tables. If set to 
-# NO a bullet list will be used.
-
-HTML_ALIGN_MEMBERS = YES
-
-# If the GENERATE_HTMLHELP tag is set to YES, additional index files 
-# will be generated that can be used as input for tools like the 
-# Microsoft HTML help workshop to generate a compressed HTML help file (.chm) 
-# of the generated HTML documentation.
-
-GENERATE_HTMLHELP = NO
-
-# If the GENERATE_HTMLHELP tag is set to YES, the CHM_FILE tag can 
-# be used to specify the file name of the resulting .chm file. You 
-# can add a path in front of the file if the result should not be 
-# written to the html output directory.
-
-CHM_FILE = 
-
-# If the GENERATE_HTMLHELP tag is set to YES, the HHC_LOCATION tag can 
-# be used to specify the location (absolute path including file name) of 
-# the HTML help compiler (hhc.exe). If non-empty doxygen will try to run 
-# the HTML help compiler on the generated index.hhp.
-
-HHC_LOCATION = 
-
-# If the GENERATE_HTMLHELP tag is set to YES, the GENERATE_CHI flag 
-# controls if a separate .chi index file is generated (YES) or that 
-# it should be included in the master .chm file (NO).
-
-GENERATE_CHI = NO
-
-# If the GENERATE_HTMLHELP tag is set to YES, the BINARY_TOC flag 
-# controls whether a binary table of contents is generated (YES) or a 
-# normal table of contents (NO) in the .chm file.
-
-BINARY_TOC = NO
-
-# The TOC_EXPAND flag can be set to YES to add extra items for group members 
-# to the contents of the HTML help documentation and to the tree view.
-
-TOC_EXPAND = YES
-
-# The DISABLE_INDEX tag can be used to turn on/off the condensed index at 
-# top of each HTML page. The value NO (the default) enables the index and 
-# the value YES disables it.
-
-DISABLE_INDEX = NO
-
-# This tag can be used to set the number of enum values (range [1..20]) 
-# that doxygen will group on one line in the generated HTML documentation.
-
-ENUM_VALUES_PER_LINE = 4
-
-# If the GENERATE_TREEVIEW tag is set to YES, a side panel will be
-# generated containing a tree-like index structure (just like the one that 
-# is generated for HTML Help). For this to work a browser that supports 
-# JavaScript, DHTML, CSS and frames is required (for instance Mozilla 1.0+, 
-# Netscape 6.0+, Internet explorer 5.0+, or Konqueror). Windows users are 
-# probably better off using the HTML help feature.
-
-GENERATE_TREEVIEW = YES
-
-# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be 
-# used to set the initial width (in pixels) of the frame in which the tree 
-# is shown.
-
-TREEVIEW_WIDTH = 250
-
-#---------------------------------------------------------------------------
-# configuration options related to the LaTeX output
-#---------------------------------------------------------------------------
-
-# If the GENERATE_LATEX tag is set to YES (the default) Doxygen will 
-# generate Latex output.
-
-GENERATE_LATEX = NO
-
-# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. 
-# If a relative path is entered the value of OUTPUT_DIRECTORY will be 
-# put in front of it. If left blank `latex' will be used as the default path.
-
-LATEX_OUTPUT = 
-
-# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be 
-# invoked. If left blank `latex' will be used as the default command name.
-
-LATEX_CMD_NAME = latex
-
-# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to 
-# generate index for LaTeX. If left blank `makeindex' will be used as the 
-# default command name.
-
-MAKEINDEX_CMD_NAME = makeindex
-
-# If the COMPACT_LATEX tag is set to YES Doxygen generates more compact 
-# LaTeX documents. This may be useful for small projects and may help to 
-# save some trees in general.
-
-COMPACT_LATEX = YES
-
-# The PAPER_TYPE tag can be used to set the paper type that is used 
-# by the printer. Possible values are: a4, a4wide, letter, legal and 
-# executive. If left blank a4wide will be used.
-
-PAPER_TYPE = a4wide
-
-# The EXTRA_PACKAGES tag can be to specify one or more names of LaTeX 
-# packages that should be included in the LaTeX output.
-
-EXTRA_PACKAGES = 
-
-# The LATEX_HEADER tag can be used to specify a personal LaTeX header for 
-# the generated latex document. The header should contain everything until 
-# the first chapter. If it is left blank doxygen will generate a 
-# standard header. Notice: only use this tag if you know what you are doing!
-
-LATEX_HEADER = 
-
-# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated 
-# is prepared for conversion to pdf (using ps2pdf). The pdf file will 
-# contain links (just like the HTML output) instead of page references 
-# This makes the output suitable for online browsing using a pdf viewer.
-
-PDF_HYPERLINKS = 
-
-# If the USE_PDFLATEX tag is set to YES, pdflatex will be used instead of 
-# plain latex in the generated Makefile. Set this option to YES to get a 
-# higher quality PDF documentation.
-
-USE_PDFLATEX = YES
-
-# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \\batchmode. 
-# command to the generated LaTeX files. This will instruct LaTeX to keep 
-# running if errors occur, instead of asking the user for help. 
-# This option is also used when generating formulas in HTML.
-
-LATEX_BATCHMODE = NO
-
-# If LATEX_HIDE_INDICES is set to YES then doxygen will not 
-# include the index chapters (such as File Index, Compound Index, etc.) 
-# in the output.
-
-LATEX_HIDE_INDICES = YES
-
-#---------------------------------------------------------------------------
-# configuration options related to the RTF output
-#---------------------------------------------------------------------------
-
-# If the GENERATE_RTF tag is set to YES Doxygen will generate RTF output 
-# The RTF output is optimized for Word 97 and may not look very pretty with 
-# other RTF readers or editors.
-
-GENERATE_RTF = NO
-
-# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. 
-# If a relative path is entered the value of OUTPUT_DIRECTORY will be 
-# put in front of it. If left blank `rtf' will be used as the default path.
-
-RTF_OUTPUT = 
-
-# If the COMPACT_RTF tag is set to YES Doxygen generates more compact 
-# RTF documents. This may be useful for small projects and may help to 
-# save some trees in general.
-
-COMPACT_RTF = NO
-
-# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated 
-# will contain hyperlink fields. The RTF file will 
-# contain links (just like the HTML output) instead of page references. 
-# This makes the output suitable for online browsing using WORD or other 
-# programs which support those fields. 
-# Note: wordpad (write) and others do not support links.
-
-RTF_HYPERLINKS = NO
-
-# Load stylesheet definitions from file. Syntax is similar to doxygen's 
-# config file, i.e. a series of assignments. You only have to provide 
-# replacements, missing definitions are set to their default value.
-
-RTF_STYLESHEET_FILE = 
-
-# Set optional variables used in the generation of an rtf document. 
-# Syntax is similar to doxygen's config file.
-
-RTF_EXTENSIONS_FILE = 
-
-#---------------------------------------------------------------------------
-# configuration options related to the man page output
-#---------------------------------------------------------------------------
-
-# If the GENERATE_MAN tag is set to YES (the default) Doxygen will 
-# generate man pages
-
-GENERATE_MAN = NO
-
-# The MAN_OUTPUT tag is used to specify where the man pages will be put. 
-# If a relative path is entered the value of OUTPUT_DIRECTORY will be 
-# put in front of it. If left blank `man' will be used as the default path.
-
-MAN_OUTPUT = 
-
-# The MAN_EXTENSION tag determines the extension that is added to 
-# the generated man pages (default is the subroutine's section .3)
-
-MAN_EXTENSION = 
-
-# If the MAN_LINKS tag is set to YES and Doxygen generates man output, 
-# then it will generate one additional man file for each entity 
-# documented in the real man page(s). These additional files 
-# only source the real man page, but without them the man command 
-# would be unable to find the correct page. The default is NO.
-
-MAN_LINKS = NO
-
-#---------------------------------------------------------------------------
-# configuration options related to the XML output
-#---------------------------------------------------------------------------
-
-# If the GENERATE_XML tag is set to YES Doxygen will 
-# generate an XML file that captures the structure of 
-# the code including all documentation.
-
-GENERATE_XML = NO
-
-# The XML_OUTPUT tag is used to specify where the XML pages will be put. 
-# If a relative path is entered the value of OUTPUT_DIRECTORY will be 
-# put in front of it. If left blank `xml' will be used as the default path.
-
-XML_OUTPUT = xml
-
-# The XML_SCHEMA tag can be used to specify an XML schema, 
-# which can be used by a validating XML parser to check the 
-# syntax of the XML files.
-
-XML_SCHEMA = 
-
-# The XML_DTD tag can be used to specify an XML DTD, 
-# which can be used by a validating XML parser to check the 
-# syntax of the XML files.
-
-XML_DTD = 
-
-# If the XML_PROGRAMLISTING tag is set to YES Doxygen will 
-# dump the program listings (including syntax highlighting 
-# and cross-referencing information) to the XML output. Note that 
-# enabling this will significantly increase the size of the XML output.
-
-XML_PROGRAMLISTING = YES
-
-#---------------------------------------------------------------------------
-# configuration options for the AutoGen Definitions output
-#---------------------------------------------------------------------------
-
-# If the GENERATE_AUTOGEN_DEF tag is set to YES Doxygen will 
-# generate an AutoGen Definitions (see autogen.sf.net) file 
-# that captures the structure of the code including all 
-# documentation. Note that this feature is still experimental 
-# and incomplete at the moment.
-
-GENERATE_AUTOGEN_DEF = NO
-
-#---------------------------------------------------------------------------
-# configuration options related to the Perl module output
-#---------------------------------------------------------------------------
-
-# If the GENERATE_PERLMOD tag is set to YES Doxygen will 
-# generate a Perl module file that captures the structure of 
-# the code including all documentation. Note that this 
-# feature is still experimental and incomplete at the 
-# moment.
-
-GENERATE_PERLMOD = NO
-
-# If the PERLMOD_LATEX tag is set to YES Doxygen will generate 
-# the necessary Makefile rules, Perl scripts and LaTeX code to be able 
-# to generate PDF and DVI output from the Perl module output.
-
-PERLMOD_LATEX = NO
-
-# If the PERLMOD_PRETTY tag is set to YES the Perl module output will be 
-# nicely formatted so it can be parsed by a human reader.  This is useful 
-# if you want to understand what is going on.  On the other hand, if this 
-# tag is set to NO the size of the Perl module output will be much smaller 
-# and Perl will parse it just the same.
-
-PERLMOD_PRETTY = YES
-
-# The names of the make variables in the generated doxyrules.make file 
-# are prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. 
-# This is useful so different doxyrules.make files included by the same 
-# Makefile don't overwrite each other's variables.
-
-PERLMOD_MAKEVAR_PREFIX = 
-
-#---------------------------------------------------------------------------
-# Configuration options related to the preprocessor   
-#---------------------------------------------------------------------------
-
-# If the ENABLE_PREPROCESSING tag is set to YES (the default) Doxygen will 
-# evaluate all C-preprocessor directives found in the sources and include 
-# files.
-
-ENABLE_PREPROCESSING = YES
-
-# If the MACRO_EXPANSION tag is set to YES Doxygen will expand all macro 
-# names in the source code. If set to NO (the default) only conditional 
-# compilation will be performed. Macro expansion can be done in a controlled 
-# way by setting EXPAND_ONLY_PREDEF to YES.
-
-MACRO_EXPANSION = NO
-
-# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES 
-# then the macro expansion is limited to the macros specified with the 
-# PREDEFINED and EXPAND_AS_DEFINED tags.
-
-EXPAND_ONLY_PREDEF = NO
-
-# If the SEARCH_INCLUDES tag is set to YES (the default) the includes files 
-# in the INCLUDE_PATH (see below) will be search if a #include is found.
-
-SEARCH_INCLUDES = YES
-
-# The INCLUDE_PATH tag can be used to specify one or more directories that 
-# contain include files that are not input files but should be processed by 
-# the preprocessor.
-
-INCLUDE_PATH = 
-
-# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard 
-# patterns (like *.h and *.hpp) to filter out the header-files in the 
-# directories. If left blank, the patterns specified with FILE_PATTERNS will 
-# be used.
-
-INCLUDE_FILE_PATTERNS = 
-
-# The PREDEFINED tag can be used to specify one or more macro names that 
-# are defined before the preprocessor is started (similar to the -D option of 
-# gcc). The argument of the tag is a list of macros of the form: name 
-# or name=definition (no spaces). If the definition and the = are 
-# omitted =1 is assumed. To prevent a macro definition from being 
-# undefined via #undef or recursively expanded use the := operator 
-# instead of the = operator.
-
-PREDEFINED = 
-
-# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then 
-# this tag can be used to specify a list of macro names that should be expanded. 
-# The macro definition that is found in the sources will be used. 
-# Use the PREDEFINED tag if you want to use a different macro definition.
-
-EXPAND_AS_DEFINED = 
-
-# If the SKIP_FUNCTION_MACROS tag is set to YES (the default) then 
-# doxygen's preprocessor will remove all function-like macros that are alone 
-# on a line, have an all uppercase name, and do not end with a semicolon. Such 
-# function macros are typically used for boiler-plate code, and will confuse 
-# the parser if not removed.
-
-SKIP_FUNCTION_MACROS = YES
-
-#---------------------------------------------------------------------------
-# Configuration::additions related to external references   
-#---------------------------------------------------------------------------
-
-# The TAGFILES option can be used to specify one or more tagfiles. 
-# Optionally an initial location of the external documentation 
-# can be added for each tagfile. The format of a tag file without 
-# this location is as follows: 
-#   TAGFILES = file1 file2 ... 
-# Adding location for the tag files is done as follows: 
-#   TAGFILES = file1=loc1 "file2 = loc2" ... 
-# where "loc1" and "loc2" can be relative or absolute paths or 
-# URLs. If a location is present for each tag, the installdox tool 
-# does not have to be run to correct the links.
-# Note that each tag file must have a unique name
-# (where the name does NOT include the path)
-# If a tag file is not located in the directory in which doxygen 
-# is run, you must also specify the path to the tagfile here.
-
-TAGFILES = 
-
-# When a file name is specified after GENERATE_TAGFILE, doxygen will create 
-# a tag file that is based on the input files it reads.
-
-GENERATE_TAGFILE = 
-
-# If the ALLEXTERNALS tag is set to YES all external classes will be listed 
-# in the class index. If set to NO only the inherited external classes 
-# will be listed.
-
-ALLEXTERNALS = NO
-
-# If the EXTERNAL_GROUPS tag is set to YES all external groups will be listed 
-# in the modules index. If set to NO, only the current project's groups will 
-# be listed.
-
-EXTERNAL_GROUPS = YES
-
-# The PERL_PATH should be the absolute path and name of the perl script 
-# interpreter (i.e. the result of `which perl').
-
-PERL_PATH = 
-
-#---------------------------------------------------------------------------
-# Configuration options related to the dot tool   
-#---------------------------------------------------------------------------
-
-# If the CLASS_DIAGRAMS tag is set to YES (the default) Doxygen will 
-# generate a inheritance diagram (in HTML, RTF and LaTeX) for classes with base 
-# or super classes. Setting the tag to NO turns the diagrams off. Note that 
-# this option is superseded by the HAVE_DOT option below. This is only a 
-# fallback. It is recommended to install and use dot, since it yields more 
-# powerful graphs.
-
-CLASS_DIAGRAMS = YES
-
-# You can define message sequence charts within doxygen comments using the \msc 
-# command. Doxygen will then run the mscgen tool (see http://www.mcternan.me.uk/mscgen/) to 
-# produce the chart and insert it in the documentation. The MSCGEN_PATH tag allows you to 
-# specify the directory where the mscgen tool resides. If left empty the tool is assumed to 
-# be found in the default search path.
-
-MSCGEN_PATH = 
-
-# If set to YES, the inheritance and collaboration graphs will hide 
-# inheritance and usage relations if the target is undocumented 
-# or is not a class.
-
-HIDE_UNDOC_RELATIONS = YES
-
-# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is 
-# available from the path. This tool is part of Graphviz, a graph visualization 
-# toolkit from AT&T and Lucent Bell Labs. The other options in this section 
-# have no effect if this option is set to NO (the default)
-
-HAVE_DOT = YES
-
-# If the CLASS_GRAPH and HAVE_DOT tags are set to YES then doxygen 
-# will generate a graph for each documented class showing the direct and 
-# indirect inheritance relations. Setting this tag to YES will force the 
-# the CLASS_DIAGRAMS tag to NO.
-
-CLASS_GRAPH = YES
-
-# If the COLLABORATION_GRAPH and HAVE_DOT tags are set to YES then doxygen 
-# will generate a graph for each documented class showing the direct and 
-# indirect implementation dependencies (inheritance, containment, and 
-# class references variables) of the class with other documented classes.
-
-COLLABORATION_GRAPH = NO
-
-# If the GROUP_GRAPHS and HAVE_DOT tags are set to YES then doxygen 
-# will generate a graph for groups, showing the direct groups dependencies
-
-GROUP_GRAPHS = YES
-
-# If the UML_LOOK tag is set to YES doxygen will generate inheritance and 
-# collaboration diagrams in a style similar to the OMG's Unified Modeling 
-# Language.
-
-UML_LOOK = YES
-
-# If set to YES, the inheritance and collaboration graphs will show the 
-# relations between templates and their instances.
-
-TEMPLATE_RELATIONS = NO
-
-# If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDE_GRAPH, and HAVE_DOT 
-# tags are set to YES then doxygen will generate a graph for each documented 
-# file showing the direct and indirect include dependencies of the file with 
-# other documented files.
-
-INCLUDE_GRAPH = YES
-
-# If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDED_BY_GRAPH, and 
-# HAVE_DOT tags are set to YES then doxygen will generate a graph for each 
-# documented header file showing the documented files that directly or 
-# indirectly include this file.
-
-INCLUDED_BY_GRAPH = YES
-
-# If the CALL_GRAPH and HAVE_DOT tags are set to YES then doxygen will 
-# generate a call dependency graph for every global function or class method. 
-# Note that enabling this option will significantly increase the time of a run. 
-# So in most cases it will be better to enable call graphs for selected 
-# functions only using the \callgraph command.
-
-CALL_GRAPH = YES
-
-# If the CALLER_GRAPH and HAVE_DOT tags are set to YES then doxygen will 
-# generate a caller dependency graph for every global function or class method. 
-# Note that enabling this option will significantly increase the time of a run. 
-# So in most cases it will be better to enable caller graphs for selected 
-# functions only using the \callergraph command.
-
-CALLER_GRAPH = YES
-
-# If the GRAPHICAL_HIERARCHY and HAVE_DOT tags are set to YES then doxygen 
-# will graphical hierarchy of all classes instead of a textual one.
-
-GRAPHICAL_HIERARCHY = YES
-
-# If the DIRECTORY_GRAPH, SHOW_DIRECTORIES and HAVE_DOT tags are set to YES 
-# then doxygen will show the dependencies a directory has on other directories 
-# in a graphical way. The dependency relations are determined by the #include
-# relations between the files in the directories.
-
-DIRECTORY_GRAPH = YES
-
-# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images 
-# generated by dot. Possible values are png, jpg, or gif
-# If left blank png will be used.
-
-DOT_IMAGE_FORMAT = png
-
-# The tag DOT_PATH can be used to specify the path where the dot tool can be 
-# found. If left blank, it is assumed the dot tool can be found in the path.
-
-DOT_PATH = 
-
-# The DOTFILE_DIRS tag can be used to specify one or more directories that 
-# contain dot files that are included in the documentation (see the 
-# \dotfile command).
-
-DOTFILE_DIRS = 
-
-# The MAX_DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of 
-# nodes that will be shown in the graph. If the number of nodes in a graph 
-# becomes larger than this value, doxygen will truncate the graph, which is 
-# visualized by representing a node as a red box. Note that doxygen will always 
-# show the root nodes and its direct children regardless of this setting.
-
-DOT_GRAPH_MAX_NODES = 50
-
-# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent 
-# background. This is disabled by default, which results in a white background. 
-# Warning: Depending on the platform used, enabling this option may lead to 
-# badly anti-aliased labels on the edges of a graph (i.e. they become hard to 
-# read).
-
-DOT_TRANSPARENT = YES
-
-# Set the DOT_MULTI_TARGETS tag to YES allow dot to generate multiple output 
-# files in one run (i.e. multiple -o and -T options on the command line). This 
-# makes dot run faster, but since only newer versions of dot (>1.8.10) 
-# support this, this feature is disabled by default.
-
-DOT_MULTI_TARGETS = NO
-
-# If the GENERATE_LEGEND tag is set to YES (the default) Doxygen will 
-# generate a legend page explaining the meaning of the various boxes and 
-# arrows in the dot generated graphs.
-
-GENERATE_LEGEND = YES
-
-# If the DOT_CLEANUP tag is set to YES (the default) Doxygen will 
-# remove the intermediate dot files that are used to generate 
-# the various graphs.
-
-DOT_CLEANUP = YES
-
-#---------------------------------------------------------------------------
-# Configuration::additions related to the search engine   
-#---------------------------------------------------------------------------
-
-# The SEARCHENGINE tag specifies whether or not a search engine should be 
-# used. If set to NO the values of all tags below this one will be ignored.
-
-SEARCHENGINE = NO
diff --git a/docs/Rose/rose_exam_1.tex b/docs/Rose/rose_exam_1.tex
index d9ace189275..fbd860f2df0 100644
--- a/docs/Rose/rose_exam_1.tex
+++ b/docs/Rose/rose_exam_1.tex
@@ -93,25 +93,6 @@ \subsection{Function Detection}
 
 
 
-% *******************************************************
-%               Binary Code Transformation
-% *******************************************************
-\section{Binary Code Transformations}
-   This subsection tests your ability to rewrite parts of the binary
-AST and regenerate the binary.  Note that depending on the transformation
-the resulting binary may or may not be executable.
-
-\subsection{NOP Translation}
-   Rewrite sequences of single byte x86 NOP instructions to use the newer 
-Intel x86 multi-byte NOP instructions.  Verify that the resulting binary 
-is executable. Use only the space provided by the sequence of single byte NOP 
-instructions else your generated executable will may not run properly.
-{\em Hint: replace each instruction with the appropriate NOP instruction 
-using the build interface function to NOP construction.}
-
-
-
-
 \commentout{
 Start using:
 \begin{verbatim}
diff --git a/docs/Rose/sage.cfg.in b/docs/Rose/sage.cfg.in
index 5cbaf8e018d..62cabd32556 100644
--- a/docs/Rose/sage.cfg.in
+++ b/docs/Rose/sage.cfg.in
@@ -1,1063 +1,2624 @@
-# *************************************************************************
-# The sage.cfg file is generated using autoconf configure:
-#        <sourcetree>/docs/Rose/sage.cfg.in ---> <buildtree>/docs/Rose/sage.cfg
-# Only the <sourcetree>/docs/Rose/sage.cfg.in file should be modified.
-# *************************************************************************
-
-# Doxyfile 1.3-rc1
+# Doxyfile 1.9.1
 
 # This file describes the settings to be used by the documentation system
-# doxygen (www.doxygen.org) for a project
+# doxygen (www.doxygen.org) for a project.
+#
+# All text after a double hash (##) is considered a comment and is placed in
+# front of the TAG it is preceding.
 #
-# All text after a hash (#) is considered a comment and will be ignored
+# All text after a single hash (#) is considered a comment and will be ignored.
 # The format is:
-#       TAG = value [value, ...]
-# For lists items can also be appended using:
-#       TAG += value [value, ...]
-# Values that contain spaces should be placed between quotes (" ")
+# TAG = value [value, ...]
+# For lists, items can also be appended using:
+# TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (\" \").
 
 #---------------------------------------------------------------------------
-# General configuration options
+# Project related configuration options
 #---------------------------------------------------------------------------
 
-# The PROJECT_NAME tag is a single word (or a sequence of words surrounded 
-# by quotes) that should identify the project.
+# This tag specifies the encoding used for all characters in the configuration
+# file that follow. The default is UTF-8 which is also the encoding used for all
+# text before the first occurrence of this tag. Doxygen uses libiconv (or the
+# iconv built into libc) for the transcoding. See
+# https://www.gnu.org/software/libiconv/ for the list of possible encodings.
+# The default value is: UTF-8.
+
+DOXYFILE_ENCODING      = UTF-8
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
+# double-quotes, unless you are using Doxywizard) that should identify the
+# project for which the documentation is generated. This name is used in the
+# title of most generated pages and in a few other places.
+# The default value is: My Project.
 
-# PROJECT_NAME           = "SAGE III: Intermediate Program Representation"
 PROJECT_NAME           = "SAGE III"
 
-# The PROJECT_NUMBER tag can be used to enter a project or revision number. 
-# This could be handy for archiving the generated documentation or 
-# if some version control system is used.
+# The PROJECT_NUMBER tag can be used to enter a project or revision number. This
+# could be handy for archiving the generated documentation or if some version
+# control system is used.
 
-# PROJECT_NUMBER         = 
 PROJECT_NUMBER         = @VERSION@
 
-# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) 
-# base path where the generated documentation will be put. 
-# If a relative path is entered, it will be relative to the location 
-# where doxygen was started. If left blank the current directory will be used.
+# Using the PROJECT_BRIEF tag one can provide an optional one line description
+# for a project that appears at the top of each page and should give viewer a
+# quick idea about the purpose of the project. Keep the description short.
+
+PROJECT_BRIEF          =
+
+# With the PROJECT_LOGO tag one can specify a logo or an icon that is included
+# in the documentation. The maximum height of the logo should not exceed 55
+# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy
+# the logo to the output directory.
+
+PROJECT_LOGO           =
+
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path
+# into which the generated documentation will be written. If a relative path is
+# entered, it will be relative to the location where doxygen was started. If
+# left blank the current directory will be used.
 
 OUTPUT_DIRECTORY       = SageIntermediateForm
 
-# The OUTPUT_LANGUAGE tag is used to specify the language in which all 
-# documentation generated by doxygen is written. Doxygen will use this 
-# information to generate all constant output in the proper language. 
-# The default language is English, other supported languages are: 
-# Brazilian, Catalan, Chinese, Chinese-Traditional, Croatian, Czech, Danish, Dutch, 
-# Finnish, French, German, Greek, Hungarian, Italian, Japanese, Japanese-en 
-# (Japanese with english messages), Korean, Norwegian, Polish, Portuguese, 
-# Romanian, Russian, Serbian, Slovak, Slovene, Spanish, Swedish and Ukrainian.
+# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub-
+# directories (in 2 levels) under the output directory of each output format and
+# will distribute the generated files over these directories. Enabling this
+# option can be useful when feeding doxygen a huge amount of source files, where
+# putting all generated files in the same directory would otherwise causes
+# performance problems for the file system.
+# The default value is: NO.
+
+CREATE_SUBDIRS         = NO
+
+# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII
+# characters to appear in the names of generated files. If set to NO, non-ASCII
+# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode
+# U+3044.
+# The default value is: NO.
+
+ALLOW_UNICODE_NAMES    = NO
+
+# The OUTPUT_LANGUAGE tag is used to specify the language in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all constant output in the proper language.
+# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,
+# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),
+# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,
+# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),
+# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,
+# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,
+# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,
+# Ukrainian and Vietnamese.
+# The default value is: English.
 
 OUTPUT_LANGUAGE        = English
 
-# If the EXTRACT_ALL tag is set to YES doxygen will assume all entities in 
-# documentation are documented, even if no documentation was available. 
-# Private class members and static file members will be hidden unless 
-# the EXTRACT_PRIVATE and EXTRACT_STATIC tags are set to YES
+# The OUTPUT_TEXT_DIRECTION tag is used to specify the direction in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all generated output in the proper direction.
+# Possible values are: None, LTR, RTL and Context.
+# The default value is: None.
 
-#EXTRACT_ALL            = NO
-EXTRACT_ALL            = @DOXYGEN_EXTRACT_ALL@
+OUTPUT_TEXT_DIRECTION  = None
 
-# If the EXTRACT_PRIVATE tag is set to YES all private members of a class 
-# will be included in the documentation.
+# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member
+# descriptions after the members that are listed in the file and class
+# documentation (similar to Javadoc). Set to NO to disable this.
+# The default value is: YES.
 
-#EXTRACT_PRIVATE        = NO
-EXTRACT_PRIVATE        = @DOXYGEN_EXTRACT_PRIVATE@
+BRIEF_MEMBER_DESC      = YES
 
-# If the EXTRACT_STATIC tag is set to YES all static members of a file 
-# will be included in the documentation.
+# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief
+# description of a member or function before the detailed description
+#
+# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
+# brief descriptions will be completely suppressed.
+# The default value is: YES.
 
-#EXTRACT_STATIC         = NO
-EXTRACT_STATIC         = @DOXYGEN_EXTRACT_STATIC@
+REPEAT_BRIEF           = YES
 
-# If the EXTRACT_LOCAL_CLASSES tag is set to YES classes (and structs) 
-# defined locally in source files will be included in the documentation. 
-# If set to NO only classes defined in header files are included.
+# This tag implements a quasi-intelligent brief description abbreviator that is
+# used to form the text in various listings. Each string in this list, if found
+# as the leading text of the brief description, will be stripped from the text
+# and the result, after processing the whole list, is used as the annotated
+# text. Otherwise, the brief description is used as-is. If left blank, the
+# following values are used ($name is automatically replaced with the name of
+# the entity):The $name class, The $name widget, The $name file, is, provides,
+# specifies, contains, represents, a, an and the.
+
+ABBREVIATE_BRIEF       = "The $name class" \
+                         "The $name widget" \
+                         "The $name file" \
+                         is \
+                         provides \
+                         specifies \
+                         contains \
+                         represents \
+                         a \
+                         an \
+                         the
+
+# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
+# doxygen will generate a detailed section even if there is only a brief
+# description.
+# The default value is: NO.
 
-EXTRACT_LOCAL_CLASSES  = YES
+ALWAYS_DETAILED_SEC    = NO
 
-# If the HIDE_UNDOC_MEMBERS tag is set to YES, Doxygen will hide all 
-# undocumented members of documented classes, files or namespaces. 
-# If set to NO (the default) these members will be included in the 
-# various overviews, but no documentation section is generated. 
-# This option has no effect if EXTRACT_ALL is enabled.
+# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
+# inherited members of a class in the documentation of that class as if those
+# members were ordinary class members. Constructors, destructors and assignment
+# operators of the base classes will not be shown.
+# The default value is: NO.
 
-#HIDE_UNDOC_MEMBERS     = NO
-HIDE_UNDOC_MEMBERS     = @DOXYGEN_HIDE_UNDOC_MEMBERS@
+INLINE_INHERITED_MEMB  = NO
 
-# If the HIDE_UNDOC_CLASSES tag is set to YES, Doxygen will hide all 
-# undocumented classes that are normally visible in the class hierarchy. 
-# If set to NO (the default) these class will be included in the various 
-# overviews. This option has no effect if EXTRACT_ALL is enabled.
+# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path
+# before files name in the file list and in the header files. If set to NO the
+# shortest path that makes the file name unique will be used
+# The default value is: YES.
 
-#HIDE_UNDOC_CLASSES     = NO
-HIDE_UNDOC_CLASSES     = @DOXYGEN_HIDE_UNDOC_CLASSES@
+FULL_PATH_NAMES        = NO
 
-# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, Doxygen will hide all 
-# friend (class|struct|union) declarations. 
-# If set to NO (the default) these declarations will be included in the 
-# documentation.
+# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.
+# Stripping is only done if one of the specified strings matches the left-hand
+# part of the path. The tag can be used to show relative paths in the file list.
+# If left blank the directory from which doxygen is run is used as the path to
+# strip.
+#
+# Note that you can specify absolute paths here, but also relative paths, which
+# will be relative from the directory where doxygen is started.
+# This tag requires that the tag FULL_PATH_NAMES is set to YES.
 
-#HIDE_FRIEND_COMPOUNDS  = NO
-HIDE_FRIEND_COMPOUNDS  = @DOXYGEN_HIDE_FRIEND_COMPOUNDS@
+STRIP_FROM_PATH        =
 
-# If the HIDE_IN_BODY_DOCS tag is set to YES, Doxygen will hide any 
-# documentation blocks found inside the body of a function. 
-# If set to NO (the default) these blocks will be appended to the 
-# function's detailed documentation block.
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the
+# path mentioned in the documentation of a class, which tells the reader which
+# header file to include in order to use a class. If left blank only the name of
+# the header file containing the class definition is used. Otherwise one should
+# specify the list of include paths that are normally passed to the compiler
+# using the -I flag.
 
-HIDE_IN_BODY_DOCS      = NO
+STRIP_FROM_INC_PATH    =
 
-# If the BRIEF_MEMBER_DESC tag is set to YES (the default) Doxygen will 
-# include brief member descriptions after the members that are listed in 
-# the file and class documentation (similar to JavaDoc). 
-# Set to NO to disable this.
+# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but
+# less readable) file names. This can be useful is your file systems doesn't
+# support long names like on DOS, Mac, or CD-ROM.
+# The default value is: NO.
 
-BRIEF_MEMBER_DESC      = YES
+SHORT_NAMES            = NO
 
-# If the REPEAT_BRIEF tag is set to YES (the default) Doxygen will prepend 
-# the brief description of a member or function before the detailed description. 
-# Note: if both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the 
-# brief descriptions will be completely suppressed.
+# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the
+# first line (until the first dot) of a Javadoc-style comment as the brief
+# description. If set to NO, the Javadoc-style will behave just like regular Qt-
+# style comments (thus requiring an explicit @brief command for a brief
+# description.)
+# The default value is: NO.
 
-REPEAT_BRIEF           = YES
+JAVADOC_AUTOBRIEF      = NO
 
-# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then 
-# Doxygen will generate a detailed section even if there is only a brief 
-# description.
+# If the JAVADOC_BANNER tag is set to YES then doxygen will interpret a line
+# such as
+# /***************
+# as being the beginning of a Javadoc-style comment "banner". If set to NO, the
+# Javadoc-style will behave just like regular comments and it will not be
+# interpreted by doxygen.
+# The default value is: NO.
+
+JAVADOC_BANNER         = NO
+
+# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first
+# line (until the first dot) of a Qt-style comment as the brief description. If
+# set to NO, the Qt-style will behave just like regular Qt-style comments (thus
+# requiring an explicit \brief command for a brief description.)
+# The default value is: NO.
+
+QT_AUTOBRIEF           = NO
+
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a
+# multi-line C++ special comment block (i.e. a block of //! or /// comments) as
+# a brief description. This used to be the default behavior. The new default is
+# to treat a multi-line C++ comment block as a detailed description. Set this
+# tag to YES if you prefer the old behavior instead.
+#
+# Note that setting this tag to YES also means that rational rose comments are
+# not recognized any more.
+# The default value is: NO.
 
-ALWAYS_DETAILED_SEC    = NO
+MULTILINE_CPP_IS_BRIEF = NO
 
-# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all inherited 
-# members of a class in the documentation of that class as if those members were 
-# ordinary class members. Constructors, destructors and assignment operators of 
-# the base classes will not be shown.
+# By default Python docstrings are displayed as preformatted text and doxygen's
+# special commands cannot be used. By setting PYTHON_DOCSTRING to NO the
+# doxygen's special commands can be used and the contents of the docstring
+# documentation blocks is shown as doxygen documentation.
+# The default value is: YES.
 
-INLINE_INHERITED_MEMB  = NO
-#INLINE_INHERITED_MEMB  = YES
+PYTHON_DOCSTRING       = YES
 
-# If the FULL_PATH_NAMES tag is set to YES then Doxygen will prepend the full 
-# path before files name in the file list and in the header files. If set 
-# to NO the shortest path that makes the file name unique will be used.
+# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the
+# documentation from any documented member that it re-implements.
+# The default value is: YES.
 
-FULL_PATH_NAMES        = NO
+INHERIT_DOCS           = YES
 
-# If the FULL_PATH_NAMES tag is set to YES then the STRIP_FROM_PATH tag 
-# can be used to strip a user defined part of the path. Stripping is 
-# only done if one of the specified strings matches the left-hand part of 
-# the path. It is allowed to use relative paths in the argument list.
+# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new
+# page for each member. If set to NO, the documentation of a member will be part
+# of the file/class/namespace that contains it.
+# The default value is: NO.
 
-STRIP_FROM_PATH        = 
+SEPARATE_MEMBER_PAGES  = NO
 
-# The INTERNAL_DOCS tag determines if documentation 
-# that is typed after a \internal command is included. If the tag is set 
-# to NO (the default) then the documentation will be excluded. 
-# Set it to YES to include the internal documentation.
+# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen
+# uses this value to replace tabs by spaces in code fragments.
+# Minimum value: 1, maximum value: 16, default value: 4.
 
-# INTERNAL_DOCS          = NO
-INTERNAL_DOCS          = @DOXYGEN_INTERNAL_DOCS@
+TAB_SIZE               = 8
 
-# If the CASE_SENSE_NAMES tag is set to NO then Doxygen will only generate 
-# file names in lower case letters. If set to YES upper case letters are also 
-# allowed. This is useful if you have classes or files whose names only differ 
-# in case and if your file system supports case sensitive file names. Windows 
-# users are adviced to set this option to NO.
+# This tag can be used to specify a number of aliases that act as commands in
+# the documentation. An alias has the form:
+# name=value
+# For example adding
+# "sideeffect=@par Side Effects:\n"
+# will allow you to put the command \sideeffect (or @sideeffect) in the
+# documentation, which will result in a user-defined paragraph with heading
+# "Side Effects:". You can put \n's in the value part of an alias to insert
+# newlines (in the resulting output). You can put ^^ in the value part of an
+# alias to insert a newline as if a physical newline was in the original file.
+# When you need a literal { or } or , in the value part of an alias you have to
+# escape them by means of a backslash (\), this can lead to conflicts with the
+# commands \{ and \} for these it is advised to use the version @{ and @} or use
+# a double escape (\\{ and \\})
+
+ALIASES                =
+
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
+# only. Doxygen will then generate output that is more tailored for C. For
+# instance, some of the names that are used will be different. The list of all
+# members will be omitted, etc.
+# The default value is: NO.
 
-CASE_SENSE_NAMES       = YES
+OPTIMIZE_OUTPUT_FOR_C  = NO
 
-# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter 
-# (but less readable) file names. This can be useful is your file systems 
-# doesn't support long names like on DOS, Mac, or CD-ROM.
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or
+# Python sources only. Doxygen will then generate output that is more tailored
+# for that language. For instance, namespaces will be presented as packages,
+# qualified scopes will look different, etc.
+# The default value is: NO.
 
-SHORT_NAMES            = NO
+OPTIMIZE_OUTPUT_JAVA   = NO
 
-# If the HIDE_SCOPE_NAMES tag is set to NO (the default) then Doxygen 
-# will show members with their full class and namespace scopes in the 
-# documentation. If set to YES the scope will be hidden.
+# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
+# sources. Doxygen will then generate output that is tailored for Fortran.
+# The default value is: NO.
+
+OPTIMIZE_FOR_FORTRAN   = NO
+
+# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
+# sources. Doxygen will then generate output that is tailored for VHDL.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_VHDL   = NO
+
+# Set the OPTIMIZE_OUTPUT_SLICE tag to YES if your project consists of Slice
+# sources only. Doxygen will then generate output that is more tailored for that
+# language. For instance, namespaces will be presented as modules, types will be
+# separated into more groups, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_SLICE  = NO
+
+# Doxygen selects the parser to use depending on the extension of the files it
+# parses. With this tag you can assign which parser to use for a given
+# extension. Doxygen has a built-in mapping, but you can override or extend it
+# using this tag. The format is ext=language, where ext is a file extension, and
+# language is one of the parsers supported by doxygen: IDL, Java, JavaScript,
+# Csharp (C#), C, C++, D, PHP, md (Markdown), Objective-C, Python, Slice, VHDL,
+# Fortran (fixed format Fortran: FortranFixed, free formatted Fortran:
+# FortranFree, unknown formatted Fortran: Fortran. In the later case the parser
+# tries to guess whether the code is fixed or free formatted code, this is the
+# default for Fortran type files). For instance to make doxygen treat .inc files
+# as Fortran files (default is PHP), and .f files as C (default is Fortran),
+# use: inc=Fortran f=C.
+#
+# Note: For files without extension you can use no_extension as a placeholder.
+#
+# Note that for custom extensions you also need to set FILE_PATTERNS otherwise
+# the files are not read by doxygen. When specifying no_extension you should add
+# * to the FILE_PATTERNS.
+#
+# Note see also the list of default file extension mappings.
+
+EXTENSION_MAPPING      =
+
+# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
+# according to the Markdown format, which allows for more readable
+# documentation. See https://daringfireball.net/projects/markdown/ for details.
+# The output of markdown processing is further processed by doxygen, so you can
+# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
+# case of backward compatibilities issues.
+# The default value is: YES.
+
+MARKDOWN_SUPPORT       = YES
+
+# When the TOC_INCLUDE_HEADINGS tag is set to a non-zero value, all headings up
+# to that level are automatically included in the table of contents, even if
+# they do not have an id attribute.
+# Note: This feature currently applies only to Markdown headings.
+# Minimum value: 0, maximum value: 99, default value: 5.
+# This tag requires that the tag MARKDOWN_SUPPORT is set to YES.
+
+TOC_INCLUDE_HEADINGS   = 5
+
+# When enabled doxygen tries to link words that correspond to documented
+# classes, or namespaces to their corresponding documentation. Such a link can
+# be prevented in individual cases by putting a % sign in front of the word or
+# globally by setting AUTOLINK_SUPPORT to NO.
+# The default value is: YES.
+
+AUTOLINK_SUPPORT       = YES
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
+# to include (a tag file for) the STL sources as input, then you should set this
+# tag to YES in order to let doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string);
+# versus func(std::string) {}). This also make the inheritance and collaboration
+# diagrams that involve STL classes more complete and accurate.
+# The default value is: NO.
+
+BUILTIN_STL_SUPPORT    = NO
+
+# If you use Microsoft's C++/CLI language, you should set this option to YES to
+# enable parsing support.
+# The default value is: NO.
+
+CPP_CLI_SUPPORT        = NO
+
+# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
+# https://www.riverbankcomputing.com/software/sip/intro) sources only. Doxygen
+# will parse them like normal C++ but will assume all classes use public instead
+# of private inheritance when no explicit protection keyword is present.
+# The default value is: NO.
+
+SIP_SUPPORT            = NO
+
+# For Microsoft's IDL there are propget and propput attributes to indicate
+# getter and setter methods for a property. Setting this option to YES will make
+# doxygen to replace the get and set methods by a property in the documentation.
+# This will only work if the methods are indeed getting or setting a simple
+# type. If this is not the case, or you want to show the methods anyway, you
+# should set this option to NO.
+# The default value is: YES.
+
+IDL_PROPERTY_SUPPORT   = YES
+
+# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
+# tag is set to YES then doxygen will reuse the documentation of the first
+# member in the group (if any) for the other members of the group. By default
+# all members of a group must be documented explicitly.
+# The default value is: NO.
 
-HIDE_SCOPE_NAMES       = NO
+DISTRIBUTE_GROUP_DOC   = NO
 
-# If the VERBATIM_HEADERS tag is set to YES (the default) then Doxygen 
-# will generate a verbatim copy of the header file for each class for 
-# which an include is specified. Set to NO to disable this.
+# If one adds a struct or class to a group and this option is enabled, then also
+# any nested class or struct is added to the same group. By default this option
+# is disabled and one has to add nested compounds explicitly via \ingroup.
+# The default value is: NO.
 
-VERBATIM_HEADERS       = YES
+GROUP_NESTED_COMPOUNDS = NO
 
-# If the SHOW_INCLUDE_FILES tag is set to YES (the default) then Doxygen 
-# will put list of the files that are included by a file in the documentation 
-# of that file.
+# Set the SUBGROUPING tag to YES to allow class member groups of the same type
+# (for instance a group of public functions) to be put as a subgroup of that
+# type (e.g. under the Public Functions section). Set it to NO to prevent
+# subgrouping. Alternatively, this can be done per class using the
+# \nosubgrouping command.
+# The default value is: YES.
 
-SHOW_INCLUDE_FILES     = YES
+SUBGROUPING            = YES
 
-# If the JAVADOC_AUTOBRIEF tag is set to YES then Doxygen 
-# will interpret the first line (until the first dot) of a JavaDoc-style 
-# comment as the brief description. If set to NO, the JavaDoc 
-# comments  will behave just like the Qt-style comments (thus requiring an 
-# explict @brief command for a brief description.
+# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions
+# are shown inside the group in which they are included (e.g. using \ingroup)
+# instead of on a separate page (for HTML and Man pages) or section (for LaTeX
+# and RTF).
+#
+# Note that this feature does not work in combination with
+# SEPARATE_MEMBER_PAGES.
+# The default value is: NO.
+
+INLINE_GROUPED_CLASSES = NO
+
+# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions
+# with only public data fields or simple typedef fields will be shown inline in
+# the documentation of the scope in which they are defined (i.e. file,
+# namespace, or group documentation), provided this scope is documented. If set
+# to NO, structs, classes, and unions are shown on a separate page (for HTML and
+# Man pages) or section (for LaTeX and RTF).
+# The default value is: NO.
+
+INLINE_SIMPLE_STRUCTS  = NO
+
+# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or
+# enum is documented as struct, union, or enum with the name of the typedef. So
+# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
+# with name TypeT. When disabled the typedef will appear as a member of a file,
+# namespace, or class. And the struct will be named TypeS. This can typically be
+# useful for C code in case the coding convention dictates that all compound
+# types are typedef'ed and only the typedef is referenced, never the tag name.
+# The default value is: NO.
+
+TYPEDEF_HIDES_STRUCT   = NO
+
+# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This
+# cache is used to resolve symbols given their name and scope. Since this can be
+# an expensive process and often the same symbol appears multiple times in the
+# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small
+# doxygen will become slower. If the cache is too large, memory is wasted. The
+# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range
+# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536
+# symbols. At the end of a run doxygen will report the cache usage and suggest
+# the optimal cache size from a speed point of view.
+# Minimum value: 0, maximum value: 9, default value: 0.
+
+LOOKUP_CACHE_SIZE      = 0
+
+# The NUM_PROC_THREADS specifies the number threads doxygen is allowed to use
+# during processing. When set to 0 doxygen will based this on the number of
+# cores available in the system. You can set it explicitly to a value larger
+# than 0 to get more control over the balance between CPU load and processing
+# speed. At this moment only the input processing can be done using multiple
+# threads. Since this is still an experimental feature the default is set to 1,
+# which efficively disables parallel processing. Please report any issues you
+# encounter. Generating dot graphs in parallel is controlled by the
+# DOT_NUM_THREADS setting.
+# Minimum value: 0, maximum value: 32, default value: 1.
+
+NUM_PROC_THREADS       = 1
 
-JAVADOC_AUTOBRIEF      = NO
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
 
-# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make Doxygen 
-# treat a multi-line C++ special comment block (i.e. a block of //! or /// 
-# comments) as a brief description. This used to be the default behaviour. 
-# The new default is to treat a multi-line C++ comment block as a detailed 
-# description. Set this tag to YES if you prefer the old behaviour instead.
+# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in
+# documentation are documented, even if no documentation was available. Private
+# class members and static file members will be hidden unless the
+# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.
+# Note: This will also disable the warnings about undocumented members that are
+# normally produced when WARNINGS is set to YES.
+# The default value is: NO.
 
-MULTILINE_CPP_IS_BRIEF = NO
+EXTRACT_ALL            = @DOXYGEN_EXTRACT_ALL@
+
+# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will
+# be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIVATE        = @DOXYGEN_EXTRACT_PRIVATE@
+
+# If the EXTRACT_PRIV_VIRTUAL tag is set to YES, documented private virtual
+# methods of a class will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIV_VIRTUAL   = NO
+
+# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal
+# scope will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PACKAGE        = NO
+
+# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be
+# included in the documentation.
+# The default value is: NO.
+
+EXTRACT_STATIC         = @DOXYGEN_EXTRACT_STATIC@
+
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined
+# locally in source files will be included in the documentation. If set to NO,
+# only classes defined in header files are included. Does not have any effect
+# for Java sources.
+# The default value is: YES.
+
+EXTRACT_LOCAL_CLASSES  = YES
+
+# This flag is only useful for Objective-C code. If set to YES, local methods,
+# which are defined in the implementation section but not in the interface are
+# included in the documentation. If set to NO, only methods in the interface are
+# included.
+# The default value is: NO.
 
-# If the DETAILS_AT_TOP tag is set to YES then Doxygen 
-# will output the detailed description near the top, like JavaDoc.
-# If set to NO, the detailed description appears after the member 
+EXTRACT_LOCAL_METHODS  = NO
+
+# If this flag is set to YES, the members of anonymous namespaces will be
+# extracted and appear in the documentation as a namespace called
+# 'anonymous_namespace{file}', where file will be replaced with the base name of
+# the file that contains the anonymous namespace. By default anonymous namespace
+# are hidden.
+# The default value is: NO.
+
+EXTRACT_ANON_NSPACES   = NO
+
+# If this flag is set to YES, the name of an unnamed parameter in a declaration
+# will be determined by the corresponding definition. By default unnamed
+# parameters remain unnamed in the output.
+# The default value is: YES.
+
+RESOLVE_UNNAMED_PARAMS = YES
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all
+# undocumented members inside documented classes or files. If set to NO these
+# members will be included in the various overviews, but no documentation
+# section is generated. This option has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_MEMBERS     = @DOXYGEN_HIDE_UNDOC_MEMBERS@
+
+# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all
+# undocumented classes that are normally visible in the class hierarchy. If set
+# to NO, these classes will be included in the various overviews. This option
+# has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_CLASSES     = @DOXYGEN_HIDE_UNDOC_CLASSES@
+
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend
+# declarations. If set to NO, these declarations will be included in the
 # documentation.
+# The default value is: NO.
 
-# DETAILS_AT_TOP         = NO
-DETAILS_AT_TOP         = YES
+HIDE_FRIEND_COMPOUNDS  = @DOXYGEN_HIDE_FRIEND_COMPOUNDS@
 
-# If the INHERIT_DOCS tag is set to YES (the default) then an undocumented 
-# member inherits the documentation from any documented member that it 
-# reimplements.
+# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any
+# documentation blocks found inside the body of a function. If set to NO, these
+# blocks will be appended to the function's detailed documentation block.
+# The default value is: NO.
 
-INHERIT_DOCS           = YES
+HIDE_IN_BODY_DOCS      = NO
 
-# If the INLINE_INFO tag is set to YES (the default) then a tag [inline] 
-# is inserted in the documentation for inline members.
+# The INTERNAL_DOCS tag determines if documentation that is typed after a
+# \internal command is included. If the tag is set to NO then the documentation
+# will be excluded. Set it to YES to include the internal documentation.
+# The default value is: NO.
 
-INLINE_INFO            = YES
+INTERNAL_DOCS          = @DOXYGEN_INTERNAL_DOCS@
 
-# If the SORT_MEMBER_DOCS tag is set to YES (the default) then doxygen 
-# will sort the (detailed) documentation of file and class members 
-# alphabetically by member name. If set to NO the members will appear in 
-# declaration order.
+# With the correct setting of option CASE_SENSE_NAMES doxygen will better be
+# able to match the capabilities of the underlying filesystem. In case the
+# filesystem is case sensitive (i.e. it supports files in the same directory
+# whose names only differ in casing), the option must be set to YES to properly
+# deal with such files in case they appear in the input. For filesystems that
+# are not case sensitive the option should be be set to NO to properly deal with
+# output files written for symbols that only differ in casing, such as for two
+# classes, one named CLASS and the other named Class, and to also support
+# references to files without having to specify the exact matching casing. On
+# Windows (including Cygwin) and MacOS, users should typically set this option
+# to NO, whereas on Linux or other Unix flavors it should typically be set to
+# YES.
+# The default value is: system dependent.
 
-SORT_MEMBER_DOCS       = NO
+CASE_SENSE_NAMES       = YES
 
-# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC 
-# tag is set to YES, then doxygen will reuse the documentation of the first 
-# member in the group (if any) for the other members of the group. By default 
-# all members of a group must be documented explicitly.
+# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with
+# their full class and namespace scopes in the documentation. If set to YES, the
+# scope will be hidden.
+# The default value is: NO.
 
-DISTRIBUTE_GROUP_DOC   = NO
+HIDE_SCOPE_NAMES       = NO
 
-# The TAB_SIZE tag can be used to set the number of spaces in a tab. 
-# Doxygen uses this value to replace tabs by spaces in code fragments.
+# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will
+# append additional text to a page's title, such as Class Reference. If set to
+# YES the compound reference will be hidden.
+# The default value is: NO.
 
-TAB_SIZE               = 8
+HIDE_COMPOUND_REFERENCE= NO
+
+# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of
+# the files that are included by a file in the documentation of that file.
+# The default value is: YES.
+
+SHOW_INCLUDE_FILES     = YES
+
+# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each
+# grouped member an include statement to the documentation, telling the reader
+# which file to include in order to use the member.
+# The default value is: NO.
+
+SHOW_GROUPED_MEMB_INC  = NO
 
-# The GENERATE_TODOLIST tag can be used to enable (YES) or 
-# disable (NO) the todo list. This list is created by putting \todo 
-# commands in the documentation.
+# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include
+# files with double quotes in the documentation rather than with sharp brackets.
+# The default value is: NO.
+
+FORCE_LOCAL_INCLUDES   = NO
+
+# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the
+# documentation for inline members.
+# The default value is: YES.
+
+INLINE_INFO            = YES
+
+# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the
+# (detailed) documentation of file and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order.
+# The default value is: YES.
+
+SORT_MEMBER_DOCS       = NO
+
+# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief
+# descriptions of file, namespace and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order. Note that
+# this will also influence the order of the classes in the class list.
+# The default value is: NO.
+
+SORT_BRIEF_DOCS        = NO
+
+# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the
+# (brief and detailed) documentation of class members so that constructors and
+# destructors are listed first. If set to NO the constructors will appear in the
+# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.
+# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief
+# member documentation.
+# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting
+# detailed member documentation.
+# The default value is: NO.
+
+SORT_MEMBERS_CTORS_1ST = NO
+
+# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy
+# of group names into alphabetical order. If set to NO the group names will
+# appear in their defined order.
+# The default value is: NO.
+
+SORT_GROUP_NAMES       = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by
+# fully-qualified names, including namespaces. If set to NO, the class list will
+# be sorted only by class name, not including the namespace part.
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
+# Note: This option applies only to the class list, not to the alphabetical
+# list.
+# The default value is: NO.
+
+SORT_BY_SCOPE_NAME     = NO
+
+# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper
+# type resolution of all parameters of a function it will reject a match between
+# the prototype and the implementation of a member function even if there is
+# only one candidate or it is obvious which candidate to choose by doing a
+# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still
+# accept a match between prototype and implementation in such cases.
+# The default value is: NO.
+
+STRICT_PROTO_MATCHING  = NO
+
+# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo
+# list. This list is created by putting \todo commands in the documentation.
+# The default value is: YES.
 
 GENERATE_TODOLIST      = YES
 
-# The GENERATE_TESTLIST tag can be used to enable (YES) or 
-# disable (NO) the test list. This list is created by putting \test 
-# commands in the documentation.
+# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test
+# list. This list is created by putting \test commands in the documentation.
+# The default value is: YES.
 
 GENERATE_TESTLIST      = YES
 
-# The GENERATE_BUGLIST tag can be used to enable (YES) or 
-# disable (NO) the bug list. This list is created by putting \bug 
-# commands in the documentation.
+# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug
+# list. This list is created by putting \bug commands in the documentation.
+# The default value is: YES.
 
 GENERATE_BUGLIST       = YES
 
-# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or 
-# disable (NO) the deprecated list. This list is created by putting 
-# \deprecated commands in the documentation.
+# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)
+# the deprecated list. This list is created by putting \deprecated commands in
+# the documentation.
+# The default value is: YES.
 
 GENERATE_DEPRECATEDLIST= YES
 
-# This tag can be used to specify a number of aliases that acts 
-# as commands in the documentation. An alias has the form "name=value". 
-# For example adding "sideeffect=\par Side Effects:\n" will allow you to 
-# put the command \sideeffect (or @sideeffect) in the documentation, which 
-# will result in a user defined paragraph with heading "Side Effects:". 
-# You can put \n's in the value part of an alias to insert newlines.
-
-ALIASES                = 
+# The ENABLED_SECTIONS tag can be used to enable conditional documentation
+# sections, marked by \if <section_label> ... \endif and \cond <section_label>
+# ... \endcond blocks.
 
-# The ENABLED_SECTIONS tag can be used to enable conditional 
-# documentation sections, marked by \if sectionname ... \endif.
-
-# ENABLED_SECTIONS       = 
-# ENABLED_SECTIONS       = documentUserVersionUsingDoxygen
-# ENABLED_SECTIONS       = documentDevelopmentVersionUsingDoxygen
 ENABLED_SECTIONS       = @DOXYGEN_ENABLED_SECTIONS@
 
-# The MAX_INITIALIZER_LINES tag determines the maximum number of lines 
-# the initial value of a variable or define consist of for it to appear in 
-# the documentation. If the initializer consists of more lines than specified 
-# here it will be hidden. Use a value of 0 to hide initializers completely. 
-# The appearance of the initializer of individual variables and defines in the 
-# documentation can be controlled using \showinitializer or \hideinitializer 
-# command in the documentation regardless of this setting.
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the
+# initial value of a variable or macro / define can have for it to appear in the
+# documentation. If the initializer consists of more lines than specified here
+# it will be hidden. Use a value of 0 to hide initializers completely. The
+# appearance of the value of individual variables and macros / defines can be
+# controlled using \showinitializer or \hideinitializer command in the
+# documentation regardless of this setting.
+# Minimum value: 0, maximum value: 10000, default value: 30.
 
 MAX_INITIALIZER_LINES  = 30
 
-# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources 
-# only. Doxygen will then generate output that is more tailored for C. 
-# For instance some of the names that are used will be different. The list 
-# of all members will be omitted, etc.
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at
+# the bottom of the documentation of classes and structs. If set to YES, the
+# list will mention the files that were used to generate the documentation.
+# The default value is: YES.
 
-OPTIMIZE_OUTPUT_FOR_C  = NO
+SHOW_USED_FILES        = YES
 
-# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java sources 
-# only. Doxygen will then generate output that is more tailored for Java. 
-# For instance namespaces will be presented as packages, qualified scopes 
-# will look different, etc.
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This
+# will remove the Files entry from the Quick Index and from the Folder Tree View
+# (if specified).
+# The default value is: YES.
 
-OPTIMIZE_OUTPUT_JAVA   = NO
+SHOW_FILES             = YES
 
-# Set the SHOW_USED_FILES tag to NO to disable the list of files generated 
-# at the bottom of the documentation of classes and structs. If set to YES the 
-# list will mention the files that were used to generate the documentation.
+# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces
+# page. This will remove the Namespaces entry from the Quick Index and from the
+# Folder Tree View (if specified).
+# The default value is: YES.
 
-SHOW_USED_FILES        = YES
+SHOW_NAMESPACES        = YES
+
+# The FILE_VERSION_FILTER tag can be used to specify a program or script that
+# doxygen should invoke to get the current version for each file (typically from
+# the version control system). Doxygen will invoke the program by executing (via
+# popen()) the command command input-file, where command is the value of the
+# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided
+# by doxygen. Whatever the program writes to standard output is used as the file
+# version. For an example see the documentation.
+
+FILE_VERSION_FILTER    =
+
+# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
+# by doxygen. The layout file controls the global structure of the generated
+# output files in an output format independent way. To create the layout file
+# that represents doxygen's defaults, run doxygen with the -l option. You can
+# optionally specify a file name after the option, if omitted DoxygenLayout.xml
+# will be used as the name of the layout file.
+#
+# Note that if you run doxygen from a directory containing a file called
+# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE
+# tag is left empty.
+
+LAYOUT_FILE            =
+
+# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
+# the reference definitions. This must be a list of .bib files. The .bib
+# extension is automatically appended if omitted. This requires the bibtex tool
+# to be installed. See also https://en.wikipedia.org/wiki/BibTeX for more info.
+# For LaTeX the style of the bibliography can be controlled using
+# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
+# search path. See also \cite for info how to create references.
+
+CITE_BIB_FILES         =
 
 #---------------------------------------------------------------------------
-# configuration options related to warning and progress messages
+# Configuration options related to warning and progress messages
 #---------------------------------------------------------------------------
 
-# The QUIET tag can be used to turn on/off the messages that are generated 
-# by doxygen. Possible values are YES and NO. If left blank NO is used.
+# The QUIET tag can be used to turn on/off the messages that are generated to
+# standard output by doxygen. If QUIET is set to YES this implies that the
+# messages are off.
+# The default value is: NO.
 
 QUIET                  = NO
 
-# The WARNINGS tag can be used to turn on/off the warning messages that are 
-# generated by doxygen. Possible values are YES and NO. If left blank 
-# NO is used.
+# The WARNINGS tag can be used to turn on/off the warning messages that are
+# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES
+# this implies that the warnings are on.
+#
+# Tip: Turn warnings on while writing the documentation.
+# The default value is: YES.
 
 WARNINGS               = YES
 
-# If WARN_IF_UNDOCUMENTED is set to YES, then doxygen will generate warnings 
-# for undocumented members. If EXTRACT_ALL is set to YES then this flag will 
-# automatically be disabled.
+# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate
+# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag
+# will automatically be disabled.
+# The default value is: YES.
 
 WARN_IF_UNDOCUMENTED   = YES
 
-# The WARN_FORMAT tag determines the format of the warning messages that 
-# doxygen can produce. The string should contain the $file, $line, and $text 
-# tags, which will be replaced by the file and line number from which the 
-# warning originated and the warning text.
+# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for
+# potential errors in the documentation, such as not documenting some parameters
+# in a documented function, or documenting parameters that don't exist or using
+# markup commands wrongly.
+# The default value is: YES.
+
+WARN_IF_DOC_ERROR      = YES
+
+# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that
+# are documented, but have no documentation for their parameters or return
+# value. If set to NO, doxygen will only warn about wrong or incomplete
+# parameter documentation, but not about the absence of documentation. If
+# EXTRACT_ALL is set to YES then this flag will automatically be disabled.
+# The default value is: NO.
+
+WARN_NO_PARAMDOC       = NO
+
+# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when
+# a warning is encountered. If the WARN_AS_ERROR tag is set to FAIL_ON_WARNINGS
+# then doxygen will continue running as if WARN_AS_ERROR tag is set to NO, but
+# at the end of the doxygen process doxygen will return with a non-zero status.
+# Possible values are: NO, YES and FAIL_ON_WARNINGS.
+# The default value is: NO.
+
+WARN_AS_ERROR          = NO
+
+# The WARN_FORMAT tag determines the format of the warning messages that doxygen
+# can produce. The string should contain the $file, $line, and $text tags, which
+# will be replaced by the file and line number from which the warning originated
+# and the warning text. Optionally the format may contain $version, which will
+# be replaced by the version of the file (if it could be obtained via
+# FILE_VERSION_FILTER)
+# The default value is: $file:$line: $text.
 
 WARN_FORMAT            = "$file:$line: $text"
 
-# The WARN_LOGFILE tag can be used to specify a file to which warning 
-# and error messages should be written. If left blank the output is written 
-# to stderr.
+# The WARN_LOGFILE tag can be used to specify a file to which warning and error
+# messages should be written. If left blank the output is written to standard
+# error (stderr).
 
-WARN_LOGFILE           = 
+WARN_LOGFILE           =
 
 #---------------------------------------------------------------------------
-# configuration options related to the input files
+# Configuration options related to the input files
 #---------------------------------------------------------------------------
 
-# The INPUT tag can be used to specify the files and/or directories that contain 
-# documented source files. You may enter file names like "myfile.cpp" or 
-# directories like "/usr/src/myproject". Separate the files or directories 
-# with spaces.
+# The INPUT tag is used to specify the files and/or directories that contain
+# documented source files. You may enter file names like myfile.cpp or
+# directories like /usr/src/myproject. Separate the files or directories with
+# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING
+# Note: If this tag is empty the current directory is searched.
 
-# INPUT                  = 
 INPUT                  = @top_pwd@/src/frontend/SageIII \
                          @top_srcdir@/src/frontend/SageIII
 
-# If the value of the INPUT tag contains directories, you can use the 
-# FILE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp 
-# and *.h) to filter out the source-files in the directories. If left 
-# blank the following patterns are tested: 
-# *.c *.cc *.cxx *.cpp *.c++ *.java *.ii *.ixx *.ipp *.i++ *.inl *.h *.hh *.hxx *.hpp 
-# *.h++ *.idl *.odl
+# This tag can be used to specify the character encoding of the source files
+# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
+# libiconv (or the iconv built into libc) for the transcoding. See the libiconv
+# documentation (see:
+# https://www.gnu.org/software/libiconv/) for the list of possible encodings.
+# The default value is: UTF-8.
 
-# Must list *.h explicitly to have header files be read
-# FILE_PATTERNS          = *.h *.C *.docs
-# Skip the C++ *.C files to speed up the processing.
-FILE_PATTERNS          = *.h *.docs
+INPUT_ENCODING         = UTF-8
 
-# The RECURSIVE tag can be used to turn specify whether or not subdirectories 
-# should be searched for input files as well. Possible values are YES and NO. 
-# If left blank NO is used.
+# If the value of the INPUT tag contains directories, you can use the
+# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and
+# *.h) to filter out the source-files in the directories.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# read by doxygen.
+#
+# Note the list of default checked file patterns might differ from the list of
+# default file extension mappings.
+#
+# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,
+# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,
+# *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc,
+# *.m, *.markdown, *.md, *.mm, *.dox (to be provided as doxygen C comment),
+# *.py, *.pyw, *.f90, *.f95, *.f03, *.f08, *.f18, *.f, *.for, *.vhd, *.vhdl,
+# *.ucf, *.qsf and *.ice.
+
+FILE_PATTERNS          = *.h \
+                         *.docs
+
+# The RECURSIVE tag can be used to specify whether or not subdirectories should
+# be searched for input files as well.
+# The default value is: NO.
 
 RECURSIVE              = NO
 
-# The EXCLUDE tag can be used to specify files and/or directories that should 
-# excluded from the INPUT source files. This way you can easily exclude a 
+# The EXCLUDE tag can be used to specify files and/or directories that should be
+# excluded from the INPUT source files. This way you can easily exclude a
 # subdirectory from a directory tree whose root is specified with the INPUT tag.
+#
+# Note that relative paths are relative to the directory from which doxygen is
+# run.
 
-EXCLUDE                = 
+EXCLUDE                =
 
-# The EXCLUDE_SYMLINKS tag can be used select whether or not files or directories 
-# that are symbolic links (a Unix filesystem feature) are excluded from the input.
+# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
+# directories that are symbolic links (a Unix file system feature) are excluded
+# from the input.
+# The default value is: NO.
 
 EXCLUDE_SYMLINKS       = NO
 
-# If the value of the INPUT tag contains directories, you can use the 
-# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude 
+# If the value of the INPUT tag contains directories, you can use the
+# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
 # certain files from those directories.
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories for example use the pattern */test/*
+
+EXCLUDE_PATTERNS       =
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
+# (namespaces, classes, functions, etc.) that should be excluded from the
+# output. The symbol name can be a fully qualified name, a word, or if the
+# wildcard * is used, a substring. Examples: ANamespace, AClass,
+# AClass::ANamespace, ANamespace::*Test
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories use the pattern */test/*
 
-EXCLUDE_PATTERNS       = 
+EXCLUDE_SYMBOLS        =
 
-# The EXAMPLE_PATH tag can be used to specify one or more files or 
-# directories that contain example code fragments that are included (see 
-# the \include command).
+# The EXAMPLE_PATH tag can be used to specify one or more files or directories
+# that contain example code fragments that are included (see the \include
+# command).
 
-EXAMPLE_PATH           = 
+EXAMPLE_PATH           =
 
-# If the value of the EXAMPLE_PATH tag contains directories, you can use the 
-# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp 
-# and *.h) to filter out the source-files in the directories. If left 
-# blank all files are included.
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
+# *.h) to filter out the source-files in the directories. If left blank all
+# files are included.
 
-EXAMPLE_PATTERNS       = 
+EXAMPLE_PATTERNS       =
 
-# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be 
-# searched for input files to be used with the \include or \dontinclude 
-# commands irrespective of the value of the RECURSIVE tag. 
-# Possible values are YES and NO. If left blank NO is used.
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
+# searched for input files to be used with the \include or \dontinclude commands
+# irrespective of the value of the RECURSIVE tag.
+# The default value is: NO.
 
 EXAMPLE_RECURSIVE      = NO
 
-# The IMAGE_PATH tag can be used to specify one or more files or 
-# directories that contain image that are included in the documentation (see 
-# the \image command).
+# The IMAGE_PATH tag can be used to specify one or more files or directories
+# that contain images that are to be included in the documentation (see the
+# \image command).
 
-IMAGE_PATH             = 
+IMAGE_PATH             =
 
-# The INPUT_FILTER tag can be used to specify a program that doxygen should 
-# invoke to filter for each input file. Doxygen will invoke the filter program 
-# by executing (via popen()) the command <filter> <input-file>, where <filter> 
-# is the value of the INPUT_FILTER tag, and <input-file> is the name of an 
-# input file. Doxygen will then use the output that the filter program writes 
-# to standard output.
+# The INPUT_FILTER tag can be used to specify a program that doxygen should
+# invoke to filter for each input file. Doxygen will invoke the filter program
+# by executing (via popen()) the command:
+#
+# <filter> <input-file>
+#
+# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the
+# name of an input file. Doxygen will then use the output that the filter
+# program writes to standard output. If FILTER_PATTERNS is specified, this tag
+# will be ignored.
+#
+# Note that the filter must not add or remove lines; it is applied before the
+# code is scanned, but not when the output code is generated. If lines are added
+# or removed, the anchors will not be placed correctly.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+INPUT_FILTER           =
+
+# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
+# basis. Doxygen will compare the file name with each pattern and apply the
+# filter if there is a match. The filters are a list of the form: pattern=filter
+# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how
+# filters are used. If the FILTER_PATTERNS tag is empty or if none of the
+# patterns match the file name, INPUT_FILTER is applied.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
 
-INPUT_FILTER           = 
+FILTER_PATTERNS        =
 
-# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using 
-# INPUT_FILTER) will be used to filter the input files when producing source 
-# files to browse (i.e. when SOURCE_BROWSER is set to YES).
+# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
+# INPUT_FILTER) will also be used to filter the input files that are used for
+# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).
+# The default value is: NO.
 
 FILTER_SOURCE_FILES    = NO
 
+# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
+# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and
+# it is also possible to disable source filtering for a specific pattern using
+# *.ext= (so without naming a filter).
+# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.
+
+FILTER_SOURCE_PATTERNS =
+
+# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that
+# is part of the input, its contents will be placed on the main page
+# (index.html). This can be useful if you have a project on for instance GitHub
+# and want to reuse the introduction page also for the doxygen output.
+
+USE_MDFILE_AS_MAINPAGE =
+
 #---------------------------------------------------------------------------
-# configuration options related to source browsing
+# Configuration options related to source browsing
 #---------------------------------------------------------------------------
 
-# If the SOURCE_BROWSER tag is set to YES then a list of source files will 
-# be generated. Documented entities will be cross-referenced with these sources.
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will be
+# generated. Documented entities will be cross-referenced with these sources.
+#
+# Note: To get rid of all source code in the generated output, make sure that
+# also VERBATIM_HEADERS is set to NO.
+# The default value is: NO.
 
 SOURCE_BROWSER         = NO
 
-# Setting the INLINE_SOURCES tag to YES will include the body 
-# of functions and classes directly in the documentation.
+# Setting the INLINE_SOURCES tag to YES will include the body of functions,
+# classes and enums directly into the documentation.
+# The default value is: NO.
 
 INLINE_SOURCES         = NO
 
-# Setting the STRIP_CODE_COMMENTS tag to YES (the default) will instruct 
-# doxygen to hide any special comment blocks from generated source code 
-# fragments. Normal C and C++ comments will always remain visible.
+# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any
+# special comment blocks from generated source code fragments. Normal C, C++ and
+# Fortran comments will always remain visible.
+# The default value is: YES.
 
 STRIP_CODE_COMMENTS    = YES
 
-# If the REFERENCED_BY_RELATION tag is set to YES (the default) 
-# then for each documented function all documented 
-# functions referencing it will be listed.
+# If the REFERENCED_BY_RELATION tag is set to YES then for each documented
+# entity all documented functions referencing it will be listed.
+# The default value is: NO.
 
 REFERENCED_BY_RELATION = YES
 
-# If the REFERENCES_RELATION tag is set to YES (the default) 
-# then for each documented function all documented entities 
-# called/used by that function will be listed.
+# If the REFERENCES_RELATION tag is set to YES then for each documented function
+# all documented entities called/used by that function will be listed.
+# The default value is: NO.
 
 REFERENCES_RELATION    = YES
 
+# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set
+# to YES then the hyperlinks from functions in REFERENCES_RELATION and
+# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will
+# link to the documentation.
+# The default value is: YES.
+
+REFERENCES_LINK_SOURCE = YES
+
+# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the
+# source code will show a tooltip with additional information such as prototype,
+# brief description and links to the definition and documentation. Since this
+# will make the HTML file larger and loading of large files a bit slower, you
+# can opt to disable this feature.
+# The default value is: YES.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+SOURCE_TOOLTIPS        = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code will
+# point to the HTML generated by the htags(1) tool instead of doxygen built-in
+# source browser. The htags tool is part of GNU's global source tagging system
+# (see https://www.gnu.org/software/global/global.html). You will need version
+# 4.8.6 or higher.
+#
+# To use it do the following:
+# - Install the latest version of global
+# - Enable SOURCE_BROWSER and USE_HTAGS in the configuration file
+# - Make sure the INPUT points to the root of the source tree
+# - Run doxygen as normal
+#
+# Doxygen will invoke htags (and that will in turn invoke gtags), so these
+# tools must be available from the command line (i.e. in the search path).
+#
+# The result: instead of the source browser generated by doxygen, the links to
+# source code will now point to the output of htags.
+# The default value is: NO.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+USE_HTAGS              = NO
+
+# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a
+# verbatim copy of the header file for each class for which an include is
+# specified. Set to NO to disable this.
+# See also: Section \class.
+# The default value is: YES.
+
+VERBATIM_HEADERS       = YES
+
+# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the
+# clang parser (see:
+# http://clang.llvm.org/) for more accurate parsing at the cost of reduced
+# performance. This can be particularly helpful with template rich C++ code for
+# which doxygen's built-in parser lacks the necessary type information.
+# Note: The availability of this option depends on whether or not doxygen was
+# generated with the -Duse_libclang=ON option for CMake.
+# The default value is: NO.
+
+CLANG_ASSISTED_PARSING = NO
+
+# If clang assisted parsing is enabled and the CLANG_ADD_INC_PATHS tag is set to
+# YES then doxygen will add the directory of each input to the include path.
+# The default value is: YES.
+
+CLANG_ADD_INC_PATHS    = YES
+
+# If clang assisted parsing is enabled you can provide the compiler with command
+# line options that you would normally use when invoking the compiler. Note that
+# the include paths will already be set by doxygen for the files and directories
+# specified with INPUT and INCLUDE_PATH.
+# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.
+
+CLANG_OPTIONS          =
+
+# If clang assisted parsing is enabled you can provide the clang parser with the
+# path to the directory containing a file called compile_commands.json. This
+# file is the compilation database (see:
+# http://clang.llvm.org/docs/HowToSetupToolingForLLVM.html) containing the
+# options used when the source files were built. This is equivalent to
+# specifying the -p option to a clang tool, such as clang-check. These options
+# will then be passed to the parser. Any options specified with CLANG_OPTIONS
+# will be added as well.
+# Note: The availability of this option depends on whether or not doxygen was
+# generated with the -Duse_libclang=ON option for CMake.
+
+CLANG_DATABASE_PATH    =
+
 #---------------------------------------------------------------------------
-# configuration options related to the alphabetical class index
+# Configuration options related to the alphabetical class index
 #---------------------------------------------------------------------------
 
-# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index 
-# of all compounds will be generated. Enable this if the project 
-# contains a lot of classes, structs, unions or interfaces.
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all
+# compounds will be generated. Enable this if the project contains a lot of
+# classes, structs, unions or interfaces.
+# The default value is: YES.
 
 ALPHABETICAL_INDEX     = NO
 
-# If the alphabetical index is enabled (see ALPHABETICAL_INDEX) then 
-# the COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns 
-# in which this list will be split (can be a number in the range [1..20])
-
-COLS_IN_ALPHA_INDEX    = 5
+# In case all classes in a project start with a common prefix, all classes will
+# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag
+# can be used to specify a prefix (or a list of prefixes) that should be ignored
+# while generating the index headers.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
 
-# In case all classes in a project start with a common prefix, all 
-# classes will be put under the same header in the alphabetical index. 
-# The IGNORE_PREFIX tag can be used to specify one or more prefixes that 
-# should be ignored while generating the index headers.
-
-IGNORE_PREFIX          = 
+IGNORE_PREFIX          =
 
 #---------------------------------------------------------------------------
-# configuration options related to the HTML output
+# Configuration options related to the HTML output
 #---------------------------------------------------------------------------
 
-# If the GENERATE_HTML tag is set to YES (the default) Doxygen will 
-# generate HTML output.
+# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output
+# The default value is: YES.
 
 GENERATE_HTML          = YES
 
-# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. 
-# If a relative path is entered the value of OUTPUT_DIRECTORY will be 
-# put in front of it. If left blank `html' will be used as the default path.
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
 
 HTML_OUTPUT            = html
 
-# The HTML_FILE_EXTENSION tag can be used to specify the file extension for 
-# each generated HTML page (for example: .htm,.php,.asp). If it is left blank 
-# doxygen will generate files with .html extension.
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each
+# generated HTML page (for example: .htm, .php, .asp).
+# The default value is: .html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
 
 HTML_FILE_EXTENSION    = .html
 
-# The HTML_HEADER tag can be used to specify a personal HTML header for 
-# each generated HTML page. If it is left blank doxygen will generate a 
+# The HTML_HEADER tag can be used to specify a user-defined HTML header file for
+# each generated HTML page. If the tag is left blank doxygen will generate a
 # standard header.
+#
+# To get valid HTML the header file that includes any scripts and style sheets
+# that doxygen needs, which is dependent on the configuration options used (e.g.
+# the setting GENERATE_TREEVIEW). It is highly recommended to start with a
+# default header using
+# doxygen -w html new_header.html new_footer.html new_stylesheet.css
+# YourConfigFile
+# and then modify the file new_header.html. See also section "Doxygen usage"
+# for information on how to generate the default header that doxygen normally
+# uses.
+# Note: The header is subject to change so you typically have to regenerate the
+# default header when upgrading to a newer version of doxygen. For a description
+# of the possible markers and block names see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_HEADER            =
+
+# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
+# generated HTML page. If the tag is left blank doxygen will generate a standard
+# footer. See HTML_HEADER for more information on how to generate a default
+# footer and what special commands can be used inside the footer. See also
+# section "Doxygen usage" for information on how to generate the default footer
+# that doxygen normally uses.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FOOTER            =
+
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style
+# sheet that is used by each HTML page. It can be used to fine-tune the look of
+# the HTML output. If left blank doxygen will generate a default style sheet.
+# See also section "Doxygen usage" for information on how to generate the style
+# sheet that doxygen normally uses.
+# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as
+# it is more robust and this tag (HTML_STYLESHEET) will in the future become
+# obsolete.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_STYLESHEET        =
+
+# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# cascading style sheets that are included after the standard style sheets
+# created by doxygen. Using this option one can overrule certain style aspects.
+# This is preferred over using HTML_STYLESHEET since it does not replace the
+# standard style sheet and is therefore more robust against future updates.
+# Doxygen will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list). For an example see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_STYLESHEET  =
+
+# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the HTML output directory. Note
+# that these files will be copied to the base HTML output directory. Use the
+# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
+# files. In the HTML_STYLESHEET file, use the file name only. Also note that the
+# files will be copied as-is; there are no commands or markers available.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_FILES       =
+
+# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
+# will adjust the colors in the style sheet and background images according to
+# this color. Hue is specified as an angle on a colorwheel, see
+# https://en.wikipedia.org/wiki/Hue for more information. For instance the value
+# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
+# purple, and 360 is red again.
+# Minimum value: 0, maximum value: 359, default value: 220.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_HUE    = 220
+
+# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors
+# in the HTML output. For a value of 0 the output will use grayscales only. A
+# value of 255 will produce the most vivid colors.
+# Minimum value: 0, maximum value: 255, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_SAT    = 100
+
+# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the
+# luminance component of the colors in the HTML output. Values below 100
+# gradually make the output lighter, whereas values above 100 make the output
+# darker. The value divided by 100 is the actual gamma applied, so 80 represents
+# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not
+# change the gamma.
+# Minimum value: 40, maximum value: 240, default value: 80.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_GAMMA  = 80
+
+# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
+# page will contain the date and time when the page was generated. Setting this
+# to YES can help to show when doxygen was last run and thus if the
+# documentation is up to date.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_TIMESTAMP         = NO
+
+# If the HTML_DYNAMIC_MENUS tag is set to YES then the generated HTML
+# documentation will contain a main index with vertical navigation menus that
+# are dynamically created via JavaScript. If disabled, the navigation index will
+# consists of multiple levels of tabs that are statically embedded in every HTML
+# page. Disable this option to support browsers that do not have JavaScript,
+# like the Qt help browser.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_MENUS     = YES
+
+# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
+# documentation will contain sections that can be hidden and shown after the
+# page has loaded.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_SECTIONS  = NO
+
+# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries
+# shown in the various tree structured indices initially; the user can expand
+# and collapse entries dynamically later on. Doxygen will expand the tree to
+# such a level that at most the specified number of entries are visible (unless
+# a fully collapsed tree already exceeds this amount). So setting the number of
+# entries 1 will produce a full collapsed tree by default. 0 is a special value
+# representing an infinite number of entries and will result in a full expanded
+# tree by default.
+# Minimum value: 0, maximum value: 9999, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_INDEX_NUM_ENTRIES = 100
+
+# If the GENERATE_DOCSET tag is set to YES, additional index files will be
+# generated that can be used as input for Apple's Xcode 3 integrated development
+# environment (see:
+# https://developer.apple.com/xcode/), introduced with OSX 10.5 (Leopard). To
+# create a documentation set, doxygen will generate a Makefile in the HTML
+# output directory. Running make will produce the docset in that directory and
+# running make install will install the docset in
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at
+# startup. See https://developer.apple.com/library/archive/featuredarticles/Doxy
+# genXcode/_index.html for more information.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_DOCSET        = NO
+
+# This tag determines the name of the docset feed. A documentation feed provides
+# an umbrella under which multiple documentation sets from a single provider
+# (such as a company or product suite) can be grouped.
+# The default value is: Doxygen generated docs.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_FEEDNAME        = "Doxygen generated docs"
+
+# This tag specifies a string that should uniquely identify the documentation
+# set bundle. This should be a reverse domain-name style string, e.g.
+# com.mycompany.MyDocSet. Doxygen will append .docset to the name.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_BUNDLE_ID       = org.doxygen.Project
+
+# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify
+# the documentation publisher. This should be a reverse domain-name style
+# string, e.g. com.mycompany.MyDocSet.documentation.
+# The default value is: org.doxygen.Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_ID    = org.doxygen.Publisher
+
+# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.
+# The default value is: Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_NAME  = Publisher
+
+# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three
+# additional HTML index files: index.hhp, index.hhc, and index.hhk. The
+# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
+# (see:
+# https://www.microsoft.com/en-us/download/details.aspx?id=21138) on Windows.
+#
+# The HTML Help Workshop contains a compiler that can convert all HTML output
+# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML
+# files are now used as the Windows 98 help format, and will replace the old
+# Windows help format (.hlp) on all Windows platforms in the future. Compressed
+# HTML files also contain an index, a table of contents, and you can search for
+# words in the documentation. The HTML workshop also contains a viewer for
+# compressed HTML files.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
 
-HTML_HEADER            = 
+GENERATE_HTMLHELP      = NO
 
-# The HTML_FOOTER tag can be used to specify a personal HTML footer for 
-# each generated HTML page. If it is left blank doxygen will generate a 
-# standard footer.
+# The CHM_FILE tag can be used to specify the file name of the resulting .chm
+# file. You can add a path in front of the file if the result should not be
+# written to the html output directory.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
 
-HTML_FOOTER            = 
+CHM_FILE               =
 
-# The HTML_STYLESHEET tag can be used to specify a user defined cascading 
-# style sheet that is used by each HTML page. It can be used to 
-# fine-tune the look of the HTML output. If the tag is left blank doxygen 
-# will generate a default style sheet
+# The HHC_LOCATION tag can be used to specify the location (absolute path
+# including file name) of the HTML help compiler (hhc.exe). If non-empty,
+# doxygen will try to run the HTML help compiler on the generated index.hhp.
+# The file has to be specified with full path.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
 
-HTML_STYLESHEET        = 
+HHC_LOCATION           =
 
-# If the HTML_ALIGN_MEMBERS tag is set to YES, the members of classes, 
-# files or namespaces will be aligned in HTML using tables. If set to 
-# NO a bullet list will be used.
+# The GENERATE_CHI flag controls if a separate .chi index file is generated
+# (YES) or that it should be included in the main .chm file (NO).
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
 
-HTML_ALIGN_MEMBERS     = YES
+GENERATE_CHI           = NO
 
-# If the GENERATE_HTMLHELP tag is set to YES, additional index files 
-# will be generated that can be used as input for tools like the 
-# Microsoft HTML help workshop to generate a compressed HTML help file (.chm) 
-# of the generated HTML documentation.
+# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)
+# and project file content.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
 
-GENERATE_HTMLHELP      = NO
+CHM_INDEX_ENCODING     =
 
-# If the GENERATE_HTMLHELP tag is set to YES, the CHM_FILE tag can 
-# be used to specify the file name of the resulting .chm file. You 
-# can add a path in front of the file if the result should not be 
-# written to the html output dir.
+# The BINARY_TOC flag controls whether a binary table of contents is generated
+# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it
+# enables the Previous and Next buttons.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
 
-CHM_FILE               = 
+BINARY_TOC             = NO
 
-# If the GENERATE_HTMLHELP tag is set to YES, the HHC_LOCATION tag can 
-# be used to specify the location (absolute path including file name) of 
-# the HTML help compiler (hhc.exe). If non empty doxygen will try to run 
-# the html help compiler on the generated index.hhp.
+# The TOC_EXPAND flag can be set to YES to add extra items for group members to
+# the table of contents of the HTML help documentation and to the tree view.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
 
-HHC_LOCATION           = 
+TOC_EXPAND             = NO
 
-# If the GENERATE_HTMLHELP tag is set to YES, the GENERATE_CHI flag 
-# controls if a separate .chi index file is generated (YES) or that 
-# it should be included in the master .chm file (NO).
+# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
+# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that
+# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help
+# (.qch) of the generated HTML documentation.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_QHP           = NO
+
+# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify
+# the file name of the resulting .qch file. The path specified is relative to
+# the HTML output folder.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QCH_FILE               =
+
+# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
+# Project output. For more information please see Qt Help Project / Namespace
+# (see:
+# https://doc.qt.io/archives/qt-4.8/qthelpproject.html#namespace).
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_NAMESPACE          = org.doxygen.Project
+
+# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
+# Help Project output. For more information please see Qt Help Project / Virtual
+# Folders (see:
+# https://doc.qt.io/archives/qt-4.8/qthelpproject.html#virtual-folders).
+# The default value is: doc.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_VIRTUAL_FOLDER     = doc
+
+# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
+# filter to add. For more information please see Qt Help Project / Custom
+# Filters (see:
+# https://doc.qt.io/archives/qt-4.8/qthelpproject.html#custom-filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_NAME   =
+
+# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
+# custom filter to add. For more information please see Qt Help Project / Custom
+# Filters (see:
+# https://doc.qt.io/archives/qt-4.8/qthelpproject.html#custom-filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_ATTRS  =
+
+# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
+# project's filter section matches. Qt Help Project / Filter Attributes (see:
+# https://doc.qt.io/archives/qt-4.8/qthelpproject.html#filter-attributes).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_SECT_FILTER_ATTRS  =
+
+# The QHG_LOCATION tag can be used to specify the location (absolute path
+# including file name) of Qt's qhelpgenerator. If non-empty doxygen will try to
+# run qhelpgenerator on the generated .qhp file.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHG_LOCATION           =
+
+# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be
+# generated, together with the HTML files, they form an Eclipse help plugin. To
+# install this plugin and make it available under the help contents menu in
+# Eclipse, the contents of the directory containing the HTML and XML files needs
+# to be copied into the plugins directory of eclipse. The name of the directory
+# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.
+# After copying Eclipse needs to be restarted before the help appears.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_ECLIPSEHELP   = NO
+
+# A unique identifier for the Eclipse help plugin. When installing the plugin
+# the directory name containing the HTML and XML files should also have this
+# name. Each documentation set should have its own identifier.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.
+
+ECLIPSE_DOC_ID         = org.doxygen.Project
+
+# If you want full control over the layout of the generated HTML pages it might
+# be necessary to disable the index and replace it with your own. The
+# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top
+# of each HTML page. A value of NO enables the index and the value YES disables
+# it. Since the tabs in the index contain the same information as the navigation
+# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
 
-GENERATE_CHI           = NO
+DISABLE_INDEX          = NO
 
-# If the GENERATE_HTMLHELP tag is set to YES, the BINARY_TOC flag 
-# controls whether a binary table of contents is generated (YES) or a 
-# normal table of contents (NO) in the .chm file.
+# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
+# structure should be generated to display hierarchical information. If the tag
+# value is set to YES, a side panel will be generated containing a tree-like
+# index structure (just like the one that is generated for HTML Help). For this
+# to work a browser that supports JavaScript, DHTML, CSS and frames is required
+# (i.e. any modern browser). Windows users are probably better off using the
+# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can
+# further fine-tune the look of the index. As an example, the default style
+# sheet generated by doxygen has an example that shows how to put an image at
+# the root of the tree instead of the PROJECT_NAME. Since the tree basically has
+# the same information as the tab index, you could consider setting
+# DISABLE_INDEX to YES when enabling this option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
 
-BINARY_TOC             = NO
+GENERATE_TREEVIEW      = YES
 
-# The TOC_EXPAND flag can be set to YES to add extra items for group members 
-# to the contents of the Html help documentation and to the tree view.
+# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that
+# doxygen will group on one line in the generated HTML documentation.
+#
+# Note that a value of 0 will completely suppress the enum values from appearing
+# in the overview section.
+# Minimum value: 0, maximum value: 20, default value: 4.
+# This tag requires that the tag GENERATE_HTML is set to YES.
 
-TOC_EXPAND             = NO
+ENUM_VALUES_PER_LINE   = 1
 
-# The DISABLE_INDEX tag can be used to turn on/off the condensed index at 
-# top of each HTML page. The value NO (the default) enables the index and 
-# the value YES disables it.
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used
+# to set the initial width (in pixels) of the frame in which the tree is shown.
+# Minimum value: 0, maximum value: 1500, default value: 250.
+# This tag requires that the tag GENERATE_HTML is set to YES.
 
-DISABLE_INDEX          = NO
+TREEVIEW_WIDTH         = 250
 
-# This tag can be used to set the number of enum values (range [1..20]) 
-# that doxygen will group on one line in the generated HTML documentation.
+# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to
+# external symbols imported via tag files in a separate window.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
 
-ENUM_VALUES_PER_LINE   = 1
+EXT_LINKS_IN_WINDOW    = NO
 
-# If the GENERATE_TREEVIEW tag is set to YES, a side panel will be
-# generated containing a tree-like index structure (just like the one that 
-# is generated for HTML Help). For this to work a browser that supports 
-# JavaScript and frames is required (for instance Mozilla, Netscape 4.0+, 
-# or Internet explorer 4.0+). Note that for large projects the tree generation 
-# can take a very long time. In such cases it is better to disable this feature. 
-# Windows users are probably better off using the HTML help feature.
+# If the HTML_FORMULA_FORMAT option is set to svg, doxygen will use the pdf2svg
+# tool (see https://github.com/dawbarton/pdf2svg) or inkscape (see
+# https://inkscape.org) to generate formulas as SVG images instead of PNGs for
+# the HTML output. These images will generally look nicer at scaled resolutions.
+# Possible values are: png (the default) and svg (looks nicer but requires the
+# pdf2svg or inkscape tool).
+# The default value is: png.
+# This tag requires that the tag GENERATE_HTML is set to YES.
 
-GENERATE_TREEVIEW      = YES
+HTML_FORMULA_FORMAT    = png
 
-# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be 
-# used to set the initial width (in pixels) of the frame in which the tree 
-# is shown.
+# Use this tag to change the font size of LaTeX formulas included as images in
+# the HTML documentation. When you change the font size after a successful
+# doxygen run you need to manually remove any form_*.png images from the HTML
+# output directory to force them to be regenerated.
+# Minimum value: 8, maximum value: 50, default value: 10.
+# This tag requires that the tag GENERATE_HTML is set to YES.
 
-TREEVIEW_WIDTH         = 250
+FORMULA_FONTSIZE       = 10
+
+# Use the FORMULA_TRANSPARENT tag to determine whether or not the images
+# generated for formulas are transparent PNGs. Transparent PNGs are not
+# supported properly for IE 6.0, but are supported on all modern browsers.
+#
+# Note that when changing this option you need to delete any form_*.png files in
+# the HTML output directory before the changes have effect.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_TRANSPARENT    = YES
+
+# The FORMULA_MACROFILE can contain LaTeX \newcommand and \renewcommand commands
+# to create new LaTeX commands to be used in formulas as building blocks. See
+# the section "Including formulas" for details.
+
+FORMULA_MACROFILE      =
+
+# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
+# https://www.mathjax.org) which uses client side JavaScript for the rendering
+# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX
+# installed or if you want to formulas look prettier in the HTML output. When
+# enabled you may also need to install MathJax separately and configure the path
+# to it using the MATHJAX_RELPATH option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+USE_MATHJAX            = NO
+
+# When MathJax is enabled you can set the default output format to be used for
+# the MathJax output. See the MathJax site (see:
+# http://docs.mathjax.org/en/v2.7-latest/output.html) for more details.
+# Possible values are: HTML-CSS (which is slower, but has the best
+# compatibility), NativeMML (i.e. MathML) and SVG.
+# The default value is: HTML-CSS.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_FORMAT         = HTML-CSS
+
+# When MathJax is enabled you need to specify the location relative to the HTML
+# output directory using the MATHJAX_RELPATH option. The destination directory
+# should contain the MathJax.js script. For instance, if the mathjax directory
+# is located at the same level as the HTML output directory, then
+# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
+# Content Delivery Network so you can quickly see the result without installing
+# MathJax. However, it is strongly recommended to install a local copy of
+# MathJax from https://www.mathjax.org before deployment.
+# The default value is: https://cdn.jsdelivr.net/npm/mathjax@2.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_RELPATH        = https://cdn.jsdelivr.net/npm/mathjax@2
+
+# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax
+# extension names that should be enabled during MathJax rendering. For example
+# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_EXTENSIONS     =
+
+# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
+# of code that will be used on startup of the MathJax code. See the MathJax site
+# (see:
+# http://docs.mathjax.org/en/v2.7-latest/output.html) for more details. For an
+# example see the documentation.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_CODEFILE       =
+
+# When the SEARCHENGINE tag is enabled doxygen will generate a search box for
+# the HTML output. The underlying search engine uses javascript and DHTML and
+# should work on any modern browser. Note that when using HTML help
+# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)
+# there is already a search function so this one should typically be disabled.
+# For large projects the javascript based search engine can be slow, then
+# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to
+# search using the keyboard; to jump to the search box use <access key> + S
+# (what the <access key> is depends on the OS and browser, but it is typically
+# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down
+# key> to jump into the search results window, the results can be navigated
+# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel
+# the search. The filter options can be selected when the cursor is inside the
+# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>
+# to select a filter and <Enter> or <escape> to activate or cancel the filter
+# option.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+SEARCHENGINE           = NO
+
+# When the SERVER_BASED_SEARCH tag is enabled the search engine will be
+# implemented using a web server instead of a web client using JavaScript. There
+# are two flavors of web server based searching depending on the EXTERNAL_SEARCH
+# setting. When disabled, doxygen will generate a PHP script for searching and
+# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing
+# and searching needs to be provided by external tools. See the section
+# "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SERVER_BASED_SEARCH    = NO
+
+# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP
+# script for searching. Instead the search results are written to an XML file
+# which needs to be processed by an external indexer. Doxygen will invoke an
+# external search engine pointed to by the SEARCHENGINE_URL option to obtain the
+# search results.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see:
+# https://xapian.org/).
+#
+# See the section "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH        = NO
+
+# The SEARCHENGINE_URL should point to a search engine hosted by a web server
+# which will return the search results when EXTERNAL_SEARCH is enabled.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see:
+# https://xapian.org/). See the section "External Indexing and Searching" for
+# details.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHENGINE_URL       =
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed
+# search data is written to a file for indexing by an external tool. With the
+# SEARCHDATA_FILE tag the name of this file can be specified.
+# The default file is: searchdata.xml.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHDATA_FILE        = searchdata.xml
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the
+# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is
+# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple
+# projects and redirect the results back to the right project.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH_ID     =
+
+# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen
+# projects other than the one defined by this configuration file, but that are
+# all added to the same external search index. Each project needs to have a
+# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of
+# to a relative location where the documentation can be found. The format is:
+# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTRA_SEARCH_MAPPINGS  =
 
 #---------------------------------------------------------------------------
-# configuration options related to the LaTeX output
+# Configuration options related to the LaTeX output
 #---------------------------------------------------------------------------
 
-# If the GENERATE_LATEX tag is set to YES (the default) Doxygen will 
-# generate Latex output.
+# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output.
+# The default value is: YES.
 
 GENERATE_LATEX         = YES
 
-# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. 
-# If a relative path is entered the value of OUTPUT_DIRECTORY will be 
-# put in front of it. If left blank `latex' will be used as the default path.
+# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
 
 LATEX_OUTPUT           = latex
 
-# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be 
-# invoked. If left blank `latex' will be used as the default command name.
+# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
+# invoked.
+#
+# Note that when not enabling USE_PDFLATEX the default is latex when enabling
+# USE_PDFLATEX the default is pdflatex and when in the later case latex is
+# chosen this is overwritten by pdflatex. For specific output languages the
+# default can have been set differently, this depends on the implementation of
+# the output language.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
 
 LATEX_CMD_NAME         = latex
 
-# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to 
-# generate index for LaTeX. If left blank `makeindex' will be used as the 
-# default command name.
+# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate
+# index for LaTeX.
+# Note: This tag is used in the Makefile / make.bat.
+# See also: LATEX_MAKEINDEX_CMD for the part in the generated output file
+# (.tex).
+# The default file is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
 
 MAKEINDEX_CMD_NAME     = makeindex
 
-# If the COMPACT_LATEX tag is set to YES Doxygen generates more compact 
-# LaTeX documents. This may be useful for small projects and may help to 
-# save some trees in general.
+# The LATEX_MAKEINDEX_CMD tag can be used to specify the command name to
+# generate index for LaTeX. In case there is no backslash (\) as first character
+# it will be automatically added in the LaTeX code.
+# Note: This tag is used in the generated output file (.tex).
+# See also: MAKEINDEX_CMD_NAME for the part in the Makefile / make.bat.
+# The default value is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_MAKEINDEX_CMD    = makeindex
+
+# If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
 
 COMPACT_LATEX          = NO
 
-# The PAPER_TYPE tag can be used to set the paper type that is used 
-# by the printer. Possible values are: a4, a4wide, letter, legal and 
-# executive. If left blank a4wide will be used.
+# The PAPER_TYPE tag can be used to set the paper type that is used by the
+# printer.
+# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x
+# 14 inches) and executive (7.25 x 10.5 inches).
+# The default value is: a4.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
 
 PAPER_TYPE             = a4wide
 
-# The EXTRA_PACKAGES tag can be to specify one or more names of LaTeX 
-# packages that should be included in the LaTeX output.
+# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names
+# that should be included in the LaTeX output. The package can be specified just
+# by its name or with the correct syntax as to be used with the LaTeX
+# \usepackage command. To get the times font for instance you can specify :
+# EXTRA_PACKAGES=times or EXTRA_PACKAGES={times}
+# To use the option intlimits with the amsmath package you can specify:
+# EXTRA_PACKAGES=[intlimits]{amsmath}
+# If left blank no extra packages will be included.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+EXTRA_PACKAGES         =
+
+# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the
+# generated LaTeX document. The header should contain everything until the first
+# chapter. If it is left blank doxygen will generate a standard header. See
+# section "Doxygen usage" for information on how to let doxygen write the
+# default header to a separate file.
+#
+# Note: Only use a user-defined header if you know what you are doing! The
+# following commands have a special meaning inside the header: $title,
+# $datetime, $date, $doxygenversion, $projectname, $projectnumber,
+# $projectbrief, $projectlogo. Doxygen will replace $title with the empty
+# string, for the replacement values of the other commands the user is referred
+# to HTML_HEADER.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HEADER           =
+
+# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the
+# generated LaTeX document. The footer should contain everything after the last
+# chapter. If it is left blank doxygen will generate a standard footer. See
+# LATEX_HEADER for more information on how to generate a default footer and what
+# special commands can be used inside the footer.
+#
+# Note: Only use a user-defined footer if you know what you are doing!
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_FOOTER           =
 
-EXTRA_PACKAGES         = 
+# The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# LaTeX style sheets that are included after the standard style sheets created
+# by doxygen. Using this option one can overrule certain style aspects. Doxygen
+# will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list).
+# This tag requires that the tag GENERATE_LATEX is set to YES.
 
-# The LATEX_HEADER tag can be used to specify a personal LaTeX header for 
-# the generated latex document. The header should contain everything until 
-# the first chapter. If it is left blank doxygen will generate a 
-# standard header. Notice: only use this tag if you know what you are doing!
+LATEX_EXTRA_STYLESHEET =
 
-LATEX_HEADER           = 
+# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the LATEX_OUTPUT output
+# directory. Note that the files will be copied as-is; there are no commands or
+# markers available.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
 
-# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated 
-# is prepared for conversion to pdf (using ps2pdf). The pdf file will 
-# contain links (just like the HTML output) instead of page references 
-# This makes the output suitable for online browsing using a pdf viewer.
+LATEX_EXTRA_FILES      =
+
+# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is
+# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will
+# contain links (just like the HTML output) instead of page references. This
+# makes the output suitable for online browsing using a PDF viewer.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
 
 PDF_HYPERLINKS         = NO
 
-# If the USE_PDFLATEX tag is set to YES, pdflatex will be used instead of 
-# plain latex in the generated Makefile. Set this option to YES to get a 
-# higher quality PDF documentation.
+# If the USE_PDFLATEX tag is set to YES, doxygen will use the engine as
+# specified with LATEX_CMD_NAME to generate the PDF file directly from the LaTeX
+# files. Set this option to YES, to get a higher quality PDF documentation.
+#
+# See also section LATEX_CMD_NAME for selecting the engine.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
 
 USE_PDFLATEX           = NO
 
-# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \\batchmode. 
-# command to the generated LaTeX files. This will instruct LaTeX to keep 
-# running if errors occur, instead of asking the user for help. 
-# This option is also used when generating formulas in HTML.
+# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \batchmode
+# command to the generated LaTeX files. This will instruct LaTeX to keep running
+# if errors occur, instead of asking the user for help. This option is also used
+# when generating formulas in HTML.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
 
 LATEX_BATCHMODE        = NO
 
+# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the
+# index chapters (such as File Index, Compound Index, etc.) in the output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HIDE_INDICES     = NO
+
+# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source
+# code with syntax highlighting in the LaTeX output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_SOURCE_CODE      = NO
+
+# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
+# bibliography, e.g. plainnat, or ieeetr. See
+# https://en.wikipedia.org/wiki/BibTeX and \cite for more info.
+# The default value is: plain.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BIB_STYLE        = plain
+
+# If the LATEX_TIMESTAMP tag is set to YES then the footer of each generated
+# page will contain the date and time when the page was generated. Setting this
+# to NO can help when comparing the output of multiple runs.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_TIMESTAMP        = NO
+
+# The LATEX_EMOJI_DIRECTORY tag is used to specify the (relative or absolute)
+# path from which the emoji images will be read. If a relative path is entered,
+# it will be relative to the LATEX_OUTPUT directory. If left blank the
+# LATEX_OUTPUT directory will be used.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EMOJI_DIRECTORY  =
+
 #---------------------------------------------------------------------------
-# configuration options related to the RTF output
+# Configuration options related to the RTF output
 #---------------------------------------------------------------------------
 
-# If the GENERATE_RTF tag is set to YES Doxygen will generate RTF output 
-# The RTF output is optimised for Word 97 and may not look very pretty with 
-# other RTF readers or editors.
+# If the GENERATE_RTF tag is set to YES, doxygen will generate RTF output. The
+# RTF output is optimized for Word 97 and may not look too pretty with other RTF
+# readers/editors.
+# The default value is: NO.
 
 GENERATE_RTF           = NO
 
-# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. 
-# If a relative path is entered the value of OUTPUT_DIRECTORY will be 
-# put in front of it. If left blank `rtf' will be used as the default path.
+# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: rtf.
+# This tag requires that the tag GENERATE_RTF is set to YES.
 
 RTF_OUTPUT             = rtf
 
-# If the COMPACT_RTF tag is set to YES Doxygen generates more compact 
-# RTF documents. This may be useful for small projects and may help to 
-# save some trees in general.
+# If the COMPACT_RTF tag is set to YES, doxygen generates more compact RTF
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
 
 COMPACT_RTF            = NO
 
-# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated 
-# will contain hyperlink fields. The RTF file will 
-# contain links (just like the HTML output) instead of page references. 
-# This makes the output suitable for online browsing using WORD or other 
-# programs which support those fields. 
-# Note: wordpad (write) and others do not support links.
+# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will
+# contain hyperlink fields. The RTF file will contain links (just like the HTML
+# output) instead of page references. This makes the output suitable for online
+# browsing using Word or some other Word compatible readers that support those
+# fields.
+#
+# Note: WordPad (write) and others do not support links.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
 
 RTF_HYPERLINKS         = NO
 
-# Load stylesheet definitions from file. Syntax is similar to doxygen's 
-# config file, i.e. a series of assigments. You only have to provide 
+# Load stylesheet definitions from file. Syntax is similar to doxygen's
+# configuration file, i.e. a series of assignments. You only have to provide
 # replacements, missing definitions are set to their default value.
+#
+# See also section "Doxygen usage" for information on how to generate the
+# default style sheet that doxygen normally uses.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_STYLESHEET_FILE    =
 
-RTF_STYLESHEET_FILE    = 
+# Set optional variables used in the generation of an RTF document. Syntax is
+# similar to doxygen's configuration file. A template extensions file can be
+# generated using doxygen -e rtf extensionFile.
+# This tag requires that the tag GENERATE_RTF is set to YES.
 
-# Set optional variables used in the generation of an rtf document. 
-# Syntax is similar to doxygen's config file.
+RTF_EXTENSIONS_FILE    =
+
+# If the RTF_SOURCE_CODE tag is set to YES then doxygen will include source code
+# with syntax highlighting in the RTF output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
 
-RTF_EXTENSIONS_FILE    = 
+RTF_SOURCE_CODE        = NO
 
 #---------------------------------------------------------------------------
-# configuration options related to the man page output
+# Configuration options related to the man page output
 #---------------------------------------------------------------------------
 
-# If the GENERATE_MAN tag is set to YES (the default) Doxygen will 
-# generate man pages
+# If the GENERATE_MAN tag is set to YES, doxygen will generate man pages for
+# classes and files.
+# The default value is: NO.
 
 GENERATE_MAN           = NO
 
-# The MAN_OUTPUT tag is used to specify where the man pages will be put. 
-# If a relative path is entered the value of OUTPUT_DIRECTORY will be 
-# put in front of it. If left blank `man' will be used as the default path.
+# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it. A directory man3 will be created inside the directory specified by
+# MAN_OUTPUT.
+# The default directory is: man.
+# This tag requires that the tag GENERATE_MAN is set to YES.
 
 MAN_OUTPUT             = man
 
-# The MAN_EXTENSION tag determines the extension that is added to 
-# the generated man pages (default is the subroutine's section .3)
+# The MAN_EXTENSION tag determines the extension that is added to the generated
+# man pages. In case the manual section does not start with a number, the number
+# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is
+# optional.
+# The default value is: .3.
+# This tag requires that the tag GENERATE_MAN is set to YES.
 
 MAN_EXTENSION          = .3
 
-# If the MAN_LINKS tag is set to YES and Doxygen generates man output, 
-# then it will generate one additional man file for each entity 
-# documented in the real man page(s). These additional files 
-# only source the real man page, but without them the man command 
-# would be unable to find the correct page. The default is NO.
+# The MAN_SUBDIR tag determines the name of the directory created within
+# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by
+# MAN_EXTENSION with the initial . removed.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_SUBDIR             =
+
+# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it
+# will generate one additional man file for each entity documented in the real
+# man page(s). These additional files only source the real man page, but without
+# them the man command would be unable to find the correct page.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_MAN is set to YES.
 
 MAN_LINKS              = NO
 
 #---------------------------------------------------------------------------
-# configuration options related to the XML output
+# Configuration options related to the XML output
 #---------------------------------------------------------------------------
 
-# If the GENERATE_XML tag is set to YES Doxygen will 
-# generate an XML file that captures the structure of 
-# the code including all documentation. Note that this 
-# feature is still experimental and incomplete at the 
-# moment.
+# If the GENERATE_XML tag is set to YES, doxygen will generate an XML file that
+# captures the structure of the code including all documentation.
+# The default value is: NO.
 
 GENERATE_XML           = NO
 
-# The XML_SCHEMA tag can be used to specify an XML schema, 
-# which can be used by a validating XML parser to check the 
-# syntax of the XML files.
+# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: xml.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_OUTPUT             = xml
+
+# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program
+# listings (including syntax highlighting and cross-referencing information) to
+# the XML output. Note that enabling this will significantly increase the size
+# of the XML output.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_XML is set to YES.
 
-XML_SCHEMA             = 
+XML_PROGRAMLISTING     = YES
 
-# The XML_DTD tag can be used to specify an XML DTD, 
-# which can be used by a validating XML parser to check the 
-# syntax of the XML files.
+# If the XML_NS_MEMB_FILE_SCOPE tag is set to YES, doxygen will include
+# namespace members in file scope as well, matching the HTML output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_XML is set to YES.
 
-XML_DTD                = 
+XML_NS_MEMB_FILE_SCOPE = NO
 
 #---------------------------------------------------------------------------
-# configuration options for the AutoGen Definitions output
+# Configuration options related to the DOCBOOK output
 #---------------------------------------------------------------------------
 
-# If the GENERATE_AUTOGEN_DEF tag is set to YES Doxygen will 
-# generate an AutoGen Definitions (see autogen.sf.net) file 
-# that captures the structure of the code including all 
-# documentation. Note that this feature is still experimental 
-# and incomplete at the moment.
+# If the GENERATE_DOCBOOK tag is set to YES, doxygen will generate Docbook files
+# that can be used to generate PDF.
+# The default value is: NO.
+
+GENERATE_DOCBOOK       = NO
+
+# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in
+# front of it.
+# The default directory is: docbook.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_OUTPUT         = docbook
+
+# If the DOCBOOK_PROGRAMLISTING tag is set to YES, doxygen will include the
+# program listings (including syntax highlighting and cross-referencing
+# information) to the DOCBOOK output. Note that enabling this will significantly
+# increase the size of the DOCBOOK output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_PROGRAMLISTING = NO
+
+#---------------------------------------------------------------------------
+# Configuration options for the AutoGen Definitions output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
+# AutoGen Definitions (see http://autogen.sourceforge.net/) file that captures
+# the structure of the code including all documentation. Note that this feature
+# is still experimental and incomplete at the moment.
+# The default value is: NO.
 
 GENERATE_AUTOGEN_DEF   = NO
 
 #---------------------------------------------------------------------------
-# configuration options related to the Perl module output
+# Configuration options related to the Perl module output
 #---------------------------------------------------------------------------
 
-# If the GENERATE_PERLMOD tag is set to YES Doxygen will 
-# generate a Perl module file that captures the structure of 
-# the code including all documentation. Note that this 
-# feature is still experimental and incomplete at the 
-# moment.
+# If the GENERATE_PERLMOD tag is set to YES, doxygen will generate a Perl module
+# file that captures the structure of the code including all documentation.
+#
+# Note that this feature is still experimental and incomplete at the moment.
+# The default value is: NO.
 
 GENERATE_PERLMOD       = NO
 
-# If the PERLMOD_LATEX tag is set to YES Doxygen will generate 
-# the necessary Makefile rules, Perl scripts and LaTeX code to be able 
-# to generate PDF and DVI output from the Perl module output.
+# If the PERLMOD_LATEX tag is set to YES, doxygen will generate the necessary
+# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI
+# output from the Perl module output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
 
 PERLMOD_LATEX          = NO
 
-# If the PERLMOD_PRETTY tag is set to YES the Perl module output will be 
-# nicely formatted so it can be parsed by a human reader.  This is useful 
-# if you want to understand what is going on.  On the other hand, if this 
-# tag is set to NO the size of the Perl module output will be much smaller 
-# and Perl will parse it just the same.
+# If the PERLMOD_PRETTY tag is set to YES, the Perl module output will be nicely
+# formatted so it can be parsed by a human reader. This is useful if you want to
+# understand what is going on. On the other hand, if this tag is set to NO, the
+# size of the Perl module output will be much smaller and Perl will parse it
+# just the same.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
 
 PERLMOD_PRETTY         = YES
 
-# The names of the make variables in the generated doxyrules.make file 
-# are prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. 
-# This is useful so different doxyrules.make files included by the same 
-# Makefile don't overwrite each other's variables.
+# The names of the make variables in the generated doxyrules.make file are
+# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful
+# so different doxyrules.make files included by the same Makefile don't
+# overwrite each other's variables.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
 
-PERLMOD_MAKEVAR_PREFIX = 
+PERLMOD_MAKEVAR_PREFIX =
 
 #---------------------------------------------------------------------------
-# Configuration options related to the preprocessor   
+# Configuration options related to the preprocessor
 #---------------------------------------------------------------------------
 
-# If the ENABLE_PREPROCESSING tag is set to YES (the default) Doxygen will 
-# evaluate all C-preprocessor directives found in the sources and include 
-# files.
+# If the ENABLE_PREPROCESSING tag is set to YES, doxygen will evaluate all
+# C-preprocessor directives found in the sources and include files.
+# The default value is: YES.
 
 ENABLE_PREPROCESSING   = YES
 
-# If the MACRO_EXPANSION tag is set to YES Doxygen will expand all macro 
-# names in the source code. If set to NO (the default) only conditional 
-# compilation will be performed. Macro expansion can be done in a controlled 
-# way by setting EXPAND_ONLY_PREDEF to YES.
+# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names
+# in the source code. If set to NO, only conditional compilation will be
+# performed. Macro expansion can be done in a controlled way by setting
+# EXPAND_ONLY_PREDEF to YES.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
 
 MACRO_EXPANSION        = NO
 
-# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES 
-# then the macro expansion is limited to the macros specified with the 
-# PREDEFINED and EXPAND_AS_PREDEFINED tags.
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then
+# the macro expansion is limited to the macros specified with the PREDEFINED and
+# EXPAND_AS_DEFINED tags.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
 
 EXPAND_ONLY_PREDEF     = NO
 
-# If the SEARCH_INCLUDES tag is set to YES (the default) the includes files 
-# in the INCLUDE_PATH (see below) will be search if a #include is found.
+# If the SEARCH_INCLUDES tag is set to YES, the include files in the
+# INCLUDE_PATH will be searched if a #include is found.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
 
 SEARCH_INCLUDES        = YES
 
-# The INCLUDE_PATH tag can be used to specify one or more directories that 
-# contain include files that are not input files but should be processed by 
-# the preprocessor.
-
-# INCLUDE_PATH           = 
-INCLUDE_PATH           = @top_pwd@ @top_pwd@/src/frontend/SageIII @top_srcdir@/src/midend/astProcessing @top_srcdir@/src @top_srcdir@/src/backend/unparser @top_srcdir@/src/util @top_srcdir@/src/3rdPartyLibraries/MSTL @top_srcdir@/src/astQuery
-
-# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard 
-# patterns (like *.h and *.hpp) to filter out the header-files in the 
-# directories. If left blank, the patterns specified with FILE_PATTERNS will 
-# be used.
-
-INCLUDE_FILE_PATTERNS  = 
-
-# The PREDEFINED tag can be used to specify one or more macro names that 
-# are defined before the preprocessor is started (similar to the -D option of 
-# gcc). The argument of the tag is a list of macros of the form: name 
-# or name=definition (no spaces). If the definition and the = are 
-# omitted =1 is assumed.
-
-# PREDEFINED             = 
-PREDEFINED             = HAVE_EXPLICIT_TEMPLATE_INSTANTIATION __EXTERN_C__
-
-# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then 
-# this tag can be used to specify a list of macro names that should be expanded. 
-# The macro definition that is found in the sources will be used. 
-# Use the PREDEFINED tag if you want to use a different macro definition.
-
-EXPAND_AS_DEFINED      = 
-
-# If the SKIP_FUNCTION_MACROS tag is set to YES (the default) then 
-# doxygen's preprocessor will remove all function-like macros that are alone 
-# on a line, have an all uppercase name, and do not end with a semicolon. Such 
-# function macros are typically used for boiler-plate code, and will confuse the 
-# parser if not removed.
+# The INCLUDE_PATH tag can be used to specify one or more directories that
+# contain include files that are not input files but should be processed by the
+# preprocessor.
+# This tag requires that the tag SEARCH_INCLUDES is set to YES.
+
+INCLUDE_PATH           = @top_pwd@ \
+                         @top_pwd@/src/frontend/SageIII \
+                         @top_srcdir@/src/midend/astProcessing \
+                         @top_srcdir@/src \
+                         @top_srcdir@/src/backend/unparser \
+                         @top_srcdir@/src/util \
+                         @top_srcdir@/src/3rdPartyLibraries/MSTL \
+                         @top_srcdir@/src/astQuery
+
+# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
+# patterns (like *.h and *.hpp) to filter out the header-files in the
+# directories. If left blank, the patterns specified with FILE_PATTERNS will be
+# used.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+INCLUDE_FILE_PATTERNS  =
+
+# The PREDEFINED tag can be used to specify one or more macro names that are
+# defined before the preprocessor is started (similar to the -D option of e.g.
+# gcc). The argument of the tag is a list of macros of the form: name or
+# name=definition (no spaces). If the definition and the "=" are omitted, "=1"
+# is assumed. To prevent a macro definition from being undefined via #undef or
+# recursively expanded use the := operator instead of the = operator.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+PREDEFINED             = HAVE_EXPLICIT_TEMPLATE_INSTANTIATION \
+                         __EXTERN_C__
+
+# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
+# tag can be used to specify a list of macro names that should be expanded. The
+# macro definition that is found in the sources will be used. Use the PREDEFINED
+# tag if you want to use a different macro definition that overrules the
+# definition found in the source code.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_AS_DEFINED      =
+
+# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will
+# remove all references to function-like macros that are alone on a line, have
+# an all uppercase name, and do not end with a semicolon. Such function macros
+# are typically used for boiler-plate code, and will confuse the parser if not
+# removed.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
 
 SKIP_FUNCTION_MACROS   = YES
 
 #---------------------------------------------------------------------------
-# Configuration::addtions related to external references   
+# Configuration options related to external references
 #---------------------------------------------------------------------------
 
-# The TAGFILES tag can be used to specify one or more tagfiles.
-
-TAGFILES               = 
-
-# When a file name is specified after GENERATE_TAGFILE, doxygen will create 
-# a tag file that is based on the input files it reads.
+# The TAGFILES tag can be used to specify one or more tag files. For each tag
+# file the location of the external documentation should be added. The format of
+# a tag file without this location is as follows:
+# TAGFILES = file1 file2 ...
+# Adding location for the tag files is done as follows:
+# TAGFILES = file1=loc1 "file2 = loc2" ...
+# where loc1 and loc2 can be relative or absolute paths or URLs. See the
+# section "Linking to external documentation" for more information about the use
+# of tag files.
+# Note: Each tag file must have a unique name (where the name does NOT include
+# the path). If a tag file is not located in the directory in which doxygen is
+# run, you must also specify the path to the tagfile here.
+
+TAGFILES               =
+
+# When a file name is specified after GENERATE_TAGFILE, doxygen will create a
+# tag file that is based on the input files it reads. See section "Linking to
+# external documentation" for more information about the usage of tag files.
 
-# GENERATE_TAGFILE       = sage.tag
 GENERATE_TAGFILE       = @top_pwd@/docs/Rose/SageIntermediateForm/sageDoxygen.tags
 
-# If the ALLEXTERNALS tag is set to YES all external classes will be listed 
-# in the class index. If set to NO only the inherited external classes 
-# will be listed.
+# If the ALLEXTERNALS tag is set to YES, all external class will be listed in
+# the class index. If set to NO, only the inherited external classes will be
+# listed.
+# The default value is: NO.
 
 ALLEXTERNALS           = NO
 
-# If the EXTERNAL_GROUPS tag is set to YES all external groups will be listed 
-# in the modules index. If set to NO, only the current project's groups will 
-# be listed.
+# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed
+# in the modules index. If set to NO, only the current project's groups will be
+# listed.
+# The default value is: YES.
 
 EXTERNAL_GROUPS        = YES
 
-# The PERL_PATH should be the absolute path and name of the perl script 
-# interpreter (i.e. the result of `which perl').
+# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in
+# the related pages index. If set to NO, only the current project's pages will
+# be listed.
+# The default value is: YES.
 
-PERL_PATH              = /usr/bin/perl
+EXTERNAL_PAGES         = YES
 
 #---------------------------------------------------------------------------
-# Configuration options related to the dot tool   
+# Configuration options related to the dot tool
 #---------------------------------------------------------------------------
 
-# If the CLASS_DIAGRAMS tag is set to YES (the default) Doxygen will 
-# generate a inheritance diagram (in Html, RTF and LaTeX) for classes with base or 
-# super classes. Setting the tag to NO turns the diagrams off. Note that this 
-# option is superceded by the HAVE_DOT option below. This is only a fallback. It is 
-# recommended to install and use dot, since it yield more powerful graphs.
+# If the CLASS_DIAGRAMS tag is set to YES, doxygen will generate a class diagram
+# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to
+# NO turns the diagrams off. Note that this option also works with HAVE_DOT
+# disabled, but it is recommended to install and use dot, since it yields more
+# powerful graphs.
+# The default value is: YES.
 
 CLASS_DIAGRAMS         = YES
 
-# If set to YES, the inheritance and collaboration graphs will hide 
-# inheritance and usage relations if the target is undocumented 
-# or is not a class.
+# You can include diagrams made with dia in doxygen documentation. Doxygen will
+# then run dia to produce the diagram and insert it in the documentation. The
+# DIA_PATH tag allows you to specify the directory where the dia binary resides.
+# If left empty dia is assumed to be found in the default search path.
+
+DIA_PATH               =
+
+# If set to YES the inheritance and collaboration graphs will hide inheritance
+# and usage relations if the target is undocumented or is not a class.
+# The default value is: YES.
 
 HIDE_UNDOC_RELATIONS   = YES
 
-# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is 
-# available from the path. This tool is part of Graphviz, a graph visualization 
-# toolkit from AT&T and Lucent Bell Labs. The other options in this section 
-# have no effect if this option is set to NO (the default)
+# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
+# available from the path. This tool is part of Graphviz (see:
+# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
+# Bell Labs. The other options in this section have no effect if this option is
+# set to NO
+# The default value is: YES.
 
 HAVE_DOT               = YES
 
-# If the CLASS_GRAPH and HAVE_DOT tags are set to YES then doxygen 
-# will generate a graph for each documented class showing the direct and 
-# indirect inheritance relations. Setting this tag to YES will force the 
-# the CLASS_DIAGRAMS tag to NO.
+# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed
+# to run in parallel. When set to 0 doxygen will base this on the number of
+# processors available in the system. You can set it explicitly to a value
+# larger than 0 to get control over the balance between CPU load and processing
+# speed.
+# Minimum value: 0, maximum value: 32, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_NUM_THREADS        = 0
+
+# When you want a differently looking font in the dot files that doxygen
+# generates you can specify the font name using DOT_FONTNAME. You need to make
+# sure dot is able to find the font, which can be done by putting it in a
+# standard location or by setting the DOTFONTPATH environment variable or by
+# setting DOT_FONTPATH to the directory containing the font.
+# The default value is: Helvetica.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTNAME           = Helvetica
+
+# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of
+# dot graphs.
+# Minimum value: 4, maximum value: 24, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTSIZE           = 10
+
+# By default doxygen will tell dot to use the default font as specified with
+# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set
+# the path where dot can find it using this tag.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTPATH           =
+
+# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
+# each documented class showing the direct and indirect inheritance relations.
+# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
 
 CLASS_GRAPH            = YES
 
-# If the COLLABORATION_GRAPH and HAVE_DOT tags are set to YES then doxygen 
-# will generate a graph for each documented class showing the direct and 
-# indirect implementation dependencies (inheritance, containment, and 
-# class references variables) of the class with other documented classes.
+# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a
+# graph for each documented class showing the direct and indirect implementation
+# dependencies (inheritance, containment, and class references variables) of the
+# class with other documented classes.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
 
 COLLABORATION_GRAPH    = YES
 
-# If set to YES, the inheritance and collaboration graphs will show the 
-# relations between templates and their instances.
+# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
+# groups, showing the direct groups dependencies.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GROUP_GRAPHS           = YES
+
+# If the UML_LOOK tag is set to YES, doxygen will generate inheritance and
+# collaboration diagrams in a style similar to the OMG's Unified Modeling
+# Language.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LOOK               = NO
+
+# If the UML_LOOK tag is enabled, the fields and methods are shown inside the
+# class node. If there are many fields or methods and many nodes the graph may
+# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the
+# number of items for each type to make the size more manageable. Set this to 0
+# for no limit. Note that the threshold may be exceeded by 50% before the limit
+# is enforced. So when you set the threshold to 10, up to 15 fields may appear,
+# but if the number exceeds 15, the total amount of fields shown is limited to
+# 10.
+# Minimum value: 0, maximum value: 100, default value: 10.
+# This tag requires that the tag UML_LOOK is set to YES.
+
+UML_LIMIT_NUM_FIELDS   = 10
+
+# If the DOT_UML_DETAILS tag is set to NO, doxygen will show attributes and
+# methods without types and arguments in the UML graphs. If the DOT_UML_DETAILS
+# tag is set to YES, doxygen will add type and arguments for attributes and
+# methods in the UML graphs. If the DOT_UML_DETAILS tag is set to NONE, doxygen
+# will not generate fields with class member information in the UML graphs. The
+# class diagrams will look similar to the default class diagrams but using UML
+# notation for the relationships.
+# Possible values are: NO, YES and NONE.
+# The default value is: NO.
+# This tag requires that the tag UML_LOOK is set to YES.
+
+DOT_UML_DETAILS        = NO
+
+# The DOT_WRAP_THRESHOLD tag can be used to set the maximum number of characters
+# to display on a single line. If the actual line length exceeds this threshold
+# significantly it will wrapped across multiple lines. Some heuristics are apply
+# to avoid ugly line breaks.
+# Minimum value: 0, maximum value: 1000, default value: 17.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_WRAP_THRESHOLD     = 17
+
+# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and
+# collaboration graphs will show the relations between templates and their
+# instances.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
 
 TEMPLATE_RELATIONS     = YES
 
-# If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDE_GRAPH, and HAVE_DOT 
-# tags are set to YES then doxygen will generate a graph for each documented 
-# file showing the direct and indirect include dependencies of the file with 
-# other documented files.
+# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to
+# YES then doxygen will generate a graph for each documented file showing the
+# direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
 
 INCLUDE_GRAPH          = YES
 
-# If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDED_BY_GRAPH, and 
-# HAVE_DOT tags are set to YES then doxygen will generate a graph for each 
-# documented header file showing the documented files that directly or 
-# indirectly include this file.
+# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are
+# set to YES then doxygen will generate a graph for each documented file showing
+# the direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
 
 INCLUDED_BY_GRAPH      = YES
 
-# If the GRAPHICAL_HIERARCHY and HAVE_DOT tags are set to YES then doxygen 
-# will graphical hierarchy of all classes instead of a textual one.
+# If the CALL_GRAPH tag is set to YES then doxygen will generate a call
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable call graphs for selected
+# functions only using the \callgraph command. Disabling a call graph can be
+# accomplished by means of the command \hidecallgraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALL_GRAPH             = NO
+
+# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable caller graphs for selected
+# functions only using the \callergraph command. Disabling a caller graph can be
+# accomplished by means of the command \hidecallergraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALLER_GRAPH           = NO
+
+# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical
+# hierarchy of all classes instead of a textual one.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
 
 GRAPHICAL_HIERARCHY    = YES
 
-# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images 
-# generated by dot. Possible values are png, jpg, or gif
-# If left blank png will be used.
+# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the
+# dependencies a directory has on other directories in a graphical way. The
+# dependency relations are determined by the #include relations between the
+# files in the directories.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DIRECTORY_GRAPH        = YES
+
+# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
+# generated by dot. For an explanation of the image formats see the section
+# output formats in the documentation of the dot tool (Graphviz (see:
+# http://www.graphviz.org/)).
+# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
+# to make the SVG files visible in IE 9+ (other browsers do not have this
+# requirement).
+# Possible values are: png, png:cairo, png:cairo:cairo, png:cairo:gd, png:gd,
+# png:gd:gd, jpg, jpg:cairo, jpg:cairo:gd, jpg:gd, jpg:gd:gd, gif, gif:cairo,
+# gif:cairo:gd, gif:gd, gif:gd:gd, svg, png:gd, png:gd:gd, png:cairo,
+# png:cairo:gd, png:cairo:cairo, png:cairo:gdiplus, png:gdiplus and
+# png:gdiplus:gdiplus.
+# The default value is: png.
+# This tag requires that the tag HAVE_DOT is set to YES.
 
 DOT_IMAGE_FORMAT       = png
 
-# The tag DOT_PATH can be used to specify the path where the dot tool can be 
-# found. If left blank, it is assumed the dot tool can be found on the path.
+# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
+# enable generation of interactive SVG images that allow zooming and panning.
+#
+# Note that this requires a modern browser other than Internet Explorer. Tested
+# and working are Firefox, Chrome, Safari, and Opera.
+# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make
+# the SVG files visible. Older versions of IE do not have SVG support.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
 
-DOT_PATH               = 
+INTERACTIVE_SVG        = NO
 
-# The DOTFILE_DIRS tag can be used to specify one or more directories that 
-# contain dot files that are included in the documentation (see the 
-# \dotfile command).
+# The DOT_PATH tag can be used to specify the path where the dot tool can be
+# found. If left blank, it is assumed the dot tool can be found in the path.
+# This tag requires that the tag HAVE_DOT is set to YES.
 
-DOTFILE_DIRS           = 
+DOT_PATH               =
 
-# The MAX_DOT_GRAPH_WIDTH tag can be used to set the maximum allowed width 
-# (in pixels) of the graphs generated by dot. If a graph becomes larger than 
-# this value, doxygen will try to truncate the graph, so that it fits within 
-# the specified constraint. Beware that most browsers cannot cope with very 
-# large images.
+# The DOTFILE_DIRS tag can be used to specify one or more directories that
+# contain dot files that are included in the documentation (see the \dotfile
+# command).
+# This tag requires that the tag HAVE_DOT is set to YES.
 
-MAX_DOT_GRAPH_WIDTH    = 1024
+DOTFILE_DIRS           =
 
-# The MAX_DOT_GRAPH_HEIGHT tag can be used to set the maximum allows height 
-# (in pixels) of the graphs generated by dot. If a graph becomes larger than 
-# this value, doxygen will try to truncate the graph, so that it fits within 
-# the specified constraint. Beware that most browsers cannot cope with very 
-# large images.
+# The MSCFILE_DIRS tag can be used to specify one or more directories that
+# contain msc files that are included in the documentation (see the \mscfile
+# command).
 
-MAX_DOT_GRAPH_HEIGHT   = 1024
+MSCFILE_DIRS           =
 
-# If the GENERATE_LEGEND tag is set to YES (the default) Doxygen will 
-# generate a legend page explaining the meaning of the various boxes and 
-# arrows in the dot generated graphs.
+# The DIAFILE_DIRS tag can be used to specify one or more directories that
+# contain dia files that are included in the documentation (see the \diafile
+# command).
 
-GENERATE_LEGEND        = YES
+DIAFILE_DIRS           =
 
-# If the DOT_CLEANUP tag is set to YES (the default) Doxygen will 
-# remove the intermedate dot files that are used to generate 
-# the various graphs.
+# When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the
+# path where java can find the plantuml.jar file. If left blank, it is assumed
+# PlantUML is not used or called during a preprocessing step. Doxygen will
+# generate a warning when it encounters a \startuml command in this case and
+# will not generate output for the diagram.
 
-DOT_CLEANUP            = YES
+PLANTUML_JAR_PATH      =
 
-#---------------------------------------------------------------------------
-# Configuration::addtions related to the search engine   
-#---------------------------------------------------------------------------
+# When using plantuml, the PLANTUML_CFG_FILE tag can be used to specify a
+# configuration file for plantuml.
 
-# The SEARCHENGINE tag specifies whether or not a search engine should be 
-# used. If set to NO the values of all tags below this one will be ignored.
+PLANTUML_CFG_FILE      =
 
-SEARCHENGINE           = NO
+# When using plantuml, the specified paths are searched for files specified by
+# the !include statement in a plantuml block.
 
-# The CGI_NAME tag should be the name of the CGI script that 
-# starts the search engine (doxysearch) with the correct parameters. 
-# A script with this name will be generated by doxygen.
+PLANTUML_INCLUDE_PATH  =
 
-CGI_NAME               = search.cgi
+# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes
+# that will be shown in the graph. If the number of nodes in a graph becomes
+# larger than this value, doxygen will truncate the graph, which is visualized
+# by representing a node as a red box. Note that doxygen if the number of direct
+# children of the root node in a graph is already larger than
+# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that
+# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+# Minimum value: 0, maximum value: 10000, default value: 50.
+# This tag requires that the tag HAVE_DOT is set to YES.
 
-# The CGI_URL tag should be the absolute URL to the directory where the 
-# cgi binaries are located. See the documentation of your http daemon for 
-# details.
+DOT_GRAPH_MAX_NODES    = 50
+
+# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs
+# generated by dot. A depth value of 3 means that only nodes reachable from the
+# root by following a path via at most 3 edges will be shown. Nodes that lay
+# further from the root node will be omitted. Note that setting this option to 1
+# or 2 may greatly reduce the computation time needed for large code bases. Also
+# note that the size of a graph can be further restricted by
+# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
+# Minimum value: 0, maximum value: 1000, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
 
-CGI_URL                = 
+MAX_DOT_GRAPH_DEPTH    = 0
 
-# The DOC_URL tag should be the absolute URL to the directory where the 
-# documentation is located. If left blank the absolute path to the 
-# documentation, with file:// prepended to it, will be used.
+# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
+# background. This is disabled by default, because dot on Windows does not seem
+# to support this out of the box.
+#
+# Warning: Depending on the platform used, enabling this option may lead to
+# badly anti-aliased labels on the edges of a graph (i.e. they become hard to
+# read).
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
 
-DOC_URL                = 
+DOT_TRANSPARENT        = NO
 
-# The DOC_ABSPATH tag should be the absolute path to the directory where the 
-# documentation is located. If left blank the directory on the local machine 
-# will be used.
+# Set the DOT_MULTI_TARGETS tag to YES to allow dot to generate multiple output
+# files in one run (i.e. multiple -o and -T options on the command line). This
+# makes dot run faster, but since only newer versions of dot (>1.8.10) support
+# this, this feature is disabled by default.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
 
-DOC_ABSPATH            = 
+DOT_MULTI_TARGETS      = NO
 
-# The BIN_ABSPATH tag must point to the directory where the doxysearch binary 
-# is installed.
+# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page
+# explaining the meaning of the various boxes and arrows in the dot generated
+# graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
 
-BIN_ABSPATH            = /usr/local/bin/
+GENERATE_LEGEND        = YES
 
-# The EXT_DOC_PATHS tag can be used to specify one or more paths to 
-# documentation generated for other projects. This allows doxysearch to search 
-# the documentation for these projects as well.
+# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate
+# files that are used to generate the various graphs.
+#
+# Note: This setting is not only used for dot files but also for msc and
+# plantuml temporary files.
+# The default value is: YES.
 
-EXT_DOC_PATHS          = 
+DOT_CLEANUP            = YES

From a814b10499b34a781aa36204a434ad3d7fc08e08 Mon Sep 17 00:00:00 2001
From: Yonghong Yan <yanyh15@gmail.com>
Date: Wed, 27 Nov 2024 21:13:35 -0500
Subject: [PATCH 32/42] deBoost: minor change of two files

---
 src/midend/astQuery/astQuery.h | 8 ++++----
 src/util/FileSystem.h          | 1 +
 2 files changed, 5 insertions(+), 4 deletions(-)

diff --git a/src/midend/astQuery/astQuery.h b/src/midend/astQuery/astQuery.h
index 747851dc41b..0314e050afb 100644
--- a/src/midend/astQuery/astQuery.h
+++ b/src/midend/astQuery/astQuery.h
@@ -41,7 +41,7 @@ namespace AstQueryNamespace
 {
   template<typename AstQuerySynthesizedAttributeType>
     struct helpFunctionalOneParamater
-    : public std::unary_function<SgNode* , Rose_STL_Container<AstQuerySynthesizedAttributeType> >
+    : public std::function<Rose_STL_Container<AstQuerySynthesizedAttributeType>(SgNode*)> 
     {
       // When elementMatchCount == 1 then a match has been made
       typedef Rose_STL_Container<AstQuerySynthesizedAttributeType> (*roseFunctionPointerOneParameter)  (SgNode *);
@@ -59,7 +59,7 @@ namespace AstQueryNamespace
       }
     };
 
-  struct helpF : public std::binary_function<bool,bool,bool >
+  struct helpF : public std::function<bool(bool, bool)>
   {
     bool operator()(bool x, bool /*y*/)
     {
@@ -69,7 +69,7 @@ namespace AstQueryNamespace
 
   template<typename AstQuerySynthesizedAttributeType, typename ArgumentType>
     struct helpFunctionalTwoParamaters
-    : public std::binary_function<SgNode*,ArgumentType, Rose_STL_Container<AstQuerySynthesizedAttributeType> >
+    : public std::function<Rose_STL_Container<AstQuerySynthesizedAttributeType>(SgNode*, ArgumentType)>
     {
       // When elementMatchCount==1 then a match has been made
       typedef Rose_STL_Container<AstQuerySynthesizedAttributeType> (*roseFunctionPointerTwoParameters)  (SgNode *, ArgumentType);
@@ -144,7 +144,7 @@ namespace AstQueryNamespace
     This class represents a library of queries.. Basically it will support a large number of
     different types of queries that can be ask of an AST and that return a list of SgNode pointers.
    */
-  class DefaultNodeFunctional :  public std::unary_function<SgNode*, Rose_STL_Container<SgNode*> > 
+  class DefaultNodeFunctional :  public std::function<Rose_STL_Container<SgNode*>(SgNode*)> 
   {
     public:
       result_type operator()(SgNode* node ) 
diff --git a/src/util/FileSystem.h b/src/util/FileSystem.h
index 45226678990..226f99ded4a 100644
--- a/src/util/FileSystem.h
+++ b/src/util/FileSystem.h
@@ -7,6 +7,7 @@
 #include <streambuf>
 #include <string>
 #include <vector>
+#include <iterator>
 #include "rosedll.h"
 #include "mlog.h"
 

From 5202fb881b0da5e49a295ae44959ea393a221550 Mon Sep 17 00:00:00 2001
From: ouankou <anjia@ouankou.com>
Date: Sat, 24 May 2025 01:12:16 +0000
Subject: [PATCH 33/42] Use http protocol for git modules

---
 .gitmodules | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/.gitmodules b/.gitmodules
index abb0f8de5f4..672019caae0 100644
--- a/.gitmodules
+++ b/.gitmodules
@@ -1,9 +1,9 @@
 [submodule "src/frontend/CxxFrontend/EDG"]
 	path = src/frontend/CxxFrontend/EDG
-	url = git@github.com:passlab/EDG.git
+	url = https://github.com/passlab/EDG.git
 [submodule "src/frontend/SageIII/ompparser"]
 	path = src/frontend/SageIII/ompparser
-	url = git@github.com:passlab/ompparser.git
+	url = https://github.com/passlab/ompparser.git
 [submodule "src/frontend/SageIII/accparser"]
 	path = src/frontend/SageIII/accparser
-	url = git@github.com:passlab/accparser.git
+	url = https://github.com/passlab/accparser.git

From 0f9c78585b2e2dbf986c0c0048a8defaad009446 Mon Sep 17 00:00:00 2001
From: ouankou <anjia@ouankou.com>
Date: Sat, 24 May 2025 01:13:02 +0000
Subject: [PATCH 34/42] Update github CI to test on Ubuntu 24.04

---
 .github/workflows/auto_tools.yml | 15 ++++++++-------
 .github/workflows/cmake.yml      | 15 ++++++++-------
 2 files changed, 16 insertions(+), 14 deletions(-)

diff --git a/.github/workflows/auto_tools.yml b/.github/workflows/auto_tools.yml
index a70535e95bd..64d97c130d4 100644
--- a/.github/workflows/auto_tools.yml
+++ b/.github/workflows/auto_tools.yml
@@ -14,21 +14,23 @@ jobs:
   build:
     strategy:
       matrix:
-        os: [ubuntu-22.04, ubuntu-20.04]
+        os: [ubuntu-24.04]
         gnu: [9]
 
     runs-on: ${{ matrix.os }}
     env:
       CC: /usr/bin/gcc-${{ matrix.gnu }}
       CXX: /usr/bin/g++-${{ matrix.gnu }}
-      LD_LIBRARY_PATH: /usr/lib/jvm/java-8-openjdk-amd64/jre/lib/amd64/server:/usr/lib/x86_64-linux-gnu
+      LD_LIBRARY_PATH: /usr/lib/jvm/java-11-openjdk-amd64/jre/lib/amd64/server:/usr/lib/x86_64-linux-gnu
 
     steps:
-    - uses: actions/checkout@v3
-    - uses: actions/setup-java@v3
+    - uses: actions/checkout@v4
+    - uses: actions/setup-java@v4
       with:
         distribution: 'temurin'
-        java-version: '8'
+        java-version: '11'
+    # NOTE: Ubuntu 24.04 ships antlr4 v4.9 but antlr4-cpp-runtime v4.10, which are API-incompatible; manually install the matching antlr4 v4.10.
+    - uses: StoneMoe/setup-antlr4@v4.10.1
 
     - name: Checkout submodules
       shell: bash
@@ -40,9 +42,8 @@ jobs:
     - name: Install dependencies
       run: |
         sudo apt-get update
-        sudo apt-get install -y openjdk-8-jdk && \
+        sudo apt-get install -y openjdk-11-jdk && \
         sudo apt-get install -y \
-          antlr4 \
           automake \
           autotools-dev \
           bison \
diff --git a/.github/workflows/cmake.yml b/.github/workflows/cmake.yml
index 5059e663d1b..69eb2f2ce03 100644
--- a/.github/workflows/cmake.yml
+++ b/.github/workflows/cmake.yml
@@ -14,7 +14,7 @@ jobs:
   build:
     strategy:
       matrix:
-        os: [ubuntu-22.04, ubuntu-20.04]
+        os: [ubuntu-24.04]
         gnu: [9]
 
     runs-on: ${{ matrix.os }}
@@ -24,11 +24,13 @@ jobs:
       LD_LIBRARY_PATH: /usr/lib/jvm/java-8-openjdk-amd64/jre/lib/amd64/server:/usr/lib/x86_64-linux-gnu
 
     steps:
-    - uses: actions/checkout@v3
-    - uses: actions/setup-java@v3
+    - uses: actions/checkout@v4
+    - uses: actions/setup-java@v4
       with:
         distribution: 'temurin'
-        java-version: '8'
+        java-version: '11'
+    # NOTE: Ubuntu 24.04 ships antlr4 v4.9 but antlr4-cpp-runtime v4.10, which are API-incompatible; manually install the matching antlr4 v4.10.
+    - uses: StoneMoe/setup-antlr4@v4.10.1
 
     - name: Checkout submodules
       shell: bash
@@ -40,9 +42,8 @@ jobs:
     - name: Install dependencies
       run: |
         sudo apt-get update
-        sudo apt-get install -y openjdk-8-jdk && \
+        sudo apt-get install -y openjdk-11-jdk && \
         sudo apt-get install -y \
-          antlr4 \
           automake \
           autotools-dev \
           bison \
@@ -66,7 +67,7 @@ jobs:
         cd $GITHUB_WORKSPACE
         mkdir ../rex_build
         cd ../rex_build
-        cmake -Denable-c=ON -Denable-fortran=ON -DCMAKE_INSTALL_PREFIX=$GITHUB_WORKSPACE/../rex_install $GITHUB_WORKSPACE
+        cmake -Denable-c=ON -Denable-fortran=ON -DCMAKE_INSTALL_PREFIX=$GITHUB_WORKSPACE/../rex_install -Ddisable-tests-directory=ON $GITHUB_WORKSPACE
 
     - name: Build
       run: |

From c8201c786df2c75e392d72e4c996f687ef61e43b Mon Sep 17 00:00:00 2001
From: ouankou <anjia@ouankou.com>
Date: Sat, 24 May 2025 01:13:43 +0000
Subject: [PATCH 35/42] Enable C++17 for compilation

---
 config/Makefile.for.ROSE.includes.and.libs                     | 3 +++
 .../documentedExamples/simpleTranslatorExamples/CMakeLists.txt | 2 +-
 .../documentedExamples/simpleTranslatorExamples/Makefile.am    | 2 +-
 .../{identityTranslator.C => identityTranslator.cpp}           | 0
 src/frontend/SageIII/accparser                                 | 2 +-
 src/midend/astProcessing/CMakeLists.txt                        | 3 +--
 src/midend/programAnalysis/Makefile.am                         | 2 +-
 7 files changed, 8 insertions(+), 6 deletions(-)
 rename exampleTranslators/documentedExamples/simpleTranslatorExamples/{identityTranslator.C => identityTranslator.cpp} (100%)

diff --git a/config/Makefile.for.ROSE.includes.and.libs b/config/Makefile.for.ROSE.includes.and.libs
index f7ba097ab55..b85f79a012c 100644
--- a/config/Makefile.for.ROSE.includes.and.libs
+++ b/config/Makefile.for.ROSE.includes.and.libs
@@ -32,6 +32,9 @@ if USE_ROSE_IN_BUILD_TREE_VAR
 export ROSE_IN_BUILD_TREE=$(top_builddir)
 endif
 
+# Force C++17 (-std=c++17) to enable modern language features across all compilers.
+AM_CXXFLAGS = -std=c++17
+
 # This is properly handled by automake even when specified in an include file
 EDG_LIBS = @EDG_LIBS@
 
diff --git a/exampleTranslators/documentedExamples/simpleTranslatorExamples/CMakeLists.txt b/exampleTranslators/documentedExamples/simpleTranslatorExamples/CMakeLists.txt
index d18211e9195..34d5bcf5235 100644
--- a/exampleTranslators/documentedExamples/simpleTranslatorExamples/CMakeLists.txt
+++ b/exampleTranslators/documentedExamples/simpleTranslatorExamples/CMakeLists.txt
@@ -1,3 +1,3 @@
-add_executable(identityTranslator identityTranslator.C)
+add_executable(identityTranslator identityTranslator.cpp)
 target_link_libraries(identityTranslator ROSE_DLL ${Boost_LIBRARIES})
   install(TARGETS identityTranslator DESTINATION bin)
diff --git a/exampleTranslators/documentedExamples/simpleTranslatorExamples/Makefile.am b/exampleTranslators/documentedExamples/simpleTranslatorExamples/Makefile.am
index 9e35a0d6dbc..96a4163c8d7 100644
--- a/exampleTranslators/documentedExamples/simpleTranslatorExamples/Makefile.am
+++ b/exampleTranslators/documentedExamples/simpleTranslatorExamples/Makefile.am
@@ -7,7 +7,7 @@ all: exampleMakefile
 
 bin_PROGRAMS = identityTranslator
 
-identityTranslator_SOURCES = identityTranslator.C
+identityTranslator_SOURCES = identityTranslator.cpp
 
 LDADD = $(ROSE_LIBS)
 
diff --git a/exampleTranslators/documentedExamples/simpleTranslatorExamples/identityTranslator.C b/exampleTranslators/documentedExamples/simpleTranslatorExamples/identityTranslator.cpp
similarity index 100%
rename from exampleTranslators/documentedExamples/simpleTranslatorExamples/identityTranslator.C
rename to exampleTranslators/documentedExamples/simpleTranslatorExamples/identityTranslator.cpp
diff --git a/src/frontend/SageIII/accparser b/src/frontend/SageIII/accparser
index e8c18d16432..7e5e4852b6d 160000
--- a/src/frontend/SageIII/accparser
+++ b/src/frontend/SageIII/accparser
@@ -1 +1 @@
-Subproject commit e8c18d16432eb5122ab0de04d3519d8559d23a34
+Subproject commit 7e5e4852b6de953fcd3edabadc8d8830315271d4
diff --git a/src/midend/astProcessing/CMakeLists.txt b/src/midend/astProcessing/CMakeLists.txt
index 075c79f514e..cf1c97d4a73 100644
--- a/src/midend/astProcessing/CMakeLists.txt
+++ b/src/midend/astProcessing/CMakeLists.txt
@@ -32,10 +32,9 @@ set(files_to_install
   AstReverseSimpleProcessing.h AstRestructure.h AstClearVisitFlags.h
   AstTraversal.h AstCombinedProcessing.h AstCombinedProcessingImpl.h
   AstCombinedSimpleProcessing.h StackFrameVector.h
-  graphProcessing.h graphProcessingSgIncGraph.h graphTemplate.h
   AstSharedMemoryParallelProcessing.h AstSharedMemoryParallelProcessingImpl.h
   AstSharedMemoryParallelSimpleProcessing.h
-  SgGraphTemplate.h TreeTraversal.h)
+  TreeTraversal.h)
 
 if(NOT WIN32)
   #tps commented out AstSharedMemoryParallelProcessing.h for Windows
diff --git a/src/midend/programAnalysis/Makefile.am b/src/midend/programAnalysis/Makefile.am
index d05e8b2badb..22336f32073 100644
--- a/src/midend/programAnalysis/Makefile.am
+++ b/src/midend/programAnalysis/Makefile.am
@@ -43,7 +43,7 @@ mpaVariableRenamingPath=$(srcdir)/variableRenaming#
 ###############################################################################
 
 # Taken from midend/programAnalysis/annotationLanguageParser
-AM_CXXFLAGS=\
+AM_CXXFLAGS+=\
 	-D__LOCALSTL_H
 
 

From 7236fb0761a9e7bddfcab43fa4756b62cdb3b8ae Mon Sep 17 00:00:00 2001
From: ouankou <anjia@ouankou.com>
Date: Sat, 24 May 2025 01:28:01 +0000
Subject: [PATCH 36/42] Fix git submodule in CI

---
 .github/workflows/auto_tools.yml | 11 ++++-------
 .github/workflows/cmake.yml      | 11 ++++-------
 2 files changed, 8 insertions(+), 14 deletions(-)

diff --git a/.github/workflows/auto_tools.yml b/.github/workflows/auto_tools.yml
index 64d97c130d4..34995c8bc18 100644
--- a/.github/workflows/auto_tools.yml
+++ b/.github/workflows/auto_tools.yml
@@ -25,6 +25,10 @@ jobs:
 
     steps:
     - uses: actions/checkout@v4
+      with:
+        submodules: 'recursive'
+        token: ${{ secrets.SUBMODULE_TOKEN }}
+
     - uses: actions/setup-java@v4
       with:
         distribution: 'temurin'
@@ -32,13 +36,6 @@ jobs:
     # NOTE: Ubuntu 24.04 ships antlr4 v4.9 but antlr4-cpp-runtime v4.10, which are API-incompatible; manually install the matching antlr4 v4.10.
     - uses: StoneMoe/setup-antlr4@v4.10.1
 
-    - name: Checkout submodules
-      shell: bash
-      run: |
-        git submodule sync --recursive
-        git -c "http.extraheader=Authorization: basic ${{ secrets.SUBMODULE_TOKEN }}" -c protocol.version=2 submodule update --init --force --recursive --depth=1
-        git submodule status
-
     - name: Install dependencies
       run: |
         sudo apt-get update
diff --git a/.github/workflows/cmake.yml b/.github/workflows/cmake.yml
index 69eb2f2ce03..5df9ff737c9 100644
--- a/.github/workflows/cmake.yml
+++ b/.github/workflows/cmake.yml
@@ -25,6 +25,10 @@ jobs:
 
     steps:
     - uses: actions/checkout@v4
+      with:
+        submodules: 'recursive'
+        token: ${{ secrets.SUBMODULE_TOKEN }}
+
     - uses: actions/setup-java@v4
       with:
         distribution: 'temurin'
@@ -32,13 +36,6 @@ jobs:
     # NOTE: Ubuntu 24.04 ships antlr4 v4.9 but antlr4-cpp-runtime v4.10, which are API-incompatible; manually install the matching antlr4 v4.10.
     - uses: StoneMoe/setup-antlr4@v4.10.1
 
-    - name: Checkout submodules
-      shell: bash
-      run: |
-        git submodule sync --recursive
-        git -c "http.extraheader=Authorization: basic ${{ secrets.SUBMODULE_TOKEN }}" -c protocol.version=2 submodule update --init --force --recursive --depth=1
-        git submodule status
-
     - name: Install dependencies
       run: |
         sudo apt-get update

From 641ceffd2d0913496fd6b2c8d942382de94f1b8a Mon Sep 17 00:00:00 2001
From: ouankou <anjia@ouankou.com>
Date: Sat, 24 May 2025 01:47:00 +0000
Subject: [PATCH 37/42] Use java 11 in CI

---
 .github/workflows/cmake.yml | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/.github/workflows/cmake.yml b/.github/workflows/cmake.yml
index 5df9ff737c9..860bc400086 100644
--- a/.github/workflows/cmake.yml
+++ b/.github/workflows/cmake.yml
@@ -21,7 +21,7 @@ jobs:
     env:
       CC: /usr/bin/gcc-${{ matrix.gnu }}
       CXX: /usr/bin/g++-${{ matrix.gnu }}
-      LD_LIBRARY_PATH: /usr/lib/jvm/java-8-openjdk-amd64/jre/lib/amd64/server:/usr/lib/x86_64-linux-gnu
+      LD_LIBRARY_PATH: /usr/lib/jvm/java-11-openjdk-amd64/jre/lib/amd64/server:/usr/lib/x86_64-linux-gnu
 
     steps:
     - uses: actions/checkout@v4

From 402470be7f4a8caeeb43bb885517e8f25d2fa2b2 Mon Sep 17 00:00:00 2001
From: ouankou <anjia@ouankou.com>
Date: Sat, 24 May 2025 02:18:08 +0000
Subject: [PATCH 38/42] Fix java lib path in CI

---
 .github/workflows/auto_tools.yml | 6 +-----
 .github/workflows/cmake.yml      | 6 +-----
 2 files changed, 2 insertions(+), 10 deletions(-)

diff --git a/.github/workflows/auto_tools.yml b/.github/workflows/auto_tools.yml
index 34995c8bc18..1c9b21ced10 100644
--- a/.github/workflows/auto_tools.yml
+++ b/.github/workflows/auto_tools.yml
@@ -21,7 +21,7 @@ jobs:
     env:
       CC: /usr/bin/gcc-${{ matrix.gnu }}
       CXX: /usr/bin/g++-${{ matrix.gnu }}
-      LD_LIBRARY_PATH: /usr/lib/jvm/java-11-openjdk-amd64/jre/lib/amd64/server:/usr/lib/x86_64-linux-gnu
+      LD_LIBRARY_PATH: /usr/lib/jvm/java-11-openjdk-amd64/lib/server:/usr/lib/x86_64-linux-gnu
 
     steps:
     - uses: actions/checkout@v4
@@ -29,10 +29,6 @@ jobs:
         submodules: 'recursive'
         token: ${{ secrets.SUBMODULE_TOKEN }}
 
-    - uses: actions/setup-java@v4
-      with:
-        distribution: 'temurin'
-        java-version: '11'
     # NOTE: Ubuntu 24.04 ships antlr4 v4.9 but antlr4-cpp-runtime v4.10, which are API-incompatible; manually install the matching antlr4 v4.10.
     - uses: StoneMoe/setup-antlr4@v4.10.1
 
diff --git a/.github/workflows/cmake.yml b/.github/workflows/cmake.yml
index 860bc400086..caa4399cdc2 100644
--- a/.github/workflows/cmake.yml
+++ b/.github/workflows/cmake.yml
@@ -21,7 +21,7 @@ jobs:
     env:
       CC: /usr/bin/gcc-${{ matrix.gnu }}
       CXX: /usr/bin/g++-${{ matrix.gnu }}
-      LD_LIBRARY_PATH: /usr/lib/jvm/java-11-openjdk-amd64/jre/lib/amd64/server:/usr/lib/x86_64-linux-gnu
+      LD_LIBRARY_PATH: /usr/lib/jvm/java-11-openjdk-amd64/lib/server:/usr/lib/x86_64-linux-gnu
 
     steps:
     - uses: actions/checkout@v4
@@ -29,10 +29,6 @@ jobs:
         submodules: 'recursive'
         token: ${{ secrets.SUBMODULE_TOKEN }}
 
-    - uses: actions/setup-java@v4
-      with:
-        distribution: 'temurin'
-        java-version: '11'
     # NOTE: Ubuntu 24.04 ships antlr4 v4.9 but antlr4-cpp-runtime v4.10, which are API-incompatible; manually install the matching antlr4 v4.10.
     - uses: StoneMoe/setup-antlr4@v4.10.1
 

From 2bf540809f58637dcc49feeddfed1b72c04358bc Mon Sep 17 00:00:00 2001
From: ouankou <anjia@ouankou.com>
Date: Sat, 24 May 2025 23:02:44 +0000
Subject: [PATCH 39/42] Fix java CLASSPATH setting

---
 .github/workflows/auto_tools.yml |  1 +
 .github/workflows/cmake.yml      |  1 +
 config/support-ofp.m4            | 12 ++++++++++--
 3 files changed, 12 insertions(+), 2 deletions(-)

diff --git a/.github/workflows/auto_tools.yml b/.github/workflows/auto_tools.yml
index 1c9b21ced10..4a82836f092 100644
--- a/.github/workflows/auto_tools.yml
+++ b/.github/workflows/auto_tools.yml
@@ -21,6 +21,7 @@ jobs:
     env:
       CC: /usr/bin/gcc-${{ matrix.gnu }}
       CXX: /usr/bin/g++-${{ matrix.gnu }}
+      FC: /usr/bin/gfortran-${{ matrix.gnu }}
       LD_LIBRARY_PATH: /usr/lib/jvm/java-11-openjdk-amd64/lib/server:/usr/lib/x86_64-linux-gnu
 
     steps:
diff --git a/.github/workflows/cmake.yml b/.github/workflows/cmake.yml
index caa4399cdc2..d856fbf2065 100644
--- a/.github/workflows/cmake.yml
+++ b/.github/workflows/cmake.yml
@@ -21,6 +21,7 @@ jobs:
     env:
       CC: /usr/bin/gcc-${{ matrix.gnu }}
       CXX: /usr/bin/g++-${{ matrix.gnu }}
+      FC: /usr/bin/gfortran-${{ matrix.gnu }}
       LD_LIBRARY_PATH: /usr/lib/jvm/java-11-openjdk-amd64/lib/server:/usr/lib/x86_64-linux-gnu
 
     steps:
diff --git a/config/support-ofp.m4 b/config/support-ofp.m4
index 274ac157105..58c32b89cae 100644
--- a/config/support-ofp.m4
+++ b/config/support-ofp.m4
@@ -90,8 +90,16 @@ AC_DEFINE_UNQUOTED([ROSE_OFP_JAR_FILE], $ofp_jar_file , [OFP jar file])
 
 # DQ (4/5/2010): Moved the specification of CLASSPATH to after the specification 
 # of OFP version number so that we can use it to set the class path.
-
-CLASSPATH=${ABSOLUTE_SRCDIR}/src/3rdPartyLibraries/antlr-jars/antlr-3.5.2-complete.jar:${ABSOLUTE_SRCDIR}${OPEN_FORTRAN_PARSER_PATH}/${ROSE_OFP_JAR_FILE}
+ROSE_CLASSPATH=${ABSOLUTE_SRCDIR}/src/3rdPartyLibraries/antlr-jars/antlr-3.5.2-complete.jar:${ABSOLUTE_SRCDIR}${OPEN_FORTRAN_PARSER_PATH}/${ROSE_OFP_JAR_FILE}
+
+# Prepend ROSE_CLASSPATH to CLASSPATH if already set; otherwise initialize CLASSPATH
+AS_IF([test -n "$CLASSPATH"],
+    [
+        CLASSPATH="${ROSE_CLASSPATH}:${CLASSPATH}"
+    ],
+    [
+        CLASSPATH="${ROSE_CLASSPATH}"
+    ])
 
 export CLASSPATH
 AC_SUBST(CLASSPATH)

From 04415b80d457b4001a99efa28c63e67acc315b9a Mon Sep 17 00:00:00 2001
From: ouankou <anjia@ouankou.com>
Date: Sat, 24 May 2025 23:29:50 +0000
Subject: [PATCH 40/42] Update java setting in CI and enable more tests

---
 .github/workflows/auto_tools.yml | 12 ++++++------
 .github/workflows/cmake.yml      |  4 ++++
 2 files changed, 10 insertions(+), 6 deletions(-)

diff --git a/.github/workflows/auto_tools.yml b/.github/workflows/auto_tools.yml
index 4a82836f092..54b866bbf77 100644
--- a/.github/workflows/auto_tools.yml
+++ b/.github/workflows/auto_tools.yml
@@ -30,6 +30,10 @@ jobs:
         submodules: 'recursive'
         token: ${{ secrets.SUBMODULE_TOKEN }}
 
+    - uses: actions/setup-java@v4
+      with:
+        distribution: 'temurin'
+        java-version: '11'
     # NOTE: Ubuntu 24.04 ships antlr4 v4.9 but antlr4-cpp-runtime v4.10, which are API-incompatible; manually install the matching antlr4 v4.10.
     - uses: StoneMoe/setup-antlr4@v4.10.1
 
@@ -62,7 +66,7 @@ jobs:
         ./build
         mkdir ../rex_build
         cd ../rex_build
-        $GITHUB_WORKSPACE/configure --prefix=$GITHUB_WORKSPACE/../rex_install --with-boost=/usr --with-boost-libdir=/usr/lib/x86_64-linux-gnu --enable-languages=c,c++,fortran --disable-tests-directory --disable-tutorial-directory
+        $GITHUB_WORKSPACE/configure --prefix=$GITHUB_WORKSPACE/../rex_install --with-boost=/usr --with-boost-libdir=/usr/lib/x86_64-linux-gnu --enable-languages=c,c++,fortran
 
     - name: Build
       run: |
@@ -73,8 +77,4 @@ jobs:
     - name: Test
       run: |
         cd $GITHUB_WORKSPACE/../rex_build
-        make check-core -j2
-        cd $GITHUB_WORKSPACE/../rex_build/tests/nonsmoke/functional/CompileTests/OpenMP_tests
-        make check -j2
-        cd $GITHUB_WORKSPACE/../rex_build/tests/nonsmoke/functional/roseTests/astInterfaceTests
-        make check -j2
+        make check-rex -j2
diff --git a/.github/workflows/cmake.yml b/.github/workflows/cmake.yml
index d856fbf2065..abf4992f825 100644
--- a/.github/workflows/cmake.yml
+++ b/.github/workflows/cmake.yml
@@ -30,6 +30,10 @@ jobs:
         submodules: 'recursive'
         token: ${{ secrets.SUBMODULE_TOKEN }}
 
+    - uses: actions/setup-java@v4
+      with:
+        distribution: 'temurin'
+        java-version: '11'
     # NOTE: Ubuntu 24.04 ships antlr4 v4.9 but antlr4-cpp-runtime v4.10, which are API-incompatible; manually install the matching antlr4 v4.10.
     - uses: StoneMoe/setup-antlr4@v4.10.1
 

From 239dfdad1c2e71be75a3354f763560cda8f0b2b1 Mon Sep 17 00:00:00 2001
From: ouankou <anjia@ouankou.com>
Date: Sun, 25 May 2025 06:47:28 +0000
Subject: [PATCH 41/42] Fix compiler setting in CI

---
 .github/workflows/auto_tools.yml | 7 +------
 .github/workflows/cmake.yml      | 7 +------
 2 files changed, 2 insertions(+), 12 deletions(-)

diff --git a/.github/workflows/auto_tools.yml b/.github/workflows/auto_tools.yml
index 54b866bbf77..18700c5b556 100644
--- a/.github/workflows/auto_tools.yml
+++ b/.github/workflows/auto_tools.yml
@@ -18,11 +18,6 @@ jobs:
         gnu: [9]
 
     runs-on: ${{ matrix.os }}
-    env:
-      CC: /usr/bin/gcc-${{ matrix.gnu }}
-      CXX: /usr/bin/g++-${{ matrix.gnu }}
-      FC: /usr/bin/gfortran-${{ matrix.gnu }}
-      LD_LIBRARY_PATH: /usr/lib/jvm/java-11-openjdk-amd64/lib/server:/usr/lib/x86_64-linux-gnu
 
     steps:
     - uses: actions/checkout@v4
@@ -40,7 +35,6 @@ jobs:
     - name: Install dependencies
       run: |
         sudo apt-get update
-        sudo apt-get install -y openjdk-11-jdk && \
         sudo apt-get install -y \
           automake \
           autotools-dev \
@@ -66,6 +60,7 @@ jobs:
         ./build
         mkdir ../rex_build
         cd ../rex_build
+        CC=gcc-${{ matrix.gnu }} CXX=g++-${{ matrix.gnu }} FC=gfortran-${{ matrix.gnu }} \
         $GITHUB_WORKSPACE/configure --prefix=$GITHUB_WORKSPACE/../rex_install --with-boost=/usr --with-boost-libdir=/usr/lib/x86_64-linux-gnu --enable-languages=c,c++,fortran
 
     - name: Build
diff --git a/.github/workflows/cmake.yml b/.github/workflows/cmake.yml
index abf4992f825..6018e877ae3 100644
--- a/.github/workflows/cmake.yml
+++ b/.github/workflows/cmake.yml
@@ -18,11 +18,6 @@ jobs:
         gnu: [9]
 
     runs-on: ${{ matrix.os }}
-    env:
-      CC: /usr/bin/gcc-${{ matrix.gnu }}
-      CXX: /usr/bin/g++-${{ matrix.gnu }}
-      FC: /usr/bin/gfortran-${{ matrix.gnu }}
-      LD_LIBRARY_PATH: /usr/lib/jvm/java-11-openjdk-amd64/lib/server:/usr/lib/x86_64-linux-gnu
 
     steps:
     - uses: actions/checkout@v4
@@ -40,7 +35,6 @@ jobs:
     - name: Install dependencies
       run: |
         sudo apt-get update
-        sudo apt-get install -y openjdk-11-jdk && \
         sudo apt-get install -y \
           automake \
           autotools-dev \
@@ -65,6 +59,7 @@ jobs:
         cd $GITHUB_WORKSPACE
         mkdir ../rex_build
         cd ../rex_build
+        CC=gcc-${{ matrix.gnu }} CXX=g++-${{ matrix.gnu }} FC=gfortran-${{ matrix.gnu }} \
         cmake -Denable-c=ON -Denable-fortran=ON -DCMAKE_INSTALL_PREFIX=$GITHUB_WORKSPACE/../rex_install -Ddisable-tests-directory=ON $GITHUB_WORKSPACE
 
     - name: Build

From 2b08899be1043303f0a8274bab69a05657736dd1 Mon Sep 17 00:00:00 2001
From: ouankou <anjia@ouankou.com>
Date: Sun, 25 May 2025 18:27:06 +0000
Subject: [PATCH 42/42] Use OpenJDK 17 in CI

Use ROSE fortran parser prebuilt by JDK 13 instead of JDK 8.
---
 .github/workflows/auto_tools.yml               |   9 ++++-----
 .github/workflows/cmake.yml                    |   9 ++++-----
 CMakeLists.txt                                 |   2 +-
 config/support-ofp.m4                          |   2 +-
 .../fortran-parser/CMakeLists.txt              |   4 ++--
 .../OpenFortranParser-20200819-JDK8.jar        | Bin 506043 -> 0 bytes
 6 files changed, 12 insertions(+), 14 deletions(-)
 delete mode 100644 src/3rdPartyLibraries/fortran-parser/OpenFortranParser-20200819-JDK8.jar

diff --git a/.github/workflows/auto_tools.yml b/.github/workflows/auto_tools.yml
index 18700c5b556..810c797e41f 100644
--- a/.github/workflows/auto_tools.yml
+++ b/.github/workflows/auto_tools.yml
@@ -18,6 +18,8 @@ jobs:
         gnu: [9]
 
     runs-on: ${{ matrix.os }}
+    env:
+      LD_LIBRARY_PATH: /usr/lib/jvm/java-17-openjdk-amd64/lib/server
 
     steps:
     - uses: actions/checkout@v4
@@ -25,10 +27,6 @@ jobs:
         submodules: 'recursive'
         token: ${{ secrets.SUBMODULE_TOKEN }}
 
-    - uses: actions/setup-java@v4
-      with:
-        distribution: 'temurin'
-        java-version: '11'
     # NOTE: Ubuntu 24.04 ships antlr4 v4.9 but antlr4-cpp-runtime v4.10, which are API-incompatible; manually install the matching antlr4 v4.10.
     - uses: StoneMoe/setup-antlr4@v4.10.1
 
@@ -52,6 +50,7 @@ jobs:
           libantlr4-runtime-dev \
           libboost-all-dev \
           libtool \
+          openjdk-17-jdk \
           python3-dev
 
     - name: Configure
@@ -61,7 +60,7 @@ jobs:
         mkdir ../rex_build
         cd ../rex_build
         CC=gcc-${{ matrix.gnu }} CXX=g++-${{ matrix.gnu }} FC=gfortran-${{ matrix.gnu }} \
-        $GITHUB_WORKSPACE/configure --prefix=$GITHUB_WORKSPACE/../rex_install --with-boost=/usr --with-boost-libdir=/usr/lib/x86_64-linux-gnu --enable-languages=c,c++,fortran
+          $GITHUB_WORKSPACE/configure --prefix=$GITHUB_WORKSPACE/../rex_install --with-boost=/usr --with-boost-libdir=/usr/lib/x86_64-linux-gnu --enable-languages=c,c++,fortran
 
     - name: Build
       run: |
diff --git a/.github/workflows/cmake.yml b/.github/workflows/cmake.yml
index 6018e877ae3..658626d5cf2 100644
--- a/.github/workflows/cmake.yml
+++ b/.github/workflows/cmake.yml
@@ -18,6 +18,8 @@ jobs:
         gnu: [9]
 
     runs-on: ${{ matrix.os }}
+    env:
+      LD_LIBRARY_PATH: /usr/lib/jvm/java-17-openjdk-amd64/lib/server
 
     steps:
     - uses: actions/checkout@v4
@@ -25,10 +27,6 @@ jobs:
         submodules: 'recursive'
         token: ${{ secrets.SUBMODULE_TOKEN }}
 
-    - uses: actions/setup-java@v4
-      with:
-        distribution: 'temurin'
-        java-version: '11'
     # NOTE: Ubuntu 24.04 ships antlr4 v4.9 but antlr4-cpp-runtime v4.10, which are API-incompatible; manually install the matching antlr4 v4.10.
     - uses: StoneMoe/setup-antlr4@v4.10.1
 
@@ -52,6 +50,7 @@ jobs:
           libantlr4-runtime-dev \
           libboost-all-dev \
           libtool \
+          openjdk-17-jdk \
           python3-dev
 
     - name: Configure
@@ -60,7 +59,7 @@ jobs:
         mkdir ../rex_build
         cd ../rex_build
         CC=gcc-${{ matrix.gnu }} CXX=g++-${{ matrix.gnu }} FC=gfortran-${{ matrix.gnu }} \
-        cmake -Denable-c=ON -Denable-fortran=ON -DCMAKE_INSTALL_PREFIX=$GITHUB_WORKSPACE/../rex_install -Ddisable-tests-directory=ON $GITHUB_WORKSPACE
+          cmake -Denable-c=ON -Denable-fortran=ON -DCMAKE_INSTALL_PREFIX=$GITHUB_WORKSPACE/../rex_install -Ddisable-tests-directory=ON $GITHUB_WORKSPACE
 
     - name: Build
       run: |
diff --git a/CMakeLists.txt b/CMakeLists.txt
index e7292b5e3fc..9d96fe6f248 100644
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -432,7 +432,7 @@ if(enable-microsoft-extensions)
 endif()
 
 if(enable-fortran)
-  set(enable-ofp-version "20200819-JDK8" CACHE STRING "version number for OFP")
+  set(enable-ofp-version "20200704" CACHE STRING "version number for OFP")
   set($ENV{CLASSPATH} ${CMAKE_SOURCE_DIR}/src/3rdPartyLibraries/antlr-jars/antlr-3.5.2-complete.jar::${CMAKE_SOURCE_DIR}/rc/3rdPartyLibraries/fortran-parser/OpenFortranParser-${enable-ofp-version}.jar)
 endif()
 
diff --git a/config/support-ofp.m4 b/config/support-ofp.m4
index 58c32b89cae..16d24ce2f08 100644
--- a/config/support-ofp.m4
+++ b/config/support-ofp.m4
@@ -7,7 +7,7 @@ ROSE_CONFIGURE_SECTION([Checking Open Fortran Parser (OFP)])
 # Used in ../src/3rdPartyLibraries/fortran-parser/Makefile.am
 # and     ../src/frontend/SageIII/sageSupport.C
 #
-default_ofp_version=20200819-JDK8
+default_ofp_version=20200704
 
 ofp_major_version_number=0
 ofp_minor_version_number=8
diff --git a/src/3rdPartyLibraries/fortran-parser/CMakeLists.txt b/src/3rdPartyLibraries/fortran-parser/CMakeLists.txt
index 80cdaebfafb..7256a09f47d 100644
--- a/src/3rdPartyLibraries/fortran-parser/CMakeLists.txt
+++ b/src/3rdPartyLibraries/fortran-parser/CMakeLists.txt
@@ -1,5 +1,5 @@
 if(enable-fortran)
-  set(enable-ofp-version "20200819-JDK8" CACHE STRING "version number for OFP")
+  set(enable-ofp-version "20200704" CACHE STRING "version number for OFP")
 
   ########### install files ###############
   set(jar_file
@@ -13,7 +13,7 @@ if(enable-fortran)
   endif()
 
 install(
-  FILES OpenFortranParser-20200819-JDK8.jar
+  FILES OpenFortranParser-20200704.jar
         ${jar_file}
   DESTINATION ${ROSE_LIB_DIR_NAME})
 
diff --git a/src/3rdPartyLibraries/fortran-parser/OpenFortranParser-20200819-JDK8.jar b/src/3rdPartyLibraries/fortran-parser/OpenFortranParser-20200819-JDK8.jar
deleted file mode 100644
index a50c48a80a775e1801e89a5f636ed9d44950027c..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001

literal 506043
zcmaI7V{|T2vo0F1I4iboy-8MV+qP}nwz*>4w(Vraw(Z<}``mNK9(&w#dW`O0^~_n-
zU2|4-)idQJLBUXfAR!@vLJX<pf&SYC1q22pEv&>(D=s5K|1}N-1PUZ4`3v$t5+MJt
znB4ynjPfJ#|AD3XWyD2<6_x0uMee01C!{24>E_@hX{n|sXBre37MXVr9q1&aX~d=H
zoXf$W)J`x5v9YkJ%wEt*$&L%D{v4yD9-xz^04-VGIovt`|Cbi>&{R@FKXVBG-2c%6
z8VKk|Gynf#!he)Cv2}2A(6^!gKTE;>Hz`{ayZ<KX_dmu%{vVQd`VNl94*v}h_&)%s
z|Nj8P{|5P=uO0LM1hKF&|1a48`da^UCW`+X%urX~(8=7^#!>fY5IVz4ZR^<c=H#!e
zcj{tFG_eRP`E5*c{Ce72`b~q#e6<VKZD<TE^&I(X+O~SGXBqU*Yw83fVTD2=iQ~9>
z8iKJw*6o~ufqRj=n^bc&{F?WJU0u4vuQZ<Tw?|ieA4)IP!hewun=8Dgr!~4gXx$X|
zvf^aE%E|xcYFtAt(R2^+znSUBiN?P;sp!OSYwXjH8lOU2xHfq|7(F6geyJFw;!k%l
z(>6!C7D`Jm@qWGbxQwMb-bz36_RMVI`6L_JZgYQR@qT9w9tyr@=yZSH_~MseA-o^l
z+~D_oxBUIO*{yH{ui)~!f3$SqIzk8~;^qEWIIQ`%vd!%!z4rFDj?eqSH1>45I}nPX
zJJb>OG}vC|^L7(U8R*S(bW2`3H$MzJV2mq`XPaf3$}}!<AGa>cD>^iB#Rk@|>YKNq
z%kx21{G-Fu?hNnesVpyto+Ss`u6HtCw|+L)M?lldWoS+Jp0<+mRzm)Ud~OnOkA8vi
z{+m1r!U$>$uS(TO_HyI_X;%_zx>{i83rRVdZo-SiNL^XP^Y4{p&rB2X3K1SO80q6U
z3qZ#dW0e>Rt}C{yk35g9$E)b8K660bs9WZ)0Rv`D&*|be?9%qAR5`ZAl>avOpfx!8
z@L>^~U=f?*zYoQXOUh7D^6R_6C+QB61On?{`bMLUU(e#_@L|(N7-<vYO6D2W{j*;Q
z-A3X=Yr+C%_&!Kyx3jx$8ByJI15)D$V>eadvn4QcsE<?k(kJ<Uc(Y^2(8(d}8@e;_
z-b|G0`5uQ#G>xnXAFxxFN{+dB$>f)rdLD*E)Zy??ElPVE#=fRv`$MHo*}ZT&aFhm`
z4xenxBeuUb9;VV;KRt*UK1SdNd~pn3VzEL>07>bcU+?k;PqBg*@Ag#h#U&?)5XVXI
zo~(}JqRg@E(Ygf&Eo~$t76NxUzlY;;%6Ssa4a0^IVyQs6q7}_)RlQJnxgzj$va&n_
zI)Qn}qgU>fCj#*^Yw(L|ex82|YyKWE1VS$MIzMiYyj?F;E}bxr>5Q+$YfWG}7BC%+
z_zWi%CX7Zs(WoNe1fRkNNX|%txKbF_$4k7J01_pv%;4LL3nXxgfX`<Iq)RI*@XXI0
zr0y^FPQ-3HM4C3FhT2o}<dRNo(k+3&-2WvFxXWm84rpIWweVtuPOc7tG}<((^%+HE
z#@w0-<KCwNa;{!AF~(ia%sCcV!{lDkHdk5m{Eo%E@I0qtM+(KlcaeEkSKx;gOJ_Fp
z)A+W#u_m#hdQz^Bjate|A&OEnQ_KgHQ3IJ&BBfV)VWBpqSFP^?>{d>t@|25R+#QgO
ztJ1CMn=j0TLdQik;F4kzVH2a~1O1Rp@=OU5K@&?8#e+t{CsQs62Vx!!cXsnE7Th(|
zi>IwNEaj>GcErO!M$*>8m4Dons;kKEg;q^qC4#}ej6+-1-@V0Vzr_kZ;<p){2x+gb
zXr7*5#){NcAtD$1NqxF<(ifzs`ruG~LK4sB*OTmyJ0gJwQvnCW#~36C5I~wV<v{EU
z-K~PQIpyLED(%=btaGVu8t1mhAxE6mZN@y!mVh^*=2~%}I$p2sS{h3Hkq#WAtt>VN
zqUuzEd#9yBHbK))=+RE3k;ygbG3O#DbX{)LUt=LHnQ={cZEzl(F=TVzpv8U-EkW$2
z&YQDXJc-IE{!%RYT9ErB|EHa5#+ArTF0~Mn>Vrk~33%O5rKQPLb*p{(^Q*D(k-{cB
z3?mgEAvGW2orFgQGLU#AcJw4*D2l@T2$`H{psz7PbGF%}t{cLxvLX0#j6p>%x;82q
zEmz7goW{`0I`<MBm^h-NlDy<>^Nr^r?(ejFN}RNBM;a%jU~`uR@k!vtY8Apz)O%@^
z+QwQqm7qxML^}S?3xY6!?`D>DMvq_=Xb+880K_&LmS)e!v1xw*3JX4iDg!u(MYWMR
z#Hik^S2K+kw28oG084yFQBw-)DqX{W9w%Ws?ZC_FA^0u${MKZjQX!6bDnRLJZ^;i|
zIRz+pD4HN0M*BsrUGfMzmuRG<rqCa-#R~qEBt)r&GS?A&3FNBMhWfYhJVtwm$j=={
z&&1O~EFvJQt+i9ci5Nsy_`X|BHHFF}7j3W%nHcIuH5w`#J2Xv$Uyav1CB@uH>KiW}
ze;2%T<16<?DFn23Gi?OYrm~%rT$6Nm-9F!buO3r_|8H9lr}K=o?U~qnrv?!$1{=&8
z><NwEI?rIi<Z(3KF=Jlq5Q7XtAmKk;vNLrId{$+|q?m6xetJ1J!@?HI8$<rif(e7>
zRctGe#v)3CsWB?>%Py-9-ec8_yK)V{*p~(g8YT7`c+IvCTd}F##=N1Rr6?;cbzpmB
ziKRAjbxz7HRh39aJOCrQRV^&c%#WoNjRxOIE|nf9O}zKjwLhAUEeE_iO+p_)!KM8I
zvLrozV|z<QRo68yxK^Jy!l}$(Eys>yVkM@iXd+I8ayp;nCZ&+Kg`0(w)A(CAfrfIp
zTJXa#W$K1uxj$FD)Cuot14OlB(6vjrX&s1QzlS!OI_3i{xoVI@?3N~81dWkK(cW+I
zLA&-Pz8oH><wU83LrLf?&V*zvw882ZN6<vOXxt{qWg(AA{MdlICWvnIxa)8iKFEa=
zZvi$;o@~iGdm7%Alt<|5%Zi|ujr6%CkS@ZlkF5qj%bN$}3))x_O|`wa;5gtN>GdGN
z2bpSt3qOPbx)SBSy*pqV0gC8p?F+FeXJd>8GTNtq;nj%!EboqCWQ_bTi72;_j4hG&
zoh5K8g}@&~Aq~@Lguj>869OcWtvL`1EBw-cO9^okHm(k7+EU6xzm*G&K<1`axL$SR
zk>6%szZh*||1m<EClXPK+u#QU<5_v?^fnC+mC?Y1pWd+@YtAx9ayNnAV>=;1A_3M&
z#*tCj_)hdz!DrD!>cE7Pd|(BD!#lJoltP#ho;%<g5bdV~b&qm2WdIRg<`Kr_OC<+@
zeL#EJIX0dw$zm#DRezvOKthvM*bCIcA|;zPm&mQ$=oF&F22@@+&}t3CfKOzMYHgbE
z5`py$m)$b%#%O$!4YLAFas@Rs{BPZD35JcvDkW5j6(o?tl6yu{&YE`|JA+J>=Qekd
zbtVQyN`k!l8k)PWN@P9PK2nB`cFW_}OIF}!W0G#;M>JIP2QRQh(f&Xs>4gDV)mwh4
zzpv~^u+T}AW^}Lqqvda>uxN#*Q|bM8&Za2)d16Qq!Mxgx@|CkZ5L}3=r)t;cIa2fv
zkfg;m2tFJvkuqu-ou`2=jFnT;L-M_QmXGi_Y-8JH@T8AT%)D+eaE1%*oV(eargoVt
zZ`1u&25h3I#AG5H)j$%VG3%aBd!Zx#u9?woRU6j|43G;~(Cx<M^IGC&zw~$CWVzxn
zRGTHZZ8u_rCDRw0r?J_{#^;j2!&rU9_bew;APLs-%zg>}ksc}$tP)8>c|f^7eDk8a
zL-)v^)Mu2DgYUG>vz!nnnH^q)PAZ?3hm3#&7_!;<6(2l|sR}U^l9ID+8qPYy2vq6r
z3FgsiueEO0Cr8SNK2y4XXQ6via5+0dKuVkH`LNDY&$-YG4s=08Kb<ulDz4mIYc2qZ
z)jn&8Uysr^Mrea^w7gohfYeTpbYr1GAKa?d#WE;W->3pwe_zw_B4n%EEw4B)NKcqJ
zSD}E3uceuggm6Yt&C(LE^5B|#X@MkoB6v~lOR5u+Cz9F|XTd43(ch)dLH^h(=QroL
z7uSj<7Br_5FN7|LB4jjI9S;&$dAU1kSc3CA_63@ydEfOOf89e4uV9LM3bAFz!{uN-
zGnOx~#x@1cYTES)iqk{nbFV;9&StTwar%i@3`NG*J6e9k>j8N@0@M9^B`ZcLJGt(-
z3rL`pRw`>^;E%gRXhA)emcOi#bR>J>!O1QuJDCkS6^j+djXQBfKCnHg71^-<VBWR?
z{D$OP!qO8%9b{zzxtgleKf6)0HzK+?bmuAVkWLPI>!S^eX>Mp?AqP+Q=f>YQjJR=w
za>UZ;8^~gNkby-sbFhRD!U;^Y+t(NT<ya5V-6Et>c$W!e7_xcVvU`Bq_P>R+aQ6J-
z!e{#t39!SDF$r4OHa#0xO<B7;z)B{z_wO793+~he9RZ$5Pz~p|qdB;DHs}l0;xl3@
z47R*cQ`kfH4sDauL}j6<J4#OL_G;(*7{>G~C!~nTezI_G;86g(KU|4V)?m$rt*sFK
zv?6$W8&AMOzpFN!*pB7|Uq;}&1n^;SP@ilPaS|1oej9=e_f)*&NQM^ktWMq19~)wo
z6g}(|{Dsl$Jb%g)5f%K|J*m`dagym^u|tb`&<54TiJ`dM7$BSyF~L>~C`CzFE;jw|
zEut3pd$^H>FkWb}@HYOXWmFL760ZM&bew2s9OdlqwM}<bsCC?Ojx0MZWc$Y58+K=Q
zYkYuwRI9opHXH9Ze26FH2ix-q)~SRsF;+E<DtOBu61ZCpPctEZ+-b&EPMes~BWI+3
zAX^!wt+cnobZHsy72?j6>o)8>6EdVE1n-KbJ1YapO?c?#HY3BO5d|-@1d)=}-fDPh
z8g2M!&-(F1Imu-us_Daua#NQz2c*9-`;skeWhNso;{~c5F6m7xBV;+3lQS1C=(t$e
z>D#mtdHc1RNqYwbJdP_kleM0QGKyG7@tl}tf7z~t7_MYD!khAFLjP=+l#p~papH2y
z4)6~G*nr{9*h(2vZCS-8&n|YS|El+WZn-m2my&yPPDVUMBulARxK>Uo6X?{>gFM?a
z2!l>M21OJ@QD|%O8h~f7<}AQ-ReZK$$6f?i2A^*3!o=ga>{!O}*!J6nkg1aIA|0?K
zZ74@)Ank`611ZEpimkTp_SKR>+%9es^9d;Moz2ps$mybT9lT(PMNUYAnrHeg@u{e9
z2M+3;ygZ!lb8D$5aw1?ymYGHzHi*WFQH}w4Y2t$n<jxiPgD4Y%>eeGj1W|=fa*Pt7
zt%9T!GW}X2tmo_Ww4f}6ZP?nNH--p`QW;hPIR-^qpsaM=Ps@NU5#78WghMSVxq-gH
zq8<Q{3S0AwanB0h07$K7S^M$4ye3B`ze>&DKo}~WJ~4SgL&LYUdr+)>pQI3|!yzwu
zmB5X5oh}Z+dab6Ke%o(q!_~TusRsH10*;yobWd-0%&)v}RDDb@iJ%$`p%NIWGX(%i
z69Elv=)~qQw8<i-(ZdExcUa495B|Yw4uaRuO6o1-Q?u2_>l(nOA=CZ{0uV-R+Yk_J
zG+!{V)5GoG)RI6%YJS<00*0e!cJil<0433A)3FFazgDlNK1`I`8-<0?!#+~Q+fxn!
zP&8e3r=8ZaU>RqMU;;!#6U{*)v!3?>gBg9cP{WLOQ*-E`{B}^<`Mx$U<$MM!r?vw%
z^)QmN`WPDc!6y}vKS-8?*SkuUc$xccYTm?pEpmW|^y{f!I>sZCG7r<slq=|*$j(YK
zmUJ&gCswR#;YPhjvOukFn+_q{oiTkSNe{C1Ta>eTwUs^KH;AWCtA6CsRabv?{N+@C
z=^<bpo2!5!wh0cq4cK}a=UQfcB1V&=_sHDOx33=!y}#=%NY$syqOqpulOkTO<Rk4~
zhvf#c*;0Kf@m{Q$Vxjhd_pxfzg_$71Cefb!@&LV{b-0Bu%YM+qQy6lVg8x7s<zItK
zu|iDxGK#@ly@c;m@C%r<<up{_&BkD<477M+=Q|274uMZj;$HqecJV)(#eWPG4Bt3-
zB*rZmn^#Vs^SYez!Y}zAEE{YGh9R9o^vm!66&lo%?|j&oI~DDHTzRhz&P-mD@xR*$
za>)=INxWphgiLs(jsDmF#hNnG7ik;l3f!i?yZI*P^1?{@k3UxYx<Su2a=9RDotkDZ
z()JS4)|^-=%cpRNUT)an6k9@8_eHz#WkLshzxiZoEzY$5pA`L90)1%vA4fYoQ~3ZN
z-i}CG#~zf|$IkUQ`hbl;xdnQG1o((GI27E$ZH}{qA95yyyoJ|Cg#E-m(QYyaqMeaT
zz&7r<6)kv^(KN(_A6nz{#7;e_MYg}jVa2{&q_^`86NV<jog&gwitmO*IZ@LlVqM24
zp;Hl*@(US>OBJAZcGbY)mmAvdTCH;?Syp-lE_aKx;3!5^9av~{NA*{oq6`+gpfEeY
z{Y|l#uufyP;ujb%eiM83eDJIRF#<qbXo-2VuZU*U;GE2tN9}+FfP8p&Lqn?m#=3t{
z%H8DQfntLgoa8OYV$7%#vX>Xf6KGas_-p*0F~AVt**Ayf=2%%_e5m3(#|{@_<_xUP
z^WQEw`T4Ekj{ibKrF36LvG`=Y#6+XIwqfeHO#BIf!p1recWHx)i3z~>UpR_DE&E^^
zX4a8QR25&`S`BV3lyCE2e@sTLIZMCtrqCTk@M(GK7<#*M&hLvVht+7q&sI`{^ot}5
zb<a4q4EHu`b;@PL@XOs$Z4=Wh`SO+ptEFDgcjJ8ggSUk13^yP8*_J_8MW%J<(+XpP
z(4?gYK#3%1AqdOi=N`o-!D-B-5mJ8txcf_sj6@7V+tnE2D<3V8;B9hmD1@XYt{+)4
zu#pCikn}z4XrnQr8|tsJeg{^+_i`Yd*$D}^q{2C1B?Cma_uf9}#SW}|^*>J$6;@bk
z7!hcxs)wvBTOhrXFkQpMN!XGd3b5i6<N#>Onf=Aao<oM6woSXj0u^)gGY>=NH1`eb
zP7*66?0SVgBJSs3xDZ18rWQ-|c<;f%fF46;XOheL62D;>qyZz1!YR2CJw$zo9FfXN
zR4S&-2UKroAg6TTj!+>q4ZWCuG>z7N+J;pc<TkZKXD(4nbs<fWQc-G@L&Y;LN^qnx
z5+9v{C#n-dx2$&@nB>FRR@-pfNQo2<i7kU<I`|PfC%ehS+HUt<i~|sBQI0Z|)Y_Iv
zzuYCCO-`78DiOer@P?kL&e?zK;92gU2CR;olZ5MQ|M0*}NNA#ojX-1E(o$lEWrCBg
z1h2;pu@(*CS+SnRPaea|P5fK7fE{bdtR_{OWv#~1ga4;xnPiFTM;?zCFY5@o+*AM@
zz5uo3C+K87k#?8itVdbP8Qj-N6f>VVXcHgx`=7NjMf&DjNbPZwdq-DjQnEr^HQiYr
zqw&U*R+J-ydh8mupzNQ7N=x9JCi<E=_Bye!9aTgn8zfv+a`1kkXoBX*LM)>U1NwTj
zm<fS}6_DuSGLoCtJrpNm)$Dm_HI9Ju+cdl_bjM$HeGQFqd2Z~=eytxJp&ysO)e1_?
zn^%tFVSu}ZLo9Ab3tZg1;0Ctl1fHIO*3B$M7l1Y}wQW1N?puRMfpjv|@V01Fd$(td
zE3w?t7`zwQb#ir12&GDO3h5Kb5E(Q|5e3b|_KUv+pQtcaB60udzpK~}x+~4LED<p4
z-5q5vdot-;ObE1F+4In$0qxeacx%4Bd(=B=dD86ZaXu2Epto!(Aw)}dc0Az*0ZoFu
z@7TuY<mVr^;ft;Wu$bNvpG^}??~<v%W@yd#ERaWbXL(M0{2_|VAfwIfb%GW!>hqF}
z>6kKsL`slXa^2>KGeZs64q}RgHy3F=%24hUvkCzkCdUTB=Jye4;5)SGpMB5rEx!6>
zFZ0=WpIfM$X_r*((J6%{GbY9QEj-zCJMD$ki#rlI7#OnEU%MB+wOGF^^qbnxg)IVV
zC_|2m!k?UG)oV8!RM@Elf*R@D{2hA0`=Fe2j+6Bxl>e#S7gw-<PV<Un7IUbJG+E#3
zvn!`~VE9u<l$_zfD17DbCw_o+-lavB+K7G!cd&l@TJ5KqetTdo?)kOhiVFS#XB}Cq
zKk{T2f3t2s7EPWKpjrXG92aCvNQn_c>5dx$PJ?Uj7cCwr1a0};usnvmoNM%Od*>%Z
z5-sF41OfFadUSE+E#DnWLt{55IiO7&%$0-Lv2Kc1#@M8M4Bi!sIZ^tV24CmO?p-5Y
zPdG6LbsFc%xE+o!J*Ca~=J#Ovw5SN2<4qi)^vwk#`?)QOTNxF+Pd(8K+m>+?nBB-N
z5tOZ<Eq`=Jm2Qg*=UUZfKzkFDM}Lsl^9eg#vo{IR=B;*)2cMZ0`>bWIYcfqE$uNqU
z6Uk18a{1STZP)8_471erADCm@WBq;ub^|FI1oYo9wx9&mpS`9;AQmjT9#&)-)a`Lq
z^@<77J}0Q0s?iMdZQ0Z4#+_W_n&T=1HNCyJL0C9I9j|>=Z?~Ax*saV*6?5qbaH}A?
zXFy_i5l#~^tTxU|GKvmw?i0r!8JG06rU&P&o-)HQq<Vw|+4pF}miF!Ia#*00K7Rzj
z_t6r5B6u(<mITTeCCA@|3vjn$_l{4+4Htx1$kgO@o61*pO>nqYw&@i8Xan0esMbiR
z0|E5qL!0^5O}J~DvD3t_R~E{%j;<Y?>9u0%=X&Q79E!?U4`$jccFe4`@HSHX;+%Kr
zlb<>VsBKFVh?KJ=?7!P+%|2r0y@t8FzJL<3YbjGn^e%FsrYASv$g!3DSz8xsbOzf<
z__MqFmc^|1tn2NngAoj8G3*t(XZY8{{DtH_%66}OSCrUPFd_bOYQ@)&QZI;^b-M2x
zv$tLI$udQeiWDVD&5O=2!;-Ikxlhr$|6N=>gsqNQ2DLADH;Fnf!Vi_;jVSsXBEc)o
z(^aMW_COPv`fl1zxpj$jylyt^(hL7y*>CR#>X01qqF|32>bA#_gpoz_%>a(iZqp#q
z?GIHM)+oVaHAar;p6nHuP(y`}8w<H*y?GO7T7i~%wdC?!KayT|&w}exb+-_*1P>x>
zAP-XNA4q+(PNLagzr&_-P2=dNiSTwq210qX)7P{lwD312#JsV8wn@PIHepMKRw1in
z$D#L9HmOH@KxEhNy)#(zE}amaLopwGv?RliO^mhz$43om8vYJiSV)Aym*+=Sdrxci
zc2YY|6v!7MCYzqynBtmvvwwwy?6t9ps=6&>uQia(n-Ju)RsF{+o+Ea<@^Ms=Or|7G
z1M$=X;&oQZQ%tCM9vmGdO;hGU0}d5fIE-q;go~LO`Q^J+xSFYUbJ+7xGS-na;vmq(
zJIi%XtQ$5%Djj;xHD5d7y0?<?n~9%ip(?5afK-0pysgW8Udnx1yZ-7<Cz9k>_}<)#
z<=ZW45iDw9*gM{0b)`5{mcU?h`s2MUot1Nv=39iTCEg)CtfCx+i|V*g*wU%RopCVL
z4iOu&)UbpPl?c-Z_WKAII5RKpWO{^FxI5=3w}B#j8Ct`Q@TDv&c4YXsDTQE;Gk3(M
zoNQq}FJ;n5{oWB~4WV%hI*lvjKI=4TH0m^%hK}_9Hq@T2cE8@`jtKj-A*5;sQ$h@-
z!fVhQdsFXavyrT}lJU#7-=nJ<K6w2eURXl~3v)m0kFCcj)j3+0O<GgymGq<IL4^>L
zg>Se>1@NpP(2IsBn+<4X<a8|NPQ9I~WUsWL2zm!VB1Q$s++`Ld4jMSfIKfcBCWKL{
z;(!S}03)3uS*0(StW}Ar#sNmhW-~jvr~01{%(g?_<{eR{%_f_N!%`e~v$u4ib6uXs
z6G*b^XIL&irMu&I>;V(M)^p5bT*ay==Vr_XFyCRziCfi|Qcn+wkB#NLk9td^YKv!v
zg|)v+?;>COa1}^x>%gWeIKh<_UyQG(W~3z+r{C84viy+)H_kl0zRGxvGf%t#3y2$5
zUrk)!BSZFk!31gSLg^qRNs~2#a3X+|KW{U$=AVGBwO+vhC9?S=$Ga*bH*Kf^Vi-3p
zHfYGa-Ch9b5F3yZP0V#EbyJ>F#%%R>iS~MT-IgorEch*F$R|h3VZr?(N8SYvfiQYB
zue)M78(x40OKk~7QX-lzsC)sd@x(K8h_4)*tS0{5??&U@=4{M<Pe){-{Az>o6N*wJ
z4ej9FA;30_LBG{>`1a$6izNC`8mxDl$dC^UeDsBA*<e^>gce{zF7M6)O&}w9o*xW9
zWdV-fRlmTCrJ*xhyq0BYIrzHq=9xVJU5$m~;3HfZC}+-ujYPh;wwac|8Aj%p$Zz+V
zce2Z;X@Xnq*g;$EK_}sMWu^g%Bi16#4*$AOdG%$>BUT!9@2H$a;zWlEDGX9%3~<%4
z-+WABg}R5J5niMB%q)K6M7$j0zbJ2`8yA1+`1}$J5){=&SQ}X99KduK1jfWzy8mK|
zf3cO17nu<arJ$Mp@?LUZV4MHyniWj@^u+pHJ(j}*HMjYT-3j(YJiFZGt4Pp#<eD9#
zytE%;x&e4AAFBfQSvoRrDWmMd`X~qlN{X3c-JpW`_yx8Ir55d*gl%$tdka6)!LWMX
z&br-q1g0_5ia~Qqe~R0!D=lAhKHO^av+9fsbXn=$+dTdrJqnLCRMP{t6Bk?`x%j6>
zKb*Q##(Y|C>$;Ci(AdA6KjBxCaRsU(=G|WDyrB^L5qW0_0*JpEjy}6H63)xPV)g)!
zCA{0@le1VyP~RT-nee)6A0buFGNsCw`x%$o0yR&Zg`d+~q!qFek0o4oo&UtKOfJja
z;RZcr9Li4DH;zv{V$+2&FO=aiH)B)yD%SO9KZP~Aa}t=MSB?k#H)2!rnY|Ji9`>>l
z(dW}kmoTBOqvD8@&0WA(j(YQlNLAE8H8LpT`n^CzY8PtLDva}ArDEg)D<n=CP+Qx^
zVnw()NTmtnQit2Bx-Ae$xX05muvXcO*+3Yav#vk!@k+E4bK+xS?w>$$ap)sD`4TY8
z-D$^u`_{40Y2{?eq}uh<$n;CGB(@1}NR*Pl9)t^Za6-mPBimf7AMS{V;>Yf9E+Q2M
z5jv@>=AJ_*iM7!2WrDj=5{EYZGS-g!DbA@a3orO!oaYzOC}fz#%n*q;G}G`ki+~gR
zgqUE4Y5JJ7RrjI-0mNkIBpuY7(oC8y<|`wtl8BH?Th8jglEuV@k@DKA_{@djj5<(k
zC)epgS!*q{@N7n5J_b6JG04M+xJXMn-E_eVMfjEr)xi%afGOo{QR4(DMZ|KNI>KTV
zOCvSqy>8R?_Hmv*2S>1r;dlC$7e(&%+~4)NR#WQ5@MuO%cl#_RWS;euqh9bTVF#xI
zlg|a*YgaB}Pz2$gzLWxiKDLqu?4GI+9VAm#B(=*s_fO@E|8R&5*&z4Ke<$EH$wRnu
zr8UW5+pe(+Be4jV3`pK@9%U5i`ISG3IYPib)+~g2i-|A8&oA2~YRk?*tr8nF8m}=}
zuJ{Sjvf?WE$n@HFfOGB(_t8i%!Ys_((tca13a8KzUSn%bi(h<0J+-^evoFJ32%zg<
zc!v+F)kMQkSnFW1q5N_)?u1z$0Ntm;87XO4I+MfW^P1efJ`LjhCpkx>cF_WK&3Cm@
zi79l(%t1WvwZ%^mzKw(~x#bwdI<KRN!M9w&z%Ay18BvgxN-Ze<N)*n37m#U~6e^&d
z0f7;7Yq$E0y!)zENMWlx6JLS3{BC%T_WXInVjRf1YZ>zR_0m4%&FhtY^bwB?Q=zk`
zg6nCS!-)vT$_x|hc||gn*&^I-<G)pzIT@U_D@C94)3vsTy50V14lyVA=J~bQF?m?@
zUKpC`?Z0DlDA~w_R)bT_5Km37SX@!l`haA*t&y0|0cJXZdK;VfNA?VPG_cW@(M0@C
z{cVjYVrZyUL-v+GGy)ndH%$<Fph<yTZoweMaHykJ0*v8`7~}SstDuLYEtl5x1X#&e
z<fcaez}^TI7R}~MFElAi5F(M#VlLRMZYV;W%TaK(?Gzw9nX2DLif$QY1bXvbo2G`;
zPMLmt``)j^x^)PMkK~^X&*Qfs-wOEp2H$^)UqYD!tY76BBw+}`5Nk`nxg){BAuYOL
z>+Ud<Z&kQ$c~2rn9EaI?U;^bdUD_>_8TYUQnSQfzQ>_Fm<j%-{oI1qpdHzE)zonA~
zg$<1}zIa9!sU}Oq?bg0dq^dbmsHd?Z+&Q*JqG;J7#^n&ZW1qS@rho$PXhmfy)d1Uh
zE>N9*C9T@Fg5UMOxkBvvT^7rb6DDO$Vk^{dz8jA*0ooau+ZTDA?gZTCPX1FQ!W-Xp
z>+0MJ|I$;tmi2CIy%zNZc;N~-FFp(}VE=G1l0x{jNTTP68s*U6`hi>}l+#`!1pN1k
zNt4FyL`8mzIgv|!*IB80M(SBS{H`~`<5lq8mwPaIV=q#>r%ZK`3~N$EjB9!IXhlnP
zOy2fkfyTJCJTWPhc3KFjluLbCe>?vOPyF+!*`<*t3`djsskp6QXK_+D%l@P;@%SG&
zQWhsPPZws978-s!&7UO#EE8zFJyzU+M>|TN5cNDmW8;@6xZtrq2YAg&)~&p5fS>0o
z|5+ceQg4(-($2B=c1CzLw5(j=K1vDq?bhl?BLB2FFElbql-(WGliSb<oOxc4I?XlP
zs_^HLC23EzT90jR#S==AdXrJ)M^Tu}j-#liE!K55zx3GYJ%ztx$0~&;6dD`0u%iBf
zwMaY!t19N>Q|}F&aNS=#7>_moT>4~^KUxi~Tc#a69kK&K!NTpwT`k!iRRBR^ImuZ1
z_72b3E{JXbzO%)wQhUT!!b$PdIhTkqvcu8X0+9mG`+7>8uNzj~8f5x1YUurByO-Xa
z@e-ZBY+!1$2ab0JY3g;29aMq3C7EQBGt1^n;Uz;Kn5|mFu=)C@i*pG9O}%HmCYVOG
zfRbf1B#K5=3SPy~40OAFfw8s?j}_WGX-5Xlej^D2j#|(#e}2SNQZue={$^kuf;YCF
z{0O}DM^G?FDH#%Y1fJ@P)3)F^AL+Tu=bq<dB!0kotjluCUg-4@0&nZhfU|%2nBY0O
ziW4<$f%X04^Zd#-o9;J(_h(?^N%d#jlJcd}_vW&1PtEsNtpzRlSeEc%(}{g+{500`
zX2VuIJhp^)5WBS+iMo?S9IMp%aHy+v2YAT{gpkooN{nBxbRrCDo|9V+?)Gudh?q!t
zTZ>p(Zt5Zd%J6uOXhySGW(f-DXzB=~`)J}y)D|PZjv|~zk<!z>92ffh$?;}epN%LK
z95yA{Ml&xC+HwlG8=8EGn{1zcdVYmqUNpjlkcQx3NFbrSaZVg_(fgUKhuC{g9jtd&
zJ)R}!BD;OJTdn}^F)eOYp(n(a(Rs8jc4ffo!nA)PgDxAwh66->YW=f3CVzTprTBb)
zADI=56dPFZEwOsXr5Wv{wzoc5T7?o`PPsBkL6}kScm-ET(#RqROzT?m%=%7+?yElM
zyqcyk=oXKbqVIZH4{mwSrH1GJpkxEKE3ZLF>K1(RmJF)I(zrwfs5FhV=`T82;RQPD
z<+L0DD)9K^fPuQsOCGe8TZs;|94-vGG>nish8zA4HBB^}y$m`DUbc#6<VIXotD_)!
zqRXq^&TO07>hs!>2d$O8!i$S@4;<@?L(kMeqC^E7d*rIK1(xj;HT0Wl$E=H*mvEBf
z7XA$Z-9zc^E>nN8bBH=0)GiWrg~B>Z9<eE`z2k^svPx`M=qg~KYz2oqi5)3hj%~7-
z&f~0gtCoakQuoWdBh0Y=R&Ba7*l#p-O783m{Hue1epnZKN^C3h#jc=WJ8VTUB_{L|
z5i}fhWYjdj8UYX~3oK0-pioM&TvV+JKV%jWVWpC_e$<it>0b!<VfF4tW+kMNV#!5y
zUHmo(qBfHUZDWwr2dE@q;-5WqB5%i=hTQaI&PYe?*u+jsDMObYI4GdOcAi%uTu+)0
zEEvBK<5?QCww?5hw0xMo?`_EO4S!{zRf>XQXR#tcoQ;EUp_S@A+{opE4c^A{mC-4!
zcAr&ZT?LCorR@H03QIA;8u$DIGJ4n{WZk_>#7-id0EgjhCu<DAz4yU&ymLJhtlId)
z5g^KFf|Xw&m)e{W3hMNeSOgsx&W@0JkL5F6w-KM(H~{b*7F=S7^3bwv?3AK)#ZTgq
zSVtpmA0fq@2SvA&boyJ1aSezu>!H<P9GgoZKw@9(t({9ZoQi%TpfzRO5N)#L^K?^E
z>rf%c$m|rEC(K6IY4bLZEHW<;!!0G0H%)JvmTA!8agyTf9wq&L2l5^mUp&e_jz^^4
z4Mux4Mel+Z5>ITX?h^gS<}y-?RH0Egaf!8j3ShcSO|V@M*>!uai_))jopD^JdJcvi
zkg1}T28T6BoFCa4TMV;wpj=?N2E8zZ>ds!{@V!9)BBIu2$lZpiBTd`d&|Am?gZ_&~
zO7VI1)|@84ypssUgJ;v<tJA?WA0jJM6$|osuBSr_K~Qr1yBHBWX&bj7<2QdxWW<33
zcM3_{1=Iy?YP<A&A>$M!J)^e7f~PVb?S$skEB{GjMuHC#V>Ba!?Z4WGwC94m?#K^~
zVoZbi>0;1|%Iu7O0&`B%BtmcF$H?m+%eV#g9*PNb@Z^phP-6|bFXs?oD42In(&<mV
z{mt1Ts!JB$?M871LiM#pC8ThseRnTIZ?!eXiL52;z0lU>*XkFPV<QlGUkE|%BSA-<
z^8|pUJyd-;UQ)Uul<hsFZa4(^x9W)=GURJ%wgxiSccaZymt@77={$11%Tlt=i<7KB
z>O0Y1R4<O~v+5x_S`UX+Q%?DcfIfU;lzw*00ze1Nkst4WoE|OqD*_|cxAQw8Yb<z4
z$c@)i#kB9`WtfZEvM$in3h&KG4L@&}ct=DHwC^U*V<8Z^q#?@daYA~=B}e#<UV3kO
zl=d3Q<8fTS>&~0>VcFOgKSndPdn9b5{Ug5R{S=LN?>2{>;|=A(Vdf0>?OprhdH+e#
zI~8Ax9oOtT<w3_8e##+Yw$c;Q>8mkHEJjFRPmtqg?>2a2+1ETc{3V^e4D~^>X;8Ny
zpPG)NC%VmKI7Bl#1=ht*rW`T;nwkco$NE&P`}0iB)q(O^Tz<CA$5V{HahCo|!n?g(
z>5i1PCy(ZPiFc6lD`fU~-S=w~KjF@o64B>v!uQKF_=0Hq!L@Rv{EqiQ0m9e~dt%pm
za94a@B)9hJkIll%H%W4FD~b1u=Bt6GIk6Ks@gE!i3QNk`I{=a_%tM!U44pzk7BBbQ
zxkzgHN-J9#P=Z9^PiM+(*sl<ag*#Y2KI+C^CV~CtgFM-eedc+|lH<T)aL@1lK5Np%
zIiE8y+Y5Pc|Il`rP@V;jF<N58UFnBhHZ)cCG?<nm>_>mPV1K92TF}^O1Hrw&W*^iw
zxLy4)WB%H{o;3DwlTlM7BP#Waiw!}&VeznUYfGVInG`2>(nK*MpLpkJLfUVA0itnY
zyVOL=ORVAHuAOG9ijg+k96as0zv{w(8gjxze(YgypQ}xt9ApZ|8T9PMA%<sr!Uj@!
z5@;s6h6~3#sc(CRXOxjw)$0oj*Aa*{byed%Af$1ZzP-$FW<Qes@=z5Z)$u_*v!f^=
z&oO1=d=pGi)W_D9#At8m^WxSeRn~@AH?pmWp1KT+{L->;z#G}K@odxqWR<b^@u7nm
z$SukhpTAAZfASk1Q{kdxK{jo)rO^38Fddn$2U=i^9V$f&{p_wnB5)j;ovei9-VRv}
zqOsyVTOg?z4t9_0c*P1I)kfa-_t{NO$xYNEB#(DMZG4bD6|XsVAgR_JsZVr0`kx6`
zym%_;7{knxI%xD-rd(~G4Jyg*qz*XCxt2VE_hM~gb&8)fQ!4Qb#am5DIpKwWK5++1
zU~J+s9oPLXaX-oRxY%_~9>hGY{Dbmrjx1(u(A={4VYjkkOpp$Vt@^LWg5c`~J$fJ`
z8Oe7oE^?-9F1o#$GWHuZWKGZI;x_!!HdO~=I01wydIYqObI|{at;*2dOy03$_f->j
zpWpvEClFF(%BN2U1hg6TpK}BM`;fu^q^-03-)QS1|BJdW_g^e~{{LdIOUQ`R8CvN(
zIu2>Nx@`<6|I!OTpliF3R3KThA}`)J(J>f`$+TLFAknP1nsCvxLzfg-17BX%Mk`{!
zB~9JRT=2Y}lDVF0Ta=W&n!iraS}W3ZxZTWT;{^)*$ys^4->km+LRF8ZCNtTtyD;^x
z+nzu1Sz-5SDw5ciHQAoje%&ogFHdbQ({3&gw9~Ew+M7MQS2||_Pm>#s_qh!RlPb8r
z`YyK24<ErWE-C@Fm>geLa%D5i*|obN4K#ojL8d2$%Ydhp^{33?cFDkcODs@M?(NN`
z@~Mtp9@B1#B<Cv$Za}o5NzmfktA!kg5f*n*uPp$##~f?nr)_GdpORCtYqffpsWX+m
ziH_soy}W*1-CCrw0OOT8EOb|pv)x#svjCS}o?Xh`(U8INc#Pogqh9J_QRvC@Co9jh
zeV6vd<{!K^QA<N4?g?^Hu1ZZiHD)CaTRid_z;UNHLvYfa#T2+dcs?I_4X))ZB?CD9
zv6DFMX=4L8&n5Tl4Q5JM_+Rn#xKX0cm3DJMa<=}SQo(^zcvcsk@V~<7?sG_p?&4&!
z^1cAoajh^%j_0Q4Lvr*$izPVjdWDYVJ|_E=QQC|O=M}mRR3>oVdgg!pW|5ERupM)i
z@`2HoX{ry+#?i}*zJW@xMQ=$KT?OW2(;<6JSI0itCW&6PS1HSY%eBO8Da*are@~qq
zJFmrz34JJE!?dDjMj$1p(AX>+>l)R%`3#D7pGnF#J+hVc#m^}DbNXVS<8LXO3eM88
zahj5r@y+vQXl&9dDi&%liaQ;RlE|qz^qkTo(|b5${dZ}iNY)b9nari9|D>D}2x=66
zQCu_|!*$@s<#43i6uhcJB*K<N5x{0InVlG+u)&%yu%O}Y>Rt+7lf-8vk9OrKKEiVn
zWyW8g>&uNdeqI%vc34G2RnZ$8$6OCe%-HW|7;s^?Q5(iXm^Ao*+Vhx&b4f~UI8Zyq
zPcP4m4l;4bs;5anan2KE!rPZ1UVl4Hwz0JA=VDZ;-WmiK*ST#6$xJuHRLj<Bo_5k_
zq%x4w#zz!e^DYkO?<m}QNr=|5(lX!7mjjC`6ayrV{qkw7>*ioJi;C4)rhPyV4+H9H
zi=M^+dHXqv&eUJ@0`kOW!9-cltv(fGi57$&L7-8PSq_ZR{CP*n<>pb8L}mQ2X0Qiv
zSNvz{t+HAIZi8{KOq7W(oTRJup*bm87LitrSlq?O3S#l3SMq(Q@yJP_OxDoopMU|s
zfa5TQ8d~-|@`;BmB&2pp<(1o-3dO$Tq}GR&=JYVHRac8Oy^uAvM(E2uhZO`-&N=zB
zx2tsaH{=k?h%_mg(aBY=MejF?ID<K(4LPeY5zCx_;Q%}RGFOtoB~~!@9{GR%3}NM+
z?{OXNI6=k^_-QhfAnWJ-Jo>9($*7(I2*{Z-(s1>Xa<Mom7UF9&jdD<BC)I#4w(w%s
z+&FdTBW;ag!jMztQF4HWJSh?^6(_dN5=)>Id%}sTMwTZ@Fzz|^O*j?1vefRw;;xt9
z8N0fD8yY3K-0+fQUcY5^{%;J`+D1wUXZRs%ZqS;)@o1y3RTjzj%${Cj)__?}c^pU0
z>3~cU!s6#-kS3wgic!0ORimJcbH`bYyll0*42f{QB4G$+YFZBQS+QWlkvcX!Hck3p
zlhlqly^b2rz8NxPj^$1qu7%%{+>{A`SFBJW^C|N#>GpL4GR>fY;c{IKSWsTGp@lS4
z)xBdKpOgv-m>Rvc{&O6n<N&7V1T8L?8WeFED-Ck<{b{2G4C5`1w_xm%eu2tt7ZiLB
zL$0)+`pFHTDzVYtw4O4BQCk{Ap@lp_SffQ?e7>rIcyoh1e=1324my^`hC`7O7=S1f
z_W1_#d_I9~i*AA*&>jX%L@j0?6HO;f{+l(tP&vkPM}nB;=oTIX(CY#(9Ocm)P9af*
zxOQbGXiZbplr<qIE|k_dEKQlQU<Rf^fq6|p5EEjJqaV*;HlNTw2QkT#RYXB26?S~_
z$@b&WyA=S9h+<^A);R?s45Ib`b8O9HxsBwl08(w}a+KBmRb{>HquH{397eXn8z<d?
zOD-(4CF}aGw%67GbI>LB#TGj#Gyyp5eHi`Oa>rnyb@2j`4m(RS?#)vpQ_Of+Tg$n&
z@^T%KLNTI7DRUI-NE7=pIVyIn>tdJuqX=BEK{!LXilIz5NQ`Z)0kKTQMw(0HY?1>)
zAyfIP?4-Wedg^gh9AYFPEmma>pE3B?oLGr5h;8q6LR3gERN?7x8CFRf&Pb|Ri6Koy
zynv4JLPPt|oyKy&EbFpKP~S9C{jk)H0ZI8>35zsV2fa55#;l2W$lmM(*~u<a7Jeue
zoeUI-E_4@%>iwMX<S?s^N7Hcqt5G2-9f5Kc_#%8f@-=%oI_X`AqE>T<#B0VrPuYWw
zNK>TSvSb;G_TXCXfYUGMm{xGD_dTLmb;l`=6oR!m6+@CFBSV@0SZiu;K0_j+D!Bq%
z-VDbn9#;?^uwGF)JceFIj&*F5k*iH&#2`GjYcV|s6QR{^55AxxbWFlh{s*GGs7pdM
zx{f8W8vJCMsZslk@Ksx^%|7i3^>9o$f-6*b{2<lTTiG>y+PMTYS~imQ@7hgStsFv1
zu=wEZ9DU^ZAJmphNK$Q<x_iUE{D?JH1`Xt_HG@8#l1e>dXp?oM@DX>2;eUw_Yq-=`
z^FcE~b}?t9OtDE&;fOb%fi+GN$1JZ9e0gil_@g4PeCfXa%uxohC^qYeSP1)8u!ap0
zYc59SKYaS)s|b#Zgn?XpaEAo$@a4Ry5KtxcczH{4RF3LJE%WJkoF4nEV~ncnQk`z!
z=$NK`=;FUQ02u-3%?!nwd*l5^nfVy-bSoc6!F4J8wb{FT>~ZN#Eh7>@eWp+nc6xO>
zJNrNRXjJV3u{$q09py|^OPT$+Ri&kn3KxcSadL9RoP`?6Sf}5_rgB3N)cj(aJWD+?
z5mbt^=-MS02?#MjB^#PG?ebmi?1AON8!|}ZEA8ULe726gz>N3|q{eD}dvu<PMBX~W
z%5-uOM)E8x<glimbJ3UC&)3-PO}cIOa`B=;q<iwu`;^Umu9H}C%0&i#r%#bGnqY8V
z;Bzd2*fX70;dmQjL`+<$Fw)g8C`-X<VG8Pv^Jbr<CGl%)f%TPj=`o7gcaxUzh;GFP
z!$Y$K`*(}M8Fm`vrz>RYR`P_W52b&m$#D?RhRhce&6#sVeFcOGq9Lt~=W?eJ#YqX}
zXJt&-XpU+s==uq~ex>V69%eh%2t;gk(==u=aPY@cJt=2Aj;+6n-PUTo1L`v6C_mHQ
zUDrpcb=+rgV#{i<z#b3a1nC(Q424pEnxDF7$q4coMdT8oES!%Kgt{8EL*y@69Y}w-
z9AWsG!`Ou6Dq04of&?y-32Bhx)ijLwe8lrM;*ZZ|s9nDGMZHet9nE1#-@6D*4qtC+
z1*_)@%gSd+zi!I5;RXnl(!lMr&B^N+N8AcdYh{IJ*4T-p(PhXWy-32Zg$h6=Cac?;
z2%;=bvylGen_e;bEVoN7jK$FE%FFK@8!?I&uo0Z5Vr}a14V8|V%Wm|BnXVtt^qOHP
zIS;Y>t-avr{wa|zEp>@q97fubhub@h_^kr?S#xz_hNHGM`MBx2#iX&Q3Wzxey!1ZC
zA#|)$PG4$bK2>=vb26&xT4#&*W69Q7!qF!21Zy+^2wKHi3o^J7RH;Z`4pFTj@G{Ts
zITXAV;~@b1)@HDSqqsM5qNYoNHr3xleM+BYE;?!Q{!T@X#Zu1OO(lHr2nmPy73}tj
zF;5_lQveqx;{l5f^h)*Zn!C}hMAMR5)G|((Q$E<-WDVm>d630t>#C&O=`vM$n=`f~
znmh|Roer^76)qAX&Cgy6Q|(xKn(+42RGVZo+k}#Q%rbI+d2(q!c%@jjN6<8XkXd^&
zO?LDkOe_E0e&>l0yr>K_PKziUau}#0K_#?EL^-Y&bZYAsx`vUolvwLC@|neOC|=~p
z{}%HS7a+w~^3mLK(gi&SSO)iTR=&^!F>lk7LUJ!+!T;BU!CNA|{<k>N71nD)&(qkR
zT=#aP^lc7YK0Sh&w2CjF@Dafb_DhVI$^i8Y=<f%WK}i7^o-9R14?3!h1)Vv^a1}Bt
zrTsyC4fD+@VzbqQbHGNupz+zV%z_8y2e`f#OeFf9{@u74)7<LU+uO;O)E%L}X`B>*
zh+^CNAdO(V0A=5l_O1AIUcv1XKl?s^6E|XJ?cg}sNh*vwUEX<b%=#4w)q%D?ruA}o
zMFdN@$7XUTVtqP|rdnj>i_evW87Z1fX~_|qk_m10>L#Qow4ZcJ7e~zF5ELUg47ih;
zqh<EUI!u!8H6vigP$Se3FdBDPcWlYSoy#b-KkNM<PtW5=(PGi0Y<_3(QOPco5ktGh
zdcy^t)QUlxDAyQSJW~W9O)O2wwrbt0qF&O)1opBtHA&dAbWVmPcHA4)gKZdVBHd*c
z|Be2xG(GP_u9bveY~L?6JVV0d`}O-Y{!)Y@q_z2rOh2lu$j?Q(v*E?SE&&twDr;Y5
zVvqTu7<<Mv3)Abe&>kXP@z#sJ+EK)C7scIgOv#gW<a(+?scJn^hJ^#5?I^?+Z|S>~
z>lA>#29<}hsCpUk7caa~C?n2Gi#dnk<w#zub#J;7RMhsode&b=OMn7-<~@JWJVIWP
zE~SG5y$7ivnjVI>yDDX)n!@10ieC9vG4n&`E8qUt`;gLEDgeEKSf|PIN@-WYTcl;q
z6szF{6`oyjGo`1$PV$L=yP;v-MYH8eJ%;6PqmplrVn$I)!#~<FStQl1==|@4@9kK>
z!i1!dt_rwnDbEUj#jVq+&<~D+w7S6NOSWdL^QcD%^+|@xDzJ`dytlv1u!4H$kk!1m
zbOT<$xZ|KseYa{)d=cs#$R70{5Cfm6^?De4?S8++F;3cnJ;?VG?O?p@$NgnsWyk`{
zVk*Y80kAS|SXt?}qTY>QjWBX;xd9FQ61axinZa1c$btMI**6L)!6;$M0{;Z;JB646
z@h<#{-2FG}8)Hv5aNo;|e}^F8iw?AH!<DuheDX{*$_w@p87+yS1N~;4s~h8f3G@j)
zTLZ>psx@?D5#>pKf)Knx7v<Pe7rM*RTf_3iv|*|>V#j-A&wawiHxoVU2z1{D<-i8o
z1MYwjm<9J%<p=+Azmw{h>fcdo3cj!5_a!{)9>-~hW1t4!1#toj;paTM4Z#)kiPf7~
z>kIROw8OLmy;fuJ5gHxJ>;?7`3+9D#fCu;C(mMjggLVVo>kH(C^T305gU{~^a`Y**
zBMb69*84Z$D+l_+e0TwqXTXhYz_hO?C)#DEkAnyO-W%`Z{MGCm<fLQ4jc@=xZ!?nc
z8|lQ8@<0dT#i3WVx4I^%Th;%|;$_!z_N!^92ma<U&J%R`J$g73qZ{+1#qV3?W;^81
zjmzpWZk#9i!4`O%D`@wxkLLj2RC~68Xa6ssUIZYY-wyZzUkHI;h`q4^-;Arr`?<a#
z4?nu0?3B!Hn-YAhN1Z$RJp=jR-F<^`>-v45_kAP1=t6u`V{EJTeVg9&Kzyy}m)QD!
zOAiLy@?WjTy~96vp*w5`etv^Hd_%Wg2Y!S0;uFbyKsxY3d_W!eMtpt4J^23mG_4((
zVeHWb`ucU?1J$OR_g6RY3%hqa;QMc{@2?ln*>9jv-=HmC|DQR&175$-Pke*7zu;bc
zLBDWsbb7zzX8}Ocd@wf{z0Q8;hdfLjMm;7ijTQe4k1&o1S73bbZvy_!*zv8+;3VBM
zg!bZxd_dmFH;n#2ti3~cZDF^q8z(EaZ6_<XZQEI~ZQHhO+qP}nwr=)5_c^71@6svF
z!ko{TrSBWPzrD5AZK1yic+-($Hvl{lZ6P1cMr}a6kWMp-wx(!uiG0#W{CzSXi5^@d
zF93IW;XMx(9YofbHo-oHZe@YI8FndV9VmCH*R#Mr9UD1;U(<X|{JdFi9ei`3KDl}y
z0ONe7pa5Ecc~(1P_k>T;-c~x%ZxKheAwL;*Q-H4lI)QE_df9s`YNJ&%I5BvTAGSeT
zv25WUb%8%Mdb@IOfW2{cy-&NgJN@>e)LMXdcZeTK-5A$*fUw=x8vS-4-9(QS9dKR6
zuaO#{H-$SOZ$Vcr5Zt+D;S97wd{z5u(s%{{z83jKbyx%&1$9_5j3a&xDJcX!K;M+7
zA^bjUr!fHEVz+pppL1$48-J}2jUMV!S8#HP=rUq}J-Ht7=`v(}Kauio#B+HuzPLbN
z73Z$aQdbuGe86@Y30|msO)_TmU$uHq#yFNedEVUs53hwj&;+i9Pfvz?=>UI<dUe4%
zdaxf=`DUp4d{AC%f`2-}K0caGUz`}GGity+flqA$vswFaZNPqLZZlede6Sw7aIRu&
zqz^3~w0C>39DhH%d|d#yqwc!k++$m&;P__1`+neGM>mc|dw<B^-_UnQ0D1Mj;|cDY
z-podQz+O!NdBNYgd*lB58Bo1F5U(V!3n_oIYxF#IL8Cpb2z4`bM_juBI|y_$cKknE
z2!3!zeb7E{{9^w5yPc41Jl`L|TOW|`n7`RMdYQaK?Z3YqT{)iF?coLgLdzx6&FD#V
zDtV(iePjMSXT5FN5rBPL|HOIi0sn!UeGzT^Nq92}_UUVlE1BvMxVAZkb6fx9JblUM
zzGuSWZo`{MJZPa_%L(GLB9PU*;J=Cg=sgGP0;dO0O?hr~2mJWwqXPK#IKi=k34on=
zVF)A6sX4F=A(&}VMR+(|xJ7el1?9G}?(3XzY6AIQOwfYh&H}g->8yEbOS@ag(4#rx
z=hMkGqcOUIdf(&(^f<$}!x9O8qIW^O3jVgvF%*B09rS6IOC+ml!uKup=z=;N^-$*o
zJM2Weo(2B)0Eh?Tc4%hNF?0fUA<!Ga=L50)WT5_|mIBa&{G|ov%6`h3`vQ3(5$uq9
zqCD%uJlul>e_~{TwrhR50sLkGP!sg^Y{2ueE4mWqEE3a{b9$eCsOG<4W3k%4!6wo{
zM!;D^hLy4WBve<4^^Nvl<kOA5lsV-$00mRz|74T==Xe#$|BZb9#&qa9+E^G_>l!;*
z8#>UMRw>EbWYEKV&(yFL(Mb!5ua_k?bJrz0TLvl-Y%P-=q9bi$Vy%IpN`KsN3MQ&(
zlyo6e=v{W)bbnkEHJoMW5T*7DEO|`16a^`A_(i;Z&O5wNg(ms&#X{o!snZfC#5Zc3
z+q~uuJqUuUrD(ImN2!x?fIbcN)2QhDwU~(<OAU18yxUf26dMf{f|eI91!|<Y;ADeF
zOhh!iDI;oWb$j@L2F=%~M31SM86<5Fm|+v&4F*&nHae1T`j%s48%$l{T8@3oc8iLW
zd2vhG(sR#Qs32K+<d^%(F?4Nwtdf0H#2{*31u^QOFa^883N;9R;KHW~PDd?yZm0z-
z$Ck(kU4<I+5bHO-VOIm%*mk_5Rwo#xTH>o$;Y1RFPwZNx3dC~tzUXzq#!m%+@5OXD
zr54v}2sU;`6x^;mT;NOJqzKyP;DYAlv#oRWPMMS2<pkHZ_ZcM$w70L}8=ML%VPmkP
zP$fP17lf;@Ckm4JDjw35uQHq_dNbgr1}D$Vi9#rri|j(9%k_n#e)M6zhaIIB0H7p{
zbF|HZfJ%UE3XE8-%|ItHvr*vF?D<=Q1_)G~=Zah&^j8INoec1S%G9HwxLq@qx%c6~
z=P4;O$9d4Yh*~`JI1y9DH=r?tCA2d|RzzmBd;BTeWk&3@X!chOWj8|9-Ei=^_I1C(
zfwD6OBOS3L>gxk&ebb6~ET*ff;+-_sUU{=D-KXlx_|r^eFl=tOoIUe3uL2aXbDth1
zLe|;q3^iIWI>uO$ojMsVqL7fJ&ce}0M7zc-qkSJMX)%ZXf>oD8o*sB-0No=(CY4X1
zm06h2A2$MVkaB>A#a+CCY31$+rRWF*yKSs1SDbfzmO>0^1f@u-35UD%94Bvr$(8Pj
z-8Fu|I$8W$cWjFv_#?e~9XEUX3H;x2LFE`!O}}|T+@Sx@4ufHpiiOPv3-Z^suHA`u
zDh|1Qd>&}CB`BBZ*dm4V?npBbFpx$*bul7EY@&9-sLu`w#h63_4F)EWGkG}I$+iRD
z;pwR|FE^Wi82L-Q6$4CwD})IdnGN^D2P|QpUS<N&k93%^e*!itQ#J8|2VB1CJ}@<7
zF|-&zQxY`VWvIVGcwx915Q=PRU{cTRo`hxDA?OjNL0=Pb9m@x;|H0ki)!N-y$Jy)U
z6&!DOfYK;g8c{uJyeYv8edzFl>1iLWp`Ec@Dv-Q_XGG=&_h}@LO{cIrG!33LJ^k`5
zlm=p1RUToGuVUNU$0?cDp=fZm#vZaMU{ZcIU|gf~4sbt`Sn7Oy6_s=x=#>)T5+`99
z+ycJVH|ivy&#w8iD1D9&_yUQPi36}<WWdGUO&`$kLd@-nD-WJ*3LZDacY7Lm1nA^3
zyv~l0zU^Mxook(%cE^yj2irGuWdD(9YbJa65~1%J3G4tUwQ-815VR-6!ZKlj0Rdt%
zgOWT{fPx1Qx^S~FN(-{HfVTo}DdjY5g(gH&8084MT&RP@ziyW{0^T{07YM$g)>#o+
zDSu=V;9~s|M`Od_amq;KSQ>qH^%G<Tig1mn(Gfq4n1sMK-(z%fD$4b?xWZb0EPTX~
zeDXg#jNN963&&-D>+%0w*|rihZ`f+*Ni9wZ!k<(M0o#;2O&f%&NwM=-%YGpN|8uAz
zF;HTcT(>RoqXo3R?-jP3H_=GpjS}hDnl6bRLbGQaKMOu2(l{R3SU}=k5RQ(}ePBF)
z+OB2FquAUYHqxPZxSE?eWexc*gwu7mAs<OicjB6+T0Ao;O31AGy5#QFZ}u5U%X#8N
z((ugRlzOt=n&;XyXX__7lzX}YPuyLm#qdlG2HfdKIMRf>9(<1;CMCFCs(k@v-5Fw+
zhkOvt${-64Dt;kpf)mk<Jk8>FFl3A(hU}0KA;va)1oQSgqYS@{_CJ>*-UDszqmi6+
zw8$wfWUOcyp+AmP%;ey)A~lF>nR#X9@TX`p0>Ub{>R!xdyZF20q6Qo&n03%9r_h*c
zU8a3CDZk49mr}1&_|*@=$o2C({5(xK1HINyd7Q%Wy0yk!CIskIXKN^uSyIV@zH)~d
zr0N6CtlGj28(d?LzbE+gz?L5R1Lg$eqDpcu)`i$sBHfg^(Rfpz37w!uozvS5{3G_7
zgvTJYXGt{BmPdp%M}&PZW3HcMNw5UY6GvBCBtTOqr2B6{LY8jZwf}qMOVtAiDQ%fW
z<?t6Rqa>d6+{~)~`k=vCuEmTC?NrF?@FFJI=#r!;EqH^5j!bNaOgC)c3BdG~wU7${
z_$nAWK8;<M4EQQvX=3SP_y+E4F7o8{Fz@9P9LiV5iv=OQ^;w_Um+Ov$ZaUR_6O}Z^
zP7iSmVdaC(BoXkPZqvPQeg=Q@$ZfgW!P$Y7!8nPKq1aZCPM5pXKbye%64Oy#{(uo*
zS;~8xMI8Cs85PiwdYyTVFFv%D$e$c)=?xuKXgcyi9Khqs5h8%W>Y?jwh`K^om(m#;
zB<LAAkLC(DmK}|*6XYAt@uz2woVL|HqP`E9FYk>_4&MbF|3r@qjChK4n=`0!6b&DX
za+8ZkJ-lSiATrO3b+?=Ev5elXJK|nWNiULKC>{-E-9K`_E!2PAntPyHMcW_%0A9b@
zWdHN<^nWZN{=?vu)^tc)GUlipVf&@Vbjp%+?v#>|l~tWM99j4cd~AJx^%Z-*`A%;$
zChUF(_%+BXcbti*D|Muf7m_?YznuKmL<P0cbF#j(>Rsl?Ew?5<{P=ExmxufNWslJc
zQiaFUSX$=^)a%oNEFxUnyY0*BEAsA&s4xBEe66JCB>wI=M_SjVXOl;rj@TzZ%A0sc
zqda2(^KEp3rNdU|>u7H;tzrM~OejT;Hf1)i*W1=LyO&kaf!%b5OuUHqTS_%aLQKz0
zSgWzmDp5^ip8t`$pn1A-WrDgSNPeby)wyMf#QC#{w&a6VUQNse_)d2^Px_C~566p>
z>+MB%IN36?x+qn;BrW{l3P_LPd%E^%5;H8=b*}DlF=uL?$BaZW(!&J3t)FJswyoZG
zPr(D|6cynpLwf#9ks^TUHr<kdFFwr@F7qF;B&V+;lut^rt}E#B*nr1$!K}(JX_Az1
zunhJ%M<lm=8#*oIYL-KxI>$6D51}C?T_sf@_@yo22CAMl6x>v$PGy)mgPZusc;-em
z{EoD`Y=|AL$YhBj3QXr9TJKn>s$F9&boxA0DY<l1qkXrMLwWHd#xnPJqpcaQ5d_LS
z!xiJ*0q@(t1E9(4XB08nj9>m0owqp%FgP9*<Yj~s1>pqmX%FpHr&PwtX_Qgtej~2h
zHHMMu($!<3X&7F5^7a=WR#QHXQt0biM>KLtUFE*^*6G}_oA!Mb<XQVyL|#f<@RilC
z$~5TcbDTVptUAi(eyY$sJa~}Gx9ZYl1u=;%uoaZFk-HYVwf{iD?&0(J(}1QNRv@B=
zp8IrkTHw4Nn6ktuqOn5Y|LRrQ`36MDRG^CxFJWJw#$>awJE@aNn`c+!u{riGrjJqv
z>=(jJLM-SD0x}|EF?D{!fp+E}=%~92CUvKqsF%k3i|tb;^bV<&f)VpF?csm`;C@Je
zsO!Dp5`cGP-)yoDhBsFuZBb?Js%gRdcfw?Xt8y?uDnS%ccVJ<_$mVKyBaRN&1&fPN
zJ}<Bdz`l<MjUW7TD6!!K_fS-&)V?BuvSm?&F6uey*VYJf+v{qcRsJxYgKBrV<*#y+
zC*`rIc92wLp1HLogjGj_a8JnKnd2I8yam_nOv-<&2s+N9t`!GF><9oWQgXW*pL~2o
zU^vKZxF0o$(iCF_y{+K1&W9zy;SM@}o!)NvQ#Mm@+?#jwa64W$6&n50Z%F&xbO$Ri
zNIHvSC82!;&*m;VL{R_tuCz#cuWuaya2pla2kCAZA(SaOm}b0MuZS+QXd7Ce`iIIF
zi%KmP4RY+f*+3!(c~jcVt;T~Gv<4OwGCNF<!~Q}M$(f6@PrxVv%5*fg2*)h9B5mey
z182&(LcrF!GLCQ4+bB#Rua4WVxQ0>?RArQS#%x8HzJqY8iA=S9m5uEId9Os>TEO-g
zJIJUpzX>y}*4kY;fyQM1o^W^Vm>lF!U<pWT-hsL~90$-sE!lmQsQqM93u6zka&Z(C
zoSE`nCiI4UnTmLZaVD6bnE<wJ-$3N)cKRo&>%fO&^wN;!wLz%cIP5s>ylScviRI3Q
zST8MgYWho-k00kWaYnJG*0wAXQw)wRTRW<S18B=2S--kymfy`Ach6@CM@w`IJo)N@
z|3FrYRMo*gyWFg?S}PhV$U+1SHfvx(5F}^C1(0bo;gsscG_<7<%|F3h7a0XUp@4;@
zo@LT`w9ciUQ>{p)JCdtSMR8$<aE`p<RPfQ(Tz&mJWQg&JZfGuK8rC%GGd0$E!P8Y7
zChV)mS%i0zm0<Jp>FUt<>I1#SA#ME5{_Am}RoJRsg)_czCLa2~iuc$(WDvur%ua=E
z^#Q?7<w4PZXv$BRvW_vwit58??B$>x0-*0L)v6Vq-qKXZUt~_T(K`lOJ;<)!L&_b&
z+f;7+@>UH40_5e*l+cG|VUmLxR#?PrkNzG`*U}pAtM+{?e+I5JN$1U#Mp6Z<m2VmK
z_r>CID>71<<qw1xFKDjf=Zb{`M_nhb#O?&ZG67F)XRbVnA76{D6PFMT*(rl8ndttJ
zD!CFsh|t0>)t1XrGJEEPR|i8<DM3&2N-*h9V_AMm*@NaM6?0(zBc5JJHfO<ilXotx
zUay)$iN$#C|3xXTD-P}WI1ZagU*;b=POw>Q3;}y7YuSp60LhwN0`UAU_1?AGK`3uF
z;b`Vgs}><{71T@!-^2%2iiFo(DrH}>1ZUIBkQNnHZ~mAK%rUXDV0;x#^ejS3PHN40
z0B{t7Q%7T;wB&zbboo4|fR0w1?VFnFr8l;PZ|ih`wjr$6g~jQ*E%zxCQzNvhc2yCc
zWHTm+t8-ifI9dw9VJfa@0cnHNnr7wKSJ)5S;BkFq4#ybESwC?~9h}syjX`cxL%Ki3
z{46vpvYoi~s0dE68G=pqE>&^4af|sEbD*xQTVDD6KqfSFHv*N{YqFd|Z@6lA?GvfG
zWSM1BNjg-Qg+9YOPxeQOxtB^oJ~!QPul^2vzcLl0@n#@5Xdn~(E#wNlIjV;cl<FiZ
z-V0ejZ!{ls9hs*M*j@wELJZSd0~C@Lt#ps2`^4@a%g-RgH>(<(r5=my6_nu2RUGSR
zoUa`=S-Go<&|{dRd-2LC49QQtN1{TcgT5!}tO0%5N|sGn!?u9t8`eL$c9Gg#W;4yK
zN+?0wrJB9o_0mhgSZ+F2N-&2J-539`*wDONdrZ#Qr)XPE*2Q>?Y~U>@x=Kqaa5D3G
zZZn7c^HacL;<0uom8>)DrCQQ2-(p<r0)@C2Ys0aidiH>TuAs~mFs^0Cg2G%{PA5;g
zq!ev=U4viY5JxG1#E2@Pr-VK^$aE1xi#EkBu?Pu`;aW$8q?#<QSrXAdrQn)na>k?S
zLD9W~;=1bRO3W5GY%*VIB$*6njd+>M90%wD#6YX40Ur7fWCFl--M@yG3wt{Fuk{$Z
zNhQ%T^OW$wiBP0ds6wG}jHip$CDot{9`ivrQyBYez}M4L97!vNJ=a?#GuOW0JcZG0
ztf{+*a>zTNa5wOll98Ih;2Ot}z~`CNEQ5f+E38wc53t5j%J?j3EMoWw-e5%e)(M`i
zK`iWO@b;WC$PPM?dE^Q@&Ipyn27OFc9nV68$9KYMN)h#K55o8Zd0aQXFi<oA3N<qg
zpnV&9!5=+5tuUD_4|~JfNU&Qag&Yhf$iC%#6HyPVN4NXk_QYkSC+x3whH*Vdb7?W?
z9lOlhn1|W#NfRE?={)w^7l}uSPw)F9cxUvmG-8|bll`XE3mVqsj#gsNCh2uTy22`o
zM+}~|6V**b7Ko(mE(&Lx5A_E{bElvpf1vt?Iy4##=~6`t;be@(1+`l#ImPK)1Z3pM
zt1N<`@F-{H61Y)36qt%<6x&s#!b{BTq%CL-9`p<}KC62n*r-I#(J@l<<Pbk0(GvZ-
z+XQcR4`-j2I$-nm%8Mp3)|X8f9y=<}E+QBUXEf9A6Kxh!0l@C<GeBXCU#xQXQu&4o
zQrPI2wNi|!7xS3uS8@2oJ8d8!_aZcEWhWUeKqGii!|`X1Id!-&!aF$lLQDk_InEFG
zfKwF6q1Y6;T(oJsI|IwLfdiQDb->CSw}G6j<MyoYZ@IZEUcMWBnW4S1WC?P<QqI_p
z0m7c^JO^PHp`g|<(WYPV-xOEkPl3fk*-JdX7`|(DBjX58q2A-8$VrAcS#G5D=P78|
zQa?I|f?2C7x;wH~=Hj@@Q=m}Svvh$0uU-mFD3GZ265PuXmdvnV%6DOq$3;rTIY=1e
z8eSCio7j>WsQT={2Pk1qEGlF70vOX?3~54d-xy~TO<Dn&^+_eCJV^#6M@5QWb%4E+
zjsdoEv6Jbdd)L+sC1tn5q_qAJ+ABZgySVcYK;i560c8y*G&<#~+n-{wbP(2ZkwAm@
z?>$@v@LJ)0u5FYApMI$PEjtUXAym(;z1mc=p)l?!22NW+BF0WRr#q1HyJ^hK?cG#A
zkojfa6seIY@5#~ebEyfT#xo2~iU<w1oAJc)uP;<5AL*ZN3l_Uy&2Bexe+e;d>U$)w
zl3%-jn(>!Kq~S4S3^ezy4Xx6Zy5UM!_UY)HF(=G~B2{~HTAJ9lgR*zurv$#T;&Cf9
zX=NfMV0QGR+&tE}v~I5kLN;vf#tGDqUx%r6AWqZ{61;s0?%iwKsE;jRRx^T2VkSu*
z4oKnnPHXH^Z=UcOR<`TlLf#XHiOnB|@T0x9wVow<nGrHgx+nm)tvf`4U;Jf3d(mz6
zkUyOnhk3Kh0vjHzRxv7o2~CDZJ3l1Oxz*l|B{<foY{w-9W62thAYsF&Q|H~ZKq1!8
zkeZHp@Ln{syy^K0q{dQryZ*uS)3*4zAS9vxRGwbEPfc>!5}S}aM)g91<F0cAC_)@)
zWVbFvrw;m4hOnif>~1<H3DLNmF_@Ni2PrGCN%)Do+#*5=g=t_p>+)U}oU?EoZ<)h3
zP$b&9^ruuvzc0r4Uw9SLkv8qgo3K;UtaCqrfNV<=)sUNgU%eaD+B1{edc~K>O+S&v
zka|qp?c(Uip$lAp$ir$|GBKYD``{}nR35rPqyg8DkP|HW6KK~53*UHxrh5cdhe)l&
zry!Zg3~8osi3Q0Z1@#QpN6btz988kroX0peq5`qo?9?OL6%L*=K61x1BR@&U7lr<M
zGj}-ba?_PDJiQ*3%`m+H&PL_@?Ke-Y2+QQ@74243rd>b`TA;e-9^fEJII`kqDydE1
zQjOd+pR&FmZhJyzBmisg_x@X&+kKTV0R{^IKoao3b(eJi6QKSN-KCtpnYH781xstj
z9Jbqe^E^<II@tPh`{}#7m_!3}!oq`$B_JFUcthdWk~qV4nU_^fTt>qDyqwO{#37T&
zS1PzP3GZqdGwrLA)R(I%Q^)g$dkwzC@WW^CGt~Te?cRXS#E+ExxVnFC48(AS4Sw&5
z{_3JJ?nZp3BFIrYbbG!t-lYoP3#5p_kJc7?LW0B+ex$|?zb{tE&ftXKqsYz+ek2+Q
z4aa_JsZZ25YQ6XNXi(-1(QA*zdv|2lN^<bNpKk}s2vsk6xt)C8DSZB|<#F8?j^got
zAushD@%~)@#FyxD^DJGJ|NI=E?C^4Nea7D9PsZ=?erkv844J)7f%cf0^5aV-bn1!U
zo%vkgLWGa_z*42|vceM6$t}&~Sd{aIewCnJ-u>oNzwY?FAK>|Tzvc;C>2L6|c>Q#Y
zl$1}s+3-J{Znk=VzJ%bpW<J~<#}L|(D`hs`$a>!Uk#QmE$JP?T8N{LWg&Cpa=z(?j
zTthg2;v=G!VGY#75ArX_qU?!w)}03PU)1n&eIqkVw_j)JG4S5WT?&t;?_k!QwS6ub
zzC4(mozTtC=;Cz$6KimPw|t>E$I5A9<$>FN&F{K1x*b-%imF+_LA|3l#<-A{RtXM@
z_=n*~Js95eP<tslF{Us95h32s;{iS49~Cae99GXZI<Z9|35UUXj(E{Ki%uEtj?t^l
zF$G{ar(2$VG&E<{8%(~8IN<zuBo-BA#Q(Dh7@Jq!+?xLq>*qDwI1Vb$K{2BaTHT1o
z{bbk(Ul{@_zpiw!I-UbU8D~Id=5H4pMs)iHV)uAJ<ZfSgIg!l!LB%qPfX*A+Sy_A<
zp;NeEFgYrr>W~HDp1iEu#k($d@rPoq<ihK|X{*%hZwtJZk^wi;$;)hZ6hWC-#Up<0
zz{+R?Q2$rXa>NjX+03@ILUe$bDI3Fg^_f8cWZ@w9Rb^--jFl%^lGibcrn|?j#r_Y~
z$ZgaR$xq?Bf1ceeo~NCW9H9pHhkF<N*to<CFnw+EIWUc@66XksKhy1OP%LXxG1`7k
zNvKaY!M9ubs|l52H14Z6k~s1q*KwYmH+CeO7ASIf*5}8a)7*M79hQSXz4o)-;>n~I
zcKmV`IvC@vcPd}W_Foom208PQ-HBON5bPbz^83YivG)~bp(PMWZIPMtBs<ia(k>C#
zb8W*VGW2)OWlkNxkrlj{lGL68;+f%EYX4;8-So>>&&K@lu!xFfc|jOOTB1)Q^T3|T
z$lH`NgztTN7u>ZyckK=N4S^Mww{cMZU^i(6ybzO>$ueZmPRos5eUOxMteJJJnFT<p
z$ppbW4gxFzjq>1;Y)p2{xs&#=ERp?<n`M}citk2Kwjju>^Q6DlcDm45e`Jj<BGY3u
z&%O00!9>QH3LlD(!%jU>OTZB{+Rmw5VGRe(LMOJ~$!pB8AEcBT1|a#**w~(8naWqa
zEB4PwiSX{aG^G>6>n!a^r_y&TtXGr0rCuRwQ82O)qkPfp6FKkfuEz1KL$p-@Pgagd
z{ODuOHi;{E(M7=D1JFtjvxWClHX;U%PY$DBS19&%O+tOLNWYgPkfi;h--jcfha-Zj
z>+?sG>AKs^?L?!3Z}>P7n{hcz|BkSwUk#SA1Sh$m1IQEhlwV;{xpIdbe$tW13S7^t
zgP~^#EQ5I5%j2~c79(eSnwt+iOa{F^Am5!}?9VI==HQ@SPro0PGSQx4r{(7qlm<^L
z2+7&_s27Z@5Z%F{q%GkE?lY$DB@1t8TY%K?3l37jS^0^28KL*oD@t)ND~4>FDR{}`
zU;;+1!NVC15~|Q6)jS|Ucy^ftHs?s_NlIvk$OKm87H0bOe`R<Mi1JT;Ll;h^uRs7L
zQ>YWzCqAw9Z=kQn@t1K(===2}N8Q5c>#N78#isl$=?pA@f#Z$NqT6r`J^B)FjWayY
zrRxSJc>z;Tf6lycO}HW-)?9X00CUVT#;Q=k8-uLI#^e#kbchKNs8N5fTW$xNg@+r>
zIh0VtY;CsjBf@kWng(L@Se!PmHLQsb=yX>%<1>h?j6mk9=~rszDf+@(+gk*m0m}*$
z(B?S`-Cq<Li<){^5o8r^6&ZDn)Wl2SCSl-ZLkA_6G0&X=y{gB73$Jm;2@$e8j@vOu
z(IY&c^C{zCUU*{Ex79OX2b3Wc5@0>B1LXs|viF|Pmsljm0!}Zr*9sFMHL64Lb?Qy-
zXO79=1<NjBhJDP`>P}i*S=3m~7-?)L21vDSCe60mLQfE)VlxE|`2e#errOY*0~3ix
z`U9sx;y$6+G+}R~BKNb+N)y@tILnt?_tvDehA8}r(jGL&T0zvVV%BJau?{ZdPH&3d
z?QqZt$#B%}{D(yAL~!olCMHn`w7qh2P_^VAjyijRqC%xyN)>nCIJr5#8O5g(bbVB}
z)(n204FxHYqt$D=v@OZ?7V9-Yz&W@6p~1KD5Cm9$P>PPJjoEi?yfh#owj3Ja{`dhG
zN?Zr_{@0jzB2C>KA}5!GzR-=s{KUM_ZQV{%Ys8=KeC@iC%ZWlvv5GvTgjO}+6dx6G
zQsBgJd`9{zv@s;1L%uEZueBtYIgB)$<k$dp9#D`0IF*nc*O0#`e<Fvo1f1Rq*4Iaq
z9I84dk<u%so!z|9SDmH}HPX`%PwzqpEq(JD)7yHLMddM8*!*qejWdSW^>i3?kFO;)
z!+fick8_om+7DkxP5BMd5O@)dAfhOfg3Lp*pyFM{4O)CVG;S+KUL_%G6A6=};+!1m
zKdX?@O}}9oRshovk!tykv_!j2PptlZ$q-?$t)L)+nFr-cj~LINXKv%Myno=^D{AXj
znEY%?t3qkPbgnHMBK=D1n-E&-g4;8pL#yV$L%(BYaq4GUS2p#b7fK))VFIf-AqXp&
zQVTn%XU<{*tIrq&kX$?l|M0^YWJ4#U)sI(Vg>A3^%iAID)@6MfL~dStbRx1$>zZp!
z%_7Q~n|`Dbu-qYNKE)9R)agR(5wp?tjOm(Y;~J!=aUtddikL)A14we*lT9SRJHAnF
znp4x-w)EbHI*sCEz5^rw!8-jnQN(Uzv-o7yO<kT`2|=kY6vms3Iwa^3ZKgn4Lwt8m
z{RK%YQn#pix<A>&^n8dx^CNneER1~WlK}3LuPTffFlEl%h$wBIp5k7h4Zr`Zl2g8v
zB07HAQB95O=&4GF`>+qVL&p?tqHhy5l?Md{CWbt*VSQ&;*?!eMR<zq(a2a8B^8(Uk
z4Ihxnxpi9vphm9x<K6zj2<OM72@PJqt0+u%tF;E0O=j*t$oN-5{Q{CdKxF?LIOI9t
zd|f>^RT90~o`jhn;Q@h5)fs+JD`YTBd`9{4ww?ec&iyWSm^M4ik>Y{1X_z5)RQN}M
zf@9um5$Zbc`q$&;5o#caiGDBmCCmN#%eT5X@)E`XV@)%Gede82Gb`k(lUNf@-!dVV
zGR54>e@6B%!h!_mpum*-Orx#$L1(I6y;}t4BfymB#LDHvIpC_<1A$KmWQjChLx}+B
zWxYX=htlv23@`C8d=*~AWz4Qfv=)ZNK)QnR%=Kvt0_!9ggN^i+!KD3KY));-lZ8aI
ziA*RDc6|DoDqUi=w$7nTf6Z-6kK}?w_gq1ERP14<4RV%X0JJC>{C4AxV5=61doX3Q
z^s+)1cQWc4x3#;;PH|!{5n{w$Qw8P^_Rq)dXdnl}gVCL`)jKx!UARJ(n9F~uBiig|
zky#{RcWqVfi5Ho*oH25SGa>BOBF=HVhn%3ovUBQ7Wz<jj+t*>4!*F5pQkTfPBG9a4
z5_r%&{{~@<_a|S__@OD7nvy4X(%iMCo1Kr%!3)@=K@-LeSHiDsYE{WS`tvK(r?)R0
zGa*$<lJ1^-QE+j`vEA7;<U91d2s|qsy1q67>Fr^V-w5I)%F~mH=*f)3!wpG?xy@B_
zt!6qM+OKQD$r5c6r~4<p|DkLol0zk|XbJpN86B*GJ?FV74e5<?&O_qXLosHJ52vn?
zovs@fZpox{uFQftaZ)94sy%0g*WNSTORkpz(p0I>XxKZkI@wA-oc>dUY(sr4?m85!
z`dek|l*`vJC|G;=Fhf8o&ujS3h~k7e`~!2PEeAx<PT68jgq25qMvRuu7I8HBV{=(6
zZI_B0)3Q!VHuuc)@bx}<qQCiDOv6kV;_4~5AfN=>Mb1GNN~7#T0KF!g5m6R%$M>y}
zyU@qx#RaEp7i4LvJN7hM_DLHd%nT8jU7G~qx$Okxh04OADg9hd5JNL`yR5rd3)NGQ
zQM$OrEuoqIqh`Ntcbal7aG?!iKd@b%gw9a$S-lzR;1n!~WjPys#1}vfI8+{~jo;v=
zIsgj#L{FZIZ49B%vu6Z0V^r)^xgww@2Y><tmRf~q^hEFVl-gUXgao9^O5C7hRj|;i
zDvEP$pWf1#vLk3318-wPLr!Er8?4XQKf@F@K{H^g*K8mv3n7c3oVMSFa!3tR{7W_b
zz)IK-(LODLHc1%z?g{Q^&;od~%W+A;hc)oe60UNT#b6)#;qE=%N*qXA%LZm3KV^F4
zu;8k<w-idj_1=kp@PWN|KkGfaH*+NFuv#8BUm+JE9jOZ5?6I0B5uD&^SzlhZ#VImh
z%P${zO=Gtjr@x2{2UP(R#!3XwuU>*TdU~Hc!)>82&>Bl$PUUFnn&Wz|207vhB#xGH
zKK2r)NK!CyB8*m#Jbc|v`r4uda}e<b!6eTBXgUrf(XL;Y`bv9qPE!{FC8=ViS4ZBE
zeP6haF*d><XEMTIL{1*0s5?pflDArQlNhNm?tRVj(#Y;QzN1PNfjUvt%GZfLIU$dg
zX_y@w>Z{c$I!o71V`UbJvYRj1Ucg8vJJ!JQPn3HiZ5<>}{SLHI(|jmK#f53Bw^3?+
zB~SjilVT=<X;_5v&|*O~O(fn>ittrEis#Z_xs~d{M^*4vwur<uw))F~F$&X+byooD
z3V0ni+HVa!mIv?g%u^USOLLi5teAiq8u?a)<h@hPy)LoxY{~@lM9P662Jo`j#g5%X
z@0zbcq!~3tf>mZvIMJVfgSj6l`jsNFWpHbC)%k6a=%e=IV&sM-z+fpm@FL@(l3tnT
zlw;$FS|X6!P?Y#jGbZwZL`8`3(E*DGpeMTYs1PBgi=w4j<vopzyr!Z5h?NRrOpnT9
zz}lM%zxzhZMZX+0ao)l&OnkbacsZpKDES63E@30yMNO7&b3N^#guWau+-!&=V_5__
zXx>TgKYfyhx`omw5*p*Q0uyK8QH-jk7_oV&hN3poyV}??Ddb)!LAPok);av8w7oXY
z4ne2TJo_F%je2t@)-FMG=8c1ap6WO?$z6F(MZ!)`nw^mcY^1LHY^37$b02a2b5WrG
zKFR6~<ZfmCF?7q?Eax4ruI&}xP)3yPw)gJFH#)1WtdFn^#L#`oLo>y{@wI4n?}uuD
zrbn%a?`V|D-*ju!HSdl@cg*ty8Tb2>idJ2a=eln)8;Q4eMjQ{E8^8hmk$skq9~Fl%
zlZ2Bvr$7)_jy4Zp&~6W5IH$Oy>$Z$~1}I_yP#=1WnJpA^ofZ1)8Ksq*9+%rXXzc&?
zj?z-Sh>E4m%rU*{*mF<1A?=s#2Ff-C_2ks(V0w>L8g^S$#)gV;`}fw;Ze01E4LZDV
ztON7pH}UO8WFza1_vL)E(hBdBP58|v`1#wdH4Gqji^~Q023$0X*x8{9l2dlAIM-Y?
zHsNSbsV>|QYak+Mi}#=ucY1q#6&LS(Fd5oGKMXrTL&<8{_!l)oY<_fp3@bb7Sn9Gz
zv@RTzfcEOhhD&7{=tOFbfbrV*^9746+pt(PRo>)^KVgWq01As$#pLC?s+iciE)PTe
z+cA0Ppy^bbgN{6o&fW`qEBIBf6Kq{mi*6EtR+qrYUtUdWP??wSBcy7D(UygATc*ct
zXhym}x!;X%-SBDjNlj3@VO?1<F=J^HEx9)&kDtQnU_V5n;a2SU+;JQ_ot|?nBKV{c
zelrMu8l}HR6aeke9xcbcm^EKf9!uSJ?mzCMv%MsQxs0+<HYnlLH<$te8Kd;kT53?q
zU878aj}<(vO)VwmvZ)8uqCardP(SZ`LbyAuD0Ow!0xD4IcI5C%@^&P;$jB2bey%$o
zUTv0TcfXW0bFxmoDwYa_A1P48Uv!m6Nzf|SP)-WXZ5BeN8;6jiGFq*iIyZ#(`{$@N
zS7b9HK{b~eOwqJ|zMmNt+)FyU>$8K)&_Mc21FUS8t}2igR&!|TXm&NnFD_%b8&1-t
zS?aJFbJaCqko;R^uI|*{slJ?Vz94c@=fpbyJ~p2xi)Wtfu4_HyAC3nWEiGFnkS{ND
zlDjP$Msj6Y!%%ck1MNYu&+49-_|oaDp<gul_pe(2z~XN@^~{1?qYD+F|6kxq!u^&9
z8fDzhfVM61bpg4HoV=IHv^-SPi6WBQX%rZkAzSfW^pcln(?zea=@5GvfFc%7!i!j-
zEmMOb4q(aifvhMEh4Q^=c1$`R89tX0h<`c$*6Ul-M{{krGBeJ~OEPLJ<c^8EUUdh9
z^i1aN<m#yM>9@?)pO!t^NCHmHDfc(2NVNC!zFbfqDEE{?5<&UM$7B;%G@A#_gs2jZ
zp$7cz?p|FmUFOYeMuInK+&w8P8=)JQN6OpobM^jo3+jETSFTdp1IVOZ*>2n&g4~h|
ziri-?>X>j#QeqqPyDoo68?(i<*mJ{}?^#;L={xJBYPGq<f?K6e(3sAtu$)Q}i)g*o
zHs<Y>4TskH(wy*;-^zT=)l_aTS4qtObSQ(VbU7R`pMPgo+!96FXaMiby-YZ5Eagzp
zoojF26Td}wqRG-_gWYizf>NOM9E@<jZX~Ie!+NLU${O_%DOK6oae#TcUUX|)rO|$(
zgfJ7yKlw=#Q`Vgl&0ay)@glk?dBvSzLDN}{rn;<jUMo1Pqz?#gfF2qfMoThRLh9F<
z+Z!B7!x^2PdF0r3P_i?Z{mXadz845wtdT^wKj$923U7RYkHQEmgcm>K*ke1wB@Snj
zkYcHbN$8e!w`aLNf3IKAX@+vU3EW&Zuqam6*0geR(FpEm>L;%{uN_5GF;Y+WYc$!#
zEIU6`dM%_sGQ5KE;7{+!r+j>f6!0Nlnn_*h=@-`A8<T8Kv2+=mhGK~|R}HJIE0tBo
zDVQCwiR5EBAtk@k1K%lCBOlpjirpWD<svh=BW~`Tdk~o!J7s1-KHS7#El=doc69<Q
zv4adG6&<i5c5vPujWK)XpN18)bmQE;@=d@2*vbc)d3w$04uzm6UU9$`LI!Ui$iL=u
zi4?#wC5jCKu4)copQS_%2i7KKWuZX?-frD&vpah}YaefJWOiYphf$xb$M>xIQN&~I
zM{K!=1C9oDi&H5l$|TRu(12fyNM*eN6L;IRD`AxRz2EB3!a7hBIp|mAAE=^~R57W#
z#L_32WVi-fEBO2iu6aj0{bPRc`s(Gz_!W2SemJnF_ulNzwa`xP5pdXT*he*@og-r}
zMZiV2%^frSt%4E8h7C$#{GJ6s1?x~TOs-GL`wya{J7YMmS<hdy|MZ%D+7g_fc~G?L
zQkbW;W+6X4b|G)oAcsBLQ)*t^n4)Q82>tO!%@k>P2rxN0+K8@WL63+ISm41p*Ol&F
zGx7tg($7x*gD|v(I95jOZ{E(q;iR~-UaZ=l(pO+8q%jR-E2TuAxF<FN#DJ^dkP)c!
z!{R6;l8c?{8x<BETtH-oA6=qmyAptg0>Jq(*MnEs!Rycx&?3ziF{V3B7ql~LIw*{h
zSL(`{vk{Y^Aa`48g3`@+;!vz*fVGTAb<|)%++cA9zh^2C;)JK+yZio2Q7enrVOgTe
z)W}KgNBV8v!h%{RBTBhmOP{?9G_r-JAQ|%VCDKTA<<6ievmhxMzqN^5w0%y|Z=dhH
zuMQ}tgf(LV4}vLN7q$Nesh4uHKpOAG!))|#))U}{TQtW^d_D!Ul$6{^Pk*InK9KLP
zX5dD)*PXEkX<#zOOLG^m!y6ki(H9c`=t{)J-7gy@ceY%2Ig#0PArWF1kPXPQdN9=7
z9x*W{FZri0Bexe8_wBu^nmPYdm5P&m^o-9mkN;#4ODYWOf>8g0*N>V2iJ%yq8o%WW
z-OK1Ec`fPKd8YA#UZr3XTyqW5kj&LA&C45I)cg=9OP<0K0na9J#bj`j<YeQ8z7}|I
zmSft12f2rlg^rP0TuMG8FcjsZL)W8z7qDigo?d{a60yscvgJ40uH;@c85BNp`0Rps
zHnQIqRKFJC7(BzIBw`5P)dKqnHnEn(emz`s9#~DAaEt>*xe(EocK1RwE|`~m!VEFQ
zOtKyUYoxI%{y83c?uYQb_{*m*^3IZwGU%Jr(OmJx=zvz8Y9Os$e)*neQBW`GaU8#&
z#WDsI-a3`ahR_Nd1^)^|FV802X)tE%5cR%9_a3182;SqwzE;kgwXfT`c5i&~&bm%+
z(`EYp!XQTS^$XD_cB6L8Z9bRB*NH3NIfr48e(_S!MkLwgXdcE6LAY=)0ki*<5F-3^
z^$78ItHgB^sSxRj1|#scOPT(vWosuB;B{kXZ>|{M5lLo%SL?x?{+>P96au;*^{}Ls
zONNx+cz`Ub<%&aE=TBogS~#E3lFyLNtz{JR5g<ZOJy${xe+!-(MW&zpoqA>zCQ7+_
zrnbYo?I7ea!`@33jq%&JQE868$nOC_kj%3?nhIn^TAUQ(PSfUhqo-YFseM1RS$@Vm
zvRO`kVM6BGSSe9rO5blT5b&#A7qc_VQz;Axy-+@dO7(ri7x`r+v1{d|j7K=JFd33l
z)impsDzaU~M;@c8DRy)RG7Pj+9%f8x^M2BWDEKOKuA>ErHk^%`YpsI;GbJ{vTcjXQ
zy-3+%v#lL#_{ID6=_mE{lneJBDo$<cjg?r+KV9dmFc9y6ATYUX+4Gml;6IYkuVs7Q
zaEE(0NjLGeukPS*<j7qpx$cjAH($bBk?O<i9B|kkMAD?ReY<QnJmkdI;e2tL+}B>O
z!FC3DKw@2#4SUHb!p<l$(nZHG%%j>C91Scg7T6K<ehcJ`^X?9FdE{FqzOsi*fa=6A
zOU}IsY$();opMX{=2<I$7n?qrlL}jam2jG`Kf@z$+=dh23#8m2!U=~7BD9HMBUhV<
zZirO(uk($3<0Az7!xzuu-H@V(gyg?!e)I0q<qH#Vn1#-_ONVJ4`?GyDc`zXoT7Ivn
z=cnF=6>9(0>&!lN<1*A>&CI7j`|{koU9yet0M`y~BQ=tUKO+KWiN+R{4{*<vf<03y
zfYvSu_B;-S-TLc{TxhRD)a;3uy#ZNbgmIZA&MUJsp~iVB!b8wI5iYAB&iwr4qNRC}
zDZrdhG9khJ+IhF&FN4Tj=iX{M*B0vP1T~9<J3a~&2W}W>{9QPkR#+Y@n*weZ0?eOb
z%3iw~d?hnQ-evzP94O|bDU-mni;M^mBcm?Ch&!?_?FTAahbpl53cN-Wc*jgS&ZBoZ
zDr|D`T9A@P4nz}>{W@%LP@Pt)43X2h7=hH$Ih$~(x8>^OKHnd}JRLnE52RsWDu3%k
zbG@*4#iUDPyut+!?hu}q7X2@E)|Qp;y<#*{7wA`#lMiis*o8tp!m%1v&jPu}CRQa2
z8+-5airBYLj3IKjHF<MYjTUSZfcUyJ;HFTMXtFkpJXihER5&!2%j;MeG{Sbuf5y`l
zajHb-=8M#9zAFHG@*}Zuc%GX!xAGf3jyA|-q89EV1=%DsP{}CF4IT&&vdTh<Xfb<K
z6YfTsTn_i;Mhp$Ya374WIzndZOw319nuI@F2eNI)7P6zA7$*+^Ck;!7UG8M!Lf5qs
z{izLyvScZzhntIpU}Hj~z;=}v-S)T-wX~8U7Zrd>?b|HWA!hJ*)(>K_*~@G;8&Y8+
zdx&%E=fx9h*d_Wn_8}A#zl45y=BdKh)X<RF@dxxAt?h$0d?k0c`3{k<Us*z@{{*Zg
zy9PBHR%G2duvvCjL3)=3xEU>MRJVqj1W}$2w{WPSELR(!5WXW%B8c_=ck^e?>PtrT
zb-C0l@x&LY`u^i!fGTQ9^M0ZBi!s}o*o3EKNqy_$L@D%pI)*lBa7q2-#DEoCs_M3e
z+UmUIfQHFLDYEILaJn9~M*DRSnUpME9}oZN6f}LAi7_!zKG-LHKwwjrY!I~Tq{V!y
zr4D`E+Ar)!th0<21-z^9tsbLy7RBnj<MHhYsi9`4&Zyqw-+-{f>yVGyLj3m517LmP
zMt8#6xpWqO-F04}I+LB6(ALS3XJL~YvRcuK2r?*r{(U0_EyUqUOJ*FAT4S0~s=768
zzR?e%oxN^!fQ^{($)<p0Uf&h0ihBN_gX~ezKD_UopZ%Y)@ekmC$*bSj=tB!}0RV1e
zf&LeH^>299|J@#K^Sc-N|KIj(NcSHG;4)5@mb8ZdNn*Vw6qiq~ZW32X6FtQ)z0QJb
z`EsCh)B}FI0k&d-=|XpGcj?Y2k1VY0#~WcWT=OCxui~be!Rzu_v{&Bw^Y|kB(zE4t
zY(!e^k|UgUY&CrIqrj?8OZ&Uh*y&Ab^ofXMd}IGtV_g&#d&E25T<YWg%H%OODyl<^
z_w{R6s=L>fTGDa~1>3zA55MG*PW6hvO_BH&SZ~?5{Al*H9Wr=1_DC41vsPMme{R%D
zr+@5}NNvUQviaF`9!eC7k3nW1=3B>yQ$Q;xihwnVSnE(_FQUk<xa!`dz;%0dt*E^`
z|LpW^Pgo>r6;5`5^K!Ovg)>N+XFoK?LFV=pzTsRt+V8Q-w;#3neKS1w(V!Fku|uI~
z=&9r)i%bJinMeP*K@}Qa$fRI_sWV>~-ZJ>^UvM^n?Uh4z+IY;=cT;Fdkr>M`7-~2C
zElK+njGYuOSu(WkWtiRYFG-$8b#scwxvs?1lAoDUGWptOyB4xGLgpFRSjZMa*iQ@<
z<yG2+jf-6!Pbnp`rR6f-8Z&uzxD01aE6T<u*W8H*X}Ln$^$5<!*!<+nSusd{EUNl7
z;&Rls@98G8ZG`>Ok~KERWf(NC07T=3Hr2R$_8M^l(RB}N^l7d=D%mCmAox<%aun5-
z*nI%Wij6F*(7B%_udnOSKs$yCO|E+Vie|b}E7N}FxNBV9EO4D$r&MYF5v~rqD6Q<T
zGPcTm?daPoS<#Q3+!v=13Q+}sJ@X&8Ia4%t29Qb>+vPkaHjqkXIL`Nq8<_<AT`dn}
z&2dXqGz>X%Zh4l?sq?OyKfL$ReZ$rk%a3d+`Qmn2vhS8XRm}Gr!mt9>yu~D^P`tDX
z8CfFG;kCjH&ldAlC#GZAuugKSBLI#V2LZ67;Y6!ebW$Z!w>8@z{3BK~s??`#WYf$G
zyPdwouM7wPqjADRB#CY#20&R8({H#KTpl6WAleFWGABhSTD4$B9i1;z_NOX>vHI$D
z&q=Y)h5KVuL@rFEM(f?=!NQ8xbs{;C=wetDtJfE<EfjE5AO+=)hNKN5^2yQO)it_o
ziR?(_woKU_rHU`|lFy2j-x+lkwJJu{<HvK<rAHj1H^BD{-Sdw%@$kq)Xjvp-n>K=-
zStE^gHW5fSDD2zy9m+Loddy=M#ux1bWtw0GFneBma(uG!uW!?q4MH(%?-pA-WeD}?
zuwt1}#b>s;<|+&nzrC-AZp^anRlkAFuCyF1bgMKCk*F=GWCX{>AddLrwOr+s$?^Gh
z*y{D*#p496Ov^`d@(fUXd^8xUa1xYNG{adDt6wS)i^Q=g5w5J%AEbrtI);Z^pG;+2
z8M~2H#A%<`X8sK5xz6qyEZ&1KsUi~ktV=bvK_&QE@dC?-O+^1mPDw?b75)7gbvKK(
zDA{h5V{*fe@io-obVI<{KQnH5At8;{bneE*`Ds@6xn*a)z>7lxfrq197Vmdn<GBcT
zgdp6)d*X>vH3$ow;3T4)Ge+a>O1gtht}-l>k9_|C&06Wj@)m21-gEy^Y?N~LMNHKb
zJ${~MwL$MJKtH3d2TuB#!7(GPYb<^jF^U;G)LTo33!vJq<Dko_{arjOkU#-j7oYNK
z^Ft8Q`JV7%|71pnU$)oht50Qj=cn96_$!0IR)B%LTEGm()!wxLZPl5=Ci*YRW0A4M
zg|~|pfoyl1t;x)2JL|B6%AHG-i0UDxtRM_sjnNKj+ZH9Elp=n7n4kg6Od*DgEs@e{
zF1N3&kVYb$ax9zJxSDnLAG~WYym5xY0b9=O9jLa-3gVx?ZFZx=o&l)G<w_DP>*4mZ
zTY$jhmlRxI;lwP^z?=N*d<iOU!SLwTOEs=a2`h?`rv)?QKzUmz^d$Y(e<D|Z$kG}_
z2Dd)d@J6iVWy^>0Tipvhpy1tYn|Bv)4?F9c;nw~sg7{Jnq0rYSs^^ov(Gz`T#9JBp
z2v{6J*0@*({Qaxi8zmC#?%gOb)3-`O0af2UH3<m;fx-?S?PzNgQWwOzoDIw%Yb2j}
z;`*|9B@V7-gr;Wt<0Y00aO|o-apDbxe^5NSd>m8j9t*gM9HYI#Ae~qvQEN@NC7&!*
zcW+!V1+DKRuNzVuv`km6dbeK};>As}G(~0c02X-d5<e1aIY+(>3E;Q{0uUhcTnR=@
z9ihiM6E4%ZUVvxbVFyX$eWHk`KtfpvpFVz}7YUHF8YbZG)QsuAoYy61-ADs)u99{M
zqlI^E)AmdA&x!#tBdud{8*#Yl<1KcD>kv23SPxH0J=w;2d;P^@zEHeDL0I=^*Lltw
zS)H84G(P2i{aQjC^H$jr7Z(_PSzQR~{ksIYL<rir8{?OCe$xHWxMl3z#;C)%boXP(
zr+r#ANDscj*0a9p)Ba_uF~;;m6UY1>wms>gkuRS%(>bo$o)`GFe&^BOO-096(--=6
z^CksF$BlYv{PS9R#0RpWn);cgei#IU?3N6l9QHa^yTDZ*>cPzxVCj#%wFfcITs<xa
z;==(kP)~fkaE&h}T0aWv=V$)$s_AU&rwk8f<l3D|(;^j#&2FK|l0oMITk7C|WCt_A
z!1qvvd=9Js8llnb2ALk``$Zvul4^DE5M|WR)U7Oq0ZZ<kQ{D>(fm}qKPeNL$n=gB|
z)#Xh9_{4`HQ|Eheb?*F?lggk&a(A7n|DJ-Xe-MXGX5+P<Z`N#yNa^WQF6_y!U|nJl
z_dXv{`Ty-Yh<+3{Zg|&eQG!(A#Y`csc>@F-qP%vtmz8>BG)v?y?jxXCa()KZa8Hup
z99X=q$&;aB`-OM5$#yZoTLDb}A8GFtq)QZUd6sS4wr$(Camw~7+qP}nwr$&X)tq~8
z&%|^`+@6W(?<v2Be9FBe*MH^Oza^!@`Kqc<^r;O_xFPo*H+IN^i^sI<IrrQFoZS0I
z^kSZ0C{Y5~tH|bNZaul{?j++(SHs<w*nI|j#+*@?-#$0FwVK1p73-O+KDFnbWEsjP
zar3c`lR&7lg<V+lw5@Y0vWNIj=>7U3YBDsNNjXxq>^XuE?*2@QptV>YhKB5p%Q7h-
z*W9b!*1F@Z*DE0I<B{4IhAwIxvlBQW;5s}ySh~I@@$>kGvFsCwkSuM^8BzWxdPB5d
zX%6dEyTN)oDud6LQP8MSbRdw23wMVC!}CpP67NgsdP*Aml!Etwn!)CP_N0o1rFq#Z
zTYA}RZ%8S(QwRIs?FrdI%dp2Uxuckpn?Jp=b|Fd2?lEqQ5rwOH=QmN$cwxf~6Gz;C
zwz|FCzW=mQjYxjv3n%uJ^gq|-b>1V@a;%K+k!8B!2|Do$TU~4$H|&I``rh3%TZtUq
z1VmPJ!`XG@EhX;R$h)Sew`<nzc~(B$*Mk^~i(<Ai^w>7}^F7yz8ms%kG_6TVK9{iB
zh(xRSrU&*(E<xZ<HQQpivt9wfCY{m>j6YI=ZLIVL=LEoA{VF)2Yn)hZ>fQ-e%pn!`
zx%N_e22Q2t0G448v)CsY0ZLJdY4^y>=XdNK^X}OCBy@}qp!c(v`c7RISw}|F#}iWH
zy=!=BZrDTr9bF3YQ?aYb8($Np3q+sd4X}R|v(Iyq)~K+GXuRvDDyW>@K;>xFt5YI+
zD`FlIjB2Iwh)`g+j`LZMpt3)j@)y{>D&V~pf%iWx1Yh*>`$bAIqTMvheTDHe>j5L<
zrW^NaL?h@_MVB5UX16w-PW&~aeho70|Ln!}9BmW6Xagagw9)v`P^Wpbz+qGNNY@>N
zuLARAi{Kx0TMgRa(2QjC0biM(VTg0QW985Uk86D%EYH5-%;U}J^FIhBrLht9Z6Y#L
zgg!chmr(?qLPW6Y2>^rQheBIsfkio`v>dB=33IiC+yI@15J+Z%Hh36PJNS-3O%Zc1
z*n9$ME;1NcLEDHWy^hZW7W;sK^|id}pPi|Y+0_e>dix~H&0dL~0*{<WWwP?wY`MYJ
zC1(ocR_1e9$3dK(ul2U6BjAn1055)oyae~v;(vS8o0T%7vj&r=Gtf`Y?2qs9PVW_K
zfDS>~yMb3Q!KvwfLWb(NbM-4JT|;`R(p<r9krFYp?P-U?a}Qe~^D}10$gK5oOl7rZ
zf9KvQZqerM4f0w2dgs0yK|*^$=v%%@a_y<(1f=aIhf1Rn(DCcZthKsi<PUk4*<#wn
z;LP<}@GU=B;<5QH4&i8hF#EV2BN0`Ubg@0E{#39%k_I20FQjMT--=A1+qy85|A^uW
zwK;~Bx`H1M+C5?~2*l6fwD)+wqn%Cjnlgkgm|6|FBA=>D7-T<UoxcTv)#A{rK9nmd
zm8~@QBLocvQsWpKUegBoSOfuv!$jQ0$Ld{$yEzdTI;xN6Ji?TQQ4=*e4gP%bBKIz2
zY%5P8jYY(w_&V@6^Y^Dv({IK$;XtXKmbCYZO<9Ew;};48E@M>~Z$Tt&VN4tBi9`dv
z!EJ1z(7Of^9dQi;tC`pEBPs=&jl(+GU?*4OGFa4g=yr=eF?w^{fL)9<U!o$ny)n1t
zz|{eimhXCcG1gtidDwmp#vj|s_$T{B80=Cc+=_EbO;7gHMi|yx=v(@Zc9t?^t~Yod
z!Rd(NB%Nj^e%*TjYTbCU+A5}EQ>7j`+xp#{w>JIWxl&R-neq$WLSd&p+4SvfIVzI=
zYQ4<8FdC%+)-Tl-p!A0ie2d`|UYDw<U%hXwCr?I@!_$OD`k&Lw+7L+>qP@qUz{o=E
zzR9vEX?ByTUjZysJ@$d8q|BX(r;yQjeTK9f9Ah+sZV=XdiDHvG<y?=w5ozgVfM^*5
z5Hb$7F2=Na;f*!j9K-X`DO_wK`=G5x>E9-jR6n$^`93YqZWx4JZvWTZxtj-4i1ROa
z9UcC^3tkibcXQ`|A&^CFU2Oh?2%@R0e8`35L)I(A`siq$0!gBimY#jk&jF-ke3fL=
zHmEGMCRH$8uhasZ*xCH+qwUJ~HLvzyUmgHbIjdOtDe-6AJok4#7w=t0rd_Ahh;4Qp
zf1jL*hrgFc)wec`mf2{?8W10DGFV1K#v89jDZW-d+$PgUD4=}|Wjx@R2i4$ihN(fu
zv<b>XL``x?`C;w#^GL4eo<;MHggjs7At|_hAo>h_unXreXRl+_{_*fDHB&O>M&q=e
z$%JEi%{YF`{#vfw_@_>g(=ZVeQ7VpB{%k7i_~}>OBWUDr`58PwM2WrgP%6zdwD@t-
zTu^DF3;xKs_F>wfLS&yQNvcWmy|QS+!}Ogzq%;vyIF0=9B-QC0^jrG4<<E@L4mn(N
zfY$}$oAAvR`2{EZ5@gt+XM`B1I9^ol5_!m@%nuXKtbM?#vXE~y@5SfPbJ#OO3oRFy
z>c5&(UvG+N=r+?WjTTg%MD5nAgZa{-?%>)KdGA*?0I?1773b6Vhyx)pBPxQ3b`_e;
zc!aS6_dtpshX=aF)vF|vO8cJH9YqtT_6S1otRO~n%PzX+_?`y{h6I5jr1VOAe~1zU
zCL+fNx(APV<}hopbfT;1@U-rsEE(nYHIc!aLG<VCFd{`VmJk^<K~R2kN^KNCbrBkv
zW25neW(hNHOEfN3IXaCYYM&$`Rfalk6ROJ#e5?^8NVphv`g(|PTA`f2Uc11bb|R{#
z)=P=Iswb0FTl+c`0G_SaVW|1pNALIB#>UszS3Y{L^GRn{v`5Uy**B)22R4q|*+)^B
zk>8_P&DvK*8N)W^;s^i`RyLko&m|A<yW4Wc3!fmi_`4c2Q1!EM5}lDsneUf3I|ywd
zzBK$XUoU(Qpacb1NsL;8DSXHGiNv2T;aWE}I`%)q1j>N@e(6Y!2t?!wS+fMM#YpZA
zS|)i@T^iD6JhQ53f=qc-B}%aVI&nfdG?OaY{uE6@Kfv{BEhS2kShr>ZEdcbI))OR?
znhCoM636c~&!rLtjKH9%v*4%CXt|?2LBXZ}-cVRJIal%M$zsrGobe_^Fe}nG^d1@-
zUz+t8f)9WdMM{nBRgHa0jaD5MESQ!PD;2>)Ja1+)`qW^rG%3|Dlb)ZjFtwJBs^`SB
zi@K+~R9ox}&Jf+XgGWjdtbPM$Uc+NS?S#k{xcBEX00o_`3i6S6?d42hoeO4jb>;7j
z7)CxzvK8t7h;CO5l_iHUgIe?hKE|x@g?*0NV9VA~Ci&IQs40p#Win3!)|@nW`G1s{
z>@MtqX2~4ht&wc;^j_r<+J7#;Mh!cXfM?^q1Bu_3F3=u#N0s1W^P-Mrf=0bO9HLU4
zQt&2UPZ7Q8A8w7$>3j(!cWB8IL0H^$_4Vd>ZV)s7W)je7dc}ohybRLywnS<UH(z|L
zoNvR8`qC@sl>1-_!gq9R(<LU`R#Karw{mY$e+BM!95f6L^9UMPxNA|r3^@XMit~=~
zc4QRlwQBPGS<6OQ1K2<ze!U+lQFu#Fv1^wj$7TcUT$4ec5dWx5gwFJ^sS*Cy-72hc
z13SwAEL%n&dr-g4J-H<Ec_Ds#1d-u~1>fhe(Esqvfwst;Gg`9{S4#Nlii7DBFz6q0
z@)=L;G)f0@t~toU!5=f>I-Sdv(SOgvw+w6JH=|bMsr0zqh_lP&UtQQCbV@UV$`e~2
z0+!i|5p6j*E;AT7tr2COJY)puC0w-Mai+1%hDs82+My@!N^79)_ld!Rh<mx*0}T>*
zQmfg6h7An^M{T9ZuL!hOYrK}uWx;UD%A%E8H+0^nQ4*8CZiSBDveohi7jIB$6DfjC
zRF!w0%@Tuz4Rz$_Z(0E>KA;rMF%qeYMtUC|gv=uiKis`8_<6K=&AlSp7E<W7CK`+;
zwAm=G38E@b)YjK}LKCFys0N;=v;$<6GNoocLQa3oSPdtd+!-8`&*Jyo2qsY64(z^?
zh&aauw7idIxK?+9?GMN*fg5~%@0Ij>mG+tg4IQN)s(Wrw!rg#ZrmP~%x}?rK0a?{K
zs;0i{oEH<*bII_8t^y9HLi2p|=QxiFstoi3q8jhz(+Ianbs+jUDg&SzX^RmjVbgg2
zk0Ff9F0d-95^hoQKucMLa1#@Tm#sj49}cU47V6uGvT#0dH2~0HXW{ga#p18YT5L33
z$i^0bdkdn*bU5>pnQs+UTt_$CeM}@lQ@Wdud4X*muhmk{vT!wk*b|!lbQetX`!D2#
z^_o?p-Qq|R4qn>VMZ<SH;Jn$6v!X0q^EkV%3<LVc*DiL;W}SE|*41Cz1VAwv!^Mki
z=k48mY(yzGYP&&aoir-NnsNz^Dq|t)v6JTm5+lye5jxy?#pb<9l@K1SVw_WfL!I^)
zWp&YgDp^3+?KapUcwE#oZ0TT6!8xFU(I}`pA36jSteO|yOOjo_4zh0KFFG_A+<d6X
z*-JS*7VqWGZP|3?vZoG@^Ud=Sxau8Y62%oUBf_fJ&ji$4;!OqX^eRDBpXHGJ)4CN{
zXPd5W<fjlV`Ym2%oJoYCT9l>Xpy2#zlnIHxDe9Wnj<mWm0~tv=GwSvUuJAhEVp-=k
zLhC@wM;cO|Q%iE_mg6SP2(K|ZC~NdT%4O8!bRo5A&U5G($@k7ZdjiLc{UZ%B(!uB8
zrBX+NOfo_onm!56%mq$04<lxs`m#tZ3W-JcOyJQfs5dd?<{&kp0`+4m`3f?cZo`v4
zAW@<PP%(~#ZasDdb4LQBJMPBCw)x_T+N)j+K&oJ`a&hWfZ+yXsyj-DWbJ>-G&#C61
zPkG8`sF)MZYt*PzSF|s`W9#NZiDA}y=9xavAMUSQonK%4|KXIYzEJiWLHq-e5dZHK
z3(kM1SpJh?_D`#*_S+t^A@J7r8r8Lv_!D_4lL%xcUQlQkM&N45ZDzq_U}=j`C=pOv
zZ4du=g(lJ1wF+(yVui7ih1!|zc&Ut}?mjaINT*$V7!1`o+t1MNc`~(!f4$P0YzPr)
zipFv}2~m>~itk|T!y%fivw&$N4|v8!aIyp-X_@7-by#qq&6NSc@{D@G;6LL<S154q
zX>ks=J)YhyR+@M^`LMQUldrP#f4M_z+w4?j)km{USvvVW(xjWCBQ_Q96^kRHIY&21
zv$BKRlm56p0+RMZJfHc6LPqZxPe(yVU(gmoP2V6aX1&F7N@1}gnD<*+(1_s;8SwuF
zkwH~}xQtq3fh&i4wtQY`o-%-WbZ+?|)dlkDA04(kcl=44QD@Mn;f=C`!%Ng(#7TIE
z{>q_A9ru1l68solWSVx;pfP-TOPXHz92=F);pcZ9-+!Zd_ehymqra;=lj1q0q`{-e
zI*y~qQw#d1oj2idJ<zCi!>S3;vR^2^Nd%}Oc<bB5Et)-=5!XUeORoS2Qaa*`0D)4+
zqIjHl7-}`<Fky$%7G@Sj$<~le32>SQk_DNKRuYu@USuR%;vuvPD|4c0O8Q166~p8d
zB&EQV%4f3;RSC9$8E0HnnOzY6uxl{CEwO9X1NBzSr!V0bc1?ILf5#?CD=G)dPm4jp
zrSFxUo&E^(+za%32^0FaT$;pXVqL)qM3!pNr1d!0{8;kXZnBNkNL5YS(m0GBVOV)I
z|1yM2t4m7#<mBF4IFq%o+@P&kmFg>2Pd<A(i$M$R@2+?orH)#yYy7eg$cw}Uye_`p
zc{qne4B<xujF7~ZVrV&r#vyIxi}|`9&v&h0KXJJ$jSs9Nl^9?hi-^+As}?Vx;R;Y}
z_bSA&5e2(Qli-~x{j(ttFlw~GWnNpL>Av52iKD|0;`U@c8<tx|H|s+N7%nB$^q88V
zLxqq@p@d~ooq7Gw0u0fVn)hp{B_?wzGf!UZf~6=FSy8*iv4EYiO$<8+Zw2P0g^(KE
ze5RUtLhx2cRd)M|iT~U}yh!)yD{tLPy_s;{t_MU3%@#B!6+rhDy&?N-DUZg|zA`;4
z9OcQWO3rj~+k}#ZL^qSx*}1AJyM)x`X9LD!leBkMKOTn7JN!dW(?7Uvb<~P=-J!l{
zp*YvxhcWDRRNSQONI~o7d=4+x^yAVNyyFWr=hyu3+G*_MYfER$;la<nV7Kl^qEnEv
zdQP1663+W}p?yEn|Hq!E)zZ7I00sc41^++T^TyR0pLUyKNI#k%)Fp5_(r~onJ<@&~
z^|cj+MM9>WaYt58-2!>z$;}Moq+`XXy79l?J?qEP@a)~f5ZbXmQ{LQ<)5goZKPB>s
zG3Q#tmm+*Ltj%3)+0UM}IDdU)iIbK1?S;Fdb!k<Pz*tcAQY5-vEm%5k5T;X@ObPQV
zMTzPSj!RI;CuVu}mC@db@;hgmgm0G<B?=ToGI&tWhn`t(y|_8f^?SLv&%5znXZ60X
zLsy#=#`UI&U-d|9)W$Qk3V+;}TrHZDb`pxml2m9IptE1C7NqZ8?!+dVY@Q5(BN+vD
zBi3Y_04vZ~!bBeGZuYW_PI07hmNDo^t0|;|2ZfO0@plQ?AI4M5<&JzxK$`%}E6_ZT
z$qIxI`|V#I4TRkDUt521WJcHn@1sUqk<kYC&PskK4Wz#B#Xp+))1O8gW8q-`ellRn
zlsa?g?@x!$+uyD1&wigj-Hgz&ZH9j5h7|5!5qEbsQ{9vRcld<H4pPe6?M@Ro%;oPF
zhzzO0B-5iKsVzkmACVKfEAsV6$OouVdC1^OG23ZY(}@;ICxhPk6VM~rB303{Cy4JG
z#}aA$E0CQAMWQiaO2|-CqK}?6SVzerdL2*p_rizJBB7e9X1v$~_PzP+X@Y~@lQdS@
z^Oo3}!^i?{&nX>Pi(X;!q$sy^pCAxkMQ6oLDe8i~97yV((FfBbFb4RF+Xi1KjDHdd
zs+BLz#)D?sqDGaB*CHwI1e`+x2u!A1jr&{f;=OZSqgEMHr^Q9(aRzqK58FWmCzm7V
zm0b)6O!Jc>-@5Kih~A?y=Y2CQnDXGO>^;&>%+<!1$Dctj0+RdCF$T@Fb}n1-EwJO3
zqMm82WCI7vl*F~Im(mA_Z49o(8&THCW8vDlOkjk7Nth8yqB!mi*$7IsFFK7bKus(-
zcyG^^yZyt2F)KcJZq0}LV<k}9-Pp^XDIrATRAWd(?1R?_DdH@7*g1bz(9<_V3{8U5
zw+w{INEzAvsPZFj(4sCQs>#8=XvwIBenAR^(g>~9#RFh8YW<{Qz<=fvMHq)S)>WJd
z0Clw!lE$AAjn%`@;wWXERt?|sP&|5#@TIO7nO`BwxMi!q#Ga+Yh+=)%T8$|%2%^_I
zf=NmC7H!@!>U_u-(5``1%gLdV5~n4KGekIBq-ivuQ8FJdHUvci0^*QTz~ko#n-GbH
zpVHH4{)Zhqx`QvLgT#J#)~InVOAw@dt+S3rn#dV!Cxv>ARzD3+Ug`r({3b#763umV
ze+0@QlE#1Wts<t4$rE(5g5`%jb5{`3w0;~tAEKQNvo=jA2_0>s&>;5gONO<R;o|!J
zWw?eZl14qe4Y|KSp^mcPJ4+R2UV8;$2)<E8kL4P@47)wHJOZT^h~HUmmaDXOX4<uI
z7li8Af5P*+hHidGA&0oKX(QO4O-4FHf=JTt&wTJLy?zU{2+SYBYN(sr2W88u4I(s6
z4=>|(&K{p0mdDl;yz$SW8?bJloN;8-xQwlr9-HPaWndMDN=J1fyt;o97%M(qmGzx8
z-@PH;t7X0qALp~u?=S}h+)7l9y)<dP7mdsAy3O+)iqeD<;plb1i5WR18kMSRx}ZNp
z9mkRw#Zf5^HyMsO&#Wry0b<_tl4*5#sR@Xh*xc9(r!A*0-lBq10HDfT3+kQ|Er(6%
zpCLpGvR63NfPqN}ND5_|%1qw@Gg4)=veIuXTv)#!z?7I$?ray$SuzbHJxVspmec4S
zNDGHI1mW3jk*`FAgu{hl&y%&NYw`h*M{li9JmU5n0~cjK;81Lvok6e97Kfg-37)b@
z<mC=wmAAhiJaQp<a8e@>INX70Wr!kT%!|>=vL40~$97mJGt~5aC5g*h1jn?&i)fVr
zxBKdwF*VVoxVyET%YTCi5kF1<8x&d%C-dPMrDtoryU*{daJB}GZJXN+gLv~2tuOd1
z3YOwuOYx9ADp5NJPxOdaEQ*7X;~j0;9*5<UwbEj@+m*lg(t5IOV^+iLG0ae0p7g+9
zXN$kWTXonMH3Vgg<gM(P;#AE1!+*nwZf#S=U6rzQ<<h5TBU025N}3P^HMyWOsF5_A
zQ4*n3)v#jD@~3(Kc#>*(v!G$wTlaYbn`PHlko_Z-3C59q!!;f5+X;#e-T~{cBt5+H
z+f;eJeTx^Ld1vt^PMu9KElx8=$3YiU=I)a(wb3aj-*#KBX<9JMKHhrTt&AE7#tm(-
zen~@w(u(HiMArPhdIqa2GhLRy{?>w$p{=tR01lmlo5^ViL=J*Foidr4wECeI54Nnm
zhbX0?P&#Y~SdC4OG-4Spoor;vwRtmATQXOfnnyCTF2kcXtp>tPaU*1c-?;4;c3>1*
z#ZfAvO+_}_7&61sUg=6~w`;$AiqjJJtu7wo?~{U#fU^H(KyEENDiS3tN}F|ot|{zR
zm_EAeXma9l9V^YTho~)R`6_5PwBGlR@oc>m{33Da4$g-<+~U>TuSwakXtG7A>hvS*
zcOV?m(J(OAZho?H>ksC)D@260#Bx~*j5~rS9zon<0Jiq_A3sG9h2ekI>pUS9mFcjJ
z4<Aj4-ssae_d8~FV->@wg)7zh%;j7|-wU!g2G+S1VJEfZ<mgGQ-d~r19e!x=`noS?
zpSP_h$Jb{wA`bb&?IHaYJ)QQK%cwTmuzIGWc>S{@ja7^5<Syn6vq;T1&Q78?^}PI)
z-uni)B3sSryJ$7sQ$1g;!M{NNp)LT*FzZnMO%#Lw2+99}HiQBI`1jA>m|F4Q5b^)~
zF#cVc{a5`P{r@X_^T*KD@SjHczuV;e{+GM{8zAC;-t|91J1YM{RsOFExo9O_d1OHp
z-o;v*$&`g)qB(ehGF!JwY*=`#FnSUa(&bdP51u^*wT*4FwTj;{by*f!Z-$=qx56Rr
z!2(3K3%Qq>sqWV)&es|5-}`rHKV0Vs3M1awXdtLHmCVfvYs$uIZ(3kCm@QTVW|W<*
zk9dr*R>Z(%uVH;ByP?4R)z~6@7&lBuufKcZ@)%mK^hv_8;PVomj#wf;8t$K^I!YCL
zhud^M*QYS)-*?3Z6t7<bJee`EK{$7Xh#pKWG4z|;nLJbq@<bRx=0tObP80>`y~A|t
z*Cg#H@A#Uk-077|v2XY5%6#)1&deJy9tCG$iIjkw&R>!g#N)v9Jn8PpbhE)vPln*B
zKW(-lM*LY5#twUxRMZYC(7m+}vPlfH0LV@Z%OwR-#Zv{4;B?O~y=53JzwxD#m{^eL
zs4=7as^0sa@)!+2rrXoK`b=!+-zewl^DY&R7N&C<P$b$V+rmc{04awn*vm4k+`vv%
zOXNlT7E3_u9!2A9ki8*LE37?8hujkLd1jo=m`vkiv?h?8p($coj1PFjDosaAT+Akk
z`8G(cVhy^mx?O@7GjY;lo{Z<f4|Mrh#Mms0%ShYeMZ3QNM@>$lKc-s|%J9Ys4Tpb)
zcci+7N1{EHuvC`z#fM%osGGDzFXs9#f~E4-2|g;*^FutnZ^UQ_<&mOl$Mn_f#ar?v
zGx+~A8-}dmn}_rdSWNs6zxm&<H0uA&`ura&P1)Je)X?U?mRhwYq<7MC^Kb6$-$tKw
zlEh<ZNM=Y7k|07t0tXck5G5jtOaqakYRm*ek;Zfwh?N$l^8+QT<qPO$vOT7j1-?`v
zozIT8)fTnSKb6h3wbiJ(@;;H$q6ECBe|KfbpnZCO{?haReciduahm-*!|UdL^G3`M
zpb&dXn-ww(9v4gPvt}c>|H$Mm=vvd@zD8V0KXD<==e-_Vt5F9sI<Wj#=WwuDXpak8
zfB2cno3<~PeeBMK)2R@K{oTGXSn@3-Zeg=^%)S!lmqfT1#>@1rWN(|S(r(<o69$+G
zW};3WVvC^in`w)1Fq>(Mba0!gD5#H@$y+<*c5J7c2`6s9lgV2?#24+%hiS`hACTv4
z@D)-`|Mg`jMa0<6j@(}j=}UW)8%g(m1|;8pdH5dpz9Yt6U3)vk#Li276O*osJZDRc
z;*XZoOhz;Is!o%k&EiMMF*<9FZf{21=G^vjYLpx4Y^<BLe3{`7F$mTwy&D3`r(c@g
z;RJMwFHxg0LKpOA=SE^Ar0cVLPvZ=E8tis8jp|RuOU+Qmb+$HA_vvt}^Ic4{x4Coy
z`TC5v4~Ilqj$hwfcCt`o8Ed@ElPl9Otfp(40#J+WO^8X?al-OFUaEtwHc`5doGP>$
z+$~!}{E7uJn)+<USk!w|le4tG+vtmlQFcp7{U6Fpjcz3glon^VYl$Z^b=PNWdAiLW
z7pnqwW&Yhz;h=H4rh4{#OmjmAd&i@91`&wT`VBWSt<k*t1DNa0opg({n=2V-(%}-H
zpooj)Oze^H%dB}c2-lHB+RZKDE9U-O7eYci7EYmZF&XK!;bBC5dvcJJ5`W8bT?%OR
zlQ<k;`<P&P`zimF=O@=zl8=w0NPoI2L+vbB#^R3s-??^)N8Q!Tv4R1{14o=reMYhS
z8WXS8mo|{og`<ZWwSgsvi&)|G1vg2r*`Yhr@RpaFrhUz}apP#F0GY6;Rw*`)qX2bh
zH)j&hO;QNjeCi^0=4(mX?QCA$EP|VQkxFB1I0u_17QK0j<VB7b4Bo}h;X+b5yVR&;
zR#=E4(FBmKjh$txzmcsZq!B*LmSM*yhMh;Igt_uBBb{j?L_3_~-q=HqEMN{`XpRV0
z=B;k4kgf>Wb$nr>8W=-VRd5H+G!O^g)+V1(uuyUfoZA0@-tdzZ@eIb5gJm^dR`R;?
zU9I%<+NJQ(NCaVzb4P>3f;<tU0q!{b5C{4}lkg4{Ve*E?2$@0p<3oZJ1<VtqZ4_Z@
zm>qMtLvVF+srmF_BrV|g#8uD-i$L2%!l44(rpwe6HVuDLy74ewC+eV6!5zv0{zm13
z+=Jx698mJ$4zV?X*Q+XMnY3wy%<e%U9;OrI4140|Kp&LuY3Z+TZ>o(J_Y}6)xN(n4
z{PR%HGal8d(FeIYoSciQyB%#x<Qm`E*vAOa<q9gB?FwUhATMu%Es;FgC*L`*eJVTX
zrJvY_K9Q6-T?i*6UD=<XOzfEOjY7<<crZ_g_9v@l-95C^78Z(>9Wh5YGvX9Zi^}!d
z9lgh0F98pS)4ND4(=2l_WXm4D59D1-g-Z=U+)UM(=E<nuT&C{Gson$lqUnX`VZsI4
zkw`V3yCh~!HKsm;n4fo$e)KY)yQ6xs8+!QrQ6!CWR?Y8c$ZqV93bIkNc|js(_#h4y
z%VfU{YhqS#0!|6K=FhH#?{I_oxq|w>9p#NdV^Qz!-KltJ@`h<5H0l_jU67zvrmxhP
zmQ1!9SqGhTLMA=fM6WDlGYp%=(vo708Pc1<q;Cz&Y5CG-mC%{vl|syrPoIty!|aZE
z15eu<@q?So8O$O2g~wRI6|St0+OY%c3aZj~oe2IsnBdK|VD7g^plU{2Y6PZhL~3%N
zJJsd%29+{SPyRdHl|9**Wqz=Z{LS|T&NSfld;-doGbuh=i1ivR_>B^aO(yajBf336
zoC=4oszXUf6CM(ZpoP+YPl)nFOyIO%Fc$VFc;g0FrV!gBYkydWaD{^<wjixht|C)7
z@hggYZP(yMH0NZLr*es?nS)6Gvp%czK*EQ@4IsF2@|D7|CsQdcpI=x_dC1z;K9Xh1
zx&~e|@a~2&>|Z<pU+%E@)G>7S?-3`ra;DPYt%N;Fq$=-0E#VsFn>$rIf8oM<70Mk9
zkULzvj;Hk(jPkwH(tavV8hwK&ef_)d^q=m4$UCal&fUfX-#*kgWY<F%o#@^@u&(gT
z`xG`&z^~Ex%Rx|)<m8;M1ES$5w&H4|8zXJd^w;KCqlFT}q#Cqx{KqOqM&)51suNaY
zKIRkkdOzH`3vBc?KDd@c#c$maM1BwDsRm%+vF$_h%?MDXL0?S3kWpZpM*L6RC_)jP
zAfrw5$AV_glSTKnWI@VX@zAO(0Uw&t?dI-g;W7<Y?dfpM#%WH*+MT8gVb#Di@-8vO
z$PG@-(Gn9}X;^-4tYlPqMZnbX^43IDQ*S-Bk*=7R&pX428QghWEv+{i5!x?k%>B|=
z<A*W-M57c;X51{`b*PsgVyKnd`#JuiLuKP=ZuZQ{C>kB@OJxSEUAET)Aaw!A4<tCK
z6aE6{h{rzh<`%cuRGlueO(*V(1~}OiSg%;~HNis|N!VWMAfSJI6!oSTf>rrVF9g+e
zojg#kfZafReEZ_BIOfCJEO>l}W}boND`UFVQG{dk6&<EI0X&w3)Y=PxjBtAAiQ!=s
zA$C+lcGN?y1_$C~BfklIc-fOtQ4Ibfh@4WWuYi)hRu<G+Mbe!TOAaCOcuD3ld1lJk
zKVv0Y8A48F87B+YT-j)gKw5(4b6R>n2{T2mT0*!@Ngrp(&ZM-ZmF4la#f=vD#y+X~
z8L#u4PXyHkqn51SVJma=??<=iI$ScB=lqty-O||S7`g^;7K!oV=vc)~>tPC8Wks}N
zw9Ob!<;!XE+R>y-wk&g`BkfCu*7<aW(VkI}=Ss%l*DS94Y4;u-3v0ri(N<^B8;-5{
zCTaBIlcCV>Mw?ZUeqVqd;)wZUQ-(`KV+#0u>9FWgi=pjbM^U`v0JDf9F-Banzuckd
zaKtS8`x)nAqVtFt;%{IqMflDWaTCY40A62#_oib}9#d)R4kRDWfCc6@@aTCrWk0Ua
zal0?D21-k8*?ugXeb&BHsaQYT5F1myp(hBt;C2yO&T}6Z!v2CpzEg<<qf_^CG%dV@
zw|}!PlyHPx_<wwYzM9hLfzzAO<zww7_Ypa{!t661wgii^nsuPx%-F`yASKBfC0k4h
z=Kn5r;KSe#SgS2IX{yTUFTS)<$Ev9y`GPD;diRp_@DYUbL-Etnm)<TRN`AaUO^s;~
zpLi9ou)U@o6|g&aOmJxq;U#r27`fmV$E<c@+L@X2?Akr!fa(Y4_QZI1AO<@lTX$d<
zJ44GAbZ1@f4iR<0n$Ne|vu(#XS>kJ1@^_rU=}5U5kr#7p_D1tQ>23+^4$?jW+~nOJ
z@^OWYT0+du3%jS|jozM<zxm}5iq0y9{gpa?;t@Ru<w|yHjMpo2c|y{a=q=#*PU$#D
z-4LyHH2aOI$zMJ5{2(qqlV=gJn@fBmQ+|gZ@s89x(fJ#^lh40M+x6I+wR}7O`P4Hr
zq;&-AH2x4P2bmqJs*>yk0*Y@eIsBy|>k?fAcI0#TBIIzRWkNpD-bZ#6X~}<;aff%{
zX@w_bgN)6`>fNRWd4_Oe4HNq$PU@HtLntx29yF@ZpKa1Cs8s|IRjA+`^eHTiCqvii
zVSAaZj$8w;3O6uXZ&rbr(4or=lmT*TZy)Zgsm-)tdos9Sx*U>iRz5+htXL^p!ynWU
zO-CUvu(Efzf0q_ALm@CmA+|=*Z(Yc;T^J%VlM<DsYrBXGO;6``hPsrr8d?HJ)VHnn
z=k3~&JfHW%?@Aqxq1O>N7Vpsy%b3U*3&xmBDjGA*Y)Yh?QQE0_j}t2JN}z{gJwx#U
zmXDbC`Pnd4{7pb3>u^j_!#J~s;2^zq;WP1x4?3X~eZ?>9kStPp2B!5!yo`-Sb!u>Z
z@PNA%>>aRw5%6?~0Ln@@WpAxyy^A5Z%c5+7&59%Wly0iw0O#n=5st<f&oMfYagYOa
zGHS7IUBl1Sn9wtNc+E5`e0zjR$DC%h1C7uiydjZ@3C};9d)&w|JZeF`{rfS(x36)Y
zK|RdlyH2<MJ<~M1oq=`Y{A1ZPYgBG`Om25b?w6%A57Qh&d(MJnOF=n*90^dH84<y4
z*W+;jQ{L(?`D<jPXwVrzgo!PNy~rQTOK<Wm&ou>~x@g=oX4j5e@WlqQ@WoB0kKGxj
zvnd>hj=~sMA9nz~&10^x0E;pI>0~9{LesfUSmI978j-8Pl&2b-nC1ypn$1)N6K_n!
zL#!-ook-LXm#eYMMZgI;YJyF=BjwGxn~4t)Y%!B<JO|TgoU-VpQ1JLY$xKl*#>gom
zk#x)o6!>BU8fFh=@B+b`M~j9$hdwl@s8&`E)-QAPtlVx~OzhCs2B>ceh8Lq02W;*a
zR~ja;`k^-9%P4M#cn9{4D3p&VukD7TMk*TqR!EtngYe0PC*<VfPw~`Z>3>CBBbi8D
zYAh_<j4x^C)ed3z++=3zE<~>U7}GV(gEy15s65=<gcZ&MP8DsLrd-l*Gt*LeOLv!a
zEcD#fQ!Dij_b^b=ryORvr$;}SC)mAv)*k+i$E36g@Hq&W$4Dr;Uo5Uce_W|gvSfy7
zoTy7`vS@OYIrUfdtDHDj(;S-LS!<GhL&`_+6^y?WnIDBE$0=qFyK<sH;X7AXP^*IE
zCf~gfWmW?vSWLzn{^nZ&&*+Xw!~T+WY3Musd~<N>))f0S8Z5**z#dO~e8y2fp1X0J
zS502cnwsDE0jF~@kj<w$@IxIEQ{3>_1nR?izp7%7GKk+_3Sx5TQnFAWTP1<#s_C&*
z0<_%yuqB6PQ{ksp3RPPX(x@t&ae^gM@DG?SDEHye$#UnM)UP}sFTA!<1j*hMFm1dN
zuTnxLuBTgaw`ntbMCNX^q%QMSj=XU6(nxUD^Lk@jOq-wksC5g_Yq;^d6;Fc?IHGc_
zA(3ra{1YuJ6xLBn-3C@irMIx02LkVZ4?tgY*F{gg|LO})`zfj3RZ=)ES)){9sg!Z1
zm0vK(Pmcnr#)`Q>tyE%YEtgxUL&vF@*JYm^I{ksPRgiY5)C$>DA-+*E-`8_#X~~9-
z<VGkE3Qq~JOfkAlK4m=Ad*VD{CUY3GAJ1#kHh$!d)y!0Jzb0$+zV<<)y7$2W;?e&*
z>b|Cg?z#_B7YQbQ8*X<bt7z=Cj`G=-p8$%@ItG^X<NQ{4y~!OClUFq-c0AnTKd<1?
zw$?+K)zEjlb<WpwKl#NvHU7e~YEJhuX!;`@#v7z;3}|+o2ljGELPq7DU;fDg++EY1
zxJ#Us?0BQvk3G29<TEY9H;2=RBa|}kBO;kj`L2YFh9&!Phdo2N`G-wAyAU&0f9e}w
z1>37VlzCsNN~s&?n>$V+)#2&(XlyrlwqnvDxdVv3a`phQ89TO;e$Ubc^(XmMeHs0}
z;{yt=vhtq)0&7B5T{-@PO0^u@BBvu9tvvJGI%l<9+XZEbSOo_T9ru)lFaw7w)!fW)
z(<mWl?L4ww5R44}7+jz@G>|k^|03k;>GlM}oOcyxE=po5v!{TAwkhJ@<8GX8er;!0
z_V;oCeX?`5i`}xo%JX7@wGT)6LxgBUl20U|Iuq+n-be9xmKy8y&1y+<FPQDLt+qOG
z8`PD?gk|@XI$2DH^tkMJHQpFb`dAXOTe&Px(L+RLaJV&L_)1snc<Xr6(SeJo3&<R!
zH%N=O1W@|&S7b?-LvuS?dCAQlE_IytLeRM)aIFw;B>F-TM<I3}@tGq>k$(XCV$@yo
z8^l*devkGUg->Z#vD{OSyAeh3ov@$n3aRqQm<1<T)I(fBsh`Kqq$a@SW>}eVq0B*!
zjt*Ydcr+>0Ol~c?T;HMmoAqI7lIGfO0X>>jk<jhh^gKh*yp8mA7<mas5@ugzU~!5O
zGHC{--6C@U^Yor_lQ}Fsq03X156WRFbdz8TZnTT_!6|_KkVltn%_IL_=Y_b+qwU*r
zS)j!9W*m*)IDUA{JhE#>@&jyQ$&hZ?&Zx%|TY9PUt>}ZEuKzb0_riy+7vG@uBTo8G
ze}4A)+13R|KHVPMTmN3MrWfBh{gTWJDsea6VG*S@_vL)E+*>Bl<O9<Koz5*j*Q9b1
z`79#dmSb{7aCD{X{nx;7)kw5vcp;^Oyppv%0Y7$%NTVd$yAecrifJj$u!@1$f@!jT
zI4fdu+HwPqb8B<b7p@MM?Ee1WY^q-T_%6+rl1Rk3I9(T)Xebx&K00ps&(5}!!L2%x
zp=iV^KA};`n2)cKP^`}__f<3Yy|McbCzq;*mS`Rc03h{$%7*-}o-D)vw^Jr#>Tc>t
zA|fWp#PMHtS+R<Z{GtK|Z)*RDn7{uZyMnan3s9BcSSLY)Y&;_bg7E;j(unCwlxquU
z_`~{cAz5@d{ukg6#o?nfLv&i${Uqlp=PTc9PKo^I^=E1=09hTLD9|4m-ZS%J#;s^0
zfL9IJ2B`+Ada1^VIxHjBsXsxgDakW`l9n+l@71<q4Tu6L{p(&AoWaFF!6Lz14mm@L
zH^EuE%{XeDpVUX{^U*K<D&|O-$8ep<PClW5s41sfQEteIveVRFoXx}^r-v%}TDLhW
zr(8#v_7vlup8`!!zVx7+(PX61;Nsp$ns2UECM+t(>&bPPj#hb;*g%pfog3LpFV|6h
zq@1Ry1v?J6ToISjK$Ee%d}k0$cB1MGvx2TNRvUmdLY*++_X~qUYpC3X8HVpO4l+4H
zJ-~p5ki*D(7zXcS4pIptT0u!^APc4A<fh|hs<yhZKV(v0wr~Hdj(t|@X{w&7pkz&#
zWr`tNwpNp!Az6MxSbZ<@tROS>`vg3(2v-jY_!Cqy3>{s1I{Iz?X?KJFupB${dkAXj
ziJ3krGa^t^$HGTD=QuJEVJd0f{->?R8Pt<*2G#}zqS#%}NY3~#NK@}D2JAu)O(tEm
zf=?I7P()v!X#kW+U|8qE3rL1*3xx;)_KV;i4ojBs;z9JJ3HZYno7|eA%0-MK-6U2v
z3LpBl%Wk!zMj;h~WtqEAuyVWEw=%@Feaf0V^!Jm`>)fyK&>_!VQ3ip<g&o39(FN}^
z;en9ZSm>Cyn6lZLI0f?U<9yb85E{N=L0GI>L0K$@VkUfW*|s>iVreXgVruM7tT(bJ
zWTOQz3$)_2Sg4w?kXN+cw0}vvgcY7xGqH^2sK(q5L2b5zI=*eT=>;j;Q2q@yJ{EY$
z`ofOl)@Hx(RzHbD)E3D1C|=$>_<w8$ZYE)=+JCk&<^R-k_kXe(n3?~_XNpuCd+cG%
z(Ohm#HS5W6<b${&e~#L!Y;<yxAS7<W(nZORBWLp6>@OjLh=Z~Iq4>Zm0SJ^0rM#pT
z6e&uZjf^Dc1tyu$7GsQwreopKMZ>eu9@t&3;=xkayhXbtp)+5**BQqI%6pR5-`&Pa
zACH&yQ`_CHw@7`&c{wb*{N$$c<PHmFb?rA}E9mEWwwe|v7h-kpwvF*+S)J>H3$q%&
z!DU*V>ywJyO2C>In!IisXX@)nM4t!AfF?Bz<?5y==b8mbCZr_gvi85HLr)(zP&Q2?
zrGK8a+Beu)|2Ev3w6p1!KX0q{ly0RWx>h=NC|!=ygOODrKX*gn8mPY_TUEGL)#_Bs
zuYCL|t#}ScPVQ0h=r~XtDTz@fpUD%QjT8DuY@d%1imVF%GtB35AW?jh8Y?r<aHmn6
zQzH|*OeVKNUQz)?Ys#y}Fk#Z}Sv6a^N>(w-P;0tKPHl{QELp2pqwXEW$4j_TYj}cM
zVxV^UW?AfA&^xM9hTDt9okO1s115_gQ$2ECFU4@g(wE7lid|_!_7;W4PG?7*E0v%&
z?;_ce^Fn?OpeZ?#m`y+~35q3?Fo}=n`}U<+lurWtI11q#^)PDFbwJ>|HG}VVH%drF
zdd`rX)DpSrX1BY2EstBPQrhX})@a*n!c8jO*eFVCl@x`zTgSUt--#~}z3)!pGWsIh
zX_54lbpqx}C&l2^WA^D!YGWqbd-PsoX>KTy-f|Md#^&Ix--rdvX<URD`Yr*wO3@Z$
z>#jG>WJ7$m-sDo5hNkuCJ;>S(Y=jg;T8dfbku_^&1Q;kf{ZKU2t6(}@)mW3CFV0`O
zp6a-^Hegclflx4!RCx{#GoP+Hrz6}nIjC#26tI60@}$@g6+Kf&h;y!)k(#M&*b8(*
zwLRkSk1rJAx?#_|?NIFH-QJTI_tSWE1riL6e$**S$aI&W&_b+b;mSpUtNy}C!kr8R
z&7940P`tM`4+NaK#kxB-Av#d5)<zFHi4iU&vFNit<k(O`r)^0YgjfM`7AU&Nx?qtX
zX|qa0O@piZ*qo%3e#D@_!)$dr7!C<jT$t%}EoQ@e%GE;LN(RdB1uBdFPgX7o6f<U}
zd2>MOCfY96tLLc5SvW12_3X3U*F_aoqwBI~;qx12Sb8C*ts8L^-aSFu%kn!W@l{MV
ziz7>8V^&kR@z_i`K~}&-QM8a>j}>5a$V=b|Y)6sNSVwo7X@I#^WceY2!J?ayB@A*3
zi;-+}6e^)U#xv+l!vjyc6e3V(2xpkCExeC}Q68qB7B!(;uBIHC%W%F&VW!)U45g2A
z*tSW>d3dk|Jr!d!iE6(NE}Ow(-&aCkj}4#;(alT|i+d`e(I}@fgK*fAMB1jco9v@}
zpDC<4EldYFfC(Ku9qpCi4t4QhFabP@?Znqiai16Hv{fI&PCj{iIA7nvY^FMo)6O7x
z+msXn8*>LUm|Yi`ren@`8fz<|n56ipZPJ(a;gWUZ(!pRtB16JEE!hZCPXJJI^aliw
zbREr}h+<y}8`go@`8%IUD4+ocZLmMt14Bb7v=5D4OR!r~+K=!!QLuRJkK4oco^2?>
zWil;#WLTdQPMCfmGI1RPea{Pp1rAf_@a|GVD9W&2A&doQ4zyy<vJ*Z3u~j2;<|oIc
z4Wzy3wU~upEx-*HKGVR#NXH7nk$xNmW~>??%i@k0Y%fES6e-Ih7ACjiq--y>G#*Qm
zo*>e}stl3kKgD(=<_J3vLE`|Z-K*lc6*eq;<n(eZ=O{CK8=$rrG-R@df#0^Ymz8VG
zs++c;B;F{+>3U`Hz;H)OLNtilD>gbLCi_5L82R#sAJmb9C!EM(n3AsBb6!#u29g#J
z54~*X87yZk^c$?QD8)7k*gVbl#W)e~Vh|CWUEI}CaLhnA9+<;0s}oTK*-nc)hBnyA
zJQr{WqrnU>pNn&%f!0*CW!)jfAk<BWx3#1k9MA?L+&d{m@lHo=9~%@`eY@~)l@{AL
z>h|c^(jlQ9?O2-NXBtL7CS}dZ?Im%W?Y<3^ibwE%jc|>o2Vb99ieJH=dN8H*+~srg
zJjq~TL*L{ZEwH>3yhL;PZ3s~>i}%ojaW_uuta`^^d3a<WdolvYeW#NO1*dU@>){55
zzqdQxvl4FFQ@g+3S&Y4uNSJU2No|_EWqeth1L<wFNPIpUNGNJ<iqRJzNpMcGH$Lyq
zh}`&a7Tc^B&TpehG;7u>KTkY9KZmLj$WD!o4uNv{&h1PVVjQ7&t8PAPD4pAo??pIR
zaYIRMx2zJ~0!3A_C)M_4om40z)etCWQdO7WJu^h|kD5C4H|1%_N-KK^;hOS?nLb|J
z8pxG2q>Oa{KZL@Ga5YS2mk&mYzd&Gp4)L<MBFL4tDwJ&A>mxIJpgxmxeXm~mO3I|x
z!LD8Uqpa~n<{Dh04h8oWu`(xhK}1ws7`UsGZ&XB}r*^mw>zSmY5ysS=X(oB@lf1Mu
z-H38|t-&lU+s$A2M#EYtF|`1MLfg0$QDBpjK(S$N`47|7xa4niPec1oi4SRvWK+yW
zlv0eAQW!inr23cNr5?B`MRRHJp(%RZnc2yLo;t1{?4BB=AxjxuDtOj;oRwZ2m(2<J
z@m@zBo57MLiXZY4sL9K&al5&){8IEMvsL1&{H+)1_jUjGEv01DqFk!;;6lLsi^j!y
zB-Ob`fEM=~7`?3BcvWC^eN9=HKDat#z9PN#PfykIeY+ZDla#YcZYiiNFuD<%Gru#A
zC%!YcGxL+&nc5i$OW+PfH-IPV6YOlE(~bqA0WJ8B6sR?K=sYrR>)rgkmJfd10jw6l
zEdUN&wI4sQZDzh2ig{Z#YzsR8EprowsFI4yV+BdYUkHuSeB3*nzN0#XJCMB8L887u
zzik{Y05@PZCk+@5sI@^uNCS+z)InCiZ$CgdX+SRka875S7C?+pQ$H6!TAUhC8er?a
zI-EJ6wIRddKG0)g0sPQpKVQI`y*bb~?!3@Jsy=-HQn*#Xzu;@5`<{K5e$_Z?z<+`4
zIh}!L0G;8i0A>Mb;H&^+0a@TK0n7o!IjX?30E#%R0dT-DaM*x&1VRR3{a^?t{Q+$O
zk2s$I*nq9!y8V{@DB&^zqya$TG65a@Mh&5jZh-w}4XO8X{fI*O`t$*XaasU>05DGK
zaPP1MVg{rA)B(Xct^m3q*7$|LDZtFbMvuqZ2{^=N7sXJHF%KTGkVlYD1K&6)f$sV6
z!no%pLF+<Z-H{E7m>t+Gy7qX|DK^X~f{pUe44>Z(;+~nCK!>ZD`w3bj1>vUW98p3=
z<92*wHn@?$s=}53eO*n}D>W_buAOVfwc^Tb>5`gs8}(8j($7bwKInymV^<1Tkp7HE
z5|c13L@{qwWbednKZYY26K)Dkw!r6>!E{Z+QOg%(lQX`;h;HPzOpslmbPc#MRrO4h
zolm?X$u@Oc1XU}{ZM5_ZTt0ujLg^m7$$wq%e$sc<(j2-`_FTt2HgoMwFoUNEylR{v
ze93dn;w{QD%T>lR%vI0%SMzMPHaH=D6**ybg?QY0rFblV#dvIYB|YJF<!~(gV#?Z|
zqmbHATV}PUzFd7}^@ra}X}Z3)QuHOsGl;iZuHLQ;zRrAUbe(<Ke7*4k`bzs^@{030
z^=k7X^NRao^Q!8D?z85@?uGZ6=<{z?^z=|l<Eb(BTKk&r6?nbZI&^*O+WQ**dhpuj
zm3Y0|daUuU0sVrQJM7L|S_iUo-~(c{(h@x7591DG#0P$aevzrY1@=$ExK+aV%iDtc
z!^KZWO3P@XjdW`{zCsp;n59sJUI^|5<V$&K1BJGswxmx|e#w8G$fOI&+tGvu06;?j
z-=#hNf8>h(bB6sd!Jg#<X@DZS;;TMe^!e=Uh9MU$DB9Hqf&wohB8)U30XGJC5R3>U
zA{ij5fJ2X>AOLq8S$IFB%>#faDm&)Wc-hfeb6L?@<K=mKadGk6t<KAwjG){5`xn3W
zLS6Utw!7lB!i<T{_jls2?4q0`@8Cj6pK*#S<Q2sJ;vpH2Ag8?2j53IPXcGaCu>9=8
zqSI4TVopwJDf-#DD6(FGRA*W6HsLkMn(*Df;&o~HT7;{@*4mAY`8zD$YxaE?ZER>e
zgf2-1Vc3<BrpSE&)H3G$94U5%#b`nsD3<s)9Ke?~8Jm`%ro?>Iyyyj2&qp5AD~9~U
zjI)9YaLB)g1N7y`tuk+_65OCWB~$vDcbRdn9VmaLWxIssdx_ms_g=}m#IKv<?!b|E
z;4Llh0Q*A;--y4$_lS{ytOrI3X(PoFL46@D7cB-B_i9OgqW4VwdKdRxm0$QROn#g8
zkl#@DnEhsj??AmF?@*gJ<qF?YA%DT%xQeEO?aDrX0lcjS+*p3lkbkg+GPKI#Zz)f`
z{P1O@fe%^hL?o!|osSlv($o;DlHy#`O$`($N&NguzVCp$TV$wF7HaCOCtPJFVJ(-{
zs33jLT+;IBHNGiI`89z1upm|l>fnGc?d!k-SwX5GG=%%PfU1c5xuB{H4RB#s?CW9x
zFE#37fG^$a<N&Nd7HpzHtWY!x`>}vm!VRK9t#C9B`?(;i68kd%Rwxa!p;jynvf)-l
z>Sh3}kTlE#STX+{P0RpVSvSZAR>RUz?w10m2CkB+EAdYTU2(1}Fvx~pfvIcgp8%vr
zui~jQ3t)w=@~(sGqXMafs9HCe2E62{I|*>%(?IugA=E(kcVX0c?CSujGOD8kwc^u&
z?xO;<BGicN(}Gc>)JXMr;na}sqXMqPse-CY32*_`NH$RQSA|_+s;dFHq^e5^bYazC
ztg8XM)T*lizVxiK{lD0I>!7%zr)>}!JV1cp?(QBe5L^Q!c!1yp8=S!zAUFgVd~gkr
zFu2PkxVr?KU;{xC++oS@d+Xb`-mTi&zjwFlsWVUaIj85&y>-vMQ+>J{#R<bm9PCYE
z#0@vWnEwcK#oQ-@&4)IUReM{m;?DcS#6la1s<kXvG3O60S5fD4Emtw-S1ni3=Q}M|
zvF7hBWl-krU`?Toq}48#AWIjleR&ui+WrR^9qPU=j1Jui%P1-Q9AKmaK7V1P6Mp{8
zXaamrV<ZLlr>iFK@h7Uz==q5;?+UvJJr^<xfcs-q2U&LFlKq?uhM8mS<HObfRhZQ#
zFoMu`SOzji_?DvJIe>w%5wB$<cn;G*%81scKosDXZD6koMV)vqt@4)%e)M_HmKLy2
zZh22!-Q06SYUCDv?gR@)pLc`%V^yz*o%0!WW9`ep9#H0QErU?zqb%=<s^yYxgCpV=
zsMK^q*sd}W{D2VFD{A;UjzgdEBg<6;LLWSVEz5odMreR*upgBEx`AtOx)`qr;mv?`
zqPq-40GR%{0#z8pBn}!t9{d8$B$)9D3@~g3K*NOsL72v?D*o9h2F=Ng(0PjrIXDV9
z3=ob@z$^i^6o5YmW5eHonXwaDBw{To;8TDfIEjoB=?Dq%CXO}(h5Re8Ps&8`Y!t77
zOmHKxJK#ynB#~u_2ImBn6GN4OFX4({VQe-csG2|)f(OhAuqT1O{;VvJ#*oVp&X8(J
zB~J$T0&~Dy0m9gII3Cy@I49V4#G_1u>>LanEF4UkS^`lBX>cn5Nn-X2$Ou;gkduru
zw?q_VBJ{x506c7UY%*dVCL_%^>Oe~PHb4V=7<(9p3p<_IO#Y498>Kf|uy}+zxC%R+
z#7yfsbIT`$33wm-8+%KbB?deJAWl@xVx$DiM%aN(vFD#xvl^)Yx#9j`d;m3$7}1I{
zPzp{9@FiYR0*b?B0GGroDnL0nIv@w9>A5rOqB4TWnceR*f)N~rL&xX`K?tJ7$|xj}
zNX!3afj_N?B+{?{^1wX-QaE|+eqjhDa0WKV1NI@?zm*Vf4mSKJb*jHQR&kJn?*slV
zg0F7hRiuY9eSSkLFC&jG&n!<OFO1rXc*8AEEiZ+7=+B5NqwpT^wCc(K)c`kR2P^#*
ziwMRqTz|FOOko_c7B=}uq0skrH~TLc?EA3kOU5%)+hEo2^o(ch>T=-8e9n6cg^<Ft
znlfYcy>*5&U+jByg~y0V_UAV*6!PVFJ+XsO3;7w(NFyFF3PWD+I$;N)7e2n)HN_6X
zDtuJf4ZyxfX~JwmF~yQX@p*pm0)`LMf}uL&9XwwYTO?TITl`{qi7NHX#{za6wn~41
zYDowPc)l1F79_D44yQx&0UQ)s(xYA^The1(2*8ps10)s)LW6h~2f~7+7uiE)&<>I<
zlh6W07Oi_^i4JNllh6a6^kG3lizGd=7zg@rS^R?;cpmlzrKJwqttN~;Jcw*jzekq(
zz_UjiJ%DR*&(c0L7w19*R^O9H;Pc|Z6P}0aBep1Mi3I0jU1-AW!*U6IP!}UD$-`u*
z4<s$~u`bMD6Ii!sFn+)-6O11-fNn7(^!>AoQp*Xf0MtcROMXBA(PA8&593w{#*Y<%
zvuJCX5&j<aLJwAh(oTH91*?LaV_u|LT3}pwz-ln1FfT+cE$}Y9EiDM2HWbvL+$zJ|
z&;nQ&t9s1wFUBm_(JrW93*b(I15>y;;RPm49NdX>u-wx{dmz=*MRL&I(?xv{(9=bJ
zaNE;Ge}L7q_LMve)(q~%cP2bIw3NfXcx@^7?1I@+4)?;^@(;?bJ1igNRt=VqcIybs
zN4+(M<)a6%FHVHtqb>4-?}-=Nd)DwT=wKF@0sM<Kp`C;WhVWqggL}(vf(vTPZX6%{
z#YRhdly-sxe;9R-E1(_czz$~G<BHLaf8Ya?>Nx_m;~j)sKB661fbYo`yU}i4U?KPy
zZaojYi+@7zrC{qAx0jaPSQqp?!Sn}&JrB<h<iPjrFgdi_3CoaY7ZyDa+>0UTw|^`j
z(GNnv_c)9B;Csr&{P25>#V3oTi;rlx>y}Rz#VsGP4&2}mPuXn1_cDuep~Yd$JyUR;
zP!a$;1`Rq52@T2s8ap5nKM_3<Pn%03s0Sx}h8!A<IK#3>kwAx20>(ceXb8qFfuBN2
zQ0+M+R6;#jBvitLpFxY^lmz2~2pYVns);m&<2Z<T6nhql;vP!;aSEU|z@A59vxky!
zTnzzzHVy!4qaxn|wb7AYKsK-^rbKFwBnfl~0mT@90UXCf(g3G>vT(IuN>Czfz{2=Y
z9$;BG2?o*(XcwA_uT3D)ir5MhCV?6ww!-yMv>7Fo5Tls(1QN(FVRGmxycGqC2XDoO
z#=*0&##s?B!aX@9PT|HV+Bgz;aAUx@6;K`C`V2Y(H%8N@l-NeR4Xu9x<?i_cD943<
z1g3|1vPu|+)zd($;4xvI_!0|XPg;qEa8Gmz?w(d6XikqY&Nvs)Aly?}qB*o46WWNV
zMn@U|=fmq!p$Q0QG^7~N6$?oKJOUv3fJc}}I^YooQWkiGg+v94h1X+1zapH`2hi=M
zBnZK$&m{=MPq8JEz^4=vQavCVD0>fx7+T%~qJrA@fXJZ8o+X^|Q$z>KcpRbwFwO_`
z39rY3X26&5#<>v(=*V|Kb98$-iJI_JObIuzKKfIFDXg9^=;d@!Odu895v`mON(MB6
zJEE7<LJ6K86MJY#28nJIWCo%GW4xvZL=CkFKcxl+<Bdxp?g*g1@M{@~KVhd>z%?u+
zI#3pXOhVk@K$Ci|g(c|2PsxD~xZ~?R*HRLXD9C(7Ali62A`o*Ni3mg;&p-rXjCc23
zi%UFN#FuzPMVbP;(2?DUK*DiC#76`!&>M)3z=Ug|E}$#`$a@-l@WY(K_e1x=Ik>L$
zz#oVUjAr_ldpIr1(JLTUSO7&!RJaty3L`?fhZgsU2tkK)q>CUxzjOdbg$F!q82|^+
zv<!p?ptUgf(Bd3%09C@JFjq+6w0K7nz$ZO%3wyW}>WY4k4C%^Dj|}Zf3?dKphy^$S
z@D*yY50k=JsfWv8t%v~2!8ru3m@QcdZFF(Gl|6(qT!wsw5@8pfgYL@L0z!-fe92m_
z5oDpJ*seq^_3&KuqbDWCWgw6r<x&C2k9KJVM1}?6wDcj&agPFl<e{c$M+!jluy%?S
zJs>~&r3Wx0)D+WIvV|1EhjEGf^x*r7)=afxi!jGIdWYb{y8H;VMwp`?H6qNhj?NKl
zC`Y(JH^3zu&=A~?yE2DZdv?T&_=f7s+p^!&NxE{5a7FQDZprEC#D8*FbfT|F!8`F*
z+Top8D*^CM!j)Ti5X#CJ!WGq*yJflOyl0i*C>$XRIQoH*MLQ}+$YLH50O_$Vae(=N
zOHN=u<|QRCALCLI=nKA;Zs8BTWoqFMYsXtzMI51C+5#`Zx4130Jwc=^3q7lZNBf8_
z)T124e5fhj5h`%M=POn->eJ&pr^f}e8Dqr&xZLA{)r`KP4Q%g`!9L>exo2&03%lix
zw_0h2-;0)Zqh@R{UD5*g`1*s$&2SS|E_+HR2ZQKW2sxfU?~5n(gvv^_G8shJP0Y>p
zvbsuIDl1FW?ee8{9l}OC92H1(3tRU{x8Ke6ZO_%mW$<w0+=V`p{48i-)gUL&;OFN4
z!jmh<ALQ<CdwlmhWjM6VQNHjzi)u`3BwvbOhQGN$fVcT`oqk1W$I5pHSKXbCvpvUa
zh$Hscc%~?Sw+&~ryfIrsp_i_sC{F06^#^l#Z(GM}rr~-4H~$^bDiz@ea~~0M>hY1G
zAqc2xGX5atW60aY$!e&Bynm6Cp~Dx@UZmsFDwTR4d}4G0nw6iCXZ%JW>1WA-tOC0C
z=MOZ#@|W(Hq$ca&Qr1(AxC}33asH%2<mq%7*^8a>Qcw2#T9Q$<{C6+LCPp(eax-MZ
z>#z``f>KgB5n-z2c%VJUNJss85Jk9+zEG+s!4LCP$x~chPh4cKB0oV!!nWOK0V4<W
zH-kxJ+7m-O@nsWn+M7jZuGrf6>!dFf>pj#G8PeP(wYT3aX)y8YUSn^CS!|W6+!N7q
z4j8@3%%bN-fM_E%^~YCM&i1ZBtso@~h?J&-{OGn_;*MQeS?L5vW>)(6*fW*G4+d|w
z5fp`49DP|Y4bs^K(U%IVH(Qp!fRtJ(9Y7FI>E_QzrywvtDR7^;1yu;+ts2|%4^;zP
zTW{fLT?MJp31tjr&-xu(J4HOCtqobp%>I-#?990&v{$ezlf7LsIW03UgGgx}w+N*9
z*T|TS-!yjfPKbj|c;MF7!^6*my*5!5Qlq16Z3nXR*#SWW!_q!&YV!|IT&DTp3M**v
z@n(+{ONp9S3S__As`}NS$Z3)Z@obyC8G+t)930i>ayX9UWRZ`ZJ4*eaA0BNzEjwOh
zyT&Ig+qSnoc{L7^bO_R&#oX3RpUKJL8@u6=lzCCSGWKHromss-9xqSnQMhE3eQNR-
zz9<noE#;kth9c*q0Itgf%B(@W9KALR7b?EPco0aKlRq5mbF!oqR|0=3uNZSSDeqaM
zcI%Aa#j00UpE5LAWn#vb8Km@Jl~5<IW~@8c+L3M}b|kVl<!37Fmlwl1Uc4H6Qs25f
zdZ1|nO6jIy;}AAAG3N8t)bpYm0tH8cM<r*3Pg@5y*YJh5t+M;-Ul%U7joFt8h}RC|
zZfv*lHYhY1j=m!`>Ba5SRO@p#K#$F8Rg#1VvgZl%at%r9BoYaqoZOSX6kq$>P_%NU
zkPkWC#2@+c{y9DI^14V!O^d*qk+!*Vvh!n+pZwa8a4ZWxdHs>Ct3faop^JHk2dW;=
zB~oJ}4KKEgEr-W0Xn5tWqex+0)Ql?M<kw0TR8UUa27Hh4z=FHo|CXr{sb4=yudl0Z
z7i{u@j=xe#?>$Hw+1J%G(g?xl^CXk8U^|zs;^56$f6s@bSR*9GD<y2`QLi|kCz=x>
zB>CAm7=7DaFs}SPW8Yn%WOS(>^w5pnaBwd_%JhS)!A{4X<5Kl+b;+#LBC`th6nAsR
zDMiY;lxL%Z6KQ32@j1EaJJf&D%;a3j42LpwyAM3_7-Ofvdn^{b7WU+7f@~J-JiAnD
zRi!-Q$9F|%CG~CT*T)tE!ZmTt$;|Jk&YcPL_#jVN|E00!xC~)rb$)~5Cy;s}&#Coe
z|IQfG(c$qNF7{eIGP@>&W9Rx4Tw{|l^x@%&Ue-*D=nlP|u?~EWtgbrOV>}gMNYlb#
z6KKn+^{~Z!{#d#UX=`tvvRqzmY8%#p#@ChC8gF;?d$osm=v`BCc}XvJj-UDzw4qva
z{<q7h>Wj+;hqkwOhruyfplhCWqKx}A-*V?Xd%p~4S#g<mj&O^$vHh`$%#57$AFY>z
zs8$_4yleXl8wD{!N7hAm&nT~<n%9@N7<j_<C2{_*5;26g-iiy0uKIlDJ?2^2$19;~
z7BUsSL$RTj>N{xolC{+0JMp7Z(w+G{LaZUfaM1*n>rM8g&r=FDu20m$CHjG%agq%l
zpV#P`)v-wP#95tDHb<)%ogUMy)6i}I>T7=5+B42VI=JI|MQMCYd*jZ=7+`18b+Ci8
zBu5^cvc7Gzvo(bOo70ZYp7C`=`SyOV^3}7X&$AHPw5Bs2akk4JNI%Qghs1h)b<oM`
zX-8DSZ0>LJMOHnZHRqM!BFbaGOQj=8aknyh^Uhwy?H%{>cE3jC4&!;Nv64f!$9hcr
z%<AYXS6v?;FRF=;goLd8;yI-mr6T%uwHf6RdRBPBeG`SO{FEyLsSr1d?Xau#Ybt6&
zp}6=f-Kk(#8QFt{tcff~C6AGSaFtI%rMH;ZY&s;uMIdKh(a|V~yPj~ej4{kWEQj~p
z<5g2?eBW;yIgn?G5&uAGKLvgrKyTtubeQa9>cb#I!B9=n)u>&!=JyXxy(2G*+95lu
zTn%BF?=shyDGRm62{viJ9QsJ&bYBzfNLm<E=HAg=%DJ|2^VJd%)S)KN@~S>!5aO_#
zKrEi;jvYRv1dL7a{6&X12e!gE^0The_$Q9Zua@<+tCK7|yD=Q=8rT0W+eG{|_4%on
zn9sSUd$Lj6^T*EzV>fm4;p+YTD^xlPKb?n8o>xWPu=UM3K2PGl2L`7x&72?M0r`#y
zUL9`@`awbR;ew0TY^A2yrz(=YuE!(!HmuUn<TD~25z6+*rzlW6^|=t9(!G?T?!VyA
z-wtY|2@fcB1dKa+9@s{9Mqc-=mu}6R5Yl1M%?X|2O`n!9-lZbnLzc(RgTMda98UP-
z`4rlJx-ez0iQE73sbD$?yZ*Fp2KU}!1MkR7JKIaw!sA%+%|+TI=Cu`n?e}iKh!Yp-
zKkLEh!TS~?^FhcP{7Y>;X!YaZ#%@sSRkOkj@^9Ncf#K}*a0)jbHy=Ozxiip5X}ie%
z>77A?Yv3IpcMTseH|0Rh?#kPDwbdTMLk+R&&sL$=q*qOW#zPIPeH4ti@d=01C)XP3
zyc|P(yaN@)>LXul+`UhflpR_7ZP4raxx4E8R_cCFvu;jvamUq+^L?%C-}wrjR@&~H
z8{w)w8C)CIOwZDY9U)Ih6&JAAF8uJ0$2inV&7D$g&G3uSoA=U>9z0K(_1CrzB1zNc
z()zYHxyblvn;Tl{DoZ?QGP2lCZ9P}oyyrHif2Vv;*`8C>o<P-nZ_s8Vug03LVGM(1
zeyi-it7)p&NY8jnH$rY2EZTN;b3MnVSs>|o4`L;q^W*#N%fYW66N!OSSlwVo6q`|u
zP%rd*xJxOWHK>GCZLJd7ouyHVL{v`yp2q!H_=wSY?!ej~(eEuEmQpKl9M4>ku{RXI
zvF%k=_KZo8E#w)6(K!ux5{=vpF=6u^kRKTV6X0ZF*Hp0j&f%3KFuckhPr1tG%=%I<
zkDM(JWMEK4E?KC^9wXbXRbfir;+qCZvl<$VPL``h3Ev~d1G=9TVx+fMA55nVKh=rN
zuuL4W%hm6I*pdk3)u~t6LCk{QDY52VeoDNWQdZe$!%vLXn=Y>_sVvDpe3nzyZ->sT
zJpHScCLv!V=ZzcMO`Uw4dS!9kFgKUR^wY~=Mg~uE_%B>tv+J|Az&#=8ger7m!qllH
zM2nA?|7#vogD!Kh9WB-SkEGsZ&iqkHyWSy%b=LktbNfvSeIGtJUV|M=761MviXuC?
zteB2<f4ieeVvhVn)aCYlV2D@8fL_3AtMFW_M`lI-n~-`sgh%0fm8w27|E`i@^^20-
z-L)5Lm+iQW$cH4M&W<tuEQ{KT4v|l>10Jk+M)xa5ax~@!w(iEp?yO@h%`MODJ^hxF
z6x&*6g)&lyiq#CW_#{t-x_DlRrg^u!4v4;)-wY<fhgIK-l9T>+_jPNd*KIvA+;(`h
z{Y@+V^TQI2$#2`=E;5+Aww)o`p))*ETXi&tT|B|Xi66Q2`4-hi-ze2<njg*twrWs;
zlHvlk%6QzX6>m8-%r%Nj)2=hVDZXvKUASt8(zI#u#I3^yox7yer0qzDe-1m+`qtOw
z4frnk-l4EpaSTX4HqxVw$ZpGP`SfB5N>V;fzB<i7q8Ni;2VV~|7CQ^ly&EP-i`MHJ
z|1<xgYrW944AX9xH>Ob`OHUuNb922E9Nffjf9+vVM#F#+;_)_cmDz<v$L)lXSNt{E
z#K`4WpLu6v{*3&aG+GbLl-Frl?uRFW7W2iPVWSs+OoyByPQlmXaxZQ%e}(Wc8>%!X
z+1%;c*=syNlC173A3E!|ctC%X!y$DvuQu}D@kyMgJ~w7K9*VMYsytZZ)R*1-EUbzA
zHCT?;EfR9|JY=-k%yBX%?xQ5b^<Ef_^GP_GWZG2}Ag1{N3oz8&kZ_d}a=3q~>U-s(
z=mF`4g*@_^YM4)s+#I+2eYuU7mV61K=Sy4LbTz9iTb60tVsmHZyPdEhsUO}j{B^AG
zAllOHutz-4pKl6bj>_x^Jja_NttioL)jD^|CFh0IpSekHS8s?z>z=>2zxhNzmZ0Ca
zknRzBLLhVueT_HDssD}Ew)nU{_h6#i>MX-3?;z$Iu`PjC=Fik-uez`+{P%bGtK+PB
zaT_C2zyAma&h2#Xj0j0q^eP!EK*Yt5F$Oi16P17RiZbx0-r38B3={RaCEP{kshFy@
zR1f5S773@jl&|9jk+Za4{PD5T_o~^H8!HJK<<nS0_OgO9m={EK(soi?nvccjdaX8Y
zsX~_1e0hRpSM#pCQ^lybG|WnR*RL};j(r2eQvBHYb?)#J{wUu)#BJD2<45!4wJiR9
z@@vmV%gsb8-(~R$+t{|Xd~Q8aP@wWZ`L2+*_x32@*<;anH}s@a50n@UK)1;T8k|4+
zHtRssoaU<i(Q6u=(x}j_x{lezU|7(?0HPB3CA;Wqyk8|ivhJ$ZTuf2L-&oQ3XQ03(
z{oW*R+_ZP|fx=q$?J|DIEV=Jm47c}^;ob8;mys!Qf#dZfDVH=4K7u(5>J>ch==(L!
z4=dk&N4&f@+lxCQB!^btu_k=`v&k1Pr<WGFk?(YCDjA~3MXudUXj2lRE4Os&%l;_b
z(HqeBwItp9R)oJx%g*L%^RHZ=2DXQr=P*R)4{-vEI8S$SFCWdLGoK)ut>LjJ1Y?uU
zBgKjB80UQv*edOpqV{)z`(JDcQV%gudgra1I1TsIl2FQyhzdoYvV2idD*l`+iN1!H
zn`^uel0tNn!~WM4uN+j)(sQr8UiHVV%B`kr(VpORNMoMeyaNoqYQ~dqjk#z^>I=6q
zt|4z!pf;Lc7FWD8Xbb69)RqBB?gW7S5@zdM^XsNK3ohftBn!>uYEm1#9)T*_b<5i|
z4H)OC#aE~f*?(q){9N>`SLKY$B`ek`iX>UO=zIOkH^uV^Kb+jLK5$CDWpLZP3SBbn
zWTnzj(Hgj~zpdSTV6|=9e3)BdX|R4A$jWX9u5`DC_^yP!`5MBM>D!Voaa7I{yc2xX
zVv(64ag=dnn0U)SeA|56I{As#zW{1t_AW*G?aLjr)4+lIpDQ~p>n)G&D{gyxQXjXw
zci0B**Y4qhh9w`hD_>1@ESa5ltBjC%>v>myreeS*F3DU<1XY2Gt=H_<5-T5)O$piO
zdWJHeA`i7Ivv7_6svMmIA9h}{&j~f-XlZ)ry_Wd<R%#9&exs9HOY6yNAZ$PB;GwnB
zmUwG?NjbaxT7mlfl>d3Ha^-#|c_#S-eWg|=B9lCeT<Xi0ULOKSP+1l-v)-X3$lomO
zrCpaA679S)yn2J1y-|lN^UDYJMt;F{{zkcP(Rm^pxN?xCNW5gD%bZzM?cY7K@@HO|
zlQ*83QjSKTK3L>pAM9kKj+p)Y?<_nKR0GP-dfBU%P(ncZGud<c#M8YwON6J>YAFT7
zsLP+?{mh^VdqK9gfPNBCFUhO>`+FPW=3ycM+H;_HF_LLI@jKn7e(Vk_AFsb#x0Rz>
z>v~t}%lKy-yR*L(q{iqybS2-n;a7d5XeuaaE2*n)=wOkI`hdsHJ^bl9L;gql-!VUa
zyP;vCpEz=-uAg|eKbW0c5BSU+8L<S;7HVm7_fPR;#-wQ=t!-_aIPu~#-s(Di8Ibrg
zP)5hzuu1qe&s4A-Vwc%eV)CU@_v>cvEQtfFOR2ZucQf_|qNw=^&aYhD-}1UC2Fz2O
z!zz=!^i)a{`}=|&N=G+_Sq<&^_z%rL#9Pbi+~upXiKmOv&#b#TGE}$+O|wMQk2Cei
z=;bTuq~a(iC{U>AZ1&^uN{D&R8>xE;OAhftVjy)T5Tz8sbUuPzClBlEHI#h4{vuxY
z?DQNs>*<N{C{#4ZX)+CN#O`hO+mEgwg!4H>9L;WH(Sg$!)oz0cC8Zg~HHkYEB}&|<
z`G*_}VFTm&qFe98T{>~F<f_hXy2q@}v9*v!Oh5P}f*vC19~;u7b4+;Q)2!b~BsU#3
zdn(OBc*=OrLO5hC%@W@E;t_@Z><<O8%H?N&*Ql++_vI~<(ew+qG#&=N0W`C`+Yma4
ziWhURY%}BsC^kfh@CIJy&-P?-%cpt9?+snwSg#~aO4Q$ics>2QP2bp%3$cykN+LOL
z(_u+KN?~f2g!8`FG{LZSlXke+29~pG-nWFSsh`pLRo*Y(mS3@dWDbTlK`IvX65H)I
zUeKN;$seEA6D0u|K^{+&>X$c1SCF64>xtxeb7G1;-sGi*pL~8cL?XnJG=K`iFQADJ
zugiMzsOro{Ai(+XVNs8#N0TO;m$gKk1l~~!4SxDAaSlhk;ny{#P``vL_l4+u?}RIP
zaSokU<vX+IdK1lz=RmxnRF^k&PQ2S^PYQf_P`2nsd0m0@z;7EA`A3nd!>f<I6W>tT
z*!$!f6;1}JAjmmL%a>dBxfhR_R1o{O%)yvX6ZG4cr(UEWrwgPZn5BTBO^4VJGEow&
zrx!L{t>dJEbdQIKtzW_%6G>0k5@$%boJbDXCZnCBeOb)LGLfZy`MPZNFd}P%o`0-&
zX<Czphj;s}qpy@+*%eYvLsIkQs!odbrL~Q!%xjZj)akuof3E-<+OghNqLiq9lza+a
z+eiH2daF>vSb31TbWsLFV^MXrLjR53Z#C`TLtjV)w6hmRvVe5T7pFV-vyREJ&kC4U
z3F9F_6t?spb|vCO!86OX$!kwXlz{%lD`|!?jau`%6H2qU`pXRY`3G}n%9yvDoL+F|
zNvet}9gZ#MyW5m%8Wv7B)jE?)bZe`kPC9my4sSVKJ)e-_BcF<rmEbzyiJ4j!neE1u
z$C~uO%Ikpy6&yNtKQKZKT#lW`=9i9;1m^+*aLgGORsM3podCBu=Inmq2rV!b*aVCY
z@CKX%@Bs+`Ex;In7w{F}0yqTF0&)TW!^H`&!3lo-*A(oF9jx+~5B>*djrj^4ehZ*~
z9;o_P1uRDtsQA|&oP_hB@YfLBO>~!wpa=Xvc8$McehzpkAIhNmS;6voCg7DNQ3SR#
zT2v3KD(mj+=WM$glSu{tH%{?TZ6Tlt90<0?PGprxMEHS8u$7<3vrs4rWLrLi#{jHx
z`ibJ%C1RfZML2-+=TP-0@5dg11ZSKfQxV7pw*l8b<>rQJ0SV-(;BUcR;Adb>up_`2
zFoRPBKoXBK46+R}4zdn1XQ~OrG2|D77JM#<wiJWYfKRb^h@m<_RCpwSoXAX5APGSX
zwgPM5?2zy<a4;IF!lEq&<vHQDfD95IMh<2U_6i0gbs&a3t30W^C|n54jq{DkNE;|B
zACI5{JK=m|ZplMnf=L15#4C!h6iZV0M{o{~E2GhCSR%pzd=8+-79)0MYDqx&ptTW(
zN#PtZwd5e^zyUZ%%q{r{RPY$U6uXJonfWhv6N$7cQt7!u;K|KC<9mlMg_hX#=RL{s
zL-8-hRozD;+30|;<slJ;%-LVcCBBrG<?Up~Y2BCtNKR=^h5WTit^54An5WcaWW0;4
z&0YBl4eg_egZp+fZ6VY<(1J-v35kkO>va9sn4<oxF9xawG-y4)fFdWwOv-Vv;)pSC
zi1N5Je-#C`s1kjmVEGg)YX#foCLmFXVPt&%!PzHtm;J^%i@8tmJF!aKX7BL^Ku`h7
zqu0l21*YIrj@4yi=`Rq`ghp@Dv-iiPp6N&MVp?@#KS-fH<}xKV>cCMG34Z11T-3<o
z|B!coDgS)+k(zs4k&xnLTr>$Xnp3)}p1CW6?|q42h+{ZT`Sg||8@alDZ^eh`%zmXZ
zTAj?kKusjgjcbxb2K|JRQZ!9Cou`u6xwZ<iAYLN_t`d>V1Y>~?t75IjHXmcFqJy;p
z64<=$Uuwif7ANEmg6WyDaVdSN=qYDaW^JUdn9U%lE_wM*<bb=i#uoK^m0!hN{D|b^
z$KN|tadg%d8tz|P2vl40*4JLS-Gi8=itI4N^*xI<4a$HXsgs}LvfoLsXV0zpjqw)k
z*cm%~9kuvzzA)6>JZ#fh-5qA(vPI|Qnpz_^wB=(}wL?H>F_ufA8J*ppnVQ{hyBgpS
zA$zzo+IeywRQGT%1PWDYF(z=pt7@@phcv}zyPOP>{M0Slk>`}=;+AE>I)~BpFiU3-
zv@~ba@<{Ww2cV&o=$@AF+(RlrpVX>B*(1{IBhqmOY#)7ux)>UC9Soh{&+6|&QO$Og
zmM-F6x2c(Jv-ZD_Z>PKz=o$?=(AqAl0nW=7CSYr^m`<_BW*fRh+@po{EyTyH94P({
z8dRid;dxo2;-fmd)|)W@&E^B?viaf1LRwmSNfWxH+_ea9rNc2YYQ$&tX+>MPK*g%+
z&OQYr>&uIe@43F46gM00@6CN3GQ8ie>dI_KC2kF}{Z_Fm(PFPguHow8Uln3n_b|Cu
zCd6|5lIf!x^0LwQ?AMmIZUDKd^5N>;h55Yap-j<*tnpE>SpH8eRl>%ctQKBp(neF`
z#r~!@`^UG3@q{OFQMP?i68l8`DwOorHcnMR(1flFoN@n@GK*Ugr>_^Bl3n%!-!p#G
z2<Xnr=1jjXH*#VZKkJ~u%r4~q=sVQLA8XQ7Ytr=Xr_9P7cilh+Xl(XqTl}^q#&A2r
zVzc@_zJ`R(2<~TX#d6Oci!OdH@{*@E)?IXSEWTObTj37jpvz{@%kj3fevoCS1WbO%
zb!$aS<U4w^usfFPW*A*dIQROH@Jk>$d3#R%(XR)>m67lFby>GpGW)-K?D~1*O(~mM
z?IyA85s?JB@bGv-_f*1>2V+kxqyNB1Kz2Mb@3VDKN`0PHVD>Sk@){$7^uXY4Zy1u&
z!g9+6(W9|4$+z^}={L$BbgYY$I76D?+N64OTN`}Z#R;3v@qW{0FqWw=bLW@#n2T?1
zX$>zYU1q=HvW?Q$8(yY5wQCzMKj{5VYHemAcc9m8F0*K!3zu{v95VJ*9sj!Oc{h(`
zxxcUPzw<M*ow3p06~$AWKyP_vwsY)rMSE^@P1~~Hu&=<{(4ey3fU=%%O$m~2ye+Bz
zh|qH$oyXZu?#+OK-V>S=k{3K_Yo5Y9VqcmMdJ_uQ>CV>v2QuSVir>HMvB$QtAHMcM
zw3U|@ElU4>Lf$61)Dp_?McMy?AI?H;PKEX9KLlhECD>FR=+1UB{l184GgMl2Dst_v
zU`D>_W(ox|%d9HG^q%U7czGk9Z`L6DOu9e0^D@`W-I!7?2)h>4&bw_r{1$hgcY%7h
zj~Q1-`Om+W*)M!>RW^8a-x=Sby8p-ChIiI&=XrHr<C_VS3VYt!da~cfc<0rT{^mL7
zgd?ahs^9dbk#8O;P7S-mGc;tXiu0Q1{LP`~9TNK>_j%#l^U+|LdW-JVr3(9t{j7U`
zyY9TDn*T<ThxK_uUNSXf{|t5n%%2`D^|afg*NlG3p)eFWaeb0((f_35SBGL6yh5K@
zg@w5@Yr#H{1mu2N_RGU>KBX>e58HFKY@^OR!u$_?)uuy&Z|WEByvRdE_Z*)v=F?$^
z0F`u>D*FQL9hv{<A%{g}yqaIh=H$Xh-1tctX&66Y#S0$0SJZiQi^9$HJF?c5jroV>
z)KO#V4wkGUFk&hr9Q^7COaldU?!vIkp-+a3EL48^&X(^*V0=_Y<oMNb$~)c3*KTG?
zb5w?>qtwQz3C%3&Zrw3O?g^klD#tC-sX^|d<ae`!Tpw*7=LYef_{?CXqs^R1-A5{8
z(S+)3<+o$Wb?iNPN1jASa$ag;uG-HyqFI}sNjCs$QkBiw6FRi1K)E8aiefVyK}MU*
zLLi9!9R<nUpm}xjg4!m@-G<slZ9>NzDo~-wiGt%+<n$n3=`m=C+^Iadac1zRqfMts
zojH{;e?o@@706wr&V<UCH=+8ovVkfIe<GVXjh47BmR6NtwN?jTwh`~Y*6+PYEn2n_
zs#bL<o53p*?t&Q7$zHy~n7PT`j}BJ9b24w()`GMBZXGvN3u7*G+17lsGl$sL_H+Dd
z+%~kzVlHpk*uKW7Ir%FjL}lkmi_m@a=hH<K|5cV7PQVKn5fe<%(zGU_29cyL_1cID
zW@%~Kk<2Xiiip*Ei$6&<B;I4<Cj?U+V5=&-A?s81sZr(ij_kOV(P1|`<(!4dX(!p<
z5b>JF+R~Md4+V9KIa!BxcI{b9u69j1OS}J&b!}(YmG!!D=XQ(37<H^V)Q(^-+ZcbW
z`jeg5ww=Li;i|%{xyjLw4t5#Kqr(n%wj!t6>!VUZ!qmY36Hy<=Xg-OaDzA^8i3{J4
zX$A_DtdI7J3m=a;cmHpx{=NzJ9|%nFcC<G9-C6styz<?q8Ft+SvvB#q?E2w{%Lii9
z%w96K+DJ9$|3-glbw(z%L`ph;ATZ7RLAC>n6p#GZHiwhh)kS7Ge_%7s9Qq&hzYSh;
z`p|EZSxaVD9r=_+Ro~^qnn`9e+0NHUt;R@@lkJ*G)>9pl(RtG=l$l}ft~B2I^Z7jO
z!ZgD`?$o(qkwzh{ubTSYGqe8}>TL6`qvpzht?C@!8|%#$J0G?3+Q6ARbzyj`Q3&)^
z(|mt32A}pv)qHuyO==XKfJxSf!A@NoZ*5wuv#rKIY$p_?ExFkGm}adS*fl@Vph(H(
zfgE@4ndKWQ`$Ht3Y1X!wU2DSE`h-?j>wV`Zn0|G&ba5hB?fJQ=z3f--V(sK&{d@U|
z8=<;r22ty;_s=#9p8s#^V!-)vnM!$aUZcD^Moet^zp&GhAn9hU@AAK}skGjYx!ljv
zEI8z%=|(-X+~3<ISnHzcOs)U3zwAFSd#Xw7W*zQg&9$7>>%&%?tLAL4;nE#x<Yw_B
z)&V)UI$qr<>~!c1J3N5?1eG=mhaZkwN(nEHv#pFvHwh;lj#^8dE<VxvrKZ#0uJ)TQ
z|Apb7S#>^T)w!Hb_WzTzRpkzS{Ab!{X&llhY<#F`AeA~dezEXRvOUx^meQa952bYu
zqSZ9RB3Xd<dc)4W{{}C@<Glq8X-D5-EgNGA&;OUChjlswhkC(Wyaj}5M>Vm8|49Pu
zw4-WRp3_hCFWQl%-Ag)sTCah`*R)<(r*rT?ZvhKhXDixK6Ri4qc(u2H6Roo=?dW@~
z98)aM1vqz0c<a99{L9Qn0=uu_#{Xzmqqg1GRO5Y{u9r(0UUgI6LcY19+U(2v?529`
zp0h*gvqSSULz><~`njWT*@fqxXdS+{kkr3H^)o{UUMKzYLq0P@&%A`tbEPk}^8(l>
zI#ZErL-j{nGS&ac>7kA3-j=cNNubo_OwpbR{Me3Nr#+5+rH|xj<BQMn+jhUo_Z=l|
zi<)hVul^wu%vV+rH&zlCvulOhwrJGmC+ICm`(9Ipd}gXIM~|FjYWp~pZVT1BcH2vk
z{{5&Tc})S|PI27zu2uW4mFcdPY+Gj1KgHLAxU5|(wl+Un?^;qXLGGt&tn%|0@_Bdv
zV9tzXjKs<Uhf5#+12wH@YpZI>0XdEasr@9Sww#tGf#$63k!JFQn_b*#?==mU`LG+A
z#}O$y+lh~8^13F$@C*h&8i=G#VRns!jqVm_J#|hts_URfz3p`Q$U}*Q-h#lxIH-tw
zRb`c6WoAE5s5KW7Q}ke$K_4Y#b$Wg)Q2gPmgAqHG>zw35_F(fAzLe6BQ!f+~Mk=@7
z$^@rvqd?~ld}^0K6#KcBxnG*qt1YQ(2SwsFAJWRw7GKYp;Qi8`@**d5Xv<JI8ar#i
zuM%@1*CPCV{8KAwYNT9o=ILZpPMz_P`kD74=g-uKd*OlMKb%F}NXF>W9fIEw4E-G#
ze=F9_va#vB7H93SmW1E10v&X2O^a)+9)PANz$K(`UhtakCD>m%v)S{R<ekh>hs@Q@
zOgMn#8#*{lVEdLu#9|94*++)YzlsxAzxY~pb45w5xUW3b7DMOOykYk}`8!$l&l>?a
zNzu6@u6Z7bdnxPWS$?b4@|aouA=y+@y0oO$H<x0E<p^fCc40wm$;u|)qOsJ3=q8nl
zD}rlThF0eQ?S{j%^XZGCKwDPa=%!9t<RN#U`A@@`i#d1;*RnWEL#4-5aJNGUiubIx
zOjEH7mvDc4d1`OJX;9vY#fw9J-AEY)N4~}TR_n&y7GtlKl((6?M&zm@NyfCzzpMvn
zgMDdzlf4KD3pUOD??cz^2gIareWm#Zeo?<2h&%q+Ua>p!5G`ds)lMBw1462UO<}K)
zCR452UTa)07fy{{ibszpob36$V=g*%%~~mrr>~OxEU=`l<K;@8+toPJJ^(X9k^ppk
zop6Qo$ba`r`NoW|7I`M^21+iSR2@(2RTVjv?wV}-u6f5<RN~>ss4O?i7EEfn9cljV
z>1Npb$<x+!_0`Aa6u)$z(W38tk{5OA`c!Js{+AL(?l1e1t_D+$QU%x|58r}{_TTYM
zooDa<<Znwk)&4mKp9`LcoBD~%v?$Y<aT9zihMu3i6DoU-B_0#rJf!oprc7s6pI~iV
z;Tgsv$C?o%SBqKnwY+<vr9_ftHU%r2d$YZ}_@;y}9XTDpkP_8H4%a8^Y~G@mLqE_R
znaCfNKqf!*Y=)+IO5>z;Sv*>O#O8Unj{4&o<e@)YlEemLr|uwZLM`u|HFO3{Fs#Vb
zF^Zmh_Q%mw=Z77YVVjQi-Z3TDAgzM)qBq)~-Ko&WB8wH7p$QX`nLAdifuod3-?;GY
zGrrh+#&9&5gxY$5pu&Lj48|QM<yxM^cl;ZIw!eghEt5zo!<de^hfj-qzR)Bj{e*^{
z@9JM2UqP#c<rd}U#<psa%)?V;MIy8TOc%I+>BrcUG_?B!8LUUSPYTF)TL%?=7)X|L
zW6nKb2Q)PL-z?}%=TBjCOgt8Yo1DGrc*ic7P15Kp@n*NSaWJ~`vHFEm!F-Q_y3$0}
z8Jt1n@rt%=eO8o=-m-23N_E&D+{|`OngPFW`4i3p`u;DIB0iRr)Q{en3Fd*u2b!Xn
z9Wzs8cQzz!@0X02G6v-G8f9{ML+xH$4+QI4_d23_CW%#$pF}?`6&#72xdGV&nuF%`
zAhJDKl|>H*VO6qF-nuS4<K;8EYzFG#f%zFV{_4}cuJQ62ho!uMG8QAN07#=J=$Y>P
zfJm>`dRt7CmpSKjWsFnytyc&w19`<Sv~QxT7REyHT$Z;CWTlvcMT1OrQ$ltpqb2h~
zizl{Yd!wd>bmyiM3a)A@EZa=&7&hlI=TdoxbPHL0-2r;LHRFz%hFck2TOvv8NZ5N%
zCkKrz8myA*?2%1Lbs5qtvn2L}l0o}c^erqBpHBh3e$QU0X-G(QMh9H_VuaX9lg~Ra
zHs?%KvA(CDXp)kJJJRiIBnqT1d_K@WBJk)`lXZx+9dcv6zQ`S*8n$!dJNw!&nV;&+
z8hf~fXnB()t!^w8cgg4~%Ag`|ovA@qlXPiMeXcPmxjmBQzPA+COW{XK3L}k264~4`
zb8peU8BaDi_DkP%t~VeSsuc-8lv{rK^NjQ|!B}x^avRI)VvRR!FsVQe@Pe-g4Ks81
zJwJ~~QOFD|C3loz^xqzqu~&1MvIN9>SSaD-l+8XGP<-3@^6<1dbJ3)%+tdE0iT_Y2
z=Q36^FQm{a=h**Lz^$X(KE-9Qi)Fp_LDhi}%DMH><HRW;%K%E3<;}U=RIp%HJN)Z#
z?red#NfO}FmKk%A^Jh7Ps#|Tdbw_~gMvUPy@tDbRuH`1YB+W1GgmdQecB${!9IFP%
zIoV^NEKALlx`zCQ2YDm2HQ<tb`Mn{c(H^i(Q~VGwv?V?kNZWgP2#%l~ZvD0PZ6M!s
z$-g2}Bt&r~<qxNAm9BdpjT?h(j&#U{KFQ0J)(&cbO`P<D<#z)cyhKn!t74DLodLea
z?w1JWXp+Fro7$MnqLJM#9@dvJwT44KBy&Uk=mMC&#XWfO{i$ZD(p8VCcqyVjWgAaS
zB8<g4UrV|fyaQxmy4>|zJGYHc*tZtD$Pf1*QsIakEsB3*r5+)ax|z<AWGgm5rq2YS
zP~m9!SdT78mixImCfQ9@kzFa+3*1VRJGvF*;mSXy7GIo7ar;ZeygsU*y_W762eb-(
zy-5N=_A$S>5Nsf1D~8;e7ef|x6gdT1)rbC&m5v^JkG%ZF(HC+=S-N{n!K!TVHT9EK
zry@r!9g+I8)>uv=b)uwfuL@-j!HZv!qn%WRy~IT7@x1)QG#5|DH)<Kr49Q$~5}RP4
zEbJ9fV8n|)e;VSi$N_q|VdWjdW=&7A+?~W$GTcn15Izlw)3I9JNHt=TjX96ju~H8t
zK6TQzpAXg!B;F)@FbpJ?Vv&uxK2|$W*+|VK&hJ&FR}T~#Nz$<j4kZ4O%X~p{tfm?B
zpLy0*3HR|=EF;ZvuQyX$Y>~B}>XuUQf~XH=WMepw)#5i(7n6F~YZU{DZ-=f}=9&L#
zahyzbl-X<ZiE?`hVzjMRK2Gei%xiclaC7!o2@dT)CTd%)7Nr{fJB^ocKl;VC30Wm}
z!KW)pOPt#qEc7yl^|!7U@u~0V;*%LcxtH)RaBZlK@r_7pdBs#rcTt-Xd#&r#(-CT0
zRVPrGsvmrQvd{c9?TiX(qRfsFv&)hmt!?$7O{<~EUTa>I`g9%GA7WYYrfvD3%*Ak?
zzAJwE*}1)$IY<A?3{5UDF6_$LUzxqDb0|od!F21G`>98neZk6$_zrrT5>inRhvI1+
z^ZfE>)Ukkj3kA=oXzUD1w#1#Y%&>^YiRos0r)^d;+;r^d0@dWF*v+`q2>5FD%JZu+
z0@6fP(r>%WH?hG?JebiBR-Y*<yu3;z)M=7;KekAGa_iD2Yb4bCmF|lx-~9W`jCI)7
zEk~s``<8@{Qr+nE?+570sKu;I`tr*}yb-x{ilJi4k;spKY(Ef(40T+5({I@zxK2Ra
z?(W}-a+kuCW?j>0Wm&p&?_LD`xH1ydrWv4(j}ae_+~w!jCKB~68;(pKTBmKzR?8dm
z%pU3E+u(O57dFIe(WG?SUKrv(t4X$K>}EbDefWBUcfEYizvVd~niQR#v6ZozA0ML9
zwPUP%T3L~1SgwB^urzlvGP1mTJKsnc`!i}UXAXK!kx|r5LK%L{k(BqRtNc2oDS05g
z<4th0f1~F7u_bco!N(e*Mu@k4d2}!5(UR6ZZ&YuX4l=WoRSLmEJSv6W2|uHxw_xn{
z)VA3A7W6ZzNhM~gZhG~s9AETu_)z-+{(WC_`-R$!cHUDk`vj7qdB?UkI*vbGQwGVO
z?8Fkny=B3&a`gB<g63DaUdsA$T_4~&iqT9yar5mpIev}%{9chAVFt8srn)n$Yk5M)
z7ucuKIyGWDBR&kOCK08+>)!nwf>E3Qpx67zom|Q}be_jN^5;~X0krfo>z4O(?g~qH
z__%n7m27u+e11)u{xTDLn}*mK;652ca)SH5+y6_eMpuXuw4cyk<Lg>N?RSh5_k;%T
z>jBQj9Etk325m~S)#ReoN(pzewqs((JG#2J5^}lw>*0B&SJ83Xmk-;`7EW}}MRT?X
zrN5lhp2-ALX614odZksoAIUXm!jt{;$cd|g9HetAksGLZ&;L<8+T=RzQuyke=0+p(
zC+UX&Qi~aHeII@zi1t10CCN+jVC%@|SPQ{Sj{^JtH$SSWcM0qLuaAizk@~w>iV%AK
zz5Kg(+28xpNDYT9bhW>v$OWt{>j+#vkhCu9iQaRHs;AAJ-O5d!V6cvC*W7Sfseic>
z-C_>8$pA%?Rd@Mw67)d%Lkx@^2JVySPZKsCuM9t@{`lP8<vOh+c}jBMcIx~wJLEg`
zWIHMADHx1Bp%yWDB%E!`7*h1ogfEBM=-sqaS1ZRFOt-_!QSBP7F!yRxE_-EPr{cA@
z(w%)c&4I1<Nz_6DE9-V#CHdwLa0)AHNinlBqBo@IYyQp9{?da(meVZ$z5}9&K0hN+
z{Y$!BGJVQ3Rg6*yg!gNg$t1tU3_rs9*VZ4FOL@-2>B?BvkxC6avYEf=8r<m@ccQx;
z8vNW@I^7|1n;{Pejdzs0=4|u#mrZ`3_<YO@?##P&>pB`L+qhhBS3}UK$BJ>CHc)EG
zvXmPZh!U@}a7!)xis;Xjg}-T5rL$#f%em$~kd%I{w9PQ+3lXg}Jj`3VColW<t&$HO
zgQ3pFP4cK4_O$;^xYohjO6mL$D|K2Mq=dC%l&Dj4Z<5AbJ}7;dEf#5EZe%Q-pFTfr
z`>tYcQ-wy|pytl@%nmZu>ku-o>cHUdlf5Ov)u8WB86t9%y84EM^Da)aVdgEwkeAsy
zcXoNPEZu+{^7hiseKkjzd+O?2i3N;m)l|6C<-6IRU82W;3V7Yd@W@mqm&P})()SqN
zDsncFcA^L6do2DpY(sEz);Ndg9&Wro`X%(*pFOXa$1*>aTv`}(y_m~4mhHAey$)?@
zyqLzlzr^`;sn-E3s_3Zn(gh8n{dB1euJ&p3X%JIvH=5}cZ~?084m)d=j82JY=|~c8
zx5fs_4wG}7L~>Y^43Za1>m>8bw;Cn$D}lP0_+PauCX*L+s3wyan^g{G6b803J@slP
zkLZ4TvsKDrQ8<{!VaVwrIy~~?S{+iOx3$e-@pVuTQlq=&q}!#PT%&T0sbn5@k`Nn6
zGR#d1A|0+Gy|#n6>28T~)V$mB=2)*B+}B+z7^K!+D;aDq3~Xmw4?D??4J04-<vx+&
zSg#tqEDY>sk_$btQ(6O`7$~iMsw*E{)(w7>Os{bLK`9uptwMS&2=V1O+2oKb9Mmbg
zgD}Y@oCwF>@eEIJo@hhz4Y$bO1nVYSD1b7U{wRZzn7ZRn%$0&Mwu55txQ1&uPl6#9
zhFjuqg7uS~-h6wvh0d|S=^-<WAG;Fmk;)`qyizpym7|%{Lu!~db|uCmgNa`8nmqPS
z1G28SWl?z7#PmqDz0PssrW>r191?ZX9(xx6S=Zl^E4b@o3JE=lioH{TJeCa77v9+`
zJy2|SbDUV{KIAYx(r$-voXF`uC??A(T?;Ec&}{R+xYmGl>urS;-nl6~P;I-txR&Dx
zsTy1_yt7bxpxdTTsVj60$1fawIgF}APy{U+#2hYTLLW|Nih9#Tx+K5!ZtE@NmcxT$
zyDN5uaQh)v8f7~yRvLTz$BSzq1dIFRIfOY@`o%W$i)&R#lAg^Od;e6dG|jg4i)$lD
zlK$4FuB?2rN`bUqvPz+}N%BBJU=dT25(vtaq;k!oBulxC6B~#-T+Vgk$dUhTkVIGZ
zbuxQlU>TE+@->fA9{6M_HjrT0F;<#%+e>Num85=hc_FlPa7H(g>!g)q;?0&b#PfwD
z`L?uDUd#!P(zr_Nt7JS~gS$>a>TSu`_=oj3cimzCfBXNjGZ6Ez{`Ri>|E(>E?;+=d
z-Kp?(kh<rXw6^`t9*^9ZIG)G{vJ+3Dha8u2wLzq#{7r6PAi*?Yo2P#=NU$s_=X6wK
z<9<&U5=SaYy{$p|bkAJJO5<%~#F~YA#4wQ;c1)V}-t&lQNOq3u@QY^vO?Jw+gM%aU
z`9y0F4MI!i>TJXBVxf^9jZ8CF8Js82AT@8dX#OqF(vXbX&Gw&v#COUUt~T4|b!tve
zYc6M~9Rj~ACmLpoGp$9m<~x*;^?J=zWQZK6l<Ckln&JV-p`u=K>BN#w`DD;Ie!VS?
z*KBq+yL9*-I*^p7{_CU**Rf;z)m4*9i<i<N?em2BKNdaKS53Mlr5c#Oy!C6I4`~()
z%|p|pX)&c1v7e1;Z~URXGNcS6c27x<4VP6zcdwgQfmWWAmph{ODIT)8e-bm+oUZH5
zGU<}gXgAWF8t#?+>5*Lam5A~uX0qeA?>Ape5Zy-df#qX@V{@;8KgDyJuTtfdXO165
z#^^--YkXQJCtGC`iV%tTS_o?hcXcu;_|!HMVVvCc6Wtt$#)j32$W-+MlS|7I)9qnI
zeVE@g2Lf4E*6}WqBC!1A#fj;5F~(H=K9j#l{`<ikv8?J>L4L(Woah&(!}N=}v&Vwz
z*OU5(s$UDapE$AXJYEMa4m}d1jp-Lj$14pM>F;>6O5d$JdiIn5#+X~Wu}D9SpuovL
zz{rb<&^bnvV)~`u*%O}p*U{Y4lO^!~py@rsn&`f-;Ryjk@6xMCQ+n^9(i9LCL3-~U
zlwJ}#NEZYY1Ox#Uk=_(ZsM4$Sme2$N2|cvT%l-R5?{&?GlT68+HG7|Z*3O*0zB4r|
z(G~0v$!c~u2S+w!U}vpt9B(O4l3Os5mIp^x+{C;T^U=Jeyhv`rNvi!*{lP8ePV&K|
zn2}?G7rYpDvBxx|e?lVjb>v6L9W*<neyW?@vREM+PL5#;i8SQJXj<7=+-m(zo}3($
z6BKEG6LVY4N8^^oE)i8yOiplQTL#w13Y8j@6B?PNBfqhwrqMASbS{^HJubj&-U^E@
z2cbgdm@O__zsz!EeBW&YP=>!k<tKS&O2JZcpJ#zpQr~U?{x*ML(7CAIzoR2(iI#zh
zKpVfRa_?Ubb>+)xeT)W3Xl7+W#2x<A;PcyhoQFr-;=%nBRb6W=234pvQv>VdzQY2m
z<UaC(2vvTukPryJSa66ef2gtweP)hII2nJa%GFCftNo+>+?~UtjNI0Ztxk#Ay)9Zj
ztJ5P$ZYyR>l;6L=%VvBtkxSea+cljl9lRo?_fBR1xt^KwJ`aCo0gi)zw;+f-lggmp
zetbQVSTABLQBFK~fId{>?2UjGYR%I?IkwMRd7p$IdE8~Jx3u4-l6yH!pC=wXP46y#
zHcBsNcc5+1C4QDE@J0NrmtI%=tWMye_*s&GXwO<zL2h)Pnz96arhzhT_nM)BUiX@m
zL4IQ2p8|QJOfhBOoBY-xD?xf~2VGBc!*&xpCC;Yk!zIqr1n%XAttJBeT%mJ;xtBu|
zqxdRpy}{!dj4PLR$MeuRm|*Lk>z+o3bI_c52KH^iRHW&)a-{@a!J4Z~26n&T#O;=H
z_e6kp$D4viDZ1g)dI4SxfkEgkI?<zg&kUc8@<k@nk(2ssgHtGIRHaiLnea-D`4ckt
zN(UEakfhnc6lCUqD=ee@jdll9$lQt!&d%V6G+n_TS0=5FoS?ZKo#vSdr|V|OTuTNv
z%wQlPhAC(+OD8D1Tt7LcPI=dXeL>cMEv2usAi(2RSaLZ>Vn>L95=G{l0>;!BDV3BB
zq|*;4;y{;n)I{P>eJ=@xR)a`JoNQ1CnmuxF>fQDw#}|qwHsO-eF{g)0`&J@1>n-0E
zWW~SU;a}&~Y1Co-QO|qzJ3_Ulin85HX5U&wxNSNvk*j{c`GfxN*nrej%Q3j9R)B~q
zisyqfjg;2zSZaSZ+s8J``Lual^}<->&p98<q>Fg$in^UoVmz8}li%;La+%egGKZ#s
z9q3%XMBDOA1xLAi8~Wd5s<v%mK*xg09LW*DJND$Lv)~+a=%P3Jd}p%9CS&JGZ7Kco
zXwScUzv{Kwn(nhnoWrNt-%Ev*=WEQI)R(N;Tkk3vT)#DOx-ZQv6Otpll%w0^9$j6R
z88zSVdkk}?jNzCwjhOn}*P|tr!tvHac<I~SUE%;&fs{uf4FiuU8N$mqv!}G18X(^*
zG>@KnW-V#w6`xKX9NnFZJ-0RctZHIjrCpzL{$!5v%4OH~%B0dt?UDO$ZI_{QmtAOh
z@=4&8#;#O&E6LyMMM>v<E8^i%%;kkQC66B5{9<6c&HBl94Xk$k_6J<{*^zrEk57<#
zJi#`k-}YH^bhP(30p?64zo;N`+;d|$qTM#)F1J4N!~51cZCAgyfw_U_rF)}KXMSy@
zvHsM)UJUj8w<rbd#I<~oBbH3rKPP~dth`R#Hz%M+@b~;j%el8Dqdvc+UJz!I4tGQu
zR!7zay8gPQAM(}79vN%)in$^--q}T)Vnl;KsXp^~c5dsO-Lp2LAiHd2vTW;*d)*Ov
z^_1ntqK;aMcQY51`Q!PE*Pd~L&kN&OzjskT*lUNMzB@e|;MF7_y*K`Cxx93!`?LNK
zOP#qcT)l!MKU*@LpzK9}I}5cd)5HWSYtd|jZLWSH+>DVb;`}2T&Hc{#<x{MN-Y});
zOyv+s+M%?wkGQf|Q?~w|_F<@7n2%3WHvJwTBIY<aY$Rm&i`u+vSmHs_yW-<(>GOA`
zIc~P$i2+$waZc7B-hX-S>bx~+*4U<ZXS`}$bliT<@m$8NG@{ZtW!>&PWv=1;VdLw}
z`Yf(`{5#usr+FLDvKCX`SbR~bkZH2H_(gA3hWAcbMaxk6n&LB=CkGc1EwfRKcwERX
zQN|s9qOIVnY=Qa(`sjU@kwN~X+&5BXca@HbM3&`}BZ!)vTo+I7WF-YQ8LuH%7G@;_
z|ETV+wUlI}E6g0d4Xr=q$4rH+d}Jv7a7gXxBK{Xc@TERemUgZ;z@2HBMMge%=7EPt
z(Xyt>`Nzc=w=+v#fx`yJIX};D23Os4wmMg4B1KjAUzk=YoD+)}Eq^+m^zPIQ{}B)s
zkrPlH(G>7Hf?9MZwBhXB*z+wuz0qPh?x>`y!_&V4Uv!d=|8(*dpL_Be-+WSwk7+c3
zKdqQ7bev?@|MIq~^yPFXvHl%teeX3n=EV}a#ysltihm^VlrloA3DJKo>Ze$Olpnca
zzgcgTPRi{$SB|XRWQp;Yxw;{eKwd>H+WMgxt5vMGtG3ppM)#9ML_Cn;-*}GAYIkV8
zZs@nV=Na|W&2ya*G8RM49nwcMCBJsYHb6M#j{guU^0+&aBN570iH!8-O3ZWj>)dWC
z61eZ}7QUs%jrOK3KfBNJ`}w?z0wTVcE+FKJ@x;7d+x#-5*z5M2@$H79r6QJ)iZkZ-
zX8Vg&9=rQN?#1L6;u0J*qTM}D%N`rH|7@OcFDHT#cRG7bbIUu%%aRq|XI8LTu`?!f
z;%GGZ;o*fGFr1nGH<qpUkR|`%oYufrjA=}^Xy0v;_+q3}J9cED^3CpO*~k3s;+J+5
z(w{VWbuJi;HgeUcO5sqg*!?48+1u<lHBQ-Q`3xfN2fFf$tPxjICt}V7_eQn)8-}PR
zR->1Kmf4o-EML$O?b{w)&C#-#?TqzH-29*|tdSxRaQcUSepY|eN&4!vxooLZ=D5x2
zFPF>JF?9paIhU{d1<CY8p>HUdm;DWdHXR!@=pKnR#GWI4;+EZXkM?{#uhdSKpbuZU
zxnHRH4_}L6KnJg@*1R2t61>h}=S$Kd=F?68x<>I@f`$-sSDk_8;~<&fU3D5FA_j&V
zP(d=m;!g=WbZg+w7sk)JLjHT9%g5l<x$4y1)#F8#k*eX(U+PZ(ZEdx6^&G0r++u%C
zbgx!GL$vXpL-ij`{!mSax|Ew;ON_Pw&opMzZVo?6Vh=E7_)Sopo^8%BnI-6G8AxRM
zZ$Q||GLRLIk<Pw704L@BEqQ#XH$r-`nhL!dd^17p_FlGhf`Wb1?z-B9>gN!XEMdZo
znel&L_Nxppr`gwv2<(fM>5B<O*KP}IKC|a}@?KL@#MtDwQ>jMu+8j#Eo|JA%)lM#q
zTx`PC)7y{k7pLmQAI^TkN1FZlQsb{$-oMg(U2ey7sU{Fi#aKPkF1_3!z_V&prAT@I
z1Z<$|jStaWz3pyYmiE<`VC7kTgwHRda_c2KS55IJA)26(8eK1ia-1$tx^WPZZajl!
zkDnv)0hP%kQM?}fK$>$+KBejsXFuioc7Z#o%P6n<6~5s?cJK~aKvA5VSZxNSTlwsL
z4htC*VREMK^si{fOqPvxrCrPJI!XT)iqq<y6b~1r!mA@&qbpOqh;iA*$*ecpCC}{p
zcFdZE3eS8Mt9D3DeLk`<Ek=cl2!tJG_zY{egJWT9CWo|FFI4YIbGi1Y>Gv)d;LWlY
zqw1O^9)bMwS9ubJF2h+a?X{Y^jP#Yhqzl8Zk^;WQZKB)~l}xpLnYM*PYQ2h?w#7o~
zY>TPcg#Ot|b*am0Q#c-Wi8ty|{3=z8`YEbam)0e3@prYsL*l`m+x+gOT@009bIaZ^
zN!35JD>J^Y{B@G<MT2=auNj+!fx8&zq+%kG8Pk65l&<j9`71s%wVHcuf_k0_L1t`X
z1!Mo1M%)a$$>;299)><`{i4D*<yO(9=-FgawM)y^P+~`(_NuZqHz@Ntqxb$hJEba-
zfWwd#m58L7fxHCjpcnhJ-U6x{Kf5C$ns8aCOojV*SGc)^+R*l0w5q1;>l59++v9t^
zuat7ivyw+Odt}@rpPut&SGu+YISIagy{EjouxHTu&L5(=@<w3YKlthQt6RUm>@U3W
zue|GLIq=9`eS6MKc43#<YSQCXp)ZBO3Uh%I#5c7x=}=hr65|8M_rH5aqehDo5})5|
zyfs-PW!F^ti3FSAr52?T;8^390D>(hMol9Nw5)Yia@)5aiQ3#f`$MoXaNzmb&C>F1
z5AiLkxVodNSka)}d*$KqNyVJ^7Jt4ythugmU~M}yUs3hJ<Cn}wrjjo&Nm_R&yZrqH
z?@u?0Rqh;AJlF5>3PiSTZ9TW_JhFd&ct;+Gw=<1cxoDCXGXrIqb{FBIfy-A+aqkZI
zC>l!bRWA2ZrF@3uFXlr7cOO*NIC%iufsT>=zy7YqX!_srPoP%XaSnDwbUUWMNf-K>
zujly2(JP>Cu=DSO?st89Q^p(i;f|0g1E;zg9TdGo)KL2aH3LQ`u>m`eG~r>@oYI-V
zTIq`i*|x~uyctu|0?YI_Gkm6|<h{4eB20}2vSsQeYa6GYO^wYBoSS*is&9*Vj}iCr
z&$-M#%e$TDD&;`#neFj;D5J80=zwZhV%BP&Tghd9{ry~gZQaS+onnrx#rn?LA15h0
zrQrgh?&XeL!;aS91|nJ!>|J;I+gnrFd-4V_msAQ-O_}z=atf)`uUF3=D`cdlXX0EG
zVhz#_&!YWU;U>cmMfLUv1TlECT+!M~vwlb8th3jFv!(sye@r<GGEz$a+&r|`eD&em
zcL{4hq66#jz@<BZ+o`3i-R?Q5^$T9^+ESsr%vd#RCBI+`B|po$0GD4?mA_?zClwY3
zgH<ST-Xa`t@O7mn<8Z$Rr9tM3_=yiz-dmrJxP&>tF?mDqeQAjTTkknIFfNfss=#$o
z4N$h<D_gsnot{?n+E3z+7?-or8lADOsN?ZE*_6dMhuu->1(8DAtMwNi`C*CrSrxMu
zXJmO|)3#eP38nV**{LEXij8(#K~UXadDkubtst20uSdchKdN8u^o-YBe^3?X;IiAA
zNh@8Y7v?Cm+rrW5{^Aklu(sWjPcB_0$xijIe#zcBz7Ne#r8iNG=o$CDK0xfc)jht?
zmYw>-L~+=Ds~J(c8Ys*G#}X+1x#8cwy-Do-?E=T~y|8KG#i3USr>c&@>iy%^u$XT+
z7nMwd(YmwfkOZ}_zd$oZI;))2uVDN5{`i~H)%2e)6Xsm+HkFqA{P{8&Uns`m%6W~f
zdp1?usN>dV&^3-r!73?uZ()wRI&W?W6My#fmMKc@%$b^On+m}X)Jk6L<-DmlrOcMI
zZZMrcbAdW*k52}FKDjgyom`l<_;S1DmTLo^+z@A=JC2lzl>#GL&Ov|tfrS+O3}0FL
zNNh01itzbx%3wK@{X?-~x)4(1r(%8m+odKqeo|DF<~SZ7lYMQmN^F?8Q}^Te%U7h;
z`;-ayn#2%G+2>Uw8{3q#10nW}+TI<i(|L7!M~piHKlv^+y@xg}pD-N-?7UvGBH!ew
z_Y2XkEM78o|GHdS`TK`^#j(|#@z18l`+Ft3zhN#HN0D>W=iIxWR5g^!s3+T|<J|?0
zGv=z!e=1vY4e*{5T3HnK4*bmw3Jxc$`m#LYzG)aN63*)V)!<L(F-usMYSPH)p9Ak>
zZJf~6llCK`j!~vph&GM2$(&a)ZF&sjIY~Fq$)4z03-xb~B=(;l7H7BhoBa)`qXWmD
zGHG?jrHatCt4s?AokRy$MU1xW{0u97Gaq@exyaQyF{}A^9j~ZMplkBBLe}uTv&pv`
zsYA_&ihb~7p~<YJQHhUh+3>K^fpa3N0+Hk6!BM#y#dD{rXUqMHo8Hx;=dx4!%flg?
zN~UVzOl)O)4I84pYkbC!Cj80;e{C9D2A3M4RXNfIX(x{>dW@y+<rqG^RoU;iV8rVo
zVp+*9cK6Ej{p0T7{j5L><yz*eFHSny3v}Pl=N^EEa~VMnuj1UDH?4WSQR5N^BVUov
z($ATM)9`%cTk$3uYJ>fo%XW;ZH7Dn%Uz_mIZ*lY<=@G9|#^H|Cf6HfIUQy(IE_AFr
z9+*lN+-RCV_qeluHa>DS5NRF0jzYc-dlE6H_Dw<`j7V`scKAlTv^p@*9o}4r!y}~2
zt~Dct+SaRtYOJKhFTbYI+H@vAlkMy6<`nm<`>dtvo~v4>&C7>h|5Vi?S>M_BK_&c{
z^zXvi_?;P*=bpy?s%8TUSgK*|y_Zz2NiWd$`B1J?uIo8Od(W&z3Aec$gPj43ocM&`
z+pr`AZHk4|!Sip)Vg7z=CHT2$cdNfY6g?R%P70CYe_aJ{n3|W+ZF@a)j81m*XnyiO
zMf&emFh!?HVLos0alg(6zxFt0PwQZLd7A(0m$57vakFY;E!~~KJ5x)WHoFz=4mj&T
z|H@O#t0pV!<NAulnhKTbik~$V;nfx4H5Jid!1HO#*~#EO%iW{2oMZTzB4_6pw$s|U
zo}hpq5)dWD41eh|d`sOJd~x>pc|d@PpL3O}Ef_3uoxgZt@;i6n70aP1-|CZ{IRfJe
z6SrL|pYD96I?O}<7TD>ScOzVH!2arXIrq<-pqPG#y>Svv(L;l>QsKJBr=Q0&U0ZT$
ze(OE>WtJnu+xIj$JM{C8axlU09og>S`ls);@0=p{$FHm>D~`v*W8r!u`We@6R=*})
zljiVud$mtD;0SIJRCs=M@=tm0%j#t###U9M-{aIc5cK}1w}&kk>-=oQs^`hunj{YC
zlj@QltAGw%@4J7(+1qrwW9gN(pRC3t?`5oQkEGgT=ibm4J03Xx$$u%EMs;uLiTmuP
z-GNcX;(1<9VaZXR@#+iy6zHHhRn4<iaowin&JnsEQkd)Nji;Trgz_2dQUfHW6{q*<
zntaJJ5AX2*5$69xVA!)Kyk<`Y>Wkt_MZho9r>87O7s?+G8M0RfhO)${FQwS=d6t(0
zCiF6K{C^ekvsmhOHDWLdD@F*iap0?d;Bp#HkTLOBVw9jHR*V{ah^?XkS*bt~QGB2|
zUPc)=9Sc{%$;E)4SZ@lDkqWF7#a~sPwM=(j)<?q4ae*;#CR|`F+#nug6U9S?!5YrX
zy-2tkjyehy$5F?F%<*939efl274OzggnN`*NN!Q0-by^>@|EzU+#5%f@J`-3(7Ht&
zgko)%r{+};*dKz~&;kZPH6h{#70TQTabt?)ODJ=D9iR+D=>lJgZ76|l4#ch(qWmju
z@~L>#G-QSVl?Sv^qLhHvKfsO;RJcxSw7ru=l@QGfs1l(800zO$L4xKfvB^Y&e<3~;
zh&@0af*Jwx3DI&eG>07Okg@0^47CSXd|b&dJtrE#>N1`v!3~-xD6w%w&6sll&dGn}
z3OE4iTnGX{gB@Y%g=i91_oYTe0Sp91f<QM!5Tb4hvuR?piT7vJZ^oOhRS~K?0$-qy
z$q{pav=6Z44-IooDXNdBl_oAC1w;TBO4Ke;9|$bHfU?(WiH~)Xd<RBvAUJ^|NRb!-
zWk;xZA*zH?x2S>N0eB3MOl-prtU_{EfE|BmtGE6W0ct~OO2ig0NMJ(+ynvXXfz~}@
z+;4(~O$e6oT1&u$3iS}s0}28GRUhc314J<tD9Smkg4l2XRgh|0L?snUH76{y`qDiZ
zyWD>Lgv%}h>li@Jvdd7@UNEB*yw3!-P4N`$U})e}AQY=c2=Zdp$iP)9Fl~W<laE}y
z8;W+;8-1WR>Z&)Ypf?(<mwu>1#PtJG&;XoTa?zyg5x;aIBoLNKPjV#mtMft4a_s~{
zm0cnKPJvzm03_Fd^g@cb0Zk5s!2)0?f`W1arGOx%x&m+;@|Xp19y<QaW>ZWQGzu*e
z1&#q15_Nmv9WXi$!3|RSbP(uWe?_jY1SmqTVe<lx`~cNJ1>Jaa{Dd;@)c)pZ;Z|h3
zFrRq-XA}t|*}^tf4K0g!E`oYVjd;L}a-cv%C~Opo#i7vLU4Z>1i+c9DT4yv^!i*xI
zu#q6HW`LT+LB77k!7;K3eMU47HR6v1f=L`<#Ehz7zOG7cQv$`74glw-cqtVeG7{p^
z2?W>xKg1D>%%}@0@V*x`XqI5`0GLUGghfHvQ2>=KU~LO5%LCR|q$H!{E<!FFaUbjC
zAlN7I))|T$4Lg{38P5AsM~WGXwG#sy64JeV%=CAvXRA%jgtnX159XTY&5*gWo5!z^
zOa9yYOcO@<ttOc^J5yD+m2h*(^~oyv3cJ4N`CEa>h98fUwvfWx3f3B*_QGgC{K#Ck
zZz;Eqv{c$yIl5!WTe<d>+FtbEWrKMi{Jde_+Me-7_;l-?@q)kVeqX>afi?KaN<=I&
zxXQk4?{CZS<%@68K`yVTUo4Jf#qMNc;Ev<qxk$9t{+Ga16J$ywzoo&W?}J&>!F9io
zQhV30-bPmwZ!C`9IsbOk{@rfyslcDboUMzhq0k}|V?=YL$lIRD!vb(5m>T^-C{AYY
z@(g}>^D@5WdM#Bv(YF?=J=vD!i=`{MjlI1Sk?nWk7t0Ek;4<r&sL0D*R!nx|S0?jd
z_zCmVF=`!if%L`*J3OFxhI(ME>hsQsGT&B);E!n~ifBq6tK`nr+^a|=S{He@-HDjb
zoZ+aZJUZgUP8?-Sba-7y+10~Y{QXb1XCB_-(Yxdu6MnEm_t|!jN*D2uZ^+^rYTI*-
zRhg&Vi0I8GY*MFgn&@nE3V+cjTlzFakv+-?({(c-)^#-?y5nX5t8f`1s&LzmnylY#
z|2wDDp4SlF{(UaiM#YQJ8^h8br>qooCyg*~zoUJl^<Fhm6}v}w1(EsTyLQ>ufNCg`
zZzjWlDqy89$`ZHQ{w*xHn$4PJr@fH$WUY!gbYCv|=UJ+ab%gj#p*0B=jh0V!F9{Xx
zZ2O0sbgj?3qE|KB(S%PF<)8c}c|_L`b(%QU{@KpQ=N&Usn9d-{FvE+ex~^-<k9`fF
zwjdtdryzyq$6rZB>D;5!k|^69?R0%wW*9Am8e#hTcd@R%g1BUP_Ask_@;2c^qUU}2
z=sUG~SR+%3W@BSguh;%jd5%fw?OK1I3J?0Q`;F9Xd`d)t{i5xG>z3`OYX~%_f^75i
zM<o9;(+E!oCfg0xw%bS6f3!pWtg%Ix@<ApMEXp_G6r67aqL=%vqkpZvMf+Zrp-)4G
z&}kv7XoHXe^vL;cyJ5&Yx+>%p?HcZbl?yk)e#P5h1H&D$#chf~rpxa-jyQzgwMp?6
zA@g2;+0*YU<<jY^<TB_hDb(q6ug(h7lIBA`5$2o!lusw=Ru+>oC#0ZNk`<-(BkP{l
zudEKOKUp`mnzCMNEoVLLL1+0*CGE4B45*m|r>OE_td}G;#rn;?h0wv3a?Cy#wwlz|
zPKuc)7Ysg2jI9TQgWJjzX91Nj^!^MxgGwgae5VcOpPPsNChA%u1s;9waCm6s^zpaD
zXQ2jDt%n?pk6OAR@;k&P4wJ=oRn|#m(vTt{Km^hZMaTj#UjnJkkP}mc0w=HtG?OE&
zfCWmF3P9lpq<(+4y)F#4a9(PQXGp%@5<0ET$|BV()pPieb-{sOZpJOUoT;s}!-+4s
zqCgMaNHiFRQ`^9TQ=U-;jliKYkZl`P&_!6;MW~WQ8bU>XR15VPbOibj3a``XBE;9q
z5Hkr7k9MHZ4w%2bUJK6I1fLdyU8V#BF`(+DS`_#T3oc;b3*BlH2iE9z@D2`633{X9
z?D*wQ&^aDF6~&(kgRz{K@Mw?)XN>^4u*kuCpT{v^bP_yb06unnWf-mZ(Jn=AsPpO5
z8-|}*up@rBLZ5wVb9`DbHmzNa3cQCEBLmqm*8Lc;BnjSoV7=3hRKC1}LXus&qmcZU
z+lrTPzx^~bd|D_LdE;7IW0?Ujf>|cRdvf5_e&BwIfC9?6Wm0e$izLVYL@%@9uh{Vd
zmX|MtK|apQcobalQo94R!llK6x8gxDQGBd0Sju_H6$3uQU5B$-Y#|iX=D?R*TzXeu
z<^*G}J7<6bAK<ED)NXe@`?KAH{ElO)xhy<FBU$n8Xe1S$4TB`bd&^%M{J=3aT;_yg
z;cWOl6ljS<QiIfJ<T3`#OM;UQz++)xG!`VlTX%wNI5;`T#g2EjxYRYn8w6uPB78X-
zPK;+lgG%J<ep58gmY2Gw_&Zg5g#$J>bJDh2o|-)TrmVOAFdAOg3Faq(`q{{>_UjuK
zzg+#_%nfZlh=DJ4BU{(Odf0yxH*$~+TSWkV!6Iid@b+$G)H;|91JAME0H}raCIg+Y
z-n&?Eu^U;u4t|A!C)hpU|3F*BEdRp5$GVZP*TH-k2*GlZfFH12q~H@Q*B>l$ZN+-=
z0KOCrGT@eB;AbqH1TTeAo5q0gNpQ-6>#B`-atxB>|3DLq2Pde&0a3i1IbJLT3#Y}4
zwZkbdr`zEwmvYv-d(NVGe_=338HXeVo6sQD<#H?-ie3JLowm4izdj`t3o_sf+d=aG
z46PG;ZOnhJ&kzBPu1zckG{CA6fl^pCaxjSsj#*hAz0RYAgA2ICg{ZBTaACecGQ$=_
zQ^CORoz~xR%Wh{?`{+V0JQ12J?)ssU;+O((+oJd;Q+!nrRty5Z{(q2>fNoUq&TeGJ
zI`{<!&S9&dATidP5S&LZFJSgw?0egtRUM<@u*-QA5_+lBi6p-amA||a#p{cJ{?{|z
zI8f#PAw~?2QGtjgxYPjrCk!OT7LtG$Xtf*o3G`l2PP*FW%JRa&GP)hkdHJUkPJ3C1
z0O@c_OSjexeE0Wk&yXAKpearb2IioV#P}){Ji1eDvKv{xjvR{y8FAjRpg9%}!z*Es
zzc7UZ-N>AEWM4F>jRl$iA7Z2+FBQ0OJp&g3hd3|OI>AsJNC+BY!5jEL?D$}d%e|UQ
z>r*rcyA+dBNwX0O4%1uTuX|izK?O=Pfjrq@_V&e}Cwgmr*IHM&cnnu0JhfA8u^awr
z9XS~de}Y>k`9I9^(AIsJ!s%{!?m8F;16i?Eq@dz|W@e6Fp21XETxy%(=aq3yG4MOM
zrbsyKKZ5W)9v+tj>I{JT)c@zCrzkl0C9ECZ+^IIv4X<AZvteK;MvW0qkAZVt?!|*I
z<Ke1IphPwpK#i}%sKM}u|5;gDJN$E}8h8U_d;n_9$q&G_53YK?d1tl#z3K@zCa@zo
zVCNRAu2&YTBM3IG2`XrydJM^lOm0&54rT7;7nhCRCuW|PNatYg^@@jQ&);#R7e*;@
z0$k#6ow=kAcAP&4t2(m;Q&syERIwvG<WRTBt0$mnb08Ihg#v0&A3ESy=#48LITQnV
z^#Bwd2#8AZQhHjyb6{~*<d@$BViti@Q^evl>|?3K+iWUze!vuPm{98BKqRo)lo16@
zUzdpo$e@oY5Kn=uGOJ-o!gmN~Bd`|?JR>S%1>~TQnGhk*C=>w+Ig|%^^)F}<3orz6
zp;R{q<{&=hP?|vKU=0we0(^&#LJ_LK5wu9Hlpe;7A<lJ&ES&<(L?{=a2O>_2=mV5D
zfwg7`XAQs=1Pl_|FkTacAO-{xp!^SDcnMW@gPa5d!Y~^mzyOL>2E>5sIf&pIanK+^
z*e0Z!6F~`h5Thx9MhLbM>J!aoQ$vL7g`!n}6QG(JaRr1Cpzgwos@c%K<k%V*$`(ik
zu1OWwf22x`N}W~?ML=G?3`GkAe}LxRrxPp#I@2cdi$1`s?+{}%guypz9Ro*66(*_i
z2}my?Hy6MILu<*QUNE8!sS$*L0>D6A#QYznS_K$hKwE7fs)xWQ5_LY{3&ckXXaGL#
z0StlARu_osDbP%b=mDf*MKVAW6dkl&kBninc|#<RhKv#+z5z!-5j7AF@oDv*vmU3c
zo+DsC0+@+WK7bZfoC>iI$S=w5imely*hAW|KrS)rCEx@RXF_NLCYwN30JPN((sl%x
z5TKp{#sF6OTH6g<41L@~Sv^d^egFhr!<pX(K@0({RH!^EbyGQ12s!o*4D|>IfK<Z}
z;XoJ(s+<a??}eabM7vWX#31s7DBAz*i33nm1lAXTDpN!!Cx9gIVMV+EEC|tb<bV7x
z$KE4b*=$OP<o&|ct<*Aup@Y47Nu?Y5*T#8BkiHE0geIQxfTV^18bAU;I#k^jcm+J}
zfPC5{4q7A#TZQ=01M9#iLUoz{*ylXt(;D&2bw7@QW+Fr!a7{iHuE}R}C*;!(@r)ZJ
zH5hnFSVRw4LN+1l2Ee}n;7c>4(Hya-3=l)anGydZo)iE*JK~EMB2XB0O?fXMLBRib
zC)yU+Pyi+u0PpMLRRB(?jRc?zF@c~A0p)GrSs-+$9#9JcS}9Ps0V^UK=zqMk8}bQ5
zJmUy?6a;v{Y+%3-U<Qh^0@&eQn5r$}8Ba*W5rAVyKmm3FGzp*$@wvPa4?4-AelVg1
zs1bz_c~X=sFbwhG1b$ij;@n#xCnku(D(c6tACyYnCo=ic-!1vfi_th0xq_VzfbKK^
z0xCc)fC8T}AlLyi0yORp75tj;!x+&_)c^S*aS=Q42KYpQSgn%3^j`$HOc92hfIs9D
zO#ME<3LPc<-|uX<KvWw6WC&1CRKx+i2R6yn<*x6!8&kDMJmU>{6#74B1fn6#R49_`
z9X%LtG%>D=;Bw>txg+qOX#r@Q)OBjb3o#;mEg6E)hL`{-J0P2&ngaN>?2BXj4pD6a
zoK=7V7@7z$hG1_4?$`b2hzE`3P!MvTVd(!{vKor81a^o~`|<2}EiXhgBf1raiU3q0
z*NKjJ07nM=;_}0Jzkr6>LPUdrO8`X*Jo?YTmVst8ARPc@uK|$OT<MS!iWC+WMcpBi
z>f~f@a_2Q);9WB$)eMou3A_c?pxkT-K|lf^QvmcAfn^hfE+^0p2vVuL0{xK3oQT_0
z>QZv3CPp+hH6jo4iAY@qU?uRm1L$)gHoOq_jObdJx;x+n`yX7*^oSqq2*&3?%4>v+
zqS7NkbD1W<@*Wq>`L(LhdO!1^q*PqBPLB@kLn#|3G_NR_I~i)LOp<vw2#A5*4eGt?
zvaW?2<M*MCY2j8T=pdkBjK<277$}ldE|RFt6JjE<(j+4YECES{x(Q{6A`BBC*YO~a
zTZKk88mmY$uRa6mnCF&n%WQ|ovtgL>ibA<}pqTqKst^o70=w&TsenYLuwk<F#g%DN
zBe5JL0_yUl9b(-1zBF^+X(Jj)RjFf=xGn6o%C7&F{VOarVUsb)0Q>Ns4O6d=wJuD5
zJM7?OMRO3DPI-@n@Yi#G-24yPh&oaTbxa301LT7|N$Fid=shCXhiEoTzCK9^_cQ1R
zMUn>fPq2I8G^`3F9E&8#`4|T3m<{fF024qn7dgrqGfZ_)K(2!#Fa2-iC^V*k`-td+
z8VOXL`7igvmR7C@z27xR#I_V9t9NrLIv8lm6iMD!S+-96okuKi0(H5)VYypx)2e?D
z66pkzo5~-O!itjSX*laigOzEFZAc7kNk(i)#I83x5_k5PZ(cFvvOGgjTPR6Y<o_TG
zqK^q=kMZ(~Ih5sDgxXS*gx<x`#2BdK7-GcOV}2}<EYHTYa*}AP%ae5ka_0jWZJI|4
zB#YP2V}@`&(uXSM@EWj|16N@wF6WFeRoI94fzQ&t#10l*>0(UuXMR#D)>hf?#JC1}
za|&Y*V>u87UiZa4@0G#sQDvTyN%C6LQhbn)drWZOCu}qUnKMA6HH!%21m1|p^fTY{
zr})4a_n7Vf_BGAZv^A2RsnD?6ljw`bFfw=SGIww=--E$Eqz%w~nL!Y60+tdnUd;Cl
zC_aeA`N+kIk3u%L2|hVNYn6dGs5k*a0!W705CEqNK;Vy|G3mVY-AHkc7t+udN8%fs
zw1Z>HgJU;g7|tA?XAO|+L{KSnha?3?hyuexfib1P@WF}-$&0EfNkV~EGL#u$1x5P<
zjQ}<qI=W2sc!F3%`M-F;hWPnkJkSQhHUJ7A2t_002{qzA5JrT00<=NV@_?EG0JQ`}
zJk<xGXlVd>J;Wh&fy?%evskEjFVSc}aaR>}FPF_tc>31ai@M*J!KPXfMCuTjO*MH@
z1Eo$7paDsMJf=b11Q>{lK0?L2h<tuf_U;3MF!f;IHuNzEf))7f3&ec~{#8SW{(pA`
zTp;SYz??kLX#se8s9*Q)5wJjdJ-USujFKZl*%25~M58R4m>SUzP(W-50ehgC36Xd`
z%rU7eu|1xFq9Fh$p$#!W4HaiYoKc~4nAAhr9(Vm03(}y~6o_)bgcS9H3MI&-4r6=#
z8)|a{sDNC{`?&)igsA-*ZTy%h;*l&`iyFc4Uk=v`I3d8Q0$fUfy#>JGsV+hNUo0R*
z-vLqyu#~{E5^#FmfqF={%Jry*CI3I1$N`H0pyxZFIFF#4hB1u36|@omsh(cS*gGUi
zwq}bVNKJcpl=cGhvIfF;9S$HQ5E|%p;xQKR37h%|ZzV6PpcGt(JZ42m0$H#kNx%sB
zv<2w-Kwj2CN>zZrkjGpIbBGIpx*=eu0MJ_kfwKrnPGA>sp+>z2UP95LK!_5MX#p&H
zs+&?H@Bjs1Ljv#u%%mt2m`yEtQ7mP1AJj$?Fa&~V5G;T)A&MPl^NJkJ$o6;`Y6Aht
zAwld2M?jhMI;<}IF`iSgrSA{rZbdmnGQE9bBQp?dCtHV7WE86IyW6~+QoX?c468mv
z+>yuKO4;E>vqXe}!Z47W2e)0Iw?lxis0Zf^nJ;NFk8bd9x$BKLQK6#Y1og6mBT+$X
zr7vYU2rGrMm7Y9dG_NrF@@civPcyo0$Fsz^`~2LHN0LwFet>nkk*ArYp>>7Powu%E
zC%-W1x;JMZUmX5O4d)B2w&`myqs)BZ`O~<r*m|_w$KkxtVN7`2-a!&tn{>Rz`eO4(
zTDT#>yWq3!I|j9?$(`rTl-rS9i*X)sJ>Sr5>iepZ3Rko*&gl=CaBtQ{eONp3DUM9?
zoyA1MwFgAQHD8E^>&%EEoGELir-YO0L``2G4~@?TZHAi?=e=2XCNDB@D6M^C+A@=5
z8eD1c;8Sn%00LJz!ihaAcWXWtar&A)(zHo;=sHJ~U6gjac~CNw>oGz=L9H02w%h-5
z0%mc6?QL>B-VB=KvM@ZH8#$_Jlh!CV*mx9gV$E7SA>ezRpH++Asus9^b$kex7@UfN
za$F#N%Xy~$&F<HQ9(L#qA%b7!C(H1u4x{Dld?Q5SSK%^eO_PVl$?N_7wyvf`rt%du
z75V<qifp4SnUUM=P7ZInG6bVb9%ri*`qPIBRY;oW7{%`Pe(4WzGIHK?nzRY6^K#;H
zp0u@gm~>orkkN~1e)*S6IH!ycNg3@t`sV>|Gn$VbX8(PD{YO{Zcds`5<eSN?zOPP$
zy>79PdfT_Ao~E}dGNZ*iQ>uUS|2|M}CXe~YeMF4mq&bfipScd9j**`np>Cl-a+fc2
z?5cQnsgu3~i)p401*Z?-^c}c8k5J?Us3GF?2nApehJFGtDgkvCK)0v5B{f0-VnT(u
z_F_Pp8g(0nwrz^`nc@F^sBRJ;UCjxzrKjpJW{;8cp$U*Dsk4lusev4;088C8OPw^T
zC>qrsniG2x7&}72>weG(zcf}I$9i8rnI|lXCoGNU62X)Il4j#O1<yS3!V1KP_`ZA+
z&t)o)g%itca%|murg>gb1c7W3<`^<7q~}mBsiKrp>f{Whld3mD#Ya3-hv#C<RcKc9
zoCI<+!l46i!g&V<MSE_}mU6_LdBvE@e#n5`Bce&ysI7>4OdpeX_tPJ4<-d{->^)JQ
zoIr~BgC^V8?`&V2U2pcU=M(_)g*cxce(4kS&19aJ?KI!*Nq$Pis9x(H!fZbb(EMwF
z=wHVSJCaWEm?z8~CKR^papJQOlQr3xSlJJsVI9vXY+2*P>F?)8^9**=uyaxEzz0*X
zAM{-|BC&)dy6PrWQKTIc+^uMC;Q-#jCek4lnkfX9jAZ-n3}J^8O``%y+7I@)CE21_
z7)nW=LdlnTsnZq*#M^RFbqY|S=%3$y>pOTJK%xJ!E<T~!*gbeiZu3nIlBT4e%$WJ<
z{L(#@r@(k{;;{&eWu<ptk>uJJ?>>_dBgexLYr#|Gk)tMvYhd|+6nnv1)0*2O=9Ayn
z<*PUtHTz5a&GLr}m0_<Te8FP&74P=zEAsib;jhB;uh^7chsSY@s17`Gu(nfkwstDN
z7iCHEASIpv9&W9be)}EG?ROL+(QTxg@Ad|;VrPe+u;2Si4ouAKw~I`yC&JdDSNVly
z)1946L6*lyWy4}H_x1b{{G&Y{&Q{R8eBd?mb2K<2Z{7iiH&Qs+_S_53B`K9q$!aI~
zAZ&aqYp6f==2v6E{=e~dJK2w;^r_aXO+T>BtUR`D6n+*XLjA_hAogLM(Fe&LpHIR{
zthYyoV{f}#-Z!d``0#fw_c5iX-KR2HzGnuZ+`rZH7~MV&kuH{rkjXR+e-RuAO}sHy
z&tN2?c@^v?bZY3n^@bc@Rn_^R#w@1`jJ1xZ{|<#!P*NGgvg!T~`o(^){`&a2vC{99
zNy=jz&->vs10UKv3_o$r-}pPSL``YK6&F`?^?`P$Zqy|}T$&2zuB=4+?!Y^YBNaaT
z#^?&DLw@&mG80uK1~2GO0+TwH^`1(Ei10{LW=eBpN+<b~sSKXSY}8^tXwT%1D$B~&
zr!O*@b#ao3)bMl1ZsnNVo4~J|w@ZVWa4J*Hj9z*B_9sW895fZ9!(S)OjHpeyhS+!B
zD2GSb>V+lX*!N{tl(z3|zLk$|?%HJg@mBAyO=Pxdf_yPaF+(vyv0|}kF>NtXu}HC0
zu|P4GouC~B!Nsky<$-wGw3`L$%CSM5HN^X@E0kSI2|p9A62xe<Y1OzN@eE6C-y!qo
zx+!;)KC)C@EI}|%FzHirGs_q-MmWYg1{tFqgGtax5J*t@a@i5viQ3WHv8=du=_ado
zzuU^A_2voSJuzKY?meoa`9-6~6LH_dVNku@1`V)oB@j$CjZ2h>7vCyYE@myJS~1pm
zp~2SmK7lhKbd$H9wuF|RmineoFxw$*8m}?8&m>y~EgOwFtvBxpx2hJq2K(KxG*pfB
zutW$Zwhfwi=EoyR!=pj9qNTy2!Kb0G5w2mcaYrLm<GF@+7trO?WkUE!Zuw;wd)GZe
zH;R1M!PA>7MqT_}c?p&Y)HH=Rsd(BnFB9ZF!)eJ5S1pcUG_DDk34$xc8l)Nu8b%tP
z8uvA%x;PRZCHzbHK^sk5LPJkO&Fyq^gNKnfo7czq!uRgkG;gEH@+|6dk4N<$yE?lT
zyLP@tzUF1S2_Rs|eIxS5Z3Mq?x;leqmew<k-|D~bFT}Ydy2Nirp&IBn)0pF$nId)N
z#VIA&YJkW=R+JG-5M-asj@OROPGBXxOCUjvcA5JTcZ8+|N+xkzVpDtV?%I6~npm1{
zS~;FC+-^KxccnEKQa2Nt$&DP`CxV#$ez@wzF4(eWa(n98Q+%v+rHHMUN{L86DI237
zZ<kiQulP>OTt{HS1=2Dh&3accPs>t=Y2p*rmK*C0?nS*4hBeU%L4qwWR$m?JiQcFq
z>6F%VtFjD&El<{?hb~-(NWv}mzs}r&dFLbPp?X(JI%<X>>-h3-wRj5gV`?6#{*`4f
zx8X7si^t!p`*FGFioK5w;VhDazY8NN<c<Y+c=fI%dUXupgp&QgxuTL~k1u%a^}?0c
ztPHtGS=|3dbFb?C6mw|(Jdv+2ew><~SQeq=@cOe{te)(#Ik%zSPsTM>!zzN7<=@^>
z$~J$yd8pro@bo@2Oj9p=8=~6#(r^U&*7k2i@BOlGcb(oH5IAHD!DE#@`sveW%Pxr}
ze`Q(U+jw_C-^*JT#w9tDrNncn-$HrtNl5M<WA4F?-g|~^fT=_OoAh6LErhi*S>)Vl
zd495Mq=t{8g(cP<dY>9Dk()a8+olWX&vMl+Wc}p6qc=-*kR>#K*Z5s6UzhZ{XL`B5
zDfL0J&}X&asjM43BX4V^*MbchV_R+d3D-0Yo$gynmPWOD^grvpZ8)xruF&6yIiv^;
z-?NhFe$ZP{CQoJR{;D(Gzf2x5^?sGc&8D}{xh7+{gYb~<X6)rR{2K2e+kLxtyDW&Y
zwwqyq$6UXL`5;bc<8I?yJN`9&LuDX%fPtQSUSEQ&wv!>6$2)Jut5>OPlWNxW)uVLF
zvSw)QJi`$8-n(L+H5J3(aXS*4M!i;sS<$WDujtaL^?acYg+j&Y)cP4*2N^=+++2A#
zfmv@ds<W;&<b73{GuK{cevtN{r4Jd)E`G+-dp8qKcGj`RrQRleCfduBi6lMiU(4gR
z&bu_~warA5DA@VY`~6<i<yp=R<5@G$9EoI?I(yk0$X`gH;B`=wzNfFseh}RUQ-74(
zDz~Pc85n!%aBz}dsJ}$!H@=p_gUoGJUCZiozZW4B%-8FhnG<>Gbil^rtXBY4a6h0~
z%kPuo{-a+&?$^FXycTHqgQCU7?GJa3-Y!!wSJ{cmTJ2{Jp~h?}LnV?iy<K|}xds&)
zTQ~3fA3uA>Zk9Dd>~iPa5=MR(MC0^5iEi1rrQMGzljVAC=T^u4x$K1dR?cVrm^Imk
zv2^7!S;E&&Zl~(w`jxO-Ri770pOj4zzqWN7;(1#ZaOYOx=gG)5xdylE^(n@juN~d^
zcxKCtndu}Om~VNw5pmNR>c(s6i;yI~eTV4M51@T5KI@&%o_R$m<Wg&&evkix%rCl6
zHJU+oR#k^Kb2pAbX4X8NO}~-l>7au<Pq+RF-N%@|g19W{SxFtCOp&N8*;xx6mdqhU
zmdtE;dY+yv)ze`IUhZ{$S(>Nq4&mH4^rtAF_Bn8HztNv!ecJ7y&uyeX1w0+nkZH|+
zE@$efLz(#|_P4aDMDGy)9g@$Ewc;Ne`y_e%^|INXPCKaT{Jb++>D?Bm!4&eUZ}ed{
zqh$Bk=!=yfqe(0Aqi*{zHjR95Ul;fy^`!fA-@LnYH1BonQnqBh?)kk?hliWcw@ODf
zgKX!|oZ_hZzmD>-P;q4Jk2clXY=)ZNIw}!nJlD)7d!Oxi|BplL=w7YgX6;wbjf0J9
zp6xhj?OpjC4~9pX`W-B_n({~w4ywLJ%%>fi;f(j4a=l&{HpdYk(pdoutrPN`Olaqu
zwNW1<g_{<Jsif1{s~yMdAARlzTQ}F_vwHD6$C&rUcLw&hU``Ikd<0qq7mQSC|B2?r
zh7Ocp%cqogLe~y4?FXe;pB8@Qhu<jE-c-d3^bTQ!4pOktgG%hnvqwQ?3mgT!r*VJ!
z!ZERa@SvJY;nrsnv{s@>vb+NqoN2J|W$`6X>q9(4gi!%mRSq&%uI~^da$twke;*sT
zd9zjbG<JC+8bf`wfJr+#!j^|P;Sg5bVLH_D)Y~=KrjT~5?@u3`_D>VsM=QxNGch*R
ziX3Y2+jA=L!}BDctBr(j(}{#f#2L@7rgYvd-6}rX$hZvI)@fYgr<+vLpgVt`!FJ@8
zQ5=${L;BO;V||3d$9z@sr%$-(K7UC|_&utv?Y6yo^Y|z+BknvrWBv%nJ9Na7k$wKP
zm*advM=3nwV`iJ+xF%eA+|rtHtF$U%p;C=wt4fWD<tvhbrK~D7d3;*y-=v%d|7IR<
z=5b{P?5OGH#8DHk)bV1*?0G@2a=5iaB;MDd25;(+7$IJ30p6~Cszw)Vti~987gVi%
z2nrp%!s|Nx#G5;mM2OaEBAI8)tW$TyH5|%qHI}5JGEP%0GSZTddIhw!)(}s)4@zlY
zvCG<Jcqixg`j+^t#rWE<eS9K$Q1OJ{Z%UA>#pc<oOWS8jZdya1ynZL1r<{*HTb**@
zEb)EDGE{PwY&_;sqAzV%pT?i8R1%x~ZLC-;&BeDQu)f~c;E3N|y}nrDmRUD5XQgd&
z>Xc-U);0@$NfWbSaT5!*Rvzm_iAaj+*nEn@SU}IEi?+ROebRo=k*K|EeNN5IxoPo|
ztCT;*(aB6Doyn7989fzap(&JO`#oiw4)*Rx5vxO+(yP0h_j|r=de|Er(XK{s60ELn
z+V_-?@%6NCX7+s8e7LG}#IicSN#1ihmXpF&QpJqam}V(2VM}>2Hl4CuGM_v!wyVmy
zxFuD*cTO;N8s1XObv|BPh?6WXyg1NC9>o@0UlfmdhbfHhg~@3c;JlLYJ9lWWCZF?%
z^gI_0X@4#h()V1Z?98p_V^zT5UImx#zD)A^zD(-+u}sqXVZ$rOvwsPiVY~Le*5xKV
z*3%}m)~6=E)_W#G%ZoL6VNkmpVbS(RVV(Aq;U#trVfOa^;q-P*xUw$RGtLB=WBs%S
z>`?OJzdU;P?L4OKO>^e$9dq^{15MIX6HUrf)6PBTX9X#g2S1tF{+i!l+X|JD?P*e#
zU1}1N?Q7x-K<*9AJX=nkx!-146Cb|U&AA^=6Z-q~$&SQwd5u6A%+BDPs=MHTBUNSf
zLiVI}FKEYcIju&fEwjeIZK7s6%-O!`A|mZ4=7P6zam0QPcRce0ukKN$CUf#ZO{8(T
z%C7L@@K+nw`B&SCw!QXM;!Gf(%}x!M)Dv-%lkol^C-wb)PSX3+=gF1_&r_t}Da}XI
zsTY^WD?<3V{RRB|O7PXt%3FN)zA(tKUyZa>{<p^<wz)?qwz9`5wy}3ZY#pg&HMOi}
z)vhLQHLE6UwWxMGq7GaNvIJv-px{~%F9_Y|$Gh$`;@|F1;b-?7@xl94c%uDbeD}T=
zo^QVZzrL@Ef3qKfcV2~FiFL)FKkwGYStq9LSEZ#LdM6tkcqcCZS!OK!yG&b%S!RLH
zfL3AOz$;t{K5ZrGvaqWV%atH@2xo!!!{zbyU>@!ezq+4uDX`*xDX{8(h3v6DEKKn}
zu}(l@KwiADdJ>X;boB=mk6TiA3$x}n2!pG4tC6oI!D)L_;WrYx(unEy?IZ8)a}j8+
zsu8{VWkB@s7o2>7L5=GZGm`n!YxRLQG?8Yc)<sq~nVb1Clzhx@s*Fl!u(-Sxq-j>6
zrK;EMBH*AWf?CqWLIe3;5ryzQBtGZwCq5VGhY|DLhQ;xHA=2XaqFTuNM9*C4LX(@{
zEaL+&eqdu(9E|>;v5nf%$V2faQbiIaDnZluz7u8N3Lz}eJ0kt6w?H4nFCmV-XQzW+
z@4Bv!lQ<UXpXeKzl9(7dO@B(%$j3?HVK7Ltqc=#_nwQHKq$Z(;wY7VK&g@!^9HAc|
zu;w==Y<r~4f#ct|K>z5{jigVUj4Y&gha&l935RdV!bER15{vRJk+~%{MN8HwZ5r&5
zmfbobI=rPywV@xzIG7{PJoqr|M)Ivx!qr6k_IrtY(VBE>L`eb>q}dNI8C!*XMNN2o
zB~18y6--pL3EkJ3+rKNcqeT>2qEh_EqxD}%Mv3^55qgi163uUPMRC0Fi+cZp47S(b
zA~7RX?ojRh=&cPh|DgS@!kei3FTN0IZ~ShwdZ0M)$dW-@W)-Z3KSy%S?pgoKiv#uT
zzK;4hg=d7cdrySrnMMcP+dr?Id(h2R?^gcj=MN*LXs@tW%i~|(7vl4@0>5G?Zy^0u
zyzAqZ%Yy8;)$|#>zZb}vcjnz$>Nq#h?KU^1ZZN(K*j5Ytx<P4OmHqQ=lWFJttG^$1
z1Wel|TRlkv<Gnhh%=E{k4-crf`~v)}=S(lg@gw0+TA=}P_`C(CZl!x+jkp_ogrtHI
z0=GT|IqSSyvE=?db@;-xspZBVSzk$zoX)$Iz`Ns>@dvk;IEoqeAbpQp1#V4*2p0P1
zEq@oWS#&aOntgQ|74tQv+Mn%7tK2O&&n|{NXyTnErq_@2{|!F5<kY#_eQ}peXo<@&
zdgcEk>@9=h_=0}nKN2jsOK_IO-Gc;Y7k76H?gS?g+}TBg!y=0YcL)U6;10nZf+aYY
zJkR^#t-2rX)>cn<&+qh{?mnlcYHFq%i6)$g8jZQ|mPSFnA642}D*z3au_aC0PehHv
zTyX2E0P2_j0A?1)*D$zHPvVJ5j7ZTAz}#W%KMzmQ3}AzGG+Gi>uEfkc0s03eSqv$(
zD_6?ro%oNN+Pn;Z<ZgV8NsL@|T+<zGt8!YKR}VmhRc{f{-Vo*?!)tD>6p)U|nwiAk
zghKblhpJ*WaO|waJhQx3^e#|ogwm<P__PC9V3{{+9>-1LUMtgWPS$HpP0lXO&gb8p
zSM-{ls#d(`o&1lRzId%nwVhh6t=p}6H#xWKH5*s0IM1IN&pUlOZi?KRp%JT!H<@>G
z=`WSOXA(!6*1d?N`NS$t;GVcuPxC|=Oge3Pv6O@mGZ})Z6~JMYWX-eKMp<}EpHvVt
z`2|xmK-{WjD^W_0sp~%;jf?Ok^%&03IGsoCA<}*l=`-y|w;{d$yw7o(0q9m8TZ)E_
zinauVrg9?c7eEk@xhvbVZi`i+l<Ar9FfgWuq0`h2dX3PZ#~7$~VXIKe^2~O~*Pln9
zQ+;~{<0T9Zxu)$mWypcwD#GdsgEOzq`*o8ibOQJf-}NsfO=v$7P0JGor+VgYIe_+A
zyArO|`xl@bY5_=xQvIg%#;{wt=|RE`nKr$Paabbjv&bPqj0>%C;jPYeaZI;lo6?07
zOqJ!C@zA}0gU-0%)_b~?a6__9<Dwa)+`mB^XmF7On`G*Wz1Hvl1Qjp6ZHG;=K2sgO
zjX9?cRKMtiaWX%PACATZe`t$I@Dwq08YMS0Q4gR#tcVF#Xw$h!R9Iks=05c6{|j|i
zdnA}%Abd&jEb<D0)hovY%eCoWOoB{xAOAZf?#F>RH*&iy)+t|bD!f*+QJii*X>Vo?
zit>!yGEMHPx?O;sGX-UMmTt)_d}0nt@oe7ONb0J%ZHApQ2gP|NZfzvL#$D*}AtqS$
zK4eQG=}hwx`7ko(Md3bqOCmX_@^%vTKqLXWkKXD|3M#*4o}MIpNxk;ySA|lkJqk{L
ziOHjVlDepenX&{WTqkYqgSs^y5f2w)UR3<_E@ENwgxxZJe8SNiOwXu?%`v8oVkOA*
zPb%o~*Dd(j*Zu(HLmaTeGy(VkCc$E!^b8A2ytef>P-WQ!KFLP^cgPF~g>|zeOZgc@
zYfW#Y49WV*MX$naQ-`GeRHFH&ufQ;<i5eZ};W?OTIu>k|WTHU_y~Y7tCY$KcNoZMu
z32Ek1hUj*|R!|IwzkG0+C@oz&C3_}3+8bs(zzr)NJr)xl5Q`<5Mp>OMl21E26xN!;
zB=glUnnK}<Nj-y4Ihqc32qpxKSM<fhz|j^kGB6=<T&ob-P8<M+?CBN~+93eIP#b3T
z2tLE;Iv6d$nGTCpJ%O)K#&^05pGd(Hti=$&@<WM9J(^EGdIa_+wM@!DA-WtUxCji<
z(Tlc+$)=R47-&V4!vtB>p$!@Mf>2`JLSj2~fIT!#s}S3c8E^zi(<!8~BLf^k)3gf_
z4wb>HQU)Buta-B-psF$%>1i-{6>PAy{=@?2qpK?KbArvKd{i<pj%I}Mr+fq(Xhy%b
z&SHJ-ah-<GuHe8r1!+jYuTnT(Zn{bNsBEyY?wH?q3TtL^L$#BBI5Tvzvl?}3;?pU_
zvLgU2Lj<%7DeZV4Hur`v8Wijm0n5-PjY1?l2Y?7<y;=r1{XV4y+7OSQ16pC33UA24
zHwLY+PQ^ET!T*%(tyTEm4hZl|T8GQ1PEUYL(qZ1(g(P-@06*w@u?+R}8TcA-S`gOQ
zEtc96*^u7((3yH5zbqg93=2#p{ovR9^ji#!$#7cQM>G8l#$=>Sf?;b}pdHcxA|Tj0
z7Nm!`fCwnIwgvJb7eEezt!qJehz5{@CTLk;9x?&W0F+gIdehwCIQmZA=nI%-YQ_f<
zmFQ^Lc4~%<h-CCIj36~bN(2=Bpa5iblQ<*<P|<X%qB{hiH%H!l#@7T<Ygv#V&hEID
zFmva4w&C+C*fL$<9!d`n+Olv%J=5^(6{vN#%%_*YV~jaPeeb4Q!DE0xnP_>1eL!$f
z7ygw3wYG)$AtHbZU|iORI4uiiV+drsd+Z0Z(FGbs4=UuTS#TfX1E_$;Ujx>80J$`Q
z8qomQXllNJf?)yjoYb-=SdAT4r4?#VJN}QH+5yUlr*qZ+u}iQG4^W^9dU<>UNlN~*
zf<L$Kiy~Mp9@bfjJg2bC0w|N4)&WwR79r1pms!DTRj|&l9l=%jTD*40kd<R-n<RR9
zLBm2yJ~?>hBXx-~SdF>ZNhcJ{e0sAp)666ZNNv(aXMr~ersPAwD<#OOTFY6(`<<z?
zr=Yb0<Wz&@6|fq-xU=XVt3uH{nzq)|QGq;Xy6g{Ddn!Iv4?W^^s=?O^wmWB)yh;BP
z@{fH;$-h^8;6i^;KrjE%keHe;qO?+jJZHWP1glY&1eX6}Z3WIe46&IcwKKid(91^}
zI8WNUwL)WfPm}Pqvh7TnCHph~G(P<{H%wS`pG|XdywgE1-)OM>v-hd#UGuKLVbHfX
z=(%7~tbgPb_~87$+X3iw*H3KqiRFdw|03nrue$#S`TY;_zeK41n^ArE3Uo|XBY746
zyzS>sF`UC9k+7qZN-ghR3Q0sgp_X?p9Z95b*4!OTUV&e351ne=x$StDKMJ|O*A5aL
zf98gHv-~Hl@t)}OJ9rMphlE*`H#GA0rHD!NjhYBU$;<Hnb`(yv{&W8a^KEh>0iUt)
zyr26bYOxXDr(#VjZ&6y8G?<!Smjr~U%G;D)Cehbx`VJ*8!9{ljnIv~<IkN+(c;2T*
zzst-Skx3X+v8H=P@g%>ZGXJ5Jc7{&07%w%3^ZrMjUi;~7bWXW!5EP=te(4U@XdHq@
z=jeXR)8TH_2Z31Ve0O)ei2(479qm+@1w>a95(6?Z2C*>uVm%Bxuz>gh-TMC|_J5GZ
ze~<<BSBUezmx(H<oY^-J0593WN`ZZaY!ougrF0ZPv^3q{*I&sE=d>z=Sh#(+cf1Jz
z@Yx;ZRG0=-P!j@HUN-`<@cX{~r)2-9Y_2;sSaENMX!%^ePl5G9n`_UVD;VbTI&%K0
z{(v<$hu<&ad{U}=&kXWn>YnLpuZL(QTyp%e(KT#i2K6&{D}q>5eE;s?{8fX*Xsyo#
z8Px2obwZbc@W50UdD@D8&W5F;gyH=P&j(Ps%iRY6yleN%NjoYl$eM$?kRi1-pbVn5
zcWDmR$Q+IQA7!#kycT4{SR4#u`E>Vj#U>7-b#v(tRi&t4(C!W}a`z9=04}QLeH>*l
zWL)9tPkTs#g=Vg_W=rHV%#A-v0^rVjny2lhOFV07WKE(lhPl~*l1|~*X;$6+0NtLz
zCO}6<0Qk;cB17{&GpJZFuZAIY{ZSnNzutTM8p|wBEr`8ymjbA~_0AHkF+NVh3ThMx
zHUgD5-Vq1{MYAiW!bY+<>jm?adec}z;X<Yb3`ARx%m6s<K5HsWDmx3TK|7JB1Ho{6
zew}*MmF+*JMCm_}?>`VH6X=bg>YnQ}<Tb=s>8Y@otQrjni*xSSW<Wed%lAt6WX(?-
z#Pa>l0094Q|2PGPm|dd_!Eo*B30iglYfw%IvVgpVHeNm340z4P=c|R&QYZC)fd3gq
z0oF(!Z)OI`3IuC{SnBQ!!5aMI&8(m~z76x2+ZC{e`uN7{GP3V_JzIXq0f3k7d1LIK
zFJGFt%lMy+cMgyL{pVqDK7;mpK;FLzSt0IIGlPhPUW8gZCE$5XAR^%xEl~N;oh?{H
zc0xi`Jm@vIeRr>+$KQW7Wy%72BP?O%5>(7ExBKV-s5<=t)-aw(eDzycqMU(f=P?U*
z+zi$*pGbVQD*U4I&y*VgPPf0o3Q84f))baVeypWVh4p5?z!-@39`|>iym|J!nLu75
z64oxy_M>)&L9ct|Q;-~pW&KVc0QcG7Pl0Xa<mvuXO8!%xgU(|?omMN41q^f7k982O
znYT6)Y$sYAEfB4(x9!R#)5NbE?Ka%p<=*jv6|~#^ZKefn8DgPW4w)s0GWuiVY<Rf{
zNee4k$?{EwbxAS-;4ZjiV2uqLo`2$wCgdI^*%Wj<h`|snstB@wC({I(6^crN%yLD2
zbD{u=vwxk<fXvEAwfrMtkXebScK~=W?weC;Rv1Gg-WCb~9*;YW$q~Z@It^ngXJ{nY
zl6yGpPk~iS5$ZzP(A9gp+F_7cttbt!h9)g|<x{#k#P7AHCg_MA`BLzP5b-X{4@2Dq
zbi^!E$4xSf%#rjRK8Tx|3R{<=3DI<+eHEK=6@JYcqA|E0vCCiqUd5q*qSZgK3P#N%
zbVG_rmi=l(&{sl3=!O`P`Bj+uzJ6-xD2Z5#Exm|t#HRrv$8s~gjHFokL?5i#P5X5@
z%iDn?sT2NyJG4IQg=Xb)#1od&DSHe<ofhP$+)CK-&VtbeYyPE8>VCzXLjQhJgS6pH
zO*KhAmoUn#!WsB!3+n?vkpSQ%c*d!)Txpswnv=9iJ@9?pwbN4C5Y2R2KNgU2#J3gq
zDMOIGfDAPNzVy!z$EfyHn2q!*bTvH)becDd@Fx+c!TL4c5VRdvd)YqRhqHoVAbq%|
zEnQMCoEMM&Br>@NE{RukGCl>?$fJ9`1TWreykC#f|BeH!AoiGVye%0S9sUr=Y;Dx=
zu+#hK*ayc}313c#&<!slDEli>vg1%c9{^5|H<JoWkQsaR1^XiDX`2_SDot0)C?i_=
z>W{^1=EI_d!5Rc~NkedSyw`QE9QEPfX_{os|4*l|^9l)XdZIH-8h``v6t-Wd4Rf;x
z^$~zIW@yuxK;sdwBW$GEG$CKHE?)C)jb`P3#M6hdat7Z~p-<MFp;dY~D}{cdPt?Sr
zOB#fu;tiV^iMmK&*<~BxCo63u+GYFUhw!P0MSnB(CaFk;&C4v-w7-2H{g%PaUJDr_
z#Lr@p6Da5|bi-=#1u|QM#^83OD|4y+DTF~KF!lp}shn&_HG>zEh2o`~mD`b4AI0#g
z6G-{bCf!nG?5V(n%GQ>X;W|jXg%|Ek!r{#dGEVf-1s!?I@I=Rofi)KB|GZ``(Ptw_
z<n>Y#7I~eSW1Cy_{=AvJ{Xza$1ctB6Q4;?(jWp=(Z%BqVW`WUPhN<tRKu76)>3@Di
zrofs&ugi9Y;T7kE9|={JfXwbxoNiIP?vj7QB%&?BrO%+n_!gmRPy3?2zr&?3`JP8v
zedxuS-3&oW>o3r0xC_1nYtB8R8;|b`=Rb6|h6uk(ugd0D!!$e?zk4amHbuoLMJVeL
z?(t`BKUKvzwZ+Wk`PE)^pKP(FE`S4&_av{uxxxY^GqMMlRx7#}Yc2pz2|0?V;dhW>
z8zXXXDWlRd$ml**WjwtB+Va1DrN;h=&FP6vp2TUm7}O42`sW{JPg}&xP6HrJ1{!am
zp0HI6D%QjSzGces6Us~tNLvdVO`3)mLpOKU@QO8gfkog_8<l~R(xsZ}(J*%5VIYZ?
zNTW~PE2bYR$dqFss=pXy@QQQ*#<Jx2iP-JC=qnx0jty^tNZtpJLcpc#Drp)bH=cE`
zuG&GZQ&i$J*&HNJ8H+W88Aq9O$a(cm4ren!?JsFWPH?N(r}DN+2!pn=J%6z#0kC2P
zXF*}zSo3gpW;pA#-C;??@Njl>SY+6Csj9isRx$83#y|=N>c*=k$Fl1!nD=^Ge2U6x
zUWfAG>>tp3mr+J=sg8<(w#bcZo&Ge#U16JJf#=bom142x2IJ`%yWwkA1bo}4;S$i{
zG4>UvoO|9Sfz~yZ!`af|Kj2bv<>j2_27=}jnCH<lY|UqM=k3w7b4T$j=iIbf?0Iwo
z%W1Su-0|>d$sre8QaqeJ7`EDAhXyvEI7qBHw_Eerjap5o4a3+`nR1q;?QETd6%J<s
zBRzliaEmqlnIc(o?j?m^!-X@l`RB)QmtjJKpgeO<n~boC?_bh~Gk+&ChfyKJftAab
zDui-E1Iv0o$wM1+9W{Aq@tcuIttB?6-pc$SpyK<m6@&tsPG@3;nyg~O45C?}b%<xX
ze*TYrwx35|i>c{E5fq$kyzp$i-ms^cdlA@pq4IvV8zgARk08ph@94p#HrFxzM#xog
z`-Kc4OV2o;)j<!*{2wU}=^bKqz@_*-P0Bz<ni5KSooYeKmSREnE_I8vBV~&$G!>uJ
zA_bpJBUOW}E@he&BXydLC54C7AjGrTJ<+{10)EMW#k;#izBi)C$Ck2SugBst^G##D
z#=JB@=7-5$L&TR$0G9mj!-so#1h3C<DlXEfX@rH`Kpy5+a4KaF9}>YJev+Y3S{=$4
zZ7%K%UWHl|?r&Tf{~h9@5dWv9h>CXgWxZEC`@jF{EfHR2BxJ(>(9qES`)tXo{@?%a
z$NS3LxVU?|n>%y5*tl}Kn!9^gyK~x`dz*90{jXlh+Q-h)+)>Tl+SS~{gTvDCl~x&{
z254!|zice*kB2EC5};*<{FIjZ2qs2CW=5b(QbUX?!-XIq+Lh3lNy}Cqlsh1d#zn~)
ztLXz4=Z%dQ){Pg8{SA-X+Pv-VCR)#xL1;(MLDV9D*McU+PIEoh1AXs*BH<tj8Iaj+
zizgrVm?RGlbE#Y^bFW66X(j%$VgMF7avQwcl`R%pCbV=cXa2P#C=g)5wx6)sBz4B0
z0KG6041v<AF#7e?T0oc?R}KK~?A+mbn!XC$`z3BXYs9=V=zqm0@Ogb9`bHV!AZDO-
z_SmKs2k=TLa}p#Bd`p@Vo^5Cqz3pV+!cC&`%L*L`ba#gURGRuU6xr%!-qh5t;-{{v
z^@A2!b)r(U4XrJ^%9{G^Ya=}PjdVx*4HReH3UZ++Dk_^taufV+(_>GDj<q`3BmG|4
zmHSpm+rRh}vnNJ#dxkShghufxe7`TH2@T@!8(0v05}U-&Qg-W#2hgP_dm{YpN`l6=
zoLNj5_qMW^w9MkC>u)uuwPeei^bDt_-BL=_SV)<S5A%zTHl{6(%&oNSiR5nkDXyAD
zQ?TRJ%FGf9F6ps0c^r?gx}XA^^|o{r8w|DtIM$q_-?Lr#Pn_*okpMrryT1~Tx-6)K
zt2++xuX|l2R6ymAyE`@TugB$oKpgi=Tww6dj=ARJ@W8nY2Qav)j~?@=$S7l?wOenC
zTW-me{h|es`>hX}<}-q?YPdz_9Fzv#7xK-8k_h=GL(_fE(uIA)q1|qmEWlvFeuu|L
zRNzZP-|^}Lmdg6h4!g?w-VUW^heOO?<m<1$+gyvj|I%kYqR66PJ(8QP`A9mYHnm9T
z{I0gm!l^&XPUVU1Oi<;!>oT%?f>2=}C6E04MaJGe|7IIwh<SGdSol-+#wuxbS+Sdr
z_ETld?j|{TrhuZigI#qs8FzPUp*t48|DJA5WyMElJIt%GoaMpEau*}v!oup-5;qx3
zMPm;yC!etFKqEXXWd}P9RXcb&lgWb8XYB=E*DYj(c6e8DEsxUASq)kA5b>_I>b6#e
zUvc#3%}5c?>6Fg~nApZl`O5H`!oZS=^6IzgO|u+0f@!*JH3eT&N?flV8Oj>7@z3()
z=5juj?Ph;hhNs?mIsAwp-@O57Z?@Uk|MUQZBc`1-8IEjp`G#5ni5;r$!}Z#;VOe{+
zI<r%B?r+1Mmt*!uw2O%v&281COk*lpOgC_IH*l+WeA9<~pX$1-`Uw$>e1klk>f5aX
z6x@_G7vY~qG+Dp0mPD{RAo~gJx?0{WyQXIAd)HgtJf`i|I=UIBe%7_IUC?dhvT5tT
zpKT*T(C2O~>2g=rFADfAf+()vO@k839t*j$Z~}Ox^0VW=s3czq6nB+$aiILp9=HeF
zdKz?$QMevut3z2>e<&*tuVl}zt{$Xx&M8}CnKKF%&Fil56_<1|pAh@&@CoQtrVlwd
z!X2w!*x(iAC9NOjS<4q1`IL@k-ywzWmsJ}cPW1B88Nh~VF%3gim{pA59YTcOTHeeU
z9KGHj&gxEn3D$1U9+g1a_6F=N>cP3tUoHlkYe^aFdt2E9T=6Bs6<H%W9V>ckDSDp;
z&c@EhP7;X-VtvcAq6#^L=9J&E+Lu?5{@yA-+JkR0e&wPcoO;7g<i!di!8KwX1nCsz
zENIszY4N4=MLGZmJ=a>p66#5**|N3Q`m&73oX=WRCaWXBgjsXSniaY_g1i%@zemV8
z@@0zl2JXN1y*uPPHcw?XYAr9E%Dh5*tGpSGNa@FDqW~T0Te5ddGcgW5j_PD^xM+)z
zv#l|SJaHE~6@~Zl<!_5J+5xONax6r<>uL+<tq;iIt+pOtz9(@IOLPnX@T(ZZIgMl)
zz8d7==GkaiPMjp@WT<|z@2!?gjTIRw6elaMYvVdrDjgwN;JE5#-69a=pOS=#+W563
z5ULda$X|n2FcQ24d5SD2+A_`x2*+?&JJ?1n<QZ(}_3x*x@NpWc(*qi!l@P!3niy;L
zw3nALJJ5vB;X1?U3)1?E3JRm;Dumg>n<~~T^doOnvIXW+iTIrtHschjb8)2uTBvbu
zf74K1ZYKI<{8>CSyWUj2t;Y%Ou@rwKO3d0q%DYv290iKwQ@_Q0<d4k8dFhb|yoKOj
zMBmN=@3&<0ZZRkC`}S{ZR3EcqZe!eU-<w=*YIl5$;SAW4*iy9Eo6yQz)iBoVN0B|>
z8W^}AI5}!Nf!Hl6%fz3=?46KHxtcer1^_;;*Ypo&KMVl7h&D2}{PS)l9}j-K^-2Et
z&C~8~8gvC7u^r>!;LNORuv(tJ+pQl>=eUW^>l3FAGE?}oiA9a=R+k4o|6PTHD*RV$
zziV^HVSNNRtAE|wjEJ;XQ{zyrmrj|`BVaq-0cw!C5JjvFZ9t<$7O%}~N|^L14Cb<U
z9(M=~SwJos6(h2tE=ll+AhwyTcHVOLF4oLj`;N6F+%Rz|N2k@|`_Vfv=e7DG8GU#k
zwby2e&5<x`hk%i$Lh73R(eZ+k0a10?NVT&CA0@8z5RZrI=!wnr_a(ly6mpB?6PD>r
zqIk$!_UZN2raa>`LWg<GmpDqq2jKb(?UXaiZ)Pd=fS3_I!EgZA^xAl+hyYGq)^Sdt
zb<KDUZD-FSoNjmo2TC<kLnkZqwgEbZuFND(%cRa{eis&b+|j$Q>DkXkG*hY<GYHfO
z+awSH3IJlpS2d;q%_PKBB^wy^B+6fP4Kzf=+967;avFbzPQJRXjqGVJP2XQLoAk?f
z<inDZKJ7_LopYt-QZw_W1koR)ZxgJ^u(*9sxlj9Ae$sZo=h$lReO2!I2cwm*_H(@e
zx~J60j@?+yY^f*xEHfPAbf5-ym*QF6u6iiRQ;wX1i62g{SJu#y!-jp)ZxmFtE6Tk@
z^R<+_|B($zOb-PN-sfP-)ID*1`MCGud6a*x<#(5&RNSmOjK5J!DQxF{QMm<IEKOqv
z*yNrPkQJ7yqPs^XP0Qz-EyFHB^>wlP<E&Y_8OFmxWfW3$`r5m{>OoTT`nrFMctIFj
zmHO72jH&HvaRzNEe}3G=+7J?a)Eoitr%xJk6|WMhhp;(k>j)$ccun0af<YGX2c@vv
zlrD?{7*2HIL8M^RY_zszeX#<Ya%}nxWIh2Nhg&qWH2io6m{GJPNoV{%ymK$Sdxh=t
z`aY5lqKn5RHt^j25*?W5en|y9_qap=QuAaWsPMGjitLAG`$IiCg@?Cbs0)D;E5kxY
z{?&St82SOlxJPe|?u=er@(8cas;QGrh&Q(R65+*I6-GoU?BiTeTus<%)auMHWJ}sh
zAFAFflI3F(s>STzr$}N%muVO%4PU#f2noh|)H4Ai9#VQ>f+@6PYr>+QO#AMc<Cjd4
ziKOen+&fSD#X)1O2ys)A-5(SNIWMCn$EKG$HmNi%viHl#QQGrV$p)lSRHJ=j5;&}d
zG=q?jyB<x&yCH-iRBg4U0IwE^(tp<InKG^2>+$qBVPjmn?q95|sHd(NMw9%(1epnc
z@a@Linh<fswmt~Njg>5_wbvEbCbK8%LqDPj*st|NZ<g;FHHaH9?fkZ^2ItGGsktLF
zN`%kMD2T9jJby0V886yO<5ajO+JB->IHea1*h$dw2vq9-GbG%x-IB3)f=15%^LsJ*
zvQ|Fp&mopN1)|o6Gte1$A%~AnFzcIplW;(pjxgidFVlTLf*6+JuH4y^7FA7)Un5?N
zm(^vCdnW69_xd-b5fr6beBqQ8d2Qqqcl4An{Y{%Az4?RtH@PKgyUH9UJc~<57`%4T
zB9}G2tiH60z2JU&ng}0om5aHiUhWrj5@`bWwhy?R4-Sg~tCLrIy<yZmk(gvnoZzE(
zd%tU2(guZT0E|FoY&^dKp~CG}X0rNndkw5spG;wp*wA)0x+3QXu#CO6a!Vn%uT(0r
zS)b?kQu+lxI90XNM-xujL^%hn&EH=qjL6Pe-|%-N>^qhLXI76DVqz!as(&6TEl<lJ
zQ)heJW*c+xp6HHHvicsKIbkl$*Tmy#0~pZ5(9-gXl>d(08#J+v9xLk1&k06Q5^L*y
z`q)SmABI?iNhHh?-r{Us$Tw<j7Hl+}GCS^KXC`;8+3ZVH%J`S(?z7#dYf|Dpw7Z@5
zM1_oC?(%;6Hyj&&J;22t8?+ev@E@t#qFX_BZ&z#p<bf`4r{=>iyv*Q~pq;iMQD4sM
zY!xTfUm$Q^p@y*5$Ln_)?Id)9E;uQxk78;bk*6VP4>Z^P{^lnknH6Utjam2TqRMvE
z87bKL$w-?$G@d`qJO^>hCkvJfW{=54kE?&?>FAJdtyYTtX4v~?eadw(RQh%QcYy9w
z)x_&_gctP`dg_5g&WIUoHv3k!;31A#*@9$kLJa3YyVk!_ZyS3!_;}(UHj8IW-hO;m
z$73sy_ac;I-LpBeFJseO2(@m_yf=X{;VtqkR7FLwX39}$G%`i(MTGiqa&jTrFd?db
z*DCyNOK!L5E-_8m(2J2_pgqN?-O%KMeU>t0lT=C@KYf9GiHzt*r@@V$nW1FJHlQvO
zRhuEn4oJz0*0^^;-z&twQd6}Ori^tHh!>^?ZUaC9^*OF)Uwtx-ka}NO8J|%a2nN<f
z@G6c2|6A&9#xZzbwd(ty`RN?#8B-}f5TUfJ!&KQpx^06Zy!vEpYpsPz$#$%G^AB3b
zV+V7LWSwk9;fR1I=TE^yI>81Ku^5OvF3(e({XhnBT+{g;AtTlboWWH~Mh~GJt|i~<
z*Q-ZRJ8fWPCRXRhi1*0W+bh?*+!|J;9F{YVwvAZXBRlIK+ovo@ikigOhkz{G?TIrk
z8`RL=FRP^i_(JeezYnKAv+hUKx0NIjB_5Qi<Uf_CS_EpviUlnZ84m`b7Od(gBCYu2
z%0mDdh@9ERobe8MFC8b3pem&}t?Kwp3c%XBwU0NXiZrhjMUc5LZUJZd{tVJApA0G8
zMQOASYpxS@61qsqDP^&)y8fy1u39^F$_hOSWoG%i6Y>J(Z*vmAUn*9c&X|MFTSfj+
z3upa~4In1=GE^=d*f$6b{Sr}%6!~ahkQTEB246I`6WI(H=fJKdMNcCCVYIMCU*K?+
zp{Ii<9Rt!r>y#O+MZts7fGe5xfO;K(+o>RJRr1$anixlO7v)Rnf3yMzGZ9@!Dv__%
zz+Std7;>;HjzKyVR+uxbQjBto+195d*kjf&g7B$=&#!}=4koq0g)^ePND5eW__Lsk
z;^ZR=sd5(v=B`@UZAsEmmSjv#nwF^;b8)=_yYYweJv#glw9WF=ZytialsL&Q7hGiP
z!Hms4n@mr*=*hSb>dOyIjDNDYMGJehGvxtldW4tha@;g!8)0TVf4X9O2N&OptSBR{
zPUUa(#-5`cP)Dr=GvJ^9K!Y5pGgM=S4UY*({XTN(*L_(u4%D1JV)I98Kr`ox)gf=e
zS}NcRkaQ=x#EG@g0s1ARccM6jt2At$m??*XT4}40C2ZZdw51I<lQWH+fa7i47&SAE
zKfGatZ@=iR(EWBIj3HFQTT^3eD~fxp-Ihg3i_O)O#$IOLf%7Go)`zU7#anPq;I+E9
zGk?RT(S<D^9*SUTFS2{;|K(fe**=z5&**Du7-TXz`__&|<<(-%a9CW3>!$l@s|-<0
zFkg|pfsUNoh2#>ttT*G3P@+0KYhhsghj&ZQFjesl1hK08`%tPAV>9<wk;1N=0Zk(D
z@7B8$S;;CEvyY?RW~7`wmWUC^4Ol-uszqqhOGdLVBfx>Ux*y^~SP~>%@HY@FL?dF+
zg}_P-hq+2<9E>|E(ybXG80u0(IbUXEgau+{TXeENQ*K$E;G3Ti&H1QQ(*FI1avmes
z!D+zIi`pZk08J8j|Cu(FKcW$*Xa#-0O_cA~J5r4HJ&wOsKq;=jL?YQuM7heL*qttv
zFq|lQ;}Pe1o~jYaw#3nDTu(v-Hx$t=C0LBd$JqVC8lgm?XGFwZ3*8O-1Mkn}?Bv(Z
z+0-Tsv@~8!j*TC5-^O7d#aX#I6Otg`Q0hT{#Ut`cP9lm_KOyP==&N`nh^}Ea%x|<%
z`mXfj#<RB_a=bs{SpCQxbB4f*mFH@!>D^S8*xqI|DDj2uZPn-J1w(G$oxF3ZH0KH<
zxli)1A9&Vnd`^0iY0V`zour=iW@u9oI~*@YN^w&VrMLDspCuZ9{G9vYSk_Zd(n#4z
zx)joq@Y5g3FNy-a6R&q$d5B=;f}-||%oXt%akF_y3lcEeSdaaTF1aJJ&y90}1ZUI!
zLf(-mSV~4T)UdCpMOQQ;vJdJbBN`9v<Ly(Q-152*UB}~0GU|#->}S1|>WDe-lK{DN
zz1D(GW7zxvYqCTTtxoQJ`Aj7i9GX^w$}hH71oQC<ed-i~V$mL5+8vz^@q=vgZ!?;1
zn0MD-Oi==rzjPI>qPmG2$e;9o>B7QSZ&C~=-KXD6dIN%0qzOpL8&DB3<hG)>a^HDp
z4C9@D=x{(iJZt$r`!f03Z;#+BqvE;f<&fW=)isPQy1npw(ZNA6DQTe|Y55{)#jR^L
zB-9;1#G2w+sloHj;4u6K%*dfu_e~kyB61ql2`sT%irI@aVkTOQ*|RdD7Ep}&V_`($
z?}tXQz`-kD5zQ#>09YU?aE(IdO-?R5`rPSqqLqvNXpDh5{<Umvl`tcslN0M9*}_ob
zX>6R1z;h%Z6TiqvnZkWC>OtXyAiSLK@cls%qDV-7T%>B|XHRQ7KUV0Jd}hSd2&R&b
zO`#q$Kx?dr$C{%&^{z~vxB#S2*SzrdUh+EPBhY)=SOth`$7E>s664bFvr%?tYv51A
zM1-y2S-uvOwT>JPuF5tFS18^~+`1a`@(nb*)c4WmiB-Eh;&3vs7V~4FNUF+?cpk~D
zJzUzq7ZMNDG#VZ(r7sqt``VXo5Zc~0h<VK6TOpX0J;LaddR2BBfT_bF6XMQ&F;|RE
zQTkz7D6g+y!<J2ByBMra5}FxNS|n65Q!ByehVm{s#DJT}H_cex3OFfM|Jsy!e%D=#
zS(V2$TlMu79xxR~ibDYt%p~>L&O;DifPP5Rx!2YD{Q&FxC`)HrXFFNA`+M|pN+H?S
zx5p`Ki}{ZTwk-ax)zcBNDV;4ct)_HzSbGROdD!_1Ctu2U%9tA#OWnR2?fco+zuzoS
z0Lv-(;bEir3}RypRoha>Ia2G=H_-vovv4-lIp7LRs=YO$U#Ldv(U>`*7(Q=)r07P!
znEsI2^-5uKF)z8S4x2~4!DYmU`UfG;oYf2E16%$a{@NiB#+oExIlR#7s};d%M&ZfW
z8nF!<olJ&5Qs|GQla>Vlba_Ac3~zafCss+jm)5RuPSEzUzG;)v(Vq_OMm>HGcV|Oo
zS;Rr+NRRRi+CCWEgn;k4SG$Wgt{y#0-HZ*D>Ee<d8Zc&V!k7}Da_;fklPMKA)bCv{
z{Td#)=swtdaJ&xF5oJ$2N`4R3cm9O@cgTI34Ugy4(qX!1QZn*$7p2Fx04(!o@EZ`3
zT?_ZtBKbv37X87d7DI&s6tn5Qbz^n^_zK}LVB+ijE!%WKCsZZv=;H(af(17sN{GT*
z{Eya;6s=rpUBEw22oaa`!vo@5B}f@X4VKKzmG;{Ca*aO={k|oTJ_a;WG?l?yz&Dl^
z%anp;Vy+eB-%ssvKUF+k*m}|AYNBoud2y|4L~auBn;smwCKn{&2F@j0z(kY?%ewJq
z=4vgfMNCpEWGym9)GO6XV^A7pDzy^{Y|DB3<-D49ifA2U#-axm^<-^*>ow!GurrcM
zn{oVH0MeG$59dDrnO9Q0#sEMRp97$$VO;uXFg+hF3xaaEFKM5aP>r74%cj>q{>a?z
zrys9tm|=T~?k5{c=7G7ct<z5YLLmlUt^Gs{S$MCCm9`5C#I>RdOm3;DB-(tGxi+s|
z$v^{jDE~o=pGoVNJL0=^q8i?eMvE9~>EmgonPWhij_7#TM&q-p5WyTfeDRj-t)}jj
zx9*S9dAj`hf;@vnNqeM$a^(!TfMxBnR6rf^%@JI$qWTBfk)Kh4^Y^(UyTy{+c*9u_
zV^wuA1rEek;DdTk(^~q4!dT|n5`Q%DLYgwo#~4zgR$qVam?o~paIspa7loz{xZoTF
zN#4@^%R8@wozgOr?`oW3RVJa%N5t1!oU&bhWEgX-YnDpy7)sOOH$>0J8V+P|KJkHE
zO<>s@gL&kt4=XUVbfbg?@vmY`$_<4S=?Tl=lIVG=t&Gfm+O&bsO+<|#x3r=)p|`DR
zpyae`ZmrWWL&!a`n)QcRR11hfkTiRb57Oj9L~X*z@_d(;R2|mZmRZB3d&ta};pF#r
z0_B2|>Mo4ML99wQ-o2CO$x@g(1!q#!H!7G~=L1|`f^ua}8D;B{Z;p`kWGDHLz6hxX
zq6wA<Gn9)f;lGeTZU=uy-6Q8}<n{3$@#5FeW<;936{zHaVzRERC${CjJ9rSGLVYgs
zkc#Qy_V2Tv;H0ZICM>=E#x%ezi(VweNPs6FOuc<{?z6~B9Jw{LyIE8iC4|8L*YW2z
z>W}yn>_J7r_k-xWNNw5ii`)`@<$(&T23`n81j<d0E-ChgxtR1w<T#|{@AskdLSIdw
z($3xy2i%{xpTLFFgyeatG~4!dQ~A$WowK?i(w79<BMB~(Ctyi=jb+3=<6fBy)T}EK
zI*T(^_WXAINM1<$iIiea)fIlv%zQdIRUQ=bF!%Dy?MCs@_=!_ow|gM*NU*mkh_ekY
z5$)*JO{zeQ1m*kB<0ry3khOG>wvygG;W_yiqghu^GY7ML+h%V2P2`D&uj5|4#F(J#
z&VXBTPSwK#LuKy0kzDF^n%7x!4N5~@0QU9%d$%A^M!?(@a=2Xe1H_CI#ZmUfXeo)4
zKa>x_O2A)T+#x|_w6V#Q%46))U~*eh6Z$wE>jq9uT12jah?D^i=1)Ib`M2hA^Ca61
zj!JX)n?h9*BMk@{HCTPo%QThqD3&<_$XSi=9(5>U92x=|?2BIeTs6p;i9C=aDRs~_
zApL6BA__1IBpEbGBX~z^TJ{|`yo9OY9pU9vjx7E-ZRthzTy1jGcN7L|)6|ePBeMQs
zS843EEm7@{;06&Q5na7%>ufvmgcKzxW0F$3ofx)h$u2dGB6^%cmOg7}xpG(m<=aGo
zH+BZx<~HP^2I%gMOF{;${m4!nB_FTU%2SJs3_lky<5&Jv=_5a7X!xjDD_POox(tqv
zR{yzz=PCWx@%L2puP!38R6^INxqBo>&0uP2LNe9_3hP1XhMaW)I|sBe@{uQ8iNW-i
z{adEqMFIEs2N&+hPxX%gJmmUEUizV-OKMr2Pietr9%CEx#j&Mx^rnWfc*`QK1Xy5k
zYAT5VY@88c@9S{TSC&A;Zp~i`HIykmlgl)U4Yp7k`68MFYI51Gm8II1dpSJVfK^^d
zLw2I2x92q4Q~_;_No9`SZmn~j)OL=FsNviML%iF&TABurf{$5Ag-(nEU7tU<kxDlz
z9+I|V4%+MDqSw$xbdkq49!J6H%ch(q>%Cd$9l8fIm#JL^xaaPcsn@nwMWd2%*YUs-
z;nI>4{ibR;Cy<Y>`#zTQCWHy+TA6dhr?a^<mtxUcr)1N)lLd)?L{aQHTL)4joJCMG
z|MrWelR0yh)nt3G>MR^<5h%3fiN5z_+@WX~%3|0#@5{F1<Udz+FUg@)N~%{O&5OH?
zSC{`gxEjJfp$<5-?sE)yat$_kNMakDRPYoZR5;xbl6$~mhSpfdd1CTThY0<rX!M_Z
z&Z0(SMi0l|Mb|I+b2<9jBG${|22K(M=l`KNpe7f^E~<Ext@Pw2f=`YJQ+?V-%aC(U
zg4U#(oQovX0n99JOyYsDin-CoG?%7lD@6=4e?-~v=K(BUA_>>)2XI^S2C6<Gu`qPM
zZc>&(ZkCldM!4%<+xQDf!s+rTT2p};dW2&R^a(Y~3A3Vh${yAsjPa#yNx{B^cAi?Z
z7c2bZ-Lx?TQqT8jBht@UcqtK&taKT8mo;%_?n9;oJ-12SbfKY1-7(VRU%N9+kB}QW
zGx|8a9?c=PwgS$MTff5`PdfPT>eQ$awI{<>C#56A<8a?2V%<+I7Lxn|2eMU94-Px|
z-3c9X%ItAlDX|2c&aRyre2x3`K1T4sxg`oyFVyUPoz$~=Ulr}VJDm0fjVy^HuBjW8
zW(RzpD*gU57CpgEVXl<kG>>`V6n&TGz33@2yP<c9TCtNn*GFzrnUJ^Atao&>9Pg}%
zi0&ejaE^BF<+**JEL(G#&ip_6ll*oZ?r@l>t&y5yH{}9+R0to}4HJ%OE6#rGRGksN
zoC&>QHjI5Zv&wSASc>b(0o6R~CUs(TzWdsR+tii8<cfHI04&T4!Z-hAWzm44G_7ma
z)`bD^!y-Ot6av)@@^qqC+z`(mm2N2oiU}N+Zqq%n85QPzskl*IEO#03x|eOy?<Q?N
z==PG9U;lC-9d_*Cts6jQBghkXXYoyOko^qA^PY5BrI+cD$#+1y59XvkZo(sTa1wRF
z=V59Sn)NiUE<)d`dx3nHk#>S|z0VaFgf)Hb0E%<Yr<7AjDP)ja;nv;=$@FtD+O@&t
zMdQ=d<M=q(Qp%i@M(+|TI2t@QZcLeWud<bE4EuH-14o%&4Pam1g&62^1mE+!>y!4V
zL(H$FpHbZHrP-{Wq}Y`EW=8><g5Z*Bh*Bp<%;_w7zkvJ>;&r~;8sZMUl5K?ArwCGM
zT6sc#c>z#b;PuBiq0>=Hw`vc2!Is8&b???kcD$XRU($~E`TnR3`4saO_E2t?hhsNJ
zMl#-rG2Hp1+y2GdSW|_(;3h1*#6fQc)k`Hph@U{&<r1>wzsQV=Bw{y?C(YBJMc1cI
zd*9!W-pU2P**L7(LVcokK3Rv5TPWpqg{ULw;CpAc_HuZ{+w5V0c6gcF-wV@~{;;A3
zcV!mzlfscug$=fxtd7p}Yo5g;j$V2do(Nh6B10c;?LalZTNO>tx;Qc<c}J}mY0;8N
z&ZmV5lch$|Iq>7ftR`{0J0~n(x~zb@pEPuNFv^3ahaS?xys7K1k<g}Sx%+U31hoiB
zMPe}DYGS>|>%fk7MC1e{B+IWk5RZO&bC1WsF;H|VH_cMlj_Ah~>WL_k=<XzRCO&2)
z_g~#t3lS*COll4vj)xxlC{32#4E|>vAUifaR{0c?SloYp6rEf@58_4X!_?&j68KRH
zXGz0^<*0}$?(lEd^M7Q^Fc;;RA`cRAp%b+d1f*^(B?`ptWT_DB`ndyV5j9!N#fG|e
zy{+}Xua>Zxe~((T8D2CaY;N0Ka`tUB<nXeL{PZTyYz_-%hKO>72HL`MPLsL9uxFrq
zLa;vcSY1SZd9<{{KJqY%>P&8R${_i<N**fTr79-A{&&&z<UQNE;5o_t2<3I^;gy?|
z^N%9z;C&fa>O0-KB{X8vGx3P2<ZGHeP8H6L*f%>&{lpZhCRC=SL=J1~o=M1-#?!wO
zUvD3Qd;MI}HeuOraoM#*ftHK0{A}(NL%a2hsK==vj7w4%Der;^3~I&n%-#q?ezHaj
z2li#3Xf_Aqe~Y4g7zAdd$rE8Ggd$Xwk7SPYe;~Xf_`Z=F6cE7tHKxdz!D*~9*4X9%
zN*EzhfTizyF_c<2^Cm$rr$@-AD9rU+{X}wdA2G-Xzt1g09>NvDQ1D*_H?g?oJD&Ip
zQZuFRYDH-BWCU(;Zfqr_P&Es}Z7WN19n!&qfsAMyOMwY)up5FHC;uLeJ=^!30lHNO
zwmy>)2{X2V`T>y7nqJJOc<2Sft^^Ou@0?nLj|1e%_OnsBa#aUT*>rXBa@^nbSYIFP
z$5_UBSwz&DjKTJeEWZd%2`SH#md5(|HIdrJ#1H6iX;>C5+Gn#H3~#sn5Hel0He#R>
z;2=)?dBwf$ev#r9?la$_(P3spzs_4tL``nkZ#!_a#Y#_yO(w`pMPGg!7X`6jEw>`C
z8d2L8uqG9gCv9deir-+hjLR9R9pJG3>Q-7e+oA~P@@AbIpt6p4>voU1(A{<1cH4E|
zM&JE(-7(;!v1HRh)7a;FEsC7ifz~Jl;N&dbK=1*n@8BHFDGsj=o>vl1`Tq(U<Nqsp
zu!H+Moxhs#-Hr(I1R(rGwnv3?C;qP)IrYz^hTEi8t;s=<cjPy1^`Q;j-2R#D-`aJ&
zEKjK0sGht*42^#Y?lTk)_SU6}4`-kjVI>`cg-Hd!j3{a2|Ino2zRx`vveRL!G{F6v
zXgv<nvh=<z(g%8AaUTp9XQmOz8!ty#$7VZ*kMxwW{nZAS^t(ZKgXI9cRVwa(@FbJ7
zsA(t(xb&qOTKcq0b=|B#FSw`RM^BtEOrb*;cV;*P-=O-&tJE6VZvILp!Di_6aga&+
zwi{_*GR2*Qow!6PUXO}s<ATXo&(()HJ^x_#H8Y-U@52~xq!~OjmS~S_HtR=ia&FeR
zddtsu@fG9TEo*GwRs7bii7gU^v0u0bw<$dk#kpgD6Ns&h4@dtRkJI}tH()38346_|
z-RsPk!Qsn8ErSB=1TR>=<A<=#@X@Ky9S}=ZZdhK)s6vlG*>AUnhqxnFUPfNl&F!T4
zfJK~Q;^4Q9aE$(C7xuWn6Cn{egeviB<TEMtqN5eIf?vTvwdp6p?@j!jZCFp%W$yXc
zcaC2V8_PUZw{hiGxk@}Jd5D!U?<TE0qOEOj3M(mc3^Dc3su2EesiLm9Al>5vYzY9P
zKgY8b3A0rR*#^z7eB$^>EMt5ThYxwQGKge4Q_J{u3wkOC{5-HG1RdPsmp)V45EzU%
zw)`-Pj2y@ESrw(6%%He{_zFDR<;th5#wCu$UKIPH2XQt3%D*!#JV>pk-V%=LVc>tL
z{cz!Rp3_reL38#!@1X1JuyWr|#dg=}z`N*JWXj^zRdCzB-!;FBOahsgOIr+**7uE%
z#h6pPht?FVxwE1?u!yOeQQU0bx5}SbHO5vfOk^>}r&+1wcPkDZhn~3I4CxV_1XITZ
zDwiU3fV$G5UJ~|ie0VPr9Say$cSOXKZ&n|blm*UZ#WK6&-Rt;dctDH~?|J#yVkU(p
znrC2?D2Z+=-At;~E_y#BG@FE7ILIwsI9BZpS6oz)&452t{ktOn_;b1qnq2do(~qqs
zPVGr&n2E<N?G*|21mKU3m%7H>@p16v4YKdWE?Remt?jY;3<ZqGZ#b-Bn~Q^hgWBP3
z)Ws5Y;`=U_Mq|5ejK7s5hxZu&Kp{KF^-=yyp@15popUnT0{q}`NI*R8s4v1#*3Rf%
zP}Jw#fcR>D{m@Gbd>JVMFfqA=q^k)`aVeRzeymx+d!6<qK%wr66O%`R?({FSTt=RG
z+@0{i*B4s$TOymxjbA=j@7cJ6Wr%Y8=R7gyGf>?ygnLU35N-7tIli$OSuVBofF=9D
zsTs!;L9@8iA5mQ!7EzU_F7>4R1~2}=x0j;sh83<76Y_OXB6aX@KgoTIquP-DCbW}B
z(DRt|(tu{8Id_bwR5VC|rvw|!!i&SI4HPk0M^I7K5QIjf%x>SK@kl+p%2@1T_;#qo
zZRJfUbxJud-5d(B@KXU@`uCDL=$C+Qwzb=o{W@C1u5*Z8nC+BM0(CjKR%v^)-5QC-
zR}Xc*lCSW|im9DezkZiEh7ADL@Y{KA<%d8&UN<?`_VZHiN{F$Fs*4+Ee9?~wjtXFh
z4q9y0yKEcE_|Zzl!g&|hdVb<hdfTowUTjp~7&p}&Fmh{cepy!_pBwUCwDMC(=y`;j
zj}xp_-qDR4FiFj$TYU4X8){CALDvb-uwW;#p2y%`C{NQm4@p5P!_CxR7as{4Q|r)?
zBZrEys{HZ9C-(mM>9=w2#9z=M8%TmpCTmv3k$rCHi(b1>f!^P(S%FH!29R~Ec!G}j
ziD=Hz^l!_))}%d8VG(a`{TYi$g26%TZVuoEqTcw=O0VB~rA0MfC=q(L=4D<~0|r^I
z4Wg)b=ilgAJz<+4vsBhq50D>=I5t!R52Jn=u*Mu$8rH70jdyBTDIDV7t$jHR%QJf?
z@x$1wZm{)eM!hItpX+xqBqaKG`X`aDNq1cGU||Y>_JdV4)9(1CI1dVu+8La~Qjj<K
zI|wzfubfj+!dR#M(M#^0OzSc8N9$EH#ynM-4h3eciqJ6vW*yZ4>9HzP162><F=vLg
zSakTjrqGgKNYWoVgUWQ*wi_Of+Gjbm2cUDa$)NFk)}mAA7yn8ehAj<q%3d0&)x|hW
z7nBXjUz4?KMZfv~uIqjA|H5<VpUaNd`ZoMfW#5@heaXz)pB`m@z;A>C!|v;2i>>|?
zV`pdMlUVA8Zx`Nia)dnEdrEO)d#7&U*~6LtjwSklriEEIME8apKbyMc6K-BBx#V%J
zFDJt15#HH0S|-T<7^XrZvO=i7xK-Of+%q8VqgV?&2>P$>p!8fiN?-{%K@(_%(#lxz
z0mnw0Y$99|G|x*JWd2s~(%qm?OV!nusDJblS3O4Sxh0&heDwF@SHTkTr-JKxh6{fU
zCoxkBH=nK6>v)MtWJ>+-1fP!%->g8<^MGNWffUkWPh2Cs|H=EJSU_yiN_^b8#-WLs
zxtkgLWa0g}Q+m6?<Ttt8LTetFO+FZI#kPpmm+y{Epftq4@fcA`ns_-ZYQ#f=){2Sd
z1t)L~jUt3NKymnV^jK@CbO&UYsOb7yKEvGlf8~=8gOCTDReMoX{`6ZhE%H*Bs51Nc
z?U^;$QelYglAh~_Sxj1t{m$N5KhnjqXuzf73`wID#O((Byls4WGaNK8tX?_k<rES}
z*G0H(f`ZlhAFmdUP>pVA<zMLwUVA#h&Yhq}ISNuqWo~bU%PoeAmQRoF!YFRH{Q|Ge
z;=#9KtWzuX7=dDQ2m8Wr?sDapjd-0Z-wgWCZ!%1xY%R@9{StmlAxcp@?13%dFEFfZ
z`>lRe^_%9Ave@TbD+JG%Xin8jY7<wk{6r5?8>jl6oO*uwC6DKK>;<=glTW`X%Aq?Q
z--AXt83_LPmsVGpb~u@9h$Z??-gzC&-06Dn__iBulN=?sVE+&(ioIx_hF0osk(YKH
zzx-V=e=@C|%<Df)cJ)Sncll02zS*byOE>;R9moAs;)96eDezf7AjPZpY_cb5Rc9|{
z&j0YQ^`Mx7_(8*<UXD?Fg;y|w$;}PSH~6$gb+xOT#={^pWzB;UZ+%B}LJ@K_9;usi
zF3RCbMIw?In?2Y+v5mi93$U9lrmQA1C66~8%MrQQu7j0th$N2Y3=&OjkLVd1z2tmx
zoDNQ(%JdS>(buK>;X&l*TdkdUEi*?V>Oa@*Po=hTBU;vV?yL7Sdqr|XF==`9DHk}4
zlxxd3cNJ>mZ!$kET4UcSn)fkK>}5W}uj}WfsHt6%*oGZcY{Q{Am%2eXH*lG5QnISo
zL!qJ}ylHv9QPZ)zX@aUS$9f+``87QE|4{aqL2*S*+bBGPySuvwcY-^?g1ZI@ZeegH
z5Zps>cMTHU2Zs>ceQ<a8!+oCT$NQc7>aKJCtlhJ!_tdJ@y;t?VcK6j{X8||tz2{Sb
zmpSuDLi!qoFI&34PVVcZISRJ5jphkgD)*TSMXgdXt2WhubzF}4v&ZiikLX3~EvHv7
zcizb2xa;tZQc2apptDo2(?$8-`oY``W3b7s-oKhC&hhMUc&(;Bc28%guZYkMk=JeE
zvtVb+?$UEpAJ>yqe&N^qjOGL!qXg0}LIvKJPscn2-rZ;Th<J=rY4_H*_F~VCTUUJ#
zsiE?#W?GfXxT0570Zm>URc>O%X#LXJKKVlzs<b?19m&q=CLKe+-Kr^ClYj-9U6v{I
zclj+eMCo`P?V-WRKF6EoSIA#90EvI*J-vj@<8<$7M}Gsedb8Y@YaA1&#(oH18%)`Q
z9)=73$v#^!_$*lsHSC$Sieg3`Kj>L=NHla{9UaRGu8UDDANMzpm;{v^<6a0n(H+;Z
zhFDbNHFg+W|CtZ(ye9i15Ki_a$hG3+nI#lVyCywA)}y0|hPNrd&4Z5E|MedIb9~pQ
zAy?al9A-D%u6SjJ-Ga|~4AWme;jIt-!L}bn6jw`E)nel18NEJQa(Urjc%60ln=OGa
zFofbva=MvLtmST5xhqx0oSUvtx$96xtiU&^H%e}lsLCfWoZj+v!6f&aV(u3y_<EwW
zCR|q@l~@gD(Ap*4^l5zIsz|r$cUxcB$y1M?`8?33aj8as{s7CIV9S#$b!+E=;oFDO
zCXNB0Cme_RCMeC5hLO2x=+Vi#MVP<PX??XshCltQ!yAU$lJ17plU=*DX&mU7^t{%e
zwzIw|D&9Y8s8Jxi`<DD?aiSTIissU1%#jy+WbQ}h0K^yjy}R{@wjV~LuJ)rR$OIPD
z2vO9hVa#vex>Qy-{F3qsQtiI)gkm}C&{$*{ig!oMo`ri`H3{w*X3e8f2Yw?pSRGgL
zQ=N9aG;SoNh#z}o>1@vrU!m%fXwJI!nPZS0(A)~N&9zJsso$PD%NkTI(Qs92L#YJg
zbJB9cCd2g?xYrvruFlqe*nj2%tacEyv^h|<J!#qL_kI{-6{o~Mvg}7H79r<Y4drG8
zt?}cD2we^g3boWVng2>`^Cb;+ac~E17W=TmoLU@rh}3;Ri5cHC6bUF9r`(Q#RA=^x
z{tg?9=rG9J>~LJz;;pCGx?jFW=UQJ?KUw8G7Kd1_!{&5^X+4;HS-i``%;Q-OKoYvm
z;hYM98(fIXTX<!)UQ)|l2_Ruy7&k9^`KYrTC>`~}!kji=(;omkzvR3j{N(S@B;LdR
zWVzxP81Zyc9WMD6HF)grHMbV`{?Tu(9&^*UI!LX9rStl5VXxuG;Z1zhHvYjH-sA`=
z*2{1k<?abRN_$6t?HZeFrU28fxAdmW8E0)z2FGE$d_==qK|k^J$9doAh0PB*^S&kF
z869I6b>ZTH7sE}gPyyGU{>xmeWf6fHr29Ej1-?4g<1b8#TXEeY0WBG8sw=CmC_dYq
zH2o8Au>YwTxpy!AI>`k9n3(|nOT`G=f2kNz{NIuh_5Zty<bO&<vJ%=<dpYq!<MQgU
zn3^<BE1B?d%*`w<0A(6QI(S?V^_D7Jv@-H6!P3o1A};_1itBMX)i3yj?yj4x=e^yy
z@g@*JFsy*&cpeIt%&q?uS#qe&z5fF<i}AIm;MWn|p`n&=%RS}SRW3bZ_aa2%^mhoZ
z+i%~@g%6v%?(cp(LKs@PB@c@ROXn}b-bGQOV!4l)aw~2KDk!<kl~ZmK^Jjh{ZWf5H
zc_E)}Sv7PY95Jmb8D5l85Rz(ETT4(P>Qi2w5p2vWaNhyvZ(laq{tE8m(2C1H`H<{;
z^M5nq)C=5xz|Zfl!h+8ydq`k9<Ng~>CN==2J0?=5sd9|OCRi%3jdm*Jj99LpT)%oE
z{~aOEoLy#S7*$WyBC3Ep-ir2EEJ0nJWT><SGA*gnMHmds2wHmcE;v0`MESJV#b;mz
zF~eBVt)7@r2T~b>SuRK>Q4VMlig1vXzO=~bC>5H}RMhO+SM`R@tJr$21{Kdcx(Tkj
zDrFlB@0p#U{>QRp3%0pnAOLU<^WQAX`ClyizlPOvwzqQ9^l-B>cl;mg7U?4UY29SK
zy{;*9%bO@DAW@?wV8tqj{&0~)Q~V(VvBilmq_Ja_zQmDZ;Bn=~o@k`_)L^H(Tvhek
zitx)(ZSv`6w|e37Y(wMhsVC@n!|bZ|-EpHY<*MUvrLL~KHDv~BvZqC+w>$BGJJITZ
z`)2__WpW%G7dR1k+;i2MIkj`t`uv@JePRdmo3~^Nq5pjWRgjk=<~o|2w?1f{rKjnF
zT(nc;2d4=-P0-on`Jm*lts<&dxb^APoW~0rpL=)F_G0k5?yq@mFeTHhK;*e}dp<~f
zYX1F&)bR0~Q0&<X3-v-*vONZLy^C+WcC%59f9~veZ%Fy7`ZaMu<GF+KEqDFw>3oYS
zd5a$YQGWGBCS@Mx%f05#qZ)AP$wvH@K0L6$>*3;zWijynB8R0n@Zn-T;91$qM|b?K
zVC3!a(%m>9ulelZ;*)55^$6zkJtPh@STJV(8Kx^7<$;7a;xiq^#bY5=ctzm^M`!Lm
zeQsDTyQ~bMrffiP6dtac^}a^_r!sb)n>^(dx2}Iv87MjbZWW7ishm#gG=k_?rH8eI
z@l|-~!{jpL3d*=xXFV*hcWtK`_BstW=8$2KM@WuI>T$k)_dxzjwh+4yp$I}hj-U^P
zm!+M&hMcNQ>aCE_Ei`D^nte<<jHPFj{Mw`f`bZun@NIBlijE}us%TjWtptQSql9t8
zc&CRfsSV=hTftK)+$t-c@uDFotxZ2>>?fuduvceBV!5<+QYgxQGVb}_x!^*RPN9}?
zc6nfCF#b0$Yu~zO$v%gSJ>++-4BIMuDW+*^%V9Nvmq=ppwn_fqyV$tnKN>HS#;$8b
zt1m&`8&!|)O!_M+#mS<Rp9xDmsH|kC=jJ}nvi9Cgvy9(c_i)|Avz8zV#ho4|zJ4(k
zwrcb6Y_1q7!ii%D&B*k1d#E+rtw}odc*(fQXEYk$XWAKQ++TYRvoP7o>8J-#vxZtk
zNM`uz(wKI@?2LfKCs#^K8)b#sCSim$f-XP)$!fvU`tJMN|6uKlg>Me3&{1^T?_sXJ
zB{4@OdU*yWycm_z<9!L;lwGbPQp(wO7K);@ORBE~Fv$x|4|d6PgVP0D2kmBtuD3)-
zZov)}{!Qjo<ewOb?8VZgMMB3teu{CeR_IBm3M?ugujQ($GTg<d+r!QV4;$c-lQ+0A
z6z-K!mkE)R|LggOnlnpT?o2PrpQTricw*~&oq12;_MW<9Pv>2?^M{Q%-0-vfIoF^?
zzrL>3xMkwFd(SjOB)1;l$#e^jOs%!5#R6fQENt(vy6#ZpfkVlpZ}w#Z`c9fY?j57=
z?~Yg!h5|McMjpoezjgAYv22z5NF6IFWNPSo85Rb7ELUa1SR?Q0sjg}EG~Wv&B=s0V
zIUOvT*tu40EigA3<gNuHGlssB;3mLP@FxtY6#r;W^wu~@j8abH;45Z>7#GiMN@^1P
zrTNP>i$}gyd!L(hIc%YstdPZQUS`u}%SE4GQq;-|&1H_E`|;8&yC^y&C~)CT@g;4_
zd8(=8i?@zM#_NDT>|E(?2s7(>joLe_uhNd*2YaSL{S`YUo>LsQ*7&7>0M0Nv6+bR*
z6z;gOnE=}%rL;eDlg~Js2DUExztevw>da+NZtJNyRE9R>F$if%r}xgm<kY84#Rjv*
z_&Jq*p7}(~%!m7;PMd()OnH}Zq9>fLlp`qzt)s*{t+QJ|bjgWO+oI5%8$r+%b^!iq
zkebBZy10jVO}iHqqt=`7?0j#bXl04VY^28hflus!&U4!@&|~jQjKi0tQ|=rGUMpM*
z8>MCb82Sv}iKYemnFwceymZ^w0mtP=2m3N&h1fwv+;1~EA-@@ZXA{#PSe0>G)fqXt
z{b~t{3LQ$S2X@T;mYlWRR6O9bimK$Ysu;M_M)`w|`N#H~bp*GfVjV-Eo}QUfPED6Q
zJDtKGMZ-XABTvKL$?q>&!wCu7UlxcH!<hJU$~NdrMeVgc%Y%*kf_P<CkY#nMulrbk
zgD5<fpqYT%`eu&hM(GWAKF70EV=;HWHdZd%6ZfS6-5{sgyrXujX)cVi51mvJho3G<
zggYj&xpVNdt$Q{W_Uff2w>&y-qFI|tv1@<K2pp4q8W{ZcrOsyA!zuT&thgTIN^p0d
zWQNNQ#G6pFscfk2CzznDf11Q2qWbmR&~w!mz3{~8_#fVF`@*>7N;(<#)8G`r&5gm6
z#r8h&T$LeqHt%FhJyTj^!%IP7jaMrm|0DDKgz@t<(H|}cV-ofW84@Qu1CcdBYww?1
zxRxKUyekT#kH#*)Rt?Y231+*L?AJX}#~)1}Zmp1IyrK447HK51?dk=0IrmIU2t1oI
z@CfVFK||{k5lAM<pQh(hV-0WSzfHXPYSz{l6`Xz}w^Na3tUGvrw=EI-0t?3cHZ7*S
z2bHpkr;+y!b+edEV_+G04+vauW6I8rk@q^|`JALPUG<a1nZGe?xsJS7arVQ!#*zcD
z!25#TS^F~PfuJ_iG5lu|VS|Nr?5DK};=Wh62`a6>YjGE*K2zRYcU#SAM<#3SK+HGT
z(`YtPpeov+xlA%e7~`f8Mm0NpE8bzS8Yo~Do~8tA#T7<&&|Hq2DOM)CH#(6Co9WU0
zIYsh7@gHvuZ}1<A4xtb?ntygfxirCxR!K(9IlXEK+KgQDkm*LJr)JOGU-slE>LcrC
z=D%_&>aZm719MD&Ah5~MI;Xfg_83%3u+HV8jy9*49JwH$N}w{kPPu+NE?h(Ca%a|I
zs-G4q-4s>QW}2^6*oWICuX8MDw^^85kjN(A_9k}P8HP>kxAAnSqGK|@XC^zhQmeQw
zWmXtITlI#S?Z}?P!t6|JR&ar<pvgnqz2nW4L0?{QKmSq##e#{^>hOHRO`Y8QeQ8}Y
z^u)&|Ms?YD;LOKwUDGF$D!Gb^lmmy@GPOWmpVc!(j^U&K_21Shw{7YI^PL>MZX;VT
z!y4i*x0BleOI|7RrJ8JOcdcVtq4{Y}xbw*G+!q$#@p4uDn)RM-6D=xJsDulVGWz?H
z{JNC>))@YEjnaaG{|)RF;+Vz@3HE%~R^cTLp|l`C_L~Y@?jaXjp<uhGZ)}wWAzC%#
zcI~!WQlgj7+27RX^tj3OM-n)fb{JSSCW!|<Xq$*?+l<y|#CMmUAb#YXG%TM#L=GF3
zr54qYb|lDEAh4)n>v0RnC>l#<L)wDH)BFQ#e))!X>Q+>`k%CZDAn`yk8e*EaHlkDo
z+RL>!-ZvX-(cH*ral3Tiz|@fE=vw~hNP=na@Js$P=b0@XZ(Nn#si+wesHKS(NkBF7
z=d?5b?z8E!LriZ;m(ZE5>J>d3PCUQeT5Osdarqb8UDrbU_)*)Wk%KmNhaI|N9ZvIh
zwcNW&Rl?5$zOFf}2cm_=Kb??TLUVr&d|nMBySn4%u5*_ElmAb|?=kBbqca|KUdp9i
z<LDtz`JpQ-$XL4DlZtKLBE%@}+a;F~i-_@^SLFJjl#;gccd^8g#kQ{!ql?+dbDa~C
zmEH)1DZfXdI036aHRgI~r1a;L8r-&|u7+Br1cj1I{>sc4!BNWA>-`B;XYSRbZ~Izj
z9*N(J5V4%^ZT_pWCgky(ZYir#^;i)ukF9+*KSmxMheq5mTo`xAFRpt!bj<-S`P(He
z;tyw65|MX%e&>Ha-4!EKE<`q}>0D2_Ge5pvFDiv1Z6{tYIx?j!Ptt+RK6D*zs}lTZ
zo1h037>dP|u0)Am64ULxR=zDUJl{#E79lF?Ci+>jn=eVvE>2vAs9JOYQU1OewzD|g
zVE-$<wBGR(X_A#>GW~}{EY%sF`%!A$KZ4pH33Z1vd8okl7wx~t!TqkmNoKXBP5j=i
zz84xLTaCu?U7E`76ThOy)pil`ksDsJ5qeK`TJ`LHw8oF!dv3!WOZ}Nev;NX*bTekC
z8Itn$w)t!eSu!RvdF_2TPu$MpIa{koo`tdxqf%RKkl1;}+q9{SZSBJ=<Hvp9MXIc_
z?rYNeW@!<{HrA8f@W}bH4<a}kVy{_CdhFA3ss!tD!#oRmjS+bTCyY2k-$##+)zlOd
z=CR``|CGLlf7n#9dmtEn=ARpCTO3<ZXvExEdBsYI2p!G#)Hy=B+PqBeDVJIn8#P(2
z>Ek2RdM{fl!Z-Qg^c{sm^wmdJvg*=b-dSDUzj!OK$KsBM<X}&^%rsYOtzbvYZ2A$)
zQLAN|vu2XX1(kx_`P?<F#t}IH7qg89qhjXSq?~w;PpG%b1!v?!fxQ7KH-*^ffXtyX
z!qut~p%webI+Ij~dHy1kT-)cKd5-N=1NLct*|Y3_^)~4ao_d$%^Hz(Z=p!h9GGl}b
za4KSiZ25LCZ=$^Vtb`7&q1*>~&P~@|OBJLm3KdSJV+eXtpt9X19avA0zfI&@%mZgM
z{5f$0lK_E5XKnbi-J~tsaAOiC*7?S#>prQBC&{ojwt^lKq$Z`fYnHb)&1O49n}3d?
zYPnVY86|;~H>QVZL0a4bSl;O!_-k^yo4W%j&Z^r%q2(~k#4p5tg?YTG-Lt}<xW@j}
z{Yoisf9AzUuEEe%uMfbOtR2RU$Ii3+w82M$&6%!lT`3n*OO`Z%!X}_&5mOr}`wg9+
zbaY=}&Z5K>IW(HTFPh+(YtDSeRyO^tiRj2tvp(;fSKr(J{sU#ea+q{IilFC8r~1}8
z?}&=|YvO``>i8M;J;e*1U}gn}?~14T2T@f=w>?RNs+xJhL#>PgIDSE<l)d^tjMQ7)
zcHe}QVptDq*#B`?K^zK}ljC`gzXtg-$;Gw-$v?$z=g*|U6L>GvIJhh?3l(ZD!-jhb
z2Y%Z>Kge;D{C-!uxBp9`CDO0jTEZll#u8C#;HH#IEYe^LAp?|<7`yb~Vf0Auw`k>E
zTVY=m+f3G9eK5PRKw&0?GOx;95-MwoZXQ~j(G<7gnlgmblzHeupjU2rCR4s3yFx^5
z(lg-Q(;qQqkWRtZ7?JeUK7hNB(A|)@cUf}Mo~3xC(s&i{+Wr7{;){CX%X;%7n7GAn
zs7o0gKn{+$rwf?3(%rj_rpX}JZa+mM#-y_Kixg1XiBE1;=w_R0&~!b`Gr7CmWo@|>
zA0}`B%;$9P1#Er<#N;}BGvM_mc-_~EM$`vTY>w*Ib%E7SENmw+ls%Mv@%Sl*NuL5S
zyUy}wT7&Qp&qg3x1Yv?CWS$q-j3d*8!lk5fuKoz)trIES>H8E56zF^t1s~wG;g6*$
zD=g-Rp`qnL$gU^Eqh68NPxwApOuIy;J0tEb&35jx*|KxR1GBVDQ^hUQ9|pV~7rjEY
zvaQC*$NA+>ga_RjOfY-r@--BN(q+aaPv|V4z2)ZS>t?K_Ni~v}EK&?40=+W^Ypu(L
zOwAZNhca;aSF2x8{sSG5NWu86Vgdk;RR1S*5d8n35#jzX(82#NC?sj=@zvSsf53x&
z15oO=TvAHk>A&mi>+SlwI+3<mOHPWCZwAqh(J6+OzViu|$Wqh4(-L$)yh8)HXoHK}
znTf*}Ln{g0;0>?{<jd)h5Sfs>iwk&Twj!sn-0tSNc0J&o#oH%ut-?q9X076<Q`gqq
zGTVsobW8cX(87_?SHtO%fNe&}*_ig$vrx&poz|#VH>}0E)m^pLu|_#zI0yTY=Ya0?
zV~6E)oXznuQv${jRFfH$#E?SrhM?9i7ZtySxZ6n2g3(Y@^yHxOd6Z2gN1wgBY1#!`
zzAh4<h%Y)@rHe{S+CPb|=U?m$zjFV^)ml8DvU^b64sojMSWwv9>8mK1)dN-(sEz7m
z$qW_&ow=^HcdV+*k!~n%1?Dyj<(#ksYJQ6m6m>7psn;D&s;^{nlOcS`iry;(9>xdh
zl(QN{eYRkfoS_pRM7LXt#MRKeN(maOW-cUO%?b!#J*;keE|qiC3TbTMyC!&vXGqWM
zgnM*PcT6%MMPJ7cpm};$#h`Dh@-fc{UF8Yf$08*exncb<cDmM475!3K?Isv*=QNG^
z!h(5SNjuRO*(eaaqY%4(k{NnoahXk9!w`MrUcD$?=*!hvD{;pr{OjIC50bqvl~Xlv
zBe!2oSfjKe!+xE`OP%3ai#O9@g*2j_BJz+)o5n6=DxF99p-BhNN~Dc7QRT0LaU<>q
z{4~9Q+C{ta5Ci!&Yi#aThR;{w=oDr)Je58MR#*4&@yb4Pg}lV}nX;r?Pn^oBKhRZa
z(k!DqhbBF^Fdu17tnd7b4`k{f$0-tDUzs}QSp@m%#8vWschMow4jop>X2G8-W5HRI
zd<Pc}m0-mggqT(PhaMr7x6npPZRTukCcX00<^xsN!QzqPpSKvsBpM7lbSnONNReXC
z7c^C>I>lyMY`+9Azdr5QJC^S@d~6EmNyf#ecZb*N(41bSv(+y3>^t{#{Ie17Z+*=_
z@Jz`0^;rq?XWz0yo2uni;tzgV_kL*#p4K%LDN=1L_}>uJVA7U)DngCP&mTNCz8AFg
zEs#!!ez3BRJsOxAY_`<oqKH}fn5KYRusASc$K@3DQ9<e1K;$C9sc~!sBHpQ>&mGQ$
zDjDS<+#{!%UFe8|ee2w6A38n7u5D|`3R1P*a!4f@PP_Q-VbqhvE6Y;;6i^r}%LP6Z
zQzA^`r**rUDR-6BXe9l0>MEJGgsguasXtO~nlP5+$lNf#|D(!Rb@q2<Aok~UR}t*b
zP2+J(-_ovG4(v(H;MgmSLzZ$h4`lMgZL^5DiIC15BoFmFHIw0TO25QU8Z8}ZZ;Xif
zNXv?5cOF`n*?x&Y)WSljN3!E;(diAz(!tR@C(}GE)8;_#s|_vuY_%=Vet>y`S6un~
zCyvx#UVlk@*lus7?rRFn3^D_0YpoSwjx7+gT^RMCvY4&*i#6^XgA|8>lkZ3X1yQP)
zddzIiYBf!P(58lv!5yuM!qIk?-GoLDf5;O|IreFrqPkjt9``b)e%E3my_sap9>Q7c
zp=6foJ2M7naW7MjXc0vWopGn4`G*c6`^L#pRlGm_IF3#-vq^NZo1Xm9vSOhZzG>?_
zl~aAJsazKfVG6U&avg<R=8ZGFKgkv<6}cachl<7i>bYGfGN&XbDZev~8kO33wR?4N
zR3TWa{G2?K;tydguE@|k#OOnq`^H*Gv&tYcJIar(+enH>ON{4wv!7?Ay4@q>I*|#L
zboZ${={Z(f!Qzrw8B%Z^lM%~`l2~A7*Re~3k9{@BDQQJgM-&ml<09cQg^_&mi1cKy
zPryi?GKjS*WTA<!axIa&N*`T7qSrKrlbK!Z#->o*Bv2{Kae`<}8>(#e)O&HP1=5nU
z9d;@el-YU@|H)C6jik<JO|7j}!RR+`G2kq!a8>v&8fA=cvP>qdl1aPEk3R1h<9S(H
zkhg9T=zhfv&m(N-Hq@wx!}g<<rZ*+AdDUg-!`cr?70|}1RI8Imaa*)Ps6c($9Qv$#
zrW{V5RhuMNqb+s{S<%nw*VAJ<l25f!;O3-=qZ<d@IDlbcv@4Nn`n0X=Qc0WQP|w7d
z&o7B73@?19M)7&|BiOF0rgrk$0vl}!*1omO>|`mcKTzPr`lmO4BnS<kd}$fIozkdb
z*Fic3x%F-u?KMar+9KLxnAf!ZXjjxksnnXu9Vbagy9JvRC;j;xX=vr&x6O;udmJm)
ziLy7JP#hO!_p_QoGPrtiI`}dcqe{#@vER>afyMNw%z(9&b_(AAyp-b04thd!<#p1h
zew<|wOY=Y)Ux5*p81_x46|3f62Kki=$AFsS!P1t1tbf>B`{tZ(N}Y;Lq<EHXgsxxT
zwpDdU7GTP2>Dv@1@^Sk?HT4Pf7KM5BIXuGMg8TTKvJV@iQ3Ys`nXT_TYu&fKeN!$N
zUvAZ@q?=XS7ViXibjn?COoIHo?Z@Rd(+TU}G*-M2C%gmq4oQ0#s%zbs2~l+0TkT@<
z&!n%d8ejYDd+0ZLRJ3sC=~+%&nUz`(X;8id;j$dILTpvfN2zexeEHx>H96;#6z0aK
zC&xQi?3|062eHIpd+5uvhD0?Os6)M&QE$>d3%9v`|5&VUED&i`@Tx}~7*ZFriHQzc
z#T#v{MO;nQ{5-EBs)86jGb>uwO|gi6sLO`9m}0+5(-4DKPnmBK<!3mKI?Y^!HZ3H7
z$%kq>D5#Y|TJdlG%Yh<Dsrw&nQunZ8gy|g#x++#3!>}MT-k%4GOwWwPhJ*%u@dRIi
zH}=%&A!nS=V)3{C&QgNO1@sO;+KML8_M~=o5v}td*=}_fuC-x#LOcvuEr96hQ<lbk
zwko9-y`NmAL`>_Pe@<E8U*oS=Jk)y)fHhH^egqiwjNz-tK$cZ#1RPtx;9SST3(^h1
z78gdd=vn`%jBwb|_%uWCsT}*ehS?|74&a7_fC9&YQ;U6<ufr>RVq0WA&BvcNK3L9a
zj6OVb@oa+li2poa<Drp6Frb@%TjM_h7I6rkwP>;c<>UrNXe{Nd#Ms*PwpJ4e6(*X?
z;=O<Vx~9d#=3I`sV`5jT50Bavm=ElHN2A|-KSP|gA{X+_xDURruH?AOY!f2RN?1=m
z$Hinug41z?%L~mDY2B1n^NF(KoV23XwM2no=h{}^Ig&WMtwMg8By%)%(1{wobMkAa
zqYsVDXkC<M`erSBD*e^@P_@c`Igb4BBsW*`oimp7A;cw(=mEJvKH9)YG->A(iRwYj
zl;rAcfX_j-lU7}?|FG#e#%<9~GrkQeO_jjX=9Cn5vK7-OS-RpVv|-HYztxN{=+#*t
z-af1O306PVhg`mxU>Bg|AH(F&I83U~-q{&l^;fC<6#Sfu?>c?3%k`(vt8V8aU1>eW
zGDMXyN*U|^$4}#w;=QD3<GUl*pUHFd^e%;G4&1&1%7-48mLeKjTKA$k|1PcvX<tn9
z*Qkn@c%j#f>^6OEqzy+=G{2Kdkw)AA4H1H!E>0ObpSL2*g6VbSiEO5mXew>F<)bx!
zcE@-9DHQn=7*qUFQ-RMr8!`A86;b&(^X&C3<hi=f)`F}tvbkP_DPgW3?gkP2_t%tG
z&617na4xc7$t(OOL+{@A=MW}u7(2zP)>GhP)rNi^e_mppqe)qVP6LOay-BC>PTNNr
ztFwWr=>r+P>+-M+bdI(zlHBmxU#7Q7xPc$ubR-yat*NBL+7G8)w#us$<ta>2mPeC3
zF24`W{-O<iLPszynINXBcy-gNa>nPI10jCW(XJ<&@<_0-!%jdo@4^3<>XIm}qHDb4
z{P%D9TCNS>@A)GWtd@iI7-nCIqDa^|pD5>%skY2$p7=%?$>Wi;Ym~AQiuom)%;>*_
z1&vzaOiH|ezeJ`5n#Fo>GIi`-yi9^zcYn#Jpa>ItZ^8;v`tM}zmHJKY6;@&$#1qSJ
zgf9Gr^JvkK`>E?w7R>kuv^p3pZ0r{gwMP;tjX-@af~Xx)YhpE&3p!3|ZHHF{4w;?n
z-qu%YmrDCF7~vRF$X;lvauK}#=$RbIpPqD1ELDi;jeoxV9w=V}nigl-UL!9{(AO<V
zV#XLy)FF=&H%)wgno_Q+y=uFg>}cJ#gpH%3v{h0UD@;kH5^q)hawbPKcQB=SKh7@-
zEMESI{YF2$zOWCCpXJ{=gj`kJP_vvYZIiq5#jeYuMS4@}L-6PGi1k;poL&*P^~@DW
z#>)=>zQ-QQxyw5sa5h4W37PsM6L_<M&6Mi1BJtO#YX#}HX6CBiZMnUIbaU^YJ{jtv
z7&Mlyn8awy!hVb|ViD^Mb|*gm(vJb}r@c<R>Y&NlzL&Uca-}MLiu&`XuyJkvqLlif
ztgnxoh98ow;i>&WAnWY&BlILRMt2rwv*<q~G0YoVN|{-(rBg*QYRyav4o7_tBUN`g
z9q_e!1Xa6n489`F&zRiT?;)y3`$fJz={6k-Yo~pHf9e-IzT%i)j{KdnndWjSzK4~w
z>GwBHJ2tc#76|K~i8IZ2+2B9N&q{2i)yPp;aL-!VFM{skm3%<`sMCqFN%9_!Ef1#H
zk=TA%<H)nkwHxfRK5B)G9#XIFV_IWSdnH$qDAY!Fvbx`0swEVznt5pL;y707pRUv6
zD;{j>{69`E-<}mHCwNUta(sOpmTj+B#b)hmR5kfo8RAt|J7M+;Q=OI1&#V2=Dh%QC
zj&od0ww&Dh=UDr@P2Z3$3aV2PW?nrzSo7tEhb>qfpa&%T@r-qD4#9?ehHyb#_p<<*
zaQ-MRB-f5$o?Pc9YvNNtC+@Qlv~4186%tn)Yvq;s?PD))B`)z;!K&iiD)AcZ{V@0r
z?j!s&{JzMnaLmR5*hbHWd&M%V|J>n-EObxm^`kvUudn_dPrJai3E(wkP8RJ9_Sxd7
z6OE(xmaCm|{|)SVf*4TtEig1i@@?mQ1RqKXewJKl!@1WcdYi5BMc=N5e-nOBkbJ|w
zMhpr-+Va8L$3%FchEUqIpizbf_~vp*RYeBOvE^*woLkw4n41}opK}gi2bqLrBl%cF
zmjGKx!Hn_tQdRIiq%Qc+eCPAuodI3guYQ7$H%R+$j6<S0Zf_2&edpE_l<@bqkU@YL
z!DSrmtJnP*G9)MbLKOMx{0pQ6@}?HDGM&43FvmkAhP&lWu$>e0;D@oDje7qPve$cx
zntMhtVH)o3gT2&6^qd0d#B<{a7B_L~2-;xn4#dB&MtI{}V0?q=>L75d4qiE;zC(Zr
z1idkwuRC;vY;*;^I)k0z{YbahFka38FInI-n77sQabJl*j{PQ>KuYM7`5A0{7y8R1
z6*LU+Mt(^dnjI(cS^#}RynjP}9h~Tj3w}dBcSd|mJfD7FEbr~84b`3gkUxfx7-kCx
z<n0Z<<t=oDu=@=Mno=9r3DZ&y6M%kc8usE0epQ+1f)Df~-Fm`+f~fCAhx{o$0|1Y2
zfLE+%O5ht8R88WI`T7mbClKTH{h#Ouo>(UWW4=9+Lc8Ff$)RsBuN3E);P-{dL&Slv
z;?SJDJB|glz>pUa=z7;;GPv=>j-&jg<F>4CR7a9|+;u_Bv+dn?(;z?b^FN}H8k&>E
z;9N{e4DTtq?0R`g%HU_gecW6%rMKmw#9Lk{|GCY!&!46O(>mxGAdvA~=m61|@O%|Y
z3Hz)E*~;DXg5XY^%0RDdK{)4auxqd$+nP_=5H(;Yz>5X?6<h+F4fHDR2;0!F@#VkH
zg!N+I9)s;9yzc;vBg(8bZ~)q|w%U;H{W)_8moo!TK0($I!#_IEVlEH$-WGxH5MQ{V
zDX=EM4#eYNwCcWRWBAuu?z4sY+?NJOHS8+@Iy86-YxP=-2@H&15x5QhE)I7>fwB^^
zPJtjgG;&Mxs10uddrjT+g@ecFdk5h9h#Ew6A`Sf}VnHO`349=hs7W{nt-*Al`@Op+
z^e8n2{rXLANStiT7jA!O{FWA&kaLm&UPpU)-<Zq#7or7kw)4Tf)h(_nM(~>qgi-Qz
z7_3&C^Y{EKSS{ry=LK!Sn_)XU<aRuC#ocVL1w0P>_5d*jbgjcYqUP<%LjU8NX5<}s
zPcK$APj19-C%S-6oNHal@rsSOd2pPcV;8~wQSRA|?HxkBFYQtX^0PqjD}lteBdPat
z0PEu&|Gu}#{uwwM6!gY^zK;It3kl>nUO~ARgWN4snt73Kiz7W?0_8g!#nJAu&&5&5
z9+u?Ze;_<>fpZ|Ot>iC{bdL|r(45c}n~B%D{rNp;*ZUG-wiBuyx9y*zpn=HG9Kmn+
z=UphGrm$~E&_LK{=X~*XDe<nDhbN5fPSln&bMipSYf5mepW~Z)cGNMY<ak_dXF$-m
zJI$dNwDY}pe|$ETTCbjXoxgP^dL?*yC7)w{-#Xu+H=t)i$%%N-E91UocH<kGZ(z6J
zD@q#({3d{W0R8JRn0!ly=&@~Yg9_C-&@Dl%(Oq(XEF>?XJ2Ee!tYO<5CXRpgWErFC
zr4|yiA#$UgdczoN8cQXM<B9det>HoTA6ov;1V5C=wrMrt(R1kejLKBR{nBXv7$(;5
zgbdb;?f89Su)vg2;#KDUE5*Gc#?x$f%e)Y=$M)Afyde(AY1#hUSEBiY{dHnn5X1Hz
zARGRnF7J(O&nR>ccq%LMuI48+KGtE?v26r+mRe{-!t!2fA$mMJGU{=m9Pkz2m(KRQ
zg*8D5|9ApjIW}V7{;=F4Wds&Pe8u<=W_X*T(=dYz0Qk%NpP1qQlX{r-zhH*{fAYwZ
zwC&w-t?&ZY=thf&lZ%T&rU+2=s8nF`lA@*}wQ@-mIrtlpv`7AUC$gz{ZdnJDhZ0-0
zM+cloK8}9Pat-AWq)qA3vbhKPT?D@Z#rN+?XFiX&tui?3=PH-%t+wxF?yY3k`JSy)
zp1~}{2?X2rPWm_u<YJAZx+;fnNo8U!QD0n3#rH+w{M;P;M4c(46mCu}Cq>k+2jD>D
ziuFLk^^y%&+;CIssgSJStpCA-Q%u)B0M*s{#N!d#QC4YgP@K;g?ZEt5;~%#G?p_kA
z5{*!OAyM5Kg5y&_Xs!t}9s>E9L@1$`YOP@JDI(189_k+wI;<|n%s(~V|28r)`LHK6
zDyxhm`zzL7#)?({DrxyjvRj{5jz7IkjNlo1Njc#$D%|73{geBjk<{expfpa_)*^gw
zi=NaC;SJZKg|mE$z4C<VhNu<gJ^UbLLoLa`ak}8M)P%g67-p3{+N4b(Csn3B6c1dy
z4c;ONRkReEqsp5LAKyTZ(=Keq&@yI588x|z4;OMirOeccDM<5kTzxCTTff*hvr@Ia
zhcVbBj@(xavJX2I#<%`Rv9qL$8FR;Emf@ZFA@S&;e@;FZ?nQWK8{N6onWDgwMuhi)
zT*DP}j;Ex=h|ms)=?mEIL~teAG%R{VRPZWsmt^x!xXh-R7j2{c`8?|WEi_W$&@S)i
z2F@DQ0D38Wm|A!JXD)5ALgcMo?fz4I^!Uk`EbhilWMYx?!f1Af#9HHUPmiH+%eZLO
zi+aoswADB&rO0tN%>mvqC8}e0b*nEEtifCHKPsciF8l6#ad?UMxM=gJ3XqILsb#vt
z6Z8m)Q{?!hMp%`YxQ>ldNTruwL``*03@AShx%ex8SrFX0l`EaT*66p`_vx$Raquq%
z1~c+C%f!$H7vgZSZt`s@s&G04fLV!guo>^!=qIFpd>iIyzm3&kPeCE^K8|f>tF=$K
z7}OV{@m$nUwqF`jwQ;O!g?9@K{L!3U_7Ed$^hba1u?^wevBX)Gl&BGc>C3v$YI6pc
zB~~kRtLST)vz(Qf95IF^I{Ds{mHqJ>z~m7&J-_yzyoSjT%y?)Fz7saq7^ce@2JRQB
zw+(w^_6RDZBl(bp+iXaZXZ@Z`by=$en0iDx1HWBloX?x_FUq~pA!5;$aK`4t2N%ZB
z>`FKmBu)~CuLbQ9w9l8X1w6eHDH;S0K61j}B5m6qV-)U}ks_(fY#h2Xn}ySqOn|W;
zRpWkIbKqd8mf+5UU|%WcWXKp5tBE6N+1hk>L8LbgM3N$jiVA`uVr|Q4YLjmPhvyo<
zJO}4{=LS+~ys^S`7QBs4#(w&dj0<{Ns@}8-_w>5&AKLaL3Dr+typW~u-+N<73I}A#
zXPu?5D#pb$bZ3J?7ji#~^32F4{I&@jiZ${4w9h6D>N&+M=iN5^aV)8qAzyIc5{?jB
z@%Eyx$+uDAZB%|p){lTmFsX2Mf9}XzRNBJjZ2E7$DcqW4ZVBc2`J>N!GNpE6v&dgL
zsg{`J3c*g2EeUj5{EC*jb0pf+lc;J)v&qRAT`g=gSgu`m*&`v<JHq;&|EE_NgKwJk
zIfXyr8sjLU7a`@Qrr!_ebFR*Q#(RvM4F<76W54gd%|WK;^Z~u|_vG%LDZPD=+dvon
z9*F7ro60lh1ce|uqgdn%RU<deg_^DCC{bImiU79W$RDTln1yv(&$;mz%>Nv*-rZN@
zDDVKlF3Nv9VtN1H9<kh<oPu;Ra+19N^I;}Q*WX2J7XNMa&a-ZKcc=H$PZ(ArF_Z@r
z7-~Ow3$zG195lsfi9U}yZ^dK>&-o?}zu+LM-{EE_lm_LP!sANVj`##hUw`v7@L(*d
zE{h)vemhh?_$4k}pB13G{Ml!$Q^i8zUTHUL{VdaWtYdH0_tbm1Xgu&91I$8pW2TR=
zYu-Y5RU4#_9+gClrPp7Xyx8&YFm-jXGJDa^8vP$h+Uoc*&|2jm#g|3~@==QVFEo_)
z`XBr9XFv5Gr8aQc+e~(EniFIZd%+#0Ihr+22D5XFUY8Qq)kZ8@Qh4}I(8gP1{Md9S
zMEb>lCyPFfB=bDknJP}ex!Jn0PPTw^E+Bk6SNL@!2>z3<x}FLX4!16HJ;AD^k^9X4
z9U_hO!Z~R#HV<#%(-~^t4ZkSSN!$<5{ej3$RiLhay)NO<R}9(fhF)pW)=BJr<V5;5
zQvuzhi(Kr;v^-lGs_N2ap%yJctb@Cz3^}GLwPE}|OCL@=q^1m@=2<S@CiP&T&gW@5
zW?orklv!A5*2oOFKTIrw3pnBQghl>pr&{We<(dzrjD)d?QxxR<K|Yq@S1hUL#rT;?
z5*LonF`+bg_Dqu12;}}Gk6gLbKSoIq^nd81)rM1*Qx9yq5+FngVy3c%>N}X%;xF?$
z4DwSerF<|jX=&%=#X}7XqOQxp;c7z{6?Eu3utG^8B%lxM{Z1ijq-SKfFu6K2wX~wO
zKJ!_x-ECISXoZa1S#YH4XwUYyeTDtkeOud4s#0s;saI!WL^6vm@*0zc88Mee@*r8(
zlQoS6j?&ylaj65hhVQwn7ynZAsK_TJMK^zihmtRpnG<^2FZ71pz-7<W5I*sK>~|24
zf@RAdki_gP->~<KABX0KN_**;t@Rzu%ZW%E*?%*4ukYj4f{fp|==Hh_(x|&G7x99=
zSsLT7(je9sE64~O_I~#=Drp_fY5w?teDCD;0d9t-GsVR6IveF*=Z$eO>hh<%_@=p*
z0hl0mJz>VV-|{NJqKYgAwJB_S)2Rso3nCQRh2Pngis^q48f(8>Sx;dhU3PvpB%wB#
z$~=UH$^M+2NXFSUfj7fG*7GErIHhd3$zrz|0L75?xp5p8rTQ>B(ezW&%*W4{&U(Ki
zX%!cP>Yy!wA^hkumq%?+57ILXBZok^>QH0%N0Ot<HB<N==5QkmG!-4iDAZj$ZBL0b
z@pBkM2~p^c-}vj6Z>jH;Qn%z`zvY3po6lE&;9*L=caUdExvj;KQ>(0Rv7^UPD0Yz&
z%ZK#7Z+|jmKBvl>wm)3w5wx_d*hG|Fe`S+o9_F6Hkf27LP}fKYYq(L^DeA*i;i$p9
zQ)VV4gTtsqzoWr8!=%9(!05v*B5z}DGq@0bS2p`=*pBsAQHKgQ9+Otulg3aih}liF
zcmzF_ULaq=vzvobwqfN*(j`}A@+zKeidfRmICYnN?z5)?+~Qir+jt|e(%&?))i-*3
z3~0LcE&JvCW4UpsCbU@`^58njgQy;$+Gyuvah=HmGM4xrWCwbH_fyOjj&Wg`^;hW>
zX}S=cGUlsh7P(vnZ9Htn)7#`__SUDwpE9_|kDkS=kuYa%cZD^F-3Rx5+dSyg#m=!{
z)`o*;gwm(lv0lAbhoq0|6yyAJsZVR{QMYAg>2??toF{mrOLdMA$Hg<;M3GG6(J_yT
zLnaVjqA~Q7s9C@{!)B}Pi$k`{tW9dXr;z+juZlCHzX{j<GPXcs*e+2shBJ;+FEW5(
zcucM59Pu0Oz0(5i!glnx<@~VRK^$W^|KxotB*Xj=D(eWjpk{hI<j@bbzs$nuS&%)2
zHrgDy!UUY(kiT$K)b!&G^fJGMf6y8r)O;M_e;vCgM-8<2_;rJOD}x|l#EX3gv^Ibk
zP005A>molSD*DVou=kz^wVJ0h=d$a|7SUE1^9vzA2G=V~(c991>OkB(Nvs1JcR=Qp
zc<p5W{nM|2#Q~B5@#1S%ejQGehMMq;Y62zVw`7vHFm%eTE{(@7N5nS}+1Hk@d^-<c
z2|10wpQSc0gM11#M9Y*^D9dJCwIl50Z#sTNuTULak-a$0`6_a_ToYFw6^fu1l@Ro#
z)rN3upn4B-@Cw)A9*{?@h!LcvMa~S!$L>O9>}V4jEEDw0hK?^1=B+YBaSm>?tiveH
zcJ)`TP~6CiCXyg*JJ+)R*3{iF+&?~4U0$WOtr&BU`eT@8@4h1Q!O$<t1%%Ph$UQ=n
zUldYcnG!Q<^+L-q(eq5?Ca4PZ7%hq7<1F<^7Ff3g*;ID?TVx-KR?7Y8KrA_bSO4O-
z$hWZMsK3(WXo;ox&N{THWijVyu)Y^UYKZ-2PehzG@K*4bpwKbgakne^m|vA5KMQ<l
z7iKb5-?}6{^n7oMqZXj)FGryn_t&}1G=-yLJ-NEH`tQ~u>E#a}xz6%eh4<D6jB4d6
z+n`y@9p)R{ht|h3Kj{vdb*<{ZO-2+Cjh_;2j5K%j=auccQ4h#D3NCqmdDkfTg|<lH
z*`}p=>+5@WvgL4$H?c4>+H{IDKDevJ%0FQKshUKj=?!Mt=(dQ>PyU1%!#W=if7hH~
ze~mp%X5-rK3{C%*b)=Hz&LFrx;ZIVY_>%QXR1j?Z^W$0(64s@7z}5Z(iqRY5f1(7u
z-f-tWL;#=w<G)1-9RFXUg#QT;>N^n4v}JF_1CCZ&&Q=Mf&LYF7@Dwho^1>02u+Wj|
z@(e5#D6kZH;JYIuJMP#$k1ftD&N_~kzMWK@R&~6N+gPvpUi~D6oV^Af@4D~)6P+H*
z6tb~CRq=Zq_od)Oqooj86nK0B`M!$g-ub-xWA|R1#bI4Z^wm5gehk#?gT4lPJ;(2f
zlX2z0(wb51yjo(vxxOKDs^vp8y>7K;0+#|2%4{y6LXaykVg75>>!<8D?o?f>Hx?*g
z&XO<rIRaGWqdzL<n%p6!LPzjSn?gs}-}Sp^Oo$)SJyO;a5ljyFg;661Mhx~zNW&D+
z3HOArVG8>Se@j}}DcjTu`@DSh*8B1%7aj3>2MvU5QBvRIYKYU`plWo{+>mN?(cU0x
z1k&6P7SSLS(YzCtYw&AeXs~ObF=H~v{!)XDl!3@~BPjI8|CK5y)mT*cCSQ)IA)0U)
zqUBupNHt4X7NBq=ZwJtTO(6L(V^-KGX=hj%O4UHFA)T;9QD&}i0-lLgK$o|J)1XZt
z37N4i^pvu*DIB2UBPerK*r7^_(xT9CEgYcb1D5#}qQs|%&(IYz(DK2T8ONtb&QvL!
zglbW1Ovk6k&Y%@W#-~TjuoYU<YDdqUDx7@RLe_APXOS&OD{E00l`bbMLn&l2mrtD?
z@~c6OHwd4hDI}n6fGZPCSVAr906u|#OWBzgmUDT3N+<`;z~Feb{)=KmGzOMR-v%iB
zhMNg?lo*z)Q2|>+UcDxQv{-Y|CouHj1pzfAH1_erSY^TS!bC1eP<4oTsrLtsFxXfC
z8L}RtAc|TX0vYVB9>f*A1!M%M!ezpNZNf8Q1o2%+pdJw7QmAs_n3TYn+#wmH#mj|4
zV-J=cGL4$hiiF87XD52e4)kSS7=f6?&ftStFQ6>jjsT;WcKi5Ng0dsPd~gS_jFj3B
zSA!HNu+{xRVHKqrUCkNMC<+k-IPD8=1At(mmo#@$GBY4bXaEEjtO9867?Ngs;@pPb
z)5O70z<$I4zeRmS_Ch)5g%SgvP2pZSVBQG5f#)<(dcca=Ha?^RJP)XbT?4c$V(?xP
zKpi3CfHS}vd^@5S<v9>44Uq@O0doMMfLG*uymMlxyM#D|5X=EI1$H7R!#|^*qeBfL
zAaEe;E9^Z7)K>y<4?L%ZGD60|??4+&0PHp38RH)IoDs?qR0`w-5?p%9{FN(5VMc_)
z5J6yFz?k8He1Hcn3G5eOEAS7tFXxOc2;hTtg1isEkG>DPj|%3`e*wY*V1dDaVBm7D
zbQ^8M2Mu@y$=b;ifHZI!HWcUy2zNz8j0Qx*MZ-kP!PfydyH&wiKudt-g&8(LI6M}1
z8{h`?Cc?fZjDa11WdK|P^L257iGak<QKcRzW`y8WgU<(53dqJM2uyIwu*!q5lheeu
z=sJWSVE)1VgL%&+wg711VE;Y=G6DYqf5H3(xC5^MJ75$E`bcx1{3{^p1eP*yD;9V|
zo)9(}a0_<~zd%}p324N|PHf`HC8@zvhb@Jt1B?JhsM&Vi;Bzr*D9z||DPk<iA8Mv;
zVRNx3;A|0&F>NJ3NS*u!^Gk?a{y3?EAp_{4>%j_QxnM!fAk<)KU>I-?1_O}{D2Stt
zj9(2)1}{kBf(HFx-;*F>i3l%prGe5xhQXTW63YE$;Aub!>=+;uSrFBQA4-OV3M)p)
z?C~*3n*jUDlLG1ofd``k34!bgm54?#&3G=vP`6+BSFZ3-C5Sc{9b9ptrFYB+wg=7w
zs}NTJ&DfgMAA426G2jef6Tk_61)-VT1re$WF$TAN7M-)ZrYP*QYbSL1Urz)h0x^L#
zNikwDUU=t3P}g_P0!HA%q+E_%kwuG{A*nyXIT_R&f(j-Ca!9JO6{i5J0Ve%5P~3uQ
zpb26-5F8xW(=Fex5&VB&H=qTa|Cq@9@G!(s5GnC7D57{!I4DC>;v#2Z5h+80<4~#*
z*C|4r<9eFpH<k-rjy^ZvFs=A#HGgYP4%e%3IsYtp|G&5YA8Hn4Jx!=K%mlILCwdE?
zH*$Xj6UHLC6GKK2^_YR}et<m!NE0F_6woOOo`pX@0s8p@)+yen{znYNhcwAUKf!p#
z|3|?Y6S@q0fBPTN7wKKZKInrLya)JWK%uaLApnfE!9uv2OaO-1|7fzsylcX!kwXe$
z-nHImgE66l|GB}5=Ux24x#9!BB!m1$JZ}SLdIMq*U3P(FN&s;RGi|u@E#R})y9lX6
zINuVp<^&7F-d_L$K7vs(&0>M=AV4tckGs%UKV>%nYXqbN!DR#Z{0Trv0SQ4|;6ZGA
z>ZXv4Ap94h$MJA?mHW$99U&Dpl@R$atV2?;62Nn~8|FU)&3^`*{|qMJjt(<Q3atw>
zQwpssGiFej8;A%5+CD`(jomy|T_NvXbzK?VamsANZ8n6gDz0Sptd^~;#<Wd0iv+jv
zw1{N1wYfL_Xe(OD8d-Ha)o}v>L4>X#WYFE_so2VDO52Rg2T+PD2p)8|<s=FsZCU=e
zN^sif3c?5Jy5C8hQv6$$ZfQ$ylXn4;gW`5iYga_G+Zf&MzMN+NU7c?6WdM!up0=!r
z=Cl#I-C3NP^sJ6F`@(~&H&16*I+EMw-S6a1owiRutaQY*fn4s`PuF@^pPHWlAj<92
z-WC5}ZE@~*il<_ut2Ql9A3>(urz0!=Np02ccPgiyqpP6iCkl`_^i+Q3<wskN+nxJq
z!0>8y%M&`NYwI+y`AHNMxP3al@{-in<$k9&hBn4FMm9!dlUavk1GLf4v~r&dt~1HJ
z*{GznffXd}Tjb9~-*8~E=@nc~sKd^T*>qqW8*t%|tuq?i%v6C^g6kABRW=-0Y}(#i
zC)5#Vj&3{f+qAjs^yo9&xC^oFRsO7l&-}3IfNbOI+K6fM<ktAB&R{IrwK1sfMX+M8
zGNI0T%s|k7%K_h}LP#XOE?7w9S6xFUdH165SnTex-dOD3vCNq2?y=UG>fW*P*x2r|
z(b(ADvD6s*?lI07`_?haSk>mS-B{JmvCo*(wgatAlZz**4amil(B{s?lhOv$<(A3@
z)BTpoCeHnq&PL7smd$3|{g%dt!~K@UrrQ0M!N%GB7Q^Pu^%iJD>3WN7ljC+PWMk@f
z%V)Fha!YRWwsGt`7O;J6GZwIO3>tgg&h8eC^2N9#x)Z#kSwU@1>F;njy@5)iW7>Jg
zL%X>t*!H?nC}u9q#3?GbB}Fkwye5W%87O$K%mOLu&vTOy9Y5OsU+legP#j;^E{cSZ
zgy8P(?lwS>f#6|q5ALpmCj@73*D$!dyIX+Z?(Xh(d4KQuPJQ2Z?mczu{&D|0ReSY3
zz4q!gtGlOacTGS0*}I(#Bt#wl(*TWbe|WGx8Y;?8CpmyG4l(HbJ2NWEZYMf`F9z|@
z-5v`yVyBZGz?Xp7f4=5UlGfpm3AV>TRoLmI2k^xs=AW-QlcaU}bAs)0P)Bz<`2l>1
zh`Z-&UL-ml{zzbZbX1m|P7e~DE`M3DJw7VSZYMUNAqG+X{5w2q*-j@npdkTq_I%BQ
zWU0fS5NwZ$%5$-1O0v}DuMM^*M77=RBnC9ZBD$Tg*^(@E`+I`zNl^##0UiGG0QV?F
z)blk15<r)~6!;7em1MUQ6W|_$sCd3+K?3OZHv^v$p=RuMA_3f^5n0dIOh{U~{MEr{
z1gLtuorD1QSVX(?H5-yAf5g+XHC>XHe*atW87!*sR;Lu;E(tO7Y%LRT7l)X6zUD;Y
z)#=X)KEp<B+v#j~KSM@s+wOD&-0`Bmbo;+vta*|=b@-El&oEJab~;%Bckzhr=WA{x
zPo4fE;4|Dve1PdiQm+wDBtKy10&kN&vY#*V9)Po6Nf(I#z}c*1B020cng`6J_j{aa
zD3ToZ8nuE;P$RFmD}4Ynnf>q2=Dv^+_89qttqDmM6Z!+s=3D_has73>l?H%1_{ie{
zqi(SEyGY1Zr4oQArQda<G97IFITEs6=>SORHfjVU^cy*lylItSx-(_=+qYw+4j9E!
zR1UK1l=Qg5%57KbM*CaEYmi5-gQ$7Z`|Wcv7&q8;3VKYzD>uKZTQw@1dFXB-^MUIp
zJXD_g-2)zf(_6K(*aMUzqPdOJx0&!T97rOMPY8Z&#ZWWRoBu8__)OkJh!JRzRq$li
z`2Lg}#6XMmanjxx1=}&I0$JDe1GQ^5>``DEIfWH-t;rd-7!BKumgGH}Iv17WkxQSJ
z(fjS-9Y~`}5uy;`k5ARe{)F>TQ)O<0LD0^EarR;GA3T|m+M+S2Z$Z>ho<JSXvN%DZ
z<x&iPp8HmTEuPh6?k^r!&Ix!TitTiKPNdB|bSz#T8m+up_4+y*EqTg`nHr994XtIE
zyxk1yN7eEo5^eqE1}|%%wyf^v#bBNRZu|%ra`haS;bba-_F@s?B96*zJ?&BZUZ%wr
zeTki(((>F&lzCxsVM-gcDYq$)c^nQ|FmK#O%fZ6nexqpLBo{kAAUA%%RY_UX!o*?!
z30kyYjWirRC`Tz^q^AmoYEJ!N8sl2RcNsoh=&(O%`d(z*AGNEzas&n9$4k+b=QPAI
zu%vS4f87Df`^Qr)sFcG^p6z0(%PDdbb3#h0_TvMn@v%*mc6SqSN0?bt^;DFU0tBL$
zN4OeR2CWa=fTr!usgk#$I}-A`F5Y><9#L(K#h>z3RT6L&a3NPYl5}PdE%&|KK+YnW
zp}f-{M|xb2LoD>Llc`hGNmcs+@d1-E61)!sMaFpp`?95ZPDKn1yDDniYoa2Wn){#G
zp5?P~*|&S+t9P+faTLoLGUz4FtznQM8LBE+V+;r)Q7Xw>u|-5w+S1#(pHOLpf)Pz7
z!&D>dqP<HBm>5{g&^8wmxFBi0xszsziSY>|<zG(FI24Akr>$v=lGXUUBSRYlCV|}I
z7B_Uo8YtgAC(nXqEiIGc5C#2f{7Z->swanb5=Y5~#YZEcf%`I<-Pr2nmZanie)NCi
zus(X?(bFJk;=gAf;(92uPU+Z~&{PF-hB6kLVyVjYZ;nHaCS|`Oe0Kv`CtI7Ev4>0!
zn_|VzFoX{O`q}?Axe8-2LY1Q@kF%dXnct~r&9R5*M|`ByU=o5zeU3Rg$3;($QhWXw
zE30}e4lY4w3?mZ@b}M0KToF?Sx4wM$uQ)6m8pn%4>VdS2s+d3HIA3eyN0=E|R4r2r
znmF7Xrsc-#rHi_Tx-K+<P|8>n6it2hk@t>y1MAEgEF&Jc`~br+Ag6M#4z-!9`s6@@
zj;Wa|W_Get4r`Fucq%@S6KOXwxGq1Wjy^m1ibBq!iGe3J;U>JOs&OEdT!1axT(pv_
zjl!UkGt>-Qy+~8)M2`I-yfKYB++7lXqS}Po<Z{}O8RtDU*rv!8*Gk$nHa}S}t;7nI
zeRK+~c&#)_pCW~sfxc@f_92xLOGSmEv_ysLbD2BM9f#^~sQLO4)RCM+-QAy}F=;1c
z96h$ucKA()o40m|A;u9OsT4HFxP5>rpf5*fBBRQLHu=R`Y5$3TKqKi-k|tAp_1Bwd
zj-jFHPr7L(?mJHt`|&dLvN71hS;xsoF%|8}L+VHICDsb_;rCT9t+7A5V#ktLrz;|p
zJd*{BTfRA$GH5pZRAG9)Y#Z#tzRb@pF2T8^cN!kvQ7`&i!Np%Q)awM4lm|uAAI}zv
zs>t-mMOEjkRLfmkyre-dx`sF^3lfI+88D6XvhXT(4u5rGkBEDS@Sk4p;3fo{G3LV2
z7ctQ>(KEz16(;8HGQ&)g334c^{!KDA3o+o8u4~b8g=$tI#R<;qqxhmXc1>skRjZL?
zdsONNI++-7#7aT<VGLO`#&3#p-z33>T=A|-$A833T8bs^b2N#_NO2hFrwxDg;Hdw3
z-!3W4lFT{}zr7iUKuqOTyOoQ{nkgbgT!Mo0pcEOK97J`PL@7R=)kQ?5PcPJGVEDO7
zwG6wOP1gC|o_$Lbn2UAV;~^wA#aEnTokG+T4bm{TO2<1csgmg=rWW8TZV68K4yNA6
zPL@LA{cTb-C?NR}ckJ(hu-Xi>hfi98AU|t=n8P0yMtXX&IjNbCpx-58!I^Z<ngDV6
zQ)wto<B$T5_{7bJ{9tnIG5R!BD${F~tZ2gvi{8oYp3FR|orHL#mn*7rwH5p-5B4rj
zlk40`*_|;o)G>@hc@vd*oVPW7%!W}Wd_<?*BN(W8<OlfF>10d>(iK@Q#*}}?1FMaL
z1@vzMIJUmAq7@CEk>S!*56r3$ShRdKw?eIjZPa+z8`EV0q~2;SF4#-Ui7w-Xh>}MZ
z)O||%Vj-6JAs}8Z`?!yUgHDeDi=y;}qf*jh@Moh==)?)91-g20vf>V%Qv=AEb-$<_
z!|1&_dGYFR4pVBOt7);1)J{mlCY-YaHvwn08}n&Uev=7NU0N>1>?rMDhi|uovPJX?
zZBhlqWV0`+lzbJ$8xj%E5LvC{XmT+>(iMc3Sa_f<@m0cg9?nsumow&ZSsOT<YvMG0
zbHI~TFu^gtcWhXjm=Jv+Yc@hV8RtWbuW*V+K$or$0s)l64;04Zt0piym#G^YL4<B$
z<micxowo%<OyI&!&t9_a$wvvPIFl9D@E|T(0;OgsqQvo_tsTZgnl_()Qwt(+te|v%
zh>R4YJ12aD!+;qT$@^=@d+x*<S_IPQ>4X6=SY;-5B}|BBkzSi_zTc$%N~jML^izfP
zz!Nm{O#xQi7A^w>tVz1BiIGP5V-~{^|F)hwSj38;mA<$Na1?%)Mnrt<wq-5CikMa8
zE4tUHqm9oRy1Vr%G0jTN&yL871P_;3DeVh%4tX!o-U4<1QE;m|ZV6TjSoqMEcQ<su
zErwan=#!<jX7^RNR(J*LSPg4vVFg2RQt($j@Na_Gh1@wRGixKRyHt4DPeVrzl6FSZ
z-#<}4chR=fB6Ji5Jhy2abI?-X{9xj)x6j&J3KB!^+TJ(Vr<~uFX)Ju!prbZIx(qoo
z?0ebHtU@Cm?eJ!JpR&^IOOv67Gg$bl<5-;=+J=TC7FfmF%U56`(D?@g>4=eDn*|kH
zUsj=TTOUg5tis4po}@>EyiUk|a-WNzb*nv|exEBXa+|K<W=Z_4O&4$@P!;kT%)&&+
zNMEAT9P%0}iHkFYcHN4mXfx!)1`!TLo@acb^PtP5x%2^H7cBTD)E2KjgqaiTfHd1>
z975Z~o_HrKa6(-kn=P(1gsTg4OLLnXY+Yonpe9-_j5eR#=rw6L`+1nHNEVqg!m-sk
z@w*x~`><797!-n-?C!7fZu;udR6-*{6ppJb1wKS9J`@G5_XS&CiWXzY+c<yTLw6OA
z!_rWTmgAk`&YPSrX0!+UJG;osL-DVB-YqiNNe7SN02b{2_3BQ{BEvdisy4rmRhFg@
z9gvc-QLMg+LBFg}r8@nYIUc1nDX^8ch(tKnRmudZctIOewbTaLM%4vU^|z`i#qxt%
zG<1Pxq7eK=T6y@QavEZD&1|IowbBJSq;m3LfdRuNCuqDVr76&KV%yYmXfUgAP*HYv
zc6zEdgjSU~B;_VS?L%PVpIn7-b!sb2?(1ph3j^e`9jyhcCQJ56l*>k9ZMmC@FqSPj
zD*xoFZCh7OFQ~;<;l@=#6Zv?8`8+7QkstFlQPRoja$rE!f#W*xfEk68S9smm(g9G*
zr-rS_RaaXwZ|Hx2|ElbdU<@x<yfMvf7!k`%qZX^8eLe9Yu|RR*=rqBjyu7d=5thXq
zZNZ+kebJXJ8NpCr(^hD@JrkFlq~?nZ&Mu|n_z{Syh+~lzpsB3ej@^4P$k$J$E;gx#
zl~lkCTNQrrP-;#sY%A6j-(;e#L}upYVNp+WfJwDbmj`CNLK}nRPkVQSN(|4$4N@*H
zvh&wob4ex5=dhdCp^xP|gnwQ9vV76^zH0iLQj+=vB}-|U=KO+=E~Xy+Q}^E~<5*$w
zUwx6;EVh|gMRu0RrIua_wjN|$Ep<(OH};}<PDM@J+}G<Mwq<mB-bVhB@Sxt4D6O{I
z;e)0E$CkVV30YZXSu1U2r-H3_^2{OAE?HV6`fTh%5hmBirHo>^G&o6p6>_P_=&5Wh
zBFh^Wd3AZ;vWPf-kXtCDV2V0RA3)0-UT>NbzUj&hOiI!bi6?#2DK4pOZELfgPx;pP
zbiO~7l7b1z5<@tz(YLTIvXY>hZy{DpD!|v{v{4nyz3AW0)3%dVnGO6zu7@i7v9`AU
zmn(;eTN;b&7hNNFn?}q@c~=vOdoaR2!gy0&WnNKO<5=Y6QsflEAwf|ht(LgS<)y#?
z4;4X*mRLTu@5ZmI?+b*@Dce7ZY}gQ0f(Sif9~!&^t&n2hq;_MWU(i?r?4y?~RAZ+;
zEvQXRI~$B61Y=|?`{ZUdwlXU%Ze!5X4ai1nYN;2@_2`r$iCJ^TEBsQ;IjU$9T7p%0
zn{Jt(*XCgXC4r-G+*<?$?}QUdaVvbDfA`73`h`c`Rjldspm)MF$LXS`R8m`eIKfit
zYIxjIv2}Ps4&VLC_$j|uXSPoAgX;8bZJkY-#*en+qEbs4!Y{bgXjpa9E($vCVp_*#
z3EROV*LC!;VBm}>g-B`S%&(NTo7~bGI}2OcYmL~<f>{j`kda=*j$@_cbXis*wX&_)
z3XVYJ@yLwIFWvhchM``s@I$TNMU{o(&pGi94>fLTI_CIV63w=?4B}S7ho!D+w&uwn
zeLd|xJ}Z>i;v5`Jt)~I*8U}SE@|z4SmM?DdZf4446y;7?7$#+DBpjb+T+GBqXVm!K
zBx`$!PM4-9P@-oy`%Q}iT!Y*)qDEuRb!-$9y%wkA%}-`(m|d5&XL)Gc7#I8GB4k2n
zM11$e+*|4%l=Vd9SWfL!J`t{_$Xp@`2p+Nx)|~Hz2h9>!Q;!@VtgXJ-Qi6T!qwgB7
zvaE*d3ggq*Y@b%GWUOmxog4p%%XTMj%MH*r&lNhY9gFE4$-c54Z$%EX9c-o2fHR}k
z=PouEgv8{P%~ltsh4srDy_~oer*4v+IZ6Wc7D1n82!;py9h_9YvT|&1t@YSC^^eLN
zF(o~^S&mGrxgC_u)i}5R0)UH|9C8CJ=7m+7@j(mA5=C7pc?Ssz2i%3sDw01wdem;~
zs%lqEKQsNtR*Gu#Jfvu_$c@3?ju;+hBfEBGP{F`8d+nFpSil%_HqUw(8tMEKxmWS6
z87<%uZ+U*(nH+ibyxs$2O#XB~MySwEi>0izV|PdHZwc47$`;1}784l)$`M(T4qXi@
zVg4$mu}Un?(8wvs9Gf`OUOz51?3z!&Nr;AYXk~Jpg&EQib%nHlSD9DYNUfBrJiRX@
ziZZ&>NRLb-@_r7KHNq9MsHsOs$!Zfn=vJc5fPLB&--34E($FRpXZO2K#h4R5BxqpM
z)!e%1<2m!+1R1PfCz`4u=j1~pgY+L(qwLB)->B>Ia*~$}^n^=~x2~JYZrhe+Jw;J8
z@;zId0@h9X@>`XI>s5eAVm3}sIDOc948B$bX?P%Ks1M?bfp31o--f^3(U?`9N(f>&
zx@CNkfyaG3>NKoovffCnfr?6rv<s%+@H7-s%yaz!hFclhw=WJ=7JQSbmY8|tr8#Bn
zN((C$T;rgRx5fn4GP*{(iz<$ulwvD=svG_{p>+uoF5O$vNODGz%pU^)EQ(WH%yuP$
zY~!FxXv%wyami=g+FtW7@e8z<t?bY!b*Ru+TQyl1adDU7KTQwsa^$mTgQE?q&_Cyw
zHDxStLSoR#ub)>P|LTj3*OXL9wjL7wNFzztN13QF|HaL?tHO(f?fHVJXN`KGF>cu+
zNzG1RvC6U{IbPAVBIo`xoQFQm((qM1YnDULxY6Ql>!g$Gy>n|c8{{ONr`1qHmM+xR
zbkdf<yNh=?FM7H%prB5W3vv|U2?WV_Bm(>94U#9x#CefxFs?f62!zDz;Bx|vHS$vg
z-#s`ha41ZcnDp2zd~qeVEl#LaVeOX(YcWvi1bz*WXhAECD!`_|#&8kK5fhUPRtfG$
zjsD~?Ne&_>(TpXi!$&2esRJKhE*#WZTI`Q+HES5iu(w<nm04M<76+^=RM!o1J%l6@
zLyW16Lr0k9hX+dwObAuW>xxpomneNGswZN@)d?Iz4yjoxxDkk1$PSQOF3>LhJcUaf
zYXWvbPFD5yghQdahYRzF@rkU13V<h>4sWI(e^}N`POZ!=DUg>lkNaIOO{l~c*x2p2
zTv@Q^uC6IHdYlUi6p6HAJl4-D(PBW{?~}f=wCinw7Nl{fnTM}$T6b`?2AQqQb?{kb
z%|Dt=QC2-1Xfg;7TRw1cP1j|M6LT-ik|MA?6$jL#`4|73v<V{A)SA_h%}|GsA#o=8
zEQ+om;SVnmy5!?&)30FUJ}EM7>QdjwD%cg7_@GY3`y`kDO5~~KovDifbF1+3X4A?D
za%EO23USwivVBs+BoXT}c8aO*cXW-zUh-B3hH0KsYAlUH`flD&^jB@Y+o(>RnThL{
zEumN(RyrvzXWKN{P^}{Q0s6TazvhQ6e|`P2W$xoXs6D6q=xIQ))i28cq<Vmv7?<0H
zCD5Y#TTC8uZ531bJHgP`$jZaEiB_M>62Xvox4dy5CdS+{Z-r|n24$;Ce!*=)%OKg<
zEd}57<EC`0Y8HPyspcLj=ePXD0=DG#nV=Ks_o2C*<YGJBioKZ4!Ka<T1Q*9aBYc;+
z%%W*(u^PI3Uc7NiO{VAjsI_`k8lda9WxdsePZnBfKNYr`=`F-BgtD}#u1i09M_>J7
zD{aTQps2Z&)#6!M=H~8dl@^(vS^<fx-irHp8@eP31*;cx8)DAOURRnTkWphux102+
zk(vCKO|=}1m8j)yo%2vBmzko`|3>YGYLS{y{Y^FyiM@83oK@tTvW0S(J7OVovhCKd
zgxK7C;xAv8t$M=0K3~~cYG-*ty;|cnmT4eZ<VL_9pD*{J*ddk&h{$C7BgV?afPB2~
zjHV?@M+%e=OztkjpfEqzj+~n&t<T<?x?+5V1osXgu|T@@{e(O{bY)$SrG4UuP*93>
zpjCG0#3YkR%n2$d6zNke#)%Ynf#-I~AJoVJiSG8eVuc$5$>lh9igMUc3(LIwY<W*y
z#19M2x7afU_-2--;0gX1Y8H8)kA9+?k1?(b=jz;{;>hxHx<(v23=o8eT@0$f2C5S|
z#&gM^)`lKurn^e1+q0u$sed*WwP**8(R_tUTVE&(3lD^&2ouL1s1k)!_1Hbg2q8Yu
zQgEp+_=xdN7TgF?mD&}hMbMVIaC_`}#!P1CPJN4aFx;c5DISwmG(lBCV1CSr|68T4
z7UXu;g&fvqQalpDhJc+>qsUPK#-T}ZoMx}p7zm^riVcl@QROo)Y=T|bX`95MW2{Ax
z5ttNMA6V2%IpD058Kgv<Dr|d-j=(<rw$#cP6t}QQtv&EWfP^tfugFpxcrX)x1|m+g
zWZH~XoQSBK1_ANa;6M9(+l7a=fuLFdXjFX0NX<z$L*CbRjMB1F`Tl;Ap;ohoys1&u
z1M<yBR=M1RZyZ|&>ROp8Gr^%L#td`c4BKKo)om`WA&Lt|ru&Szn}ahqTZ6p?zF2t_
z5lk@x^~I3Sa2|xnfat19l+^qmd~%`PU~CKja6dS>rAm&^5=mQHpRP4(C<MHMLQFD+
zVLwcQ7`e5}i1FMntO=rRe^2sFkh&J2=g-t8MSgwQq(4X^Nl|V#PV>BuimLIPkY<>n
zWgJ^txf-=^*>@bAv|T_32H?h@<9h3;0i)UX={<ty<_zrecoM*tM)SInC51v5b)bhA
zg#|eVA~)>}b1dI^G850%=DCyG*jchd?rh|$*@--OaaXz`-^L<epMy*KP!UE<D-?6f
zLe)_|o67k@BP~lU&p@JK^BTvogad^4m=+VRMe|xJN=Si9Ik;9cv#z;6UgjBzqbH(q
zc97zSH%nMi^e#TkaXRTzqy9E*r*H#snWT%Xbk&%Zp)rXtUDx=%F^EtKr8KTa^1Stf
zmRl74$(TQq;;JH2yG$M3)s{Lk?T>L35)NMeHYVmbX%%lji<f%b>NlFBDmas<%izk-
zDIQ*ma&+Lp*8MZ{M|YpK`EsVIK6oTuo>99Q|6491lJcp?G_74(k5C4W6@F2iUX}X9
z#UN*i45>)=f|<r&$T!L6GEF=K)Fcg?qH@QuxKc(C^M1IKq+_cq;Nqdsj%QtOJJEeT
zUsJ?Hi_3fB&!b63$CbRS>+UCyoWzWT`TMYIg+<QBNQF^Aidr^$XT>DGVZ4`Bk*@g7
z=Va~!?^#+F{Y9;7TnmFU)qU;H_*7K_ffcsIH%uFVgr#$fLq^6+By$aEhBF#<Tb0M}
z$$jOB@mtoRW&7fv`0Hs;*+7D|qQod^#0sJhw*26}KWBexBCX`t`0<tUA4#-IrLz_2
zg}~Iag3gap)B+Ld2ii0d^Fn(S`ODPQBV4W6A2l04@+)e=ieTqdz$*0em5$95i#+u%
ze~-<>nwg^#(yvFEwKQzO_aPS=Y!xu)!0$Xv?dcT2FPy~Pkd7QbpENvTvD!YVst<=v
z4_sz$4U;{Y6Z26G*s0oFsYJcP&f7VPNHkzrkbP8K5gF3|8f7*TA((e{&pq|m1IbN^
zkyybJGi`;u*x<u8ja^I(d$W{N>=QPZZY2s!_AlA2j#BTfm3M@PN8GVWs*ilBS4kvF
zj?whxNuQp?d7LP-hORz0Iw>>_f78c`&qti@s+*X0UD?XRk&MDe^vu;Q_ECXQcV`vV
ztM8by7ydb!W^2G^mWSN6foxjUxu;|0^ZrmV)(R@Q+#YY#f0zoSxD<4-6u56TPIgQ5
zvGEk|CIGkR*P#=aGw4+AQ+Q65^~Rc&ZMhK19^`6MxDcl4^yAlGO*D?*R8!+$HM!hf
z<5Y$f<1+V6XvOD`T+QxoWJtG9AJQ8OrWBTg??i_pn&upODhRY{WZykMG5L#L_<)YF
zK%Pw+eTKiOOW~yQlcjaph6xj{SX$lsg=8jF_jwzPJNAcbu3**Yr7S68f!B}14&dJi
zwizwg*p+&=C+02FTc=U8*_W&ce<gCq9tN$ZuX<4f|FQ=c2>rYn$AhT10S!T^AB57q
zfCpU3&T-OXdBg-D!i&7X_s1r32ldqg%(Xe*H%N`X(h-s^gJ`zE6OC`xR|osCGIMHS
z`4A9EKS+?GmW1O5eeU}24!qe>g!V7J6srljMODNA*uuy7ZRejhqbdRA_kTMLQjNXs
zlF}}2rozo!mMGlDzWKe$$sanGE^|7;$ED#M3jqZpEa0BSYEqr8rpAi?3W<e3$Q5(C
zL>wo#)l5Unq%I>CrL!KU`V^OmT+b$w%280nNz5mZs-<?-Z5E2;BnQG}Vs>&?Y5Oe~
z)%IrtH1~sxTja&L+cp#<xc6<QUOvtiZq&Um$DTw{TTH)n)|hn@()x8sQl<Lm#N8Mg
zpRD85<;cmpCP>8DYh$Tx8P+q|HihjLOMIX{>a98<Qb=ftP2g#|l197f?#LQ;`OD++
z*RfsV>CGgnxL$fbX<$pXqR3}3cci@CY<d4AP<*B5&FNJU<%4&D@N>p|p!m^weB_31
zD;42f3)R6q=?++eKw0;q$RLN}nTYmMtJD-vRMV9|HB~&8L4m!ojoZcu)tE1Yu$v16
z$M@_cy)kO1t2++2uX!Nr+Viy?o)ez<XEhe#_nyA;KV^Dl;L9^-SGj0jQGGYzuHz6+
z$lTa0zW+%Y1@<xB8anyUwP=9Rii1_(uOL<4>sgDUY2#^QxwB@ydN0|)m$QmmJ6MO{
zE^-DRV=pdpN!q&9!`ac=?UL0gmN1;DD?uu~l{8(fEzpWZmyP!5MLx(wa^r4kK$}r+
z$e=gnfa#OD+@bY0<xG8qN(pOCG;I=X^qvF5M+7~TB7W@YE$9KDBDSNiGlKSP?7bkY
zweXy52hQ(yMx$%dl1@+ln(K)?gf3*9nfhEUUS#-(JUy=76nHy|gD1qI)L)@N<lOkg
z4LF7LU#BT*-$;aH+}MSS(F@px3^}gi2jHAf(H^9Q76o=fAUoK+%}$scQ?ltm6?70S
zIX7lu*4GiSO4Bz6->FwlX!NJ31!6_n=mmIiBBkn20B#}wz~vjC?|?XG=uBm61h_(%
zvqN5sSLm2CL#7JbC>~WLp+^b2jJ6cDgw0S8w<N!?m9#_$y^310gFMOJn0}N|3z*al
zZ*)KKa`XZr_&I6;v5@?$DtUa+R9loMR-t7M4tXtBp<#|?lm|kgR$Nkq3LKb}toAc_
zI7;hnLCYL9G8cS(ba$7iMMUspr|C^(bgV{5%Wjl9DyBJ1Gv=IRPMc(<n_;QwXUy%@
z4R5@=SqyjimC+jJ{S9o(HSX-PXIRqgGMpSO*i1if))^9ao9~OT#eX{wza7GUSBIa0
zL3u~?jt?&#jB0`k`-lz-qHw|c&b(&dfmo^f!|feN3T_5A0*(ms>B124otLP!%NntN
zixF%;Yy@H&3?I5Z#+q>ly`M5{KCD8}!ms2saxL-9F^K~vb`_?a>SzJPGy1JjZ2yS2
zr;lCoYgTuxb)iwjN5veLF9%{u6t4Db`tZc7ekrVCE4yfoc!k$~tQ~qkr_3tF;Z8w0
zEbzg#uKXZ%7@zF6J3^)D>w*KBEnS2;m<9rS<Tb4h7r#STUKrbVUj7el2utr=Dc4Lp
znEkY2>tSsXmtY$(?Qz#^JKmU2u(z-$hya+mckXCsXln)?l+ZErW48`cKM`18bbI*k
za7=#4_Ana9X|Q}9h!QYLUp_}6?7bg&e+6^(?h5Ye{T1vL!gu+L7r!5VqJEuzHZY5D
z6&m-he#fx(abAcW5pQy8=zh_D<NxOO!EVCv`{}?W03!bfuMfd5#Bb1#-cJ`s8MYbD
z6&?$2Er!nvHWQZaA12?Q_eUuIqVRQqFE~1MU;qfLh$=8^6?a}8a2;YD7#$gYtuUVO
zHwY^532>G$A7Q-E^c7b8XUS{-q3ivHF^B8uzI=u)^>c;kVi9@chT4;@eTP}%5W%wl
z_nnOPbMecDk%EtaB|_puu?MWZ>j-(%fX|0ffKQ9a$oMgp>{s29fy{?^)aZ8!gA2p*
zPUl?%p5I&_ddPjQ-!P0iOxZgfgt;$PQTmXn|G4H$@8&)<AlNgm@pKUT3BtO;p1faz
zZ}_i7JCgSRIQP$+?nH&OFmpTS`7nxaQ@sI5?r%g-7(x0Mjy2T|E5BJ-JD7^?b-S#I
z`sl8_AMHqYXfU&XMEaB)JWx>k*FWBy!MJmxkoL8|^Fr`b+_L8-ItlbeyyIPK_dA6Z
z`Q1hu{qXUOb4?va=Y7!dnms-di+{Jtojty=P9SRH`oCdI0IJ=3xAxr`j&Msrq<6so
z?9d5}j5_YNyE`KkehNfwU;j7M2^8@Y*#EEY#dUgDo__`XN6vrJ8yRi9g$ZW8OAA8X
zUGE0p*^>zW8~(SPFH{Y_e5j<O-9eXU>j1C+2|2tPK9jO^X9l>gb9h<vdEFtCrV{)+
zY?uu0t)PES<v;45tGk=izW-0f&i%TZ<9IkD69xpMqHc8i-_;ff!)l<oBEZ=81QDLU
zEeG3xPHNlJk1`U(`ma6f$tSfqY(X48EYh}~Hy3)d_Zt+Q3sOH{|Mt}V4GyJOgoxgH
z*~=Z9RIm46Ue*5v_LIy6S)H$Ic^z$g-{HPG!#stdzHVe9`2FK-z#$dXA${o$@;zVI
z_qxM<OVf`s`yZKn;eSXGDzdtoqX{zACGZ#%`|28NdFr;_S+aHPYL%9{IDbmwq6#J^
z5rnfhM$_IEI_-`4WGK}i@exqMa*7CplNv<5V^9g!h$NZGroDO5$X>bSvoUtF9_M<Z
zcYzca9UfZls~jrOGcfkAdS-HDTN}_*r_o>TVpR67s#As|5wY6;?C|=507nZ)8;+So
z$)^6BPEa&1ooq+}&4f0%3R7bKBh<Q$E|qm?C#>rJe}y=~RR~b)A9UJeL;oEfNhrBO
z=>(PH(&>g2uuNz}t1yA{A<#EBj&D!*Xm>A+K}3hn4=~&&Tt8A88Jqt1A77Msq~b=<
zO`Ig=iT-aOa9&4=M?G!?+r;U=L&dleOp{BAd4Lkne}|h;Yn?bqSe1hk56e&=aK3?#
z5ZB}%Co$_#1g=ScSXEcq#V_6MkIh4vuJN=-GEd3KVoGXr@poYazn~=*#Q+2Kjni55
z(6_iA{V6gmlYsvmd@t~?VAYI&;=unk6@%jcn~t8$y^7w|-s;}fbux+hhKl0<+8ED+
z&Oclt;C%Sk7x(_B7SbLeMK|=RITYz%4a0Zc|63fkD>kkx^@{>x79Hae1IvGJGEX*u
zf6CRFQ~lqz_&Y(ee@?!kg7Mr9@Byf4pziR$Z&i#=d4nZ(yf#(I(&iTCpK5xQmAAi2
zH~WVVru`+FbWTnks+MT{lTxCx;4DvVm4A8F6eHxMBigExDIbQ;(N~L6MN_U^E>T*i
zXXSBJ#hbt*5Hwh4+_spd@48d)8PR&pCa77=3_rJZu2S@<Veb3~@6@93Ss-{(*`C8Q
z1+@&jmsF>j^;3^Ra5|p5pu1p-q}ye*ry$@ua8s0Yyog@Q@fO1<Pl@jbFPzJbB>tqF
zN%k7KGQ1s?7V$Qu?{R?TC5h=|QGo-Ju^*+`2+iGxx&PVKt8ESS-DLrvtTyJLJQCJV
zmxeemZ>Y<vKfm6D)%xzfq!ElRGdSF9mva`MlUO3Jz*3`peW5s_&uTYXR4wgIZcl1a
zZ3j2U#}A^&_wBM5SsA_94*J(S8rHjd6>XG0KX0VJD3sn|7w~uyEY_4*CcAsGd-crl
zY=ydQ=T#o#gpYE)w^QrjDv1$ud`B57g|itJd^3a1nR;-Tit_uX!TZve2F|866=o}&
zzUEuY1J6>6B-yigahDMp0<#gB%B*WitVxj%QrZ}Ixj__OG-d?Z-9;$P`?$zp<|||D
zn~m!3A#C0{8;5`ZmC$-k7xzOx<I8w4R)x3!x@9oiwdBKtaAS|%e-NW4mu+l}%+`JJ
ziu$SF5~bCz!=q9^UD9#dWLIad(L1>R_d$tfg<!Hrac_b=K#e-{x5%=k8kMD5OeYTS
z%vAm6ZExLvQxUc7FCHl-O$udyDW-YrZU3e+8LZO{#Z^^id8YnVUeZ;U^O2dw`bkn}
znHfI!o}JqDh$#5UF)J&rUS0-QC<5u?*X>zuNP3w5=da8FwdJL>4z5!oLz?v0iys2^
z3MXXcc}`9jEv59}pGWu;*!PPaTuqWs-huXR6V27{P5)4}|E+GVOvZ6iqV%z=;F*70
z%RuWaXfr4<Se<9YE>8b-P2^>EL3Mxs?^Q-~q|SG1v#WmJn(>ydy-41aKv8ExH|=ic
zAiO(N;Rz?Vf<8ONCpO6Hk2_*+AHH)+E+4A%Y%U+Jb3u!z(VochySLeYlXpZLPTazg
zcMW}!v_3!kb}{vTpJRq(=A6fdWJ1rI(L_`?-Kc$dA*@tBDSe8xK7oC>=pxFSX6Pc?
zn_(fVx|_FTZ4#TiX!=FxCOu=*ci^5xD=&oecmk2kI|PFEs5>A*d(s^>K|Afar^VAs
z&uR9#YR_r$`E(EK^c}&56}PbH69+_J;pr2koYF@GqA%^$+Q*BwT5vAk!)x{Q(o=8l
z#dvN*u&VIH01@%Kn<i)vyo2X{A=^Nmxf2f-QQ1VL^eOElRd_-t@TEFG<a(joh@81I
z3Kmh@jHG;Vhlu>R!{mOU+EARiQx1MR8%4?&XNZXZ9Vhn-)5h4$ol~%g`sNtrix;Hb
z?+%Ikg<^ws=I**jA9|jM;hWs|Rv9*dFZH>)#nbzZ@|ioU;C8jma>^GENc)dFLhcuu
z4PMKqk)BoPc|C@2YTsL##00*y=WZ5H%RQ^v=eHQXnSHB@Pw)ioA$N$}FXS7fGj~$K
zzABrflrIht-=BB1+%NPSnKO50!M<vnnUpVJi0_X(T<#a@4gHxr^<ZDsO?}E27l^O_
z9WVC_^Tz7ToiEyJL|?n?lPAHe@HwgZQ&5j@&N(UOYe?T~?42U_3+IN&>>X?HD`>Nw
z;>8N`ihI6l{#4)Nn}7aF^CCj<s=v`bdq*1ls<i1#@nQyf4Y<?ie&OBloxKwYepTLl
z<#^zv9GOIK6RGA}p;;MsPjt^aCpp*I^xmK(Af*=mdxv+fNw5mJvxb~1c%ed0rM*}o
zr}AE;kW*PN5y+|H6AXm(>k}D-RIUZ*biS?!b=*DlRW9r`d_!b%LnQldtmbZv?uC>2
zh4cTo|Ian~|K$hasr7VA_wxT`>p?&xoRnAdBQhA_n6bd0H8tes^1VBJ?8Rt$59&b&
z>dc*I$g1QfDVdKp#5d}WoZyx1d@;oHr;oco`5qh4?aUR+xdBS4^70iZ1<nq+=}#Q~
z8KLA{0^P(KQQ}e`2LLxiBh;OLLhnOy=meC;r9&0eoI|0_bONg5Z<GAx$Hjp8^a8r$
z_@OxT0?Ol>p`&Uw8sp2@%i`l0z+F16BJ*UZ6LxyOc_S1%RE<GEe;gr{Ma4N98iuV4
z-OC6)$=zECJ;^qYhdwfBmF|InR#>H~Tv>Y@z(mF-v2g+5t+I12^g5J>ZlS<D7CI7o
zQf?jwEe)-sUntvS0HS_#u7z4*34I&)#}d*Q7snD(8Slo@E#6xXCCS>04lPr@q60>%
zUEu*ERj>Gfk?L3PfQl+tR6s?wD=eU*>J=AIQT^&Oa7^Wj2{@*9MFbpEy#fHo)UV)x
ztSVO&Kvp&9R%jxfM<Fzk-lGw!PUn#eRi|$f9WTail^nOiZdDjR#BLQGC&X@*9*2ak
zl<YBwt`zOrgsznB5r?i6?&*fEl<o<It`zTihpv?G!H3#{u0(;Ppeq9)DJ-`L#n@xP
zE#CTOoZuh(&#~rfOLiJz$4d41uDy~Q@~0og0?l?PHZra<K-7|;k74H4Q+uAsX6NaF
zp82ASsm9U44S}T`a8CM4M;5BqG^&BGI){IivfY{{&m@<v&U&*Ymo4t<3DFIqVN$0O
zI`+*5`G*Ih^7uO-e;41WJ&PH<#pK$nE&NkW)m^d!5`oht!yW-w4}6C)@EGIZ51EOR
z=xHT;eg{@}R))@iK-pK$@XBnd<C;rd$$D+bky5rTdzIVC>5_qSkOxQyHMwDN&w_AY
z_*T@RdOSF3MAFX5*T}Pa8qcV1d@`{mQCTLjb-myeC0kwUnE1Q<j%9Z9?Wg#PZ(ZK8
zme=OLmyhUgSh9~6AuE2uCn`l*tS(uZCUW*3g7ciL?C;5k<27yV>YL9`Wk1g*H+2SI
zyT<%kJ1i*0e^aD(&R0Ti=*HtaKv7!J@k(W%D{NiH`@F+rlzRDj*ED(Q#*0$JEQRoM
z;OlFxYjKl((@MbPq%K=%jqufP;m^_DbGD2R-*X@A@vw;)kZe~~JELq<#5tRjmz`Si
z$tTQOEimz`R_@XVZVn-&!Qnb~UgF02*L`LZeI>lYWHFwFKj6UXc&wQ7F0JREqcsm9
zQXyEwW}Z3*OQKZdjV9`N>X?Q4b~-XS-mMP8(c-g&W?!Ut^(`etS)01}Fs=@+`$T{9
zmhozdp6c3_yz~Cvss#Tq=V7GyH(#YOzntv`#@n@(o%rhhy3hD;;w&Nfw_Pc(q`yzi
z${fj6^>yEuzrLls9zS1pK`Err*H#_51pcTR35I>qUn&^X9LB95r=w+F$ix`#qdydG
zX;b9HjD>uN=leFeDDjoL9F064Ae*BhOc@XOLPgFG8kBqsunLZnVWAXbXoSh5P}%qp
zp9Uktz>jeySrE8K{0)+=vPn11C&L{9`hSL0s+97xN!jzZiX5E=6Yt#SpvN~vz{p3w
z#|bz!nkOmw0|UDY2KY)pk4eSMW(cvakw5!y=c!RQJW9#V@AT}B{++ayFV>SIlHZN-
z5f?=8yCMGJA_&jJe-OEmjy%5{dmf(xg$MbCUE;UiQS*Nr_#vk7H<Rf7!JUH2fTq1%
zp2?A9!^{9jBzM)wX1M6i`PPC0TVDz-!TpYOpTwn#Q7AZty&JHcWRYRQ#4*NM^yd;n
za0!<^-}0Alpk;usv*i!pd`lPKNJ}4Icgu{1ot~MFiJsk(;mY?VqZRWdvlVM=4m<V?
zHaqSNj#IW3_EUCYo>OjN&Qs1d-qU;%k?*dYr0kwak;$ziw0}f*Vt3Hq`0r+y7S$bI
zD{01U-$%LhxptFSlfy<5OSg9z)za^qRPEXfNDbO7$~j*RGOgO|%6Ua9Sb0TicvDE{
zZ&OGYSyM9?%aipN>{9d>S5rk6M3PtMMN(huUfEtZ*)FB}dE4Ep{$#eOOB0&(6^MNO
zxI@}UH(B#^BHsLLsFASY@zr)OlgoLM2#+w~HI@BP9kik%b1Gv|z57=<3XgB(QZIEE
zTrRjm7_4tB-aWY5o_uwC^C2`Ii+LpV9xLVY!_G5`(Nx@zS<s5Z&<<K&9VVtFUb)hY
z27pqKi22w)pLxOHv+Eq8>s)H+aSK1H<xNAfMBmrwN^SM(8hZvF+v>J^mZ>yKpyR9Q
z2spJAOgcrBNU{00gIR~B$b<JRBMDI`8yq*3ui_UR4?R+tR8mkASt?+Qz`Szb^boZp
zvwHvBWBfbM?1W-Z#YtbZc*Lp4DX#qo+P0_?3D(=@<^2&}0f27E9}3t**r^p$DACy@
zG5Sm`UnMX+P-ShDwvB&}!%L&x#=aPehpjfHVT&M{jm@c5!nDa&oa)dry~sCmV3cNZ
z&COE%fX}P(3<)ZM?TelHvZ-kmb)LXIch|G9ayLX^>ScBO{mJ&&++)Vx={I*5ktKx7
ztwu5#JY()u6mNv1*=SlBZ^lxwVOq<*VqH&@gs6SLqgC7i7)&wGusXKY`#!?PS`+$5
zwlsOCwrBPG2oJB8XD~MJ+`!8+o*Bw9KiB=MJ|t`K+Q_6Nvp(i9AJIk{V!bfUG8Q2x
zjrd}<UPo#3&U=5CxBKiRN@U<L=|(?ce@pQq`BieaB|_v)vN(RJW%S;_@n)N$b?tR-
zboJ=)^;)XjxA>uQHetJN%1ohoZ(yR7aB*hp_EpBNsr6ZZ@uO!O_syik(u<&k?4DWg
zt8k+BbYfqH**-Hrk0wgDl3bbk<p=097V+=BFF-`bCgjpEA%`KAC$^1SY5|>dLB^Ew
zJuHtGgmGOg{enH~q1V7YKrbt(Msr*Zh^lh+J?1rIk33XAe@`hiL*fb#N*lXWE}^J&
zzsul}@iwM<<U`#UAAUm>86MK0tn?2}P&>K@p4wQl2UKV#nm3|C%!_wPhHufHTc}U@
zo?__B`vbZ8??M3|4GhIx@#BPUFq}k;-3#$4_>X{Ig`U}<gCz|n7b`Cc7Yi?P7h^9*
zm+wzxkLE{|kLE3`kLFK13iICutcTujvetA11(gxaA{%<vNVdy}<WetWKZ`8Vnv!BS
zv+}^@q%A^h&_*9uY}Q0r_viSgz=`9Hpe^jAK7rY#vsvC-0!-Z7q@HU0i&HKdMaReH
zRGN=vyuBgx38I3B$bDJncF45m!;(P+)zOs{g#5C=M^Brw=R%%{WTtGel%25Pe9PqO
zJl7yRuSVU;+Y82~<+8)kp@LK^7pI~}L{QZ^ao?3{-w{o`4)0gxi`N<SgmHBJ!(c_?
zLMf}^T(R-=)?cBxAF#);OHbPxXWXQ@i&C6ata1hIQmAhJ_#10S%M+GdSL|F)o&dEj
zi)!G$kC@6Wb$->>gIYJr%wHr9CA6#7J^5E{uf{RYGHAc#*O*kY`1J4~^AKm9C);`)
zKe6(R)Xn5&H_1y$uOI$hG5B`+Lu}nfY#k!D&M5IHYtenxuHaE0E{$3vjaq<8om$$w
z8D~oHO|F<x(nSba*5@-Nn9ayEwn!JMeUa8aZI3uPGNCmJP1uD#2>q^47K?5ED6fE#
z5+1hG_d!15gM~`%_u}_^Q)HtqW(7{fM|LgY{2SJ8?9Tuy@524@F}jCjagh;cxp^Ro
za$X?mf@?3VxjKE7cEbQ!FqTZT#d=V>J{gB@=${X`U}6d&$k?=DpcE~c8fY36mi8&y
zkiN>Z;VZnvO%w(7Iz_X%aRe4UGA=$!GzUG0TNq;Z9<$`lavuQmmMwkM%L`Qhvb;CN
zyYdWy7*c-rCmtv>APjChX(S<DZ)G?&K9zu;dbE3pOwL>(ywJX;Q<&!Z=J@iBLtc=C
z1Kw!xUmc8b;EEn?zL|b@Yd4brU6L$BxmT@6T@a-I^xiu_1a64*I!yF=`I!-+m7xmR
z+<0*S|7QmNz4G67=;9B_AW5?iT3EU)d!c*hKQqu;MgJ0JvwnI2UA6!8A-#e{et3_G
zkd77S7wV&i3C)xMiinOYLZO+z_h^;=6Zm$8iS<my@bEFz=jT72bpHeX`+&by-$_M_
z{RzH-8R{Z=g`rzs-E}x~gr&VFSXQNPO3z))H4%=oCE3f4hj?z;E-jv6E>O>Amr&1q
zmlV%Pm%PU$mxRY~m%2x&OW9+fOU7fFOY~#9OXXv#%SWdYS<P^B#Y4wBe-~;(1Do#%
zGuPHtE|`nGP07cm%YAv8ZWR=VwmgeXiN^*)9Wtee^MFHiH4C9W94*Bv>X}JvyF<+x
zYoUIW8olpQTC7!=AsM!<f66NKObAP6=a**$k2DW;Z<?-!Jy#$6ycMnp4=KkggwL%H
zmCJ*!<7XEi`VOtUcabYz4w0*T&gyD?ZX`9^-8W10ThC`sSFjFI?NV$!E^UU3tBCCa
zjy)bRg*t9pHmz3$$0Iy&=jK;>T@_C;n(N&fm&ckXNY-?1P;bhr>#uEVf;@N^yIU5I
z)>qPRzMhhJ(w_QwhTr}c8ujcQJzuH4Y*9RJxXl*oe4J-l%Mc2XIwByM`?xZq*NHgi
z;uYLVs&B@7mVHd)leXNYSh09Fcmw+c@Z{FFD_>WiLp(n`^1mOs(RwNH=JV|oj%l|j
z-z3F&{v(|7YDhZlTOWA~|A^I|>fN-uEIfH?lDT<XId=KDi2LAw6!vU$Ec={wv;Bf{
zqx$mU(bBiZJ6)u&t#hoB_rc*2M`X2aWOcc1xxD7|>bCCmA`!i`{`4HR_Vg09p7d<2
zg7mt)iu96qLGjLQQSm`>QSotXe(d3Nj`jX@vHXE_q5Ls(&h9>Q;q|P&V)e4Ue)ZP3
zR^;rpN+gu+ar5hUU!3`w7XZh^3rCEVFLtuQD<jA73r|(Yi*VK43w>4ov#c@c<LyA(
zO=dJfe>juV(bx2DiffceF8=YaVVGexg7eYS3Xub%3a0~E3abO_3a<mnqkaR}qrV4K
zM|q;%(z2o>(~l`L`MW7r1qCHu93`catChJnj);yA!$VM9HpZhz@AgJVf9+AxifC;e
zVK6)7N$v_XOWwM=hLzcyN~Wg0jYnp#&ZWvkLY?$s87F@r8OMLZ^iJZW?3{6cc5XOQ
zr>+SSq;5CiZCff*tIi3Ms}7b>eZJc9)AVO(J3nK#FaNdZ8rM7T^qKF3`OJ6+HHb#(
zs-0B3zkm1ebI>`VeB2QTdViVT{nI<R+!X~if&b8c*oedEb@dpsW4H5h^i(o?AMJ+6
zpTrlBee!8~Pjw$${%Yu4P1K+38%LZ|<;z`F5+1HkN2%Lp)JFG;YjZU4cQsEarLgEX
zoQ<|QPtJ0CI5D!63YFEw;!9YX@vd1F^kg$A@8#Lj8MPhdMe0JJ_?7)VXA{2UOw$o@
z%^{P+%Z4)+w`-h~@huHl0w*qFphb%$`rZ*N;c6EvWwbyWLRtCf2f%2K9C!mcfKSb1
z!`T(GoJN0g=98HsyG|AzwJGR`1C~*@l;)mQNCKA2x6$XGBLQ&DBEytyk9s8FR`IRq
zSwRp97$KLk+${}o;gLV^1`+@l7w^Ga*DUc;dZ%!2fahOc|F`b?q3lw(dccB5>ehGy
z?r=6UYpj&Eu)gi=eFkwE{@L<43Mk05Y%1$_jyNri%idL-0M}(M$_V|NH)|@3U-{tg
zlK8>jG+GyPmbfO)+k_@etl1CTAUD(Wsq}d&7qdFq<zz(ZWlbsB<$3?ylcVF@lXuk1
z^OSF}66AK{UMQH~K9#OZ=VGRq&{S<Ey*%%fb8_^lP|&mT%}woM_Dc3<G%mYIAh!r9
zM0&wUo|PNCg}azTT0F@`Jx^`xU&k+V9~Olw(d&%fK1q1G>XM0b;pgn;Vb@XT*}Lqn
zyUpA-hh@XBiBECZaI_bG|2WSu9yt7MwP$ARiZfa?FaFW0DhU1LStPB$TJxqN9J#&N
z=5ASDTNRurMNtH}l<TP(n$JVtp-t}pMp*{&EFieW<32$*T>8j<!oYsgn<_-L`1au9
z`X?{KJM}>0f&k9UR8f%AbE=eo{%zC}U=&QPU~3j!-#Q}swOQ?n5ixQC<l|`OUB8+4
z{(xw9OMR5O99iM%>f2?$({VA?aJEdUr<=|&8|7Z-bOXa)_QO!e|7F$zd7`hk)?pnk
zN63>+bv3RP!uH!H02cWNtcjge1DmI37kJBZ|JSYC329Zb5A3=X<RO(u<FyN+XSc?-
zB+?>X<8+*(as{et*c$3$Boz5(A#WD$VzeCeX5=#?l9je)*oQlxo(od-c#mGUo95Fj
z%*s-OO&8E7T=rM_UEH+jluGO9G`FUcBLo!*cU>*h1dAO|a5r_R`ZQVk8s}4kMq`sJ
zx!`Pg;134s3@xs3WwY}&2-qvR0F_*FOvszOZ-)40+HZ#RW=3ze{3k1C#>=jDr;<mq
zpq5>-1Oha)i3_Veck73;1|{*}EJ0O*x7nnaf;0{Ju|l`mG?{|V4f(^dhYgGq>+$DH
zx?KVp+p0kh*yoQ*5BK3!6j%Q4{E0qjucLXSI!>EIN35Z4T&~5zK5Bo*K3+LdK7U)P
zLJOl4UX0xfGAw9SYlEvMO;o>A_#$GwslfmI?XwG=n!xSEnCBGkL6Bg$58X}U<M^1g
z^9yU@?rZ4Z%l1p+vJVWo15ftRyJS^gLYY3}HsVl(<qT}tM;nn<NrWEZvw)DITXP0h
z)+qwe=A}Ya0>Z4}qrG##x)cOI6G|k=M5owC^OA!Yff(x)_2S0KSehg(jsg;DU!$As
z-$XHwXn|^hVR2t_^g_9Qg@yn6nvG@g3D*G4B7x#DC{%+~JO>zB6Bq{g5Y0nB@pdG-
zgqn0Td>0Vq*MKE`6^)KDxdcia1!6#054mFn7C)6vj-UieJVj7IXwvEz<5DbsfX)_v
zFcCR0;;nQ7io=`%rF9A^(Jga&N4bUpP%sfAFaik|-7UReHX5@F*rU4}0@}*?h7O(u
zS7Gr}>qsoQWH0~~{t3yKjpqC(BpI|-V*h_p_a0D9MNhw|4QV1GO+-LIdJ~Y|y9$Kf
zn<Bl05;_6`MhHl63ZV!>=t>V=A#@2KO(cNSgchWR&Q182@4ol$dh3?&-nSm>tg~nD
znfcAkt|#GSZz`|Jz<L@fu1gU<HRPoTS~H2fLrr?d*ZSAEm80=RxwZr&-)7&z^DLym
zLE}Nn-*!Nb!E&OGUjeX9Gnf)*hYQNEz2a)0A-Z$6p?2VLAdo$9uy=dUc=X6sGPiI0
zsN`kBK&iyLY5dmD5jh+0ulTAr-7I!((jaS!uef6GyCJN^f?J6Q+C6-zEB_%^5W{dD
zns@%(W(=LX;X$+Ka6zkNvmZvY2YVVe-20}NM#&#yNZRDFM52`N-jWAnl*C08!n>1}
zXQNT0STK_>6|thuN0iMXr#L)5vP;zZFsMC`QdQy3Ugx))6wntMN>RjJ5m@Fi^51u$
zY?zYo0ui(KTR1W6--ja3?=q6yXQavE#Z*?gC}ng{kOmpLMdq3G<k0PX{MCNrjFXS?
zNm;OQPTqDoQH0=+((AOx3aNLFiNWU(vNM(#__KeKk;)gUmu3GTls<*&VpwSYgPAw1
zz`aLFc7|u;NxlDI|4UMVhNUs({9idd{=Y~r-v7}17X;qaKiIYM>kpME2hGWOw~EXf
z133r3_r2SM+9Le`4HHt178){W^ByUBQ!Yt*GcK77Q<!vynWLnMxuX<gIVjt;VmEue
zA{Lret_jVm7|5P3FN4aIyF!~Q*0X~vvY^@%0!WpKO=Q7@6>@Q+6=^VW9Vt4Yg4~@b
zK*ml`Bl#vqk**UUWY$C$(qiHSIqmnS#nm4)+Yl_tGS!-`vk{7PJWxcF2Q#AiWO|N%
z=WM)wHRRb=hrUzcdG0O*I(MCvQuswI)t*Fq2FzVQb+%bMwYSmqDRBLr0IxrTumAqi
zNOhtuu_6hqUu=|vMo&*e8bh+({NId@GA-?SHL$KvPxOHrK%9*#*{iCtGcS=j*m&eD
zmIO9C)938nBP{@oAH~M|8#f;zm9US{y8baBcyn0|QotwP%TcnYSu{HZWs5fSr$pas
z7?YaLUWcNMCFz@Xv-h!VXc2!1sIa*KRA;eli5Bz)`nYCi%`78ju%XBkVC!zu^wR0*
z%-j*m9n|J+A~gpua~3OSrSwmn?v(q*^wdWNrz<gJwI1)E;OPk0Xs$smqGo2OQBq46
zD^0K_S}X(h8jjz;D!8&aBe>0C*?LLPce0rjC*ltd1~>nl`6J#m2|sC`Y+Ubsm9sI6
z$yuCTvfiBCuwI{Co86pUokh>C%m10(l3$X?$S=rm$YbSK<X7eA<rn2Q<<au%ZJ4${
zZ5wS%Z7XeSZL4kA^Ujcgkc7V~9XcpV)DTI#kAm;Ta_D?0I&}Gb@~rzTNxxlp%^ydM
z6T&$<G`5ROo<-U>hgG*>ZQO3w{Ni8vI`gq-<#Fzy{nfG;W^PvpI4Os-TY_}_9<O)B
zvjtsS-@Ty4G5^)0xwyDUZJo)UX|@BUBmzkFKS$n6yv?Sa`Q~9n47cr7x9Dghny+uz
z{1owTdFnm%DJ*%D9}yiLZO9nS?RS-@J#dJLRW#%3X&4L3g{+Tt--f*ZN=So@Xv0>p
z`-aKJt>DsZd!bs*>Ge$!+gc&lFlU<=EY$<kQJXOb&zegkH}3;zPuO5hAyo$Wt)4C2
zCP8bzDYB3KUcr)P#u__-D|=tFWF&rPNJVa>BVRPv?S7a+GT8h3<W$Q@z1plqf)0$3
zv3`_}Eg^BDBiLoF`e2#S4S8glpN(UENZD@F%uwKH+l<+ZxmEsZVrk7yC8Whc2=e(!
zsAJq&;%<)I4>J!+fAL@J*$JCH+3W{SXqFQm^k=z=u7jFN`}RN52bz_R3I3o>QXo-q
zzC~xwl6VbQ^WbI)(DB5mp-gUi6WG3TP&?=Or3T&Dx_PZ3p|!Vl%6e_qLCBx@7avMy
z(+I10!i2NNZ#Wj+IvX;4{*B2Y3?uItwuJmD(ImR5W6F0TI`MtBUwS&X#`-|qFRL|W
z#(v8-a%08~-WnBG)&5H8*Ido^L8$ns{5QH^3N`izFY7zb!R}wf>@7Cir%Vp0>U-q-
zZ%_67n!9bw#k4^c70`Ekzxu&SnwRVs=wfgk^y}m>BxsNcTj#Cc%9s7*OGe7(zOQ%7
zG}O}LtHDo3tmU6L@BYA7(4E<V_zy?W(pg4;m`Aw5jK%WUUvbH!SqE5r!+6R1CP;Am
zwp3i}TsG(I9Kc}CJM*Xyz}NnE^!JeW??YPXz?nIc_M8L2)&6O8%45-I`-@NIL9n#k
zsWm{Sy&V*%@T>7V%Nhzp>3@9qDm&{mBRll`39MaVl;Mw%4-jV}g*#k_DxKd%TZd(d
z{+dI}F0pvNJC1_BJl8|de_fWPJIL<o>_bw|KX5dJM~I4B4hC{s4g`v$egz7mx*1s7
zIzHZM`xz*On*MkXyQM`==~EO%EF;>%o^8_kDtoe1ND9;`B;)bcQO4sPy>x7chg585
z8I)r_0a`fkj_m&{=x7v>TO)m1Q^Was%#1||c|tXC^e}nBEqX~ZSG8X{i=7s#!(Nvy
zkkpMlcuI~Qc*^Lg@i}YP=yOAjkaz5^@8|YiZM*1Qce~G^$2*^QU)hy|xJCMoctoa;
z<V1#!*sF(+M60`x_;!*&vejKuR8uR^_pcYBF{c~v*ut9pmWtOOO;u*4E^u<#!~32|
z0TX>bWhEO<YwMJ5IXn{c6HWQuWcF+ZrT?q}PMdt(XrFxC9Qe$?(LM!B->$Hfu6ZA8
zoGO)GRQyL02)_8fFK|d7b0HIde?Gr2j&J{Sf7<qv+VU@JdBYv#cB``Exsmk10fxs=
zkagMHx>XX)%lTQ4w=3S%TER96X()dpID%1da+y6k6)ke~qYJgT(AJ};6Z&h7qHE~f
zbZ(>V&%h-thO)~H-n2+{|K8wl>yM$q8I_vm>%<6**a*Ka`_y}1&akodSD3fk1y9k8
z$`K%m8SV_!y{^R%)CEcVAfAD2nF1@GDg<!n(uTJ@5h~_s9{hQ4BSbqX#9)ayGSA^^
zX44Jrb>rFsBB!8okSLNt^B$I?+uf4=l}5SV8*6RZg&)7D92pW!-#GO6eH_I?D>x%T
zLW8B%4_X~Qb(m{>`!b~5xUZZhq5@Mm`lho}kdV6?n;@@;(4}kvv|PxIaF-NR5yhy$
zBgSIjWn;iY`4W}Ck4nD$@n1gwrgD5MK=%*$IWrADQ3@v}V)kJ=S6;i_Vz5&sbmS3f
z(FUYYMP>GS3n~9-y#byH;_j?Sc-}~%n=?%^?wj?g8;d{s;Sl2s4rW+etyh$2b|2XU
z%J?))GgE+M@<y<<PVc8lwLN9<|4O3YYnrC5@cN>()i{~2gIXUJZ=gT^*?N`9`(z<8
zSoC&t!=G=hwCJXW`52&r<zy@Mr2kfT94gpT0vGza;^Yc;Q$E_mpQS?u_37}X|Gm($
zkb4Sf`3M`Ys6{nw!J(D^Eo-!V{G5O8H^v#gL-OsD+qh>fJt5}zuSn<Lh3PVTBYZa`
zn{6+?zj*Vr|2U9Km*>5KPTsBe1q{L`+UnL*2HX_j)Uz(z2bBwgq$b-~<%H#^UUe#X
zm1zL&=xJiM2Yn+O!YCyoCo_UY7PLhtSV8l|kt`Y5@k=|vi&j7h)Whzu+*u+JFHGL>
zcBTlR6#i@P-7lJmesgERkMI4W%S5Q5-auV4!i}lLYeAm~24#Gb`#znlk;6D}`qmST
zrx(9G8io{wI+Iv#QhyrO_`c1#C;XU-EaV#0TNxH^0KmLIJTP(0V^p-c4ucLirsz2i
z2X1ffI_7CAnY_WXW&Wg6H__pRCnNDW2hV=encD!VPtCA=n&H+_sz|tARLx9rJcWeX
zmf;D^fP241Yim#9-qc5r$HwAw;RiZ%;gx8Irm|7DL%__y_6QlU+_Bq39+yU6AHYIB
zoMoG57P(R<ApH~}j^t6?rPlaFRK;5KO|k>=XOqb3)6J-z88&p%J)PyghwqHNj_*0V
zRjcZz%LPeB1{VIM2QFLK29!Y^3L(@!5U|51^w5o#Cv=`NV&(SeX?@0#WXXUuHsUX!
zl|KWoh&^l`Fd*Kcl=&NStawHRAJ}gmax)@t#p;Pu<2rQ~^cH+c7OiU&YSjl*q*+)p
zf+A9{aI7xfE!ltSSYp+yRZ`QdqaRjum0SCh`)6xFaAg1D?WFXQK>c}mo~Pxf9l~8#
zQjq%rJxx5HAv69?{yS=x&zB_R$`g6%T-CTP%xUty>>kKSpltO_20lmj+^=hV5ujv0
zQ&QX{Lox0JE6|)_D2_YfUBe*Nv%5-0#<OFO;U0O@s6cp{3`>JQ{rvh&7d*F_W^Pfi
zGojIAUJpwq``s#%t8r`o2x~5!UrEotcC%%2CRzuc^|a}PlxG#l8Hj~_ZfXXPffU%S
zP(#lo@LP_4KZ`)E0J*NCnC#v*XTA5sCBkM}?ed!wet5TY#-gs<r35FwUOU$c^`lHt
zn6c^A!<o1=w~x@^{LKgDo(uUWjLiNh3b~gb!ccUE--ah<F6wdYZTt8KT_>NsVF+EU
za{>H8ZvsS5rcTS{QLAA|H*4b`KA^;d3lYE*F+MI)q20HV+Medthur;-qynX+H1r?~
z8i#V=^;%Zjw?dY%5%sQ$(H8+4UuYO+mlGAZ#DVP`QG3JuPaX|YE&5q!Qjfje*4YrI
z?N-o;Pm#wQ@H|FDA;r!cj}PeuA6%Gn#yT2|qC{86YTk#<cWe*!`55O~J7FVg9?RqR
z>I)0q{2_L7Fs1&D7Q+6gf0y~H$?D(LPkDvoBsYsK4{e(sknarnIQj}N8jKiOq=}B1
zO*%h_yURB{MFQoa?DL(}t<_uOgtAY*YLv8bVM1B0jUNI_u5YjFqv<LqnUmM~@zY+^
zKK<XkZ;{t1$z(C8n#xJ*@T@QV3{-RvV<AQynkp}iui1a~G0e2j<K?FwcQh;J8Bmg_
zvK&iDQ&KTwzTYLNI8^10F*3e7=s=%uU(OqpHLjRts$H95^|tNh(Y>l5$&B$HU(@TT
zXfec~DLX1$tlOl9GvJ|XOs<2#w&es_`#{ql-*UOoT;FeuW*Vp9!w};2x45r-%e2#U
zg*nRFNfrS--CriiZ8NwH)?=-6r949%AbcVfhkV{&YJ~jMj#=<IG8;@j#fw4kx*6O$
zdS&{_+@~YKLC5fvt?WkS`P8D1+mECUbIEl#PImI1c?obFY=ezsF08FuFtE21clN)H
zz3q8}Ku<>;W)Le9clr8Q&JWxeSm;~F7mz8UyM4VZC%gA+;J^eHmbP0aFP4LAdPUW`
zsTBsJx@Jw35w;#>iO*9;)LFd;(Vdwdb$6;(EI5}Y`kcZO&#T<8JLIi8w^?qq-r}VX
z#;0*NL#{C=JoIsC3H^Pm3bVTyE3eRop_b-4KXDaB<PT-Uwht(wyVkoFzQ|+9O!tnw
zb<1uw(b0vpS)STQ_N(Qx*z6rusj=L6-yDOS6(`E(uYPnJ29DIX)%EG}+w(Oy)e6By
z^LmKffB48*WQ|X?g{Jjw^q*#OXJH24yCNh(^Z=!T`FRTE+z1Y5)7y>o;mGh=usw~v
z61~b+M|H!4J<)r~VCK6OGQ-Dl;8#xltHMuY6q4ya20K{B51)RneY9^O^h~X7Kly<q
zjM$<VGM+ML{wx;Jy=o^6@aL(d*uGEW%wC>w*7s?&=e?b}@nnjP!ZY%oc!ua#^`uH$
zS<|}WWS_@K?Nr5LT(w)$Ksqdqo-S|Zg$E-k&y0;<8+$HHl9juDI1GDpc=16p$}u`5
z8Ijn|DZbQhaGE$|O945XjoZXoSDlPVZJ#YUo~{u&RfxzT67KfnVzqkaFLIH0t8(bF
zlSUl}*j&8><OiETt#sR?#hx#*Z+F<$l<#sG=~~r4^n3s1<b-$qeDupu(AoYofaW`s
zqchOHBG%+HF>qe!@3;IXGK0@RtKNG`B!g@v;08-^8k}GBio7iT?S|QF)_j?xjNf;W
zT3aluqcVI!#wg=A^5Q<P7Ted<Rrqq1B<@+qi|gH3f47XGW;@nD(6SL<&o$m_du{G!
zvoxVk<P`e}mfN+pI9`J+`+{MZ(hGQRSPnCKC8vg?t*;#){)vWJkY(Fw(%K4u0S#{#
z1vu!jRMq#tHT9RJuF_VPwH!9_a){dd9#|U2z2|W4<vo<A(@q<;ycvjK5Ri9?do-tc
z7VdYoa0c_d#1-SOPiaasR$W1%uW&n!h$4;BO0X^jV^$*cb~d?5WG`VX#gDT%`;|o6
zZ&aw(8uy7&NzEqib7ezV@^P#I?O4gYPfAeTu4M5Bnr6fU!^OR4P`rV^Q_~zv5tXCy
z|C<}u`BY7~>k^pwVjjZ-{GF8S>;^bALRmrSQ?9Z-;htBJ{Y)PwIjXogG&dE8r6uon
zMUc#B^56TSA-*m^7bg*|wy4ehabHc(PxSe#hG-(Yu++|*d7EzB$1!s6{c5N%4;dj6
zUp2P5HoRKm<igt>3jR{MJ(2&B!xl1i?`N)@rg}BH*Yw~T!;tl((YHv4#olSRYi3=X
z$=YsYN2%Ie3SSwPD8*BtFKV1bvQ!E-d^3AiM!nrwD|+ch``s8Sx@Ysnrk)20TWGIW
z<D9P7$BR2`jRH5W2a%s79=u{1^>P!<{vlsDIz=a)8=^k>wPG*iK<X^oy<mEZe(%b(
z{ghim*Dq_nxXqdzTN{g4Qw<Zh{JsTcpS>7-MO;C<p|SqTulG3l47h0*W=i}kcjDzi
z#y+FWUGJ%F-9SG!!?f&M<90CRIN9yWK*_OAkn(jox~9q4x7L4?m8n~ohG~RITIUPj
z8V8LGM=?`w?un>ywerjK4Ac(<N%;{8O;&EE)n)}3Zsb@ypE!JJk?W^+%r+UZ-m-G?
z*yEkb4NTi?wWd9x|58f5FX-(OP?s$|+XYY&nsZ(p_o_Ttlco%agZ8wFBb~l9?xy;G
z+=Whde0&s|yHMwCy>F`{Z3fQFxm%{ea+eOw5;|1gtkR<=2F=dNfkLe{PA$nUBC!;O
zx%H)%3^pOK&fl{78>}(qBPy)Z0G$fUPs&)*J?`$eCL{yF#m<ei9WdQ@Rg{k!l>0;)
zY5UXr23x<rKis;v6Kk^&7ILi8;G1B&5W6fH*yW<g*iSj*H$pk%eb?=c?GRTnvrWuc
z^o3CR8n;6IXZ53<6o00pPfbM>%VzTA8szk{e?OGhCcfSwXERQk4wqW!!M_wjOb$c2
zlj1gNgWJ8u77)hl0Jr}~V!{r1jW7IfB~a_QU(SAR6~pDd`d68y4!X=>UHMY%WiLCJ
zdJmPC_9%MG(h8BQlXk%i0&j$d+DFv;&)PR09IZ0Z5n*yV(t6?%bZydebfp6pq-qIS
zWpgA(;&fpHSFlg;KM|Kmo?qD5j9k&Q!k?&1%d#=~+$svEDW}*UnN0S%ZcN<n1B&I)
zYhnC4{-a93H{!pGOBHX<^uy_S1MweRqEhHT$FoyEVre$|E7zp@y1Vr*)fc|%7GUo|
zrSgw;NXM*LF=Ue5YHeR#phdp8Zj!!kAE?6Aa$cO`FSE8d6OP@-Dyy`FJ3%Gx3H*JR
zr#5@$6o<P~xh@yI9<1V};US4#iTftkl62^>rT4l4caM23?t4Oj&Z6+F>1hP+7BgBd
z3LPXg?>j4bS|!2kalrY<YIfl8jRe)jyf%BAMC7BunrB2Fw@X%9)m;L=q;$_({_GBp
z^x2<%BoP?f%QS22-O%v%*6u8OXKR|>=Z2W~2gWJ%h^@sI|K3L)6%Vdj6l@q2lUBc4
zwU)wwl}E-<?|*TpWugc4VjP!_V7id}lce`88?U%)4!>ivMkA@tEyli!+MlNmjTpA?
z!>QT5u$wX2!Oe`&-KE{?uH&E^-$@hF%L7-gW=zsG79;JnaF23!f)@wrF4Vk7Q-oM#
z4EU6L&EgNJI!CX~2i_r1<mza@v3XbMx!m68G1&0y67u2OC107CJ+Dqv4rD#tE$r|c
zw!$Qibz)3Psz5#@vX47YOrZr?2&rQR-g$Sm##uD?(Db{~V4J+4S-&yV$z3b#rut@!
zTyb*){r=9ur`g#Cr#$~Fa?59La&Wivw`UWaiu|8K%M?EOx6BQjZ&B{G;pl&}awb~M
z3fE4b5Qi)>X+$BmqFPfhlq>_gMNghfhd+N|DV~^|tY_?St)Pnw+b$r>RC&kOQ`3nb
zbtgXT$p`Z{ZGtOBPFIgP59mUI<1KQt$cOzM8)F&5gL4-advRlb0pVL52Y@v7NVTwm
zJk3IJjn>cB3D_jEX;!ss(;9u#X04y`fqusbmlPmmq)Pv0yWC7r+hw?$Ay9pKC2iY4
zS4|<N^zebz0xW+e^nTN<P&js5Z9SB(X=q5D@<<9JynVvm{wV0T5WCH`Pk^7n$6vo6
z3PsUhD2MqUgVjY}4T-8!AlBgu2hz-sTjN(W*89-J1v@`Q(xcYc9=BQZi_uw%nK~UB
zB`wD0p006sehKeC-q#Im7cc!|!yoZOgFbd{{n%G8q`mFdqxa?2T?*RRlaA4)lSAhn
zYWKW228CYX#TWefEJJ~tzu6z(7LygVe9|9BK}P{vqOtU;ji!sIi@K{3n~QAto}aK5
zqAW#R)78_SyDasqQa^1}$d7jO0nPRM$CfSke1}O&*t^d2YDVZvzJ@3$d&_XU5ra4L
zatk~Pu^I|b<65=-zyBU+H-tu3=#~m~ziy}CUA7UN&8aVrp94T6P4ehMxqQHL48FU~
zdDu{iv7xPS^<%k_lyfns@-TtSC7URRlh$F8cFLgXtytruhCBiMyF8$Fh2JZbiZ(|L
z1s+{nCucHUPQtov<Au6Ey;5U#5&9DQKPHK8p|R&3<w=KMiEtmbT|S8JeYakTy-C~H
z&UklgV1Bz7+{1*sqj13%dRt7|gt>QOi>QcpCH&z>YS81NDM$YIj%FuCw3Q(*hZE$=
z>2mD-q{&lhF9J&>lS1RNpSEYe(xQH~umy3PXAwRe0#QbXee_mZ7!x{eEVQf;&<N`^
zGt+r+(c35ugAT#^7P<|43zhVXxq_|$K`|1I1#o`eJicMO5`$q6{ji>wx(~jO7fyVu
zD6IdkqsbKO*n9Sd_>0s(K8#q4|Kl4Ont)-m0La+#p?hCfW$ZOWHA{NRXs<x->a&;J
zYYOkHPc;yK#U2>#Yvh@q7udcJy(PAz5$n46Y;2Sz^7v4vAo$F2_|AotuzdU5oE@$_
zp7Vj?Z@F*jP7H<}!fqaSgc(^<ijG_jqdT6-jblH509|W;Cwe;RB^4%EIo}>Wedw`J
zc`l2Zvw2T^toipv7!UKRQ0J?&<$!nXw}*C27N^edpT4`eZOs;HgKdv8Ia*)#9lvo`
ztuCgr`}IdwZ-5DR<8;f97Oi&GSv@=W-`g~|n{B$IX12Js7&Trwc2-?bM!J#V-#6gq
zTj|Ts&9~)Rl_A39B1BIQkLt~Qpdqzi#c7cP%a|KV-qn(jAt{vg8}S(WPtXq?O2nVM
z^m_^@@sm%0KJ#Vw`^x0Q{+q{_@;8^5pE<>wmM`tkZZ+hxu6U?XU4XpI-Bp%Pg%CXZ
zw56L{s&Qvlw!JfP=0_(8=Y6L8OJNDjd$@wAv+GXpFRtI;Vo?R1b~;sF@MWSe;^k?`
zx8u&|oKnJWgsiZr$#iW6pN1h4gY|Rna_B8d@<w$%&Eia7|5%kIUUn#P8r6|>a8r+1
z=TzZ7?@ns$JE=s8=X4&OJok(le{|4-5X25<V5;|(`MlbO6-H&z#hGP>pE{+KKy?l#
z@ejVm8i#ziJ~z&9Uc=8-{CVOB%`ZonagfxG>ov8qcgww$f7Qy4(KjN;GMS|+%||%7
zp6a`<t=z~lH?V#XSZm$|T9SzAs4CShR`T1h3%ka#a^afW*6_Z{8|hDvmgPhr|7B_y
zds7nH3Y9OmzrVShNgDM>gxdi!*;WcCL0r2{**zCsbs&FQJq8I#8tV!u7}E|ADn@PT
z=yinVeP!X^ASOEr4~-1F9%pmQ;+rFr9~G%6ek*wV&u$C!=SfQM1C;AJuDaX>C}n`9
z)*b-VOu(9X^7B4Eu9DOgw;ewbcS<=KO47?Q34%G_X%>{s%RUjZq!S>^P}zDnP=M>C
z9YN2NkHmZ0*D6>NF_D?5XmpH^Ks>cKz^?O4p6*cUwtE?*li$ZXeZ4k4<xu>VEE1Fw
z9jzUMe?#Vt15Dv!%v8Y0TvD5Ou6NT5UGshc25{<G#<u%m)Yyo23L8imiGNo+WbWdY
z4LIR#a4&f!TYs_*_`P}o&qyjwqT*9;KXq&M?h#R&m&O@z;#iBkS0@h~zg>8RGh<_+
ze+PRh=ORQp8uF{>!;4=BTq(WN#$-e~7cNNGK1neLUW?k2>bZ8-V;j76nh<>P6?4X(
zkLy(1(ukf-plS`X+&d>7Inm3<y;9xErD+X2e$c95=(aU;;k9K$*P6>6r0{I-oOa}7
zDjzqhx&@1!9lFz+D-fh$uosGy3c4_;YIVF=oE4&LwP6ctH{1*Th&gM{$MLCdnc#n(
za<?_iWG^%ha~6!ooDFpy%$~5|&Z$RE2J>;bF|!_2t#dp<?b>_i<Rd4W`8XN1E&u4*
zEoqG{O8SG)S1q_rwXKk;;0N+(a}IGbjavm@-*eF<6kOxwTa4}+zsY(e<773a@50|^
z{<p5_FC|-BBwHJc+UqFQ*9wpi=XAnnF@mHQ@9u-cGz7Y~+&jYZ{pQ(4x=F~=#BOP~
z)7)&d98*dRsWVa{Hy!PQHNIX>0bK>epw$N(Mr{Y$9LYSZ#VrJM=ft+9lSq`3NYrF)
zKh;LZ@v6%j$}JT9PI~NeACgy36%UL_l{~BL6Vs{P&`T}3vA2G~llMpVy1CIC10<C$
z50$Pnl`aF7ZVn0N8kMdZ)i9VX?>SpuKU-cVTi$Op38tarO?ub$rd698G;&|wL`0E2
zR?v{8P?L>Qm5o!A)mD`qRFxILUuv=ys<IVovP`<UPhoEZL{bAnFBG~`f<m|Vc)mHK
zqhV3eFjzGDKGjeiTaGnb4x^fEh^njvB;YtE;5aq_E2$wHM$-+lI!$<OWqG(sY?%-5
zVtl<y4P$K1xFPi1?s0z%imPeojoYm9BTYGhb6JZThAs)2x+{)31yfY{Q%U(#JrslI
zzV!|@??)VR3#O{_ryNylh8Q!?n!iqkZ#ytTQdrTiJ<9%AzB(~WERNPv1=!u)VgHi%
zzSquBT!cvMy_UjEMzxDgJk7!K^AUf{08zdW$IwWIs6fAh6<wfJt)xlq;X9{o?U99R
zQ<;+1W`$J+;5e~(;vA#Ht9hxy+()=UwgEi{yROyFQsD=DvKyk?oqn{!sq%9}kL<N_
zpY6Q2;w80t6I)KJ_k~*T3%y>uQ2zN9v1m6%6LtCYnOm&p;suy-aCR7(jJf%dD-gc%
zv3-T};+v&iO$U>N7d-|=2bOuc(7%c@2Fo}v^sl4D!7}y>ycpC$J~UR#QZ0M>ljkpl
zRWV40HvR+rxpafYd@-b~928886!9|h!McLUKf+6;aTOg?oRyi#kT0I`kg`e;F%448
zOUwtG*C9-8Vt~HQ19e<*Sw#(zp|jwzK3IA%c^3S)G%l+{O$*f}jf?8w_y~WUeWE#^
ztZm7ZEtBsV4k;@G_0R}*A*}L2J+y)@3u~*WXW&K7%C>F}R<Nd+7lltew`C^8wHTD%
zk@nat&If4>_o1FNMO%Ug9(!r~APwMJ)RTtj4zdjUh0ImU<PQ5RxTde5F8l%Yq$N6^
zEW>p{aJ117%;&sdj<F;K^Vu($uR*H?JvFo7#?l#up7vUnuGs^6a9Qd}b@X#yOEYT!
zMr4{XoLtM&B7499?#)@5jkL=1T-LS>&gT2#NvmZ^oLyGzNvmzCkzMxLlRgv9=TjNe
zVI<;}?NgcAVI=OA?OXY-!${c6%BM2D!${1_WX;kYT;{OQv}W1XVI<)-<5OALG5*-g
zWYtm*T;{ycv~GDFTxP#eInk(2=AQ&v{{+&esjP>rmw*Oou(s6xaY!)}_-kta3S^xw
zT$&Rro$Xra>8ouil<ivJnehR>?ps;WF)r%W>RZ{`F)raHfw9y8yS`Wejx_?vCWjIG
zBaMP&lf8(U&mb$>$|}fu8OVgklA7AT25D8{sjZC?ke)P{&-@6t@Wq;go5v6{MW9xi
z%0|dK4Ae@C6``KAK?4opbezC9$eGWc0@|oeY5$szIuS2_461@`@;73p1awAI83$?B
zMBn5_EpuXl+082Rzcb<C(*7A8b)sH43`!B~>alQh74;Cj{sMn0SL1iG$q@v_L?bJi
zKN!-igJ#x+12}=vNV(6R+1jWxX$h_QrVnspA1oFAeF%hHF^HX}vJ4XZ6wPb|2XX?7
zk#d!uCLiH1r6r!vH)X-2e6i2K&A$<H`Jh)cl~EAJO3*9XN*ILk6KIGRCB_N-jFkK0
zIhhI9@WrZun~?~)BG4jDWd<bJ63xkt+ULZQW@i<9wrZoevxC*<fsefke1S0?GfoRR
zV~x&alRXHzLXap8mXlgS9qqttX@gr?XoR6%QEuSouCZCu*49ZHtT8q2J#x?pKCOkS
zk;WBu?2CF0t)gCo*F6?;CL6DT8DA_|4>zij`8Pv?_0Z|uC?-xUN47<gr++5gOB$En
zF=M~by^bOSH%}w9hZ~K^B!&^K<serYEHkx)9(vXYuEYsUMphWXgSAn7(hb)0H?!b<
z(zx)B8OMbp{P6;05(tF$cw+)BHk4XI8!gU*y3Pq~Lh>9b;FPE(RM4rXxhIK`U?Tz{
zGlm!(lj68Q-xl?%@c|58$hj>ztV1&|f)R+p5h<|?2^6BW2;_3^@fH$ng&sSddrB=~
zLP!fZu@u<`yI~0*;S#<CMc~59DnYRWF*r$3>_-R;6Vl%ZS`4B5CqiHhpU0&_EItze
z-$N|Q@#&T`b%QDa(3HBtkdTUU0zV>4j@liy*9(`AgP!4`9bL8rTIKM%Es$V~#pLnR
zIr5^=%HiXW<trD~PrUdD_FL`N(7dg=cwi{RqJm(c1!7S^NFyM@8U)}0POKHdV`^<w
zurzGtg7YK1j*wald#w{f*B19$Cm?AHdu<V_Aj@Sz{xX6=g!^SWg9s@m0KS8qJS6~@
zabjN)07bP?>V&ig8qx*IT5%!hy1Q&q6I_<)LAXy4!p?-8T!y#K35+F#*T{(#B`A4(
zfL9Q_n0?}vdui2ip`K8WSsn{*1gj0-5blKfG<mVmMyS7rVZ`QTc`qWQkl;-fWV(cq
zLLk$Z`4Y(VW%wT<)0g2lLZ-{`{4D|M1|5Re)0|jWf?+-_lmx-BaVFe@5O#%#*BrsH
zh5JGq!C*r-Vv~^K;vq751OO{)TqMDBoEA!n0N|>PN+1ACe4I#%+VlO4SM_k&;<{|8
zHpqz?!5A?o_A5b$f)h(m&|%4h+YpR}*e!&P62Pk<Czstyof;QK5Y*<x>JS8TKfv1w
zjp8ou6-KC*lQ9Gnp+7csA(+MqiXR~|m;JH~a&p<aXihAg0N~DveM?A%v{26oK-1bN
z9ztq!zneZ{Z(D8fV)JpW#@E>#JZ3+FiolZ5en5b17(kd2;_=IZClV0kIFW>wYnVhx
z5sD8!N?vySNzQmeHJx<(v;`a=<*!_{iPfRkH}MKvT9&4SpmCgn`Ggi}hiLx91NeVK
za9oD)9YI6@x}6E9A(&OjgclR+s1)I{*SDJSkbPs;rI(IPAqojLWZV{>6UNR-7ozYI
zVH{z9nIA;huMx^;5cZe8bRz68`J;PnXv`(lz?gOACDb$`jnHlU5s0))XT}g|gsA*~
zAkql+>A16<BunsylZ9pEEUeGvd}wKrz3D>8Z1Cda>({Ed3y!iQg_MK@%z3*V$3>5p
zynO!2MRM9Hi|El|H1<N%cqi<~KQ;O;g#Z62c<tX|{f|)9TI&%-zndQF{yYBvDXRSa
zYKT)|JLU89gnv{w(f?M;NI2Uudw*B!-%X|X{~c8o1lXRVemLnmM@^FYul_{-f1Gl4
zzK<rxEVd+Hy!yu&2>)NCn6$R$9-f^U{I7M4e-5husZRBut-GN<3V&kGl7VlV^;h_3
zA^ZcwKPLjhh&j%boVlRqK2q?jfdrf5pDOTE!v%h7_(xOz@1mNgedM%;zYr5#Iak2X
zNtc87{{Zza6FKzp_^4#%;-7Z$i_zDT)~TRi!rXa5m^*dx)9D3aIt|af_-9>=o#ysk
zX!u;%<o#EAjyo4r_^K<$Pp}t+304t5=bnb)=Uk%yRH!X8>IO^v!t{UlKp($Wk#hpU
zghhy68}<Bh8MySD=im16>*YUOD*U&XG=x=y;CKdp@%u*|;F10b9`mn=HTC{g3IA=d
zcITo%P^7p=(SJ8?mi>bGs^!S34O!Oa2DL@_iR8J4KCpr&IOsJ`*`%#u>Ce^n)?ax)
z@9y;R8&+FgojMgisy)%K2B!?ACsr7xCk|yKx@-2*r`Zn0<-U2~N>{zaavLy|9u`~m
zH&LSdHe}V-P{gqkqaxj}&Y`9gb7~)zO0M^)@a}V+l89=9(t>0jBfXMT7ff>M{bJwe
z+GA3MbZcqeR83MG2N@FjNxsh?M0~Ruq5dS9>!_Cbf@%sHMm=?K!C5WMR^7x_9mH1s
zj;;Ebt@<WgwK`jMH(NC)TXhjzwS!~aMjc)<<3igm1JY|A-D?i%6{Jt9qf4rzN~)tx
zs-sS-qfhd^ljJMwYWL+LtJm*TBFUF7$(Jh0mo~{4&!SGU;$UkwSDjE%oiI@Ki;Ld)
zU863Jn^Qd)#{=)PRnM|jGpgBz;4f7>2}m!HE@_61t=UM`FDtry&Wt^HaZa^<w;i(K
zM>WO7R^6;>hl}pT(j`&QBvIT=n&D$(<Y#NvQ59b*Pij5#V4L2@Bj-hLuu@Gurke7k
zn(Ab$)=;%$$6so82{FCQ)Jbxo6TK^EcvmkZlH%x+<apQ^+1Y~CRS#;T-O8gk%&4Y7
zY}IHrJE7=aYkX9@_}GKbvwFK@dpV<fIb(V`@dTvTnkq>ff6*psQzvQDCk;xv+L52*
zCGmCO0O@sz?X{*(YGq{$wo(;0Q9US%cFT!&Ym0UZk1qdHo<w_^)q8Lzkt9HuBtVrU
zfR_|tvk+tp)>N%mR;|}pt$(gsZ?0P3{lM%`HP}s0wi<O<%6~(^RnsVy*U##8PBU9Z
zxP}$hyy%AaA0eW&jqC^ot7mOkfYebD$Uip4L&l%dYsU(W73Z4s$6`IJ+d=*rDc7@`
ziSyTpS@W@Zcl3@5?sWIDvNCfikZwyInLYiG(y7b_J!N|YNwEPx0_|iazDbz_fA-vo
zO62AWBb$eway&{)X$ODy@>YFH3Wz6rhF<!Rcnfe&mE70o#cBqH-bo(pd&VjSh2Bjb
z;JK@xY{37S2B!Md8Bmfa0yS6Ok)$By87L80x&~lkU6%9(r=n9yOTLwGeP)BTC6Y@~
zke48wRiD}eQr;TQKQVi11h~#RE~!nWpFLWfcpvJ`Dkh~(s~<c1gq7aQT=}UxU=(cm
z!}(p}Yk(+tZ2pPnQ!79X*s{YpJ~0ToLRK>5{EU@CQh?(#E36RwWTEzbVmEY!)Vagi
zj8$8zRq?4PV1TqSb#zBL6J)N`YY#Q1`57@v4z69QO-?k18q@vE9OYI1?P+e*y9_m^
z{+T|yru^H>T;*vnz?E$Eo3j8blT_=|URvk`-A~A9EZAq|iOo}bz&c4|@@SKClXnm#
z5eS{2_NImHgMHAo;fZBZ?%bb=VR3KwmTIdKT_xSwmdpWJWR3Bo4$47ZK_!XnQtpDE
zC14q(jp3to%D|=C!bEv!{atTrSOs`*xi&5_ORCkfR{&a1>&*w-e2eOK4rV=*+<f?1
z0mcNr^=FTawE^_|SuYdRkItJ5X7v`;wVI}kU8yZg42SwrdsD(pNEr~${;W9fpt{8G
z(1SbPEHF9nt@*wCtT<3mMIy0eE1)+LdT@8=4s4Q~q2GB6Ib$&V7~pXw<ijYV63cuo
zCB_rragFJ_v(0c4boSOUH>}}}eD`WaUIHkH5kn0<xX#q&95y@xy?rGld30JScVX}L
zurPF%^!N$PKRkYU4>;^7$wYF@55v8Y?^%5~jFxJp-y;GLN4E8@hU5u(N#F2!0K-Mb
zqxY^3lS1W5jzwUU;eaI{Zp<S<RCrs*YG+=GRLBh<GFYb)%v<`J&wUuX5)5?AjkyJ2
zxgL@>+N0#?eS8DM56}oluJ}B`JOJe02#FhoDcYd%XZTqHa&Lx2j#lM)cpu-w$O3YS
zvWHeddE}BI%(ZVu=@sd{kJ&J60Gn%8KUO7&IiT^xR{g6thV7wkx0;}%kUS4BY0^D+
zfX!8_@2hshX;8pbtFBeU;c+P7x>e_@&#=E__SIuS*q4a5o>i^kIw<m*RnMy1@IDlI
zH6(X*Qc>a0p6@UP6iIZJI4Ys2u&}2+oFJ7=+>|tWl$RxGb>)~8MwFK&Wkqt#1B+E`
z@NBxbCkn`T16=mu!Jwgn*Jrv{y@!P)L&$w(U>=d7eXC@{Owh_3XECEjc`{N~6iu<C
zVtLI{A;dnEu&oH}@}Asq2(*&uEOXR1Z_cxcdCvkcM|>7PN~ze6_PLG;1t{E*`?ji)
zr{H-kj8OteM4b1oat^CNL$4iE!?KjZR`v{rJE6d<XW-Ex#js@`K8y!6^!Bj~Y+CW+
z&mQ@(g4E3IV|tiP#QEUr?O}FkC{a-AXm(zY<P6a<C9GK~0n|jicLNrzq~qO0xkm%D
zA@7PF^-vUs%|+Y=v|lfThElqCHL*NFtX|d48f8&r0#HUYLC;D0CFO3cc^y+153LU6
zy#!E3s!N^`J%NncD5Xf9Q9Svx=RZsXxVRGMeayv;-V+)&1YF$IUfd&bA_XKw6oG<n
zJ&7C*QxuhwyPes!N;>QY(1}>_3?h4yVL?*+sNt~_50Gm3Cn`VB9&R7L;>CBvJl#SZ
zLxl2H9Pk<-5*QM=X&!FD?4$-f%A@z@yJZfspc?K+J-=4bQDHY+iXu}i^Wr0_m2Sw-
z6N7gtxq9=_*3vcnR1{h;CLR8bdQRN>!Ga<02-Sb1qO*d3xCzyNv-PcoRNg*3joduf
zf<uYXvy8?`1(<fz9Z?~Y7uT3Z{QIqiy;7F<`n6#P6fbcQPeXsCINF$KcmQrhRZG+$
zc*DJ~;(1;L+=!u8tfBNx{k*Z!@Ia#xMXf+XX=MGPF~#r!s+9D1xJ8|!jQ2X*Fdy8A
zv6i|)@aE=^ir2$}sM6~}91Uv`e#;Xac{6Y$$~|7-IPoU3;%1%+sEpN#5-4_Uv#+8%
zZ_=}j6jO(CAq!$^$P7PNm?+Gf1eHlSc>t|$23>D3e>2-#k)9U<A1B-61lHZ$9H<b_
zlK`!I4_m;;>Gq6)b=O<tEH;%+yvnXSg#mqUFnz1wQ}jR^a}CSD#~JnjK;Nsau@)u~
zvx60tdDk1qDfXCwRz%X#7Bfm)%M;^yk&WZm_vC^5H<&sqTot#_6Loo%p6k-X#Es+R
zd#pe!O6gP!{2oa!Q4vQh3O@usTx_!wNJ=!_kBfjC4KL1n*c*v<6+$nidf)^SN>Jb;
zkjz~K1t;M5(}dh5yuu+5f$Z@lUkN*XLePD6sr!zg;CM;K6G-$W8BQSSFG&c2^di_z
zxU_qXpeqEz!^kEPSkDNo_6~wEJAwrm!GdfWf#pnK>0D~vBxrr{Ca_WnEHeUYXoV2S
z?Ms#y!7ph73A!{JNsy8tkU2dB?AHWrdIGlPH$q<dGEdNI`9KimAOH$2695?qC<B)$
zu>@8FfwcZk(0WeLGP%^sB(TITo$n;DnlH&qTjm6*$xEpmf)tJbaQ=osQV^uVdI<^|
zm*i!$s1p<<E<+$C7|&{~`?{-4Lkf%uxm!#3ol8lx{HpRu&|jrHp+0u2{UTpK$$R3{
z<i4LNg+c>g`Pr+rlI^ScubUP1ituU*4j7sh^;N&+AGQC;I-q6d&?jP%E>-;_&HkBL
zda}K<S$dLv4*x*^&NZ`i{F!QI#)<Z7_>=nvo>!Oi5Aar(^A5OFmkSQuuP)~qFt2WT
znqFrgSjE3<Z>Ev%Yaa;VU+=4K<7e!x{>0DNS6#)Q)mvS{pVhacZzi6xY+vohI*?xN
z#xXEa?Z!SZU_WJ?zG*jQoz7%8rI&8fTb;r$Gf*AN|0UJl#LO>c*{FI$aG=b7N+n&+
zJ}{2|OWLw;^#;ely8V<zx<v1ey4eBMva+V7l4ge40G;`O&c(yZj|~}Se01guY-Su`
zcT9TjH$JnZ+v;bT<@=gmUYc9?)4X}uT!YchQCo$BtlW1hU%EN{SHUjHd&lhKZFkoY
ze@F0Kc9Hp({|2zooKf13ve2BxcLNABXOt1FlQ)a5MmCME`~nolZqyd`0xV*&ss8dZ
zR##-EzEY<&yWy_{_wrke6~Czb5T&I#?iVhQlS#?xb1`aMJI3u~5`a=rs49JFYqW?c
zErJ+ja2i{sn~sZAmHOI_FGGwr@0LkFGWLC5zLsn{E>^WxiYP6kE(^j-WtooiRh9bN
zj>kcaBsh#`pr*dAwnpuU(yI_7|3}6%X{KV2t6X$#$NwNoSs_N0kBsF~O~v@D){+pV
zR1l*CPGh+oQ!(DEwLV0tFvRE;by<#fd60b7S{I_!3t~ha^Zv2S@^X`fb!G4}$*!*(
z>>1d^r*yyK7o^XsEx{dXxkN&|M0LA=Flvb^G=B3*-P3`&?$RQ@&bQvZCNB*zKS*{o
z%Yz(jagOw$#KTz+y46XKoyTFlgJFH4Opwhd?Vhkv*_5n=E^#65yNB@|H{*N61+_Mi
z`L<2ebHUCFvjca_(z6x=PhKyWc^w28bJoLot6Y4ON>i#z#UR10!9@zJc56ewMJ=Nd
zr4zLC{L~HdRjs(8sOiMskm4LIRvF{7k)sFLMMS4N|G8&Y?2WbVQu*<NJ=<}My9q~T
z+rdC>)b8$X;79{U8^#8zQ#(yPeX{c!&ICc3s5RY*H`<iW-SyXDYrws3`s=%m4&mmh
zKgvQdhh~`8DO7DoqDK!usbaZy75};>soX45IS)MuIDfivY6CISh-q1nNu7V#)~UC9
z=X9v?*COfWOUotS=<d>|9roeQY)%};QxGG7ZCaLT*WI!f1h0bdj;@QFf&Rj5U)P2e
zTRqQHl#E()=3+4ZyYZ#pISf^6V+gs?_q*2wli>bM+Z&w>kYLBmgzPl9fBn%fDM&Dy
z(>P75oHs3CAr&C&)&D4BhsQ%i0g$66ioidrhxWt1=V1!J4?FGt*~Zv^7agJd{?=*W
zMNqBLV~OA5rgz-w`D5!TjWuL$u#nH(wPHSH3gP46I`(@$iit_h%I7n9r(sgqa?dKe
z`f(GdeaK#Rsz?4-(J5_+P=A4I!E(WReunC##<coef;Iiw!ypqM6(763P7EBQF)~@e
zqG6&Yp{@`Ij0t5tdvxsYBZ|w<-9cgKtl5tl+MhI~`NxGKJs`kEO4as1IvNeT&Lcuc
z3z*yIN_%|gMm}5@QcZlc8vd{%b=+s;XsmVx{Y=Jh!DC;SFBpjue~otSkSE7hYlj$I
z38>)2z(j-cGZ1o~cx<)zVl4@i;2gTAYu<;^aTY63fQcnA1J>!zI5sCRUz{n`!!#Kg
z&*a>L_7Z9-^TUcl=+DaD(w{Y}0{5OmnnnsZq*W8rFidAKMC8aKN0FLNY5-SIH3Ew%
zx!dlY%Df`kO2f5UC#mhxQ?b_^z<tI5gbn=x9P49?!g|e)1+n&bu#TU%J=Nuy`<!}G
zM6e5e4D5l4!bvc@md*kO3#p;QB$xwq$@!ymi>iZKPR`T^{FWyRA3x%D%75s|%7B=M
z`d(+C9k6H)(S&V%Gb(H8GCH9YUxuN9rnHQ~pa`2pv80TF%$@<q)&V}dO*Cyy{5E;b
zXh7jcP>Z*pzcoiQ%a=^KRFi?6jxxvgL07x2C9xXHU300oHmNDyu4uz0dh{6jNNO`M
z8@e7i0}Ve-hV}%sLP=Xfk+!oB(bs1mqZwzp(L%G55*=Af=_}fx^}h~{?uUhqApyIn
z@2Ax$bU-ZXV~agjro{+rJS&ZR>|v1ncR;gfyPkt@$B$!u_kd%1_x6s=J!Uqph=#}V
zF+ZtZYR<p5A5fn1CRZ2izh%$5esNV-lb9s@-JQn;Nms7$r(V6Ht9ktf%@q<7k}Gds
z@#$Upul_Xfw1bDYkM~QUkcWe(kmpNpkiEB%%S*qPLhAo0*S#zfdHh(?=KoTn{1RmU
zNL5`)SXA(p+e;9r&~O?+tw&=OrK~w{g*Mi*zwpI){X+vmvU<xUV>R;o!kq7jMFe2J
zS|6Q}S`@<aCtSOgoYd4Tr&kpE;r`^bi;<k4`^?wNrD_~Ev7)<+=!UH;>3{j(-@8k7
z%Qj~GN$23>WO&z_c$rMOe)-RGk#Yyq!Rn>~m-sX!e#y)kSC*htF(rFx_7Kx1oNZ_P
zqQbN)t?ZU&1D|gzkXwWItYRBEOfGN{IBMRDe_QRsv;LOGO384k^G9rxB9Cw3b2SSi
z-%fAW=Oz>bVmgJ$b8@r#vh*YC($~jnis<?fHlpL$A`Z&?Fpd)I`-S(VLX1|iPhsUh
znp}UUEApoainCaYmY0TNct=b1QN5pLbnVR^9~F&--N;&GyAOQvwDYm?6In%o3Ue82
zxwC1{yLVByvTj-2n*KHNbwKw;0OIclp$%c#mjV5{h_-jvH^^J8O|AO|(RYiMpW8Fk
zy@KhL@->&fA5|4h%D1uViwR7B>hXw|qU;Bg_3SRI61lyE<*|w2iL*<<E}6<RER8st
zo~Q|FHeJJCQt$e1@u|j(zgtNo>fwqp8nk+wBcxgv!7WcZsm;Wh)+)rzu2yj+wkwB*
zdx{=a)mnwe7pU}4q`Ei%^x<_!kJSb&ice_=zGQUVc<dt3!<}KD%}XSt>M`KIHWsNz
zO;Tr6>kBTBa#;7g884~1)BxrQQXpPEqaWeU71L+B<MT(IM8kPMY2xaFvO{-N?`t&;
zhY5{`)SLSwACDpgS(Ne<6M*?&6G-$DDC45*_o((yqVHPm3jh6>`&M%PLC_Tsl9wL$
zLS{*9XSo-wAB@i4`#CFFJ$oa)^;vl^=|+%&&*Z)CA<-@fk=Khq$1uO|4=t>d7XVMP
zJ|IFCNE(HYZ_lWpg$P4JKneCW=h~Gkt2eIvzYK||{|Q4v@?T@(gR76>IPDu;V}jOQ
zPN9w~tg<(+*@--R%68`(sV?)g`;h2I%2Z+i&J4R=J5E$%_}eH-!<@nv!xyX(f<r4-
z<*|ROX)5ad%mfO5vsBcl|MaU{tG3s(DEWd-LG=-d-s+5~JCHxwsKNOkK!dST5-t1t
zA9JsKll%pYd`6l`Q3&}HA@Wk2&gJ>F#~*mhw@6$wzZQ|ZzWeGxR%U5R+fhn0;SV<A
zD3<|?X_}62duC8L;I0y*1jZhG!an;v->5tu4XpTzrFF^C-31?8;}4oTd0VGziktou
zuG%5@fy7Lgt31l>PnFX3NXdde`uk?RFTD5j^MIHfMI}!?SEVuyO6Q>OwnO?lN@@*Z
zfQ<F{j*jG}b=grl){0a``?fbjA3E}8eJwt(<;|M@A-xycs^~#}uZ^xk@eu7Y`{LEN
z2Fp=R(2B6G!wtqKH+ja}-iS9>6k3nE%I$~lJd$wf))H7652<)3bnnIRP@2JvSmPYE
z6MwO=k4;`u|0avec#C{Od-vaa<^pMVc6@s%{f*SPKk>fMEnRWu87#3)R5hDjX_l?9
zO8I$x&0ITEuBv6G%vbwCK0y1cHqM1sUN3|1-JHDoSYO_rc>2(7sXz59g8bDg>`$h?
z6US~2-wKtfC852;%WcTVUll26_>^0vSX}t4VX?h(9r^gxfz7Yi(nae_oov1OKIcC}
z-b|P;A!iU!pV3cf*9P5e4yyvG$yJbzFS_TrVcgA2Y65qD>7#kkk6;5+dEnP^R}-kl
zN(?L{DvIh~1C0jDT}`c(@71m$p(V&PfX%n!-IH6|xWkI14<cQ%<|<5b{9zu-L!PSV
z&tVe3ey&aaW~VrcjFb1UD{AN~(Ab$I&d}fwH|}w*T{Uko@NqITmd=U@Z7(``Uo`tn
zs@6VgZ#KQ|yMw@RtMKO6yT()VF9Q&_6JmNU?v>YfE-K4i)%pE0?&}0u9iVvs>-U?C
zn}0*96vV&ZlsUa3E_!b!IDYDTpnTOJ>?kg0#y#p9H_fzLEK_}l_{~v|S3~hoGvSJ2
zJANkCmz~zMBu>Y-+PP?cV${6%1Y_73?9>Bw7<vW0bRVtB5fevJNhnxiZaC*fvZ^Xn
zpIE;9hWRhFy>~cVUH3jdh~9f|AxgB-doM$@h^Ue1f)Ir0z4sa|x*>=jBti&A4Z#q>
z=tQ*WHKP2^Og!)Ne!l<yuJ^j;+Ozjs_qx};);=@NjF~eDy1)3Vb@1s3N+LwVcZK+_
zi}@#S4^AxOM~~9}*cI}-$oE_#lN#{w`DFFj0j*2zoumcR0|F;m!`G5FX6|+a_^PTg
zlPx8VrYt=McM^FfsO?7)t%l*gZY}TQ83?c<q|mEdzJqH{**0R^M)0^3DT>2Isz3Ur
z`WUWHsTXDcw9wNlfxB*YtB1u{X)AfCQjXo3@bL4})Cpg6k^MvG8`l(BgCFu<(KEiN
z@sVGmY>R1CXq-x?Tbzu?#kiHQ=~uU!d2zi7?dSBSCI;ijEZZ<MqwrC67f#zw*OniT
zk3za0==Y>6WN4XVd`yN&75F|=yiKf7D*b_+{Zu1)&L^+1d3@1^vwSC$wT9g3Tep`I
zx@b(^XcV0vC%azSEH3xA5>F*M(Ew@IONiB78f9OCBecaF))1Evn|4YDe|mzSGpup)
zn9r|7DE6NghVKSf_;Wtod;Cfj5@Yg^qe<%(;=_WbY=^|s@<=LwsC2m_p4MF!fu_w&
zpW0AsPrLe5pXl3)viNh?V;Y<4DkcS__O}P_rcQ#`(@SD)$OkZA4=TP3wjmx+1=&)>
zB>mtTu(e9$+~_ybQ4Ye5owyhW2P?WUG+}J;@wk^e>}|-YtG|4;ja~LfLY<Svn)+C{
zyZ|xB+=##Y06TqEdRa&L&8_U#iN+x|%i^!>y-_i9l3|!^6IKMI@ei!Ja|l)$<5Dby
z$gFMHBWbtz)R@yOlTs{+g}?Brr4Fbkrlc^~f#XuFgdSMil)NVRUDcy5OdDWrb3`aC
z#jDmbuujbeHO~^9x029OyQZPN)Q<F+wju!2Vp!V{5C|ul#uKCoa;fzef?-bug|vGY
zX=uY>@p@F&(E~JeY}Vxi7QpYEg434bQ<eyXPmJT2IILCT<4G-h(c@BVh17ccX=v>v
zcze0h1f|q^?bFbxdDY$zxc2nBM$qQ)swED%_Vv3)(Hc;(P1^iWeM&$X-`U-dFZ^wY
z&1#*3K$>WHtz|{0)3uabO&#(iqzZF~9GqHnCn`0FOila29PK79O<qwxwBa$CczC#L
z^7H6`!h<!|{Ldim3svJTQmL~*?{MbezB9$CA>z&_fi#JGP}kgRlHt9~rI&#WfdkS@
z=<;a02WhS`1))Lv!h4cInC(B;vJyV`J~-3O4*NWewI^;Yc1=s)w_sy?LG2_Jl=F4@
zvz6$D%%hH=uT%&4RoT~(O^2sb(2EaFgx8ESLkmx(&#;|{uQ6r@ulp1CiKml(tDaz8
z3;V@gC$tS-56`b%TTuUo{35%~dc0Ji-XWj9{9C@%CQy~GLq08X|5_b-7F6nV^-(0m
zJl*a<pv3X2RD^nChV0Hj+`Avjs*Y*~rXg-)Qt_GZEkch7I5hkORS`)QV|rR?iI(OY
z3~w}Dpvu0)e>6Y$DURJ?;0=gZE*X?~*b)k}q0M`7H!&I8Dno{%Vby6U1%H$;sn5&@
z{pUb>mcXP{h`&75mtzT?=e<^v;p9JvcvFlPReacVQoXFQKM`{dMvwonmQa?95ngRD
z<}ZNZ{gyHO!fcU#LH$Yp3g_vdk!#`w<~$UfTiI_6EwQd%?)HhrU*oZMEfPXwzW-)9
z?4IOz?)0-{A!gZo7`~M9Vq8*U+&r%J2NGgDTku+^ZYo=GtXCLQZ$E`=z9OG`lMA!`
zk~3BFDU9)pk6Dd>G|wwt*YpDyf8*cGHHNnSO50(&ZylP|wELPIscQ7`-NH;m=_k0G
zO{%-AH|LtQ+o(TO9`18Dkro&d&KA{l=WROr8_q?KRLr>5w&0&uwC?*HgWC)9yQn9O
zQYz*9Fg6SJ3eSyXN}hDWHVtIZtvBL|3Eu=_YKzhIwTHsvOQ&j;#>9_GGc3aPhtvu%
zM3k8CvY)uH;C|bhy<Io*GQYe?V*xLLE_aMa!qM9_e6JjLgOt4Zjl}b0GEs*P!nEQy
zwkjHNud`@H1syk&b4t{-nLNjTlyAVS)syi0V{u6+1@Ee<JXH4_N-odJebk|XxjIkA
zb@%Qym7aLGZO1LThwHlKye&eS3TC<Foto8W0?SURzW1+)k!Nx=7Z2wi;(|b9RR8lc
zInkR}HyM7e4_7HWMo#B)c&BGS;gX24(jOq4aD4WXf1)X|(BLM~;h>K-Pq*P}inZ?V
z5UP;)RB-W8Ub~Vo)=M?5eHSW~p^7d=XOvDnTC$KfjMeXx3II!4Q$EvVELj_z|7z7>
z<~o(V>%W%2doe7#ur(`tI#F4R*5NUghu#AoC%WSrHEM^uUrkXSg;gYqSFK^+5FrM!
z_ri0o8U2Y{ZDM~I@m|56Pw5d?V{5NMCE<=vM17rlv=}SZjDvT~Xa=5hHpzlch+pAj
z`@x9!U095s%SMPIk{wFKUHYo`ou*g==Tbq<C6S8ykG#~!MRn_>zRj7>?ZUg>8n(?h
zbn4HMH3`s*O-y_n+Prveo6lJ#cE3<9XtZ|3ZgjP!THTqox(q@74a2lajO5#8fMZkL
z0@PPoR`Hs{;92>)1&er;|J|^7v7q~pg+?b!9S3C}qrEFREkE}c{WWoM*&<J21O9FR
z7rQtJ=A6=>t9f>1L0l@$KU?d2nXk~g1D{xZr8LESEbyX<L%m3}ocyitIo(}T+7i;$
z?Z>}1m;<@D`}Z6Jqe22Y3yl~9-LjYv${4SWocH5CnSB7CR@~ObyjP?Z@?!nrVqjq(
z{~n^FEEsPN?+B+}2j?@%R*_LiFiC*Ytq7c$kU&-@5+(B61TE+og~AzTM*5G8%pdI@
z`FQ9)HQpVUZhKX&GyXENI9poW3;v5s)Ws#OhOnG)c>aw8;V|E@Z`t66KI|&L5IFH2
zj>=Us2*|rCoTuH}dixW%J1il7>@6l4p`UWVCE80c{65RKmDBlP(=|BRbgNPh*-r)X
zy-keQbfU4?Up|ErDRi!DKVjN52!lHtT3|Rmv>;)6XpuG*`*klF{n4T&=6gJ6dZ!Pa
zM3|nTMj;T3R`jGUYl1Io*pJCJ_u}-0#0!%ch%oP3#!js~#*-n^1!sBDi@&i69Gpd%
z2(M%HQk06)JZ$<I%*kN5!SFLtCsu}5f;UkTW8ltC_G9{wUIZKq7thBqkKk>1<LuDM
zR5U35xGVi3l)adI>!Gp~M*Ew*RC>delO0Qaui0;F#CVf-?}#heJVy$_xY>5EWuDaY
zH2MqPnPUL++`^cN&afrgn4~0dNa*hmY>W8-KloB(sK=9fp;#a#@hSi4RTc1S_6l*#
zf#9jyigrYciZI981O;o=+cvlY<0PpUyBS+bfP|USvwn-Y?exXiTYnf9Ry<om-nukD
zAM?yyDCWuglJZuGQX+p(B*pc`hp4ygeE3iYU9SZGscLcVFO6~<Z{I|$e==wxYvyQ)
zP*Efez}H-_{3;}@I(J7K{WV3iy5Z<J|Dp|=@p?@>$h`oxlTU^=kcX*Enmh+#;YJ_$
zHhmi$+42f!szNg%Sn09pt+9&1Xa$a!CZzpxyiYKnr|Pp(f;biMekw}ogqwLN$o*6n
zqzb0zROF-T;`Qia;0>k9)uKoz5az}{)+%|Oci4~;JkS+h%3jGOL7i9u88F3V2@+c+
zh=07C#V!4WRW~_F=_pg%nXsv>qD?jALAj{@jMDb4CS5d%eY4UN^d|hHVFt&zitS?0
z3`8b{3s%$pbeUTp8SFR=2s<UPgwraRb-jw<0R&TSS#``0goNoxQ-$g2D_^8Vu_T49
zNPe7h1FIplUc}##>}4<2bQ9`f-_9tJRbz@xtKg_GPQ4e;5S`}0k^NlbO<#YcM7CvW
zc7}~zyp5aCAbSJffK%EJm+k?EG=^syi3urw%QiI{i4E+1J^d#VlJo4G#;N31HcxVg
zga=|WeyF6`?DlCyY5aVY`djc|Rl>v~HH~*bL-3ur4%O?D@l=oAeuRXHO==q7zyJsC
zbz)i%hl!O&Mt8q?_rQZR-UjwTs~^J>CeKs(HODB~9<A6!XtcN}*r^q8?v&B^P{4rm
z!5<P_kvgF(G(VW5&-233CDGH)It!GS?w-22J`fyEuhdb{3rLj~*pSc~)|AqwOo(gg
z_v#=n=QmU!Yq2CS3?;5CB(AgsJ+l!0-bGavCM!XBvP|HO^|TAE3cFiPB3zrKbJ`Vs
zt%Kg1GZ*HwCng4KZ6=ZHFl-L@f^jzE$n}Wzx(cSbaqGL%4)(4Ng)mmp7`?;$lxeVh
z_j_>Vw9}`grbW~5kxcK=+no5$v#1T;Sc%hjFo{J6z9*b)=mYoXcL%;FX0{lC_CDzV
zONUEIhtf|~HmBrue*L9A+cmrb`<2w3{<y>W7uoZt%qu!4l5$;FaY^pDUWX4a_(!^S
z_Zenkar=Kh5u6@WoKX}c>K<~;_E9ei`;+dh#qFE4Qvug&Upe$=WLi}8k8$Z{KBztu
z3Ze+=_F_E<u-|*SPkBXl6;AIR&D;y~$4S~7_kLB-V|^i`cE-GSD~MS4;PWE)6={2~
zz=}g4=E$DFe$}hk&#%VzUpg>c-TTrfUi#po>0!j@ls8K*rL<?#4ruLn<|5WgZO`6+
z3)xlAJFEE?MqMIzkw(!KH)iOsiwFtI@Lc&b_T=I|A}J{SN%v=s=%CEN`0M1zy;Ki8
z`P3(UNu};*x*Mlw*&d_<n#_x9V^L=U8$yAs0U_5Z?Oi<Y;*C~CK5?wku}BkeP}7*z
z2(f?cRZo3NJ8<9x;};O2@To}Qs0EL$rmIEHTHActN^mj}e(^)m`qQVm{<H!x#}{2X
zqTk$X=7Dgo<RC|iFMWh%{$IE<76kA8h*PWZAK*%p7yMH6x;<%i)Rod-tlZM5vxnw0
zy2IqUi&`w9V>aPtHz>fZV*gn(mWH`7e&4rR6W+(;S0fW+lGd*pO8pGcy);=kSuJ9I
z%!BH~dlyLFbszA8HAgLRO^Y$b75SFBa=J3S;e3l3Xt6Hb!M4$3j|ePjOD;0Pj3X<~
zuq=5o3<9AF@cUoZ@B4rgux!ui&DELfHdy4Wg%{;Ew{3VLea~V1*QoQMjM1K{*Ek^1
zGm8K5`H--v_|5r{39dKr&X(M%?R<`n&~yj8g)zE{Iyx&WE?TNWZdJTpr%h^XV{hgF
zeth;&w|E-p-kfXY_fka5;4SSXIZd8N=;bWS?S>V8&ei4ie<o@TD!vtux&PGWkRgW<
zr0rg=&0gpG&3_#Hc-k&767*+J4#X8+_SMysfH&L}pEp!$Y!jExD!5Z<Y?!q=rIBNd
zp+q$8yAncIT{^RIwImOMz#9v^hZred@)vIGRT45&U?FcbsY7Ut>J*ZAkW{f7t1jMd
zPA*LA&>mG?WZfh4AU9JfBs;^o_|YEK_#|}V)-#;%WM&K)nH^GNfjWp%yXK)#!6(l<
z^_oK)dA`=o6HJ1WFDlL2<7Keoo=JatYo0FqaXxWp_PNP1x8qL4i`v{r)rW(j4+Edf
zcNt>n^Z$88=J9azp!q_RrqMP(wam1(MabynY|gO;v9jOV^2%(Pp0doVwC`noafVG3
z7;NA@Ly3jk#GmwFVSM6EInl?j30fETddw@%a^F_Y>>l{i<Yr_W(EERUbW%0sd{D_h
za*sf~XR=!2@w?Umfj^Ykk&EsdC*wlf&~S^>v-*nLUg<W|wB43GPoL(^GWv55`?`wM
z+FDeYt~?ACII%1mn1M>AJ5u+g`;Y|`0Dla)BqNp@lmuTH7g5wSbO|i_^2~xhH+Chs
zrcplUXpUGky7i&U+3-xX(*@@_XLH!y9rot9#pj`Zi%)oFu}_5@%oX+Ki<f<RHnwBO
z`6`88HcZ4kKCYD2399_%;NtA=mzTHEvyt5?|6%q`^LWFTF~(|x<HX+84U@Rc5+0_{
zE$=7Rb`P!#3tqCdiA+Z19(gpq=V6qeSAD5$o%fa0BNR4!=T9F^Y}>rvgt2pFIbO>P
zpNm)ot8{wu?<CI;L*MNyE0r=8y(BhXWQOwh(agT<jf{Q!<)@l#^Ye+VhX}uirN=4|
z&h3wn^&Yp~^Q#PU{!skkb{W=*&C}a97kMoGbL*n=?^fQ8SDg7*znWGoQ(hHJD5`${
zzNqVGUHarEl&cl4bE4msG+{k{a2{KlKzK~}Rl7xV!8FM|ee>Acub0mDV_UlraE1|~
zW__p!zwc06`PSu~_&4mwl5N|~t4om*y$-I8hRe+xmA9~+s^ka+^Bh$S)~udS%s3v;
zSrfj=fOsa!9@B5rnD*S?TuE7Wm+X68N!VGfGV;*Hm5tW#yY$<;3<l}SCc8$tfwonZ
z#RK1q1^f$UrN2||)`@<9xRFzBZn$s51TDyjG|hoA-Rpi*OP`bPPqit8KXNg^Hu5s+
zgZ}<HXDg+cLI++z9USj;{P%Cr(W9jgw{mdA$X(GB78OGmNS#>EWILI0m~Kzqt4pwu
z?j#D$yM=KptZopmRbxhZ58TOiE2-;=@UMn0YY#`@!X}2^3`F28NufPom$<l-+c`7L
z?e4})T6OTH>u}2a@G_cL1zp;=q3;le;2^Xozal9r=T`K-;eGgZ$nD*x!9+`8Dx@Cg
z>Sslgt}!VdN7p_qm~{m+lKV8dq|$1SG3w$+Kr;{H^|h~#og7gxhKKKjZGsm_OQa$z
z_%oxlc#?_VT0VKAOkrsjUAzLNZ_`k|=U;x?<E4!S(KC&ryVtnl1Lc$yDXS{?%6rg+
zY!Mq|+{=m8Rk(>b8SDlo3Ac!tnegV`j^&$+ywCxD`Zv!)_{*of`>k9LoE4vRBQBzw
zFiD@`vwa^<GM09%g*D;d{;u}R#j^W~YB<iA-c1CLEm6&~8_pFkK^Fl{j2tNA$~zZw
zl(c-$=KCc{<^`#rIe7DK!}^EH_%4|XZ?l(<3;rh1Um)1@LgT$&u25#jX3`-k4gJ|#
z#2y>r!jE6wy6sEBYx*4zqT(SqZ|GqjcZV2$N7!G7)G9Fe=;;{<?5H#dLj)O}gL)0Y
zg!1jwXdq3k5?#@6#d|z$6jW^donuWbEExCGWc@(lzaEpM%RU8ZO>1b;f&~4f)iEs8
zNM%8ST)Y@0aa~d%H?C!D7Btmm5PK1gIB4Yqyt0tMjlUaxFN!77CBnO%F!i@*R<~CN
zK|A@o-=LwDu)5^kP@#7Ex4)U3BBC_7%0*tqD=~T@zSk+oa9wd(Nj|jrW^d085yR~;
z6M8DoK3PVYJ;roP=#uWJAbNxsG)~!XvRBc)_Q0R$N7ji#EJ)RAm`UCCK6_Da@E==;
zcUi`B*zh-FU*9-=qx`1&t*me!j=l2ED-?`Fz8h+fJ8f?xpo;Il@w2=(t%to?-06kX
zYZbOj(%133Vf&V19Hfub+O)p^>GG%B|6!Yawg$UkUmp01wJg64dq9x!yl8CBvU0%2
zRxyxpA3MRH_kh}h#FNcg6_I!}ttLgZ;a`Fu?;$hhpk82GLY^$fng`rzisKhN;F|5{
zWWAPpJt8=^k~|OjDG>FWyE_RINWMQp`+Ge3GwxhT_(p{aCtDlc#t}GA#{+Nd+cmAF
zFCDx>UH^J5a$`e9SK;-!xtg*pDgIN7A`U0vFee>|6w^jNI8V{Tbi>Z`Racw9P=VqF
z`;P^-s|v7u+Sx$Ayz)hyWgykQesWOs*$0?E$G(2b=diORm_OD2M!&h*1+}GI&Y44h
zZ8un7JQTAhJn(zyvPavi?;{z-Syh>DjvA~e#xbfus%pVs6$N>K{~t)Asl^2;2A39d
zP0;i1JQd_}LgOejrVF;_8piD)rO-y}7|@jw2Sw?5V1uL!*6}+Yaq$y%RC0aacoH~I
ztb2da$T{3N)#wyPlqw$iMf?<o!M;n7zPlMUqy8MPgOJ?|(?WJY7Ogq_#}(*IU5-9j
zCshEmL*rlqRK@aJt$!rv(p7B0OKH{XPf_>}Y&0$w9|=%{#+5WkSe*%1fo?!R`2_Ok
zrB4-cN%uyn<iHqH7M}t_wrkblQKTo8yZzG`CWOgRMYgj3c)0$!)6_lVrYA#1j@TJ-
z@$^_Z4zpawv2I}&sZa7XSAULu-76LBT&xoeStPXn*)iVxDn!w`rh~&ewPV{?GV=?c
zaeHqT%jmNqf_1RntwtJQw6_VgAl2S<V&McHrU&snvLdALqL^SPjGUDGHO}BVIjN%q
zt>Z_pW?QH7(ut`T_K8Y-)yjO6#2@1Eo8raa6O8Csd3&<w=H>o4V`a95$&o3^ktN7=
zvDJK*bt^B;dLKdHsXVWf^+7QR_Pk%5P$8slm6XdYUl!+Z|Dmqf>aWmZD?z_v2^@Tm
z*rX*=?oqTstRj5ksY{lFKGxUF!7^9uyvw>_3Gx`C7bbOwYlYeJ#6m%6hKJOavO%~z
zKLuc7R}k;S&*-~{MoZ=wEW(HK^%WPQhTY~*UtSP?A6~G@-1{(9ec^n<5)>snd_6S(
zbNAiInR&SVm67G$AYHEIAo9(#KV3c-$*!c=3eAZ@Tu1v!;d2*tdwAEzXW>C)m>0Wx
z<Y)3)TW9jxM*F(jlZPW(ANB>bPWRZ}BwWb9!9L4;!+24?0lKc;V7dO{5q&*!Bq`5<
zck#@P;aV+s_%r3<Z?}3gjCwt5s~nE#w^VnYRAhHQ64m=;p4Pqn+C-*MH4eLpW<S}E
zRDROxj$*^TVk&_i2i!4l=T9OUni)ck6x@$A(|_8NmppJTe)y(TLlnVYp`)2;+PE?H
z8$nR<craP2QMlxZ^P5J)!B;h-?@FFEF>Fxr8MWvSris}fmdNp$Bi>S~`!)R@(>F~y
z3N_?ydy{@|*D<bC89}z8T&*QloX5>L@uhUdG{WTD+pqdfbncPwzvb3Wf5mTV011dX
zk%|Oi_}G<OEhu1F*ALWlb5~TjRa9^vX==kMc~Xwz;^GFSu?%o=ar+86SSNY?G2QxD
z$*qR&e;vB7oH)uOw~q_G2wx$=F7C`Q?W3b<yFAV64d@docI(2io|~0w@fqX#xv&*<
zo44m4`TSjcLBe01HWK(XY8uyHO`}H)EY9VTZ-?%N`Lo5~18;}Y|Bp}qMZpq(Pyeg4
zaXlyus3KindQDWm-EmUj48Qe`L}^SzT}d5B!&r$bT1`caI(#Zz$DX`Jc#e^(2d+m-
zNz0h&#*o>$%Ah;f<;Hfm7@C*}1=o0glT0iQTdC<Ea$`*SSo<JvN5^V>Gx_kz+@Hx-
z^ETfg=YXlxOIQ$kFs&<Pm<b+*QXZauQ9gw5Q%-d-$lY5c6LRSNtsnYZ#&KCsILXxe
z+ZQONjA=hqj47`JN^Wca)HRhcw=UX?^YD57y;j{NI2jY)>YUI#-`X4=rcT7Tw}({H
zutnX2J7d{*f57fCRojhrS|orT*yo8G-)HUkb;2LSLgD)7%jM&M)qov^QF1Q%nYPZy
z^HSvkVkH}tlue9+U;MpBfva+3)dE*KVe5EZT%hWBirq3e*M8rnP-b)&-)GYA%g6Ta
z@r~URpOO7rn{h@s7S9f9k8zU6c8-0hj%&?VaCzNpH}2f|I79Aua!VRxzCC$zm)yck
z&#l#M@5zVSR(}Vs#p9Rb9^+vF`8u_&UJm_?2fR@3TWw)0hp`B?Y^59ll~ShD^Ydjf
zwAAvq4QuRP1#b5bdX2y8pnc2G&SP5XP`sCM{s$v3-%y~yNDqBYE@4DJ_`IOrpNK2e
z3cJ~&8bfAuHTb#l8b}~_JD6$y_~5zhuK%K!0`qQQXDeto)E^S<b@^$gqcx#!04>Kd
zjb&Zf(avzv;QOkt|FhQh5~<Ll<07-`#f_i&Gs3NJ<xW4%w#?pMshw==9nX0rBkpAa
z87#Kjd^Cf2WIx{C?4~hTJi9#Yo+w{FBENnQTf7oFNlyT8zZ3Syo{aITrc=_1b~U<B
ze)f9Tcqyh&n%lbPe1mFZk9P8z73W^qVPYK58+`xe{y6XK&wVTOpW+!^iE_7s`CRic
z0tW;#4wuleFYx$1I#gv^vb-Moc;Px(yH;TEuTYPz)_p~rS;9lZgDg}3HuC;`IXXp8
z*FwkuCj9dIxEY4_Ig)2%;8d7@C-mp{-pyE3-|yiVkerb<T#@6JFh$}yx8anu;uLh7
zo{vSCbyWMDv2--PT{y`>7iA=}j^D?~+0{8E&p>1fg^(~Qi6){XdG=u2)dyYlmMXhK
zB{k8F^II#*IqKqFtaEKKnxAxq?s##U8<_^XCOhqb3+&MAinzYcQpWl=n;0F?R=`tB
z^Qig_zx5V8E1vxDy<xzZ^h-(bQ#Ra2|IV-N?ZHo-Uw&2BjqiL)!n(eHL=bAIV(>7@
zP_XgC-JN+_=(fS{Z0s;hQOcuX)6>HzqCLP>v)#Nmq{P2=dCMnH>ytCwoBToND?XYc
z<+rX)p1r3fXIU|*eagpIp`a-Swf_OU!zdxZZ2AaJj&ru*$iq!%yKaBVVxY*>c33u6
z7MuL~%K{07$;L_t=ACbu58e~<mVkI&(+Prmj#-Q!mtt7Bm*OrE2Cugem!MfRreG@+
zB}joh5fWG|F=7K4$x1oj(A1${v(RY#1mr1R>B$rR0wLt?H(n-JT@vOZ+>@(iiPM^>
zJ4)Md(h-{XE87U%n=nS-wka7Lb$~h3RUd`uz8q@yiwq{qY@95w4ZinUl+Z)xb`xGl
zpyI~LqS-40>p>+t+!HmLi%gyBC=ev(<(=RxNS32xPK7L92k;HS^2ci1k|4<h#0y99
z`+npKMf<T)uhq8oK~1Tq@=dbe5;LYx6k0GHyWhzsvnnL0%<OxZi%Rr}jCzKqexci;
z7+#+4(4pBv5N2Sr9Ab^xj#0n3tT2Ae+7`OiYV|VxXkSOLNz(9r8t>kcwAD)pEN_pM
z&?O-~O+7H%#;7V+>)?rwBuQmia-j62e9VNt#)3{3Vf_ob0oF3EzPHxukF~?ntXJ#V
z1z1cH()&`Ja<5N}=QPf}YZh9_A4GX@i?$UFac_s<QuVj!ISe8wJ;SpT`;`;H<0<=*
zY);{9*{G4605XLGc?XQHkavX0IR{;0-BO~K5Q8O*aX^s4l8s?N6g3K?EaJe(knJSV
z6)F9|0yzrxxP~XVmW(1to4b;?a}w*Y*%G<lux%!@#crslEJc%Tt5eA<)gvd-MXdyo
zSN0Hswr*FIm>1p2nuLFsLw}cLw254Li8L=h{skM+ByzzMX?#n8<!Usmt~i6<596jU
zf3Z&iClcHA7dwf<+PFdNQrX^aM2p;6j-K=A7W@${OE@3<@?%C;t$RSQv}oMB02#m7
zr!Qa0b~QYfsVw`Iq$6z}aHlCG_0jJdMwuM#Y0<{YbWV4!kKtt0x<4Ph%TAK+Xz+P;
zyf@U$OUM1Fr$N_Stl(W*g%gJEYp(3w#zC3qZ<-@L*$+!1QmyVi%x`><3OtASybpe7
zlMmliufTWEX88F!+95?$Luis+@)Jkcvy`us#R)jDNzrMWsr)$b11&X2UhCUWb4e^|
zyfpa)AHd=VZ^w(I337D$#N!H^-j1*5ur>=lq@lLMA&nfjDdFr_7pMIWVMBf*K~Ayv
z3~cQlp5h?H!QP)mV)qb2W5U5Etq6R&ppGF1%<(#216PP6g4RowMv{X~Tv6?L)=~oa
zKuaw!H2wn2ws}?HB!ow1Ly<+Wl!s#-JHVxttVd%v%V4P`N~?-16x$U)&K7T#wsbFf
z2~RkeR4rzJOFLQ5QE0Ig2RdY<rI{?q2mGFg<*S_d*ju!emTKQlbxQ}b@>#5Xvsmr6
zms^=aHCkEMGCJLe6>FS92fVE(N>>{-*cL*UBCd!pOyQwY@N{lDkiJk)-@5cn*XOb7
z-A?hN^ee1rguKG{`S4^<lHu|BkZOdyWveHSr~PhM0^;*x;I`~kZ5we^Bk|&+ZDq^&
zla%{a0lY)wa-=%ra+K$dBjL^n%O$&Qcgqi+DpR$Wk0eSiA!nw4y3i4sR2qN2rxpi1
z9T-hC<#1eh^rF!^L+F+!K3;}_ef<%1;sqvx*Q?NeIxcn9)+QtA{(IB=^>)RMe2~^A
zO2+R7SvK2!He0J%j%{?~RiBm1jtz(E93|#`#qCUYdvL$^fd|j&>>d%XsL;bS-fLu8
zS9Y4sXk<No6!-f*pTx8$AJvpcu9Y7;zH{x$!x>9nGFqy*Y2({e78UDVc=dQ?amU7Y
z#Fh!_aVvY$joEzN-ZYaw>#3H|{6x3aoo6gCA3?YblX&EhwH95wY_|V6my@YeZJ%p6
z^Py9!P@T!^P`(G4{K<}PMIzWUrI^j?Qnb1m87o#B4`oz0d+$8J$<%n{`q6_mpWnGJ
zeN5E*jR!_e>htc2)I`QH<@F4vKGCu9sXJ}KTP2gDJZ&*gHL>d<Qt@qLUhCFkN5Yh0
zPP``#yt5q#u53B+ImVRF?GE?M-jjT&Q}srZrWCMY^d>!A?5U#v@Gij{x0Ob~)@af8
zm*Z^b^KPE$ZQy4|_QbXNDyN@(ij)nTtf$`p@XO#rRyta|{&e5&gnPb=XoY!7aF$zo
zPt1p5o?o{^dUc?D;7;_5JDV>kcT#iq_<aQD`3fRW`zzf(%q9@`2m0UN>5KZ2&<vT6
zBp#exW;@V6EBB|DW8FF{@t2pov)lQ(-*4Z+NB+tnkg*_rp*P^b@9dL5jrpt3U70_i
zXYc$8h`G4WVp9`p?_!?4UhWcqb=P0NqVK~iHJNgerI{}e{2`L~#N1nZk9(q+x#;)V
zR{bxGr(+AaX7=<~eJ`{=V#phLE|IRvT_{b*nRDwdPkw1QOL)ip*<ilo`Y!XL-m3e>
zliv?MaP@iQeDToJ9=ju|`qVLzzp}LD?eOTfV_tr-*oMPq%sI_5ML<={L*_EiO`Rs)
zk^ABsD--6M)0<)eslKK8&?jYUZzs2WHuHSjTOJAAXNH%R2Yrv5xb%(jRS+<^uF0%$
zSs(wFbo}D@S=$)Vxkqcs<dpuAsb8erpqw7?D_85sCokGM=L><K-Q9BE=3GDAes;{!
zYUJ|X<=dlQYa7+zyg=>UaQsB2Xhq7)c7BTR`1tsv_#=<ayl+W=uu>BhS-A-8a0uT1
z2A|*2ah__nPQGO|#PY;0Nso-bD!9ZlBCJ$HLnDzrD$M0qqaLJ^FZ2~@Q`kfzJgO`~
zNalIxlpg+ahD1;y`*XcsVyYg#!FYYD4`80>ma}6qecTC;a@}W_n^%2sU-e;X>EMu1
z3*J#wG3);p&gv%EBaco_{qO*);HGCQPew^?cm=g|b4!;;qoy`KP79Wg9tx*JIAEY1
zY-~Ak?71|Wx{haDW4p07HFTVyUIZzb5=<u%fIx#x|LYe)qJlU719>&0ORh-K``IBy
z$)x6iOJPRb7?sVVlIT})X1v9i2{h*3ESlNhMYo>|w~BV3?Jze8IKC6y?|j<R8grev
zpZh>zRgwJNfLGw**I(1Zes*4`YdIf4y>1_9=b|G?6`A$r2Ni^|++sF_#!2+!xrbj_
z(Am*hwseVnDG|Pt{XolFyP2-b8)xzs-5lhNa27?@0HxFFUD(*Rl4>o@my~-!PBMZ=
zzw(1>?Go;!rR4-k;776vzp_U(YIzx2@OV~fNj{<kKJu=4&&Xg<bnwB`>-M1;)j|Ke
z1{_!S3oYUE8R*-R<EhUk4l*7R$5)d{I;(E*YjD;M#UelQ?!}v5Df`LBST$hI;Eh4a
z3)q&Y!K&@|A30XndQ)7Sa96xC(cI3G$gQlg<W3J9VLCg(vL&oRnL+fy+ZiIWHUsZ?
z8)lbdC^Kewy^LQNPt-*kgg8n`rsUt#RvkR?Y+@JB+cZ?2R<(Tv)rZqOro4myQ%6LO
zn(tw?jLY7s=t!~1eb0%~%!5pU3c^Sp@g$DK@j+t=H5gXryTc8SSfUO&d!CFt6IKJR
z3>!EqiDIt|@orhq_SZ?-S1DY7&e3I@&+r*9s@^?*tWbqxlUR>&*Q)kN+o2UbB;n=V
zn#icYB0EZ=>UR$NW2y(wycg-Eo$B9z=VL3#r2O)|nb`Rlw@gV|@E&>*#%7hSTSVeV
zuh1}hGrhA>CFX!`(sPaIL?XFl6*L^F^rspl@O8<AFp5lan4HS8D0&PjbEnEvi++gm
zGNsO$eF@0{T%~9llBE<!oS;;hB!;&wC&lG)zV17aq(r>IWeVD5eBE|xf9OfNFIPDE
zCmL;+oNWGS$tQuVqjsy|Kao|Zc{`guzkT&&DKL91CI_goap|WI0`Ip`JGM4Q<HlOP
zXx(s0SAz*4-zt!GA0DX#J_ApT`M-XYNJ`#3O8)s?$n8?w=6h`+QfA-Yv%m~KvQbys
zE3)C-eJ#bPvy~+@o|{c4(*6hYsz;`Lpt~Dez9UI!=kaqza#2?8@1_mIl71(0eqMnW
z7blDzTuj}gM6!vuT8v)`A9at$@l@5kYw5i^aJT2~*SARq@|9avSjMzfSSEz^bTxhI
z6i~fcit<DA=_k8|9a`@f@0w>PE>V3^n|_%8u=m+vf`iS;MU=raZ&z0tuOSn#tfXql
z8|S{0r<ex=<f>m<-r8p+nm>qqE79J@MtH)kF~}!%B3<$30X=$C+|GLn`(Z?)S@o|U
zrKaMCcV4`X9WzhOFa7n-r8QB(Pbj^*{gaK9s`Xc+_xdFsE6<**nh04R7X1if7wb?I
z$?Y^DTm#owqNmZl0W<c*N16;dH1~i<>N@J8?+|{V6(aDW**WMEg2_hyAuy@3H|~k;
z=&MgziWw-<nDg|nz<YDY-N)-swOj?~hLPbri`~r%$+r7$yfyr5zopxE(o1crod&B+
zJr>&e^R{RAwRd0ErW!r(DZ~G>Rlo3|bp0Kb&gkfT>CnYg_btNykkJfA$lIRO4WBV`
z^^0j&1UHGs3+T#b-9Gx<H51Y6VCT1k(AOtFl@xgKwekwl?^y{P=XwN$ysj3#S93S%
zLTTbIgNgKe*dywJ+Aqorv$k>dZVN(uni<@tb0PK!^K#FAUR)JogRLvFr|Z*x<V@4c
z@yigZmUZ3y!lY<>hoz7^1{jL^e))UovH^u_IQw}X<~S)=v9CRXqSafP?1WXE&+&C4
z%GqKg%Q<5sqRB<WN2BSKMMy=X>{%TN;V0SV5ky^RBA`w>t4^ucp?&JN=+_Cv;N&uj
zQr@vei?qFAd_$NcDY#EYD|F0eb>D^=lRywUK~e<9eTI9f2W=0lmxZ2_^bI(d)lSnm
z2BE%2)zmgJ)&e|U1pd$CCFKA48kOSzzweCveV|n3d08-N1f1F~&~6bh^eL)yeQ#)!
z>6jZo@i{5FHTdoqd4Gm(>aGNfpwy!iT&IEl12@QPR(4k0jW!HmC^-#Jo>%tu8TZ?5
zYx|Qu7vO2<b>hR6J<eP?owqwQJT!bbz3}aF<N9)*IX63dL-zWBQTQt~3<g<&L82gb
z&!x|c*#>^cB@HpioTtJd=Ds#R_u#~k{dX`(5@WVxYW@(jobN^dkp6gD1Pr3fko}QI
z)<nkt=toNS(-O`yBIdT;{-FloJJCRFpv}+ejR77BUU!LrKDaQ%$Sx^g_QlZ^w9?Fk
z4Q)$T&Ua@WBUi3}DLq%Nd&wZT{d@po?ta8Z#C)l)GYk#li%O7AJ(3?<LXV0&d(Nb>
z{5gC}C>7%ByyVMRGr7{D^vQ^rdG4o86ioDDKKL2+<V!QZ^5?EA5Xn#bd+<KHBsoAq
zH(cE9N)Jb#ZmDna+}MmcYKx;re8m^PCaLe((5xVMi`*@Mtmebgxs6#t=$5`)TV8h%
zU5)M<;%RdD$d99jy)!4Xg0Q}|W!85mJ`8dNFlyH`CI8Pj3nQyXagvv0X6CV5gL`K$
znD&iaw;37c2bLb61>R{l@7-vXyaX<3ny~fEwGDf6a`{}!%sgp}-Zg-&#-;1{YxDfz
z(j$pWL$ig*tr@of?3&%~<HybI^pmHH=TFQQqPG6HU4m+uyN{Kd=cBfw+}fBYlNQhQ
z%;Y1t`rIyW)f99e>o*6|O^z&{o4h!3&%Kf<`y9MQ?G^w^GG9K*Bxb&()Co*aGl%U?
z0#~5W2}*;xxNU#<cycXq$*2=VJ-NGd9$*#}yhZGGNm?V{d(7E<MKM{hbnb2z6tX1{
zvk64;m<1(lxky~_MSWh`J6*p*o0MNZ=QO*H-!gZ-<f#dQ9q%?@VN3=sp9`2>Cu{||
zUJBG)Ynr(W$2{9nc=6$5Snhn}mZw?No;O(ytl4hAIc%J*Ie%!0J6Dc!LE23=0ruEi
zhH-MvTLxoN*ew8uX=M3GS@IIBQ}A`eT|y=kb|}Hn<F&JAh7r<9nHJX5`E$|LRnnWm
zp9n1~Svd`MDETQk`bqQ_6Vd4ldpCRcb=UP5>uyjSqXJm4@{nc!lImGI&7`Kpr&q8j
z^25PBiQWyFnw4fMiQGjG(n$@XGKtwf%NW?;euTF>iOY^il(5;O&X*amOBLeFpWh{_
z+<l2AF&^S=j?IRdg@w5jyPe<F0rpdrK@OeRRl+MD_Ds^r)thDx(~LUBX&F7rebJT3
zZphgU6y;vK<{AMrAev$DlmK;q6n6zhyH85~a%=8f(j#*Du}2ftC;2G`<9_ZRdm;t5
z9cxKY&&M2w;N{sz62R<3s$8MOX$*2bgIwz_?NzAHCvJ_aUzV+)$5!AA4F^y~jr>Hc
zEu#CmE4UGH4F{kxnMZHMN%#v!2`nKpm(e}l&4<yLhTFpYI$)CC5~u0S3QG)Jxfl`d
zg|0*t!y#Rg_a#n`WrR`|ToysZYl}+^GP!;NUgUacJ(56jXNLB?@!gK&yykX%#{0P#
zu|S%gKN9}(W%9xJT*H?n*Z>H|FrT!Ww1^(-F5ipBHT*YHpCRz|ddM=vO%R~%@-`Bz
z$q<;WUnhZ0wHBCwVVsK*=l)rvZejW8gCr&}g`x2dUov6WNt|Lcs2E(a5m~qq@eYUd
zNCK9%?%VfH1tc!+M15WcQLSBJnWJc~@&TGZ5CFMTAbEk`64ZkUIP+jZuG{jG!N^D;
z*HtF$`VLb<cJ~A*j<9a38A$EKu)J5ouCfBIF(I<3cMFH5Ny=a@lr5v90CCR%n|MlS
z50<f$KMsH0)Y*L*IfBUsw~(G*_Y|3=acJ(a8=?b~hMuD=xE_s${$^MrCjg6qtTB+o
z3MRwN47G$Rmptx5@5QokI{Ju(3=r&IQEh$_-=`^o8Bf?T1wsy4YakkWd^70~{2Q7b
zwr;Zay5{{CM5Fa+jPzyuvSIjAVujWi|IdK&S42q2U!F4@qTqTrCR__ACz4KB^S?U4
z(ez2KgeY=pWQdU)T5m5A*-iT9VNv8P0YZw=+iUF&LaOzrU;>Kcq6@CycQeEIk5X?Q
zY!p;i3Hzpc<G6$m?!;9+SQ1YDSlC%p!7&LV95h-^9o@ZatdTK<1U*=&1@%fu0^lS>
zA!<7?=<D}&ihZg16~23mGhH~+n}0>)5SxdIW=)+*5oJXY4#AL&<n4=f`%h{D@cGrJ
z&ctNe^Dx+*6uNr7mO{f5b~`c1#8@mb4(rfx>64MeF54}3r%%j+NDLOc(}hI4d`O?}
zi{S8tf}aTFb0v{{RNu(TIi{I>2tFVH&FphHK7&|b1g!SO`Lp%9MY_ehko2iDKBC1s
zG$MM`@HvWxL9D|P139cD#cb-jUUH|(!y?kBg2M@`y0NgV02NnQsGPkEEB{DA>A4wz
z?K#sW`Y+39aCk2oQSxXrUkXj~C<)f>A3}9xgjFgS40K+u(CZ}%4mvPAIHp%WW><#@
zIm3z;0YTAd2s`X$(l9JURF0<Nuq==!lY})_LMXh$UZfBz*oP)XHwp)nDnnpuzg+Pc
z35lugplFPQ>-Gu|45TYK5z7MrqD&TIbcJ6~1~C0!L<7=q2Mw79;9<Qr`$A*rH?c@h
z@9lOJfgQBITeQO-q=o^e%S!mGf+pdQB+9VGFie_}(SSyiVDthMf8zvH1I{=&%D}{t
zNi8uNEG7m#8vZ)KbiwcrD-nAIdShfn-CwgcwK=bvby7J98q#C`iIkXEZN<$D1-xm5
zg&+`zqLj-g`DYgM>}GZYLWx3|dW-iZ89>l|A9gZi!ZRhA{|o6b2HF`?4=7#XiCLX%
zZjZG9P;@{_AO{f4WHt&v!;&e4?rSp?LKRnlcl`f$l5PYm;b~ZJ1FEV1#MsDYulyms
z1_85CZ?QV^|I>cYVzfO1B;=on3x;~s=1j$4c@_h-sEPv9pH0Q|){>*6dZY8t-e2&O
z{Zawi4hU2BxG5CiN7;fxRBpj^M6U3XKL4ZxvM?rmUZJaYz_5m&Vaq6#pxq`!jAA+4
zW2n%vjDb>s;|Xa?xc&(OhCAqpQ4VK&a+TNEY0v&nSjM_NMHEYXXp&5%hRg5#WIPL1
z2mCB!x1MuoAsy5}dGlY<q+XB0!xK3?M2euejN0q=a#6tHSrCP7A%X_g@I%~+=dgo1
zxH*oyaE^s;+bcoHXa0qMT_aa2Ax4p={A}ySzWr5<jKm>Sy`c|H<#m7z7K1{GB>Sys
zAX^L?U<T3)tblHR_3;2yq;N!wP?LuJ)l_2ZJoZjZu>|+FHZuONP9$QI1VGHdQE0^y
zjkV%`5zHE)3P8YDLVyh@RbV-8+dfqNP>4z7EsEsu*bIj301)9zi?X<9>XSH(4cgBy
z?r~u|K@J7|>lpz@AO+Kn9-u4aN#gFHl%IX%1jw>3RAlTQ=KRO|Z}J-xDt;^<Q2rZp
z7Gnlpk_Io4bw(LbSSx9O1ho$_+xEa>DiNp&2+Fb#<dbrOq@6Ts=p+8^z7vETxg9_N
zfcbZU+8JPp?EFvSC4A&IjWr?nLh7}AqyTd3G<Xmt&yensMZgXGFpr0bgK7>y<pel?
z4~7RLcUX{Kdr0k2d=HcXsQ6E_54}D{B0HDHq=xGBPv#Xg<Tm`H9gt!Q|7lK6!0=ZZ
z8WgAnUG1=d<XRZJ!~TkgzXMpN88+h5Xd`Fjl_RJE_?#g4U{h>zVtg{wU^sd_l~$ug
zvFci}Di1;`6x*-_lf1fY5zW0ydf%I_Y;ghrSTus5#{@NKYCs$+VlJKvxKTkdY4~{m
zW3*^ow{NVY;X{n07%|EDvg|RVm4RnjU%8Y}WqbzH(?#GJr^#C~8V5`dIA4;&RCtu4
zrtK}oOu_Ijr^a<>KuN^3eWyyCS`#3{`pgRH361%ea1MB<(-FS`uzeS*?@+<#0Q^#M
zKLUX)0D-;kqqSx%Wa3U06bJ}>5_XHjG%MjB3P7D56v*Mcd_&t5fg%A24a~ssVp(S(
zl*6>K3?PB$zXya4sR8R70w6HpC<XeI7nxyeC7Kwi1fT{IqjcIqQDp}RVWJ^bwB_j|
zfpLjQ3NYO2sOR5W{+sr=l)<9-c(r>-a|+M_G@cq82+r|G6$qq8DGp$4H%4w&J1H@$
zJ`U4`t|pgNg^^;_kzyb%uUcHbDv;+dDCrsMJ}{XCRmvrp>86qY?$ELRx&<=OmkL>H
zgMElPu)m+9v60&i6bgKP?W7SCm#+hu{q2a_V^rNpGkNvGTJW^}B`Yg%?3@-Kb9!HJ
zPlD;I<<~mO<05+OEd_yV9??xuB{;&5nhK$qjC||JZNBbDYd~&PA+%>S4pWei#Nkq!
z-w6`8PmQl)$})zYLiHXRv2E{8Os|5NN)&T#P%P1gK!F?KZRad|Ye9r@yqHI05mXzB
z=(TDrh!n7BM1yMkp%yXtV8lq*aZz&}jWe%WPNEt;7zsxr2x*)<?8jfdN6nh;Fp#cb
zc&~AzAk}|4I_v?5H2k?c8<2_<0ftA$h<O$hl5f-CYBkoAZ&R<Jk#A=%hveDAROmSn
z@f}lO_>&H54unXlGgEm0o;fOPDn?AJG1IM6C5IF^nFUySbsB-MTAww1Jv+?h0;7^3
zvt#`uZ99pDrneX+Q5fACkYN3f4=4;kp?p$wfKY2*AnuK<^NoHKg9{1zf3YRh{{>wc
z>mY007AL2gfk!5aB{<ScAx8hs{x~xL9qN7KY~c{5PTv5>N;v^u{-lUSH!79@Z6-ll
zRS+y=y-tk|CNnH!cE*S|w$8%5&NuczY$?<4VlXfeAV?3ug$b;0c*N|G`$XbkEe3>R
zrHHYC0ZYQPz3^@4@$&Z$4`&u)YSq!+LkT&ZB^+QH^fT~Y&&H*a%dqIB62RsJq1QpU
zjzy-4<u=wcq98dLO(-x>u@3Tph(<d8Rp|LwG9U*j{&L0!O$9-qh16_;0P^1mM5zO+
zQ7i$pjK6!2x(767C7=!t?M&;tfDV9o-F|%6UKx_3)^zEz4*Gl4pn82BhW#FT859$R
zLBrUwKDrCsxW<0XChoF!|LFI5u>681&dqMWBi2Kq1miYiWH}>&dQ>1JO05Z4k!)B<
zOHCyby@vt|CkVER)WtGj3|3$J*j&em1e0utxW+ug;wMnY){*j%lyV&lNlWbG#t<UP
z^;j&y;AE88=+FRMjb*4=)Jfxw4VZ;(uLHgrcu3kmU?7DKKv5*S4ditl>+}RTV8QV~
z$c+bOQT9XJg#0tJ*OdkmAjXNJ|5kyLI1$si9IOuTqon}$tcI0f^(aNhzw2#>HL^*C
zl0zJRl8sM9)bFA05wwuS&VQBM$Obe7|DQT&l2Ka2&^AD7fYu{vDHbFI)jObD3Q}NX
zI;;{5Mn<)_jO*)wMFe@T0Kt}$8ij`>5_xzOLV<9=F$xDF3!%zTM2Plqraso~KLERj
zhy6q88z7j4k!}JNp!^vMFs`rrvy~C_OWXtk7GST`n*Oo{!_nf2EIit&%{$h?BHMsG
zj4_lYt9E5{bsboPrEV}F=-*=jX^ldoy>Sd<M-w9<mi7qXh6+Uifwpct0GO%7#15Q*
zC}4ryMVdT$B?9CTg(4=<Ms7gII<Re72}ErPfDlw{);idvFC>OY%L6#dEQ&G68K*YD
z)_nkZg5%m}iAxv%4QBuu*0YYTMh$KWhGWL_Q$gc;)<c!4<KR739`!VjUH>jHqW}*+
z(cdLQi*Y=^ghzJ$3IJqiSsX3p-bRIB2K+@~nVa#dWy&FM0Fmup4?ry8AxQstNDaU@
zmi<GsI12F2#r^dmGkxgew)?L%T8}*(?zN&&5+0pJKz<a#;;8L%;*FTh9aWSBfanH-
zQv9zf<m_K3APW^BQVM9W5^MqPd661X2%y}bznbGano$vKV4#@6(Z<#U0kzV9O9ztE
z^aAhzWJxGZ|4G>61Q;}#kp<WZ18Hr=pnq_^gDt5!TEOs#7=A4ec}(-H^)8iv4VK0D
z<d6SjLYDR4%iB;*2=vC1sn!I{daca<gT6Fn2lheB!?GCIGN2YP+%_43N`tZlVq5;p
zZjH>J;0Pr45cw;nw>YjIka7z7h^^%jluL4>5EVi<Q9%UsB%a^G0}VQ89FI@)xC5C1
zb%Y>ofB|UR%^|~>fWpNcuL@DE{DVqx%uM`?xYVo>RNn@Uup35TM}y(O5raDBXySla
z2h~<U6-ro-v4<el--cMj!(y1Ujx35H5GXde>@O8!4&SV3CXV8$nDtJTB$Iex3fQxN
z1>n(z5Zuhk;ZVwL0I;J9n8E*$ppdldbwsi($bhX;j3_3FqmCkMBH1csVg}#EzlI%F
zMPsA`z`3r6DF1__ao+DJ>a&lFdI=bl;8gzx{0oFWg=0j`a|8e6@NmHP2E(D;NEL4y
zfy^z`D49tcQhy85M*yXbzm&PrUb{@Eb@W6Tj9mW3fJy%buu`LHfcn8PyqV_Wn5ymn
zv({u%=0{b~SKipy{T!tTCWWe~t#2QMEFx=m8z=!;+l>RL$&%3*D3JY#r3f2WRvo!a
z9tG&b!kL_(5|aT7V0Pnuv*rEYOZ9a{C7>UGA4tr8MDt=FsQrck8NMd6v^Z)#+w(`N
zMsQ~tNK6h7O9bj|rzO6rlc3#uDu&6kxNk8I`?hSydVn}nFdQSEDXmr36pkD_)&<d5
zLM(R!n!^R6j}%G()R0<|!#tB66qu51gs2m%__B<_oQ}Zsvg_-L5Mn9c#xhwu5#Lc{
zE{~%^C^qANIc^}MaH#Ay0B%5nVBmjnLo!JxjR1Z~4WPLp$XWq_z@|aUif@>97m}kF
zW<ED`g^K4zZLfD~5bOB5j)kQ$<sQ)_?=O`Qa|TFkz%-b3&ZiRPFofiCkLnr!T4vx;
zX~1%+MArp6LczrRpEVHT1SxPxkb4jPHyW}ZfkXqrzVtx+c<c#^n`7rpZW5iyb?k=g
zT1f_s^a~TL2&1o{^16<dQErdV0G|;$cOC0<I-(5$WL=XLha&m1zpvkbqSCH#J+cx2
z+lKRzAbkMI1`xo44Dhj$i#{@1x1^c|LQtAskNv%Of?O-sbZT6)?nG__JOytWQG%_d
z&qYd+B1E<U@)`Kklf-`uxsmFi`Uj<^mNg_zPI+9;4ywz8cxsOT@}UYFQoGhR3rhp+
zK&UBPt_`US=oJqFTU_q2?QaWpfQo>^sgM|6HK51F@hB83TLVrn%6I)ccP#eA<a!y9
zBkb3A(<lHE2m!zgK2g{F*F403cI96Dn1h&$Yy}w{EL=MhnZuT3As4mBtWaXSfc|xB
zu5$%=-~FQv)1#1LVu}C)Rc5@umZhSkqIH<^wVwtHRN(5g;lVw2tY>iSSh?@TBd^p7
zSZSCk&I?DeBjgMVM@ZrUvis{{N`Osk=R~pS-(}$_!2aKc`1UhY7*s%x3vlS-BLEKM
z3>5?DDI6`s+(uE+#LBUa$#F#JP8Oq_*NjYniR(y^0+sCAoCJU=!^@1|*uipbv2vgz
zv_fJ~Kt}5s2%NP90%3q?Kph|uR=hek2n-5F0}*8P|F!&oe7yxw99!2loZJXWAQ0Rk
z5E$IuT?S`x56+;$9U`~}hk?NdhrwNf!vFyW_XKwW3=YXR_ul7u-|w&b>#LgTK6~x8
z_uAcOs=B+*>C?Q~|N3OOzG+}RdjIW%GMc^Z`7do_;&GUTq?yHk6UcC(V|&@q;hY5M
zu=kA5A8~#pKyyCk{cG6aVLd`)|D-|(VfCXm|0DS5J(~1S5&!W^wh6s&rbj2_Ax7uo
zWMdG_Ue;qZ!X$BjSxxk0!1!|#U4(hYM<S0$ubya-eC+u_=<~7X5yA6Z&TocTx$hr6
zd%{Tap6$5?=lfCmkDnjUTA-1N{vSFOZ#Nb2(99&RN1=}yvGiY(w5L|*a^~v&YfGA=
z^Z5~?Q%=NSOPWi<Ezq{gz`u#Du=FuWCeVv~{7piG|KzCi_)CN2JvUnTQE2zz8*0YC
zm!<l<qW{Loc7Oi2jTQu0{-<2D6RYXz-!bSS{s};*NRRo~_-|@Ptj?H_FFle3tc+MB
z3D{_w?&Ig^E>RiyQ7!~KrKsMg&qeo)J?49hNBB?DNxt<x0zCI%e9p=BG4inr)_>4y
zbT9mER^vV)8-E<T^HC_~u^?7@FUf=tb~V-$VS*<gNIv#HqIj+!_AmY)qkA0h@zFLK
z@A}3hi1p3<qcxiL5xZX-<8Lj_1g>wQ|4N{<{*M?s=RdOOQ#jg-uI7JA`TI=%TjLLx
zm!Et|Cd$)^E+u|M$C5l6c*ObqBiEyt$0pH_*>=%gidK3w@X@p%jiYPoh@wd~e?cPi
zjpVO^H=JSmVKf^PH1Dw<TSi#_i;NnhjiI;7|K*HuK8-<#D8en6!{TVhcHf+H_K9L;
zbdpF9z7Y<a;0lSO**1ScDYN^30UlVSRxk4`Ur_b}fM4QhJh1+5%lHxgmsH`0_A2rS
zqhrwtg~NCY{_%XZ@rdw6r$O)0^wD0lCp{cp92d^t1|W=+D<qOe<!>{cq^IwH0li3^
zzny*DSmqY!!>Ij1kLIyFmia(}EGPNg`-URy2j|mp8bK_uRQNwFw%uQNo&UkQ&Cwy;
za1nHLxA_ZfbdUw<zx*U3wDC_k`YZ|lU*7s$8KU-(ADjW_KYy_qKMtee#QJ3Z0!!vS
z$zQ#1NW#8xKK&o)u;>2<B24~Y46#UbBCtgGKk-L9=s;emOi<4MBl|ysPq_Y94$?={
z_;)3a|JKpR|Nkj${(s6s`-eimasJo;4;}5L!20<<!il7(`we#32hNZ${{SyAWCZ^U
zp#y4O|F8KUh9Zv;x`h_T_*;01)5?SXzPQf<=Z`P{(~mTDuF~kK{JqRSgFk%Z#v;{y
zX|RLGjmv;O-+R)I+>vd*AD_4rW@44|lG;04kn%r%pG42D+WO{iB%^#jfE(k{ycLZ{
z5;#f~GVu2g?P3ja7XR`j)%;vWP&E4QeXpQs<`W)*%!+FVZrtKwM)xGbU{(2yOe{_T
zQeChig&mmyB{n<8^Yo-fe~V^7gc{yLi0>HjD8HFcp|3i=R`tt6$kBpLI19<=u~kQW
zp6Z1hCyS^28w&uy`*XSQobU0iH|q=A$~KuCP^X}4$8+ntG0VEKn}zMu1%R<bcDj>v
z13=p$8{*Vczm0Un&*wAaS_-ipo2pZ_n+>rUtE(Hkv&}588*5nDzI8lbc0B*I0N^({
zPpMPgoe7w6#P{Me<5>zZ9*fU%LgqVldNsamfZ&Yto9p7+@Cn#vl6)8&sZ;ft3DFyy
z8{^N@IY&6+>+&_(W_~U6b!ud)eOe5ev(5Cc8zZk9Q?Si+$#N3sUkV6lyeUGLXCH)e
z#AoK?LPDqomO_AI0^|H#6A)^Nr4Yq2^>nA60)VJ}r&Ht2aNU@ChLd#u_L6Pphmx1!
zkR0?eNRN%94=Q(iXOy2t<NVwv^H=f9V95X9=0tEgU?(qA9XPsiXJdm+$#d*?G&%}B
z5%E~7xyeWqWoqGeFFu|9(j@Vo!gt>vaw0tK7k=8J=K@GeB3>NL#Gw)l+Wj$>Vc9fx
zA9OHrh+%W=zj`<JB-|#3^wc||ckBz#AU14=2g7}^M&_i0X<f*NvBo|2Ngof7e^W)v
zPD8j&Tn10mxcEcdW|aA;=(!EvPbsGC%+ihbt{m)u)0pER|Fe^jguZv|S*mzmSKXF8
zk4?SD=vv#b$E@ss@+J9=jZ!Fnp-!^o=N>#%Au?`t)63?pYUcxz2#n<uK`a;8;;fpQ
z#qb4A0K`0{*FT^H(@s4}tm7n25=^d7y?3~%8QX1~yTowhPN_ry#|c}!>hq(nGIXpR
z{hu^n#g4ifou=DN1+37EHPiWQ3#OZJal^laZcC<Gw`AF#DP#<~+h*IiZaKBgb&F<a
z)?QzV7R!_EKgx41dnqF5&NwnwV!x6tl+Akv8Qvc#;kB{BS-IzAqFNVC7LSzWG1^2`
zWjq0|ykQba6<$pgj@#-+FOlEERC`a?^5(d(R&3+PQ32wT05`AXtFEcPEp{ZsX@(pP
z1py?}E=H3b+X|@4lO-%mg|k8d#@^;*4ip?bvz3DQ648=+6T_sOamKd0;|b|gi4?Y*
zSvuS_d{)Gf%Y1m$f~l(yHbGmL6=&m!E~V3Dm$=W=qrrCGTU|vcn?lYj;e_b5MdiQR
zCDaGHWxRpF4u|bVOW^Z01~Vo*ch<JgdJgi-{KO2QUr%l2f9=G5kq8iFOZ{>pl4>IK
z)r?f`dQr6WWkgKofRUNvuR<uN`;Q+gaow3OpG&YjW+DkVS@P;S+*fyt{;=JEfh~UY
z5FWQC`oZyoNXfm^2E$I!eXI@H&xB2)x~>cpT(S?sN!vH`d52)z@rT@x#X?H$zHim{
zwa)$`PJUw?2-;4$XMHiFBr_KDZAcP&FXm1sp4}7hyK!<QKK?A|ZRE{yMV4G@{5Zup
zwJ}S15JRoK<>ojq)13^4!uUb@hitKAdd@$4W52$P(PaG|qZa<a`5<JYXT$S50@>X0
zXmWJa9Z5h|@WY#Ov!7;_*kw%Vo&V>i`27JR(5YOWgh$#<OM$T0kHErTPPTQ_inmYk
zqRwhXlGEJJoVm}uryP~|Po0%`;`Q9<FV>$6*q(WJORcwv1)GNbqTRj`-7buXqfGZj
zMkbw4e(-s}&7{1vl-Y)<$6sZ()}Cz=znD=#SRCift4Mhyh@f2Abp5ILd#$nA?d;p=
zC)g7nb(8sp&dw(E2M@jtq>yJeJ(!(&zuz`E*Q*k%tqI)N-#(rVJ;#i9JajgmUs~Q8
z`*8OuqnOf6n5XM@;wChO$Kl}IcGg8XXI3le`~t?aLp08@EYOAMXF%6<7I`-gcQ(a$
z{jkRgo^Ne$7#wy?Bz1KQa&qx@xZ|EXR;*fSx>lk;dpF#$1>*tsu@tLw6wPI4ZQA>~
zb12VfVUI4m`hlIyJr0Vg(p%iE%>#oBB6q*jo!aUVk5^T(vQ||>8PwP%*h=l)Xit=o
z9YsZVdl)v^onB7oJ+lLZ4Wh^5obFZ+_xGm_7c)1{T$60+1b|hn%fZfI&(pq}t&~u`
z4>uXW?@1#gBUu58Ameo_YxAJM-`BN@19iv}Wb`^B9N^7Xm1Slm(Gk=cI~Wd2fC_aF
z*Wrwc@(3B27<QeY)^CwLH?Sn>s5SS*3i==i2j$}LAAT<vGM=BeGv=hNT6;JVT-$-L
zdn~QZnUp7uAp;E;{WCDW1h_m1Y3#c@+7npLVypYT(sf30b!J!xH<l@1NWAM;R72f4
zCM_9@uir2X#{1;*Q%3KwfhkC>YzHL^5;k`0cZ!E+iMZ32`Wm0gVqqHi-YzUaBE;U{
zY7izW)H3eNFjBorOMW#e%6Xo*u(kP^9V+A*blQi!y}^%m!1R$YqjNMDV){$X>?^dY
zu*o;iCjyg&AvF<XWMqi@EI_@?z(7s?WQ=zh>{^ooR?8vEaEP|;1MjZ@nd<~4+S;#`
z*gg7Xl#v}DoIUyc?Zh-`?>D#8zDG>Uwb%#lO}89!p%j>d(v5-DzhY2`eMBu}Nsz5E
zrH)0}w$_5&1}Jnlag#*r#DSnS&M^~fV8lCHM=62sQWJ~2Q_>0-{OxEeXE{{s(z4hi
zmjar7bZ?RZ7d~aQA$j<?24$VqSP>H8z6lWgXoj6}wrGE9;wv?FR=^f*8B&_)(CTbT
z+%;&6bxtkfX_kJ#d#1{O==_0fec^`sY%$NOY=RcO>@6nENcD;zogA@NTgI1`CU}I*
zVrf(}BmFK+9a&#(%$ed32x)T)ShK@*jm?OfOpHx8)6!Dcz?zcLBVaa>cg~{=NZ@z9
z+D8u2IIB&~%yhQTUK34GPd(6j4@aK0p{MPq7*jqVX5FA?GDgG~d@alp6YlGu0K`-I
zK9Ztgn;xg5EmOumoLwK>nAo!Pioh!D6%{sJ6X9nO>e(W7)!BrI^0SDkiVk7*#FAhJ
z9^H08{2>Yv=?=c9PQZLNte&MD{qr6AWj%PdA(R*>l7nHY93{AQ?r{FiVJD7Q(>Y=%
z!_>q?s42UHjOu$`<L?Or*Pqg+Uki|3>DCrv&!%i{QMLIk$*{fUz5bb-3&PWa)-3TV
z!h{`#TKrS@6+A-c)1YOza?ahu&URYp+QHOcDyz&mqZ}OBz>#ewvfJMnf-Mlh=5N-|
zNB5}Yp-VNt)>a5$-O%q=GAv1;a3R?Ga}Q53(fFD`7c13;GbBTg{pI9EJ*R1l8keg%
z2V2Z$&wfUI+47so?5uI-lLFcRQ?}J~KX&WIL0RmiDOkguV6f<gsd!p;C({MhOl~}0
zh1$4Q1U%b_(Nve34Z(2!og+wvYH$ywgR03FF5Ed_;u2Tel&VS*=+_dYPrSED*wTu&
zO}v6$cXZ12`Plnz`9LD$)%)}7SDD@X?X69+0zWHGl+N^TGBmelC$kVsXug+hO&6<B
zNAxK(6gID=4zPiK57Qpsw**8D4F<A|j6}CzwxCK&-&?B=t+6BA_GB-8Bvkv7e<Q?A
ztbnz+;xbm?J=A@v+^M#NR`L+2rydrH>JHW|5^Sqw{w^URF&^ZblO)gKcHII-*%GCW
zL*HcQFa)_Qgr3`Ot4EjT<N!Eph-G8UzJ}t-;}dsk5NLbRGz176|H)Tr?(|^}lnZo)
zq;5(>W;k%=3f^ogpDVvSm_rU;Tj$rCCXl{0V>gW&IUgiW!}rQj|D64uWlxVH-8XxH
zCDMt__am6lFPyP@Ya_DdGztZ~R?~b7t_)7Qjs-{<sC9Cu0A_7X->tG`2L#cVW1G<@
zrWM?l%Vi50DHr^K9QKrEO`PC{RtI<m@pX*N6<rap!|{WPiPhnSA8-9M&w%V8{Ga5Y
z6WkYFnuT8n>)VrOVJ>(HFi~_bRP&I!u4ZOe76z@+k|bu8$~{!BrwnbSVBp=eLWho4
zT=2cc>)iNx;GHG}(;0-WQzvh_E_qmhlQ}}3?4=MU@3Xl*?<hP$cV}PUy~3dx@5sW6
zECV9jHE1?eRe8f-HZ`#h_j8v(TaUUpTlWcmhDu<U8691DhQwQDbx<uZ(n@y{Cu;uO
z>d#lk@w)RJ&}N5vA#2N=v@T7sz7<bPbv>>9$eo;T;SR9qI{=pUDwr<TODK?C0y3aA
zZy}MoYP;2qLJdxN4D%1D7e*EC$^}Sd3{*qfIYIA!6xY5*ikuhojO~Wr@U+;7`I;2X
z+}Yxc1}M6L19j%)uUmM%BRi7Bk8;#`66F41=4a`_%mz4K{Rs)C-N)IqT_?RyERoD&
zlE3AMrlThnYieyoeT=x$>od_Kp5vDJrB`=;;a;9k7sMtK%z5|ekDs6TZQy-a^T}cW
z*^<kvwI1nfwo|0q_&I;Si}IYC(T_io%a!yeoA-hDBI_?J=wCnY-dt0CmSrPxxQ5?#
zi9#q|-hoT%&T*pp9zHQX|0H_TfC>jg=Clef<7M+00i)E#K<&dc3E&g@Sf1~{wXN!_
zSN^D6S8)`@{~n*JyF=36VxE3cG_ww7I!jm<0(WQONmO?!HI#!3*5Oli75cyB3*Uju
z*s7}7DhdgIy2y2oLp4o1f*BIsk5#_6bP;#89eSg1@-^^`7&`hTqUc1cYel=V4e<Za
zIp6*WxQ)8CrJ*LZ{^N$e30Wu|(7o16=$RJix^yvkYH;``dmy{R_>asow64ASH%|(K
ziy6%y_!AxsYJ#q%Kj=&S)mD;7n|~YmlC6Lj+~wHI5QPv8z5)52u0oaPjynJW$AK#Y
z1>{${eZZvsUt60V?*2G)J>O%GIxdG&cyVw{+UunRzW1P9v-PSd)|xx_B06(7P1R}n
z{le7(CMNsk0w(eC%#!;VZtKK%uM_oauVob$FeuIFvQr}BshV-bJ4>L03hHYZ)N3CU
z&y7WQ&of2*fte@A*0|j%u}33UMIFwy>&V63&HdR%kJ?jxx3g)K)kaU~m_whZtzVGX
z5wSA6s91-jbd}4I)6tt=9@EOU4ax#udWkGOIFOh<b{Y8UmoX!|qo{m*UUGycq?VUX
z-csl#hK;j7pMZ~>p+ubp<9BwTEjU}jmUhb9#<sv%f~`%%>hAb3D)Ho9|HEdIa)0E|
zTEe=Gfz3LtyLVX=;+3FoT^c|D#7)FR8l4;?r!<i7HjuA0Kx;BUD`c6FRipS_pU#$*
z*_xHvmbJ`^^`>8mRCydNA~(>tz-XDpM7r@A!d0csow}kf-lClqgKn^n>AS+$SCs~)
zMPS3K6ExPWVr_I#LQ;I&f*98#s~AlCfo9OKzL&(!Cdic=q3>14YuVos<<CN@b&^ak
zU_XLprWNuqS!NNEDu17jp(jRbR%!F3uKpuIK&tGLYVGKOmard47O@_t#NLXDtW!p2
zBy)X_ilMi)A4tT6#n9`Okt&}s<QOxnMa94bM!5M~^;})}ED=!bQ6C1q)HFRR(O@U<
zowMVCne(};s$=NdqMC&Y_Ch~@(SUoZw-?7+TTO?z_0{T1->ZezR^OA;%8rJyj*xAR
zAq(85)_PC#FGJ%D92NG)&`mKatFy5|evajmG_NE*4~8UXrxT}RXBT6k;D>=;U&Dq^
z`KzBYY^eTR_Meg-Sf<4)y+23JS}O8WFNp;24O~7;s9g_&>RKTCG7L8)*zH7Wuv-l#
zqBGl!;+;)JyRNPq#x^(cezH58HrLi<5-mM@zUk#+Jb%!bsKG(8W$kixs>zPJ^(r6w
zzI_>6zG3OYKr|rc>*eJIcRo~&=+p|LO5<mD%nrUrd=H(Q!`KImw?T<r*8@FyUJCw{
z@A&;GBaMjgyl1<gye%`zE8v>ZSA*kw&&i=!&qH#Qkhn*ep6K==sjB~m)R|1=+1g)-
zeD;{v#0>m_$~T&hq5;-*Zwhskf7hT&$i*H`>>R5%UEA%<yqWL)DEACf?Nyx8oz)Q#
zQ24<YI>PhS`@!0pCN3daxZZtxV!8jY%l$2*Hl?uN!=`vIR{$w7zgm!eP$&hN?=+YY
zr!0(Y@ja08ct>Y%ptnr~IM5_e{9@jT5GPWv`y!uiKL}HEn!~x#mHtM`rEtc=;#*K6
zLW=6w?Zy%@)xyfcY719C8%D=EjYNCOM?Z@fh9wV^GM(w|9}}C>QB!5F1rG`6-OP9P
zXPA0WOJ5+u`sDdj9NFin$OCWKPWw$5Il2Rk7nVCYTXyf<pz5X~24d+1%=<*vQb!A`
znG{89Om3+mK*JAnP3$Vz{9jjnmtJ1M9Zho9ZSJejG(_f_#Z?>E%}?!H8{Y*HB|Uk)
zL2EV)w{<!1S>4|B6SM>BY}^hMBvH@gu5i2xbg{fT+un2|`E@rw@^cc(5;;!LHTX$o
zNg-o`M@W&Q6qlpCoptKNba_2hd^C;H{$RK**R;n%`A_8poZKPzLdfUai_G{gSKBL#
zHp0PBTmJk|iB_*RN<xy(+7!`?!dl}Y0B;^*CGutF^gxR}Z{l0_3Ui^T17iL}fkwJR
zWpzL)c=0Y3-mo-1(O!Gx3^1K~RuG5%%FCp!_GaFLMnro`bTb7yGK`;jmJMx`t;LL|
z^UYyTH@2i+^_@!2E2+6rzD|I$=;3YnoFp*yf;>;4zv!AxLv|TxD(u-b<eu!kHp~qE
zsTo2FFn3hFU@lFx#f#&-7}(sYc4un~mY;z-3_~xyyp~qf;C75A9j?|cG0CmaKd<=N
zO(}{gh$;){42I!8G0g&u`70~!-15Kz7Cq;anCK+$VaC#>jYNdjP;k7+#w+_b#G%Zq
zxt8^=U3N6XQz4+Kdys{>3F|aHxk%njf1gpDE_KB_Qsx<1tFb<Nt0Pn1WQSr=Dd6;<
z*l+=Oy?@P9ZddT8cea3|h&=;NFG)YGO-2g+%5jLGU4vLx;<HIIyhrMr1xa4KU&|Vh
ztuuDu{rLj!jz*C)qS#&(Y$h&D6W5Y!MWg(vsZ~yHxOfp9>UQqK8!B1JBqx2h67)E2
z4)clUxsnA<A&v&Mh5o%oo%yIRczVTUGktd~-#Ox?O@l>{2nR)^f@R;ut=gw!#9_mt
zhA3iZgfJHPp~1f5*MoJ25~outM&(a&Jf2*MB9kaTP`a8C`}E`?(ojtMI}hvXlO%4|
ziY8i|1yr1&C&#MoCv1`ex2WrWyXNYK&50waigvn;cLn$tTg^zYy|97tH^x6LX>`5W
z6jSylWnqCgw(Reu2nUYhKu$^oY|->zgrNR3j-8bwOH9ymU4`WXgr~x2K?a45e)^DS
zDq{Xc{wI*Rat1P-RPllF%qJl5MbIQia=A8Q+^++*3TLv%mGOV!ADxCA5>KS}Fy3@(
zM!tGdD4bL)cBqUa13fXLelEPdMa#iQf-lYV0AiaoJckl>^g|czLHIA&DKn>)(%<xJ
z*tBqGgni@7E6J^dw1V(MY}UjU5g_7RhPlDNBs`BGYMD~Esm2t(X~BVSm>0#){NFYN
z4LtpNYuZ%hY@EGKr6jLgJoG}f>^?8%1{(h=p4TJsQrbK?&VLv7UK8{*cHc!6gk`A3
zV5?0>IhmiuF9hNYd(AtXK+w^QeT49@o66(MItMsqI60fCL81w*n_%^WQT7@j&kK&e
zL@e$t8Dr}@5W|UzyNjXTOp_z9uVA{vdZbqEg3Tzk?-mV&jq$a}`gz!AhN{5#RFW>K
zj+XZ@n-l~N`g)Eo7LzcW<_^?SzM1lte()C^84g{F_Makfo+eXM3z&9RPr8oCTRM%5
z-<8SK&$rMw@4+V?Logv_)2>kJqWcZSOv`q;l7)=RSh(-Zb7*Tugi6bvyLrf&GD}0A
zUBwKm@_n=zs+wgW_&{_7B#kCyf}gZ^82@D{r_Azg28E;TA=W~cYVS~XjM|VgcbpR+
zNzgByFTW)TcLHPa9r;)K3k?5!Ub#vD@CpooJ`SV`?bhYDX`uWBmFm)S5tw<lH}V`(
zOXq4_qQBR!Axy%upDx^a;@@|)t1ImZJGKC;zM|O|@erw5ROnW*(8P4`D--F}RaeV0
zL|RJshi+Aom0p-@<AW-!$*6PPm4OG#(#YHorYqCgjg$9(dAb2@6-Q33XUulLS8?j~
z6X4?NV~v9?Nfck#IYjOZtOB~>E}cKaNXn)$qEe*h97L94_~MR>Uds?CaG$ULgp%(O
zWIMi6bcUpT0c@ML`4n>=**fNV^oJa#O<zD&m|=a6$$mccA!@jsz9bwu>*gxN2A`)=
z0!0^wxi0C#l=fpgI!qck^r)4a<gR{8GN(`0?hMmhG}&~H@{%gj?h>E8w*U5BTP`C+
zxvb|@Nsg^nbZl&?a+m0QrAYGvG<ITzaBSita-mr|YP5P56ZVK%aj)?m%o|Ei<=K<B
zOw4<$YM1;V^-0;a#c;k=Lk4!I!)6gHu8ZXHGq+Ff&33dU3{%rt{7Ijzb#%7fI8P-L
zqd&*cKDE!%`<G=w{MO3=MDKJ-M%)ZC&GI*DCh^G2jxmhyN15G5pu(C9c%&T!TKQgG
zP|2nPOMfb)lVuVV;w!bolT%-M6a{FtS}A6Mc=nho@TW$%YECk#wrMi6)OJ#=*av#l
zWbFlb<3baQwd-x-Y-9UtUk#}y#Y#DpIbsP<SzAtUJil@uF@M@(k(fSEvU_QWe6uh#
zO+x-x!5r&5Rj%i)7S86AF(xX?<%N0OE;?WJh+fw}`Ax4wr?ZO0X)WBm;A1*{0=u-z
z#Iy5owT0Akedf_wqz(F<QqMGANbZ@u?cE6gy*s?LcQMjsUeIB&G^g|^2vXJRprugk
zkcQOks7$j}tklwgW{P+B&iS2mU3K44Eh8uk=geL@la<4kY_UBi71)k=waG0e(qt5u
z7N^7B3y)yFDzhpNIM_mloMVcRx3!VS$B*?&^6y9M^j(})EneifglLg}EYnXXz&|H%
zN-nOzey`n+@R&(>Z&9_8%6-@&{FD7ji_u#nHq-KLh1*(th`fudb!QI$b72UP{8c&h
zK!E?ud31A)I2Nd&inX4`>F8;%;A8(6N+P|j|7>bPs)P|r<No6Oc||&3h0BdD+$;P&
z1CG)cZ)z!0cyJKuIA7CAL#}$KptNahuF8Dr>#^k`VqMHG-L<6cus8>k8HHR_W%AhX
zRt+pn9F`^>L!AqASax(Rt|@WRfHTNt#i8lekEbG^d|z07e?B1$+;qWjAUBtysw`Ho
zWvvGZ(HTEb5&3F4Qy{Fxe8g>C4KF-w!u0PHUDQie!gP7nRe4m|Q5nl(<f7!z44~lG
zP&QL%w%2s`gC0vRg&^%o%@=J^V&Ef?MS<}`YjuP7@7s6eH}UAl`BwYM1FU4~E7;hI
ziA}vaIpq7jzfu?9Bx+h=`ha^&@5}n_qm@hXlZhjQd?at7_W4(TlbCk&=Np?vq$=mJ
zEb1y=J}%Tfy^Lki3wa;#wHfx){q=@_hps|~L!!$px3~)HPW}%ir;lFB2DjhTh0VqV
z*!2}k-<BtxOwDw$?_X$|n<mT7c*{Gnb{waB%LkT}Xaf)j`Qr1rm!6vBMQfTiP(ocJ
zlWhNvJnp-%9pMA}?|f4b>C7~tb}U_ElOm2PAFG1MM$_LY70|8RfCFAEe)KgeojxqZ
zk>!|+1UA^IU@`gkwbmT>A&g$pLq1dAkM%P)JSSTePtNAf@u}aMx_;BkHPZ-C>0;}$
zRvuw>z;N^nT&=ya!*qCPY~+Y{=9c>a$&hK0Jr@LoQ*yQ)r1mONHWeu3DhInrax7zd
zY{Aob=3V1Ee>wbx;_J9bxko*h8U8V(XCF()Cl%HZ_+6*L?l1L(H(W0T;9q_9j^;i3
zj&3_$Vj(XTrwR*L%+HZT4lf6brA@Cng$U2wAjq~><J*pAIBJhbwu+g{yq!6cuSc<_
zbx=-7gBWPVTK*~=DLWxr_gVEOx*E@_#A_<qv`I&(U~6jAdH$g6!7sx}m+(?VYheCl
zWGm%pKeAq1u0U5=0$5a*w5SNX($W#pNMmH&($+lx%PuuYszK8``S$~Qv1X4I-3!~&
z7&9Fik4^0J`%t#In35SifDsX2Tj4%<ZZ$;~f$E%TElHM&?}^jU=}k4}P$t*V-Gn{&
z=q&ZnnM)xmN}+0Djw!rjk$@$F2!iOsX!v9-bgYXT;1MEh)`F6bUD2R!^XX5?<|aq1
z4h5gf7VWi>SE!B8DGe5ywwyEij?5{kF3KyemIDcLoQ9T3;g(upcnR);-zI1+XTo#o
zwC{0*_B=Q?heiMO#2hxE-L^$cEi`@f3-AkWVtQVC;F|fwl$yM<_r|x6WKLr>b>tVq
z3EV0g?J)bzFG$w6WA2rh!rITV04t?St9m_l(L)Y3TD^e~k4endc#p~9W9<W|-+0L&
zQFK+&qK*gBCuy3Du+8vrd0utteoIouX-=o%4qiftdvZ`CW?9R>>W$J=UKJ`^u6bw8
z5VaXOTM+v-s(TD2J?)}!W~v!*B+EKciHmbZb1duj7kiPoj)9(p1slEK{<#~QY33mv
z9DmQYKTW5GLPuOLmk!ic8%-@|pery?QL+w+Jf&awu*}&~mh1;l!DA7NvzySgaU~M@
zHHX0%8_dih>GZ<4oD%r8SCTv|>QB#Yg)S-~=%;aB?DO^)s;@DuUTggoml`A*)rDG3
zLFN@H-D7V!SMbHMpohM!lRY}X3=%Ox0-6+84mQq;WPXkwU4%N?5|8sLDl(Ha?ZU8%
zncTTi-jrUgTC1M(ktl%1q83LNV^{)rH1mp1t2~pnUxA(CZt_FvM$AQOviz&Q!UT7)
zkK#M3`Xbc>NrU}1VVXtL8f;b4!_nhO;@7-wagRdn^-B_?OHWh(Y%7#`*^&`D6lNRU
z8f@<eu_Vq;(dji+nYPuY=$8<CE7j^J#8v>e8Xt(h&a}Tnl>PQd=)Y|WNgVCe?<R?3
zdS<XxshX3&k66kaww8|HJpN8-lCJoNh<RjFtjjC0@7OugWCDS>S9{=xuk=*03>h)R
zmlLVPdQ31o+2%4~0ar4_*H=4fv&H*sQ21%lYKHDfX2;PFobFn!Ho>?@%ORcm(FXUM
z(Kkbeu5g&ZuY*l!ey~wnJkX>$d$k>&#F9A?0gsN=RCoy7dQ7scM0HykxRtlIpicE1
z8n|UXk)$f%8zpJ-@pmVlM1(azi<n@6d3q2W#tT>C*`+g4*fUI#2+_ksRwTV<u<pqy
zOe$tdHBC)a^b<&CupQ#IW<Ri3HI7QDQp;kovLLg2ybGCDz``Si*s>`XzLwtyu{Wmj
z@{Vh#GAfsxk87mJRy_HNWp@gFt3w-hIKW_FzzaFa)CbntX~e15rQd@`hJg~vS|Cr@
zLbhX8u;s>?4cDbchpSmB_l>ucQog>yE_!*5*fP8&awW>n{`vaCJ*<@Uv-tjG?S$Gb
zDrzI9m(NXFnvvs)$#fM89Q-(M%${fxx*C-}y}^)HqD9mxDs>hb;%U&w6Y1pM&s+Fz
zR6}kOL;dCxy;3Q8ltK8K!SmpeEe^ix%f?G8V%Y;6f0+lQv0R~kJOZwgB6lm-Ql>}~
z5<@3Pr2ItBnz2;c8g^~(6cF_j(Dj0DK~jHHNM9MhpTNWjqM-{VFH&q%nwuCZD8w&1
z%q489|KdPq9xPEauozW+{_B9B<1q60@>4b3)8wQ5@$;i>0zK!!6uzwvKrL5cl*<00
zE<iFRH1L6+u7L9kKirAZn;y7~#Menx%p?NpIG-c7XT}_%&Dw+*&_*OCz*7rB>zjSR
zo8Xmfrg<w=F|ALPLHtE+TCYY3LZ4f5i%@g%<$zwYef`*6gxRLHI^(rGSNhJ$ND6-3
z2>YEKKs+Z5E=1pQ4`a;eDnjdRp61H0Cb*RZk0NDs8x0bc)M~Aob6(sbziyQH>b&H8
z(^mTw8GFwD66ztSlibmG=4f5NKfQ7pH2uYAar4q55>OB{yk9@}DP35XD!XDvjhrd4
zuiyE4X1MY815-{xNjdc1kou$U1lw9He?on*YbT4Pa|HHn`%}#2sw^Wo<27k)Y(Bnf
zRDJ<T`1%2qP*rc=miz*uBr=I}8(3<s;~YHPDrH28%W*L{jF7V4+nJRsEdVBB!!px^
zEv%vX0m)t1Bj+6QO(a;G3#|Q6Yt`FF7!Os8Lu8)q$yU8g8{~?6EKx1>zJDZD%9%gv
zJNN5uuDH7U^16Y)R~(kBKr5dgG)%|W4~^$CrwaShZxpi<d1cObYX}UNl~E`yJx?Rc
zvp%YxL5|lU8B?CkDlK*7A1P{7^8PHhxAyS#3>e*@iU!CU!oplti!EbYgB=7S`FO6F
z*Wx0K_CcSNnxX*T-j6<iOcn?iGiU2!S9ze5izSP`wG%2Yh&So0?0z4m+gVsVvpKt^
zF$*NejUF-BpdC-Av*sL~wN=!;Xi&vvI@WiL(zlb}kdKmIkyW9N7yelRpxS$<?)F><
zI^?oUwQFSi?>`P=D{>1`WHlu1AGwt6Sx(G-r^?RU$>|p84zD;E;js4XH!0ioDvD;Z
zpAmO3pbxCbk6?QOuk~T?Qe7rxe4RPT!%}MDd!C<=CJfNVMrJZwfNd&8Q5tGN6#?f;
z*JYOWGmk`JrY2xJ>B5GBC6*I;6F<8$;V9=lKmziV^`fktG`g*Qzg4Mf7=E0fl;>BO
z>Xp@1c3_vbr{^j5z}iw)ZDvwrhTCvA1ygfAnv<W+;4X)*@+Qn2p6KCv(HqJ69NXkL
zu!!Y1&z-1MHQIk{)-Kp&sCt<&TavvfrokLu=I6sAfZO}xW@&F7Kt8;EF0G^y(NFR*
z2&1ozceYz@^&XBVyE<3lJors1w^_t9akC$$1$ddbrP>EHI!t|X#WbHs=CkM+>GE!<
zjc_{9wutP5{!@ypj0~l3aZh23@Ct3|;Y{AyK&v9W5{8q`icGiC*Mz_ve~LfW5G9R8
z8z>@)dJHzvalbBA4uduty*pk*KQCD4pE0<+pm{yDleY26@p$$@Tfx3&qhI;b=uhDf
z*BbmqlxNoqoW1b7vL3nlxO%g19u4}h$dx6a!-Op_=2M6&)vHE8f_q_F+B>wl?LSY4
zY}kU8IO1j|Q3!cXYhO`{DQk_C^ElE#6QwhqRxIA`^+onCQTp|Be3+jRP0{^fl(*Y{
zI!g{S0&{%(Y9{U`1xK+=c&ZVo9Z`zL2A2cjiyyPjw6FPyjwoR5;rRx}?F1>epj5=#
zPUZ2ACeg@!X<>5(l}EjpBcVaCSptG5S1GnAQF~>zjWZ<0AFE&CwMXX1WKSnwvO>@j
zGXion&n#>*UV$PUG8X{>CWw;gwKXfK19fEshYQ(N(=|LPAAZ#_@5k=F&`qvEWlnhQ
zm+S{QnN^oX^WlF=fooxl?9;yWeI*Z6e3$Q)r(-~_u5YJ<yxPC=U}3QwJ28BaJg+Xm
z-elyFM}T}QlWW%`4Hz!S5|g6)58{9)1xG~F?@c_#w(U(&>(SVJ5_3`7wI{qx3yW3C
zYt=09;3P$@@_4_dfO5qJG3}dsSeg2&HDaW~?)^c1udZjhMtM@0XtX_Tpt<M#0rUCu
z%`sN(467Q`k2Wn=0~ZG($RaAGx4xLU`)X8C9*hQTE%B{i!dZzcHQ+`0j6Gg(fGJR@
zbzEcAX{us<nkoD)N*_w7?>J7w6#n2<VHR0lCQNzbfVyaVnj(FHQg&A^3(}n7izk(l
z`SUA0(3dvcaeR7z!>E&RMq)Zyi|^Zqi9K-eCqpp!M;kweOpTWvLca}xY3b=`(H2NK
zn-Wis)88)g^56{B5#=E`V9XM2S(>SI*U0=VVyh~5-x;&4zI@MxIxxtWWF)7a6+n*o
z{4>29A2^o;Ap6k5?MDl~TUn&?G~k>5?Y1=(Zc(X8Lw4c8l5buvAp|(R`5ejB03%&c
zVpm3>u4o%ACNxxwDUMkzwj*>^Kzrm1GLw&(s<l+`Qe=-(^_{iu@)?2jcM|8CO-6dt
z(Az6nV9B5QYL9SP0y#hNG;I*3RKvXvwDqLNUez(s6VsuTzHHwD%#+}D*I1}M+g>?4
zC^(%~&rI-a&AGwf$%%4`3F9uxyQI{je{d4NUxU<*LX}&W?=&3{Q9-c87UT4p(cX7A
zPrFOoMB$0oR`0J!Mo>`EnelFv8^zqn`fs|bv?qNR#&E?pNI>Mz*IciaB3k#eQ<RIx
z**Vx)D;-jh0vwnU3nfh9yVJ!Dv`|3h3VKP$%f)?mfGtr&*)5T(9CM&st(SuyOgmBX
zp{nzz?j+DDn<dk~M{+jJp@@3d$dS<G2%jaoj=G*iar%%acc#(kF1BN3(#;s*MjJ(7
z8Gv#fPh^Au0Feo9HDx`luA0i@icq&|xQ}N?z<po;lxn$NA#!W<ey@KE*5Fy`#whSo
z0ib9w>*63X%3N#LI{&;M(vz^ZwE`udL&&Ubef^TxxKYijCBRdnI#?~DQx&E)z~A0)
zd|`AUmSzoZV>l5qRCU`50;Vf26xSQtwQ@cfHOJrYMOonfCU<tEhYwB;{<T<%+-V^`
zk!VV8A3Aq=vx@=+H?MaX5R|g(KY00)dBTfx;`Ce1^ADBlCau;i1WoXZ%FVn%g!26n
z2>>@Iuc?nu9{LnwLAQq=S_I1<*M_rPw$5RhPnQ^U)&21w5&@fbo&NIFB{yR~m`YTf
z76aD}506WgmesU6>tvGieXI6A5FnR_WVc|7=)r9^aF1p+_&62E?Yx74^e$SdH|W8i
zot^`QI!9$UFsDgE8gmkv(u$w_D!C%w@RNA0Lb~HsC8aRv;&T(AU~-Plt6kh8mSKk`
zIZVzHJQIe>gNI4r74CuLUFBb@3-wF+r`G|mA@<W9rA_p6p}M;5aJ5!F<7MS5<BP{r
zYjS7A<xAHke5%CxBG>Pa=TcM{JmX}=3Au1z!&1L+&o~g|uINI1_L+SR=)Bcq?Hb!^
z0)6YyZ>SE=65yU!oS&8DbiNJW^(<Djb)nunR89JB>bq|PdvQZH4I^J7{ssK2Pwb&+
z_u_G))hK#3Yfa}v)6`4CifGG{HJT1~$tL=T>LSM9AiLYz%Or&w9dq6>OQujQ?<oka
z88q&mZzaE=q0=}?GNIn#gE%uEjconeo5P4-Zm_4k@z=Mp%4v;MnY7$nncZ^Xhx3yA
zo$LLAD<K*k58EE|del;@U=enWcrQ!wC$1YktFeWE^~@$phNo1=U4ng!J%Pju>e-^O
z@4Xb%RSc@q90Rxm7<<doLP-72Ew>oji@RDxd~std;Bh!|&TU$Wn}1sJPG~9e@w-K1
zYH_9{%XeR6$bGki#4+GLq4Hv2{z~rQ;B(|aEQ^2Z+b4St^$@nmfe;EMsGggm)UNbg
zT3X}*p3dx5A=8v4NE<z{WkWRFy{VeA=*0Df_hc~DETI6AYS)V3rUZ{`8N913nr^2f
zC_NMF*KzU?E4^#JBxJyd$R7sB6scSC%8}iHv`WLOBJJmO$(L`_$a=a7Ci~gI?oUp^
z4!(~+`os=U!q6kvRqR6}EFje;F)m2eG($@9&Lrx~9Nj_B@oYngh|JMjnZ`JdgDJac
z)oEC$?}&xm-ug|$#ni#hQtP89)~ef#AJq(aB1`g<QuRxWZc;*A9Y#47<XB@PZGuqQ
zX{j|tXPrS(E<gah^i9xcUs<fSDYU`>4A~Q|)GcmwhqI;#43+wpKy{l0R(SU7{VKuP
zn#D6q>R^CdAhn|bVEhGC8v@ns;xhqXVrZq=EKeQ}3M(nMP3d}TBziqd=Ih-Ls;CV%
z+TZ0kV~PeD<xR!W9xcM6sw6yP0>Q8v)MixAP|mwb%|PNpdBH4kWTzEw9HPrECXEA@
z*T)`kQJywp@7Hk|jN{v@vsDvG#=VaXOg;;^@T7F7b5*CBB_*%CW<HA^8P>h}I$@%g
zw06+Y5ctkg`WI&F#oYxA_$wvAWIn+iaJkON@s5Py<mlag(CLC!WfA{})C4=u32d*J
z*D_a|7~XUGO>EpE)J`UTq8plKE06a_Teh}fNjPASl}|yvv$ZN@v17%lDT5i)Z#o)-
z+-GVlg8ppOax;IWHL9_9!=ou6a|$$MIjc~_sLb|CNHJY@KKk?gD9$E!tbYvYVD+|Z
z@OnPtexS1Kj;~jd%({!pL2gHfUb_P3qeG&+!j=I)`)f9&gjA}GaYMJuD>Po7!eMY0
z#!FA@nJEqKugTw6!hfq2y{v6Q#}TGwnzxmo%c1#)k2n^z>S^iLenw{yxRY6e9vasZ
z@S=9{4m+!0Hfd7^De;W4EZLSL6&LA?yq-bm^cp$8cFCo)_-v$Ib*Bcjxn1j+_<&_<
z3UNF7*SpD=BF#V^`4Z;mlbdPtM6L{H`VatAE?@I?ic_FEYqqg)ozMC`Vxi&_e7SIi
zkmuRCKq7?}B1%9y$^m%lVy04`puOWJQK@#T${1u=!~3U;wo|D~I*(FG3xkIPTGkd%
z0y7{ZC+4uhwZRlp;O6p%m#+E{SjtfV<;wh`ym#abM3OsUn#*RB9)`%X^s_N#C2(ub
zrq*<#nxS%QPc@~JcuO5rQmNGa9kiYEeLzg0HF;GX3(ock6B6Sq<Mf06=J#<{y(8zQ
z0!K-1G6B}7zYcx-ol@&!J!O%2F0&N`BKdJeg0c5^AWZG=k_mavsd>(<4U*pYI4uG4
z`Q{G$*PArPV?&OYSc@xEEAHb7rjM?RUn+_YzyFz`)=BPrNjSdc+3%j~S4Lymf1XU{
zR^rD@Q;-T;2ing(jZR^dXIi2MDkQLSR8>~42?Wb0c(fr1HjP11CB*@&Thsd%7MT^g
z>ru&`jkRS2CUk7MORK}dG}?bA)!Cz97jb7#;LPDjqL$Kl`KcVA!OrDFGXKFK<$avg
zfH%jAFOEmtW4+x<SfWaJOjOP=M7#)&qnKzC-5C4R@4y~CC@8ahO^c*{RL#?J#yhsC
zxTzj0pji}-i;ihWXlGM=^IfRUx2FppwexDX8*w$?G1qP!m3NK^)O#-dFNXvk4#(A^
z)VT%~e&>n3C6->t`M5*Jt^M?guTEC74Glh+I47T}s9-NPTvMo_t=Fq!>HCSWOGo*Q
z^t3F$-LP3)wwaNUu;(`K0DL!S1|z}L4<W!-req!0HtnjTIRLf)(<nbvzP1f#P6hnY
z)+I~b5<4|Pq{SfpyaILfNGv}q*U5Usj@n0<D&N7bxgHmKJ_@DOFODlr*o0g}KqPwu
zQx<aXq*4~%H?MI=FY!^+z;Pzo!VdfNGT;Ykbh<Lw8xVNHT&P{s<&Er8<%8%XfBVV_
zzEjiX1&iGj*y}*Oo-O#yv5aByxbH3?-(tKgtwi0!`+R?(!67C@HK5|iw0>>y)yma{
z{?^zcKw`Ee5Hp@{-`?oRXyL6%sY5wKBdud{BHaVUVuxCJxmwAn_a|*RP+I7{11J<c
zCk>yP@;0zb)^w0Km51*CuxtU))#}#`%f!}7n1s}{cd3<bgFjpC9dSDyKWo_1NI+k-
zRf5TV@gFy+MR3HX9fVv*s994kky9@$j|untiCv5={ymSjRq*piTJ5W!Dxrj`V~(;q
z(;Td@dtk|DeTfEj+>64QdDxno4vT8Gl9>F88thTQ0kA}>oMQhcG#Z4Vr^*O6%PuFM
zGaFx@VL^XF5w-i}bz75LU0yxuA%S<~ZHG~F^gKZQ_x)x_8>$WAoh|=R(VD0}{bY>z
z`(R0UKS60b5j%Qrp^=$bQ?+SXbIP}xTDM&7(DMCHzj<Ez-AIy}=#_cu7@i-&g<DVq
zY#n0z(u#MRGrt9=6>>uUV!vW+u$2C2x<#B{3Y^hE+JfX&kiWI@P9-y*bvCy*3aYV<
z4}7KiP}$DV)D*>FTz;ZAh~v;uLvgj=*F1wW9v{TZcb5J=G__N0`kA@vNc|T3_M3)e
zw;XMVh0>(Bl2%NfiUFji)%SZJGN$cIU<!be;f__+mol)Xuc9I<g_PO%qH<`ORJ0(m
zYXAA7llw@kxe@y!@^f93m!O<{n2Gf{K1^J@;b9N7K&h64V4Q`4d`aoc^lvmEs17qZ
zzQcXxw)|++P08-Srp%0dr5CRdwWjhzmP=xMtE{}m$lY*cOy6K>kt*F-%Cc}reO;UD
zR@A_IW`DY$&!I}qWr2B^#N`~#D%{&@HOG|ss`kiB`>T4+k|b~8MIe2{S@v?4cuTEt
zS9=8)aR2jFEB8X}j|~*k??L5!XnUZ4Y{m7{ZKYx7%=5k7;zOn@6_4J1p0%ZwRxj(i
z`cP?lV|5X4IPFwGNJZgZy}iw$jz@x5X(nJMQs1<W<;r1y#$?Q@g3MY^WUySGLY4C9
zJ@w>ek(!e_M7YSm_4Xs!fp5R>w$$>1rnPbw!?lYY;KNiua66O8^pY(YVZaxBAU#oa
z$VB5&SpJ+mrW^fc2P(3D`a=?k1lUx@5#_d~H4U2+Skr4M3b%LkxiN}GIH)Oki{Obk
zDQ;_?cCrsAkB<<?Of#kcfrupyLNDQlUM!s&Q5<I#XFr4s=kQo_a#_;*!9rfL!*?*m
zTdlp0bYPgwLgP@PzMnD-Spqv0)$tYBVg}QCtdKJ$HNswF0)9)Lb0+R}-OO)?l3UEe
z_3Lu)?fZn6WY>}!SC?8nf=&{~jx<MyTTlmY+L*RE(mXPpb$Gru-2y8>_YV2wvRbkX
z2ES-qA<gTno6YOUfyxG^gC;)+FwgBL9hqlLur`fy+1cfzo1j+ul(U3YSQ1&}?Un`@
zlST&+Jn4(VMJ8J1=BOB^GKuV0t`!pwo5i!ZWNCxE_~e-NzIxH!`WCvVDpyJXr=4|1
z%2@YyN6P39Jj$$fQc)=M=EBojhp2z?l@@52nst)*%xdd{TV!gdKxT4D<G1|Z+RtWB
z)LE;8M0GyBHq;`R&*f45^!j#+NT1cotdvNf`Ar=q+3jr_%k5$cQ*Gfp!WMS1jEXsA
zyDuFxJzh{r|5#yDAPp&F9e<r|IWvmfDn+(;@j+NS&r60t4zwu218e~3^g>>LQ_5%3
zq8FCW)>G5@sS4GONa*Uod|B{joGqnb(}<@@7t}Y?(h%yhj2y2_AprS08qbehwQ)oi
zwiNG)u+J6R_LEnv<sZ6DQ6&W*AaxsmE9n2F@{_a!P@cEfk*L54SgB-TYw4irC>&f7
zdO4dmi|u04(OB0e;G~GSBQ#L-CGPC$(R34};a}V=VEf#7<wZ?RZz;We6qLz7ma(VB
zEhPO_jD&uBU?$+|Y?!9BNZk&^nSRz?&^OfHS|bqH?eTFBKLdj8z<M6~D?ii|ywS5A
zMEgDq^->jgV5MZH_%J}i<oY+hv3H;CSlZdsqhsUw_94h)p=DHLfy;HIigB92>WDn<
zv2%@jjlRC9(=%e~-$BwzeSHXggAfCdb6!cSItm9a60sG_CQq%B&0IZivKgrodmZBo
zPFUHU>YnPK2>gs$GKje|Uy@UV(wyJR_sM5Tx{j0X)cL*JRyFl3HfOhf0-PXGdsduT
z6eYz<7)YB$*GMxQU3~pvR$GeH%vX8}nf5J^B~-?x7a#JLSyG&__D27VXjp=lN9ULL
zMw+^nUmr1snPIzwcT*x>Yjylnu}NLcE`}p&hF}q^)`>3+!a`3<1E%4ODukvgLB6#3
zypL{g;0`E*kiE~`c4r|)p)^hRNAyQ)5+*;o@$Zd@&E|%J4G{yoTF;2r`g~}o@S6%7
zk>Z~xwahXy^y^3P<fdnWuZ?C=DNa05H#t%A3y7WTGei#yGo)Fot)R2)U<PY#gqh1g
zTI98q=0!62MS+Ko=f%_;Z4*(i5VJ{ntu0GVMpc;-_04KN6WVY~n<DLc<l-mHHY0zF
z-b!P!R*m{43^w0(4{hQL#Hac_1Gf#PjX5XZs;8>5u7xWjZLH*}{P1Ckpi;ylY-LF=
zZ8nVvsos~8a%6fG#!FaQPn>vmJ<`)zYY!?Lw*D!(l5C(<q$@VzY+ar-fNU334J{pl
z#THe$n3`jL!6XOa#0e%)m0s7b?qUKqQb57pnk|SjH$AP?h(-Oj1e@|RHv~SkwcM*l
z)j~%oqTYSoQ)!E<f{mSneOj)JJ;x+ny)DsG+PYSi%(lZg09K&*x!%c0XVFQ|_Sb=x
zQcSs}WsLom^;{_i<k-vL+dF%0grY81q0}0xwOLj8iy5x`Vvw%^t!2@@dzw|R*Vuf6
zHrLV@Q;{mtNIh#x>kc_hOI}3K(X|&)kV2%hGRnWB)D2$_mT>LLbktO=0uH`cY-f&h
z*j8tX7wax+Ust|{nf(F^&{G_JHNhr0uoX@5blTGMw>aIrZ`tyMRxizR7i7I{G)R6W
zbyoHFI4G5(S!GGGY)wlQfbKlzI3w#e0CVz_KBNQwh!V_Ed`g<ogB9H(K$yZ_nBLF3
zJ4ks1$~W{4aA@kbVBzRxsvl-)eHU0E6TtL=Wlb3a>?-G%`Fb;6IDR$34@{>@vAM%@
z#744InO<f8Lso}JtF;23I*Bp(r+PX0(0R_z+^jB9>e(3fh#_Gh(m9;a+*rGJS!>~>
znj*LS5L#_W?cSv2V58T7r1EiNraQ9B>5!^er0K7+(b>vv%kja`ylKPV(~I)*sye;C
z^75{#$LNi#r$O{Xk(XU%puoJ?ZI@K56<yC)k_N~Ofc47iX2k83>@>MbOo>1iApa9L
z>F@5lT6k-Uw(Hn(Vy&aw<#dOto`Yo+1B1Bp|Do!=1DbfA|KR{4N>@NYx+qAO-kT^W
zRit;2PUtNVs)Evs^Z=nqCxqTZmEL;`1dv`s?*dPJf4+bGo_}()v-6sro!PtGPVOc}
zo_~J#L%zGgU{^imil2*629N;laZi1u3%E#%<yS`KopUvnF2(!LG$yqxip8qDab?Jo
zKA`Y3*y=6cK=B*<p8eY6s`$OC@X8$J*E%2aW)%45$WID>?bl3otMp+P@8C^rsAXhx
z9}A2AxxG7m9D}$~^5Sep@FTcU{JIYGp}?*IHuRfz-UC9ijASSKJ>zs*<w~6h**md{
zzctyv(dq1dP*p#m8@cSSU4>Qsv`W`ER5M7;gz-r5oIzQ14(9c9J+XA53Zoi+%hQ2r
zwpVw((oRvDw~_XF?L{Aa;-9C7>wBAMrfz<i%M(vR2+uHxA#|rs^{1@TjM>!6Ia=Vb
z>9u#yIQ){mHJ_tC&DR#=hxCK6^I{f~5+$$5Jo=>;wQLRg&UaEiO#S%mC-xqvKA%XJ
z0#v}RT+vZFSy!2!RVFWz!k4J-gB;(xDBvFQmvFEp*4N1AFU|a3_GH&nytw~I$F`!z
zpd*ie-RD(ZW@zOyGxb_LA30l^w4E6L%V+PJvn%f^$EBHpIfY1EVO6P7?wK-m5^zn#
z81QW;e7j0iQ=4$gW8pQ^dHl7%Px;7XM488$L-pxYdbN1Mcf4cor&+9m%}>iDuI*;u
z%`@0_b5!@sZb!6)f#B|05XscMTsjgjydf=u5>iuU@^51_Mo(YIE2)(fwisEy-0B=J
zdi6}U6!RXS)_5NW_!Wnd*88}2<HhAV(lfyhzM>q`qM`VefyP&Q-bP=NZo-x4RQS1q
z;#eHnw5klBQq-Ih@FXkf&7-G@&l2*CZU-%jj?zQdvZqTt`=lcx#KWv+wRg@IH_%hZ
zlZ$WX%OKj4ipeR2a44bi2eJN)d|T>d@*t$`%=f~1dhz{6Qh5)JS%QzPMyZ6QN?HM_
znnYlYe7o0@z^hF|f55(31S%!MiH~c9!Nf3scA8R0jR*QsVbu=1pH6*;e+qA_PLa9e
zZ2W7bm(x1}C?EG3GKOs6=0WjUBfI0kZL?Om4Yqq;1GF&?vx%>*Z*0-c+*d`wAWP1F
zjtH)F_Cla7mD%IJ<p^x=Ba63zn=*x|X8Q}c?}bC%2j0^UNaISAJJ8!U^m0t_jB<o$
z`!|HX{5iv(xLd;+AsE)sR8<#G0G9J^9n#>i3{cEJG%368akWx~Yf|hinpsLHDe~gf
zu&7lk-`$1(^*{lIQ<PtE`1JEl3ApK-<x*wrng{n64@)5Qw`HhlHKbPbDdZSDoMg9Q
z@aGLrFLr|K6Qw+^U@!{!W$5jr<onF}6M);Q2+8?Zc6-LhrnTmleU&dYK(!trhz_hI
zn)g4SI)o+YtvOzMNyJ(I1f3pz_{i;Y(A?d8VZ3U*Zv2_9U_MO4zMwvD_9N|P=0yh}
z#fZ>3YgO8tUPAoFtaZEUWOz{3HURF-K7A8?T7O0pt=L-gx(3b%p{}rZNScKSuIq!-
zH2O*qwwCIu9qcvxIFVJ)&(HgsnQv;p45>diU~hP7GhE*vtyCi=HD}-q4X=@RYWHAA
zW(rjD4zpSL$ef3S7#rQBdw+!5k9o{Pb_|>su8BYl;+vV%_KndO&V`nqE4vwmv#_n5
zM;C>Ceg36)jdE_t_Tu=e{X{i=bMOnd+=W^kcmt6hRLkhA7mS`Jy<#k7XP`FH*lj^;
zHknd88k%CFm$J(#1{AV`xN+3&qiXJvyP&<L8kDiZX0-?e%2Hm{x{{0V_uv>god!B~
z<s+;-*wq?7tWBqTwrZ&w&CK8zY@DtgmZ~CJo`?wU-nL5BpRpQMow=9UnH{+!)&weX
zV&*UQ7F&TAU+GkbtnRNo^rl#<cWhDV`eRVBoHu$^AIqHrfH4P=KhB;g-enqyNo49&
zj;Qy?uo~ET098{(1vQPOZ)$cgv(ISAg7oF-hLD$+^=_2anB?1f^u0ciouAUGXR#R$
zpYl25Te6=o8qX1OXx@Y5Zcov^nHMMnULYI2J$F|Y+Rv@XYmUOg23a28(3krlG&riJ
z0_Oyn%QVxR)kynyErl<U^Co5YDKarTZ`9#4Kf>&qdEaSTU(?>t=2!<Xtw6Y;D7Rn7
z$S5YVd|uz*0t*vpF|(qm89P5>yTL6HV!P_h`6_thQFY?W@tUK)y=iTfkZg>xpA98V
zDNmpcS9*%1SU~^FE(=d>LzWx2@VSPj87G8QPm6!?kkryCSj)O3=K6STx#%iUsxiuC
zGl4ugUod69AaI>i`QoZ}2G)P6+v?;aiPW&LZwYl@Dauq+vA&^2O@QsWZo2xdHo~sR
zl&nx72g7HrXMKa|Ur^BpXX2$xRTo&dnlw0k{4lXOs@QP7siLFyqLhh@=iGN^8?i^3
z5PGq@xxNXU)l5hNn%h&9po3NSq~vLdo|}NO7?9g;)iw54jbN}I+6-ucz&;OVQtElG
zHat95>CWc?7bGc!eL3hhzpESP$`Rd`DizO}*qhg_oJ!U3L^{p;FX150(e+}P<dduX
z@gBkid}2|Hlqi2GOTXpb$%WcDNxGag(%QJ9MVeJIRnya*A;SGH6TGD^;4#HYdB6VB
z65>6_0xfM0aR#`7v#b8}f)HZMqUJf-Ts)z&fSclUg=}+~k*YBN%$G88=b<C{rS{~K
zUw-&DP8yhU-ZP#yuP*i)Ds$<Kmy7&Lfy9sKpc`HX_+iYPBx_ggT@$RtLp(Dq-91L;
zWlF3=i`x2TeEg(Mn?JNaTL`4072Bq>-Nqq*o2%<z$FJ^l$@2I68JikdH;!H4)=uq2
zvq5X`_49cDEQGPa1bL;lGv20Z<Rm@cTk4Dyyyc817oD0G7iKzXuRVX}lx*j)vX@>e
z+Nwlr!e`DVIE)zbO|Ey0(d&sDD?*Tfd)f6IL{8d<?;;(|7yLHl<ogz5MVD|!wuVIV
zYeCqb(qbW6r6cUM!)xxI&umyP_!Wn=d{a}M^JV3SETXE->2NSLlCJeccEEGVo7N<0
zovHn$`bdQN{FHYTry&9Y9joxPHPqelMGRYb$p>`bw#<vE0KcGquk=kIe<og$scxp8
zwP*$92}z>u?q=~d;$bhltNrvd=j2`&@Jjx%pPgkt>n`U_%h+zc)t85(#kMTH&GK$P
zPxkOz-ue50YVxP8+$-l(^c0LO67n12bN+hJnokFA84+*++p#a(r;2K+7Kt}H52z&<
zTNatN*Kw=nY@)huAz$~K5&D9%@&#sCd1>o<iTa*&;G0lqgMv9)S~&ynZpWT=ycT}2
zc22*Yz%1l*TI`SFX7H;Cuiow9`nu75^@J!aBi4ISfr20BEo0Uw)3Ps~Vk>|HOScxS
zi9%5`XjDAUbn`RiGh{VogD&-w8sZ9eDGPkn_q|n%7$~TB>->}7L7ZI>NW0+p83fGG
zcUZ`HQPNT2ys~!m{pwtzswDrcudTR=&kmlon-M`{`=6VUTasIY;B5E!LMs)u?J#B4
zDSaIK)<nJct7q>#zc{c;aSuVNT<f;!nT8%1@A77Xe^XaX|1{wi9}4sLY>Z&{*;8)p
z(e^nli9dI(aK|mvj;DBprp#wG)lZJ8jH(JNv#ePhvCFhE(5A5_lb7NbgwpHrUtZ7E
zM9=lXt=+`(-~xOKe=K$+>skZ{eiz>^G^%WlPx$YgC$vqa*RsYDu41-%jSxNJ8RJN2
zuXSaRJOX{LtlDT&K`#j`)wMEc_2h!qy_wn+e-~qHWfD8wdD^7!XIJk$O=C?x3_&{o
zNiPzA-X}bg+F($V%9*q!6n9Vu7gXcS8FRj%vZq5_jb2Mn1Xc?I(JgP~t&5%b=d{z@
zeIeUkrI~8N=?sDPi4ZBwCv;=d)G5_NXTjkW&X4UqJw@nDzJgP+P)USFDLjC9Xc*<b
z^YSL9_NgLEKPb&!$6?+-(@)rbzNMqcU_cpvXT!7Xm)1PgP^@M&mB-fFrz~;sL4ETr
zDr2X0r9lT&_%g+oIP(F~?pD*^(6ssAgNN-7BEs?}627_3Cpz$?w5$oJDs-%GP-)S2
z8fP;x)vs1{q<9L>MY*5{se3bL&3smp>X+_yP;FyS#oJ<6EWpBt064!0;UAAeuD$u0
zBzH8-GR`+=bM`@aFBxQ-OQTU5MC&RRH5KtThxeVj%`6;CCwsU^_$Ct?JL8@KjUD@W
zb|Ys2EkQ6y#a2EHD3s}cke+csKX4*k2YQ=_`U#<G1ohl{?zf1Q35rTdt>2-4PE>Bd
z8wa#iTmRgd{+z0WZDfq)ME(LY|1AmkTQR$zordFx8(saJK;O&0g4vKLf=1?R<38?M
zkQnT>i5Cd{L`f7795yY!bI{_k9I4?*Z%EQ{`~!0R(uhufzBy@$KRnl<x>{k~w%dC&
zQ4kFYF0o7|IA}t*wE%tG^Ya%v0`*>Tyx5T4XsU~J%p`;IE1vbW$QkQN&PZq&$XN}Q
zJXL`3@{47qTP4!S;X1hft|(9ycBp;}-~M|TJJ#nUJtpcstesj4Uzs>f;P>IP%b!#h
z+8tI;rSB>_LXJkOHjL2f`*v>Qx>cr5L;6oWJol5F_KBNYLU7k7?WPq%&zTXQHqLI+
zf5dB4>DX?#N*9RoSAf&o*P!4PPK_8K_ZcKR&ZcpRTGqRUZ8LeKNgH*$&R?Kiwc(Z)
zgCtb3?xErrVkrpucw~EXX*~1E+t_cGFg3%~7gnPbu3dB?ipK#<L<#l$e9KjnZ_c0D
zq*$evJyeu>Q7kp*?oZ=cq^gn$oj9MCJKuKM58|s<<mcyb-^^&9ahg9Ett57LknW?^
zi>qUbptu%z;2JJ?QMAYHM0Jv~=h!=b=V_jt>pyL^z*>Ewo;m1?TMwSUbHD=`Hb<!7
zo;%c)^u?a65$e`~GUuBE4l;Hh>Set*+10Q2oL@Y5-@{5ug`k1{PeJlJLgt==>Q(yZ
zpRNL{1&|u6=!bTyunkXsm<_&7&L4VzknQwHw-L*5E*;2el;|P(NJ@`N@g7>gV;8hP
zEIs1RaPkqQHNa`R7rZEu`8<<~Je*BbtTEvA=?R4CE$=I%Z}jp|Lu0W<37=nQaVjd2
z*7d#}i;^>YD9>g&r!Nb7IvX|DAg7bm(yMgczHQ68;o4_0n`e9nffOVmj^`7qR#TqF
zRrlOd#QTuGKP!{H_UW)y0g?KlBeS6Sbcu-NX%<8AccQ0u9hR~iwChuTnbprfu_h5`
z*4EZKh3WSg@9c;?8qkItFwh}~p;D9QRXUP&ag8RAtPJOAbo*=AwvFAFB6lwg{jvnX
zKc`Y{L_qkx>}PXpj4%PwNTu^T*@mWG%-y!b^K|uimKL{(<q~~QntVrn5dqZv8&UF`
zgQ^Lb#GDg`k97CH`6|l<S0kbx*AgNcW}o*-I3+16aWR%e<te=>nVC30#gl>$adT$u
zu+hzd6y{$HSzWi72H7K_#qk3t8$tFlV29!i+uu-Q0R$)EIWBMr{Z{SPRPTcM*)tuY
zjM`q<q^O;9hTEw2Mo46O?U1;qtQ5gKht}B%<cEq&RrEA?F{R)B#Uf;GVJ!C9Vcwj8
zNxIP=)9Um^&GU&T;&bljRTZap5K$-SFMFVXHbH!|!p?D1$trrV3T>w{7oX@lQGn3r
zq^FAg<~qF-NS@x8;kb<tmyB`$gl~1T=%?{XRh=&7TNJXB-7HRx6lIirzSn}r^8UVE
zLe|_~o}ACcMc+F06Sp$ldx|qQv1K~76jlA=Vjt<4c%==todR3+w>i=ke%*;uK00`*
z1sj~qPbGtFLg}81j{sML_Gj|<Na}qYXDdMSchhzg(fyOvn52rAuK^Rz0t~dbP~+1x
zg=Y|<F0MF1R?FezV^k4Q!ND?j#xoo{&8q#lsQGt;(}!JtSn#A2V^32Pv<Gh7aeC=B
z(XjjiCcxX=C`UF;)iHL}b!9pHhtK>exjr0QGmhSRu%mH`AnvUreGSS<D80&wi((r^
z==|kHRm$;cwjoFPNz8PKK}6Yt%2;HrM~2G%bfH6z`hZXdUP%5nl3Eg&CuCG5ov=&1
z@)g!NlumEdU${HqU-qk}EF-#Cg20G)7p59J?F=r9%D?IGkNMTSu8rV4eLWO;ahtvf
z1G-e~o2sP%Cn`U*xqOIHnlc_uL#@2oY$%cOK(8+3%$3ZaH1S=nP1ilGrsGQfMYuvT
zOVFSY@O$T78WG<9DlsC!7G(?TSodeD+~F^EgWQN8>?N;p+SbTh;k%(bd6Znl5c;a!
z`wQUs;prB+ip9D<6wIDv?jj~C5)xx&J|Ueu2hDpJ?A{o#*_OTFyeGTa`v#thQZC%w
z<5$uWB743+lrPl}iBd#99#sH!HwdR2Gzd+BoJ8ur_Z^v$<wzyYMWFlw_2pYdeP0%^
z4!?-wC$pyh=;Lw1{?oqk9D6TEzfPfr|9wNu_wK`==@6TAqnDP<6MtTa^4rn@CWiXH
ze$9lWN<_5H>{?S_LXe|h>p*Q(>2myo*&;Ag0oFYy<$aC8c~95P)S3LeGR=djkpQ}#
z8XE=$xlcci2Bp6BfE(Q}r%U|LeTLnG8i*WxP;Naww|(<z8P3&hl~_~yb79{b5!L1g
zs{9q@3Uy{$cUK#(Wv*3D9Iwmft2ar`h>G{d?YMrl+AZBR&(|J+iZ_OTQjv4a)p^VY
zPG3WRj^&6N9Zb~jjFrsnfknx*>sq=(eYxwo1RmB_fKO>|iTitPr+aKGEr|PdxlWP&
zgL>avq@>0II3x=0a?fsI;z`MVf2xtyw<@Llu`@TvwblD%vI{DG#vC<!=tViNFI|)L
zFZT-6RKQ7JSBPqN;n__Pm!|Z&@DCRec92EAI-k)T5mCquVXYtL1UPT>D1ZytQzi|1
z8J9&BweYx=IijxGN4XORB}WKL=jE71ySfv6#+8iWi~EVR(_Qg!+GN#Xo{>~J$>SZO
zi<gP%`n9MD<g-(-b+Fy4-v-b6)U`5uAM6ZLo1g;&DV)w%80+p7VY$|_@S%p!@wcST
zYwji!n$25l4D(u}8YR=R1;6JuC%OhG5zVJH%X#rj`g=ZsIA%D!+nF|#w)f$)(4?vs
zM-)yL>|426Z+iw1@LNOK_*)h82h%<B-`L)ld>I$nHMG66YZ#Zn92@hMdD2B1s_j`g
zrdWXxZ$U(9tJ%onZL@y7#vHW~WQ0&}ifvcG!g@blD-$i<EC$ofblrO-5)jcn{!7$A
zk3+C(A9l0r88W9ORlp{voOAnSGRN@1A;V%Nq0SUEe>@c5WY?SqBaTJ(Ow!OyXiv2A
zaL}FG_)OB`dX&EcdUJ$pE13$yBE6<**FDPf8c`87wQN+Tc!QR|F$IAt7ogvzM(yA?
z9`yxOgtc?M-r><XkH>*p(Pt3P<mmSE1=b%{RquC?R6!L;50<L)%AV=mDZw;oTAH*6
zJ8b@=CVYU=j^((=nldKCYNl0=AR>hFS<HEzSUglF8}U$^)4ppX*vFz($7S3&rS<nH
z$Yd#P0?m7C+%?GfCxhnv0BLR)*HmmzKMr?yoMlGQ6>L~oX?M0b2&0{gRjel+-@u%G
zCZEf(#B$#5>NxU&{j~Yc*{xb4_ZBC3Liy*6ew8j(xM7kNT!UwYs`~Lvt~|V28!K%5
zd*kLmyZa^KZM02}^JpNkJ;Ewv@*aV?Vy}k2n^D>SCaK4sDb*y+Sv}~BzwgUFRH(be
zK&i%1KyRYk$0oS9dfQm@13r1(spDh;dO55atk>LK&W+ssid<zIAP{5PP<}OGqq_0%
zW1~sGk4M^^(WA<tZ|R<HzTiZEgP5qWI}R%!j{;iY?@clB&FQoWh~S_3A^A3HBH)M4
z($G2mR@9TKv#Oq)S-e7!hgHdN|K38sEz#ZFdd{361NCjb&#MNw`9W!>Qc@{$@Us3a
zPpMljc{65>dLlYiJJX#ZIEA2EJ00Tg1Y8|Wul+ghy)&67l(rZDsri|{CD`hhHV7Rw
zrjRBoV|~!Grg`u-zqD98rO!QlpU9EVPGzRJyrf$hw3lyf(aT#=BBa6W3^g}}c1Zf|
z36}6?8f<K;l9+`=yZay^)wH?P^WxHN4r#I}Y_LgU>UQwZ7<yzDKBTN_VI_YcQSNi&
zud#n&Gc2NGdR}-ox6e|h<3?y`wNu^n-QOqgVoProh(ehj>rdR?P<u}`dKgbGPp6&~
zdA2WV|BlS|+-KTRz3rSN6`TItmDn_`sN)0%e`wCHkyE+faO`QU{c?~szv?cpWd+qY
z$uFI62k66I)yHWJy)d}QQz_#t6NW-k7U?L4cBlB~$IjiN!Y7bn-aY3yJ{S9qV@1e8
z5wHCWzZ*LJvm@oX){RC<9nl;PA4^>gGS7v2AYxz!d~O&EJV!Tz19Ng!hSUT39NL;*
z?SvwTCLXxg7r;km)BFkdhEj}vTI~$&Ei}^I5LXjh?X#ake$Qy7R9OFliuw6=rHW5Z
z+cs`?)lj&yTAn|Ylfoy#?;f;pn=&0#K7)Li)k=|=e~=L5dEE0s?+zH1FUXg0wVVK(
z<HMV@kSboMDBuGw+bfFH6hPx)>BZB88a*?GO^uTL0j7gi`Fj-~JX3UE4MrVhcPylc
zro9pF0d{<EfEY23Nef%h@9RAXw5{3S2wKHSbh~S+6|y8cJcZtGRf{?Ze(*8)aBHtl
zf$|F#`Ye6JKb_(1*V1)XwIkstX5BhXRR^ls(ad!m8r&|wAvUZ5jeNaDcpf+d)f%m{
z&M;LArWX>1(({}3?+&-gSRE5<y*D+#8Q%_m7+l2S)>sz~DX9SO3Ed1U?W$)`m5KH|
z6RQ|wpR+9VykN?)#QY^UmwldgKprnI|30ng)>u_?F|p@Z1~fiXA~nj1%SS@N^V~+&
zqtYs1r1x2wl+Xfe@wqy^#7yzb@6*GI66==tE{`rrvonjJ@3*WUj=1jBjP40*lqh((
zHZ48qHJ%FVt0L%L3x>sux7LqKE$8rxN@k$`+6L_YjVp=vxi~3N?P$hTmbdLzOk8~a
z5{9(KONos0`}?`hzzU{37m*2$8yrtdaYkELyMnzd;Cw~{81lYt5k<_^V^yUW1%@9e
z)Rw%^dW&H4Tge@Qs}jwC8uZ}2Dw~ZC%_R1Cde-z>A%4xBbQX!-NUaW2P%Lxx0NV1^
zL|H8M`GzyfqfQb%`TQ(Q*};^n)q`Dl4}uL*^H=q|5y<o0MZ#wT@|z8o^mQ|g?zYD>
zsOxA*&)GjE3nf6D6)IclfI^7o+&1{a;ILbNnUKdUgt{#AeX#ZGb`8(qknpZSO@~X}
zL1mRpKhC{IKDS{DYa+OIzrTd_M2rI_f^IfK-9Wz(C|I+AmM8eNHO(cF=#%QS+sgS^
z6v}13Zx0LeXpWdi8d^>b+V8o#BwD&zt>sj&CgZ_AV)2}Rn%9rp@+QJyvq>uXm*kx2
zl8DESnw6CO{@e_=LidX_7Jc(a;^%vNm=i!KppUQ-+UTKv!9%P@yU<YGR4IY*>exFj
zx>|=>sSVZT`%c5hlde1kMt_}UJA0y+A#<w*aC>S~m*1tkjn?$POx(67==c2P>!h)%
z4dR<?1>WT&YAfMaUu#P!P^hl=5N623+5C(eG3c;dMAR)?@@@ATyP4;FF$uL*odew}
zY~JDf^xPEeK{MJpe|VVa;?3}>Wci%PsJm#}mb#DO-^u>tZBac-uG%Mj)KY(5>kx^u
zINE&@g*cP*81d^b!F33(IwJ>g!3*<X$!Y1u<MYjyTC(U_waGQ#MNbyuM=}lz4v0mE
z!y#^-kwqlyAG_$_)$-gh#~@%$b(!eXC#*ZDY=s-&_Z2H%dhSkX{+rEWdAC1qefA+0
z`#7~aF26I(%>DG~>@kUTregjuQwpW?$Rk7edM&TRREhTk!rEEd*re!WU4uUchoiQ0
zJz*Qm)$a3^(v+LSwX_z%N&_Sb7t~n7m;L6IfBC*u$GO{qv%hL2$?%y}(!(_{1C0i3
z1I!Q+w3uZZLV@zIwFr?u2Sqc|nTE}jmPto9LNy>Pl}borL+N1XHrAp@vAV-|HC~kO
zKAK8oRC~yHV|-P;!}h!TZml=pz?X*xv?-pY;myY8ds(~5+_3r5C9{n@_!k!$?-X~l
zEaSAk>UBQ9jP_^yM?dx+KbiX_zP+Mg^dk;g6QetzmRb#UK9ZXVkl|KsEbhC0nR(tw
zG&=aMPm7bd(1g{9#~SGAoD*L;U)|t`+12Y9)tP(1;#YBe-CBNChB;L2(iD)IAV4E%
zNxX9+Gmu>%XjsR?F5jwkQ3o>As8hjT=q_e5xgF*rPE>c$0G>HRIsJy|(vh=m!o-HC
zJcK{*uh+q5Z3z#%uaf!&kZ6w0$j=NBI8UAXuac&jbV0uxBw_v(J~*G9`mf{%`p=Y!
z=AeG{;a#%+q9(UuK`&74&w-0*Q{Wkv$5FybSMu2=<l5yvdf%#{hy58|SN|1q;Hevs
zs%wy!-o8NSwc_xMpH-tHzuSFn^UU6CYa{$RP|UXf>i38M|M!D#$r*?FRt}BZvnt`&
z+q6zT4qxopH5h7U%;8@Oq{``#Bh!JD{{89-lPngjyLVrA%`sU&4%dEl@f7pzYg~Ke
z(Z-aWtEo?&vo&$HUf0TU?yfaZW?V&lQCIa1tnB&Qx-Qu+59Cqzv|Xi{oYm0@sWzX}
z-mv{P+B^j8`U!bfA-F7=>8VL1xM8#=Uw!gt*W4koY2O_9X;I9MJUSId^1-Pt@%l3B
z6m4$(sb7>mOJ5})L89CsHT_WFX@ODAM-|n}>gznHxtex`Aiqe&_3U$U2^}s0Q7KV=
z5idsr4V>p26Q%vYN+Di|9urbZ)0{#H_EL_)04FXRZ9`<skqf#XJ*${3_w3>|KX4!@
z-KiL}uzGv6^|ycOq-Qf`xO6a+Ju=d<`LFB@o$a=9h5OnX1#8!D3X)7oexLW4w*m;5
zHyusHBuuF0Trqj|zmB4I7SedH$mNGyX?FF{>QoK>yB<md3S}uqhN3OLUB}y9iQmai
zboNXdZT(%A`j7wag>i(Oz=Wh0>yM9V2$-$4J<2YQ7Oxueav}&~(oGgY_S&r7EfjQ9
zRcBuDsw_v=7kiJ#`&gmxGW%q7_RPQbsY72<z(GUDdtqc%1LBm?BRNJ?N43W2ag@vp
zu0i@4S&m4<x~V^lW#=S+jHFxLEz*3O*do)b5(C0nttiFB6LueMTcjYiujk_9EP*^;
zTS$UuGtn)wA$C1nZYQi2MLE>NOO-3Bz%sHnv=m6*jDR_<ieZ(2SslIGlt*)Rb8Sqe
z9<6}<J>Fk&wZ7nvb&dZ1v;L-VD(yfS$rV}BY<oAImYhUFDPJtcdQG0iF=KqFVw6ky
zs%N?;q{d@gNa3sdJ==Oui^s~b=r0b(INs}0!|hTTJEzGkXx{-Ui%bjKul~$C$2|Lu
zYlbF`n3Mh#9&@Z%gm~siwSnu1VGtQS#t=>}psE|5<`}0@cuFA6Dy5C*t2%}|b9?d7
z<(=<@SV$86_UOl`j%&CC+H3FPN;=g*%;os<FITj}ZkHm=tHeZv*JpB}?kR#MkE>^s
zGNzQa>TYiK+Tuk3**bcTJ33HQx{O>t&RnS{W`u{wCWJ0qss;1Rl7ddKA|#s~y8iuV
zM9HB3uatC=z98)ihjj;!Kt;3M1^&NzRR(AT@R<QR!KX!GS6Bd61kac(<^5<GW`RkN
zUUi8Y`3v#BvG*=7y6x>XC}I3exfK_C({owy=yv>tk^`3-kMmz(Yt_$P?*Z9)hJh}{
z8F}HNw^xeG;L5qX_+{80gTqLPbFTs{$@-_KjlbRm=Ep?ys{OKAE*kA#af-k8FcxCV
z>p~6zb#xf?^DRB~{cq264^7pY-FF{fUwN8wtpS?_jeXE|^R;aHD|*((u)jKXGj;p-
z9vgK7TAP_)=84-U(6hfDZ?PDmwm~`Oc?)jCPPLjfcSo-GR6V|%!fnd6spHVw90yeY
zgDcu*cQE90tE2zXY1lNdvB+=Uzaw^tTO1W2?0!F$U8kv>?j6y|6yG9gA|;q%wW+K-
zQ?vQnCIYgJ&(+{#SRE}R@5sOam)jO;U{?TgG|bFT1)fMQ^tP09)TM%QEk3fC(hQBQ
zb2&Q>Q(m1x*M}M-2f5}BM&*GrhInJ5Fn!i?hrDqL;+>t_&cDAb2D!xOHbkiEPq-Bk
zIh#wKvGBxu?KdxjrfF<t>z)aL&{19Edq=BEjdM&rn9_b7cd*0{{&!`bmJ+bERkxm`
z<Y&pMpeFH2DT>c{@6ZNpC3Lm9LPz5KtnS`h!@ooXdD6Fg;e<>RZUNNRwY~SAW_EhU
zTlDXiYVB_mD>$Q5<962XY;|t5WvlhyHpfd>U$`lSc!-zOSPZ;`-6nsW{%hipvA*v(
zJioUF;#g10^#FQmjqQA{8!Q_I+w%tf@~s!I`kLIlu9bHY#y!QFoLhk`l8v&#t+2T-
zkW9%Tt-DW?^sp;3;^Symd$fE!9zOi_%2QS^!0ucb@t30EAStzyt2W}Mf3FgqRILR0
zIY{8}QQl9EgHq)SR8OpQX-(B->1CIdqgkGgV{;aD16|<i2?xi?J~-dv<9>gXd*Z<k
zmri`Nue<m5X`lUL&TY?7`DqsfSKL*^O#8s?gsRESfu}l&&%HgKp~lL)0>i|pNu*%4
z)>6@6fCD9SPiuFd2TIXf4n(hN_R?9cKf3{ZJ<7H{OE-xc&ly()jwmI!pl}G7DQn%q
z6oXA}Pf^vM5Q`JR5KAJXgB*e(#Jow))YdQ{KQHx0dZ;16$8hkAogZuIDWdXd`r}N-
zQFe}-eCoM7vDy$9Pdd3wtsUx0^?h^+Lak{9dgIAul~Ba2EM8_V8E;g)TRilvr*;3w
z`^~Y1IEPm*cT1%Vfos2i8i)(V6#<azA1&{<G`mh3M4SZftG^gkzBIRlJMKeMjHW5x
zA6@>XMkS`lR`|pC!C-aiB-PFQcqQT0SIrY$9fXXrU+G+`wwFEbW<`8v<05YaSMM5Y
z&BX}2p}%{txM=9sKjt(U>y(RWb3rX{1Jk0aB9cyMl1gG7;wbBT4s2H!t|F8i?w=Xl
zLF*>*`x|TDqmG=mljgUxw&zttxf<!GT_nfef3TSvonuw(w~@LR(mx4d^l=nYzbIS3
zBCBFmQ@px338+!ZtsXs*vai3I{p(sFX8(BlLqzgT&+F7yOFT2Bd1+ps9hTRwe<z#v
z(Ho1>?%$9B3DKNfRj|-~-Mca&(ZTzk4Qmf+nVx~(>qKd9-<F~H-Xo_Q75<pxY?8ry
zN$;xnN#V8hsTZ%9p{!GaiQ`Y^B|8(%PaN>cKL!U8?4RF*pG3J;LhWz*ki)2?XLy{#
z8a?63bLT%M8}B@bOXr@`=&S0_nciooJ!zzn5>D$2Re?$q4VNe0IGrr)6)Cr~)yS(8
z_usR0PdC3TQs<pRf|1ldY+(y_pHsjRgP6-l!qQ2nz{kdWjaL(#`Zij5D3=~ICZY{j
zIR-tHF+5z*J<miT{pXF`TR$4!mK>w6SW?G*TytXuH7m!iVW_+*qqKF;o1v=DLzUY0
zXRAnJok8>(M0&<<?4>)9vz*y!5@ZyY5ko1kFI?*=HZ?IWYvhn_$^mf<^6prGyFs5V
zUSAoA!4YQ)$=XR`mWmfCY7>uY?iOajeMojLHdtkzV2LG>p`(bXPou^+_ZUaB^%O^c
zo<R>2sLI;d?=J-ujdzpb!y-5Ssx1=s879WY`nB|qzd}69ZxqWY^@OL{m@un0k0ans
zoXFC4beIKL^Z2s!Z&=>CP|A$Kf$oiQI(ngwCc1!<ORG#WIGv8d7*YPRr&_~dBiepu
z7?|o&OzU8+Zp>RmHc&h3Ef>w>F<#A8Ew9=57D3Zc0$Zrv84|k^KX>2FGBDtFm#087
z^EL!Tx^32}W+fg_@8`fPT2e$eQ@?&gkIjhnUj>zKD{)$a^Ni)uS=<+(0(9>k%6mYV
z&R8^_`ncY^)}Y1U;`n}J*biaiZR3f~#}oq;Z;t%spBU|qcuSMKiK#BU=mFfGe7g&^
z^9bg16;B>)IEGK6>G{gyIY28-0#OKSzxgjP!c$r=)Gxgo8(XNd0&R#mC{dZ4whu~Q
zQgxzSFkuHLh|kX4yUN$EsVP<$x1*~t&x*Zbb<QNo%NaY7(dk6>n`vw`3EC3YHX6~u
zHR|2xqgG43ERhAqHQ=ZFqYlFvSnnt$1Gat^ot%WzG~&H;f9)96{<??y>E~m9JYk#V
zGtn=yKL+-OHdWpn2k7eyc<M7_PphsSQ`8|KJUNSK2Y+h(ZN~(qj=4osZP4dyCpJ5Y
z{U7k#5W#O$XY<19n+nz;?X{9V4_FbhnF73GTJ@XAZ_)DJo;X5a=V-1uD(StyD$EmS
zTy7dx*=ZjiUT~8%64rXQkFHlYGhr&#0qYp|4Xp;4jQB+_o{n?Zz)GX0t%UN8k_dht
zEcE0|eXOON;+LN_ZWxx)wW2_<l}l<1xhJP8>54@(c_^Nmw3Q6l9UQCQ79(a7pXY<L
zeeCAPxqG|Za%!GqZkj^wI8KS_^)e)p&+i<7qWPAh)wJ<YTK#A?1xz9#mo_BH{BvlY
zM_=Ij7w($&ioHTnmbLoH9|UPY*<>Y$`q%Z(tQ#gDZfYtxIBR=M(rVNg+67fr=Li`d
zH$Jn$2oB)RR6a^ZIyWrquPlG2;ifbkz&Et(SpNnTYsKIVoriKjMMTL2rQ5sQHGf>&
z1sxXhgbcast?Uv1femf{1E+fI{RckrGqUS=RR(-mf&s624B>lVz)ht^i5PI)jG)|D
z_C~7d)@Pb@f+;NZEh&$$WjB*rX=9w*1f~P??ZhO62@&ktv3N+2=I^M2(%hQA9tm_D
z@;Ixz#fFHF>t19fj2ICD35>`*9hC*8BYcZknNWwzO46foK{c}dmAUC%LouSXBRae@
zd|$@N$bolY{;Q`E&lllOICP$ZmL;52DbGsJqbz42RQobSs%u|~5y+R*6BwD7H7^7X
zi(t_;hV+*|8jxN|13^_bSp%h>5$ngMh#=tiuiOami}87@{=rwPB{&kb9+!I4&Cy2N
zsl~e)gQznd?a{jLsa(p)-w9mG^KVhltVpL(4(NKwaEn={GMTxRaN2V?eF%bdZe@!`
zVM&v!!M(8hb>xCeuP!BQQ%A{gdV63ijevRn4lm5FZ%VvQMR{e^AbcG!fkBt5VJBcm
z-@H=S|I<}_D{*pu#Ck{q!?iTX))kzuE2Zl{d%uvkeI#EYVIXx1bhZWm(#_ytxD%|O
zw0|~mvd-Lfe0Tiy%T@RB*P0wBuILtclO~mV^ZS!6<X9c0!V>TG@X8iKe#xlB@wwj!
za_r)n!jkay-O3hTe@}Q0!`d-Z=hFBqhtrN620iiXv6ZbJd1+&+hT{Oz*)Lah1Fagg
zx1C$85!+-gR~iPy&lIF3uOTa2)@MdnAn$9@+pNDn*QL+hE^ZdI8g6j>lBL3anb0@G
z-?-{6&3t#s8~*ZRWouKR^%L#w%2smty3@*UAD3N{1|Let?>Q#i(f*dFu&%K(EhSYQ
z5D)4#!%Qum$#%Uy74;wJ71-sJCa2YiGay37vEz^Q?>}m;7d?MLWT1fG0j=$*OxKIF
zg<ER1rCwC#$<l894Z$5E5aAS0+S-8vd4XxLqDb%K@LC5@CfVuE7e;<McR=odj&&#R
zLu~rLbe^w7TYCc7N;N&46#|@2FCx|ta{l6Q2gEEYjNag#W^|*ZT`!c;cVUQ4=L<P>
z#sDg&-iHDty@9S;xP4IIAAYId8L)vSTeu|{9tgPa4=CG2FI^sRE!;-lOLe108hmg-
z_rp+$TN3nQA1c6AAv!Uj9lEv>;Bq00_U}XC)!#Uw9Tomu<M<Ut#+okC-gbP+YYU2i
zQBuGtk4;ssK=_#Yr-DrSE~f@v{i3=J2^I*Pl?MHi^qv6Fa;uW_hHvL{5U>H}Ru_$+
zMo+tec+f)5AQH5Yt8kamPlS(aT^M5E(461j{?F%?&l~O1+cG-r3%9Z2U6`4i)ZaV?
zNr9x-xtGz_3*Q%R(-EPFfKBcVwDgBy_+=WSvDCFfmtrD9UGp=#_7`7xKW?bGm`zSV
zq?h=UF+}X4QLq=QQ9gU!CK_K8gL=c}Zrv%)c*nY8B=5wb&E1a7Gvr=%Rmg}w*)SR}
z`!YABKT>Uu*?MRoBgUlJv}?bdxpL<icGoY24L}<fz7J3sb~h+H7r8(>s}N5M**a~x
zJ-GP|pBttcqS?Pbzn%E9uGooiX%J8Lac*E$W9=>RVRBq`rMOp#v#A-A=FqN<2<@Me
zKr!h>*OMJR=bmw$>snuwfNpI2k(RBxHj}fYBctl^DrDQ7WSV%skh$=zNIfQHTcEl<
z`C{2x-!p+D(X5`}?JV7S<K_)W#yehi+>-n-Zh6WRo``p{%oGax(=PXf#MPTBS&uuU
ze$Yj9&@yA-3AaK6?P_J)`X58b71#8E$J`NyN%iS#$B(!N3{_q9{<x+NP;(2rHGCg{
zKiKLYbE4#kdFM->tl;KNn7p)ntQ!_tI=~ULibe<D9Z7g$C$qYG$2EP+Sz^=9h`c1{
zR$D(7@FwXCEMS%j8sNV=FwP0kE0G{LnlsGkSZ|Q1f4-U7gVI`%%tQbie6T<l>*((b
zk|_vEm%0c9<!YN!{a==Qht1aH7cGQG4?B~YTd<GBI(2psrzZ)p{hR=;lBRGxAFo5Z
zQ{$j|hNGI$vejcSx6|^md<J@XJB@T{aGlF=u|EhZ;YG7D|4Ke*i7Wa}aB5@eaGCBe
zhzNA>Zrx~weCyKS&Zq8~!hQ4u9}=}C4z&8?rWizz#?vzDTjPpj{|x`Y0lWs^&;cix
zt2fCp&R4IKV_dF8JQ;#dGMCYd3x08UnJdS(+?jul^*#=d9Z+&)$~8p|Y&Q6Q9iVLR
z4I4=AqNu##2sK$h7Q92mlpe?j1fG~s{zNz(p4PpZ3+p*>21&B1#^=5T=DwB7eM^&j
zEn+{KR5%)02)M^zD0_5Fa!9_WljZkbrZw#zaJ#kS#+ucdAueNb6}`rOcbAud^Hlq=
zB{`vqhs4zP>~0otN+Dy?jQa$s1MtJ`)(Hf!<9$iqA*jSqxEVS!-nij9054omoi<Ng
zd!69fi;e-moO{gmO(8u5HRZR^j_z;$_?21a+kQcoZ(y?OtRHjNX6C1d%M`OlPwbaM
ziOP+>&Qh2fJyDg`=HMWOXI1HU;BMs$JSA_^I@Eq_$<Q0{NgHeSbSM;i_9o`8yzoIe
z$!MM`mM*RVg{~H<maHbOx<Wv(VEYbEJq}DU^je1Q1Fky78?E1Cc-t#E%Y{#ar5@0H
z8x3(~J@q}@iiyAnv$qvJNG552o~tQS2`05<T9;D@_^cWG`SDAJZk)@)tY6>4r$p~?
zqVNUSKNK)Rzq#X&vwhH!45qKwSXTWiF38;ybyr<zn(@sWe}m1rpv_1zN2OgtkeO-p
z;2X9t{vlgifvK@aQY^L<?j`xMMxfJarpvPNuitd18gE<Wav7F2-l#o3*>G3aexued
zfqPP{Q2y|;IONE13zS{@hx}Ayv`kFRZPjFyjCj}$4=>UA@DY8xEG{0!BTdFnSW*}O
z!7S+^-Kz(IYM9n#F-gHJeMd~ddo>ZSNO6%udQReHJX%f0a&UTqb2<2%xM^Xa+1X1~
zR4|{erm6bZ_qfj}{zud>s&1z$waequP}pmhS2P9>M6BR-;VH7eF3Pg-_^G(N^hxj8
zPw}iG?M`l{z;t|9_TD1LpNCO*C53GT-~QKT#1K=K>DZZyy;qOk^%nhWQ`(pM=l!3E
zw$3O{CS`h$232vJ^_jp&*YM)y%|aOsT$QP+&gV?u^YK&JZHgb{T7P<&i~l1ZVA%c%
zSBhdyGgd=Z_3U#+HV6HywZGWLi;+Z!dd=^37Vv+t9~K4Xe@n(UX8%+qlZTy%uZbbD
za=*plD{4D+QT!jx$sStB`0HB`{sVT>!eIYXAO$88|M`o2877rjFsddijeA?Hwk%Cr
zD3kTg|G%&SGXINTO2NP2PAPn${1?mrm>X>WG2QWd*%%9golZZ%Vty6hgABjAPbs+I
zp%YFK3@VP8V4^1(!fVFvU$g&D2mS(^vyLC<LE4*`jK*)?iq01z>DZvDp7`=NYG1{1
zx5<4qvQ)kb;ZBijYK*)2eY1jKJK$FrwI;iFOOEEtq+vTKiWRD@VEJkss<aE^E+ri9
z_qkteN4=Jvk8i+nP#irc-@`{{;D5|Y{bq@u#HO3ymV#}LAIa7}%U{hwPX&`w37L$~
z*qHFf@o&c|+>jMKFjSxR_xdyxWJfP^lG}4>pMYyKGD#80D&rGbN+lV%fh9na<qa6Z
zv7wiNNdZq=!*g0YOF!-FEyxP06`tGsVt|?_S*duV5?DyL!$(=(<%2lp8K?IdF&w`u
zH+NJ+S({rnx7m9!3OG;NX14-zSUG*@LFI#pceHILfgA07YK`7J?{NP&$P{H{6uD%f
zwjZyWY#QEFF^|Fn2YQ>62M#>hoh=_sy747&UFl;_a?LNkGzGiU=fYaZDL!n<ijnks
z%M9cE>sn63TWazNJ$d&D3|i_em5FXotq=^29S(BOI7J(WJH?h>zt8w4PBN}#67~o!
z;ru`F;ZTqhW*&fl^U&3n3>Vy<ZB}l5Yre^druZp-x$&_Fy?)6Ni-?@`!c}8};;l(A
zZeod&6#vgNoF}Fbyl#m{8;{$KgK*kl*X;N>4^9|U@Y*FFY5UdqzwzV-E4*JL&ho~t
zo*`xYKc`{~bXQCKa{x(_mWh%ljsQudH|ZeRw`NrZWRNNS|0!5r$KoOJ^2R6yzs1Ms
z+xV~P47+}qf&H(;c_7GOO85!m@_IXbhbC;=`!6e<3^E=A&tU3*N8pGN@Tn~%{ZPN&
z&ZSm==2?O{T>Cq{4>mC01a88d+GA?|vNpHXx!?^nC5Q6)1OCOk{GS;r$(<D*ua$HT
z=@u|S5({+dc`oxm4+U;C8z*?1WvAjzN&H(xn1!JF6tCF(-!jT@KVJ-D$bw&UqtefF
zdoCP}AN}X5-YB?&+J_5AG$Zr^%O&vBS8<XB?`2F_rY>^u(8UK`ZYi7p$HM{9*PpZ*
zo%uB?(#!|ejD+^mot{XsqW?U3bSjgDcPp{ADcib(cZl-<%s7hkmHyFbZq<cs#&1~?
zV({;FlGUcs1G&cSJy~gzYwy4j9AEn76VnX5lVXOhAMWQ=3=H$3kFX_4w;tb0DKlng
zV)S7xDYy?uQm7}<GccF_Po27b+dp;Aqd`IRw6yc@#>lArX@PB{I6vs$oGxeK;Ym`%
zZ&UmSx`lG^p7hk3QoaE5>EF0WU`NpFo<4}ke5)6F`S|mr7vQ&@YA1jf;PI{-!e4|V
zeBF}TZ-b-g?N2Q%&NW1Mn5$Z26sajbZGTlXd3{9<Uy=LBAau<)crE%+RH{I3hv1cT
z8T{(gcu1U7!s++8%qf?X>|7E?zuB!0d5mEBSV&Y$`H|3K4!-JR8ft|Lvm74#zY^_%
zQBwA&7&<6FlJ*9>muF|=8wLc}#`$0ZxVn)5#A3ShGA}Gqq~~U<DJyJ&7-5oUe(fvC
z&eWXO$zckOT!I@%3>dcg8LS@rAGD+U6l(6z>n9$DgK0uOALSk};{Tsv?Y~H#-S%l0
zR-c%T;YCQjJGIuQ-^MeoxE4g4nxE}1^c`*r*T<JGJGtSp!+d`p{;^C{BW;m6xv0lU
zm1;W0%;=ThYm9OK%?P7F_w=8}9&FmcsFu^)mXDFS^A{l!f&YB)-|Wk`<ldQtUb1e<
zzB2*)5^CJEjpF^7a*F!?p5etc=~zf8#ssEcBv1T8F@hLY+h|D8l=QbwU(gXrL@%B0
zDQ-kSiJVxsFgpWh^buD#UPO!Ok(yUOh=V~W`sk<&FIFnB<c_T(I8G|?6wBgl<Tau1
z-4SkLKsR0CX<pC8=4@ax#%@{5Gah$dnpK040Qq-l#sVI{Rwr{D-|OWGyv&y6lQPUV
zU5h)QHD}4oq+9Jijxwo?SxVq6yXgKw#aE5d$&h?ZE06NB;I*8F3041WHi?{{*%nCf
zqc7D?$0rl2>zUl`_gj(*@6cIAJOZ~g`(wC@tyq*LtFCOx_&g7S&zMR`4E=0&a6U7{
zUcYhQJFgC*$~?{Uxs)`@z8sgd$Q`FF^^Xyk-C4@U`|KyXb5U{Qx2Rvg)1k#s8hu1p
zc#ZRm#LSP0(>!FVwTJDEf#rvhkQ%8Hx>XJJGlp_357>R1#^~-q`L6Ua;8gqmF`mWV
zS;zvGnaSl1^SjI4Rs;KGz~3{=^s^obio3gD@yp!~6Nc04tQov!sjai@QW9ssz+D_e
zhUIHO-L(d7U}MXtiyp5B&VIVP9monL_c+aa@4fL~B+f9xyUR~AA&pZ3OnfE@;`D78
zHPJ_Gu<J4j+}~P1^n5=U-r_>AqkGVy{jJ$AOz)`8um-0x-B{%+FndVGYw3ENu@+w{
zE85Ov;vF6@K!KmgeupiC>Wwp!^4)!MJ{p&Dn=j!m?%RX^>v?y>_^-#+9yk^<EM<C*
zRYel-my$lddx)V@{Mz<9EEs5SmS^#Lq(si!T@?8jL;9p%Vrm1E1p8eY<Xx=cm@zym
zU~ckHK4JLB=3!7Icu7Y3Par_!`lY#V_Q{_zl7L&2(B#)0O9?DDvsCPdGa;>5e~DzA
z0AQR^nn%v}1nKDo6YPPFY!1_a(|iFroXfQFQ-Z)lDwDt1jOpWw1dK<s&?^$!g6fd*
zlOFVELVz0}1*eS`umO03w=5Fa`St0NI|aGS3gBshKtGOiI^V>rz&<PyVn!E07|sV;
zOvfX<y7<E=|5mF1=tJSae-<qN&jP>#VEJLW5LIIDGN6s9%^qNdv-}(|1E_!4CI~2P
z&wWQh^N+xCCJF=sbS6}S=}YsgzhT#>vOf)xHw75t)ISfL1f)I;6aeJ14b_>Z)$?6f
zeF1#NiA^2fz+bil=wKw;rU0c6odpA7SRaUF>;NhgTms)OrD*mrcaina7Z{`CyxRox
zYRF|~0ly!T3IR&lh7y+L)yERwI!k*SU6Kr9n1SV3!9?_&>aSe>v+)g0;9P}ENjnlS
zjj=wkyuHcm9aC_5Q4GDaiX0kas-Z>-EoRu<d>N5{!>Ta3C|14rZyx^)z_ED_7ze~+
ztQKMRCpA2z4jcivK8)oLOvhRy4736W1obGs>1GMXDkPM#1hC`0rk3dgC_ene2Z+TA
zBs4V#&;(g4w)N@HQnhshUOa4j<CW1F1i)$m9O4G@0DR2{g&$>^0B*6jDBGF<3%Ie|
z09W()m+unS5)MLRB>^BdcqCvvFIFVa<#WqYQcxG*Fptn0ca+D{nGxWN={)^bQS=3X
zjnnoIzwsX)E0$o{0D#0Ud?r%^$ifA11zKWp613?8+OZ!!lPL#$!zJYmG{t&A!1({L
z+Bg8lSPS^e+JHK28wx-%;1li}c7Pg|7k=PpKn(ULazGZ~{DCQJpa@p^<3JUFH8#Y@
zov8uW8e4>{4FVW`5Wvay(NQ)T(D-2VRUkK(`$ry@SF*~C{NNOsxN+0R%gPwYKhb5U
z&WA1S{}9eBf&A?xomjr{Vd8^oj~P|_13v*gu|wk*pGc?VK5fgu3|P(@D2X-uxJ?yc
zk8Mf@NL#jEc|DAi2AF-o$YR<30i*NJpk*-0@PC6cxj!aYY4Buxz{?c+SXTLw?%R~7
z_^ON=uQQKp?ZQKrUk1O-mRVB`zH>F22$p&I;00Sff$#twN!!Oqs@*C3q`wo$eSZYL
zA}^2J26H{&%ntnik%-Ckv6&+K0bac3+pVW>lSvzcM_&bVGr4~(5|Se&Gk#sVl@h}{
z!5YlZ#?SNCl+2j3-|Ml<+fcH%>7*;cq^!XrOr4Lvi>&4>asT+g7L)3u|3~0~P_}P>
z&a)4Ykf-0Eq<g`p{~+a$%Mx_sD4bb>`I*um|51LO{xg?s_>DPRFn_l5k8KvVlLX9I
z*lDD*!EG#wTXO%uu_nYI{~vpA9n{v>{)@Jh7O0@bp|nVG2?bi5;_e!p;98)#wWY<S
zSa2`y?obMZLV~-dSST*Rg5{)r-}^hixp(eAXWlt;@0srmYqK6*&+}PN_RgN{wKhh$
zPek4N?BPchTpLM3l20jwy`P`I#Kdiecffs@{?`X4Yz|ESt`e>m2BRN|goU4fF=8{n
zc!SrC!9r4=7%Pr2@be*qf3q~<=87DykmM*4RurMxH)RsVR1nFhm=neQUvjwOn$~V#
z{s8%c5bvWruJ{i_MhA@+o!ywBr&997lJSJ`pTA;2f5C{6`o2DSuHftCMw;<Wnc$JR
z;viowVfE*K2a^5LSNg%fq5T_{zT|geEHEZ49;VN%E0MiEBB87=lrdBBC*XKz25wB~
z`jYR6A1YL?-etslD~HQ3`GM$DIHB^l1w5*9Tyq&*c1eAr9}()8lI^=MzT@7N#pRLw
z5N8sNRA=~1^<ok?R~BPZ9JfD8h>x-Uli;Tq!uOwZ7_ezs>kK3>;`SLO{%2~^lF$EO
z685)jwi-U)|F6tmDBvn!0Q+yrDtHlTz9asWpl+Sd`<Cf1s#cdQuYx4a2Ls;Y2qkXi
z!*1lO^7SSDtD4O4?sLq<-qut6orymwV{+|QXr(6o_vG*}J<Z^G#ES97h=&<a{7-nf
z=c+@5xBAli-xV&jYLupM{%b0KJhiU-3*28XzNT1=%5!DZCI7~cK83hD5jR7cSJX1Q
zkqFZ*l;&aj#7gug{J8?Q0=+zOcPwt8bPmHODxyjG)GFe)(YR*ct~@N{)ETfS;_j?{
zh;hN@ffPTa&wW7RPyd0aZ#5$3JvKjmF%d@7UiuD3izp@RxwNnN_16QdQ9&#cq7?bm
zDB|vjL_02`?_qajv3ck}#PMD+exizt!sC6-^oeRK7?1IHn1md*5Tv*>&(&v;mN49Y
z^<noHMk2;PVTo(L%$Js6jPHa>xtd&Z;kZ7_kp9K^i4mk7I<~aI>czv<TGagGj%v7h
zy0$4jA<5fh+-hkovO@R2sbM~v^xxx$<KK)jVQ~<dDWq}|V-#AYN0~lx5t)VGQNq^x
z3rgY~Ek;VP^6Y(hjuN&p{qH|&)!*EUC6Z4LXO|*~!onq#u`MwEKc?XJN<X)b3db9J
zQPWLZ9geS5FRvd)@-_o^Rhp353g3Hhvjb2}bT<e0j?B21pzJ4ORp8rPc_AKUQ_6fq
z>@N-MSo+-2o}+sYWh7q|7D%hJSOFEWBk0wie$2ytDwD(VNs{P}V(M$+x4F0vWz_$W
zPa|^F8Selm_sTFntC_KciDng&Ssqt2e-b6y4gao+?MYuv@-Y*4_nR_jxS1NZ-+01P
z)~z`aEWI3c>@V~vlLv76w?ta%m@zt}jmF|sgWkrqG7Mm+(*Jz=wh))40Cp4hT#J!5
zQ)`{gJL0+4|0Up+`O1o=NTeR|K@&T1oV1keU+OXv|Kk2l#rtV@KJGJ_Ll!I<B9;gV
zjZ1f|KtC+}MEabkcMEV?{tCA2emst)|1V8ZsZW1J5_VCi58}Rtx4a^<jOb)6!32dJ
z^yuPIF}(!o-BMij0vL68jt+LkxZxp<rOb17ECZsS5ji@(>{-F(xRx@b_EA1nV@>O<
zUhmk6Ek)z$AJ+agln1{Nc_3;_`nK#u<J+r07T6W^e@I-Q%qSa{Hc?K*9UaEZY&nwW
zwtvTo2BZqa2ae>o+%t%Kz5~F<=zU-#RtFsL!~>e(Im(h4%L15jv?Xk>rv2`Zihes5
znRo1;42c#ae(7S@(%bSw{D1vU&V$h|M#%Mwc4G11ybdt~U`M`~omE|;ig}^`xZ47k
zOsVQO-n{H%hy@Q>aE-o@wA$oQECsl)nj^#tz!CYyN^RUJ?JxZR1fYoQ{$uouw5KA`
zCmnDYv7$TpDVD;!Kv_*OmE@JI1M6QSbA!iF3w<&Na0P8!<C{i@-Q_QFJVAs5Iz{9$
z(CL_xhLUk(ZXrMyuR~)(i|xv!Okd4alyU#Y<?8Idz3bj=*6QpN(D_s@Lmm(BgIIuf
z)C-V*Dt26$B!q$&@)htP0-zqXV*dCcNSz}1M`G%mtqFNuZ%misDTMb^KhE&UmQWqY
zo1&+O;u$1|$LhZFV*-q-RJXp6j`DQ)Tl34PnvOn<vN})5C%|lEx5?u(i)wPIc8b+L
zEaB;~-tSzUx+3E;LLuIO>d24Ak9Wsywq!w%k1WFer9{a6SF&RCcoULRNez{tb^nNw
zDFsEeNMQVZ@gAY<sCWa}J-T>H?}l@=8Y+LG{@?>EMu`Oz1;xWc<qd`G{!M0}6hI{E
z?Vm&_As{@>zX?5hn5{OA^<CfBjQbbUhfjdrNOM!n$Xg#fzGjf^0{B@T_|=%j+DVis
z-^;sCe(yWQSzk4GNWjsM#S@%6W{>ZH?ojk}{+s#Nm}A!uj}`yQVwU_b-;Dc#-~Y@x
zxPxN1@4uyE@g|u!o0)7FAjKNu&YF;E@sSqkV?mhA8*3Z2HT!QgR`tTzTQ8$9z-(H)
zA@6CS818$=72*!ah=j8Qn%$f2`_A>i6GQ#MN7MQ}2F?ebtRxKMdWZJ%rcnk2f5RG_
zucWvGxx@3|1K>`SI7=>bQLfo#>DU1&W~T0a*MIqmN0H<YR{xr$J5hJd208NoP1g9w
zw~Ft-{Ug1@6B2;&_h*tU%*gMx{f*^;D<CZLt<mFE3qo?}#j*q6eGnmea5F_~-v>^z
z>JHrm`Uj2xv&g%Kk7q4X$a?BAV3(UkngbtCSfqeEop<l{>5IMS$U3KK?HeceyB8Pd
z;S1{u|C0_TUyPsLzUN#a&j0d&F~NAC$mpw`j<NazcoX@;;Bl|TMN((D%bgQ$3)JUc
z|6+`E{E6Qy7ZK$@gA7~9gK-B^1`_YoV23e{KLH78Vf7NDtb6$iu;ZB|Yn!&$m7g16
z4G{lP(;rEesKv0qa(uMJV^sQ}k5PRN{%d*s_P4P=qfL@L)-drq@Lw$nj*r0bsD%Jr
zQ54_F{@4K-$wku7ue4h6#9LoG^yGx%T!nQBUJ^0~(4iHoc5hk_nX8$J&io~8OtAcj
zXA{0>VV^NpGk+At+f^`Aqu(`mwZQTuu1@%niM`AC{iW5JIz7mTZd~wR3_|9QZ}55*
zo~vRx62D3Ko{Bxp$ouKs+<1uT`^&omc-0CYR4@{=e@ULdybHh!Q;>jBi1uRlG9KH7
zZRz4=DEv~!vLW6w03ccZTCA6i%Jo0fRK^ydV{rX2L=nkA`~rVRh$Jil*EPi_@lHBs
zjCX%Ly;l%_D<YwcWkH-0|2+}AkdcS!E;HU6h3^Vj3dHj9cjB<a7$q3*(r+;jxc?;s
z8Gpp8ZG94y?c$H?Bymq8zKHuCi;dwDfEx<4r|)y!rN<*w_#lrZ9WNJY{NwQ-FB0+C
z@r;u3BgaqU8NV`qWW-}sc>c#fW&0J)0omWdREgike@MX2VEo1ScYK!#jppw&6<6!`
z%Rzf>p5q+d&Ybot;%a1fbFpt3bC^F0;eA*5u8d_(%#-jT75fJx;meOac%K!XD`S}x
z<0eR?U|8Ro?sDP1Q~02SWkmcd{(BO3CF3X~<}2lM1v7apDPoHF?_aS)7=JN*q`_O4
ze=di`N1PLPCmP$9QG($v6<)jiFBvRuV(+*Q5!l*{IrMi)@rvaoWUw$-j{g^yBBMI}
zM`FB0`5bAi=frp7?u21WFy5iRONjSD-b@OMnt1l>hcDRljD#=lKER`q|0RKiL;U9J
z_m9~4jPIU*y!U@&J%4`pE*`GDgoI>Yw)!UXBnodTK++>yeTkVj-MH}gfE-PsUzBK+
zKw#V+W`POt&3pgbN^(-Imr<Cjy+YTIFZ`yg389+S!v)H;N?rY5!l_sjN+z=1Py*zI
zN=3?73aQOWyhR*0_~Zz`0`Zj}jv0vt0<7%9nh5>^Sgk^;STgT9hm|I9@O}P?jZq2|
z92ohiPG8g7zM%X>G4%$_i^F{5&ZQinn0l4KD+sWfR~$^tO*8<pBDFPN))&Axj-|Mi
zdlXZH69O}J1`GUcig?@#)%B72YC)~)Z%iw#Dt8{q+zJ<|O8~VJnDZL;jVh^!S6X!)
zGbU=A6e^ET7Cnq!%NmV1v~cccn69?kIqlFD^#|^VuN_%KL24QJy&xum#uINN;#jGp
zW=9{R0bl=ymL*HUE(Mxd#$gxY(ARx#q|C2nz^c$13!k_rY{MG^^EGp;v$-`b7AQ*;
zQQxr}ib$y7QS#b(2=tLK(AstPaMr)ZzZ8b3{<5&lgtlL6e4W~6f#MrcBwqg^tAKiP
z3FOG`?nWMM0nS;#E|6Hm!6q`<edAd(tNxHu%TS{kqZg?g3hIWKCjcFoYB#^ctE4k&
zG1~7uWJo4eq;4Gm0^`fRO;~Gi7r0>_D<5m&t8MwZ%yIm5rk<y^^Q-^9!K#`0y5-6+
zaV0yWkyjjcI&pu~Ai9CS;31-bxK>zE|A5h)HaUn(%ZRxbseyOI6#s-=DeU0+4AfAN
zD-DFbT`BbHVZ2dnLR3roqIg!XFV>bGdxl<f^}B_(M<foO5e}QAFNaC!A})cqu(jTu
z5t03N@R-|n__}=ly9MD#O&wHiO&z{NPTWryj%P~GvOnJ(P5b4EikQBiR!9`6e^~sc
zvGDm@?(&Yz_JF?Q1iT~Bnfi>@Y8~epTjpU>x#{g|py{motUk;3;*!y9UR}W=+tz9u
zTT0&XQwy|q#NbpJX_8s7q??Ah`_59rYE8i@Rro3y>odcL42BPHH<wutj>&vnSlMe5
zlQ=bXEe0c8l9B*;vzbh0Uh%b>3AJvi*W#Vlk%>vd^4DBR-(wUFS|YFA!xKNSGcp=7
z{UTS2H(|Wn)nRnN!sSFX1jSR+THQKGbf~$eVde2krt#xqJs<_f9X+bSX6lR-@q0E>
zIcmVuDodW%kSbXZ(83*dq1+5>*wn&JYmuxMFboqr-@S|9eg~&9O;eiat5Li>Y3~`8
zLOYThY{UjOm4A~?p8Ba7IPkWDBSvo+uz`?COef!Q(`qh#*U4Dgg|K+K=kVg|PT!a6
zcdqO!GF$@zGD>lu-_?EITXk<cTb10TqivRUAoGwA$ei)WKiyrm*jajG(;*M0n{pRE
zpC57`AxU^DD#vSzZps}U%zSS=qwC|o9NI8_a~~3*#!TeZG;uz7-E@@U{F_^3a}~LF
zXvDZ;(p7i`-&=U$(ATaXSddtCrC`z-@hyO#^1bk$KXccJ6Qv<gwv44S#BoMvx*w;k
zgRG%!*sg%|Hfy2MZo0~FVrW-4yfCl$_ro6(R>CZw*D6Hb$QAV>EKnZUJ3l;A<5s7!
zS}(komsGaAMK!$dH4Gvo-!8}U7dpn2vuF4PvafhVm&5mQ$k|pu&8#-Id#2wnr|!E^
zITlOa2sqow&TB9D*#4{{!Zz4)MQEV?)NP4=DlUhmH&!@|E;)iOIgE}xg3gYep)WSF
zFBZC<{Rkt8po_cEAQiW86^+}G(O_q9KqjnS*S`^G8a90~3|F9Oi+p2Bvbl3SlG%r%
zEK{T++2ke<mD>>F8diHMi%(ifw&@jt6z)a&MIgOM`uAT9yO3{I#Rcti4V$tLyO3;F
zJ>5)SJv83%<sJZs)JIpcf#F>D55+W%mf!AoBxH2fSJ%CR{}>Xga~9hasr6PVvebBz
zEQW06w^%cNTCFs*Xj-=Ya0lV;?6-Mm!z-V|WeMy)^D{}pWeoG9v(EJNQ|LkWx$$Pb
zBRLHI#l2V1*t^e>pKR&d&eLD~h0>kLZ#rU$QNPiq(TWNuy3uD2_CUx@8W{X)BAAB9
zNsHaGg=|}nae-tYIW}IJj$tL(AF54Xo3DTS#z4=5UquFUq9TQ6OECRxQa?@S4)oWY
zF9{z=R9jgqf;N#sO*yzpp{A18yvbFGdJ!8{ZYZkNnHK+GSfuZHU8}vh75rMU#`ktM
z?nl`6naLTQp-F3thxMorjamLs-JI8vm?7;TFD$1`23f~kNi)wmTr7SfzQ8lSLXP&j
zAyMO^n~(hQGlVp+*6*zMnsw=rcF@8hxiqtmhN&-?F%q+d&@Ee(h}TYVCG?!SYL|M=
zn9`=|{p>Dk^Y{g=!~Nfis=cq?wn69S{ZGCc@H<{d^+@$;+N@>{Lv)6}09V2q3K(!=
ze=cWwEee&(?NpBnrGS<O=8`~&Yf5)j87RMpg{OIqyTEX_6jF}7K6`TjPrjA5dXQR^
zqQxxdQz6o0;r(fy$IM3CoBXYl5|D6m44rAKf#Lg(fQr|~SV8;U3`K9w4}X^9Z?621
zU-?KgDJtxhpqkr~ZaJAZ?nj*2Sbh4D!2dbEqfypoa|$g@oel-1yU*slqlSoSTX}ZI
z%GE&wmtPy1o^A!bFRiFo+2@@_%sQsm16xHx3e#@irtNC22IDH)JfED<%nZ9^u1_k0
zIIrA{v=8v!EMIdX-HQx2g%)gTYiReeyvU!#uzVaUXcF`}?A;w)toiZNBY3aPVtm+%
zebsM0hr_sXyfdjzdcnXK7|Rp~U6NW5`r=#ImDx$)8SZdu+FhuhaZAc!ap2iXNT6+d
z&E{$+gYdkmXng94e&|f_c=y9PH4XG`3&)p$l^M$MTk}NiIbJWv!2OrTQU|~c;lMPK
zYhug-ayeP6hlZ14ZKdwhdYc-fSH(IWH*9^%<14Oc_AMTsveI}8X2F<tKM`H#L2|b{
zYvc4d$)^h3Hm4J+XkC2F%PDEZXtKn4yV_xbYjY$K!c=~Nnc<9gTcwBRf&BKHPR0#n
zu2V5f^`d88TCgKFdpe4jt^?9N!z;`3z|@H=o)pu`C`0hQAFl{vZmW8u!hGu75$~pz
z??}4O`@4J;a&ah|G=3ALbftYEb|31p*Btn6<=q+jE~yiAYm(+8r~3YrxAG=5e0Q(W
zdWi)O6of<X%x}K;5^)s8EN!t$Wv4P;h~ZP+1mim#tgpY3<8zVY_ilD?Wa+Q4Asuvw
z)-`#mMmskM<u(3($DPk5w}L1|Xw}&umhh;z3(v-U^lpfus0{Z<m8-PRvQ6W1PDM0&
zRc-}a+uvV)6J$C#YY8$|*cSG9uL-Sz*R>jpGuw0^R-MH?1eIj`C2gd3*5#6A3*5_>
zc=_45>`aX}Nj%Gqsy%ohGap}PutzN(I#hh#;5@Fw>GNWzMS3=jsPBu+js{4;=KDw6
zh(SvGC92=|Yfb}7gBQH`5a7!##<^Fc?tNQ_{@E-#s)H-p{RlNqk$7T`{?4njxicIB
zPt{_*=~PUoF}6%^TH^%MQA?gl%GADRj^Mit#%Z&Gnc8M61s&$B6{AcGe3k~gd4h`l
zo3`IQV}w^wwr)0gB~1I=X^(lB$+&TS?*HVsu5r+}k?_6gg)vc&4&)~E)+OEa9=u}+
zVYaPm_S!mTWLg70h4le>aqOH5%a&jEIle$I{A?=yuzNJSq{!#j=#hL!v`F2{A$l=x
zf^6tY&y6^&bSG@9vaRJ+K^tZxUFBBl%iWS;<EN+3Mix(BdXc%m9uy7b@{)ST==IfY
zbD;2*fzKLcTbpK0A;e32cYvuWD?T`F#K3}Oz~%Iq99-G_F`-rXp8Vzxx#98;Vc`c7
zTn8wqGOUZY$OZD`!B&-_fxViSMoi96{V;G$!f|EJZ;rrKw5x&3lqTuUoh|29FZ{3j
z;OyPF(Iwt^;j<Qp7k=LEO=+U-<L(s5D)RM;+_K%dLE3{3*xR-x+jabV`y$O-L3Y~T
z`NV5+NWIeU-o(=F|IWzwE1&;j!d<!CqLMs55y@<`={#RkyfET#XPdP2T}ObfzKX}K
zMk)Y3{!wN)GfTYvW)`!oJFu~70?T`}gS*Rh{fr@>!9iA5pxvKw`FNBQNA98FGXY-S
zT5D)In84sT1599e+zyV_Ki1%+t6RU%DZUu*GJfo;B$m4&qhvCEte_P58Jx_CN(Ae1
zpz6UR`o}}S&c1k;sbdCClm;-co=IF5+GRcvJ9WIqfjR;Peqs{WfU4E5GdrMI!PnZH
z;zRM-l^Ztt$FCZ$Ig|n$!P%gJk*Q-O2MPrY{K(X$4&|<0CwD+Gfv?knfh9~`%24j6
zbv;{D68M^pvui%yG=F0Tc)U}8?W+_R42IhdVB$;XL~#NG%b2=Upe{}8Ubd)A@HH1_
z*Frozf8!i@d{uuPsC4@QEN(kMH-7A5a2(ojO{8>N3>LQ@pqn{n=0GI?Zxfk<fY9uk
z^$~lNJJ>%REbcO3I(kgbiBbaI)-najKusIgtL#ua;Oi%x=td@V3^-^eK1dDP<uVYI
zv*7|frn5&Gg0JO(w;-ik5>9jp6FL=)UW`XeLg9_;2ev3~PE=L>wXxEz11CC~30(n3
z565>EZ5$XL6VzXygRcpIw{l9i%$(@a_@HkabcV-j_19WTw>F&UNG5a{7(EmpRJf6C
zc--ZH66ZjPH(Wnby5;6XkH@3^7`dX~Z^S!$Bu(od3j)Pv;zuTqQQ&r6=njWZ2l%!A
zu`DM!r%wX-wc#-tXEH}i`9=g2JEtFb*Fms)T^$<7)DKkUXer&8jOQLb-s3<?a++EW
zG|e3Mf&FnfO)UnJ?NPi+o%!G<;PD3VS;IPj6Fv}sP`=Toe@qH|*0hetIm6+j3Dp9N
zRBW^|jo7xB52$d$r{b$7kC!-5`@qgnCb$;#yms9Q*f|*A<bbkQTF%|b1p7yWs~Xmg
zft^iEa5?CV!SN|@*=fM9-anWLt_Stw^vMRF8y?@~#LV*f#PJO$>Mk%ahe=!>O3=6-
zYCE?Yu$2R*vmQu8Gex4AhS2eS=y*iXz-o{Jvdi+Q>l@0n_QG`hn%m%-+wL}*<2IQO
ztwe@a`bYi$^T<HS(9krrRV3PK2wmHUu0;gRtp*t&yBv?Y%2B3`7pBwK+=kcO4!6mi
zx5@nI|0C2l0vPVA4o;ol$A?ZKaNA5He1ZTY8!VOpI_<#f6arRpZCLO|Xt<!E7$d?6
zRh@!af-)a9C<pDIzjaI-KbBMtY-W00@1MYATC%YQ_V?n<u3q=E_o-=Tyv^VcmxNh?
zve>G^eCAVZVCdJ>Nbqrmh1j^;fe@!S8?*R){JAX(0QNWKM29dPOdNwaQ6Io`Hb2h2
z*A7UcP|_ro%#_Fh1iFX<S@P0ft!~jT1)S|X5L$ozSV^pW!v=Uv#3>GqkF`V1fv?|j
ziuZp$Xo0{tDUqm`M%+AzM?+|CUPPqIg^5K=)3*&cY=FCA-HNjd7Oz)-?WQD_zoDmp
zj5&oD;K9qHx~c>a4$93Y4zQV2w5bd1b;@DKnA?E@Fi=Z1u#QPw2kKI@UgUtP0ADL}
zc44k36&p?IhaEi^SE`^+=;xg!h<_{!-2w5>#)DsRo|}BzAXr}~03N&8qolysyqst-
zQ<o%^u5n$@4#n`&pN{`F5SBvsdgbynK-}&Yod^(j`f;ARcy&3Kaow_b<!88mbK{R`
zl9-l<2TzXbG8I7RDK~f8!>UrzUCuBU`3npDQ8J`gG|CTh9RRxh2<WndiSr?vqEK>>
zYY^x*9Dtro39^QXzebo+AQvFlF#z;<N{|)ofC^a^jd~5aHU!;f0=jHq2h>O$$h9Bn
zHW+{&OF>)0=%|nwA2om=3s^Q4GCLZ@4Y}3>-KGOD?y{+o@Mshr<XR1M`y&Ny1v8~W
zb{W3hRE#v>K~RCRKrr`cpDe)0YXlHf`3m6+a^^wEg2<v<22#?aTl!L%K;UQtKp}6T
zjWRstBR~oy3yF$OrKq!qO{S1jAUz@NqbcN+$TLX$Y>F2Tf(g<-nUYM2jDalL!=TZE
z_Amfwc_7700AU>E^99f!Eocr)129JmTEXl<)6s$;SO_2;(q0Cr;zKM&`FMerds5E%
z5FJr1Ln(Tc?ri|fMB{_@`4Ie&_UV+iC?6Nla(~JUCDIqPFMxOkS~i1SQMp$E&MDoy
z00b0BS<v!G%K2-=y(p9fNbF|{fdE1(3Z)Ku#)s&M5_Et`K{8$;%t6D{$S^=G6*2`t
z9))@bTDF9(K}5`9G9WHW<Tn7F`JYb$FCqe<MvaUDxCkIPA?;Hsv3!X9D3mQo43g4i
z4(q2vx<dTh0oi6SW-6ot#J?7hZ2>EyLfS$6TLIbTFdHhQ0mQ!%kPU)uQXzdH{+$3*
zGZ;A)QU>B*12DCK!TAtM(I{R}=VD3~4}v`!#Rlq}PpJYR9HLP|pw8tK7ajz4H0mX&
zb1uaNfG~_k34l76QVw_!!qF%$Q0GF*0RZ6_jS>TO!c*vY5IE7O7ob}(K->`)OM%RX
zT&DoUondMe$OOpspNfTzP$26d*BJnpSBTAM)O}FkSc)kxA~_mG3JRP`F@1%YiAFsE
zQSH0)Hl&20Nqf){D?xpST^1Lnfa@xXTfN6<_W%9tq?In-YrPQk;GrqyEqhOp)kW1~
z^gqo169GZTc3gc($dgC+qqR4~g>%a$hT|u=G>Cd-cwWd0Y-YHtGFwQ>$SAYO(oD)=
zlRSSrd<T(1;+rK%6Sng79@b@5>Fph8El1h;%}vnxRp+`hVs5`AX3F@WsLT&Sf6e^^
z{r{7L*GktTwDHBkk0A2fwnO+AG}rY%tbdUBkJZHHVRlatK3eelpUyuZ{4Z3(`L8Y<
zwCKe_cM!p?-yu90{p|W5);~!6=W1f5ivS&PanKV)cYAdR4@HYzpZ~-92Z{ewO%VJF
zx`V!VLH8Yf=N9Ks`~&*#^*^kCkoeEl#7Yn@TIz!C2b%CU^icdW`o%TDKdgU{_)pbD
z?5`kfG{Xg5HyZa=?oj*_n&|o;);~!6$7-VLGdgK7sNzYDVudF8K?sGRjPiBt&q=x$
zP9Yb;I%%s*@eBsCj}4LpBBsB-Z4H}C8zzYBoDtz|g)z7z((K}oaW+!rC=q2_G|FBC
zsf=qi{F!~&x<gWy2Rd4>VlxC23GXTJe@&CJ1ANuEHz%n5;(?p}bMerJ7CFTa76p6z
zJ`_E;7JM4^QT>UudvR^y4h`EtQ)z?4RJ7*m$k+1LaP9K8Ea23Vgz=8^xB1p|TlJ-(
zdWR*>_k@wZ-{~s!SI4KYX{7e1C0Dyg8BFG_blSZL(M+;SESFa37_Bw$23xRbrOI^g
z^$mZ`#ykf)QLqy{xqa8(SnE|J(CbNb%jC;jkXXZ%-5%M~^<@w(%YYEEO=dA^8CkZr
zHi8FQnWwv6i?rBIo10W^pC2j0KeZv!Qz0L$sZ6YbMJn(M+R-yub9%;Rjx|kQZQb-e
zMrg^&TDwTWz9s0#*+=`PFT$Q=DC@W-QpVOcCl!&uOt3l;DAWX}JA^d5Ht8=<yA616
z^dUU5l#J~WntFgojWdqh)-*z)tpgwDCU0bUtsy~Y&Ed)*B@KTP1Al=e#CRcf+K*kQ
z3gf=5<2(E8%l=2e7q`ygdhnOG`-Uz?@CR$u;JMigM52TJ+^NasUXYo=9{QKiwOVId
zT^H3pJUVG%R;bC*x&<+OfSwF=*iE_2ht7=xPUK?i5W97VX)E{Xg0Z!BlLd2k;Z3-#
z0?{X-#s*vs5p9Eh0n%KyXZ9NX^Wmd~uu^GTJ?ku7T4=fC=SnL?ShY_ofT%Hw`L~{&
zcv!VcDmbEADpic!e1tdP`HyfbU%Ag(gD0i9Hc4B8M8h#f)W&iIuEJ{M%d)JL+@<+#
zRy46I>^r}$DP6uFMtkt7LWH4wvJf9DDyFq--c0(nAH1{-Yjsva(valA`q-$dBs+3S
zIK+RsB!AD+pP=VpMnjEKoKwq&vWrE_kP@?NcR>_%P&@Hx)6FQb&r*@1qoQO|(Xm%G
zfi>}JHsZXdCv%aq^etI-llFmmFx&V3Mf>uOeafbpbpHH~eVen!9rG8-9MvpShQLqE
zZXJ{3yCsQ4*`N;#Ze#T-9aiMMwSIlj{iP_YbMn5|v61I<wnyco6}8&@*^NB5Y&ug^
z{PByO{B9~6riQ9aMFNyB$zk8hFW`dH=h{k}<Bv&gfJ>J3t%egi?F+toedpyaQ=571
zPLWRtH*}tESS9{B{`tFJ7O<>$63!iTh_{;#@gzLxkOy@Pn58H5U8;kfWPBR=b!wc7
zX&1o0)qBMR)Di)665AsW#v~f=J+YRuH5K@TZ_coV+sJ@<NkE?a+%R9vp2AFZ$8Xuj
z*GmIuxv7rgX+vkP@hx#E`)h-Te0B+uM4l-qM&U*OBwF*%o)|tjs6P#DnE;E`pSw<6
zat?&<^8{IVAlw9o6zlvd=-Wn)=WcX`1$wrJt$_h^!MZ^LaH=1-&U?MjYR^CfhM~1`
z<qWe}JGPCZLgAv;nS)u?T;?PCdbKtcc)NlQynf5A=^bW6pelpd+L?;}IqGTlU6mct
zGw>;;-@+w0z%gLt)|?Y`VAxd~H2>ggws9`hGc7>VfY8suYx_|6lnGkN!HZJc?Xt{O
zDZNp=5o?T>1P`3dw&&$p+<#K~+xb?JX=r_QO=mI{z^UPwV2>1TvFz0%adOaWZJSS8
zEIzTUWXA6W#xbJG5*W`CepXrT)lW3>T~&xqUg>R=_LZ0>?PwNGl)8yR-%IK^U-8oF
zBvJcQGnKkY?bvpeE*|pkX(Sb4o>15LtTf1{{}~FcufQc4oYecAK3JcM>y=behI<Y!
z3C4AYPHKME8+;me=$m>>-)>O&4cAl+%xt2NDJH!zCH&FIRrVxuB<yxbxv?=K(xqc;
z)y@ZNsK|-W^-{XWp|xDhr}ft&KvF70I7Xg7+uE*%AUl^%=Q^B8J8{i0%p-BlDsfH5
z(oVO;;?cBXwB9Dx9(RIZqjbh2c)0rtT)Vro=x7(GHU384!%=W)D6rsa?xC;#<i#sT
z(vIA%lPv2|oHPYfJF=T^a~!!F20*2nD6sW?PKHXq<MJ=M-ShVMJ!q0xPN`3y;&eZp
zk8D|O)>pmn!?#<%JVscqkeVD(FZN>i7g5VP*n!}I4k_f>Y6Y-8V)bB1`l&llBY6#}
zg`u<tgo4e2yw{nci`7Cc3jVO?USHO%Oz&HYXHg@e&+%nMl%?Z{$5-g5f3kBWia$A`
zA!>{CCK-fB9W|K+Fq>a+`3KU4Y|@K;z9<ee47+$5k}c(LB3(0lLLXu(>radHBk#!$
zYfcC=wYYGIJBzRyKc~2T3u*ZDGqY@fb`h}Lw3~g@X$9}S((P*uvw+uH9d+u|P(xfI
zW=YnXejGmU?WPdNc4f(%E!y4i&aQpE8c;fz9l~<PYWVa(OXt=)s_XuaAYPBx3i68Q
znlNuRc{jn^v~*>Yu&>h+9dTYj6-asH0oycw9BJ2=nsZh_MRujhl8gEOCyJ7{U7A^i
z;jkCUgqyo11x5s8+DUHdlNy@-Jb}D|ArxKQ!zjZ({+0`9iqw+Tt5G{KCungOSJg3W
z;r_J!q-PWt-|Qs3%O~u?uFkC3W{TUj2vsrFXCOc0B<(j1Tdow$W?(fRUU43IMsP02
zc=ax52nzbktH#W7GxzW2PP;I>#;6qJs#K_S@w3<X9z7rv&)fL~^oZ7vAa@S`!VUCO
zuc%|dU-%wFvAiCm?=rUI++yqkb*ecGSO*_)HN9tU$?aM9#Md<JjGjO4w1@hYkZxBt
zwztOhRhfWetezay=4cwBYr_ejvzm1DI;b5{F_|<)%z#!;Q!n%_sg&y<IW~J|(x=_h
zt`-Kp%U2O!@GNBEW#r<mKceTfiZgeOTZz6`t4T&lL{2&99p_~gN4rKZ%x_{@$x-WW
zWSI<!RQ@XC86CMh?HxyA6}PlT@5g6i+00S9nRXl6LB&0#0iGAm8WW@b@~Yrc=gew+
z$ece@uWgRfStyrb(XotkMtF->TIr2$b{_l%P-4gyR3AT-brwC9Zr|W?T4yyWw<BJ5
z5$W0*1)+p6vjy6x@uq?26#DGliz9kqYdRv`?Z7?<*c{t10IuO0*P_@5FW2P-R#as1
zmTpA&Yjf&JHyBZFxXEZklQg*gO;{!VC1hLvNd8UyQS&ogC~FSpmzG_Jz$fNbM~Jt8
zq{8YB1xxu2QwY1gdbx(P`2?Wc9&JU!S?9FOmF`X{=S=HP+O(8fc*=~x)PjBb7H$2q
zFLy=NvfNJ9jJ@H`P5s_UMg88XQv>bE-Fd=*uL6>E<(Nytgy)!?ecP6>gWq<Wo!^e1
zJ@eL;ZPD*5ht1zOcAHzF_Mj7n`pA>~hMG&;J>r0J&(y#q0o5)Q>MD4yammQ|%ir$x
z;g^zozBiP64{n(DUfwY5S>L!<l%w-h1o-wm848xnwe7T`bmz76+dN}yN<6!2QUxYv
zjnbVQbBFjFClS;)4WUs^_4gs3^B{=Co&u=)tRA53H%w8|VYXWyV82@!;JjNBV6&Sa
z;IdnFV@vbx#*wC!^Y!p(AV1fbE>*H!7v&?5A#d54X!7?x`rpzaMZSajc}3AKCs8$$
zBWd9MG|J3$pQTrZzdH>o^ioAn$Pm`PO77GhNrK7;X8U<weCMOWsiE6b2s~de<ok|L
zA8=>5pe}r}UG@O9T<l`5I_@yE<!kC5(;1Db?yP80hY$NJ(3x?Kho;bNOAT?Km?H=-
z-yvTIkV7ZE8i+5Q!9@qo4b$f}zT2Vt9j7<tL#H<toTvB7_xcX;FW*kTyHQWd&r}J}
ztGze(P~bfiio=TXi%z2TCy}H&?xJ$*u%N<gy^GBGgvxQ>v1y%S)4tF$=1XHng0feE
zjmw|Em^d9)1*Ds@!oBe+Du?e@6s@siA;rcX?lu)-UOE&UkaS8cGo_PS)L@)M>b;SE
zA#Cbm)Y*LzVkIEZDY!vZ+5cd$q;k-j3#xyMGqW;M?&Urxz;E0W0H5q!nmv9k5GyX!
zg)X_7o)kdOZ8-j>xMb)za6dP2->DVc8UHP)D=y<WTJ@3(HIl-?onBP?470r>D=#D`
zrh#>UOZmvliWaF@dr#|nDKCaesrG7|Wn(^Rt4XsGlp4so(F)$W(sV}ha&iu2DQVQ2
z(gtV`I_VUiE7qPL55@1c`?oM&ab<IE;ImJxG0lBMy;C?d9p)U^hf*@l`LPy?7R78U
zmL6ypR*+AP^~P_vBueQ`k1;V#xv+*hm*>|hmd+d}#&6e)G=96}AYd=yg5D^V_PfQ#
zZ&xqYe7j`FN!Io%$hgiF+BVe8Omh2uBeV_FG)|&bEG??FQt;4zz%-?n%3b2DXy7K(
z-c{_DxfIdC0%seGtnmppiMqGCyZs$Pt>cH#t}VRv)eENC$$7G&Uv~8}Y(AYt#$mZz
zL`l{?QSj{(=+W^*?HF>6=w#PCL7Bcb*w!|(*=3c=o*CFhGBB-{S02c#vt6W)bMtun
zTXsoTN$j}z<jAx*IcnVNQt(pkvgMNd^8V$+fT+2*U8B3-Of5X8`%^nkp+lUfN7g|%
z_U3z92+vD*MAoGe;_f9B@#2yl5q?>QV7cK$(%jG@{cq?HZ*BtIKi#$nYM@8kP0&Bv
zWze%3^dSf1;`|3wUFy1?`I@0gmmQ8w4OT$5q|*KL0n1C9(jcZnQa;4P1wN;HtukdE
zN+!zS3p&B7`6r9?wb}aY$pPXfYJ5lMB&QJ3F*E-jUTSK1hTCcK&F>KCmIvl$LM6#=
zzjZoj2z}2g{m%`BDJpGAx+S^-c{9W@vxvG;+iNOpM2&FSNcE4>2@a>VjiebS4;duO
zj?^@$l#3Xiwm6LFq?VM-EWW(WGIUv7{I469vaa3Kp%hbh@M*Rx{Lo{Bj%6X^X6hY!
zaAxx5pp#>!i_71emLU5s{)V9-PeE#-klUZG(~AMqi>;3Pt>x#bu)s4g?WeW@{O`1T
z;)^4x<?s=^$(>C;GUb9mx3hrtUBAIOue$VoWo3ci%8ae#sVV-Q^2-U7&rRgQW~}I6
z344R|+WQBVYoyY4kE!V+Y38-z7K{C!`bO)A)@L=eHM!R#k5%H(8+%7*OJ{sZ14h3@
z<QvW?u0W*Xu8m*EN<7YVT*WtyNJreA^^WjuVxsIZ@04rHP?Z(T46_%a+<4DBxMi6*
zF>sNCjEWc$<{k_aIlh;Ax($yjL>p%3a@U>n&o5k2)9wXFQC$({M+P*HEs2fK_KHDf
zVPeC-ow99DYWgV*XV;=T&!j<0ex+mZENe$6aofk$biArfbb#S{a;p5@{^+qYEr`$A
zE6DvbBt+&c5~6=ax~6$Wvc`Lbv*vasxAw4~ztWX08c&sa4OrCXnkgUW;@Jprc5Qt9
zQc#$>N$85wV>lP`bW?s!b(0TN>Yn9V^=i6#gwkg5V9^ZrZl4G7=A6nsQxJl+`4-gq
z3VzXsEI#^*jG_o!_U`rR(=T=#7kgScX;V#lxm4R$P{T#V-#MBWkS;*I?^j}!nQ5=3
zkUYoQW}5t(J2omdHeX=&w08f=!pDTIbzilY6pLTI9M8$joBf4)eokQS0om44c%7Kn
zn5?$h*EX!SS=X>p??ZC;#~YJeD=|9i=XR02ovhizgh%c^UnX4Gj4SquO-uKQV>P_O
z<;vQ6Z6@24{G(cx{PmN7m$yeltD>vveZr8}kvRRYBb%aK$j&j%g$&NIPlaiOa1Lim
zI0rsP=Q!(Va|ixvxpTPz?7zPH+nf7Y-I3vUa^9ER?Y-!r^!Y=`VGVUFfF|4j81hco
zv!i(UY}b}@4zLU4=jewfX#PD%9Qk?{MNG^tZ6hzf2`UN5L+ZX!a%=qXPUVHLKc%eF
z^jlNewr!V5r*hGvTcf2i<H%cx_9_|n&Mu@vTZ%>#=yR`u8iS7nsqOr`JprATI8<nh
zeu~IBmNjZm%nob9@QW;ChjPmqYVjKCsO&k$HFD1)iY)8v!TnddCHGqIZRkem+(Zvs
z*HXvZIq8LY7L68Kv@|!*f8SdhPwP475mA2kb^EFE&n3R(7%jc-a?ySFL3_NluGBNr
zi=S_+9)yk@QTzQeBg?Fg3w>OuiKDUI+dQc-<hZBid}(jGjA!`cLFB`W2rElVgK4e4
zp;-xjlfcec@8s;rVzFe6K&~~j#-fO;>KpAAUz{Af1Z$y0ev&-?0nKQGw;eDVQ8R>H
zjKMb>m24BhJ>Q<kTMV!As$jY&9dl`cybC-_j?h|bKk(}^1GDMs__<V_bmLiT#LM!o
z7FKH8Gppbs6UVT*^k}}<HhvK+0Wi+lj|lMg9Y?9uq{;A#yk|$jkG=>%OQIWB8td#&
zyOV`PI%}KGU`HV%T(<764bKZF8>0`(9D-M`w&$xa#9AA*{OODrL_32j2hfWb5=XxD
zow1d)G;q3^n5ctThyMQao(8S8t6%d5M>j5eBAO#li#Lbph>un;Zks%P{LzLx<nZ(9
z%J2ifvK23x_7|Na6-!ib_;g|ac~e8HM>eTCGjVLw7ewEJBtic|-u{;er`)17r(E(?
zr`(xUryMU#3xX_2WMf+7np2JorqQi=B<tyIFN;RbWLo#_a2+%Zdg%2Wl-g{q`JME6
zFBw2FjYX>g#jBIfsnu|0RVrY-jGL9`{3Lm*Vuc#h@V2K9y*(Vf9l4m6M@9<zu8NIh
z+q1#Yh;tG*((Mpm)g|?jGV1O79#S2}&c$s(Z^mE(Nw%dTp7BOk)a&!AU)lY>7|ke6
z&BtmuhyyEbDDC&uG#!GXfLA?}^K?1Wf!qyeZN&|AmD7P=fmcqG^XEDaaHWa>FV{nX
z)FEqX>$=NrxyKuT7qMfJ@}jZ1+qcw58YWrD)rL^-a8TlajR09ha<QLE1~<^dAK#X_
zxBr`fTsv8Ka(k`wi}?zzRnMJC*#%CgT*o_Vk&zk8-f;@GKPg?~UQu(qfjN$wntvKZ
zlg~+!QIe7iwjI%@576hY(QopZFmgv`ENCweb;ijIW9;DGapab9k5=hHRNQXK9B$@D
z>v@n!BgRN08gj}7@3>&AIHgtkWC0UPc7yfW=AX@w$VAIH=o<YR^`=b=hntMi`XD5-
zoioyil)R<&h@Rjl{Y<aSOFolzHiPx~=ARxaM&>F}kw)-d(&;Czan$L}KU!J2+}vLc
zbrfu|muCSL%BC(^G>)gIwaZBBo3#B6#Z6>yuy5>1tHx}~-pB>X^~qdTu~qVvTJixY
z49l9MUBe<msmROTOs5pCzF(6eHRbKpITEgWo^QbCS2DY>sMXg2(_qVTS}wJi^H=Wc
z9~#lVUaYmMrzw-|8`c%4oVq;VSl+mVvdoxDH{9|Lo+fKlc15|}SS9Xo=K+H#|0R-b
z`EMc_?H%rXqyMKU%>J*{+Vr$MsaK<C5@6W4{-7WjAu&Gm_M}wsv$1oGnO=%;ZP}3V
zEVlb=fw9GeCA0k@XMuB20_@(bCDP2Z&4(r3;#v1TZ>)t^dVlQ|Y;8^%$tbWO@@43i
znoZE_5zE+={8>qNKEEF#v7$~U-?LtETX3g==GYNdyB<ilGq4Ynp{2>tt+@$QjEA{4
zc8Ge;1~Ig&gw$>9&46_Z9GJmVwPpzr#=Fe!LWa)EP~EiiI`~j3usfq52{s4xbB~!`
z$S67mY&rzP<mz7_K=V9EJg0A{`o;uQd1D#sQ)3${zA+h9+8B#!ZR|pUJ#$boo?)mg
z&t_DoXCf-svm909`3aTkS&RDOnbx8&JaMf^Z55c0*|fAM)8#hD*!H$Knm=fa>s8Pc
zB)zP@3<ht&0~e~)Ki-ptPCM5S1LqVSnhXt`B9dnIYa`~Dz(q?o_ve+%G}E1Q?2zTU
z^Y99Rc?MlSr`#zGzaOR3%Z>K++!b8&7G>#TFw7T{zU`6&bEiT&`_pl?>dWmSL&I$w
zgPW5Y-JlyPhYx}I4IN?wRK;pd54POPS1x;|aRYMsHG>A`HB2q{DuZnIa)a#mN`h?m
z3aYB{dH8lDdTQ}`Bc{7$AMMEJcX%XfIMF(tG{yiLYgBnXt5pR;42mfH42q~ifi{%=
z`uR~L<#o|@6=M*6hbY%C9=Wd39&s9tTmprL$<(hZjvzEU57%6G6xWz`gw|9X@@jsz
zE?+FRc3%v)PF>8gQL~p16oQtl$tp^$Etjkss|!;zE4Hj%975(s((If;L%eeO1Sx(7
z$f0``UFo4ff>dS$f^-|h*mO`iGpuGh0nsq6Wj*KH-9F(vmf_rCIb3HVK-aX)mtD8a
zYg)T30IypnlDiNeDwxJWcuj{Q*mf9PzXh4==$is%c1(5I9ctdJb`kYotF4Bihvy-e
zP5h&mCNx*#;S52k4WXxXgQ>9vx$Ijyaa`h-<v!b>y{;#xihLY4WDnVY{}PD4Sui_W
zvhX-l(ObJp5Y=g8<!Z7X`_}S)=h=?YgZn%D6<~Rgbt#@ysU|t+i-Az@vf{{yBN+v1
zANPrA*4kIvRtu9qJc}zbbGR&;+cNW1_R8mp?0EC0*h?$w@;KQIS3Y{Z>Xa?$ndK2M
zBGiZpPig<ie7!r&&^oN&^Lfrn{~oWimSt4&R;zDY>vWs)j);^|9EG+@Pp{(p!fv*~
zm7BhYKg}sa$Hdt7)o@BFT#g$PNz!-YtV1nlIa#fm@-miyj)BzMj!gwad-(OyOK}et
zL~T=yrF!;;>+6=joDub0EiC;e^do6d5~<Y<$73^$L>CFDM>^>q&|Jz#B`CpF_A;7Z
z_K)N($f$6A6Ap1PtFml+OmdZn^e>$d=zKLl3bx4IvwcLmafn+ZA;_@?=F{#Ys?U#@
zpRa0}Z?LdAArS@%+uIQ2aPAV-7j)b^t;3mUJR_uH3z3`cu_gEWHvdi)!KR_^)Vy%v
z*<?K7dgOY&DBK2qV%VhggH@}m)TmZDU2mh-YW^FWo>t+oPRmCtd($Lg(S0on@^e<@
z$g8KzVOLMVgGG*4Dg~`<r@ec2Pka&fheykcqrKUM7w(o?dR!etA<0}Qeu8yi?iU=l
zmX@>d#bN5su%A_(Vd|v8RX`*Cs^CK6paVA5udGLSZkw|1#TC78zau8JeF#sC{0<jM
z=|p;{_S_<4(@UtgjUuz34TU*OhT3)li`eJp^7bq92(+)iI<YbA4B%@Wy*qo&Zvt+U
zOibReOx%#x{&TbxNsrb#dgz(Nrgwmc>!;@0yvL5;bW{9e*^~x|6DGCue11VJ1;2?P
zcWqZ{%kt`-(1h40*@ga5owJ(vbpaw%bIhYgSBz;c*^(o3HlvYe1}C|q5w}jUg;r-i
z95$vu{jcbC?Mz`pb07n?D`J7!&QG+?rUSRuaM*BT6)1l%d>8A=S3vc#sX6@T%h{%4
zsa9^%KoWM%xikQXsliNPtlmr0^r`0Bw8*tyF6rW+Kzn^Rw|~9igk#rBpw!%D3?Zo~
zXXWp$A!YCZm=hiXJZYZVX8=!weM?wELyMgwOxVtH-?Bm4+M9|kYY*rbvR<aOZatm#
ziX^)g+qQ?Rb?oAl#EL3q91*Ao`3XEB?vdJU$s0(o@>B|eHKHKtH)jr6_PZ3>E0>vq
zejUp%P(zQ#zW+>`UXRO`hS5)lv23#W1>+M{O<3J>tiB;KjC}JfTa5(3xk^nx_$<Dl
zc5xnQB9@3AvTQ9cyk*d<rTt2a%UmMBWYBPSbbT+)5&yAqphv(GH(SbSXR-QE!Lkuo
zpCjTRgAddWot)n_nJSc#iY?X3uasKAR;_J`JDryfSR0zo5~<D{8!?)on9BU4f<@Qu
zgSDOC{xvT)lcz}Z$opfJqbs!3jEt$oT|NA+dv%Pj=MsfZd#6q=!pr;yF~1F*_h%0k
z=MPDHH<xEM`|<{^Zf{{kdTY#;WPNHz0q>}F!Vbr1gAi?x?&k;kH7$FQKY(&&-K|x!
zVV}#_q7KsP)?5Nmx3uWnUZ{K_vwdrIqsP7!uBz_zaE#_C9$skhLbcIvHDPc0Wo5%b
zWaJ{ex8W?R`6moR+Vsghvt0%Hc^X-&lFZDzuhApZnx_MKxOlr#hx*~^w-5>Gk#X*m
zgxS<=yO6@p=Q0F4dSP{!L}!&zyP{4xQS;CDR7s2MM@lZ*8@2nYP9IX9W^|TBh@LKK
zFB*$$^>uBnO<u42Ge>#}ni5U<Ged990j882{#J>|B#mJ`Y5xC4K-f<d*i@%o^pLUH
zCvaUxf#YzprNDUA`s`edv%2>mZ)l>MvWxJ}9=#8~Ay%m|E!;ZWISIRYAnMR1Q#I!@
z;YS~6$(={Hd;XjGD!_V<uIBR%z;E&PvnVL2d%3R5GJ7s^Zsv^mtgS<PV%Md<{U#VO
zFK(B06G=ADUa#nvH2uRI$SyZCFVr}_tYDj&Q9eC4V7HW!*BIW@FhpZYy^cMfrTT4e
zFR}hnrtbWkq6W``3E8$jyD}Az(uS)HDkt!Sf#I+BV_9ATQzq`d_AY|ycG+(_>Z>w4
z=Xq_E_Q;E}orP{rGhRuYXYQRU+T<(`P<}gqAF|UhjN8%mN|SDTxA<UxxAI_fH<xaG
zw}kFsw*WmfXG*t5lN0M6Gg<Wxf4b^D{#ca<{uFcg%E0i-<<m`;sow{0`PsLm8zY2x
z!Qj{-n@JF|?e2F?u?=0_Gu!R43&~txQ1WZqX@8Zo%nJk-r&G%F!L~}axCI)OCfItK
zd`HAikqP;vQu{lbC{HrxNhuWpq8(-vg4gox&*r>WPv1>=@o#XKo#ejm>zw_>rR7Q^
znzx!y@9wR|1Pu87sHXE6$^A4uwwOgc`AFqbyN~;~DH~*-j;m=xFr06bk2hnY<cDBz
zv-?Y#VS~weN*US=ce_WMB2?Q(5)2uUzvVYIg}Pg!R9zusKEoS)!<1@Gf+W8+Hi5oF
zsmd-wug46BhfcEG9|f?5biH#fsLEKF{HQ6j1@HZmul!Z>{%c1z&h2J|uNhY*PK;4i
ztITD#zTuWve^TJtgZQgpX*X_la!|~ryI|+lrn~=n?D|El0PA-MLBoA?cW$Flzxc<>
z#MDInBB|M!JTd$N12(bm9F(a;jp{YvCwgmEf<9eR-~<h@u>Nv7@!ym5VjOMGYWJ?X
zPNhlAfig+xuZ~s1b~Tz$=UN4?f`Ni{#reoPr|+#JrOoi2HemVY!@>0lNFLg45qkWd
z`|k_uzH+%gD>@oZ;2ZD(zZB*ky*C_rl8EFL-D#K27IX>kIdHn1_6gM$icHyShn8j#
z7*rsMsP{RngoRA2Gc&m7_J_M>?^;}#+29HPKmlnh4K<Hmml~z76-A4uuX_OlbX=a0
z%GLd}It|^>5vA_7f1>M93yhqax5(6Y`ZV>@J$$+3fe)Y}@1nBAF>$@gW5Za~hy2j?
z=rYusmf1woR_IyJ|6uGbfZ__Cec=EJE&+mDaCi44xCeJ<ad(H{vbeKIaCdi?#ogWA
zT_1nB@80^pSNGnn+38<*?^Ny9?40Q{-KTq>R0qg~d8yF5jC%aF;Jd6?t61w!l-p|5
zCQfq42uL9RfuW#P=#gv)+>&;6b^@bTfx^5hwso60$;+OA%)a~lmgu=Yop{d6d*!7j
z8?hu%(0@B#6ayOeVoGo?<u14?87~^EJ7nUAqQum7FbIu7aFyg&$iMAZC)YrFq_^Y|
zZ9V($RFD8Ze>x}A*>e8_ZYk;rXSLS%?B}olV_hKJIyg&->X9>CS#$zmUfsTQlmnWs
zIdZySOv`+m=Esq{k8cJq0^v}Qk(hVe4TcJ~sWatuovr)h(|;*SFN#V(TJr5W9BmnH
zD^77{v0Ku-N=ZL@^6erN_gVDE*9d7!Q+HI|8Sw2&)yZDx^U*r?#utQ9>qZuM=5b86
zQa2!@8w_bM@0MJ~SIkm?IP)+l@SI88$7aUsbIrSFQZub2vi^(&;4Hdf{w6=BWdUo<
zWv&)%N#6yAh1Vsrm|NAhDXpl2{%#4Ml4I!3TH)O0wnv0P-F)1$<*>|Xu<P1I7CjD8
z?bGI@RkY&K{gVRi+gXMl!wUEQA^cz*l=gU~`naF?aAF{c=sMa?U#K+JbcKgo(&+Y8
zCAny+PD{U)UC_{Qb%YvixWM-oDWxzK0=jea;DXy_$PS-{6TPK(4w3?-Xwe8?6Jc?r
zlvqgRM^A)J5~Upt7llz0<!+4lCd0pk3Y5kd0_f3S)t7tcN`(wG=LD+=mYJ*gm&ut!
zv}3V{%B2wv=P80}meEKTMta5TnX2$SD5`ipn5$qsIIAc%(-y*CW4U}^Gq`@UqQjU4
z_I7E2dWo0vLvw2B(Znn?$s;F&$RlU(Wbg|JKwKic<aWh(4ZUVdeWBBJp`om`yy!V~
z9_ag~C}d-^m=t5vIx=Y$Uh&u^UMY>j&pdWTcNSYL{3+N4Vxc9sbD<VDk)d!;#viF^
zAVQCCw9z?_pUJEzQ6#0OqU2VJGvla^x6z!QoI<Ieas#;F(OeE2DDw|p$n%eDdN0y?
z`JdL&?`b8RbLu;$6(k4j*)Dx1EsNfKq+YI9M|l9efD+oHSH_4J*VoLLBAqxUZQ76+
z-Ofy^Q0C`~1mRsFC?kOxADUO87lK5yVp#fNHuZp<VaFWUfz|x#-0j^8Ih<k#eIO8P
z9aGSTt3FaT=2GGDSTX2Gk4w0p$5SAW!Moj#C&Q){W}I^^YTRU|Z=7?i>pB8u`>~($
z(sO&-wf)k6nTj&!1i<vnnWE!n@h!T@es&cpwq(}rg~^F#A9^I4GgUmsIhs0FAaiX-
zgmyx;mdd7&erOqQB5N%dhuI7ZDvo3BmH}NX1&nut$}2XrG*DUtEJfhe>LXpC`Z%NW
zP6$x(WXOKf5`Am}?pI#Y==7D#?{2Xjnc8K^hQdfljZl(a!m5Xg6-BH4&^I8i6X%m1
zC(rnsgg!no5NdK5+<SeaxJ8~Q)!N@orem^9j#)(<>asZ4>tVUxE4Y9fdcRoM+p)kM
zD!0%SDz_LII=<k_?5Vtk;H+&>#Z%bw`_0At=U%G6hCu2}zs+KG3vuj6q1RJ;8jcL)
zS<4IL3Es;wog2#YPi@aWSIED&)(z$v&|B_QCCOEOGgQSEqm>joY;i8}flWcVqW*Ez
zxQT3Lu2b3RaU7?lLHBYL2hm2&i!Q!A6-`h##AlyQoA;1^TW`?0S8#LsHjfneux&&C
zwm2$j4ty^BuvyWI^l_f2zG4JVi(?$Gev-7GiiN-dW6p3a#y*ji6xmeMTcuc1-U)f&
zk^}`)@`ic+uDOH$y-Z>A$w}S8>)nP~R%iVkgf#ukUbu0O6PmM=c`1L@RT+^HI~Rzn
zSpl~qEMTytTZjHUy+kQ}eaWz9gz2@gVO^xQBQ~mIq(O%k#qciRoK9OY<@w|)lu-Rd
zvi>#c{5*_6K`N=xwP>&x(3-TSBJcf{pr-!#s7jOBAtv%MZ|7kpP&ggg70STl6Gyv4
z8E{7Sn0qKs2|43pQgN)N0?0`4DC0z~4qRsX+n(3%1^Mr4?DBLw_|H}&fixvW@N^y+
z)lu1=Ogm{M##-)7_@2TgUo6&RqI*Z@M%bRno!1S!4aDcWCPgStM1hj+6S`Ru8$96x
z?z#MC=8WN1?PdzX^kGUwS>m{bb(m*|>2}#-ine(7cwJ{dP>qeEn2+BP0-s7A+3m!7
z;;Y}ut$(|hTgUJreQ<JIyYD_fNtSUTf+@kknRNR3qP+=qOpLa9?!Be<Kqi1GV3iGZ
zSJODSKYHT(YOsxheJ-XOwpt_jae;lkNe!!*HlZ0BPb%4d6u{WsXBip?yeMe3f*aFR
z3bBbW2ZkeqcS5%+xk6dMaeex>@Ky<Y5zrKJ1zF&lUSg&&S@FpHxY+&4T`+>#uPc&f
z0XODZ@`0&W@Fg3k+m}~<H*)^C)-WA89kFvt$|(~ti&sjkJU%q%<UAO3NXgvF#~tb|
zC94uFL=I4q_vqImRi+ZQTB2M39jx2H4mavJtAg6HZ0_0;q7+?|0CGU+>yRWf#FW>e
zTo*lRkHJkuVOf#5ya(=F{OFxV9UzVrYelld-Qo{%_?ju~31wFVyed4VMrp8CnI6z;
zT)WRQ-gcd~8#$%W!3u{u8h-G7nioYWMDK$D9FY7`r}Oc;+Gv!q;0{k@vz$J1AwBFr
zg5wCKJP-(PUz+%Qbx-fK+W9$R#pxU6gtQa-Ik$6q;n2Q18EJ`;kTQP%n2KHPpia5s
zz?nmK7n!oGu(GVE`afF#v06F}7EueOqQuOdqut4xj0-tY)*<*ywwb#Yev;f&=?*I!
z?<4-GRQr!{O5I!^GTnS13f(;2k32!=;D+Q3Ptb1cdF9X!$sFq=1YY7xG(qZ1T7;~3
zSGk1uc)1h<06k8(1{Akm$-~UY{zw4Ic!BUrZc1>(Qq(06TYC6I^df1!?ZVemA>h~G
zs*c|UAs@vLI=I!Zqi%EINjgYZzyJQO(YkXEr=+-2GNqV4cjU4&Gf8Z-GQ_KX<#Mh=
zcKd95#QL~$iABXbb&#GSIi7O$8tP7vtDZ4B%^F9o50<;zUep=~$Bz_c<+q5@;yOpw
z*Q!u%HZe8)Rav#z#jv|K_3l!_H6BhucHDWM<7TfEkwvniX=nm}?$}NJEQn`}bphm4
zY^MJ>dE)~O>GF{eX?@o*&<%+oamf(p6{hWkL3P3nJ(~m>Pfp!B_|&-6>jeGoqTNBM
zS6_60rXFyRO_AN^etZC5k{As;2Eeidczy>!0G6Zz{s5NL1EzNq<Yf87s?&iDLpIK#
zuAmoVRat(}lzP9%&WA=DPI>4dxAh8K6s)4a!l2yI0!lZ}U<~e;<9Ju8*|T<9c}lr@
zhT3BLox~+IxkN8w(eSM-4JbxR80^Zo^%#Oh8Y$BH?ULg^>_4HjNGi>NbLunp_#W1;
zM53OEmlC}Ns3Pfy=ZY&Hjo${EfJ9)b`#;PY)-43{q8a<UZxf<mJ6XQ+PJ}D_J8IP4
z-IE-WkmeLhzd{fWNl5sz8A)OIvR`XsTME`p-|1(Z**>eE+AER&*bo(mN!Efc8|Fj9
zS0Nef5spY)h;Rz@UER|QuOJzm5gHfhHw+s7GT8GDKO~p_ho~@owH3H!psLIbA`8Zp
zF`h4)!xpU9+7U^4<|F%+#4?JRC6;oA@iX_AOIT&wN~3|b9>MDO?hRM*T+yUZCM}(Q
ztXZsgQ81V2TZp5)m)S8k4r7u9-Ii+;K;-teOxvhcf^dXnEpWVGHq^hVupK<B*xzJ7
z9Cp;AWd-omwpN$-0+mp0XWR3w&T}On!d0=5K=`OxVbjd)T946Ae?!$sI8;GhN<4H&
zZB96(L3K|$R6vDJID|x%jRS4$9U3>mk;ulDP;8YsIfejT2G_fsXNylswuS7`g*}y2
zB17cB*YdslI}{-g*(;w>brV6~w^}}QFACOvA?xd+>Nq})LT{<H3jwcgI<?R(m#vma
zq9NZk{C|>!kXl=y_M$cf!e+BCD1H2OR<4WLO=-8S?9be0;lBZtOgwbbPtDIPyPL(_
zwYDD{`>*XH_P24z2iP;BEcl4#T?NW7J+-#oW?Tu`GsGhH<^LymJo~V101%E4oY}Bc
z#?T3&ZT+h1N?d;NOKUT*u^YiI5bO8m7bRB+44ohUEzHshG;tLv2WScM(Sp{V1j!kE
z`d^N@c%O~8=W|5QZ$4_SpO_oCIb+C;7o1C{E)~Jcwh4s4tzNLaGZwtrAN^-H&U5>k
z>0BIcdvr7_TPHw&Mvl!F?j4eXEAK;5r9VEB4Y&-x^g4qMH*J%6S^qm!W8pYb2jH8}
zsyPsoHsxT^FVXD{$O6yFE*yosc4yQaP)eIx#gESTAc6LMN2llYr}>IAQo{B343e9$
zjTwUeSFnM}fq6s=krk_Fr0?HwJ@DTn9~fERS+4)tbu5fzzQ?DCgvOIcH#@VZPR?0O
zynK;dM4F8cpdSd9B^`!U9a>z<iZem?)otX;upgv*`bf)+3%au72Kdc_Y(@F>Z|OAt
zz{SZFQQyZF-*ksEX9beZlR9ci9|SUI<%oPmx;w1Or3{&9lNRg$OZd&d*#+^4;gb{9
zk5%NqG-~G$ag}?S5&ENymahD%KE6g`-j>HK3m?_khZ^DJr~Ipi^-fr@TM+vh{#*D=
z3)F@-OzK(yFgfG=6ZZA*Ep`8!rMMS4+q{i%I@9);>woS`sl9y7o;!c<_g25#zY9+{
zH}6<*nG;iE)22b8>vhv39)m)#BUB5y?);SogSo|5>HB|MPo3|7X}=j!TGfz4`7YAj
zJ+t3;grC-@eXbzbXMOD3mt0L`6mnyK-b(v0RB>eeUi^z^;%}XX)NIFb(Eop#L1=9w
ze}?LxSc`wdEhj`c4oL7EW00EvJMkIM;$KZhJn8=BLGCCAD8hYczA+@%G`tHg&J8>3
z&g~W7fhLF#MdXSvDd)x@5|{n|03Uc3zw3gK^0$z#8?h*1bkgu$?d&)Dz<>UeA?Ch_
z#&;D*<|Bh4jD<o0{|Vmd6tds=|A`x9In<OE^_a(?!|gcKfHhqPX-JscmX+8h{vt;I
z(b6vZ+!r^TkRos20a%|x-?11!&9%|QHI){}|I(rkY*c`^%loz^N!^>E5JH>xRaKI>
zJRXuJ&sUQAuL6AG{{)YfB=y@$SlnuhB&quo6o9mO*s7Au<?#ku)P0Q#VTJJ|G<hMC
z)Y<<ne0ZN%PT_Z3T@law^vLyPaDe)UfGot79ei|@qOWHf<W9{0qm{N$*ugVVjE#)Q
z9~&F*UEaRvLcS+;zLQ`0!2PdahyT0O#yi?W$LBZ3KmUXp_ix~T@kRUZOVbq@@3+X>
zyFSc!9oWyhz*olpH!Q>V@Tzx_2i<`Gb=T+g!Z>%muD)zs>^u;$Ou%XFveLL}xBdTN
zL|V49SM4Ux8ckiaYIzx!2(V5g!<`5IU*Z<omhJN3Khl;;Ej`=L!2_qrQOg8`4ZM8T
zF0LzQwza(Yr^sS0J(K?})Gb)0E_5#V+Q1vwxJuo7Dobqb0&mx%7_yuWx%BVmg#Ol1
z_-K>2SHaNyUeD0nsA|3X{^VHo;obv2@2b3pdN+{`*Bq<d539Ru2F+^M9B?`Y<Z-w^
zQ@!dsJRfMS2=ExL>M&d%yo+%6c*yJ_`m72*t-C%x%)jPzoDsdwZ_faq#X8;}pT(#*
zXL@I4<&~}SDMm^kCEcNQQLlu2x}=Nq_eDymd~mYa`ImBtW~U(MWJKrEwM({~?&MgO
z1bH=w4sM3mXbkJqUX}XBX_A2$8X{$3UbM3Emr8HVz!xOO_{s3rH5%))^ujHPH8zX_
zRU&%BTjtpsCC|TNKl=&$2+h6C+jh>OhHug2%aVZhZNf^&<k=dGsI%^1s(C5lI-L)v
zdaQhTQi%CKRXJLWIJ^Hv_0LhS?m#8GeZrPIwd?1;y)P#}vUlL8VrjwR<s`I^c;vAi
ziag|)=>|&TX1$6$U#R_Q6e;S&7iV}9a_@@1rKb!{6)HuJNnjkld@DdugwRfaKMYb5
zZpfEpBUcu=&()arQ^Io>n2lT$uPYc=BskP9GJhhUjZn$u$XZw6$C0`<7A;1pQS?%$
znT-M{YS#QR*X&nZu3=&iNl@@tzn}S9FJq347meFBCVe_mE_FI&Eq>a6q|j31q2N&o
zqv&DIui#<Uruc07s`z{a${U;EluOT>&lf$0QrtfvRoFlBC>Ud1${*t_Rx||4C}82f
zDq`W3C}4rykI-0CnrChllTr{Aw?`-yR8!>&%BwYU%j-1?%IlW$${XBstt;DQR!v`%
zn-?`wn){p;;!aYEG*1_csP9^5((iJLitY@H%<e!%9;ZIJXElP-t2T@>qm@3gqmIBC
zz5<%t=xLg|&ch`4kwu={MpnApfEtS<iT%zQ#j)&}=`olhlXOOfaq=}euZ#z#TfkP_
zOl&V_Q3aY{ULr-^%sd!NVVz7@$}7o}^Y(lPtLR)&Q9&^GO!hT7HQ|Z6?)$C7)8Gu_
zp`ilp^gw}1UZ(78qBq0n6k~qGO?GWclYkX~A}?K9n<pkEM%MUVvY`4oA7K${s_$ge
zjMGDDX*eT2vf6MeVX^8^;cm%MxjxN0rj2ry;aRC!@ov#E>BQu)97Cg7QzZOm55sHP
zi{?(;M$yjPy(Nrw3W}ybx1j<%iBQeX%l&sbNt;k)LGVuTl+bn44eF!8Q(<e80LMCo
zmsUH4muI`nQ^3plAv%Kb)6OpnFG*s_Obu5~FOAKf8=OGKDHBX@@%J)Usi#r{ZZFx(
zyPKvy-RXS{)x3em`1S>vf`MknTt+)xDcwB=$tVXwDc!Mwf`RLjsrf6o!{Y~;!%$C!
zCujjuFNDmbj9wzi^`T6eq({6%@Jr53`pf){V>^vkCRX10J%`-*g|p1~y{zQ>Dqf~{
zHz>n<sD<;jmQ(N**ueB!dhht;cD{Rqu;y`y^-4O;_&89YdnqT^ft!}9gPRufM!`k<
zdcLuBbKiw=NYp*d+H^4_P25V+(_`Ns{sJUY26PvCQ54ew+*RvGZi+194mB6~YXG}@
zA7SfIEU!{2BPw|Y#vlcN@v=g}h;tqzE0m<J33Os209v_f1X+2S)xYFy6tN;T24}Jx
z477|HI$0qBEtZJ@jPEhe0e7aC^2QaIy2f|bRdh9S!xAZ8nzCc~OIML2sPraAk(N%s
z_6k)B0Fh=+&U*_gNyd>DZDxB9b8Re?4QFxOWw**H)0%RFFJ-sABa3A=<3MY4z?j)I
zje`zIHsyLbktJ@aek6Xm9=x(v@39wI4>CDgLLQVhO9HPfmM1rrXakHjT4YlWPuoXU
zR?m({+D;PzXBOiu_YIjDDU)w&BPVyPEDk(eDNO_lDUSrzDZ#u-#)O9#I(w7IL;y_Z
z2bOEKU_i<Muj~-tq@Dd<V5EzY&Y7#vUV`j^iO#8``QEK;4vUQ=F37E>S!}QDC?my3
z<vjYa(cNe-?ns*@Q-vt`vGgf<WPjGgxV^ZY;#&LGDFrZ#V&q+%0eWnDx*TDg9XCl-
z?MQ#DGZr=$87)syW`8#JK5jMSIBJ!upK-gl93F!)(R32vS#G{QT;$NMAF4mC_Nw<v
z+FV4|z8iBs!8PV}vPvmCTq0inhy}JxDnB=AaeifLk(igO2053E-kr=bF1IYtEz&n5
z4bM5t0iK=5O`e@ls$W|ghOK8`^G@bgbw`np-b9^)&&~lbF7GDJruXO7q%H4ht5wfo
zC$ju$Cu96!i`wqBLua!&93H|^-i!Y3mI?fg19yu;?!a$7ye25eRbqGIk50U&8gr*E
zJaN@{ue*pZZ@y;bxzT_b6!zUzPWiS>I|ad3d0US}?;KFCtHYNv7S+i};G?%l;JWrm
zi{P-MMN`v*p>Dk&@<Sk-)t6J^cZ&wvqWPn!JM~xj><NmtG{{pQSLX!fguJ1;>z7->
zOq0Td-j1OunqnhM@>L4s;ogjIhrv`HSz3cO2E@FaHpFf7&xM<fySL#{F*UlEnWNrq
zr}o=r#TqqnDlY}Rhgk4<@0$sPB^|p(nZlTPBBIwC{x)u@ZKv-1u*fb(D1Oqur$sZt
zyhmNQipXr27=v>b?T{(3=m?GU@2on!Q%~<Wj6q{Svl?vn2gr&=UU?h#SU&1%ql88Z
z*I!OmCyI;?^m+mfV+N%$x>EA0rUN4eOHb<x>T%r^JoBmA=4Gks((4OJN!tMW)IK1R
z*CAH{;S&<Qp#bade58xcYoD>P)dt+oN~ijW^%jItaR||mIp%?4jTVa9`P_Mqsbi&N
zw8J_n3^t{c5Di?>`68|u0fkFLjiN1@n2E4K_sT9BWc~eOSHc#NK8X_uW!W*Yw|(Co
zPowzj82K?VQEs9S&+>mVIQ!Km%ASAPa`VGGFuV$0Qf=>qr>ZGqV)#=^PpIPuGej{K
zS&O1y@#+RML<p*L3Z<OcZbveNG>sVl>Mt_iyvyGc=qY@Yc~@@Rys|>B;RT(+LW%{E
z?x*>asEbI@K$3jVF5D^o`x(mhI}Oh5Z!iujI*y3&XDDc<zsbKhbZ2WCJ{Ia4!TGcI
z`txgMa0`(at2QgYwzBre%S-dg=pab|iBKZ*3&K>UugP>~K+^Pn=h98ng~ro#C8rm0
znv4&0d9Gl%*&(;7oUY&5O`aOht4L{VJK}PFN5JcpZr9sk$;IW(Y$KN!Qn}oEh)v%9
zR{zayBmXPXirnt~^m@0@p+@;Z{zfCTdh|C%sTu~kx+VT0426AD#kPFJT}E5@iYF{C
z0|bLvNE~6V!*iR|@3=L$kJ#%QOlo=+@q(}RsUz}cNTGlJDEbG)!LMY>RnA<zYX+w{
z+AvUH#t0Oe2SyHuF4lR>?-(ecLK+MniFe0nP0eJd{mR{<kVcJFzum>~3Q)fdL_@^U
zXG+VBvgaI$<085fUqK*}+BwD_9-YT|Y)%|KHw>lR^y|&s$nN!o3z~94bvUKiTap^N
zC1jp|-VlHP<atQ+%lPSMVYD|aO&$?({uAt(>^pXUt`GF}v|P{BO@*Gw(|jexE54=V
zdl2@K<^$I&7FUWlglyjXC*9n4SggVq#iwywYVBonT|$M5pT;`veaD_LCyLXv@j%=9
zK2y;`O#J}P9^l2FepuADXj}_)*KctzRCR`gnm3_Y1U@5uwS`*D$qXLfWco~i2FQb%
z{Kb&B73!+7Z%AFoGjoVXKl?rO>U$~m(uLc{-W1#0<?dE2Lp{?kosQ1ErUsgIv*$V*
z?1I3Ksn_|_X`HV#*fKnWOgMjQ!LZ6QaK8uQVQ*!?6N~Z4_sP<>9bm*98O&tU>TYxj
zJU$Zzy>x1H9nMF+HZTfE8e&0c*DL>Ps|^kLGaI@oNjmDGtW0ylNW5)%;lWrbAsFM9
zlbu$c0wW<EXI4KAP6hoaXvL#ux3D-WPB^yRNCyq95R;W4STVOeofACQN*uf}prBS5
z$L1H)Zb=~99iW0a*BrA`YD&wehEblPQ`JVXH%HRT_fuj6QFa7|euK{|e~t~vB!Cc1
zMwp=Pn~b7ii}27a+{_SDF2yI;6JbdXuRiy%Av>n5KLn{?jOeb2vE`2&ZBz`0tjJNA
zuhEO{^tZK$L5Z0?U@l*DVtD5BQ)+4twxWgW+)U6@2Rc5xQ;>~}*GB81%0t%-fj9fD
zFKxa6Y`%^u(`_5WI?m)(`d+n%U-^WthE9ZOVj(IR(ZPXhR{Iq@ETbjH0bomk;eQiu
zwy00zmq?IbYLuW6D^iU6=z_YZdI(9qhySF!^rH&7+{9w@k6(=uKgBZ*GuEjHB6<&i
zM90yV@_zmyOjObY)n7y?BFiYkTq9yf%dwBi8$JRn(qJH5=_!n#NqD`UvX#V+J1zPF
zj)K(y{t1wBzI{^cNkqCnFnEtT^o%W}rftA6mpFf&XUU92){ZOe$)5aR4tqK4^}B}+
z-#kV1hxRm;sh;~+Tu}cn)@jm-sT-;rHh$>))c&5|)56JsRQO?;X+6*(+(YjT*^5zX
z6m|ZW1J1S(;%Sl*Hu`@1e5^{Igc=#C$_%rVotiMcc4+o1^5SqZjoKwI!r=MMHhdeZ
zqQ?$^VxvuG{_n6lYCaJ{)vu$ZYwzVU`WiBPRY9%>1ed*dz34Wv<!%U``AE@bOP?{M
zL0Pe8w6&b40WC5u;^VDQ*D}xgMTehCnFs>d^M%;v@Ppd&NiV7nzooHxeJ+qD>cPrK
zxBW9Dm?GOvK5g=zC=;WdE2IA>r>StQQ9j0}AJAm2_>gS{|Nik+K1&)Y8i_9xvzE)m
z5L*R~;5AT7>ngry<h;EmKHb9{O=tcE9-0&yH;c2pBY<DXtEu0}KwFH})C_Slmz;~=
z-lJvgzGRR(n5J_h>2OkZx;v0qvQTyr(wwsvbUyFh9CL^m{{(ew#LLLjPNhioh~-&z
z2v{MD`n*KnU9yIyb)=T;85ldRDrl@u^^JQC_kx~>@a@#<3t7FVa?`8*H1_{Iq2c}D
z3~lJf4n^rwM9U0HBENbCLF~K&Jq1bE#|Q6OuU>()dj7&?nk`d6>=D9?<hHLYCBK(W
z{LPI8**>bGt2lgpN)?(IPlFH|O}U6}`o?F)fDk^)*)_aZT-mJ!p^{ots7c!mO=H8M
z8f3L+UQJ6My#uy2p|TtMTAV&_=U(AV<69Vb8u2LmCAxscBuMNf@y5qpW^9*Y+;0;$
z0Pt4?TPaTE>tB2RNYZr(w6@2SN;CrWzl^$6D04C~*H#7@w@|e2+bC?`T=jmv!CW<c
zu1oQDqR;{_{2jD(<lG(hEexVhYYU`HJG;65R&^_btC>WrLcmXRJ-JCiH!hpFsZ{5u
z!d|jaJZfaz+*-_Dp*e{Wj!jp0;)v0mutj9A7dW5~cLA}EHR(seO%nAD!k|X}qOR9r
z0f-9Ph73ixtn4N29;8AGpgG@mZ)FZUX13@5r5+XYLEDNw@iAr%5kn-=O2Uq+Gbq$`
ze^|xRWt&^Wx;v1XT3W-Oj*R{dZ{n6vk%}!<u`OsK0J1a$4~!D%H#ed4*_=T#CfiVi
z9{mif=CowL|FgQ+ei8ZT%%#^36`A_n!+rg!(UkCW(x^Z4tS3t9h!B%rI}z&$X;r)%
zTOzw)!0rf&VdA5FsgXB+Nh+nD!?o~<aRzX8RM9TijY7aOBQPq(WSj09y>a4&tlc~#
z$|ePC!}$7_=fDdhA+uokI><rT&n@)#sD*InOBifwQux#!MmAbPNvdk7<+TR&VcU;3
z$OyNaR~Y<c5`w#+K`=aOlxGYU08N0sCt*|JntYSC@c8&;T@`2dtwC9|={<Rf$_0uh
zX9}qVIOIl?GxQG{s3bZYTL>I_7c2pCN&qZL5~@;^`Z*MEmL&iu-xI3BmHMp}aGu2h
ztwJ>0+6p-5F+&f&O8pQDIARh2PhpyELj@d4aX=bb!X<SPa9jeAMx1c@r3lFQp_QT8
z##6w-5(m6|e2%0DD3#0NO_^|sRRrvi0B8{>*kQD&e`?YE99fHfsV@a7U@XzAo=B!;
zD$%b>Z|pg2&^3xl+iqC3i5gDO(cmiV*GH=)rH)z|AUqLEEUC#NLQbPv7mvA^2zpah
z7G32_h~Y?33i|TB%Iyt<0Kpi5_lUKBHUpp}H=^8Uy;8)d-b|kY4_DQZ2F|-rcxn6X
zIz}53p6VxDt1K{He!RP|VGSRdRFDm?nd%X@517Ufw@;W@qU=3)r)*P{v8DEhY~5tA
z*AchZm<W+b&%vI<;`F|2a4#*OKR#Gx00jh#6dF|eo&w{U1o>M0kzNgowgafR;%|KO
z<SA>bjeMmlT&&GeY8}*O*iRs0?rJn8`lYAxa_UIj%WuIyJx*=c^SGx*l#@1q$8CK-
zwebNBDc@;f=FpWk#hV=kQZ4~wNkhcuhZ>dIJTS|n#HKk3OKqRgVR>vrG(L{SJ$&s*
zU>5U+^;%l60hQVxl9rT9Gh}(Gq%P-CY}J5@iXGocM;uGlKl0FvdBOfCQ$0VO4>!NJ
z+_Zjgnc020!gRHO+ewTPh8;$FohcXjJX8Moc_x+;)<{ZvC3XOA$&}n24C{ydvPZEP
z+k#DLZ<{Vrzhm65{ttnlF>u`OLqM@pK1Q{^Lgs(Tf`f7e0vRD#0tX&OWv)iKvBzSX
zdFY_zsh6sZTfwo4nd!YShFLua;<jW~-Ik<u^C;~C9VHl}<aO)}MGmA|vFAt-$h#h5
znmYu?qV%1jBC#Enxj%r<W%7<Y@Rn^PDtgBQ&tLoDozRP{kR(&NcqaWYYS7E&#PIq_
zOVuhB>SH>pVw2xVj~(X)?Q^;l>S%}UtL$2LHO!^r4$94*&Yh9?;?6-!q+Zi>cL-Ah
z)`UGRiT8f=*}9bgi4L2vmv;3T>X?uCodr3qstwA1@_9kK<3@T@bXpG;9rPtp&Ma+a
z8LBrtqKL<cWvub{VfZVbDC`$GzG>n)7H=JYp8n?$xG){b9|Z<#R2`p{h8Q8zx8?6_
zRdMS=0w7<Z+MB_<2|FQC^xT$$_L3*_S#XIY2o=<zz5`i0G3P8le=_8LPO|n;A}PKs
z&F(_YVqWS?#Z`<@)!R{=TlyP^kI1Bo_(sY1(B3%cF4GAdTnS6d1JbGr{rKL=AQLhH
z3og>j(w|f8TI@VH5e$X|p-vG{WXNpoRCXzL1-;s$kNDdX+k$8nWP|q-rZG&aTZ(Wc
zWaY9CN?S$3{D#@YRfsv3E<zc<<XiBDSP9mn2TzT6oY9AzS?ybJnpOj<SAi?mqSl<G
z4WQrkpqS;+f9n6G{LuVb{I~MIXy5?<82PVZS(coJO}*}DcoZDQGbhfIUo&!v%iv+9
zlqWQc|4b?n#L}^UpH)DhOI+HhogtR_p*uSD6*5uuch?klv3lwcD=Ah}OEcsoy0Q%v
zDZEBYGZa-i0#rJe?6E1Lh{QjIYS8-B!>ekO_9z_Hh+X-KSw=}wy<Lg&Tyt07BWr+t
zB8g&`GQ)<AvsYYawZH)sdi09`0GhXX3UFO5e<Lcf$aRrL#<Er#Ynh(4PhgnNu9roV
zv->K*I)0aWm2DVuRbiN9)qL1sm1h{C`7|-FSvxVwDN{pd(o0{xoYzD>>v^_X!DY5u
zBPx;oiEUV;ZM9nVyt*}iyt*~ZM&C_peX07VPdFf_Jqi%_<~)q~Dn5+-sx>V8N;Ayx
z3O&sGbej13w3_I03qyZ?D5tSD?_<JkIiVhjJw+#mq%zDbl)q~zgfm<a)Ssvr)Sftw
zm_uKHv`v?Z*RMH-ol%*_&S&vBRXKQ-pdYwv(NmJ>5TrHS5cHae5LA;$gs4g{h^w8L
z3G^Nw??)UKF$4@V_BSW$Mx4_7;J|1w;00^GaYR<X7^WFC8K+s#;v}ix_G_#7U*^u5
z@>$3*d0WY_y&1@`=v3vC`LeSU&!#5o)#OuhmF)%4mGEZ;&ZbN(9Z5F!9myUTDx+C9
zxTA||K*7nW`@@x#Wd+F0Rm1U?agv|ZB}#Ew(r4NZX%KI=)|qE_Y0ys^m1USV%!$((
zTE(i3X)sp#)p;8zTln|7D_MWIJ{LZoIvNXY4?><deZtx{V(z_|fq4s}Z=LI7&8~g8
zH*?4xzG9N<;N7NS``fWNP4k6Iive%?Ehx+9Pi6Bvq%swbYNw3q>eRfo>S_^=&(G#7
ztj_`2&2{0(oUh~AucKIxAeF9t**J{ypI>9Q+t7Yko_n>4cdia-2>XhMI8CJ>R>z5@
z&u+1fC4Tb&s@)zK_KK79Lroq#tCmM~YiIX!3AN8N@c`Wn)4KGdzuAB}d(|sY?6ku#
z<gjTzJnYV#Vkqkk-#FVvplhu~MCJjL2L;Ok4b><+frDwq9yizS-*^jXZs5B2eyw3m
zByQx424?iNY9|W3I9H9yZAFL7cS%T3eexmUFoT^YAM-Uti|WxuW6T)}5g18SLpV=#
zMH!3b!rOgy#b+FR4$VM}`0kDtnjxG`8FRqQ!XGLuM=}{FenW=FA1b)1Ec)jc<*@}}
z+9_X8Lp}MWIf}alC6flP|LoEizPa+Rm1~fI($&9yb(CzicYb4Y0=6}`&e+y%2*zqK
zotDQxT<3UT6E$FZq~<*Ia-68}8<72L<~D5?d2lD6zT=h}PMCYadd*d-4L>nC*GBd*
z%w4)hIYF-3q=)2`#@YHgv5eKr_HoadH4gF+B&nNh(9Wqh&ho%SX<}`BISzk_b3%Qy
z)CP8_>vopRVSUj^g3VFZ1lS;)S$w5(#McU&E#C{g$ZM?o+8)BtDEgWgzEU3QQOlX{
zO}3QN?o9a2_!}Pz4c$R6G`rFv0sY?J0^C3p_oY<1-fKUvd@Za?ok^03mR^#1N<zg3
zJ<5HGlVRF(r;r^hT<~&uoq`)!2df<WeUR#o3}DFO)uq8CyOmQZyrr-}XNT}YbBRVF
zzVoc!b@^eachGo=gFejm50jmkA`WAqFkAPHe_g_GuC5n+{C)I^W}&R&kHIK8gAPhw
zDc;{iC(_z_>!A8MtBLhy1j4$rAn+VN(`qvorrJ6M!y1fc>3OIAaj<Q-`zKj-lx~+f
zAzQFJHhO8Me)X-PbXCTWnp<?G!cq;vzUbT9ogWEuxTGpl^%@xDLUu;I{83Fm3FW$i
z|Heg{N2WIB<i;c~`B`>kV;Vhb8clSL93Qfi+oy~lZL%0znUc#tThDUYuRQUSsg1`?
zXnkt9g&C}ULu4=W`DJy?_<P`qR^px9RAje)ZavHYmT_^9?K?Wvoq<`;AeR{;QP!J*
zH)lTcva5C&Tb~v>TLpiM*23<BLVNk13SGfC$B->`4q_4uCU^WC5HYVbi9pl}@JTUi
zW9X9&{W}?&vWp2mV=!W9Bki2!ymb0pM~Gf>;FWJ+sSKBIaKz!fDin0T!>_MhKSlb0
zH8TbxB19A^1V!wPA;4LdDSUb60E@>X++o`OL9$6T(->lmv(BO!|JM!W(2A}Wv~~Xq
z@(dvqQg^dT{nChg3H-3Q9jEefu^2lq(em-ZTb!mh61OoG`cSRRm}6GiJ`-|=ZmgYG
zTz}ckPds>jm2eZwj(W9+#9(7zB~7$sOYraYMCb@h3RCl%UkD%qjb*KgvHTxmAgrfF
zCD+cq;K};$BQ*(r^Okv={F*piCbS5uRv42OB>{C-9~N{O1#%r=n@m$N&AcRP+6w7H
zLQ}{yaVXp}!mg++#pubhQrrJ2`fHE<2*U9djZRW=^X%|tb|0RIQYY^XXTS4;zz8v`
z!{r&tNtF`4>p9_E=UL$_$>{?tR0N4PT46IAnM&N?uF9wC6-jtahtQ>c`f-a-_0BhL
zEk8QvFp3wSe#k7BMOz&s-&*qj<xbFCbpNRd!sIpkQauDUV_;#qX@igYwo3LwJ(KRU
zi{&lky*VyxOSVHE&vca-|M}V!hflLMdOi}C+o8M%n<JShQlH7^>suw3{pFgPyh7-s
z4h1+S9*aETKzt@-PcVPlS(_R$lrZHSVL+mfJC47@r`8~&GKjp^FN55XO3JjHVm`;g
zPOa2XEzCn3t*sln+;e?%^4!Dc!D~DHi|$~i@<l|AV+?0xj$&-WPNl3_L_sL?QYR}~
zW?&6k#}6n{+^U4$Ij#?b<sq>b>7l4K>i8Z0`!TEi$K1+M{fqu%j^(z;(R}*WKhhQ)
z-rN0BU;bq9^e0ylIz|>pnrD}Aiu(Qo!RstD4b~zB+t;K1?z{U0*W*9Y&jIbe+}~|g
zZ+8)5#m8p>f(^Hf(+jj>IZU9gT;o8xTQ=^(s$aZFKZSdkyd!(D0{M$BYt=4d8gMVy
zBm*>oWmen^WA&d~mJ_#5>#;6nm!-J+>mf6%%gDTH;2kVW>>{j?tSig<8mx{l6_=6u
ztd;{zEJ2rPRtRs>ySi4(7jnz8)X{BSPDn#P4N4bFSBAC}>zXQJQ=YJ*YlmWms1ux#
z@V{)MUN84dhLuQ={mm+IcCE%1_GJ6DoddIFFV7G;V~vC1vZitouUwrgw0r%9a1b93
z{5kXTvZ+^_L-{!_^`6ou`Pl+v<4p^{jQ^o)0Y%nTn=pZwx_hzt0IP}oJ^Z2><8^H4
z&ys*nUGZLALFbceLNQRToac+D{UliCLI+vR(>^qG{WbWar6ImxkVA<a!!6OW&eH^(
zI5`%JWNHGw0#~1#Q4SMMe%vYF?#&I(t02@l0q5p|!z?YRnghT1OPUAivWg(RbMDpj
zn~%FUh6wlww*a)@WR}Fj1%l^BL`x6IB9<`GG`pQcd2KOB%Q0m|H_@EP<}glooyzCs
zG~(#V?D<8@#i))^hunc$QB`q`G6sTnNv*m^NVQkL8c(6bE4^T;>!CL43CQ^EV275G
zg~*ptahaliNi7c;`KS4UtTKPdElV8OJbx2iknIv*-oN;JiYQ&59#~XgA@1UdFl@Qr
zWxsrX5p>FTQu&J5V%5>PTrXui;rs=8xxAa2g|od9>P1hi)Cfzh&${!-nKZJNa>LYv
zMYg73JI)zhz>0Glt>ugAa(d&~S^xa0j+Tw8UCU~)$Ei1;DawYO$5+96lMM+Eij1nH
zZpIV9MQj`2n^lGH{E0frtd4x+$!y@dj*!uUMcB}trTn~(7+b?MXB8)U`U#S-iHFeS
z=$iP7=&tu2g~8vprkS5I-{Vv4FlfGS0e-{;-65`-gB&rACNo(cY}yfP2L*?OTty(U
zShmtSm)Q)27XB1`_4Pntw*C$?QruKbf#Ftj@u*P$B(>NqGo*rIu#JCEY`+G&d)z6l
zGCzxja#Ft5=4NwAVo{Zk<4){!Ns|1SUlU%UNwSNYkk6Q$qc&fiGHMceiz}_{`Hnm<
zJ~0Yey!Es?bQ_x14TKFJ$L`O&^SRFuRfO&akdV0;FfX}t=W5R<2ll!u@G;NH;+U*=
zvS<l;y`UwU^ujMl8#v%o*?pBw;(}5gdVY92y#bw5#^2i{T}ndzYq#CTT_LgKJ&V7s
z-F*8(C6!rD3hO~BUgHw<w+$h_ejTyqq@h#G1H~1*hQ3yNAM~+sH<Di&9tPJkd#yid
z)uIIGp87LS3VfEid!8^R3j6uYRH{c5IC`2>mHztk#E8h>>jY)<`?DIpxevD30#Vn%
z$+m6KD|4DvW(dM5t6h;7W_j&LxZ)k9U6~j1-qQXSCXG#lV1&mBLiaONn(FtELPpiO
zv6x?~KLDJrL7-h>vOfN@W_4i|m4JIP?Xc7M3<76K6k<__sSTmu)G)<pM*Bb9{8aGq
zvyy(I>GU^nbNylr)&M8Kgxwo)0yn`7m6|JfZ|~3swP4&F8S2!ilAWy?Q-O^9*>s)H
zMB@|IDU0n3#HQ@a8<<|tGF;&ev~<}+HFZOB-=3}IL_3!8%g$Cv)=rBqS};0_erYUY
zdVMV3zN;S=&r}Og{E%{}a(thj$=abZrTF~)P@U974b)o|x3nKBd&NwfN0a?q$j`du
zjQI2KNpCTxpXFs$1(ODEV9EJK^9KfRuu}+0rwxtVfdv<>y+mNLcT{-Szo(4RmV3Ty
z?TEm;q)u}m9KJi%?|QlrZKt%G$j=(Co$bgJ%eww%cei8}czShSq^;)bpEXZGn*`68
zT!!oL>kAECZqLpS)9p}Bcj?KN>mv3oc*@U&bQbI35vS*dw9hbP4MYYg&k(J{-d~BT
zh`K}Xdbno2KkqL_8AQHfw;Kq`3LT0yPQEdN_u*c8-`F#%eIhd#$0sV?Fvk@i#h#NM
zN?z0AS0zs{sZRcs7c?xjk+r8-zhSKL5q=c#BUQOoh}A*&N_@T=PjXrm)pq_hGZIDL
z@Pgj4_hqlB>7kZGG>u`?QVB%$79D<VAQOuqhNGemZ}wRkKv8WZX78Hj&iu}$EPWta
z0f`A%^JN#*NX9gct*(4<KB$R6E%Kyr4jDSp^5mGSZJsC@f_Qjpi41dBJxupucmib3
z>p08DXb8FQV+|l>Oqo!A&BN-3&;DHF5R3>@6rFd#{oM$CkF4`Hg?Cb|+u^47O47h6
zG6P!$-!uR5cq3o^NjsaC+0ZAM{t`~wsF$qtJ2OIy_(_-$IdTstd3zuwnYUku_=|G9
z!M8lHyD^Wn%U3V9{NX`IIC5>#e^8th2GVJOQ8Q3F>Gu@igyu;KpX@BrkzM49m+gD|
zbIdoeT&}n`g@`?B>`Bu1**Co8la4rrCP?IGW!S}vE*WHBcw~qO0#Valao@X0;e$hQ
zzqd%E#&!K5N_>^%<H|0BU;-6h{K~OSzcyryHM@t6!X6Y#0*HqZRKHAuJZ7*w^k`(Y
zsmn?Lu^9J=ef$7VB+bHXOhgZUon1f<vcOScxFY_oZF3F;gFRbU1HOzMC<o`vo^1ds
z67wN6hy3lxl)Q8DCm9z{7@HX7rkx{Z9)Y$nx)|pqcv98T$q}o8%RNLVG9z0s0fyT>
zoH%kh7ZMjX!{RsbT^PqPiH9)_&NqnEyI~Bb63xA9`5wGEmiQTkc~jHK?O)>Ir^u$L
zi^F&9uMr*_e&yc89=6nw%-7+#tc<ieL6pR}SEtc`;mnjd0`Uq<5O}vsQS&YpYVq5(
zreN}?pxg{b9JUX?tdy?FJcNay$5)I>#DSy1L5B8O7O}lxN5O4)F1nbC%sA*5vJbCb
zOa&{UKO=dDzYY1`a_I>+Y_}cb0)fyVW(x{rWLESpHgp|+Pgav5S*;_`k0Ek$V)gR-
z<*8crAz>gmazHO}+b($<Th5agLWPT>TXcYJVJjJ8nV@E)(hvgQVdT$tWK(a4Tvw9P
zM>bEGeF6k>lrP_3i7E|6k1(D_=?u0OHPW0)6Jy3G^|x_wU;dmrA;CMn+aJA!>}ksf
z7%sC({M}pDq5f{Jp~U{~crZp4MaSAz+z9XEgc{|v<6}ukBu&=|b3~y<x`nN?luMB!
z@Pj>dV>a-JNovbdjoJ<)Ep~985pwVt_>W(z8z0w0M6MH{OK$GT6dwT)L%!@%nBdic
zC@|z!aw+wNj!ejHQ2B{BP%<%giF?_3Y>S5k>B6-Z5ECiGv|NRw!d>5q7g<)>RfTlN
zb=N5{uzXRzO~AFwg_y~^7R(xnvSBe0d_kJP$b;N{9!VMt!{SOj4Ysd{&9^04S}AUU
z<uJuy)_K|Fmp#44V}zTe^*a5r?5UTNDf+kUs_t)Q%#C8O_u3bFw{8g0CYp&K3@|gX
zv_8t{Vd}W1sD`g7Nu9T!yw^1QK$#tX1)C(4OJ|k(nzxj`+(k=$B(=2wT`2R@iCH1E
zxfwCEW4b&>mj=vlvlv^a+3K1Rl}4Em;TwMx8|^w?vgl+uWw&g45Jkno$=DCkaerK~
zElbfT8`1J))d?u^d~Voke+_cYYQMVW?Dy~zm{gslg%0=jdQcA2io5wi1H@DgohJ-{
zLPN>UKt(!8!tQiOJ2w3AHEl_U*4Q@m^1DiInYgNNt#^-6;oA!-YD;9Qf>H!Xr}x`j
zr88p=Sy{Y9^T!8oG>5>W)S>^7pi4f{?*<haqiKfC#kNx{ADdP}4@fkhD#o5F>N$Es
zOGHjbA3Z=yM>2v5AE9};+x^QU5hg}2NpEbm0@fmRCB}S$y(0y|vQ3C6Ja0jVWO+6C
z^Li1AFvscc3ma^mIt8f6Jm?#|COo)l6o_1-YU^fQn&~R|XG*q-)BY7)LX86{e=@mQ
zFKtYyH*FI!6Vhgdl}!>0&q}F|xM)L-m8=g-NtU=vq*i|u#am1Wye$=UnWGp{>4+%r
zFlO50tW?nl&&716&UZ6}FJHIZcTdBuN%kJ!zRXGnviI;kJp#Qm=!xt!9I(e)^kMYm
ztVDkB9Psr1M%%r<Lu9AZH68vvJSZzpxI(VFzBBENh~pf+1~^IxyL_%2ndT>`zIyR~
zHE0yTjh$P}HA^3@s*_c(*RMBiu%w?0nhaX9y5zG-b@`4I)PwK(t9|B^rN}DN*Lum7
zphKW(_s0W-`VNmS?G*)V^bL|b&#=2*Ku;n=S~R%+j0MfLr19-N%TL{lUyHdwKln`)
zO^+<0%hKro=G2g{oLC}2rJw3G)<E&?oWQcCr*FcUsH&ZuAWNmSZHSl<xh}f#(z)FE
zE04A4focTtZIJ_n#=2~~xIcS4t-<(k1!u2uBg%})A2>#eMqU4;JI42)P1_FHB<kB6
zD_R)hCe-Am)Pva<M)NINnC8Z@agdEe)Fvo>|AFxm+|RvMr;2&gyENZ$l83NXwLd!8
zh(CTiM-dejAr=x9nrp3*^%<y^)NrJ~N>&O2Iw``Bu&D+YjJWZQnfWz;+TVq04EM&=
z-nZlSIg4#5DMrCKiyhu6>a&WFVjS5&CGoUYkmfx~ZQ2o^$6l2N>U`9DFDBFOWm;xn
z8M#8{<(9#Oy1I1NQ5ZxHI;r*S$3Hil#>blZI~%xy*;-l4e^NgYDbHvuzof?53RNM+
za2CRw{ION@=7@<3)l;u~q}0XHJ@iQ<E2_P-jhv4)3S6AhbZ4-s6oP)0Eu?e0$x+o~
zEERoM$4K}Vn1ANsS`cv$-LbgVYLlquXOozGKYBLQ*I<aaN&dhPVd#_OB_hIT_Zh+`
z#pSA9TA}LPJV{rS`MXyt*`rx@8*b5V!c53+G_Hy(X5TOPajBy-_7sX?lsLzG@Z#b=
z+V}<mZ~?_cJS}vXyu4Ei%?BNTEuzjWx8+$Sv?Z&Jo5P?zuV#S0${$NOo%!9wB~!}i
zDIoS^!I~I70i`p4PyJVVe@Ga|^|OFqOf$4Ku7QqwKiV%H!F~T@oeCgHjJZW0rJ+#l
zLss%&`Sm;^Hl~mNS#QGrHHP)K&4K#HwjH*CH>vB>{xDPTBRtTy+z&i9%QVo0nc-CK
zKP&rWKBl#Bw(_YZ4FpbIfIsJQ>GT-WzQ}SwNwYf()J=Qd;N16S;}sMJU4K%?hN%Kx
ze@%2CB<_1g<#6x@TBT8nZ+iQ^rcv4@Un7n=X7pi<G1}E#)2?j1;JR>)Z(8p+xOTfi
z_&B_M54cv1*=Z${9$ODMdeM$|dLvHddPf^gR~4b%XSb_C5N5;*YiCHuK9l^4(u~%}
zr5c;ODT#TlO>K}eOyb;ZX%IEcfZU9~WtgOx=GfFX&Y+xhc6F$vn$Iw;EU7xCtdVp|
zlVh<(Q*yjLG_|^2oYgX}EWtUVtj;;~5zLI8K-pM)nBQzZ^m9wDF|;fLdl}0h7x~Kr
z%t|s1CttE;G8B(4ylKg5PLqjbo*Vl*PzW#%RM;8_Z++T4YG*4xqqe&pzVzg`BAtHK
zJ+KKqISvInPRifYBZ#avQ2k}LxARdm#OQd^A0hF|E=nG^zg)#G=EPb@IF8@aUZvoE
z+^AJLKQ=T)7jo<SI!O@(x%moaYdA#;KGeJ+<~B+D<?zsBAL;XhMAw7}S=VIecz*}~
z-M6>r(u<#gB~A<J=ehZ3QB`zt`#L`*RSVmer5~NMm@HbSS@k8XZ1zrn_R7mA`kYvA
z>{cONTHL$7soEr;9zn@9J^hM2=1|*hCU9;(3xF#3*r+TK#CJmSmD7USl%mOWKnl7p
z_aIj_`3X<?gU)iereQoLrTEHR1Ygz^Ycl|#KQK=Ckx2#!MbxYIlj>xmiL*n9(uamc
z)2Ia;JgL(LMZS7rKB4O(3>G#zqTs`}xjkt{rxd5a$;6z}-TIVFV~1NBJviSW!CKbw
z5!^I5kE7aS9J;I*EL`UA0pZ0r4>i-3Q|LeNYw#A<sJZ_qU_K}M)E&s<%vb9o69iFC
z&D6_|5!903#WnAkyq5}bt>vH>c+9PKnhIl~b-n2{54j+{YgKNd*Kq8%7~?J84q1KN
zeU=Jr-7%cpGk-?ovP6*xKGm1Wjr_)#`5xADXX-dlNP7qs?zlks&d6h_JzN;2>bqKp
z)>^Ji)>uM3TnBC5G#5M3j!duJMAmqm)pCq<aJclttL+O#OMN%pJV)~O5^}gUZ()T?
zx9I$GW#28brAwO>r02KDCV_zM|3lX|23gi@+jiNuZQJUyZKKPsF59+k+qP}nw*Bfm
z_uO~Sdl5Hc<(_+HW~@JZXXeBhGpm4X=Nw}KUdSPC^%3_B*{*6XW0qfo1k#FSj>q{_
z8ARL9*ayKZ+=}`nUlRExkz!ypBn)5)j7_MEFVRK#Z04tTZn!g>(Q3e|D<5_oV{tp2
z=KPm`yWL=t++A}TzZRPx?RB_i8n`?PZI$#<AdHWPQuf?;U`z8oc)jp!#tU>j%8T=O
zpsn_sFs!ic4i`}0Kt<|jwz?2@jYez!x$x;lsA^CtSE4}U3*{nGPYWl@7v534WRV^8
zl&-wX)%u{0a)2oxQ3LR2`k*Da)UI>5{fki5+r7$S%FxmvVJlF+K#9gjH^<~c+6H3M
zi0UCP1toK^mwdb7FL(%U#n94k<Dl6xwch%oEdP#OcZgXsm=kcGn7jO{;hyPmt5b}=
zoR6olE1ZeHs~#jGBK40Qvu_*v9Pdka0Ble>;P?_X@c9xwK$VA?UqZVkd4V4!j!j!6
znL*$rzClwpc6@WM_3O?x;Lery)D4?9Hv2dZDXbCk)ivUSTf_@D*8`V`FFH1Rcx2k}
z;27a7V2XCOQ1QTl#mXsh^R7y<V3Ic<;hZ^@I6Ge4K1eFAy655z^R2zhU!dyVHu_w&
zW%`jRQmwlWsA^lU;at{b#1RA6PTO}_Ygx}vvj@2ux2PRSuZauds6|mPl?!F-Z*jj!
zGe(#F`fkTM0AFk7P4s#ogf$!JrdP!^tR9=QS;w|Es7c%Sp5j%yt#3OvtwZv#;}vAf
zc4nZ-=Hg9Qdz)?BdB~adTiuo09;&nFZ2u-dv@IKQ|7PR>w6o!DTzlclr8S96D_02J
zCe9$+mCRmTdwt8%RX);{rlXs)vvys3@RZD-<o0A4M+<lCG{F;0nEPApOi<p6!rwvb
z=TDRvkiHW5+F2O2lSNUn(s&O2p?u}R>hG0WA4M_j1KS&g@m(mo?BS%>33stHsvL8!
z7!|df&i=!nzg{+;eYbg#88`d!!^aXgp9NW-#a4TiX50;Iwoi~55TgPk1DM|WMEaWN
z#9n0LtFQM*RS}#3HgK)(WA$x$HHx*!j|doG{LKPk{P83V&@YmMdVio%vtoTMAtH^R
z`u#fv%+Nz(2miPVcHL6K6Qx12;uFn&$6mkz?%XSzNImCS-~i9WXOW|F<2*QLEhhX9
z&r+u6Ss<62vVAyL#k&O0+%6kDc%-dpJzCGd)egKsms-&J%dfCU9O(j^H_P?A-~YHQ
ze?ns0(gjDCddzhq@;X;TU<H`Xk;kz5R+^^gI3RGvj>LV}zGRB=eGWSlwr=N4H>UE=
zqZ%wV=N7qx8MQnA=6R-lQ?e1Hdd7XzdY5QGDwQN=tgCLCz<-z>hb|Gb`^DQOWV|#E
zY4}KAXW;~X1BzU^!5VSd_oDR!)VSrDLFB-NNcPsF&bDdwGfc1;ML#TK6lwk4)pFp2
z`g8GsK`a#Lm#7N+)_bxFd)o)t&xcU8tu1M6$;i<aaVwuioO`X>sFh%a(X3}XgtxwN
znW(b&VwnzQlX+XkTV{oZ3$N~i#)zv_FY)V>$qnG`n0m!vNTXfQK<Z1=fagnQ$JDcS
z;kE}}ZpU>QcIbA}$TNdZPdAAU3jX!-%bRdZ=*t`Y?V~>WJ})TJ=CFSHJJHG|uYkb^
zMCh%F?UHAjNI#S9s3&UV6&=IqCrjJrcK-4w*V~5o+{g=?aZ9zH*)vN;<*z1r;3mZf
zb~W(<eF;R~9OC_b3CJlW1-n#(LFF)*WeTT_Ja*gcy#ZMilx{_dU68?OK5~E$VTiqL
zrLHm~@Jt1bF-02NFCfDkycUSgw-+kHjQ$ziCuHICgertw_pGm>U<J>LNv6N6Bsa*1
z&sO!tC(Sj*B`@eYf*@OBpY1~&-UB%Cka!`5gN&p>h8Rc(w<<Y>bP*A<^24fuf*Ae9
zs)Mk9KA7C7-^*K4_C_i+vMZwl7<HmZADnLihQ2rCeC!6PgT0V+C~6g@xYEYPWau_1
zGYy!Cr-XQjFl#CX(o6O+xb}WFt9|a!d%O6K>~p-N`B4nS)-V0m7abMCWs`%q;6e~?
z*`IG4VPM3#L-}=Gq&8q`&QvG@<ca*%O1{J-SPF?6J1XXa{G~t`5<Df9%zh#ghNe}_
zzO)jGC;80&y%JdHMGb*q2~IaHbGXKoIJ*#qNZiGLgHR;U)G9Zixe{?}L{A~W5_N83
z=dgI?-}*ob@h}s(7?fL~CMCQdD1dHA|KKkv1?h?Y0d`Wv?a3Mw!!C*FdrzEY7jcCj
zrZBV(x`Urm9ojShgKe!qy03D`uu;Vw<(_!!;xiVU82S>+C_H8?S|iGFA?L7MXf!gy
z>;5&;6(O~?uKKbO%1+yvP9(rhWR`INez0{hH_t*GyZ8sI3JX}(5Clxr>Uhz>B+_-=
zUQ{&I&Hl@UCae-9;qMnY{nke;^#pplQSwoAA}$6=6*mzY;hX1QlFZofmf&HG2blc+
z;zq&r`@N$4=`JQP`#^#>$B03rZi*b<y#DHI5<x#bwXcyQQjjj;DzTVo_(3}2y16Li
zin+lvhZCG2X~I!-z9KTZEp`-Z#K_RcvEENa(Vm~*Nk4Ny6#+wDk0P|NHg`aTU35=N
zi|!U?*9e(*mVe2xZL@&Fxm)Pp5whHZ|A>@r9%S`^B4UMCA-0EJ#YGhvdj+@^7-!+L
z2r6<OQqWV%#+RjvmK|}B7gPID|6wRiMa!v;1DZ@IoDp=z5FxMb5gfBeFRt*x7?Vh;
zuJBV$T&xiu4ZIw4bCGogiXyk^v-<<&QEn-aYdJ{#2dju;eK!B1XKqZ!vfv^w*PE|2
z$+<T94);lMYxrv{xIhJVU+WN@Hy?XYc#J`-6nmI0A=)<i4x=<--bL&cTb9b?rs57n
zM`3FA<{L&wu?wYi%(<`7gHD2iFC27?FR%8l-L&k3K!eIVtV-#sNDH+yfl2{p6Iy4>
z!ZM<OjdTjahIUF$fpB+#LIG{|f=Kzw0C6c|!D8VWq-=0WxEc96A9a-b6PW_Dx(Ic;
z{M#>DLkO>mbWZZEC(mP{??LxL-rZE>NF21C45TAV3EX84e>@(xk(<=?s#ZWU8mG+#
zduDS#APW~H$i;(xbw5}=>(|6BuzoEWFcmjO&8#A7lgn7IlPn1PMJdEEcj9hKF=WPr
zQXpNa$CM(@lzW}chUg{@BH9vlhHa@uuT^#^2fZ8%*>Mj}83zxTTj|jqhi$mIbrulL
zA@1~2nd@Iz=0fqg3G5P4dd>CiR;8b&@Y6)r^*@VPXV=Q58=}mSDxsE{IF)I=%1x@#
zHF->iQs5nlz8EY%3@MVl8-S(zFlA<lEj5JQZzIT%n9Wf3uM3Y7wxMciJ#S5R+(VBU
z;t?cgABw6nuBZo|e%)~r>5?TZW1Jgcg<g)*Tfl*I;A9OA7)aw!&LfMsruC}HLb+_r
z$E}pmaPOOeQSspDH5M~nJZ}Jk@oest9ILSJpUPa!0nIvKk-AwAD^25+xV-68OlPW%
zGa;Y5fg18mZ?3F3z%}LCyHCSk>|v0ujzgKL>LKUxrXG_BA85C+<f%3VJdTZ$ckY3U
zmZwu4Lz--SatK?*`=urjQ5*$O8KV-o#c*x;-&w@A1~!H$bfAv<Z7$q}-GmI-F@rPG
z`rshGzA^lA{U=6w=Qy;fuwKLZDrV5NC^hZBFc=+!iUEeg6a8Cz8o1;-6}*x=KF8mL
z@$a3K|5uhe{S*@xs!NuSDz~g+^K>vvR$xtkJ+hN~RxnSN@Bm=AxH~n;Wh_v(i_Szf
z%|=>NP5Y*>S@;!#RV>01s(2u4=(f9dQZNeLxM!ZxYpF-v1;qFFQU{9pZYVBchj5h~
z8|?F2jaIJ6@}rr;6`jf$i!lsxCcUq-#&SUTLvCGZFr5VKNNfu*tHcIywgfi`8(z)K
zvXB$q{3qh6SLokvp*CH@O}bk`K%z6#rlN4$kcqw{bwTX9q=X*M8dn{V=3~bjcYA{P
zF102TAiFVA)BRNmt-AOYBQ&YIiy*Ts9{TNiv?P};f9b4e{o-SwmGjpa_Jdy;ci4pt
zhv*+Cuh6t^yg|C$WIJ%vWZ+rTa>uU;2}7snV?8wWHLe@>+kZ1!CUIjSWQF(Ak*D6^
z)u9R@WEV0>FN(lr&C*aA)BL|Bn8)2)36%z#0AdjmH|uXeXY4s<!hTSrm`F;~zMQ~}
z7G8+%h*UQNCal*dGI6xRbo-E7vzf%1VH6R32ifQ-S<pu2(CTGI@xCJ)6@R6qMJege
z5^A;NRon-pg{NvJl<kFEPudO}+feqn1cX#ViTtT|NAR<Hm6!)?{gGq$Lynm`4|gd&
z_38#FVu<V@RN{kcl!mhq-FLx5;dVSip=^J4(|cHp-fiM9T;7Vn)1{cJ*ipoPQVS#r
z|CwTlJ!NFv#Jr<VE<>~ku@sj@+I)V=AeiPr+_d4penpMQx+Yk>XG-Bl8`b&%VdU=q
zZ8mKqw|<Yte5XYke`~{t_U+4?MP=Kp3Z^KQm*f&zGm-wQ+6`&9jt!#9MRDeWC3oCH
zq<Yzp&9zc()1rS!2gKc#=f!6^+_009_v~?3su~Z?1?Z)WEyQM)TECtRX#3W955b1w
zV?YyA)_r`()kghe(>-47*%)F`QxLc#QD{U{J>gLWLAg|`UsHPF);!i-o1ISKv_v}6
z{!V{V>hK~*8DaeHKqywTq1u;<5=X(KT6{Vr|DF!hD~?0b6r!286JTwr7$?Wdb*~3v
z>u$go345W(7m3E&<9r^cwuyJr*H1Hhgj0ZVzDCnXUt5Wiuq~HJ_R>|~bAq(j1X*7v
zXE{nso<v2-k>J@pi;a9wt&=Z1uJsBAQF;H832`xOg@mMRxN)xTj)b~?WFNW&0nRMa
zhe03G<{%7HSeV9nYQ4e;9jj_Jra@v7aVUP|m~h#PU5hIUQ(PfVEOO;gr66YGtU-6L
z9Xw*7#)`OU&=(PGcOP+hpEvXx94Mb2vb$pVFS}UqDLo?&FH-V9LZqmF<S%+EY;Hk6
zI^rUUaroNan|fP&E+kANOvwWL!<LBN18WemjiT6N)35kul7{CdUzshZnZ<R4Hdih|
zxa-N8^>rBQ`=<b}t*x2ubu`?EEztQ+=N{_o%$gxC_^n4+zv_;D_|E72EiON$A)u3|
zDB?s0%yO4u1I_Dx_K|n+sOPADvJRwMlxroe(@gO*eN?a0%;0VJ<NfF@ke6oXTza=`
zgs^Az-Dg^|#Tq3eH(lhzj&UJJN)vZo)W;600yonk&7$ztsRFk<h2m0)Gu<6TUYnsm
zwu36*of123BS}@^8f!Dk@7_a>@?>rm6`FHksHbfu&$@rLU3By3()Gxo)_=;j0bGlW
z+*$i+Y)#H=wBu;FIrF1k%bZ+og79>@>xVe=Nj-H*LO<b7+;+i*cjEOxUI*9Ax&t@4
zME5#fi`uTZgGRZ^_Ssz*+s?T|b`{)lT${09^SJL<g>QY2{xXyQ)@7jBo<xB$01*oh
zV#CF!!Ti*PjCt}BExZ<A&mgn92Qo|76<^l^Y<^}l2-qg*e<xdb`T~mVPz}MTLL}1i
z=T*A2UIbTM08XhS?Nc;IJSZ8hk&yPyH0Q*Y%d}Nv>6c#w%q~%Ri5ojs;>u9f{x<gc
zn;oJZ1IU^B;S$@`RR!=UXjrLw9kmQ2uRk|HYW{kj-g7`Pbv-t7dKg2>#Dp?}v{V6)
z#xh&bWmda6bvxIZm+Itx-%^bh9$A0ai8q}vbOTM)3y9<r6pL?&k}@Cae&Xdii{51#
zp*4Zzp9Es*uQi*Of)-ZV_$Kr<7Q3zE7;lO}cc&SCFIkvH<sV;iJ=XWb0NJ$)eZNr=
zxsV|`AjSaD0d;l2{f8IDaOW9t$2%nc(l7w>648-GcUXe?t5X9~VPQ^BVce%IDX`A`
z#}rEnPBRB7sWuj{Xe9irLM5Qu2>DmB{I_l+=0??$Ppr9>i&`a6bg83$k_H@V*`t2y
zS^|3;MulQ}KWZb$h2nZoySXNNRg=G>x%-RC<*((1DDnkbQ@QrMvaJY!N0o})r@o(}
zyp{z|y-()47gbw9{tN9lxQ@TJiedY1&pz43JJHC>1#N@e@OY&ULC)wsbZ`g?^C^!h
zslr`A#)!g*-9;pZluKyhzae&!ourkAV1%yU@syJ)zl8s+au(HD-qVqfH+?536mp^l
zywTUL66q=71rj?V7L>*JR?7JLaH23SoXTlt!bC2R<+Q#L|CK+EsmqWYvnQY!HxX0k
zl^na{P)M3avY;XSllo(Ua!`yH7EtRF|7nd#Ac<T*8!w<%{YW3XYZ`&okkLsNk#LZI
zfYmVc+6H6l{kjPVLJ{G3!yuYe__c-8tUP4|u+>(TLcD#$t%}ywtnjjx-uG;LQje4@
zXan?pWqhzLd|f6@sY~8;b|q$s(hhu9WIGyL0HRuWk>i@-!B6w*Q+5X+Jh6WjHL>qv
zup^d0aUrZTK-}!>9G89IOTx)m_~&aRp)ae<i6p9s;U`khkFsWg$=+pj7#2kW%N)y_
z1RQRyutYi=dK@<&=K2W;l$Mya_$m^YcKhx;yVY%haP93die#nU50g@H(umsAwWpDD
z88=d0X+64LX+i$v3K1sIl$X8~rWtN3{M?~}+-<{IjiQL0Zz<ex6qZUA5iNMA-ALD~
zLt&xfBEp8tp8foT!QJnVcmc0UY5|3l;3hs}2z%Sp2^Ac`4s~$sDG}6G4qg1)EOAlg
zt~6)(#_jU2)S5r#e?{)S0l0KS{ws|Cf5Z9vj<S+kIrCZhmt~%iZ}FgotwC>`W;0rI
zIp^a3T>_X7(wH@DKFXWWu#QkLbL(dOTOe>{?s^q%a6_f<yLOMBDJ5QF8V~r~<+y&y
z3q&<4Jdj)q`!$-M=usuvb3GoIG9@NEijR`)m0mC=i#EGdkM1uboxhS7@#vL5A*9cQ
zCltJg$IkGW#lAzO7rSc$-`Jkys&_AWd%k!F-aP^FZclC7=pc??;_R~MK$71S>>}x4
zmfz>>@}~oA-X~l}OnPlRow%<RZ$z`f=-xX3J<Dd^Kl(1m;Q@4u$PcMV%HAZx-?|v{
zBIzXmJ}DzNzfgvHb&VN>REN3rs48<Gl#>>{l!do;VHzY>C#jv6)9Ku^z-xNK4C3k%
z)lM%9W!yEw>%M7(U3*jxTz4&TJ~YmzdSw2U(KX2&UKUneT2@w_bgr+8x<=I|(q+?j
z->z)C>bh#%?dob1^#uC6@7a7#`gS!V{rou3^Rw!@+W$_!gN`8>gC=x?RuWKb@v6jC
zLAsJf4vP7qVnpA;V#d$AD~G3y{haC%v{vU8krIVpfXyoQ2@>&zE$;?4(G|oIdAH*e
z41}}$$+TRzZOh%F(7}ocsG|<)fr}$GfNtD-%;B6(lzYtQD9&cPLRBZ)1Fe;yf=&`$
zs^X3X<^XY}yT3+}MI|nbq63*wl_s-m@r?rtLO65CRUa0aH?0QGojqUD@Ai5w?YjGM
zgt2FT59Khtbp{`LUu))VyQ@{5pgr3;qt;GJM2WeAh_2L@peF*0?vdIhqcSHd>4=As
zZxz(+9dhGzjO_TB=T%8DKE({w*6{EBc9GsYS4&4Y*Ru)rwCxyxc<~#+{!rf&jvXSO
z6Q)s*K6L_&`LWcj$vE0wr3wE(vrTU95?Q8TOPo~Un()+=^i0%aA=-u<e4BpeJ;;C7
znUDBY<ae13a*9WO@0mM1c9)&p<}<p{J8p1M*X_&_8vy4EX)jKf8T}F)4(gk6&v{pB
z&E_-m#T^d}-rG@cao4NuS~EQDD{3!Z*I>zgr_X2?w$we%V9xcQihXwwtoI~Chi%A<
zJ<U*0kMbMqZ436^XVjw?)|kDGfa*8aebjB#jmve3F$b=!o6Di_E*`?oW>pu@>rjoZ
z{k*Dce2Ou_ywd9$Q`tkAuKWUOzBmbUV0Ywlw9<k;1ckCVOd>2p^Ok}ld&Z%>kpUGE
zXCc&qVsp*<TAi-SRU~`iZ$!(<DvgOHOT-O;SwF6t0$w{OmV?pD98*qz77+MlVMK&J
z_q_8hO|84dk0@WrGg5|v6PjI>t-Hw7wIth6Aic5yvl@{-4R-Qdcn_*uE-C#1rG+y)
zPu|tA{{gbL@)9kRB|Ks<)us)ksY&WA3z-4}iwDTWgJ%*TykY+CvcaE!rcrwG6eYap
zS$NX+dFsm6_qis7zWoI3_w4Rt-zG^pdWSiB{R(RA^4@{jMp-#&hqQUG>LuXgS&hD_
z*X<$c{weT2tkezQ?}cRi7GIOVhcW)DSc92p@lze3YTJWHRj;@5c&*GmL*2W3M2$m>
z3teo2mRW`LNS7Bfnu*&9z2Ct%>Y+Z%OT)h@Wau7CN2nZbZ4cwzLWjFuI6JcjI}PK-
z8Hnh+DzT@#ob>LRut=vL3YR(oo|orBPYw9x+<~<2x&%EB4-qcI*;C-63o&!0zD{rN
zh#ks6a37YjKMZp{f9iFVtqBWiVxW$?%`yvMWBNYjx{59&lH34#ou(P`++6tVkjK@t
z$|a{Hu;FyANk{uqY!Zw`+&YO$1huicxxT4dRh3L3R&_^Ya|SX)7%gJqX%@eNSZHV^
z01)a`hQ61X!7s&;Gb7dob)3P#)smtXWs9H|uZ#K?g`4KqVb=iJ+OB-y${?j;`k_c+
znDGbuCQ5$#L#_C43|wx(KUg@?5OKufu+zA#BKW8phyH8OT~+?;XP;Tw{9xTcrEWZ_
zFL<?2jG2C2Ot<&(KC7?0ndxkh&(B2tm~P6A{c3>c*LwYyZd&f0YPkGQ82z?x1nz4a
zK)RRoUL9{L_H!E`-PiRvKT|O8xAp$*uPD<e=fS(L^xDL4)QjWmAi>X0yRdFLndj$z
z)eq-A+Hbv&4R5xuOFY_*ulFCkExP>lcZ}%)9@W}A9_r?2bcnv!+u9d|L4kK3`gt}n
zsl02McUa0{HZ6)27XIY|k&4Qm2bNvs(_G-viBj}*IclwpvkAn~smQov8(8D4snqS!
zNq3#hv)ltbYf}LnwSDH*?)M(&4~VUH7qI3X&2RY|8u(-SchWaU$)PuH+Pgzep*O_e
zTe`rjFSOj^??32!x)AZ7<$6ipEEBiYzJp(lHGSQ%tZ&QxsNd-|o817g@6Npp->B?Y
z+mK|R>pMS5$op%b`>##5E*WRlg8Sk?E<U!7!$odVRc^$7{vX1HGUR~U5W7suMVj3#
z&bz6&6_S;1rAx&N?L)5v<Le3z;(M=9X#9w^w~SLR+|sXqLywqv!Kg^8d>s)RX)hq1
z%I<I-cL{FZqxomNkttuI1(d(-O0K@qHQxD1F6~f3-@9|F-Vt%{yg}kWbo+mQ%id&s
zbIoCH_alD0s)--6eBtdleoyb-%g28K@QGWoS21~ISbvLsW5X1qacbjt#<+C2U^VT$
za^&X)$imj_=X06)k$NIYS`Lg6I4g7zuuV^7Xf>p!QZhkZ#v32~3I!VF-yjpsbwtz+
z<UxGxLYm9K#*e+`A`ne>M118P^0d|3gJ7qSKVM((5%zp1d%XO)vA#-x+$RPDUXCNj
zUju+=0RlbO6CVQ<RAHx!pK=3F%wH7fryjnZ-zxx92c~Ub)~`;p9-wRBjvE2~z<niN
zgqwa7UpX~oMMBbCNox>s`MouNAVTd=h))`U^D}m^<(6?YHBg!qe#kde_<k)0;q#Hw
z+s}=|euj?uJ?o9K8DDT|x~qo64}<hZ@rjUR3axdQ3GpJ((JE}{Xi03@%%K;Jf^e`=
z+WmhLI=794?J6Q$U}L`EO20gFDA9oydoW92v-n}ikxC#?fL0eK9dlfB02-i}1EzdM
zX4q!XLBY~`UicMLa7<zD0j+jY`88cQW?*%o8j7pB65HCC939cl&Z-s`n-x^Ie`{}Q
zJ2{$(b%7>A;kX)1|1BO!zVszQcQG0BbxvCHt^YOw-6G2q{vM6vtr_ukp7OTaf!UDR
z+{U}`1=xXs4&c{=Hv$2TH`<oo^ulX^h7P3l)t}*^$94n7^&#*D)3?`yo`B>Ab^tWg
zx7*QILvR6R1s&>7>JeJOO@R&ulI^SQ`Fr+;VarI5^yAL8_E@sxr8w*ZUFV3Y1t`Wl
zZN$?p2c&2!(LX58;`~%NZsW|$K1PWupzWdEttFhGOF?&MRe90E6l~(njw1|ANCC<h
zqaiu&k@I`NMi-Lf1-rsG%>v?q&^Y2(^_%6GiP~p3KH_H@TIG<7wljlOGSNx}LP1})
zJ!ulKR=8ulI$VM9-zZAxa}kgs66YI3t5)}!bqI7aj|%ZNmpQl>%1lrkL3Cxsm9?Op
z9OK}zZJfB3*EGO6p{a$7h-1fO72k+3#JJV}0dnwG#dsgTtrN2?CjCRL`8lnA(i#DE
z|46OKbQ0@+92cJJtiN%<Sp=yrzD5MWBF!W->@^8SyTWn)e`d&T5F=na01W}h^$qku
zCcrC*)zx4m0jv9tdd_QTVxX=;mki^3uvWNlP@ljpht`2KZ>oA!uyI#{;J}`CK6=_)
z2yKy7!FUH)e1TrvcJQr>?wWe^H*jX`8xn!)lk$Z|<*IyuW<}^h<X6OGDeaUGcfM<D
zZ(9+gBd5`LSZU|LX=qPZUi!QpEV+dvY}1B@s!c6FeuM)vtCyhRe)EqIHQWa=h{!gx
z><}~Dr(<UQk}%vS!Nl^;uf4Uw#QM&yy@ia7RQ(wSb@vmmp)2us_H%o|H}&~v5lQ(>
z`;C5|t++Tt3=Ls(u+q+Uz0ZB8*4_@9Dz{hsvte3#oOZLbf{IImXzRhX^<pXE!$0t=
z%s@5zQ8L4U=Ki4v*7n1g;Yoqu@&BVIR>Lg?tKy^HOPzvL0Uqw3s3%;*XbHXKL(^-y
zf?EL->@U5mR>SM)3B-<J39hT~s#U{~0ms^YTYH-&hFb(DKt{yPIp^%%T5u}Ea^(`p
z7BD!DRdfhi4&&ivEgh<LL>;MRTme%_Y@S_-X<`lG<QJf4A_n0E;9Nsx1ZoqM*4rh=
zwSsd7?9Sh>C;JaQtaodMpd?c;5j03j^1@Q;Sww|wO%ch}u`j<`c2cXVb~&tNasq{_
zQB!5Gy%0XRSqpH>gELl@1yp=U7nY*y#(R-{7o$AfRY}S?n;&J_6lFO{3@47eBAg7)
zwf;9iVN5+>QjiLwreM{;qpi*!NDFD~b-iTayaeHYyZPiZgtJjHug;bE+5U_Rvq0j!
zSAhjP@M2I~U|BnI<T%(OjEvZ2z}LZ`y$Ca$>}i~D0w<{0K%M?@y*WE-=$IbpL11`+
zV1CiPg1y7LyE{U0$)z>)>@ZnyGGwW#0O$Tp;@VRLj<3iaSQ%i!e)r<ms6DGYzgyrv
zK&wD>g%Gp?+I9@2pu2ofDcAia<sfL|p;3V6`Q*~(Qxgvb{rh7BG3<cN!~%xD7M>1b
z8s%(52{-}d#sRUE?!eIM2p-LKT4Zi_1v2(|Jpgxmv=FZ4@Kx#<rhyqvj>29<0b>y`
z9f{=zT%sKBWCwcOnKbgd6VYgtJfPzuP#IN5%1Y2#Lt$#|Z-)Pt99x+&^y0V#|CODL
zVMj_5_keH`+knUx<A&&#`~aGa7${>QF*ekFbuQ|U!v1%xj%Z%rh%-VeSZ?kg>AV9T
zntvnUnoSBUdqbhryGRUd!H=f}HMGNt7^F(T^1_+oht-3*0sgf^iWoL&t7uEL0CyE&
z+^ao9+Ja>bbLH#R+euITf;$1-1xE+M=abnBXC}w~%NrODQ4sI9^9}u*zi7?x8**c?
zX#L_Hhzl%ke`jFXz06)&JKG!NsGPf!9W!h!ZY-IhKSz2=E9E_wvMUmWc2DBUyT20I
zcPXBQ5A?x4BM*0%yoqL<_9Ma8(!dVGq-*Oyg$s8nTcoL@OdK7U=`4m1LSBXs4#KRy
ze~Vo|AqGE~S7gyTs4vFfXNe<{^@Abu1!NO{MX-v@bvOPL)VZcU=7=Z0`^+qaxQQ3)
z>aJf{ZX{XC_cFYQ&~8LZyg$9Z4sq-zTjG(ecn7Mzsvc-dHl6v3w9MQlAbKH#S^MVC
z-$AK!u8OO4fO!k}bp?x|Z%>X;6d0$cLynOJSJ(rU%j`mA<O?TA%Z_T_9~uLw8_a#<
zFaqTrp!7m^&|eUPcbWSu3GR>HrJQR88f75N@4{O35@@F!`{Nnu6&fXhIy)+Q6a>tR
z#k>lG!ty+CyJj6&8d9*%m0P?~0Xip<`t>Srq965BcR~QK43<y{>46{*w+t>d7gUa8
z0lrQ!GRLU|q5-ba2Ou|zo_GN=C|IMvMGk8(ylDU}Q(w3Qtpauv(Bk*z&f`pFP3qYC
zZyr78l4qFX96S|2*C||%>Dj181e@>a35O?P=SwaUPrcatjL+{uSD6#qv;AH@xJ{U?
z86J4>O(^wT0y(O`c+7B{a5REMIg%#;C%BjpJc4ivx_nZ1-{2FFk^UUHqWX3x3}@%V
z`i7>AmJrf`m$|35><`SRzN@y}55O7FJP`kEU#7GfaFgw~u2VN+ux~-TLJseSS;@-y
zxC%~tlD3~270@$Nqi#W7ZS&Jmua=%sJxf!g5*o0cr8C-D@xp;qyHQ~{v)Kw=dP3bG
zq(Z;nIPO}jB9Q(Tm=b)NaU}^_y@r^_IjKOeA#ldVAi^?&2L}>;(|XWu(9NdqX&g->
ztDbC--Cjke7VWx>(zfn(x)f2QR$dR+@H-5Gk+7lvN$@rZq;5jvV}`%BrYTaFCw=zC
z;sT=HsJd$1(}QMWSH-4$)z?~UR}~@==yGoWfM?=Y95+8EB<YAtlibJTCR_p})8Zhw
zMY`x0Lp?zbRlF4r9lyZ|{V~-=<P|qaZ=D$A_lRpHmQ38R?WX@B+WeQ3@ekpKDB<74
z8!f7zWlr-X;ihrm4l1e~h#Cv1F6BP}r3Zb;uV4yM5R~Lc@j$31Nast`fW486QXr)w
zcszrtKx~m~bE15L=LT~H(JA0Rl+J8w>C>7Ud81&;L=9&Z2$QSLtanieV2F1C-3jIX
z`#ZYh`B!z>%2x39s{3(3%r9{<eBXeWd3V0xtpdof9KsxM@-TeqSVA>ZKP3=k`BQ1m
zF@S=AJU<+G<N|UvIcoBp9Pqr4<%ul_-}nq*ueaBY<M!vE=c!eu`tb@@CX1yv`0InK
zzTAz?7Yb)MnM1FMID5Dn$W}1*#SKBJZ1<E@dp@%MJ;^2fXR0OUXA38bD+VX$E4B*N
ztLTf<4J1o}D_KkRtLclzjd)ARD~czbE3>CRSJfA4R~$~<&u~u`SFTRH&w%YI?(z~#
zf@KvZ3Qan37jEj1rzoYhT@?$$+2oGPWa6EVhXn+0cXNtwkaJR=X$?}@B$W%QaXO2t
zNlT|p1y)L4lDfifs@XKaTZ;JSrQ)|TN4Kg4zI6l?DuYz@e1#?`M&4!S9T%}O!a9^o
zV4u5yMBjd>U}k%Xb}<9E!QcVNQ;5Cv!o<Yx(77y>l*ouos06ilw6ZeKs5~4zn6bQ3
zOAXm2X->Me(CRZT-m{x?4NvoXD#c(>SbM*8Va`1{I*xl!irJOgidT?g^XeS6%&M_N
zaKb{Pm0?(YhRR4qz_CLy08I?ad#u>WZ{WR9T!Iemjog-m^c0uW_0XPbTBhEyh?Xuy
zzz;s{{^N<<<(B#H4(uKg2<-l$u(vXCh9HxI1x@_ZO7h}n0%;r3qOH&~H#8|XJoB?p
z(^9xSQcswNndM$FPwk0?<$gd<PwFMM9t}@H%Xzjwf=?Lse4B}}6B{EpPf6qXW&_$!
z>58T=<0Yl-G{@QPKHR14LC}-+THiOW6**6L*03?d2b@)4PckbEa%FZ`k|LFgv{6Nx
z8<+UOA?GvQn&p?oF@(8z;e+JQ#4pAiH^(n2?>{Wm)dYO%ElB3p7&@?~hol;<sX=V!
z-OUR%i9!Ai=Sa*ye>ZDI;0UzkW3z6$*)hq+J4l#ivlhYr=tj3})5C0b`zmY4)n8?z
zz@Mv<l=Z`Qw9g3xXZh8zr&HL0?AqaOLu2sW9#wbau_+&YCa0o?S1otwQLBVOhD{;6
zDKrM`#^L{?Ru0)ts2H*vmos43FaC6!Ll0ZB{LIAcXV8rNnf)XJMRU7EZlrtjCxUL_
z`K7Mq8GhBUpjx8DF%kNuZNS!&TK$YxrRfS~C6b5q#%^><-d@ZKxGAyC4*3xeg-Y!i
z^5Bu<?kymXS5zn4(Ag}fN3<{(8|pZ9$(an->lfG~+<wg$0`@Fi-}759d!aY7$z$}c
z^Cx}Avg}ayTj`7DH@D=htRd*<U*oy%0n9U#+M~DCibOBi^PKGQw$tO<;YX;I__sjI
z3@?Ot;crN;d|krC+3Fa|6IBV6$MS-+H&v40FUQf!ZJ{+**|NfIYL<DM*tN6mxT`sv
z<hE1ixFb(dH~w#0v+d^sUnMW4Z{LRiujCy^v^l!CUy3d|TTps&aT>K@y!&*}_>QSg
zxNfB{0UgoEC4HJK$}5zVKBj00{0;fw_-^SxtsWeIO$!*_iWo3tNggN!bn#anEsKw-
z8By?71?5J@xR!c0_^FzHRm5P7VcuVxWz!&FxRo2}iAL}&Aq@oweDT2}{<g5N?r`Zr
zt>3iz0B;MDb^<%u)agX!Lmhb&)odtr7k>O+nQ~gk=z476mSbt*=ah-O;`3rBaPWz^
z#L^Dno{zz|Azu#Ai+H`JpYl=*-o6xX)wda6njJacxRQ^2__E%Bnh#{5W!{5mZ%ph(
zeBtwN+aY1!MsZ(+^QYeiD39Lt=AfzSFp&3{W3@g6Ss*Zf)Mx|&+kMBRVL~ekb31a{
zw7k-C>GqA1X-1+HwQmW4!H`Q*Ocr6>N-Y*RgT&&AO3myG@TzTa{CPA?ozlDazp1{Z
zRcrR?CVNdz?M71_YNGK?V4X^*$gbgEj`Y&c{Of#odO6gjXM#l`A|$Wc;h|cnMngDK
zdhI5-7aI>w15<kJHn1ZQt0>m4@6q-UqM#b@@&ZptwNx7J>H=G&9kdZ>X{*h<yPM=3
z?N%#VTRKWxTP|j_w6<oow4O|9X+>W{1^ejGO46Nx=27<6c~5@;Bv-%#t=ixxC|vL}
z?Tv@M3P(94z4%wE`6X@s`8VbA%-xv6_x~vlDL3Vf(g-OyrGLm(W?-!|YqQ&@s?|6s
z=|$w*!hS=V=Do{ND|pzeuBDWs6q4qYUdPMV$Va<)*n^J0?J^CaN;`YF3T5(iaxdWo
zNyLK6#F&h7%LuSIg3N6(?dAIAaHOF{n3+;$mh?p2{XsUNRUQ~u=vVYiE}>zUwswr2
zF}W{*{F5)416GoQG%h-Fn}7vz#2FS66`&srs0BSo%}l9Xp`}T>b6Xb{W>n1eO-VLQ
zTg1(+TGY*D54m8P#k8TDA)P7$p&hkP5pfX(UQ;kxI_wW2Q7D&pK3>V*5E5c`P4#;1
z_o-<vmzKsIlHzCgUCM|nvt@yb^Vh%fnm!u?UV$gIrv|cQGa?(~bz!;hml56CDNCqo
zaMvI@fTAI>{Yn9|`w4wJzDRR9&;D!eW4n4r{pkA9RcIwYm)a>2@0~<Y2GNeN{0$tn
zh5HC{m!F=2aYn!D-wb-Ui_YbG!^G`@7lh+BISCaG60I4S0h5IBtR0(yJ1^}Ry`gVH
zU$`)&5W|nGnx-C7)RXf?&CaPps9$4zMwW~373&_x&Co$O)q2?Zke_Sw{OZYywsy}A
zXd0yBb*3ifqs8<1VtPYGlkBdPdp0k<RlPttR@x=VLCXSu1YQzV^?lY0>B&u@utnuX
za{*3fXRN`NKe}{%LEg$DvYC!;J|0<jIJo4vd*a?8x4}c6m&xwIhpHdn6&bz{)au_S
zb`-(yrAIu3&JP*MA_T;Wd<$YQHFv>e!yH14jU)oZip~v!K-W(RnGF(8F?Rv2hmL0$
zrUw~^R=iEy<q(3Nuj#)*j6&BLVhh4}*`i14#xQ0;H?Ak{|D9y0Huw-kGNGp?0ou!W
zly5&%;}_wpN>^=^j?ULdzEr0;z$(IE|Hn2Km&>~x*sb*MQc{HXhT(8buuH!&F=i8f
ze+>#~KWhN=b$*dPmpO*hjEN`KWa-A-4Xrh+hg{t7R6a<rt6L0<^yYZ|;^Es%-&M8H
z@dc{Yo8`Re7DN|Yp-d{5x#B_88ggqstMFBcbl{J=^P@KBvvywQ1tbnqQ$>Aimc}3u
z=jFtD@>Inj3^-Ri91;5BS~6fja_W<ioVb)qA`~@s>TPBZ8;j8)vEh|IeZcq>kJSt&
z%N%L$BkkWOU%!UVtQqJM^5|@Wimj;3HThNLEc<=^ef_+ZlWQCtb7_;gtiEVk(S$&P
zYC?SR(r+V_DXwEm^N<IIDc4Nhz8A)E7cwqW<4{2qsQa^*L(J7KpX741f{|AB#z8p#
zbI=`@bg&_C$aEeylb8#rt7>7cTgECRe-`mbxhmUo64`q|KclxwJ=7B?ys3|&7RMHc
z<kwv|KdRH$?WiM$KepzYh*Qq>l93UL7NStN_}vZi_>N2`_Dz||#%OESnoxqI!;hh0
zv`(x@ip-H<deT`?wI~EPAIk64UPNH0hQh$J$6TVm#1_~l>=l>;IuwWi+QeKTu85~m
z+lDnr?bw?o_iWBN19m6ZvyZLXtLeeKqWW4LWC7wO1c$%hAMao}eQ<yeI&_d@+c`lU
zObd`_?F%F1wZ-y(VPn5K*d9#x#`1xQ{!8f?iPxC_&o0r?dEhScZt5)2&5x1+wp?hu
zc-lAMFnzqgLH-5tu({2<=x-QZ!ruMQ=%z0S(U@LCib3%yrtE=eFva5EAHRpDFe;cc
z1~L2bT!w9N-C?}<YIX^u5We(Yu+SoVNb(0L(H*H5Q+lL^>Lx6t3>qU2SEPp^FHj93
z&kZUDu2_s~e21i1m(&ua>5c1AhP0Z7N=(ipL7Vzbjqos}FWmDL!<gC%u=6z;v3TM(
zPZG`1J?CIVx)(;#V?Z&@3L+c}4u{$l2GnHTHq~_3tS#{`Sy>ah*jVFIYXdW^I^?VL
zEh(BAn&R-7w}|1`oDxJaY~n?+Y?8^)*GK0|KJscixyN0K<={K@yM(^AG9{^Lujtq@
zsFL5%#%^1@%`O`vp=-|(5{s$5(}`F*+jNM>7ZHz*jg55p-Da_{1n(YY=RET8+7P=-
zM=lLixO^9B$IZ#=*2F8EI8@rX%e8$MWsDmY)h-tf9&888m%K2RMH3sk*?N<cT_KgK
zG<>&nKtt9+SQa^Stq*nbf^)J+J`f2f*}ITX;beh8CXSY1b^))7fnpIeZ+C!QcQgf<
zPklxbdx$)ls>rsNt1b_qJmmaQ4@#f)FwD0j#_x0?CIg7~Qzao(wIUkrKDL!Pzpmq4
zzOFwQKekgx_lnI%_nJ-O2BT%k$ZXNGw37N`4uoJo<Kx*MBxr|syAJNKuVkuvcB2lA
zV4I1HZB1h{#&YHDg<%`x=h=Z@o+B!YNl{Kp8zvg8PEi80!ro=(6;B_QBfpM(-Wh$4
zca7#xY{;^c?P1BT3T|V#X14DiM7ycDO@*{$vth>|-`<1X#`C(@Pi+W4FY)zta}xvr
z_O6ut0b>A?qySl}5-BsNgbxz-fO3aZ17zZ)HS#6Q^Un}C8eiZA$IMu!{M4-qey)|Z
z7d;3Yq>Oe&;GofnElg%b%KSOmF%NlJocx8|QCYs+?b!)cqYzpI>@0k-Dm3cN&Fha4
zIPyzsU_c=0nci^9LY!mDlPV(e<MK^qiKZ9x1XdP`W68>8ndk{kEM)Vk%G70d`_l;5
z8;x-qH77$x78{&yg}a1h9yCivc@H+?w)f7UabKf}aFzgXI2MLud1uxp!bU(Z?Z%K7
zt-Eey#9}iw+DjkUMIP;>NDw;zc1t|CRbJw(@!S*EskfW_mY*DWAuAZMuGD6!+*}H=
zoLx(#84GyNY^F*lbYF0~Xj!_t46$5XBSBrXrm{&+A#`taDsOP&BC3<NNLEs6XXwyY
z2)meHgPB{y2^(>$)NajNyZr!7JybC2UaIO^x@r%(m|07tE7K;~s`3cKo>@C>aOxH@
zDqgDkEkCp&zg6`+3|nbkzj^6OO32CVGA`Ww8PX;>gD|+kiO%%WSk#EdQ}8k&Z|(8$
zQbFNhO{0BEqa6fcHNR1krc67fSyDRo-1Krn$U-M^$zyO9vss#Ijfo0%r3i&(otcLz
z({ertye9S5VdN--Wbuf6G4>6@LrjC*HukUBj{a#xPrW@!l>MJosu?n8v=<+4$sJ4A
z&K{UMec$X+6OgYWc6Lgc!t|c^1TtXW(g_rH*;QhC*;nPARCc&wcAJb7zAN9BRlwr`
zPs$sgDsEA25N#&kNk>^o>>_vV9k)$!-{QSV?0uTsOc1Bg>|XhfXN@jk@oQ=Ft#l%9
zo2ZXYj=Sfhk?nN34mQ!RE$ml!hlA_M*zSKTNMZjP{9kAOZ?8EXs77sJ)mc!rvZ9z^
z>x+E;&FJKB&;iG}|0zcABpP=MphW+~Usg*t7YRq$zXGKk*(pD{0@gazMUVO3Yv2Ly
zwBK)w@!oIY0SvIOw?NM;!TPjsWXLy4ybq3Qf;~8fK3pTTucora?pugXR?EC^q_WDM
zsLUW^xEL|7UUmDYuHS^Q+z!?O^OzypjsOZ>S6_c$L1n!qW09%KATpx5mUM`vBG3-U
z;?D-Z(;KN%xgAt{e@mnzbJyS%>y@5%<aOP9#C1Jb1eZG9zV*^_OY$R|*KenfV#|<Q
zeD{qP3@mHzJ`s#=BU!9&<Ne6(8ugzmXDx=VN1DC`#^}GKnm)uw^|(n~BZ~_;hja_p
zBaaJ$BfQ1-BfKTUBa#a$i`Y+V#K|&Q1|_}I#>A4PAnfBxE3{S<$ls;J?Ijh<K72~^
zxcd?)rdgF^*;2~J)}_?%oD`cnhLxnhCK8CgjmxT(=u=UONAsAOS`*%-tPjQGMKP@I
zDEFm!4?*H}Q%xYrU5j$+wuP|u%aBy37RYHQ{|agamD**DE)Y*ym}5HUmnv@n6{YWq
zq*zC$8@AC{=a(980L=f8vQpa4C{wOxSEb-i($d{dt{5H{VVEB0JB=_)G;J^o)-Bw$
zoW~x7Jp9a*ItCw<Jc#CBUTBLTZUv<j_kz=lhWP%t(RziQzP_ZA?#a!M-`-0x?V+U`
z4^<c4Y0O`|L>9Rk(B3g>=o0#K(gevWUwj{m!pvzuW-mPO*=6(QQ-0HBCma2_<AD5(
zpY;729hr*wx&}E3&uWFHQNzv1v*H3~?tOO?deZ%aj@%7O9^UwFX$7+__-))zA*X#m
zf4_2ClvrY*5p6kdu0%w&sHXu$mdI1&c$3Z=GMxlmC^0MP5sfln<j!n-X2NkZUFenM
zKWnU9vM{9of+zb)y&U3|l~%~wl3!P;<&||V`O_2SmBIP#c4ne3%|W<KHAxdD^V9kL
zEq!*Z>pCJZj};@eo}1#tZ{mgpQREzBv<8uG#>TKCT4J{5A5_$7YWW6?BLz0I{TE(P
zD)=Vglzu3kx1V|b*k$oAuxpV`&Ef+MFFnriaM5+m_5)BC+vf!Fym*ox=ipeXOg&|h
zZp!Ebm4zN>zeXx;%~BEHYGzUR1@64=1@An`Q;E8<;sm7oEcUQ*nxkbYM^+_Evc63k
zRSnLOQPXfnUsRgns_GH5(^5w77qdy7<PoJpTx*%qY6c0$q}!+!tJvcNZfWi+>84(j
zB+UfusS0H?Q+ol|<kq*%93P*~-7S18fOC1wq7kKie%$FJXH@VAo6x=9{@fP*($Cna
zw+r`x7E)X*?%c$q{Nlzhj-w#kG_2g9S5RgKHbEu_hX$5re)s#x6Von;&Pgl!wGC9H
z$!3GPSJnx}?I@BXrxm>}B-bOE74xfz&Li9vlP<LP$xYi854<S(*Opc;nG|=O_uCk<
zGL_|qBLJ%#o4s?-<V3mo@@0)ZoJ#F#?WC5e^e|qX!S2d^76n_#QmLyVqX1QWItMml
zog?%f7{K&A4%&9IR@WMZ`~HVpP<{ruz}XM<j-y%dlwbl=+$fDBgq9!weKLP$j$5R|
zg>&!APo9MnG2CmD463R1+<eOX&ERf1i1xTT@{r?cV=>E+8%?BZU#;lr+x_@DZhSJ&
zti#o;Ik)`|dGSu96(k#btH^1Uj&K`&^UwHPQR89ofsyceUBEz71+|cYrZ2ZV&2a0B
z*beRo<qdQ=+Q_+yfVAa!?DFx*xx>E#Lh2sANq-<G3>F8j0}<ELis2EYggNdVN=&_Q
zF^<sWCb@Ay@1X-GnP&UA)4}y{ubAlikd9Pu5?mRE(vtPkTq%yylJz@ZSuPl=hX5Ra
zvs0IM-0w9q7^)3#kJ!}J9dIR?ZHz~cXsF}I)Q_yFmp_tFd8<2;R+<cqgSr$V(A)bV
z4~j#*_A8hx<Pu0)l`AGY(!(~>+c=ye@LO5X%rWGDON;((!Gz%MgL5lG@B?1zs|2(W
zboTvtGyJW#fIL#oN7^9m?8|do((@Z@^9arq|0xE1U2@}@!J5h2@9K!?#EjPmY!YmC
z+5<dV;g#Xu#AU9+7)(a612vS4snOKX#ie(6J%2QNx^+9$Bb@Se{X<td@@&*~vD8?B
z)hfUBXlZV%uBOiQ&HRsp=IGc^2u>f9kx!3r3hj+>2StqTH!}P($K5&ht78<`O=yp-
zot$274A;><^KY^ky|2)fLlY&2?0``ZNUwX0xKxwbo)4_i@$K0S58TWNZ~dHC8*b~a
zfL&C*xWHZE@Boq|7wTqWy+jfO8;!Zzegyy<&A3}%5|C`US4Bx-5988;OaYqVPPRLw
z;Nb-(BFLdsJh+|S#3@u9Ei<;{?nkuzq$G<<DXq^HF1-1wm0Z<n)M!fLfcsA8b<>VU
zF2Ze{k0PM7vUJ#>NP8|?<bI9vXQDeC21G0+IcJ;*jq(+O<g<N;H&PgS`5od85?d}<
zh=b+VFVya-Sl#21YKISOGT^KMGv7c$X^k?0x&!`N^qhM1SaXKlu)zrIa1_*V7@2S=
z7;5Vc^V_^k5}#md7Sj!jJrqe#%Vy>t0!b<lYqKz-B;%L0Ic%~Lk2!myDK%@veJg;}
z1P;|eH3<pn>bS&MN1aW%2;7%g5X@&s8qm#5kDbG}R{-{dr&?g6;5|Uw5uEU_4^QO~
zb{Y~9uL0Jq)gp3zTayO*7RkjihxOr%Nc%+GOa;NN_J^!Lk93kBQ-k6kcNxT)t5}D$
z61P*}l&*yc4u^H14~LH>L^ZUW;1?mSfXDj5J<WDPJMy4W%zX4v4K;0h&RcNNms9V%
zBmd7sfc$BD@VP-t>TU(HHFX952<e)wX-#HtC3>)yHPVRmkkl@}Jcofpqdhxn59g+K
zCCn$u_Rzc$U7M7ZV&WPzph#EI@GwLwiH9iZX}2&3x2=KO2bUCl+g`|Lm?WykF%EBB
z3;oBDMz$6-iA<enoPKG8F{82Y?lLL1BL7bVz6lfM2TZ5PXsWt~8n9qcNOqdagO-^R
z!&%vRcSTj+UAEAH`!|B);w7JwYLYnfmtw4*E9@clbbLt~X#63_3k@BSX{tb;Icb`P
zac=7$+S&f!&<)gm`$?)|+BBrKjR6ab3VFfG1ywpkjwl3<jj0QZ=R#=b;@VdD|58X5
zR5h#AwRx0lM4D6CbD{B7#bQ~P7f~=dtUB0lwq7+S1J2@xYdeBC<YY5f8yR)QJwVPv
zS#_+7cJX1zOxeZzT`_4FZ3BbOnKyEG$uRGb%$Zujyy>I9Zcokzv${L9Ouyn9BZA0;
z^LZR`kg0!r4~J}AQH>HjpQ+(x`KjSm2ot0&Y1#82a8MSC^O_A6i)sD<cVH8V`aI7T
zY_mC8Hi~6no=X+`|3`&-E}j1wZ7_u3yj1g(;Y!Mxk0LqwZxvfo4Bk~~ytFE+t>w3`
z8z>qhLmi}4M94;GL)~^Vp%qH}_y@~K$pUp?*KkugPs|~1hTS!d=|+9a5KM_%*hA1#
zkLt~1eq1Z^5-Y`Ax`uzAkbjz7e6jf|NhXog>SWpfq3fN4GwFl2(Pxv~F*desn;Tmj
z+qRvJZF^(ewyit1ZR^Xv@A=O8>s0mB)Szmrre=QKef8B>+Z%CKl=pZRnBWv1&Iy6w
zC#yhfk>a902RW%U<Ucxqc(Yl2qgv?V{~#@p(oO*j`q)(%9`ZAeF(`+;V=+|P_Ew0B
z18YU<t2hmJd}^AUI5!Ue#bo;0p<7m+X0Hgi<f~ZImmlr4{JT=)az+=K10v(q(oHjg
z3l7PJ>OO{?$&NHjw-Ao%Q}urjKwvcK>d;g?xTp<3Dwxh}m6sEM9FOhF!*m+s;&rUQ
z=G2i%^Bev5YsjSVEW?$S(y3URRT8<>m<vNHl?(J$5?B^3;)>L9=cvkmdkka6cGZ9v
z)&qm*I4!MD5G-*|=q<I?O|2=&)y~EbDx(^DlvaH80fymuGfqnMf?WkhiO32vdq{N;
zqnJkumpqDvkz<(XN*k!O^P=d-RfFl59#Y3uI!lKZS79d>a*2!F8mbSiKB}Irw&pAg
zOu4z2$RnWlG{`@^&|vnL*kRzDbH0&y;_fMXOg8BC$jZ~xD1v;?7f$1|sMw0iIK585
zL4~#a;3^u~nRShtZOGOtJZq)v-=;=Tn>v@i4`BQ3+A1c3diyq%rD|m3X24M;f?n-|
zK27~&pM#}shsi}il+vcvMF@MPg~nDH#dxFQ=;f86WUcg?9L+pmfd)9j7x#F>M}Ejt
z+;^aI$aL}N%PtMbl?d*EF<0^36~hI>35>JT5X%jIpk%3y7GXZ)XlRTU^E?A{YTy$B
z<web}oYv2KaF=e9?WZ||Q8UPjh6ARJ)K3kmoN1jm()IJ537$98_358cbBG@70ZBRZ
zwS6we8|2V&yx+BW(Fm03&yz8A-8AKu<s(>eKY5hU$4}B}dxexHYpQ881$Y3Ofk%8%
zQl>gw6!+OxBw}w&kL9=*rl<o~J3m%gz7JDyFD!>{bUtq0x72>Wssny|R9Vb98>Q5Y
zwVXTTz_DJTG$(b<k;zYs?fWqnJ>=YSqDaMYStUY*(bQ?w(;~XtMY@0B@KqOor|l-w
zI$dk|gRjVnIYI`;CKjU`Ak0Z9C$g1G8XEm4i0)<;6VgN~vN-MQHK|eji;SH_q6U5#
zcO<a!yP?tGdxm~F48&q42Ch)&14YnY(Vb*=tZ%=zW8z6p?;e!{C+}(nHoL-?XWFF*
z{y!MF91`Mg45VCKJ<mJW@fOHB;AWYtw)D%?JB#GPgGBvKzPAn2xpHl$?-hJiZEFA*
zcyVmC;rCW?rC;;l9ogU$3I)tcwcdzw2lA>}Z^SeL1JrDJBV~ZZ%LX4Hw%=+U<iP5%
zldfI_;9f=KgP2KOwjNx?H-{C-Y!&+e;yLw7u4&yl;<9S=m@gAYq8W~2DwVivEuqM%
z$yv&jRK83l&e^2Y+mID!A6C?-8Uh?g5J(sugHk;wA`;iZbuGejbsZV2ir2Q9DyRkU
zY{mN!XPdfHO^@#=g2mI|v{FSG-5VB83E>`@$voiG_cpR~Wf}o-mfe*kY?M<FRa}*$
zGg_2oT2eF@1ATQcogJ)lk18;-R#!AR$jf<GH?Kwaj~Dps(qF~!RO-N$`k)u_bxs3U
zca1`swO1%&D4ZK4lW-T!k{o;Um7~!){4hC@uvyWU{duYEATvm-?q0pphyR6(OHfUg
zbg};vJ7$g(fh^TN<aLdiWVD!eRzj0#DpNFBku1ZC*I~x#GZPM*1aF#%$YdbHS<$i7
zw$1_%f01XP^IGZO*Dv-EH>G3Plm|gIak&ktpwq9Ne#>Bcdzo2=(p$^ePXJ+yttM~U
zD*;n$8g(R^mL_!@Q<+UJ6PE1(i}j7Bv{txk+?uAqQDD%9;n~>h>ZQJr)l;3R^;5li
z6Q5Pp#SgYEU;u6HgApQCb^U`uhLty9d?PYkVU{KhYn&;LW~VJu!u*Ajcbb@ztBjPI
zt>~a7PZnj2SZXZ9y>OEC6rW$g3_ILy%}~67S2o}t47Q0Ju`a6c7gm@?lR}BDC-gtC
zo(-IRZ79hp&(4eTe5g2ZgG1vWo$)Jr<JpNNBbxRC&Tutq?^CFKmM!S{6i~2IlwWos
zvRj<8-Ow3{)r2`9<v26Jmhx<lx4L$ipKp!mv6gJmV2w$(nrv8S4KP_zF$l9pWm^Uk
zOgF)6TA$S}J(4}H+}3P0VTM?1hIVfb*srl=)@X~JHbQ+FF&MbNJA)Bdp~R8D8}^1C
zgv|=GNRZ~4hI<!<zMnTj5GRv=(F2H^yakM&3B#VUW>#DhLbt?-eE20|<ibc0Vng|b
z=k_4Op7Vv1b$?3uNDzHe-#2)R?LUJKt@;eyH6f?!zd_Yolh*<tsa;k+37B|d0-9i+
zfsf>}YjnGr7xY>UACpK{DQfAs6E-R8GM+@`hB1Z@=Ul*LylI;v2W(FeOH;YmCx1ja
z8iuGcGb3L04W;-XuAIF1frYtcE_SinUtLnhKk!lZz6m@mw0yc2DP!gJ*r*ymO7RDA
zUg(mrTv4W~R7VPLgN~2VbiS_|{6>O;ISIF(va<Q;D3IkhU=XH4Y)ODCxN*=A?1@vO
zutRKuULR8As8d2i!62#~xIsf?=xQ?K*9rAU1abF_?%);M%$9HX-#XH8gkzN)49+xJ
z_$yWaL~szzD2w=`q<D?0NF6WC$)nZr#o~6|(Toudy7PrcLk+eWh}D3#3$w@a1%|n+
zUgk!agbTV(Q+w^mWiMMhI{vDqUUMfI{F>#CrKh!*WpxDqIh=Y~C*pX+R!`kURG30~
zO>8G+``~7zbKTa!>)Mqb=!NyNo~Pzx;D^d1OVaR~t?BgYqOh%uz&zxVGIwQ|h}#FL
z_9)vR_lpcw5bAYZ4Twnzi<ZOc#91APi3sw^`M2jOLS;DOZvZ*h4o$x#W_9K-TWu#E
z{`{{~0b!x$Nf_A^pQZjuMAMVMp_xB0`cZ6VjSnOLBE}%k8<K1-#31>Dk*1bE8txHs
zq&}uk<<0E8kw3!w(SF$$UoMgL$8d?)Iv*7I`BEIjWt#5-bgCz=ioioC&s9!6NFFlT
zD2$}!BUT)`P6%qvvF|8!O}Ds_IK4qJy={&}pEY0nIZUj+t~g0+DA>BeLIb@R=o>WA
zc#?2@`ON4imB;E5B4^dG+8a2J?N%t}qfDyxR%GKNd(HSKeB4euhna5-*xDP1_1Aw#
z=lHvM-sDm>S47l$>`={}MgSZl>TTpYkjFUGnw*M1Lf<C{sJE}XO#wWf0CjRma?oGE
zSs#MQs(Vm#uOQKwk!r2I-H~0S=s%*k^D~g#Ux~rQ8f-}F^kHO{tS|{3G~nv=^be~d
zoV6~s3Oa=7zZOKelCGbrGfSM!rY&aKul_KC<d6|n79u*+MwM7X<-tcVRd1zlM*UkB
zn}MNijiL*c0EG|$(4Z2miLA~>TVUZ%pEU0?J@gd=@u69GfjqRtm&p2qx$c}itVE93
zj9&`j0~>4AcX;yA@mTK*^l9Zwl>UwMK7abXC1A%qB=QCxK+mzuFrM45C5BnyOroDc
zjQWOyYCjVfY>RusaZwWJ7(Lc<Jfa5`EuDN=(pM2}h31l~Mk@wizE?7Z#p$3<P1Wpz
zvHU$Hl;Bb{v&HdN`vS%^XAcIYOqEZ;MT8>A5=9D_05j4SeM&VPIe19eaZcshfKuf!
z9$}ZH8DOT`3QXy&P#IGDjX$!qa1eD%b$JUEvUFr2>ei^323ih+C*+zaV5URQSN@*8
z{M})x?S9EM9Iv#*<(E(+vaN!H_KZ0N{T@XMx&Ki9t7R4He~^d&DM#}WN*O2vR16mf
zuc*>oj(m{d*-1hm!ioROA`Vp&gH*=R-{-LC+bsbU=i^~<obIWJ2{kyf3<*UartX{h
z1w{jwPg?*voU7aHVwyzl?dtLQywpd>J&L%v>dI8Aj_ZT4(Nh{0<F|t?+sb1TRD2hA
ziHd5zi25Iu3V^Bacm5hN6+zmqvx+^`@Cp110p{d$!+FyeaC+pI<s-nk>tbE{l<c@c
z%HV*`Ofdem#toR+WW>P56`EbUAra*c*3UEKAmbK|6~+o9jaFFR#)#k<b|VT2TRwC1
zBbhfkca`qdA6CN2zqKE}<Jd{{xd3i0_>bP2VZA!AkcGfh@YmhtIV;!qwVei2lVu>j
zcpxdVhK`7k6y!~@l?LRfcHniM+7Y@wkCI+b{zCOP@v<fSb<RrSpr!G=pWDW-W@fu{
z8sOK}2LT$ftV!U%fg@9+Dd~17h=ZgmP}5kl15{kgp-lf6MR>NRrXm-OYxm(X9kU=I
z4x<^fP6xEfkUINGjrfz07*ki(%UY%Ppf8))XEm=CtLMEbq5T|LyFixI&_ci9xOKs4
zuI&VQs+AM@5VYZl<{ZFsl%Sd-E^YZwBD%0-TTRre4##5{Iu)l}ejbr<v?W;0n6`G5
z%gLc5Iy-uDfJie`qzNg)iWtp3K+OmunR|1{W0?DS{f4f~&g)Nobd0$Em42NeJ@wgh
zYQZ6&%7%Sx;)4Qk<_2K7`yAis>^1nU4{O4UyH&FpeWk`fj8M_N2Zp`-9L9U{oF-$J
zX++N<TdN$cyJ9j7XqvQ7?mT&p>O6bSx+uKm8^%A6-IMEekx_U-lBPg59z>cgh{u##
z<+EFK2^_$jx5G<{P<Wh16+iS@Ej<tsrm`(zc{G7KV=G|U3MZSnu-L;TW%uDWkyd)i
zQsc%B+vdic4$q2e13Al$=&8aWvZEmT=2tw^u~ZMoE$xk*+3!Da@I|bED8HJIc2Z^C
zgt{jG%47b4IaSBNfvhl{7DzVbV75aO<1z((d@4O8ZwgJuRlcik%0<Rat)E`cWb)fR
zn;97<OWoi+USTL!-RgP%2qt*vj|Uy>mbNopB$!-XsLE7-v>a99nxQ$RY*;56sxHnG
zN?rS{qvt~LtS7q(j})GsmX93n_LEd1@hO9kyu+WHq32LOA><AMJFf2}DKHD<<)QjN
z`+r%}H?H%H7!Ca%?zFE80Hx6K$}$m`g&E_lEV*px-FNCaaq2s|pCfp+3t|2PKg9sf
zVY$a>iVN!qEcB}gIhh(_`6I)ywSrR3m7$+dkLto<+b3(v?X}+l@XWNX*;+vpD}7J8
zW5aRXBm{4T7AICQmEPf`HV{V2QGxb67Scy3RZrd5{)*;p;7<4Cr}`H;33+}Bd5)~4
z4Rv78Wj^JW-TCZuw9lvV|G}EVV>#@comhde&hnn!TtUFi`j}nggv`$hFki<fJ;e1_
zpUPF+^@7FD?2kLb39Fncu3374edHXTOO5H*KXUu`CmsoB+VOc_JkG!X9_6`N69_dm
zC=zz&LUEE*$%%X`qQ}S?jj8Zwy$7efAJJ2ORHzC^OI9GqAtW-n)!}3ri}5*CcCB`e
zyJJSc=Fo^4?}d%zXiKSxdVY2dAJvk%M^{AM#x1{Kz4*wnWe9?*!@&XA1jYPZ4PtwG
z-Bh-Xgu$wMLqJ@23wnM}jK{q!TZ7n|3W32JPluj$d;$I(`}(DBxT1`_9sQ5#5|GW{
zL+^h$?tk2+27cdQAY&0Ku*pA6X;sw&u!<|uHB;^5%;GpQrkH9iIm{HBbKtX@0zh)3
z=fyc9UOIL8_f8ECkV=UQ(hb5MG3_QEsO@R}ink}_v#;v=aa8_1^nxYJN&Gz63hv9f
z#5C9%eUf>m9?Tr`l9{0{bA+a{)S9$$ygp>(+SS{}wWTkVbya7Y>A8Y(6k=88NS<-I
zK6t3;?srGrH1JaEqDS^Xue1jq!$&L?wW1~AtU>E@$k{0{=ku2mI9(;1=v+DGBy*B<
zqL5_W9hxiM-N9!3sysT@0NxaEl!Zla2l5Sy1hIqNp1u9B_wG*3ulR;{9oM5{0GGo*
z{DP8Bj)d{V#MAIdcU}QZS-NqGAL%3C?t!aYNa_foW%LEvgF`Mq=MJ4`_Z_uA%aozl
z9q)G*`nCU^9F3jM02O*acuF9<R@m}oct3m!{8jtz4P(+%JCfaU;pMuC1-C5e@f<o#
zaygeJ#Jh#)$y{|19dD7(scqHol%~e&sIf7`?QZR<vEHK~qRK%Y+RDK>P7AI`_C~Gy
z17VGDq=(z)+1*PwbNsFvovzGimHF|lB%(F2a=QClJU>r+(QWl)+F0Eu7@}3;*ndze
za^2|!@yxXU?vvmOnU;C1R+_k@@-Jmo<^7hrZ71XW;Bu_=mV2{9roWZrp^tRPZLJf>
z2X%Ti<KgI9Y#qlA2EpS&06KQGRuEx6)|w?{WC-oX>(+8MAG^g~bye-67OYw~RYMiv
zVxn=ojsBuGd!3f5l!;5D0Up(xHhVo*6`OxYhxq6;+ia6v6I8b8E(nsO{4PCe0qccO
zcTz4o?_W9#k`&a4FCv`jv)iXkMPV8x^LVx~st5=00CA})V#1@@Erl|nB~oI3cR^o-
zxxeM^M*H{?x;ZT#cQi-gllATSrPSm^ITQ}G!ZM~rUs`p1&J8*fw<UuT%AnO9o5k%+
zOOhJBcUe?a_@!QL3)4phN9B^V3;Q?|>P``N9rL=2R84v1USs8%3R@1&v&z70D$_+O
z%kV0uG*yK=H9hTF<=1Pf?s8=yx^^LHwS(*jxbMIW`O%^dTQUv#v(1F)i@(x)n$E*t
zWoO0AkHSge#~1>+Z4(^SXMoh<h~ly~2zM<x0N$_~N^6o2u_fk%?m9DZRH2M$5mim@
zl&GehMRA+LJg!HzAS%z-M>m@{W-Eobn_kRESI~Z|(?H}{!tcGyGwADy9OT8D^Y-l$
z^>fP^aQo)4|8y{NH6FK>vS(u6+|wC<ECz$2gIy^R>P$cgL<~QpJJ!ll04@TOw6$l4
zobjQm-t1G#xjkC&dWfsCG4?%v5^HxdOf6y~YkM;;E#hZr$HY!y|8dm@t(|6t)NKLZ
z3p|s^bc!0Vty18)@(4fC%2y9RGfzImk^-^9`Nkxf+bxMKkJBf(T8nCIs!Gp)EIC^J
zIdf;5V2zTon>3nkIjl3Uaz7_s@_G!n{GoZFF~-)CTsv8HaPGYX-87A=pVJDgq1Uop
zk*jh(&!mp|xLBo;sG?N_EUA=+TZSZ_d1x}VZpOV=xfXg<X)7Wx*^~yI5tn9J#w;v8
zl-~b2`?E0aEbp=4ERJ>XDu{LUs^~HFki^pe(0Cty#%-Q|me{cJ5YVvrkl)bnEVwFj
z&{>sJD5qV_S{z@NGD9}TuCkU_CW*zTpa^rK@#}3G@F1>uzq>eIm@4{3snnfrDe`%?
zl_vUyTUkY)^cY-QGz<ONZ{Bc*kmr;>-S$c5><z_f!}Q+<EbBT_dW*B!VYHa0D`tZ$
z`QLnQsLqX1j0@RbVOJ`$c4~uUZaAs+ljZFye;!w~rnYkZ>a}oh8{WruIF56+U5uod
z_DPPNCha#C4^f4w`SA1)!8l1%S?XK<OP&jO!cAP!ymoM=byj`5CBcym4AzYY`EhOh
zhYh%y%rV-HD7*T035ltBW|+t|sZ*&sg;8UUFx8)rL3s<6R2329rkUfA^T7~v3b+uu
z{#eMTFl`g{9_h!#gM%#8Ee1+Xq*S7$d_^7y;R=+<zg-;$OGpM5va}efj15m^t1yxV
zQri-!MM)`(E+g|I9cn4^iM(e#)$y_NY%pl;V3Q%WB<pYZR;{{YQZI__Q26}417q|(
z{cx89cDb%hF$iA&x2}O%G<g~lrtS?bHapF*W4WwDa1~;R|JYJetY{Eux@X@UeBK2>
zUALZ@@#a?0=5BD<@`Jy8JU;BgMrh;CuWpCIb95cVaCMb-;QvE;iI;kD8CH1d<2L#6
z6WE47lyUjFeBy(W(-N}%$CIMVo<I2aCF1i2FB1BCzFNl{W%4QBG}8vMT9YSHeLHz=
z>>H=b(g%;_arTgnOLq@fi)oGL2J=e5rAS4LC;Zu2_BfvXv|-F|_f*dx*e5<Bn*6k`
zh;S>$y}GcP6R+gBV~Mv*wS~vg6sVt!Axxy4l71AFWdu^Rk7-1bgO;uozvn(vaK_fl
z30if7c75QuT*06&;lv$mNm|>&78LOAFKJ0sw}e5TGz;RJ61Z0VWG|a%=RXKb^RzL}
zHlvO<@b!Z|5fmPVg(q_iQr;XDe~H=6c%y8!b@!M*rEna5LZff!)`LAUCLewVQ#^C4
z%*)swefljrevM$Y%l$;1pKtdyxmYj$;ti==0X$9^IU8eGD%H`c4Jyw?z^Sm%=P6NH
z>=r1|RU$XVD-6WVc^N1K{D%lI9)biZsEQ+-%|E-zo5_F!V;krMY1dEf*-0gfUDBky
zHwX3W*pwuM3;9m2IJ!cOK~#5@{eqf~*Nuu=rjetx{!9t+x?^B@kgz<Bm>nq0^dg7Y
z;Nb>)?lMj$_@ncNxveAwwq`r1i5?_nLx;L4Hs)U&e^0{HORc+C9~9n6`(3wDs<h)$
ztf+jjTj4u+sZ^IgDBAcBb=XL|!(YwHri$g^6u(mvQ<kH1;PK$#1z)(vm>n<_VUB^b
z=5=X!;+UD;6Sa-O&*%LieGkUCg4{<VhattoTGRU*-97tt`P4kLGdp?t$lU)UyNKi5
zJlIf)@6y~4Ia_7P#&wEzxht)@wcg9)<B~@5;cSL?l33D4q3y^*7xgM>lVb2VyCjno
zaqurvT<vpER%#WEtL{zo%Ya3AS4?Z*8wwF{yox5jH21(mOC9BmwXLoIIwg@u=IOw^
zjb3iv+g<PpzzJ<hBd6y48%)+1d%$_qC#DGI$*j%p-wsk6W1nL63K6)D;@81D%+n;b
zjrUkvqC3(!=!jiAdLhqqA%58?7Jp=;bnQfzd;-#0Of8-5sW3l}3&(@-bM2lW`6Ns>
z8)A0;?q{u(Z{!1y{}C@JLqGG+dftFq;2nmGyXeo1$bnze6kccU(8aul_Cw6@DLi{=
zQ_Oy(ZrS?k*`+l5glAJiz^sr8ZUlAL?30QRQ?j#zw8>YG!#clgcdHUpKF`(qKQa$A
zM&mpYE8x@RG}HBo);BbUYrNwtbW~S26-IBo)lg_1ph*U8P5aafUQ1}bxdqzPx+jlV
zcP$qkAhjF6VG_Bz<^L)Tq7lRYHHazF5i>{7q?}r=RYFy*P%8@~QaKeasa4_x_I-O!
z{l7iGFvw$<GT>N?sKj(^oBnqBfw=QVBQpy9m6Ty8NGmZ1RhU;nYFd*YzXLa)VGpy|
zBr02xRjLOK;ITE#JR(M_yE2SF0+oL75>LECRG6ZhxI3TC!%vwts635;Y2xY@aM~<S
zyD0xeFlm2V6(OJgDsVH1s%Q7e^e&Y7D$vS0*zqU^^*auMOm^!MhSDB(BJhfu_hZrD
z<R=fcZRlZ4CAOp6L~6m!f#K<k#1X0ab0lo%rvu_yKl*P03?rDD1##!c`M)Oh7aVu{
ze=EJuIGQAOP?}_?=;{A?!Xqi*6Ct{%3hy6@Uwg?I++r~CZ2ipjl`^>HMv5aB7yc9;
z_+&<WlOTHhO+w_`k1>5^M3micFpdA+L?#Cu09ZY}hY@FYUl$(PzVEjNGV5%+Ru9B?
zaGBhaF%~!D+<A=Gdu&2i1hJ=W?8@jjd;VVG-3+g2W{--xS20QG<UHrJCCfOh>@#sI
zuM<(y*_||@?py>QH||4Rg=eW;zmqJn*Q;H}$fjCqAsiiuB&IJh8oHphxekKBhmG|h
zDp;gU5Pr{M5IX(DC!5FzL{mNlx_`f&C4T)!4MKNo`3{%k4p|bn5Aj>@*c~{cVQl|R
zO;FZO=b0W&beWEa8K5S9RtMb7{2Gd3$0Xy_8pwPHyFpPi>7ko#pN1{=`R%5k_vRzV
z@x>q8PF(v{Px2}Et3DB1^5pH#j6!#A=JqE%mHD-V#Tysm)9x77$Ibu2gs(s=vYvVs
zrBfG=i_MoLfiN&5ukOz1$*iCJvCf@mglCnAg+4Sva|G#%i!5l8H|nI&D3VT+(1kb7
zGj<7z^EGXIDKuttWwSNP3AZXTW16g#wy27DIHS_cVNABFa`^`y=}Ohb5)c1&<ON(D
z;Vw9p6-_-J6@D!`6xtol{ImDO!t<b^MG%NG{IV<`V6*oL!t?#1MPff?V#w0*gjhaU
zX7APVPV9x}r;%jjhP19wXdYz;9j+Xgx4rS!I_K>M-axu;WQP$p(Ix!52U4GmRaUqo
z3Z98f9;OIAvZdm^@XBQlJT?L6;MHwBCp*Qu29l=z?gi*V<q?v#W;04OSS-I!@?W~^
z&1Q(wi)?7VvtK%_hIa&XxQ_BraUj8DJDPImSt!GCRL7Y@f4g6(0du;0^G|&%5zi|&
zr~9s;%}rN^)i*jakF9>AtGCpHkN>1P@R9t^e`P-zT0LC$>s%=yc|p`}c|wMChS*1r
z4R_}31wKVs>aw^M>Rnr!|Bfk!k>d>?pN(Co&J!*)3#DLB0X`^X=q3`W_V*k3C<y7v
ztW#do-J_0F#~|5i2@(7+V89Suj(9cbws1r_*s(S1_Ab3=7oU2E!gyrP^7!e`wyA5M
z@&x<p@zvMA>3Dqg0UFSG#F#mj-{FhY|LJYK84T;q_&aP6@H?!2=0+KVvQgl6e5nK4
zar{C2vzb^jLy@K*(zhCnRLg`B>qZ3gqGX2Tl`;AY<E&@j697RrZj!uFM7JM0qOn?k
zMDErawwYTwHqe~>4E-S@y|XzR!Ldn=l!WRos@6)Ij%BNAyG|Fp<1AL1luXEbNgAgw
zy{L8ZVsK|H0?eflQQ3u_;*^QYLJmI%^~0~TkdDIS5!e=B)83At`A!yGR2K3d730fh
zz!W|G7QUNL{uSm6{?+Jv92G&tC?%-qS4(+rS-%CDxWv2MD7u(tUdD(<QzD_eP?R1D
z1+U5>6X<bSz0=IL%l*l^%FNEj1<7^UJYHcj_L%iErz6ezU`$>r)VAx1cOCTtrUMYX
zb#NYDZj$H&Bf2!C9~Vt-y0~a2RZ|Y0PZ?vXIq%*yYF@jr)qm?s0sCB$&-N|*!Cx=+
zV%}Ekce>!M;;V^0XI&98_S#cu@0|_Hy`O3)yWUo~yDra#wm{Eos>!)8&&H=-!D}76
zLYCdP`p@I5yA!vuNl0J7#VNab{bRVV?SclYPmRKq^bhtF=gW_&&B&9cg=|N<0tYPB
zmeduYCs!5BfZWQ8oo8FK6|-p=iS1IJ{i*4VcfKX+-u<DHIfCi7EDDDh`_I|I^XzD>
zUVEWb<hf~An0XVXvzzRgxZcyb&9+>kZ#o0QTT-d#o@phH;K|P>NXAn_*|tBLUeWZc
zuawWfb-R4Fm~b9xhZ(8xpDG8Swk(&b)Kk!4Kgn0KS7rr^DaD&zC<R5uaE*06UjFMt
z-HB49$G+9h7kk2cs8G@v4Sw%rWKu(W_q~AhpQC+53?%WGK6MM(<U@agIghRd8P@OW
z0T`Kf6GtN{4gd0h(TO4czZjku#2Wx_K;JJ&vF({{=GvBsuo14ci(UV^6A)v|4fh4V
zaN8M>;f4RV{YvQm=3=0~OWSR(IRk87j3oAPTY0N^`SK0v>KT4dd&_kB<SjG!T?*$O
zcMx$)byc4H6VSWin_HJGUZbY_X<WE{_Xd`;Rb8k3<Qp=b4{{)uh*#LDFU@!LqI>&-
zz%oM~HZ6yklS9V$74-bBignC9aC8(p{YAjXFX!ds_xw(O|HvHqD3yAg!njhcm&^|@
z_0DB=O-?ke3$OWsTC<cB=KUGId?nYf@5}X%=h)38`&_QYokLHL@t)GqyQM^-KyYKK
zB<KeMHB-)UmOjKprRMdkoNsU_oWSQ2`wk<{F@LU_18-{Dte7C9B^IB!jJ5{e2HA}p
z59yg<(&s4R4%-pz_LV1>t$O-@sD;(2qR(!A9el$tYP5E=I%2<wz9&aNoe{pk$-lEH
z-K{AMU-ex0kmEhJGxS~!;rPl-JiXQS;Qu9rGhj_xdhK66t}e_P7nhIOx#qo%te7xp
zaUSGv+kc*UP&?)(9_#;FjyH5#cRz@WPr-rE8g`iM`6?t8^Cc!K!VXQv5<0RC2lJ&S
zd9f7?{xaEr))cz34M_i7o9)?xmw9*nTiMOa^}_wPxSM(Cx!oZ13s3rPD<bXFM%e8M
zIrm|J&X+$P8)4_~m%i88Rm}XSnB5frf9M~e>i)hzrS1?+T)yO0=K13nZ}_K9Uvl)K
zKIG~$O4o<@GaK(>UZ0Y2RMDh)HdY_MI==b`9A_S4A96#PT9n?tR7Hw8JPP@Hl;f%m
zr@$j3y()RICXs}cL^vAupLQq<iN_3=8WX;rSugif(C>N}u|n){`p4{ype6`sM!BFm
zGNO={+&?hCPwziKiF~*6{p;l2!$^Oz&+Ih`dkt#JeMb%zB0~z1CW3cQZZX87de#+C
z{&L!lM%TaXmd0Vq;4p%>AJN*4bsr$S3lmEI8A3x0uP%#I2SWW$eN*<Oe12U$*#7DK
zJn+S3zWBhgyCsfO7sO%6E%kUsaOswD@Vcch`_*2N?2B%ByfvBr%5Tv8`c%{Y;khF4
z#m6@G#fiQ5l^FGauQ&aSP={X1)9;%)`G7y`z^6*1ziAQ<@99mec~cIZ7!YOUlEuN{
zGM^Nj>cUXJX|ON>?2}rI=+vld)@ux;R;SHfSrr^7eGy}}ZLK)Sq2TOFyxmW_DNNKK
zT!rnA*ns+LLTs=K8}5>mH^IMnNiR386OojArHX9`i0&8l%eXG>0VQeS{OsHP_gNO9
zRqKi@e_#V{U;nq}G@T+Jtc<1>WL!J$jwDQm_0=pq!2c8ROMJi+B<Y<W@kb5`2p=Hg
z3)bRode`LZ%50Bcu4qSBxWU)ZMxeJy00$n->6!HB^ezahdYS-d@=uECF$k)fF{LUb
zaeYp|1~12JTP0MZ<kWN>Ru|z?RVhYv49Y{0e5J7ag>Gha3|v}};l#&a#v>59uMkH+
z0ki@Ex;YRJB{+;&WQIOWhFsB}NU|T?=>QxvY`Z+~o}lO-^d1oY7`Tx71_Y6#epsof
zC1Ip~8p}URVmbtbtl-xFboyn~(9giWflk_U%z%6sYk6jn$U)e3-?X+HeHR*VJbAgE
z+e4Wy@tJ9d#gJ#gl0wOb7--40L(E?$zT(X>&BTn{AQA;Uk3n$bejfW52&fu?T@uE3
zpuhHbmtY?If%|0(CnF$9JPH;I*xtk552yD07YPG9(9lCL0Sh~n+4Hjkj>k{iPeC|X
zZbwg#r3)^y_oQc@105qG!q1*0WvITP2h0S4r{4lxN6#4~LA|pF1<1jWv>|=K=69st
z-gECe-Jqo{0Mxa-5r()aq-p&$2HaUGu(&GM%)T=iX*A6KP$<esrIU*;YNaf6G0VU*
z<fI-0nTo-yO6w8fo$d%l!kyG|?^=jHtIbP8fA`(#%}(l6a3>6gXveZ=N%AbJZx4j<
zl=DL{$m@}C6WKP%M0fL3A|)I*(f4CjgSg?g{rX9;`oBG;IRC>B$Tj=dXX=K2Mtn^O
z)Lo!<isoYoSvJ6{9iV0aOYXr@gZBMy{(?x(*U=+g1ykAU6#zqk0P5-K(Tait^%b|B
zY2Yh{(|c4pzNM#{L2S1JdNKy!*KUlrwY4BShSj#c6=(5l7J5QxxN8y?A<v2Cz5<;g
zar9jQ@HOqA5bDi6gusw71OT5QD5ypB1B0ScwfhispT92r&ulj+^A~%uh!}W0${@BJ
zx`vmCGA*x@t=U6*G31@de_1(O&Wo<a-JUQ#xp+pxDB5$H@R7vaVX=5d4q2^xa>I))
z370RqwNG@z3t;ZhH-W7?FzlC}L#)1vd|&+ENVs065t!sbpdQjAIJLem1Lj)*B?pf5
z;I|`2DB2OOxoxz(WBn>&%W>vieP0S?dc&VTbj%Agvl)dExvLV&nEuk8JM6^~?>&|G
zZ=C_ai9@c&qBIZ_9}CFNKzYwZrT^l`0s}Qeg3YsL2$bz*@BlwEkgnky0$}TD)DW70
zW9!S-Fap6d3{|g9i28vX7#)Bu@U?BH8rms<?cm_HH4UK~w-ij1;iDde3iEQ(BGl&S
zDd5T=Dj;ilQppDSd}0-F_43s4vg(^yfv$z1o)bm^^Tk-FgCYa0PLu{lR0mX~yvxNo
z%MqPHgjIMVsy`9d`2>!5{1^8iKy>y?7#M@3&M#~90T%a=APnpetq4I@k0GqXlQQCs
z9`WFbdjKOklMn{}4y`CgR{!QYd?3X=j0*#qLn};?)TfE+vSo~TLq<IK;vSfY&Vq!2
z5up{jgmpTiMxEaedFd7dp52aeeY!I_P|XDi>`4EuXo_BpHf<aiE}pYwQ^g^lM#xP}
z%}({Fbi85vl7Y!hOw3O7U+iNh(`QUBASYcr{QJYt5#9nR_GFK^#U5`AsX+r0)b^SQ
zp-s3Yu-X;LXJUyP$`{RteL*3G2rcSadyyyaVBhZL{?`63uIv+-x>I^<byJw|awaLZ
zce|7{W}3XEqKVTfM_*ioT3J(B@IBiC(1~`h8e7z$WzuThm>}XSVc|Qvu;qGUJecDC
zaayf>ZLA|Hr_?Q-_iBu^NS{#RlP3HyPGX@;rtroTwwfYAb8lSrGP_shcAwZ6lU+yq
zc)LF9f54d?D{rKvguuEZX<Bq=zcV0MAjFa@A?D#k_ZQkUdEfF_igmVxj5~_baF;o0
z)tF_6gEWtZn(AkK9vO?g%0R3IHEU^6kwlcc)XuolP%qP7V$>KFZklyS_05OQq%XfV
z<))nK^G7&>Yd2S31>J6qt#H_Wx4IYQ*2KwJWXfQM$oM&!r-`87gzSuwi-if*=s8Y@
z-#iB;PYG7t>-MkSFQcR0X~arpCh>&|LsZUq*iG7N;!-RzO0jfmyX^bio~*g=PB$Y3
zUD<>X7#u=+^cF!Mx$W<v&meMh9jQ;#SN$<t*KaL>6<f5iTOso6A;jGXVm|oM?|gx~
zd^j)O9Jg<F-yVPDN~pw$!o`nnkod9~92u+M5FC6d_EJr%%@Fq_dP%~yf_$U)2dY1I
z9M*)8haL4voHYaZ)*s?$G7GRRBHlXON`G!U&1-8X*e)rLJ>Cg~%Yn9Sx(>v5$Sa7a
zZNt8R-k4FWt&oIXxtnhhEyG^o0`};-%<Ys3toQKyAx0JcXIe|#cfUrs&k-(gxtg~C
z{#w4?oE75U-{%k8=1rV#$=)dMQMmBghQt28HCqAb%P-p^l!RcElq6D|gd(>gPKp$X
z1dUKhDK;?5v2B6zg_pS~rKTl$_iiP1EL4evQ831m^nqpKcY?}=szR-EQ?WX)Bu26D
zfsu3Ugb7YmM#(-1>ID&m<(WV0M$HM^&!Jn5Y)9xJ1b?*tqM%@h3EIaNV%?X`<#K42
z*KRc}$>yO@(#1oxAmGQgpsI#sP1r(UO?e8`7|98?NsI~77$X;|OnjEtB;{RD7=_#@
zQi9s3QbK6_eXisZv`YOslO-tU1NlViB;0yj&>G~*=T?%J*|N|rA6*M0ZdrUVhx+0o
zWtE=e{zT+}d3BJERam5|;HnXMP<KCcHxdgSuHNC+#i9M-q0rlj$~p+bt=d;NHWymQ
zwz{ub3_ZLgr9-TN&)m{nx5JNciF+FTJOe5Y`ye1%LJpe?p+LU?BO};3OSAxSA?Q8J
zx_}@ggrIL=Mv)B%*Rww(APoc8XGJv)!y6uyJ1mK~?&(db!p;`H2*--=r<lI{xm4SR
zm?bT+qWH~J(b`yk#jmmn6#WGqC8A-5Qx-f#OwRISYDRbgQYJ4h)88bw)C}7L{z7Ov
z-_VT9Bg90{$&4)Om<DTdB^5P2fHb#t`KLx;$Bcm$9PQxd4AwbJ<-q3*6%Kr7_&4Z^
zrxAsm+ql%#R-3DLEoS~17ANQ<l|VGsH1|wiMX{gbX1K6D_Yit3TH79PJ0#AKb5(t>
zVwKZh*Ozi_Jb83&yyM96T{e?OAE~bXb80#AKYb(BKNAWIK~(jUdio+;(t_<^5@%fY
zgEz@Uy&$q@+F1gxa#fB&*HKoZE^}iTs2cF+g><(MW(X%BafjAtOw}Y0P;-gZa9<U%
z)4>*VVn2)BQA|+VLt1K4yjr!d58#tzHa}gTZ?nw0yqX)>BS%xNK2p41c;QZ`2U5tx
z=;aV~v&p*NgTNnDcgMHF=%*2NKYw|-XFuN(d4!ZcG4v1A1di%s*7rdt2kzAnYN5IB
zkXXT`3~$<jKL-7-<<~+C={Nt!z21@JK%DAu=~_?Ze;%{JdcA#z)ZcNhKmv+XC$O{|
zWEI??24E^|E}h@Ur*JvZrE`>=w^HSK{UoMLy4A1M>SRu??yW*1f<I5@P%p3jOyV8n
zwY$gJ943!7zS9mv8X$@OI&#`MC_8?Ms=j_N8j)s~RGNA7cYSGDmb;dy_%0wob&tr^
zbO*}Ght@m4L_R*nEL_jOhbfNM%Q7m2JDO0Pv_*~i<!PntUZmXskPF?SBwk=WS!)#m
zPI1AI^QM_SH);fSgquH~$>3q$BS{^ND6PKZp>tHfh!qz<?qx(jvBGeiLYC6T9?gPZ
zdA!}z%zaK+<lpPq|L-D3aoHcY6|(o!+`q@PU^I_k+3Z~s9H*}}w$Fn?AJj>o7^%-h
z36eVw%OzK18SeKosO54<+s;p{kbX17DnFN<^kb~5Aif=N41Al=pdC>+W-m}a81|u2
zJLGpXoAA3G6KQmtDaF1@HH~L76<#mqyFg85-xgX+#IArw=w{Q4eq6O9J24lzXF4{5
z^&lDOt!cE7_IlhMh~-&3gh#0s@;Bmlf_98cQqn+ADf1mZMVpo!BiN@Dnw=l<ygcH!
zK@d``eKC?UeL@AAeL{tJJLCnwc4p^duNh8iukFl*-2z$s#-;<sB&LIgA#)eOIaBmR
z1n-Rmq&cZ>9ShadN?*HUCsPxvTD8J*Zs*^wIRzM*|8#($J{6<k@G4|Rw<wO{8nsL)
zg&4RAE6b}N)dUuks3@U@ObAM;7*KmC67~b0MCoaek9<{Ve0}lu6y{*~CA+}ST>%NE
z)=JUhjK3f4>xW{P?@K{asqOHZAlD^{E+QE$-y;*qwb8|w0CUcMrl|vQgSBo7bcylw
z@34q>Mns3^B`7{W{H~qWF|z$scGAr7v%j_NR@@kPAU^sX83{Td4f~}S={q7>HXLvu
zyG60+{E2rOIdC__nRnngus6j6JHjM(Drx9C(vsk8k--YYUb^MO=B3aSLb7sl$Hqc)
zpV`pQr2-q6?+(5Y-jKwqiG7r>LT^RlsBJCizz)hWsBLw1hkg2LEqOk(2c94Xj$Mh`
zk0MRbvk+ZozX>oF3%yT>ZavC)Tcwc}_)rBNAg<6MJhG(ggfZO9NvOt2lA`gWk=O0Q
zq*sVZ9dblhLP+kOaVVb{m^*T@$eT}Jsh$WuCE-=R&lBtIuJhu8;sk_&@qg~ij6AQT
z5MzmOv1P&u2#BElo#au35gC<A74zl*U<Kl~{!Tv>eiW9lAby%2Zqj5}jSVdw-Fa@Z
zf2MZ29!{lkTCZY?Prt)Aq>=Z;yCY?$75{ZVG(V1Y2lp`25%xV1yHBCZ?Y>8TmEzCu
zzK5Zi?ts-b()oqzhWcpq34O#|O$@Q|3%)I^?ArC2`VL_~o128_4vjL-J;hPpI+T(o
zS>J;&WVIXmI3;Ziwtq-$9s*tHV-^1ZuS@Cp{>N`<{-DDT^{F?h+205$FgYGAipvW^
zP<qU>FmY{lW^rh@r6DRfn*Dmw)qS2g#XVlp=O51hy?;1+LFb{0J@N_tvrn!moN~@F
z>6ygJTr(wk72;o{QCMYWM1TFrkfhTo%qqizqth|mM1O<4ni=dU%iu`Q4)lA;sH>Go
z1d61Ss1;Gdl{0pJ&+XPVS9A|a4jidF83jy<S-~2vJ0`_=`Xpt%H-AmG9BG*0>mob_
z1Vww=yoc=J$$-ntu!=7zg(%6umHaJ*YGi2?$S;MHmGQQ-#1e3v+?x@-18Z0``<pWK
zUp|XyY6)YnQ52?$1<i7!idw#XuSXOFn}wI1{2dC;EQ?=$dXb&r9f?-YJ*kXiOP;y<
zyZv;LSHH>l6G3P<`pPAf>-$Z0$RyC|N8=%8D3AwcH2sJ`=#GbF;r>Tu5%)0*Z%@Su
z6rS`OYv<pvB3p&;8BHO*JH8I^-O7oAul)AU7xM7k$d?c>2iNUiq#@n@ID9Ca@6P+z
z?6LhJgdqrG@V>~LUMLRFX8YHSBRht1{p188-2pg!n4It0``1sg{lx?!aw70K(Kvjd
zoL*!O96(uSY)&tDhi9#QyNW0iK8NSNUB~Aozqk*O^H;ZuH|nq9xR1`=nDaesqX^%F
z<|m@*P^^%$vDjCwOTtF7l<G{{F?NhlU-SzzMzqpK6|bJ*=38E{+f?Q+LZ1;eZFLd;
z{EECB7`%2+E2ydzs(NAh%jE(!;{sixQei)0Z&WBmXw(m}fzm*t&~e-APX;{Z@Il;;
zrTqZcB&zdXPc2Ctgp^_MMcn6YZ<=9yJHI`V_`cXgQhdiu2{y;~^z~i044|nv_Ds{e
zw~8!39|!(;TvC5*(tHg5%5y3)bqL`<gNRG%uK~U2uf_LHJ4#U{HpCpaRQan_4W^I)
z7k}s&y5I$6pZ*a0cjdnWR^42~I>a(_wg82CIGl9bp7Is=N*3<F5hmpK!1Dn6bWn;t
zh#jFx!o;io8evBiHp{LM+;rp`F-N4XrA+^b^gBCE#~*lRbVy|{aRcUbadqkA-^yx1
zN=sU#DwEX%xvjF<z;}sNOPe^G^tFPRL->>8R<X@F9s=e@qO@Y=I1!Doin+4UrBz4=
zVQdLmi~JFFYnIlsD8lAO(vp&>d<$!ks5!DZq}4eV1<l~(MY8#_Rg_f$&1AN@qS>ZZ
zs)m3jkc)y!@th@<Ja2{#xr|>B=J<PD#pH?f271}A?1`qsf0>q#d7cH7L}!-Y2}wfS
zfI)astMM8Nm^t46A#DLRlS`{-Sp6K&-4fk@q^kSp#PkV!2l4a&Xkrhr?I{^OyjI;m
z?|Y`LfeDyAzw>)>hujF<QRp~vT%n>&=@1<o1PtiWnRooh2PNHJy71D8%T%?G4B87i
z9!&Tf)CybxHO|!r1!myaYPi@|#Kar#Cr7bMnMTwd{#U*CCadbT<1(88z~$xKDEhY^
z@o=>Sj!?Y7sa=Jf^t<b$56pj`J}{Syw)-QSV*6LjMpw)Y@#LIM1hg-nb%eMe2eWWx
zph}wf!q!5u4Qa7|7X{QS(WuNG<drS|XlTH2G^&{8HwtlA!hoB3Gl-mpaITtMH#PyR
z=J@~+4YWHgO{kd*O@3#qk0ig|U`wmLlT#bKLzUOEmK%6OHP;e&!cNdubqb<X9<w5U
ze*LUG&DYkAEHoS=DNKx^oqn<*SD~8ruYvSK->+QD1-e)w-mohve96AUDLa*{#8%(`
zC5^yAER#eb{tTvi{1UriZwQDJ3nqwx4Uk-AClulaIkgb;7kxuJZphEAb>VSZl>M{0
z8a5-x4YfJb1-I95)uVM`q*j#$uGv_x*ZxSnoSXH-vjM+fK^lL_2c)>MJ_6s@P*d+P
zlmdN8P^Vf0b-2Sqxx*?I<}$Uf^K@H%ATt9E=BYs$DtBFhYF!e{a~1T?ZMAH`pXVYo
zNa0Z8Yl8Ozfiq8a+#d9OB#yUx7`F|9v+f9X#W9$_-#Yqfn{QYTPz%ZJi%DXUB2?xA
zpbAbZL8+^~;};wJL#5RYo^H96=dT7aZNAhWu?jZ=soQUN!Oo!Fj%#A>+QV}pt5&)J
zz;4(g0zD7;SPiff_r&m7$PUhF9NtF1uz!|$<6R%R=e>|{E8$I8+N)A282*s)F_ctR
zL`*?H+{v8#dQDaI#9UaV{#n@xJ-Vu^;NlYyyvqG|aZ`BZ1$SbVzbC-F`w@+0c9YgZ
zx|NrqLXB+A_|;Eu;%MZyZGA$jz9)fXNOc6{TRLYN1XnPI#_Z3v0osDmIWIR1Qwy5W
z8Y^PA2_46-{h>egP!?|B<sWwo3W!{ot=7`AIM<`Y$)2L$Y!8#oPs&n?qulI^8EAhf
zqqG_E(}sctMY0>Z(zYZlnFvN=D2m_T#Eb%&f;Ro%<m75f<Ap@{M9^O9MCvjnS@@XX
zOM@y=@}Mb(m3lnYyfkvr6#y5Rib)8Snn8J|XeDxk{-?;)SO-|jRN|DQ!%K>K;AQB1
z!;n`q`aN{{T~jyU_RJ)BOksO#Mu6d@eeURCGaMl-xpK#fU)YXTg6$6Hq9L~qYOPlw
z*AAF<4v6lpu<HMhg?4BKSNvb=KVHMxD*Wx%TF0Vma$7|#;7k<Cg*tFTLQ(l!sErQ9
z<Af+ThYsr-=h}AG=8*;_1!A@-GRUPsmOB^fXVGDHEhYtYwy`|xsNzi>&+P=$1%$Ry
z30IbjQk_}ErMImXR8_$<o}MDbRPo)MVZ{R5h9$^1koPgQ$uR%+C(mJyym1kyRWZlO
zIh)ieniA@sRP3it$<Up3?5k=U-iA~`wdPw&Dz}lFcT{0k=32_0ooUPjw-uLYFU7OX
zHs)<ORi4Oi)H|hCf#O!3iHn_Z%{DWBR8_%b6?sNm=90xe{`9cFlHPQq5WT|<h_NZ1
zT*1PiB_m0an&z|~zU-C#dtx?lC1~(j<{`GdxjI=gnD-+v1whPgm>%;}HeG}Zf|A*3
zO(9KNHh%Ya-8M-3BrA+8;exT}RN?dMogThFGmHzteXQ>}CjyY@KKZxzVK36*TX!13
z5i>eF>J{!=e=@btP76(1k3;jtdy2>HTX&X}*B7s2#4avghX-MmSt}hN$Ea2H-erKt
zfnhTO0xGmn9K-zm3()Sm6xkvoFnCkj^J<3gq^-!u@3gjBd3Ln?$7N7xc`fr~pn#={
zn`i$8X{JS%<iU57P>{@OLt>$286RG{P66gR#SZ<u%@-_@ZhpJYLU=YkHU`)k^Gen!
zUWx4>>#A_gxuJTy)P|XxURhVMQic(s)NV1GXyH?Ej7Kd#t4za=J60%jWa(xe4q`H<
zrd3{+o*!8rR2f+wqS7k5Jl0~;JGM--1fOJ&r&@$Y`TU0w=6l{E7OS!A9BPIN5%`Yz
zLWgMlpgmga;0+rqV}Z#l?6BzxNA%u_D^ASp8ICPvAqI4qpmnr!pbD&eYiI3~+P@F9
z^Cd7gjF3Kskoy0%X7;T^oeW~?l%07&x#-TIF4!cf0x%bgUr$69$9yHZZ~g_Im_*K?
z1QP5&=bQrmwq2qsYOtp!&chL6wk?S}Z!j!0^((AJ6HGc0k2<y~6qMV*Visfw=q$>R
z7&;}4kZiOYC13L1w%Sms7ry<$nVlpccg9bsZ%f-RyF_--WRF;%pDc>Efsb08EF^Wl
zGdJEKvH;Q+(QP1|F3}cRJLSxpI**&tZ#b-qHT!oJyk$l&RTlnsK06L+d$>2;0B@6T
z4y#(Q&euJ5nR{r{c1pO^Y!hqFz?;9wWq0yC!QJ5V&~4TYUBLZ`<O~tS)h6UG<SK2J
z$4%ET_d&o@$xYcXpM}(REDOWSxS{E)a$L<l&Fb!1^7<3&28tkWojzMFPdcrog$Yd=
zcIo6h6^?1}fKnDz)QDD@rihDoK__a_kn5n{3dP{EY+!aysaP`fDp`^ODe*;$w3^c#
zF-q7JB;!sdH4-feApe_|I?un%0sWPln+3T2*oQSlt@v~GUL<{3=cKKd!FgavMRTEI
z7weCVV)T^d3*F<YU4KsmNTGTz^j|~asn}KyKDR@{9h~Bt)&E5nYW+)S&k^ZI)HEWP
z(qB)+Q<Gj7ch6Nau!dijKRrx(CBbaG@=|Zo#t&C!pC|N2qU2E6`H(U4ZZJpfnr^wV
za#Ap-e$SbCWgE7LOXT0UhZADuh{C2&cjw<QGOYJR%6{L@ifLmgN*<1#qZGV;EKDg%
zF3H9fsW%5s{kBWvCcih^+HzcQ97=<cih_%u1n~Z8Q2!SjL~#r7<HR~*d&(aTGC(aT
zPpU7Fron%f=RL)5$4VvFjBl)D)XqHFOZ;5wAa<GUd(;2klvyN^xJiHrFqMCxSfzOI
zxq4H_fN;rtOhJqwn*WV>|E&_f_G@cL<V=ptA&RI(bPA_Iqctpl@A7koeid~JZSAB!
z_&;2|1CS-r(lt75+qP}nwykN~_G#Ogwr$(Cds@@Bt=IQ{|NG;8FCx#09hp@TRdsg7
z$-URgm8cWOepICo1q6Q<7H`guSp+gC)~qb^(*F{*lB_>={F8~qGZoRrO-nlS83dV2
zy895>vQfMIyBP13K_s;Nl_U=vd3rg{=AKwxp<+S!Iwm-pm>qAcOo$YhDsN~_><We$
z0|V-hkE0o<0J_X@22z!A(+%Fh=f~R^0G5%>kzzlmBK0EorpLbnJH^9~#Ozv?+~0XI
zY@;^#(E)p&h^79=xhMNh9n>fXN~>}KvQMK_RU2ANHvz)Nm&k)cZH70M-oDra!L;&V
z(^eI5<3$ZllfqKS#(AvK@XI<4wO-w<h!7Ja9zjHhp=gEc{z1Aq_;_2I-^xm5yD)_7
zaop0%xknX@F0<lLgT}Oy7K}B3?HJV*NP_+zJ(K!5D!yRiG##~hfrUwkwV*)R3*7lW
z=M?^RnqlKkoraw%Rc%sVwfE-v?mUes&|p94olK#W(^P|bCn@=s>NZO`O&E?lguVnu
z3GYun!s(9YCFzDtH;(UM&%>|LL18(-$spW5r?3kXYWKfVT#SehzS}zLg#3!=3ZPLy
zg&QtUg`2~Nx@*k7Ttpg4O#E-BY_iLPHl2>~TLo8hz?u2731_Uv{c)H6aa~T8KCD*v
zjN^_Iri40!s6GSWzYavtZp;QRCeugbv9sa$WtfE3pPgb15%vFs!@K@-3g(r1?vaPQ
zZ%+QjqB4)Hc<vMPTT^d=!aL4e)9PGlH#}3v4w3vb1nJ3_==T#n>G@SZ_|{IH)H7ns
z$^IUWFYv_@ML&|S<z0IZtX8E0QP!i`IKD5n>)E7IZx63+O|9VO35$h+uNk-KHzr<r
ztuzI3Pid|E@wxRv=-Y-%Ob@?at$z^y3P+Lo1NK{zzRdOM<AZ&-5@miX)U8*kqVzSo
z^m(^1UbjNsDGrppFUp>$ud`9e7nM<RPw~x9$05ved%BU6Ty&Z<o^Z8Cyy46@`2zJF
zt%tMD@ahM>;hDE9V+CJ?`m~<3HI47Ymx`X=mlD4KPIUpr>@osU`PE)x`UM1ZjS~Yj
zjnlAjoyXdUut$;M#kbXAm^Y<=wQo%Sa^D;)nBQ(I0B=y#g?<GS6}d%L1^znAO5d>+
zS$+)_rC)l>zdpSyRv!t<0Ota#a!U#ta`XO0nI*a9+7-FgZ|VXPu8IO0uBrkGuKEH7
zt}5T<qK`79DPJs9!o9lEbG7jkry9~J57tGQZ>|gbZ?#3TpW@>+JEX6VS;gdUbjlc?
zZk8c_VXQK}DsQsA3LDis40sC!@v-L!(gJ4)QvPQMG6;_nORD~=dcxm-I-<XdI;y^s
z-<UovU2Q+HT=_l`tV+Km9vk0e&hX!Im%1MXD#K3vmEu+n)cuQkOLEG4^K**7^}02`
z!`@&%bI;V?dY7^upO<;ys2}Y<MIQA*$`EkE-&jj#u|OZ=z$4;-Rsz0>Yyv2cPH3WR
zx%|saR4d+hDSRaJ`u$@mD$<!fXVX)SKtj_$?jYc>Rm~Eqi$38Bq4J9>M*fB_G?^}+
zIg-&7t5p;3V5O<2%<fU7B}1U6EEq3TXe8R}DdKO17I}lgG4@Pj8HS7F8j99`zJtl)
z4zK<xmd$Nr>Q{&^o7<Ys_&2r+l9X5!0O2O!k`w$lD4xtJF~d41)#(%KW;EOLk?mc0
zEE(c?bg4n0<fkyZ`68~|%wLx7-Nb60K!xTjUHf))DN>+B{e!9bUtBqwzijo3iPbQH
z%JGZI1geZ(SQTm}iiT2;gsAcmi8FGS$9QzOCjBU0aJ3M8Wc;QOQ6$zBPFb7ZRR!8^
zUfVr8ZLLzvgi12el-fOJm1=nK07+Bvp*=)*sBC#1C8Gs|Ndg1T;@4QU!T@tD&A1@I
zlu?bPNU4c_6x<^4?Viv!<`lCiwtF_dJ8o>}XC)c8mu3FubfK{Gj}s8Pe?8f_m?j8e
z7!G13`D;8LGy$*>Z%PSr2s<8cM+x%?SDweD8bASuwx=b+-DOw?JP5aJ)Rj*z%d`YY
z0d(Ai=HuJ2FHvZVfEY9K3T0w76~zciY~VZ;b@mH_<3u0O1^?-?bx1^jqrXe&m-&s2
zodgCTH?7a7dL6hSeVv#~v|(=|_J*w<Hxj|Q`;(8?ZgnDB2>ZuUN(3X*)B{k0lT!=_
zJFC>0&*O^arCghjVQX|Ew~6yM7YhJtsx_j#w8s>Mz|_wdfek*@Nyj(A6sEw|Kkk@<
zK3r43{h?AIMtPOm1QmE7SBe+H=eMKD_a~uu-s^EB+mjR`L}kk*a}9pi*5Y7~1aB|`
z6~LhotusO~!`h3842I>gbwO|sqB7!?1VJqN4YFDor|U0u?B)1G*r@Un<9xr1&PWgo
zh!NN84hoYxAtAqVA-`fFx5Gy0#)|sIiq?n{_fkfVb-yC77kP-Xe?CY2jTZHb5w#N{
zZY56Gj34urJdh`K!a#ndLvBZi_!}&G#Sl5>`-=Q(dK+%@bdBPP9KjnZnj=m;OPFAu
zFlG=x1|xYOMtUbfdWS)JM?re$q$GMZn>KbdOwusit8hR^ddH6J2@%m1CAu995J!se
z2@vH6ZA7xAD*3eF$;4C>L-HgvAkL-6PoVpDC5|BzvXu?6_|XVwCl>}VK}A&k(l&uU
zi8f0ZQzdNxM$Q0;s?$b}1^--sg@<U%*K<VG4^l2pd`_6)nlR=iS%e?q0~}!!F8Z4|
z!HZNmN)$Vi_)gJKV?@(TL%i3=-OLA(HHvluhlx448l!w-B}#c>1*Yfl-%D@Z;lKXg
z_QQWd{5tfKy@ait6m6ek7YFR$S$G%<Vf01KpAtOu8))_WLD%-_(Zj6>-U$p3cWi2-
zbr`SQXzBz^(VytSM%+GqJb4(lQPJx-PfmX&7O)aw7lKU`m=pF%6Q^&TokI83DvTw`
zv|~(Mt&UIfsy(@?{$kYosMCw6(-Z$E@qQNbL+ANVzD-1fk&reSpYk88qr05B72C*4
z`&qgVocywK**6>jaTI4rW`85xI)TWoM`C4T4^$s1nVVSy_QJ^x>K{?RDXC|ZW#fk<
zz})NyHlfh8xqz*V)-&wB^;|Re0rF#X3yvDe0gd(z-&ji%#W5frAMqm{d|~#S;tXJA
zgeUddCp2b;C!dZMky6+{FUq}zW1i!Tj%I|XNQ$;kJRLzgaNgH!*y7B&VD6EF$J`;3
zh)x<u7;zt0+xJ#wmd_`PR<V@Ye{bq?#ICmc2;hz;SXdeHY^uIR*_cTe<H0eXze@L;
z=M3vH&HlFN4Q2TIiC+GC)k<k-{dcb~XFP1ea#O};E!!P}mLNRxPEa)&qM(2m5$!Or
zj1oaq%#)Cs8bnD6D?D;SP*oMYpnw?>EhVt53|3UkjF9>+@T4$!y?=F~&dB1}fgyc5
z!HWH0##=~#ti)cvh!lltTvVDlAyM}K451Seg^P+1si;Jy|35>n!b^$Lv|xlMQsO_e
zAqwVKwgcsNl04tG19w!$ZY@4A>kt<W7rC5Yvgj<NGGlf*zh~E7NW5p_`6Lczv93r;
zxpGL3U!Ao$cMNG7M$9O)CzUug0!?+{phnmjx7*Oku~!Fa_sLQFrt5}Y*s7T90;@-=
z>vq~;{MfGmG$VWtn{8<iY*!?oF%V;#`$%`Ox0D&iAF)%+_#`sXqvKZlSPh#mEbHdH
z3Qsr;c>#K)rA)pv9uXfFAE7W)`?L)wFNA?a#S4W=hfIdbUJoLa!|t)ipdavPQ6zzS
z`=co!UKoyJxz%27XdFR@>g72!4GO}~@P)7N8<em&K4Y-pJqgub{7b4`iqY5L_89mH
zt4^+TZ-)A6Yr(dPaQcUwpbeZeL3+6B_bi$QPuWEOxpVV22ze)7kYmmX+4-;x|9v>q
zNF7AWF1Xtfp7`HgFw4<X3Vy$^_eJWme)*6C$H)@9Fp2dcs*rYBMh4ZFSa|H9f;7sK
z8HQ2;@pF(3P^(z3nN>h~%bFS0QlY_TO!Q01<}#&(!IVg6LrsW8yeq~GeZWbDkd~-Y
z*@WH9`}oe=?M3EZM7e#h`YNf|DrTJtHkH$pW}OKE%K2GYu>`HHAh}h@)8(*l3^(i-
zgiw;|DGeSvafwN03K+0w;RykN5j19!kf||U7+dDnnNfiiMzb3RnD4~EOSH7-A9|Z-
ztqmPh#%!H<J)G72t=Y?zm1=!(J2I6!?nb<s2i><Qh`t+94OM~@gj)&*XXt!>4^_K?
z=*c4QYGJt->hW%I10X%Sdg7US?1g!~BFHZ20N->>Eq=XX`_AyxB_H3^r`twt%=gF9
z)A0PN+|TckZ%&c#tEj`P9d?27mj87Zrcd7yGc+|O!G9evmk18<r)`K%$Le2IT^}C{
zFB)sE5JILUOo}`)9OFBjwz;7ZqrEtSwy&HxHM^MV2OF6lnDJpt?jZVZg}20DCO7`P
z)jn|td^LV~@HG{2IK35~jP*uzu~-#L2F`daS#d$A6<QUEf|1V_I^n5S!=UW3)PyG*
zwQ(XXuV*<#?prQo5S<E(JL1aycFq=AasDef<G?Fp=iDVS$y`+41T$)WA{lExKa86;
z_lb)DDGvyeIT@_4WlY`YG=dr}9&nB27*d8E7FC*^C%k(L*Bf%|@~i5xiNdO65K%V}
z)i(fC{p8ucSPgH?rjKT0XFOS0U{(JK{a-)v-Tw`ReRt0!EMp|BrV;)3bO6e*0_P0+
zab#dX(FuG{^vW32(gE=N0r>bqpkxw;u`GW$3tJGViispMn-I-1tg_s6zqJ(<om_QZ
zcR3rci5GT9)`l>FibT`#AH#xjn2mdL!~9b&O=B;hl`O9TaTWWQjU|khjJHAf#a}Ng
ztdR0q`hn*q8hh@G)}-64*~!e^Qq<|<@uRXNQm%`X#;h?U@QWV**yISSWl^Ls7D*R2
zSwo}Q<;a|6uan?PEKMs<K^g`hh`5Y1<!3VaiQQ#c#zYoJRT-y?Zc7v_DlF0I>@(%8
z(~sufO4=Ww7Jbgx=n7`j(HE~u$ePkDseG3ouzV+*qI<00g6Nrir5fcbPp}uQ-eN4_
z_zbmW6w+7b7fT)=I2Osh2Ag8OjNZh5ExHNWZV-uPxIv-Gd52b%_zK%D`U%-{6Sm1h
zgqF&VhV+!|4{$C%511}O8C9GXF>bm@Yg%!W&~p4iTgjS%(vcN_+)1a09F-G*;*b@9
zahL6de3nZamRv+*ns-sFGVP$kmhFvlTO=r0eJEX<aFMw%?x1^O-9j>8;X@tGSpFx<
zg0#b~;#i@DDA504(<uG1gxk*-iZZuL<U!Pt$JqPVu?JzCwB*L2uU#UKT1_|+w?lx4
zgq(|wjE_rCe^5?7POAI^aUt?050{6t+zDzb)7hV7R<k8M`Wc$L&WCn)^8AM5Xg`K1
zhQJmcTYc_wlHqqHAndG*WAG8`kkPLKX=+a%-m$H?q*<w2tYB3M|ILVvCIC=~{>VA_
zbi(|+f92+h3DuVycOY-f6MMlm=*O6CGWR(Cn{-tdn>u|mU?m$C-5Hv5$}B&F3vDB7
zQi$N*WNua$=`D+<pXSH~Gxjv$Xo7J=H>FXGxa?X4%x3xEA>`w8Y+p=*K`G{7^L#r|
zZo15$QJtFGE5gdf;yN1Y2OkytiG3mzrlp@7U-JP)90B63W`^{a1nC;lS%2ekPLn%i
zP0#(c31t6G)5OM;m$nX4IHjL%@zihHNboxor(f9FMAO6${(M@YU)-67)8YzNV#;=}
ztQ{|#u{8`Py~p$lQe#RllA!zGy)Q(`nantssOWz5c7}ievr+yf>~n|HLNmd6MqOur
zzQrV^%bz588sR>|DTP_7Mwxu#&=*gL<my;h{BLvuIe>Yg$XJy>Jx$ir^Yk*vgNkB+
zpc9l0WUaUyf)hVP2iHC+5_jDh-8X>Gd@P5>bQb51Y6Tn@2N~|0kJ2rxo##&3{(ubE
zFY8^n<CUz;TD;o$3IYF~@Fv3`F!iW^Zsvp9g$+Sy`UV^JM;dwkXw|6ZmF^(FevD^-
zx6P9`n@u60@+iV#lQ*Jl`Z|H~UR8O3H%66pmKf_OPSWfiR(b1#$ui&+aHJ5vO-ry_
z1LhdrS}{}y`6M)X=N?E(j=@bTfMm#;J75tP#<;<gJx>ntcDCg|W-;S~S*=f5_-O(T
z(;mmD!&Z!$0{@#)LmxZ~8$P($34C+h5#wXz7F+6QENArywk7GmfB)tf@<oZ*xYkJ>
zMQ-@uIw7zvuvj)+%xlo5j1NoG>tlwwB*E3<;5xyuE$CP_c+6{Frgd;*h6epE_u}bB
zU*PKL?)~)ltqy%%II$VeePZ|eZNIl65T?VR*a*m|@0k*9z5<If6%w6}REiQ`S<3@Y
zH;x*|EROG)HShm1t&Im@WfhA8G#N0(P@bmW#nxWp#|m5t<kUH!@Bqux>T)n<0SE)G
zq)tc90<_$qZzhZwQkBqKTu%W|xD*4lKQo+XdEh_464npybS%t1%3#Dcns=TuohHO;
z5NvVp8qTs4;B=IwxcmX3%JB^aH{IH2(F6DUUhjeF3xIzFag+E;1Y5V8H!5scAO^Qc
ztHd~&2<lAd$T*9P5JgKygtKU%E#1#8W4WDBPRr`0<|bugDJ<O}(+LB4??4UvY{IPp
zOEA9O7yTXce(PwFI|KXkI&=`^euQ0x74s^}fRk!di&PXttJd*?H`A&KnUsUe%g{OK
zScy2x;8~cI!`RZn<)x9Kh-<N~jccdd%=gQ}tPB_ju%XjbwXPWz4nslE$?b&?!${Ea
za~j<ag2@^*umWgODWb0Zvf*96fQ#>2Zz5i+3Pjo6uUCARI&JUK*0l2f@N{xU$$NIV
z$j|F(W1*9Ts_lBlGW21_nlSAcZx^Q+fvo%_K>wZJSoDBqT#i2RSfK`M%V50?AYwYa
z{E%Xl<YpHDb*gz@#i5qPkGO7A>amdhDRc}S-yYax)LL=(E}4wI$JPSGi1yon>ZG8i
zAr^QPUF`t!B%-E~C)|p$SMZ_h%LcP<!dBV4V(1OL=zI*lL;I~PW&=;!<Q1=0^3k`w
z>GR^;l^)^`M<Hb^^t<>Xb~rXCq~V=?;);i|GfBy9M{L~}!OR_d;tGPYlc3;2USj<d
zlgA5v;>sp@i;J?;S;_4<|6)dBT`#(!6V=QeYvKw!dFv-OtK`-zxULu6&<SnkZhLF?
zY|~emRZ+#p^W|x3t~S$bHQeFo<k~{rE3*u|*dQbPYFs{rk&E_{(Fc3lFgG<BMF6ke
zT#&w(x9^#LY(;3mFz&!=>X;3t!)X_)f~$aH82+V%mh<~nme7D@JpRyR?2gIwRn}()
z8S~Buwi1a?0;T@um>D59%;liJHUXkFz+xRb@eoIqyOU_70V0vkJAvR?sN?V#bvB7%
zJ+4^J2mI?Trb``e7=9`X<AxLZpAhFV8$UrYXZ+V2V4G&$ki}Gjy@EsJ593!TJ1sx*
zp*t8VlXmF}%`d`b+TH~0RO_OgL+*K#4byh1i&OzF`<2kOftoZ~DFrH0hlh3_3{Va9
zdV8uk^2x7N4A5%OC3Wa|b)dv*VpC1ExjAeIZEMn#DkZ}f@!+3zx;2!AaSVf%&`lU)
z)9tY?jz1BMQ2%@Om%@gJTG?(D{Lc)x+GqRDXKx_~X)X~eXyz@_rV#|Q7ArHW2F14K
z=B$nj+|)+P)TtE0v39kvt_JI_dNfRK=9g_^4;Wt=H7a?8(zLLJw65~fv}YR-uf&4a
z?sgcm3M*8H$gbnw11@3E+Hx2^qv>Ji&s}^SAiQ|9xJY^gvZXbx5S}$?3!XJN(1X%@
zNBDQK*`Rg~tuk^hvThtag>Ha$a%3hBy3EZ?rL08~B^en%Eg6>Q1ySRnXbbzfK>jL|
z6;%QevqXY(<7y$LGtdG=hK3Vgq+Pj@X+Wt_E*^<m2drEZju%mezp*cwY5?8mi0U)I
z1k-cW7And}novYOs$B#&S~^A;TN|J8!KXfxMreS2Lw5YCz}eu0+2Dle$px$Rf6U-6
z9Dg0Rm$Y)caPNS+ET&-|*Q^jMe5F*dp(O~@+B>|_O_1vp@^nT1N4XbFZR6gsz9*nz
z0qw8|$ED6K41a~6lEjy2@(tO?>JlQV`qQZS(QM5a4{}EnBHyPAc(girugDcrx3x!z
zxOz~s%av2AsYi-hOCnx-B|+32Pa>xwmg2GsMbi9SbYYS^qRZGftINbUZmP*o^tV=N
zBG=0ExbQh^V$3N+H9?~53f2UFmomaUNE~E6<(M24784f@dW6j|@jg-V-aXQum|C~u
z3-NG^FgjHalv(@b9-u`9oyzUQzem#OPZVw)Wb;4ci&L_-MVWr1PuNVYG$HSErxO!B
zn9r(Q5&v_Ho5)9*|0EYH%ZwWx^iyJyQATSmfBv?NKO2|#eD18Z#KSZ+sCf^38s@jy
zUi({awisSt3U0Qbn7Ls*{cE+@bSt#o48HUFWxFYqye?v~314XY4sW{&mAsi`u_>Q#
z%M;Ub3A@qKXt7COVA~nea%rBtm1VJ6Q(*g!X1i%`v1#|?j%~So{<qme;LL4sH`aL-
zDugs5fmbS8Vk|K~Uurxh<OUK)JIJKoj~#BK0k*mK0CNM${P7G0-2lnl9Uu`;<o@%u
zhapa&o?~F9Ny6A@Gr+&Yfk(V{J6iK{{rO^#_SK2^_5SNiC+1sS81<l6Y(kgh8opdP
z5Kp;k@fAMB%JL4JYPke#DEoVK6U?`(jX?GAEf4iU$Z`>Q?fu$capF<Pbq-=3DHOhH
zjJ>@#^S(Io<vRGq9_qU~vhRDz?7Jdi_8Ej=a-9+Y?{#K8LoyyISlMPke=m$+=v?w^
zQYjT-yupXlU+XJ2;vH$7?Tz(YgWtS%thKAWXYxB`{36AqLAp2To2L7x)%|`x_VIf`
zNe%GVWQ1^SiP9fZPm_p0#wOVfL?+qUg%Fl?aDJj<11qK4NvYwviFgM%^a0kP@|4x*
zl5l_%*{R(ZCOI?7$$24MgZxD<KT!^ckI0-ukJ#-)4+Y9mMM)H9E~}8IE?ss0sHnjS
ziGxEH(?gQGJFJHPWk{Z{uv)LMKdLocJ){rEI|&>UO~ET=_}}7>FTcPyA)}j=Fzr!x
z@v@*x)=ATiq5`;DBsC3bfX;2|>!#5Wylu($va3;b>&W`$bhKU;Q^ot#bINSdB%`a5
zsmx?3##=@u<#f~*=G1=#kl7@ib?6or)Wdkqy|Z1K%@Y0C;jnBL6IX4$?oy`(N7iW%
zOtMmZtQwOJ*&)`AofGVB@STQM(s3J`iFY<P;#FGQ4k&cI@3N{vUbj{v{x-UjBiPO=
z8=p&y=^#+A>lY=oY&T_BBUGDsN31kHmeSb<TX=8MG&R~XUYdEQ^cdra@6^GSlGxZU
zxZ9ANNVL?uwAkYQvByzpv_(15XmLMf-}H7VwT0%h%95U4=P!7+VF5LM*Hm2p4Gq<z
z5W=dHnpZ!K?9=ip?7e9&OtA@^-)NhE(`B15hqK7Ao(c(KJK2Wi0amdS)_=gCOg?{s
zD9VO-$VOlWB29Z37x^lB5O)QXZ!BCM?eam;Nv9RThG?Zv59Sl)F1Sl0L30liNN^3y
zKiCJ72&Q28CpGj-cAxn3m)bP>%a_*cr?U~4Yx7ElALWT1muEL6@VF;*35gJ$5$I?F
zV+_grpXH3tnfT8c2ks7V*fdI=+n}R#+sc5Al>m!P$V6Kd(lvIG$V+R<X4_D&7QDRr
zOVC1Fj2D|7VVO<46Js98Et{}iu}!1oL=s9e2_^2C0hi6^n}kbH({=d)VOfUyKL9lL
z*R#J9h_8ss_aPw)Q{nOq4h^rR*;&xL9K&E2sBIgZ+Zol|x$eOw9lsYh+KumzZ5Lp`
z*r-_K*)#}g!WE%(edI@H5{fq+HjR!?2Gq^gz&D&=GdJr$qisFFHgCX9*X)G#e$;AP
zKjG*%Z5=kR1W7jaY&v`MV=fs^488j{i&!Q7MF4+s=fRo=W`TZh1x-!#xW(6|>n5+C
zjsk}*c*fG(%r?(#(IK!HB+^Z-+Cm@9*eomDVSLX6PcZD!=2acSP%=2<2FOm{fZ#gT
zsG%#StBm}=8SLtSd~Bx?!)Tr}j2oMxH>~J}%<c&t`ozY5USv0^YBPl(h&R>TI!eDG
z1Kjk5S$+&38u!|y5P~;0Y+YK|>IIr%dN;9blSUB2#VO;eKAieGPM@|nou+v$T-JrF
zAw`M%=6OHR`+hry%36JBv@p7gAJkMS!f=k-y<G8yRj|$SA+a|1Lr^eFqhTKjN2FY*
zgsIRdDH;#lGBy!AOiuECzZX)rmZ6D}QKMiSWB4C0<=aI?Hc#Dc;FbeibvM~DiB5Du
z*eISH88P^=K{XB2nhou`$SHL_xU|Xx94@t9@SU;OU3q$OnpX8kop}x?e(^4!luzu@
zbJ9Q}DluK&>6}I-kpJw?*^kN-?l}YW7XT(a3xNV@SeLd(dOsvF3v$Fux9}Do!kMcO
zCpQe{OoWQf&$+p6NZF^6-A0Z;v8R%{p>5pMb)CMnr&7b_Znlg1*5JXXCx^e=Kz>c`
zA?Hu>4x8IpUk&a=NKfXHRPT*Nsogl`*4IMVYX+qB?}GoDpUL>&Ws1tX2`qz8-Ja5<
z%-;!T!sCSg?kJ{MZb00S8zK2a#t6pJUOdfA0@<=iGsWaG<xCxqcpPT$v>1YqIhQA&
zW&Zu%L0$R2OYy0|*_(0wOS?ha688McyMcon*6)qGehu^M<r;SV8g?hl6BlFmmxEBA
z$m=EMk0!84m`PYH_&7iKp$Bcz=BSX_JLufT4p5XYGw0>Cu=Bfj85@7d@x@|()+fml
zE{meI5A5~2K<M*jqhY2m`&8X*pl7<iVJ?KsB}{Uq8p%3zm@#rnupJf{&Ja!D%&Xpy
z{$b?6i=N$(z<>tk>yttFuWu}Ih;8Ur5Hz5kKj+e0SDs)m@_U~&_DNhbU>=yGdmk+*
zZZs20u@|pq^nHVz|3mQ`-J^(2a}4n3n%nshhJAOsxK3HysZ<QmDEw6`1f(AY{DB62
zBaXT&x7%P39_LH*^bCJ-{bz2g2L^njH+1i5i*cj}f_&|HAneK4g6e4y{2i$Yai<^s
z9g5RRATG!kx~DZ4!1Ba$gHpn<Ior?n4mJamk{3c;^+EnyIV4*ju5Q3RQo|w98_fN1
zrVXP;!+}0c<Hk7W>RaaO3oq0Y>^bVixTn#m_V5wm3w~5!t>Ohj2kqOC<{5$A*>pCJ
z`m0}QSb%flGk6-eb$}>VVh>ZIeHCKw7siD~-D+*2zXQl;aMlUIN9<R>?ZqR{3Bg~n
z?_K;i2!9b4h(LCDXgplt2ZwORzWkt7Tx3}1GNS?#V19?)x;Z46D7@R73=$xAo{4^S
z3Cp!3N{~+6aR<o7A0dam5R#Z@59}e(cc{?muutrpkXou7hvNW>=p4P4GogCDy)dJ;
zfz#cQSq*RqiB!K#o;&zhJB#64ON&vaF*G+-ptC-s%tClox1~_8Sg&1&lm1H&VBT23
z+*$%uHRETK2n-$`K%&Osa6oTw$0;+Acj&Di4s!l3QNtp-4VsJTAMKP0mx`oATjmtY
zSbI-&@-zn|e=hw54rs5MysQ$`UAtH`8n%VAef5a$vs6fP2fssSx~K?o*3meY4iBd}
z5YWULKk!8Zr41^EQ#gLt4bo_aL&!dpsw?a*myvGBEZ0Bh*q7{mHdWp#Pch<KmpRD!
zy&?KX!!$1;Csu%@1d5~+Yp7E!1<}?#t`(=YAxA5CZ6REfdsC=<EIi}VJlJpUoInP=
zt=;rO9$i=10P9$OhrxLaJ05-FA*O)v*e}urruardxYwK$-6;Ag@>I&CWc7Mkvcs8(
zx#qN=zKoZGMp5a&Ye89^ggu(r>;^?glNkLr37JuJH!|yqi0lU8{XX@qI?AEb7{(qx
zdw}ybb^i4JTNKqm*to%3+*__*J^Wnfq2r&?==tlmFvC4qhh!{A0)sfAL9}=eX0Q(v
z`U37g;UE)`6*sxC@2Kew*S6R&7Z^8B36X&hXfEgPKI%~$&Z~5gUhdR>*HPiNQ%z8J
z+$bnlS`z9}W#mK6uW$zDyTd4_6zILE^T69>lZH;w3g_w!I;p?ErOq6-$k5Na@q`K7
zkiy4Iy6y?Fct<+_XRx14h~@nAxlca6KOPriMyC;CPNkVyT_-#~4<+2p3UG~%x4o_r
z)@7h-faG?X7CdDCrL2nShfX#AS+#}x+-Hwlo1htc;R*iS==Sp(u(TmZm`O_CfgoN4
zh@gFW&%Gs?z%fsAn`X)(UarA9#?~q&*aTL@+A40{!m+y8gi*!f-Sn7X(7IfN9>)6K
zgqjHWTyp;M#)a6c+ef5M9(0%wJezhz{c_4Ct&b&;k{Z=Y+~t&*;PfLzWBRk#CRo8m
z??^r|c3XS%{S6p}Dpv%MqOx=MBGt7Yqh@VVj~(SqrWU}ow%2nt;Gv`zvpLCB?vE|V
zwHGftvI>*L%H?B8w3D6J$q~fv)REa6%500vctg0zLyM34GID)^ckTnR4!EdL^r^@P
zwhAMc0jswJ;P}`b&C$iA+Iu1T!NxEPJ|Kw_NIfWt639I;i5d{|le0V}%sIsB!`!{;
zDje1#e076dP||HaPqb75`6q;SOo6-E67i(|I;jDH9q#q~D?FY6v(}3d>;p68^kKsC
zWPWR(nU2-@3sAP^4<UKc>$`N(yG63*pBr;5&>VN%+Z=r?z#b82x*Hp3Y#0&uJMX7s
zQy=_L@etUBpmra8UGTJ2y(Yz5K5=ujddr_0j@7)2A_NEP$U@_Vq-x#W9X}s}YEav7
z|1C3!0`nGCVgix=p3Fhnhg<C!j5%)TYr5G~<NJDqcILT_7>xMd6xgW7Vot7LpF93u
z+ylYLaIGG-hN<z?e<`#Tz>QO~N=B&&$+Y_o#fj4B<$bh#Dx_0)U5P*V3zg7#0X<_B
zxmb+W*<{Qzg${M`K{zF27&TeJEwD$K&w))#a+zraEhP-Dbi@#?cQWmLLoq3tjB21(
zgK`1mqzl>PhfR4?B3VZtZMSj(PUEl%*W`&!d2}LKNgr)TGUn7>TcVk4OLCPdm69Pk
zRk5g@J3)$K<OTWAiev;_8&tiJ<F*n)O4tNwh+ZBAFxJqmT0_9T@g3i&3M+sprVu^W
zZ6kMIkUMT4*eiM;iYPK)QJB%O37WytM=O2uR>g=%<g1&767|9xcKsQ%;hM>GN916~
zWUOa2-Zzfu9be>$PxOlqaN%wKvTWka^>e^qvg`v7aZU<Q<IQ;RIm|vRkR>dL0v3Ey
zbE$9_a>3|E)FCbuqW%m}shNfN3tEu!8B@w@*+A);2E}zP{0c6bzR?+%F(-8Z*GvWD
zjusv|w{<_VIiBWG6#~tlxIv5=*`Efz1Kg!R?A&rU&5O`GoR@Wrr$K!32p8^edv%RW
zKF2=D@|;<NmgX`q{p;BD+?xZlGfxh~>j{uE@<mOJFj9{EGC6K;WVPI#3H3AEruB^o
zTIaZe@>~#!l{2dr+0K;JySPG^GYL(h&bW9dxC#<n6pLUp?x$AA5Dy{uB3|pS5sCvD
zWJO%ZFzUyp!Ys$iduGSx1Cqzb1En(zA+vw1Lu<3oLoR2k2k4JA2JDW-_wt;R9FTuX
zDGgvSvNzl4PQjb;2SyP!=E|>pW;`1m4qgPLz6>%*orl+?>rWl;zSSZpUp2g@_|~bz
z-duVi-1yi<a$_&ObX9ggoeaRkaHpF06J9mU%)YJM`<-$6C$ZL*D=w^4Xy(je*Bvqv
zX?7nocy~1Dz5n8jJcFr>^^D=30ppO|(<?|HMhWFY?bIrQ`UbA<zwrK1O%PU$w`ICX
zCvcb1p;1GQ>?n!`Te1`RZQRQbSI89`Xo4Gu0w+>HrpM(*LU6mY{=V)rVZ{1Bbz{W-
zxkTQ%d$JALChV_4y%aq1J3!h7$NZ=-pOiNcio0?7eFPFj-}npJ6nO>rsJwf;5a7oM
zhORkb<TEfgP4~pS*Ilp-+_i!R$7+~oA7~?-_I)15a_L7Oc)z*71GHu~DKGr{y^ej?
zE<SLcxC#0kk44%}h;Ndj2CnIWzMLX%`p6PQHBhBo#gZaxFqJpef-LmvhfbwQV|1ks
zq%<rS`qcm~&SXiedS>Ge8rWE;6@ucO)CqCAY~!*TXo-hj(NpefWRpyPE-U2KJFOh^
zmqbp(6q#NK&B~)K$bv+~SrKT{hgNly%5W2URll5`B);yW5`E5dlaa1I{s9J#Fvwni
z3#=K8eH5q`hcf`!dMWvy2xb^Ma(<mH2o=d7km-U`o-+%hrJ+@H*v$2rLHwBn0#C!q
zZ2y=WS%&0p!xll%K*8L#g05}P2{Eeq%{ae|%kR(}09M0Zx3-MV@7x?VU4vm*S;=DK
z>>8+7W4?=664#Lvj8aoG{Kw#fWo~mdIW)BLZXifi&F<66C@$HXMr0E$4$$%$<kd}@
zs-<`J7#td7V~u*dCHOrN1+6@-8wK6%<SIa2sl7)_jk_1TwaN)EhVTWs<3nfPVmixk
z+ka*KgVzAGLhV`(qM&Q|*FG5nPp~29YlIMwy}%~g!A+hKLeFYe^YhQ)96A7jn{2>2
zZZUwF8m5~rYuX3rnBe@HTgC-8ppiE60o7H~F{f@gYh4w??sMO@leb^+9lr;WR$(um
z;_5fe2Y$BSoy_{tR<q;9LY>Osq|tlI9BBH$)6m%4%Ibt{+j-7Hrom@|I(ut$)w>5e
zdi{`gCO1FfoLs*Hy0*SOIJbJk+`lJrGhD9s78oStOlN0ruKY7dy!`+&{zghDo|JN{
z#us13Yo9dr?~V2E0;5;oz@7eZZr|D$U#^BO)ew!=Bvt`*Wk4+j;A;TvU7V#~n@S)T
zf^c;xY<=`gzjg{9t^sH@AUEyjh*eH_LgNA;-nyekwddYTzbJM|OJ>{TiD<G9X%&%-
zfoT;xB;niiPKrj;)|JPq&B0{7SU(Kpz1sW+$h)KEyzr<y?ec&>VX|%%7~Aavw_I_s
zjXKKD>3I)32(F4o|NPoAN9)kx->^zfq%#9ZwUAfAiG%m_OHL*fXWhI~(Mf>3aIptc
zaDgXWssp)71f0Z%!n)&HY*86HqyZQ5AlY1z-k5Ymbiy_{r1^@viRYW{&^2{(n96K0
zp00c{bZ-6$bP)i!tOiY7ZR9yy#~-~JI&u8!e0Q`6IW4&Y+$8JZ*tze(_!E`8*MJ41
z88Kk0(mx3+U)x9#JOu?3dGs5KwV1+s_xIfpFp##}u4Tzz$YDs@5r}qt#vj;$9{!CX
z+S)?3YRe7rx+?8Ew}ZOes?Ja9q=R*J56QTazbStA<UH~Ns_A&|XM2uv7~F!f>-0wX
zcO@a}Zh(Ax_3f`M`9{+#QkW>!B6dV<i?pLir}gzHQg~&Q=Y|kw@thTZfgji)fQ;Qi
zk^d1Vq=gCd`<e5H%W<6(aQE$|6efO+QF4~Op2#Mf(E6#Mw#90SY@_Rrp2!0ur59ac
zhadUrqw1PVTppFM6k2wc8d7=o1y2hur!s(~1%vGAUgH_8E7UDRB(RoJn7DWGZcEK!
zt=)0}xxUQ671cpq2=Eb>bqYOl#c(Ai)VZTPMvvlO7zbQ5TUV!a3G<ty->aeC{qFGK
zC#)TSxDny%f!D${@5hd{-Xk4VxrrwNN}O4w&CNkL2y-%h#cc5LITtwkfjLgK7ESm8
zY7Tj`@muCK2z6857Giy$U=34gW6YIGwLYO<W+Z1Ra%CFqB4E$x9s}KYS{4wRTRaJ_
zZvBf__IsYsKptDZh}%vCLG@RIH$Cr=Q%(e-%~#ikjqjK?&IDn>SJ!*V@1VL4xgoh*
zrMn8xmcUmmr1PI3Qtscv6>SXh6<1M3E$<Qq{Y~4SDD`a&H1#pY1O+gd1!2f61xbrZ
zi!2TgdVP)q5L|z;GXibZfC)ZuJ0M9yaZ|-+s(%1t`Z-Efou1PvKQUUt6+N=oQkMHr
zC@JIb%YmbWCv*k{qrl9{<DN}UW2O}z<pkUkIhC8-=5?i*xlQY>{?)!Cu54O1Xq|sW
znbN-uifDAKaH%=uA|rqGnbp|0EU~g)Cy7n!HrAQZ>%*7PKw1|cQELj$qBqKEqYAjN
z*(a3>pITwbXVn!-DOb)-Rhyk_-oVPk9a<!!I(5p(tF*$=HS5jGZSj8?E_~>=aEqa)
zjF5juS=c~Ak<humP#6_?M!Cb1)vBz~ZF8|YW3&(FQgsaH(v=P8!q7dw7U+D0-VBP-
z(9uH?+utfyA}f)Q5gV!zqgD>ks~bRN#Q!3Q@K!>YAuNZL;xaxyA!Km4klx<qjGj8;
z4D%Uu<f)#FUn#8SYRRv4!WAxc$d=Y{)RjYU;Fa{>^Uw-6qD)3SbG9Lz`p2oWHtv|_
z@Iw$(8dgjmvcj#5>e4R|v6-z89y=$4M>%%Nrtq6QHGIgH;5U9Cbn?Pv{$Ga3#RrS^
z|F`2;FHPUrXna6)&b<%b1+;`X0&!^=QQ`lxJ^fqS(ffa5@@ZYMZV20gG(ITRH`f-S
z--0wB6xw?_i2FToj#r)WyFGE}ul8jJe!rIgBJ4q-G6jbPOp^qxk_fBBVP|?5<P}q3
zb9)%)b(VrYJPr*AD)7QSCWj#9h+-a6ftc`_838EJQau+8i%W?wZdC(6b4GWIN~yD-
zRf7rm*mh$};dvjH$O=mFsZPrkCOom@&+zFSJzR#a=aWkCK`gJC5^L~Lu#T9L=J8>$
zuIm#Kc-fgpO(>#x;Txv*NzeJ{8@BezOZoJjW)?$qZ&=Azc@+|Ma(*Awl!C?FHkB0f
z+FCRmTWSw4rmoyK6_P7pY>eE)ULJU+@}GOgK0Wd(gn8)asqpEY!YXiN9-hjld3nt(
z=j1%(9gBIbFGg+OJe2r*y+JN5YEbTZN=ZIEpiFqZ!Km>uz`*f>fcBcl&kfyY&P}nX
zp6q(+dCc4c=9XD>G0!|@Fi)|_qVJ>8OFTy)8~IE^4|7^W^>W-pKyt<hkY+mv5OSVF
zDs!j`4l<}yZ@L&#A7oJ`z4;L<z4=k`a!!pQW+nbP=U^Fg%#Qy1H7o0wevIPSL?M%X
zl0hc_JcWMjc@&Pr3o~TTH#yv$Blgd4*7&x}Ji-Hg@t7|+Lcmkq!Twmy;sw!0Ow=>B
z9U^%<EHdPqgs9v`zU&lrorqeF;4|PmEnEMUJ{f8#8UF3kPACBr|A;629NSJ5%oB0-
z(tu#dlRaSL9!=DnUAVy<#ngjcL}a!#@6iV2&oK_8cgueePK1uqoGmffe-lChW4$*V
z;-(y=4c?riA^YdQW%!`^$Y>vFqrKQlTewQM`{p6#xEgkH_p1$e$NbFKa6255bx4xh
z8*@z7ut)3JdPY|`1FId8qjOZsfa&w0IU(qH1q5+sJx_v8k9jfjD~~C*iR%f?NHOL}
zi%tTN7NTekLzZON^SYy+vcH7-AgLZI;LGjX2xx!&4-5X7j04VaWyc7T4<AtFIXa3z
z3A2^wRltZdMs`kb|D|WZ=M&<F2hhep%7!!zxWX<Z#(5m5q;4g~MI1PoZl<~s9pn{n
znSOD5WZVb!0FrG~&NDg~imq}8pvAN<ONU{d`ZXYuiFv_e9aK-uxXWz@UC$GO4RZ#J
z^D9D2K_g<6aWRtsVrG!GF_(X9SZ|J|vl27~ESXXA6#t<U0Wl^P{w1?(p_|o#S=!z}
zysQQp-|mRttA-G__jT~V2^f9nY<l1a`qK@UpSubS(#4H=vOI`b3nXsr)wBw_-=)4i
z<(M}kDbFBS62fR|MVMAD#2nRo*PBq@pZ|Gp_4621O8_5X%!iM_kL-b>_9~K({7`6J
z(|M__Tozq)eW$i?cJ??HSH9S06?7A-5Xt5Alq$1%vV2j@kGK;{_mnCOd9sh98E2u)
z%MfN(j1#K<$>nKECE$6oaN-%*A<U0fw`S5)tMNVRydvBW1{_7(N@LH33D={9J8@z?
z1Q2lDDuU;KK)J6s4WD{~KLo%&w%zk1+^v)Vs%Yuxf2(9++>$A@JuVF>6faKuIR;{j
zN-CCBu`0J_QUQk?>NHUPzhwqtBI?Pzv8b^~2H?<%V_>IgcU}n5e1Sl6S*qIAvGu07
z20>Z>{fWTCAz07Yw@4p!q_^39LCZe$fWLC;8Xb}0?2sWr|DhMG&wHol5>3v=ADWNd
zv6#MMHGG8g3W)Gnj@QFk%HZSe9Yc6@6BJ6$fX+whUHpNo-wst==!9J8ipp<rhf;m?
z18}>Movqm<Z_nnZJj0y)`$QIV<~v)0V_bbl^Eupt-0aFSEOlpz+*@^+=>)s-Y(@UJ
zC9b+{FB#;{BXxg8_}IOJ9QBM?@BNHe>dtWM{hW}RZnw`T$nAmP+*3VWBUF`n{b2+h
z<)5Ly3u??o6;``!_dy5HLnXaVLSfc&5xlT`t$?$%5#sw}|Eqt34SyO{oK$S6w0;X8
zX{_%~y%kImY)8iAcx3ql*OLm+T1SSporBXwK+lO!yNSRdUo-n+O!W}kZZ$r+RV>Ti
z(asFilm3GK#WvV`k$1)tnK|<h#*=FmRFqNqD;w-We8=i6uiGukX{<6NBa?~&)Ev5N
zclt9_V)*dgZN1B$VWQa#@oTJ5hkVSIwSJdh1>zCwJdf9RggnACSM2B^BlA%!<gYoB
zbgmesFM7hFxn`@+yN&XT?~{eQ_-J2kM1j_JZa>3%Ji^23Y}z&R-HqNNZMd*S>SBCE
z70bH)S@zG4E29QZLqwPR0k;Bu8{B<{8iL(mSrKJBT%pqjV^FhE(O*D<G>$m6EoR0d
zfQyIizGbg-uQfki0cRvCgW6_@)Uo;j-z;YhwY{rcEEQvv!-~9oMfy5Q(a=TO?T~nJ
zgGp0aOqI^nh-6gmfLFvR@CU>&K*u+sR7F#F)TNV#6>Cl(*)e}ze<Y_B5J}C|^B%Zs
z97LoQAfEl1M-m6GSn8-a4mOllLw#&i2gqHK+V7}Vmy2c1vw180FbUhvi2L23#a#kI
zSl6><?f!us+Xnf8&m0f%HGz}fczBgKW$pF@&f5a{mCxwh>a9jq&-gwUz5&`FM6@?R
zK6@l};}S-_3UFaQ2@XpbFr&VXq7P*89tKp(BWaS%K2k*`wXE|m6Npg^8Ed|lLx(g9
z*zeTwrM_rV7zSi_*|pTCXO%*4?^cOKJ=&&Cwd|go8ev`M-a)dDmSeQJsk9HLW5~Io
zHcwn*@VQABPwiulxmmh5uj6C}Bu<N~>3<*D@~I6}GEck{Q*WE|%zPD;{?wAOy=~0>
z?s;m8sRgmUK9}r#=blgV{c|e0bMMkrOM`cOF2D2qnAhm*d&0XT;}Upn*0IJBP;&=Y
zWbg_;uh*k-!n9-PHNX*)^VBU~`vO?l@v(<2un$4J#Gx8`-A0~x6^Byu-4DU;xfL$4
z4>G)yL-pyA8d&UU4Sniy50&qE4q5e83EAth98len7=Yb@C7OJ$uUq0!(Y$;YUE9l|
z@j1_8xOk*Plz%~o#_*jCq3JmsVB3M->#;8`doqi%?5Q1!>{&MMu#eH4ZdJGW;Rp6S
z7HqdB=nSq3JtMADSXiHfl#LE*D{AMYCi<?wD~A1rK*@h5j9JMmMp?Y~EQgih3+R}*
zCbLlXvrqZmX?ovUa~81bAs!L3-MTAz^1+_Dt9VlFZ0Wj=la)*-M?)!239l$XX)z#P
zffXL(N2BvrCrIJsMU<u`O%VDP$THwYEK)lk{~Mjf%By<Ax>z9+i;WLSVwp}#<|0;o
zF3W@<ed5+vbDRn1XP5aHS?A6<3JF$<w0yXp-Ezj?{ID)Qpb8i8zfDvhUPK*!Ftvzg
z6#qc%E9XKZ79jnr=Tgv@NATeibo`l4^bKAx`kIjR9bQOm$7t*Z53Ksy+v1Q1$k&Hr
zk8KCxrsta1^qsyBe@Be-;vFgWmA+qWN5NtGnI+=kGYI>HS?W%Y=(MM@sO4JY-;Ex{
zw6D9Q%#Pf`#xu|9?mI~H4Bo<^d(^}2)*-Sg!M}B(jSu1qid30cDJtF)ulDf1^{7O`
z+xi7oDpG2SA03>gVb*wsOD2H}sQ5x#`oUfu=<ShSvAC&<a$TPdTC%^UTy~n@Qf=d-
zFmPp1-0B}F6%NKy{5c${2asdU@o?hoe8E#WYA502vj;}09}^cJ2IUj_86>^T98*S*
zT|oux6TwxSnBa{sSfT+y2XGhNfe!KeM2R!;rid649H%q&5S}pt=GO`%-wn@L4bK$!
zB3<-9a!KRa;|BXL;2A@X%${+*1gNAN48I<u3?D1=69j-W-%0YD1+cl_Om?;Wd0`*Y
zLX5tY8CP;4Sw4#QQ2d#Fjue8?z9Qo<6~Y)k)eM_^sjKc+L*TwP>c$N);9t-C#r#3q
z4*Y`x3}lx4@FJehr5bhwnLpT-2kj|bKj4jTcp^5hDdaw4B%S?D7RGl%9&TC*8Qyb=
zYhQWdIX<e#8U1nYQok*kp%#-qFUQ`$Vs$04h5z~16(C7bQ?BJvk|#?`DJU>d_87L0
z^@(joP*Q4^y@>8fSg74yuE!l%*v%1^Br=D;3StdS!QP4elxi9Vr%N)i0Q6S$f;@W@
zs8cCF8m`t5$LGOG!|-gDM;ld@t7y4z@65KCegf$O&jA)7-hykzJ5o$PK1W0^t>?dU
zFbP}z7{m|+7REgIN5@rt7~LOL@(B-04YxL#biUeomm-60gx4eEhJ$TC8Ub|Bn~d}`
zNm?mb7@~GQ%096sh-s*!Cu|1=9J}bW<D+zt4PWz`rNvw@_hJyhl*6!gs?{4*^HgWe
z3+5N{mp#K5VP;&Ph)CiBq6ZHmjW(8^V}bv6TlA4OR%iz8&M%BxnyJ29zIYFkUFeNP
zw>Jz9n%qni9`1D-3zbztvv?9Y+{@xnR7l9kclU=Vt-4I5rBwITjF_tqMz<yhb&R2N
z{rE?3A?|oZ?tneB_IXTy$`=lBVmHTUasBg?iO?)eV&zVLfav*3Tz|9)M%2X6H(VS@
zI<6MvH-`(Fs>3$<-D{ZM$l}*$E#I?WH*bulk3t8JMq_7#@ylUEl?Wp01fu!`fGYl<
zatF+Yx1VZ=r9B=DZ70*m@<IDy{mF#?9z~4(o{4)N{^;R*Fu&)0!<(6pF$e1kHopT$
z>hB)@@Em~YuMmFU3kmh5AAfKSH~!V5xV=L_{b~Rh`4YNm`bImsAb@3f2@_=aww~J&
zfE9lY8#MifOur(4lKCt&Z1;!FEQ+Wb{)YG2_s4L1D;===W?eh}M)bQ;2ov~V*=_MB
zmwK2bGW&3z=baY0XU$!DVjxuiM*erpAa?(NWqE8Mu7ATIvG_pdIocaZ`&di9`Ds0-
z|E=vb*BhICTT9XV!lBsTn;`uq$J*bUk^1N_xA>uB$@dMvG1QyXa(`Vo`|`YK_XXk-
z@J)z!Bp_P)9=8zpNnw%tO{(`#K&<hz^fc|O(WUeoc<Z`XGVaa4==d}3r1mTK#Nf*y
z)b!h4804Ex=(v|Y{euIv_q$|n;=6Nh^}BR#$6v-{&|e4hvX><Keg}pBNdR%>l>nLt
zr#$2{hIG$@q}icIDdfhwP?D)YDO<Ax$w{p+(b%dGv|hPT*;r0?)iRlsf15HRYYjs2
zn244BMf{A{96+#Tgtwx#4{X<1qf4Cf+WG-$D%_qvfiNEh(+bX78ZJRrl(Ort9i}5J
z)T;9>@U#umGhrNole2!@6fY<YO-h<ix+I7gzwOP_{fwgMWgjGoa*BtBC<+G&O&v56
zNlB=uBv>qI9|@<3nmp6mI4cE7$_3T#v2*>|z3M$Ekk!azp6lyo{@eYxTcY%VuB*S|
z3R=<ncke2iHZQ4OzL?)n$I(A=HHJQdSdT)EuAvAbr_cn4%V^Ljtb(u1P6UESW0`R<
zY3JurG^+wc?Kv+2CN24GPM?cD2VO`c#jaobcUnrOHzUTAy9)S<;QtR_ZynqA6MT!d
zX_%S0VP<A%(l9eQ&@eNTLk>2~%#03mnl#MJoQ9d<<$K@n-aoFMo;2RoXxICZthIf1
z=Ij~jgXG>BC2eSgJ+|05(`*r@o6o|O6%aLb9AX*?jMyzeTdWp&I(ZsN*)u4&IA}O8
z3IB2iRVehgvU)iz>Dv<cG%t11=|h?$40K<y{7L00YKmu|c+pRY5}DZ|LPH3jsPpq#
z4anjuNO)WL(#A5>;wnV66*|<iD){LYE7X!I<f|19ni}~qnU$5?*#)Q+FtMoxNl5kz
zG>gb8YN+MYUyF=hA6o>id|No{#wtJ-n9*j&Er@ZYx>mm;SYPM+=|Vanb^*SmiL0g3
zwMSS7XVB_ROM{?C%@(@YvK`QN&uUY37LwK2sa$gwOl)g-T6PxJ-z4sk?M72QjXdPK
zg4QDX0%<oNGeERLeU<9QU@#kFLU%@?p~9c`$D*Vbv{F`C?1q1mn>Ea5eaKqnCgg0D
zWA^pTxw75uD?y(A*q}v9ZNv)Bvfh~rSmFg;x5ziicDCA-zp19~qOqo-U`72Dc#q_!
z{Q}0U(x+FS>ta@)^&>5^7EVmJ5{~Dy5KeBh<dz9;<S)!y8J}@DJDjmN!?r|cR-Cs>
z_>_2pPjkmA|H%36=``kF2bI0{3i#Q68OC%rCTh9(oy5|7g7M4?Q*))sS9+%UtefhL
z3rlt-twAkA{Ac?lNpa(<N=xIaj-F+670-;FcU_@=EW><E7~Pp0w&cng9k_AzUf41v
zwsCc|XkCcutZRGbT=%ovov{;6af4}T<o{c=PR4YG>}=^CCELEMx01CpbIy_CX5P~H
z5-8hF(%SeEBHM1*+Q>gyv<}5|=65)Aj-KM?|2aQeww*w4Wj%DAFF=qFy2KS-Z-I83
zBn#if6-`S+6J6D{h(#VJ;$Pd$k`7K-mW!EE4SgiBzQFw)<(7j!RAxy<xU~yyi$V&B
zz$MACq8k2uO1<BtE!{(2GqTL(PV47-0mBc?9Q8R)BTiQ&Z5Vx%1?|NkOIOA;)kP4L
zOO>{}zAl&8;_v8bS7Qv<tYtlY9I(V<Qq@e_5?5Bp*_`&WJ0Agmc|!vRA9Z`>jm$J(
zj+*jAs+#;mOJem28Rz_6BHxkM&vlo#BGI<(8Krd*%NDyh4jpc-^np=TSMeh4Hnfif
zH{Ka0@*%k;i7p8k>&tnD!wOZbR3U}5(c&5Mh!(BccBd*cwpKhfg&6#H!oK)|!7AXR
z>9(U%djDdY61n!0LZa!B2S>#5f*iVQLaAK{g)+C$&pE~{3Li}Jcwi)ieLRhadazz5
zh!E3l^zDuA<Gp+n3mML(;&{>Nk6;KJ?Q&>cGbzCj@CBs^sKtT<s|)LqXbsha-Qz2*
zuL4fw%pvfWcY8bzCk{S1^W0MDgi5UC94~xPK1gkyqclGQ+0}(TH_wi$ae6#RsBL*l
zksAg2_@G~9z2UOn?rTSZE+Wal<R0kt$XeNE%&u9+;NUjR?OHp^%$ZJT;Uj}E**0|t
z)d#9_7kdEh`iquMGj@UN$z!}f4E?oJITJ#~i4ZK+7n&@()jShgUh#htQ3_<U&N5#^
zL*jX{TbO+KBrnZ%{c@fYYhaX^P_o?~I@f$r(0`PwaUqUMc0zjg{B>etU}7k=eaS!t
zpV^Bqfz_R=>a@!*uA|Ke5{g!GVv!Sy;@RuV;Q#)mDkr4#`U2qiscsfjt`TJ1dHnLa
zvpi=BcTAX8-Zkk?h0f+se(CY5wdM8rW2^Zxwx<GDJiKm6$>{qn{OvZy6>pOvJn0IC
zino}RqVyRr=pHzi9k+s^@aGRi%FbwhR|o1wA!J0`WWYbJAhBjRwYG88;#G*>ZThHH
zFAyUqU3-zn+-i%yNaL=XBK+&kQ`!$iORg_@8RuUNafgh;&v~NevjT?O5?JKj@eO9)
zU{72Rw{+JP9aP-ERv$Atc|Pz{9l!U$x5;YBK2USbyoE5jrqp$w!>7CY7brfU2<5d0
zCfuSc%&+(TYg^^fbceyYxmFR}Ve1rQz=nZ!*3;_J)9(7mAa-eAZ#G0->_AMMGqk|?
z(Vfdt{j<o4aKj(A*zxVEI%LPe0O1dsXF3rhIWtc7Ia|j3W<hK*6w!L@{u^jlk}D_^
zmT2C&{)?u~ZwfF)oVqtN3D9Xu&j<mR-ht2*UT?63Xq);nNu=CA{X_N+u1tt*p1SZE
zsFvfvoQX=K*kxcUz9=Qi>uXtB7#m9Wj9Xd~8-o4JHYH<--FCd&Td4RYQV7lKh`xu%
zS2DG-26Fa}wpJ+ze)N`e3&WRjsaP?r<`xN1(}jFGyBPBA*~=j)Me*dMALaRn@eYNE
zM=R#`l>uLN!y*tuulKui;T^|2ciX2vZOa>7SVR^bPejeJ%La~nap^R*`3?9jFAnT^
zzUoEcj*nwcOeJS{W3o}ht2sxC(?-tr;(q;Foz`e@mw<V#Qe`0&PT`;7<hd$gq<RT=
z+m8Vu)n^<iyOr9r>kt-q;^xF}wJBnAlL1@!KRe^Uow6yShfTKP*lMU~^lbvwSr2*}
zuk^3E0lm>PSMHSiUPBEA$Gm$e*E7?U=w{L+598w<A8y&=jkb9}gxB}6`3$3o4G7sg
z4XvW)UY$;&jcNX;)0;lW&e%x~;nzx(9xPwzpe}+RN8SL*H&nU#hyIc0cP(+@FDF+{
z-`+@V%1Q7O--_%4jr3h`fGwHyRN3d>V}}jzrS|0}_lyd~Y_hd7b0irinAue61SGzH
zXl3fODkw{olQQk>&Yriis3J;ytS$2W+RL)bOnOUpZ_8q~8ggp)aPNN6<o$IhCd$gc
zjMqg&byys}to{AccETI>p_eo8)tLbbv!US!>4)B@ZOJ22@9CH((i~=U7d&;~q0~LY
z#g+Qw(;ZQZF}|@+NejcRoRo-4y}7WQm<Ol|V-PP+2E9Kov&aa;44xeJ%|3_JigZJ6
zEOf(OoTT&(J*OD8zne`o83d|6V>xJi;AhU(1X(}3Zx_EawiFo#%YAT#o^1Y6d3MDu
zm~0acElEpd%QN<nF;~Rjf9aJN`T0blQp_NYAEys~|MFxLZLjwa-A#Z}iw`Pbm`QIj
za3^rj%m1dE1Zp|yWMp0YducqD%qPTBE2f+<;$b{OFPs;WuCR>zLBG=EF)TPLI-EG3
zc+34lb>gFVqO-?ac@podHB^+YbXrb5OzjGiuc&1!iN)ga9ozSq{KICRt$MED&<4J}
zFmu}2e)lP8l2bTaW8AAFgHj)$O{#G!;%k>pNNPEr_>&nUX;~lp5iUGZma>cK?#wKl
zTcV5O%GK(FLC>AHu~_0KoKHJ2TP2%aIlKvp(?FO**<ShZ^*0Z}!nLc9vcXXIVRsDe
zdfjns9FzUGvXP?CuFvsYv311oNfRx`Ic1+t6V&qWmEWap7gC5sQiH{1$EDD@1my~q
z7<JS%vT%#tmEH>O34FpBXq_4w7g9F_DKt?Gn>nI^;1hg?{fO00bLkETMU*c^pLFDi
zc?%msEF~HncZ7y6D3&iJ{lEO5WPe~8zW+gJyY@_hvdOgc9Z6d--<q)xO}Sm&!g@p2
zs{RPFPjl-(dG4&$`9SI@+ML9j6=j<13afhVzifJ^A)F)G6+44`Ef@ZiHiME$`-a$j
z*G+!RoLl%or2Z^i*Z9uNP|+Pl`%JI*_bs~VPP4A-9iMA@Q!MM9iw`Ma9WmUO7nw_%
zXE=AD44RXP4Y-RgPOE1UK7fK$<d{H)-_1F&^Hm)0wKpzY7;j{kITYlv5eLFSQooGP
z<9j!g?(arw(n=-EqQoZ#42QN=HsyUiF}3*H82V$(%wmj~yV3Lwv1*A_+?s1}Dpa1+
z#n>4!Yq=qm=@d&`^FFk9V1qSv`2`x`WzERU5O3|2KRAqt&0`q_n&f4DDodYTfGRJq
zyO8BJF)`FY1y0<aHZ)}v_gN+)^lK2@Ly#4BZwPm8R?ynl3la4=U`8%a%I9wxq`fHT
z0Qz)uE(LG$5ML0C2Gk2?arg)PEnU=v@|PIsb$e?1o3_pP*%HjXc7)IR-A-|nOs!!j
z`)<u|Z64=feew3y1?uZq8iZ|OedimJE6hY#id8BVrpNZAnmd0Ge&$kOjjLs+Od+~W
zAHj(Bm73&V<skw(iT;=7M=1W)WMD4~$pL8kBJkT|`!QS&{A*MNDj_R6Kip}Q@1M=G
z4UaF%v2n+an0K&c#M@uC6J-^^ijiLR<kxgL!bZ4oV=VB;xY<F!LRqH<S&}0=u5!8M
zzC;4hZ#m>bdqc}E3jz3JY-0hfq1u=A03il;0hAhi>^|$zKeZ#5<Q<kCa6;@Ih~7wP
zm(c*;OzsY7e>{UQf5ZwUfL8SHQ0`jL=LwCiBiI%3!Wcmu+l{Lu%%FeBN8Wz$Yp9|_
zF5nw7yAR03!?OeM-EcQ&)3vY)W9By(U$LHyo{Y=o7tV{s*kM*2KLQRM1%K%SF>Xv_
zCKsGVJqw>t$E53^Z-}g>Rp}+5xQ5^lC(Z^#kDm09Lo@N3j#fbb$yuL#h&#xVPEDLu
zF2sr<xoj${=oiYYT4^%Kh)#_jWKCC?*P3%E7*OV5G^NJFVnIiU%YlWAS=`4B)fJKg
zWdKlz)8+(=Y>9z?Zv85w$WxQCVyumxQ=Iz#jOi<S3m5UuE~>iC-lz6hERwG%eaj2~
z43x-;J95VS9243W`A=S-;>p`74IatRf$N2m2C-e#>=C{X(NG)+K#{<|7i$EN4B&MI
zdi1+1Z8)IP;UNc3I6&%!7Q_K~2DLBYaE*B2`Vq|mplz5`dmb2BMB!fie&*VVO9C6V
z*RQ&W{=IJfSW9Lt@a;&8fY@!SOs=({(NO-&STxp!(!Tm1oW=N@slO2WT}*huTu!Wj
zD6!5u4zH-`rCHqI{%AO!NiF0}HmYqM6E;6%hFIMwEQj_wbU*vbAk8RsJa(t~;nWH8
z=qBy>D>RL9t*|E61(UPrXf0|JlV6-%0Adr>18y#J@u;e08WRGpiKXOm4zLMA^w~1J
zi6(ft)I>Mh3%qDy6c+WvZNTD}Kkk_dZGpH9+jF5>fnhlSQ5q>4PldpQd)WMx_KqDn
z5gOlHHaOb1kUGk@2(IHbs;--3oagAHw2b9S_!iQ)rMPd2aKBpj(xqf&-J51^1g1Mo
ztjcT4n<jtItZW`CReLVor^P9muTqIUvQ6UexbX%7<=i%kM}Y*b<97*QZH*i@4^%Ro
z-h{g*aCIxQCx=Cjbe`HQ;8+tq$}CN!Tv7Tzd?Xdsa}7ZcD1Y>363_pA0vJ@zWf6j+
z+r_0Z^MRHjpcbunWK-i(2(%isoLb{SSiv(FH{T_!B{&r0-W9+#(t}lviZp7yg3_|p
zL$r>P{S^F>T>7O4-yY4}Yp^@&F!l)lYB~la7}R7Pd!+h-t7%NTYn@5k5wq{v8t=%d
z!8w9Mx(JMiTE|4oNk!ku4sRhuI>B3(sLD+9Rwax1CW6=hL5twBj7uX6<8LhXN}O<F
z&-(E8_Rbgb)=6`Bej)Yst}sdRgXvE+%&EBJvwmV*-pac0ecm9r_JTQTFnGpWYZv=C
zE%HSWYCI1n&0LbGA-`)h|CVx-(`~Xi`vQROL}K<MT8AoAv{peyO?w*}y&GLMK7S-)
z6GPKDt+3Se%KIrvi=38@5(Dd}auWNtn~GYKTuVA;QZ}4Fl_ci~@aCuTxa2rC{kEEl
zT7?`>Jmx$V#yz#9>jY5nr*gI2QWEAoI|i6S5@{Hyn2;Z8-WT>$S<$SIe_4TMSF>-V
zaE8T`H*t%_jFN#o1+$gIo>K0xR*Q*I8&1*DLl7g>`H=<#+CeJ^PLS7T0{A6NKW!^f
zUt5l_YZ%Bxh&(cmQU&})81uKtgq|#`e_5_{WLvNJ68I#34{T-d?t4w3wc3aqLO{R3
zTiBx6aE&KB5w&9!lqDh?UA21}<z1FPcs_X`mMWJGy$@8rdN@%+4lb4{abn4%Q9Sri
zNpnbb%I_H-DFe3JVht*`SgeqCnyk^-ve?B7aoZ(#vH3CiTCb6xaoeRJ<GItMIhLpZ
z)~eJ99%u@py_2p6eMg)I-$qOmerWe%=2hB*RJhoaG{9_<^sdFYMYEVSx2YqvZ^hRm
z8^!P=y~W2PfMU#j2i5ZHpQ>j25(e2e<>i@xa<TyxTj`*T8NLp<vcG-({ni}x+V!TR
z@tl8`DboQq@cJ!EJ&u}bgoY^?qK9QCK8dms${JFkN<8^{bVUf|@rP43O4aN^rv$;L
zuS0+Rq1V`v5Fhjo#6yExdn3@YG0hO)(-Yf=*YVv;VqS#g8FkJb<igECNKbO2B$fD{
zf<x%%_aQeB{p%AW-6KR!`^SnLAN4#>qa(m0#bvR<RLzK#3JT0KBLjV=TNzYrRe|pv
zy?n5zu>J_IFc`3PgbG+ZNSmMKO#CP>tp#Y0mA%^#!dDEj?O*IatF;zbd>-iF$^^-p
zs0D&kAPs)BW_8Fih~hM4;0LVCq4vo~lWxr6s>sWej?ZCQWu%L;t2!T9SRrM}+ZqAO
z1m##<189q5ST^V23|L%4DXADcOlNv4s01rH(f~=r(Are|mE62W!NcDO<o%Xxj*(yF
z1-DDfa56dWLT`$NE@R7>*SPM)e;vpEF8-=D!GW0|-(Qz+Nl~2o1JL&Gr_US*zHWMU
z-+eLb(liHhd+K1pG{@KR;)tbw4yc!m;vJ(|4nphnm{~b?hiXeIA@lT*wBqH*;(xq8
zi?;%PMmhnyatK$}v&I6ZIziO(H9L5-vK|Y!Z0|N+P|TkZ{aLn-UpizOK7uqU=}s6k
zPw_Q!DYd2Ai2bRUbyN1DSQ5oCRKAU*D9!b}6@I~)j{&iM*%;kEH5MaThz+~G^bD*o
zkR=Y9%zV<y`>n)6FL6{J!X1p83G}Wiy#{v2d#DC>%PD^*$5m2L92Fzm#E28x+KiPu
zgXfa2y9o|b7+ht9$S$>y=S~v}`<Od$%x%gcU8`;(_q|;AUy<X*)*cK(na_z^7(MK|
z<k!A<h-`_ri2rrJgo79bI0rILkxfPPL&fxb9>TW{^NFVU2?Y$PDZGFZ7qt$kKT-b!
zp&J0e4FS{tf~9@79!gsP0lK5Tw!OYvY?fJkrPK}RBuhqM+JY!BqJe%^3f24>mo9BV
z+;x^(Y4(=3k;^tzp?Ff%eg%SfR^!NW1-f6p9Z>j>-ed5VbByCGkhj>kcC3*^h@B`P
zxH#Bh!3D9`C6oCALu=Rty&_csAUJDj1K<l*nAIi(JbxWZ^&5yNcJ_IC2g=F`?|K(+
zUOLYjwv4-cbx&p5(JbD)B4sAw((l749yLybCcQ`A<VdD@thTG3Q)9vtAdiU6ZCRvn
zRLZ9<{TV3add2&hI{wNzaE+2pD<kG<mhE#*j^+c-RX~D2rW6&;N;_c@W@BQ*{ig#$
zzWM%>BP;^*Di7tR;F|Ej+X?yR-&8{x%lVMxaM;uIHNcP7G1ZXn7SMIr)p&JXg?sOV
zeA9f$ONz|ay!CYX7B;I+eCohQ&Of8B-z1{YzpT`R+H71}acCya2^tHXfj1TByy4x{
z;9|(KX35{pZ@_c>*D`aR`PVn0Uq8&mwQA}IFur5*pQJEd2}1%LT4pCLy3CBWr!8k?
z-ywphs^_1n@5>kE5@;Lh5vT5EV=9Yq$kBA056avZFQuA$4_6j}7vEElmBDqGPri*K
zAHE!aFV17zQ7SO)3jy~8aLg_~BjMcfxqXnF{*>E0Nqb3rPsQ!AKf||GN~jn@?=I2e
zTz$a#+=pt;Tjqh?TVKQo!y_TP0xsZuNV>6GU_MYiB9cf=w=3Iv@NIxS)JrE2nm@0A
zDnWA!M&85BETn>r4*9qFJw-D^5R3GQK=`Emx*jSJalY`J@O5_nJDSSJU-rmnDe1TG
zh5tFQW&VVc|Fyt5VX<Qpsp<b(vb)&0|CthvwJe5@@HzEfBMO^GgVo?xQ6tKbGL~#s
zo{7lb@t;SA><~ZdFX(WV?-J>F5*d`??DV7?l|YFG_>l}wrDa0o`7tyjb}2FLPwdB)
z5*m1biwlSeDH*$B8Or<;IUZ5FmI-;0G1@P60IHqUgX-eY467Nptewn6-b^D23_fVP
zjBF)d<5&#iKL|}VwF|`>8?P&Fg<4>59)LbrSXy2qjy^!P;C3Gv8q0FXZDo&PCAfrY
zK-=WbaEM)wf*HdWumSJzHXt#loiVJP8gY&>X^fu!iXJCkSUEL28}mD0b2nE^B{7*y
zeW}Ge=(5RfCGj3!%c){RG146mUPiuwy$^YUbL$a^Ct{B^rXDX?HoM_*>lZK(yMZiA
ze6pnN6;Lk!l}**et(XFFfTyB(BUe`AnanXGpqp-y{hg6>GHD^>P&Ow$C&?`>C*eLV
zC#8#>Inj@cS-EtKna+586f@#rA0%_2iPbbtk10P!kA-}b0U|zNkhH(Smo&Ut1@#^@
zfu=hI7G7hF^PdD~AX$iy*S4Q+en-(h;R0lYMcU&YoG4)QABG7N9s|~YN3+#k-w}$6
z^|2(}1_0qXCMot(%{O47H;&#LdI($#VBkB3f3J9=*P|;kG0>EJ!CR(ij8eNY;PRcq
zP1E@-1FcnKcOSsYhDJVER9(9*hr{#j9zh_0PE5_jR=L=VDCF!{n@G8o^c@e#3+P&x
z)f2O%?UPNfn(O(E<)$Q;#UGmP=Ep=5mvc;GuybKnCc;?|-2roMn<qC1_eF@?f$!Av
zE7H>Vrc=x<(czCUK<E?A7#GQI<`EAAdrkn>f$C-56AX{hJK995|8C}?z^h$XPwS+l
zT894+=s>s*{KU7wX*eh~u2~!LWN$MxN;IyiY~4k6>qx(Tt1oRMYg~<W-4n>T|K8N&
z4bKJp@8>RKHMRUh*xt|Cw@vsCO>X95>gYB}n*H{Dal{VIX1ckIAM0%`8yvQvUHMtC
z)&|E0gKK-(vHWZo%?1Y%=uCe0z(4T8^V<a@I!h!3CN^a$108HbDOq2BptLNmgszN8
zCMDqxBV}F(B|M$BOz;Fc0+TGEsn&>yqO1U7EkzHDESp?iV%SqMsCGaFZb3^0kW~b4
zQ(xGNEz4)qECA8YaA(w9By?KG@hSfD!(n*_^1Y6uUrW}S;ZvrkEE$~o%QEa=GV;>O
z3>3e1TmDAAWUOSEAfp$dUEPjAB+{Z5VavqM01`HiT~mu=*q_KD20V}PndmZxPOYD^
z_Sh!>`ss9@>(i6{Dud0woY>%vG$sSaEb%5FlF=&L%_s-}o}lQuC;$ed$+F%k4|sqr
zyQ*I9*D8bRvcf3GeU=#?zg1eVg4VCP(PU4RMzb!p>3Zq%U!I~e%?!!uI?2*R49qg?
z3~4i@qjZ*~X004+*X0~5^<w{}7#M4QHZW9t;CSSGKSOt(YpN2pPq%CBu;jz;&nQ-9
zt#2C}RdJv2cOOslNkP@tpVPlNKWdWPm_8i$s=(H^-wZ26nGdPRShnLCG^TX>hbnhE
zLzcQ!B+gPN8)jsjg4{d6L?mIH0uR(eTLrN-Jp^Pfg~Y9RizuA#eC4e}_{2(u_k@z(
zeaJ_cN1{280-DA+qx_jS9izOHFPS$!Uy2xV#4Jb6<7}2;lNd8{)AyY%?3R(w82ED=
z%&3<b+jBGa5hfh(KV^@Ev;a@gLJd9$s|=ft=k+AWTF5=LqoOT#yg-X5V$S4#Tyx$a
zEJmriu6;;wQ)WMMvT9~S=0WB@BA@57$<tSM24O7PI@zQkBDZ)a^2D>=Pk!MeLh=oA
z#W+;gIzv+?i<T{tvZMlJB^ZZK$}}OX;4;&E*DUz+`!ywHWQhB1H@G$XATnVM8RDO_
z*mI_Xz*u0rri|{<-qJNrDPs!Rno|e@sGDs58l_OXTFiEo)8bbvG7%%Uh<z*EuTe%=
zEjw{T`aWE1+^A+5mfrG!VGYW$?foYWP62zy-w7WKMY*r$!@NGG;&HLJ#SDCwGcZ=>
z*{FIGqE2ak5oL*?vZlXmTj6C?2#fTjCzwBhDJ4p0`&8Z}5k7C8w66z~J4rUeGz{;*
z`W0QE(AxL`TOfC$^Y@Ck5U#?;o`{ZMt3xkW5oM7_2RB@E+$f3f{zwInV$>ahvFPOM
zMYfm^_pt-#9VfTEWWE#1J_;5C0X^rBEsuKHQUu#*UF)Dw7HeMEW-2jlYxKlsD)ICt
zfw=~afae8F3sd<JjfIh^K^-KUh4ihag&;(0KE&FEP~`<Fqx2@Bu|}>v=Q6yp2ClH8
z1?<c6Cd$eta1csW)wYQ>|B{g{if$E=QF{}+kNte_&kEuR9i+>!d06gBD#YfMy2Sa2
zqAI(nW-pfE<3IQsBn!>Y%I0U$Kdjw3v`NI<?;H^?o!qSzKmSTFTq<as5&BT=Me)fI
zB9p~ME*Ogv$2WU)guG=^<l>*gjxEwNx=|&$g-QxW;$Z@7oqS3sESU1Ys#gT70tvso
zT;;fn#Jt)}`2St^!Xa5vc^w+`H#iVBZ@tzGK0n?UCb`TZcpY86%&|=5<vD8HI}lEL
zJ(N=Drux7eG5?*ph~G$ttM;ITA@7+`E<mM9tEFIGMuPHlU%VWBEYucJw8&hVPP`P9
z>4GihxW7SGR;Zk0q_L<J)oxEi2O=qz5l)lo?GTh*7p6$k{G7&z)dtLEW1+ypQO8TH
ziV^93Ws()-p~#aiXOlRe2uD>54b3O_6;%%%R{If}%O*gP^i$0YD7Qb1s+JA=vj|H4
z_l-rLDp_e1yky9mxO#SCSrn3}nTs^tg-TM1DP5<S5*|jpjDI<sMll;JWRfFUnOYuQ
zZzTvS?A@%48kiqMT{beymV`%EDu?*f3{D-6N-Gm5XrwSstx`>Lq7ioT^P!X!N%3lC
z<#PK^sA|O_i4*)~BQ9wpeW+@`fQ4+o%f}MSI#7c~D&y4Bm6Mi3T9fx})J$9FgGZ}^
z=0AntDGW4i5A*G@e8?_kd6+LDexMs;E?_*;tU&Qy{tPT|EbB>eDCm**(AmN(CN-7O
zkT-H&P|r<9!sH1TWOn%aqO>J-THEvew75rC1xl<ee@?@QzpSLkV8$hoy|5Xw`u9ET
z8ofUHV+nb3oV8~(B$tK<q!-pMWQ-;QMvGpZ`WDw8-auj6e%K_+#3smM`e+FG5dcIO
zJr2BH;eQFfedWNR#Ac`sWp#43qS6(FPZ}&^ZLC#sk9K)8RJFP-+OEv5Z+HbP#|H3!
z8Q~ufjG6!2oH2LhrT;%{TsexHEc*X8Dc1j4>;GNx|7YFLC;i_`x9B$+M%5_UQ$lC7
zdhtWbXoZRYJb{(273yskEC3|m(N>qo1g2D)0Fqn@HPwg2lU*Tf>V=RDbxQiU7c3om
z_=qO7%zL0t<XUX9pfsx*lr6J@l@|`{DqX))>EIZ<o{;;@JwtFcF%2d!P?k1zg(IJ^
z-Rh<|W8J9}n(7A@RMB5qo>=oNKl2G$>xVFFZw_KDG_{PhA#XN!1!q)V>>yiX`&s&;
zplELnu`eiI;+#Nt7`<WE=n9+2oczEBtPkW@W@y*nIcu!9B?ua?{~>Pj>($ZiHq|+?
z`&H-nhj5{0d3Qn3CeBsZyU!~ix{277y)tYG;^e`m?2cu$kr-fIDYY!MFl$qAhq!7i
zIC`(+ZzNSITtB<ud@6OKc&d0Zd76BeUs(IjWLfDi?YJPTB6*Ud!g*q-B7b65R(A)Q
zoA44pw(6wCt8AvIxdYFQdP(71e6uV?D!SsL8n3l1d;+sr237$Z*RYwY>LjHvmSto}
zmSujf+Wej|(9Lw2()ht=Oi%x28kzFmNGZK&vtOtSmXL(gjVGT-&X=w)qN7`(qo1)=
z$BedB$EvcK$2_x{$D-0j3R%1l-(l4yl4RD^|Kp%5_{U?l07MIZ2H}CBL6YE5&_4J8
zG!MoGae|XUcVG>WEqDR64(0-Ng25mYup21HMjsQ$Rv*iMr4hu>l~oUvuVJudr`fgn
zVFns6lxyZqyt7p>Gs%!$?mf^*w;?W?Jy7?u6*42qFyvjkZ@H$`McMbzRorLLW!@*(
zwcj5F3yti9yGEM8ej|5avXOCc-iR$2Fk)}hpEP9iJ<;4&k;cD1TFn3)t+G)Uty*TY
zt4?Wyp=M^QSfOHrq0VVDSvq5zpeApdpiX4NuFkj0kTlGtyWc#nd{;NFjszZ8MQR?`
z6twl$;2gaVI_6z9o+n>LpNC(KEN=oAl{13X%g@03<wRgj^>$l&wHME)xHHaqv<x5Q
z75L+I;Bczbq`$g~*t`4N`Mm4{@i(=<ywE(DjqmrbC{^9g@AQjI<%gjT(pj31O_50r
zb2m5b`pR!MSJet?!VdwzwpIGpRyjRfjTg7(BlQ2wM=U~Z^!$fn_#@cnC%-(EONjj!
zcV!<S6NM5}&Z(t;hWusZe%0zDT?<?OWocvEd&ON8Fba`$CJ5W$`{g$n3Dx!mb7WO0
zm<}ARv<}8gUj>Wuueu%CtbTP{RXF;!3iZv_8xU?w64m7UEx~rPk7L!(WB6XMvY9B<
z-d1X>@C<XUHtWYP{$Tu7?Wl&g04!T!V~o|wrQv%Rx287`->0xzU6vFHv-uK}G0G|>
zYlCg#Kuzf)DHZmRhTfH7yKApbYSogCp6*pZm?=H+rTuzau3uLRcn1n<y{#wZurJK@
zB#5v3w4jv-LR;L>Ly6x}%%jSs9)p=FCd=bz-RZyr!(AlGyh2AKjoVHN@sa|eLh=p^
zD~BiV&c{hJ(^9qLgm;$n20`Y{#$M(Fw#1U1^SL)n{@E8tH=sv5<o+35si|i0gaL%!
zy~E#HDG^0)T3n-8AmAQ1)i^ff>7K22zyNz;3BxE$5RGe@z7N}*&Zb#2Q2+k8b~PK?
z`?P7RQILpfl_b#r)RlE%19fzT08rk^TD+WL)Ygdy1~>O9+%J?iH;cx0GTt{f_ix`b
z@l0-DZPuSSRO!d&EFrc0u^TvZWB0Rf-o<JUW^IoRS$<=fAvXGXkEk)e5#3ZLJh-yz
z-JozUG-h=%Dsb;NW>3-+x)fHce4l5N>5H3TNiu=GB2|lZU$XS;MGHJH6m!-TYaVur
zv4r*_aUbRjQX3Icm#LpjRylJn#J_J<5q}XVi}vl>YhX@%UN%gIUNMY=Ud54BTuPC~
z@OZ*|QL#*aOZr%Ei~IhMZr@riVHT&t5Y92?x3<S?M&_-$eh-p|XOv~l`(m`^J-4W>
zKSJM`^`n&+fy$XR*?1SS)#_&8uY32r0zrh^`-dJIe-em$l-!y(aa@y4#ND%;9>^Ey
zRGSaXgUf55mmeM*@1EO(jfr8^k~NPP7Sr_N7SlCY)sozkDu*e79I~C|sXDjE9~q4n
zFE~A?hCzK@1Zwv+q+?w$<YzCuB*HyU52B^U!jSW4VR@}@JdF)G0TcHLM$I`vcK5R^
zQ}67EbsrEWXWiG!_XKhch5;$3DMp=dijNELIGK%x!36gwe^0rUOu8c+?{&4N{RlF6
zQ2BZLYAeLWvcv<i!_a*@GPjjXP^2P0;<2;R+1LHyey}0?!2XW17cinQiNSvQC8|S_
zlWo6WA{iPJz#tN-hoKXxc0=va-r^WyO~O)Ln;8DBF}$U(72>cr17b616r#pRU92+n
zhjQ`r9=6Q?A(0SD`idcdo|gz-K$H8HALMHLl@$1?-=Q&Mw3K*vNXL|+$qBDe&uCB_
zW8jsBmC?%i=|ttF=o;PBf)!$pbKU2@#C}Ke;<M^=kkU^*EQPV>J?_`}ykb2tjSA+$
z?{$;Hc-)wVsOHfjcWxYFk%EbGaT%bHqOLqRin1lt;oz(E89A9gV96Z<?5S>mI*EP}
zZq-JVUF4M+dYo?h=0ErDzSA8t1g!La@q_YzJ29<$R1jtEuEo7Sb~jn7U`9YwV?IRI
zFb|2Fy1=3=^~0^9F@II}SCUYE2OKHg!;)1_A^?O`w-`Khw{&=DE>T~}<Br#{#e9qZ
zS5)A?WU6Ni*(Fy{kKXCxG}2tmIqJCw;to-)czFT0n&WLCUrg83)HKQp&+|<y_m?&v
z=->%fNQRg^Bj>09p%`jFtqDg?m}2j23@ghhD|WVXRIp^sRc#+@;N<Y|Wwi-i$3-eK
z0U^6lf(ez+ekxQLq4Rd53GwTW7UCh%WG~dv&1H$n*R`$v)fh<{-sEuJRLCNg;O#9|
zS~Asawc%_@5JG13;ANOD{tk=SGK&DtDkwY>_F8qK=i1fti6$cpdm@TPT0YAhC1V^r
zIAaL{qW@;}F0D$m5+zU6;(EE6810bqcSSC3QVi%@!r!Sd{O?Z4oE8{qoxA#p4@%#>
zU|xJEWZ!;@LKJu<dx;Be=Pj?>X;fHhdCj6%<Ql{+Of%e-<Z(??wq)kJyDz?7HFOY1
z5k#K8x6s<}jxUp!To&M<{VP+Lq5xjWw^?;Q-@F19Jaoi7Vy56wn9h%Y7F{i)S9ydz
z*$1lbq&65WL@@{gf%9;6&_c8h989P!sLcp#f&Q=^1IDo046-;{8QPFK%RHiCN6dRQ
zp#MX0HKaMUM1cH{@7k>dgc?NspA;>I(0DdROI#=E(a6{y`A?rAC#E@reKA`o94q=(
zCGTj2rbV)uI(&2@>%0yVqC(z{z_u9oysllrqti#&sF>K^b1jruUZKFi7$la#I;cT@
zaG%@|*Mt(dUu;N0>uhNpYE{#r?~3#FU<n0>2xhBomlVe#Olg-VN;&4c)}SMVHIIU^
z^N^*@{$t>Yv+%CP5Od4a6@9haYal;i%4OUxNylCbNRw#svUryd!FkQ7E+(TAyo+tU
z)iR#WdtN)C@Ls538k_~sHG$Wg?N+|@DF~QxK399_;hEO}={>Ej!ctZj=K^z#14yC0
z{i8R1-AoEsN3nTNMfrpJlNL=8o(jGc`-e#*Q*jVJ6WLoe8~5RG(pZGMZSJ#eKkoj$
zK|VQl6(R9o$ax1m$Y5F7BYb7TIJESPZh>ip7*V+)61C|Q`v-oqj{*2(3wxkE!IsEl
z7^hPF|4lF}C{?sL1W^El2}y+}UDq4fky9HGX)?`3_oKpC%z49IG=LW7l>ceZ&`qe7
zo>xMQXL06cu_N*ETL-OcBee0(0&;JZQ@1NoZnBV!0vpH}+_{1{C#Y&CmNB__GI}-4
zotL(4;D$17x6>Pl$}{zA3mfPMd78AQ%lgw51i|j<Q#&qs>z1M=vmn0`B<~w1;gWAK
z{Ogh%%9O=>@E9IjMCwicjG<Kon8qnb8hY&msbQumxHmO_YJHVIy%eayTE{cMLw^+D
zrQBh4VDV2hU{#fHbzsAInX1jK>_Jd%b%0y4PToiN6c;S`5eXP2=s!4};Jq@*#1Nj~
zbwrtn@D>9$;2aKi@^YVlbDZcxy*Qn0y(TT)+smLkWO3jP6AyKUymg5Iew|Qe8RLa6
z<{5H|5g<<Hp?0tn`0c#=vv!!52+U*N>vl-Ew4aI6o;BG^d<emFrU#pn#oQx2L5X|f
z12xLW&N|<UIGZ`jy50(*%dZKbKD3(S-xP_xkw5+CgAm5Q`NwmDL2uWGWRX|62WbMu
zvEt_Y+O}ToP-f0H=i!fHCp#0$tWP-P3{!EmHf+V`UWYuft|zrJ)Hq?EI{U<kz|(EA
zo&~c6dkEkf^aRSg5Suw?4K1M`I)X<$lWm>f|GM!_)?H)@*A-0UEW;hvoYvpuW1hY0
zmmhVIt2@6l7V&@lPUowUA<A4Vw430cAx+W2KNhoWiTqihAI}kyQqq<<!;o^|&uYUv
zQ|%Qqv6w2$FC&!#YV&Szy&6Z~zqF`>$ETEPD#9dY6qEg3$EyO2ArJc3zO}2TLP7iZ
z64l;bCy>V7F!y2>av`$aUKb2?W~b|95PUKpMk5*4p&DhCQS>eZSyHk_$QjIdE&D-P
zl12ZgeG|9;36(357NVrjD$u?MJ5YDKzK6aPP5O>j7yf^Ul5xk>k+Z@`WT7U!fx}v&
zulgFZ(7(U9U1=VGphD=8$@R^0qbe9E+R$_3D+twGlftN~;d7nUAqpzk5FOOR%Bt~M
zhLWHs+pPNNt933z>50H?R{a1?-<BP#0DMgXM0d`9SWRb!GpoRT58mZ@cvU^y2Gzjz
zPzlx&*~^GAZhXgx#oPcjBTlD-St_B7@SO3^i^{X#Mq;Tr@f>MW^t9y?R4%e0x+J*l
z!qP^$T1v^LNl0-OwIR8qOiWHTj1{V+Q0=sx?0McarJVk2ImgLkf@{GF>pgD`;kXO!
zb*jyV=PaMe<0qrRG^I4apqZkkxEBjM;_2VRDPyAvZJ7<kEGu5|lC~biEZ*6QSn0QX
zp&zrOLj=Ukm4M`Dpx(Y|UgLKOA^bGAUYOuS>vJf=;mrkO9?DA&8DMG80feqmXpbGw
zr%vfz$&G*6y9*f%<tNmSJ66P*uK7$B4t#$4yK>5g*=_9q7F1JW6!irYUGPW;&43;$
zc-d~+MxfEJk@^ZAv-_c(OeCjHuEDd_=a&s9tUMQ9gw?HHxqb5(vaMcM|9Da9TcH71
zi$;})_(6<%;&q+YxNdGpQtj4|Zq9;%Z+hPyTddJzT%!AxtFL$#IKP%$Ub`$xWbURD
zW-j~=D%l9w03D?cJSOt+kuw<Sl<e!_E(a=FBl)*DmkZ23KkBb%I}wgp)_0>QJWR%0
zwoym^%VsF{u1`H5HvT`3!1_LL^)6xmb4c;Q)U%CxbXHJ1`+WG?MX`&2UHpOs)AJr>
z*ZCgh$voORn}V47ryrp@8G@D1Ih16tK7Fuk1eYY-YYF>@C#yMc7G1dKL(1WeW%?u@
z@BHMRzOQ*?+cWy!JT*=7*i%K~hm$gO>625$Ua$*d3@o@7`QdW;5;>V_z`_O2WtSsx
z_DVj`e%nqt_BdzfL&Y~H|C9YIOqo2C0Z}HjO)S84iJ6Ud=9E>_esFEZ9?P8Z<g+Y*
zu&+NUD!+K6G}IKwoFRExe<JBI)P%{^Vi0Out+^FvjYsI%3E$mj5Qb2#?y%m3f8MfS
z)OccBd8!kpuCKkca!1ytPqJ;aXzrtJGvHY*|JY&8&gASHW8VtiI;_@jS#2VDXu01q
zSTtC>SP2{Qd`djgeVuj{VaTIWI^deyD~}OlAXkY=bh<BUA5nxf)PuWn^zqaWu6@PP
z94Gt;CwbaD%A4HGaaMc#woj=3LDPNY97009pW)0woo2C>?M%noaQv&xe}uomkLeia
z068_w5k*Qtujajo)Qp@TMsOc}9VJoLrM`!@LulLT@dv4|AF_y#pTeoM23+AJ+(W;1
z;NfRd@_G*Mhgb3mPY$0s>4IxAJ)E!z)MBjCs4Fslt6$K4^=59ti9o78PS3wKSi42a
zY8JiiwMYBZvuBut_Uh|0S0s)0>i(f>{@UK?+G)mK?(_KC&8pCEc1VPdVZGW0LWjs<
zn`=eqpK;|;*M+H8aci?~pGUqULX)lCcWY%;=+TDVW+gjDC%@srKJ*0<(xi5Xa5jL+
z5rq;l*vsYi9}|p~J2|jDfpjAavF!YMsz;v)zg;yqf*(t#jb5DE;QY86-mBRM$@8aD
zG4@tse0B{?TxO|;FB$N(TdM_T>cS~W7{sHN@_s@rat`f7LvWpEGZ0qKN-{zfcVGwK
zv_77j*3RqV(!3?Ugg$nzf$Gp4+I7ywGFTOIb&kx^yN*WH&fiODkbQ9uG1=}K;{9d*
zv;0p%@X%7ud)UyD|GT?Dz&kvkyIrpZM(K&+E=lQu?;|UvbGQt7UK3#xpg+3$=*3DD
zX(zDt+oO_a$AH*{LFa$Jm<S_{;aHIg;B2CP1!7l&&|~^EB?R+t$o?Wr0VTrXj!@Bw
zVuFy#rk|8NjG{25U0_poy&;4p(qaUb7scd-mTi01+>}~~a-I0e#?C^e-JvDg+eJOy
z-Ai};5X;-WMV#G9EDp~Rvew^v&d*WS*S;C$dh;MU#s<`#Q$H4xz|F2H_Q{^t)outP
zce%!fC7cgC^b11muBoyP3nJ0Cm6)`7Lvy)JN<?~Nx2-p@_6x$mv>fixJP2f7_#qoQ
zc88CyBRGV3lXYzy057ht!_NP-^meK-P*4vD1O&(1n0Rer+)05*H|^n{{A9CZn?H!2
z{HP}h7eti1SrUB~w?0Il&JB90*Q~-_yT3-9bLR!UFqZBce2ZSQceZ`ipU`jMG51Bu
zeEqj}9%~ff{Y}o%AHHEd$1$c2&A`n*X#RZsvd)`7<$}M}=ObwJ;iARoBYpHiP_OG^
z|N4!eX|sF#+V>-P^nq`g*-$X;B2(rPB|d^cmQlTxSt`HzKEwh_Ddl5sOZe_jS$JlD
zhTT->h`&&K`yX`XHa`bVQ7wKgZc44@w*0&x`}(BY8ga>w&<$+b8=J`DeVfQ5Fe>kh
zYv#4x^GWg!0e+-?DRmdwT-{P*rU~nc=^xt1iE#Z+cXQzE<EBS!QY&OQor0uu#wdze
zW;`(;<KiAumS8I<!^K|mz}_$au)TBTw+0SShi#JN6)^Wgec!f%snFKoN|(F&(e?1f
zC%t16Lqm;Hxy&N%#v3yWHd&)Hxx+wJ>}!RC1X%%+5`AoA@jLL)|8QZRL0%%9znO#b
zM(9UbK3|pvIf4qrQJ&T3JBWQ~{xY2ASse_Kaw<O+?^om$(Prg{8er&a>2$5FSE%bW
zv9)_ctzBXzqYk#3MQ74CsI%zy4kRt(K)uHZ!q!n6rpnp0q`>LL=t9}`n?S_w5{W@q
zcJ?4wHunhGboYEajqedIauA~xD`&h!D{JUsn)!qr(yNemDSqgW4HQQpza*@&gM5)=
zO>F>9I#t}Wx<)CSE|f|)Y?-0iKbGI0<$<3irQgU4{m@jpc|iZQpCiCIX0c-&vb)HF
zAX;On<bC6kPf5!j^S|e(LW4yEj@8MTdsf4EpWQy)U*4nLcc|xf|6tMcNS3)bm?(!2
zsDd@kE!qcRy~8f}$n`})>kD+pMHduF>qU=3ETo~A+GUf}w-<r!%d8R#!dr=6fFcLs
z%|PEpHjim`ed#TQk))!h+?`sFlmJ#;UI{waRbl>wDw4O?jAK9v7xI-r(5`^1Lt6<G
z)5Bc<e72Nhbcs;)14oZ-cBseNEUf<}$6$`2{3R%?TVBzb%2TIST2WSGa27=Au~Ms(
zja(UA@_p8mk2T>_(aO86Rw%pL1~@eE%ag&TdT2QNu4QSIm|OSXRjoQP$;;eqG|}a)
zvA>s>ELygZN>oXW+QO`2`RPAq!5utO*DJ)tHcx2TSnnUwodSx|{Q}>Mrn8l2v?eVq
zyUa6hL(StG*V(n7N7yA-4%6s}9^?}I?&VU>J+SFg&9lX}(`r6NhcwVeN6iE$>Ei_=
zfpeK+nnv6>Fcj|d73nfXDw!FjPH(*Yo&4G{iPMhzrn8DZ@Ndj7510H(2SPf%FJ-&`
zfbaN;zav?%B4{=9<laHr>x6$Q;XVk4H!Mp>mt!rA;a6f2CuRl?_D!6`sO5X%vd%f{
zEJorNFmt4=Rq$s1C?tw{lG58iRb!!XLC1<PBce;^D59@Oe-HdGnW(^nnT<_zBE#7F
z$v@Hz@YE24nzWu;y5VcQt_*U^o;SMg_-Zhj!SeS;2=T5m1d#2@GIE0~Fg}_fpv^LW
z6X+3Km)ix0^=L6vB5~M#SDCU22&H-tL}urJLwRHAzu_$v)FoYOz}gX9C7o{|!uPnp
zW_^T6_viv9XRl91q_lf=L3f%P0>bcO->n1Nv1tZG2UYZ7(w0$%MStCQW3^P!YRbXj
z$s3CjH|{rZ{6wL5&`i)Pb&e|bVa+n(zyfU(7L;i*9OB9*7ti#&#7q}r_VWHn(9t`@
z#ZT`rr~IgaIrr*1w0UKr5s(tu=Y<Dko1kv<BLB|DKt1DybIexF9M1~8&L+u=KO{U7
z=nfdYp*QvL3(n3)VCixG-S8+3039-?UbI5U3i$WqPpWGjwjyT;xEn>L^t#nRxOvXk
zt`b0dcWgVX5PVJPEZQQm#~k$9t*vZEEcO~TPUj|`?cA?zY8G(2))47zCim({sx9G$
z3iGbm6|hJ08P&yD^s?Tj-f&slsfu3hbiMSp_wCrR?MZFML%88G|Gn{fi+(j;{RV7o
z+hMEiZBM;0yqc!nsh>Kun)KAk$2DMWT+s20Yr-19-l+kevNoabAO<g=nCN!;ffosk
z!aDFy!<+eE`d3xy_RlCOJz=EFHUd?UE=bGr+-v6s`6aGBrDWbZc8dZxsEc|xre`oV
zN(%p@QM*@ijPq~%2e$LZSNp}Vi#HhAC}SFqCz%PB$ONvg3e-trU3@YnhLxL4b<aYK
z!j)a(A7xeU4S@(jH$rxr>hBX)P}i{x@^|?Icy~Kk`wTkijpXIuIU~`{UDRnPK3Q8m
z&Gx{Y9=t&FZIFmew6+)xT_ohS7lfx^U`KXOMJd$)Ixg8rtCN+7dEg2^L0_jc=>|WJ
zO6Q~~*2O2xZ2yAqg(F6ALC)e~_$A>%veqj_jQc|NGL;+Shlgel?uAV1mM_vTZ^JO0
zj*2a;3oDQL7wF2HF1Q?z#a{CbcR<5~;L<<eoSJ8pE$@pkhlLk3y(>Rt%}#=?^as_J
zvp2-~jmbKoJH`*M=I|sHxO^4+*{o9Of4{!hx*UlVK=TIv2z~;B@(Bh(Xf<iNxPzCP
zIwxO|F!KtS5ZII~W)QfPEUdyfluRx6DoxY*LNc8?eiyY0PcI1`e=qx%-`=`&2drn&
z5)cJe#_yAm7L{qnl@D-pc(Nt#-*#g|C0ZThfZK<8i!9^Zt><cwisMsr%P0crQBF9c
zuN#u~2%=@Y&e~BY@2-ZliG=38dP*RKgTFzb<j13`Yl#|35`Ny}W5R5K{V&)>4V7&S
zFIH^&FJExFsD&$ER@wzFf=Nm=CGH3vU0*DJRTL6B>k|y|hezJeKrH}lq1=qJAO$^}
za)PORn*8C$+6gc>YDD(m@cTNv$!6M7@;hP3KCg+<d3J{#Z}cn8dSmK%D~eHH&`x<O
z2CsTUdwERuDP7d~?0-NjdQbMdTtKDnzY!&Se(cb{u@T-HY*)NMzaDqO;dC}{g+6eV
zcevN)qp;2oU83axqkZ6Q4pogcbKvi~SWXY<BX)g?9DXySYd-E=${XV8ozO=T_*}L0
zrv#Mv>|atFk{eu7Zo3+?sXmW1z;|ILpUaxK`Xp%!8e%OhX(l!8?<02|S60*%Z;^JA
zc3ny@>-|bi1nMfuB7a4{Pu-Ci=NkKMlN9tWcg039l2A{|kEtY@7trA%XVVMMd+f($
zo*@BqxV((Km8ADlXoE8q$h+~HJ_tpeY4CT3W7z!cS4|X`ORkc2XK~qpr23mthKY9i
zFER*NNeBo;FzuFz%KaD6*7rGNyDLX)6a+}7Jw7e~_AAXLp(dGKL~ySgF5}V-#OH<=
zF;FC}p}xfa%(8O~g6ahhy?;aXJkYQh`YJu*2aGI2_W8(@O)MhD`;L>%FQQvL>xk+b
z@>^V3qbL|kT|Tz;BnSyI+~Sdrngf}A+;|S1dt5h797Yd=`Gth(e7{EB3WiR1*=a32
zw4^$7=Is$Nh2IoH)8G-MWG1Rn{Y&@xslO31OXIyGAuvk9ooxqVkV#j!(UD2=j-^zD
z)gu&uE&bzPgDHTzWlYR;>150V&Fp51Q!lO(J0vMNuS0ddh;$%bG7u+5_gA_6+m1{^
zfm1379*-;*KEEiG)sb~XbN}S;pS0dRTs_xA<9juO%8~4m#OXTAN*><uWJP3SZY(!+
zWxmOu13Q@su<-jf_|!*9$^ZU1dfA6d={bJ%9|~mT2>VPl2wtXCoIhQ&wRU%m6;D}v
zIZmX<$b_$8;yh91VES$u+{|0QE_%uE_E(V~jzc!#yc0gz?m5@%V)@zhESk*5yK9R@
zLd*_1X>YP6Vil_!pfQ$|7!M(&T-aV8QBSvKr%V>xxYF@4@tF?%F1Cfu9-NO+>Cio^
z=M3wM<pmxnv333uD}x;OlJ~}{{8UJ})OY#ohZ91gR*KOVbU|LOkz8!zH$=)ixlB9v
z|B&^SL76N;wz#`HgS)%C!{CFvySux63=V@ke7L*2yAJL;I1CPtdw2Kk?t2j@sxz}X
z`$tE2R8>~ysgBX4PD;6j;?b+U4-C$s0PMB??J&kyy=3Y&mhWQ_kX-<@+lgMvuug;z
zgHoTD)Z#gdp16M1rE>Ismo8*6|0u_WgKOwmmR$axFl612Q$miC{*kFH0ejRiL5VDW
z`=ZZO*+>-dG>y+#dAZ2Rgrx)#Ej`YB`m`klLo(gaJ5u|C;!(mIQv2SA&WWXOavY&C
zwU4#zBxzkPkken4uZs2dp_P1@6poxa4A+Rw5<5Ts7WTUQLCS|n{GO+e$K)97s=os%
zp(QHOS<u}J1s5V*XbkK%f)g=d(YfjB9T-Oo9d|s`4BAhwfT;dqkKU?>DFLLdvZkxe
zw$AfJ^3I`oYdi5OfzdOr7WO6*^(Okc=LK{6-zY(WKAsVi{!a`j^COc8{4Yq|@Q2?2
zCkTe_Q0DJYkdy_;9HXr>JQ?%R>qY`AV7fnasqlK;3WB~agKh<VD7*Mz3ElZ$gjB;1
zg}W$M_@GhURC%2a<Z8D9uuHxs-=?^*bh}|^2OilGt`$O!x@DNxxNu9JN_q*l)jYSj
z2=(u$0?oR4u5%n1ZSSWdvb!yeh(|)Yk9V=RMY*qhK<!^rodwP?tA)&r>m7K0Jak1X
z_|nz2UAZlO9gtAyz@Y7WmACmw^i}2_=jTVfW4JBFJ^#q^^T99r&Np{Ardz>xrWRM|
z-mdSV+wLjs3jS@p1z+){yI;u9=Q`SfIOdknkfl4scg8VN{lRa>`sruwQ8#*J_7(a0
z9^Vi__d;dI6$1XB*Yv5s@BLfX@8iuc{w4-5Uq41S{2$;IDc|v{9@sX8%<Vgk#LGwG
z_zR=lp>Keko9_xm*H!qzP2u9^OwpFV4BoDWH2RyYRg?i)*8vla*^8Wv!!ubieL(Vk
zkdXG;ArslfLs|;b(|$4A2gGS`PnPR|fimh<O_Ak}qB72V8C*n9egA$<!O2BUInGf{
z$*+r={9nh4s`L*lYL(Y3DxH@#RZoisicYJaz`d-VsJ-BxvOT5%Hj1ZAx`B6wWcBx|
z6plB-<fb>ml-T#|<f^yq6uWo56viHr^j$7mpO>#>AO8mDtnGrVLk}8_*Uj+@{~G7C
z?b3~_N4mIY@bRP%`|*hnqVoBVobua`k8;`%(DICrpz<%qoO1V%zH)?5^zxt&r*e`H
z<#MABDs{ydsfwK4Lz)kk^7M}zQlT5p6JKau6!m-l?%&Y4u%76&#^U!3)G|`Sb$@r-
zO1KeY{h7Vn;v}M+2Lq(ZN8EMWOwqK$uA=yTcPz{x=V&!_wVlMza{!ab^1$AP_2EzK
z@SC2u_{wCaPaUH-JUOST<YkmEVO<Pie`OWEMU6Mwrpy&<MCFv$9H(daU5Ozjr$Cdo
zYp7X`_Y-?KmkY2hg!wA~kNRyv<S-Z1=p!9vHy1MD<2TAhF1XW28_HEK^5Of87{w>p
z?6Uz#S^$gbQ<|{irwYza0BrbkS|7%z^RFudP`Nicqu5V3&0_<^%r}PttWUn$&0NTi
zH{xFVPpR6G9-{BBLO~NBio3+0l7I(?q52QIUuWAttv(2UU2ca}y&D)&eXal>uSDVk
znEu{h4eWk|aL)w5tUMv_^M0ak><C5cypK3Wd_oZ2<@VWpG{_%*hNawpjvK%A)J1>X
zRhE2$o$q{xxcxOS(*E3@JpGJ-eACeK_;lm!56FzY*)~E4?>&NwXMkmHrp+^22cuY>
z7Uq6sMCtnpC0makB<;?FLM8!iTpS(btkNW0kW3_<m;seoj1+XM(jshTrIeS-&aR}6
zM+BsdMN&(nyt!Qz&S0mD|L9@<Ah22?Hy9z~F)1jy21L~tGhNRT#(^ma6I#OU2AQJ}
zTOySOVa<M<g~fwj6HXG=vBb56&h~7x$pb$D&xUv5x6UxYNTC$-AGL=RG)*n>$yZkU
zO5V&px*<hUkNfn-Q12a%n4gZA?~9lpi<pPB0_9pn^32ofg(n0T6b$ueh6Y1{F%{kx
z=E6Zgf!+rfFci(Bl1I7^=IP`YnuX3mzGvc(F4y{*UylhKij7pbTgoj8H}d)uCE|s{
zPPN5^>?62ySpU5K3CHpG0nVuM4`IJ%S*nfO^!)vpA_GlI1(WU(6mbe2sOZbl-yFCX
zb&tvUdqh9Uf-xUvH7@jVCtxlt%bqD8dOvK<ksy<`%XaH{8#c!~JfS+A#Qp;`#(VSz
zYagBS0y;bFI5*=3bopJvUy6A&*#qfUv`1Y{9K@U12z3-W!-n3O-LK5OQ5a>>Dq%u<
zj8@ox>MAIrycfH>HAyoe|KUWKQEvRo9sZX+!^IR+Q!nU2OKk4DzIM;NF#-ZK77l21
zFM1vvAhfoZIuZsDKH95_LWl$I6jbLsCIB84B%{Q@oX*rnqr}CGxCU(=#L1k=)W+jG
zHgzaxPXvIY4=x2`>Rs$L{)MjzHUpK~KQ2t^OQZ=U1var;+Dn@Z=8#8wP5E_JQ-5eL
zo;+OT5N{CuBIK5s#}4{EB&T6+Zz(s&HSRQwZGRe=j+2BTel?u!$RjwPqpBg5Kjsr&
z5B#6LfuJr=##&@1$Zn%zFlbGc9qtMg?m=3}Zi^+b2rWJRYGUs342bWM6hZ`Om%@6H
zFeDDr2O_T3K2YdpQhS3iM((C_G~~C5aLpRy1?3<jOZ-&acOVvY2cLmnzoQqGlBgnC
zTW2q~4n01#PV=D6=^pj=GNyh6x3psQ{(y=wq!WuC{1J|I5Z22xRQskm{oaAtM<6>k
znXeYllRR#Y)TbbwvvHfTi`+}Z-uV$(&=Aq8%VjxYwQQ3!8pjt}Oc8qM7*XrfiB&*?
z^s>W~&IfZ)q4UjPGt}2D4O<hm6fP^A7+yEdLPEegK<o$!tn3{zoe$-|7*AAu`dvKL
zcMv-%*2XrBpoa<|r=2dZ(T|aYTrRKSkCA$uFCBAS!i0D<p5SSr8O5f0F{d#<b_sT&
zj$ycXq*{k~`t7DsFMELqnEWaE;bpjZzcNvwX3Rqe#sSh#{A6%HO_RfOS;q^KQR6UK
z$BkqqNtdUkMfD_E@z`h$;{a-Za+PtRE!6tzaMhi(B{_8C6Mo9ES?}Khq#W%e33YRo
zv5`&LdmC^Wu5~5J-gpXG^d~KYHN2iBCE1{G8A9}-%r1p5f@`2LCj=QE>lKq%d~BnA
z*^>eQmZL*kq*8R7xB#Zvqn}JTS|=Rx8Or&_5Xq!ac|nn=K&trhL2RJ>Y9JkPwzIwk
zUKp{tD@1C32pq0AFl{#!3fJ87mr;;8?hnhEiEP$CvmE=MCRYNzg}`>`OP8xjd-nzz
zP6)6v2(bK6#xA+5dA|CtnIFkpKF}%U!lDVYVbWJHq!Onvq~BDEX<(?SM?J1Kr|L5m
zB!;fuyFXv~JB2LVFDIua+m5q%TrS%LRvBVI68N@-GHpMhw#cLXzL}plulu=t@_Sn&
zww7|tGpl$h;#k49x>QoDj`cKZ>=wN^?GmaA<6&=2sdATS=z>b$EV_A7l?JMW1bWVw
zZh4|jEt!C~$#?Q)k*_5|EuEaw9sVFXT>u!O-Pj2nCI}-2MG+uIO*_`W(BmdI4O1%+
z+C4h=B$9Z!Hb$7I`JL$Z2w;Twk!tqx9*S;`nVdpP;lw4PZf9EoBmuF?*v+{_7RIU9
zFk}MLgY05tlHLSn9z_=HB=CIG45Bf4?5HFhs3eGsDku3-{U8^Zk|zbsVh&-D$#8u4
zs@#UZ`XwZNg?`m|5@S(A^;!=pX_n%^o?{m7x(soz7X1Rz!A#l#8nf!E$cGVQEbO-J
zi50*Kii$*Q0ppE1=U{U4RH7lNwdzoo)aXTHG3BDnHN)GfmkTbV*%!s?z`80lqwY=D
zi!@_xquu0fD@6K^mEZ*;`XkdMW=}UeJE&uh6*v*@e8u~?+tG|TWug&3n{bKLPFw)l
z?mnBVr{w|E?(Js=nY%21+)PRb8eDK9*;w|7zjW5e)>Gh0Z01k@?AFs?E76(ma%q5f
zsr{1uTQn}h&o!roxlgVEGRN=;W45_koj?s+$U0+uY0PyJ@jCE>=xmhyRmg<sO_btQ
zcnQqc{MJ2?Ms;6E0gMRYd~O8ZA!QT{gAh3<uwk0-{qjRr1z|J2ctb7M>3jTtly!rd
zFf?}LhSa%>T1D8e8MsSY5rt?kdrgJ}p7d_m=DOpQP=`#^L~lYZx3`rbhg9#sYPziR
zJ%iS0K191Pm=eCj0&`UW=F}mx*2NfAs!)X&vbZmzxWV0O;rVytF!$nGC?;m?skA1w
zy0|g>$xf|}tVCQYlshHkiLGI*upU2B`@52hZ#u^7SMw_ap{eQijK*a>>+8QNVJd^u
zXl?eo#@9T1>X8JiD`RG8&UfL*p`L>3S+GlN`-f<BoG6m3+UmzSbrH>UsuSu7SEPPN
zvC;WB{V>CxuKqLLRr6;!_S<@4ia;yu_}14u9I!dvnyz(CoWG>T{`}T+?vJugQP@^@
z@XnHg%cM08WuDy=<Wz$L=9?y*79B^GVJ3R{W1y;BWu5{ZyguI-qnhe4F}0ao5MdVf
zRBd0<3uoV`GUA4a(pz(F0FG$+zP39emf!Z0r0xmWw7yr^6)M30N=Wqg&apOPfS=%e
zmmAr_lY3_1nTYYxF(zW2f8%_Y1i9ztx+r4X+jDxrhG^^lIw&Ge;B8av#eFq-wVYjZ
zcfUu8?CVHpVd@8i{(c=+RG6u$fCT6#CL0M{W03{A^V*Fm>9+L%n%W32#(W<5W$hZn
zFo}qZn^4f%df^#JJk+*~#`J7@dl#kUB*}P^7{k(ab$GduHPeBM^032=vZW8L!b|E?
zXhFZ|o41zf^Go?@#(vR_Y#JVM6`Pa_G8zLZS$(UoxY;5BT5mDtYAsS^mpM074t0gY
zT4r1eI|EnEw_h9kr(gTR{HQ-3qnSlEIL83rZueA2T>2JW$0jRTUs$y}&TZz}WB6@w
zPm~X8f60R_@56c$B*k66X%%4m^m-2?I)>g*UrI#zm^2eR>=Y&IGOqyYcpg#r=`Y!a
zA2!T}iJ#VzeF^mq8*eLcH10}Qy-pu4nKx^567=H|_2c68{=5BB{{#PF{E~0!17dEF
z0^;;WE}ZU*8!nRZdSw}|WeFowyyIyRQ3}|Db*+M7iXn|tIH}7U#p>rl)sw#i%l<$k
zrd)}z9SWc16F^`cqSVqv45%GiK1uUH9np>SJ0Ehd<`E!ErJ(Qraz?BBIClzWC8VO|
z+KnEcYHfFhuddh#$ER!APaWTEZE;3krh7E%xP|A}_5z7hB_b#4RpwXpLI^0}55lHV
z+(jH;cnZ9w|B&@UGSKjkyP{><Ge}9hmOC_K)O<$AF7KR@pu2J$O7>_|8GqG<Je<*0
zKdjMpIV7tty@kC&$Z-ZwnQ7A+$KLQhG}!RRoO#bfbLs(#wi>ACZy1y_>sKb;si=br
ze#abJQN}#dDUZIrP>1!^P-oGvqMg=JFMb{?uYY4#hxBhMCk+r*PZ26EpU72LKb|SG
zzD`r)c-Ap}{aMcW8B<Pl$B87?mNsa5V3&Z;3!86x@3IIQrQb%_W&uUg(_XlED(wwg
z7ugsGh>eYnOz9AadrCurGxFlW7akM(hBP82Ffr|Cc@PUyb)Sr9`}!!0C@bh0i|KM!
zDkq4r7}J(UGD%tZSg5NpkTB`pwd6?NaHsXc6q@p<VowXP6ix^67-3(FyhL0CNV;A!
zGG_=b@H3G}N+zz55mw-5J)HFyB}bEK&#OG6ItOH>HB@IgPoz47aJe<4v${{Dl3QRw
z`Oo;GGYB&^y}X=qXm;g?(A0AMS@k9S<Z?kn^)jPGS$I`--e0BjV&&r?a_W?;<@Nnq
zDTvkOTOsS^kGt6F0iM-(fx&9v$}CGLYRVi?>dJ^>>gof^c1tjep|)Hav7&Zrmv~Fr
zA~~<tT!OH!&x}(mPsG?eJT)Y}@ADKcpCX_+X&oRl0ScfWPoGO*{3$Tk?4-R5Q6Mwl
zz}`SnciO}Qk5NH$6d|5WNPFQUK}yj;_2nTvVNrLA#RJn&LG>jdJP}cMn#2QFP(eQc
zFxOC|y_u094wPV>Nif%pq`e(cAXg+{ooO)F{-nK9Q6K>_5KrGwcWNR*h$+B)f5BX@
zI7kL&diGH1L$Y9e<2tGdu-}y&qY4Pv9j?Q5fOb1sZUwA_WceP&>gT41v$Ay`PfhnH
zaCwLN+qRpEG`rYd7Rg~9?QpIzYDj74R2OOfc6n=c9V^IsH^1VIzE3ifwa;OG|Me^5
zstL7>m_7>2A&GwaZY}a2F~naU012uG-p;xAW7tkwG^&U?st)69d=)X)oFIgg#a>cl
z^`=pPVN!Zsb^dQ?r2vJUqRc;Ha-+Z@$9?Dx%}Yp=2l5=*H5P7x#VCq^T=+?gX=DzW
z*jF$I*iANY@53t3BwBQaCSJxUR(ZyYThH}P%MHC8XfMLCWXGy|CFZj<V><c)X1xT?
zYD(OXvZRVr?G2Tr9?%<6E;KglClY>XP^%kjl$jAyvqZ{Wo!Tql29sDWrcC38Q(naw
z+FnMMpidYx4BVfEKJ#Q()Wcv<p~_o2Gq!AK=jJVDjH(7s6xy7roP@Wtw^uNR<iuZ;
zo|)c@UVQI#nM00#)^1@oY3px|<o41%+19J7E#ne7<;Q(yPcoEDB@_Bghmia5r|i@0
zX`OBD91P>Mz{MUnTV$HDT4b8=T7*uiA-lnU$UWjeJDu|7uygSG%A9|cy-UPwgD9Ua
zmHTmo0dzj*exhQVtyL}A;b+inqpd}+aG`5XWz<UgZ0fVxTHqX8tE>z_@<L=`X9DdR
zxy9pTwHM{5K+E3)L;=Z6sMtfDsI>=w1vj(W4+ux0GWKbrwV2w5W&iQLe@g;ceWp2m
zhW-6d`#(W7M^51EFYEme#viXehh;qB_<D3w-r*iV7MDOPY(Q$NVU67w;>&HsBHJ0o
z%kf2$+gXy;xPqL|N|cm02{Ouc#PHqlPk{FDeoGg<MgGuGz>a=HH!hr-OQeM*0mIaG
zY<i`~a0+WkTNS$9cx^<fCEh0)J5kamT#9lAVEbAWZ<(HS6;Wh(IW+162abXgvPi?C
zm~yl?&RPjkkbAjQf!LYyNvk)zvWdx@;#m|<S*b~sHx!cc%;4M^vZKsHL~GUynXZHY
zJeShUaMhwqt>in4dwJT<<08Ccz=J5iS{F<l)q2umnP<B<jjES><P=Lpf8ifeHab2|
zz3^#|C|OhGD_d0>=XsB*&gvIRn1XZ!pr4@L173P(rdwP4nQhikiJahs=v0y1@^Lj)
zSG%QHDyHeeriJvB5&2ioOvjaQPn9|~_EcIan{<l|r#U9<#JrA2S`MOxz9+{~6|xZl
zTp1w72z%eYb=))dX+Lz31=!zg)$wD}hqzyQU3uO;xsi~<PHJ>b`3IRlzZu<P`1>W1
z0kIejYxj?&o2GC;O_Ql_71{nd8*BG+h;A1o>7q_P&>Nq;tVIm>;XAN&3tnOIHLv&u
z{-k^hS@yvQr(6)sWKqf}@x|s>;Rh5}MO>f#gVU3WUofB|$x+`AuDVQdfbap=Gfxnn
zX>pr0>V<$d|AR<f*+6V*F--~a!Awo@9o+hRvrbun_!Y3mhZRB8<?hTxZa9Vh8Ns+7
z_2@`{-|hzI%Du*_)5d~zE7KWsoPP3wTgXL#lj+FY2kYpCjM#+m;`!=F&7bolf-Sj@
z6q5i4yhb0hjTTcri)aL36%X$Dty?fHbB~WsH8?%j!t2l6`BCQ1b#TNhq?U*6^a1Iu
zl$jQgEj!OsrLF8G9bu%B7G}0s2bP77EEYr}HbD^znkc62$U2s@8E%jZ(~U5H!=kY0
zEn~=d+B)}pUxr_0dehP~QZh4Aqth$F6etfCMaPBz!ln<7Sl!qcp3BTu1aMJ7z>ykX
z*)0|R;m3L(Kq>Z#&3aE9pZ^(;@GdpjDM)tofNZS)Nq+Re!%`C<qKX*KiHF2%?Ripx
z8YF`b7EFl&W!-OBB#E@o0cqGy31)5uCzeqHW4j_gz^FiwwSo~sm9ZyXKogtDZl+|S
zptUHY3j46ACJCp2Np86%3eLVXYpCGHuCEHNu&^l3#?ds#s^Hfsw*W#o%Pt<l?oil}
zA$byA0@+?{6?JK&oiD^*RVTdwg}u@^lES`uqm%KoHKPQ*y6_Z`nRtPfQQcZKoNYoi
zyC>zvQihAg5stIS?Iok=v_F`oitbWh%Fx*$ljE6)PTYBG{|GVus2^v1nsXt2Tl1=M
zsLmneNF@yUQu7MNbSE*LcC&bsc{iT6m8&;j#}{-d%*m#%31vpDs)jxK9vSokKr|%Z
zr`8;Pq9HJRLz`xq-@gK_-KROdNxt`#_2#D#$higEFn5(}N%y~8uq2Tz4B5jINS?>Z
zD<6hIWC!c4szak`Mx|*MvxtQUWPC8ovVl-qL-n&yeS6Ym!x3Bp1Y%|=*J`stbuR+K
zTry4_Mc7cgSLB1~GR7P;ZMPTX!wlHjez^{bTFS#V%Sz+}(HiLuTsa%`w7mzUX%z`v
zGiwCUmQY@)W%d-kCgZtP<Z~U|awFu}(z@^Y2i)79BzzVqwCDwxrpsT5t1{DW=F-DN
z1I#6(aR9*yecX^hEB3Y+h!PQUt0eh`{^HB{vJ>?~;oDX)RW81G!GM(GR=W#0H*qVa
zlt!Kd`v#g7%E647(VK`nA~y!%Gz4lXSD_vSXYz^_MknXS)r!|4e~}gDTM(Z@iG#ks
zK|z3!_$;(A^b7gl5M3irf-j-(-{U^BHemjJbMb_VGI6CvBdUy|=eR;rnX5N~s6<n`
zy%}D;Hb)_vV)Aw7prMwjfw~PC#vBvhl<#QBt>*Jm%{kZ?D@odY7!sb`W~CZXp{zIu
zl%}vqZ*+{p&GCH;ej~|o@EI1HW7{tO3AfAWs#R@3{%PGEXoAN&%^tCnaKy~NL?A*s
zrHoPijEA|9C0fi;s?0Nmt0w1y#WCj_!~0c%eVHM5qBmt`y8ITnwW3SX{)YD=?t;xQ
zzad<fk!jg>gr%+6EVQyAsl)NOdU6Vtz(hh*apr6rEgjX`lZPfseSpkb+wbTL%QJ!T
zHC<Mx$7a|V=ey4F+_KJjpK8e{^uqJqWjRf(Y0&RC@oqoJ%!0!rgjZV|x$6uaiRvAu
zy8DYKIXP6;J6wAA7fDhl7uME~^YO{O{b2pAD<FkQBZ%96(uyx_=COwRFOge%R{)|Z
z0Yn4tajym7d>3Qis&&LO7eQH64J5@(o-$bMHxVvQtR?L}dt(p_q2J8f+&RDTl?^!V
zsT=kG0L<@yRH8Z!M{u$(B#M7=Xm%fXgX-Nsy<b61gf1bXi#+8ZuKe~LV@S1tIwwe1
zZcsBO4~Qj}m>R;Wjk>rXn;*rAqit<AtBwyQYX^Zaj}^+ZCR(eH53AD{W)#s3LohGd
zXJyB}u`=9iVn@%vFicX%NrX9zB{8-Jp(de&u(XIJrO*@w>}rN!wU#68;Dqg}VF;77
zkt?)XW3^0erhn1Q1k5)cDz!KBzewuf`qfm0G1_d4YBZ|PDcEt`2igkFFAFO+HKi8-
zlU`|!ZPlaElqm|Gz3FT(+{TC!{l4}e^=epQbmvOiK3N6)i5*Tdcb;`IgI4%cs0Jbs
zlQK>duj&DAy4MK78&ic@U2Vw~wF<WaxnWN+iG>pSH`vdZ83<4`_u=T1_OWIJ&~!K&
z{ak?iNBqg}v1Ua*s`J}4ioNQ?_>M7i7TL^pWW8&{y*8PFn(GKfYn&(rcJRt;?(unk
z&}dDBd8y6t?2GPUC2RJx%IkzLmOg<p>)69qn9S-Gp~#K2nnmgZvQ<!jEg!C9m!YT{
zCAo_^`n;-es}nEqwLvc}FXZXRL;g^ZL;22`eE3GiYwpEMn3KWSb=Fl^4H70LSgeiE
z!RW?rY}5^>Z`8#+V~2t{GUz$eD4~JTv7rmm1-DxYUZyJMoA(sC(<WaIbyBo39Vtj;
z5(H4pIBWEhc_b9rB@*BLVS$u_ZkSnI1h*a}cOcmJY#sB2$IKU327-PqblgnPxPK=6
zyU;1ix#u321hScMErz^bqOZ;)eM{tym)`qE8YLEq@sm{6fql?=1cin`E_ut7G%6{I
z{5we^cZ&2LJ89HH6!~=U%^DB03?H_+&2gXgg|BAmI|P!Y>JE?-^QR5=fW!q_Yq6ee
z^0w@gY6o19I|tlSwTSXs6R_T0z&dX;8qaD$8U5lInBq=$Cg0p)#Z|bqW+!i~Bj)*o
zD9%ULHY&aqTM3PXARR}Alun51HOkSh>$Veruu%}CKCd}_nTec~e`93qn9S?wK<??q
zD(~k(dfbdEu>om$?q~6zzsJqVggUWV%f-1zZRX$mYTmbYu(LI>juRg0v^uq2DOi1%
z817b_F?XR{?V9Zp&t2!Yb+(Wvxtwz;Jq0=-aVX}{{${LWOU@#g%ol$LvU!nb8<Fi(
zV#r6C0*Org7K1KIM@~Ujos#dlMcoM~zSfLvDr{$w#CdnoJQKsSmt@8t6sUJ0;+;Lg
z(ibGu)dC1+O;ULUe{Fyj?@(LIIib^Qs<RqCPzY-c%$hz(;Z{8%R%>$1sy?__)&YSO
zYc{nqKG~~(GsPzz1{Bv`uVemNcow~fMLvR)F9?bcHT4v}td#;oeo~RXW1kiHMR}ir
zl#Mlik4Vs>GTz&aTsw`%oseWHL)!IA%N_4@_Au2oHvPjkYHl^+u3z>MBF*7vMYMa~
z;lgp7&F^~0kr+X6nyB-;{aifeGdW_Cv;_;<-R7p3zYv7MpO08Os|0^@%;Ejf`LOU=
zdQW6~iuO;sShq6Hoo!Q&FB!uG*GsY!51MMhH?^2LPL;a%`zMi|X}*H5(PDldx~{WO
z8}Ky%Gki^pU=WQ)+9>>Coj!%J;WV+KI=>?s>v2oFp?+JD5D8_(i#{{{CW8%c=6a)~
zs6mi%f|g%g4dJ?!0#VEeTiNc+ETch`dQRIft4Fa~RDmGnroQv5npSsZDYT<q`#PqY
zlYb?lM_2<JbDl%Au6-ETS`Awcw28Jp&&Z!{Pn9k{4{U5-maef0fzZ=g%(X?H?+OV&
z=dDMbMTIlnFDn4p7HP=l_*G1h64Uqye10E}jNc?9BgGQ79b?3gsz@;7L~B1a0oSZb
z$}F>F-~8IB$&Ztlptlkj%}iI+msd4n-K4rn-*p$<ZwP--hqcnO$E<^QY&^1wH<0)P
zvmLz}5yF}*L`SL@pN^)8dKx^K+)8>lsX10w=WHN!Oc(CLex?7%V+hP&<36>j#ASz{
zqjkVwX=nQR-udSi;wRenu7BxcuJ<nE7(;-1B43ZHGV-gUgqy|}%hiwHk`pIVl((9%
z&qCH$CYY~9ac2BKwxuraG!MP}E8DgYzV&444n9(18^v(|1eR+%1(!FjI##c`rJlDQ
zfh%oSq&=@h7e3pCE@k%q+}AEdIWVBPcS?`G-;KM{dJsg*M(j7`(>7-8@#Ib04~{Es
zwR<5}Qqn0~o9`Qp$8c{d4eF6XvK7<#VE{M+lRnImTC6m6rhB71c8Lb37(3Q&8v>7^
zPTS=aakm<TTgM*)(<Qw8T>*;qOd8+qM;(F!{$AOKe6p{9_q_Vu&^sJ(&=B5{3^hy6
z-(eB7EHtq=^6Lc0_`O1mS2v9A;4(#APl+lu<B4ZY*b~zQr;b0z&J%t&SC^-n9%Lm3
zzh9Y-2!3LS@I*=lLn5kR4rDm!L}%E=6NiH6XMmA!Z<p9u(=irH$@LKR^PVsMaC2wS
z+^B=0{Bazs|CErSFSUwFv|0fTKvm*vz=-ZP++b?&^HjZ0R6*EF1jy{USLQbMEN+*)
z7k_YFFj4#qlJkFr|JnYB{eSlUm!;-swXXbEKEtcrZ;?v##i-wI{7Y4Ojm}}!R5uyk
zs5NC=&uz#z8Czi}dIozuG?B+eq0-rS#%{cOBBvx@r0ul4WQ!~5dFj&#gl<?T`RKwG
z4Z(R0eZtv<l4k_W`p3bi?f%SiTp;tV;3RrnIPNFmy`cSM?M99=Twv8Fl6~Nt+@3}F
zal%}nQEsYAjrO#(Wtl%|Pt5c1LLXd-^ZvHSDN$|O-ZHY}ei2j(gS)}c;po9-l*>sp
zzzWSVh@87l%tCECH!8Nk5zbag9J`*+s&9I`YP5j97rzpaZBptAw;*EA+l@H26Se~E
zsj7?C!_Lp#_bJ;2TD$C-F00ogwwEqOcsD_9=Lq`;+#+tsH<jP=FKymnca1k$I+Z=Z
z9Okn74Nkj<q+E}$c{aU#Wjs)YX7&05&ir>gH!&HLYx6E?HDo=q=_)$LmX<en&rUC0
zF5HA%x?GXDV=qZo3?3u#i+uVO<^}dk&T?F6+Oc)pFDY7N;@Z$(zFjuz_rK?*IdeVq
zZP@w2Jn9lpyS#vPsuA~LFJm9XoWtLw+_U)V_|ZEoj@)7SDf<Ts1`+2o4aa@4S>N3k
zKe_r@ec1Rxel&KIer9*01*jUN2LNkG6HhCm`|q2?A@7?cZeDl`5?|U2=3ib4yk8^>
zC|`yPe!Nf?*uRvJrgW!|Ry&YolsnLAmpM?a)dWbnif`+?%5RI@cXbz@lyoQI+-DDo
zyfE%5`Dr)-x-+?Dw)HlYwxu?{*I;_gK4N;z(+vvT%hqMsp5I&7Y1No4Rj-S6q%jl0
z9c1~&Y<w2p)v;o?AfZAocTCrVxHBdVy_ed)Lo%Sg59g*;9KIfOH`Q*kA(0jq-myXx
zK37)#Df832#TB>UqpI|qj-mZb&(>-wlFNZ!`-$zP$G3_O`+OeDR9@Kvw)_|Z@$RD}
z_bJG}_!vR?0y--qgyMY;9i$)xmGxq@Gmjhr`hv=wXd5>d7ku+l=cTLG7V;Rr_3ib<
z?aJw)GoXcUVwWQLz?G&plR~1cCpAujTJ<Tm*k;iqqW<M2j3RM!d!~qc=Ty3_Q=d6h
zH=fddb|Y5Ce}>*YGkJ#5`%vGA<rjYno@4k%Oa^nR69G?-Gh~)&QO`DnVb8W{F62DU
z=~c4D4&J`PQ`FpXL!dvcmp8F6$$JD!#b+e{kd~6Z5We-<v9Rj<$gJ)stm`6E;N?r$
ztZFV?us<$fAplPGVZx|H5E1K4qZjU7cD399n(zMHs6~+Q`<X{S?z=g6#WooBz0NM)
z@9wf~B#(!VRdmI`+G8acityS&KqOF{XKHeka(Hp>)z7nnYS{JpYUo!{!Q03$pb!nF
z1-@xUIwRsZr@Dh#yBZobw@S;7X-B-gVQ6`@gLHY?wvJ?Y;5b+fdSd4G88&d-(YQE2
z$O6u13MEx7X9nem5mw^bjHqT34%LA3F#GC6D{?i9zLXiYvesgF9fLE=UojWlW0J?4
zd*5TNNE<XV0b+{(0tw%?7boWY(0>FV+K98w_~RIB-7j|=@o5uw?<sJ<LkFz{KpMZ3
z#Gl0l>IQ(3-c#iRKQPEo6~%DhwSc9cKdHyyXH`B0T$c<Wia*daA65+OKX{8y9eM@d
z6}XFfAPvp~g0JpdcH2J~H|DoPq+VXHBR(uV^8*6=AL5j?-qF>xKJm*-J_$MIg(U1A
zW|S1)<rZf^ENemY6QBSkxZLbBy@jq~C~G$Hh3`-_FY_pXpLnJx^uGliU?kEIc5N-)
zgGAdxM}Y4x>vO=t_>(uOQC=^TVXT?{5G3B5HYiYdWLcG+cWGr$N4Qm(ewAL~_$)Bl
z;1ZhIq&zP;SJIPQFuRlaP*s&Y*uzE)pj;a_WVuSUe2{apjY=NGVF^ZLF~2apC0b62
zvO&KOE<E8fC6&VH1aHK)Y2Ea0XfF`-9gY-nrh>v@eBtWb;eLw@{A?3!MaPJTXgfP;
z1Tx93^Mx<|VQZcdbKBi1kZyJ;elVFDX34BFg7<4u<iQ5=x;Yu#>xTRFjp`)?%>f|X
zvlQKPN#JTppa#P|<ME<Ji%39AaHIRA!o{CfmB3UGi+5ebaJem|!w16Q95<C9FY&g5
z4G`3K+w$??Sk<J45Zsgnz}r&uDbB1d0qyu1c^-%g2|>1*h*Jrhv(Yj(S{dPjQ^#xs
z=qk!EP7i2>#<?P<%cQHn@r(RUVCQ*n@r$|+iQ7!(I$6@iJSsjHs4vF2h>8WCuOzJ$
zKL(W7lG?<rgdW7LwkO^yH9kv?){-3f<$Z36krr~^@V_)Ig~UNsUp0G4x8a;;_(fUx
zZu`6++SEEDj&AMjw{E0O-RLUt-M3`$7TCZPEZF;%0(~|my4aGSwX<i$MOhPlt}kuM
z9aqu$bI&<?QFb5v^RmDzc2O1`3?JKPN}8d|D(JiY&xEy^F}~k%wrkQFi|LN^YmxJ(
z2TqeF@@9Bfz3Y}cK^46zWHmy5twtLtl-pLu)&&}Qma-TjP^?Iz$2c?lsL7t>{-aNH
zD?y3pqs6R@M{+8+GQK{;NS(cwhg>Z7M{#U9JH%{)s8%!*ymJV{=><)Ib8!O}BD77T
zPP!wSAyOx;VN)lnWyLjvGt$`)m9(J0E0f*Cxh6&L6sGUR|GVXASo@xdV--O2FJQI)
zQ}|zMM>Hb9oTcNZL(%eVLMvx>AeSrUr2_WemTMS_7*{-gyI5#Gw3C~+Nad~`we<=7
z7!;%$3w3_C2;>xk^@-)Iuwn?7D-@w7qBo8yb1!uWDkaV&^MGN{Zz#S>X6{IvgW&9N
z|F67r<$+hn-^?KX><GaT;YQc1%mgF@Fngr2A}rx`)MLy<>g@8u9I)s3l=(>EG{6QU
zym=f!VebKY_EBd1SdK{wCXl;Xf_}*GxH*e($O8#O)R+F+&`t<n*{sjQlMExsb_>lY
zeY_tgwwf_y2>6agB!naQf+J>#_)eGul)BrsxLj<ueT0ZQPKpDZmCS#7p$5L&a{L)0
zLwvo)81Uzxa0Fo@*R|%3<ibbVwF@VEs@=u;SaT!@u;2~~V9x66!JFR04tL2~b<9aZ
zm&9XqG(*5{a}J--)f-T+4%&rUnR84!H+hO$z_oV)NAzeT34h(d7!b2>-(_i8y$)Ts
ze9B%oehT3;@f^!$1M`@QY~_=j+~m6D$D#0zS00bR3wg#V1SqnGU#rKW`a+wCY*_;i
z2#5RMluS_lD_Np*4FS8@I5D@Gv9NEjCTIcEn$bO`^i$g`sk^y26VV65&IK?gX39l%
z(ZJRl24!3mb!8qCx4HG<wF0bR-U9dG_5%H3Z_@0#ZeVU*lx0a>nPqle`bm6U+evF(
z*hynu@kw-D%1L!ylcuRH84^n~rWDS46guE4GAZ_ANFi2lFdN`Es296AxEZ@SbcN>=
ziD<fR`-h?#f7=hUEc^PiU)ruBfK3Je(Yjc~!|p5VV{!NxtL$Pgmf_*iH2u=^onF=I
zW@U_3FNaZK(x^J9Q9Lh}_EewX+3atA;UrDD`kS+gj|J|AJY1&|jR&CIRo_^uK*PLA
zekXmr`#V|%J5R1mWtgV3bvacOM+!w<33Ew5HsCcO6ir5%XZZHOEw!HQpKv#W>B!uj
zEtp3l9fbh$e}IJVOPHZdMO@8I$cbRZEM~J8)zRd8w7E6cp6myL+b)7Tum`SM2BQ=b
z9!NqD;$_EMx{4&;2ms9pU=U+N^2(f;UD=U>1c&ntS$~G#470>r6Tn*yJJqgn6E)*e
z_4@CVb6aL1lmb+D`1aLWEwhl20mP(bH)I(0Sz&Ov7KMAmJityT#&SE|NM3yGeEngJ
zBIXj(zE&JWW=0V<KyE?Ua1-^?ukchHjXccZ6zXhS2i9uI_1Md`+Y3u5BP7`RoE;?*
zJc4nHpSBtfra<y{|8eIiw&PK(+k=wj+k>)b=P^}*B(t0|?c9|x0RPh1Wr7m5o;Kqv
zGW+~(P`w^WjZt>XDm0#z1l}Je3A`WUhwCECxe(%Wq^UKr`B(+$Ox6Ps!%^|$t-oNX
z4naMqrQ-^bfBqYuDH>6p-v{P{l3M_T!&d!UfPYKP0%J3yfc8`c?IDpT-y_*CgK_qW
zsO>l4iviGi%{OwEHg9li_;G=T{7~qzBSv*M5S7e1p&Y}iwNsvWNH{aSko%BNb58;r
z%=)1Qv1vPDH=JPm9HD@fgjG-Qu`&118!TGm&H?c%>d+5J7Wr1wLGnRK3bgb1Uk@6=
z_H6;Ai9gJ9Bg<Q_UUb^%npU30)i{&{%MTxddHhMsKZyNFSwCcRKChHUpOS&47V(B}
z;N$q8p&7%+vy0;T5DGB78O*L+PO}T-P<<E(`|_;6tl@&vOO!M%;X*Jed2Bf_g9%Ie
zYu7O#sT86dhcTcn6mA^*)G(?OE;37u9aq#yKXW77KMTz}htGfAK%dTM@TA{p2RSRh
z8nEoUfibCZ5$6W_PI`9rvMmKLux;&pPMB|~A=Q@gUzfmr<5UkuQFV*Yv=*)`qa@F;
z7D+5aT4d!23@-^ct?X17mLWSau|}X&mBVqchAb;tjyJakuTZcXd$NRnRk+yAD+AAB
zbql?c&)z90gXd>{5LQuD#IQdL`#O5EaIZuV*m<g_wq7KXt)RU)Q6vVJL<CC-j%UbP
zfJ+IlZFv@<qVS_}&{T|0-aYwyGgo?+Wyfh(z&hY@)S5!YN~{ITmrrBN>HJLc^GUX-
zBmu<~50Z7kGLkhm2(6?}X_GyhKPyUUogEhM7o`|{{pK1w=32V>K{J|_VoeR23_qr}
zczblf1GEg>$^J<Tof*Nq>k{2h|F$zUDIwi1bg3SlCO~0s72Zf)%@4QzRjCSVr$3qM
zVcdVm%GC&7jZ;uY1T`gw>aNrw_g0U~cewvHMOPuK3;gu2NIYl;EIcD<oMgk{PH?*+
zBV>w#-`3(CpUe+BT>HmcCz_nXS}pupwjXEK260hlZ_B^iLE6_FR3;_DG+)1ebO!n3
zA^XBd^4di(@j^GCiKK4W(~;YfQEg?Ip$K&}f@1vwvBkv@*jFOKJfAFzu%PnGLK~_=
ze!?i$ih_W(Dr~>R&2jA>SC^%V3d)jgPk~SAmlYMQ?F*Vj=HEP=1^r~hwTSWf3+Iw|
zVEyU0q&S>!N2h+FPdkypby3PQ^*Rb=X&&NP_qeE2w`W}KS7vts&f<%CVM6kyqmkSS
zl7qOcq|=G0PDHf7y2%RnXmK&I$AGQkl0#;!wAG2qPGNv(o3_~Ktu1Ai2?0NB4zKsq
zj(MyalgO50Ih`ZZNF7M+re*u3MasuOr}f_9i(4TE&6n?jrH~N|Ry{z#$hXuRoIzHi
z5a~8zMpk`Ndwvq-eHq)#=87wpzy|@S+U^k$m4EkJ^+rOP3+Y47n3tsxe_z>`rOU5?
zv20T8pAoTmK1TJuLKc-!4W7J9lAm};GYe2iULlhT1fYgIqGe=&@@AmkvzRcaQ!sDQ
zhpD+R7p0rkt`UIgOy$>Z6F{X+I=9**MXVozU1#!uk+_Jc4eH`hq{kGn9#JRT{*+9a
zVgVxku6Fn-7CQwik47h=iL?;&+xPB|1<vCQ);FIK0Wx&r(YIz9*H+S;v+JB2wFnP$
zHuCi$Rl==*43b}ll~@bjPVG(|uaS-vkN@W)<+Y+H2L3yS-a5T=&STHQ(-kg@L|Qt?
z0cO+;8BI+lNC4vCRtI*HrZ%Xz{g(oK6GKR`YySxl<0;hn%{X59yC#$>HC1sh&iGKy
zyIiV>(70L7g<@JzxO1_E&l2m2d|P<Q4;25S-#z}gi^Ur<s&p`qbBk~}?`{;-$n%SE
z{deq5!PmFOFr}UKi|>0|5%){C8LFC0o;~>H0%07b!o6X=!oBt|lM5%};jXWpv_~Yi
z&E<{YejE)x=={ZmE|J8paEsrv@6vWoyLJDn>cQvXS_)`OeG;)l)sT!E((_JvLZuZ9
z7CR{p>#q*2BF~s-g=nbMyLbGCE?WRJZrV3jYA8ys{Y-2wEV`gx*&zgU+~{|%SFopw
zX@R&{^&UC*W=@1`=z<a)MPGNfu_AD21VtUS#Lw$uo=z?$7*+>mna`WJ=&=vz5>K&l
z30F)x6uKP^Teh_EtXbHHP5;s<)H!NC`Pn9LG?iU9xdAybrRS8@hR<ks`SUz;d#G#D
z&q=5O44ISe#<2lTk)`5>paH6eef<Wn0k(!C)2aP;ut)sGra9e~gFAEBJcjWn7_=(M
zn~P;^G)BTi%%Z6cwYh*8Cn+m03o9cn%Q|lT)e#BfT-XprdwZ2qO8^z)oPg4$_rcdd
zFihe75#a=TCrqk7kQeX8J(wXS9PCA&%oP`$aWpr04~RHAf*pL554}8+nO)$=gt(K(
zvG@Qf$q))nKZ-NV_rj`Vo}n~9F<CXz2kDrK*(vgZ%wk~*YB(x(?CV7MXDB#2bX@6V
z{d9`z*7rCei{o2-a%dIn(l5-A33Ii&%IeG)3^Kl{)}ennx<sS_!>2PCz*p%?<x*SI
zBM);Tpf{Ee@&g$3J_4|JDJTjW@@0KG^SvkW@h1K|@j)XlOk9pNRk8{9JRj<h2eHFw
zXHcXeud;1!$Z98S(Gekv@fNJ|k)Ak#hgg9Z(;_QzVE7SJlr$0f-V^3cI1;ME2@dMe
ze!Q_D=)@G2QOYxhElX}V)1<{t!81K-hr=$_9gnB6U|jDTA+2q9q-;h_;r!7Au<{vN
zZOj*PiE{m6QbU>SE|%X@td7S=Ec){<{9~mvUoKz(zdhN*K{{K}K{{y+fBt9(@f3_B
zQZRQb{wQD$zg;nTSge5EpJHp4Y!6X@a%<LM5dS6HQ%o_6>mJ}K7J%k(!sDzxn!*4x
zRqJS(6DC!`VB9!OD$>C~Vwo%Pb6T^1jzJEh-6U$TlLBvoo<-9>YRD;-TXzjD?p#N9
zM?W>OHJ1VwxjDIifT8#XLk^dJL<Os+QEkMAKIK|l&MeEm?B5S5wcN9(c(~^Pk>+j(
z5%(9DsjCjjLeD;8I{4vq;tKrH2_o!gK9{K#$m%=<oYtsI1A7RBoC~#s6(|P-Lw;E?
z1A9wj$j?-dypCdl`$ku=zInu9t@Z&mIpkkfr?Bu0U4~)BT((WrMiCN-9SqvsR&{;2
zF{snp@{WDR;WnnPB@%%hSUw+JB<jNhaY^Xts$kzbbq$v}G{`2Rw^vt4M@h{fcT8#9
zbKYp7(=c!J)8X!;Ob>R#6OXO36;%z3tqdvfo1fXi(`>0-)S8S46bA2SdQ)DH2K3?M
zCY5rv7&(4w&u-buhB@ZO6ttX7gQvR>FJ#-WUL=c$hjKk^L&u#4EwEm^^>z6tY<Cx$
z8aS8u=~(VBq`Ncb^Ie&(@x(S>=2~s%jiShu=y^M9YL@tAk9P0Kzv9i>$d5HP&~LVJ
zFHDOTxrx$-wm(Mw?#^N`mJXEYJW@C*Y3s|uR1@o@141$7rTBd>fzn}xUl>=j@-#PU
z|FbPJCNRV1Cx-T8O|hTUmxA6{F{7wP>erT%!}!xfNuGlP+@%aW?{2~#*J5V9e;3Wc
zdZuU*SM27%F`^sg?;5s*?(C?IB+9J=+!hBQ*WsIYl9y~qYom@)Xa02Z<GDQQ_B6)t
zB+8f7s<JI53)&|)%JCL9<s!CxBFyJ-Z`HXPu5=6GYqG6Mo{EE&Oq}hl!9OzlMBem6
z_-6`cJzIk>e<@S%CHFa%9e`}=Z@lQo>*=imR!=(S_}fYbTes(Ooel<jG6vcmvA6hV
z^6EX)7!Mcn%6niJ&OYE@E=zB`NjvN55cBEdL|g}m4<+pe4$;qlOIC^E_M4t!A4<Z%
z^w+;7Peei^F|L8r%%vX{^mL!<sVSed6XO9XX1hJ(^|uCQT2D3g^j|e!KmM~j?2{J$
z{{J&$?erXB1hpN-_Rh*&*{TTn6W|1k#5il!vAg`u5D*$d4CXh=NIF%K`fg-wvGZC#
z@!q|`v_3&@5gN5U;a1jjfDxI0H(?o151{BD<yWOOnBuZYKE3kY_Iv+m`%L#mgyr!U
z7F>Bnq{W_+l5LiOj{X+=onq4K_i7*od2z^Xo8zAfDi-dFu=ygfjex7!Khvq}wBNNX
z;E~{cYX|PUOr#F{GV))C=e5Ew@n6r74q9_mja~P05N8pO`boH@B_+Tsd#}(0_Y>P#
zK{g=l=~{3D;|?<K6kyY?OP`ZK3dTuOq(xfg?i)^s0$ZCrBRx@epTAitp$NwdTH4Rr
z_Kzfz%fNz+QOmTO3IwvNtqE(#U7MULpBe@3%=ZZdcc9wCb>sRH3NMTQ&6$+2HzAjY
zMULQQ#_W-Zs@Qu42)T$+x8-*xCn6smGf!it6k$+AaWa?0;44MrNB5Y&Q3A2el&<n}
zaUA5fN|W!?NM&hKzguLX63F2aV0R`urBqTDSN<5SNhXOCeN_(c#%_;yQa-^NuFA*8
z=|T3Jd?E+vF;#l3stsEi&EOi0%BhY|jOws8C(M|>34ieHOFknGXYS_zxhj1miP}K+
zCWiU#msj){6u${A>P}33>i5m`F(`5C|5N_^HraoD{<-bT=S%tW`R4)u*XKW<_P=`i
zudlDghl?DSrwKFBYeXwR=)pmBpuik(A&e&s<F&(uBh9Es83st^S>X!k3-gQ25Rw}J
zVHv4Tv$L#3Ynqh878Bx1nv_9Xthf*pY9|)yP$Bfhy=oH?%qy($Dhv%q6uTCwZMEC1
z#7NqLK@JQw*Vz=9{`K_XxeRi<VP?2{^b^XV6o?X9KMGV*)q$O6h~+j~F?d>nViyeO
z${KRK^O}NEloOQfv-P-$Ew&O1^y{-ysf3nwW>m5be<bl4d}iGz1YJjOA$iSt0vWZt
z#WffV@*`5kPCO=1>6;0LNKzdf0f#t0Te1d+=q()8C$u(tosn8<vqrk;v9CK)V^*!(
zf(cWJZ-gh*`Ins$6`OQN?&!H3GY%>BZJuEr>Nkd8={>GVCiHwKor!as-T*x<Z_xqG
z{QWcZirlu(u}P>{wfu*P^Z|}$^fPVRV2*B(gB+;LEBZUF_Fyv)sDoLOFnjXB0DRg|
zNAyr;`;u?RN9ZLmkgYRe!5iiziG0-JE)iikmqjQOdT4vC=c4=`Qqns_a6_%zVTr!A
z@q<!u#m@zzxZUhVkR<62<jKdGaG1}G{W`uL`Lx>_z~RiWvrbiDA2N#d%|O`Nn`XYC
zkcMS16YAEH27K&OZ0LFz<r_;rZh(qq-zRnBZVkNMvyUj>N7*&fr-~&L8Z4m%i71tF
z=&V9Axhu9hmUpx@e3y7EtPY%?xL;^DX;>b{Z^)`qiWBh=h%U=4Llgx}KmjsjgJriN
zYB7wva{CU-1)6R_h^Ww<Q-4GMYr%Ry$ee&t{7D<L{JjbeBNjZ_AZov~QzNr%);9oZ
z8rpF51U&i>VwlX{azBQXg;9Aca=!L2#!IG23}iGx3`Mk~$Wl0$p@vYeJvF0lZiOe!
z&L5iJwy5bb9I&xsdQej%XW%CWh2V0duTTV0=7T+r%#`A5d4ZAFT1tRgL2BjIuMBl*
z<Z?z|A~lUwj77~=f<={8qD7rm)FNzm$lqa`BH*wQ@IE1e7~L=#3<NMQYF|X^qTB?H
z`rK%Zs@!;u24DPdwT|>Bp^p3~I=im3cDwSkCcEo-*!?_FnomE_NPVejD1Dh|NOTj`
zF#VGkQL1In;8)12LeCSC`VnQgc2f`ZcB!HyTd7W&HqroS{t5C}MACw!Sxj%VT6FxW
zmDv7Ce=tAd|6qS46JX`YO~WyfV~6#SYgBz}vy(_Ps3fInjxNss5!G0$POI=uzJ9!@
zsVaZo`$t=2Ra0JLS5tgrCWlISGgfLwr9_dtO=DvZha~T!wi@q1#<%w`QuOx43~D{G
zU-k?%0+tLE0=5if@6+1)-gDX_-c#DjFELGt_gpq+r!MC@eOXP`wTs$p+|$~0t&L6J
z9nEYuch*7?s~$r5bnu}(8aUyWbuu9{E2l!Tm$CW=Dj7mXv~?gAo10-jde=BTtDD5G
zX>CS!6qcv^I;!-7dr04g*BG9pY~ps#m-YMNs{BF%T4;j}v{P8q)hS|X%gvO3RMGeS
zAF93rDvqXEJ4A2^!9755XK@Yg?(V+0dvJGmch|+;S=>Fiy9NKr`+ncO_djQ5w!5Bs
z`t0n^&USTGO_j!xs7ckTE7z5WC`C6ks2gd)xNDp;w$4%5t33@1Yd{SRs6mbJ)FQ@?
z)gUH}fe_;=su7ba>LTM$Ya?S%L6I>TwUG%Kpva`Pdg<u3I_cOKvkY9{as`2%c{9S8
zc`QPba)7{yIxl>Q(F=LLkE4?)=W%-U_`EA2<?-`ZzuUOz`*JvbNDYht$@)TnNf0ff
zny%Kj+P)TQL%-XZXqx%@Xuo+hLLCj20L|)3#AZV+47>go!krjqZbjf4CS`*a42{_u
zmilrFReh<Wvnk$j=H%nNXAWMuPM{MAAO6(fg>u%A8}%{s*5-ix_;ONc9wkSkf=u9E
zRVLsJl!?f#$BpvXehWN6Ic}aTn!na-yKSu&JPxS-aok_6K2N2GP{A9>T%(O}tlN%0
zzv9LXHf={S2CXBwZ@AF`>u<dlnT{v)Mk|ndmDRoBGz?z2fn~R5i}=TN)pX_Fff=9<
z_@{12Jysz3i3$#)yWaK=W16D&06KM*Vcc-pGXIYC3jeMp(C&e=(Z-cd1EP5Zop50p
zb{J|ocZXmxclR2|aP_58^+8-C-6M}iyJJF`-)l%&-V2=g<8578+-pWz{dHQIkZV?%
zn`>2>f~!ZFoohsygewL}wp1EOwz8<gd*WM1$M>uH#CX{l%!GI;eRI0^@T^iSo8ub*
zi~i${fbZ=M3EFw$Wz1>1@~wOWLl!A#Ul#sLCcC#g%IjUt1AFhrx!M%#BH&TB)=e6#
zfnm+8jxL*vpUoGoD{92cOgiguK88eKTU!ciSfCELZ&=nI*X-0pX1~erZNRuNv@lHg
z2GHW5ELzx{^0AgOxO(Q`V)^aJHp4`xd?$HC>rU#J#2wc%nklwsG?9N+Ya;Kw1Slyw
zNtso6hbi1iZ{xY++(t6RxZmN-cUWc#KmnKghgNMzgDwW$32Xm#Wnh0dLRK&`>q5P*
zk95yIQT21$+ATN^_3i)e;UxWZxq=i2Y}+t5I4d&C+w{(MT*PJ*qRW8TyYT$?e2>3P
zo?b?A+`!%?+cWFSLs|T;`480<gcpq<KA;6WVPoQVP=l|khJ|Q-gU=5Q&SIluXaviQ
z?2-zAL%pL9Ph+KS?QP&?BTuxsJH|B7Q?Ee^Lc>yg(ORLKBn`51vEF8)P(VEm9}6hV
zG)tPzz(SR(TbHB8!YN+EK8da2eba3DVc8rfxT79{pA6_XCDXWhz`Ejc17`X5VulkC
zW66}bG_Xy-qN+K`LKp?;30B9HndQ&%p!3SVL_EZtcm|7k8;HudWe|FjYjLob8Lj0j
z*hQ4>aKWMc*6JLR5jHe3&yGw^oUmnjX&9Ia_lV51VTlB0+8P>cn||3Acj@}`6)j&d
zKvrSEc&O)Y#>rrHJ1FL#6$mp<{`tR)5%oDS;ReyI8Sbm)es+ed;P2bUq*$y3(YDvf
zSghB>O%KW8X);4iYCi|Yh#0LBqiyTr!_$lmS3SfB#_Sla=HCVAg-i3@P>mD1F_zrr
z^##4yEBl7eK!5H=sfz$hxOC9zub{?^i`hoF%oQi%5=$gX!<Dem6~tV|#wyt_D};)J
zPMFMfczox}k%VEV8isWlKM_~NW;dK*BYvzH08J(ZSJ+vMmnZuT?JxmWVVGD6=g4_u
znD6<ne3ByYyfKl<*^pI+Q#77`Q1Q@q2-*YchB|eTdbuRO4|)hBpDbA&>DePaxwG~6
zn(b_OWbZ<(u26AnZf}wzA-T9L3$*lIQ+M!T&y!d`zww<J`!UT9WVAlGUzPPC$Fu^A
z1y{c#(7uX%ktE?mu%r4zwpW~ZOZNw3=V|JI%sPZG)o#o@Cm{s2wG&Isj^+<Wa_M87
zcPZuQ`G}}eLhQ8?GV{=b#juRmL+NE%@(FQ*$nkVaLO&P7S;@`@aW0q19zzr=8evPE
z$STVr6jwfBiL?1}(2|s8yBM}juruqg>ncVq-VwqXM`h)NrvoEn6Xz7<8^&Em+HDWV
z6!s;>)WW0`98<@=UFIB?@b%!UOdJS?^B*ch)tG3{@WQxOVL@Bnf>q@MI@`oIuiGG3
zsM+oa8(0HMFYq6K_n=sdi3nZXVN1i+KF?m4@YZ3Mu&9Ea?LX$>a}Q_X+%8lkoNuOf
z-2dd_h`YT`0i~jl!*8DB|GW90{I`vm*|0BiZ9u^dd5C2C6Mh=0@4FTu<RJ%xD64MD
zDXXfLyLk9$R`u{5u2fz7Pl9Fb+y|$hS<A@k27{)48G}ZrM4D6YRh>_|n<}_JJ2wPv
zb@;2d;v!XJborfrxioY~<{HEIQ#h@0Y2e1UuE*%tSqj@Ez7zE5*2dPUCEF%A*}YV9
z7kci~4vAYVvte{ss%&c~RhiQcD>JJaV{V9RwWu1!I*DkCxf@vJa+k1*Ye#biucx*e
zS@*WrJMV0tWc)e08~5OL$9T1LSLw)T$Jyvz&j2kmxAnf#p4Z>+KCPfVL)UUIS8kCl
zHh`P3zCX~Z?$szh+cRcz!*tz5+{$2fnP?r3c4Ar&jB*not5Mg8D#kRCKhni8jc|x5
zCI!K7K2Qt%F#xgNik+>`9vec_LF0<TUAuMT0{k&vg0Om=Agb430#0ay8{PwKp4?^E
zUwLNh?}G~Ox+hn8K65Mw@jE}!AD9uq_<B-@*G2i2++EVo@Iat1ll8zp{a7^5LgYLF
z=z(4Y*vxc3n4H-EF88F>te)`uyBhLh&}5;L{06W0@}?~p!0Ad?8Xdck3tPgDp``ju
zfUZ<sgbbq&k#m=D(cy^(-&o}nbJrj!&eFx@&QV@#?azEiV>8t8DRRZR$Lxu=Nq<8s
zfAhoEX^>p<3p6E=HzN0RBOCLHAzqg^^6xtQU0iYPi)2SAC1zXdR=S4j@5Ih(*(GQb
zdA_V;rV0BB<iT%ncAnMFp9sn+)1X>^4D$07l$@y^&Et*Q&EcJiJe!?GHNoJLfpRFo
zdg*X0n4sQ;_keAJ6cBGv%&WARcM%t25|+2aLiR0}KF&+sNzyR!s}I)}l`Qy`_{UNe
zGKno->7qB0_!f&p-9`ZZUDhV|Qx$#RE41(;0m_%l&wI;n{z7;A)qSrYdFtN2tl;6|
z+FV>T5TizN`u_G8_-KMB-z3@S?J)GakoaV7n^qVf6wY(j2P6P7AO-5N1K`ch+}pP{
z7~rWsA@r8MM=6Q)RzLDG!AJJ|!mE)TLWZh|bP=^d4Y-Q@Tzp6lDTPOp(@YG*!6DA)
zEMj(WC<@svhdjVe*{vvIlzdqH5f0C~8&*VV@u>I<C$6I|C=Wl~fhh<O2^t1if5yO#
z_#0?+XbS6$M{{M3DXHB%Ic$Kr{23GS3jm%wMehI%>CI`3sZNhJ8H^R!V)dR|VTnoE
zgdm_z!_NuY6Lq=uTKUCw%Y41o8EU6Me*XzIbXp{<&*in1C#I-@9UHb#W`0*D%OkOs
zN6n|SHhO{}+&kArToG02uk*&38v6o@_$4FyMOqDw*%%n8UcIqa%bYGufQuIbbo7-K
zF{x&6`N=E7ig|J%y;B4gla+bllZWK7Bin@=gssfMB<ST(J*ww_jR@goqZ+ch_}ix!
z(VJskWO0fh1n-k9-{4QhSqAt7TX>NKJQP`_L2|`02JAVfaK4CPC%_=v>@q{lu$nEj
zI|K`hA5G?;QfLv>@L|5O<m+tXc>r@=_Y3s&dpOaxYj)~V^83nSu`$a_lDRP{a=?<{
z7?{x9m{tyO9h{mXGYcLR9HS;OCk-f0QOq?)M`5lDFHS)dlvMu4pe8g6HqSMl|H@pK
zSe)WOM2ZuVx+FOZ*3LC<eAn|UPRS6|y!*y1z=b&2@mz)#cE7nY%%fg(IHN+~$pXa_
zLvuz}%e+DsOS`tmW9Z%(^uxphV>za70R$+zl3~n-$pZ`#Ab+~WJofXIgYm<J>QxkW
zTh%YLK6+13LI-Fu1-}R6vwuQoXvxyH_<lcqiO|Ou$!9xgD{7bi3xrGdUYrBf)vhR~
zU>n}SG5t%ywgzL<L=4#-G1$gKCUaRR`LyYC*wCH+AW}8hHi0|ACOVoAGeZiEf^hVs
zUF#L)>)BJo69L`#{XbZ~xShYimmhL*k#hXERf^AC5F2ni`78&|C%Z0D)uT`6BYCqk
zwuP(;YRlJQ?!CXo2{X~FFvUHolb~T-)-b=lK0mpcnU=V}db(#N7m@`&HE;$#6>tW&
zuHf~qZAETYIuF{YJoel0UiR7Wj-dA9ZHH_k4x{!q7=~`%jidHjzV}()`xQqan~B$b
zHWDuSO*NUAR=OvN!9FAg>z?ha`UMU?&7w8l<%%abR4@IlY~u4X7xs|}R}eMRI&E>7
zW(7JjCkftY?qkD)e@N=0YNiJJhmvP`CoK%`K9|<FH<#6WvX|C_SY2e^gnl31x31t1
zo!zLpQ%svu(7=W6W&0g`creKP-P827A;XlBj8uCB)gkQ?u~I7J_;*Zr-i7>t(Vy?z
zDu18`sBjAnPlqLFEZ&ocQELAt5C1oh*griv%rJaQpPYMSOCy)R3+wYDg^z3zDlCUz
zPO$<caXKOWJQk!vx?S=yya=QT#1A&OT(5C{(`*2&l&x?c`?zZSR=5Ba^a6WWuIIS^
z!7l)EhHWDMe!9^Vo(ZGd7IoCCopRTg^aLA16Ew|fHM}IJ`5wpg23rjit>?%(2o?^U
zZMkt$m)tsv%p+jnK4;pt(KxzGLmkO0cnS90p>aTmo%1)<c;uhNI+Tv%lkhB#R-1H%
z;gF2>rtc=!w0%oKVLw*n#yd3I6#CyEjY)oo5&pB|3j}2hD~S4&Pj2?2@9QoEtgr~l
zH0vYKoNc8|`xO;*9&q$^gG%eM;OXTNglkD2;Y9$C+Eis1=4AqXoYU19WN((%uCOpO
zSmfTou^rPTfjeelqutke#m}9&y1?#khiq7#Bp9+YPRi#w0GVy5*!_K=yZV<cp{8Nm
zXF7`EPZGK-^`6XE7?baxwI?$=6jt9q3EY1>$}D6)49H4)<$>na8=fP3Y*L0Ui$9O*
z;|RBYVHTmprqi1KK7krbKj)*`f0`UyB2XNMpkHMFD$EYm&9<-mXOjIhI!6#+s6AV`
zUF5IZ@tEi{Tm-1}?af&GkDAWX{#og9zeDU9KklQVZase>VdLcs8DA>)w@0MhP7f=M
zJ~bbIC~maxrb1$X5h4*LVI-*eshCT>@)6z1np8kezrk;a;2!3Mmg?$(Rsz8oqA6>H
z=NmtbzUhd9K-?%)Wzag3rsDBn9qT9O3mSzkieBROEZP^+BHRK4pB|@G8X&9Py^xII
ze%QDZh8DY+kaes^^=OfV%x?YN;bB)~`mnvoxbXrq2jqx5N9<e?rFqz)crI7W8iV9r
z5u>!<Zn&9E@+GvUL0cpdg`A#ZNDbpr-y#-FxN>5hY*2<Z3l5wD*5L#Be>do*zis2X
zk?D`b+#A5ePnU$-K&GSy`>2@1dagiwEG*)zkLQ{&`umi@HkG8?h6q2{7WgRkO=QO(
z*s<tva`Nl}4z^aGg6uIQ?au<4_VHEsS0x7ec^0>yKSr|M$JyF`c(uXj3&;?WGumG$
zF1*H3TyTYNaKIPI$RLZJbNv?Kpv`ZPzCWqD@5(g%fcF>;oN)4r;&IY8-p>E{wIZ{t
z{;{k_zBYJBH5Ch0Y*fOC(;WBBRBh2(hwN?Nw&g}sx_8$jJKk&mPKkDhwqOH_rQ;8F
zz$EPpT~dJK`j2V1FwtWfLG|;mW3M0h(~$^A9;jj#MWPQpJ~pIJWanHXnI1jIiJsaY
zY<obEVnA(capkuNM(=&=HCOoxbQII=lz>gr?6z4W@ms0<`e#gt3tk12a*Og;tmag4
zc-ePxCp7*9t(d=l^K(jH>{k6(FE!QuH#Ghy9V-9318Y=%_xO8$)1+%P=+hv{fXT|8
zX#6XKY{=%+34T-FXC!ofdy<b%2_M&$uy-mMf7>Jk+-vRX7MF2JIw<`VR}sp$R}%Iu
zgSBfZ&8w-zHVrI8Pu(w#P;NcSb*y|e1(hK$@0*8?H>KuiRH7e5mND;Xo$IEQaVNHN
z{AN=T(OjN`S#ZAXYS-kp<yE2MTAaf{a=z_W&^+H_uk3Is7!6-&s&}c72%6DyYx4u1
zJ7HaVCGF}^`tOYhBtKxo0d$--a!x!8I?;?fu*jW3SML+mUNG-Vke;y$FOkxxoM?-$
zeJzjzz828&&Ikdim3ou2%&@7g!U7@-m<MOraNJrbKW(IZY%5FX=a><UTMB#m7vNPl
zQ^mlOz{Sl}xK^#}&3p@rbXyw#x=JCN?u3sELw8aO`c22`iEs4wo#8<QfKe@Isddik
zuj;z%w%3Z9bAz~(J*FWg2mUg};|ilARn>yfu8ANuJ(!Tz>OMT>nxC;6dLgor(nR-k
z)W~}{_mA9dvVlkNVTdaVK{RGKSVzjOSKMaBr83AN;bFPCJVHO(I1BzB*W8~=gZ-U1
z(6WfWt!Ienpv7FAtz7*hlK)3E;~6UI;*98~B-qm`vrj{`xi)vGgbZ`u0a^79+><<^
zzB9saP-CDS&r$0#*fn_6e(gT3;ZVVcAPyG`kX_H`!0`z6kuos5gmf-eyP32DM#qfa
z5XCLr@HcS275?DWqx?-J`Q<KOOxbN`@7=EzuVYQ*;Vw{C)$jKC?!8~HV-5Rw7pSb0
zwuevg?g%q_=1>>{0qXx?y96G*`_|Mt*9HH<?VBBY-#urwIwr7BPK6hlOj8ITc{hO!
ziv5KYqK=H5{slLe`ptKS>pSD&j?`QR+k0nBy%N@|J>>2bp`t^1!T|N%T}b(OOF95z
zt$$qR05QMwOLi7gR5!*aw=DWousj4jOHLM&*fu&Qmo4hn?(PvB3qy5Gwmdln!m7kp
z1K$uF_h|m{-NDmzu=H))w&koV-X2T&T3de`db;<FD!YDn7LHZ1_WyH^yU)$6{&{F|
z&%F16j~N@B%z<;sj!6n|mx&6*+SWG8|7S=4Py6rdf7^fYzwPV=ob-VI><J4vxCgg;
zs96tdI9WMyGF<kwHEb8X(3E7Q$m!2V5n_9d&-$5eZE8})?P+iPW}6|0)9&m-G3QVn
z(r+hT8LuQOWj{;=V+cO8cqQNG8hv35O}t#m?+hIpz1r106Pb~`-<~=~rOtESu}!=k
z$!vN%JK<d}l<=N#->v?LmC(y}x6pnhCY-Dpi%WAEI85Rd(96*)V)LQnySzLssB3KT
z{^?^n?yovqidFueeUC34xURfeeb)P+kHMkA>Y=G9v?v*98IWI9kjwhTd)|WD?|((*
zx)8i&E!i1apVOj2i~Z!t5k+cu&L?gcmn+pjyK|$1_)Ou;#Mk1`Em}qST{LN(uOyVI
zoBwSBtQ89<COV|TleMw`CJ%4zRJZGDoSBibzhq+4IC?f>^=W8j2+s~@Pc5MM>jzXn
zGyv)hJps7{c@1Zk1C>I28N}xZS)JlAb_urcC!b^!<Zcxm2cJb7#2S41^mOAJA!dE2
zB>DJB6WN7b(@$lF5OvSx*SAmn--BR~uZVav>;lU_=alE4Sd1`V1^QnJUkStqp|wM!
zwWG0;d&`OYi~Dtbg)OI#v5PJJnp0Xm!gr_`gk0J?7e`T4{9Y(VDJz?+#7p!+6h*8!
zWO_EcyhKg3S=2uIDtZrp_k7vIfBAX2MNuc$*`%CzsucjUrrQn^vYxDH&7aFkI)@W?
zBqe$?kne`_t(~D{-CxjJvXqr@>RlWmc1!xh%|QNtwF#%vq7VK@`+bmi?SBSItM+Lm
zHZrkPDfQO%t>%GVk)DRtjaB}bbVD)}tL(#Q#vClB<HK@j5iF_>H6?bOBRUO9o>7ln
zN^0r5ES8qzI*o3cRFCFHYU%eXwxVY<4Z7f)cK%M{iIf-T)Vq^UpsPHst?J**WyTAX
z;eg&C!3!i78~p7uZQB&<@X<?(;|o%pbnkV3ooJi`q7aGJPoX&4+-Wi1oFg&bycRK)
zNewX-xuE>xV(V!HCh|j-e3_OIYBA7ca{h`b|Fjkp=OMm&v;#qfwA-(Fl9v!C(wBfc
zQf|SbSo|C~F`3DV{GtP|Y5Tw_h~8sW;hZ>z8V+^^`S%*%2cHXLqzzM#m?TZKKF>&D
z4ByNNG4wi2g-a(z*&ba1wjIADQ?&SkskNx<1ThB7r~3gGjsYn&Ev(7s4*e<HE#JT-
zS`>R2T4sCB;7&&)RXLT&xubPMxMRvXAxEV}#+FiGZY8#cO41O^{G6`Fp?U48qvH}p
zi`&Ul3uL+6LbRhE=`nU4z)@;xsb%j(d`;uTT+71AuM(kEVIgs?$YSud__!-`+R>2i
zpr!iWL2HSu<qWs#xZ8|A&!N3(x`jtmO^dg((dxU33~R7Ose96KwtLiZArAO<3Sk%W
zFwnNwfxrfFP1Gu!HsndLXq%@uy(q4!frA*tXR>#9aI(si;m28OZ-?PXdzLyr_ELCl
zckjq^mSe?4cQkPE;Arr`>ahLiGZ?nz(!*d)up{LRr6bIWazl$X;=Cwr9BE<fw_{66
zn;L7F^P%zeaEt3R{F;YXjum02JSbQvs96Y<%v-K8LNG_OPj{?*x!_RtpwUwGC#VG#
z>!2fX*ulcce2qgb-zu&=->R-W)~c*L(JHN+!B}FAwRXMb-0;PL(}>v7-H>AqiLuP8
z3K(yd1#GkG1cshvp8(bfm$=sCmax|tmYmjLmhjiamZFl$9E*%t9Ziftj{8Ov4!pxL
zXC}?^&T9A-twd2XS_v3)T1jLFRzp+=UU96`Yq6lIwHW8AwS@bA-25jkt9kC|6$kH;
z!9)CEvIG3lqQlG~jDyUPq{GZ%m1DjR?Wi4%+qUOwZBpJcm7%JGge#5Y`&-HY%_?PR
zw~E|s9(m-dD0$Qc5h}`~Yl_n2YpSCo15~M-FK87v0jTY_0cd`=LZ}2sVU*O#w4S#8
zsGef|OrB=_`kw6ljGnIj<}YcXG>@>Mc#ol>1UCt2LAOe%WH)nYod*`=_y-p6#*hV-
z(WAP!oQ}#vU`I!7az{>WXh#X7+=ir@%7*5W{09G$_J;hD&|6|HsH4H|S4aDF_Ib9$
zF((D@bZ13+IJ>}xP_z7oRI~bqz(YhwlwD9qm0eXw)|LM&-ma^s_pZ^)&)up=zLC~P
z!jEMHl%_Ym0nd-fJvhlEw*=4)Hw3Vbw;VYU>*VzdY5rDjb@Z~<$bp9yJwa}*y3?GW
zgVu>9r`-e8+&Zg8v#32nnuU4Q7xUgk7mEnU(&uDQX%EO?7H+bjJCDiWkZu+H_a93r
zQ@m2eXT1w4%d-k7^WHR-gm^`ipz310GE2j}d`errV$6fRO3a(Q0!B)7N*+Z!#hKMQ
z)tTY!J9vZ|lsknR_&TK<L^{P9WIELxg*$~D#X6-NMLM-^gI+aaX1vK@A2akJUTABg
zy+Eqkog(GA8&oW_=O}5%NWmGmQ2m*Yy<4&`QCp%fa#JO|q>r~`eZ!A&TktPtmvApw
zwgIo{O=8~K&%)kvT*aL~@MqqrwdZxvy{B~0-sW{s2#&pxvktu#f{v|A!j8|2B@Vq+
zSf}0!tSa9$*2Laq*96`~*EHS)x#d4L$nl$}^%W0_mb-=amF$c8x|QY2XT=NNei5s9
zRhuq87gfI{rjSG-39!&FfR;k0kiRZOEhwQ7vfvPXV78X9O|6t~GybJ03Q(jh$09_V
zYRdnXDkm>CHYiUqCRtK%921}YpkA8I{zGXtJ(|*NTr`1sp@1@Vqo6c3NS=Ajo<fdF
ze6Hc40DBo$UdvLeq@>YDQD;TeJlm3xdDf|KC8J<q8DAd2QKF*8c7Y4I&xE29Y467E
zd-2mM>rX9Q0Qf-ZX#=ZW8)TRgOIKH1d(bqy)GnGSeHj$ZOK+hfXzK`+t4%otYCg_7
zE4lol@*{r^GfLS|%29_^ln610DNcl)`zA-jTw1`_P=6(OCF~1nv_SDD{XT<*lU(g8
zc+~F>!I9+z=6)LLijsjxx>O^|CHCc!aB*-^<{9l(%o56k%M#L-z`0Q4$R{T-x~E-F
z&h>b%1vZkUWYiZm-(6%H@jSSeBIOUsed2JhZ3H%BegVmKCDbH80D`tgqB+pyNQHiu
z>=uB9TqzVr%QQl}K9A&EDjN}1r_6q9T1^b;GT~86R43)99nI$oMfNrF_41lyj44VC
zp~NuC6$cUWA(O}bvVQeNh8g)y_YhtR!|vAaOR40}AmW-^e8->(Pe5D?@v@n4i=l9<
zvd{1B7%WxnM>)bcQZ=k5WLX-TiffI9B`X)G&jf)0XnoZ)((jqpe5=krCcr`o(RvG&
zg;ciLX)Q{y@xA)-EbU4V;x8IODXT0<L!ps#Pr>_hpL_zq$S*wJ#;4|QCb{H)D76%H
zDeIQf8h^j2%Fhy6!KW5?Dz+5nDA%IqhU;W`Xsd~<5>?B?`pfP+YvhQ?j&`s`@Q{?~
z4(Sg&1Nml*>9*;_ctI<EB38l}oVbyH0hDjeFd?h{f>x50@8Y!RzxvvuT6S)@3IBFT
z)4Rs<G>1I-b_-}}IiNW{l+e)2bN<f1`yR*fOa2HtcNV68dgUvjW1wjX9BOn6fB7r|
ztk_yk@a(5h3GSTuS)38km+ZD1#M#(K0lGu(11f|-z3H!_v4Orn5Q3(rMU%gKLT8DK
z(d$fii;E$pk-(+Lm)q#n5;ho$$i;p_doPCPzr&A4!fH<9Dho9n)*{ZsBzu*IlyAtS
zjvX-|PLOvw?ZTvx`fE=NWs3h0rJgS}v{7PalGcoagJ|sMenHAXAyZO}#C0;!v`1lm
z{VxhK8bfpOuw>F{3`qhr27st~4}4rABdHnIc0wYcE}t%ieR=`xVTN#BP@kwqRbjv)
zij({@jlNf0pTJIIX;3M)lHxwi3bsFVXOUhWn~%S%M#v{vB%Ri7^sA3LB{?;L5`|hM
zoaUSVj;Fsit>={J5T8Mup}#Ltv_w|`I8i^OZsp^cI7{-<j}qstD=HX0VLpU)muVT{
zNwTuDown9wI7C+wZy8fcIJ3DeXw?K9;xDK_W*pP5?L&$qu?5`(<Cy3+!AzrA#oolH
zk#cYEZJq`|{!YYJO}%1-UH3q2|IXDKqwDmx?L=mIf{Yu13LP#?beW0a+}9s-Db{^s
zS&MZ|-ntnYpQsKXPFA0xODbW$so*n>>>JkHorl&Vq+{^E@ID|JxK<ge5NkCvwUT-q
zk6ul6xSY1Pn7$9#na@9$oTw1nNXpcR>!AAqBK0&8{i}1cntJ1D*3A5#RPa}^VE<ha
zZunghD^^3mX^#f9=Ze_OEHVr(A=9B~CY9<riM7y9V&0``-g6X-1MQ?PkVs|z716s&
zRJv+S?@+u0FmXkH0m=2h0Mmbfe;NM*+J6CRSMhg7&wm*I4)rgiinV#q^(@YUKd7Bw
zxmTO8Os^`szglI;e38nK;RLM~^A1)G!9Acnu$>?M9lm~t^#224-@&E?wbQ-7mrVBN
zKsn>rN0<cHhFNSvB07t&nUcsvI<XqWf<}m_!uuQ}$#mDl57+S;#HhbN@iiu)LmR3i
z$p#OvxczEUgf&jkA@1A5H4Yn9@IsiP*NWHNU6AzAs`m4OnfEmdd;s7K2Y#w1UUEIb
z1)FGospN8+9<<YFlKS8QzY%Kf^YFzxmKX7R84(WoanwV_iSv@y2UpH!iL)-Qs!4Le
z5B;+JCZSl#-jos)!#&p8yVypsAH1lsVQ(3DF%V&(J}B-gwkvTn43;z&vrIjwPAwP8
z!VS>Z_)Fs2zu$Z~qoeWqUZq{L?7!L3YD*1S{7H$=8Wu+$5g(nGuZ&|Qjc1K{6Ll4w
z3X+{txun{aDu|Ia`^LuagTa%NUhd{6t0cIa>rh4vJr{E{9Ir5|K>;d}k<XOp&Gje`
zA?mZVlNwP^C5e|{7NLkTd(D5Akhq;0FvF4a3|Z%{e*Iq?=3isw|JpF5bMH3H|Cl!a
zzs0lWx3>T+`0>{i`X3AF|Jpn(b4~>(Ij2ImNW)bO#lIMWyRc@z15AIKP5PQbf2tt-
zNCZFi)p7_*2>v0bKIelXbKg%q0X|c`;DEb8wgaQ!Ac#PI`o0Uua3)j;znstE4DtRH
zfz$LW(I0elE9v6{tl@X{f^t6MGAsI^1eV&&$s$-`m-Z41Abbu~7quvk$VG6JV-Vnu
z*ERiRj)|S?7C2DckOOmMY8v>6m73>_KoetV`hL~T9}o-RFilM&dRm!Ap<{F8R>5aX
zx(S%nk4}C$1vm&4A*@Xa3CK9COu})~-{`3d=m;AhOpqh^CA0OmN>cRd7Ut?f&n(i1
zn;BzvJ1}?*Ik5g<ILCAVL;GdMz<=9j!AuT;BnHgs8uPHKCL2LgT_<!8l(VuWTSAi6
z&HOf!#`XYD1RCxY>Y-kLxQ@|-FJlNd>O~-^6M~Oh+zOOgv<n;tBJ`p*c5Es%mgr%x
zEYoM4nkM%nGJ=gou=lEsdo}0%*q7<EGK^G*#u+@iD;cQ`6yQgfqyo`S?gJA}AbOKd
z<a*8T!Z)ezV)ba;H>x8&jTgIy5pbI6!5)EQnpnNcm2G;QDht(q7P^bW%&aF{99SLu
zZkSH?FYvrJ=U8`k#PCq;Nt<6;=P!s^`)&NwBAUBw!Zobfx-A*gx9+gVZK2@zo3{hu
zR%HUiRuOth&KfsO&X9VI&T2L}su)&(8^Cv72_djP)FvmugZ>l-a(ck^a(AR{B6SpP
z%5-#Y(!F~2ZnPP?3~3-lxkhcm@Gb{u;Sz6k($_vy5)WE;ts2K)iiE?yHp%_2!e)L(
z$V==rfZry-=`{*x;4h>X9<CoSRjX$ZR$f+>Rqn?mD>DdBV(#}CRaKo|P!*itP?bzH
zq$Y_AFEDa4@CAm~gadPH%7LXdZNSD$siltwMoSz9XiK00^V;?S!6iBH%m8++#(;Wl
z>i~xxJxg@mK%iYhO$=9OO-);LO-Nf)O-fsNO><l9C5<bJfrTrlfrcxq0p|l}@;Mgg
zP{n|>T~JM(M_Wy+M{G@yM_^5nM@&tUM?ejTtAA0YV`@>RV~tJLtB+08YyD5=bE<9i
zGvXe>Kn`qyZ4*CJM^!L@lmZsVF*H`VJ-1d)ewGOv^)`Z32#}{XwQQ<#!_0vy5J4L-
zexSTa&n;Y~UpiHltcP2mYK~i`s)t)7%HUPLXpCF6Xq2A4Xp)}KrvEHxJHn=9JHsY*
zS!5fy)ofcRua}-Pi)lg;hRv&zNI$Nm44_q<r>B*lXZ6bQ7;RErnraeU8f%hVT4>T_
zA8HaeW2{tmi=Y^>9jHpk()TjfEYmd7tdeA~QuH!eEnPKQEnKx;t>iL#7IvNbQ*l*l
z8+66GExmg_!2QwsnGYIphN2(-6p))-5CIjyG0@BJxs9BYap^xf<syHe$3@a+!9^2J
zpNZ@+VDH=SqHTla{f!jI8=Z$$8yOv^3bu@40jmnmJ)#pDDx5XodVsTsWLs-9@G|qF
z>rd;&qKi&IxOXw?0Iw4EHn9@&wt*7+wt^D#Hb99ROiC*22w*79B$Z|c=gYQR%a^Q@
z$}x}U%Xyklm+}m1n!>77unLv3q~t2OOEHvwD)cS2FI1hID0G?QRv?_yDP$E)DG4S|
z4GsAs)!)x5NzxBnD6h|~;Jdh}C=4{CBy(a;z;I8a4DOXe>;Iu(G-X*z6v?QB!plq&
znw4T6EFsC<PbbyTPgBUT<y`2trKjL|>0grLGB+#QW@b*r!^n)5m8xFceUr#BJ*%!Y
zJ*%9ddz5XZf0S!wbyRw0cvN_%cT{<1c~pXLc2vfa`dDIF=sas6`7);<`DylAQebvP
zQedt~vUe6ks&_6)ig?yp>b#5~jb~CYP1t-(lE6GPHI@lYl0%9nPJ3p`aMFQAjd@Ly
zW$b6176806*=B8L=0TceTs~ZtVkkcEVTE0wW{zE<W{q9NZk(FUZjoBtY?_+?Fm@BN
zM>k_Q2ADymF?m$Pu}UqC07%U!GmlNPFw)GjFnd;7TBYV$8l;w;hJxIa_bi@L(F^t$
z;2$RT7oJ=7*WYj+n6Z>6Bqpjt5Id?zcsd6z&K-!~3}zzeqwf!eF^6s)i20w(q*#ei
zN7&YaW!at%h5cC>TYH7HEn8x`PG1KLaTqE-58R;H6rxV1b_B*0GJj8*_Zh3l7fxfz
z_9~1pjWz>dTP^$YFnRiU6k1Pxo<U?<t4E<>^^EFZI^|oDe3}9k3LGRK(zjS~_<Awp
znXt{62^(?rno60Zu+6X+#vgJiEI6bb>b3M7NUC6k9b#|OYncqBTG1;=b<#^ndDBx#
zIwvO-wn~N`;@4qWTLacioRVKXq-G*8?K7<e$;AtCkVEAFUqknCn}>Vf&nE=zq{0Yd
z^;mjum%ME`5Eq(sC94H9+JCj!%c)j_+y&beTPgoUse>K^n;+=T|5T|%Z%HH8ZDJ?*
zGxngD-uyw5X|M}u&!?&%8Gx|Is$17g4g_EX5sX>)FxZ>1SxNr_>@nJ4S?d6j{L=Pd
zt9aIe4++w&`eIw-gQs(H_Wiv{Z@@NHvEO2%@o}VOLPSNQ5Q>Tff8-Aa&d3ven>Oe@
zq(Fu_tl6xO5B9%Vv{4rq<aYzIagz`ca<imo{!5eimsa?HX=eY@ZvLgYz0>d&h%jj}
zW+GIzX^4rGx_|&8?Kp;A2I4JdvADtT;DsMj>x}OrdRK6;i`4WE%{u@S2l@+0;{VlU
z`Va6g<6j{2FN4~3^qtZ3AI85!{mZCgCidObCL|^@oTV~kK0>R-zJ*l_cMB*NexFL_
zX%mLYRYlJgzt1$^VTL0##wfP{>i<Ax?~v>4Q|%x4`<C}_ZDdEU1z93g_Rfd`d6%(u
zX7|(CP1@3Wfuy;(U;vm*1*{=1SimL8N~AbG<3QXbSZbJpD960-5Nz%$5mbEh_ez##
zy?O&33WMi-7#2Q^YoZwLsb@1SKu&2w)$h4|)w6=0+7p)TTg4PlOZ%y0uTX4h1vxf0
zmXp!^<%S95|GKA4zqpFcLl1%&UWE`&<LoiKUZEdd#X{GkWpxfX-8;L;XePsDxDVLg
z^RnrGMtnBM|9~|1X|wr3E1#h=C>JasD|aocxXgvC#2WR}af~1v1SXb)vj28uF`vU{
z40AXJX~>W^iCKpwMXxahtV5uo=bSXJL#Y6?PD$56oiaa7Qq&P>(MR!vz<E=i*COx+
z_@ftlm*G8JAtB7(J@HI3dX&k$M%XDu3{qo&<ng^FN!IIqNu6t4<78LbJivrO`rZTB
z<@%#>s4FsH^!ZC&Ut6-8k#<ixGo3+WauQ%8MTKE-tSm)h4|NaYdI5Z%?47nyo9oJ5
z#%yf}mj<d88e3Up+&cy4KHxM~K4>)7xI(Rrw8dFkulFL-zjbw3uMc96J*i<B*FJpb
zobgD`u;l5fWXjT2Nt3C?0T(T1?9H6;Tw~pdT(jTBKXAEsKcl!$JOiHkJOZ}IRM-)W
z;~zLwmY?BN<~`!dEIWGV02{lhspqzM;7<EB@O?AS9&Z!h9&fYWo=AG{b25&B*NCUS
z*MMgr`^3jpb+}&3YMWL3Fy9puIXe-WkIqxMTa{{pXRKj?t=3a^NHj5RrXgF`8dsOr
zs#n)A$!OFJ9tINB8{lsf&NZl;ts0?MFVy{iHWRnn#^rrkHN-DzCCqr1<Ri26C?@FY
z6@RO!Q(hg@gH$Q6gJ_f<@)8AKYYWi5$K=yGjY@iX>t_>u3Nj^)&AuyWV2=>dNEwmP
zj2R|S(-<~T(-=iCXsEBp-Zs|9+}72{MbtaQ9#UJ6mM4za$|cg)UM5!7QY4<$PEd0j
zUQ>G-T2Ol$t<ang-Kjo~di8OcVUf3*xvDs=Fsj~x88suRiFd?DpRP<tp|03QMP212
zV!66=<5a3KcO$4tU2(#M*8BDUuHYKhjE<ofts2{o4yrw0!6X_!FpZKwd>l1>U>wDK
zFdtQYa2sWNP#zV0&>Q{npf+mwfHsQyKm&eCEP-t{YT>U2E27qWR0e~<a;PA%l43nr
zK@kL2nQfp}WU8T-udk(6x@n|VfNw09^)OW{sn%_wE<;tI)}bg=>rkeC&w{3|1Im^+
z0u_NZK>3qupz^csQYjm7sgO<YLHaVxC}_*aC~2!?*S!E-D?y=tN4`;gqJ&;|qM}@b
zt4ylyr8wV!E7w?$tJDa>RdA|Fm%VFDe}BM3x)L_^e!SJ_mtB#>u#w?p05va#iaITo
zibf@6XU%i&s@{WA^Maj%YtL2MRoiajRqbx%mCC5ruGZ)$pN3~bQ)+LR2O4iUYu&_p
zu5adQnb3|j6aFm9!lu?n0anV=n5Me{ddevmIZA}d<>K9XN^o)I*m{Y~lB$LX7#)3@
z1`()ts(AsP^UpnM7UeeG*kqb@18|)ha4<*}0Rj8-M3gBF#p3meifE0A@(DGh#igpF
z#Yeg<wTTLjH60~KRu#qA`W2<vRuz?Y>K4U3we#{)jq}Q5J?YjJW$G3cRm-}T#mfek
zrOPIkg&YQ!l`V#rB`pS)1&_VU>O19@g5Ar~)Vh{*=(SF$qZ*tcO63{-f%CNb_7<!)
zbq%eHGs_CN=BFf)^>@e_^BuVxkCALk%R1?Lc;sGsct0wuJIJhR5z#wq5Ydp-gF*(&
ziTg(9@B4MiiTgV%2tuPO+%8k*iV;Dnv;7t5jud5DYkfy@tRT0!jB*}Fq%xhg6%KLk
zX%1z}`bdS9a)Po!)xokNRkGrJHC`p_25F_NdT9lnYH5`>U`9@dK}Ly};fo}SQAR;X
z!}vUEjaQ}X42Ouq42Q~0H;2x3qhn2BnPZ6YFUJz&V#gF?f5(6UBdrQ7qZje(8fGED
z%wvObjAO)}#WCp^;j!@;%rW{H*0J)K<1x$F`TS{W(7ZL%M8$@=(6RIK^E}=%>^%2!
z%Y5%L<b3<G@Vw_T`uxjsq)ThvZFXbO?VxuN&I2nR(fLe7@|#r9A03IH-)~5VUp>xd
z2*2qt;N?ET9e!ojjzyFM)KO_3qs<VOz9AI~sLFgY;6_Tn{b*W&p_hOAO>{o1+qfM*
zuR=wZ_gIN($PEtxwEmMo-CKa?n1-p_4N3~ME;L%vnMYTFG|6(jaiDQ*-~fL7tOeo`
z=v@BVyW}El6vv>RmL5_^ku1+bqOeeC<hIy@nL(3Yvq*#)L=%f;5vE_boSRb6NCbw}
zpst%nAIx9eN*Qx;PphD>>s7vCE)Y<)i$Ro2D-@W8@mDz7!>u2d;1FzopU&{UPiM?H
z1pVIhIs7Z&=^J6c8kIrUG>XeEDr1c-mHu?pP%_mogBSxc=lE5iJ2cD%o;AABug*h1
zHxAH`&wnOePVE6|095rY5OIJNdUX{vz`BMY0!!}S$)}cVR>$xrK&{`5>mA0&kgS&6
zI^1|Ysp=0`@=alcwkf@8<EH&&lrv><%3BzJg35*0;D^koKFnNBNInBTy@3%9DGxZ$
z5ADV3)tWIMqbsoN#RTOaj;dA@uymTsM*Z9DRJP|EAlpTZ+)k4k>PNzTq(~lSkISfe
zZYkeF_1XeU^xDz|0<SPD6NwhT%g7*Ow^P?Hv0cYa{kSk>8e^|rqP`v;Q!wym7r{A<
zmk+Ha4>Vzgr5TEs&(p4vR4+^v8}|`*4X3V<G|q>v(2nP-s9$#*&Nt*gE|=+T*G>cO
zof5TcuYmh!X=Mja?P<3WQ)JFCp}R>te|%n{Xu!71tfG-c*c}-hVpm5<F{mD4WEiQ(
zEN5Koib<l^+4R~ZejcLjzePqsbfWP(%diQ&qCOG|cFU8C&zs^Jc`zm0rFHPRBI^Cd
zhzp3l5-{f2g*T?z<=FeWtGCBGqCqV)G_p7y4+A6~894bq;=B|^K3Gekh)A@cO-&FJ
z7CjUowoCNG4*6R%bcm+EAgv@N2H{_^km%08;=AdBQVE6s!u&)So9a%iyV_2?2~_mn
zGqMLhICl_DdIZqvmS2Z}=f2Z-_`!|c*$oIj&@1%8jqONZfCRsVd0>`T945yKgLqgz
zwOIhRgx6uE(-3%S*>!8jV00E&t7rEDA{wWv`&rN%S9k)?fhc-OrzndCX&+52vwAF7
zn3_z|d<0kaMJ>|&^eye><W{&8dm2B?RnrLHT1v<&tjNz!HNxLE(uni|b#kT}QJFUG
znAOcS{FImHbEO&`O_MCSTTEAeRW7mQZUECJ1y+o?1ebdHRvH1;i%yLFz}95g#`6@x
z6|2I+Q>em*(+@MlPSJ-}oPBK;oL~>rrx@F1X+{9BDA}=b2CTP&wU>BGO;wj+FxPku
zY&!j@G2|2@Rjs9uv*M+%vE*gEvP@gYZK<;8Y^kz@+-Olg?v&xUWL0fo*;x%|>AZ-#
zqI06Y!tK<4>g-f@%F~KtectfWjbHmB#aSOkxXEs%?4Ja#@W)9b`|3AKcOUghAg?|K
zd7`MG6hmduDA@w$JUAq*JFgIPD+g`JDUf8P6My+FHHh??fQyOn9)EeI>LAC_t6Sjs
z>Kjsp#ok%r3YD8_#v2qj6X$xZeb<uf<gyX{G%eI{<>xf5UsFzKM<y6k-&-LOKo(O$
zccMFWA~`U39;Pkayy{j_d^*bpQ!MU!Hx=#V9L98kl`9h2I;RC#<JysOOQQhwr!>j*
z_Kyl9+A$>-GKOx8WdII$gaQ4kVYZWo<eIx>u%bJjaY_4^x}No5H8X2){$d(^+T|UK
zJHR-oeb?e@@}&7<vPA)@LPU3H`uf(zw4HH9>wI<nq5xk#>n%6P`21HzDV*R^D}Q-A
z4r-%wklh`=?Akg?>f#eWz@7I%*Bh#3`ANX}={u$s!AGwrSxgfGNR-oFy++T^)HR(*
zI42y7z$D$YHE7=DH5;&1z_t@kdd<q_-}{Yok5uda95<85vfbvK?`VL<RflHN<o#R{
z9Fl!L^h>R2guK7=$ApbH5`$HUs*WoV{RNuJEBY|(x=mK)^J(6XIq$60L7tHpo21zC
zn+S<$T#=BdyuLxXt!?si;>@oU(LX_-_O=M?04uybdyMF;{M$c`36R8}P~QvQ@<Ti+
z0y$=~i#;J{t0w{<?<Q&<z}<xa47a8I?ypb!Ko*JWCF*|TI{36PJ0J^{Zh|LCd5t&B
z#<EJc*OU35rB~+F2J675yM~J(Pdu*1Dv>r%fczpWQG=(1&8h1p36<L*y63Rl`gnb!
zp;0vnd#FY%(}LL~9MT^+8o?#@uNVZ%28cUhNEY-^JqH&7;R1<;tau38HgD?)i$m`0
z^Sl#tV$Q{oor}|Lle+N3&E3KM++H-#zc|S=s-x|Yf!RMgd4CDLAAWL21;p>%`={yA
z?Lx2#Vpad5T~vU0k_JNX{!I5IK&?Fw`uqf8s>cgmaS~)JMc@Z<w|$ZM^7-JDtlNzD
zi@_;|Zp;gj)pxIMgg&E1{Z3ztC(4ul6{wSi&EOXm^)lORw~w|56!HC@0xoh&l8tLV
zR1M#jvM#a}0s`CtOvb&WBRe5i7`e<JDlU<xa)8yb=D)MlyS-Hq25g6rE>Y5KL$3N|
zqsY7$qGLL#Mu#`(aB$3K280cvk!f@SExQm80cnHVS%^0&pB6DqRk8D-1?o&yeH|l?
zVspgnfqC@d{S#*IB}|#+{WsNI-b(h#FWGnHCwvBd>_-ZriEC|M6fBR}c#1rh*<0%#
z{{%6WhW`AhnE?+eU9~|i<icBaSS4V<?eVB^$G2zYU??pkwj6h<=OhDZ$@{>>ymdLm
zBAhv|KjJq572@pqMK1db97@RX2J930eXl(~7kLT48k$tjGpc3IYN)4WkHi7tE-`6%
zrbwj%cGBl&X|wm`53>9P!XN+N)@?|X@-4m~h4F^NXWtT~EhG!Hae3`T0BS<A344OF
zvVH66?G*W{=M8^)I*}dsi8l!my@k`|U|061PSA%JJZ#JzXus}A=xPoky*6TOQueD}
za}nwj=e}+<5xLKi`o+J9A(R~B`6}=dWI08QW@qHS+&U`?`Qe5P?Q|`3n&*9q3^Xmv
zLtZ{K4ZmYc&EAeIJc!N1a@#Q-_h;u|h>2v8tk0uCIW`@P?^-Fq!%M!31RVm_zUpTR
zxXT(kiHaGFUH5&WK~2kghH1*MH9rY_MVL|pt)JEB{3LFZi43d4z29P^4~hKb2;n|$
zVj`1*bC-MB2LRW&4!%Xe;mKcwXb$!I4&oVNh7h2ic*XXP8hWW-u*r`+f55c+%GTS(
z?1-CE>0YftZ@fVBRfUc%Qc%tTw>i!ZL$j#Or-x$rTw>aGM_T;Ko&U;R5;Y)HE>W=H
z@by;;sQ~f^5jtJm^Pll~ynP&yKlKKGlJ8@Fp2HK!E;Jx#vW52}jNGILUqUqDx?OPm
zNd8UV^&XC9%m%LR(F@W-q+^jGz;*hw*+z_I#U|WM5Xo=>GQj0>3J)@g3?W}-KoMdu
z%r+e?D$X{bqznW}a1`d%MottDCj{DXG<v`$*zkTsqo>-^2nI_)rexOB8d0tXwW8kq
za-aaVW0a5j|Gd+WnAtHWsl4jXCe)zXi=ExdhL|Mfo#Um&e0ILowQmFn(RVJsVu)KF
zE9XNemJ>DSH#8V;eEOLjC6vES4w9>`=^`89&rc8;^}7oh9D%Us!O+i%F?%m7usL3f
z@#L>qfF@{WR65;Fo9l_r;M3=jfk!v9l#(%Csd=3K=rY8}g@1|jg;jtPvQiR0X`aCb
ziz5)4E1N!NW|0(p0kdoPC)N(_8%zu~LJ_V{EQLtULp<Chj2kZd8_RrBx{T;J*^m8=
zLWNtTq96MxvDYxe5B^0{QX?w|wA^$T{+52Qe_%9zWmUibB0D~$7_g(-l=sOjC&`Y~
zz*4d)3owho&N_M^AmCcqic}+mBTwm<YT%UF-wR?!u2uKfKy^6d{vyDI+HBhXnr@F9
z7#5j#(PjIs1g}Ugc^f{|K3%9EZ(kN`@QdP-EwYmRv;Q(@WiE1LnrZwt{u#WN2o>J_
zl=<MN`r%8AGfey(Yh0O0#6f^VPsz`s40w)X!zmeQ#I?Q^PzIyJMoGSmF<!7M<QLzu
zHwCU)0e+ySB#`GZSQriZgd+H!%irTh4FT~3;QrHkz1MFku6%{9>2Cs1zfvqa)QZPC
zlf%wk6EvS^^}rpd-D#&(Wl;*BbrM|<UsWVa_D2)LHd$bY)krc%NBV}Q%T*Hz-AJ~0
zxi|40p<m*M>9g!0P6}5)fhaC*MTPPBc}aL8zY+ZXduj_(<^R!3n?pTDNh1sGj=0&y
zM*PcO*cXiTMcjnvYldyM<A6YU-B(mc^uTZ9M6$hVACEXC_)$zK4t`T3w5P++_o+d|
zW}xZ$)P1A2R}P#Tr>ve+L%U-u>n1TlXgURcxKD5R-BHKF<uK1zUI!7&eoUB9N7zst
z+J{UXvv%PN?))Zl6;^xs#j`~Dhhn#kB?K4#Vf<)+xM9dL#u{AxhiM%s45a!e=+@Cm
z411@Pn<fWU2UXReW_q6!ST6`Xe7s16P?n<Q{%BOZ@!xtP4lavd+a!dY+MmmEpjj9g
zIT*K91Y&Y@5c&&+Jcc>QyQ_?er#n&u)>ZR6ZW8KQifrs$mT9JGGw;MXh)9WUi5D;G
zqjdF@gx3U6@xI~-qajGB+$30!n>4w0Os4IxNN@OC=$tk57rI*NG3c%2H5iIfHVRfd
z>VEQMF%LuVf|g0D61P;c$@rpyR<5XA<tfs>tgm=fAK))+@??bpVmDxHwe`>!4Axxy
zcCfFmS{-~4{5!Zo`yiOPJ>rqveFMeN$il1|-N3%{JDOISh*qUXIH_=r9HxkNLY8Yk
z<I|rx^nBPvwGC7~5A<WI-CRv<LoHeqyDKBHVM*{yt)hb-sUv)p%@njxuFokus#IY>
z3TgXtkK*Cojo3UKKx+J@N8TqjB8Cu^SpE{=EWFIfuv|YbigOZvHMldFAxEJKweTBu
zKA+q?99w^!Z{z!wc^)eDw#Dy47xod6;H$iM2lFIdd?#ZsObRksal{O~5N~l&jUFci
zG#a5i(HwC-d7lGm!v8<Y-Z41S;OQIPjh&61Y?6&Owr$?AZQI<~wr$(CZQD-nI63*h
z&vRaVI;ZODX-!{KH6LcGW_tQZs1jo#y&AMG(3;pT<K~Y6?Z&JVxs^RK3o$Nu&{JUl
z3z;1%6gNc?L4XL7Fcvg^j9={F_n-fm=}K_}g#MRV)!#;VHONNvFgKGb|0nI0p~jv}
z6WW#Gc3-BY#l~n;Z>FWjH}i)w@d$Bt{s%G@)zW_n7MNiph-896et3akl);^oUe5~W
z2=vvP>e6)tf)?N7-EczokWKm0ZL(t~aR&Er9Mi2_;YM+8>DkV_@Vp=3LaStm-}IRM
z>&_5yJz^r9G825sbXHtA6*9`CQJg;IhtK3$=w*lKyu=NDW#<*~&)lDVn+hE{%Lv$*
z0?eWwD>4nU<5Am9@ug>G=UPpzp5!?2yw0{l;W^NVkY!5FR!<q7lsbTePSK{a9WP7i
z9b*?&I8ZCBwnmj6ZS*wQTI;Q`H#1~ruBUuXT~0t9vwpv$=4PC1O;_80_f@;z7{9Q+
zG61qaF+yfSrczE3Q`zGiF;C4~Hr&JEoO6vQIcFJ^vrX4qWhAcvr^+qKj+vXP?>XM8
z?jbk_UMMXbwv0QcI4>}dwVccD@j0hoINQfwSlhQ>Lbwk+C$gM)^k_M=>y|U7SIKCS
zC{OlU=4gD&cjWCBHHnr-3Xj%Wm^O4(*jOhLqdm40v+G-6Y^_z`jvWT==d}V`*{fJv
zgsX@&!^+8<7nLH`k0o}#p#g1OG>uw$H4j~fl(JOXw+<v*%kCC6ou09)gu0T-IktNO
zFF|aY?H2bq+s@*A5%2gqk7wZfw9Ohx+7{&51B7@KmYT%2CxtuK4h6P$VmClNSHISU
zpF>Vo8U}7!il5`iIb^6laoc06D@@hV1#dWR%{?>y+&U4|%+3m7rC;W8<N91@_=1L}
z?NB&Le$BrytwXQ~r?f>y$?PrhA6g13InBL=w%HXVhlmr%FNPzQi})$DbSe#ke_^$A
zVa_64suzPBrhX!;8G|9DrW*MCf(rBu600b6O06rs^j?Ll{w?&|EOy!M7S$g;fqGYR
zOzDRB5NU%#vzYKX@8;K+bQJNQVWhZys8PFs<z2v7@J$NCj(-H1gKDd~-^L=0VpVg_
zzj9_&helt9swUadMTE1~H9<)gQP=TB=(d)vAnmHDo2+u!2wSH>M9odY(M3?Hsw`c*
z#~`~Z7u~vYUMUCoe}PrLHDk=EORYh@q|3G|m)Ji=HHmjK&IMcc>Ux}#@vU3_v>Y<@
zWV^oQj)P5WDxW2zg4L>q7R!PVir{NM5Te3QbDSk)pgWBPM+OOH^1wXunbJ=Ss14XM
zJlBWPDn4Fh#M6NaW+qbf9j{g$gbwpNFhnCVcH)TPDS{L8QZo#4o+cg{r^m6;O7gmS
zU!gEjCcNSADFlG02L^5~!-f+D(k?-Vk5{53RiGqQp(M>FmmQ7|-QWZswgU4&YjfyA
z{CrP9H5L4Oq)&aPDUN%T#w<bz2fFMi#^y}fHUU%jyU4$fk>c*5M%@AqxTM_i3E8Jb
zlPwB{i3uc%h64}0TRM7LJbPN-e>;%)&oRRYEsOp-Oapt-%GM3fj-d92NpO)4gs4iL
z*?7ciu$%P5uUe%WY5c)e6-YPy2tMIL9Ym`oS))W77+G~#v)u?&)v8Rq)QA9G^+-O^
z_;awGC2y`ux}?s6QNq!R|59sRmSEY%w8jDw`)Vzk$JQ&F$MI4`WEuZpXq{(Sn`y}D
zpSrik_s)7)|2Psp48FD>lG3tQnB~vGjQ8ikXQV0?FY%~a1^)HirW?Yi(}m{aF|m4D
zhc*lLThab_+^asTu6~F77QRe;I$f1N-A8?TbaY}>e7uaBJ~^y)y5Gq@9+lYN&dcx5
zs(pmtAM2}CjVavjmOYB0biVRGU(+_8&n@mRs^jx~ZL}A4bdtYAy_P;-gH$x3)TLF#
zNfF*uzDoMF8Bc1K;W#ds{SiDSbN+v*(q}bfb8jf@YY=$ACjQ_~s~J5T9LJUQ|Iex<
z9#Cj3?Oh|m>IJBn^(%PO3HNE4%+|*X`DwZMn_)jKoA8};z#>&S{JP|b7A?d0z2t-h
z(@MjSv^*_4=7jdNyPT7Lj)8gdiWbyr?Kk^~!=}~TbKM4--E!6ExD2X#^$Pm5?bGYL
zyj=r%pL34%e&FsWS~$Jqo9^4aLB-|Z5aK{7>)niu=2R}L)*N!y%3PAm3Fl-hn%}$$
zF3alzhy7hjVasKhu$&XWbyIi-)kThJSPPfhE}1WVvv7vR1%%_o8|CAqDj=%0JSYCj
z{6xit$o;IU_q%W;%5l{+sxzzZSQ`#Q;$~!u`4y=YtP5;WW;@CJ>SoyKwRbqyuJxqq
zCSI!9mCOXTi-~b(J8XUbX5#Ac)ex@ZlWtYZTg}L3@?r~Q?d+Ays_K)6rP-5iQ<w+T
z`Ve=9)%9o0<$;X;Tbt8GyEQlGfR(P5HSD>Q#wxuv4(Fnk$#E;*#oy-W&1)HB#8%N-
zlg<3q@hkcZ<|kEPs0WD340kN$W!9LIEnvT_wb&tYgRzC>Ds@Bm$<jK-gXgKs<EM!o
z?ZL*CaK?0JO8S-d)TCYY4tlGKJ;fDmYvq;F2G5iFRgeds%W!AbTYsmo$p(&FqX&x4
zT4yG}@%qT3t^3fTy?Y<0&E>{s_p<3q%aiOW%LfnmmDaCKrxEPsnAYEg8I3)XUa4e>
zw=rf7*RUp7=QPB46uCq5o5HX|sEgf{1JYf$Ar)oh-36TStJ5Kee)ojkcjC*gcj9aG
zn-agt>6-+<$-n_b2Trq)f;?PL-cz*?7ZZg**&4xhzrSqarw3PSF+ESkA(!k>aA)JM
zpuzZc#IRzQYZQRZ7IW5CyBAld)3~equ?Qw3Xtp*Lw5NM5!_DbnTTd}YFi5sG?zh2?
z>f5l$Co@qQlaYe))+OyL)^~*KQ5I8hViG?81QDm!WSBhBH+<8QF8>2`aF$6klVnC#
zfC<j!$Gj=Bq@7UR^N6=pTedCstDilEx{MFO9rC;vCgzi!Y#ZR;nin!m8-O4BiJknA
z2QhIIBPZyMh{;aJ@8v36H}?&O%2`KPX=7QI`H8k9@D1JkxGR#Q^?HZ&kp}yyD>!|g
zH@5$S)mok)mjWL_+JRSaesg-(5;2GN1}Kl{-}P{_VDuMS4^UGw-4irI9F?LUy~~Yy
zJC|`nZ+7HCW!fdV%E6$Y?r1;n)VI`TH(rv?$Yf}W8~zolg}0DVjlqyWC=xDxW&mfY
zFp9ZSlJQfLMXv$Q6WjmN+_a|(66~_oWG0If{PLwThg*R&8>``-gr8IAn>q1w@}f4}
z6VtA+Gnc#HE>vK5=_;>-AewaIPKFiC6+x|o2D6S_-3-nk6Ff@qlpxmgl%Zm|d*RR>
zU)!@B|J%KCZQTv)(f#s4j>J*StB7cmcNRpKpu`4<MQiZwgC&xG@2CfC0`|DOf0&Z(
zf2s?8ti_C^h{8vZ!Lb3@0^EplGRSy4PAPsga?#gJEBr!m-P?&fhHtr|0Ab}8-n9YH
z54eXBR~EyK9aDtExR2$^XWf<56@!!=mHM5zmgPZYnU_S8AvxVI@OyDP&HeyzGtDUw
zsBufrxB@JgM(5$Y_ROM++|+YgT|In@(bV_M1S31aOwE#ksAa?tm|KI+Rqjy2sd>T#
zM#-0Na%Gjt<nR(DQKFyQ9RrspC`y)jBV=WQRGKK2z0{2YaAu{Avun03tSVi9HY<xs
z$*NI2mH+Dh<Qc9I0*ybw;fk3}tvMvDy1i(Ha}q^6mEj+3H6_9ug){(Pam&pvntd_o
zKQNnu7w>;fxPr~XMZ-fwz$sCw)`k<Qd!%<GrDK&t#J%=9F1&JPN>8EX&`IGE)FmWP
ze}7jlyVs<biap~#?*DYQ)jm3Da7*RKz!TSc7dzXV_vrEzSs-Vj=iuO=+D|B%#kxv$
z9zRJrSr|>upCi?oB2-2mjq{T;Z1Geyttil6iztz!mn*HO5G|T4%J6^om5tzfla(5z
zQwvg+>Ye$f%kb2v5WIr-=yiU}lJ5jq(Tm?S3kZ9kcAO!IjsDL*eFz6w7df&ec&KA?
z@3u*pd_!}gBeow*jQPH`Jyb)xX7!ki03A#B8j8UVUHg@|B148&CP@Za&_7A2Nc!Tm
zv`HC~+?z3`wcSYS7lvK?5xsKm;~QY2I?5<vaA<OW8i>N)LD2}OWs!shDf3Q%gJRjW
zL}IysDOE(QF)l9Equo}Td(9O6A!KrNb&x^R)ZigA2e~75j4&d>TvSBrggy2oH%!Se
z5`zv-uKvUMyuMxf-F1uELAJbpkYw6g?qYHW)itI0s$ruR?a`U@#EmZ1E=F}h&acr^
zP>{KoaTLMVPpsaqZqu4;+BhCrC^&rE?P%>9@QtHrpIP)92kf^#!PKpTaY6k|LTPWq
z8B-#M&4c5-7x?j&&m<TtA4$3L&>UrySdH@0R=bfEmIMSV9EoF7W_DgkERBPJnc?4r
z!|1#w>4@Vif0Ch@Um04&@r5dWANs7rj0LIluYLufCBQcN*?+a5B_KBX-F@qZ7l>PM
zjee|OzD2Z?Bc=*Ugbk%-{~|Az!Y2`$3P8T5o%qoNB|G<g@?gtQ)e#dvecfYBN`l97
zA7!yz-uxMs1l3c65k>{ZxTsW*^!_t{s^9Zhf~*drWSVMWmTKXk@!u1u2v40*#ts}`
zoA|I-=LKwSE|rN?7sG2-t0OQ*D@u7>mq*T8M=S3mq^E<W@-X&2L3u3$vZH%EI5aKP
zI{P+W%<CPXdz+)4<O8(SjD`b(H`1Bz(2jl68XjRopjsNtV)U#{HNycBaO{xHg}sOk
zHz;BVSFseiL7rKUUPs@R?I8UWJ?s@hbu`dgWCu}qgDp`UfX3dHnf@g+jDj6BN=sg;
zMw<jNk9^jKXt%eJ4!m-z-gj3D<QfQrBl$|RMD22H1p$K-J-8D@3Q%vhWm*UCL|XXy
zP>taP_3npX1a;xWspGGvSr>b%P0n^)<;j<&PrR{@W;pTz@oF8nh#AU+!fcOw4X~+>
z(ZqWDeB^(Uf&|1?Fz<(TO%Lo$S36SPTsdUHOzNopP<JiM0uM7re+g1oc*0@y50i&R
z+AR#tO%gt$wYNz{a9pCbb6|qVM2K&EqD2V5$Vo2XhO?nt@u$<-Fx0|X_opaFB+?tO
z7SOHxS_QMGZjO2fyJb@jq4ip6i%yNV(krxNw@Uta|K&}}i+7(Pl>og0D5b_B#qo2~
zu8Iv`DK?{Z8O2K}KfpLV{)vh$3@+^U!ziFGv<}I*&OXx~{z!>XJp}Am8dO{ks4SXn
zqkLlzZt+@P-(9J7SS?W!z>-8=m@2zPii<c4MD|GmAP?x_D$`?b>0nM|{$T!~i#Btk
z1{O9<Hi}dRyaYNoJ7ZKu6N#ZULYWgHu~TTB5FL^f;S(xkNB%L)U-`c7Ts==<Z7~ke
zbhv^Y8}zgh=tA^Kxf4|b7f=&kjZP3fkcK*xK7=L5_=_n3UY>yT_fP`1P{}RrE<)B{
zwxkppTFE>ye6BL@u9PNJk*Bunnf(y=aXsK{>TEN?gNX#1xsb_&+-GKqbYW?Bs^DGf
zjq-4^W;Z~OxUWb~1`&}M4iT|hK#jSB(<s^&w2<Bt_HfDeujq4Oh;3g;2oymfuRhx0
z*~nZ#EOe}mTvOD03<HHd$l<`qcMd*rcku?Ecr}I_MH#i8VmmorA&)r^VP&!OL%#$W
zNhz6tJRqeZi_VN2DbAhf&tri2d1%Z63TfqkJD|k5_2&ND0Uf`DLiqniglPSb{z77B
z|81612Lu%S_mBDt9={#`_mBQ-g#W|wKO??}{%^<s9N~LtB$_aFKr2Pq7VpiOXczqE
z&l^XGp?PpNfJ%&8oA2B_o)7?W#@$^Ypcq5Q!(H$vfH&l^12mB9BRAw&i~PzB@vl3C
zpwsj((+eyZ8@C|e(R-d}E`lDmX|a^6mtRM&ak_z`kQQ9-&r8I;_|ZS3JR)qj4E)CN
zVK<&scXNkBg`!~(pIl{;qA?PCD^70nNwefiT20{2&R#GdZz4pm-AHqgvPMS^Q~ieA
zi}C>6^E1aOu-uF@?$aiw@g^*5=ih6SD|((}mhefD3BCJ{nqQVXI%9<iR{V6mU+Asp
z=pR@46#J}3DX(dcqC^wW`O*5=)4<j3`c!(?CI;haXX6MHNXDu9_|(1C!HGxDX)54_
z@scZ$PJ@e=j@K2)5X}9Sa-a1vp)~#TsOb3D{fa}1aF&5(!ZDl1ibI_AO@=<D!O~5J
zo`%O%?Ijn+N>^6)>SxyY1!NXw#X)Ot6!5)I2Do8p;^A%3-J`kNI%)m1Vbp#9K81h#
zK8pXuWoYAyU;D%jSRu<Q#=UmyE9IJQ70@0)yRFkCsm>@rLu)zGMq8dOKXP|x-r$?a
z-J+Y?jojJTBDaof{=qtkGfoX0vZL4%*f6%yvnD&zwn4h;XvTCI)$nUSr|#c;N;=N+
z*giPig7GY9CeoSF2&Fx&oKU$@-Ys`4zm@I`eb><5@N>7g7wm9)`D4Sq6?O__+2MU;
z*(>%)zme>qem>kvdWW!~^iFT4{>pF0^O;)r?LNC4*&g!T@zNlDa*l=Gvaa*n(ynv0
z(NPn&;Z?J;@liv${-O2_p}oal=hAsS8sr*0GO_h!#Bv>6H@o#`6|7nYn5sgnv6E;h
z*(tIrQZ3%JX%UZiyJmFUDYMF4E$Iw-k60~Q_3(O-$Et>Z{2`{j!l|r1#VMn`$|<+C
zz$w19#i_Qn$tk==;85dIwsDq8<Kk*EHtcacLgscnis61duHuF<#_EbO+C8{&sYS)R
zul1MrT8pOp{6nJGT>%yQ8e7==T3s0H+FjV~T0~guT3HzMnnf7)+BtCREwk@%GZ*u6
zvovLIv+#N1ty90&rCC4GC0alH333qOT6<9MnrD#W+ItZEnt#yhns5;GTCQ-zLkeq`
zJ2&D!OEIa3>YTf>;+nhM@_@Vg;^aeob@i>juKTIZzUHZI?yNIc3iw%;vC~<a5%tpg
zlypaVjdzHB&3!0yO)$2()tzY4ftaY$8J*bN2}tnK<9Xyk>GS+8^op6A0w7Izpa@Lk
z;Wynw31s1EoB^*-22e&k1j2IY6zn`6V#IlY2i$gH>J?Sz&`o1dRy+(sTX@~}xpWEi
zA$IlkL2u*qf$JdchE=EB^r&dM9#B@wzacAvdm1STdmSno(Nn%`DKbAQDK_3HDLdVh
zl)1l_l|#Ilmux*P%C&kqDeZecDrLW7mwcz%pI8*AUt8p@9at2tom&)g>{#Tt9axmN
zomy18@0{njpIOk>b;;=S=$OzCEh|agJfe=jyoNk_c?~LexeUm3ed^Ore0KTf^*&XZ
z0^!kzpM%2pJqbb_Jc$R5y8hf+WXo*$y<`HAqu(O-D6-W$b{#@ky{vC(vqe3x?#q;T
zvN`&WRWR;I$|YY#O2=P@O3t5o<XP_`Ra}75vQPKY@`$%yc`|)WFGVH8FGXc!&qd|O
z&&H+4Z^q>+FFY#MkCQ6bx74x(kJR$n_g=YOVQ%xyLLU>&QvRNlOuJo+Y2@3>Y4Tmn
zX=7bZX=`1NX{0HYo;b{%Ug^vqo*K-=UfX7lU0T@1*B;V!HqA#U+xU}G+lXncU0!L6
zT_0&qUHxeUp1kH!FHz=GZ&7AddY?y}x!~Ir)aRV}kq=rkNB3F_==WN4q|a5R=g(E<
z>2FmQ>u=Vk?FPWdk22}IkD^4+=0@*ruS?Tyg0*Q+AM@^;k4mjWkCKn6C)M`xCq<93
zX>*%b_DjZYD!7+KJv(n{RlRPOiV9w;iaK7diZot^ia=f;RZbt@nyJr}n$J%^J>vIT
zJ!PNRn$u5xz3i9pU}|78l*TzNR#UGIhh=xS=L+Fhx}M1gTAw#i1+M+98W-5iOV72T
z!`<<(Tf{Y^+t}5QAlmx9u^;CZC+O*h6_NE-BS_=DvM>I_CeY`?29IZUo5eG?+u&K*
zr}!rGv$_B2nKPK+$pyOm;2PU|e4F##w;S+G?6VEk+N~oL@Rb=7_UVhH^e#w*{2@q;
z{SqwP@PHU?dg;TPm(5GD$K6e%AD}~^cPokH-A$-pw~b!Ab{+D(b{(;D<syuG(@u==
z)`_I@o=;r$HY~L9<b!%U!ppK(`n5ko_f;?g_C*$p_7P89{#q==^5BELy2i^~*Y2Zi
z80X`CAoS%oQurAd+x`(wMEimvstu$K?bz4BPMq$h`a9H3RF>i6q=@#VBDeTKAt(K=
zBieXx6LGe;jk-AA&2ApzBbl((&1@d#Bf8-E)m0+=sU;Wwu`OEpa2=%{-OT#p6S8)-
z4Ui{kQ71oRPqB~viJ{4J%nlcLvVn)oC77P1f|=QtCFx$K=XiXP<T}~_HQ{h_uhZsG
zM4ZJh=;{A3E^5@}c~o9_m6J;0#`c7?$}dmR@1O={hLxa{)&DDG%xm^g)_%1-NjUTI
z^Lm3V{IA7Lb}56rV5?V}ta)RQRLln|3^8gdM{dINFBmX%maqYw!E8Y;QwOKp8QjH*
z<cMLPECJ?#l#smVyg&!9SxXE#>~xmHL$#P#@%bH=(QJ2m$e4~<FmM$c`h`C@6o$^H
z?zGXP$`awDaRW_!Q(4@9NYgnsmC|)FO`XGRuSl|M77!;UJhKd^m7ufY;)pa|M>_z2
zcB?dR68x;j69Dkd-^<w=Bf?oPv?lhW9`50AP39dAn}oQx52&Psw~v3<?WT;lH^3F7
zN`C8~4h1N*v)6Cle_xn%pZh&80RIUe2u^pC+?+35RG`j3`Ok3KDIct}w`xAoFXoer
zFL04po8IBi^_rfqA6>U!KSkq_GH!T-;y=l3r@m0D_AYTgk8LSabD<pyM^IS<eF61;
zJrZWK;QM*|b(y~%G}l}TefD9<Pz;B<V;F{mWn#p6wh9Q=$xj=S8%LH%Um1vlDQGE+
zvHmfLv~sJ<Q2&^Oqxao;9ib!T{^v^H9@@z(hD2k8<NSU~;-H<Bqu>)etebyRkBgqa
zVB^nH2$fv_(c@$mW=k^OI+RubrBV-TKSx1cZRCcH{^h>3XFzXli1Arq{~ni#+im<v
zEt`hRTAvOR@A)G@_O}oPY{KaHaX%H9y6Gg{itAbr)!1rHl06=7E>{?sK!Ly@g=9`p
zLZmEUOj`^<kqaOv%STI~oJCCVm^B)sJYny|Z`JXhW7&B_iu><RZ|;A||I_$if*u1L
zig0RnXzns1SFb`Y7+>8FsXCYzLnOmdb6HXgKB*-?7ItK!xcnShd!_`bDagY(SiZ#r
z%#uW0M5{Ph{_X=-T|RqyTaskI)zLydEqf5}wDF$HgD|l~P3T0ist9Zn75>h+aw3XW
z?6i!G5M@#oQIB|w9LiDV+53YcxOmO%-8dXN0eeAG7@K2&^~3-PYd*kRYvc)c%$H#t
znB4$!7IM<k0%8ZgufL}cGqB%{FVI`j{x8~r-sjcEace@uSN7#HV;lXz=<|UyRR^#!
zc?qw>;q%)0wfBBHYE}E<=vQ*kOvuv8h$?gCCtXOX2)Kffj`QHJKiHZfY(;dGzJlG1
zf9t<FaQWf|ZgKL3<-HJ8ouzKVwkNZ<?4!pJA7|`_^dW&mODGBn{edF)%ZambhzhYS
zfeQJ__KQC+j6IH?I3$JsU(UbxHuodop7ze|3(qw{^>n?bwR5pWn@3xDTX|WzuJ9CU
z&EW=YRYs}j$p$2jLs9QkhFT4$3Btv=+b@JeE(lSFqyE~A;NAHQaN8gqpY(gE_mujQ
zyW4rZT{xA-)_1@GZ$o06#AZPSQLf~RM*PVQ4|6!H#984pH#7nH9HsSfw&2;53KUMT
zSFzB-{99m03~P^9DRvU9I4V?P#VqzBHg&QI%~BE_Ml*c7om`58UWi3XnbO4I>>Fzh
zsBk%-o_gxd*9>}q|8+gOa9vS}?FHBr`?5feoo_c7hBtVlP7F4+IYH$DPg@SqDE->t
zkHnYaf)P<u4RxoLFEMnjrrqBLJ@be;Y^~O)zq82T8sumAzZ4R@SK<Q<YuQNF=$O@W
ztGBy<qPW=<9QQ#WG}`M?2fx|tkwC`23Q3j%DoWL3Uk$Nx#k}&+N&)!4nU4FI`if6}
zgeXh9<)Kjkf>5mUK!2;po)xg}8b3Z!pXb2uN;>`!qLj~CAmkED;;IyLiW7J~jPF=)
zBpM8z+cn~(6%v2g3*(>_!Z?koxd#~(QdB4uMk|mge=uD@#frQQ6gA+&)51ukv1nXq
z8nIV{M{KW2c)a^Ph2ewY87s^cf`0T5j~pmzp}iL!W-mWg(C;&h^2M~Ug66>=g^QiY
zMbjj}@!aZo<oP3b-(GXf4kx*)nBowzy~q2QD>rIE^aheT#fXNi*Y5+09)}fbW5gM`
zPD`FyfI>Qr(6;Cyt!KFq7KC<8N!TrKK4YGk0~Z`mAg^C;W|#cr7xK3#DCWp!k2NEt
z>(E-5Q*2n<1}WljWOXpHK48?HI_`~={NX&+phd?tJc-o=IduH2>l{UJbXWl<Ikmqt
z?FO=RP!Uwg-ddA69ple_zFV1L(z>w?mVL+td2F9`eD?+Z%y}$q$evEmV**=rWH}g-
zVYNbJ!r3&w8oJ8fZtFT_-9@wFAI~l`{#`579${xLV|gb2p7hmWt2dJUdao(t$qq0D
z`3y1qWY5!AZI7^fnnC>RF$LX`;t*Fk`4Uh${o;2y_7aCT!9K_{@{)#k{OmS`<;-(T
z^~QaiF<|eVz{K7yX2yP8$idz%F74o*+;*%P<9_%~v6<!|jBN&X>P#Fzgl%M2Bu7k5
zFCso3Nk6A<kkQbKNy}{_72}MJQn(x`KBs5Ee2QX__7F&~_1ded)n+;oGwT{(!MK!E
zj*T;ZI@D$#RGX!_uBv0*SDlW7GiDVb9niCf!!f2S+>U9~?4D@jrjT%7EO(Y1xInb5
z*P{A_YDyq4VSOv<8LL*QT#1eZ{3zrKkf}BvGC6y$EUZq;KvQMbLM<=iO)Pae?XEX(
z)3jfFP!T3jJt{lB{@N`YU4clcC03+&_JcDpDKWYL`9|^0^{>Twpa%wY4QbO&tl(HP
z0)1zPyy-UCeko%@`cAT8Y7P<BthvHkG9d(J4#n22yW(6hMg<8DiQ6u);YVSS^%M_r
z?!a|_F0mnbGi_<TD8*BH_SNOP_c6%f{_4tmcwc1j6t7bHU8E9fFn|?^&ge)~pXt7(
zQVj9@m%DX@_fYup@6L<j%lV!&UIMS>z>itIR!FQ|8qFe<7COEiz7dob_%3u;Y#NvX
zl-63l;V%fNgD2?!`Z^-y0x-kf?JD6g5y4OBWsX6OSq3nV`7&;QmRNiKI>S1?<G=sa
zKtJV=KlDO3)A9oX2cz$DNL1JFR<33G8FPY##t$+=a))qV-gTe_4xh1V2Xq9EKObBf
ztJ3q=s&4u$!ds-a>->qoOQbiO9$b&vzC??uCo&C=O0Uik*$%<Jc?1JbXzh@u6dex<
zgramveti356+bA+90s1z_bcQLy+kQ&6OsiH75YRexv4w@)Ti>4IFU!SaCv5Gk~*Bz
zf-ytZF+`&e=`0x<;<qvx1;4M8hB3adi>T!4{2Ae7D%^ZUd#k`bD+@Q@l`zps8Rb0V
zVvG4hEe<WSpWPCRelu~Ye%)j}plr$A)sT9PJ<K<CJ()M9J<~gWJ>e-LA*XELbC^Ng
zReXp3NmIf_m`GM|7oeCGGv<JL2wmDCY|0n`LT!rjga-4&cw=Dr%i%XpHe}^3I1eI=
zpr0M*0?XCEwxQ(QLOU{(toEFGJ61U6tK*3K9}$dQFba{?z5YYXdZD*?ss^6Pj1y1K
zsy+nTtlmEeaCifzBM5HoKIt`?@dcRhhg|oOq*(C>Uxy4<CR}mXF#)=W`{KB!?_k#~
z-cb$_+dG>3$!yclXguazfg;{k^jRXsw-qTUo)tR5Yb5rJ6ko-z=w>0MP7euIbx~RJ
zk|Hze9({c-`Eif1TTs&&Jbxa}F#r1GSfn9P#F9|)*2%I-t2PVVlao|9E(|8(*^1ND
zMOcdn(rAlwD~QxpnTGfl)r7LvVI`-fE0(s2|2Z~?dHXr=^rmDc(E<&G+CZ#^p(^lX
z`J8|pr1g}2AA=ka7GwH^E*+ALG3$VvjPT(n+ebSw?|@kyviSCc_DlbGN;6c|oBKCh
z;16G<xMC>r?^rrC#$?Zf(Ytdy0R&Q7X;Da{7Ijiu;lc>yL?|ZeFT{sVEIMF|t~))?
z6wlV=#jVi{vGT43Gd7`(2|rmj)%IiUy+)#KVD3HDDKM)Nu;`#oj$b9YNP##_ZKP@I
zoT`|1?ox|#{9-^Q^IYbSY+ChCIg3UOuMcf1QOoo|`1XzhEjpGQM8GV)NVHJ2*uwd=
zOp(o}uI@fOSTV(~{KcaaLlb24rnQH*hJ>)GPYuLme}B)TjW@bE{)(*N4f@nOYR_BX
z`-+j-8a*X=eb6f~PCLaMgmDpM)e*&1x{+`w0oq+bON^O0h)DsZ#KIg#T52+<wG{k;
zzR}mWsEKZ20bwY8?LK$w=TTal@A?9sXAyqQ(gF%gntQK95sz(80=!NNL=VM0-}5LF
z6io_5Kgm3G2`l_C>O7PbYvjOdk=)9dBaSm`<S>7cINOFJYZQz0kcZUMj^#XRL+Vxk
zu(X41qZ!9hn(+=}QEE%7&T*>o?syU80BRZx#d0qD$(Yn=`9Y<^aRP|b{wGK$l&?Y?
z2%8V7h;DWl-5c(3a<yX#{YbD>8BtTYh<3+WSz@>Ap-Uk}z}z^V+n9P0M_`yVCDLDI
z&K3#+EqcCUs^k)1{p1k7+IcXU;9;=2Yi(JO0pz*sfCtW9WLs#eg#4)ns644~eiQXR
z(NXyl19gZ<>G9k|v+r~t`<(945z$a+k(3F#Swr7bQcf;I`yPX$-&FLidZnYFBJmiS
z?`sx!f<36nHjF>>&K4*`j>f_sT6w#t8+GiHhHa9=Xm7&?i&4Ge`Omq$eqR4JjwMKs
z+mnYFtV@Oa0|Q&CWt!jPCaJHLo3o&xIMOoUE)ZQx3us5v5oli|uCOSi*jCFZm5x+t
z&<K5F<rBRPS@LsM<EX;d!&A|8-}qGQ)b+ANPN;#}>zUJcMAiSU403h?$7(N2R%@MA
zB@*x)5xRNr$SlcOE_ab5#zU+E2y>*6ufCDbRbG_@|Aq^YM&lhM(q|lEu}Z3vj9x1&
zm#)QP{JW}?%4+|Qq*gntN~W|HYy1i|1T|ewrMY7zVuA7TulK7!NS$ifWQk-nl9qye
z!YNMid4HZ%br=IjUsGaq*RKn|WZyoT)q>VOv>i_0?R`gq4Bwx={1e|hLp4mtP#Q`d
z`USLa`KkuUc9J}FVVQhW&*vO2fAq;ba@Gk7vX}ZAidQ(4NFrIxf3zq+9>Q6&Kd<Ov
zza~$=^}g0Pxg25nECsPrGxc%dqj*h2o<ZTGc}>HreWH6TF}liN!+8iA4p#f3XWRuQ
zZp24vjht9BN|S)~U72}Fy1@oe;}qvU|01oLo(7DIBClTzc>l<xtNWbi&u{8Z;a$fc
zXgVxjfAG+Gff1x5^drs7u~~B<Y^TfgD9w}EZa!dPOBL57omyDxb3|53o77~UQW>Xr
z4Qoj8?ugAtyC$EKW$3+PVWfTb<eY+7Gk%0}N+sVg&l`CzKVW$4w)quHE#IbLsaB|s
z$4$spq_L+hG7s0FAE_>FSD5%uh+m*PFyL6o=((hp*Nh&OS$4H@Xc$iEQcge|(J$+k
zPcpAM9JO6oId}oHT7PotS&wuvu<932O0O6>z?PP^7Ah`pXq)R_{cdD%NvNC1EciT{
zn%g|On!|PAHLGeZW}4oRbYIxeV7Rjge=#04n?mo~VPNV&ApTuNM0lo{Sd83M?U|fa
zqVEf28Z8a7E#NlFjj0e>D?iyM23sjNy$y+d0C|z8wZjsU!|ypMMT;1V$V91eAaa)J
zn;KnV2j^7john^v{p(y6lsRAH;O_W#CVWV=BP<(N8uzC_s0y{w4QzN9xBGbHYv>*v
zS$=@;O{_KAJ73mj@73wkt@sv5RGUry5byc@Qb|I}DXuG0>2zJ5>hSr={_PA$H!bNi
z6Ic2x$*O29W(`LkUU*V5sL#0Ur(S&=;bsg$Gim;B>q$0vZbL=X4~-_-X>!5^$Pr=F
zWh$w3{UuM?8M&7@>h6!r1t6>Z`nG_T59jQsUEW82o=u6oFpg%qZK3(BgdkH(qp7VL
zW#rG@L=h49q0fc0Jtd1RWs(>XDvY1UcfQ?$4x`!6DjbpWcuHZnPk9nE5epG>e@s6-
zp|N#-LSt{UQ+F&{{xTcvRUw8aekPtZFOZ|Clb`Pr$>ms<s!XMIvnW_1XH;*fvRkE$
zbKL49eX(cF-9Rsj+mN=9;1NDOg>HA0&e!$lD$Bs9ZauY1+Aa=7JDDGN=fTS=w!j}n
z3FD{=d^J!k<f!tXNcY&Xp_X)5{9BSB@}OD%o+bIW8Ba-gT8`<6e9K8(Vp$yP&>8Q6
z@=p8SvGV?nrWM31S<{rONlpV*A@BOxzPj?&;G%oh<x)|9Ha01B!R7M1Q(>MLMm&Ca
z$F+PySAX^2Z5O<|w<-zn*D49`?Z}aNCq<2d>Wz$u8tkhA`T4|8-OQ8hsh5v<^<K5q
zD$%nn#X=8qMYqCd&E)s4&<YIl68%Mi{j&14w3fc+qtmv-<!*K1a{{t69qEPc1N$!b
z{fD#NLr*6sb{~aTX;1cT_{SAA&ikf`{$CJm^~?3f5$F)BP_u&1b$E7ZJ*QHdjE4JQ
zQ6}5a@7fZi3GxL;AR1zz;0SR7ASx2qFrI)b338YCVyF%kZ5rD^Pq7`nNU4%p(<4|<
z)%%7Xr!-Iyoy8#}^ZiC{FyMkU#&aBy(ziG-4M~JKx=mqcpd=a`Kdg=D#{5A#V74(|
z_(SOJxk<etI%aKH?mw-l*yTR?e_G-KAd>tWRH+xP@PFEX1s(zO?LV<~9$kFq1cZ(M
zd%$;BJJkO(AXq5;EssnX5S5kC-5JZ^3+s9>t9zvPJKYAn@*D6vMfBem7c%lh{_j;!
zoPso)V5WQ15xQvKw4++tbuNUnv|&NedoWYWF3_~p>wu)A(3v4mj0RSKpUhEvZn+zS
zBkMM3=fsmhlN&Z16Cil-=uI!*4Z+ho3sxufxYz6+gw4Vmtc#I0h+tB37vtVu=pJSv
z{X0vIMNc})X%hWHw@J^W9uzW#n{DM{IQQr`0xNG+{sdsh^d39IdTP+^h|I3`h2kM?
zS+A!9e>t6XxBdv@#^E0QeJmrmc#?Kk?SA|@(~b4hbSu0&<%yArK-c}=g6bQ2*TU4>
zpP9aUuq|cVK<x-o4RAkP5&Z&nZo)GJkpif>J&LzXdQkxWdvQQ#@R?Lj1=PbIF<uDY
zvs!-Fv~`|&2i->a7(qz&(bq}yG2Tx1(Mz7dC_udzE)9GEn8m!*IflQ`npM2mn8m$>
zIYz&vJ%oT4CZdy8HVaA8s_GY5C8?hN6DI34nUy@If}TT6`a3tBq<Bgzsf0zfXgC^2
zQ><n_(n!U8=$@o*Z!s=y&nju<mQ(2KSzVah(Kn~cqLwzoBdPELEy>8fJSVVaZAMJc
z)Q|{J;}}1t(mKed);jE_-ekg-Od_41Q&5<mQ<<Nc1I#bQRi5gfR*%-fEkx98<Y8H0
zm8F_u6{VWBD&5x@wG5eJRjQd_<-091$T-X}Xy4Zw`5hG;B21bjg{J9H$2Z<4c{D(b
zJ6hq5!&woJOIdl0f2?ICsjWdLL4H@dxo>pQz+alGqneqjr&^$?;VN@dOEUFODqLGk
zGFp>PI$TSpqHL(vs8~}#ZwE#U=5pKEnbWFiu60vql?X}xE^8&hTwJW<C~G#7R`ijy
zULYS|D+x^^%g1l52v@gsV=+%PQb?G;(^Txa^IVV^50{(PxXWu&YZAV!vy671zms1e
z9FHogrt-+EQU{7iCV9=$Cw<H+QA6fgXlO@X8M{%s=N#sr5GJ|g1*>mG;v2cqzRGxW
zkKXY=bS6ccS&Y&22b|YnGW<p3?j&08fv{qOB)5AO&v(7U{5%{+!|gY#e5vO31Fks1
z0#^e2S54kAIOJEORCd?xly+%>`$1o8@$z4QY(=rbo9*)sLy{365ursPx{H1X)zPuw
z>bpbnB>naid^0<FhV88fKQH?vs3u+suoZ$bu$AlTZz}wzJg^m;@^2~%Sg5WJSSVI~
zz5ZMKz$>qRN}!~FnysYp90-RRx@nZdcYzK%sHbC{bIfi0tM>yQHNY#%H;a4ocNX{R
zH}(F`@=E9D@+jfwYVYP3(z`bL#lO;yDI~pyEhL?WB_w@@lYsdJK{C|MA9`yetN)I(
zpnIXU$n4}n-j;Zt`(Q9V_eO7C4t4g0++CY&Z*Xm|;vdFe09bVcAEhQo$tH1#g}Mgl
zeRYC(5p{IaVeDG3ecf-fhiyZjy7ZaY758kmsB9FcMB0nF7`@=;QR)1fx+5u2>+<7B
zVw9b}gKuca2m~hC<Q5;|a#_D1WYxSwwI*fPG#;8*TD+juQ)Aqqj|<~kzo1+<X!e;U
zm9x#?Ax<@cOf?hn=pW9l|IM8)8)RN0*R+uyFsZC<87=FdROY@qSZ=Spb?r&}!xZlH
zyLO8AMwXxFUusI6_>_4pGIUU1QE@uIBsy~||E^v|2cH?t7n!uuS;sW5w3221-sImq
zX-@ASh9(MCkR@!ggS~%gl<iW(NYSkRx+{5V4o3d%`msm#^Fp?I`_QQ!7IhF;i$M9d
zB+NwVJvC-JzAx)*b0EPkjKTn2!5Ax>LBH-n3-TUDI>StVPfD3|3e0G4qev<vcWmIa
zS}H^Po8?JmG>r|IeH&pWQcTlE4NU!Jkt9B!V(OR-)kshc{rg}Tux|w5XKRA;2<9)g
z|3QY6U&gTP*`2kgS9YbZp0%g`-z+?M!G&JK4Wl6&`C7l}6~VatT9?HJs|ejxx*hr`
zf%>&Ec`jG$J6EgR(Uh@J@SIXhRr0itsSq|kp(|g8v)p-YK_HW*YeFV|M6|9%S&61X
z2@h4P0I@OfRkqy+6fU0(?(aGDrbJiL`#qXq+9gI<Q4mC+E-KlI9~29Xpawg+js|<n
zsdq2n`X6#FY%Zlq5-a6Ioz3Y)+??FWD@C)RN=!B|dH`^$IiM`o8~KdTHE3}Yh)Q<)
ztaw2q9W#W~-?L~Ba$Ih)q9@=iWG+eG7_SU95gP@|MfgE-W1|KjAG6c`J7$M^$QEWF
zpcoZ1h9u7pW0mxK8C6vS+Nnsrp&<ccAnoUb`M>xjmYdQ>JWst#sBJaQT@VWsO~cDD
z_9bi6M&Ln5BZhSYu(xt4{WhnOpv&kodbm>X2IZWNrH{imvTo}eXO^tCz0#$Aa%t4E
z-3eyhsxuj{M#e<6f^h|7>20-nN$rAbIDCm+zTuHy+{8<)%vy_lv4)3qv5qE*p;EHY
zdC5rL<s61$J&icBHm$%;Ih<+oEXG)UbB?N9#l7b&*}mc@g(19nv<5+Plg6@Gdu8jK
z_qqD1*LnOL^f|<-<hjUc!=u`1hg1ARvr|2lM)QdKISqSno3u=Wb+SSw?I`n$lhygS
zz1KOV0L=#MV^yDcLbZV4f|f5uT@-B?j$Z{^bNNx8t1~$IjfM!(*9-OuEPMYjV=6`o
zVjOu6jo0aTf}=za5`Rkt9Bi_77-ce3sUmFj0*}Z%PgBc+8e$l&APo6Wgg3u9*?nka
zIPi`L&#Jf`=-r85l2dSP1E}AEMph`lj(!;e{5tmtG(UG)J}q0>yc}0vV~$o*sGjM{
zK#t_{B_Og8qBbj#w8~u<@|v3E5F!R3O25sZ1c~8HO<9FSpz6J}m3O5ZCVv~swV4Cs
znosc)b${_k*sb}GL09H~`kvlDgcp-@Z1?cyej!wy=>4(Z*ndJSZLvtZaSRzEJxyCk
z(Q4BmU)(!RylT%)yoZ;2rJ*MQuu|z?$!t|OC+U}s&cjz1V2C=-8=uOVuS=Y<7~m8S
z2RWtJ4o+#T?h3nVSF9$9trC6QV1RTFKtkKm9KmRg??J19oD<fNtrOW&zA5gQT*UQ^
z$N9>Z5pGhQ{Mx+z;YUL_i$~iL;{cAV74;v5<WF0GP;$(PJ*p#geIY%_u%ruA8w@dl
zfQb6JMMi8lLfzwU(@Gn@h)3xejcq@$^Ys`@FO0bg0=}R}!I36>KcuC8x+!<Ct2%uD
z(xrXd?nebx^AEU-CEDM*AIMpaS$@Zr#d^_?xEIZzKdRMy{8%fFcdgECZn7Q`pXc0v
zde?tKV^k#5&$^>AR(|PnpF3F^fnJyjUg*c$mQcgk)C=#sYQSxogb%i|;L+5R?5b<P
z@K}}mrCXJ{ZYZPi))wvpSU^AZ%6*e9nNuyx2azpV>HRBt$_*@fuvf9`fK4J5#g+6p
z78XOKE9&*3O)Qo{mERcaOHq^cPP!}_7)OmxMwC{YEAATT>*nWEz;$cm?A6!0@h0z!
zHfoKzl~>8prl0cg>wKmDRw<74Rt*VOI5hAzkugDQA`%AAkFM)hb6QRG0>3Q-UzZ8n
zHLnF?F99cjF@`4tyJY`}f|@uY-anyx4zgSKePfYuYdOWD8#%oAJZZRv5=l>g3DvTE
z{otnl$c+pE%y3LE<1`fOWFd}0dKs=nz{f{?#A_m`glm4RD~i<}c#KZc1Y@8#A4aqw
zQ3y0;#3BLy*~+k$F>RmvDD`b9i$gnj7?DWD7lj32Nq0GFQBvy-ZNvm%B^Tppqy_K#
zEI7@S%WlTGZ4N2bT@R@!`!Nd&`$bk2fQ|38Pht!hO8XDaq4OLj_Z)+C_i#en5vhZz
z+xhoIR{SL_AF2Zfns9<&=@)}%#afdj1WAsASH)=mdI;eW#vpwS5X#Qa0f;?p{~`-6
zM~3;2{=XeVY!G#l-oT$y^XtT#I)p5)T!9#;gVkMH&#aLOMqJ|0tQYb5U22OpZ9<wg
zVa4dBL$5Zi()F=GeiwZI7uwWnTYX8GVy5v!(h|1U*aP*w>HF5#ik{0v1E$?dWW}Vu
zr<?@`w}E|^Ivr=L(QOwt9nrfHd<Rhj3dO3Ney|C`V%5I3%Zi$%jyq7x>b$nu3KZCE
zH6YhyVwY!yvSqXGr@XGbVY(hPz1p-t-jsYJxsLF@)`UX40^C7c*Y2=hAAV^1s7Sl~
zQEuT8&s^I%sJ^;otk&eB>a*T%8FvZl9DPZbZqC_vv=&t-YB{_@v<`h#?=_^n%3}gp
z>(ZrN>oRP&)TwQ@G+D)3X9reZast~gJt#JT{)ROle;OM;#z@v|<T2K-HS<0Q;hVK$
zt{Oh5rE9ffjaRB9U@eym(3*S-G~1~<b(bYIF4QTe@kuTlL?x?l&si^O=h}g6gpWLd
zLum2tW~@YyaDfVITPX_)V}*(}nnJfNe?5bS3Qwxl5@ybz&p#11!E#dvX(h~&Z3SvU
ziz4mya>cMXRSF_HbxdoE(Iv1rwM`pr6ckql(UhEhgcCO<<&0e9><62a><5z+Eqw~e
zn-DSNEHPw|*Q+qs+wwasv)tM^(WHk57_3{%1&+~3DFUu&l6Pl&Ros%T8Sp%{#$dPd
zQ8VNrE<Gp}{YznT-~K9sidXU*QnN|>6WnkSkn-x|5)K*Q_*&V0*D{!)m<gnX-tZ*@
z_x9rrweR4{SLq!`k$3a$=-|`V{!L38lZ-Jk4$Bq&^^3tUE+^k~R>$|~2hhCd!t9p~
zAUFt^HnXA)yS8fMX9ZlliR(n@u(J6<u!_@%<U!14WCO>$rqOo|RK6+hWR?K3VA|M(
zmjazlYnq2efCwu~TS)CIoO&)ECb)*ze$A`xdtN}Q487|>#5Iq7PY(i3y>2WmU>9b?
zQ$I7%(sOEyz-0w;NBfP>bCCy%w*heoa3Od@_J+x2L*U!JCb}p5M*cp`6O{YmT+|q?
z)L%&wZ-0p0Q1DQYPtVR+uYIHwGr=Y_A^R${GW7tPUFg2WUOxugtbFmu=33vuK;3An
z#Y`e2ci*A@gs^RHinS}II9<CbJV&|nev@l6LY`&Jtu1v-VlR|o=;I@iyIt~l;TbMN
zX}7+;A)tuS9NHE#>fm}`W`)8QBLm$Pf;pgMa0n!Qr}F#kJG+i}{v*JVmvGaEfCB&J
zKjN-f2GI>q2F;ZM#Jj>w4C1r6XU{f#ofm`Y<r81ThqhSFbb#U8hwMBL?AfZxedx^(
z$Hr;@E#OOxl@F%K8b(hhFp#dl3)OfvxtADtShLXu65&kDrPtg?(+<DY;IR|23Cp|U
zbrZgcsB-ahVa*@Y1W_-{i)72t2RD61MUTLPX3Kp0AMqvNZuAy4s+l)Z;rY=EXmaEI
zCPH5$%12ZRLoA9SS(-o1yI__x5^shyeIpX1Tz+rjt0^4HIQmLn|GP{zgF;V5eqSmy
zR*h{+5mMGtkcqhJS6B^)8WEd<DD}rWM_C6Sr$HF_+Aa>|1n;Q$)IKwx9R%-Wcbeu-
z1}o>CWe+r}T(x-Icj{OhJHs|V9CR>np8J<v@PlR6Rd3wz_VM4io!pRnehN<p04uG$
zXLmHk1qrEHm#jG`WWr?-A%L|z!Zx@qSQ4I*jT+FL^UxC50Ru~{q(_(OdZhF$Un#)4
zRVSK|#I1fM1wg%pj%U&-4J01Glh1QeKF&8IwHO#)`LN~NDYq5hF_I!0Ftnts!9zfD
zg{8r00a=Ec7)%Dg8W03QtalYi>N$hu5X#Od3H`65UR-c5fxPcE82Uf@G%{HRBJ`hE
zH31uC9bMujVO{id!jr!l#L*YkK<W$!%foNcAqp?Up##qAqMDEQ4Ifi?8`1x=x=;3v
zAJf_gMPzk5a2EKam+>Lkvi*rf)kxrn1|+VT@&?gv%nq2o(CIaLqxc5ujXVX;tM+?C
z;H-D|Is@xn!#^}K%)e5@M|J3yz42Yvd<Of0+bwJz5k4zleUiZLRLkx@<O>xwFHty)
zgBVqm;0bkhrV7~ZDSM&Xtti!A@ijqrZ>sD*9xQD8S@BBoUMR--dB(Z<x%t+C3U!WZ
z)%a=3Jd@k4>OP;Fq_XGGzZ9zom4Vsee_hCLaAa-M-+OEtvUUET^3dbxLg1bA&@%DR
zA7(Cv#G7(zFH~XbtW>eF;2Ki%aC>*#rrV@o7nA=(9)tg@ET7BNR3bo8TO&YW_XSZQ
zPTeJci*6C#z;?E6YNr^BPKIV}Hy7EUs!%XE8mN(>DTB~bE4*k-pHW?}J^1{};Vn+z
z=UmElA)9qoTj!Tf^*51>W^A51YGjFBLlfDTdQTZCj75CiAlaH?G?WasthRz`siVUY
z!IKBjoL3>+(3T;FW>z9pAT|e7w2+skb|e9qP*Gx5PN9~HP8fmbFRBrVhcTbk(TJ~0
zmcp#Sl<89+9*FQOSt5B1YOnG8+iKy)o)IOb$eqrLuWgxY5rOgKG$d){GFSXd*2N)E
z-o6pe{j)K_y2FSYy-#9?PK}12bnKAS^g{;b9jqAXj%2SLWZPg7S`8wd#uj26$<z=4
z?U{Co)RO!`c;kmEN<Jtl4aSmajlQDdF115M@yE9CA+85+P85VU$pGq5wKb}z%^u*}
zc~A>7JnA6)QPS10k@t!$?{#^=Gj%R0_ShI7u=hw(@E;R&X;*-vjzAf$sN8>A!o}p6
zGYbssBU<SH;bsr}U!D41>V$K&oWowxIS$XnAdbX-uJ$IUM=6HbDS~(AWB*~B`@I^A
zP#T3Db5sKDgx8o;x=(s?QUcG7n@Tq#2N}e9)@Lf}m2zVGLjhM>*EgS{!j=g#I3FC0
zy~?@4k2;E_W^xum+r`n36;EpyMU?e<Xco`g`GL>&L11(iQUP~Wb#a!!f&)U=V3^PH
z5;H(8s@JvN01CkoZg4kBk8O<}xtLRAmuvX4WrZGl5;rrd_Bp|T>;K{Ft%K@lqV_@D
z-Q6Vwx8M>aSdid;aSayS-4omc7l+{P?hxb>+_|`OFYd6s-}l?v-G8=fx}WaTQ&Ur2
z)6?Cj&v}mcPAfd%$JhRxIA5sP2!ZH%Mhrmcd|;Du_M*U?X;yH*)@H;oZObc)-*e(%
z+l!X`Sa;A$kchX?9MyNFF6GRf&77G++oR7kd7ILstZabx#$B*DIxeqq6gNp*SX)tq
zB3_AFL|Z{Z2$*J0d9vFcXT572cXKH?g5+Ht8qY9d<sEDu+qqPy)eN=oF#mn(a*DJ4
zN^j$z<LTM<kuQo>?9w>g-Dxq8eLGN5rc#n;=7Fy0i;sIuboRH<w;ST3)NZUXO#7wd
zD@p|lYJJv$6Pz-!O<j9*c8Pl{qxEKcjV2JG#$Yn;fL`XILH*xqQEy=#TcqbhDb@X_
z`@u8|^r$fjTY?<2s?$^DaL-%WpBDY+^XhAq6&V?1#AP)mC+t^l=Sc<xs@_kJQbdTD
zJ)0Gdm*YA*47l)VzxkBrPiGz!SGVoSOYH~NbSr+C`?ni^zqsKdqTb<jq^QKn7yvw*
zZzrfy2D`h2^(MBeJ*(XLhRZsKOSW&aVolEB%HR18Ed=EEj!ZL7#|B&z8T}Etb#ZLS
zb^Q&Wz1le}G`X5R+X+t^=Se$zK{e;<*DEwZdw4F0;ZGrFlCksQrz=HhSsaLF<N`5+
z5)iU^L0IXU9fBD*TRY-{bt}>xdPlK2U^;^BJaK{VcW_Vm?}GV@2uJ>g3+XInpsCTw
z=F(r(rGL>&lVi?78vThXq}GCkF8RE;)ULzZW~ErJ**<O;_BFgz(ker-Zi3;!GUR_l
z`*9hSWA4`x_G<8nT4Nyb3*y5Q!$`Y4_JF`a%D0u;jabj0QMLjfMST?q*VIc@1b4Ng
zTUB2Ff`Ef<-tCgM$)&B$RhD(F-jgw+B7scrhDc#*4`kJ;gjCO{$KcIkUqcSd!*nvf
zuhCzLvAO*|c;ZS2w)GN1yL++0oxK3=aGVMgITz(SY{GZBWP5JHf2ZR@F;A!+(7P{!
z1WtrKtkQ2Tf3U${k@qXH>UrTCr^s-2D&c*sjpSVyLiMK}6OO*4Q06G-cQlY*yL^f?
zog(6zTE;68UL8QQmg5o<2?i~bY72Grl35EZou8so3qJLIv;LIrb{p9+1q-ckr7`@0
z6;d(PN3uf^qLtlZVt!ENw-n#UF@@`Q7(ci%^-VAXfbG69RT@-KeTIy>NZSxrQchEV
zmm?=XzPlsbl=8s}H{vGQRCWOpqXW09r~5(vjJ0aY$o-x5`hCfSZ+T{@oi3kcAey9K
zXm~i1Z_9BFo@OEzb~#kt>NX$SpAGwz?!hBAf;OvywDsk`f=FB(^q@axcU$|3KW4AZ
zacEb@%NuA=us>9FK_^yktQ=4A=`Z@8sn<#xUt!C~?@ZJH^`)l2vsLUuL%Eub+N!Cm
zC@()81k=uAxMscD8HU^yTliQ)ZACRqOA_(YGRjtr+HZ<8!Ae@OtW5WO>aGp*QtXaI
zHo>Kc)dRO-ORyv8*+Ks;hIJ5(Eq|fv;eXNv<9spzQ{1+GP<6Wsdt75nIK;y<LfiY|
zh8pb%tR*+Xm3I?D``=CdesrtAZ^Zq&vq~C*H3_%vHKAzUf({}2tO?S81oF;PK^6yJ
z{~UEv9}8K3mOh|3JoZEJ5jptW>?;1#O&r5hn79|?z^qm<{hjTFX9;YGwVKTernbf^
zm>nejg~^-kQMu=4qEU)3B51TULfVTug`?tDz5C<Vg~M9MMW}<!f6AT2O*~XpWO0Y-
z0Libf4Ha7uFsPdS`y#~^Jz!@orbp-sTJB0dE8<y?aKOs8+!o32(mkv%0<b>ILDq9R
zApah9rTl5;frxy^@3*o`_rSj3rsb!D$WxaCm*$lR?s0c2Gms#5!{oCt$UCL$RFpPj
zeO;}AkFcAJ=C_%haj13_=BP;y2ai(m{<sJ3kuJ3FT0PSeLFHakx0l&P<qsii$!A&R
zakI~4%84<hsJyPordE!O6BEj4q#5=s`#XF?e%VF3F<SU8jU@)lF}Y)=L)dx}m>&gn
zVG$#oLLcwg5s#lSElFA&iONdc$j3%kqE$z%Q;&3my;h3aw9&s{{rsBPP+ADQ+rn6)
zcjh!CxMv<lDcWQq!hBJY@4=seP<)Fgg|pvQ-uAU5T9ZZ!IMDGU%HC=KlZ(SoNogIl
zBy2s$#ot0qe_mOOuLK4UO#w_ZudsDbIuU$x(zl|nsPE^zDZAZZ-~YV#vqN0Ngz-K)
ze8X*KT+4*9q|faoO7ZT7s1N_@-|`E6{ru)e6IkZI+F1>TX{bh0K4e{(_TPQ`k*j{w
z7F`z}KIhsWfRvJ_C<s;lCR-XGs2x4^?J{n9I56^&l5)uhMiN14a*O(M*gGR|V=FiM
z`6@pq7Yd@whXK+N^x%ivxmBt~$Nek`bW$JySTe^ze3)W5MVN<i8uMe)#F$FMMi}<4
zaQ@1_=B5NH#>JJn@8-6d!NV?vrpP^C(Y<BwK(1IWbBkRc{H`6;zih_t{Sx=ktoto5
za5f{xJb>hpKpbF<3*byK5Y(-#{g(5w;?j*Xt!Zk>P`%dy7nEWr=Vzrm=kzNt+MJsY
z-rFJTLsMVR98brUo3~}rqj05echSCG-Qt{?)9z7oY5`!9vstlDTY-JvOuK1`*}MJB
z65-E)g4F$GNY#8uOF81*!IAMteih?7%+~2S;?v&uFx4A1#BP^y^3fo-_W)Gx>v|<6
z$&J<OzQxBlno16!*|U$zCs}~YfPDHrhx0t5?7T{MpZABbuy!gT4<$<|92cckfaLx<
zTDqM_^QqH)G)ZL-H0pMgpiTaD&VWTT7;Hme)9(*=x1$j3=S>U!sKjWYwM-Kny37+i
zzU&z6yM!1_T<jR8p2nvQ7PPJIjVzjkYmq-d2w+~s2bKCHoW&h~{v=+GOgkT%aGY4o
z=8B*$Ho7l&LsR5~qb`P0Mir)s9ar#QE>$j<1{D=$PB`xS=E&fQo56UOFwiX1nR>ch
zZP#mPOVcs)`J^0+yBcG<10w-k4m(zzm2mtw%uR<<_uLNViw=ElYgWkmJcVJkHrTx>
zIH*Fb(#<`L+0ck)aUK)+<0j~)+8A1SV&&C0kKNpg)a$WG<F)LLe(Hf4>R*iu&9W!x
z+-j#(Y5(Hd$3qn0@@pibI(n(!ow(UWxu2@K!zIt2N5w;V;HdgYaGW2W+I><c`6R&a
zFF)~J2UWkS;T1H+UOZsOha}LIy|<z|yt4cRcVVXKC#DCxwT7W~^O~i(y`gdQ$euZ~
zVa1Z{qMgTb)0ZTpwxo?FZAE7>#(DRu^m;?`BA4o4Gt$+>jHUJ!yDnV}4lZX28?I-m
z-L7ZJjEm$yDo>P!Hg3|gw|oq$A;KR8e)xY7aPeno`QgvzxwWWQJ@CV6k((9)5@fY#
zDm0i@9H99%myG=-J$r?PS4@LDIEk_G%MDqKMtDJ(1%Ekt`5R_taZU5W9{M-uE68Yr
zm<0NMoap+78NS#LQKOF;So~qJI_)TH+VELunnbvn1j_3-{F<IGDEx-j`6VX?e|ChC
zl^@*E7w@K5Zjx;}sCJKwk=y;5C=BmyUnv1Z{U?I*$J)IOx2XlmENPA@>W;R%Z2ZPE
zOL&Id7q6o0uSrP<LG?}LdgoGA&Pj!WN&FE;?K;IMwo+F*4m@jv#Ed!lp8)pwDoBNr
z_}>ZSdmwvSMVohMR*wIb37=+l5YG3;le@OCsNp-W42kb|pOaOmSk+eDe|g?ZbT-sT
z`w9S<T1hc}*qhdipp|qKnx=^$QMr$Vj8(zs{;o-1CxvE<5CT1Q!mG~hplCfCCn}MP
zYe@W<vZwqw(idc!ghw{+fu9wR(3@`d4jTV;eGzhSt6|N4GI{WQA|JIa^ex=2@NX!<
zW@9b=bzb#mszUB*WODvRZD^f@XH7XTt%HTnT_6<ee1Cdmo$RrFwU^7&pmlN`>r02o
zrRO@Kc56rQWDX*Sr>E}OdEchH>eA6UddK>5El3Oot4*%=+Z~SJemCMft9m%^^P|CC
z6|~UTV$XHu`@POhlhbCDy1hH_JcnFu=@a`Hwf_Fm2D?zy1}gyY^on_CFL953-NcHp
zuc-^@kTRM2bz;B1^T3r2Q~!iD-Oeoa(--Y<{Z1;&_ak-E-RBZtVQZm=ybj+_)M>8w
z34SocZPa09=ZFbA0SFW4a($2h44^Y-h~XXH(z!7#b!(L$$qKk=70Y@Z>wf+$Ov#bh
z(7l6u_^j`vBj+a%<k~`COb?gH+TXs6w;mF4p$|7|cld%cIR>!)RomWx;`+yxU#9*J
z*=B?0@UQUn8<7Gg5jF{>Pk&O_HG${m;iZ%@G8JK&oPj+!&5-Ezzzg{hzX9jgFs!Df
zDSBaIDusE*;r)I?tcy0TWa%oyjQ)HVj<vCTRgRzg(*nefdr%xk=Us9lRz~MJ)JbRJ
zerDJFUrVEEaB?~FP~Au<;|$4(4BZGpKYbDR{=LROOjQV-hJdQ4%u!O|o~ILT&P834
z>&rc+9;K@0%yGt7ZJ7lr?k<#FywBh-_sU?%JsR!#a1A2RicG4+Qh5lX*&Uy;GLESJ
zATCw#%=CY(d`0EHb;n1cY-pHJFX*h*e7zAEvs~y3R=xS<S1vJL`snJH<rI$KNtG_X
zde66sb+aaNuNfGwdb93V4%yQ1=gd8Ry4RE#WdxBMUUrT#f(+hak`dJ5mwG|fc^W`{
z+aUq2h>gE@lYr~#i0_lVbCJ12H9QrM9$(8f8+~EiZ|~_ZT`zs-hqYfj6aVGZ(K9f6
z4uJaJc|Q-muo}C(4L6=|>M7slR+c?cFZBCoHvM=T5^jC75_@o`zSCOR^f#&vPfXBH
zE9Rlsh-OX=z&y36o0xk;JW6fU5+^q{49sI1B<YWwR*+4+&}yTX*CX{;*QP?ZbXfnk
zTW7<ZP|f0jWrU6Mm=^$-O1zY%g68Fhv-dA_3Ln`P==EnuA;<&hc6g`|tOER)u%{3n
z@az**N``T(Nt`p3X_$jT`r%W!j;GTlq~M;DISQW$;ESH)puck_i+8WW+DR4pt=O5e
zyY`Jw{ruL}yB$PVM#ra&bXEOon0W_yHy>DWOE001t<}}(46&^XU<O!uMnpqvdlCJl
zaK%|?7~P3_sPR^MBM~`plmu~l@XsT$5vfAx;Zj?E5X;J6TEJb+Aui97Gy<6tPHoZV
z#U}H*ONIEZ8iR;{3)3UBR7^g?y>O~>qZbyz>$8+=K&sl|S$yElb%+@7bM59VF_zb3
zA35;*eFA{`5+i5_*tgBTP&lW^j)p2kcA|x0+diteaPSw<VXq(4^psvu!*BE|Vt-eo
zSih}7=x?HD@2R}_wzaa(o78j3tv19<#3Q<smu4->ck?v}3n+450YvZ@^Bmv;S+q{N
zV*kAT8h!*Mt?lQ<{|<cW+sj0(5Nj|keD^52o(NqBMw;eY(*~}yg8x|KQe3e`sER55
zkMBSOM!@y1X2992pV!&D8(KS@a^nGqcvGRm+Bn0F^^YiK7f#k~W9`AN$|zqw+`IaZ
z=ayP)<K?aCS}vRw?+rs;l`+10gm?8gcmIAYARUg{F3=gMXfOL*Ez4qA|9Os}3ndhJ
z#A>;4xoN5=d8%G>;a4~x9!Y@pv=yFa3Jl}Xwck5ZNvEi^o+I4I`%#v(-8(H)Oqxl2
z^kCovYkhHdO~)gZQd`yQ;nmUmPf+@OPtCsPQ26vAlxMv~Gn=i|h~__}HehfrOS09Y
z{Dc0%KX{}MxjgoYiSs~NeCqeJ$pu315$fmO20U$V?SWVzKeXJMo#I*)vs9EEoNY}{
z?FQ<%1Tm$Eg7W(s2v@x?Yb&hDZ?C_P&;rw)8?BM2pq&v7qQ1_})|}$I?~X6`H|ii*
zJ|ANp?2#b=vXVFmZ$@w78_{}WqcAQ%7H62zOXQC_a?Cvcq#4lF9aQ<DR0O0=lWLbw
znzsu>)1btUGZM+iKd(B%^Lnm(*bz6>%^9HTy{WU?T@N%mq!%-aww^DupnRQFm3^%6
zdQ0;Jc)M5Y^*w!5g!Ifi75^&xE6zMaQhq8}A)l*tZKPeqQ5<(ARiQEir$g_=AjIuJ
zc?(uEYWu4jStT^5R&7^3&`!bQT89+b-lm%>9cuU$Jk3U2DC9P}*8wk7SD~J_DtsR*
z4KlosmiFMt-gEZl@EbGL=Ew#^B{}>iOh0pU4s78TuN9t{2q-k}seVjy7!vkUk^geD
z(uSpt8!>m1deW=dDo&h++ntS$j_SGB4<Cm7!<1}mwT&wp8fr+Q<n@6#0-s9fC|kEw
z9;`Zl0$OCjyZ`wyxJQc-T2qeDou>#^dWQl<uzn}zz+8A&vx%vM6Fd9q14sI+0_(!t
z-}o4Ub3Kcu^wKBo#AFB7JbOqvi{G$@Xfs5gi@=A(mS7ciGN==F`yO&ETW)yV0Ac|-
z0%*kof#)4DKnQa*&~&NzNjynLC#iAR^+F3^zYkXli-9Mod&QK$&+fn}<=}MoJ=nET
zXxp<rFf}1D6k+CtV(7o?{TL!&j~uU6u|t2YM*g1KX7SKFSLq(RHB6%aE?kbb&lLj$
zxHH}B3YX=pa{02wJUxEJvWXpl)#BBiQ0=2K_77OYKOk1h-{RZ-Z*5DcB6I&in|H)j
z<tpz$Zc?=7^Hpt2$v&==!>_U5WiCD^HftLZS?(JpSqGhye80OU`F%Ut`JB8B?Bcvc
zY~p-H>{NV3Y`gC~77VXF{u$nQ%p2ZW*=DwMd>USruDH9M+1Nd+Z~&i`I&4oacwFBu
z-rizOZ){VRQ|?igQ0{bTi42Jtij0Uz{ocvR<M(x1)bA{8Qh|^-L;-3p<7TUGHfXg8
z*7KU>fku$>YdZCm^48WgN<2KgYRR53qRY*MzTJ;wneFz|VUQ<tbsqQ3bowe@V+?!P
zii<rLILN=1a3i&%Tm3SB&AOLoY=Y97)<XZyezex@l|E`#cP_xXAm`NV3&FpE5J-6-
z#|gp(=N`-BWjun+Tx(8Em_Sdn<j$>qG&1pDbryBi1zIG6bcB(?s~fxK5j@bFa%Ogq
z&hA6X(rtW9B!;}!jK6?#x<*skw+=UA#c^u9bwM%V%C%VS1ECzNH8d?6QYsUD#+{aT
z*PNK%b!Sa5ccp3+rgLpCZL2XDNt6YO&lLR>g>_~ag+=?1mO(g7CbBT^-Ng<i`n^7e
zqu9e2Oj;T7p%fa<d1Tn>iN*!#qVX*aS@5ME^s)}x5W&amypyi?<e0me3Psv@m>z!O
za=YaSa@>$J`QypGwr>Qt)2U=y?nx?oXoRKINu;~e)bCh>8Rt#uJaZD})X8x_b`o)A
z%=veN=D3sgE3{fB^v>lw*eKkgOLZFuGAlUIfi>cr+jq2a<JIFy&v7RnuMI&zyzY)t
z^%B@Yf)K5puLpN@aqd)X<lN_b5(jMiBXauOagRMQ&H7;1+CVDUHlE0ob{0uDLQk0>
z1|h_2sJ4swj;M@z<z(MPNly+jclYFp+_!dgrN1G^a9!b|eVImf<j|t_`t}cbp(0Nl
z3JNr$J`{udwo#aOMHR{iarv_&27A^Ckd}j3PmetbS$OvZ{Wodfv67sM83Dzem2_=!
z3Xyu9=rj`E$y0xJQn;wzytN&E9@<%Z(NaNI)Dq-pDRG{8F>3B-AtRX^BG^d10UHD#
zaDAik2dLUybQ8*Nx(*Ud5a`B(u6(uxSl2#vNkEr<fuI!t?bH*w=G`mSO=sXGsV}O&
zFXsRe1dwphg@)`819`v^zvRAOW9}2m#Yp#ir(jn_Ui5RxIIM_Z>1L?hRvLDr4y5X-
zK2RDO?&jkra|~&%P^+N{QdZB@FRn68-H!YV6D%<Z(^lXHnMcFI5vTBpp`Df`g>y)y
zo&HJ+cauu1rsREO`&UU--B`G5zYwve%>vwIzc*JjM=Vx$ANyJg$4MrR&-o}D{ClfN
z^6}OBq5wc3zlk3(oNgB;G2k5>ZrliAGU@ig*{Q&G=|)mpU&J|n$dZBw@Y<Z&V_`q&
z_xb_sYadoZ7Z+hey5nl67EwPv2@eDSJiR6t@i(A15y{<s(99ZYYJ_EIQ;o!PZ%yDW
zX4s~`^k8f?tk0e-w(MXE&*l%~49qno{XV4gk7>Ih6fLqSFWPir0m)LPSN1IbptC79
z_X>*Or~dqNYMgIi-<S_jqm&O&htv<y$#=YY$9JVA)K-z;o`Dff6j!)B!jF?R;BnwV
ze}H!Kw&LLfTk#==92D2JtDt*LAXXRPqn6Wq^G@x<B<03}IIf~u2aAkybG->yV?r+V
zJ@#dg|3zHIM&gY~zQ^@lCxg}d4{l@&;i7|Q)Jomnzvb%lr!4GR?rD$!5z@nO=(qsv
zb9aYHp%Y%`_HPVdzq`xNe3adnlR>=Qna~PIK<oDJaE0zju1NuG%<hM!(L1i@8}{CS
zZVC#p!B6=2KpB6WSmO2<cl^d(3P69#%kc-vM5Vjoy7qQceopXY_qFU{3rrFWks2OT
zu+V=u`yO3e-AGzcP49{S16mS>WG<;-QHzoSU$cv&5{<DRnluVlQNtr$gO4c`6iU#5
z3q8tX;L4!iu2;cz(POqd+N}F_4H>n0OsD8GCzONg4&jPwyCB4CQS^<Y?ziXZa_J1=
zW;cZu#DNKTVt%v+PV|(p$h%xZ4ye&|U6MAbOaD|N9~|kCx<tiAhobvLV~hF88CCdR
zUH>5Em{mpf%~EH;iF+wtOxfa4=IEWAqf4Hnqux7evTRfI#Qo&aq~_W*{ZG_ilk|x1
z8|wl@k#^J*wq@_AP|4M2DmNhVPl7hPn;Lr~n<}+Nn$8t|e}x|VuIA(8zNr6qJ*vq&
zw0Ntg3Ei8|C8Ax`jec1V;VWwSBu#4mQ`*-dRfjutb*WLG-`Oxi`CfbI)!D@x;><jy
zPJ>+$#DhR6hVi*5&nZLr^#}_FCe)t*;DJ-`V9wh2Jy9ADf>^<7niWdvYFgX}=l@mw
z;^D0~(`A2i3jWWu>s>u8RWSaooUsXSN!yO|kd@=_&mU%w+1U<llDBQ2Pp+Ivj}W^+
z$f)8H3{P+g$LLa7PJ|?Ws=a0a4z?>XRH1HnliR9;%S%1yM<9GWM0RSwS#q=mQ~SX<
zgugonngSv88g3y5-ke1q_}BCiZGK+b_eD3p?HbVAda4E8(RLm`k;FY>T_Dcmawx@{
z8f`K!4cxKBUFP&7`vD4<J+T&_y5EBv1E3n4-p`YsiH!HJ7B~JndeoczpB6alB42o1
zAIz8011LofRn1CY#!fi{vk+e06mE6Wlb%VF`ZguY_iEVZZ><$EpWTbJpWCZ?fOBJ;
zYGSEI>FN!sganNQHQPTm;okti%KyG$JmdfS<>gE2IQV!UxcF;nlc@ZuAupnbe(u^c
zMEG@TIt9=I^$cHlJ>P4^?IBoL(rwKK`z4imGZx(zx6&`*!shU0^Oo9$|E2vRtz+r3
zFE@~#+4xR}Nl)3$lGp?Lz^DA-fI=CSddROU^0?@bqh9)(@Ut#ZyzXZq|6>u}u!4Vm
zKRaFN@Z=)sutMgxg#_>Q_jS&sppFWo|G^#Ne7SzaUj;ywMbpej!>VgMyTa}69QT-e
z529GBsv6_ItFKbN6x~tGwCP!!(>(sX719`M6Cd6_1H25uAMd|__3q`s?v=`;cR!2}
zJch#Is6Y4g!kiPdqGO|r_Vb|XQI<?IKJE+|@4E#5A0w^5HIn~pH1O^(_CJPO8bHJX
z)r`qu6bjI}$<{Mk%=ywLc7_DG#hc{xBl72;fgcWE252S&S?4aXBYj>Irza%PR_;e6
z0dKk_XVlm`&z}8$Z|k+A5~OJl5ZLrUw8~4>aQ@dPljK0M-G|ZvrPoYob0AjsjRef%
z3wFVR1hM%GwkiLc=)^T>r1~|Id$k8;<RKkQ`AT>nC4medKwo|P8>-Ml3b;0KPT!1?
zd-f1L_XOMa;P>2hK$&|YgC%+ko<EmdMe1e+GFI#aW;b2eSPDGlS}(ued=CnQCqLdC
z9fqD<yegk^yrGxR>LLmKBD`SKg8x@kPGvskh7+2-MfyUkDbJGmc%oJ;bKO3pcNE9P
z`l6<Vx85&j6Hx$f>}xR8DB~mTtzRHK9W7DK(MT-6m}2{@8dc<TbFY*>-5W>LWl#U+
zsiXWIB)I*xYkK32$nCNRE$5}?v*+7M!ekBd<7N=;Ys*!Wj61zewDFXa<#&Ur$l2Ci
zQe4}vxE%Ak1}u@2I#&vhxW#7G56wQM^t6b2q{ktne}e>A?7a-vTYG6zGP2|sK3ea<
z*=woWspGK``H7ptPbesx`Gsa=r3h-tG%J1JOf#yV6KCWvwqff?>90FY3pWRS^WscI
z>om2i$MdcJ8}Ju1F+=bRN?O<@+$v)@H7*ks)?RuxuoJL*?wFBPgrmAQC_wDsn;)T~
zs7!#V%w}U#OkK@#2`vw&Hg@lkS4dQAt~4Y{ON~B?e$v3VA*P?#d8jWMRix;b+tO5i
z8kEAw>EWF>>nGQWDNzB?OSnosEF-n1oKvLdCQ1Q#3!?P1OKY_B^}~0iZno)ZH@T9s
zvnqY~tq98vf^`aCOX>$`My|Byrdkwa(pS-NYiX-(8?L=pL@d<1qd^~+t=%u5*h=91
ziIO+1%`dOrmBf<u9eb`nbODZ2>o)O^r2kkSAKZQY-sWCK=fh+a+G%f=TAgokW9gxs
zXwKXyZj-Pn(2jQft9shYPIm>!qq_N_=k+mW0iblV82d;p`f+n9Wm-^-wi7C^Mocw7
zQ{ke$3FFb*0{w;a+*QY{23~@1#U8ckRFJNG6RK2<nxAH!j@(3l4pwHi;MJ8hNpQe#
zHG-2uEna|ImA6L}XX#>w`U~Z#RdZm!Z-X}IoooD5z@B7c`Al(~#UiNYcTAYMI|Wn}
zvj3~3kEeY<8<3>=PmAC8ZSFn)EdQSl-<jb5(d7SktB5TU8btx=$76aK>R4vVgg5i<
zUZFu^!N>==0~7$5V$Tdp!f+oiUH^tq^r(6{G{u~-^_BvW7Y|)|<;)9yBjCFY#B6!$
z3GR5YHqCl7$T*M~Ar{^2LwmypU%a8vzIl61y|JD`->{xu0--}w5NQ4zo!?mx!sh*3
z2>PqN^Vl2q^G;9P56ONzSW;ei{qJ~D{gsj!w-|@cx-__Q2<p%&Ny1Kngcx4<d1q4^
z%ya~dL-e`cHA(h0l2%ktWF8kl9!CI)O;{wH@`X*F5D=wtkQ%NEs-K4$Dk)-x;%3zZ
zXQZ1fsk0zF{i_Mx&3ZX_<1|f@`V)^cZwKpi`XtJ=IXZl(9v4@b12%>wCvrsHB795z
z9o)cjWN_l??_L{Jc=MwB-W+v1lY$i7RwX-<42CAuHFiv_uZa;zB}xPEyhS2#yv4q7
zcS;)Y4aIVBuEmzYkqoXTKmwGBbRdQ(n*$bG(grqLqBt5`syI4Z@)Sav(k9Z6q6*kp
zLot(7a-_8%u|aZ<#L&N8aN^$1y_}omC}Xp56?>V%{Ffn;)twBr+Qw8~idcvX<88s1
zm%PEhei(!Gyq!#vpN&mopN&i^{KONO0T|zBYkNJE4Z)1c1HG(Sx50~iIdHywMsU9T
zV(?FV@DDc$y|9zeAZLZa;skd}$H+m&;tZnw!ICH+<!GBw#qNaNzlp2_foc{jGtZGS
zA8xd_7#Ox>c8^k>Y(AHtN(r@9Y<|cgVBGV#iDFUmh=311-LF7m4@%=Z`87USknf}p
zs|u3(gg!Kz97k0F1YUCfjqHxS_IxdcIt}%(zD8gB%bv5IEQd?<&o+dBlHUFp{(rS5
zQ$3|p{u+HxujDV<D;eddu5`ch|Hd`MT<ghhTFM@)KMHa#LELx~a;<*`uZdQWjgBY3
z<<w!BWA5&Zy;Zkiy>c^H?e|+so2?t(uO}?g5C`xud>RjT!i=W;v6T{>E%K1FzR>p#
zzRe@Rh6Xg%g1Ni&kQMwad`B``<r*2>DcnLbT9&-|b||cCjl+>+VQW~21&6dXt)MgI
zZo-4&snV|BhDAgY#(Mydv^6fYPGcy<VtNnDXnMb@*bl`{3EPT%Pa~<@%nPVH2c>`K
z4^F}^u6~-mlRR?=yq1$laDEsDDaBk|#n{R6lh_CtHkk-yYe~CI?e<tsOK8PjmtH2@
zp%N<aqESvR2(XX1He@^iIa_(r&Q!)Y8!7)mnql4e=On_tyB+HM6&o%)`L3=f$H#m%
z+Yz-;NAsBZ8=9M;d1FLNfF0U7FaALE&Vnl1?$W0flu3nV$@cid*7$_;oj+Ao4lK35
znsZuJ|CLdcu4x9x(|m+-AHqe_usf3+Bg9GW^nSA;6hzVs-kFwg#zR69Pvk%rPcQBz
z&YI{=&q4~;$g&Eq;irTz<<|@5&7ul+&D!YWo1E-B&N?;0oP?SvPac}EPcE4lO;(yn
zPj;HnPxhOb|6*B^*}-gHxDR#Uvk!IPKM6hK^X|LNGU~(1TJKZI^6#6<3hm>_5(r)A
zV-6ML2O#>|P9gZ(2Vma*GepIjt_Mq2eG-)ajYm;gMcS!sAR_qnH)*HVDvhAwY7(FY
zHEzxWV}s*b+#%nJa=xSf<FVT>{lTFj%OU=xw+KEaW}PvD^K`b4ELZhrsvm5p)(Jly
z=+hvnx3$KwAL+6*l``ZE5dhdnyXw7Uw!39>2+^JVHSWD^^~NUThWzoIrov$<kY>wD
z1Q{8{@}pJwhfqDkn8J)N%i{2{P)Wl?MoWcNS{YE%hYQ1v$YR60=33NKwi0Lk3Dv(H
zh-d;QXIoeXkTo}(8wq}2gp;KwWF-U&ii-0aXYiC0E|W#h-<>JifMX%G_TN~OFK=KT
zM9#M3em~wSiil_y<$OaV3W{R{0=~lL>%;UvMs9=7G*R&--L_&$j9XoYy5weKz2Zy0
zln$THct)4m#EpME(h`g>N3*R>_$JjPSIb1Z(EmO7#ihR27m66n$-_<?Yc`4S$vPg@
zaPSswZ6pBCO;9Xab1IvP_8<P}5$f(W!VjM?8C9B6=7ib*1frmpJ%TO6w858hp-=er
zupyq8V$U)Op`O8?1X0aGl4)tZuo;j`CGDWb^5|1R!+lTrdd@^{Xj2hXeL~YB_cUu%
z+1Q>4)Daz_=q4V{w4!)^2orslCg>cIYR-s$<P*V=P^MP0#(aWCbIs{stq_$;LO0V{
z6PPFDP%l+yMior)IM>h$=sz%it6(dVe_ttd2rRrt=7)5Lw7B!shk5@Es`t!v5BEyq
zhYLa$*qH|t5fQHaEk^)YO@?;pR)AS64V(o|@Ye<&5%20;`WBapz$f1op)|f+_ecf=
ze#y%rkcQO0f$t7b6a#9}zs-p8b^d)jr{my*(^9a&sUKA7)&R=t!Q!RZ4;DzG5M>`i
z0HM8-2K}y<-kG73WN{HlO(0AWvCmHWIFt9iQ5~&QgK$8akVo`TY1Pa0UV>)TxoQ+U
zw)V(}@pR~}?8hg9fH<$y4s~n(s^Xk^KLW)^BTN<(3!`zh5-XMs*7Z^T0{2&3Wq)mp
z1Hv1wR`r6@0q{DQ1oD%u7PWCeJoss=R`T&Bdm3i-om=BSQVs6+b-U2Lab7)FhGfS$
z8044q+|N7)d51pc5yU@KohVHq>3IQA9zIm#@JcX03DG<CfE0#Rc%uonY~O6Y;1YFA
z<UszhGn*!2T%`I|gPPWT1Rxi^xKA}7<3_C*xZ(XT6zo<$laPh`Z^+K`L9Xv+{pdq$
zcVz#7ZyHF+3H)BxQBZP$#E92c7J?te-v$c7`NF+YnE8r-a4o{fq^s2MZOH7<D5WOz
zRR0iOV>U&Y=6`ZF_{07a%RT5QpQDy;j_`ZFBN)xH?^w-qiR2hoL|S0rTuow$_!v7<
zYGBL8hKm|S8azAA{vXL2IT?~f#23xi5BI<~eBX5=!p6m%7s&F7C}Hj5x_jZRu&U*m
zyY-u_Z_a^4^P=~w!EO6*r#a(Afr75M8vm!4-?#0jmuK!T?=k`Kms59mr%_{19bmw8
zk6jJ9A+GOw0(tWyW-G1lI=jHTM8CbuaS3zv1nK$hw*Af5*T{x~xMb%umNJaPAyyRX
zI_l%Jj6BLZ;#j^y0$Drxj8t-4UKg@mM2Y0tw5APC7S=CmUhwTSTdN2kc}e(wZ|5|8
z?T2d`;zsOXW<G4G{BWq@A?^~c&(E5AqP|rM2@Lk&8tL(SG<!rtl*}#lQMk9T$`6s*
zy6n6C6A8$_!#XnvFU>(}IFaGNUfg`cPToc$2&Pyxue9n;|Fp0n-bz&WbVCODW8i5Q
zvK!$L@x8>8&+;9fJX~;?niQlfV#61L5*0)<BTI0kESbWTrGtkjT;HJ@;#Q18l)ypv
z0j(ekE~J2u{O!r(j`6pr^_|1+8|dv$<iJ<(Ksh5PQzX~6!}o3~r)pwfGj2KkBiED0
zrlm^Bxye+~xz$whxn=iP|J=63N7yUXV_0|vF$?*xFH35oH~7-UbE=s98u4VuMFCbe
z={|p_`EMHYJ&#ETYUdgv>dJD-jTO3VyhLtT2Yk!YF*?+HxG7X#7NB~^mIGsR5DbYT
zV_u#z39|LFmY*(VJtX+*PUPdI8{7+uFY`-6H=gD#bCJWqviP6U>Ti5;Uth)rg>R^L
z+_25F54cH)eSZ$Oh%%X%jC{xN${yaKO20@Mad=+Aw|w5fcX<A%F@4`sno#zqw6?6X
zG@~qwc}#OeV{NWqqknE$V}|dq#tPrCMjzjl#y`GEjWNCvjb*+~jro-0cS@9<GRqZk
znZw`9Ic|S&nf>ELvf1O<?2_Ba?4TQHcJ4crkGDf~a&k}1VZvR^XaZC8Y~q*b+2o`c
z<pkx{n~`YFgqWDo+g;cBTQ9_&+F}(P7fw6^mr%p6eJ;C1|0~r??6O-)*hhwFRYU3X
zLTm}m>}~TDK@sbykKEd_p`kW>cXeAs=2<c_qTbY$T{CAAb;)6}hqhce+fPe>>a<Nx
zCy|Qf*Eer#ei6yLsblcfpT>qqQfXNdi-9q9Zoi!GxC5S}PG;{sDmWOKaT7A!*@G1L
z1E3JOLCO30{Ok-4T@?+f!5>*MHRlF{T)HY;7-{hN{{#3Kp?e4eCPFx5AIa1QYs>Q6
zGE{wbI+V$9w~v%CfB}QMN2+W<*uit}m|9>T!(ZMog6p3QE>x}D-d_?gf&Yq<tTAl&
zNmW;Tm=aWg(M3Jhc<+HOzB2h3Gu8N(BzlU@qCzr1-+EakNdxtEqpY#oz<QGBKE{l9
zqOl~y4H?n5Y^G+SN|~3yy|4Trw30My#@UI6n4?4Q<fDTNo@CJgs~F~AnL7&BX}$|w
z6{49FRv;uM@bc*QyYFULKA(7Vy_>m+MIqejVj>y#z?=yq5XU|>$Wa;>^c3*}NFNac
ze2MrAgpbGqhDH$F2Wo&KBea3>gDsP7MTh3<3PzIzzbBZc8+B&@pV^5jN`~<Gb-mYP
zyCj|nhP}+NfJptFZ<~~@_3&@8fbA>2QyR)ru9)-r(<ER1j$PwPjy9bJrT<s8L#JW<
zy;}d?divh_|E*G8mXPV&4*c57ojIXa7XFh+`3x{Dsh4)^_=-stj`!?HEb7IraT`E^
zLCoV2LOYw5`7wf%`^e0X%gFgX`i~J8MoFmJS7MCNqYzW31|tklo{k|mG^Y_DK9{Fz
z|C$)0>mA0#DyQj&F%2p(wkYL*RejhsdhX7UR#|K_Q5#rM)N$a;GkOJ2de-)t$j32p
z2nZOp133)uwZUIq3Y0V+P-%?0zS9`OGYwrO*q(R~USEn@A^D*4&W&@KcOmUF)+Fkk
zH}M>8d|;Zjw_fn3oFJ-6UdDRcJaXrL>ioAYdLmgsPtn_oW2O1EtP|MbMYCG0FR@&_
zl9s2$|LsITbM8@$eLW+h%)^!FY2wYW;sw-{rJeQGradb$^?IOx7Fa!h3D*Bb`TCY?
z&+j1vG_0tjFE)s7KePJKcKR+S9BU#|D%aP3_evx?VvOjTWDb1~fLbig)#%pP$rdro
z<`lIUdK3y^2{{Ti<??ri#V(0d`%3-ZW1(AUN)aU04c~EQS(`_^V{wvOKA3hf%KvO(
zU^!)%RrF0(;CHfBUo?o|yG>)H?A()gazdP0H27z6sm(3xTaktAQ;`|zW1o?Gv%sf%
zyTGG*weU&xZb1Na8TScv5yuU>i{s_IixcQM%Q3n2D$NjrjPIXq*zOx`=uF6U&Q6wg
z@=gGJ4}SODaByuxIr!f8{pX+KJrjp^jlS3U02%~4mDmwGYYfb~#@Y6|D%j>bo%HRz
zbqun+H|yQ5yB&^Blp8Q^OAI2s7j=hydD&(=PuQHiTJ*KO1a!511oSs<9qTQ6-xj@F
zbU*pFQ7qd1*OO<oEXCXUXC}>W35YXaj7p4`kV{3WqQ>K<Vnb-I_b06DKxK9)ah7%F
zAE;^Smk##UeaIl4dZ$a%v2}Wz2XIQzA;H5|lkD>=U1{V{nMB&JbhsdM!U0B$LJ~*1
z+~_Tr%L<a$VFKI%lSeWcQERRLdiuTN-@jDsh`wtap6IVy+?9QEcss@adU);~Ku=WM
zUY@-eOA2foMuX?;n7pQ((U(*Vh+UELNq5rf!@e0QcL6f$opK6F5bl|&C(?<C9g9DA
z2&5-3*=!d;`rn-ZoIYP*=fO)7#icRLNEh+g!A8xfEM#$44#If(`;PoF{mx+c=mp5K
z-8IJGQ^T#WL7h3Xaq?B`J`fWE`f3DWUlyH|6`AEbNagmbwlzDNiI>Msjogx6CORlI
zbw-+;osxSd%Q`tUaS5u{@k3;1^habYlX*PNsn)d*9l`J<mOy9^*`!|o7dixqua?h+
zDV%2Roj8TWe-2lWz92U>Ou0s_?G08g>i$qrqT9R>`QC^f{5joYW_e@~=Q;w<s;IAW
z(5K{+;*0vdPSr&|r$AzpY+t-m+$pC3zD;?1ZOs=h^VHm5Ge5?rfHU~EkljS__$JiZ
zBxSTJm_+85rYOC~YJ$hK!?5RM>DW-&O=4!bJ-R8n@6*y_=za0g3b<L6{@lNlS~zQe
zbYM@J0gC)BWY1pP7t$xn@|$Cx*XQ&HksMNox(V!nqtp^ZO|##^gBR*zt3nr5bcX1v
zPn%{_$LBbLI~6<<&KSI2SLk-cGhSlHu+6-FkrHBL{+m$bHXJg<8*svy56#byFbyG5
z;WNY?fc%Uzv2i0qj^5H3wlr&9Yc*iw)P1#0z-N;nK^n(?JVQ-;ABlU&111kRG5-U7
zT)N_6W)JTW@IE6^W89IdMs3;d=+(VPmVi`&xAHb5On!AE+h6<Z7E<?;z2Gby%GG{(
zL$$vKFibrOMBlwCDL#^@uUONp`&sdfTGN8=D=iv9DopnjyRx~z*=}VM1^f}^vubF(
z7m1acpU@Hqx)CnxIHM_UQfWr~$97X{FoaH6<*Fb4CP#M1>~aDunKpDn6`=DLe;@3)
zwfvhh$-3LWvI3+_3Ttp@*VFqkZuzagJY{id_*Z3Ub$^;L=x(0S2Z-!b0(>Lx+%2#k
z+j%zc+j({T#4-%JffLl-#uM-WYWNd!lc)<!K7tEOo|GFg%RgJ>-))Y`9S?VXr>18G
zhNn00I!%k5DoqQVvQ5jJLQFHAVoZx6veNBN<))z!#sRBMzJaIi%!q+*y@<l@<%p|p
zp$LedE2gJk>`#?Vyu#JHthzr=WpybKcXQHB9&`WAkLDVizlRsP=ZC4fTYjoOY<!Bl
zC?;ionEA!|us}k5&+~KKKl4kCQ`H6KCee=L=BFL;P3;|I@hPvR5pvbuH`OP&VNO52
zZBJI>vg-^tddHkxQxoCO65KP3EM1$9Km65sh<_?gyp}MC@Fq|I(mcfID(}C2z-}6Q
zrC><cT44+T{*^{8&rJ}YXqJ7#-2U#ow;w2>73cpTLD8ed9Gmk+Bp}wG5hB-BH|tJ)
z!_);543TR|oSk`4Giwd{PBg&28%Bau1Hezsz8d245_>Nr56teClNi%44yl>O?5`?e
zbo&qP`sV8TJw>m3hShe*%XdP|)z|J&S@uK}kDpW$O1hJaQXvFK=OUODeWbdm-3;h{
z#G~q)vi1FUgbH{5%FXv2iSXUyyI~Mvp|d9}t5>ZbeRpDQXm36H9bX*p1MqT3KjN1T
z<2s;@#mi^^l@!db8s7X+aRHJDCJP)6{I&y_G_x+xDVms?`7y*x?w>5p+|X5B7L%Kd
z%sDP}kX7euJO7I+d1z{&B=w5k_NieB@lBzxhbtcKRjOb+AXjkzAZAOn{tE{0C>8hG
zxL^qFPS{<7iEi={O$23Tota>q9&H3`=DOLViFfIc5RcCL@If3f@qQmL#?Ux&HqQ5P
zCBhzXP0kw8cNt<@+iB7oFGL$rn%VI6mNM;>QOi{21<e&L?c=6VhDKno-(#}O!z&$X
zcaN#~i}c@ns^rH2dfQ`xMC}0Hqw|)8&jGC+k46^2O=X_vZx%H@Fb}<e1d5xH1m0KO
zA5(y+=Uq<4^LzYJ$g51meJr<1ARa!1b8_xF-BkE-oJZ_=FGKwGa)S32Z9*_m)+(k4
zk9QJ~={*k!*E_2D+qqLSc6uvdar<D;OMQRB75U<xi4T37eSMrDe*Ln&b}D7oB>sUQ
z(Vu=K#Vj@|^27dKVSi#6-X%|fl<{y+x)tYw#4jR1(AVGcU$d7JJ{uBx*4Ow%4P{sT
zptES(exd*NYH*oHEG8UlMDQA7QbW+V8zA6|<5BLHV6--^-j;0f+QndlX$Y8b95n-=
z2Tovu&Z=h=ewcjNXGN-z#?`o$|HPsVQG~$#3I9o-D~bP=A)5qg6qg%g7!YEIyz@S-
ziIW6Kal~vfURIGPN}sgl^%eIpa^J7wB=@k_-HYIL^x#Kdc``-6aulWXkeBU4RO}vo
z6CGazEDCxgyoV%$CN8kUO!=eOZX{&W9&%}6-<<15Btj@IRB3bXM+R_yOR79DC&fbF
zlwQYnMc!h!)jm**N>pl|zhYvA{xM^WAq<o;JIZ<fcH7nd`;`2gh>c9CSUPn+-U|Pz
z%7^I5=bkQeJhsvSlQfg$`I9go_r0x~q#1PFre+Wv`Hv&I4^nW37n&<;zz_qF4eekA
zq#F)dDOQ`c$agRb*|zLry(irFbTH#MW<aXHO0}6FSpCQ4`}lbkQy)Csb3@d;#BaeD
zSNYCB4ux9~J<BU%QFI`!EhI4Y`xPhM>Wk87>8n5<a#|wjWqgeA4eiG)1lPA$nQiRi
zErHnNc1WDA_(#*#$Z}kvk2EXti4NIu3tRtVjz*8v=idQ=Omj}`b54|VPGWOT$sdUS
zDort-CVw|=*;O&Z=ucCso^bkuihc!SXt-Q&<l6OFC*{tzve&aHH7Nmb-RuPuwSidR
zAen+F14-n0r7UU>WG*||L>xb-ni+e8CEeOo1>RB9;6EdeVZ71Sj|TFs&bHamP~%f?
zfOFMXO;YE;$Ko%SYe-JppLBCZJ_*7*I1{aaU2Q^Lr;!fwF}uS)wZb?!<F0`1Z9>PV
zk#zDfyF)*<qB%gt8v7>Y9h_5y4>yv4C?5|g-Fl>NUW1O;Lyy-ZkHreG+s!pios=-U
zrAur1B6Mdl1~aV~E^L{SvaO2IpMHL1)3Wo@qK0nu7f9;zp|HaAqlMH8w%6`xngUT~
zSqyc#anca_V?t~3XxK72P7$;+1mY)kQN#LNef0@(v<buJ^Uy^U2=|kx9G?wqYLRFv
zX;JJE`qd?MHQH-6G))7dzZV*tI(*g@!C9aRbB8g_IqFx@2rpK!IJiMO!R&tws_mw!
zq(&i^C-#W=$R-wFctMKui6ZP5j4A!+C7brzhGoxF;@$AGFH7a~U+V1UF@0I|=zC<!
zIzFZt%cxk?k$PE<|8x_sZv7YsGF#m4JfZ8Us7&9~(qv7awb(AJv`vnpb>ML+?vgZ{
zDM@H;EGzO`VJ*^MaZ?v@K(YmXN_JEHt@@>eoyL5YC@I>uCMnZ4c67UO$iiU-ub%OY
zzrU27(RbFEnYy^^b6hDqz4c65veT?~LhkGa!EcGIrB_;)zR)i*DKVTkQM>1{poXVy
zxiZd-eec6q%*Q7)dPk75&!d!I^7>C+CtO|wI)#YEf1ZEdiKmAQT*?f0IreWn>%3Ym
z^~u~^gxxO44!1E5x0|Mi$n#?bJ`+1daBRRCQ3P=W5Vw1gySWg#U3eUB-;K66Qtnb_
zTu7~O)N?urJP0~qw<R^Fiz=>;BsAWUYOElC4Q_n-YPJH)By>ijA%2FV!F(oNqL*bs
zKq{TRY=r&h49Oh_-gfL|3i4ogaULGO<Po~jR2I8t{jpOkOY*?WIwauxXKPcyJ1vtd
zjqi`D>;{{4NXPe2XIe&QG^!CIeV%SvDaRmA3?fz?ys8!lChDCwqlmTy9T0=tFhxCs
z4g|n$$f9?_2e4341YqD;lp7Nq=z)2AY-WU)H+H>xGWnb)!j0LbxPgIbU3Pn>Q2ybX
zM4eqMZB8YgesUH)QROJQS3?vIl)fzLYXP*r>b(L^%@5}eokziFQU!g4QImx!N08Kl
z`GW*AkC3Miqe&h_mXvt(3s)`CP?8vkVpFP;_o8=NjUwp)^M@U#2|n)@W)3%~9ZpRE
z<`_#-4CW6t4CYT5w~Oc?j}rvpw4w887(R-iFEG>cFg`><U*M;8VaSjrcVKPcV7gEw
zIpts;V;(IUbo2+APyFf?a-}PeT%&pYsiIYLRg-1`#S+VYIqa3WY?Tx!tLYADD}b6#
zOByF3m(m&<)FW1f<?DG`Z%fy)j<9SY)lq4uF6z3L`X%h52s}ESPFfe~q1pV^1<4l6
z_e-j!D%5cmVZE8O-2vTgRb<)$k_0?jmEXK(;}P{2A<gZ^cQ-vx?{xy&5U$lY5wfKW
zQAKevV8g6_HW5MiP7Sw;Yw|>}6bHA;ZSsV%G}Zgji=+SJ{TcoR#oUMnU91>E@Buma
zfyj#k9z+OkLlc#N1G$4AP`v_>fFixF0&t)`=IsYHYSkY^zJhQdK<||R^ci0CEvc11
zECparH@}dfaK=wG<M%7oO@D`uenCbK+;%A=DtCRMIcX*_v#+NSMzTP_Sj~^hV5Lk4
zWq?&>0V^N@XL>b|ygtIJ&ZCHKis6Dr9=)=x>T+ekWyqp8!KJWJJ_H~E*cM52^4<Lu
z+K2$W?VV+T1I@p`izc<|D%-6M0&t^u7TN0&PE`U-3L_dCY>fiNKm?WsALxO-Ip9Ed
zs)MdysX-}hw+$$w$-xJR;7mACPB@TKFE6E+6%6PrI1^D6J;?eS0+1SbNV?rRWgXSX
zb}NIBM+no17o-h4{Tt?*2*w+B6j?F=MiD;G-C{TE7cP*tS`2quAxDzhvaXa41`+1a
z2xbLIQV#~<Vc`@hPYkA!IOrC3nifVF5B6|`8BVwg|ImxbmkDkf6-F3UvJ~c!4<-jO
z?+WIc5yl86FBZm)G^qLuO#7>hq_sPo(S(^qJd7KDkR$9gCyX0;Pyk|{1k527%sO%&
zGR!qLY364-n3roA$pbeyBam6oG}7N%eCdeLR-SAIrcg!~Qb%?1LYlHPTxmP&!K8gs
zmm-ZXa4?LrFpm$>K~pCPk7BVeJaB44Fdwlc31R-w!Du1n9m8nC2id`?vBTKGNV4Dt
zIa<IQB?Ry9!XAdG<nijA%C_H(q_N$yYH41`r~X_BT0v4<g|icpJcIdT1k=Qt=K()=
z9<)NN_LR6x3NM{&CPh~0yzyIgE*Nlf&_$3BzctAPzk$IE{{I2GF4B#HZqk6{7VIoi
zs8t56Q^fxbADtq4EYP3S9lMsjZMvLp)_0UF>(aH5$5T;4Ers|_&}<e`rz<P+^mL>f
zeDd_VrYps5v?cgX^m*vaDKk^+xWCs9Mz)-tG5Zufs0f_TqnIN)W{^4$OazfzA+2%o
z(ir@ggCjCw1tu_BO|2;4KKKnxyvVyU|2_at?2N&K?jF6`t?MMz+~+kKmh8)49{(?%
z&N`}%C+ho1fdZwpXz|eE?ph!~ad(FTffjdZ@U}ql;10zD2^QR2G`LI9;ts{7$jk3}
zp7Z{Z+&yPzclO-<%y(yZcJ3{(C!Qjp)y+U}n0wLKWBZF!2-CTm!Zm6**u)Wg(Te{M
zS>{tw^x)Vt1LRQjv7&u1A-zhl=1Ts^{Y6CYsaHVEICs>&Qu59AbL$)OkL?6QKEXEz
zAKUSVu0n3md8D3gDg3%ii$*el^ow~X3?DeDu3DqT*$EqkJ+JQ7>e@Ss)H3^tWQ(I3
z`IZ=%_#?Y*$N-!C>xy+lGKJo@mJ{#!b36xBG3M7mwzjOQnSO;U0r~0wqK-z|$|XGb
z+0k`vg3B;8_0Y@2fYaDeF*H5$pL^)K*1`5<mRk=G9~ySW#av7*Y^yuUVrN#~o?H0+
zcd2R6>xh4PqfgNW&l79<q1(FvX%yvcU%sv35C71t_IUENTg&a2pt!M+f?#_AO$nU;
z4#=UY_N+_^C`bV{M=P@f3cl-fx?LtN7Yf>;f=nXj{L1cqq+}jBpG_Eqc)o^kVNc8k
zds0BSa3)BB%|wbimQe7=x)TLsrz5HHJHMY)SC-$87SJ@Q(CvwVPS{W%G-Wg>8n6vt
za{<ks9C#SR^GFLi6L`J;oRx?V>|bac`jcBX;f6k9^p53RB)MfO99IGNT?*J#-#@(d
z#6Xx}NxID7#i6!JX=CEO2eHy#R?kD-Xm$G|S6|qh%j4`=wPYVLp<_=+)UK~WMM$cl
zTIP>_mfI+`SHk5s<f5i*3A{&uX(CamtYrc);VYLBDd#0c?TnkY$QgqY^1W;VpGN#z
zdWq7vp_;;gt?j~3TcUgdXZU<<XRSX-R8-^go_`ahmtTDQ+GJ`v8XckVh5jFN5RwZ6
zWdQWXMRH-Hgn^fw5Hobdaqs~fB!Cbk^*P}_og5K#7JeWGxqk){4n80UwBUjof)9is
zOXvuTkON^r3+(A*L~|tVHX%v^&_W0z3_0Ki_&oy!VW3ukmxPded{A6JwC+RV!SQ=Y
zlVUrhT##tin3%P7Muuo+UTMOZowa>No)Yc_xpc@b+%`^mVYZLK*T965`a*Ag8V*N;
zkUm2g0@z=G+<^Mek!vCF=MYjX#4~`(6vIDZZcx}AJ^M=#V=$Zql8lZ30oVyZHX(3o
zNHPur52&w|c;IG^jJ}c8$3m827<mC;SRlb*I1^+V8zBbNCr9p~8wGG8tQfdK#dq`$
z&p@oenP<ohOd}nD12%{=7|sZ(!$8acXXF#3`|;C7gOKx>MmT`|XCSi>I6uS-9pMa|
zp+SPtj5GlIMM}0v{B*`3<SmAg6o3j1q=AkC0;ryWzJ)kGhY(;PN<tjdn9_N<K{I#s
zROq00A&w-F7<9xq@RAxLK?t%AaioUC;2>}_K*g;P)M>aQAEXTp#EpR(1PYNN%`p&m
zz)L)c8V-U2D5R4(lts?x_W&72M>GM2=#b`E2rOXzD<l~@$_ikD0jfktX{+(6m?Nog
zWb0obQ!r7=022ZbEcieT;D?V~#zyD@&d|~g5{EL#`93{BiqMV3AU0?yF~Hz6L>;i6
z7Ab^=k_Rk217!;KJ3d{Evv5ath#Qaz4J8D?M?<v$Q?Nh_AqNtG1$2<OVE@4vdXG&)
z6fIx@A9Rd~LI?aqLtbK{qygg3Ky(-=OMrO3($<rI#DkEM=m?FFgEx?DG{k7|fe0k~
z8A1o>O^F;qLm8>@eKJSppN1dc1H=hI<iQ6HfR^VV3v?7C;2$=!9SboC^p;DE9>zEF
zeE1(o(NJ-~OMZwM4k9=B02{LO3}FJi#D^@+FnDZ+!hsKvdu)(T$N?e14-Iq`d>{#t
zc!p2_UNS@Ou|Po%2~B4*`aD5MTH;wT8N5n<$agQ>gxV3s$V&cr?0t^HdolLirV;tD
zikd{Ned-L5)))GyesY8t7r+D4NC47<W`qu4e-5e!lHq_tgW)`o9)|?E?NAP(AS6*R
z$7^IlFq{EGii02m>f<33Lf``bQHsa_VV%m5rAmQFgW+!>de{hi;Qt2{9V8e6CxcAS
zFtDeQBV?Y?B}DFF8p#42UVvhPIk1o!X#Y#+a0on<$w<{4iMLH?<N$EM1RVy$-$Ckd
z5HEo<xJWTfBXYn#9%xCR-|9?;ELRF75dtTNT%aQ!fHUOCTXYl}fa*EuTkruZfC{ce
zmP(Fzdn0=(03pCctO74NATel&c%Tp-QXUiK0TjYU=FBp%Cy^uaZ)AmNkxvvb05UN^
zi6IAA0KeDBVhofD@RARrHp#%AMUMD>N1urf;tz2Yf(&CKM1ex&$Sq712EgPws1gJ9
zRt<683SrzLL^%NKNs!BE2vXqxM-&U>f`PIJ_^Bkq70r>6n}q2&$X4JM4nh!^f(_aQ
zrl5n;f%Rm_8FUm_4UzwaUS)s|p$4p{KrW;6(IV?HC~!a+5Uk(>Gr$5i=;^To_X|CH
zjuc2d*pV4>h>ZvU*5e>AF;M@2m*|i~90VrNTQia4sZ%mOLB|83K}W=e9I!wFFhIE&
zC|<z77syyl6fQu#R7s!XsnU}ezJO$7Av}PWjF13y(00fH2E^<cqVj)8EmTT*a*_6p
ztTzR+0u7}HXu$@pV4?_tm+$_M&`*GtJSF}2+@Ss^XFp+z{hy5b0R9mmk1$YlKyO0i
z5he-~;0IOGf6EOjdTNdv@U#H@ff09~0^p|_S;<`Z8;oh!v8)KL5RT8=9|lc<qnM2P
zTOr9$TwZvu86N{eXKR3DatSjn!9xU~aiBgL5)Z@Z1*FG5A$b7b2=%0xFF+?ieG+6O
zx)BD15yOb+{}3fYD%&M6Zim86AO43^pgt{<4c!O}0DBHf4uRuA^sxRz)hrS2X^tFt
z!j2OFBLI1Yz|kSon21~8%qt`%x)B~k5F5di0kS!j(WejkPfhUw4p<<k5V#<u4jthQ
zoS{XEp&2Ov_6wEtg}6baXW?*mh!-Y;7C1wN1Y;O+1NJdN0U_|GeCjv|^bFAE(}7rn
zkU1EL-#{S}WDfd&O8N#ufP;7q6e2?AU?H@gDm``NCw=ZkL!AMIULu(=P`-dnG*Dvj
z|Ej1?@PV8f0`ChwEI|syjfoNfWWEH|1Uq6whMyr&Kp`CD76$4)AhS|Q|A_^?C%@|f
zOrC*Mf)Bg^egw!A3>4M>F^UH;DOD$PV%IM<v`L4*LE_H;jqH2biXX(2&lB~A0!s<D
zqhYKUG+}?6s6U%q8}?8rc)?s=#Lrqy3d?@Q$z-#J|Jq?}<E9~I{DiKt>_WJ=vFz%=
zg>A0+Q;<hAOn&r%>|~bhVZM9iGb@{MWK_z#L+w8hj1rP6-inM@jbD4@T8bK3SbwB^
z#n9H&#Iq^{=;N&w{)CW_yu@BGtFtn#^J&?0^qD5O*W&Kg3u=J<_BQBxWAN@IF6oVd
z^@(=k8v~t_I9sC%<9}47_rIq7TVSEQjCni8+AM?9Z_)FK?PVf!&M0gr*E7di-KlE7
z3;l4bBcjTyn|tomE&rKaNM_;VyC16hC$mfs^F0>f*ZU+vMkm6V?b#nzm=w8tNnZuw
zM|SY8xxlaS{~Uh%vlfIG)p4@s^7^C!dYuV)V2bSM>0V(tX=uDQk-6h!eMpIP^9lwS
z;VG*~Q?RnIV{I1xY$ef!e2vuBRKjCZktSt@vSCdZ{%j_hf_%-;)>I)eH@VfIIg#?}
zSpl!P1e`R4TrX%UPd$IAS(@hUomM)i9m$hw?rv<3q*>tXoi@8GP>6<=_?8+(!y2v?
zaybn8GzqVUk5=2qx@bHuT&<hJ|3yeFS{$sRTM-hH`1wNSy1t#xbn#Y{6mrqNIk4hY
zuM4*}{r1g_<6%1jY-nGTpbZHM;J_PQ>RGF_Csa|QihQ(VcqsmH|DK^&Q1_s@#M-p0
zTPi2Qjexwx=R>qZ;dNgPZ-v%c(Kv6#cDGb7s449G?aj?WU?A=77sZOeBlfE^!|Gh|
zANMahtV)b~q>3bq&Jntn(-9mG@;e|qO4vm;17LL0@J@{^NF}Pnrh5gk<|2C1(0Xkm
zeOJ!%pidOU9@U}Oy;8R3B6!l!e9eAUdJTiA6e&^76x<h3MRllkuN1Gj@Sij^T`$Po
zIk7&}69t(>bvSje)UUaSpER^xFG$}VvOIVb1&K#>n02pIthorEG_+hV$le{YK3oz7
z`9*aEbdL*h^$MC(1BqpVRHNP0h;UFFZ)Wk==ya@1xg%4HdmGJ(9(_dz1-S&~i*4fS
z?Re&UHz}QHHped`Mdpj63Y@|k%Z5n87dYJX(wB5vzl`j%F2CQtocgkT?SiRJ2|CgK
zOXorjmd|R<x(kxn*wFjXuB9j)Ng|N)l}UR{7cWCe+Jp5oJr-xt&t#I?l&?bCWBPdW
zO41{*7LPK>*E6_d!?5zC$ezxFRADIp&8*c)93yYVY`2PvwP|HkP;2~V205kJAR>H(
z?~T}*J3)5-e4N?f<AU{UWX_|Dq&KU6Me-N`W@YLU84Z&SY9(C<n>dC~y-8KL>!Mme
zjYz%Ytq?egJLi}!)BFbScZLW))pi#|KGKZlQRMZF4vo<{$d2ai%RK#_EY*{xsxhU=
z6Pim}!p{8pGzI2VHCoryaS`w-$QtgT((q7hI6LEfKU~e#ZW5#dXCHG)by)D$R*Gj)
zQ9aK|`&^RtxgiNE&l7K?Tx+0u-tL*Fe~Hz?*R0Mn&rr0&EjNuXZ{)5``;7JFuC{en
zGi$7Uc!Ag-=u>QD{Mfy)0`MQGxkwpd>|S^QHp~3EZ2aYO=gE?D2FkDabYTTKzqPvD
zrk;oXijxb;jl_tHz=%_ckl$50&jMS-cDeVhLvcmy`C>D^78I{RQ{AT6MeMO-GeQe&
z*P%@!_L8y2KMKfJp^PH-tg&EB1<pP#cDJcakv&f8<j8_n5jFya^50qxZd2IQbrcFt
zzqP1iiCm{zMA+~Z+QJLG*Pu%x_H?ngXbOjYS~#v#($p99v0`5fBzv`T*PzxSdm^!7
z5e4e&&{4N3a*;iir+Le_dxazyYIB^cKS=^8N?N}TwnP>L{?eLtn<Ak0;`d9A^vVt^
zo9hWZfP0>hsXs>P->$gcwxCps%+#I8$@@JfHdowYrCg^ZIP<RDZgC=^XWCP;S$nTz
zZ*^40EJW^CjCUV<cInuismZ%zAC-sPlpGUXdOp0srJ^z@{4CFStY>5XP1)lSU?!B$
z#>=#)2;vYaO3s;(kE>tDpvL=p-&A&0kQ7|B$Y*UPr9^Jl2o#QG3ofv7)#Zp~`(A(t
z6WAiyb#J}geB1adKb{hx1w)Tq#YlA5qfdHBG2C!sRl=34uqc8i#CtG0#1%|5ve~%l
zexcUGRnYsbrRS#WMXmR3-f&{W+CD!ysWdbSTCf9YvG*v;c{^TNI|Hr!q%T}Jx+f2|
z^@{X%`D1`ttW;4SpHd`MsG_z@YFAvsnxSAHNk-CiRiwhX>u$1Z7d$ghForD*G`WbZ
zEifo-%Zc>-F@;8>mvNGZNK!wi^qiT*GONwZXLpWt2A54`n-|eO8J!m8Yl8UQazU?u
zYo$>Zbm<RZdm&(pEv8%bH`l3;)PlN2re7!w+5;X~<yIRsY(>-siAum^3Nf8p1@D%O
zdOt52<@902#_0a>Eyp;4vGZ$b{aLY!4f-a!$Y2Ov05E1GB_f@)84xVQZ9kdEqcS2K
zwewTm3Be8L;1SiXy4={~{2CG>L#<9xt*<6YuQ(Yqvd@BdxZYd_BZq#wZ*6{PvMz#R
zB_*pmZy9tkm78(}mfEKLakntw_MvDqz56;0FVuMEL%(~<h85`Fm?TU}V5sZ(*nM!P
zq@6I`IPX$wATH>rn4>3DuON|Y;FtV&+yt}Zj(^v8)0m3FU1FpTUBOAe@=;vmLf=$0
zM>{zBv;vG;s9nH@k)|Dr>`8cyi%-cNPm#6Z5B_e(vn7n3Cl`8(13Lb%F8maI?@s~@
z43Yfs(sGq9tSE_YAog?e!|OIrIJ%{zmL&_L*+Y`~n3m~S^+D3aY3@DH)pS&60@w79
z(tG()sL%bj$c3os))#6o^weE0PP1m{cE~DwGByXh*#o7@9kxOMOmdN%J>}b}eR5;I
z#NUoCqK-Z-!*|`LT~GZ)_7U!G0fV+yE_L5jA$~N)6a@BYb+A9vC;J4_>nU$;PEyRn
z==4eW2QGt;p@kkX#!V^w$vrRq>IGD7e91Cnrt@^~ZN96_p$&qg*0J;7%21-P<@=CA
z(9dBT@lHH!O#X`BeSa68K%IHQxry^k4Ff<``SjMVW%V7uLv^g3;^-+Adj3S?O~<xW
zkm$WBi8QFqpC7PgiNs=p$}+4?_2@R|wR<*w-<z;xDdkh6jJ(k){7_Vjqs<477EF>B
zwOUdmIqTIV8>W&K_1eIj`eF_JVUo`mTUPdF`(M`$42EBxr)Ea1(%B4<b)we8iAw;-
zXTZ=$CN+yjGnG<xcGSY^#KM@G@FKk$UiCB(;XAxzv@4GPKx?hcI1*U*f%AevTWj$9
zulb4Je}(O3{SJ-B<IP_^L_6)sG(9#XaCsGwPtcH0@E@R8XOk>NnFC!+ffn<_1547)
za~c8ESF^Nzm;y&3VIh_@D@sWyxs!ZL%^e{b{u|bdffv#aEv?=!^+wMGobf}sp0RPt
z6Bz6|HD$bW6;xoGX?I2u%*zf<t0<p38kY1Y(-fJbwq0#JY8jHSKEuIU>$T!9gBFE9
z5=2-M#dfazBjEnSQiL1ax}h5Lp3=OxshAbp&{1UF)63sc_+wh>bVAL=`>LUFXB|iP
zk7;y5(nSVjT{03ARU_S1Z-mFRCFI&d&Ny{C$}7io3L`TZr^sNnlqPw$zefd+B(?LW
z=P{~6ztbl#&zW=D(NoiLjl@xL%4$5xdAnERIe}%AtQ0F)$M77D6^t)Ixv%@e)Nnvr
z+Y?R7mQ{_f&?m4<=t4TaNOHE`;cCk7Jag)$=~cF+7afP(@r*I%C3Mz-+l;54l-K`N
zpfzqxHYQk%nkxFu%T-?24{iB$>r=Vk1w#v8^HCRF9r23oermMp>%x1(CYM`C?utk5
zYFt!P#BCJDAGxr`qt)r^mQBa1eyF9LUo&sxUm=lG6&khLN?S^<dvtQTza?i1?^I^;
zT<9o-oM+7kUz3r0Q7BjzMW8z<zL@<xcWpHKvwQDV7pKHc5+2c)yv71a_n_$`Hpc+#
z>+E*Ll}VijoJMEDiw(c;3u_t@H&ymMe}!W^<pt&Cy=Vj}^{6I4PdKU;Pz+W>2dm2l
ztL+AV+w#eWH&d5b#lGj3tDfJqhEcqmDR@)hN+MLqOV&-AsHfTchDL+8*Kk<y_nUA=
zs{(3k%Zr(aS)GWt^M|3N@8#h=ykt6+ABc+LdzDfn9iq5GHj_HF`bF?e*56bM##U3u
zc4CY5;)&qxJ4eq&_x+d_m3Ks0cc)17+Kb>({d?oUM(b9cGHs}$G5a*QcobuMyFqVm
z5ceETJ0RG-&rTbVWUO!f&9s22A!T|_GhU_CMo_5pFzKtlg*E?0PbrrA5>YD3Sh}L#
zpQ@T5Hs1EzJACIj9UskH9hy4vm-`{n*}R4Z68Ez-+g*ON(R2Ada|&&j0n?dzx%uh>
z9&fFKE?P06SKjMDiEKf|7U|qh|8H(xFQzAdYOMP!$BaE=Wm9-ZvY%6^KlR*{-I3e6
z`;xDBTx3twG@KVq`O;+IO`laKE;usd`<bOz+-sL(9`&L{OLGWU+jpJyY`R`Mwy31S
zH+=2+JJIAVHbF5XMb7-{1`PQQ8`1oo*wFVhwrhB+G>pAXjb3CQ$Zpt1iZl-zEfVrm
zHaO0ANN2AzZlg_<alkaQk_syYn#k`*dSC&`UcGt#bG0(G8}&NlxZsA`V_g?(sP1B;
z<VCM?S1IWh?~$FhZkWCSs4TTTWtr6Q!dlmORxy%%UA_mXjW_&-UC3FcoH*qpe;bDH
zVC-vHOtgRwH3i4diDQIeYfWDxfv~{L>(J>yoRNaL+w~kSIaXci3Mmg-l?_6QUWv%|
zOjgO1A${{@SoXhw!$n`&c&#2FbGIjt|G3vEDSlQZ^#z@Ms@oft`{xP)PlKc$0<dW&
z9aZ-m4J|Tn(F+PW`(2wwU;Thr*#%OR{(0N=p0p~r+8XWnksqcM(xbr2TGbu6$sva>
z(W$N^GtVh1|I9p?x7AfsBCiYH?$wfn3do)Yn?Rp6N9?=flY5zHX!*Em&1Lldr~~%4
zh~OQ!@T~<H^!hz*)$>XI(lW#W-I<J@-;r<oMJo&Qir~Q<ROg=cfO@oqs6+Mmm~dj<
z*I4vlGa4ynE>d0z>m=>H5R%hz;bwv-@%CtjRi9ITjGR27{>WB%^Yj<Z*ju2^SGw>k
zEpl~A$<lSg9H@g^Ue8v_m8a|NHZhR6WZb{^WdOSQJCc}qcwSE3Oj-lqV9In-)iBkn
zOm%lsZlb7cFS%5{pV2Nyb-E6wDGS?lC~L54w8m_DJD1R_8?N2JI8g*P?%apry8y|T
zU*Wrac-^ksJZ0D>YG(okjjPpV)=;$Ba=H#1ul0}1n>mVSHA`HmyJ#QDXt&H}RLyr!
zrN7(?lx<#2p3ys1oBYsF$?IjXy{j}DQpa8_ndTo1Zu;iBM=ef%7rI#ZmyZ4^Gv1WY
zHBut_&{VanYV7siw|%25<0b8$!dl(<oPJg7DIKXwv#aXHBepH}qs@s;Tw{LEe6SqT
z_&;(7QB`iJ?#Cieqo#CbA%%DG``Nt$q{**S{xE{Qs=juAH?vN&g<6kj+qoEV=sTxv
z{aMZ>FTKQf%?V{I7cy*aRfH{&!Ol4H8YUgm-hIM<t?!YRvfCugHA@R)hhl8>WhR54
zL3gxd;)Lg@e%J{*@919io~}(vlE%9zr%u*3Gn$!AP=XskAHS+5%O{)Cr_I>ueQX0`
z35~H=y*Btrycx!h(oL&pDMn;eckI$MGr*O2wFFq{mC*4bT7BD9xPz#;a&3RSD_O2s
z);_k2vv-WPo(~NlH<#eNkQ})}_Zn$sG<*Nk+|JR^x-(3W$*YT!SP0G=Afv?DK|wQZ
zE*Mujc%v%5?RJsHOu{a|Q!2%A#d_E|eZ`Spd+4Z|3)_BA-ef%YqR*37_)5-;!eV_Y
z)qV8q*ek7-Hc+!_uJD{(%x;<0E4Czyym=NimkrS`YT|ufhpZRG6`cgCcTr;VG+C7F
z2C6=8W&h?c0)stRgx~gGeV2Nj?SJJ{qKx~XeT?duR?uK+7`S|UgGjdpz9V%O`oOUm
z9WaolCNe;@deiGToh4}tFX3Gf%-J1Qw%~u7q_Qp9`pH*g$h4dSiq&^%`zj*nEpHt=
zxrRKEE@%%Jf^S90Z~e;oJR}er!%>|^8=*8$6lER3Sj(cq3RXGP8i5}s_C}X~9I}~a
z9o)}@|Kxm4)tg2d`&N&WY<P~V7hV<R=2rxz6ww>5x-bAQ2+z*&&zzVu)pX|f92yLU
zU-75!RyYnt5~v{DGMbbOmHUO0npnAN(sP;x`fiMO?EdOEvYPD2&teZcL`8Mhb8N+m
zl<~)Qwi^%m3MVu%#}2sV%A~6VTtpuP&cADsN>Q3@Koa5X#Y3Ikt$LZ5ZA1Gb;3>R>
z<C6=rZdw}bwu;U!OzvMT_oA-<Dt@Upi!>@-jz=ezXF<?3-iTf>>AfjvoFpZDoUk2z
z!5ZKBMy@_h2zIQ+7pLPoCOMYg2iwkuE`9Noi=%MS<J0(E4&?oWOZqnf9Ah5)fnQDH
zn0;Pga#z4NG4Tsi0KKknn3hFcwJ|b!T4w8Jj|AV%-toc8Jm376cGj&Ib)9KjaI(k+
zo7|(ax8Bw?*cj7=hp!_>WwxdX8SO)qKIvLMv%`wFuRoODczywnod0n)Ud!N6q+&9)
z-7UU%U#;h7>T&KCbKjSN`E;XAPqQ;O+sHWRF7*jjN*ydZWJzGJH)y*Hh_`+GxA$dw
zNO2<zXQ%wTSyNh<Srf8GN<mh}k6ysqkBDDCD=n^U_K`n}vZYoqw?}L4TO<XHbO;<R
zF~rv5C*$<P=PIoOk6ZuYuEV@F&nbz>(t^#lHM!4U?;?yt%KQPSfaKg)F#YQ#*FM>V
zmtrB~vcr09Td1w;jlIc*Mdg<kROE_NC-mDivxuQ%pY_&!!~F;*Snb&GDX{SE4$UUZ
z4ZAk0Z%`b?@p1JlYMUpqCa~lU?~n8HuwuljemTJ&*^~dR`)eH`nIogsZzg)O*8ASC
z4J(F!FRAb^9j$)%(xrSA!DD~JF}F~TbzE2dr%i~=@y=4~Bq5=ti6ry$;<2(8u2>4G
z3a>;c^J-@ld&*+g>ug3djv@tjyK<s|?`AJ<pW&OQ<TP<^o<E2FG?VW+@Kf4B2oQ7X
zos*cWaSG4S8&<i66>-Iu#T8UphB9I)SXMHo*haogq>eW-W--QGdB^E#P)#OLVZ~Wq
zdgX$@oMUANb0<z@AJ@7dbHqJcVe7~?7TYhiAP3)9as8T5YYCK?+Mm_A$QzhY(V+2j
zSYGA~*txzxCt1pkl|ox5oa&`3jMeb4e>+G4FNu|{Jqe#U3EySCr4W;p{PE-qJhC3=
zREXvQ-c0`D;adqh<D6NYIyaFOUk=y&oct<g;z5w<Z4@{XjJw^1O+}V048HLi;L|CR
zy;4s7R2r9x0`EZ&OS}1mKY4{+a4Qhlr-w^#Z6gyWnpbrEU(B;Ig7q}=d%#3(#mwXT
zEaT2upVM<bu=D(7d*40fU96kL)lt5bE?`2?#4iCB(^;T^haSC{S?dGMNx`w`URwWV
z!&aGFCTn<6FP-UEAa=zhv6xxc<l(^JF3wUnb|}a(XWm70#3RSoRsDP~nQ*7{u4O)X
zrC9HV1H4&HWise@9*fFb;uWv^9_}CqTAhn8w;^oXytGSxkZkj8ZRkZv!9DxKdfkCk
zhd)#P%6hI|d(sWA@~lqWd`^k0Renq}7hBG-z9A`B{YT24*h)e-o%r0(w>k@Hrr>L>
zIi=+mruo@PoH&fF!!nB?Dn+$`Qy}v-g@Aul9CZw-SPJ(vT~d;X`)7Lr{E7K7rWM9y
z>9?sN$zmxkyQ5bI=ZgPc3h(Jj+>mg&+t5_W$!R2s(|Kn&XqClod`ifjrlR;4R{hbS
ziR^%F_UoYrhp$H*mdjD~pX~Q!tqOgoKO{FF^9g%8JP6Mh6Hn-FKNjw|(}pK=QCu5S
z#7vZ9+wbbb|5k@(+b|qQ)*C|=^)n{PnhvN-I7Q<en^vUYhL6^I^I1?D{m(X}a#0bB
zNgs}?D1$iU6!!Z~AUVQhoA)H!G5CW|b1%JMfWv#|_YIzZ^90d{H67kE)_D?Em$hhD
zGqKL=I0YKlWtSPMKuuHRk_zKE4}5wuRNHP$2BC?iCb@<e&}jH(UH??H4(K&$U9m2s
zn9${_RXI@@XZc6{0rLV)`ss@*JHLavnJHUXQICG+NSKC6-As{>-8DVDNx4#kyA7R7
zVn|uu+@hRy53{&B<&Uclr4f%L<_u;1z2dT{ty7*JxUpA_i-u~%&_rjCn-DLuBlVTB
z_{B;7_9CML&f!V^-0?=r-JT*B`$$BbOTtnM>9G%jO~BiE7nW4$N~Uq-K8WZN5^5?c
zA!WbBw>~T?X$;JWs8Eimk{l9KWLzN}@SnTvxvkCdziu_%=Ler!_9T0K&+(sgi@Gp+
zdNgVu6f@S4JlLNVlYcVDJ!1MAlK!2QUae16IIFz!bNmh0ZL{IbbVB3R>f?#Wa#=2A
zPesx(7d8?%f8$kW49+()W6y@i5(&jit4Agh2~92xw|Dx(+bB%7cl*ONjOw|b%IJC=
z1N5F6U_vz;J~aTXAw6cU;TmpNd6taUv{C@aTPPf}F6x{_zy+!%;wlhp1u!`K&egVF
z;}G>H@g(tW`(~iy7$`uTqsUVoI$faGoN6xS{nPOxTxw;~Tyml_t*A{zAD&vvMso%V
z_305?B*haJM`(8`uW;M;{Of_Q2BvLR%zYj7SAbR5PhhR_*OdEv4;Wr)<SRDulg!Is
zah`NKEk-U(xm#!Fk-A{vvnCe?aL<@Ea{5ftdCQ2BC>S@{xM!3msdi}GPy7Stv`UTz
zp3ZByc=%5=TmULA!<+p0eH%ZhAHH<(x_I4e=+BUne6)ZnL);Gq7&QB<s$75aT%E%k
z1iw{n1YKE46zSdCfp<T-?tUWurZ;>vUv{{Hij3)mUmJ4nV@bTjG6^v1==??n!z`b(
zh|`N>8;cy3ZeSzqOjuE_*tKKyf0;t+!dk<2&;g<up!4-=B%Rq#m`){SzlMue<b12Q
zv~)NyTl7>ek#H{!f{q^fC8@ZhuIl=_F>jxDZx@+7b`M|1HP7|2)WtxH>qBApg|l3l
zT7AeWR^gvYu;O7jb1v5GSQ#^2Jz)(>kL=AZ4+YiX4tr^~6Pz}JYnZFn@*RI>Cvqs8
zMQ*&lqCfdpuWh|+Prd+~6EC<dN^Q(>?%6Pzh8fIBZoIK!bGakM537z*yRVWUH`f{e
z>;r=fyefH&ExUrR)-pMd^HW#GXLD9b<_$@`34P=E4a@7ZFcUG-Iej5_(YeGLf_)rW
z4cZ_TT$1^AO$&W3idy%VUfZ(u_F#Ewg4^e1rOYmzhv*u!x2UR_QGJ6@EoUXi8{4h{
z36pn+GAzpNV}G@-L_iMtJD=**q=cMSWb18>WgA4>;;XFRW_I$%w{kDaYu$wo6y0zn
z3_8QYOS6S^{5XqWdNQ?Qj?Uond%dKBOlVowa~Wf_OkjC;VRVh?5^{c$(Cv*q-?7^-
zWy}i1PAABfw#65oNTii;y029(q1r}O@lAwjs5h`)Bu;e2`>uJDXuYRKg>8`0*}TH}
zW-5H3*Du7u(WYc%wkd6Ss?EnIj9y4yK-%2H5@pzcioDQlXN<$sC_LvQQ5MKp{$SYg
z+0Pudx9&RKHwlxZSN#c!`j`nVL7WGC5jqI&54#8!g0IzB9%egH21Jkk>>8S)45-<u
z>tPdI$l}RMu=up_zI>vK5GPT^B3Q-ZhXMbWnqalkcf=k1A5ddH*i<v|D6+{+>j?c&
zi^*n1A33M43aHc5TKiBw)rSwxCV7mGjAnCerl*;ftea$CRAA?>b!nzxHm+><?|w<L
z&4p_o{ftu5H@k@}F|^t0m9J+KP<&GkwfZgc`>rDp>I{6Q8|_AAwTi#;q(-OrI+l;*
zJ!KLWtknFaQs2i3?j7gGMvFC@`{@8q7;UHaw3VA-+ESUz^)cpD{!DE#YcSR+jXj*P
zg{hZ6QyuD6B({$ZGB&-r?R8d;J{QpawC%!yq9lI`7oJ`VWC*5m-X(!WSMn5Zs`_&d
zdFt#on1*>56McL@D^5Lwo|6&_%;!5A)vi5XF7m>QM_C-|&v#MsXE=<h0Wza$Ql%12
z>f=;;mjB2nfLVDZ@1t}A)isnFZfYzur7~qgnHPR7aE<X>7iFsr<1}nYtavN6_;lnA
z{uYy@@}{!sqLf&utMY5BwH&xC@Mf%ZFgRrfGY0jpxr}WhKcUZ)r1)z&v$8cLmW~ap
zr?{H<@hs)d;+tU12ToSZ9yglrmC0l_myH#dv(=94g$lvhYVRphwDq@HuYQ!NOSfuF
zUB<mto|r;SdqsF-syj_N0$b7%KNXo~y)Qie9N^jHl^Ia9bT&eom*)@n0Q0o41CBcJ
z17Gqo8usUhzJsN0KfT{+`Ns|3+s93(VO@$iMap>MIfi~VaPucEv(UP@EfxQT(1|9M
z9kx(ySzC=A-o&UD=J3NE_?y74cIL@NuFK}HH(2L1kwb0wk=46NUM{>QdEAy=<x^Lr
zf*;nNY6H8eb?Jzwcs;Pz+QrCwGv4jgvm!54AHT#v6kol)ZEnBJM@HgM9ZFY9ObI2d
z44XF_ds+|SOI|^9+*xNWD=q$%{`X|p#XEADyX>cDg!ivZ(^79RxTQ^q+pO+WpSQpF
zf$1P^MRB5nrH{l#XK}z~j_>n}8691VtjgTARn-adh3RYu)J4{|?W}i&O;F@AM3#rC
zp01X#KzPITX^%|9!*_1qq9=5wJVaLBh}FTrAtvvP`Zppm=ckS*=hZ6@5_jU#5aRy-
z@Xv+%wwqAZ>!+q~xc5sPVkx<<@JsGVZ|zCT81JKn#D#)tV7{WM!a8%GV8WNw5@;TE
zRDR~yuOcFQY{vBby`TDIhjJ>@{^mi{#guP^abidDCy_}~UvK!Y8f&Z^8j~7SmzU=$
zhn{hbl9;Nv_ZMfv2FpbLjv}0AbR?hpaC%T}U}F-$BgDE|tv5WZ=E+>viP+O{1twk|
z%zgD}{WiGimK4nIJUN-R;MRV1zM*rwkl^|J(rljCp0Gk-MgS!>_U;aiEH)rwfv{BS
z^5cENJx{=gz`_zqy7gQCd}cbyuHiskjdttCTM{qb&tbWmE;vqViT5Na9>!*|w<oUN
zPKi9?Lbx?S(xdbX@pGdv1KBun-j;fC-hXnp#u0?yYSz2{9GtfmdrM&3ULL!;8Jqyd
zYhtEiucGHkg+6JWdi+tl2-7{GOfebYo+tQ{xePIE13ePVs`WG&9^u_drv?)y)P&o`
z%4mqMwrDdR7Ts%HgpC(SBOc3_c+Lsn-mM|iwDlo+T)(6}^0-LXcy^$<vT{_UY|9_Y
zb1`$l+s{|_*#u!-%1-*>Y8p!iPlI9A_u+}lBH$PE)LhLZ@DleAr5y4JQbr2W7ZqdH
zWm`X{k0M3D64h4%3YLdpvT>dCd`~-EL*uuxZ1QHe)IAr^xk94YBT{%25IOk+fBY>6
z3ZcHN&H3Qj-Emq`HU}RwQn0mt7j$~}V$vGA^^-1g`&ZyB^_<ACR_e0N#l`bpTl?6s
z#$BCrlIdsL4$8Y!O=g)e9}|3u31fR76L#=7t2pPE^VqumUBLxy;0tl6fyEL|RsnHa
ziP+={i%e7V=K}BPNz<j>!;obCmj`0YubqKR1}$;4zXROd?*9TQewMKKf5?5Os>GN(
zw(}-`SzLCPAY>Rx9oYuglIx+!W+5;9eD``j;9CP+?60#fj?goYKN5v6GcvuKF4x_$
zH4XK82G{G@Bd+4anAq@CJF(PfQiSEiuc9o?00E`mt*UW3VSW+~+x27r8YU>p-<c{f
zl9L_zo5kjY+6)yp7$w~~3K#?=j26W4wC+z-2R|$p6@O0P<{n@aYp_hR<~0*pR^IjH
zRBbHWb!)BAyQMmxNL`&sogCL6!#9k;M~Z&qo~e^lZPA0{a>p(PC$aQ-a_pG1iHtE=
z<i$309`(2j%!rG!Tv{T&F2xrw_w5>&*UC#+U}sAa&$2J(WiAG1fxW(zi-j&|^?$9N
z^j4S?^+8<eDWvG{F6<U{gsZGb_suJDe<bJn*kEPq&rzIgIzdg`7rLR=Tdkmx-)8yY
zx84UndG~`p_miy;IQoX7?nC+Rm9+`V{duluN3n!-RCKEqF$wDBo-DOGr+xA`he_|7
zeilR;<>~T?vuv+7`6;IEED+Q9`sK^2tunmJnUN{X`c5wMKI-+fMu!K>v>M_MH;Ze6
zQjM$~ih)91oP>?Zry&cSVEA=w#CZbI_;4=u++BajwDL>1zWevmWErm}_(;TXHuXxW
z6t+K|e!D;Sope#(#zIhIb&@HJjx~U>W5U#+vQy)n?GA1hO7(`=59pz(zJ^a=;ZKx{
z$quESJ4|2q$vO#~8>?CmIeE3ME!JSrX0ds#lz41#Y716K<6<R=@ltwOXMMxafT><!
zKP#eE)-_}|b3n^H?5i|lSD^ly+1qo=bA#hW#r<l}ADy!-%VwGz_0^$rWPGtx1sSqU
ziuWpJz$n<<?0{&6qM$%3+Y+43(myvC5fhtr63M7o0hPH~dwN+;I$0*Zq=}3m2+hKi
zP}TjyT9%~W-+!KPvg$j+cdpJFwL4(hd}{3VTo^53KR9mCBkUi2;vI_!>|=;t-820H
ze0VHY*fB6E&tXk}=9G7<@L0&xDm0c~HIJB-Q_kV$jmJblv}ko;pVHM+Ar+ozbsnUq
z+A4&EkRrA$?aY%@&q#UdgGRn>qpPFEhGR^@XXQ-i3C1E5?mF=ne$&_Qx~vibpUCBs
z-cK}_;+MdTvJ8jU4wQ~V&G&4sW-w>M&C%hZZkPD5U=EvLT2{<mZEQ<cjnEiWR=8uy
znyKUksgSA}v7TOJZ$)3$=ngBFKP=btZ9VZmC`**KGl|>yw-A(@QInq`fm<q0oKHZn
zZ^DGI<<UL1Pm7p!a{!Aa%SUdS<itKo!^x|Mm3ej_>(E3(NYK43w{F{?HTr}03o(nC
zl#qLOQH$SNlhZw6c5X6*ZIN|aiX6+tJ6Q!>);Y>o${KwmH}i<98%QETmWN?qPi*w9
z6Gc?@i}~LHi0IkcFDdqeolNp0!Yu5`wSo&x9NSui%bR26%J-f?W;3ac?pylpvZ|zs
zUYhMap7AE-AQdy70NFfZ7Zy*jE~R#kh2#a7CU}9!C8DXmu0%0nqE`H^*>Ca(@S$#w
z#&tN$&%{Qw9~k){bi5YkhI7g7AzhbLuXAssxCI-`*!k}T^?z6#X*LT#H_0Thnm;bB
z7pmB2Vr&-skq@H63jWFinJ>pSheUfdZ}{FBXa)HE)N%6pX(|UlcDJg0P<IU5T#PEH
zvPt3pMEFy8{{Yot(bj8tys5j_R@h*%ZFzwq*;y)8e4bZm>ls)k7&J{N;z?T&r*jan
zQmSd!grlOxJUv+Cx0IkFRh~A61dcB$D0}L+40bgf_RFo`e^EcM8l<TBnQ+`;VK=Sv
zkg?Ux#=gzCsJF7my2m#XPHHf6+{wls;ODk>=r?kF@qU1n6N>0A$!4;8TV%nxE!gv8
z1?C@o7yn@Tg~niuSwLiC+aO~p`Mte!X{E*7yz*toE6P{%E%#YIowL`}1V38sMsL^y
z6jwdavO3mTHl^e8_uiMK`x4sGD?|LVMd)^v3a5TVz|?f9c(ufN<3XJJFQks*Gj`}q
zhx=F}ZCpttPvZqwSsY*Y7`rBsDp(SlbLjh5&uvBYgi9g}F?*Z4=6h*p#vPOPc&zQr
zn+t#UlZ{b-<d_MquHJLUD;?D0wZZGx`rMr_rlciTwUaNxMt@*u1op5!Nk^M_Z<7dB
zX*BI$n`-K`QehGr3QcW|$WohOYZGWY=W9GictYLJG5%tU)ql0Bf|jQ{%GKI>OFJ-S
z7Fghyr%#yhnTR?LCl#ESi`Uy%RE$cLFiK#WWJ`*H)F@4415C%09o+{v9LMnk$BQ|u
z9BB^Sj0{2^!x7`VltN?<bB6wVj8W5{IqFlbJgD6^E82XkvD8-*B<+nI8l0%g=@(Me
zQ7>mZ0_I#HlCm{4b;>3CONMYC>z1+co!DB#1H~u;ou1G?(;B}(yXv(d+_txb9EZd_
zMnz2|_anoXMUxj@p7*;5P^CP_Jenfvw)<tiiXWbePEK%Xb0f>h3kZ2Ct*=|Z=pbKh
zqavG}x38g3|F|zdKs@2}5)dZ=udQKU9!70X{R@22##u!{CY~b6<FR1K+M&|l$^3aZ
zD#G(*PF6}>l%r^4At5{e>8;N1WYb$+)2Gn9sfAjWUBiftA;XBiGHNJ=@f%xc!-MJo
zqtQ$Kz0hGXQrYscO`ZmeQ+6V8VgIk1%MOOkjO0<AO@{De>uLpV{na+}dbf`r=g!qf
z+f#cXbuJvsfBM+UtJGDr2D@07JbHE!nnq%h9}~?YqKu15SX$K}W-$d%>6OT+Y^x0~
zdcm$q<O-HjR~(Xdi9MOmP@c*0420TVHC#eNa20)6RXP|OWqb=T3EyupZwaKD+Aj$l
zVTNsIY3TpU((uNod8Cn$o4h}+nR}ER+*YS(&che60l*~_5?_$9qoH_QJ|gaUqLPC-
zdZ^Ow`lEYnojK&N-mv*GtCu4V`8>COu>r|oXhv`h&{b(tCWBcZ-L_`dDFry`SG_A-
zhMA>h6;#bh?Wg#f@r$9=NwL~x)mvo**fQ>qE*@k4o!9ps=YJ?ymyg?ppAQJ4B`8z0
z+h<qJ(m95e(h6aqYBy>>nWCN*2v=^msCwy!A(xqCj7OGMKfROj$I&%vHa}sT3+AXR
zXT*P7E72VKatMnuB!n)G3t9=B%Zk-IVIpID0pl`qbn0V!N$_0at3S*<YOpbwy%DXo
zDX~pCi1tN8PomIhwG?y~jgE34%#Kxdzr6XLCW;X7F{s$!FLv8kVK?-Kow{qR65VmL
zftJ}h@x6=Q88AGffv<_jaj5Ts);k;`=~BI?K4jS1m(-@g{S=>YK(bpauKu;m3tU^7
z0Vb3MBj}zC@#R~(<HARJKVifERRSS*|8Lp;)xV|Nm;NxVxcqo4Ec799MTi9O=={T0
zm1>VF#WBs&u+FmhcZX$)Wmgyq+p>$gtAfCT07sZZz`u4?uj_;$>P4=Lp<^S)Y8(||
z29pya%^U?199{wOx3%{>gB=pPYHbrIYrp6uMXZoGfn9XaC)?Gq)N*Bf-90b|lZWk6
za)nDwj-1V{ZyY?rrfWqf_vTw?j6a{rJ9KWT&1h!|o3J}BTb1Km4y63P{La~OSk!P(
zZGb||n)?h&`b}~kFDy9S{8|ner1#6^q?^y3cb}8=AAJ4q!}Aj7!*yt@S4qLhj9Dy`
ziI4ca^V0fGy;o(y<4i!Tr3s-(&JuWx*Lk15FR7ePY)hu`^S<CGucydk=(C-uuMWEh
z$U67SHDmGIwRsT*cbY8g#@G=hQ|9eK(@)zn&r{vIvKJa(kDM(kZqpnY&2+|CMY$HB
z<`+F2O`Knd2m9sF493`e@>rkKTlDpQCmgcWr3Q-gNSqs71YL4neH|Q9bJN=}_w?E<
zZVq$fZYp-=ZXt7<G?hFeot1WO-lr7qQfo{<dgGkZ!Xdn{6r8z!)IID)xVqKE>~^+<
z--vaj>zwDuepTit)qo5LGdXw&F<A@z)ke1YCq<rg-8`;rr0w-|f(hAlxCyObhRJKe
zY!iyQXcN-96hD4@oCdKyouhJSWm7|evq$Opi|vTm&DQZv5erY*5xS*xl_=VQA_a}D
znGf6>eEAZlwgP?SF_OQ^qa+8*<Jx<jegq<&IR0!1kt(hUkwbqwv5rOhl>jZA9YVH6
zDt^6)<*v#i#)Ge8V0pVAlZgyCvAaeLvblyYn2-HxGpKsrQ1H>l`P1*>#fq;IjZ0Vx
zu6}s!-G`jllns@CY>)20{%a(}Gyii*-r7&|!_5`PI?^rNs?39~*K_M--;2%IZq+Tx
zNF!tb_4=x01gbxP(j!Tn^6Z@t$JXmBBS#{i_w_G*-g=|?@Lk#*=^khwc^-%zsUD~w
zIUe91oz2lTdQ=lOa<8p5ow<26a<9+3k*{I9ldt!>S@aCAw#WJ<wvaSL{9`(@K3ZsW
zSlnz3Urd&fYdprA-mD<A9}TeB`EnF4Q`6`WI^!-yCf04n?HT*8bj<5$TPDa|7_X%<
zGgQU30dICKkaaPv#q65mNPU&O$pW8yE0CST)dxR!Es*;T=Srb9v4z|syM=Bg+3%H9
zwBH-4Z+;|?Ojn=oXpbtdD;qo3kKG<gESrL&rvA{9@Af9X9sR2spWd2>v|ly^al5dc
z3c7G9`>Kq0w$^>db72>QG?3HuiAPqfWy`IsqVh|84aOH*#Y0vLh!U=MzEk>#eAoB?
z{e9eDwezi{(C@xJ#^?Td-(~$*zq9-McOLu4f55j8sD7RcF-+G`bsQj9Irz=YsJ<1&
z%(bn;P_eGUM7yfO7}&?m{O~)KOaD8!4jk8_evaS2$tvplv}fioX{5~wX;eVB0h{-?
z$}G?(jDd6$#-z6jW2{?;F%zshFsQ9LFme8IV6^#Lm*{=sl@NR4l^D3SPulSJBFf+o
z6^X_w71{BiFxvx0uC_nLN@L?MVb+J&E49~H?M5e={%1ta?Q#(b{)0qyH~Ngtr{yXy
z))$h}IvY5vvs?_U*jL)SdD~?pT&`mo12@H!Jx{Y$QZ`$X9EW{4QE|um?k`r_HdNac
z`ltOz6OK>Xlyg@7Qtu*;bxyh4T}r?DcW6&vKNQXX#Z<o7#z_H3(COM!JnEL#-Tl%2
zcTHbZ@mE&mencwUaW$MVbt6})Vwh0Fc`#0q_E(&0PN!7n!KMP^@u~td-FB`@`%s+H
zLt;?7r(2-oF4JA(#L~@4QTQ3Lvc@KJig~97TXwGo*FF8C%r5seYf;de1;;(PR9$pt
zP^l{C!zSO-wVh4z-^wJTZVm35*jz1JZmF6f+(7+wle+^1*0rb&?95}(dviNEASBnq
zo3!I6M;|wbUs6!rfnJ~%%I|K?T_{kg3G`6s?sZeNIe%7}O4Z$=<@~+_zGxcwrD^&u
z(%tVSc~ku_Y~a4T!{~@R(Ca4u&SZ1{uS+W3uacCY^s6L`0l&es*2+8SWs3&~$?`ih
z$+oZQ7CQ7fqfpK8QTSMlg^A_+j*3pxz<|){yD+@Wn;6o|lT0?#HDQCsE|=1st(8*4
zuodHK$x%IO<QeIwQ<)ww|DS6mcP*rqXA5i(gP-)+ez{cYW(QSjn*=Hpq2G-t>s*^9
zr<}I1m#<#w&i5aedwyLp*u{GcEDE|NWa~To$3DAGsC(2y2Y;U|rTYc<(Q=dEZgt?_
z&AVjoQ#!r&o*>g3-bbZmhKETu!RrD&@JU};^r{pL0g*EA>B@y75~YkbUj&s6RNn2D
z$v>!0%iN*LNUuj>#ecWUyf-_bV$o6-Ug(cD)4C5b(=>NIWhFP2Wr0trh+_VxmL;!t
zl+Hvx)*D+qxYxPeCELTUkIS4kD)kq-f-DYA9>VQAPG-w$?&78${?5XD)`Q9<Qy!ac
zl^^6UobHDA6s}FCJGO#KrLPwRt**rd2TnU?c94(y);vKCy&oQ~D5I{W?BT1&({ueR
zm2OEvn(KIvRlUb|1sP-yqZy1h9rne4gJ!9bk2)Sik1oSlck3B}AybR*cmzjr!!m@i
ztcQcJbjmxwHt9!xES=V?nxSNxvmbtSP?v%qYn=J)Q~5oH$v*yXy?y52X8YBz^jaXV
z%v!!`{`3~l`*>I_qk32*<9JvuV|sWmlQ+MDAG-hM`?Z*xOuX1;Xug*iKCV|7UW6AD
ze$O5UNy47*_cbq(ybsy@GW}vw&x`ivLpPcuWOkb`zVmtgdv3EIOExf_&6!l$A`R8_
zY0#`b5|$}y?!Zgl@4?mEOC~RyabVDe&B{T|U1~K8mi_Z=+q`7T!Q!Fw7bDNT_LhkD
zW_<82_Ly-m_Jv<jP8~A{z@_9r>jo7=w1Yy&8Xv%UO7~_mleeEjZ7=Aa4^xp484ExG
zwT_Utwf18MpO-#1j}?b#d|m*)nimvdsC98w+8O&3GFEL#pQqD>C$k;KDw7&!7Ft0N
zj=Myu{<>M%l;QmI4l!7W<hwZmA#NL04)Lu(E7!Txb;(#|yvoiB^gGW_El$gi1+<+%
z<#j?!DBBocIM>R)nb={s{9K^WImwC@YRNkN{gd`QZkG-=-aGAH+;=);_@l+wp<1ly
zmYxHmt4&G!ooT(;PhSbSb<Xuphq}eI;H^^;5;F<pyj68PAY~HV3hj>}#N!rtFio4d
zuK#OA+`?0*B)3|`R34g|`GTleF#TQY1cPkaGN^^8puewkh)FoqNbP~tR+tkoWM^!U
zwou!~Q@IPU44gda{95c08meZ1Un#W2&S4LhF<d;4tSU@5@+~)Nt*SL*T)nVW`!1Yu
zL7pP$XKuLcm{OH*)Lex?Sz7AV(1i+T-oJx8({i>>zc=!2`C>+2_a*4}<lUFw3;rp8
z9FEAJGSlGN4Qt@-4tEgG2s|1fKgV-`>Oa%Nop?VO&RVrswfBfw%0^{(_L3=ts&NLs
z5^C@TINI&LTDCJ%pPNU7{;E6R{>zz5{ynAUJ8-bBvxSoof5AAA5ma|4H@6)5{Qpt*
zRZ(#~LBF`WgrLFQ-EDDqg1ap4?(QzZZSkPNU4r}K4#9&HTrdCcd$~{doI4M7dg{#d
zwoFxRb#>S8vRMwpqsfN$%x+O<WznXhzH^btM7f$Lyt{@Q@kQ64v1|Kp_LZ1zYJIPJ
zqf?=~!LIS?)<DtHd>Fc(Z`fcB->%Fl^ni5D4AQsO9%?`EFs0vGS-n$}qT=rNoTULP
z`v|0wbp>3drfX!Hb(k=9`)S1T^$qOlCMNpa@ctX`b)|v!7C;!wniAG@s{yIsDmS2Q
z)}zy@;e2F3+ujk$sP#>|ZJ{>kO0lzJp!IwWIddHqtG0=d#c$c6)~R{ZX7|M-C;Z#m
zId*Nc0Nv}#g}|;)r$|`A8XjhVgON_#Tu-IbFMsr1tryGzmUAO4ht@#Fws~QL$L2Tg
z-PU{Qu+H;doB+o_z+*|MX4`U6no}<TdRHt`X<!g-1}TxB5%>M9Uh}bfFktr*%_=OA
ze*^3N{OY^cMuSR_+fQ6$eh<X2pWz}_k6c1l_gmOW;_#r-y}6*~z4M@&R0iWq4f37i
z1=^jn1)4sO?5|Glx+G4Xf1p+Kgi$3tJBVm!PaF!3t+YwYT!%#Mj+TPkrbD5^`4iD`
zF1jc&w!Hy`GDo4o#d$37Sp3`QlpYQ6G48S`l<t*yv|FWsLW#_BXsS*|l(fHp5Gg%Z
ziD@?vVnwr<TcIpEb)gSBsA0!FYcMNjn>7nfm&t<V3}|5KJq^B8fZgp2ZI%JSHU=}W
zRi51>6?0P<6{}3lD%E;-qUR1w(C!_mXbb1u6e@M=H==J2!J?rKBhaXw2I!oB?;S}?
zeS<~!E*7B`J08$D&)-c8bsm<Xr#h`*bltW|tXJR63pF2%plW=RL~}^kf?I@a;MeY~
z39Yxy%nJdD-oXh%VCX!bGX%GbYha;#qHS=k5OJ`B5CcrdgB|wqoU1~i)eKdzq0l^3
zw{H*O@%+DEqTBh~aL;$IG_$?hbA3UE?oiOa?no$qxhStR>av3SyZwU6x;@|`?)fpj
zI+oM>>J0;7^G^)OS-U*D`=Yjpp(uP45d_zLJ&ZLjTcJyQd$GN0AEblXy6a%_FW-1s
zTa^3z+Jr5j_Fmi&6psIC7@HOVgJu1-K17(-{sm(A3=Us2F|Ft6SEt(7DRCdxc-ywv
zueUth*{!$K*nH~jqm%Z_7x%ZT_w#3DVbM1Olv%G#NX~68=o(Km(Hu|A+1*WaH*ZG>
zAw!eGnQCYhueV?_M}F2n_E5uJu6<#SsH_J9(36iBkgmeQ#{K1Jj88v<aE(ao59MLG
z{kZxv>b|X9yF&TC$M*$)FgooA!sb4f266PFIqiDF*S@Ou#fzY}{nLg*e@EOI`#|<W
z{0Y4UWfhdzr@q5b2=xk+8{8{Ogn&^26%5r)Dzn3Z@MQx*9A+j&rN3A7M<EOXUK1o{
z$Q-E}E3pKkR<L!yDh9<P@o%IWIA?Kbv94L<BvKFxR`{f7iV7)&_!9)u9V8_ueEk)_
zXc!9w{p%N26P+YRJ2bU0Gtnw1L>X)c_>+N;5R~LQQuTe(QLJ{DM#=n8B23gI22<1<
z2`teb88li9AY3@PS)oiCG)}Ao1XXdSXyvh)3Uw9Kxa5>rxHU=z&J=`Z@nWHF6Z%5b
zbnx1Pe&NNNhswu0ueDboGG`ASoZ{t_=)V`0*_-^3r3bFU^EV=Eymbiv-)&;$D;Bd<
z)KDEm8e)k*2#;~)Vf;-O3yprFqeM*wi#ap1Qud&u#BRe={DCso(8rF8_6>G+hN1p#
z+Yfp~_<>abKaW-27x&wQm7yP6SWYHH8EbgwmjuR-RO6jk3A#u6Iq3HceV86u2gnZ@
z63Blk4}G4p!dCz_lGn5*s9s9{{@xVCBtRpKi(JbfY>K*5(SlE#%wJM{Mt4N!WUL5%
zHF~GYG(LT5T<A=Bi#}YnMW@mQt2Q|wM17`iyxQa*xMjJ21MXm5r|u?-4N_t#9y#nb
z*^W>D^deLbbhM+Dh3k}q!n48bN_dfk85ubGbs&!&(kT-qxYHtLmn4h1P5TgjgQgSi
zB6AZSebg`#-oi-KK?l)GMhlrFqd7cq9IlU|(fg{xjzy6A1)t;->PUH%IGpCdp-<hV
z_^K%vR*>Qdb!NPDz}3azs%wMAYj-ff>v|B@>jYY)>$M-j@CgH{E?_irSvaom^hSOc
z^@;eZ>=n^V{++vv=>u*nIWt)B2JNa=Fyvt$dDrNM>8j_I*N^lATUg^e@;AD($V6P`
zJ{lzSU3FNpM+Gr_VQtn>797D{`S7oga%9jwTF2pzIKqRiF?zcKL#IjF*RcEQ8ey+7
z4l1IUqGCffw4g_PB!-$uayjXu3NZ4cp)6Vq9loeDl@)Cf4jfhb*EBWyaIhS)iWHDw
zoZeNO??C7(^hT1lju8eoZLz4h5m!SkA#8lST}84Twu=5E$cCP<umg!_L8Tp@OLGgr
zgzH~Xg9YWT;Zj&D$FZRPgm$O741it?omIJG=2XKCAFlG5mEiiCU1bU2SfsYD<ws{)
zSQ3+OhMtu>CvVd7g|S}<E2_yxYEu6fc5lNrE5-!PUv(!=(>yb)<B#a3DuQIN=qSo_
zmpN--0P9mB08qZ;JuWqb?p`b}N`%9^U0gwX<8%-YM3wzoXo3vQm13ME1&y-w2nXQQ
z?o*jEU{(0XkFtytf|<R>s>T5!1+?t5p7Qxx!Uto<)!WZogUf1Yi>ENlkB;5E)kn!>
zfzTvKx<HNrTonJw1r@y{2wFQOofn2nZ8jRfvB&*Ub&fFKL}A?FfiyW=8<Dl9&MI%k
zH@UQm?CLh%ub(%<sx1BG@bv2-6fw{D3T)(9H#w7rX$;1>CrEks<vw-;hwrr$&<t*{
z#-+97Kf&&yiyd_JQmsTwe-rxnH@&~twW4t!6Gz1R2-eFgLvWwc4SW$IT&coCUcap}
z>D<COn>`B3d)70~eCJxJ`5?MKw(T?Yw_PbOfOz@b1`!k>M6^&40)QiOS}}$uV%v!*
zfy><e(T~mRK#D|zvakaRrpjeU2%3k3nf|&kpc9JuIA=@}z^)H3LYN=q8u74$2M~T-
zRKb6@w}$P-j~EC<LEh~$L4I|3gnnmTLk=V`2<eRr+wGMih#DNlb0!dL>Z^cY;`}QW
z8z)>mG|VuEwFiirctq5-VNA@xUoScsF0u}1lVpfzn5Ew{X<7@zu3_7ivQ@k&a;HwQ
z?vAEgGyW6Go&CE+k^0H{mn`0zX$OQo*Jf->)|U9XV)z`II_hm?CD$5|Aj~7nvT(EP
z&N}e~W6ky%`kZ4u<US`406$4m5^6~vwXT3o%<c+^oHCs&u*^D+(n038xkn`CFbYq|
zDG;NXG%8L#)ICmXXX3Zd51amhSM=+!<~a9B*=@`8TZgeTi9r*FXeJ}hoCPwE+YmXH
zK{KuNGGoWA`vmN9!~wP2{0&lv#S_kEiw3}xkqI-=f~dnbEBr#|zNDA2x9~-4eGa;M
z@3?4@;dWFGNvNd}p!^eRPQBXicCrdls5M)f<)?O0=91Mc!>R9a^Bw%{@ES&UGaBIX
zC;p#i2Wh`0^{8!2A*_17C>VPZGBQFFN;|U%2|K~$3Pt|U<;n2hcEV)N>q9aF9t<f>
zLWv-|Z=^syF-o)Q2y=U;<Xn4*XJh1~E_*7qdScO-7Ng{pO?r@>Crstarc{-OV^Ve=
zvs$aG7=g#G%sew5aFvVHzS9I`_JDn|RwwCmADPtihHGv-6N_^GiS^t~$KLV)puXoD
zUFgBhT2&@>jZ7aMFyU!*Yx~SsWJqoc4{N?>9B)UAm6Qj7ZS*{rMnf}7D%n%p-}l1c
z6W9`CPIw(%RE2Ek%ck%gVcp;T5h_TWlbpHt^~U3msIZbia@{=N{*l|aCjq)b2pV6U
zW1O&%Tnr=+8!0j+Gunj{cqCWD(1E;%B7~zCTCfg;Bp*YuwG|J}9#OPup1NwTD_)Fe
zJ^+zfpLXs5Le8Z<DrkZN#sGxj!X~yt^%XPIT*6=+!}UaBj5)9bXZe73@s3o^wL1cA
z@Ohr68gAU}PEw~9k#@Zq?Vt^<Sid!#cE%oW+;dM1*5OaZtRgmU`)Z+StCPl`j5xW?
zDwV8t8jXvdubOR+lIa&Ts_8Gp8t2S0HXF?<HJwaVuIOTS7djRF-I!b*iG|dO2NkP(
zls4C1;krT~m7GXin};h&Vv@>=`4UKXZ$H3hzO72)5#Pe;6TzK#faqI(gmoVW1gZ}d
z=YCdVgwV@u)Y0d^#%9=fZv()dVTkpBJiMY0UkP0uE9d#pY@9Yz_FcB<x9;U)<t>^y
zt4kW|X+0?a>m_lcZu`0IEwbYr&o9p-otRU;iG`P2y|d^AdB^25xVIBWRL{%OSgw!9
zW=h|_b@jpTgbP1;B`aeao^d2*K05U4_efu<ZNGSB)j=3uRL5vP`s}9n;CrPz3K^aY
zge^ZZ_1S(p0PX=JS3V*nUH!^m9B(;>b6z*DEPG|ThFEYN@2dOOU!Si%dIPV}KBgYg
zKlZ%JKbX2E3h*xPm-~EQ&#w(XNV{f4P%j@Yhv8pE{)9rxvw8N3`O)s62@~}texRuI
zNkhe5&q46`F+%L@K@L4ih!P6pv&JgJ)((_IqwjD8<6W=zX+P>0(hGmH4rPIX+lvhz
zdsH*V?;+xis)J$rtsUyIYb%y{eOHM0D3!$CgTEi_2wS?lF4p|0Gz)Qv_#ATyS2yqw
zlDOL&a`_2rME)pNPap90Ea)4o^xjDS(4(x=w*Ugc#DZ|Uff+!;E*=@r^+b~Aqh=I$
z0P&x&?J$T}Zpv@H$S3_>WWB6L$JCSGd{B_Xwtj~c)zzz1kbgmI?k6vb{?6Hi)r(Ht
zXIf;`;I%@}h}i-!A7SuY&19zD?Z?*)#QDBPll$+?j0k}U69YFUdEd#-IJ8iVLed9X
zO%ATizEkDGS4YH}H9M*QB)JIX8rW;F^x|7Wx*S;B{r8>5lyE7YH~fy=t3Du%mpf|q
zcLXN$3N1Map>&#AYLu`Y0bAr0xwi4YQS}w_6nH(Uo<XhTsug}P)Vf53+4`uR9o}lh
zIYppJWX0wR+g~J)m_H-as`M*V<3ycO-X^UT-_J-iV}y#~>a958?_;*&yGvM%3yvdK
zcyzzKNamP*9Fr1Z<V8T2=sBz0qM#+{1OZGv{>=W6=Vgq*iyS%LiTbKcgb#4mP=HNH
zI2mSRGjg&!^B}_WB^nvo8bEBQb2j~nq!hz7LduOYxWX7`D!`WT7A?D>rLf0r`sD$I
zW+ZwyjTbeSz$$+J&#RM<KKXPM!%&tpG%rH{-E@LTnCl<MosGv#UKT^Fqmk3SkVg#t
zugXrUer(JM1$|W4y-vUZe*Fw5luVkg-?)hMZS4I7+EkCbf5Rm7Q&pmDv4@=u2GI2j
z+TeI7^9SRjADq>TIUSTZhnS*O+qfDKTB*?f-2c98qX2SUDDWqArWo#CP<n5qnn(Jk
ziaQ%&4ZX>tdXWMN&_htY5OVtmgYXg|s05J|uD>Gm?-e2_2RR5L;{Bm(BUT>V^MczN
z_;tngjv%t5Jc|(+!R&=5wZ~GA6&Nn`==g{j2++F{IY!8rUcUCch58W1dZYml^d>RA
z;|*b;rHS#Xa_Iy;kBW0jf7!J+XA_pn*vSk-mQN{N$z>cgH0Mj8VsPTpiGCTS7nIgY
z<?3xs{7IEL#!oK3gss^a?3El(nPEr1XwGp$p*M=&nC?Kfehk}~Crl|&LHQI)kebIC
zbygg8R@Q8eo=57ts@s^DNBOd9v=6aI1D^%8Yk9bj5la@S1NW4wnM!fS!I#|?MkK!_
zl|WNKL6h<{HfB!jLcf}otAs{jm4eTgv!OIi6-arc{v{ciPGEE>jbmSJT-}9FGG1TS
znMzyTbhJ4Q#YLzze?umVoJV~*Rj;yq?0f-!U#W_8S5}k4Q{8^7dx7#s+Xl0}U`>t$
zG@TR)BpfSgD%p2lL%pF?{2{0~Pc{RF8vECza6?`b+@(NBT?fWXT|SW>&ADCQw|^$Q
zVK#`kDkH?~xpf*S$X9>?Ped6%b7GF~P!8bhMavB9kZ1QxZ&_JmH=xjv=VQuIva3a#
zOW`Gt|DXV8=}S<%3M5YnD(<syC!=S%NC?jd(V9nK4JpW_vD-$u9P+A;=>jx<DPc7K
z^py~bO|&+z#GYcLDNe_gZ~BE4t)vA%H<eBEnOq?%;2za9=`G`{<pfrVoxf@Bxs*bq
zdKA!uk8R?D{E!bhN^+XoG|M&a`@sgy5+C_*YU%WqLoduuBB?W1xoChAyz^uhwNiWT
zZ@vfgKPkTHZHGu0t@@IG@=rwtUG}1_9Qdxs&ndRrx1*G|kpAR&hCCi@QoMVMQ<5rY
z!5s1>7j}Ke%FUD)zafyZ-r_}^Fp?Vh*DfpZ?v9o95h8Igk#y{bjFoz+Z2B)%Mn3>E
zdghW6@ri@7!I(mpo>xh<-vH{<DW+GUXzNQ(3gHz;jzM5JrW}Lipe%Jllx5nG2O~Kq
z-43);mZ)Tye<4WyIRKGjAS0t>!ZyZqM(!Q%O4%C~i-SW<5iZFhtC|c&$IMPmCFuZa
zqD@J|#Z9>>7FJWe4b}KkN2WO>E#uCHUP<?bta&IKRJ#(ffG3?A@kbo|eFKmkBa(cW
zq6sQBM+Y*s%dN@fC*NbagH=tX`Q@QxwGk;dsbE3npuF1*KQjMPdD*~|0Cp9haFmRj
z)FL%pc6}RVDY=qSYv31rhI7ijQV#QCJIE}?b=k6UrQ{QK5_a|bgvpGt<U|X!eRUny
zCw(oM!|{&M%tpSO=G;%n&uPV;^lj>oH00zb7yp~?jo4ROWlE6=*Ri@A<{QT+#)FET
z;#}OwlaLr+H<NG-1C1gDJZ-O8D%|U|YVsWBnu?MMdbpDtIi-$b7X||z@3h*gE-`Iw
zBrsRHjhlTbm4P<C=(09cM-h90!_Tv#9Qt1Hl;*^7MwO78?V?Uc&0p9}Ln?r$#>t#W
zmHx?e6+%Zfed0x}O{s4c_3_qUSU00PhmPK7C?S=%B$A&2%I($7Cq*^_K5YcEBGrT^
z$$v3@ntbv}s&yn2mx;<~Z1TaWTq(C2@!UcNX3{eY65wB4S-1L%s6s{@3M>mQ;MnGk
zTeWj{pZ0s$ZZ!r#-6x!@ZS(G}k3D<0s-CptQb1|zU#+=yci-c@4&StLrKqhM^|FV*
z`o~7@L0feU<>-H(j|V&Wo-6WWg=@E^3l_G^l}}4ge)$+YcWs6CR3w(OoKBonKQljf
z1Z4C8zl&{ipOst^IH+$$@TAp=W!>=bss=|$(61!PhZFEuI1SR!gWD2fxJe2x2_4lM
zq%i5XtYxSO3@Xgc1k-I8%faygjk0U_bbDREL3Z0oBsB^BHl;XjHfN=2DypVUOxd{N
zlSU~ptcshZ$Y$!L(&ry^)f}S?S59+<)-Q@h2ecyosj$D?c<SAU+*R9xvZ%Uk6($qH
zHVZB}1g%{~)J*IPO_GV(&Ae*=GI(v~)Fhbn;3_pIwii0w`I>>7vi6_n&O5b8Y_{no
zh;^GQ&8msrZBRkeHI)mc%^@8vXzHyk;S1gNcz4zU%0lZTDs|jqe>ck{{ns`s9rft%
zY;B9)?dLfQ^HSkj96@5|(m<ydWCAd=7+}5G`g^Acs-to-=D9a#V|Th#v-0e5LNjOC
zo?!gBm((6V$l5OwP4U>NG@2NZv$7;CBtaEPpq=)wpt$pqy&V6x${HO&ryN@GLV~mO
zS5}!vKsnH$8tAiZm_6s7VCk`0u44ej*(slV=$19R!R(p6j4S!C6KpM}O~rKfw@A{U
zz}oo%P8aMSlHnl&ve;~F>e4IFa`T-VcaW&=um!q5K-8SP%h~#7%yr}oHT4{^+aG&N
z6Z+x+)e{lzFRsg&gwk5>HD+7#9oDw~g?rrAg7UgMf!db_Ynu$xzCKgdj&&^Or;3Gd
z-CS;kp4n*kOeFyS4Y#&SGUAie(h~nNx1TeS2@gZ_(LHwjtJ>1#&u}MhA~bm?+cH)!
ziQvSy#N+Y+{O3>oH+|O$W_e?~wGG64>+DSpI4vmpKw&KU2Q6^&5UhSX(&zu|Dw_LF
zz*_c!7RHtkEI7=^I{F30&k7k{`<G<s$m*YdZM(5TqCEmmV|jSMYGc1?i(h?Y&DYm)
zEi|T2=L)TU5g=$cm4u)t02*6DU9G<Z^xF-pFt7723~{4QHB1fa+f7_Cx41vjuXDe~
z*ni6~6^L+O`8GIhcjWYSohx_51KqPxXfW_sH-+A6Pjal?$0&z~u|ys*QG?kAMex}y
zf_bDg(n<lv)Y<5$r-z#xmjHK1Ch<3+5v91BU#TTXXA2c<0zw4+({W|>ze*0yHmvak
zMEEC|<Cx6xM!0{;n*}ybm@TiQHyoY){lVMGZ8=_>2wP8R7Pd)bYtcGvxpICDdp7-O
zILr|cze#*#@i2_~iC+7D_RedGKCHJgcn!R_4oMZtUm4F=AhJ-Vxv00oc3l032zzfj
z@S{8T%B+qWYxOi*?cTCDv^(#I)g`qy+t!#+oZ}7SUV+~b40Y*`9S|CJc9YdWs+fW~
z7TesI_<cZQc(h^y$Msl&f~gHtYVO($sH~Rtq_SMWQZ8jo3CPh-$8&E&pE9P5%N}0&
zrHuD3olcR(Y<xa4Yy4KTjGw7*p$s?cxe0py2byK}{HlU&M?6qjnLRHHSHaT~Z$5`_
z>elLlJrrNnlDA|y&XO_fIu4y93v$w}>_^trE!)2=K1;UF5S?ikj_TEkNuPVzUs>rU
zEx&vw9hTBpXQWsoSD_Ah*QatVMc9uLZL=mu-X`z%a1ZaVnOr|;Cj^BFIA#(ZCT&N2
z(9jYXh^hl!6kJ^12OAD(tX4mMKGh*_z0df6r0=bN<US@6A$#P1d@R`=g>!X%c>npc
zGVE+VC6FLVloL4du#Vb$@NvGjjr8iV=m;Cw`PwSpd+=PtI#T=rts)PP-~q!rCIf<o
zP%J@$P?3j*!GS<PK!6A~V^D?ozb@X-vZbSon~RA9i=(9zi<60qtAz`TjfsZ|i`4(}
zRsM%1X66QTbdWMJb8~d@W;U}kadj=#Fi^%8!w~{_dagA#`{C-tK4Bcghnq?+6pu!x
zB;in2l93HZmNJ4?F1Xig#*w3k!(bHs*w}jTzwK-Ki<*&NuLgqHb~c%4!;8P>SbAJ$
z`Of5Wcv|&11g=4`2C=bh@a{=6teq8Y#-imO9Pc0hIX*;K6OE#n#JnzqS7q^;8^JV7
zsx`lj<C@$-3b(=!b2bw*yQ1Of;5L|?vOQ#S7nYBbUcN{ytBEV(5JcWoVy=Ez_^!2>
zX-YRSc`OeYlN@YP&`iXSefn<5g`AD=nnFz@hs}Y;tx<G?fhA0>BRh)`%3@J@(y4B<
zrF#1H{D`;pNMv9~5nqy{M$z1kqXzdo^+J=y4+j5xcJ|kb-KYuPL`Zx*)=_8GVJdyg
zin^V=q8G0ad>gbcnPNOgnaxd96p(-7-Y2M&>bE(0NI=b9@h<ww&bWg_%jR*$X=DL7
zCv$oOvn|`dDw!;0&Fwa3ku!9f)Me~8-_x#t>e6Byi$JhB=?3UdsiJp?r#}b$C;`g;
zs<l1&X=8)@l0jLUpz?Uxq5J-$PeuNAKZ{c5wx({Mi`;>hW=ma7QQ9~~PE$znIn*Mu
zaG{MIx>Ln_LK`U~qh!z$hbcmoPQdK9<!Fy&PGMzxQMXdYV3WJIz_?mDbP*E6OffOd
zF+qKxrtv+Vf*F$})2;a}4#l^=tvO`(SgA2c!b%VcYN>{$Xi(%V9wV8ANU;reZP+nE
z8dM6oL${O|CbXI#ws;7GpS%w&vz@3D-3D$Q_V$@nH4@$*cW{qN-14>2t~^ZXjMGdz
zc_m*F4HwOQ8J0t&wzK2FKiDl8DjyPgJF}xPI6uT|A#=%%FlEfG6a~Dc`UIOB>zuD)
ziBjRSN~6c(*d4%cA#H%x++bR*lVV?)M*`wM?zek%n;A1~aS)n9A&!Ir2~r8v_s~;B
zG}7Nw&S%qd0Q)MuN_>Gdp=GK=D+_@%e$rQjzu6MzNp9xPZmSPy{*$I8VtD#vC<us2
zScw0JG;#g^Nt2Sho!$S6(vZHlAEo5#MLwnL{)T=|5~^>MC@;l`OK2=nW5>WaT`a!>
zb)NZ3)=7~Sb*Bz2j0O%2j3kVN1P-RKgocEKsF><CHV)3K1f--yml!4nY(eXD)y3rg
zQ^3n!<jY8>fuoSY-IAWBqmZUSs;}Ym^Ld2HS^oEBhbGDdMXCgOs;vw;B1eL;H>3mc
zbBOux0v-d|sV=|TuT5(Og#t9D=+ep`3^*(VxM;LVTFdG8(sR|DbDd#z{VQ@Bv`+5x
zJ`O!bvZYSN?m-p=Lbga2r&m6}0hfenMVuo1{Fd<y^--&d_LOv{FICNUpH(xbDVA6$
zY@Ox7ivrE6scf%bJx#veNRKS7Oy7Fd>ND`~DRt{Jr2V`uIlt4=!JpTz`TjJZK~_+W
zd)D}%WMjwmE_=TNN@qDF;^A=2tmZ1uhc8}VvpzUoV;EEoPatMav&~SS#{ISUEHTtj
zo~J+NTiq+RB$!jxj8zEj0Q-lo`zk@-5V~|p&y~>53d;dg<cE~5*qqm6XZB1H-Kxs3
zitnQ56@nV>1Efr==>^eUbCGtpX1D<@3|`Ha0<@OkY;kQRn<}Op0slOg>gEQ^beih~
z!$M#at}C_{CUMPsB3kghiWNcDn*PvuOo2+TPXu6hX;r@=!IEZVsYV_5F7m+E@oaUY
zs|>$d)7#(_`C!a$kzUt(aaM@Cgi>=h#m1!LtVKkimk^GiTH8U&UQMU7QP&&6LU|>J
zAWi5m{{HuN)6lbi>gU}qgDRYwc+^Jrzqp=-ERvCo)~01D<BGn<o(thhTehwp6X$jL
z#hUrGQ`X^3_J%)R<RYs!{gnq|mkloVfg3EL7YzSyBON1lk$r$|*2)x&oPVQWrTz@$
zf6Ho!l?+qz0tQt6SXVOn%$qhvqTtphp5xF06R9T2-i6TAH>nNj{siUd>)OeqR<38a
zn|^EVDqY!gp>=m?!!?48m%}lpX(nAvCAp^)7^+~+VC`FL8SPrNH0EBND=l~`Ucaz;
zov%GajEt7Uyv;uYBB?R6n2SThnUly7nWg2aTIwiNhKn(1VSO8D;O5M#K4^@0c?Ohf
zjW)uqRj3Y5VSL5)5dwD|AS>`X-r-00V4r@#Wm)%H2Jh`3`pwUAPdKyERdMh+631q3
zp<n{j>pR42zpsEQK4F=`$&SYZ6ozADWnFAU)$*rV%iI$&EzT3LCRJP)`-r5PbzFKC
zCR`@V7Q_-{OXiymT?b|Mlc=xI*x#wd)P4ofT~v2hsfo-iGGSn9vGCe{d0LoendP)J
z%$qIK0u)ffr+Yr1V`&%1-kL8wbpLC_fbM&#*M}(`B5(bxE5zKEO~t18udUGiyine&
zbQ$WNVWORzX%j4698>11#G*&|fu&mIv6)<v(=vXS(s}Iulo$|{+%)0AW$#-tlpql*
z5qBJI;k9e9xRb&0R)vDtT;dX{@Vm59f9szGfig)6$<?<K`;(Z8O*hD}`XDh@;9zrd
z(}KFI9n4HXyz<mxZb&C2(d~DswgZ<p%++w98AC~U5}KP)5%&@75g8M1vzMwMycsPC
z?)vb?V;<ddtRybSq7;LpX0@SxXk%r~QCSTuE3LoP*3zIyXZ|rVw$AKail!DckfJM<
zWud7)-f3Hu5cy#Wqh5nMz26VvOe=rVt8xJJm++EL*UeJ{J@X(&k}yZL`N3@>x<Wsb
zMf9hEW5V!uw3fgMt6qe)du?uk^I4+-dNx~8i^<=1fKX?5Ov18SLqg(_XnHG+2~|sE
zze;SyMnwFuCR-<=<)9Q#M%PVjWpRdq*hyh@Oa(m9_Yb9f0-V%d)sIcoUzqu6h6TSJ
zR$;UH<{G&)OB(l916He)SZW!gfu^xyB^%bavuHHpP8DYfo=%=!zM&_@jh$yPzajXN
zop)`h8tYkZaO4k+E!Zo>BtN320E!T-P624-QbSsiqK4Ol0WR;Nr+JyB-RCW(JS>>h
zx_`h?%-S_;4JzylFr+_y4HLY6H`pGlO%w!W**GjEA`jkdc)j0EPlP;mpc$x6@Xcpz
z;|7e!9_!L`H|+66bzWFscepJvlh?yHRLjTP<MQtTaoJj<Kqc;XQ!}AOlGSCeHHP27
zYHWZ#z6!mFFevXXav5a-kM0zA<!d-I-M}xk))k3b{9q!A*xfOAr_JJ?#MlbTrvJLD
z-lWP*R9fxtn>npL9ASzblsmpss>T}a+r0pz6?d1Pnjz^HFZazM!YSHB5c!n`M17u`
zL6qdZz^pJT>|bR#ZAI+PtyZI~u_)`g1SzJ{>4l<Hmtx^?@%q!QS(r<6g_h#Cz&0X7
zhQC3rVOY_>#td(hdcFZ6*?EKv^!O8LGpeCRff7z8>?Sp(^b)3sd5y1H7c$i)PIoJM
z&0V23JO7l5iW64f;%_qkxs(XCwmAzEaaSkY-Kup8lI)@%H`g6YEeVmO49dw1XiQe{
z|7uwf`6@U9)RbUxUUmR)NL~~1Y3q5JtzI<iUM~-skhk1LS%hUfr7(YXe!g3k`B3@T
zEpM26cDT%(0|qWH>2hE}zaGPPBFXVcMgw#Gm}?a0*<=V#I<nlk(?Ldl$cHi?`$ls$
z=`W|z^6B*VIhAk7OH*t=m~r9vru+F<BfZ19T;Wu$QyB{g8NP<*N!l*aTY6rn^lNAN
z;9pkMF&N<bhPHh!{H4(xv`Hvi{R+UcNT)=C=@S#mn)0E$jeeLSh49#?Zr13{7`NP%
zFg~iy&pWAK(ok_?hufNhw(86K+!4J;3LxPJJr=5+ZQ_VsEH|y%t$G;Qv^L*+RxV2Y
zlcvm@dLHYGOV7ujxHacK^(7!g*<O_G9RS(Foi%Psl?|%tZGwFWySAYlVYf5HP5D7{
z_14peep5F+36(0u1>cGP{+Qf8K?7DkM$l(qR}odGRckCju@Ptwc_5+wTIA!k)Z1v<
zLgmQVo8G+YG_DBU-Uz!7=HzQxvp*AMocO5yTSap=#`o6TuU6Y(c&OE2bAlVkxnTBl
z6yk3}$xBWjE4AB7G2MFqWa7d%?I-ia`I+zSvdE$3+wx|JwKz-#1I)IC@vvK#QT2b@
z<iGendqdYtukBfMWD7IlYOG=gH_=s5ZJ5f{Nu(gy3D2G4z*{1}L#|VOY+jNe2li`}
z`Ao!kQPy{?`yvS@BQ^Ty4^;9QyS;~p{rrtFV=%^cX(`_MQl=exK=FzO;aNe)UV*!b
zODpt+$#KYS^GTnJJ@89ABTe<~R)n&zmj9(#7v|qXxDD%MxlTg%MDm1T&1>v*sa5eG
ze|!pfS|j<eo-9gqowVn!hNUX*psMPAjHG-Say5@f)Qs9SIeiAbT^GX(MOKuI!}Tom
z?7Lgjf7JVR<h#C3-31*Qoi{5zur9K+&78kfu!n<Uh2MGw>^E|-FYe;|%BG9$wFjVg
z(aggH;y_Kh3HkgR@FKZ?5GTaw2-|PL`2`d3IWKX|Y%42PW#`$%3J9GVl@mqbWoJ%+
zEOcjeRhh&W6WvZ9u;JKZ=<arAD*6!>vN~<<r2)7~oR2qXRKwP~>OEJRr?7)*q=A^}
zm%I}HFO#^*3b*DAb+hrn1bc>JAAIv-6@j#!wuS9Fm{qE3a{=MzY3ty@KrKzUnFjh2
zpT`EnrI=&2851kCN4&&h&uBGR!i}cF3=zKE<Rd$sP54lJQj>myAkT67o{DDs@5;jo
zKMpO%j%nA#Jf9FXXaBHbu2T)MZ&WkB$JuQMF{2~F(4a5(i(iEgR-2xD|JR9k(Veow
z&@iP{qCbho2%<VEycfqe<41OtvsU^M#YK}5{N8xld^PlGtB}J!<(=^th1DQ*vYY4v
zT*+VKY){1{O9~?=?)`z2zrvk46+3*~x5YlR)GkkVi*n4oy?-Ts|3E^2;U}^MJk~%6
z6x#Ho5?`nqQ4$OM%_)FSRK`7B#P9vr9VU=HATjyYfa0DTA|%@PJ^&Kvxih!(o0)LY
z!G#O$)qkYRlL#ZN8*JA2Ik?B?<<4EbS$38k-;<Pk_vAyTO>6bG9v|RQUYm}(G@Q-P
z^l!!`Bv<J}F%d)W!qZ1FopCkQ9g)WW0uZNXBbS&a!5RCe@d{^o*@eP*Y2qjHueZyk
zLobtgX4FMVIH<a&&i8QjNLb<p1W-3k1!l&&vZr4g;bbCeTqNgT?)2~Q{oT8$Fcg-l
zFpIJ?QA4{bN6MIq{3DuJJ??;QfJt3^@bH^`LEEEX$!3kDnI<=d?lSpLkqS29W2mkY
zh)K2E%2U6x$ed$8;N|Kf!OL~IS9N!Kb4ykuC;l%#2E09u@rcX6MZ{i~_%N#JkBhf)
z5`!xHP#duo6{8}5nHk#fmpKbouY~a3imkge&zYrd$mjWuWMA0}E^a#_C<l&09zj9f
zOUUNxK>-)e3j@4p;Gd&pRF?x@PL+w(lL4Mjl#d8duu64eZf(@sX`fx{Da06(E(>8A
zCsf75%C4|i6tl=+;NUjc_>1-d?_}PwP4$;*Z?>QA_2PKr4gH(g6Rh!fb>KVM%eCL;
z-5S}h{{NW;DHV;&sXOn8R*FU#L0o3B*MB*6-?=mJ3icB;n4YwdZI(zub=LX#%#Wop
zwfDI{Gg9F2{l^a)m{r$t1y<mLPE7w$Fopf*Y$3M2QjducNxqtJ-j+A<O=b9|9-NAy
z_0#V4bkMYPYW;^yzqxvO6a{_B7@zyq5?uSU-mj1h)Jhb0DclJikW1O8d({^V2jwKO
zS+cNWK^Ss*A*u3wrcir)`E#p7XCwo8J7$*tS~w~)rpq8};?p!{wB<+94@~d@Od|Np
z(&lw8gKA`zUJYz1JcL}-inzME896JcwJ4m^I_x|u{vOYb&RC&oP<*;y4Q;<rQj|)j
zta;+EEql9xH_SdvM5fYSw|*lZ+vr{!YH_$y1J-P!R45b;L?5mAvZHAxq|(6nmUBn$
zNy6(O8Ti!%Jc$+p;#u>n{ee~$1VAKpdNF+C;PHZSv{Ze-D04|pe*~#-oFu`|8caL+
zQA3BEriR49mWZ>X`g2lvFL}=pqW#iysL#}ZTH<KVD_co}L@grwUx++N_Yp3C0!TBR
zR%}L94Nvq)Tlec*#hDM%Nub-~1`{Inry2a=_mTFv2!57gGQzjxvP^~eF}2n}v~#i4
zz_g=&%b)=`OvqOQ5-N)>26YMhxy2kD&-xBefJp*X_zlLu%kYgXfqm$tz2VdEEV;<-
z$SmhjqXv9u<fEIsXIP_~?e>{~+Wl@Ps(q5-{7FY`z{QZsve<?FSxJ9Nys=T(#_~#H
zx(D|D`!M7rS*vJIe(Npws3!dm<M)%iBu7>>)A~zsl1YJ6_@qdu^@~u!1uu%zd3aLv
zy;32V_BF3mIC-v+H>{hfVS**FkyuZ-_A|`>t{|@<tTznHxpI=NCXAsIsSva`<>mYl
zY2qKTJIT?Kc6$~82|&*V37<bB0fPh9n}|h`7rbum#}Ph5qzs?J2hpC;vOp9e7`)Dn
z^yJa(!nB}M_V|(41-2*s)dfB$QwH_-Z{V|!Fl^$wglKobo9AazLprH3^&r>i9MX@{
z@k1(-iOhGYk%@40A&LhexsCsj7SA{TX$5`4J4()Sex5{CGHFaBz9top3ZffLJ#ph!
z4sr7;g{p9Q;7{VZ*wPv0FSr}9vGm3cTeRCL%|mQY=GkQ&<=YB#CFQx6n~C(pi}Z)N
z+1zM}B~#vQF@W=?XE{e2o%aH2i}gg-vLA9KmH!h95ZcG@Qg#dzOyv<9o$>vw?6qsg
zO9Yv#6_7u~fP3=~60MW)CX~nneSek6gJqwutMma75S4jPy5H_+@W{9C-PI&bI&;Lf
z?>vhB&*DLL6q)x7JqhpT?iM(jcttIU{G@uZg-6Q5E<9}a!m~f*wnU>anmC_9y++DX
z^pl#*zAKHJj7-a5*u+1nV5fd4DRVwJ?Q8HW<$3sTwNVDIQY;~1Njfo8y-|ktZS&<<
zpu;-vz9vx%;l7m@wt4EK4gnK(<4fn-BT=X<-?Gzs7=?fSIyKRWu0xI!==AuD02%Vg
z$81nR5_IvYH}-zeF>)6o))$8z#ZLx{%MYgo!ghNX(OW8q93l+=)yEh(+orEnVRD<l
z8F1<EG|{l>-8mxjke;}<!Z=7Bcm3&+FP6PatpHo&CP!icq3a%G`}TtOawxrd+CFsq
z#9d%z@qpCKd*G;}^N(DL%`xeyPdcRM1HIq+MEb$L@5y^+Ioip0rZswbld%Q)By_RW
zN!mN3M?a$Y;IzKqb^^b_&FAoJ^w}Jqx1<?ZK8KFX^?TNR|BV)DvcTW=*u!^bB*o#*
zn=}6vAvWu2-jSZLx59b>?`b@{-lOpCz8{~<zV_m=pa7}m`7b8=AJRFqDZ#IN_Tut*
z`-2-ThNDJKE2R4@C-=P;i2D>>h!dpW4(e-2zwI&M4&O2GZ|R0Pzh!IF$DKMGR<hP^
z&swiG;_YK|Ml>PpJu^ktg!rZK>>7`5UsDsoJ>gvXnCSN&r6cV<Lq{U+JyWzQeqAo`
z0uHpjPnvv^0fuzaf7)B+E?#$>myD}f!h`=co5vxCwYGOYYJoiNROi1R37kdMh-Ixk
z`tQa3BUTfA7N;MdT$fLR$EWahxtI4p@?S}wh&t}n0u6eP9Tlzf3u~(95*~#7ta`{7
zR_0&fi9DY)y-sHv;^&k?Bb_UaG2Irp6H?xF{Q@%1NDkPJSMPD>ZrRUuN)zOMbFgO>
zblu6o)C=)5XZ`-Gu~1iOFQgqN%eiOJUAF&E#6Xyz1&K-Jkc2zw!pJM6jswU+*9^>`
z8+qf5oPk`Bgk|Y1A#z!Ivl%VL{H|fzF-km{S8}_7u4%R9HGuyfttnJHR6~PKXU}wA
z7cHGUNRw=JfL}r4AJy}OI^)`CF@RW)S#QCrU%mm~!`ayq!0A1}+YuTPbc}6eta~6B
zn{_oU2HB68d{%S6(fvu$h~VfgE=Gx=KIw1y&x$<{(IC^=N4$YwfrqEOKOt6_yTDk+
zuNg|GV?pP`^3~8S0xb4u_31<&NXEWSD<?tcV<wl-b}VQwq{hCkEA2t&W)~9!JFr3L
zBk*9!p!1ncUqoYgr<H@C?tGqIxjwCH@MqV9yP9U8@8QroN$Nv+&!qYuB}<laAOyk&
z9U#wCNB|DdXYpN4j*uQ-Ex2m7A?=zgx20{`m|r34c|Hdo+72~R2;ysR%fd5;@#~t}
z>0r>ct$a-)R7=Jn3H(`27nlZ8ASLr2zAxcVeJ_Lu=jG2{NRK%0pK!J^toiU~ywiX%
z=kEBmrO$cydM4{(f?eVN+sa+<{13)Zm&Mres1z0I9?ftK!T8lfeO;}u@z&QrN2L<m
z8@LXYQ9^j%LJX0!QyLGQafG&tS}$w3mLH_UxzlR0%Ua&%s|`8KBGycdvVuaqZyyP%
zwNqLHc}9t*hrHsm1yiIZ`3uyq7H>=gp>;^HFVSabSm^{patv_-rM7Q}QSfzf?#gKX
zk_rK=Ga9>ZfjuF)C-ms|t)N>KM`xrAPgaAbuH{5fR;Ue6q#=FrSkBe@wx;Ymq3YGW
zfS>D?rLkT)v+47Xg18+wBwK1l4CVj6lDi$C7*@{W2546)9*_I-DI6p9GAvTVOI#k6
zjzP}pbd`RpD#$J52k7BCjb<T)mDR4(gP>y~!!@%Y|0scd#J=f+{$0Ah>Ae<2biRVY
z{r#iCE<~3bSI9_2^mdg^NqyRTYCVV-+DHqC&ZzeQvQ^lX5$k1|@JM}yoFp8Q8|S~R
zpsOT#FYF9x54!W`{iUE!#k>xEkLZwt5jWut?1a9T?NFh9fILI`l-o#U=LaO$wv=`1
zNY;YG7GlU1%`_64M7T4K+uw|I<qQP}(6UO}wPoANsos6UBPQaAwY%v^RF8t5bt)mY
zz$S(9hB5aI?jo4iL(Ln`zS^TwM5;%qOV}b99;e7$_!Yc%05i;))J0Mv<UN(cx<!zG
zmNxz5E(4JVuJLP#){Se>HL~v5DMV-1OgJIL3xQ{ypKeFEHhn=x&-A7*gK?|N`US)p
z;YLd*L}&c^y+NPDQOlV3C~?<mAj}F6-&uK(f9zlY+DhJ`!6cc>?6v)t8sG6FnqwuA
z+s2f9YA9O3KYBWtJzpYfc;fA&79sc*p{^!8$UUCA6c*@VN5j&v$k(KdjFf*#pHnpr
zxF|6fScG0lJSJ7XgT6Q8w@|x*{TpDI?HBA5#3R-t`WE)0n4lOS2k$M{BPt}b9G*6t
z9{Jz55HPIQfoJ?V2uMG{`#g1O)eycv)~O3J0{ZQ-wf@OF<oN0Og#E`LIk*t|Qa{pW
ze+uz}+j^cC^p?HO4Y{)CcdG<>Pbh4m1a*cu4p6h`3z*2+fw-r13?a&SO>h`d%YpEX
z(e|M?{#4cZkY9Vf)1d;nKV$+I3O<E0@Xtm1e7cCbQhth~RA3QdaGDdS_l6ol+9!K3
zj6!J8z7wv#*Li*4aBAC|#SgLGs(rf$X+>o6i1T|HrozRd;0(<U52SCfgSXmEdZbaM
zod36aJa73xgq7Y$(G)Z6fKqy@5o(rex$xJn$<3E26Y9tGs)ag8jwb}jCt1ozH@GL+
zrmNsvPUD)57Ar{Gz4}j;ek0d!gGI+L4z>>}1(u$m{5Lus$n_p*r?5XmnWccU=@K-N
z_K4r{h{;ZHgWTt9l^vnKqrWw4`}p>KabB4Yx>J)&+Cr@t?tm&2)5dy>hCIY*BWIH_
zlX*rBVmegh#i=Lj$S>Q5`T9X9aWV+G9y0xWn;aDH6iEcXg0*!=1HnD+yDQQ62wQVY
zY5eMlQECODH!RNp)sia!^NX~BT+Fu!Zbj?%UC#%N_470FM>5u%7tu`-#{QqXFaNdo
znW%4=_sp-aWzXOPv+r@L`gSPjybu0~24X$A^;SLTTms<sY}4m)SZaX0;w5er_qn0-
zHa_TD#4oJ}vEIPDv=!o0%u5}i?L0rt7=+#!JeHS?DY~%oC9It?2~i&a%lEqd3gc6g
zM+%~>2zQkxLbk9(3PG*}d|EPiyTGmTK)AD@-={kA1(0^Qk#ErT(CvVC#IL<-=>drK
zp|t7aln?@+XE~=usnK>z`yYQ7xrLb<`~8V0f~&@QmD99jGp+^}SY|-nm;KHe(;p@M
zLbWs-m4?}I^JNVgzlh=U5vk*GOrjPBV_QBu^uEt&ofQ6T{@3)+-2OO@mG#*rR2<He
zfu8|7c!c`z>k>+Y5D?Un|F3`@_y1qOPQ?Z2;P$@}yWjq>UK_(p_cEOf#4IbFDd&`E
z91gtpZK#}zYn-yFY4aTk-Le}ihRYbV9GmPM9A;{kpI4hjhyDD0pfmxH>YVmE{OHBE
zmnFmUunYch5`UKHWvut2E0c{oqc&c8czBvAIxaeI<b$u^!xi%5Nc??9^0gqA&O??+
zgoP>E;7ez&srGL(?cv(umBrU1E}TxSL<2mlla+Ry&is$A;15?bK@asa%dJ0OVm8ME
zw=$w?Vr$A*&T%?JO+D4lm}52-8+>_hyI%`lXgx%RND5a%aeQe>e0lE?hDZ)@6IIWg
z-~S=T2+1~-)82Cq<rl5|!tqTool!r7jp>$Y$fUhzA2KYG;gY-u$)FAymaf?1_~w~9
zs+=jtbW1k0?lpLtUaFl5#dIqtchlZO4he%+q;Xz;m=>s<smJ(BHO$c6!w&U;R<v<m
zXoh;qR(Nn;GEBEs&wOLvL>s=*-D3|0l&!Gfyri3c6t6hqyyTe%s@Opfy@OVaa9(ma
zrLx7d<#fZEXn|~CPOuv|stF7H2Sg<!pOQgdlh(uz27@eQIAl0v8E9%kn&iOz$xB&H
z%plF=rSv8TkULEcJWxpXR8rRw{G7Cu*%Sb}qp^noLQ^Poz8is1$?aKz02xBLHCAvV
z2$jYj21p@GD7j`09!}!UXmSSGORXJ(;%V%mfY`D*5^Lt*vLx>GCMKEnlqMiZk;Wbl
z$RWEP)1(8kS6s6LA11Y+0@qWxGn>w3a-`S%z+aMDgn-DhdJ=1<U=LDzX|M;my%pG_
zXtV@$F1O|YVj{Em1mBa^WH$-PR+HJ&0h>XK$r%*(_`nHSJuzMXu#@E;<uyZ44P{Mm
zlN30c_682<4bGNb&uRJs)|IuTsL5;61l7O|4Puz00&Qj2Bb)qX*AtuGWCennpk)Q3
znnGm-!kPfG0*nK+0c60)R1X-SbczQKP&(BE1^7XF{vDh^aqb0H60N5Hu`BU<2Kg&r
zVr>kRC%#q*%9C0<0p*FUWr6Y}*H%G!fVFl|p7h!i$Uu}}mWBM>6wFL^t_EhNIClZp
zlAg<fYst@Tz_n!Oy5L%hb04q+>A4ixf&APO>_B#|1$Ka*p{t+af6awUt)n^j0AG-v
zD}gV_&mF)QWaoz93ySjqFo|gOP+jUhX#mNiAP_zIo)wsw1oulsYHbfBB(|0c5|Uh-
z2MGbzeu0Ff33Piz*J4545^EEnZt=BhP`4C8lJPN*tZ!^ntE_Kilc%h2BIoT0Jjh>W
zO&a8{uttNEC!^XnRSxo(S~~*yi>+mX{3X{!WM8tI9A#cInl5RPW}fn!zRA2KHx<ad
zWHlMdyrgrsojQWvl-9n1?4#;a2ItTNQ||GAfvM9n+A`X*iAf|>LQ)-49ZGX~vNT|M
znZ(q5QXyHNm|HdQgp6`(KG`PeCS`Z-EfSbP_EN&f3f!4w2#eNQOWMs4u+<ZE>j3hk
z>4ujiq+65lQ3m@aZ{^$ygC3~5zn#3veiMBb1;Zx`|F|Usp;P&PJ<$P2rV5ALCW8{m
z{W(v}WWLEi^MZLO{9VB#slvgx(I91VfA$k~nF6`zFCa(RXHIZ=s&MFS7RXWZnGxJd
z?azJUDzhDNYcE?M|Lg&pq3{<z!Eo^f<E8XO-41~+MV}LJgyL`WWFm1r$o#dzo)rFw
zC!MK1@F$C)OIaV(6M5M>s_ukaqLT?3BPIUZS{i>Auy)Fps1L=73ZJqM$BA$1mbeeY
zi9M)Q{T2?ao!pas%LS^V^8W^Ypz`lUkY|Rtf5+*DPK+hHhJ0-2V00oqflm%#-OA{j
zj@&uQKkfir|GIYtqf@*&ffGsJWWb5!Z`R;MvbS%b&(1o7z9~N=f(m4wWkCfB&vc*y
zxj8FYk@(`7<bY4)tfT<y6RYF^?vtaW0OpgU<N)ClyrclK6TIXAw#PGMGkx*rQjn3<
z^8v_6>^U7|B>B7uG6Fm|gN&q~??8ZGgtEQSw>h%C;kSCSz45p1pgNj25AY@Fn-chv
z{OtlkK3z!ZS?F;UapRKeO<2$)JmVqt9pVH%<sAdbXP^vy&&tSco&qEiGZK9KG;-xi
zD~O1oyyFa$dnXGnAb$gb3&i@5FJ%J1i17I4xzRoep0Fgnlb^68zq6mzCB4(1)FmgZ
z@yG<G-nPmF=G=P91ZLho$OIO+DHvWoqsx9o-6qO@gxxC3e#E)`ctHmDQob>OKV+Ym
zL4knhR#52f1L#BaIT7?B@jL_i5Pz-%eZ<~w%Y5YBipXq>J{N#KB%ik>;$+CwqRAyx
zi@#o1B8Q@Vq+<+4V@b#s<EYZ9;;UxU0?aY8Bn~8SCDL)$<0`OKt%{i?G$jn8J22g8
z{)#Q6R^Sb_kp5L%h^$~y6^T)#`K!zsWKB9pTHKFWwh@Bp!B9-*)#Z*jr&4Spq4Vw`
zGUr78!-I0m;Z&M4#+q~PYjK0bUR0l-Yw@)Nb`&+1B6+p~XSk_=ik)<ErG#-0)f^{z
zeV!O+DngtkroAF(jy2jGx5PTu6xCXSHOZV`F|5QoHWQ_;MAHvzcyiHmi3X|Syl4-y
zwRCHqVk(^V9Ba>Fp{T0pd&(*@T{(^a1BO6(ze`j{lp|V3w47)KQ9aRKL@S9Jhyc<A
zRX&24d7@^bz4_aPL@h+EL~VHc7+uj$w2Ejo(Hf$)MEel!OSB)+{zL~59Y}N#(ZNKA
z5FJW%7}4QGM-UxJbQICiM8^>QgXmbI<A{zYI)Ug!qLYYD#yX8o(dks3PSfdhh3Ttu
zElcyQIfW^^DlFC9Qs30JZEo%Ad`n%c!b<CM4Y{^l-K<<qTYC#{GzX2A=bCaYH7H)#
z-hi@1d(+CM{OTtAO<y*0y#1t2u5YSuo2sw{gLa#{SIw%L5e+p>%SS9~1CQmC<}S;(
zw6)YUjmR%+9?@LW(wb`-VKtgF%dS{pl}#$99K55#qBHV!U{N-=z9~1ay>V%-WpT|?
z&a}+ZfD14?S5ud3QCQ`mIdY6avI=?A)S|YU+LhbYGz%_im&@Xon)(LLCNhXOEVU{i
zdQBtjhT?&PJc#p`?v<-;3*j+*(A<2>@)0#nZ4E6WTH2f1>Kk(-7Ux&ynnDQTt+}=x
zo!*NM+Lf23QMSO}ht!t0i4;~bXwKkbESSjZ(fZozCWu|#P~X~CjUH)JShsMQIJeHl
zbk$39%j=sImMN;@GS1;tMr(7fwtiWCZB1K!zDaP>2hG8Myt<+;SK9ysT9vi=rq;HW
z_FA+k&8^ARwtGlA`wP5nJHrCGmZqA9>elw9%`N%m=np|<N~(%vYHe#o({h^u?{Y7A
zqNdi<NMC7N8tQRXVQ;G`Oa^Cct*wD7)rFFDLp`{Id7&r?fjqCN+7&(u1J&rJR+uv1
z%!gebUX`xPEraLRd5XG+ca`NC6}dHSxu!bMcmWj_Yp7Y8Ye0utKmDB;FO(^)q-||;
zuA18k{H^C^?&j62Y8u-4Xdkret`;M+fbXH$d?Vf+Rx!uIORcPLs;h2AAgZ+#-RwU=
zvVgj_)-P|e^{+1OhH`oFxc`8gH8?G)EeipAX?`CGb~hnVORlCtQe6>J-nlm4*xZm?
zBdIE}NNh*%fezWIh$Z!nHOoa~+v^HO9{-<om)&1w4Y{V}Z7V!rJ;K3kl7z+GrsMr&
zj~aQ0RM>5c%IEzD5^p@XHRP8g9>{uNBQCgclVjYr)UQI9TO$L57}|P<Ql1a|#%5k2
zqRU1`wG}LTZG>8k+l-H=4O{=eG*-ARtj;a9_|~+wwTMvgpA2A2*(yJhKUSHNN|a(g
zUWKI!H%@DA@Ah0%En-y)fzWG?gZ@v<u~E-RInoJ{$~+y*Cq%!a@DjiJ<+56Tv8M|R
z?kM@D97b5d*E-eJwAED0YRp2R2c)N@)Gt)$uomzNFCVU6uZ@f;F|$<pX#)K(sf7L>
z30hie);gj?w_HmL21V<N8Zk!&L=S7>(~2)}>uVb7_pz1@Fd-HcwNew#|6jV8WsS}O
zUY?%m7gpuhvHM1wS=!ix$8FLowCQ5G)zW-BpW^_MtHbU<OeL{Fc2F;0iWv~=%W4P3
zCe2t(ojSX0BN1WF#^b58Y;yn=w&MRLv{^Hqv&MCqCmp@GDbYpV*TDL?s0uLvYdXv`
zE?OXRTV3mo3wBA@KuLI9@N{j3y_n^_=B{k{RP7m-HhPu6Aau-mu|59JBT8$&y@f|z
z$~Cn&+LK<&d2|8{f45h%p3-=s6nhj;6Q2-efeI1cEe<x$^8XW;;2x2&gN)CldQGjc
zCE-b|mdl+-zb+|XvHf0;#a=y}pe_&7`rbL8ww64Cr|DTTt*U9Mw|A)(VwF+YPTBVG
z?XWz)RpJRD33Ok5+gcHvJ9*yx5~qVT@S$K-j198mcS%!wLxUAFtxZ&IuC-NgtKj?5
z_L}9nLSV4U<KCcc6ke*awrtE<yQkW`w~d)w1MAe*w|T-g!o8$45bncTKvKS8bjO1$
zw`Iu^@m61F^^JJ;Lznu?VX~TrhCDW!*1pol@fF!7-^ilbwq~~=jh}6Ww3@qU>)NK;
z6)pLue7md0QfrH4JtwSZyI0Zip0_~92WwDNo3DeE*!sDy<}0!l>lQ2u$StjgjCL&f
z-%qC2(lX_uW0}b1F1+WhLmS8)EDFditwwmV%Dscw#;)fB*pKZgl3@p{9c+uIh$~$K
zC4tF6R_l)*g-uS?ihM%@CLnC(ig!Rp0jW?}8tnbjVBfoA$*NA}n|XlXM=^HuX6M{Y
z6!hRHDs?UgYijT*)G4F^1T3yWuxQR(r#}L|v-4W)g_)u%54EjJrj~~tKVlDGSxswe
zJ`iU*g*4zx@}e5+I5FRb{?0k0v!u0Vl@l~N^Jn?s%oJ5Yd~X@LqOGQ7dCuty=S_rr
z&s$*B2Wt?cZC4Uqx+>p*sP6{0l;!wVTn)Zk;k1kI-OtM?u7jWrxi-t*7I`PnTR_lY
z4R~{xuo{U)hx@*~CEwm$Z6DuN1WKJD+FM%gXId5BhR>9Hw__pP;N9f;ig?`V8Yl^j
zUs){-<t=vP?NMA9aK(@Y{5U4x*ys-8jCfm$>13raQcqu*483z$3wzZVtis}`ux^Rh
z<@m{%SoalP_$Gc?dsA(7i*<0)+P<{aI>D}P!Ro=<;=?%wlb&{MaaDC|`?6*AYq*Dq
z^PK`?zUixJZ-AghRXs(F3~yl{p?OwcPSZenw*XS0I_Y1-mAG2+<7B_aFq##HEpw1{
z25voOT65xr8trRa>YJ_eb!Qjdy{OjTbCvRX7;Kewp65j^<wuA)&rx4WtU4SIU+_QO
z_S&mRi$!&w^RIB9gKI8dIgh*f5OveR8h+@u@m*(JC}}NjD+@1yeMz9AP*NDAT>~Y7
z;V!Gi_$k=fyT+B228Lu<3pgELnb$8{>rTXC8gk^U@)rblfs#tTHpvBiAt6fauIuD^
z3-m~^rm&dhyH)RU-&^iAMsI0(AXtaD!EkAAfor#5o-{D7FlVkn6xxSRpKF@o=E;WK
zs$4_$DDmokj%jZKjrCb2)tq0=O~Sv=G}ZC56z_X=wet$BMji#+h85n|>T2<ZJ`o=a
z+=hvoI?tQwd8@9rUtBpy3puI4Rd<24K;to@aS7H=Fpu4)1r_`u!Qow|*w|t9tkbES
zf0KuQQ{JYF=RGD!Srd-OB)<3RYUkCJWSo$sr}wqG+A%gZAda;)hoNSR0nzfdo>V}M
z+GrUGeHqqUFmGdFZQ9AR67$#mCttF}moY0^2gg>zI!1GL!ks*C!3|fSrcl(9YpiK*
zw&sX#!J@!ULRxK|lViXIMa!&Sk!!JsZ{eF@p$vAjUpya2wLx=iWy=Fq&No%Ncxk?F
zt(UB#v8Ht;A6^ZuIWL1MX*qm_J5Xt`wHeY3KH+VaUY5shroqQQSmdl%MfnPGnZOk9
zn1!1ga?UEYr=&Cxd&623SO-l~Dawl+u#D>?D(w=(^X9Tl_?pD5)fQh~Eb}tquZV5V
zS}(~BSY7WNz@7E~_q)i(zg}9RikXF5#Fe^KJh_(8-KsKs&FL{fx8lnP)jWm>b7_Ob
zt%SHuDLCYu7ET9X`Os#q2R+a!w@@skIaQ#nw6><zH-6IgTB_PA7kfU>v(@*aiSSUn
z)?I<6t#^A*CRT~vf<?g-7g;r5GX=|?rE|Pc!y`Z6tJd2SY2mg;p;QD^r=Vz|ln&PL
zX{Jzw7+%oM;Q9xlD}+I;qfCh{Jzx3~o+9TkeR+FLi?hEj_t@7%mb4FB9bm)mdw-#h
zSG)DW|9^*#eQUzLy5Y){Y{=)E3kSvtR1`KD8rPa1O(pCHC!FF5(?Mgk@4`#Gc5SV@
zzc0zHargEm%kyn{cR=JDo7?%hg{LrKhcc&${pN2{W`DT$Tsw(3*R;FtZ`APfsKy+I
zP+`2MxK{N|?ioZ$Ya3McKG#~8#Y%H6E%_EtWs0AKRu^JqiS^#vR%7{;^BmY&_{+JI
z@d9ff<Q}IwyCS!`G1r)HaaPwQp1|QeTP)q@084+lb>Yqfk+Pl(omuW&I`ZEm((ChB
zp4MB_A3vYr&(%%V)j5cPMVLDWfTqccFV@`F+4~weWh$!T-qDbEyUTg8fGP_wfsIn2
z!oJ4hjL7(Ebh!&?U9WR|rQZDlB3Seo6n_1}z5)~=3GBCIwHO_kNE>+v#p|2k)722C
z5$Y6P0_p@R&|mrXwgO=%&s!i625b0vS>AVcT<&{!7ity$Vt1IQ>e^QMzVNKBDGXQp
z+1^LF&jHu-m!n{5P3_9o<{I}1D~X7)tZ?3!XvwWEd`rM4sI}e>9rkIT?>%tZS6l~+
zFKcLTUEw%T;U!@4Kt+Mh7O}nwdjNO!S9rDk+xr^u@1iPuRRw2orVHoIyND<>5*_Y&
z3v_s}2BfR1J@+qDtNaAoDrddkSX19r?c8iE9O<oTvrfpI^BebmW76B6A7u+lu^`Ub
z-|;;~T4TP>y2WeQ4}rC%r%)_Pd?l66Tk!T}rl<nbdm+9b`u}<6w6`uPA!L)d^o-rF
zee7x25B@$$cnYz}%r`Zx<wF@i{OwBIBKuU&F>r<Z?6+~Lznp)QuudYX>+AR#{<8X<
zvmOdI6l+z!+eB9sUi|oFfePy@ytAzJl$Ke0!exBOi$!s#LP@~!D?BwmUHs)j?qH#(
z72gcmpFhOi5;1n28yEK2&D4QywZANZIGAs7SI7L;YfIr1Q&j=6_`CT3_ONn}xDSqf
zwX2s?;Q7#AVinlmT`Jt?Kp6Iy+m;e{Y@HpTGwNITy(Rma8#WH^+NRvAc;R%t3`@Iq
zScjjEi|ZtTlHie~q?VtEy2bqXbmNyGO=*NGFO+&cC*>;^9atT5T|jGw_I!gv2%zFI
zVLyl#DW}4raJDoU#jX5A%pU00RxQA}64JI{hOTc4ICoi~LSZZakFHmW1M#}{#>Ta_
z?JL~pfCu@@#aJ&AJdViXu2W$W#6L%UYn6>j#98E4wdVNeS}e^ZA-#8aWnsc^Z1xrl
zBU@96q{6UF9_SKlyOMYJ0a)o`;NzVyNCK%B8%^(UaBMmq+nbuE9hzYzgq2)%@Eb>^
zRa%?JKynA0b&6PJRfHT>yHu<B7xlKBt63+j!aAc0)TFJNW%W(<?pmhYZR{&9vx>1U
zTkU>&Z@`kidPPlxv$NX%KRUMD_^k;K6Y)*FP*9t1UR%Aa$uEg*34cN1E>EXIg>_8H
zPiMseTS!fiHn#@59)42cQ9RznS4C}HYP>A6E~Cw|I=Z_r(`cIISyuAQaPB3^$kfQz
z$;f7r&6APw{GSPtiOI+${?BCo&y>hSg|TF0dSs?fXC&!NI!j^7LY>Y|(m8Z4o_paT
zvKT=oJ8SgFk>ep`(EFyh*Ed+_ips<!ok!;<BlGA2oi0q$MRakJE{SZ7swo`rQk^bK
z(&cmk&ogOnXy8BcP25|><qU<X{1%dv%9G`REX&7w)?Rr<`Hy5|c4V7mWERKmT-4H&
z_rd7`nLLGd0OLP&x*|ze(p3tJ)uK}@@HxR$nyk%sdSnKM8Md1{wB{C}TX=36-sV_y
zwJ1p21=c5jQItW^OnBA|=a{9{e|s$}%@4{3^MkAcZ(BD%C|d|L*+70!HatHl>l_xj
z`9WTAksp+GPBg6Tc(ynP$Wz2W`g&fiPsyJ5LJm;2I0wj6R3eJzH|umY@0)A*lB{(r
zk@+*nL7Cs|$p^}M!4(#1Sn6g21--&86WKsnPc~52y1bJWhl2Ww8nES`TM~Gh)(VB|
zTd{N`yv@ir@U>zgPbllbB9Trts_-}({wB`rK)o$y{6&TD%{<K}TZqk?HO@yl4<Jnm
zNph{N))G}@0dcLf#T^mlwRSR)q&87kznuG~{W-pb^Il+Q_*m&aSx>r;gj%HgWO<H`
zq`D%cJju&v6lMQNT3XpZ!i`IzHu}3j$8ERJhh!a7Wj*;n9y?n4%x{@%*|P95+D-5A
zv@LO~MJ7+y$>hm^=VJ7nWuzU&4K*<y<QA^5>5IxMJ(kaUZCz2=4f)C=t=0u>aZN*l
zsMWVFZs7tsIXSi$7IJcgL+ANGY;5KgVnp}aNUazh86T!i7Rluiy-Z<}Y1jcQg2&Ib
zZ}6aWYdg%&LzJ}(t;Cru-ztc)QROf2k4{rkS;&9kg8K7cyrQ|uCr-@rXlPIDy5&y%
z^ssB7&M!r|tkz%bQK*oH;xVt4hLV-la3L1i*L(}r9ysDZ7F&^`r=)>j(#~NmyqDmG
z_7zst5@pl)qRtkh)GDtj6!2g(10FnA41g*x;hey==qf*(KzB+iz3D7ji>pvP&SShi
zae8uFvevBznd)IJd{&X>wn+OWX~!C8i`zNS(9=Wx!m9iNcHd~TLSjmxNvjaWN=(UG
zYs9R(;}tQE_u_PWzqr7rUt~|?ViTElP@UrzE`(DjR^-kyAnPV+q}<K@JZtNi5H<E&
z$`!(XHwrTF2w)F%Cy&Gf$|p_h+PLjkPF_jY&MS%f(@Sjo_>V4&s+{zaY*BiNZ~EoW
zwy5Ra;9Uq+-q>K%@C@jktPJR`fx7V6;OWdlDoSAy<xfR%!k@n&bi8=6J?_e*iZ2z#
zj`bRzwrXe<IVm2m_T;2^N<C>PegVn?6(Y)7pu(Z-Asb8%aV(FgLUM@x=;x5~72EIP
z&_64ZLp<+U_ai_F51W`d`8P1rGy4V-MY7&?wU`$mJa^OjrR{CG;L_XUH6@-QE)qvX
z<m92j6EHJk8u7&y4}o9dbg;%=P0qvi$DWI<gp#bCP~x6|Wj!ZgB3mOH$TBI6YTNWq
zxjn_$?jQFCSflWgElNGf22xKvQPm#FJ2Yd3KAp!TPbx}ybPj9bUY{4xn*HX{(mp8x
z$E+x+uXC2`Zh@Pq;#39`RSHDjtQ02zdW*!JesS&3J~`_aY~bfnA*~K%r3hYDR*HDG
zqH5N;yRJD8nR-6GHs+hA^OI@2<2reo2K*^l<IhiVRP+`J6-7_m45(pgOHJ)c{&kmH
z+{bP~vVh{!YLV9B3^(^VTS!8&-+hT9-l6~(X|+fc@dXP$Fc+_=Z>if#++egC@VMb;
z<tdV}3RXL;ED=OFqZ)Vn*ELWXm>^`e{+K08PmwI{Gj3&JyJHm4WhpD74@!&r-WhXt
z7da^_PIEV9MHJX6D=r6X=I~#;4{6|}toUjQNhbo{Nm-G2Sf;4TLoIX>3ut>Lw-Q*g
ze*7N3GV7vEK>UyfB7wzU!|&1B@9tC1o7CbAbe@^wiC&9%qRLj*FtsJMGhL)(I#X2T
zWV*P~LgcnMkwm<SeGPn9gbh!5AZ!F{oSYZOC!CxY=iSL$aTXGM(sRzWT<d#U`7>c8
zQ-V=k=VrnP@<=^DGQq#2-K-c1P&!!S$%=8Lb>FQVmTVv^MwAw1#rVqoOsm4%__Jc1
z-KVc8m=(iI0%1c|>(7eG%Ccgl!gdO2;AX`*K8vN1HR-gv88TVx^JvzWAtTCUoH~cK
za5H3lRWKDF8hlCM8N$5CNeWqL-}dt)%<x@5UlwHp2{T#iIv=lvXA7PpVWzk$8%&tV
z7AMSPi>pM!Og6lQedbi0Fp~|GcMBi|s+0b;Y*|1{dkHp|Uwju!Fe_=sHc1@4i2Y65
zLN|lPF7L$cYNx?0a*{)Ai>Ix@jJ0Cn4AM!r$$AoF67{Xq8kg2DZ^v?`kaAOK;dg~f
zdA*x*lPyZQ$x2dgoB${GZT5<rANx(?4dy!<*!eSAD+z;YM3u8L<Hf;Mp|9MZN)w1K
z!5V&Wo8zZ(ogFForrYnrm7Xf!S&ApICa}{ARCp3=vPFqC(xF!_tMw$-_*U>eC8dFp
z9M+<cSmQ1i#Pk?UtdWXoN-BMcHO|HoCY+h8@%6HkY?JjR+Z1<iI#}aLs>%8{INoxv
zfqF~J19L!l8z<c(J1T1@Xq1Yt7(4Lv4F0LY{nBBj*JKOnHCZ>8guD3yUNqmIaFg{X
z+*q_!c+{J18j*!lz~g~oJCw|CZWSpxSzk&{*3F@@p0q}*t(&D&0E*Sr)y;3Vvvmrk
zeD;{eD_ZT$ovb%=C+lS8WDB`4+0nu{aHz%^R$`7toU|0!*7+552`-2G76*p=B5=kC
zoLEb)fy*Vbe6miKPu9uuDG1BI+04sZ>REC(IdV67<Zj9f4Cf)9_jC_|ZhnhJW@iBv
zs`y92t$2}D+sRiea)PpjL>}AjIlH~9)HtD(X?-rVd}VsQ?LDnd`jBYkrVnN9^dAc_
zBPlDZ^8?wrMOl$sWQ(-at@9)hImg(Zm9W2t4_9j{YV}7!yKJG8nPXR2IYZfC*bq5G
zSzpeOY`qt(aTA2HZU#_bTPLj+2|`73*a<>e-*uRnFHy)@)7dZH><HVD-Osvw;lG`g
z?6Z}V#AEMLJ+I{f6z4mvUCi%{c{zxjqO6+~B$`)A%SEzK#QK+icb*P7uYjdN98(Iw
zb3?M;W+L0jCt0w_**S>vK(<j<WDPkJlB6^+A%(RlunrnaWE&NGt67i0YW4awx5~cq
znH40?4Ya~rFbB!`PEfzh%aXtH+#{!!n=@PQ9JE^bJ<gJbb8~A-#gjL`$8j@z#q42X
z--UE2IgYm=j)Fpjv})W}H>bzvwQivp%N#LKR_46BP*#?Y7e-{JWUX?cujkpau4v-i
zzOrilSw7;F#GB>gEeak$$*M(`kFVTW@29NI1%I~Bh~kBo-mD+r9gIS$h=QI(o<L{{
z*7&H!eOqpaAf(9lvCp3+HuZehH0>gH6pL>%E~5Bi;~{juZ&*1&?lq4>Z+O6y_8GfB
zCn)PL)bT1@&)S6Kn`gLJ^X=OdZUZYpr*LRrR+o3hwm)gcfq><mxK#l<fBsI^$=@kJ
znt0;*J6Yd_6sm7(&9$`U>YP*_$CbUJiw>~TdmIPlX*!Ou;@5zP-yQ2_`(!<BM7EE3
z)2ybWoQKh#{2wn-nf(#nbJ4`k|8as$A^)ck4{XFSo<tz`T&WEvE$oUGwQ>8`<(wKj
zEhvcq<!NXo1!W6Ci?1vfp=eQCjkAHWTG%-|)GDe(#*kGU*g*NqMM_ZC&KPnebvAWv
zc0bQ)68&tqwbO^3wx0M^W_eZZN{?`&w#M2P)mr%rg%DTa)&^wsm%AxOj!mrRq7<WS
z;F^+NpU-+yjI8IZFU81lACWke^`{s~X0l9Cm6KKEhE4vm$dh3tK`9GVhzuiVg0>6}
z|DDs8YqYIsCmng#YxAwl98Uu)5y=S<_3qa;FOROW;=*kzD@`ctO(wEl0+I(R++?Dx
zFPTU}nGV)i$wa<y0Oh{-tS6aB`W=xc6M4V-CHS-JT2?xd(<%0IA+<=Nf2qIRn_A>K
zH(el-f(k2TC*jB$*LK2@<ETy&k#nf(dk-9{7S}n6L(XSS@wMOjE%JqmKo12f3K*_)
z&EoGK4MbXzbE~D^I<6V*t?*?g$%aKym78?r_@wjZPtf4LJj<#n__9N2dsLz>*IGNj
zWhTFG<>oHQ{3}?)bC>J`L;Jc#ycud&HzFSMUEeA{wYJLHSMbE7tSpf!>weJnUc}@d
zvlob~{YfvaJ;g4tUlzHx-^#fIy1){ui*r?_sit9(3v1UoNl{ME<?K5oo+6P86<FhX
z3dPdRS5oP`1#g;WiYn|}C{JwP&T27F<RPW3D|}7v1u_1ydcKuzBr=w=ZpIQeuk)Kn
zIS-@V)Fpo}Bs_(-{lq0SJD!%f{On53Yll{`YO*q%{BR|1k$r+{OCL0IA>YYw$5MYe
zpZlBwH^_(-sH`^yifWo_bFKF6PrF(y9D{gbE8tCw%DUeK18GrN&u3Y)uxs#?7Sf`!
zMQKsNQCH!qX_KZ!Ijh7Pes*0`>)uzl6e()uVI9bm5-rr0)ovz~6B?aNC}$U3peeri
zk+z3Y?VLd3Qb81_z;p8>>PcwIdJ>u>pVUhI<=%uQCw^Hspm<Wzw3g+C*lDFSIZeD8
z6s0s--!FVAO>Rl>Fj!LSrZi=(v>H<yi{f^CvE4dlM;3THk3pV%CV!Wwe8u8&j@WQn
zU6KvCq+(4*Gx$AweoHGGNN;j(o7A_?w68#l`-o0M=gNqk<s{}-aGMKe{63o9TqHqd
z3rSGffViF{sKBrZRM_!rCeJ!T2hMc^jJW*f`8Z*BuNcgBE|YEanDy-BG`ZiS0y#~d
zPgtfH^?o_*oTkEZf#)=N+<cL>lyw)}Zkm%bOq@)ntRz~?XA?WR_YNoYra*b81u;+q
zF)!`9xm#3eO)?T%D@!WaXG!N>Y=5mZsce2()=qaK{=@F^Xmbs}wQB7m-FhntDjWRj
zq}A6gwm$7xc}-X(W<A+ZSvMOh8}coo#744zgPMcD^PjT(gOPK1U{zS>X@MFmGb(GR
zKsnLCZR{(yGNZCqW|Sz2Suggn_ExK`>B34;%JQ5c&(d=?UZ;y>qr&Z8UOFS+ymnTT
zkF0RNf;SMC-3rw_87jNXPvS|2Dimb>2~Bo|lk()8|Ao{9X`N)Kf?`R!gf3Os$gn@X
z6qXMKg9rbJk-~;`><>6i6TR#~ShTj)T53ixPBFagoV@z{2#eREHf+rrC!r4{#pu0e
zTc8R_avx7g(`uTVt#jC{tU*zcNWcQS@<Gx+jg$_S@$&|8yE`&y@ErSB#Wl4xGzDZ5
zf9r|M)F~v14z$a2ZHqB6!&wTHJfbYOuFP0xZS$8|f5XZvooF%1M>aj5=Xr~~@vh#+
zqI?qT9T^iD%aq7CrZJW0wK0aD<HgSjk%`vNN#f^Z@pB6QsSaW+GBvUVsJBGvu1sZ7
z{2VZ3JyV86Z)56^$Zae#M7@nghot|yjm3tf|GbT9L(&^=WBN^KsYIsX-#(1+Z(q=M
zWhJZ|D`nl8$$GFZtSA20i}h#yz;SwHhTzj5EhG3@GNkJ;gVwW>0#qC#Fg6f?gDjGn
zg5+xu#PIW^$Y#+Yw=(rCmc5z9jl?>Z?3#&uelaWMuPMA<!OX51{rOAniiXM2&7!F4
zx{j4rM9*Rg-mDDGY><9<y^E!HS<f<tv5uL;@c-7sI#zCB_06th73Z^Vfp%H9$xW6u
zx#$z2H)BH~=rE{}Wd<7#3ygs7BT+gE{~OK5vT<w@+l<X-o3r_BJZlEkiEMIYD@*m*
z2G&n0GY9qr;;hKlLiN5(!T%W3A;UUW8MM_F==Lo^Fgr3w5bO>SxOqo9Cb4z(=wPYY
z$<+ZBL)Wp+1yu~o4Q8MhW}+Xqf)cYV5hF|)WU<;tusT|>n&)RVU{kEFU_FLD$_)N?
z2kW9R%hp!kRQYV$gX#Ep4g}eTm9cFh%v@M;9z>eYwqx5{Ld95Qw4p<wZ6kAqSbbm_
zZX0b#S2%IdVv9kt14_1&w~qwd?~L}lu#(8U$b8X$iRh9+RaZ0qUq5F5$6I%`#Ad9w
z(e*~7+l@x|8x6YARjAVP;w2a)yJKkV0nXJJ4mFk{8jE&QRTVrIM79^4CZZ=eYUPmh
zGNXsl6N6>QP^0^L)(c~_cR^CS$5uk(29{xstb#S6W})juBT&yJF5@_TjJ_Pl2T*GD
zV>1Bu#&Ziw7ey8e;weIiE}XcZ(Vr7{y`2p(2Cip=WOB3trk$0uRje~xjhY=II|``f
zVjOQiB*UII2CrvBY^0$asT+S9#-F<Lr!0S}i1NqbMT~6EI0*6PV8oh35OEGg*f<Q{
zaX7};5oooOtNd{8xLijtea;xcnM!m&7Ffrz6gwWJJ4<PwH%5lgo(9^}L3;*DcahS*
zV2lc(JrA_!gZ2WH?&{inGU~X^JA?K`W3+3iFq2;fl*?g>D_AFXC2Dq)O7W60CPa$s
zL4O0JxDlmGq_i&^V?$`yfp$G;Z%66wQrcIHaUrz#f%bmTK7i6aq_nRZn}yIm2HM9#
z`vgj>rL?aZn}^Uo2ioUB`vOY$bcfpnVfBh38D*p~p3@HHKcu7WbwIqq((Fxm`dg@}
zk;05JCfG1xgZ2Z!d<dA20P`_wmU;$lL=0Ml)tE6cM3pZw+P=c`KT%pMGlMePm=r?$
z1DO8^GyH_oI;s3)jmaCA|93$A0r@vT{y$NZlfsNMrfd{OiLeqS%F;@Vl`9%vmq|6*
z%$O?IL`i|Zl%<q1lrE2~5VTv1392V(H#fGhMc9&yfM7Gtm|irRtN^W40IU+ibYfLX
zXVydMg4%kiK;w-WAp-RTMlT4|8>M?mZ8E`_X$!Pfh)o6pVi3d_44Vu=%}Q5<ks_X_
zEtpwh0bLoz63S>+ri?*pgBx6?ihy2aQE$EJh^~wS&StDa*&MU=c+@mXjd7AOJH!}U
zK$9(DjA<xsisS|D&Zy%qGz_#S8*@aEn`UeyW`k+QwqiDzX3Q;;tO_$GQ|1798)hoo
zvhK=UHc;7)4OQl$MRR0t!KFsbIitYk6k|Kv<ny@6hZ*zv4{Nqr;LJADjP2#Kjj|(H
z?S$^wnRQZjVZD`I*)U}{Hd4WIAkq?P73>xYr3QfAsm4N^-6EUaV!>{ju|tSDOTnWS
zJnFzB2Oi5<e`PsZv`IbaG-F2_f2R-+Y6M&p;PUXGX4JGtRtcDyVq|m!%<0C?Hq0)z
zn7bCC*~4NL&{hL&4TM|Ex+?picC{<ma3L7?gfooYLOcOewsJ5$;SiLrkt%hLvBZ{U
zLWojF1L7En@ee3<ENa$DVJ<Xw-?(i~2FxjdITbLcp=KYcZ7wqQuwkk<Zkuy}b}rD)
zgKf@-ZTNJ)uXL1LX6zYa8%*NL<*>~aDBUlzzo6YgIMiU!UT)O5qhzT&N^1F2RuWom
zpTgX(+<+l+BZkOL*katw1}V3o#Q{<lR~U8wK8riS;x4eb8!YYti+jQ1KD0P6au9Pi
zml58Q4F`)WjT~oTjk{%qRo-&zG3JhY2_H=P%H!bk1cLIDY_Rea%PLQ!#lew71fOk$
zDt*A`Dq{ubW34Oe-AGc5ZTH|yz<wFnuRw=aG4x(T?V;`-!LuM!t~T~^O|&v3V!i{k
zcY*dE{Na7n92PdMH-tFDr!1~~#!8jXQF?gf2thnwsMi-_Tw^rauGwU}W}g4Z8qFbn
z^bI8X79RQ?B>Eoq`+@aQeng8SBS(2=%cz(wuQm1-wwq?O*qtBd`hNg;162JJv*lj^
z{u{MNOI`muqgAf08e=7@#!@QZ$Q={;hsWp<Vf5>aHn%eu$c?UI5ulbbQ!Qhi)HG_2
z4UwWfM2bq#cY+k1QF>hDctLwQ>iBMB5ooVBR)H3q*EsAxlN;n#7C8%V!}wCOmor4H
z!o-j+QDZfKwVis6<=+~AT<cN5-Wd+SGK#6aAwVBiuJ&bp)P8KR+MkVA2e29HKsHYu
z#1^W9oh@&9sshrT5IIpY>)c@MWBbMCwqJDjPjbbsp^gCCku0r_g55^5-s%|EU*%^?
zCrK9^HyHbdEjZLkETK+jW$F}^o-AE(++ggt=>><n1#q@x73wtBMV*eCQ=~n4qp^QT
zPtJx$bI_Cgq~g@bX&x)_Ak-VQHyH;6dJ?_mjc=YEySfl?i_kBNSvPeD)=S;dIS(lZ
z^6BpAoF#gp3-E6?4h-P?aBVf00C#ub?!h{%)n3dqq)XUaje|U^Xlra9ERSYt4#>;U
zrOR2Bx`Opk>rs2Av^#G#4hikfW^}{e=uUnhaF(<?Z#53>KzFtQrybq73f;+11kRSO
z8g4TV3+c}Nq0Is4&I3_;j%<^xtTzsKH_2h);c%cFf$(r7+?>a}bKOPTVozAT-8dr9
zan`hPWYLhd4SfPYPed1<1S6k}VS9?V8_$!5vOA2U+)#FOh^%J;_H4*{4rDzSHRntF
z?hfOa(7w9_Hop{ocNt1AkoMgj#y>jHcUJ)CO7z`T=)0>?b7ABnfz=|0)6^lxvBq&h
z&ph6paZf0$txqh>@h27WvksEgTNtUgLhjqZZyoEau4lv5+t~#54mL%-6D=>6oN9sp
z$)SdLfW_4ZS*iLEN-vR|YJvEa4%p!lz&whMehg#vanxKYT^rnGoa(L(P76VL7Jd61
z`u2JBEkA&`Oxm}18K;M;^cwo)b=c?)lwL0F+q;Z2I-t{Az<C>e`wndVE^4ljhS|G~
zGegGZ$I#>xjLT0^dS&D)&vKIQxcY(i9^<UQXtEvQ?2zH~H4wjnmA_>@)$h>z-+PDC
z)$V-fU8>w`oWsTQPISei%0~Ye(0@Zz{2fv84-D81sJ%vN{d<jb!>k`sSt1f)Wf8QF
zTr0Kyy~cT)wthqdj?O9~#JWUEP;;GhBDv2vf0GkQB+W`98CD)KSm%i8HQDu%8$2sx
z9)bAE_<rL8|B<3KVlR|iEm8&WuFQ;dW8EX&S?@>>)ZQ2(>qVQEwLjnnK-Phfb&yxq
zn<6($;_-vV#R1HsHK50VBEx|`0_Y=IkH{$2Co<a0;g-m)f<v{4T_eEZA>$I;fiAU|
zaF>bIz~zOt+ZFONfyg9qo6ORYDXdduD(e~9f(-%u@CZNXxXqozy}|!s<4Sj7eN~8K
zYz@@eF!&sx@)gWF*Dzkcf5f=jokp$++n?D+SpdN80l1J=MHay@+-KKI{r(Z-+EBmW
z75=&#{GK0p+%EO|M~v$_;P-m~ry730C;Yw!HFro?1CJWl%cD+YIkZ{9QW3tUxl_7O
zdd#@No{nyGr=y!foVyudd!q+iV47B#rVX`sNlz3WH*U5;Z;_uUMD_vHzJS^f?#H**
zcS|k&xN&Q!g%5>g4ugdcN9jFM3qNk$)&UD237n%~;iF;UV^DLiRG}w~bsIgDMYJu6
zoCJkVhC-*H<~}LRlg9du!(c5FIU6wN0EVw+?w8u-N#piVyIc%?E`ePxMd<@lyF6*!
z(E+<$4xB4smn&fxK3hE~o$sD9?hNs~8=%RJ@VuK)`jB)T`m}ME8(HrTkpf~yZpUc6
z1H+rIXdaesP@XaF>F@?6@*p4|f_Wci-6D^$UXe$=QST9HtbW$Gchj-@8Q?w(+~*Lh
zpZ8)uDjj#v8TSR3f!l<PyH|ny8l2*FjJr25?%qW0V^YU>&bU9+G2TaqegMb#5T%bx
z9pgFUfetvv$H4gnj`1lR<1^Ge5qZ*MvY0U0^TvalHrY2&>|2=ZJDAM3dU;CfY%drO
zg*e-<0Qwi4?KhM@Ev0?YcsPXiZ&m_XQc(q^&q!%sF&>fAMs?5<X!(-lS!s{FVmunw
zBhfOJh^ARtG=tLTq&@PA@z|z&Bx(YuoK-|CSeIxeYMz&B@v8B7h!)+TMR#by7b`DF
zm+G$>Pq<6<Cqty@2bBKIj1FL(q61O$qEw34ji*AS$bx=2q!@wHm!!*^pN*$w%bRE9
z%bVzC0Nk9FN5``s(Fv?ibfVY8UY2e*e=(lj)X7<NOTbQpp3|Wxzo+wx6zNyvIsb}7
zf;0z6+W=`>AaSd|D%&nTZ@dtU6EALJyZDlPyBOVpQFKT6+fMM4omt=LE^K&oS2iKK
z8=Dg43zgSo+r{UNmqQ)6mc^rWtTdWK>FcuX;`7EU9q`{3fT>4E?ZrArSEA+(E5dOo
z??U`{<5kILuh--;Gui^%w!*e;tb4Sb^^Won7H>)C<UfqpZ3Dj{pOd5e0cwAijvfFJ
z`Kij=Zijp0`3B=n&rxEC2idY64!|P-cqFTe9tGz-8ny4Z2P{j4$7cchr|}jC6$hv8
zG3DFtQOi3;zHc2<Mo$2X6X8}T0sdq*D0&JT7CqJR|4!iau5?QN%XoKF_a~xf1Nt0T
z_FTZ9hnn|7klx$WAyf1MAYBNgi-2@7YTkE|CJCfYLyY&04>l>%RdDR9nGwB)RYtEx
z%?HvT_P6n&>p&lcAl(9yZiPs<L8Nu4`A{0v|294j9TT@B7~g?G##bvJNrU>|#wQ&Z
z6n6vX9t8D!F<ANcp^x1S{bb=F&`FIMpSs_NJ_|v56goWyogRly`~t`)uB$B<NTaO%
z=;vX_^{ZWX`y#~Mo&$^LF+5&Cn0*nh_7WQzec5t1s9l}{yH91afvOu{hRg<U0`V=(
z25+PEGg&8q_N&lN_z=eX2%W%hiF_{W1W^C81D)_Ga6UsPe2z}|0yST_%fkj?x^ciF
z<Lixn=@4&O+mI6TeG6s3gZaLP`F?=ueq>{#KNY@TaQl53`6@6Y4jN*7V|;7JobSTs
zhT<<6(cdvx{(x;ZK&L-33;e|fM)`NBf6Ai&H^%p2Mvlc;Jf^YI82=FUwJiF7WBjmb
z8^=lj6KCbI1nV42qUIZ!jp3d@{#Q1R8LT8`f=xN=6RTh&W0h=dtdrly-@2c*7mL7-
zRfifkezJ`$85G5<j#zi_>A}*mo~%c#7kKq{qAp)ueJ9%rs0rg|o5L?|H~uQ0I%0!>
zJ{agjSXFE&I1EGW_tN2!F#Z+VbHiC8HiDJKMxyiw>F`JxzjdJNMgwOItB8$dU1H-<
z^P}5!D@E6h9b)`${PExQ+$2V^$;^yRVZCEh*@)N{Y)ouRr{_$o=YDb-7ebn`!T8fQ
z>t8;me|x?<W=(~KaNQbQXTwHwSohdAY*=ht_{>}<q;)R^yPqX?H#V4x5^DE(u-ANG
zE<ouo61#J1wF7ov2%JT*`(oIg-_QLOn;#o%Kd}XyhCWQ1O61?LynVA^U{Qp(PVZv7
zVU#Wb%iUSu*dA<DteQ=Z?a8)`)i@ndVRgiBl5h7JHDxMMd7O_e2kr_45q?1RyOg-p
zRAM2-c@Q^)nBQOe!zCUidLv^KYoXn-nk8dvFqqb&bc5R+TZr!HYLn|7=#PB?v>&UC
z?T=A;0BZhphxr^a%zFc@%v30_lsA=<kb!;}R6CqyVn?uUu_IZp82<?Om()IKQ;CPz
z=Xije0Q>Nj!{1W-fH)CqpVOh%8L-cpOo=k7eL$Y<fPKye&^fTrxv&qGj8Vm1h!+-m
z8PzbAlw}`NDU~n9W0ydoOPLY73}BZ7NR=uDpt4Y<u7xbuL8<FO9+4^q@^lB3x)DG(
zL5`cD)GYvuN_)pNl}t$Q+yQ0oMDN@M;+V`L%4kzDghk8{i#!I9$6=8tAjy*e(xg(9
zn@V|z6wd?T1xWECh;?Zk>0~Mu|FbyqI@rB|IPxaq$XkdbZzGPpgE;c8FOEdXbFV)l
z?)6)eRBrVAH1-MLKgF=YqAm70a7x^Xp;1f>n*pb@sdW19=A=KsX9IX(0TufTYW&T{
zY0R%eJdAbc|BAJyvACwQ3XND_t%Qxz;$WTdvrb4^SD8we|BiJAtPQX>!MYr*E5N$a
z&pIg`kzGxtDr`h*-B?oV&e9qdNYRvZM1s8QrbndK3qZYDrPha4X?+1!Ds>`&b=#;D
zX@jBW5SGz~LRBoVqGeKZb~Bak|D8EUgAbNZ+E|!#9L%{H%(=PWoN1{!yPHanP;*X!
z6{f<RTYx+xH7Ce>cEFs|05l!uoB?yr1ehV6)d1G3XjbbjpVhQ&pz*e_>|EAO+m7|p
z<^k4}Sl3kgm`dOO&bo`iYX?|&M_6|!Sa)YwcNf2P%O%z|m42quKh(O_Fv^~=ZVkvQ
zB-XXa2Xw%?wE(Jvb#t)pGJsXOn~%cQzycd6W`IG~*^j9VmVda^8li6!GqgMan^_MH
zi=t>Jsps}El_CF~ZC8WW8rXI%Y`YI^yDx0JpWn8f-8&BZi@9VvSobuQq5tMw0(TlF
zpG>qvA;w`4<8X*^1jIO!P0@~G)3l@gqI8iCqF$zw4ejO=&^srhn@<9Hm2?n+e0T@C
z`4j-1if%p)y>dFhy1IjCw&><wHrR;ZDR0OYP&*e&pNBDYKI^Joz<O#I0=1iT42?9E
zQU6^(Uk+YZz`$3+z*oV*SEHY=@f)|hdoZz+U_BJ9v2qzB{B~@|&nC2+!0%@G@GXcB
zx3U4+ZET3P4orGT2P&A13+=(XVfcH{gZF~Gr*xo#e6tSp;Qau406q91dhj8D^^%UM
zzNWJIe`o6_p!<`s^;59*)3Eh3u=TTkTlbc-MvNH$-?4rftX~1^SHb!<uznq^-|(~U
z<6Z~ZNqn0a0M`9YWkT@IQp_5%6XhRev=6}QL$LaY_0~RS{k2b=<B<w5=__5l4ltFF
zq%7^9K>M1NYTtmkpLCRicyg$Z{EV*s1wQgC$oor2ImoAUz(;-q(C_e(Kj0%905(7p
z%rojhQ<*9T#TFu%Zz&Jvy2|2ugc*92Rp~L-L)QR0P^ut6r-dn~Cs|TYv9w+a@<CDs
zK|X!c3hHS9Wmu(dKpqodgWa9N0jTHEeFne=naT`HmjB6KL9YVSuB?;ZjrG^NvoU%P
zHdXJ*rt7^N*X(4u<`C&J53<bM=rT_q02>cv8GR6|&<6u&s1#?gscf}zoDsko37k>D
z84a9a(tZL?X!4mp9-2--KTQOAR@zS>??CpMJ{dq$&`(p*PkaG5+>IE{btrzihu}AR
zlV9icS<q{1=ro&k(dT%F=?LjCg;&p!4^w?UkQT5~9rlfmlv)SG+k{$YCn&Wutg{Qq
zM@g*%@@+d{o!tPm1lHLd*4YDKqos;qSk4Vmqz;PYpa@^Ejgcw>;_X5eX#oF5DAEM-
zu~J1qKCc6cGy`aFDAEE&S^+lB9ge$*;W!9jSyP!`G#srVXDT6g0`+}>yf4Pweyp#)
zKO3kY;Q446-Ap<{z-If6kC4M)w!<+(j(|5E37pNPrW<Z53qwtJ9OOD4raJ-T<E5qp
z`JxV(?j!)64AY$g)13;i3DR8+z!n$nYKk)vZJV79_0EBM=dy14d90UyK42$GU27Lp
z*)hbmE(OSCa4mkUHOc*cIaS!1kJ{Z#WhdtYrm5^4qTjW^xej)|9;5aKU`_U%Qb)uo
zHKMR)D!YV8vW_M6^{h<49n@1osdo*bz7N#*gZcqbPYtCG$$8Wt2lW%6=0{muNKLrJ
zRF;GgKM&PkfC>3g)|OJ@-A!fp5aKsL{3eLs0`as^x%UX6{t$A11i3#3^>iugJxrxK
zg!oIa{tB%B3E~-2;%ZX~$%NE@0P&9?{t3i0L*=dsq5cDMZ-Cr?f_f_{>pe|nshpT1
zEKX5YN-+@6lDce-snl-LWhnuiB&(nl>q2~`vbB5vW3CvI{eV?#Ds=^{oO=VL_*1?$
zDybZ(6+o?IJ*gAxOPzr{+w;+-AZ4AYEOYJ{n9A}HDSH5~C-8bf%HF`5<8FLB$=Pbo
zR8|xP4mYFHRQ8hZd}uJxhp-F{W!-2P8%S9;l!k-LHqmVbm%YR`dLp>2G?kU1w&?EO
z(h}R}2KkL_+6+85heqRJp$Tj-O=RO}5}QDi!FR4SM1yZ*Scs+>EJ-t2nzjP@cG3_H
z@}^CPXxbV;vsoq0VO6vZz~)IEv&mHQA&$8Kifs?aTnOU%?oxb&aHcXWf0|8Y?-1f$
zLA)D?mw<Rd)S2*>i(SuXaL$`bi!4*aR9f9jSf<h@zbiplLr@M@U&eaVa+akPY!uad
zmsbm=Uq>KuyVyLel25bL4CK9;K`pQyUllBp_91{)hxQ?+f7%y)xF5(DOZyPyYdX+}
z2Lk9I$Z;_G@DPCQAeCirQ&}4-%h7;12D1DE<U2-p66D*msQYOi<og6=!3t_$`KF4F
z2jB^i=|t9pPGWuNWB~8%#+vPfd-Mlzo2l$q7+?E4<I7YI2njZ4!t`gMQ_p6-=p5FM
z&IR-?Qk4OHV5rI$L&8g-@}(f(Rcd~aAJhT!Uk;!vpz4({|5X6nO*(|yP37Q_QE&qk
zx)Gz`CJ--?DgxrrY)D!U{<lMsJ3zj>R1uJOARUtK0?^%1<Q^!(k8<{q&JC+f<*<Ke
zZg>RRJ&Nvn43Y0~%neTfxmv0vkPi>l@;M0iJhXfP<a<iB1o;si(DEe!y$mg1ftIfV
ztVX(RTWcyuZgSg3Z$r0tpxe8cr{43%71^)L$*B97%26Rc@ClGUg%5lN;##S7Kzwwl
zb-spD-@rQGg1k;@9grW>0qcAZpdVnJA7LH7%*nY&%R7lVk)K8FYbyVcN9AMXdmY*U
z{r-fd{z4@FoAobYUTZCr?sfJvmE$(L*D29hyhLZ25@Ho4CBRuOH5_n`4>Mdz8B3O=
zS-K<x@)c6Uf&7F`8?M9zP&unCsbEzll>n=kcz~&#XeuYkJ)opJl<C1rOL~HMFL#AE
zMHr+Dh)*_^Q~cL*C2|Y^%s^INGKh69;U_ICB{s33P7SrmNT@OjHsJ>>4btOWke}88
zn~Vd{X0XZTu*rCUHA+XtJ*IMch)t$KnJr+GEkWEAMtnvH@eB~p1TkMD<y{Y(D-7Bd
z&f5h5_nOL?Vy-_+e$A|8E{m3I2cUUSWj<8d-tpZkAU8{W_dZiOdwt>8I!SD^6QtW2
zzPk&2cUR!-?RNP>Vd&mn&$5m(?>Cim@PESE7-Q$k$5_dpkh2DmOIf#)TGp#1=g8R$
z_${uS-n(bOKF?Inw|;@2say~u>k5`CsfV0<u`VSmfz|3d#eAW2kFMwQ-%G>sE-WnX
zFA5QKZwT4~gSG;%jdd?s<p|mx;B8@oUTi9t2th9m5p*pC-3Nm13t+yiY7g!92TbKM
z(e0Oqbo;@O@(@UQD7yVHbo&wBZeJB@0w7;eFu|1}CO8)0#{v9!NO}THaFW*qtEDCY
z@KvUAwJ^cuAtpE#CO8cyI32)e0BcRCpbwhLH3dPh4H5J_2zovQy#RO@LePu7g07V=
zpC7V3%ChZsAyQrm@4t!}C0E0?*8pfADbT}Kk6S?3hXCCKpql}73xI9~(7sZjM=ZNp
zKsST{-3g$(0E7il$vpttFVuA&HI*9$*i9j>^AL>oFpTyHz#fI`JnnU!{axe{0+|Q0
z$4uqskU;h<M0*Zs&x7~?De)7ga!UyDs~~<2#IJ++!017Oc#T-ljp^F$e5OaQVA04y
zXR(2RdeT&GEiCVD6U#d|$U6BRtK?mPzlX`@eb%?+12(+mLpHkPV@qF?Mdm1fbH(-O
z!HU9EMHvVw4sj#hG~wOdZNBSG<@Q39yDel=`4kTR8TfsUDE9^64h?nir%dIJf`i`~
z;^5z+ufBs0-^0OwfP??!b@0PN!Jjsjy9(fUhk*YM@IL^)0pNcE{BJM#;nHCaU`%TF
zieY}A++E`eOT|@I5s$DgaZKycBSHmz##HVv2>O6r(0H6h;|W$8PXaH+y2s1Bf*vUq
z6u<}}4+%jZ4iVIVpe6(@2QXjj9VK<(XRWT6IdHrygzE;$xFAPMiJvo-kfgzQUl8{L
zaeojWBPD*`R2~f>9tz@NAkKpLA5!8Mtd5crj{)&m5RU_K;TJx2;jQ@p7n*ClAU*}n
zj+4f&mn<7w;pVXr8)KytpUI5)R;)5U3qZ#geG=vU^{%NrzR4|3d@iuILx0Uff6ezU
z(ocvwNioZq`>PAp_e|x9^~JxJ##FqAVo%9KM|@}S!ult^E9({CjSY)0VI$+adwHHD
zUGu$fDo=-4y%vaduzC)}CrgPxFqLOQh*yHR0mO|UK1I5f0P(Y7%jS41OUBz+I^GWQ
zQ>9x8kUzKSWpjKrfYzWZ*RrbkJ^(vSs>p|?@_dLQ2SJg8p$I<=I$f#=h+ha*<S6hz
z8j2hP@-w80fc(V{C~_=-j)Nk{LlOQl=}f62ADhZcA&Q&^MNWqzd?9m|OFUXAVu1KF
zQ+e4`UJ23UJOrQfStfn~=+Bl83edm0=|OQ3<hU4)dI<)_rCtX;Cwi^`T_O$-MgsJ6
zQ+cfra$heTX}wW6oPJY&I32$htgZvA>oF#7U_;|KvJr89Fm#^unBogld8;6PaT>lY
z{(4~E4$M0s{+(X&&zE+{m!|S|NQc}HqzBL;4}$mt_xA%V5(l<@K>W3-ytBTezaSv~
z6!4ygWY1vAd6xB#Kj)S1Lf7}a3k5JhBzw<sK2v!=#QR=B=fBE2$6sUJ;(YaUkyPGq
zOyz@)%lkg${Q&ZOol|fp;nK!q+qRR9ZQHh;Y;4=MZ95w$8{4)v#y@txoI2n2nR@4D
z=DnGzuBoS|`{|z_l&3&YH=*}&k0uQRmd_foXJ1ISfzXb>@J>Cjd*sh%x#QxW&8SD8
z*mqwbp8lcT-**$<l`YSGEUED#Uf&D_pVQK)RI&R1zG#9%jk))Bo%%RZ6+jl?VNvOY
z=<=wH&?7l7(j*)7BTF>?OqTxrG^EL&2$jJSWFgk&il|T6`FNjK<%iw*@K*M-&a42@
z)<~0bG0{Wa)|v(DWArU$O#yklZ&1uS9Zib-qRYhsx~ncJL_0FD<xZi10JdbTmW4A?
zi!21{(zedampz_Dx{nDGE;h<zBI*@?0|r>AyjC^beOp8jp$4!Z=dwq-O5Mh5tV;Jh
zV5&g>vkLRJGNv`00r|I5<891-k$bxx&>@fW?9Y~JFMQ}{%r8TZQSkgio^es?Ncga8
z$9zqRA=EI8WD7~vRjg5gYx*z#fj#v`c&ZOfvTN|;gJvpL`GCLd&KJrNKf;;lpN5fL
z(x-Zwq=Cw7;oxB%w1cPRa*Sg;$B16EMss#?yT_YK`#a0RtZEQfp`LLe+!J{4XTPEU
z!^uyKf%d@JrGm#v`m4NB_Y>hp`E%aJ1AQeb?om-Wv|xU-XNrg;x%*%L5y=CCpbQ?M
zR@_sia>z;_;QqM*ku|}vkKl=bcc;rqHan)x;4CTseNl#g2Lk0r4AupO;Mu5Au~|Ag
z{mq=ZE9`SlL!<|ve^Acgu8IAS<AM3_Ll`Xj#oYp(^iu_E*#G;l_FpnP;D_28UPs)E
zM9onM@|9*IXupAD`u3C6sJwg_cK?hCh>nZSXH3|3Y}mf;6$`uzT<-(^+aAIZPar!0
z5pI%4gq$SrR2dn8WBqE{JuRYp7lKoeL&7W4p@Pb*4XLr_Yjvp03fU2(+P_p<ip0q`
zJ)%epqSfYv3$C$8Ufe8?Kso8|u{Nphp?~E1ZeL^4Vq(~s*92MuRZ*2y#Gfx1{k!4<
zy`Tr)W)SM6WjLR^ST82GZ(vbAFk<|{fdb)yeF1@e54bP<nSsk0mDb;Nfsb+6FOXx8
zq(^ViPM>g~-yophFreSC5MRFx_ufkf+!HF5BLct80c3f}FcE|a5W53q+6(i0KZ=5W
zfF?<5<yWS0Pg3cQ(nkR+`(F=0+{lP2*DY;;0rZD_|IOvFza$QBc$Rh1U?bByESy)c
z5a9~nditaM(>=3?rkgCvc$T%Y-S!bu0eq;d=k+RSQoVlWn1hO3he1!&_f8NxW^yqw
zOIRx9Xw!_8-@#plZRJRz^kACxxD;Jx&eVdGAIg2k&$aPM_8wIkJK%y}T4qi-)zb2i
zYln5(I-Hc_PjXCbSM=>mvQTSyX_9uJ4ZndQGEPyIpYe^V#3KSR|1w7#8d9P8DogV&
zs80XCHh=xhDKF{enoynOxqR0gC3AMjHM^ZYzMV$bU-i`9Fzc^}x@w}(<c_Defp}$E
zpa=CdgY2vU7p!e?!mXK#x6ez>9TF4Iwx)b1lfR-9h?FrtPTq>g9{&V(0}9AX*7k|1
zbc1euF#_Vm!x%Lec<Xj)iDO%?ii=-440H#P^&=6#kix2^^p^VyQtfms+h7yzWC?V`
zDB-~!V(9!*{Pkf36~V!>Y$xQ;s3yZL8c1+gl5sTL-vg$s4@1ph@|m38JTOk%ozzR#
zp=Hi=flYG8CfJRUqz`$JuE#@<;dTjoFfG@rk%%8!fg(}|y5|+)!E=$=9sDTuHlw7U
z__XAqa`nT6@j`+l00|B^3YM5tiTA?prn#zwF593K{VorDf_w1C7^;_wq|CD3MLI|q
z`hbaeeau)bwud^PXe7jfJdi5eP~g8TEPQ;{uIZyPtol5Dr5JY~IN-B<=NBG;tTDI~
zVP}3t#?5}fujoFz)2H#U81QbYL`b+tIJWX$U)_6!_wa+w+iesYzgcfMLe%%O@9?iT
z;b}y;j_+_Us6^0a@axN|L~x70T_V0~4nDHqyXSfN2t;ZJ?gYU0*-zF%i?%T?7vlCD
zBt<oN&`dB_VpU55hDzK^e4&lP#^0G!!33jH%U(84^eVIEIhJk1w^`MoyXBF}ST6F;
z|9X{Ibwl{fUNzv0g#$7eCso7i89uZLA$1>CpkC=omLX%_gzx=oWU2%%@^Shh%3n?f
zpSS-sOAg`J4YieVGyf51URENOhJ$>9qGCdkjtN33?veH(GGkm-m2l4)0AtL6f=KQ+
zWX6&OFuy3`#J905GbMSjvWE<+?=iySwVCrNH*4jm+)N#jYJ}E?!uUjU&8m+6c8bo_
z2HLv<?nZJmI0FA%<HN2%&gF@zHz7JSXSWWTjmd_cjKQ=3J3J;9XoZw1snRN6%B!)c
z3WJyZWhSE1x&xM>K&IZb4!%gVuQ;r0OUo80lc!deWmMW@ME+b6Y%ovrk=N3X?#Ff%
zzft-GywzJnH++-kL*a<3(<>zw{RmBbfRE5kO0<*cko=RuNq7&xZ?(D?H#}>)9Qdf@
z>RyIt^IVfm*;T0=dH-3WKHX87?<o&FKC=}(hhrykrNB+*p4?nE7~^Lb#mG2cl6#*8
zH~i^|(FOYk;4Ar1cS&Qd@2IvX=##6qr}$UN>%l{;1`M<^uDL?Nt$JtrkjFN|%DHCY
z2f9H=Hn)R3u#0B90_h{>_)9xE$e|ZHi7T$HiHG(O{y_w~7lL|63h`Z|y<AnMV3BjB
z<x18fmdyiBwir0#V)P{VncKwtD&CaFwp=Uc+NL=<1I;vUBj}rpUCFUmU=MPtvo0r$
zfR-hf;gwIWLfGJPE|TC+*(EhL&XXXQ@rEUsFBqqwr50t7_^EHrHFSFQ#W(2-iQgA~
z>=$tC7jo=(r+p3iO#4^fcz!&SC~Agbi06HkQp@0ZDS@|diO{eK`0qC~g@54q?vBz|
zu_|gzROojaMd{E%DS1s1>x@@Ah32>N?r2IrnaHdvX6Cu^>)a-BNF+4Hv7s_BMXKS#
z_~emAW$~3|6%Vw;rq;D(>2}~oFm@@QmKk+l)l2l!JWz{FMsX^F;rK!zogO#TQJ*wE
z{85+P#=LYmkR{a-)<~7~Yfrqt)UWpJO8P_{`Wo*M;ZetiE%S!0e+^q6^~a`t<I}3{
z9Lou4e-<hQH-l2s?z|iO!e@+$xg1J$nnllS)z!Hnm;5DHlf$#EB@uMbd>ZtDRz4Od
zAgBSzWjIM78l9*S?hs6~^j|96qj+XjG8|l^De9mW3YyJfuGD(xtw#oRh%;`p+FLf<
zGbp9(V6Nbb7xT~Fg*O^rqZJR&9b$3p%bkkhTeyBpAmO%V(z0*wTb!PCpa|;-1!_pv
zY$4j9jAGVpCUUOpWz%jzXuL?~JW%F5YbI?O8_3PS5QX?qDkOyd78CC?5i}2zC^zF<
zRM84gyOFf;L7VenA1PI?3+nFzH|N3>ED|l9A)Uho43|X5AIiBhymIPeGsiV{QV*Y(
zJ&?p4Ml;1R0J4;lnSb1>xJR-$A{kpi6dXb0a)wSU8CwTtMKYN=mQ`}!1j+CHM}CZ+
zK(Yj2$>H6yRO$!oV~z}mxE;x|Y&QhM+Rh;_a;U`q0}I+`>HN^*3XOLQ<yxx?7X7DM
z?0+7(ZX;y2L3y)8whzr7&S@RuHH7jKIw3I|L9YSa0S$H3zNps#jQ*qrNw=oTFjM+8
zKd@4Mak6)?A!=#>b=d}r@CRE&A26Vuh(1*tc&N5e{RR8)Hwf(q%pG$jy5P<VFzp9K
z!LCuLfMF;+kc<pE*Rra}7qgjG%J8IdO^Yn3qxeszpb<)~oMt-SgeG%;!^|X71vRE&
zubtS$8o*rBG-aq}M$!M1E0kxRXCaAo3MbkrmhePOmJXF?pKl-?d=U`<9Rw29CHM_;
z4yryoLdpYDQFS7b1F**@CdC_P%!+~4sQE(p7ge9pFDgHeE-IU(fU>4yny4GbRDoQR
z<gqO>&%d&Bm?z9ZZ4j!dHh)58a|M@}Tc+<J=XVukh^7@&f?GhU8(8B*dx+z~oXd0*
z`RT#-KCO3v?wihEPEW`Mw#g?jMR>Yqv|eS{hPnk0uei#ecBJy~u|q2@mWNH;G;5=t
zNo}p~CieQ)&T+p|l_OmhKGog{L=z{d3_KW$@WAnXL#L2*Dfdc>lOO-+cOFG~z<8yh
z6HZ1B0)>S~=0k#A!z{=0Act3imK(7kgK=h4G_Vh}gO{`(5T`^)XTREMNA*6)YCw1T
z61bqBDWvWmH;^78<{w~s2hx5o8HtV1GOrXYD~WI_*Pn_RD(Mw{z&3mVzj7%M+S@bZ
zBtZxrqEKbH(2hnG+8EC*B-11T_?$_?p(E8JSpS<;&pwC>pZYcYXsE|v^&EiBW#i&D
zjAIYp-m9muZ>gSvdHL|z&sP{KdA9$^nei1wwihh9zFQVTvg^cHh0hUn`yN%%U;Oz4
zr1^GS`Aw&Xb55#o`<}Aq4YTvaK0(I68k17Mb8$OaU6Z-CX~HE$t#p8gT@xpzk8xRr
z9Xn;QlrE3n1pSQlB5B6s7n`VCBg0*3WvBn=;!iAnSahNa@_@F$3RVZOE%ANcewby9
zX_R?&HoRenCdV7gR_iSG1gvLcpYhjtcQRb$UPJ1h)n6X`u?TY&#>u{WP)w6Y1nqdx
zaC5wC=AMHd1ZD-vWkktkgfSf4o{ee_iQ@x$3a-ri<-$Aq)v4-ZZF#{#@Fo}FhicR;
zHRs68C?WX>YJO^PEvpc!sUs+0dtyRb`WDy?>fg!2hcC!duq%7oj@~amURNd7&a!+j
zQeRbi(yZzQJXyl@&$!s^Yv_!D>O}>Rf6`($pfAwF@?nL!X0Blv8+intc2dPV+F23c
z+UTvO-&1m%d!_t3Lec}tsTw?(SEJDx1~128M!Mi5PDtBTiIi(mmG1h0A%~Of`LjAh
zU1i!qb~rNQlYPabXE>H8c|Ndz#YXb}EMKhde-1HlyQ00Bw%|B=hE*D4tLkTm0dBms
za``|9)1|(>J(c>{J16DEv$KNv`Ot3w<%__tDg>Py<p^i&lrFrLE|8V3h3YM^%14Z>
z^JV<@9d1TVM2Pl5FZX`0op?ZFWL{tV0sTO6wCwV<8$7-MBG9vtdY)f|tNcB**4yMj
zQMBCShTOYAThCcJ(c$9lw?zOO7rU5YErdGsDA)=@nU|hJRZCyAzCF3(*~&fq3X9e(
z$3$O6`7UVR^S}-0+M!6Aoc|C-iGaDv!p`m+b~cSptAso2a<(w<1#W>K?CcxDkPezJ
z5FYqJuI%H#$E4ks@jh`a|D={^^Qv|Xa7CTdJ}q9*U^6uJR3)ul*%0_i(e*J|xXZQ_
zaOIinwg$m0sRmPu@r6vZvGQ>cYD$ClGr=rsP{k}YbLNCepfwk(+l_VARZP77C*j-9
zVx;ct6v%qGvJqK(^~AG5FSEC%!c0F~(J}$f=>%(ddG}CjKD56G!7Ew`vnkf_cU?RM
zk5E9dAuGiNY`cMW<c|I-J)^2Ozbt(XpjN<6IgsDvjP;m(v~$RzWy-wz#uqn4{wkY8
z$e8_jzrqyEbh?bJ2$9p;8qR|K-<5SS@y)9c*Ojb&!s*-1{|W8AB6$E`q^}d;HzmkT
z(HX0-L~l>lmimBAr+r>KJQ}I^iqc^dpu6WqC9~D8rD}ojcMTpt2PFRZ38(Uaat}v_
z7DZ)s;pRr=*fMm^Xv$x{TjEM>(oc)qqWEJ)>Zi@miO2QlJjhw?3{9A0Z6{?>v-8KB
z#WKxhY;uQbq-Byne9Upra$1H|^HU_^rf>@C%}O(U1-olq<TtjDs5gvq{gJr84PCy7
z3-W1mSp*3`NK^Nn#s7(pIis}jWxCGh{PnVse;gUU`ZBQ5AkZ^&9A?;k)(;E`@o^4E
z12KX}`b+O1|66N2E<}tfgl|n7E+{C7NLd5p5h`T3wnp6s_^MLT4aIAtDSd*ZnuzFJ
z33(_lk3MQ4>+7Fy^387+PodA}T#mloT%PBd9_KzS*>VD5lXWiDD;2~Y8={wAQ0l>k
z@KDAa4WY5mRiW$+&TB=zkAm-@OYOk1H;n8%V>8GyCN(lWPOLkDBf&A9yF=$k&2rB?
zh3|TEpLQ*Tcyxe&R@=|_n}l*ZC+>8|bxu79TX|?hKFOkU4@j&%!E^h>ocl(c`^cTs
z-q|oc#et+NDiE)Wf_3EDbpr`DEIgxf{KfQQ1Xz^Y_^S-tR+8=z3q8@2u4&xfCwq)1
zm3_|y@OSiJ?^7&G`qj5cCg%;Ixv11CkT)nE^uZ@AQ@I*HU&9ts>Xy{p<Z+RP72{lu
zz*ls}zA*Fp0q$>Hn_RJh;BXNa4;%QP-<LUe(cEvprU=ip`_3}QB~?)oN}<zvk&E6)
zWT%G_Z+EkZurQF&tb*8y)@EjSyjFN?hx3z?NI=mt$wc)gkhM}Mc_%PwL=h3s@dsOy
zw1bLba#_l}!ZWPuL?cE5?1djiRjg^UfO|b_^29SRt_q#pcH}xNF|UBO2>S6W0#C7E
zxtV#TgVQWU)UB2g+-9=CEKYQfhr`P@yM6H=fix5x9)AXOa<roQRwVzSPIGRljKX{)
z<vFRYIf&c@-oiZ8fx7kU$3~5@F{njq)f5av^4wIlpPY)d&FMC*Lxvg>QGy$5T$0>^
zF0J;^wB_!@enaKC8I90b&Tc6Jt2hkwLS#cjt%%HkT523wf~g=}Q>Fy~EhDQ?$;gV`
z^Tbx7XZdGvx1#*?N8~mQi!^Lt1HEU?Cnd~~5nQurF3>&vW`{6DptG{OtoYh`01&sR
z^t9=49s8Ij+7m2e+)G7)J8UTnZlimsFkH!1HFvEkje67mnuiF3R;QD&&?so81%84x
z`Pi6_JEp7e2T`smlWl~E9mSSIhh81d=olv&x(NhO&>7;hwi0l<<4O>6t}J#L!$SO~
z75B%@O2?8QoUV5C(ntZWz=K%_4z1t@yflpWJ~ugYy-2H``s??QSGxE5-U#2gnRGw(
z_dfsaeFk<7I`f;J^K&a2^~$B47n?Zw@oYkz9x84?a~?`f1)Q5)h?<}Tf-U<&Y2*~c
zITC>05^U^V&@Wx3pMO-1+2?yeaeRS;I^SLQb>nCDKWe`cO5GdMw*JM)FQCPoPgST4
z{UZu~z`RYxU#v5Pjzh*@UU+abAI_2Ty=Bp|2zsfB@GpuX;G6vNfd)r`dD|V&D>~O-
zJq>^DHGP=B7g!#A*@TmB6==m2cco9o*ilaUP`kehzJ}Fs+g?@_q3J%qLe0l$U;-o!
zk`9>eQST90g<Rjrw{q|WyqU!b6zDi%FDzv`7Kn9NRTlx@_@oNrjYeDdYs0pD3n$~X
z-&UkUS8)2zFNbn%4iP;TL}K?smuqR)4qR;kEIJlxS26;iN`&TQ55d-|l%|afhU++l
zhX6NkW!P)6+zyWIG2c_S-pIH6X{NK14H=f{(*XPCdx2_DCxeMS;X6(6^RxX4Gn>ph
zez~VjN&>IiHqi42HE%<)7VTr@pL0d>ZVDj<VLhzqM(p&R@xhl9{TAxMmu!2Y*pe~6
z%$Ps~^-l%`V9f(D*NC;h_>#MK`%m34&}iU|9hM9<oC9wF0lPRTP^j&E0HqRso~)LS
zK-Mg)I4CP(c^m{UxS$I0XmHBlBG8je@jAW<2cY}%*~Beg5ItV_F<$5~e(*9c;5<KM
zeL84;TAr~>BFNJ_Gp{{dsO9i-Mb?PD!>zeelF#wJIl+;@GzSqIv!7R*_)s`wlq6%+
znC5^SU=FA_18$jvcC%5VE;|EeZFftOOngIP2$h^9T5yVJ0kPJR;`2bq>Bf8ZP<dfm
z>{2RBzAV!Vry8f`BPBmrE-(OnYc254?F8Tgmf~>_1iH>HS0ZN~>cIiK(+yMAxcx22
zve^~X_GP>~Ag7eF%RJz@R{4HyCU4Y(4=Qm_3R!U>U9RiXP3V7g8S46vqb^vSjwHHq
zbJv0qE=%dV<Nf}=S0;Q*gT4wH9%W`uj9FlR#Os-J08B5Q5B(*GH<%*a@JKyDNIg;7
zd||$x5k78Qg1)B_;NIzfuU#3*m9NS9kYm71)>%7V;LeX0e1R=tA~Oq=`t*uky*ORM
z7|S#ERb`(qb*qzd*Cb}2zu<hab9|^Oe?{emuP;NIZoefyq;5lCkiJ70wFhY$AEdBV
zM7jjLwV<<=dsQ^Cmrk-4l!3M)D5h%gCg0uhReBNhq&IZM(LJ(xipcGZ;c1(~Cj1L*
zA^%it16gPegK3OUxv1Bqd9Xl{26^zFhYrY<8pEZMa4Q^Xq7^&=Prs8ur66o^OhD<B
z`(P8fJJ=q*0^Z6?`Q@!tcPTe*O1L+J7=oV^knO>_;#H%A0n$$B@DAz@<N!Hh2cnNO
z6;3{oj+##du(drXMN7+6j04)1oQnn7wzQ@lRg}=uebx491GA`1ZGLS(q60qhaM%Hz
zf!@o3n(;p5EOw`lTZytQ=Bl-?rbvE$%Ry)g7i15<I~q)3uz(Pq$ioCz5q{XW%%|EH
zwKLsi&nYcsTWVzv=jI{=p$h;iUDBm5k#|CNO^>c@hbyvk>r66r^oUF|EtN+Q$MCoo
zbJNklJ}227-ugKGOt3qW{rz{S5(P{pkT!{M>^Ox&Ly@l|NqbCfNvKy=Ag!;g_YNJ0
z#-J4Wj$?kTg1?H-!plQiN;^SO!MMHF%vuX{r1fZgwKCBsIBQ}T_{sB7pR>QMx+#ic
z7i@*wuvP+b>8lx2)}RJm{$16e=Ga{DH!*d)vTx-C8pB2bH<;phs2X7voZ@l71~8Rc
ziN`p^GE=FlKg5y&P%Elp7tkXuu4;LT@)huszTg$;lAqu&wqp&L^De$Vns11_c18k7
zBc<?)W?tFtqr{gFYc0kt&(q*@vD(;_6}M_{5!F-H$1YwGHgc!NTPHCTeSrUeuohVt
zdZf<AKtP0)!2g3oPxC*p7E(ecE>`w-Vs@^-o&Srn2+gqYz*|NSyRmF_6ONHf<Qay*
zm2DJdDodZg*37bOZO+t#j!v1jbR&!J$y%Sf#u+CgCKd#-ddNd4p-fQ)flv;7*r7TL
zM3XEG5%9d*UN5q@kT?n_IO99%y4v!d<tvu>@}AWv9>M?|7z6$q0|>?NG8}E>4O3Nm
zHEOl=f6rBMM=839U2ZbR>Ku0_3$g$oMqH#isT)p97P6+HHRiMa%WX1Q{U|W=udtfs
zB)CX5L2uN3whp{d)9Yf?aJ)kwwd1N+9GYk`NuMwH_olz}SwoUmRC~BQw$ZGI>}!pr
z>AX;pnu}fD2zS<nNsHGu;TLmZC03JACp6Ww89hg*WYZb|Azh;~R3$_={#bU;R*i9f
zjHdGy&6JoTpaS6IT$n+7&l|E#8q~xJ{22%K@MMlecNQD7<_#INe9d$q`$TQ*N`HF=
z4&EH4$$sP^zqeuQhsGp@=~BGedWzQ~`My5_>Dq-JBi2r1EOL~CruUJ8+g7yAN@HxI
ziotm+;d<vo6}5(jzNsm-o*BFRJajtw)ndai=TBnJ{DeRof&M%~=diGgS}k{g)MhU<
zFLH$5_}yK&E=sen$$aA=v%tQL)?O#m9Gr^JZqbIqxlCghV0-7#EOkKv$oRcUAJ9#b
zO}bjA>1IkPEr1}i+Dd!A9>iXf$(g;)ucE@zbetNcxqBstYZ8q8%fgzPuO3&6x?37K
zoSsY;ySO8!O>d$uE*BcQPHAWZYoNipsxru2dc3vK*EEKhZ#m<^wNZw~^1R|fzdj<^
zM4WLsGKW|MCC(AltyHHZ)@D7(Ww#=NjfoVC3v@9fAu8MWB!Nkpbiw-`L`E|9sMR4r
zhjBbZm+E<Hso9e+)E4c8LH3As{fi3@=|sV7$wwb1&%iLCQ^U=|A!_jc0mSLcXJU8{
zpZbqw%y`F>?B0@VMb^`OLSIoO7w`7kfhLcgHW%+B-!rxGwv6Oofl@n$x@(!U8k*~3
zoo({gXHqgfZ4BOkUl%AX<qt&asGhPo@?sAXS4=DsvLD!Dw(z@zeb=cqd*9Rf+O!7=
zp*S1PZtJaP&kV+g+K9p|CUiE<W}9OScY4|kA`8svzwA5h<amb1M`$U*!yUWuuAB0b
z{tY%B-kYlsYQWwtk+YAD{xQ>F;heP=5(7!-jlE-S@qLZ7wO(U&P(8Ae#T$TE5!WVM
zZknD-;zVJ<cx?jrwX9jUO(sFG?Bd434@FylvfOm6ZZ@)$#G9r~TIK7Wi!}LD{zRTk
zkU}T3nJ2`TjZmB2;ZGV4*}Cp8;GQC~g0qZ6P0loj+~QUxg||BYmlXyFMNiu+?nG~@
z`p^hZVGkTl)tO2bD-zW+>(JVq4$XewDh?OBwSdFzknEa!bqqSPcFT3eGE+gkj@Y@)
zGRCH?vRsG98wN3HrEOq6<GYe~3`&?Xwp{7A+LYzKUG7Yw6n0glDczNYgQYSA_?0XH
zi`mrZJ{^Ix<}}uV2YZs9?v;9t@UeVH8wo<xqXI`2+4?BC<ZELV^(w5v$55$mJsWMm
z@pzS%<+@pYft$1RBT)@vzVN@o2^n=fH$EslE!D?HlXmn!E2dmElXfCdYwlkN?fZZ5
ztIz7#qg&IU7b6`vV|SZw@rJ{kg*K+Jj9M5A5z<+rhYXU|OP=Lx`kL3t%FNfB9L{@S
zo39+?*{#!dx*9q3#B5I@9KW2_+mScK>5?W*#M%s;8s(;yX*xh0e_jupd*}7)F-{UK
zfZf%GyHhK)Wc^p=OGPAp=4NtrWA=8Cd2E_4s>U)0Z0nJB4QX4I{bPKOPQQI9H6K^F
z*a$6eU+H>q5xu^MQTkt42c%PxLRb8#JhouW(s(^_d6wlMVg`#lCa?hCG150hx0Xcf
z<am?V%U^|Gmd{%_uh6{CiL+>0$z{=-aL%f~h=huSBhX{aHc>pWRhLSYwmZu7=c4eN
zghI&lG0qS}SNT2r2-arUbvf{?^;*q<OFbVmt-s}MIPBiTs0I25o*_OeCj^IKs^l4e
z0Hify6R^MU*6|rB+>2feLhSA5gNwdN8nwwp8K|fQ{Dw$wjStcT4dlBKU(knS`rlC)
zz!^w)5W58cz<Z#P@BNdJ8UY$8^&s^W`k>k}K1eTy2O|C9DD|NAl>Bf$oB)Vh@dMI+
z2^4z}LNOoK7pw!5foxL11tkFxp@a|b3)lhbfKG%0h&?$!wvV)_fIK-rybm`3dyj?m
z-4z3{zUNHxUXFqoq%vgHfU&;&dq`x@$Qb`a`T*G>%mXcloV}mxKqFA@fcK9eF9ZQ4
zKW2BX2Z#>=pn9O5*zebiYvR2YnIGR8Ngmkd5P1VC*R0CW;vW7Gy@$n7_YDbsutfx4
zgMuz_Umz!tMx@Q2*U{G{1wSD#Zij;Nkas_(==CaY<Sv*W3m|l_9jOo92N|&0kBMpk
z(wp*fwdamx0MVQClDp@Q+=u%?aPS;dPt=RzgAQ2Uvx%q&H<0k*dx1E>9pFITh3gG{
z@!fky^#}S8IzS8*ko`cutsQC)w5R-{dNCOyg!B)3N#0XH_Q(0aK9~)<A?ii-!31pY
z%_92~e1IP?1oer2nBDRv`n;hZcn>@y-+=EDj<+Ks2|#^WlL`36zFh3tBl)9#)JpdH
zMZ6f@k|ut9{yw+~=#%;2yM2!I2l_H1+x?Ds8QsfA`bPU;Imi$87y6L7t&i}B_e*(U
zx;-3H2=GVsH1L!8;JLkt{090W1?2bp$8}36pa_6}!2%2h{7JufUe3neAK?H3{oiC?
zm@m6SvoNnWFDHNd^1liHqfGQL(2s?ofPhvp{}*tJ>3=B`aeF5hCnGyWBPVAwr~k?n
zdTS#$qpKbpXWY?wst>I%be%dC@;OAo$P!6CUB7!_GO|KAU^t)=06?lRtv_i?f(T=l
zo+zvFb9eSZx9g;-3kaC9lDkHf!s29MvHk4l@C0nj`}aonM$a@Ko8;~6)E13A5OMpx
z-nBq~=ZW>yL~Pu@<b9SC)-Tv1&lW2&>z$mPH)20}orEi~_R7GX9`Wmwdrr{s4vDo)
zHLrVRO%**Fryb2N@1HWhW%$b74f{4}iY?kUP8^=WZ0NaYU)?Vru1q%jy}vvhU1_-_
zAMYf316<QatLgk>aC+SO+~;Blt{2YmACfSX+GN)>*#AA6v~<c;1)lW8AiQ|g0J{tV
z_eiEW_8tV7b0}FP9<|4Z+vY{G#PhJL#r+}CHk<F1%$k$R8$07D_F#%Ow`!bNym+KB
zDrV%2zBGSCIvF=wx^WrJ=N^psMD@k{sAakIzkV21@@EXO1Nw97{60EEW&P|Q=Vy%=
ze)aWoV!rhHe%!!<BNlA5^y#yH;YOcz>+Q|j`9?=`|8M*0-L9VJi|dUMNkli6dwvh}
zy_F|QJQ&er#pHzXe8(~ZDEfJwu15+RLj(JP!~%thrpy2vqmN=<B+Z{XOQ|t$Cv&4S
z`hZ?%78^dvl3U@x=ZngN^gC%vGn>vBOUIN}5Yr?GH>`<DPYm(wJZ>?@sLe1X>Y(0{
zJHGxz$|c$283ngT<O%j;CvRF=XpXCxOoAr(o<07C>u+JP2lw=KI^cjwZ_9e+$OlGn
zXS5kCmN)|~tI_KjToM24RQBX73D~2fH?MrLB3(Wi{Qdr7eqZJ^;y#anN)84%l7a(N
zkr9ZN)nqv5>_)x%xC@hkfPer2m1)8#ZMQdrvK{at)|AuUOVGpHt+PF=b*%T*{qir{
zjQ0~|m!khs76LPTefll|;GK9B{yp9Q@s(}A@J{}Y!4!aSIBcCq`0rwvrbhu`bUoeF
zhz87y^Rlg+@pZ=7*PvlTCb0LVbB~#@6gKQQJA+B>Irwxxi36jyXt(#3BB}^;*B28$
zUY|h1IZU3)P_j!dgQ{$CoTOKwXrw;=+jhVnGOr%hlDz76S5rZvN*}Gq<eN~T6O+gW
z{%P}d@BXBXp6f+kJ>~oLdwmJZM2;m4tPX6gr4GA`kwQuX`Y_F9paUF&yX5zRR?!B~
zSW<0)T1(Do0l{_~!=3>9M6dbTRPLUsQ|?w-^vJ;T<0h+eo!`2yWOYAK0VHnDxiNiB
zEX539Qp2fjm^qXA7vr&XTKjwj#LhQ3nn|_hc72h*Xn1&d;_HN;UnCeus)iwBSv7{s
zbd_elg=`R3r_n9OBDL+?1@%>=a_Ia`m87`sACjoItc-%FDD*|Ng7s*Ta=G;2GuGrL
z#d#<CjYM-F`HI5D>ma#HUAYLjs4~1WYD_geuw(jKP6?tMR#L41imeZdyRVEa=Z&-=
z`Smbt%*$PtuNxaKE7rouJjK+XX@_j5hW1B5<Mp=3?Jq1_EVaK~UspEGd>cfrP8lT_
zjv00Jno8}IYwC|_B+THJu(4DfJE<siqj=?t!papZJ8`n)+2dpni>&jA`y*k5QTbsM
zJfaKfYze$w(G9Ds?At?^AEEalHIF!s!8b<E^{v)Dv~f*Um(MR%-JZxjP0hDzsz|kB
zU7U&@`D;-5A&lXdjXMu)!dV+UgD1=oXwKNe5o!ufDvZmZkpsDOG@M63W=3~Od$tx+
zdsy(~X9Pa68slCoShg`_JsJg@dqUcOWzo=`HE;$I=Qtk<Q12<2dsIoyvW_Wvk$NXA
zXDN+XA0t`~Oy6iu7mJ-BkEB<f3}ha>T1`Ea#AZnMme=CQx5p4!+-V40SBp33XxWyj
za-iC!SKJJpvv|TR?=F?Uy+X5y0aJj$Z(cV1g1U6=Z}HZp&_&*+=m_)4qfg4Di8bU4
zCC^@dLOI-xsJ>+dU8q<YILn>Xby5prP$-<+jHPn<TUd1ahb(B;HVYxq<<%c0b4+&-
z$Iv5aIx+_vW@-xaD~Yb2vc`^wrq1g%kDMbwq556&cNaZ3Vdv+}u&IL-7V)cVYJ=X3
zZO|y-7k$(FK+>T;JPKP98soSk6>ZB(G^hU$Lx3W*+BLTd(Kft#^!J(LdOD~#p@xfT
zt7T3-cIA+`Je{3jduSgaTZ@<}bR<NtlT?cm4Ro#2d`w-lZQc+pSY<q93bJbCC3Eob
z;?e<_8PfFOg{fU~-+LoZUd+g#-FI<(_x%MIWleuAt4%6vA%cuLdIcHNkXN(d;1`&F
zGZ?dyQINKzOmI6(9w?yQOt#O%=m87&34+%`dl;?X>%N4_dUF?8K?EG<yc1g1EZ?yX
z>vUO${IEch(hzIa1V<0w(4%Y|aDL2mUO#NH`-U^S3N7S*cfoAIZOm&GKay+Y{y_SD
z=rf1=;CtE?oe9@~A+6lu(A3wFoM59@?$-tMZ3qBw_x#$vZ=yI^&#6V~^n3Wo)#-5|
zopJozm3>Rikpd<25-UpzBt;Af-27afE`1l{pq;X?wR08EL&zgCGHkFgY^zLmZwlk}
zu*b0S#(UY~z1&I<p>gAl|1^2r;JkzH3h66Prc^UoBQEPj@15IcKi6e#^p-~MHk-dO
z`1G1F8_$rq-|HP5zkQ!XtvoRaKc6_KWGFv|QrLjd(;9!QOg>8_3ERdXAd8TV<qX+^
z${$4_e=WX#PK+xpOu&ivMw&e%IX%KilUZuJl+ebH<tw}SQ%}$PQn_>&azS7}v_-s^
za;<3?EsOr<$FL)<ki){84Y=#r2z;X`=InM~CvbaHGU0t~-0U+1&+XH1^)3$XgL3WX
z%+_dF6S~0aB;vhi0;Swj8tQ6~m{9!EW6_2hw8dyfydde7vt1BAK0Jk7s*?P!lv_SW
zD5*1qm5ORrl00NnwJ<c;DS73is|jL2v_?uZ{IP-V2_mb?Mj*}iOGs5b-HCa1A^j8e
zC<g*FbLqa+i}fQ^;CFx55FBwpjUvMeghl$ei_>}*gE`TJ>l*(}=VuaOP;+uWA=V0}
z8HrdSL|OGTmda9s2Z`EyZr~DDd_T}Y>M(n9s3F_@z^)f7cx(5n`?{+{43qOalC4)+
z!!}0d3-<xYU+hDqh(kuriSRE>ko;sX&Xk1(ReM8bs|Ge`2*!%wD)MeJXQ>P<zx|>C
z`Oiaz0k45p?>y^TeAAhY-YWK{IVnC;8dVmv(C~Po%yOXTC9%J!5!}oX1GtoH6#1kY
zR5L>72xB+z3}<Nt+MtOpBjj*sHgF9@Gx1oKn$gW1n9e>vo#sv~;?R?7F-h$O9<%Ma
z>m-WN{tg0v(S|)k<?@Vab96Ycv#`xpSM`~h`F%}e6x;4&%`42Y`<W-uf$h$iDdC$r
z*MMQo08Ym1bzmGT*w%6TxcNseW9F#8i`!yq4%+Cg+Wxs=(uM;6MuXZ1eHNW`V@|zt
z4ui^eGhhsV%ayXn&QGn}Ry23S2NflSw@;fhjofE?xCM4K>g8T}FMWS$OTnT1j>oz7
zs!wR6wWg{jaI>uqP^-Uk-q(@GXs`Yu&TXL{+FhR#0JX*T$bSpkL*(fFv19O$NiO#z
zw9PFbh6$_<1DmnBj<dSan}BS1!ZL^}io1=S*!dGVR0h=TJc)5T{5&QUiQ%+32tf4)
zdgK}NZqULR|Fju^YYusacEjF`Mx$+na2Q<^ZfpM(7IIr5#e)>5LK!(~E{EHHM0Mmq
z-q-k<>~qFe67h#}sq8#@UCB4G%OqIj;>M)DJVH8c!xq{TdOR%&LrQmgFJ>E$qIQEn
zJ(6;mw)&xXi#OV_R7bBFgE3{l9?8b@l)%L4dlLFrf>Cl-s`f*Tki6M9DcQS}R=n-l
zyNZQGe?LyMUkBeK$9(lj66CmbeUajEj%Vb4kBw33yctpeCNYfuDQ~xRZ>q%M4m?BY
zl8rF+_x165mqlD<{H4qO^wK-(PXgIp;Ce`6oYv+<Db*#KYt9!<;&gg`gS~tgd$CR`
zSwATF%He55d*pSC{WeB5-;<JCwZLCg@0fSDw!yBGz4v}U?rekFH6bIP3Z^v&>>&5F
zc;3~!N}5}_t0|D8rut`)w@a>E&3hYQ%G-VJU~&YiGLK(xjE*mbj1K=YF|Ff)zhX5Y
zrZwJtN&I)^D9YDHoCA;(S&wm)dv*Dz2#!e5N|yDP&n?%#0JW=Ue&HC}KJtY66ECKY
z$$!pe7MWi3Y5||Nsol~1l@mA&w&PMx5sCSfw8%^E`;QklO2ejUb!#WaS>-Zi@2T=b
z@H=?~Ua7U`gBhR63c>pEwM~Z#Az?<Y=y|!Kl`IkV*&phlxy`Pg6gltBM`d{vEjn6W
z%C2!3HE<xf*XfGb;5|}b5|0PVG$-M3=ZcCS(ba+l6;RL??9+y(F&1;qj8N_h8F{LD
zTe+3ykN=9blhBh;?f(olTDK{|hjY=k%4ZHIe|wHebV=HYc6<~k&5(~JhnPELHm9MG
zXsCeZM%jZWaN1JHI@~eeHD-u-mreNfUNW*Q+opJkMf*%ym!chkdz91r;f&}y)gw`P
zOR*v->g0UKs|5soBPIBs1f=I;aTAM$)0?>Vm-R3O9u|?-$F7)D0eAfwJrS;D71V&8
zBd?RhvU!<1J1_2+$uAr}moknq7=n6Gsk*?IrX@#=Xo-W~W<y(h%^rI;!4Aek9O`W|
z7k^C@<*~db>Bdqhmr|N@GU9dp;=g`i5D)8!Sw7z7>aiFxc=xeI@56lmUf}=xArAeU
zQ28!4m6JjAp3{M|$wrn*T}KoM0F`FbHbo!~Y6i~g>+OGvB8lV+`yAM7_Cy_ij!)18
zo!i8p9VAqSgjp^t!X$oJPB!gH_vAB!_{-iD_1ZA4wg_u2O6ZAg{GK<rF{%mmPg;q&
z0iHTnJ6#Y*kS<h~>h!EJKAy$VF=70KlLlvVTd2!6eI4zxnCP}8i9+>4LlNpRn!z1U
z7&IM**qy+IDHA#1*oc!4zP42i@{B=vQabnoukfT}DpF1ScTvPw`hiq-%JQ!1fFY4}
zI8+;P%Ap*>F%y-~bb+;sw~Ar-nA?`a0Gs~!=bRClE?tv=Iy${2{rx4aPMCSPnoxZn
zy0oTNYm5pNB`e?;5CrMQFLUz?Jq#+qqZr#bZs`!A>zCK^S-yK)Sw7CNN2^PEFS$Q#
zNTTNpl6fGKXp9q?R$G&qU1oOD0x?zYT<>x?JtiDno3E~!?%^q4fsLUHW@RId@|+Sg
zR3u;*LY$(1hjB|Vj$GNsQNWqCg~fjtfusdC5T-3j+~BFc^cUwvl~r}-x7|v0@+!S_
z4fr&(aEs1L540&hi7hjqg`E1JqUGZ>Sc}EIEr|tyCNE_P7=3nWk5zNDx%99Mp|8+$
zFq2cK`|z;erLf+#ZKnE0umhBROAj~uj23;_fDOIq@U}+^zeqwM<@O)VAEB>U=(MIP
zf1tj(Xa54!KU7g$@S4N)Ud^rx)trgy^E~;_%E&b(VI7Cn1s3}72=hX<xzU7&JIAnY
z+mhJ8x+yUd2!n6!xQFA%Kp_0#EA;zC?;VRLO6^|N0i6@~FG`-0-QI``AAFmkA8Xjn
z2$mvRcJ?}6Jp-QJTYkG22@LzO$WVQ1OZPXXK#=ChsVw%!9@%I?WtY8YJcV?8;tO49
z<b6IX)ENX9-gDZ|NN+>+ne4?{6K&g}-TknT>}7jdfU)$DD}#eq-s~WiPALxVg2t>n
zNo!CxLt6fjtfb##v`z5PEE<x3p>I5CQfVVU>Ai?EZ0LLn%L0dQmK%f1lu0Y&fW*^^
zesmD80q%__?P4=LD{t&6!shRjDzUXcC+!HPwe0<z2Sg;TRpGHOc$@}r+>xNQGCGZ1
zPeW)@r0R4E8Z!M?%5*PAWffJ;aEf`ixcT%GHM2O_{Pq}imB@QH`7`sz#(gw`IhR`5
zpfLT+ZnZy1<28HZb1&`Ckk6rkFl6x{gti~UH7~`m9^G%MC>G7l46TGCPv(1#CQ&5g
zV=-kU=Sd`Xk-MNmX)F*vF(|w^4o?!u&GOV<v$1e-c=nYVuYd491ByV#h49T9uQgm>
zC1zNkBT}~p-;bY!Wa#ntj`gzWLG2J0p;>9%-TFOF88OxbQv|M1Vmd0TtF-7JDxIm3
zcmiX`4h}mVe-4nLXqY413-37q)*{E5|4K+<Q`ij8066vU4}5_;#>8Dpv&Fs7q2l%v
zwrXE`LqT%aejQ${R<-AJxWL*kZir7Q!W|wj@&1E_CxY0AQ?ppvzxn7li;>yAFG-_L
z+g+XpzmrOd#@u4e{ekpS><PAffosxsdVpOhuKefk%>kw}j^VshAihm8(SO~-H%4)*
zWyQJqVEhBNqzkq|A3!*|hWxP$W^6h3@peam_RChRhG`FAX;ZbePS%?hf0Yaet36ds
z$_&&O&dF?s$AqooxF6sNw=>YF+CJM~0iN>Ax$st8iw5yuGeH*tHq>y^WBVV{;9QRF
zi)<oCwndNG*~>7Tl>&C|@5PcqJ9{UAX9sRYhKJDgSnOQeOA`8)ztgs03Li8`Qqu;i
zAdK(9MQ>Rrw#qE3DNttcM$w+Vl}?nW(3NWvW25;OV|r6hU)m6~g2y;6<<bx_VWd@$
z?H&{V38X&yI<M#5D5U1E7zqav1{0;a$SyzP@n=oY*p|v~XQM5Yyjt4@`S!N-v}0?c
zRm;-(kZJCcdAKR3!bcty#U%}H5g{fBzH0tn+E9;U$DEA88AUfq;{zu#;1W)hEMem_
z%J#v#K<TSDHzC!?E<-vA61Hu%ibiR!WOu^p9%g*acZJcB8s^A*!=d61n|IG+7jG8~
zKu}1OJ%|p8OAe0WOygz;O4(Gk1B<aTBQ%1m6b=FDoB#btz0nzkN^v5JnM+e&MBanJ
z<9GSMGkDE)z+g(>nIrZh{Ydv25!9N4#X%T8E*;i~h7~BMoIQB-=bp^*Wgb%_8O7sr
zw|d51hFVgnIGvmo4Q+9vG?;ub?X5~rHupCy+7o5MsP|frgS@E6Iqg%Wh=Ksk6ZdLZ
z=)*s8_#GDs+ajaO=yi|xA-1lhf11$wU6^;Fhm*Mpi#10<Ji<P~V;EC1r`H+Z|9Y@I
zq;q8A{K!j&3_zv1ET6B8-}ePIOeXhRs9gziX-<%}CVW{A&|~2IPoFk>vZ8;T=_J9q
zOPm$+%CcrHCcBLBlL|?^uQ8d9=h%4PvW?7C|B^_5zvj)FG3vWMrSat&gN_kPPnSM0
z=7_Lh+jIhVS&Wk<Pf)D!3UbEFVRvaM?;ttvTa*SAWKmxmHm7TbG|!w)iadb6|Kc&_
z!HjP%QLhQZ<+hSzKnghYioVjsH4r3wYf=C_4RmN#$nhZpD(|QwQu-T&7GDFcMn)D&
zy1IpO15j@m$zRC~a(k89!T_luD~t@5yV7MZ`#OnKL6n;*e67~&kS>PyNy<Qr-j`~w
zL-@SgJ3Qf@hFhlr)fE1o!X-onrDH3e+XXuIDqc?xWludw;zsnaQZCiP`>}z2qFyp8
zE4OIYH-#^OdrCV>RCLk47gLVspQiL%zoO{oI+N&N)Kh=uyGmJjnNGKm^uL_5a9`0N
z-o>|ddw?WlEaxMhvFsWpax8OFZSKgfb6#T>P7pp<TLe6twu1W4#vv=wvD1*sS*#Ht
zhADqZec+srag|req0Ix6$Kp9j?9k5oh`f;ZgCTn!5H$(U2S;(F>e0rOpQ=(?-wlC1
zkubN`$)~+sA@Xj#=zLY73G`QzSCJ{yp~nG>=rj*Thlm+Vm{f)gYWpee^J7B5*5O14
zEt5ESI6g@$Y|WSO1O70+Re$h@=vlEaWg5LQau5bt)0JE;QD|=4^z%Lp@xbC}Jzmp!
zv}BT6SW}XdFyJLKG~MyUP!{WZKTt=tCQE$aPjD8KjLZ7stZ3bpguo}HPCUzAshh5*
ze#*HD8!nCOEJAN|raX}(ooH_xdaAqXTB#dEILjU1t{0P`Mp%zART3r~tTIfyylx8H
zqH<4u=!(1zs&K$leuVbg61>{sq|Hn{2u0q#jX@URjDo0Q3%>M5s<+=tfPNo8qY4&0
z(pWsf^lAoibTDlm>T{G&W0S=MUc4V53w7M0bzh02swWRrN`gV5p}zgXNfs9^ZK%MR
zT?{FBO({DaN&L#*fwaUTyAZhzzPTJyAs@vtq^cvh&`rm*8R#$2$EVtdyBo<_4F?Y;
zk7|6~o4ypOKZf1(FY^$N*M5gu9;x#t5(|K*`c%mU-<E+CZffe@5gxvmiO^oacUQGE
z<Gcw3{TRQJ{5rZtKYp}5)>i|=k$ibIX6OvN=<#_CqscpaN1$+RvVBw5j(&fBvGu!n
zB3_)S@ZLdtCVe%Wo)o${nGN1QF28;yWDA1eTS}rcq&Ssn2V&KLcr06;5PALubT9Bc
zD*zAqIgsj0x8Fga>`M(s-+=gjm8S+5sIJQ~8Mk*N`zi*)XJwjv=h^*7Z?rv<YcZ7m
zC4Sk@fy=ysC!wKmBcCTPg4I7~!-4TSC!XhNJ6Y-7o}FU!YG2}{XmWR>hqmir7oz9s
z&*r`PE^)dBR5I;u^%BpWejUGTWKq7dGww5Y;!1S`Lz!dZt(vT(WK)h4Ho%z0<+d2I
zI6hmA-c2oCv7q1hekDBJKI?Xq_9=T^>^v2?vFF66U}PE^&^-MKy~ykk{a2^!`Zvsl
z8IgY+!ZQMRxGoj7^POU%J+(ujaFJ2;%$7F>?|rW56onqRot~y-&1Iu8ZCS^7-~R5$
zhS+0n^sO4~_`_1E;eFR{T;!{GeiV*i>TMgaQh1$T3ZTCac1v=KbYJXRyh~#IO&>O8
zP~r`Ne(It-kw=xfJ+=vB_hH~tYc`#3SZTcYDvx$>cyWo<7eLyu;`QIgVc@oBER5E?
zQL3)0ru*bY*_D_KdC&D;Jtw?o1?;Q5>>FH$3FUYC3?4K$>Im+5M7aT;vcKYF3%hp^
zdu;BcdE}mn^<VT&W&5`492<%?>^n&{h?Qoyz2RJ{c2OR%)tNz#&V6T_6kQYx5mj@{
zB_7Vl8&%A5>nsm(@<8Exb5lp`&1u4;R(Ts3_XI-cvIYH?<V#SuzbpREd7s3lR2_nI
zToh*oN2ObeKijlbn{K^)d~jW2=PBfO#hD}11nB=(*=|wQ#iq>eo&ruq{WKomZ?4i{
zF5HUVbXXvwo4xhnD#fJ3cS2Z;Aud^Pk1Nw!-)8X@g4ei5u3Bj#MzEZIl>N=7&d(!9
zf%0P`z7Gkc&OV6b?G@R9KG_^_&lBz(a-vMSGZ2M8iDequlpjlfGe?IsAgPXBMX5=v
zMljhOmr}Pu5+JXtre*a)RmwTnP~>eVnZ}IyVH}OfW%;-2QoMRcDE;))S#?kAiBD!f
zUv!OHPmX{i)VG_<+Sm=HRd+sN|G|y=#WlP7sqF%saiQrJSVqjHJ_6+gyY?@_1INyR
z?cev+(>UQJN4-&h*E@1wFNM<xC@in(EuCDVFpQy6B0U?;wlyhN_pw5)tLFg}yQ)g;
zS@%oiDC$l7INV(;1n&}m4Aa(Ls#Q34I{aHtzR@s>ig>oy>9fu}rpWJ<S`Elu_Scy_
z2B#*DV|XA9;Tn);GN`tZgaD&l;wbA(9K|@xiYXdl2t3~33FNZKO5&b_?0<t0tnd!D
zERiUiU$bUJo6>4gox_~1I@Q7Cys7EhT-vNci1IvhMVZ`W_s-^ZqW-qrfxGK98o7$b
zk1>j${jKKjKt8Rpt=EngR=dc7<AAcPF!^nD3-^nbQ<$0$AWooRAPRLIb~EiNa2uRp
zzG@;qfxtXbWG8cVA#KjE4Au{Y(P>R)-HON^XFz(fG7|2-*cnUfpkh(rP8f6;)qL?S
zUzW!~qPx2dBBGV1xO!3-O<j>ajK8_IwSX)>^FZDcQPdCyIEBrgmLWI%`S}WIjZc1H
zgSkNdCfntqD|>Tin^-$(|8XFKlg|z)EAVSdA}YR?koiNkCN5NwJZJN@V2Kp}RZKdn
zxYr}OdUTCYP_68cz6(#S^G;2FTT9LbTOap<FZNmS2l}hszNm=M2yMr4RGNaBPDdNb
z31-_O`dJpEmy-Z(J<>--rBXUiF}^jj?*9N=K%~E+Q7v4Ej#O@X{s(^1!Ggg;k9{Wy
zQ<@+OeY9=_snWeFA{(}v7lLq;fciN(BHkjMg|0;;hvVRUV9tPliQc`7{y`dmqHBdN
z18yQ5SnJ?1iPG7XJfRtEt8q?_11KaWiM$*j+%25n=Q7bBJ!H#esSk^?qQ1FAy7Qn#
zkHFszF!qe6YEG*TJyq)=5m^ohT!p*2PHrgvR>OJ_N-tf|0esgkXbp1l!uqu5<YFFB
zYu&!^v<uk`D%@6FnkcaqF4(5S)S48Gzzy@18vQ~y6C2&-$0Eyze3F4sMi8C{*EC~b
zSNe{jTu-!~d<*}B2l1yi;sJ43R7+xga1*qXmOZl0&z#QjwxNFiq7~h&ACs$cc3oGV
z>>5a(oKO4BtL6i>PEs{ryO2D+#(1$qU){|ezKG_z9D0}LGkymAVIJS&Y))`PQZ0ci
zsD;jn_~iuImxwQq$QiP%CG$_|Onr;2CJIqZt#@Cip{AI5LofpYsvGkpYGv`{8;2)R
z-2hLb8a7YjPy6Rd8`QcyX}2r8V|RM;(vjHUecV_-ILViA9grkE#|?9Vfp^9YyjGqp
zlXzA6n29yIirw-&EXg4DE1E$3yj8)gW@t41p0&(IQT4uNK|@=@jl!?%K2hmu(y%Nh
z2j6x3c3W6o>m`ra$+8fe8ro3z_#`X~%vi<l58?pY$Yk=|m8Ig}TI|$ZQB%O7zV$4Y
zEw&{gv*qNpRjjY!u|kKILAPmjl&`ZcqNIoNm`of>!}g>yAAaQBLRc|4Cnoqy94nQW
zzIB3(eXL4&b1$wm3E7^UXb3giY-W`yqzsi(9IL2mA0GFDIz8Z?kVj^{4f>S5#36x)
zYRWU%sqk~drhu-Q*2VnlEzM}M11y?h_k>0|`)%+@&K3hWAy{?mpq0e)aj)h?0N@%H
zMWAKKsCXO1P(Z0Wfw5&;+@!AEV#a<Au3wvxxopeDL)^mfX&2SJ_RX+bav{gtmsFrB
zZy^)(B@PDx1c~@7PN$2D_nSi32Cq)qT)Rzx>-AGNxPd5o_Rf3o8_KZm9s`$%gS*pr
zvOkFk(5<uP<N5e^>AoyaOr~1=K}{3~KLwj@BN6kY4pFH^XeyC||N0LQHD~@?$(ukc
zH{Y={8uuL+Mdr%_gzMP;Xy@C09nyYq>$s%-ErU{N&=tfKmeQL1=HoNjXLKq5>*F3;
zC)tK^ILIpNr^>yK|D@-Mugn{y*(#Z?lCtw>ber%`v!2a}`&!}1#J7<-bz)t_UxOi4
z^2Vjkm`e}`4e5#fZl2xdBksgc0BRh7>~I*J^@C5KB_>cmRjoo-T}J_4Qz$T$9<Q+G
zb8t(DgTEqmM~e5V=^XHC=s2fMNV~oA;J{~N>oR#YxNcNMnW;g-7(U@p3Y=24u)-&B
zw&Z$9^Vl5a5frCq=;(VD=eJ3@Pe$B|_KB@*Y+JM2N~;`bPihX$bPFAK`r1WWIC`<n
z4;PAEtPWlDo4eWde|xi{){b7}_U~e=XWM{x-G=1}Gz{(}8RP^u4p_8_L(+=+Ia6j7
zH6L*{QB=C$S9>kk>ZB31nuPS7@&k&4jWVI;Sq=U)8%B(_C&4z8-NtrNGW|81$E&m=
zBwXcv`125_2HY3!@T|8%pYmn#lWKllDEzhsQ;(l7d)@Qy7*$8R`taiws3p&Q-q{wn
zYTQs38a0g74Bq;3n+Q;vJcfG-{X*<;#WPbn<D9ExyAn3-pg7Og^BKST!-nTc-BT|0
ztniK*08IPVwKNHJd}OxpqKeVHJr5!HEmM0MR8zks{35O-$)b0GoIQ<bo~+m|4&~;q
zJo_g6)v!Ro3x&&wgn7wlv{=ycy)G9ngf$inw-H@3P_Vy#9|d8V;6Ri|zeFwd>p%Rq
z@R21>xq3Z>TG_h(u~lD(*{Db3bpFPNxL7=2!A|unGoELaI1_Nv^w8$k+U%Gz1aZ-#
zrY<|6kBAv?>0VjEhOGu8*i8bKgMO3*RxjRl*)rH~f9~|Uqj6}fWO}*Hv-Q#&8^rZH
zLZV|9Z{GKAE>`Ku?J&N;<e*m2M;v--q;u-)7Y0i;Iib(f0t{T53yi{_*0#n^iOL;u
z)JP8#h$xt@)=aF$l<Nf+cwq9MP3cEoynNx?o_Ph-f?MTSY;6UtjGGI<YafzU2#S3z
zjyhcTej@6JuI8brzi~(h>3qa&*<eOJq<<+-N&MHVF56jj`sW?mCRshn07reH#KLH>
zkVe=vm9RBW@9iK5mY|2?)Q3J5=v<N`fL6DRrBjju!GmN%9IFCOePDgrZ`uP7oOMzj
zc$$TH^^C9;Zn;UQt=rB*|5*tAAx+`d2@v7W2)PXaydf!SXb$D~5T4Xhr2&}W;f}H{
z_qy`+g<r!YrD$aPb~iR$JY5C5+1^GGUE;?{`9$jLBE6Yi-*d+>ei{S2pld}sB24?#
z76I0=MKlDZR5a-HS|bg!2L7eCj~++IL<6-)Z{pX|O5Z)9a0OO)`{@}kCy+ULD$z%1
zoUePn4&{fr-g`9OrXk6F6Gl_e0+PP<P==bP#)m*}{veTs9&_U;5zqVr!6JBgjH@%9
z;hW|Rk5q23BE4Oh2Rh39rB?p%7tr~!E*BaMZnp4W(#1SoByi7L8_)<QWqsSjOQ^(5
z#a&1I!;=w8it>vMc>-zLV^w;fd*M$d@(YtH{}<_Hcy@FKr)a7ZPrD)!nF#H6uW`HR
zm#9&!0Z)(_E{_+t$wBlFnvht(mDSQOAffJF1;Nn$Vs1nXr#=s1RLyY~G@E3bF~lGl
z>B%_Gy_GIRN`UtTLe38zvQF6lAU)$m&#un+xRrZ-&O4-@_k_<IdWiE|q%%v7MZ--u
z8r*F@Db_bP>96$w2sUp}c~<+Kd3Kvl<9Y430POl!x8_mCn|M8E>UYELL+$FKP~3aj
zcJzwo^!1T5omiG9aIQNBscd2IwS~QnI`%f&4sV`uH$+|8EY-5R$rBX8w<peYwoyyd
zMd-R1=vZ?uZb_=|a2zzJNXyL(n4GbIic^j%dm*d-Ih$?NU<&%>0fe}VYZf_wzg#7?
z&BPO+d^k2;{)YLl;FgwM#P`?f?V6{)SeV&B!kC8w&SX|ubRVy#cN#LkD%0>aqawrJ
zasPB=C)%31k7vk7uF@Ve<VVS(fQPol!|RO$wp7Tr&XVRe8n;=4nz9Rh&INc-X<3tB
zIoq(g-Q?N5c%xM=jMbqnYRJ;1OXO!2+^17e`tc`sfI4rjIIz_vgjY0DkB;#Dy-o5+
z_p%3-zfxgw4n@qygEE6b;H6l>Xd}A8+e~<ycWX#bDSo%p71D&6YCztgbihr=E01HN
zc*le@*dRu(KjG%t5xEhWTlXQ@j8{sHTy}=%U_7ca|Eo=G4|K^Y3|SkxCDKx)+833Y
zT|%Uuft3AH@K2ij-`0oYmoL$sqLnih=f0k_Q73@PX`U`u)=s98-b31>g4w|E1{c2Z
z_B-m2*78*eY>2EB%-a90wgAz6#=sGeP&An0`^&+B!-yk3EStqhO@i#8;;2v+T6&sx
zB1NauF3e~oClrlA&549-e5x%q)%t1Izd@W7*nxTHVV!X!s3;G-WlA?mqT$i;@k@2`
z!R<i)jFJ*Ro7^v~iiBIZ`f)h~o1_uRNvyS<%8W%`%c6Br1uskK+edDyWa+RvuzAt?
z&bCKW70Cc`W_+eCHdB7o%+^AMF51s;&@j1QvQ^jL9Jgdu{~)XllxVt0<NNsQM0lvK
z`M#DXsQ074!8<>I^_?x$>uC~Q$I~ysOJA6_JB*^iV*V&H5%Zk1@toUrtMqGP)?l`2
zWR-*ok*#&I*4-=|g)LA)P5!PB50dR_0olR8Bl=34sJE~2(xR<MKysRilpd6F(JHP^
zpu|@`o4+<%`<j9YoFC^EIUL!mXJM-y9P(|06)N|{gF6y~g2J6|`;83uLR%+1+}qIa
zfjrZx2fuP<ZsV-Pjb_!STOyssPo|Zum1?##8I3=WCr7Bnm<aeuHl(?Am+&J8gUR!S
z)uhUY50gxy0=?hh3A^*aWp8YDF&br=O>)gCl$x^;4d>>kA&^DqQFvU9UeK{;C6-AW
zpcvRj4ivVskYQ6Nm23Dc*qS#!R&f;x&JrZ&M<c8e_>^;B5&Jb@Qp$HlO~kruxsnHF
zEovt>tM@2(-Sc0bd-L0+w|BJOKS;f@pg9b+LZ%s2r?NvMSXjXF3%u+z;GZ$O<G1Id
zaeMr{`J8PYKaV~>|09Z-k*W;nBKmDKxMG_XR?fJAm|0Qeef7x0?2JzM5R1H!VvpZ^
zt_G|^lAc-v@fRD)LWGkCSW7lRiT-3~{^e!+Px-5%s+;RqH=rv6n))fp5$Rnux0*)~
zE_;w#2X3KdPVx9EiSH>%;bFcrNFs{l+$eLpNSOu5=%=dlHp$y09k*^>m6uy~(I1RE
z@1ia<)YmyU?O@YZz*SDAyI5cJs1EK@%^%`NWq9*+YfT8vPFPbozv6b1V@ZnpdJ&8j
zv^JaarC4sE3cn$|DbBVe%2tIJ8&b8)r&cusOu|CVeC>b4eSi;5_Hr#AnaJ7al{kQ7
zs+(K7EpF+yKxYK^6MiI-g^GP`ablv->ay(Rs!MMcbJgKAYk8j^tm8>COxUoODtjjG
zVnzY8INp=YT-hzI788#XItk4AvyXe%V+OGLNy}A>vb1z($8YKUHw#s=8d=uvTMvH2
zK}uEy7t?=Ec#;p!`Z%u<m~?jX(ng8%Iud@C%IB>i>JW6!l=UUN(6(l@G+l7#oGuEs
zCd_=+hTjjN-KBiXjg(KRwg~wZ{OzL#n_QyN1$rD@C)L5X)O7Z~@3fg0nkGXGt$Kcj
z_CEXM`}*fF_U6w%g_?#KTyArpK>$^H^H_du;HuZ_e)!o~6e?u{4v^dJR#Adwc8Usy
z9fk1XY5TTpbo@Z*?%9djY*2($k(t)EPR37&-R{9Op%VS>Nj~&v=wlC%8zdmAp^Z&s
zL@lq(MaT8R_>_MjGbYN3nQZM52}OgNDg2l`DCR~0Z{-NNNYoaP*ott(%iW?(ZHlF!
z_QgXB(>@WwGYQ=^4Ba)P08?V0QDU1dJe@X54Gs6u#Acd5Dk}HWHKMKTjWiDkjiLxc
zLlW#-{6H8Gee|=?o|EcYu+>SZYc&ap-<fa2NjHQW+M?uvQG#=A^`3a%o=PfTMpX|&
z^JL&M6F4|q9^{jh+9I-Yf%8n?z&)}%$n<Sef^U-t+zYb(STx0R==G+g<lR_e#o%f_
zJ7${w`KF8m`X<JV)7a0VuXTv+GEeX0{LvE3a4cjbT<3PE68R`tm4AXbQtNzP2bTtG
z;K1kHighZ>?!;$Ox`Ohks5>^je?nFn)_a3uMIDjMlds8qax@`cOulH&k{dWoovasZ
zET#w`*&{|_*_~F?XG5(Byt6ClYp|rCn0RA4pihWpoxzeXjUT%G&c$SKSu-<&JphHx
z2J02yn<a3)fo;X4w+71fljiZ<<Q`h`lgo_lKH|lUAQEFEYN&d&f!Z0C8B(Y^))klV
zVIaFHGpSJf$wd9BldADf0tkRJdEfl*Atcc^Wl}k6$a>b46=k)lWg>h&vj#;dzDM>}
z8Qz1TQz1Uk@nBh$;0d>yOypk@OZU7rMbc>$&t@rr_D;@&zY+^kpe8VZRe>y&8P}1V
z`=aH1UA(wY7wdvo<4?zCZ11n{NU$|%n#|y~6s%A@NCHxp^OJ}h2r@jR;>yMlLh7Rm
z6(UxZ36S1xiI(!pKD@+?+m@W=GR>LHG=}AQ!_1MRQ^iL2+1CV=Lk!QnX?hks)Y64n
zK;`n5f1;|G6gn(sIIInD23bt>RmoupM8#mD-?H_~w3$rAA7Rv;)j*w#C!uhTU6qci
zMh&(kv2_$shKkFC@|-s)!5XepZ;22vD%|PD6bUMNTWJs9vcSI?kHF>Nr_Qi;GGJE|
z%AP13%HWh7<^uyhp%ZKsGsW}Dh#PM8U~<)t7oxXBRD1xjF9<8WtC4`^bGLt0(<2hu
zJnDnw=w&&h0-t)gQWTxIjEd_<jhy|?*c2C<Qz?s2SzWLVc&3thD_b_v?ZBp$#-|>S
zo?tVEcTcCT%u6j#K01hxh7_C`Hew0gy?)aT^++L7_LRVz4;+D|VKR>;eYp5T%w;`b
zM9*QI=!5n}K!-DC5jq^>nCWm{pA`C|fZ3AS&sIQb+np_X4hDIEie8ke{zX02Z)S##
zF%Fcz5GzJ1TMQOxF%XbDy;00oET$l6nQf*y1#&f5pw)oa!9~I7>p@<EJ>E?v@(e&q
z_47{YOe@wt?@aj>bMIs`WR9v@sIbIR=s@kNDf3PW+BOjljh&^(-PF<|(^4o?a8=#7
zHw>o!RByD34k*@NS7Y6WWFfJqt|ljy&7Sf)m0K`cp@a+<qUHNk>>z{WApKbsnbAHB
zWn8c}B@sq|qL2-8X-X&4d@^ysp&M1zA*Gx$PlOur3a`+Zlm1{_Q_oA4q!PzD+DIE9
zi=Y9r5PS7@|DvwFvB37m!nTQz)$wZ<vIVo8k2t7n0A|Sg%j`|CeidBtm2X5P=@9t!
zH(_D*;kSC@*AUC&<GS`05y606h3k}n<@k(_ZAXpfPajgQm6ScfQDY0hwU6`FN!zoy
zfGz30dUPowQz!4XkGdcGpF90AkImI_ea}eX-fj*nH#~ogtU1(pT>P~@0z=vIaUUTx
zT#knhD)dE2K*i+a*ug~P#1mI^BmJ8^KA=DWX1Y80!6#=s9hQtDVaSvFc)5hDZO-Ae
zcWfW=gK4I!j^lV}Lg>8`0ictC0yiIqo9TJgKFJF(On~XUXL#xdS*>)6<ZMrXPq~*o
zw!7J3xu*%$So#q)#C}zsqN;Xh<du4hp^22CkNA~(RJz|+>Mhvnyi#v92^^;AXVq+3
zstJ;=Z=v>$2enjAefTvT?;zQH`ZF+1L9LH&+Ae@|^HNuyO*fPfPZNsyS0@TD4-gSh
zx?ueDsWTMUS=1ka^DBE5tD#5fM-GeemWZ+HEudx^HOOEp`*a?LLLyCJ?UlUdrO>9&
z_f)Y!p7l|fB@J18oz2kEq2g0!$2@C9_i^zB&h6$!Vqgrnq>byh`ilXV|0K-zw)h}Y
zJyTDx=)~TI@wP1(sHF#zw<F0i_L)zwqu|u*nP_id6ziKnMoUkNznJXlwPt^d$lp`x
zQfW~Vxvb?Z$vS7vk9^amR1Qyx7*dv@0*T*g>J9oxG|vb9(Rg@uKK2VKF@~tXhF|ez
zQlc$gesNr7cAjV1@-XV&M331zS{I4fF0Yr6AHw94fR8+}IoqMEMMep!UlWMj1gF5)
zbecq8le~xzH`D@82=eox8C@NB6+p=Pesx9&M}@4OvZ8G){rpzZ!>bYqXD}4>Mx83%
zY~|RqO>EJL=phOPC<Hqx-6(ktW;Pu~;!euraO5<yoWSCvJ7EyrTGVIFQ3Ak!18&}e
zNxdZZTIU9fUfvB`?l#Li><yV{W@Rimndl01!jKV?arS151;eN81+ePX{82-O%kxAu
zuozc99S{awDRK%aLBXj`Vo)M`@<FuU=GXHd{+D3%)tB%85YmCAvXRbyPzmvT@>kW7
zmP}7a-t66_hSvWRzY_7=Ozu1~7G6cd0>`+`2;841X-^ihEoJLS%a&_;qIIo*VFajh
z{pw$o*W5%t7U=vOpb%oAMyQkuVzo3;ylClzGXG&>LMZ1I6OF|(%c?{sRInn$1LMp3
z_LW_q+E%A}?`zj{cdcHl`@>+^?)6-=Ta>F_?~-_yP;X`()(bL$=r+g;YD%0Vp2Q1c
zAj8UXT05}7{RsCyVie4%68zB*&=}x@jP;5#fFM;(;6-J6Md!87*e@%s@^m>*R_^UU
z?@RCzzAb1TBolwu$b1}SA|pcU4hUQDG&9NJ?O_wD{SY0!J9=4}vPbN><+W&)pO^6r
ze+*D{2R*%fcUqUu7z=>}T_V8`Ar5(`z|)iK7xYv@u0h||y?O^jFxT)*g_;I@gzD`A
z)o!zGsJD@&D__$A%FdWV-(YzzJ)^QXyO6I+w{=}~eTnHhi1CqcOPlV@aa>*U*ry*R
zFOxGqMTzo-!vZM#Dt+378!=LeHmdgks!?f+(gnp<(jjA}M6ru`36a&nD>J4kEEvcX
zT4C&?JcPuS*@^Lia9_{*@U9Id=Eqyg`(;FyCPA4YP$of}kh8|}T*>>?Paf5&?n5yF
z1>^3GzJ0^9<X1t(D>Y~b%Jxfd>MJx{*Xr)XbjP@`>|K#YWZ8UT8`1p`a*B;7<4@b)
z{tSo<GumcaW^CQ2+uj&9VDR|_876BgaX@$EO2wEAnQ-#A8%yR8Pyyk4qcf_*26Mv3
zDpj$<(^5&Iian&&<JR46q@0l_#&*F3Na~}yt(zYL%DE;xJcTK@^tdP**YtB5o^rMc
zK^_aL`Zqe!K8K`|)%HaAe-}z@LWVF(m1zn~b(Q>b6N&Ni1_Ii@VD+PDH?#;@NZUwY
zwUY;LxgPG~72mBh({}L%_UWv2H}+APKsmONqoZxg8p5hAK?PB}ACx&1R;01a?zxpA
zRI>V&ng}(61WM4SN2VN)ucvd9re#?!@DJO)h;IaU^5++MK|K|TpjvFAEA>RLsfBDR
zS;FYqvU{yCw}O_ExN=^s;Ti0EbCE)1Xg+@VN_=*~1Z@P5>BMYfpfb-<g0VgIRgsJs
zghhlNECc_PR$(^pvo_uPWtOj;W+^W&ZF!MQ=g2#b8l&f_BRgcFB2O@$`2=P@fzV}P
z!b;D#nx(!Gf~KI$C~%YpZ#a?-MS*L6v3W{7#q=)vNA$ioIRCMR0J)k7Kh^B*-mE#a
zF@9!uJmCQN(tdK)#j9xbRRhO@L8}eR@)zyjynKrU(kCKP9zo-a83b_beI$E-xW&tn
zz@3Vsr}cQJKkkzdiQ?=sVmJm^6kKI6#38C3y~L?H^K=D|1_d;!{>+7h_s$7T%B$3&
zsvOdYM@K$@94`9B1FR9z^I><~J#Y7(%t@g^>Itd>V|Of~vG-(gJvz3;HH>Qz2tAcB
z;-4<Jn_|1J=&F8y+%t7Rfa_4mBf}+PY(XE?zglSG!j6?JlSfk9vQA7YM92p{;dM9k
z<$z0d)aiB3d1;$%yx=7aQ38LO2Mak4LN0)9y*(SfV5-`Q>7t9o0)BDBTtn`Ewm!xi
zO;ZhRSjybFTWmgT+HAse;wzc1=DOI~e!6Q1<~XW0?8k!v5u%!UcxD${$q=@8#0OhY
zqm&FDoQAjb`p!FO6-i`g>-Nsw*h^*&oPGRmHITKVXrD(Pau6SB0;0C*CjZYOuSJWB
z-M&xeN<^-N7fy(zkv9eCoa7sZ>MZG^^Pzp!Q~0FuVijwG^#%a$n8Nl7!}c|vuM_-?
z90l(#F3z(#+XlKR64}mho>i@~&LH?EKkwOsjl3vrwe>tFZPmbUN!y?H`;fE`)H+G+
zeeFt;TYDeWbUGmqW;p~M@vl7VpD*zxN?nYS{%wo^`4B95+fa>5X@2TVqyAvlUPO6S
z<D$r>sYr-d)2{L~u{wY4bY5aw`68p*qtW2JOS7!XzVy>F#JVy{=wD=5>8axUJ!%p=
zIw_;*EZ-y9@C5ZQxs_-mnUD;9#2Fw_>3-8bTCmkg_GmTnN58z$xeri%ALm$kVGTK8
zE4K;!I43LugYHSHUv1ax80ki5IDi$sjsz<6%JAz3(IuwQKFzFhQL2``e^Yy_TA(XT
zt|+Py_u%P^PD~+fKK_(g?Ipn5$YR4|&j8yU(1;$ikGl_!6aG&o-s=<JjsHEw9;6`>
z$DQp|^&EYq^vuFh*0@j;tcn7S62lw5qcbK%9%XlPm~Yo{J}Xrb<DV}($O+<kfKFZQ
zs;N89drU@m-{Uj0GkCf_LfBI%;2KH5?%j_UgZx75C(xlHpQ7HVSbG<EX6S|oR>M|7
zb|)J(^%L6qeJ}m$(Bd}wHZ8u58n709%O5L;KjDw*oN*NYt9V?j;$Q8DFMR^#iw;Qd
z?~@tu<@_<aPS`j+?EC5BV)2|$S`g~BE^~0}kL|7$H`@l%54)i~u%)huKtvv&M4f<x
z$m5#WXVk&|ofBj7Ms(A^V(#8SQL1OFm&`3)703Fmh^+ofiR)Smq}qasgRxCIbz4|n
zzc!F=852PaA<!_h%q+0{LP>zyUi)a48CJU(csX*G-lnUO&}#q{-?XX~o_~~Duc^1;
z+gW93f8WcpCDRbAJe&L6HV|SAlZNkgI8<W0d}F3jLAX<XGdRGBb0YF?kp`KPT<u}_
zuoFV~sLpAIsQT=g0to2D{^@?~!o8$nxBro~1B^^0MxLOt{>9wI5vzjUFl+sb`G=5h
z8!p-rFC9VH$Vrp^b^>SU%2LF{_t9LR5Kn&k)a`YeoV)txSHmH<Wc*ipXPI82;Z0i3
zGTfGd;F>IIsN`zR=;1Df|3Kne@yOYMLl0)dc%SIN30}Rgb2Q`&zd$!NV&#=pjE{zO
zG7XLfYib1b5>kTp6SXB{9H4*zfQo56kMkDmvZado;c<<nN7eT`9Mnr)d}*C!RsD%t
zbfr0YMY^crWncojQFJD&AMM#r3h4}wT0!yAb!?+2skJR_q!Rt%p1>PDQfdC^++A#d
zRg&LNLP3|~{E=-}{%4(XZ5uCebSA$s3L(|eLlRBdw<5h?vfYJvBZDjCMe?9GLB00-
zPLCmfGVTmNcl+&LG+Xmtq2ef>C(n7F<|W(i97YmZDR(QPF%??HD+((ePQj@P@F*q_
zI)Z1#U+G5}u9ImDk%ht%QJZFY2<5`Jf;e0bf_(HtED4W*dsq^H9IW(Wa7b__^J@zJ
z^>nMNabds+{hi5115N06HJt;z0X`7OIjA8uT+>eP#J1DCM7x17)s&GP$XDgwV+*@b
zQ%*hX#Cc(swSehU{@9OL-eGUesxUds7Kv^~C}n;aPfh0;@X;DB92R$R&e@<=tf)ug
zwioZvrpRL>s5ucm@JgT9K2GQ5e&zF@&wD{{GWB$@vF4DoRa%4SYPVVHA|Kz@%cII+
zMe!6Ius}eCN$Z?h;aX4D&jw}QAPNLzwLX5Om)>8~@=UFrzjrIVVSf%008pef0IENq
z1R7gj2{I7YAb|1*+-57+^3nKTO>UX^vLz+XZ<EzT>G&Na2fjrL^y5Hi;E#i`-<nyW
z%Bo7UuDYeLGsSzI#|ySbi1MALFotrCP#=wMZJoAq3J|nG;wkS7Ts2@Sc{cG<(Iuny
zREymj%>mqyr=qNWAPsP5IGmh+`Y~bvNW*@@414i@1v6yk@l-tIjB;=PCosr1y3j%V
zcGM=6Ri+-l99{1FItn7uJwIZdk+a3_NB@0C-uyTka_biot#e|@!(s(d4ZPb|P{2Wt
zkDhr!vA)K!E#<~dKU*d5#M@%rc$qOX6pWmkB!(9TYla`FDPT$+p;Ih_C&$b{Esle<
zT!g&zgs!fzZXzOwJC>2U?s7uJmG(jX3rSgD_5wEJmQ?hHX7Sr}MyFOeBdqETXOJcA
z+IGVtyesq$R{JUxA}!zev>m6?^#z<F;sKfUKd~PM{nLnVFykXSo~$-ZC5XYrR0n+J
z>FVwt_C!@zb=$-4_|xakxO+}6c#_>yAY@)yP$K@w|5td~eXW+=#ri(U8K9dky*1a~
z8aWl@G6eS2O`5}QyS`N=SDG;oe_-^PZQS@o_*(DMe51D8#H~48QF<A+T-(q!hps1L
zUO_I^*GRI(DqXBA_O65exZA(#Je?ENaA^A}``%SxAeoSNXGuW_Vn|1zt+Hh)c1GjD
zWz^u+rr9jnAd7D)s-Q!3C_T1be5rjfGg`sP2Fgk%f+n(M3!p`>yEWy@+jSrHgK~`=
zZ<LRjLFm{;0Y^}O`Vylapd_f5I*TtH-j}55ibI)JE5Fm1_R6H3e5c~PsDPzvo)m?b
z>+K_2gHX9yFeyV|ZBi2w#}@#4i-KOZx=SRe5PdT;$(Q%$^bFti%kwO+WL<`h!Ek>p
z%z;2&4nCSU1miz}*C|T9E)z80@D<*z#o`U3Z}GU8PO36!jehQ*gM9%h&v*l%7Pk?1
zrleS}h;T5Tk2EB?)@F$>F?HEsBL)q5w}(@h%<ZWv4P(};*36uPC(hn{nUut6GL+13
zZ8F2m2#M9s3H`iy5&iajG;WWdH=i>(`#k#i{15)VwL11J{;=#xoGX*J=f4SWJ{wS<
zuYwwkId9(=x4P8FIE9=N4rtJ^dY~vB2rG4;ntsEe9!BsW42SMhelYWXr^pN6P~5&L
z+iTQ51*=BPK5Y<)*gtz|@k=Yck8hL0z2VKpv-`RIu`^<m=e1e|vvGfEigujrT!Q`)
zm7I?4R5J)z(e^-q_wTMB1lU`u2(2Z^<Tq9nXE=v~rY4~{#7U5s3qhDIqQ=DvE-HUP
zkJzgcb+oHq-*zzGU98BBFzvqG9>roN6E+j|Zl#2VAVm&L@o{V`&imv(%OC43k)J!C
z2g9HL#jB(M*Hn~1{kzKo!txVjflPigS&)-w9B?950yiTKqBzgy!h=Tj3fGY7SawWy
zl1gS$nnlJ=KtTfQre7RNQh=XG#nNOn{_HYV?3{s+O5`gfks4&nlxd&;^{PAUTnGed
zyF~8t=GiUJvq9~SNNn^h>&Vh;Q*rQs3{Nr=!ZycFD6maJt+WyC)iYgeh)^<-iR(|u
z4l!kWwL>UWHS7@DAY_M}B4V!>t`NQ>VtCc}3F3bAuYkrdf*gAbVf3oiovKs;Yfv1?
zR5mvm&Mbj!IdX-fEa|rje$wHUj$Xc6d|6}<3wpv4^x>44&z?3U0`slTkep_d^&+j#
zZ7ix;o#+=b(s{zaPlT{l^=8+%x>X@6*|IcM@^~`1<X5((zn{%?!4pyF=YF4hts4L^
zvcN~%f$!DK%g458%z(r7t<D#VXY89Dx_WGm4yEHip7Z0hRr)pg-k-I%BtHNe*Bd0v
zKqQGKY|0RV;;%Tt1TNlhatRx}I*BFhHhx|I)?}fAIKJ|;gWh0-QWwYuJ7Z?vA39Co
zqwRv7&CI-q2x!<KL%*d+3a~T(Iuf@$O;m%ApS?%wl`}BhtVgoIBuq`|Ls?pX!whW-
z_sh-{usY04TLf5Hr?<+J*mvz0vGTCfzR;X}5dHA~MWK&wLXI?3*CTw)-(aX%u2&O4
zi}>Wf4PcGug@JL;ee6jIVn|j#)+W*iI5Wb>hu><q+69QZ3?TPO_JshKb4=~m*flME
zvWtKY8Bhcs$}Y;pc*xU=OcFm0yEth}IS0s2o;`ck$kr=DpL*meHGny=hEM{sttd6%
zz&WH6Ft-5amSqIjAeX_V_w8r|e28EaEJ`tD&n@%R_rwmO*yXS*)bBmnme~Y(g1~SX
zQ1}cV@ZX0J21VX*7zF$_gwXGWP)Q)vAl^!Gm}_|-Rk2tr`MJkczYC`dA3l$t2TnQ4
zdm(L{9{Di}_i8@xf9^d8jLLR$uxGki`{Hly{&|PBY=f8Y({RuqT#eYD?|be3kL<q}
zo%8PJc8~wo>wZR^+g)|~7jRHA7>eT(S(DSFu<LfAYIgufD$VXdp0SL&|GQ(K0oe^N
z+tBiI03Z%K=kV{~iVqB7oi23G$gvS&e|50V$Q(`Y5=a^hDC0K?AJWyGo8DFKzWB8x
zDRVH~HM4M{1~mTt`FGC`q5|%X-Csj2zSq2fcfid(M(pZLdB8mIS&Q2z>dA5|J(+!H
zbEuB23f_w<Hg{^A@!QH_u1060FxWSfJxeNZ4m2}AC+#n)rJ%5c4qJD=HHe6xRRJ3f
z)|b5+dp<bpJTKsB7Bc(LbA|VDrKdpDqC0w>g3j1emGjay?XC!wsC`BWq`!F$x;>MH
z0#=72v_*&*>H-2<X{%sCRV`eeVO-j4H$f))=wI&li%uK18u+xEgb=FV6UioUsWeUM
zTxuqjEu_BjbvVhc|2wJigqWv|)%{y<_aztX-N!bWvXvP!Kv<(V`XRb*PMb6FKyEbS
z6^y$W+HMB8y53&;)aF~Aa&ETzI?)-Nd{d~OQK{r!J03*ZY*wBt1DW2s#1)t1erk77
z8Y)qJXC52q4sAu+ftzoe`fK#0yjzIaxyxpIYjln_JzcNlBj;n?JiEF>zf<w}80#yF
zY(gOY3F#_RwpUF>p{k*$XoG;3(s|de<LQ@T8BcxtX~dTA+vh)yF5Bm3Q*Apy+!}$@
zsL?VjQgMN}l(8e%@uJ5F4{o0XY%3}nFGgO>AY1JkFXgns3uuQ1s8lTqH4zd5&Lz<Y
zewvjQxHil+;&!~4YaRCtrMFLD?U|Q6h+=I(?HN*zLn%5qkxKbZzB1eGg&7W22{4*w
z#O*l_o|UZtf_&dS&zor;1m|DI^x;W`=CUgh3P04#MzQL`n5HrZ!=I?<KSazhlh=IB
z*I*#@2IOY)rnX3V@{len-RnPf`(+Mx@_F}6E(Qn;yDNSah`>H`-u-{DGDoEKd)v{3
zLtevjCQ`dYLRuf{t)$dE+)X?!2Zm2gbB&A=Fxki!)8#nA;^Z?j-Dvq<%{Ldq8YZ0E
zC}hUz_w48E;;vlAKlH9fpMoMzze<7rKLJ6PqirhXd<_4<yOMDZ8Cpnq=UYkm2k5Cx
zy!lZ3lWjv$?^ESyo*~I5GoWnqhO$jPnciHUP4@v|CJ}oUR}n@w-;fxi!oA9{1y~IM
zwptMBWo-}!wD)DfgB#1ApzZS@N_4KN8r70Srz3vfd2;OQ*<|LFhYo&CfKrF(Ktc_I
zb9T37K%tWui%%NeTadte?>P7ZmiWQQvFgYSC&N5+m7~oPb`_9b@i<x;r<fS%dpi`d
zj`(AK@Lp3USny^ELJ714Xhil-UfP_uFD-xv@aut-m(&MuaW#<#{FV6OQSqKV@fLWs
zeDPKr|9XD(QioBBQ;$-0@L@3g+#c(i_#xk|mrvdoT0g}QyKoYs33(SZJaWKM$k20a
zp$AWzOjm`t_f(XRY+*$b2vy}n6fB^;i9a?*9h=sUjq!qv9olp>Yu+bx-sY4>PxPWa
zZcjQFT}bOcIyd@SoVCMM|KXr#D%jsYwTJRDcA!p!UfCA+IRtVY)Ry6OmK4)Le!<fn
zcV_G#D9F?0D$AP?Vx1I)i(zD8HAUXeB$Y`K#p|X#NgGO`9Pl3Oi>Ul4Ox_VU^P|>S
zDS3$<WTBH9Lgpj3giz^zO(6@mI<}D2B&7O|$RhAnbkAU?B~%%XCzs5^|9w39-0feD
zI8Tzi0>o-D=&EcNz~Pdab(8yau`Z0UBD(6zu4?6!CyeTAup3$-6iVJS@axQ+B%?t^
zPt~;kT1Md`y|~@S>0+|Xvs*S<QS_`K|KtnA!C#)qn(p)T5TBAv*ZOarGd_Z0c|xa2
zvA$N_i7Ijs$V-gJ@e&z)BBBmFaBm1L8{&&KI1EO@bO|61OqOq1+(L{@?r?H|M;cz*
zTurEDCWJZ)Qy$~D2GwwNydohqgx|0rKO}GlVPx~>e$)i`Dfx9Zxmhn{T3X$L>WXEa
z+@!xUb_v$>@BuWj)(Fv0rSt`0qWI+y(K(rrNrz7@3-Ivp(96J^T+foD;IPQS$6@<(
zWkyulFxp8nR6JLI^dp9{G9@a*B2Fp)=U_5;+EIqla`bQT0?vNuVq<TccW$<&pgJzR
z&t~iDdvKyw!*Z{%Zca%zd=^q8*6R|tXjmY6`VQ^YJ`XOgf;p%+*`bNC&_#98ame=(
zOitePU(tF3vmh+^_=EsnhXK^l12AC?42$DX7thc<vyuS1&pXI=QM7qex7sH3462P1
z!j|#CPF~I0J#$z@tU40)X_773=ry`_t017}A=)IQMI_SLF^kB~;v#;2k)0ruEc%C8
zK&tI{r+H=S{Q%fOr!t##aKf9KM3UnnF>J=HxrN(T$Y^>m?VQy%#*+hgrP-wX=<A9*
zk&rXBp%Y}QffhV#sZ6-o8}!Y4RLb>f^8x-b8_PU_b=Pxs$kiPC07P{*o(%fEpH&}G
zBU{WLH@MH_(^Dk%Y$)-p*V`^;7NN(9^=)Vd7P<`$AaA6@D$npf^P&43r<N73p+f0u
zQOhAGq{l-fD2zAY_+k*7kbQ*?CTT3kChOof&S%`smEFi5)Ds_ZWZfI8qgu<d=(;&{
zjjBZ0$A<<)^&+XmxFn7(gDQF(iFHq9RA2WbyzVu;7m{R?ZXX;nqwcv_7yC>iOi?|@
zGZ{@HNs1W-???e5XzT?nogGCVc#>T51owP(gtIHNzmFZ!IF3f*V)2G8v!xkwaM>BQ
z$Ah72du+9}PpoFi%>XsO=zQq*I~S~*x*cRo1ol>=qxSWOuZVg9^5~PKBg5J{124mw
z_Hc0&m=DL~!?D8y$jOMbIayAm4zSh!em$=Um>Mn}RJ+7Z(DySz7mz95CJV?)EiP}7
zB@C*zm|o$}pwLee4FS90qv%pxw<kJP4#u5*Ayw>E!(Ih^Rfre1eR>#P(5mrf-8XWc
z*y=#wd(@w!`Xm$<dy#l^y($yTb2!nB82EF)S78(wb?(5Zx*-?u5zcbM%s0Gy=PL@N
zxKYJk1Djdc#Occ&p3y%%)f`LOt;+TkE#Gh@nQm0=hO_oLu1HImUi+rLiO0d)$Z|UP
zN3k&p87HsatIcr4@WPCV7J5?q0JSv&v57&b+oSAyddQ8;I3eC9os8<(XEJWF^`uz!
zrpdFWQu%-cCj?Fj>>!xZB3?|BVwL4BgmK2e?^HWV3&p{7=Bf`)5O0TG2O}SVxABiv
zi&7=wjl9!|nYhZ;CIK|hIq;`aDF$)2-H@az6oPBy7sS-RL^jg=Xxq^H;=|#tIo(a5
zL^%FwyPxW}%PYm9`sMPch>i8!c)W_Mc+AvvbfMGNChFGTs^%DE&Biy8WGY1n#|S++
z==cJ7Bi>>M9^z}7a8CflcTZ**?<qB#8hQy+SKGj&h>}l30Ne^5vMW}_9$uKWsNucG
zgtPVe7+G!u%(QE`6OWL-n$%<o;hCn4p|wD5H#2D;McZ^iIc=*hNc%0J*r~s~iQsB#
z=Xp7&*Orh9j{lF67!SkNyO>1e$m^NkNSGpQG#{I^k#OFB1NRd7cvZUFs!o;mu|7mM
z)jW}cb$X}Kde$f>?kM$FA8(_2BZL%9w?FO-KfndmhT2ohc-V^dr~Q639=6ZNq>n9^
zA3aN`pgUHXT!efyl*`9FWvyoj#@-@Z>3$BZ{#8%Vy#bc=?-7>HVg|cobAli67;ogH
zs0iT3B=d=yYQp~t-?IJU`e-A+U&3M@bm4YVkAcJ*u{9g9=B6!Q97>vR!c$)!#PehT
zpT$Y{@gqDOgok!G=Ha-ETXY}5ly=*H4ez)V^YIVEO1Xi~CcZh>oZ138xz1+FIq1yU
zI_$fd$G3b-V;(I}Oy&=9_!m7eobcsQp^!f#$Q@nr5>kE?#x>rE=MV8?A#YG9ukk_U
zzLY{=ae8>HV-1#hHce*h(t9`!bK)*D*A31)7gxiM=63CReOi!5#NC)Ov5F`n&&yjo
zeFZuRCX$ftAb_8j6ZC|mJW$*gfhlBGAHP()EUYjH`t5XaB5YlsNa$Gf8KW+|D4H#k
zJm&5a5{n+0%yy7w?X$S!q%S?`ly#mqGseXe7e4>$qyb|PprO>~2DJ-qtt0#dchVmq
zIY3-^;SFV&ym+lqh?hc;-4(xr1h;>n8|>Au6d^p-hIc6v8-4Hu!zdO-)kZ0RHceKV
zyj5K}8Fwy1l(QRL^(&iL=|F1?;<N~lLh+qHM8hPW0o{4>Ot0w4YX;&<06d$@YOfbJ
z`cGdQLP$VrYa?npWRN7yALtF7AU*X(#rtKJmtRcke!d(G#}M7%hA}uga(k;lK!V>d
z;=|V0b?(~T_Z|AH)!RP!FE{@Tn!MNdFzgkJv;v9}M4zT7zpAMBGRyAo%=YQGd$mZi
zEkP6{XoIeX-O&O>=IY(PQV@a*j?N`)mb6(ioin&Z7}Qq2i5)G$^diEvt9M3r9J(CM
z7(3o;Bz=80Xj(8elc(3~RYK3&Dnrqz5ny915V~!d0N*@&#<QRXvzp*J3w7ikG#;bW
z!r9aq%at|*hPgCFoC=WC*hi;PCFdao8t-ja2Kxzy9cbY$jPZ2JmUvqJyTtxv9xra!
z@Ko1zx|pSlTeq6n#bM(HfLh3eWr0O+a5?S{n6z5Omjk|YvPwtozjb_ggXw7g*GC*+
zz!;`Od0qKNpc%NX=fAyu2WKdkkf^UZMZZ47;nRjwuqqj-M`BGhb>3xWjU8XWyoIyJ
z(g{#`SHO`zw&kk2^ViA8F`pXas&p0o#ss9#{_3(net^)*@BfI@^(Oeo%fr};)bn?h
zjp|qH85p+3hpiuxX6Do|Xh71f27&i;BjO4?dPOq3sBS!2UDPL>(M6Z-H=7HAs!k>s
z(jX8uajXx;*!MhL6kwv6#rzp{@yXyf&qBVtm0ZJtvn-5!ad%Hx%;{wPNe*NU;UWtz
z<~j?G3S(w_{3K5n)_S0MzcovW^mf7bhw6ejgKW(Vi#WeExAYHK_gGQN|D4D3IkVDl
z@{C_+mOV|_|2VnX;0y^-&W2*kMtpyr-mcSCnyA&)4+j&mJXy}!sxgbMAGs&J#e2G2
z7uNJzdU_GKuHt!-f&YqG@6)>kd>^JYkA0HO<2;Wap_J*R!{o5Zv}x8jI*8_3_N8F_
z{{`X-L@lofL7r=lq;`JmB*uZ3{9}t@kZ(yg%z^JA9(LO}BU>z>U&X0<nE4#uK*lzV
zqJUAN_@`l3P(O>9ECRNF)F*KD?vhQ(qs`}AzuMg92;B?0pnO{PRP(g@9p);UzP07W
zp;o!3w%a(@!;W>vV2iYrdF*63jLxP$QLe+Yqqj|XKuBGt5UCBg#eSUtR%AMTk(b{Z
zHEM8>4ix7YB?37)VRB#ijd7+C_((vlDbhu}wf`m~J~h$Smq@aYt%KS6{+=n6{C3S*
zQ=MY*Z^^GqhGsAZv`HMWDZ*5-CQRK*l={ac9e_{t)ba>4a#5*G1N)0I5M*;M7JMC#
z<T-#uX}XwZdCo{Ve-!8ia`Kz<lbqS#3Fv$1RHXfqy>VCeL&_{sI8ew|LYc?X{9yRv
zj=R+z6M%mvc~<+@kZY<$QTIkxWkZ^7Wna*HGn#TyTQ3CxZ*JIZc&hHXnRJ7(rZ{@O
zi)Z}gO)x4)LbapaN0=IRk*`_EI?~CrZJ~=Q-z~w)RaQ}tWkA1CvM69H&=3!1{Ek+0
zID-LUOTn{x*%_V-1t5H^ir7*wq>DM1Y1o|@y%W4cAYYX*x>ze>5i5vZ$*@$qWwa^z
zW7{CMtgqJjLd0t~z;@48<Up$q1?_h)l-?GLC#8u_NE5s{=9zQ?fwR#EI3yB#u1AjI
z8*@ZNb33?4MI?8^XnhSS3Q9W+<%E#^*#nfP<SW0<FXv}JmMx*Q@b}8WpY3vbM{+$~
z_0M5*ZuvCeRT!P&$hH2lanfM=>jsYBo^T9{77+%+@aNKFckdyFn(ot&S-q~>IOwcJ
z9gGAXXgh(NN?{@7s+0T%*Y_Uc`i@jM6xBbqyvDVA!*45aWLO-l4u-2dP__2Z-u71X
zi%xDT&W)|D92BXgp8SRWV63j3Ba{o^<2heDk$V&ht1sh<?i<RpbM9HM6x^$c2Xa*?
zp(THA2rQ2qtA<z&Q3~@Lf@{|ZF7ca2V$~%x@y#PGE|MvnVDShE{CG%=yB8;2{7_3J
zQ@vpm%af+;E}3)v5YM^WkXdN!ykIK4Cgtc0PXwj_N<0&b%<1L%)o|2RuFy#POs|G^
zQK#2|GvIdbS%}Dyi0$X=v5HOM6Aw+fdT}SPOa0?IBy|>2p#{AQII~FBb9CA^?2N8@
z<IMsdrFXx_g#SI0d(H>;;%)B2B7M_R`l2QEg)nqBTD`^G)UhX?jdT2f0R%^-M3n@{
z_o%k$57~TGgh34~wWkwvLKIL<^FY1@pp1lysNCP}tpBQAR2k4~H+@<#uU!00a2I24
z3{RPPA-{>xE`N*C$gaJZC#6|6P*88J#Hmp3@IZ+T5sC&Qm5!;U5%8#<9BYMO5<hHo
zk<HV}=JUW9M8le>E2YVV{W`jOKO9_*yZw%B5tFH7@11aN=q)=jj<q>0TZL_uh}#sq
zu%OWtHa4RT%AR0Imt;3{>Rtfu+WD<(aW9O!$Zu}H7uZ8#kt)Hb#B1Q*uk;Iw;CMRZ
z<LVCDT_>xDL|-nuV?w4q<=K3mJ@CF27HVD<#GF{$UN?rgPXe9bL$cmr%vLo=sHBcm
zgeu3!d7`%Jn*S{uMyUJWBm1FNN)h229J@}!TIW4xaFr$%{<ahX$%0CymD-}}6Y}zz
zvb`PvQmATd0BM7ei|Yi(YS+?-YRyMlWQ)5vsCD!&xXcq+|7&VSVgZEOY;FS>^gk^!
zyv|L`n%d^5>fX&}i~Ff&wpIRE!DHa%@jcaCva%Adld!sXwrEznovd{Ae2$@;<aJld
z@aktP!<~Da1hXhQ)mV{I=dz>UO+?n6D(BCM3Q!Pk=2D&+cE(r3zVfN>hU~J>UET5-
z@n<W#ixu(1qX%2WyB2C?5R?8ss@~IS<kTP(CrC)F$qyzDhTNi&ayzN~b>+w4gZ{YP
z?T>a#C*A9lC>6#qnOZ#@+epIcGZFx3m9(5pA{uKvA>jQICmDgE4Q*b$i29wMCgZ{6
z!|_Yqv-zo=&4i|k_Erg{gSIO}E(HR!kEl-4YF7*v7EsN=Lnic8#+T9B*LP?(wG4Gh
zIh|87bRdILP}j~b?cdS{M-1$4ae5G!fe^tsi^&T`CS2IW2yK_1#mZR0YRMtWB-0IG
zX6+128*fuX!G@c@9df_K_^y{>ww7j<KjpWT%8e;IiAfc$MIsY})L$%8Z<oj<U`f}b
z9WkT>O*XfqO{DF9%xIBQwiahpo6+T*v6*?Tmltq-c^tTrvl#Ptxa=d|sN%WJssmqr
zn~ksU+dc>+!S8SAE#2y}4Klz)Fq$yGYP)be823Ikgyyt`ny7tCN6x#uD3Tlkf$({O
zySonI5CnPf!T(IiI?qR|Jc;i)dGK{n_#`5@mTUghNCH>LL>8z5l1(U28JE(cNEf%Z
zOeept0-fvb;uY?bhdmV!>1uihp=+``=%)!Z%vbz)2jbp%*cmHFq>V)A6kPr{xdC#S
z4Z!sEAO~0V^{aC{Zf9P=z$<Zx21kka$?7hf2}rrgF`chxI%}a(IKp2DH}4Sc%x6X|
z5y-WIF%j)BM>0$BSx`^O`VGWF@<A9%L|shLUuKzjyEk6IfS@pPKr48evLT0r-xnB$
zWxTp8ac#+gYjzQ~=|PaLmdbt-sBG=(M^a|kJ@2sHNvk~^wttR342I)jyB`giK{S#z
zs{3d&z8t30<axnG8I0JOWHcG`C!FUhy7OD66_UxfYW3Ll#Hg0xW2N_STu~(RWNHGM
zZTH9+WEWI9y;76Tlz6W|zAE>+?s)pb2aMpTLEd1RO=gLX@1A5!FO2hR2z5<X9w_I@
z%_>r#CA{jYx23@Ha4&g!dso#>#nhddsFg<csumjsg&!X=Q#(`GRZKG;cOQ(M5I6>v
z_7dWem81RumWLx=VxkkFtaW6QJz_QN{Dc*A^g<`1NEA56>l7q7$if78YD*_EIP?<!
zUj=+^3elmxH%tO>gKpa!;M;D40+9LV<+V@o6mQZ+>U}d>+NH$mWaeqN-yMBI`RT0h
z+ubvg+GzJ^LbLPZ2gY=8<l%x1(Ig`=II?zup{;qO0s(Z}q70&C{7|w}vF0<nZ2#2v
zUbKMKQrcRDif7`}Nmk5G<hDJmozr~1Q<P;<lq_16m9}l$wr$&X=1H^Cwry0}wr$(C
zoiF?K?KkeY{ci8C{jomw7-!5m<HU*?A-x@I?*H3W3{>CS+U0d<{q3{H`^(6zf>l6N
zMo{XNVPYI>bJw9NlhN3c*~Zzo<UWbaPQ_slej#g%y9rUZV^#%c3N^T6i@N28#YrVZ
zNH98?q^7giq|a`X4qvwuJOD@}Q|Q<_FKc7)zG5y6Yb}GIg}2sc%j|rRdJ6Bg)@_pY
zc=hh~PgbQj^EnFLAFr2is)v|92&%U<MsZR$sP{5A5voqaf`KcRbZKLJgMP_7h1mzq
zAKy3wiS@~0IiIYp+jZ7P_G0PQ-e}7{5E;}Pn8FS6u|mK`2JK}poW|5&4dES)wirN*
zeSeUx&X1SGojbsQ0qQp*ms0hSx;MfW(#peF>}b$@gJg3ChB$UbR}b^|%h5N`e|YgL
zS`I7I=>7WjmjdX2ND0FHKfL%w9qnwLL~M=!GZko19m*?lG3h(U-MCA-i<^M|Z_mvX
z*I#%Cw-G9FdIExuUUbp~Is<)1q$59lXSORto5rT4%1c2Nb?wO|OB7-xcoC;cl_i(P
z#`U&F+s(zcO&u+*#-_yhY(V#faXhrt%C?=a%pKRW&vT|{7hswv<~s#|mc#o;A9wR?
zK!!al`qFL4&n&BEFEaKRoBdoEa|-;}9Zc7r5a*j5jt=s*iM#8d$2D`LZ@lg<JQyI$
zyqm+^QMTKD`hxqV(QhT&5q)j-;+K%KJ#!-j_B9v=@e*hK>HxYm(9L;+L`J$#qw)GL
zw)wF0o3uU$Vjm~&&6VJr;6R7q8sfDz_BrUIBvvn!;+y24JLn@O0mTddAVtuJ<Uoj^
z8}$wgjMs6`((7V??4|Ng4(IOBHS>q=(7fQ3)k{Dy6y{gyZhkOtR4#&r@$AUhF>wZb
zyQl>w2lJddT#?m*lYB7JBYS1s6p;z!=p4D$5Vi~TVVxPdT!8{+RPwPGSk&(GtU6d!
zLT!)0{;FU)zHxr6ATN&0o>l&+tm7;)n2d9NRPil^MO!QeA&XLh#sw4QT&a2i;uCff
zBn48KV_fM>siN}aR4xazT0uEB^R&P{1V$IX8FL*kA|p3WphlxjuRQSqgfi$lClwb@
zUJXLo#^LJuKW&q$41XvHi?|(IB6!k79ounG1nG<V_b6}CQ2KkvbxRRhUE@1&k(3RE
z`R*ct%3EA9vyqdBz}2=fgpQ%(#}}*#m<~0o``4(yCH?pZi<A=GWHY*>U^gIZY1hzT
z1q9W->#KUo{dDVAftvmX$t5;{nOWKP&g96@i=Lgc@+0Odv`=pZl|zzxp)_M`Nuor&
zzK3=4BlX=&XwfxW5070>f5{MGYV-G$86$#!Lcl-jN6>CWlHoT*)<dKsjf>ondYcGW
z#^|Q19zh}-XQNSx8hYpVj*})H5n^0jvr3eB03D8{j+Od+%GdXpSqOUc@GkNwc-kDz
zQ~OZNf&P~SVZ}5lU3JK{40Gp|6kA8R<*SuPPyv++wM<exl`&0D(3<L3a2~GJ55nAD
zO)bLYBhfG;s|#ag<~>xyp?G=QA5j-7eU&LZ{um|ScwmQsJrLS@Sj`@ki0jgTEGhJa
zv+M{qjuT8;6Ky<V;i!>fH+fVv5(zpu(9dA98v4O_VF8bJ1d9{7=J@=*II_$rrIG1c
z9py|xCa(0yDmh6kD+LC!=%I2-l?9;VsS|<qb1fGP-BD<pxaDoUed=M;Doom>MEWg#
zeiL1M#a92y_!^zWKFU!Xvu*`ml+$v-Uj9PP8BKyd&aO~h9M>HHu+HTZ2$e`I#=(*W
z0S(~<x<cbZEgl<EaSU;+@Vg;S^B$ekMp(O(rr`3OP9%4maIYdxPA`pD*5P3kZ*{HV
zDrHvktYa0*;o+7!)v>>-uCCU$d?(#rE(&L5p=Do(G1Eqsd20U{$+}J^g!W!v*T|QK
z0U8wm<DF3ZZF0hFaXBu7zNoFXwrloM6DzW1g)!%@eH_U_#O1B8Dzv(P#-cHCy!GFf
zQg@l3bG<|`m2n`9+(<jqDGl~Oio;)wP=MLAF8;Az!9LyWphdy_qp}ovcRnsY=9$w*
zaQEEpGJEbmdh~e<PR^nQ&Eok2zQe71=8Of-bg9CK2LV=~HFBNAi0NAXyz17tjX`@f
zn1lSV0f8QxV|OfA;0Fz?BNue=8WoRUD4#M$IOu>*QdBV8%9O!0u6UwmmMuS>S(~hk
z6On;(I4i+XeFoM0w05sq75#L@UYlX;aPq&gX4bRk^95-x<-i6}E>4L0YJJ~7DY>DL
z&B9a%zo4Y>4i6*m9D`8Sl#_3f$V{-g%|E%bIoVl1%gnUKteoyb_cceTVh#f*vHG)J
z`Y#cYv`32v6P6lzZl6fgGAtJtn1y8)v9!ah4pFxc2rB?lJ0Z=YuPu`T&QP>0&w*<h
z+K#0hRhNttm8G!;HVLwo>;mL87_V>!7c=o)+-LXAk_1in5q;~<jHNQ-Txz|f%~B;<
z4dP@u1G}`NdLfiWw!8|_<t*lbI=`ocVK3~B!)4oxG^1o?16sD7?)KTQG2T3~I72fg
zOOZQ8CHGUDypUo}-LSXkD8#ckFY{sp`Zz@nRO-bNt0iXp&xo7z8`MIzhLPOjYY$Oc
zYJ}tCBb<{X&L_*#X%?w;%FnRQTdK-~hR!S>E9PYeb{pjwow|+h5I%6mQ$btTTI?|{
z5;91}c?;%gP7cdY&FYwl6f1x>`q_h@;qKB`L%@T+t%$-)sGsB0--K0%)spfH7t@H&
zy8|~2E@eC%EDKX6bzC*1*iT|aBSGbik7t@PezlRL1o3{li8h!r9F$7@SjdJe?rF!-
z;1U!gYM8O_L5TEacpI9J5!qm2cf9u_2*HCIbpS7!+Lhx=c?CvF)>d?3zKl+H)sL#&
z%PSMHO4F3#=w>DS&SF%C51-zD-keC$e)kR9`&WH24Jr8g+3M9wh0dl-=4`Ar%W81y
zFOk8uAIe7)-8J9;M|@+I5Wk~UCGY0L9_TOIJ##I9y7~R6$%mXbG~sg7!p*f_<@0tB
zC(k9#or47uImD$N=SyGScmYA?h}G}o=<^P3A~<%~YGgQl7?0&_9az*(3P!audufTF
zb_tGA#02v>-UULG!$5sA?xgIWM4FIC#6OpWjwCiuPOhk5R&;VGqy5QmTEEWI)Ds22
ze`!SkFF$9*7fbT$#V&#eA%^O*7;345ln@~*zmDiF1oSccj38STXPbQHNYsmcnCM@r
zn+txTn7ZPzl&+PEppM|y4Vc~~H=Z$ZXY>~_VJfImi3HM{6@EjVu<;YJFmb<N5tq+{
z*TzQ&zjQ;2HogK;`X<Z;!r20^?}5>^$EVyubT~d@aWR0bJ0O9-?*xkQg8stA$S;qp
z?ZU*UD~t0h!Nl+^i;FA4d{qh*D{<mrxjX)S{^7s38HJq<&^mhM>DUp)l={1r_~0*D
z!BeANZoNd=-bi`LT%k4YVF2KQ#AaC8)Eu=a91Sl3W0c$0bOh3*%j6l^(HL?#VK8PS
zl0wJm9JvyRZlvVl>wK6{h@_g7%gIQ=650|dTrIN(oBP*({Yh}4;NYSu`E<g*Zd-S6
z(?pcoM^}$6yy<Xo92I6z5xMWykR>d@R(5y!hjFkEi%*&~#wHt|_4vWi5DwB^Rb5k8
zH8-n|m@Ab-14kS<a1lxk&WifHcLDL1A9~({KFdt$Zr(7}LHhM|TskH{^wevG9_zH!
zKe{|F3S=Yz3#k@<z6L!>y{~(`7L%$5W4X7#9(Ex&;n-7Qnr*X(tvUL-9QV0)z`)vo
zyAfr3?-hc1*MfQ9{i27e<KDSpXV|=d-TcSIGz@O1pKK)v3S1FXQ28(Tq-f%i5giRk
z0akRq=c-^+1>E|M(~cdsxyugKhnO(z1{o6mH}?gae%^t@S_8FL((@X7de;!bz&5F=
za9*lf1-EH(cAqq8a|wOK4LV({V>mD?d*VEM<US<q?b)&tC3#z-|DTGTCjrPSxqrDY
zijY^vAg(ZqH~f+yBq@saa8xa>vHoB`=Q<Ppt84uO0+6v~|K(mNLgE^Ogn&`#hgwqR
z7If$sO_j4s95>V{?bs1zryQ*tma04Uhz4<BguL@oPTb;Lz2`Cqk5PK&9nyCxr$;;+
zrcO#E=x8R}@r7}ySZuBgkLv^^ACJ|Q(4)oR^#Utd(N5t+*H<GxIhuB7tT4zWQ$hhu
zv4>9jGEc?mw>FXiHiE`op(jTjl1FK#w;DYt1bmkayhYJwH`vE<X$HTg_21}o8Z*3a
z$pJYB&|J|BZjd0EcuYNC!x5Rjbbzj`{Y(#(s25z@0jo^BY9lzGp1c>K=wiIu<t<~o
zuRxa1MAz>AYxkV(2U@dbPd5m@W9avwvE)Vjr&}p(SZwDV0<f>_%01#!qXN(+c5gSE
ziNX#B3{5;NF5z^*`R+quhSV_8hpscg;<1JZtp>L_dw``;@T^5zr(V_6HY4A~5#a1%
z*Z5?Zw;tC#Qt6P_pvqCHg0V!Y!``X>f$U_ZV(Mc$npS{JIXWGQw#@(n>mF_}YO0l_
z1WB<-@pQ6#0X<kHf1%L7+Gc1*_0$-imC~FTg#ZW&ib1hTGmJt>&MdV3`yISThqq!W
zRU=EW1exHBpKvfcY12Cw1%_f(WN5OUD726~UG{iZ=)7nGFMnPRT0WOp_89J*Whi56
zaAi<u$Tr==8H~wc!RDJEv4N>%+XG^0x}JAbk*dOY+2!Usn)dM!LNB>C@%VXJoIE_>
z?M3E*2QlqR(y@|cFR9k&trJ$@OhQ{gwHr)p8@_oU#|g#9N|KgIYdZUA!mxldfX!f5
zX|ZIn0H|O-sEo*C;A0AYbjNZt#jR!tj-n=^=SKyGFh(&RtT}}ri#7syohSRjxN9M`
z4}3Omx&`4-dNzfH$Qr#b0VPedaYq!R+j2*ku4?q)8-{ST<F{9EgUSiGK+}}$kPOUV
z2E;W#AV_1Wb4Rec$_l_rE#dh0FTrH61U~^~aIUrZTiebFLcX(HT!=agtVvDOmg8^~
z1G8D;ZBs6Haw>F24Aa)COE@HsBv1TSn0LU~YuWT-cOHc@zE`@z3;D*!>JulNeLW?q
zqTczk8m4Qd{0<)<3>g`&Zq@t*O}IhW_m5E+>TE^q9@O?4L*I3cgqmW4Z3)$+CDCee
zYp@4l81c_C9<;4<=x*9)mF)jbi|ZO2%oRoj?l5`0^#y<G7RY!DGbRXUvX6YY1AVyX
zKGq+>3|T#E-XZYnmN2wqgBjs!j=g2VeM1m6Jk0#NyCkfIKj@@DB2gfLB0`%vy?91F
zU2@+7bF%PMS(K?X-V9)YN|Q&ZDKY4TlQe@#StK*DDS5acjk3_E2s&BJLyeJFeqx(0
z24=y_BdqcOtRpjQ@%wRyFspd*0mzC|OzQN#;*w_R38J#8P${Y?c1fM`#A6)0tdY97
zF}X<D?q3n;4_L2fp7R)2UDI!kW7Xtt7<B}*srL$M(z+_aqMlYvI9y+_cF%HA=OvCg
zRI;o+J7|=}@7EONs=OaDtIXS6k~wJhpfHb;FL`8LGwO_Z(!4Ips0cAHdIaAzyey_Y
zXK0gId_SiD2e&w)ICFvr`puyD77USGxG|l|Z1Hh$yFVO_!)JvmRLJ0;^!4{rqxGIv
zpP}F%?~qw*ic*0*+J22#kp%bJFsODfDijhY-1vb1y*^UiN_b}BkAHeKd$B*gseLJA
zpEz9{yXl6nHGNy|pP3UEUH8n|;?|;>3#S?=NFPRmY|@Aaj$%3ccb46d4CjcaYfZFA
zp@TuBOEGz?y_<i3l0wjmB@a);m7{GZn2Si^QXq*7fo<g?3CNA0v-~HGR)_-lAwe07
zMq@vT1tSvYx^iULSDup(98!~{cM^T;gjG<#RH?&KQk5d(4AycLeeATE{Vta2gTcK0
zuAd|9=Xgen>5O<c$KBsmE^>v;OTgfBiCWSeR<a)GuL{I&e!1osJg|3-${ZnQ^=M4_
zr<@js*Fvv+k3gDReyK2lZZ0!`GWBQieby38`355lC`GzT&xT3HCfQqH{%l2<VdyEz
z@l9aMkFnT~L>a2alVGOIZ4pZy4BH-_xmu4Db5yK;%yEzUB;KC#{r(T)qn8Ouy%zr0
zFA>833?YR4_3I~+(BFtk;fL$^{~p+%H`D*j8l-cwv$F=!$xHnKM*am34*uWHlK!`|
z!Y1~PCPoHMCdQ&B22Re7CjTo&*;`3V4oLv{3zS@I47KL(W1or2!l9xnts|ALWYSC_
zBG7=a7k<A>Db@O>DJRKo$qUm%p0JG9Loc2QcYUP*bxTH88sO=@3ve`%mebwk16C6n
z1zcs&0A_?9(=WLLdo|=BH;n{(MW(+afDQL({cMP+<iUb79LdVKmddh&?lv&fc?FW~
zF;-*LP1AK;vT^G!@ACA6eH@$Iuq8>{cLIl1O2$lN#L0kASTp!s2=$t>I9}89sPK}3
zg?wkB23$HFi4S=B?nV=wwjJEnk-F?v$SEM&<=JN<53={JMyYgde!sVtpKb6R)Oo3w
zL#7yv(gxRE-0;87#Xa)7qwHRUkP(jHYQKs}kv;XbISm$<IM34wt3akuDXbxDFBX+f
zp3$U=8_e`%hPhMITW9rGpxRE3*&Vt7UO!XXl~7em41<P`Y0HVVbEK*|=xZ+0;g^O!
zF766V^k)Z*s2QlWNk_d&jQJ~+3?u})0CyV)ktT*3O7q{S?gdw`Bm~ZLRL~4LV;=(p
zluOXYG8IIOC+0@USZ~JM^V!EE4C=m9DnWUAfVJ}89c||aG+Ex`vr5}#?;L}j>JQ$9
z#8P^vVCO;l4Qn_$Cl_)Xkx?k!QATLpJyZI!wYxuit0~Va)Pk{Xm6f)-mEpMqv8~Ws
zN0um2eI?cAXp(u<iMDIx!hQw=v>$TjsXOjxCs{Q|r;f<}q#RX!q=^P2wrC@B&N#WA
z6*;nRrH}mLnliZ&y7;^-JP90s-i56og^Yl3nA4pC5)N9Uog!+5eI~`DeT1*goC-Oy
zPUae-LzmD%(1}Oj<K|lsf{aOP?e<iq_EWVrjacsgjB64t@v}{C>vwPnaWBsE6W)V#
zLc^r~GoC+-r~rMV8;}waEMSgS=y0f*QPpBlBVW4&XTQVxkCKVgo*bwL`t@rX_<zss
z{69+u|G$-igq(`4g_EqajiHI-e=>$qD%(m}D#%~75Z2&Yeu46NAWCb7;C_t_<}@}o
zQX)!9{6hcaQBv$BnysIPCX2t^ZYDAGF1S9y-n7LmDw%kndinZ&`!OEdvGmD_nPg3`
zVgTKMspl-utD|XO-H+cpKuvq-Jz80AIL8n4DE+VOlk*N8QLYd6wNTf4iqK3RfL0_m
z`^6qlhtw9-erKNTnSN_*wp$-)0OprplNY*>uAS{^LJTxA^ag4um#(}$(CK<r55K^x
z$@mk{a`Q(U8as*w%|DvcNqF_=O#Lohjg&6_x|<#!bFHe&q{<Gok-7(n)0PW(fQmi?
z;QCiC`b)H0Hib1M-;K?*Vunh&<vYu%76CcmGP^po4U-tpa56}Ky`>PO6B@Q0t2*`S
zIW5g_xS!5in~hq(H@VeTkH4RYA8)u80PAc?a;zL=fs{VW;$Qut-_gt^IS$E9QoCyT
zSbUGYX=BlFnM;`OCDW%SO)34g{CNj3)=TP3e%U(-$FaFZ=W7txyGYK02?IkUn>6%Z
zU|0gW;V2pDL#KRYn4COwjqx6AIBBv&%5NF3a1>NIBk790Y`<w~uV^~pXgu2csJ4Au
zalI0CqUH8<w{#RJV-b(uqK4?WCqY^@X)lO)ji0ZM4}*!d;ZA7^Xc&Lry(JyP1nA}R
z=qS?CL^pBI^z?R$f+sp!EeXT{sg~2a7fDp50ExNZJEzEGSkGAj6?|8(1AD-7)icxB
zhP6tT_31lG9FAw-9aiWR<SG|SOdq-Xis6RwQy;`H+n94VY_@5yAfHSh45xRI7f=U~
zyu$Q)r`4J=ay>(wlFJyH<ARa+XzhDL3M*#`D8Yb<X+%V#(U&z)MPiPgY+crrtDM?^
zOEb^A4m7OuImLijRws^<LaZREbXqC290pr|&Ipkr+utp|VNazHdOdahtO2AKyc1rt
zWJb|Po$n%d7ykL^Xu2J4Myh)8VizNLNZ3m~x}v%&$gE$z-56jBt$0DP@d%9+D@L5f
zY2Xu;bK&NE#KxI6nE7IkbPnIg=VW*3=ZE8K>ii%{B?@DBFbX822=#3Z!(_MFiS(-n
z6}3QhLrU9xAc98O-H5|6+bY@p2a8jJ1HB|W=Fd>q{-UzRvdKi&#E|G2w!2{$3PH>%
z;gliF@=g{SbZ?MvcFGZsUjNMWP4CDaH5zM<Y}4OHz2Crc_aUO1zFcrYXYL6>^aeZ&
zz8u&2_`ELfQ9UgL8TEF7|AjuzS8(o{N;PdyeY*zR_ROGtoofcx3HB?@n_uzI8{$82
zAzyQFo@hKpW<i`D4pno=dG=|$Z4j^FMYv4g0g;aZ-_AIBch6-OhluB2!hN2p@a9N+
zcI1><(EA$S|L+Knjkf>-`spR%VE<D;q55zAM9IR|%-Tf$XS7-XEbMHB>}&x}2DVQB
z*;<nRYqp}gXrT5AsuYSN%*>%KLAm9H@*`BL&J_j<d(lgAEhJr9Z`#7}Vm-3GFx~ve
zbUo<J*^y%yax>LJtRi)pPh&cM^FE&Vc)5S%`b%N#{9sUuqySysQc-|H<cN_po*GQW
zSw&cE(DBECn3>pFT3<1Mf~ZQO<Q&s>q+iA&O_8B;4^`;Bg2vi6ngGo++uNkGR(cqb
zgz4I|iM*&Tqw3f*nSOIJT%)#w@_C|%qJD$^07&P|?cfD7Al@Y+Gmpy(s!Nf|&facu
z&0ZYospYW4-a5y#0Zm)sk!F{vVxX={jZwmdd%hfEn-&0A+}tC4{00rnrMlJ%sw`0@
zA+OkD4aj!2()FWTM-(TPQ^(1^ck8WMs}g6+la}NK?PD+5i}q_zHDLEm+&7$b3ExPt
zrTA0dVx}+4Sx1P%XpeVKO!rTnz9y8pU%WuQp-zux?SkK_`_E`;ILRNl8fo?fg>f>t
zUW#iW?sybNXq$tJ*rVD7?zm{9ccwd?<$viV^oI0u8Hafaw8&oJn*TUpg{BpT76O&p
zCUcWpy2qOT$?I8vym;%IM~#LxXeB|Si3EqOK%^X{maQ5=E_=D+1&V&&(P$}SfWn$e
zbT@Qx`|9lH_bBb3hd^{xzI8~GZ(s^Qv*lYaPbf&{AOgyzMLgu>m8PlggcZmHbgkr5
zT)B6|nZgGczYP&dT_ISGRc%%;BF%xz1u(?)(K{cO4y%K{oFD|E$SjZ{z5k-h5tF&}
zx`>;$@R#GdVam^nr2A-Fi+&WkZi~JTAK-40b>{{dh)P@-++b<uTnb76mvOGWp=h3&
z=P0}-#cGB;L5#tM;mF)FJ(!A@-v9N)8Tu`SM)7Y1BdwNeVV*q;M%K^HoGh34w_JY0
zl5YMy*y~@9P~%MMd0-#hKk8z@>*xbqYkc~l%=ngLb^|KHPM>I<2%@HGS95y*F@1x=
zwzw95rY{l5|5PnMk=p+UU{$sg`p?QJQiJhQT6X@%^Hx_A1f}ljg$Ona5NI;NLd5^;
z2aF{RJtR*r0e*_D;nO5yJQ`<=COKC{qr=-oJGs18Xd`KXIp=I8l#YqX_*QGZnNA|b
z*HnDEW_+1Uqmx{vC4tJ@_w~#xksOt`3i`GAzSVl1={fcNaqX_Q?S1?Y=~wdD+%M6a
zzkPTVUV^&`zoGX9c(@PxOT1p3enG;W>@q>Zoxj%qezBhknFgUp2?2WH##MOnZ*o(v
z##VKcp4L--F$$ui_z3IE0lhKt5`l}M!d7q-+%1Qcqx6z7VE$XcUVP(xxl0kW4=G3W
zk=6$hWcPCVnep2TYFqUMP<a#Cr$_!#)aQ!)CAnLT(p7#_q5F!(!(DRI(YJjzjOO*C
z`>Whu9&UTNAMW8sh{sFy`qdTEw_4~et}nvltF}*yvpeS`#aI5t;#by7THiQiHTg$D
z-?aBjP%@743t5n_s+-EL9`cvUE=!Oe<wr)}Ip>nEnw!wB8svB0jaAUM@(W$iHhHG9
zo6;^#(6_3a)^1{-MGzCD8OoLddkL_laF|q>R+w0rnnW044&otFw;Ygv{Nhi9VY})M
z?6NM^O+&GVO>aZA+uRj4?nUjq&TKX?Np`O}Hw8J|_0<XzP8cgm{^(aR&Z-ml>UIST
z-Dz`z3uk&Gn}f3sHI^KS7SgP=Xbq!R*I;{`d36z2-R#PwR=yA^q`wLH14r+~-X*JZ
z)A7^U7vGgLfdu#B0;=4~a?!p9*JP*{qX_&;4Vx+4DKrx=1mxIVZG&z~G%U=j1*oEC
zEXQBlS6>iT2I$@g0ZNh!8W$J*#dQpv15_xo)%+(f1P<y{hJoV>qfXk*91E!;EfA?6
z_ngbFK%8+_4oS3ug2YVr?X)ULKL#k9ehHzFWaVpK|7IeV%;?oMsL|CVOPhu005`lR
zNYm${xm73T)vPnDGu-fECYLs@rA{&oG+{@nC~Zrp<VX`E&y4z-$r0=$hGL1rLJ4@+
zoj(E_!EoS$$7aHqas%Zi?Aa%c^8#s<^T4`fnrXBq&>DimjuW~35xEmRx;YcjW7HI6
zYGhChp)ouB^0c!SYH)D}vp(zT#KY=D^LDVnCQVy58eaCHoCy@V@R6q3cg5dHSxq&L
zsQ;XNjhNG93bE$<N3FePY%e4?t+7fFZzM$IX_LnN8O10i-tu;{g}F@!9}F6R1ulsV
z;MPVfe4Mr3Es8!kXnI);!1gz<8}koj1~Bo04~5Zdv1!U<oadCQi}1Snm?jcXt88Fj
z><X6CzKof%@M<eF@8gs^mhVP4awifPgE3+Ea5pB=EoB_Pq?6AW_RWX8q?d55r3>>r
zac;Anm^<mTWg=|-syVN>oUy3%C6eUI0vPpBYlMc{3P86akIamyL%AH#_EYiXh7kKZ
zn;JP2E@cKhF~OEVNkg3(qgyKQtCnOz%P2A!NXIP;aV!qmCvEHJHir|E9G1$5mdNt{
z79i2*o)oO&3|#NS`M(Ikgq5q3weZ0YbiOryd?3v%m%#ByQA3Xr5>hlOq9uBSfm6B_
zvl5F{aB^`V);<+_Jk^+}ull)>lEci2cTm7cCR7Q8HHN5MEs<F`$S0%6)eFhfrci-X
zIO8~B%ZSC_rzN~(h73ls3xdkzpi{GWDE<q?F@dwMf2FtLBcnP>ZFhR?4DNlnVuRb%
zD5q_{XkJp!;^N|LP#wWDa<Jflmq9~5x|W6&PUwVaUuM+9rpj&r_e(l|3iL=Sg6J#I
z<mB60wtCh$XKT3F5cdUq6k|OFm4jUf6Pi30DFvv?91R&e4-jtu=+M);UR~<gwo3RW
zzBaOpped!t*RX+od^_keJz>>VWCz-Ud40DA@*xWFYUfvNmF)UcYLtk@1~0em;uogK
zo0lSAZ(k<Y1iQDlQzFu|o94O07ByM28Ol_kHwUnPenGZu7&?Y(=4CO{I9RRw{3e4-
zQLghuGcz?Us@sW3s6jl3rllcUBdnWaIkc3{)<Vlqch_|rRCXi1fg-y2>J|z5XYH%!
zlFKjl7*Ea+aob+B`N&m{!gq1KwI;wZmB3;RL^<^`dqy3xT5(uTrNhR$B|Bw{^>Ywk
z?yDRKAN!>iR1Rcv?#fVXcp1qXZrlY5b4PiM#}$!?P?F3cT;IeEv7T>l#VGfkD8ppp
z+D3ER+-xe(mwg)U=-L@40J7N%$&Na1On&yA_w%tZ0wN4veeY;P*3w6c@O47y)5WE8
zl1_Z>$~m?mW6b_iBreN4k42Q<R~FcoG4&LUmT^7PYu?4FriER^P!mfYaTKD4<B_!{
ziTJ|U*QIA8XZ^KoeXtE%m{>xBdz5zKnPc~9X%w==)2hBz$aJ+9gM4(g(Qafa6-ag{
zisBa92s`q8I&1X_G&%gJa@Lp<BSr*Cwr%6aP<R)FrM=%P8^_tDUBJigvT6Z@d@h>u
z3mDVy3+?X-6xOh}SNQ>TW~Z|lf!GVa8{aS@Q6?DQ)BaMXCDg`^JuO@-r{EP0ft;Cl
z;VycIDK$oYXW|k+Oe5Nz1%h`V159IT5GU{bTk`!gXvYWKMdH-{%_S#n<2m{JC^=9b
z1-2*xclg{?e`?#9(k{jz^E88Wbvazp>80TQAWT6jgRW!XdV6ZtAYRd<dN>tFb1uwf
zrVi-@Yodeo-a5)cdwjZ-LX-)#8wXAL>yqH9ih5XiE$VrsGZyP?zo_*P%gRs*t<z4x
z10x>E@k!5q|Mk%~FYxVdzu%;X`TQTiab?^(gKKMs_?!8QY7iMS0J)w$iEEx@ig`Va
zl6?`czo?+aI;puYp`V;N<b~Nhmy!d0;D|F6qr79Oqa#^G-HDDaO+|5+#{t}G_@S&t
zdpAqP@s+%+@$G{_Pg7HX8;w306B0IYWEZeK0m6D@KtOZWaGL*-yqoVP*q8}h;FR<X
zv7q86rr<j;bI#JCTRP-2ap1-yuqv_&Lp*Lf(HkZFL@Erw@4=@iF3%Pg;sAv!gsQju
zz6^dmpZJy8;1PAxHRaJEkh?u_S<DEv%MsB4hnJ*e&M`da5n-uJo`BaarUO^dmSxgb
zz(1QKUre#KC(n$W78#cw19Kf6BY+$Dj~ib_y{9#7LW|cg25*0zXTkGt`m>@V-k1X)
z4Q}CNe}hLThIjhM2XrOe?3aSa3%BYHLPhTnT{ArN!fwOJ+k|!>*Sv*|$Hu7OZJA>Y
z&QhlilSj%#%es%qq-#4wHK8so7310JirOk6ySWidHZW%>D0~NplC7aDQ)i^k>SyNR
zM^9@9u4BQfu0X84st<l};n5=nv{f>CFl&5=Jn}%^rT(`Lte%5+Dl!^=j10a{jlvxf
zAdv!sZi2@t3f?XIlD#+Ulm12)yUXowhtOqqqu>?ddSM3faS#0A$u8b0c1!5`^1CY#
zZ+2Y@^oUWW>M&i~j%bn5Pwcn1%=E1}UHSD<#|69UrD2K9m3?)Z5?}aYi2mX|eRbNF
zH~jqhv72qWY|XL@wmrl*Y|cA|bCpMCu&gdXX8MJK>Y34W2c@Y}uSTbH%u9F3@MCU3
z8S+^}`gYfd@fo=lYo;41lMsvb9MtDW+VPnDHp96IzoaUv-s&AEiCTOpu&{hAwNge^
zQgrTI$!f1(Zvi-SMyD~gFgi(BXy6MR^It56@JK;bWsT9|*fI5J#-k`y9TxY~W7^x+
zhm>XPWOM)8?(^uFtoIEk`-GNzl-L;6JZCQH^+YY=_0mqJqg)O{{o^Y~a46<Tam`90
zCd&;x9p@#C&^*OYwyc1kKkQdf3;&qR4T&`^)_ZXCS&Lnkmn)a11_VBWEFJexop^qR
zcz$;96*Mg_V$)kR<z(MXezd8<P5a{c$mp5-oEgtGCX7d|^e4S>%^o|eJ@XBFP<7Kn
za9uqDOku3#Ikjwp%D9#X&DC6tV7~uFzba5iw6!g_gQ?ofChqRZ;SpD<%a-vF6L+$s
z?{V-KW{^%B9_9t=GFKL{QvmKgYJ1j}0j~%fYR6K@meo)=kOfKRaQ=O>5dv+?cb3<{
zW`f_{2fI8gYK83>mDn)hSoPz<vf*n;I$=z6v=FVkLQJ0SkLBS7lTkMY*aUix(=yL%
zNJa!UiQ|XY@gVk)dwnmV(=cX@z{0#II19+2@z!Ose=@~d3=tVFE$5A<Oa`i~NM|cK
zG8$z0umHVkxUx?~-n}1_Cr<*P##vh>9SYXARa|8b?Z#c$3~vlw?(0oH`K}Kk8PP|O
z0EN2`AWxY@p3=%)a4%1US`|xKk@(tCy|m+@5z70|<hZ)uTQP>L@b|PhQTG0aKl5%#
zgReyLE{cYqnn{sckw)=|B}GDcp<q?Ar3P8!9HCTUQv73`z?yN4HqpCDf|nrcIGb?>
zH`)3j%PK*4JS_(W*I|S9Ib!S7VZymiQQf$6>xD~YY`M18A?dQmsq^4~3yfsWx$IAB
z=Z16lg@d;SVig(5sfVPkgSXaP6&mqA=jic#-SlPhbNl##s%wDP$mY~@rDMBi^TuxU
zm`<^bjp(4pi&F$o07-{XW}iuwcwzYD6SOL_F_d=6ZT9?%)d1A$l;v?YffLn4`-p}0
zk&=c&1k#oT^TzWx+<*M3g8*{Lj)nR4%kf8H`G3Dz_}}H1|9J}`B=2bPUyMhP+NUeB
z8io()s__-=A3vDHYS56N85ve$e!r&OenI@ybbd%b$-Jn9O$o*tuJ$R}7xFpO%KQfN
zTGgVa27jB2kVg4UdGp$(Cd*2X=;7~Pzyq4^9T@c<;QGRr7d#bkx5ahsy?xx3^St$W
z(4A8COFc}EXaz_rm(JgX*trn+0$lK9nE~D}x)&V#A|c|Pgo`FNu7D~QWdy=Yqz7pP
z>IFy$0lP;)0``<0yVn}xBNRJE_(laA#ZB3Vn{*Zzjh*y{h2yiW2g%^-E(*LWY+vzC
zEB@2Q4+-&HLLwWH9i!LMOKhhdao@sE31}P1O?2m7@mj+V5Bx)ZM~qWeD(bk<t-B`%
zBpc05U?;LC0*DUcLwKj6hr=%ivV;02yr(8Q=hRI_=uvan`Qs6jav!FhIdH9xLQ6=d
zWPeR7gweZc+32xo6vBjhc+p<VOYWHW{O@9X(}rI%PS<hEAFD#c%fFXv*@x>kn+LC#
zLbi<62C80;r~kOTs9L+n$0(fErkUwKw8{H{gPEm);O#T5rP>pk@NTfTpTNuZSzzKO
zL*iYgT<dIghtC@*$)Zl{K6|Y#1K48iraf#hlVd<0FTNVG9<+e+GW@&q4A$IgAch)?
zD!qJUh7aB_O%Egu;+AYCiecy1a8?QEETkl0l>B>Gq`d#=@rMK#e^vZ&N$Z)H(=5l-
zbatMWt*r$->L;olFpzUSs@C)HoesV*_oQ)fE>dHarK((K;v9jXKGCo^c9<_9TZ}US
zS)fx=?Ura9pA_xe7nd?eb3*Q~cntOed(w??4r0rZje`?J2rzGi>oOdl2t@~^^FkEs
z+8NJEvQ6&xJgtE74R!q`Q&;i?JKV^q`Ow$Z&n7H;v}i}NTgup3Le4GL8>x>m{@+BH
zrgGHzQ9`nuBtlG={7VvPqq<W6o-tcOU7fTU?J=$q$!&LdI;`~Ba2Mof`7gqW9v%%I
z-4pAnUK*pHVLm|d&|heHnQPGC94bedZxDD{Z@9t=o=xg4)(ypdWBAO$e~6d4JJ1E6
zoEoSAIv5q6Ii>WXA>D0jYFg^mQ&>$~N}CetZ~G}$oaM~ICNxQ*)ZpYA&5M}fvFycT
z8A2En>*eW;+qcAzF}8*)XCoQY$jfQJ1_KzKOkM^}&@b}NQet8mtU*}ma)#x!M+y+-
zgTQ`S-wyVeRH)@NEms$pu^p9Q6NQC9GC}m>G5c~1CC~*_5D%2*KxGWxvBtBStf}?P
z31}y2vg)1I?m3tco^`xCZH^ob>s-{F-RWjv9M-9B8}Ij(56q+M*4H@sGgwxY;U-7d
zn#HG$nXd;KjH>8n+-b?R{Q`IP>vas=;wOTTjNm<-JM&V>;(B*TRh-02$xw(=YP`4F
z#WDLzpSnNJh)nr^nz~12i)p51L2TiRX}9d9*vc!lqc6)0PQO=8wBZySrY89<IAI{9
zb1=FQ{M-7bK>?&IPb+ctV`Ap6@RHL_j7ACc!7^Sb*9}~|RS<WWnH>#(#ei*gMi=_G
zMya$&rM8gC<ZdGOxxlQQiFiwGiG4#7MvE?cqU;$nb~UV@jqMyeZ~t~=g>{Ow6eHD5
zI@VVuG|VBQK)Ju$`F+gijrQj}@cJw|EU>GxMDue^hXvEct5O{S1<r<5<(p?3frueg
zo=9s8AC^8aE63B4b_U!ySl$+sTYiRVx2}~r>x!DYHdq2LX7$szr9;B!MS!y*QZXjS
zk?W7GT;DHL|MkN(oX+bd9R{TyWQ<0!{C1hZx7k}}9IGrmaFiZ~oEXSjXvyF_FLj0s
zr~!Rcm%4;m*p@zxO0@2$wB9>Ibt?a>tVhNl6#edO9a3x*vO*})PV5xbjLepAwdTUR
zCaCPrgTMlrnjR{v)F3*08a^e@TxMRG&m@6GXQ=wS*;%Ek+N#YFbu(-{wbK(AkPm=L
zT~=<+|NELLY)3|s8x48DAPI#yJ52#yKcSf#Iy6=zr)=53yiJLLM1{o^Nuh&Q6MC!d
zrF-}&l1Vdci+2>~!nFU)<g$)X<O!&WX!ZSz@rj7(&P3CXJ7hse^a_6^LPz~z0MDwe
zh-ZN<fI7Uh%f2kPho9X`kU3;<b&u}q0epNzu3I1szdgg!aJEvUGx&5aJ-Z@)zJVP1
zZzziBP7<0>=1~&mv>g+w6s`|dGHcKpG%s2~Jw9|x;qLodMr}%8Gyz$iAWS<s3DXTL
z0G}tCGE+Z3=b-$VLemK-;)ePB2|1^Env$v{{|?g$$J6}q<AlB3?H#r9tyFz&*j(j<
z`D%X#o<xE>q^(#{664W*;%E*(u75>EGj5J?d=d#*l_E76f_|J-e33qH_7J23oU`y?
z8xfWKhP(b9$kHKL<qOgCmimu-becz6_aEKf{hvHS^{5%edY>`&V_e!G?f1kE%II;G
zk#Q6cvP*O7rDI8rN;Pw3CzV#k07+`pCq5M#CT1-<qet6Ehh^|9TbN0hf9zR9%2QVg
zRYT)i4Tu%8`BfA$qPrmuWz@}04IQ=<SLY-&5?)=z4%el^7B>A+J7FiHBI~w(4Ho_l
zWvv>1%V8&`bF;?4m5-$TZrP(Pe}RWhJ0|~>^$3{<g3XBFR$t!;w+;liO_+MbT;B6a
z-Tvw5E!hI`3gxRG`|^vqrQ^N-nrz-Q^V*!;4Y2(Uxn}qwVl|-GX!4RFd7`bX*KeuO
zkYm8nenyF^_5ns#J@<DO+v-BkVkhMr>_6~C#6bYZk2K*|^^b7j|Bfd}{u@awW@4-8
zY;B_CWME{a>}X(Q^1tqB)oc=x7BPH=CK=gQHB|qALzWYWjK*90^DDG@frBHrwadGL
z7!<9qURa}xGoBjvg^1grtmi)#P*RpQDmqtIR^|qaXj*EmYg%c^$$c*BWzT<|$2_Td
zmWjP@a7nPft8DPN+Z}BkdtcvoO@F3#+}~oM{i5#A5nKtR1FJ<S?%@x$(bSg@A)!a^
zV>WiWfFJ<p3hZ1Vi%rVn@ay<XBoF@*{<pjUy${+Ah-CE&jU9hI04N057LA?SKBNc1
zuNrcL;)cbq8ft^YzB%){w1<cBgiY{;w2Nf27XE6`8)zG~MUM~{-c5cd556lP1Ozwk
zvH)lp1Q*Fodk4Y~35X0N8`({A$HMO#lAGwJ6Q6<)tB=A<57bLG*hhB<#LvJFjieXv
z#7$xtjzyX()ppjAWq>mTdl@k4HHJZ1__4L13+PT;>zKt`DSqQTsh^u#-?D^RH}uYe
zjAyw|Q;s=adzBt8iDH_qw`mXV@i3d2o0+pXuDnvT?Q!&+^rQ9!;+UVZYVoS0DB6FB
zOw!AEvL@^1wL*=+G#w-bV|{ir_0UVvkoR-`2#r^=gvrwc_Gp&byL?`ewJgYLbZKcC
zre140cS~!46n4`|ZXU+aJ~s`Qc82;%0x6H#*A&vAx-9bANWArtrp1CSuJqr_-zW3B
za*(uLi|3bZ8Xeo#9@C_Z(_NO<lE4`4LG|kGIj+?Z$|n?zCnWYpKqlo-1?JQFvwkC@
zYHuwKvm5roJdtW>3YyB0ZV}bxr)IA?jPa*>j|Bz*>BP*WS~xZh$h58{LT0>agJxKt
zLSaW#(3Z;1l5trRsU{Mhh9C+L#12;u#%4=kzSmunX)Ee5JFYOUuAd&05-$UKbux*=
zrJ~(qkicn|TBTMpK;2K7YKzapY0%avnb-CUn&V%R6`OO+6NOH6P!*y##CfRr$h|=C
z<$zI>We_^3k>(fyY2JRQ7*Rip6QuDohslR*oHMKA+*5r_z(=UCpS8D`5PP_cPSx&(
zaGA_zb`vy3KgfxRfp%~{n9N)(PMw4UjVSUz9QwdVNl}QMV?=*=S{an&Au2ypAEp#y
zNyeVk0vkGlS5g4#C34)f9)^WU!QO3VJCNkE+bMZT^MiV6jb?-S5L~KjO+WG(#x*w7
zoam9gFoe!=GV+}rcjtzJ{y^-Wn-L~>%OY5`+M)T-Oa@@r8s{l*Al<i0sMeD23$G(L
zg7o6Y1c)o_d0ed1kTRU98HeQbGHUdD*j#+5rko!ThKczLRE?!(_L5pUfMp~VBskLx
zY(@`%E}(*vq|DavUbazZ3RYAq%AqRvqYyino@lfdD&57OX-9~>=R?-9vybkqoG@w=
z<A#wEc8yPr_F2&9BR0G@bqHg;!1$E!+x+S7=K}SKafSI1I4cIUx2Js#BCA&oTYMF4
zF!(OmJ3r<tn2B5V<&Eg@EvhgNF71(`cLP`^E;HVMk1;g(%51Zv&jdyS0QXC40wY{9
zBzn`;1f+C@ZyYK`<U!6ePb&kgQvCbB-Jck}>*aU)7G`)?7g_Vl9ZzCoZZa)dnT(M9
zgqe%$WfivC_v7<`D-77!s)DU(8Le2}?T7Ac>)cvemvZ&Uf-RyNKesuj(kvsP(WlMu
z4_;gPpPr;0+5tjf^Rm&BTAfqK=(^D`$>R~$s+Vt@N9TK*rd7HfZMO09dnWh$`L;MK
zQe|hIdyI1j{)7r!37sL3stPKeb&s>s=5W_36^F+xF`RM~ct`gl_DFgftq=!?Q+81w
zQ|;MJ338X<H+bf{$Z`!iK~3bhoU|O3*lp$|1%6MOC!xLkSlj09wT*k2N&>$TY)>L%
z@aeaxMA`$hrA`N3fw!f&hIKi1-!;uzYR|cgFQL!P2slFwoSIV*AR}`ra9PL9qeDul
z*7Gll#&nCV)z|J*YwxK|gUym0-2HQItkW5f$OllybpKs!csz7awl%_fC)KG@VJWzD
z)hU?pDJ3sr^!mHKVEW()HAGsS=g2X&iZ<X+Bp%<9@=ia|bW93Sj3|!IaYuqQjK4bZ
z#NiB75qOYnm#G=Bs?J*l%vlqtSd|z`{ab}RYYg7<rtTUQG__}PYylar`2)A7ihb<-
zK<u)sK^W|Sr7Oxe1<wH#0S)R_RCG%UIyyj_g1ve%*uE0-96PADLyrkR*dQlfC?FOS
zt*dFyX^ZeZ#8kIR4g=V6)`+`J97BFdS!y%~h8hobW}}9ifNaoX4|-lR14&MtT~aB3
z%eP$IZ!D97jz|v;(dal5X4eos1CA7SbHG^65^gwZFFb2+IO2k4!qqJvc&(@#PwLcN
z#Y)u4yErC|bcu{sB~#bP(pTAxkIlz}G4IbQ44$2H1}zU$@0UAahWh38w|kLzGe&g{
zF$b0)us=17iyqE(4|F34%K>hXdkAq`D(|ZQH+LY>2Z0M4uEBLd;x+p>UV&GPQWqKd
zHpG}~{B^tBE_U|N`v=C8+R(=@I>({oTi1@izVMH79figjP@hK3RI|2=yg#YvyaQL?
zxfVE&mV_8x#j(j771JtD?s!ElwNwtf#LrfZKw+RuZj}{1ZJHoJ<yuIIj2h*09vVeU
zlsBZ9SGh2}FXn%s9?e?6Kf{Fy%=LDG+>?lPg^;Ek1!8W5*+X=j+FOW8-cgyo0!eYa
z@$yvO=}-Ze{?sfNN5@i>+TY(lkO2%lCl$)<=0}kMfcu{y#QzT^A!=d$UjoM@H7GZw
zMV#*}QVZF+M8RC3<gp_8C02{F(i2D%!8}FkJi&i|G9TkNnr4|#<FNt>cu4{GEO-D)
zX@xkAEC3cSWS{D0|FD;Ai6{H)<nhKv=6ol=eK)`^o|pV;eYyG@@OAvLUF~^ykjL}q
zmuydnZi7+h0B9JUdo4T`$yCb9K`%&){2n14?NAB{?JeT=#gJOZ&8{L_7v(Jr-OvtW
z*f>d*{k|mK&_1Q}yR)-T;{c0gr|KSOn4P#b-K|U*7O`z&i-cjsfNGeXy91N0f_?^8
zvxmYz=vJA^X3tt2SMdw^k>;coE|NFmE5-G8k}e{L7{<%?@GD*C7oM<dDhWP${gMH1
z#Am7_Fk;-qlav*bTCF{TFdjrt5+CwgA~sOu$Nn)pkGs%;7!n`CTcxlZ32w^U)Pa3O
zIq?teJ&CXq;_PHM(LD{eY$W?&wWbE}P*cCXA!9<DGl+Vf7&B-vA}V0*%JGbT8%PRx
za_tWDuRf7+lp}mrw&c*Xdthvp#mmHn)JRMq5}MjTgsF!L7Db!4HFmj79uH~)d*#LS
zWWa;7hmN+K(_$sPQmybZ_Mm!4-vZGw?V=}*#~TrS@whlT#U?Xm24k4GCIjBoy7uN2
zF{2G~TuF0ODMru+Zy3pWx}n2<r1Au_VpFIdxEoq!40@+&<Zt_ZcfZ?CV}=w=Q&&b#
zzQrV4$zn{9Xe>$=6Q`l5Pz^JrC`ug&U%x46G*WpUWmzL_xsqe%m?=8?DMM8S`6U{0
zQMQ>ilu>C)Lvl&Ke9^{Yq44bx*i0Ju3+dvC#B6X9E>EFO4@#TDigS5Dg7>Ut)?~9V
zW6WkSE{h`X2O=G#R+u#RREL(wrrT(U-tIEcFf-ZG>8-l*c;O>0QK3cDsB-w%x?3k!
z_w8=8Tbh7kdP63NDI<nlh&57UR1@K)m(1yo;pxgj|Md@h6i6+XHK=5E|1uL~`}=!$
z79o{8oXr3dRzw-wd~CJ=zJW67M_hDDo<dND$(Ne$rSMV%XZCJSyT{v6M#$~sQNd*C
zWQl_lx8+7!`PIqWQJjd1b#9>}SZ-c1!|DODF&`z&yfnHQcv>q=oE?U_w$XqQHM|tu
zcI-~0Arx&S@$Q6PTc-E!=J?gp$Lg*?IG+IPtOkvwY(P5Ag7|d$v$?9kqslCnhUEcs
z2xnAKYtFgE2m){;=&=3R3gO#v#@p)2074RLTJ)Eu##LEGucsY73w1h4-hjp1>RY$%
z*zd=?r3F!Wy&>y37ozJDuSgf_Z;vAwCvVV4QbC!xErWckhr8aT<1I9}qb_~DQR}$w
z-%f;YW*nc<s55dDwM5`qG@*F^8)R)ny~TRSH(JryzhGI17SuFrT^^e5tXZffcSvVe
zCGB(`X1?*Wje`pv%sPgiN-BR`JH=H_d3U8+%mO+3fDXY_siGo^l3Z2A$E1L;KzTxq
z)@O+_UrQu((!ZVL3L9QH8c=6bF4+KD$!G~NmhHw}J5_eERW4&SvjARQY#btnq8(;d
z2%clQDAcKHfI-hIHDi!<M9jfW2^EA(l+CLAxyr3cZ4*}F6X6;^JfD^{^|MAI-Ijtv
zAKmb%Y2wlHkD`B~5b<X#rs)Yg8rH9lMGUvJRn~Z(jc(kPP^>q-KbY)MIGzXFNmMI7
zif8Pi+7=i08OCD%ByU<YJV`4(r*p|3KO*lLdXeuSRm8j%PYzok?hPLE+{kH4W3i$p
zUN<8nr==+ocXz-=WN)-Vb6P1N5}D{D4>r25W~;w_Y}P3f@t1Fk0WCA3!w|kDSghe#
zc^Mx|PmqTlT}T4|<@XF@#o{RYskq<|Wm7AYBk$Y-ekaM4X4Pl#yTPjO>qr4K1i8pQ
zzNr>vKDl8QQ4d*)iHnDUscEVPm$1BY_-`xW(mWQMwNNoVLeAcVdOX`%m@y&h?0)#4
z`4?m>H9KtVD5e{C@CwCiyb97TQ*a;BTRQ08Y5xpQAAbnv>_h;Hwhl`>zDwCN@)9Dd
zX2@_)0C>K}-0?_Nw#w$0KdP9}<llSNiBgA&JFd6g4S&r>XN`5pMw*5ur0alny7yg$
z@|1D_TezdN76BC2n|%5{@fGovBMWfxh3Kv9xW36GP$Wr3{*z@3JU*&0h9v_M!PVJI
z8!sw=0jgw2I5T+Fd{6?qZ`7$S`vc~KcRD}-V$dE(cqU4gp{p<u=O6Ee#xblyOM+F1
zx~Ayx|HIc;N450?{{lsWTY*xnxD{)mXj&-l65J_n1&X^n6n7|6ToSZ6q)3q>#ZsWS
z6@o(u{?hO7y}#Z&@0^^^ncdvovv=>z?9ASoyF*8V*`SA16Y9=pV(l^G_B1zyA|w*&
zJU~@{IE*<4G5_t7P9%wk*sLr@s#SA-X&FAJ1ZD;CZaf=uuibLET};w~%2`$jg5m|x
ze`Y7JUbI98RHO;11ZPcm>MH3g($sK%rBhWoBV!XCr{Jq7%TRF_X9njU6%0P-dSw58
zF2MGUly=u(ZAjD|f}slFe;OdF!D+>GWXWR8vPyNL4j(QH32wwnZZ*%rs?Y~7hYjn0
z<U$1o8Li_ZU%T9{;UOywL?|O(cM5bf2tkv6PiWa5_My(tMwGbEy&S&?E@uF>e4Q}3
zuiTk1lbK3J^PROY7YRcTcGgAAh5*Z2Rpd1htuNPr!WBo~x;lQUO<#><=3fu*{5+P?
z%+65oZSpdte2_35mw(U_ru=Mv$X-m39u&03-v5E>1OJl)jqvmA(92o~VQod?9dA=C
zY42xBZ&KzU0i#2*2cORL;H-5e<4{L8N|%ATyLAsbuQlxD_`HumNVLK&zsqpxo#G`0
z$}aJqiKFwu^IoT1wz94!EA*|MgScG8Ji%372%-pt8h!-(<Ny&oO*`cf^Lk7|M73Ug
z0q~i{!kJ>i_Ng-6`Dpl)i9IhBg3L)S+aGGUNOc_ncYe8JOq^B=V-3=At+yt`2oo%p
zb+xD8pK$btXU7B)CE)PW`NI<Zf7_!p@u(Y#i-?vbaP;nb?FKEU<D7i6Qev`{;cI{V
z%#WfY!Hsi>?S5l{fXv^vk#kFwQ_<%r{xr-O&L_om<Pq?YkFlqI=UF2A+7)wdS570N
zlF3uaOMy_1DdGim7?zmaq+7VQ?3-$WcqM*7BX-5p^!U70Fn;M2<LJXv(EH_&a}F69
zvfnLJMyxB%bN*OtJmr?T*3DKAcW4X*hcLc*dvKR{odk|wQrh!!!=AC173`wI*E9H0
zVq#bAt>$HD@h8mkNUbHHezZnk#bR5@!NWy}qlXxWSD@X;v}o5bm08L;hL;zx!;!he
z0S%{U@3fAt0U(WdeQqig45h+4h;6NZHj)3n3C?bNAwTWKVx%MfykjZpV_$FTM=-|A
zJ{@RQPGewgh~72U;&8Q3q6gA*Vol^t@aop5Abe+^yo=+L(zBQTkCINC#Nm=Y49O>L
z{oF{j#~tn)5-AF`0G2LfbarfToY<Z6t2Lk{B_f{aIZ2+IhH=uu;OmmN%Z$bwHeMao
zm7E_L2At-s7&hOih2CdteneX$GQSL3e64R2mZtPOa3%P^pkM~}z#tJ+GL9eF|IhsV
zzjv_STYs{)`lRS$<>dJRwU6cezr%qObsYbt+DJZ$Jhbwq1W3K5QnKKT#FG6S&7qD?
z%fdNL4gCDIAT#pNrK#ZcsjWRGnPNiGz2;EolJ4I3fma2;MX#1Uj+gy~dV_)=(aq6a
zp)v0WEzq=AQq%eA<j|@}Z1`y-o(?_VVU@sRj?f`d?+#>&v0dre6Uge?Zjabz)D6?m
z0JE)Q$=E7-k1kti%=j*mCb`&q^^}1$4vinn9B(@*zo#VE3BDhNuKS&8@SO?Dm@V42
zL-|`0rkbb*aIF)<zTz*e6U55h8e;K#*1Qd|(vO_;Jo{@b#3NHH^t_58kLEGYq-l3n
zJgP6Vpj5~2SJWW!pAAm$q)Y9z&$w;w>|PILJaJ(b`l?H6?`C){#Bw(cp&agqu%5Nd
zhF_qk9n2DbD<}C@4hMFxrvWu4m*9^>UIjd>m&N_gFMV|3Mg}uKPYDJKFC#t>SiK*T
zT+R}RVH#~KcBf}zvM?D^?kdSFaGPn)=(3{9U>igh<SD{FLt@{2*RX=-)m!XzJzQlj
zpV6QzeQoECOW<`98le2{P;9CPpb>{<oIdjxM7X`ROth%fXYJJ4Xs_<FoIcsorHGoI
zzwu-ZFm~(#J2%z7hR`$zC(8f%<n$rZ!YI1le!c?P&f}9JHb}?yzV?^S_xU6akCfB%
zuh(!_bRh-S;}3?fdd2=sjtY!7KZ|FpH1r`O0(9z@p||8HB!n!`M#XkQUDYS6a6O@*
zn3vKmE)+G-1e6-&6AIIXZ>B$Ao4s-~_gM=Dmf42+hASK}OMC4-{}RX|T9Dh0t=y>G
z%&MJbr@q2?vi^+j(}Ogo19@He-WN{-vVso@rNnq-d5ksE#oVcQz&9i}aTArFBG>Bt
zVInF_F)U10F?uG5sUssD_x5)&(5TWB?jJK3$zId$kuGFPK{B-OB#&JwJ4eW~Su;dc
zEDNXHl)jYsX@FGyg7o(86_bA#piLWwJoKVJ^Q0o}C)@5+*^4mi9RdFH+^pL$S@uv7
z!cG6*2;mq1*XHm4Yv*^c0LO=7?&gtQ+iNltO%azB6Fd_e7J{V-R{&{<Stw?bC^Rxf
zT7LaaNzwTQ=Fi8$g@_C5wmgR6bLpQv=KL1!%<(9E^eDRR^lu<;I-dyG%|E^hoXj~d
z%o+a;-Yk}Xt-7?dh&tz9WRh_2etbK~Lsmm*{2X3ze!rtsOpNCsb&j#*Q#?gXcB4_u
z@Zv%yGAMhBnCd1)nt|<NU7CUE0!3LD`J~)W4x*ovooiW`K7GX}qIdms?p<A)Z{htU
zCA90;N<HZgNE#@Yt%o0&Kb1^*<0j3(cY!Be#Brf0UG(CjO1g;c!o66X%J2OirF1f&
zTWPN;Lds~*Bf^yV!mxM&Pm=ATUD}nzFKucUFEDh93UH5ET*Pvb7U`QfMTLKESj<O$
zV=oOf*|Wtx7qc+syYPqzs-Mcj4~*n@CD}=oj=sc_jy{r=?tQ<P1-KV1HhXyik~ZTV
z&x`1h+nc>}uvp=_aE$bg=Xa$PLl{L&Brin-bxs|V+!RRnD(`vY-_sYba$np=1ociW
z0PfL?fgIyY5hM1*`1hp64ODEqz?T>75f5ckMPxTK(!p|jlYo2FH#iHZB6{BK@d55x
zi(M&h*ou2!T<AqU<W8AU-Ox%0Ywx+@-8&ceGGBN{Dz@iEKJ-ihN!Tcn3VTJk_u3XK
z%qk9NkyE`CH+s-AC8LOk#Hn6NHqYC4dqBWFd+{UBg;~Ty%~TuUUZnW(<pnUJM|E#0
z@}Yvi_@s@WfrO1`9#4i`u8{weg%k^cHgzU{05m|KTACW&0yFYDhJOK{*^Ig_V%jh}
z8BqF`Iugo3wqpeiFwR!TE$!wP!!0f4SBjWcr2YyG(4sbpm<Cac<5}5SNU<iEL_+fT
zy{Lxhp?hozN6-L6YRSlHW$Nz8X?g0vNKLi`$w){R{|#PgFF)ex5Sj%6#So(foH-#d
z5>mvEpc*o_c+QycB+~6Oe-z-H#^O0w!uJTbZ~RFlLn%;dwuE&kHB$nLVojKaQZpx%
zM!F^N4*|{%ES_^GY(@x}W>4Z-mGHCSSvB&P<62eom*bThQ_n<_k`57A=-`%WQEOU^
zQ^;lT+u)TNQa42k$Wy<DR#M6p@LNJFsfLU#Ug4H1QvZZzvnO0b^%)Z)p>Is7*>N}D
zTjaA4gkAeu^e`r{LiM>4tf6l})D?J}pDgm35`-e%GWkVtH=kSda1cn}uv+BvjVD6C
zz0J;xa7*Dgdpg7l{iZ{mg}3Q$QA@VN4GjQM>jBPRTNtyBFGOBP@vl<s7(u_tcJU^l
z8Z_~*lJ0auznNqo<9RgkACc|cLRtExD24)|-^{2TBTqy4=_#-^Pe1bm$%dGreV0DZ
z<%4+=*dwlE`3uR|ijg_|pHogAjI+&f!xy#Y5}|im+3$B2pvy1DT_Y4f1hJ1FN1kT#
z2b1h1L+=!`f%sNU{K2F<4bU&205|&CMv?v2!Q?x~(6ul#K={EOQvxp(DM!7EqMgWx
zh@nVLYU2-`{6VDHdN3}Pk{dpY2VMd-q&9UhUij)Gu2nSu17$hexP%4SdKAB^g(37#
zK0C+)V1XUcE|dKTi1#>){H>H-7dbeB1?8czNddp5#BVC#U&6=tk+;aiZA#;hJ(+;Q
zUyRp7mld<$BVR%VBL@e)sdnh0XL#{1{BWBpz#Nsy{I`H6m27{22cHFk+$PxKh?j?p
zUjvl@6ByCn0G5UV@IAo%#3VZ;7TfsoT!fTQ506MJ=(%czp<E<SJ!#p-OCv;$vza4A
zwe(*NO+y{H$4es>i&Q=*lkY&FEKqh_d_Y=+s6n=NgeWL`Cc@w)kAiH(oN0CjGy&jI
z4i>|$DFrJ<VD*baYe{vhz+(9LxtCBU5}Q)~yoldC<G#>+uG)f#mL@P`PYu|MoDC8f
z$4`Zq*5en;p9R3@RHNLnhf0`aU%+eu=RCbF(X0EJ71#UBgo)Ep5_PvRIgqIGC<PM(
zC!0WnWkX?cK|U>E_z5ypAj$brf_G}ln4E5jqAEMBf->RbguP33J*S5X;uJCm@=Ph;
ziLxtf^+%lcyUD1Q)dOT?JWb{vWcrZUdJ7;C!jYMwPesdT36HBCE$<O;UaAWb$AYvn
z=9#MxN=kDbZQs)l$=b}CLu_UToXF(7cboUZ{31vwAss{I3MSfxx{HDDYm2KBR$miZ
z6aMs6ooktHbc2Xai|uw4+nHGVI@$PIY4ftT#l4Kt?Gw_~QzI1kR2erfOIyu7dhnuU
z`Yd;UsQm1VX1aP`OvlkJW}}n1iEpu<l`E(nI&@<vdpW)z7gIwJd}VPrIYg-^$L;Wf
z@HCt#GHM6V`7~#4^o@?m0)=yB{A{|2@MNWH4CwWH2l55pvp2IP0JoLvBqMpbeL78=
zn=O0iP3y(mqciCg0M!JLz2jq0Z86#KE8X{%e!hlC;n#B%>VNIEv!Atlopak*GXg{t
zzSEMv)Fp1_jN)F>k+a=6SIVktTK<~$oTd~%_ais;6&7Ab?vDgJ!a|SMoE3s{XUyOk
z=#5=FFU7WauO@}buB<~Yo~YTCVp@J!+^+?1ChU<Kc1iy6cGHJ^hZ2Z@A$i@$7@|Ak
z`Yq#1ZRR?WiQcZSw2OXuICnT-e@9{!7>Wbj4rw5plJzFJl^Qayv^L$o>02Iakk-^S
z#J)UvL-CRERN**GCLKhevmjSZ#y(v7lJ`vNF}8E#!NG*QuErsEyF;JqdT`_OXKlad
zwpUbm-h;HsZDw(spPwQ$AKwjTaCuh7f~NU=M5Re%9k!Ki1|1ys@HMNpLH0|8bLY7D
z6_-;}DbTrPORrrGBUc863z4|Y<4<42Ij3S<O+IVd+%?WUs<LiNi}tu|r_<UyI4FFg
zdQ@cg{*n2?l(PxQefB1%h5jg|ypmVV>XVB{bA8wY&uR}&$CmyDFhzz&_<CfKwR(1O
zTmP0VhlZn-H7&@fp)|)P3m<U!Hg-<dKIpH$qZy5TT)ICUrxL9R)!%)KpS3zTziHk_
zc0SKrQH#UQ`gWWC!Lsr0*p1|&{@JTn@1L^O5VhIKJV`8Z(`9jE7_07pClKf&P8!6t
zv;(_@THi{`(NPwXB|W%CWtYlD*ESj#{#NzkNVBrtwkOK-*;Fj}m2EyVjaNehvALD{
zAzPA>kVoD|TjSrg=_(%H$x{0JYzwq8g;6oJ1^K2r%}k)(nkzg4F*ytKU95dnUD#PB
zOe<Z{Szl-2Gg30%TKV}*rR~johQ4pfOS1b829j-?hTgp-ZJ$OPf81haImT~(H(GM6
zg473!d%qq-&M6BL{u18pY2|)6r2i@~zifWh@xpMyn6~%tHhVCeIJG}eYSGgm+@6~=
z>L5Kqsd+-|^WI7U*~UWEO;JPy9VynS8k>w(aM_FEuWNdi@Bav23#BOsMTz#9{R{!;
zGFB!qIS=)isA<b2Of>y?U6@N{UzubZHyEoaCpH*&kdorrZppp2FRehHSDp8iO>7rY
z-#z}UZA40%!1^jq_sZvyuF|o-%I!vly{<Y&SeQ+TyR~U`M*;NekH8zmN7?Z|&NzR>
zBmWk-N0qi{`iD?9YWL}!JWYANprfZF(k|vE7EJ7@yUQp39poxM^47AU<JYO`hWE~(
zq4i=4kCqHJL#%D?>A{EWjZ|*zdAHZfO#(TCPyOjzWt!bAOa^PC^i66-Wv!ypqC|UT
zCXT=9xpg`6jh+6M=LZdNRk8lH;F=XwaYNa+<+XnP^yNvXJzKrOLY`5X*Htw_Dxa|T
ztL|Y5zcu||e0jB$4sxCR{z*OQ&!3phg?d!*+fIuKTZ5x5gPQ3Qr_gi*>JfeTL(r9E
zgP^Y;iM<%Hx2kc%X&d!&t;QPKHL$$&VlY=98Bq5=darp_5>Xs4X{D3H)&KWiXn)z%
z9fQ)zH-f%YYG)jS_2nv4`;y=k!0@?y@uo3=3r^2=9%mxxlrl7=ue&>K>K-P!@8UL~
zTgEgWp<FtGO>LJju8hE^gRia}HhdXmsy=RAk1JP@0loSgw`E!)?|o>E`j`y!MdzuV
z;<rzxwNXiubKcwHki$=zzi-vNmjtYUO|{U>;YvHz=8@^8&^A;9(5qWq>m{c3{B&x)
zGDOWY%b%AM7c4(H$8wz_#r+qB@Oe{;tX2tjg@xwp+;-h)*g75mrdy9Vl$gqsjykK&
zw<#-I>2fHkfo-iVTUx5*j6cIXY%<ATc>V<YnskT56OeuUw<McI7gH?yG|r!PmI{hZ
z{DvoHY=sv<=^}4Dm=k{rJuBcu9hr`etM*j=BOBoFGvMNxhOgE6c+MO?99MDtxD3Db
zyhFi*kkZ+$(y@d#y@<3((Ss12T4D2Bxv4(g^G&{}ietebS#f^-Ldx4W=c^NwVMBJ7
zT)F4m&#Dg!sxCgbFSid)tGKqDOC>3s=T}KwfzHXTqCb!%UpKHdoEk9shY9ZIDiFM}
z&K!oH#cTIAMQhP`bv7g_?zN6cSx$bfN*gf`YZ0<>&RQ8!5@{qV<NX`;n{zC6ZlF8q
zm(8z|PMjM0`C1ze@$k1zILmWFROK!`u}12Rg{(PIwObRLUnI9;Y_Q}xEMhzByHSkE
z{9FE)m5w-`C-LDQuQqDbL^p}qU5mcTy20M45B0ZVI*hyB;_)loJTxjlr{FavFQBU9
zT;+!3`H{^S;|%$hq?$40xhh)%bE|5aD-@P*x3@=3>OqceceAmBM}N-F2I!>}CD;`T
zsN-}x5OK!-+uNrFI+C}n`<%bN-e^-HtP7TbZtfwcWM>1D_G=;c%pc68KpfY(LL4vM
z4aUX}EZsEtcQ%TSmo1F_KESiG*uAyqs6SWA>0P<_`fAyy#+A+Xd<gCFd0nZ;qo!5X
zV7P|v^z#Qm({ZMB3Q;ehx0CX?H4WO(%$||AZL9n&#Ga|*xYUVgY^tbbw%3+v7S=L5
zRzb_K$!q+DG5LL>Oynm|rvuixtt{<EqVPQlzq3pmGU?!VMZ+!l&F@x&XtJ0HU%6WM
zVp?5eTKjw}k?P!`%FYlnb@6wW@@h5krg)YLQi7wI#qosKQ(Ho#lfta><#@NXc4fbU
z{J(HOCcE2u*m9pYcwK^RF26Mj{gSm+{`Jzrl{BQzSt>T%O}W^S5A=a!GyUVG%GKbZ
ziC^QE-AgBYJ=21G*-oA|Vv*To&Vp*TBj#4JD#JFVJ0;FFbvg$+22ckkhx2vjyY@f!
zEGy|Jp6XpLBnixE4N@$V3V=!T;t`tD_Ll`kf^1Qv!dzqX)h~W!PrED*M8Donl1!Ov
z4-%JB&rgjRM^4Y0S0*+wOm>i2L4P@EBbs9uEc_$Voz;nw!v8XR>ABjL&YdpV#L3q*
zzn)HEBjk;eb#6?CiDWd#s)_%spV}!3{JRmsI1x}5omoHZ$&|$@%4|CK++M+E%Gu<m
z!+af?V1EXUbX&E3b`Kw#G|gYKArF>(@sK1}t+t-4Un?bfK)dl)Eb-)b?cw!TjXU{9
z+HI<~(8aTaEB!D^d~Pk80LBi+jBcE2OI3(Yc+A|q$dVBGODm3*NLKaOW9!0SVh<O;
zFM|}pQor&6kI<O=PhG-F<VtN<0eK)#6NgNuDHtZ`>KL#aSgAW56{R13VBRBHU{H8O
z`(z@>N_!x-YU{XG;>C;$PLA_Ot<>3kJHdB~boGhzL(fvJ{)W_SDm-|_soYO+3C<)X
z{q(F?-V*PfnQ+Pr=;Sz$WD537=(lU}SZcC0hp%pXPApmIglp>U)1#G7{58w>H^jMe
znU~Otm+|^EJD_!>bo7SG;h!MKHxdo3>M6GVSPL*N>|hK(xwvl-yQF5;e4ll6M#Zzi
zm;B*fV<UG%DTSelJV%yxyrF)XcccCXx;|CZ2|usEC`qn)9FwwCj~Eo(30$&)R}5JX
z=IrPkOf)#<W}SYr31a!9wAs5kqP6d>J7B#iFdm~bZeN>Rwo?xML?JXo?pqwScX#1|
zCRi}E?~_bgG&BaA%pG#{B^b1we<d=ZbRz*FCoZ{A%e*td$*&?Cx~b|n^%J3=Kl)P(
zc5y>}9kM#H47*`O@(RWjs0CfG@8*fNWk45eSiao1dgxLKaW!@KF{Q1l=T`6O$d-8S
zWpw!7;a!>#d1ii-A{`!kO6;lYs|SJ=>$ABbuDnCjGX4i<M~=UOY(p<-GQCE+;S1dO
zhR@gP3y<crc92mtlR9VQ87e)aMhcm$8>;i4$FeJOARW1pUida?zNU=UjmO+Sg;G17
zRs`89Epg4b0IfdS(2Uk_ABtY*%uR3YvEL31{Ft5KJbmlOetuKeMD&JuA}w4$tEDCF
z`e(C|pC#_Hl=Dd3mE}ST!OI-P`|hU1`X+cf`@<XNQ!#~-5jL~b7?Iy$N^!iC&5?T#
zmV{Lh@V%fTDyLgh@g|O!!TQnLmaTxL-{Lb{?yGNwi8#+??nIT`P?LY0XP?ZS;o~Ws
zv&(Aa9e!V}dH3_xuZUTN^13`9zt*nTPugu}A-0|5t|1=`8Y^felNOr_IGZG2R|i!=
zel)Q=<h6D%vje~9e>893!t4Fg8PQwtIbs7yhI5vNLw4KqVMTh=xtYCvBbhTlfTyO<
zOQ$jP7L};2tI~!t#43JXGj!wT_@I|Gwzqm&7@uv-9@qAbG_&XW#K+<M)zAvpWGQY_
z?p|^sX8M-HBHzfGsCiq(y~&qM6kvPZe{tB2%2QU0fiJ(2AfgaUwQXl9Lg(R?5N=wg
z|F~uUr^ElQJ7RbB9m}IBQ_^`_%lrMLI{BwJ$#%X7?Fg@=mKSpIiY;8WTHpau#vE6*
z;+>_2Lt$BM<3(|td`^@;cFt!OsyV3Ew#sj<N)sBdqZ8V!zpk>~d7UsjW-IHEiZ?U;
zIL%XblZdUy6dV29UPiVy$l`juV?1{t<HxHqvs(KiskL#j#k9KEYr&BeC#O&7BMFk|
z>o4eQo1#Tkz3SSDhmAflUcO0?V_^6oDl~Um+VjDc^!Y)TuGcs6r?SH=kKb&Kp9FfD
ziKjwuf^Hrx0$l^qq<-A^)8E2EEdswt;i}t2)8W(|S=2<&2{~Oh`bF1C>6-O|p0*;I
z5u-C_Y`1km7B#(dbe6xT!t-hzW4gdCZL(E<#|6;&w~n6+CR&iR=~eG`FY6QTC*s=L
z4>x6bO}AU?>V#Hoym)B%$d@u(c~=!%e$ufv+=&gd95=Eh`S#E_FgWgBu2g8>K6MRZ
zb2#>+oNA@;?;^<F$nmS2Y;C>@=;tkV+JDXK-^+hnz+EBDYZ}>DS3EnWL4+!^?WWJ_
zkF7Y)oJ9mIDD$h$37Lkwz0Ki+!pe1zs8sWBT72$VlE!^32CCHeGe|2wE;uqEg5KOC
zqO`LTu0)<I579nPV%?Mk$VbEVX!BEzT}j`76Xe5**ssVHmNY(J-c3QQf5r_nkKd*w
z%5X?N9%JS&e8*##kSG#)^UN<tke=s_&*UyHB86yW=9(y{7B5h~qV`_*2+x0bt+3Hs
zA~%=X`vhgO`vcc*=+x9LD(pVw8rrJpiHFWvk}bKpA!=K+QxdwvYI7Vb2F7!YE86Tu
z`ww0+mNszx$nEiz*nb^*K%%bVDAp{<Ca*2nj)<2mm!cc_l~&|dNA*n_n4bGX<uWfv
z`^)JOt0dlj{=ECMSxyegLmFVs;DGHi@Th9i$6sy2b;u-FV4LQ6?N3^vn{$&5|BT#1
z*H@3zgtZ^usxo5o+G#OvU$w|XC;Dg8O}l8y*)BIeXwUdfv{(J*ik8_~)|S{YX;N1M
z8K0|9V9k&#oXTzH0+d>-w?3(LJ$_1**$mX3pN$E3-~Lned7=^PkEvr?PEEx|=ht>d
zZc_E-aYL5936PM`-&v4R?$QUF+0!LuF^i;Cnm?RP&YT(SKSzF<jM$YFcS5T?hmewU
zw$0$DA6VHqN9hqC#jF*-iDxvI<-X%`cEhyKF@00e;JvfX2xs7R{N3*#aJ+2G!W_UJ
z)HsY(Titp+>RtBZ*{-;lZPG;n25Y#*u;WNCwQJm<!?Q6#oEBfh960f)&_iKB<@Z2}
zD-+}O6dTdt*QV-Yqcez)4D^TN^2e*CUt`Y?+dkw2MHz;AFTJGaT03`hj;1f5a<)Ws
zj6{`6ckq4v-_)H&Uj!8hzx?=~UtyqTYuS6NX?84eb-X!P7Rf2_u(DdH7n7*ULYnhh
z)x4$PGRQAjb>@?5n+N7?Rspe{?~T;Nao}YEQWenO8xA3uS9xf#r}IPX|Jg<7ZLmGQ
zeciqLJy+lq{b!e1)6tH8VG!EmQ?cEaUw4L%ytOUUi;h^&X-XKfziF8z?f%}q>{4%{
zpAR6%zbCe{tb0mb)Fb!V&)(4J^PoPFmU%dt6AqXTLNG_{WpPR1q!7l7wL~+<1aQ(1
z`-2Cc&?f@TikgM}A%q|46KR_pDT4p>Bl_IG1w}MZ)Um==%x}#_wffr<F+15|-C%;5
zWOs`?0;f>SP7xToeiS$IsS@}$<PX&tE>^2T7##rujfa`iuqDHs7(<+5j6=44kPKdI
zPW)X^EHcnoD1TmXW~hE{kx=bbWy;X!iGup+IRD|p!^0Y0p);4et4{xBqDZ<02i8;a
zj;34iJf4ERtD3*@dEJ~CmDhSvi=p0xJOA-wb^)w&$^JLa8&9Is<CNT~sA=isl0>2f
zFY6^4+E@|!;v+j}iKVK=X+s@xIfl(<Ige=F?A?XriCb;QtG1`+R`SaN09LO|4mTd9
z=h4<qMCq_Wnb=qk0X$Z=(gBL}Y=S0x4$UO88O@UCtTtcXM{32op{~#15Flr*20yRq
zJ7Vjfz!t|Da|6JS$eie4)S0Jo!oAU$OK7d6W0+X2d6?qF@BkiiO3$O0{q)2LOrErh
zk(ae8p@&TUg#-u+9&L(kM7nuah)JAvb(kw39^w_a!YZenqpc0o|0%2qlFofoB}E2z
z2Xli}^wO8~!c6cG7(AqbQTUEF=3^|d_<qx{uhI?aE5xX7_;5M_$~r}yyxypel)#Q)
z9nOGR^{{Sic#FQx-??Ak_WAl(&=7JwO_bY5y!|T}2wffz3K%*WoX-4sK&!NmDBb)R
z-JdVh5Nq`v8Qc&|@OU96YkbJuFNKM);1TFH-Cqr4g~|6zMOoKlbQWRWvcM|9ul5pO
z*77~+?8Ut0f$f4{{r&mN9Y+~V+t(9gT_|O?U;2avrfP0B)cCgeoCFW?8r)!IP|3ho
zcOFUxH!@!xat{kCq458Vc}oxbsjsFru%&^AkO4DTh#K@?nd2d}!KkbaS+n#$Dfw4R
z4|S>uY*8$7<hMCPZ);%t0g3bVrGM!)^%IDC6cahfb}tl?ImL1d!vVC2RzmRsD~(gu
z@VJJ`#RbFIR@sB0)?@_lla=FUro}4)zMdJb7KWB*hZPrJN}Me<rq^A0f0R>wddiI{
zs`KJULwX107+Ih_Mko5aFsB3ZFoFwqO46aew{BlxuF5Z#Q!&?CQ5h{8ENyI1ZF1VH
z%tY~VnKWQ?NNXa6o48`8q}^hDhJCPOcylnd&hgX>rxE=YeN$7zv<*}U>1OUl)U@Ee
zj{QgaqdLXHD#|SbeKqYp-v~_ZK5TG){Wnqu&i<(W9V<~8%_DxiRziJoUny<i*!FP9
zQgTlj!~M`(O`f>GR)%{QV4Mn&P0jsw`uMMW%EhK8?|t?{<~vsbt2Hk}dsF{9oTbLD
zq{S~?WX^V`?7Yxct_GnXc*(`)?<%6voo(-P!L%+Ot1k^OJ*UMk9uYn>wuS*k7t>63
zKC{$?kHn_p-yNxZ4gn2+)>^o`5FvUZKAzDixQx)_V{P!Dcrr^$W_C5WV68s^8W>T)
zYh{2v=x1_oc%);BlhjHcHc3z0Cuf>pJ#kbgDahiwvWG2(cmKu%(trNA$zk=yz$r8J
z$EDlt)Bx3Lc_1}#Fk|%c^x{jR->_Wb>B$<2>K0vP%ZRwbLAHp_Qh{?rmrV16Z?r@B
zInfMTQ{om~F=&@A2Vt%W4L{tZhvQ|PYs*X-zu%dr?}{SNVU8J3dB4N)!h<D6H0p;$
z?hgrUHF@%!&6shkjFfgk&v+-AoMDA733NX70r$`sg2PH+?LM_Z_hJ;O2%hPe0~?o_
z@zAx>arf(nC0e$>*WBG?ff<+|hMs<n6HCrAckG+DY*!K3%46)G4=;${c9$(+R|2b=
zAENJbp-4qAe&5T1Mnlb`4|s_8V0Mdk>E2&+rV*Xp`Xh)9A?%y@`@zgVrU6HYjY%iI
z*tF%t!QJ1ccOwYF!P0J?l5U>zZl2<9p0EEfU&&uI5#cU&xczEzET=iEDgDqo(Xvbc
zR5H?T*Z6!41dyyy1n-8M#BMu8GK{gp;`<hPw{!DXKo$PT4Z#36(H{LsKHbfD5OPB)
z0D^619LYDo7Vmg6*rH@+Tw}(5*!hA?RblcResOn`?;!YHCe3JSOZQbfp{k2~+S1gP
z+N*Ya)g!sI&Z#ZaSMBOmBZN1JqFbQ#{sVL$N!$j{6F*$jgSAWCuKDi=nm%>W3!5i?
z(jy0K_cr!LW}K&&Gsqhno;D6SGfg~%FPP7~{q<MdF@%(MSRfu;j;D=t(LV$8768+O
zpw6;5ZeoFn^!3DU6Ak{TGYkvFfp_X3>DawC3JYX_<LDo0rHjjl-BZKa^^bJzK+OF?
zL<oGID~{&s4D(*>POP!+II#sq@M`Ei{a7HtNhRza4?d}Xq<2!6W!@HcPdJ8BZ|!7o
zVek?};tNOHyRds&I8dKnCw*xzal02ol6b5m-=<cT_m=g~EJnvy%6+LiohwI4Sms}J
z=g;)BQTt3NF;bdbu=L}$?!C}ZJ7)e#-vw9$;WoVRX^GS$?ON=wk?a!dLxIxToZ`rV
zg)ER?edFLIvV%KQo<cwvwaQ|_>-FckE&r{bI4~D|`Z<QN^=yygXg<G<cvEDFNY7q4
zpWkM@U;u=@2ZnD3kLA1BjPK6q@i8vmJtb4cE*_E6FVrws|7?DRBThY*27t$s!9&f7
zp=aqB{;8P$xG))rL|sg18Y_&sk3M#rMz*~|0sOr`sqd`zg}f0<e-gGh_LxVUJC!on
zsz2%bS%BKGld{BymxP;m=(hreWwjSB>||})F-uhghp#rgxZK1Gz9n*OBCrORp<1zQ
zTYozWDqJ<pvlPKwe<z;QQc<2isZc`EsOsLblTCXv9^Vd^-M_SyZvGvZ%7sS~3X5gE
zJlp<Js6zdc?+tgH+mD?8eNh9~Cn@DH6HG6G%ms>M>&Z;>tk4#ry#-3c0_Ofgbc70z
zD+hR23A`I3Ni~)SfV<-%B*42?zRD@L4WG^VF#Sn0+b9Fae97Qn&H28cCB0yq%re&t
z@5UJG1oUvT!fN_V6SuqbCwxuUruj_ddp}9u|029l7Wu{Z=WXvNq5EIF7s_p@f^_dE
z@%vwNqe1pf(v$eCxyy-cSLVKEq1_5$-3)L;9tMs8Hwb1Y5nM)JYW(k;b24JH+F`2X
zjrie{!A<0bK)@+Wj}O31B9X5UN;SC=znk8JRCv^1EPt6{*NCnPAKoiM^^k+viC6n)
zCaC&kaGMP7Xnu&Q-kznZkq9__+T%lO))mgTGDvm27XK5u5g2fa-s8hy77)QFrF*k+
zK6}9Mcs{&cBdHKrj#ofo_9)Fg-8<U>IV=sXBb-9LbGdMBws+#bJZ^q=@4vly#zzr5
zPDv)8R(9Z(`tbEdUwyi{;xA8e#YZJlb4M2a)K7oZe)Ue+hnQ@y$M@oagK@!hn6O?<
z7*XB$j~Q&54&hn;X51yN@4qag)M?C(D2|Ja59?w{rvM3znXVK)-{iu6;w%Bi+5l$8
z-2G2Ocn8i39s-HdMh^^cpd9lUsBe8w*)?Q5qid#j8cQGxn8q_p--uU3mf-j7RbLDe
z10)-=?4(m&V2U@%05~BTk79=f`(Gd@SVRdd*}v#~Z5zqpnreO<*1}NwSh9!Xl4*V$
z`j4)zJm)2YzXc<#F6sdAIx=|BziI5{M6R&)6QMh1Av<4ielrP^q=qx;KWNNe6X78~
zg1wyEIQIi8F#RcD>-w$Squt73bXZ=mGJ%w^PF9#zU((>2p4t*plHU35%_7og5sA5o
zeE%PQSVU4RB6a?ukEnA%M`Pk6O1Au2b9KJN-j^Q%MZ0nS>=r9h=8j9JIlRhAWSg_o
z3TJDv(~ABF$!s1Ox$qyH4Y!g$uls9gOwZR|GoYY_#B})k0j3WfaYNdgXJhI@ujqEm
zeE5Q;4{zv#mJe?@3JS0rX4XBiyVRl=3{J$12FIo-4sXyE3HaEf^g@1WU&s<Gfw}ul
z(RB5i3p~l-gXVnbj$5--#J<Q4_W%gMtagY>Z!LZfX-U}g4fT)``Rbum3mfqV={@|E
zJwEy+BZ+qI<oe3%@$xJ%qy81_`HFAe4O!;LnEq7y!D@l0mC<}hgH%`R@wcagh5>HC
z9v>33+V51v>+zn*4blLJ>0kWflR+yoReJd}_C9P1l!6Kid<GXX50C35^^pz>q=)01
z%ZOeMrqTEK;F&oMQ01Krjv+0{dweL(x}x|@hp8IY<3&yfjg-tHJZ>6iwCTH6A{YEm
z76}@z)>~*y8K4KuK7j-c$!nLKT~gX-qk03d88Wlr*oIz=B_&d;Nd@p~$o*3%M_K=1
z-LQLfc(VD@)~lhy^OHe7<c3}VgwpITim!De9(Xb+8~~v+bNWsdjAHhT9u5tabV<JH
zEwj21^791gNCvZ$p<HbJiPv!yLCcK&H~j#xv&VismC+59z#d(wmNNI+u<EzcL4WJG
zQz@Y!esi%+@ly*U>()6-8^|xJLDB8YRGbE)lYQI<G9S+{J-jZl?=|>c9Z(c_MJ>Ek
zGCkDdGuYl>O-!Wk@`_%dKiS7_IQj>LC;M0pEB~P9giHI(p&{l`HI<s}N@V0dkq7`E
zBjaiBRXlS2q|;oW$D;2ZoVL8mp}A~pmSH|}uj=6VNo)4{HD2cOD$A9K5~XL5Nf_&u
z$UB+>k6iiQbyA=_De!x25$V9B!iFv8sZcJGM&|Ch>Rkd;&=47LGyQZ%HU+<nbNYis
zt_s=`C^S$xtbo7^04tyf3NQ-e#Sy22PXK^D%>Ajid0P)dFGUYmS1wPO{~OVNRZe3n
z{|$-d%GSslRWrK03Ii4I`je^VPL<KXT>x+!JTG)uq`9{qN}>H{35EVanYB1%@E73t
zelKlvAj$&@m85j?mMs9Lnopwnv%%;^4{@XrF-0DzUu@C#z$9S9R`k?E>a-~p*&c#4
zP`opKe`j2qP*fP#dKddXZER}G9o$XPgVYJ@#^A|`oHkmIpJaj6^qW3uO}6B@Z^!hP
zgwggPK(p8QcnBMCTL`aq*U8COOn-5hc;8VK#}zjo!UcR4@<%!J-ta$l55A{>p_Ggm
zm^k#Xp)ZKJzaHn71J+Fmb7h6G_etS-g<#wkVBQkIZ2O6H%zLxU&Coj0;fz=a96T>(
zl*e<WX&#(zZiaRH3>HWUD?*tx{XJM-z(HkQpfdP4ERY!f5GRa`$Gk;{5%&}6Zn^X-
zfr~=!Dd6ZsBviuZois+QFuuMZJjB~b-CjkoQD4v#1S8h!Dl6=`{{hXbvSb;^0xRl&
zz(APq;_1}8e|Dz7N?QHqeK*m)Nqj`NgrfSpH`R~mg58dhdH%y@%i>-ikCA%5$8U55
z3RjQnV!t|KWuhba2LpH2@#b;ni4h+o`5scu!_8&PlQjnVR>_>W!FB!gsL5f#Yb9|a
zg;@+~YSnoufDijxam0<MhaNM`mHWIf@*ceO4N4|t6`eE-+0ebG0d@5uGYrJs$}!s*
zyNZ3CXe*Q_9H5a7OchHf&nFUwSi&r8g(3dv^rh9Uoak3r#@NWcbeJ_B#Kc?~;|K>f
zQJbs@T4F~h#&oKfw*t*&1^}lPiNOU%$;#Uzd~9cV?T?*z<s9nG@DH_2hJ9k6_vy+q
z3}sqSi%hLd^Sk-tMU4Y~l#MnjCSB8(q~j$xT+KqLpu+@gl|z$K!^#ZMoqk5>L$G$r
z6|B%xW0!~}L39!^dv_fl8^E-k{CFEs%)tj=Pd-IjVa(;l0NK`)W06*XhwM0D`Fe5{
z(n{<>qX*qpMa6TOzFMK@#tx+AL~+8B0c0r(Y*t9+b$K=P0aaKHY<56fz$h%?GB{h8
zuc1FN?$g$O5}cgMY8KR-i?(Edcm*0sRR<d4qb=EcwZ}DWEhW##h8#-xcT|5E8D^-H
z4LN)-UV@?A^I*sO#L0G1Nax)zH4LdI-~tD|%DzL^H4n5R{BK&@)kI_`z9Ex1&p{c>
znixGKC$b^7)yAL~=w<+<U>~SDRa~*J2HgzZClg@Ig>Ht0bm*I_cJR&&X?PMKx%Rs{
zwNs%_1igpm<T+@>gmrBRZI$So9Oz7q?8GGG7~8l8HG*CHKRC#sK2NTbmt-g5Aq(h9
zReh<)wuZ@Qro`V&Q8W5>#_u`!J|v(Xz;hi|e)-D$7SA_)dJn^vFpi~Ys<{xy3HZWQ
z>$T#D$g8?6G*`^!S^(LI{Hr=Wv|fNuA*xYa`6c$62>PTR9@}+7`6bbsH#(n22G4a;
z`K8nvF&du^ivC=FDX^xF#?XKoQJH-p5fZ<Ty|OP=-QLjb$qEMYJ*EB`uj+w#-|7=7
zMbwy7W^V9KCPUP9Ls`vcnp-g*2v0bxco5eEMYyx9at@CR!7nt@7bdN;TUE*Dy&Btq
zEo29Lb+k)T^T0(k$7tb!8@;@t)?Zl_b2p#nR&lB069(I#2P0e+$8GJ=i`2O<u3NN<
zru@LX=U6T8dOi!!Qq8|`stKrT_A_(bMta0L7{9m%R5g6IJmd+eLfs-kRRf*5IH6fN
zYWOny+~`ib>lM{vm?O~&fm`cR;>18zP~(<znbg_GqJrq6dJJVL*?nf>tKYsznra8-
zp8qKb_>}+Sj{nm{8FinDv-0#uP3I>~9<Xxa6WsgI+!MlIfPh;&)}Fu?7pGe!VgVb8
z?I;s~V>biSy&)=7Whir+*`?m?U=a{vO$p$b^Tthm4)F1HVaFx9(AdTmi(sx=;TMZ2
z-6M&bW=i-XL#-IiA4g=tLI<Tr)n?E^0iZ7mQk(m<@{nN+DZWd>WGZs)CQi`9afMC%
zS(IO;AUcRmt6Q;BkOst7JgTFU6UDV%DM$!<Q7I@>HF{kg#eMywmQM*Hgx)Y-$3@SO
zdkHEXb*dJ@0Xb+`6IIU^D-nS9HCdy$2rGY8>TF|VaHaD7yxGy@Vb<S-E>~}yRvE0G
zR=Q)%iIalVq%+7hw<&ZCBDmr;tx2nSWHYRlKrgjg7)RP{0xPuPG$DLyfyFHBPZF6W
zbVO-E6UBbJC8O>-qEw&>nT&HyYu4)gWG<?bQCU<o&8ipIWcA4bE4I7mS>^Pa{wyk~
z>gzW@b_2bnf^(|3N?FX$e2WSu&FTTC>ty`bU6T{LdR0o90dsTmQpZi_*K<`8$2kL3
zTDvSS)*mnMt7LtdB`w#4kG{1zItO^$(FJ-tbT%DscN!fWcgoYkJN5F$g*Q6Q@(zt^
zZr)eB$-3m-aS&S`;2uS5+*yR(l7`))P&4dSAnevnK~nA`Q1K)1E5Q*rC@C`luyDmQ
zD23yrN+hpGU-bRbxo?3_u){BQdQMJGk58b(FK2p=JE7jx`qL$#v}S?Eq`UaJiOJX0
zExTA2SLPA%kcJ88FV8oNM{O{+1FNslL(iB(&rm23dWIKz#`zzLhMq+VYSatVdy?XJ
z#NMw4n|5=!*5W`Km|C$cSKq>oVgjE)j+qco27)4B#3Z*gmc1OYCRt0j^KXbPd*8vm
zWA4!*&Lp=_EQ6)td@=WgkY2{tCzksaXA8T+6v@tt;|-4Jy~UI_s&%uj_9!p=`hJnI
zcPi@UiD86u2C!`I_Pdg$NaeH2Et%nmd5R_MlSEN?(~!S{RvBKfQC*)|Z3c1)b;cOt
z)O!jWDefS1$GZ5cHRD06ZhqC^x9y*@)c0qEHjiowjY4aAiAGz0%eI)uAO4^n6Cvl9
zg^LvFQ@z+n{WQ7@-y86i)Us>NM{^t~r)Q8_2gWvb$210wa&+>x{j_bwfuNJn;zHh$
zEa6y&Gqy4eAfjRBF^9wuCK7QCMYtEJRwd=zt$AFF87e-!?Wl0Scyzte9dk~c3=~y7
zno=qF93=N;R6&O(l&e(JIzcN#+~eTLo_=6R+UfZ~QY6fcMEt2GIioPCW!gW`W)ub~
z!e3@|vKB2M)GJ`PYn>i7al=<F_ZgLBU;TtMzXCuuB}%WW$K^6aD+Osm4w_%pszxQ-
z6E|aUAnhcMA^OY%xs3C;5MPo!VhGkh*ktkwONDi}UuF+4^xm_}z$s#Q!(f*GKr4nf
z99BhQgbkTt@`_5;zlk59zjlgbNt!H&d7!N}_+4;Z548qkt(~JafKZYp-+E7lhFWT#
zRKGGl%W!^V4dKJO`%=A_I_Y$)hi*#fQ-Gq6oo*M<dH^RfT;MI4r3XiJGaTglvT*%x
zdI2A10Uz?Y&K&BlNa`*WCQ^45P<Ms@hw;>1Ml|8cl{zT_*vr8TgNw)bwR*B)TjFaE
zIOt2q_!8A|K_k(9_sM9jt5iNJAm@=RRN=|Lf<zmg()jlr_04hH%9W-!=c4)7JQD%v
zwk~}+d>iA0s2He;<+4vZ<Xj+@RnDtkB?zMCMtw(kVArqmjIFv$_Hsoo!&_t9S;v<c
zBwRXrTiHkhl6s$!oL()FF`6vF#=~l+c@?Y#DMAktYlHmSD;~|NJfobueFkd%GP+QC
z##<c_&9z!O>RoxpTzyxjvz@a{c8(nCeAJ6^j)b|A+|r>$!ijdERR*pe;~WiJCApPX
zgd2dE?GRof)219}Xuyhpi`z?;zNc%uhm$s2F4Fcv%8HRw7%$#lh8b4j{*#c{0O!wk
zUkNGeT2Q{Z=9js6>91w9?#fP~I1tO2mT-Ol7|#$CWW22<A5dbN$FnqHEWfKQJhgN%
z&`9<TizM?tmWCjfaQLcR%v1Tg<0a9STp65nuyVJwk4xCi{arq2yDS~W(m(9Q14k=Y
z3XxWPcM$f6y<{L_h~de}@Cwq3<N+rCH#y6L){fnmWQoBtoXHDqAnGj~Ert#gQcNOF
zZ7IX##W6snjY`^Y6In=;jG@DWSdfSVEWa~(Q4GjQJE1@Z1xZmb0VT_ZolF=f{r`vo
zEinX-1O<vDc?1y7e_&6-tw-k1+ve<)f&-x;sR_|%9Vj8GiO{DUuz6Se%(9757{~H8
zs+Zk)t9Z$nK}KET|0Dor9P|2JEsf<l<2(UM0*oqI5OOX>yFRt!jA{`uMG|ou%Zj(~
z4>7z^FtQllNE8$RAT#L$E91@_FE1Ir*ajxTV82PkaV%|RoJ0q7-@+wg>Ox>jF(zMF
z5SjaI90nrN#wrkm?d{5h^YbE<#BWzN#_iY1WpHa)zpk!*mr<j!?V!^R0M*M<UV7iI
zjG(UCc?Xw^`GX0`WAefuaEXFBlXTKqdcTEx#r(k%xHSIW*&e8V{E67|>K!~NrY;ip
zgv1CR;z{C<Ye_5vXNswdhLtK=9&aP~HYQFO5tsvo5io5M|7Vu!@8AY8k~olECdBgr
z;kR&ER>;q4ruq*MGDxhY8TMV!{;iJa-`0sUjqTSuz6JZ;p<J#dqqLQ0!qr{jT*oD&
z;{TX^MX&nool9)N;X62UOdtV7oe{w~AQcMRCAr10G?Rwo#{?2Wc$F*}s+V~Uc4Y(P
zA&4T;fU^B@R{ZXmBDAI8ofC)yn`Yy$co+coAQY|cevnK_{{V{uwrY0+PlwHro9cI`
z#1F7g;KLw;cysmJLS2Tbj0dF7Wp%*^y4;Yjl-L0wz_B{6-8LOolC@sOIeh!Cq2T#&
zXM-;p!W>hEw9o8HWnsEl0L`xoRinG@ht7I_B#t-`1jzv!B<UZhk#I-q+s0%_*K!Yd
zX_4JZ&)vQJ{LNo4?hoNfR`m|M0XzE?;YaU2v#Q*p55@U!`TD$CdME0DFA*p5G!L+}
z{liG$&3bb8e~gayKpg|bUP}%<8SYUEcG6Vzi+!KbPvMWY=Bi^pVkjCKjz)}iR|g2l
z!3^M7`;Hcjl3(31yytj6)N98c;&SKuFWLDqY?I3TN<Z${<%<Gr=@W&L`*W<^b_Cv>
z>*xFC|H=VYK3i~z<s#?wB3oksr7F#T#Z$qOAUsj89%41fW+OqDcycn?emVS%IQaeP
zuu8RFB+zC(nd?q~Hh8?B;Wg5V=%MmEgTPl{kmmI!S1cDH#S$)359NY5&S37Kw?4uw
zYDO7S2kkM2pGcvfxV9g{>n~4+N06Ho)or-JJVOleC&OBI5Q5<RIAG>_^2}-UjdjGT
zhw`}9-~7J+_<vU##s3qLFkcdJ21{-xFR6i-5!pA%bPqpxAqSE%CIHA7qZdj--of2t
zOwb|ROs&|KdeU%*7?V<#)}OGK!9Gj|F!qm<gNqFKciMAdEZn!4F4#`NyeE7h{8XMp
z@^5tD`}V$G5UVok%)w<s*n{aBkPH05tq2V-sPDmijR@4jT62pzkKWo#jch<!z-LmS
zmmv&uXDX^#nYG8{J{TuyA?G@CnLH=tKG-KsA)YATiZTd;4{ZevrV+}je1|EFv4RQH
z>Hf=Xu*rVHwYGp}RNeVqlI$ceWEBHGb|`snn*8+fCGUe|bz9EUM=9PQA>IcW!#nwA
zWU~D!!}JF5>mYaUiR%rhdYN5wTRH9?0M-ya55hyz_N`(NRa$<m!@PU4#(<9FvGfGE
zww`QuGTfl!%Kd;O40al12wqEeMp}vglY|E-!)U`@Uh#4{jM$IlR*(7nJRscH&|YH!
z<xAk_E`Is)m5}fTweMQ}WokbhofY!YMY6S?6=F_pc}?Po1)2W`7%`O6wYZj%B-~N@
z;;fJW5We3J@uYA%&Q{Ei+^9LNtt5vNe8XRxuYSs6pvC@8Xw3wzZKMu3?~k<dzJuV*
z9Yg^;Hj`bDr6|Q73G~}cHbs{5J!k|Stnz4FZ)(PJ-E*`8*Q8NgRI`tXgF%n^O<|jO
zq*1K@9_^U;o3jh;13CQzbr_JS%nxThxfr?0c;|-u@P;Dzc@&UnkU@Tpc$*#Xr)37P
zFuhVR-%=jUrQ&Q@o9x7{&kC(g?^>oYK=mWfnp=qY79!~}AsRTenT)67`r;uw0?3An
z?Lt~{J!D4#%Quq$B4w@>rJG6}NLUSw+4U76ntiO*e>Zno)(k>w(7m-pwHqT;!Pp;p
z*R(Q(SRG-Q2k4Vn%LbP{<sV4%%*oem`b>1@f;2Hq(R`TJ>Z=`kS<s7ckt}`URZ1%y
z=zJJm)F%@+1imlX4K7%|5u8+ocxz(Cewa&JqY0VB>~eHrDDB;t{xnhiH(&WObLNxo
z)F%{9RQ#<i`)mAm#z1kVJ*K?$?yk4p$YnLxXD%FOP15<?vWBts84A2u2j<_xxnk-<
zVXsL#brqewL0=S~Cg82Sg@|CR$e?(an!F3^q%Nd$TUb{j6ZJ=EnYUJV=jRI-mTr8-
zW7%J~pD%(~x``DT-u}YLNcEa@uI>8!4sH=6i2=DJ@u#pnU_!hZC=7w6k@#a+s>{G>
zSRwS)^s0?tR8M^40?|LJgL+>WOtT@$))GVfbGl7ZqyD5~r>0^jh8AyVxb<be+RJ>E
z&S{T&k6rdoT~UTparN}`|7z`8;Gx{M_@415OdhEygOR-HG3n%y8Sf&G8KI<^F{fnE
z@vM|+q)9n6g;SlL=x9oe&{K%&rrS#;Cq1}s&Qa2IJbJmh`}4Sc-<avtue<$h-~49w
z|G&Pq*IIk;4{P;llQ!kPsLm)XHR_7=_%MTiX=`DOQP(n$4_5q3zwN2WUc>7<<&vvD
zbAVdAiGFiQd9k-hv-S|)DgaJ~z+0qJ8-{-xkg#o+MWp6qJamxc;{wazhcn(ewCRJl
z0rX|%W!|DywKbrpG}HNdBf0Jw_@uTjhF<BEmwHBKNK=&hI5F|iI$4pEtVm7pwluIY
zTD^*G5UQ&+tKx`3z>cyK<@XgIa>Az6%FsK^um6jD<Z$3*W!&^Vtq1=)ohL{SiAeK}
z6g-rtD<i*nptu${O`>P|6<G=@+;i2u=mUONGQ+zL_?l!|%3Ul~wg^r(xvwqqNqu{x
zq%drQ$9Z#pk6VADdy_*>d=lx^&xH;-6(;<Fg-uUA9=V%#4Z)1-Z_L%1$rO$?ub&&V
z8Fnpzr<&eEM7m3a)+L^tvc@NT_6~}IZ#SV<0Y0Nh*g>J<;#zID!RxI%DBEz3dZM&*
z2P)q+*X!4duKCeo?1m<%Ic0QY`@Lh$8Jf&>a_h)uiLM0|IjJ>T3SZmvrYQ*D5cUJ%
zcBH#b*pC+;N4i*^_fidA!TFD#%^Q{Jz8vE=Zd|g=$2w}R8Evm?zrc@87SIa3R0a2s
zdQC$*2f<7o`8n!$m*lFmN#_1r_swiRNVKEL<ym-YhkzD%ZE>cz%qiJpgCYN*OTUj>
zQ$S8%I4N{z;i8;)Q@)jRQ@}3TdlUK2_Hzdoe!RkM*-KcU0yjwAdb|Uw!smo#IAJfb
z3J+I_V}qJ9y^6j6Se~d_vw?77GBbZ+w?8jbUbx7hN||}WAW^O%kjhbQIOVUQd(4YU
zT9mc*R8h-IpkK5`mS1_5G7o=ANwoGs#nEt~@J>l;jLga96`tjff_Sn{@j5G?AN6h}
zwI$=8DXgPKQ#W34C)qC~*?aUiPgGK$sPvMT?#@f^cez~Pa(RPc`%i}LN^H{3z$YY<
z%FkO59&1?zvad&F59Dt%yIs(zLW_|RT;!SQ`m&7#97=A!A6rv!G1IKnls-R1do}<0
z9ZHP<$^XdL*&++Fx@DhL+gp%L&$S39SoYyoCU05!t677w`O&S8IL;D+UgUI>sJ-XI
zT`TVBq`p$x@+R{^UHtXT)kiFmS4zsahTnRNyx9JsNv~7seEUSMlP0&uw>oTlT}eY*
zX+zuVhBp0%HZoJB&J-<Simcfa1kLG9#wRMbdWfi>@PQ>tMT-I>RbGZLT7bRlU6Vig
z4<221tWBv6(7s!WyaNwPnzHw_k`zKcYD>Tw`Q@iH7MB}_oF%NC*w!`wW<meT8#c;k
z?%~@9Xr<i1sXfL0E0;~`DO6R?Uqh`w0M8YIwM$DJPYzxH0hKFqt%6G|FPdNJkzbb)
zysLhF&=Xc=)!KQqE}#AlhrO22y3)+5{fg8DeXhBV#pNb~?jl-|zjhHKQ*uBzsP)S&
zM6N%Ar#fY8=39i8hb&uX(<TF!J|}y%u0vK1+dVI)?Q~MB(^u%ohVIb*u0wI~C+HCw
zPCxs9U<F1ezrm|BjSR@j%mM?lJnRxDj2xV=Qo8MUSxYre-0C8DTK5sjO3d8`WI1L4
z(mf~aR}(5W9HXAZGjqL|r{jJwY~EqdqdRjZH3$sIy37ZJ6KO$~4KIj+D#8uC<0guo
z#Tm2s4{-I~TJY~x?iZhzzy2b%T@IP5M~|y|5~uSI@(NA-s(0_|(;_)c@zgQu(jbLq
zLeJ=<k?3&5^Sq#Bb>=Ecw*}%1al}M&LmrhQ*Kmv5qRcBv|7F7#VqR<WlR9q86~YBs
zW<I5R7P5Jw6PBq8&5;!&l6dSOv3TAejk?b6o_b-6gafk9To|F=*lsj}hIZHw**iIA
z#K=KIn{zz+C0|>=J_%oCqPR~xy9!!ac6%~1^S%BrgOXE?;V1RMAhGTJxsQrxo<1<j
znBMI2Zej`X;tF#mCqV+M)nxE2nK+nECJh#nv!dAVB1*{J8#Wz&?tb>B+_`FM_rIOH
z*H68s!n>4q^^IW`OD2nDl*Q7_>R?a3He>3w6LZx1yK65$)@c2m+p?dKtip_;c2DC~
zs|w!|tEMntQ(?ji$Mj$RVr}bu1OJsX)IMmFmtKmSUW$)iit}*qs+Z!e7j2+cGefP$
zSgj`DYP-_8SA|La!~vt84@yb@*?A$QF4U>xRLR+w^B(sv==q?U6jdMEn%nckU3=4f
zZs!ww<bl#=<bl#B3TInj-l5-A8y{94d7lA)GnX3^(f{7jSh$;h5Af#(_sWDYQV1eb
zL2_!ick|#z=oi-h>{ZA+DnJLn;v{}ibNEeb`NwJ^4eg-v8IdXOwFCM(7W6dZ$nwr4
zdCsSw>dGG{uBr~n@Ef`nLfot)ICCO!U(J5xY%(-G-EZFI;suQRSvD^`C-?hj+&wPv
z$T_LA|5-ls1~>$t`8Myk`C6f6sAJ1L`s~&GerB%%zUtH2wh0duJ<3;bhEh^rIa%4w
z?thf7I<RVs@yjcn>bS*wJA(x_e2B8yri}^?MSZ+u|Hr4{WG|_TL(WVJ04t~9VD3R2
zUJHzrR?ZkL!wi#I3^yeJ%S2+Dw=2!r($mMydZ-b}6N4S<r);*^1%BKWersWdIlx!{
z8|v-s<LTxaK(q38LlBg~NDb(;QSz~YFr6~0)x+ztiqKygH32mSfG*Uim><`|D$<|%
zQpNZ*F(Wl`pZSoHYZ<X|>{tu{R}4TK1K=VVfQ5k=Q~21(DPtGIKa-?Etci{oh8deT
zM3Ri6RSOwb06f_#17>1iPJIc66~<u2!)l&!VGz`cg`QFbb-hjT+<Z8fQ{4cVi$P`E
zNK_EZ8WGNIq;|LOu+p4|3A}tftymmJTpXHW`2Gb`%qyYAIl%NOW*CYvXh>soj+%oJ
z3P=+c9}~%r4*M}7niXfYS{%1sZh6sDXuq4FNnmj~9^ZgFP9>LK?Y<!o^L!g~#c_{%
zOTm?(4y?S0sz3a0!z-K)fG7tKtTB23%fB9Xv_J`383_2Z!?Fc>Q0T1f06-%_HC*!7
zgZm_KIOA=EK44nIgx<Qz2mnJAG63r#o5TqmF$ve`geb9zLu9oKS@BvR1Cy!4Y^Zt|
zJafJjykSEauToGvrA!M-Ru3&0i=?0TMWo?Lmll{NV`SQNP$JSAMj`{_qe!^X4BC8H
z1Dd)KG)t^Wp8f*LsP)hgV;}EA2(H;FOT)V`aaTT^0i<s4=Qiz#bm>NM1L9-Zj3~*#
z3uaNhN}<4}&^MvKqndlg-vTdYuVcrOT-=;z*-1vX$~gQqSOowLSUnYsPCN7U=(A@_
zM(^c5z3liaOv}W=i78v9{_D^s<GzbK7ID`WE}km@n2pj107t@blFWVB6h@T|brQj1
za9|PTwJ;P)CeUkHeK-}yY!Otv1%}|>F6jiGqYNW4S2FTc3V!1gm|r-GD6a65-O`cK
z_9x9)5WgMB53IZoSJ6#y4=@WO_n!sQ(Xn!m1O~~{udnO9tqcvZ6YdwVR<3teI{sIv
zMXR0{(*T1_0Su6HFoJKc{z~9kHa2#Msn3xtdRhj-reGJG&OJD>*j{wy8yF;mTRQ(%
zb`aW17mO<I81aji;{VPdN6ZBgKMbQO3L}n<+>osl@0vVFdqPtJplK2Sa5+V_vmxJ4
zYA1y?@6MH$eK4R$!hnut-4gzPV4W*j!LPX+jkd!$)ub!V%8&YP*4cCCNoJ*lO!z$;
z?p<!cJpuM!cdh?!*10xPVzNWrt=nbLnAD-8VOjGszMpljt>k;HtiIiJ9<o}GW4*Zj
z`&sADAJ2-MHWFoRu6q>90Pg~2;Eb|h0J?X67pr8toM{SXNS?rd!ke_i&=uIqf1RI>
zghw|9D?TQ6y=0cMpjH<jXs9!`iSO9o%=spkk<Fg?jvdk4zL%j!aZCX8O>lsWxsjv3
z-$a3`rib3JA{?QUw4YO;r$2;y1MF65{b}hOp6HF`xYGuL>%Zn2%`yytR8u^Fi#V!j
zUi<<sCN_>PQpmb4E_U5)%^)EG9)S(vnF$3Bz#&})%pAML#ze=vMu&f%#j*Y77APiq
zC|s3L?H7yBI3q;~(J~-ocP+o!a2nd#ZMYuHK#c^TVcb|3_S#rBixJNbcVjc+6Jp0I
z35a9n@FVbeh?fbMNg@XGhPAjno=fP_5%E3=QA~F1=erv_t0EF^-TrjJ11O;p^aSim
zt~*B@Eg&L#6^9KsOst4Fcuu9lqiQ^3tOldFnCQBW&~Q-AbDlUbEru#tI&?87>>N&a
z6$e2VgcKJBUD3f9B?<u1-r_h?3PFiOqO<g3MHAA+A*ras5aKxKl%-hFY*vcnNXhUk
l4vBuI1dSinB3a^)k}{wAE|QZ+29e<x51wVF9fPI@{tLgjP)+~<