bump deps

cmake/patches/0001-fix-skip-install-rules.patch

@@ -1,25 +1,25 @@
-From 857dc932fc32d3a1d30abac7724565812b446cd2 Mon Sep 17 00:00:00 2001
+From d924c3bf4d83e9ef3ce66a6ac1e80ef1cb7cc4ca Mon Sep 17 00:00:00 2001
 From: Ruslan Morozov <ruslan.y.morozov@gmail.com>
-Date: Thu, 8 Dec 2022 21:11:49 +0300
-Subject: [PATCH] fix skip install rules
+Date: Sat, 3 Jun 2023 12:21:15 +0300
+Subject: [PATCH] [PATCH] fix skip install rules
 
 ---
  include/BoostRoot.cmake | 2 +-
  1 file changed, 1 insertion(+), 1 deletion(-)
 
 diff --git a/tools/cmake/include/BoostRoot.cmake b/tools/cmake/include/BoostRoot.cmake
-index f2a51e1..a37f14d 100644
+index e93f907..f0380b3 100644
 --- a/tools/cmake/include/BoostRoot.cmake
 +++ b/tools/cmake/include/BoostRoot.cmake
-@@ -90,7 +90,7 @@ else()
+@@ -108,7 +108,7 @@ else()
    endif()
 
    set(BUILD_TESTING OFF)
--  set(CMAKE_SKIP_INSTALL_RULES ON)
-+  set(CMAKE_SKIP_INSTALL_RULES OFF)
+-  set(BOOST_SKIP_INSTALL_RULES ON)
++  set(BOOST_SKIP_INSTALL_RULES OFF)
 
  endif()
 
 -- 
-2.37.1 (Apple Git-137.1)
+2.39.2 (Apple Git-143)
 

src/expression_evaluator.cpp

@@ -424,6 +424,8 @@ Result ParseCallParamsImpl(const T& args, const P& params, bool& isSucceeded)
     int firstMandatoryIdx = -1;
     int prevNotFound = -1;
     int foundKwArgs = 0;
+    (void)foundKwArgs; // extremely odd bug in clang warning
+                       // Wunused-but-set-variable
 
     // Find all provided keyword args
     for (auto& argInfo : args)
@@ -441,7 +443,7 @@ Result ParseCallParamsImpl(const T& args, const P& params, bool& isSucceeded)
         {
             result.args[argInfo.name] = p->second;
             argsInfo[argIdx].state = Keyword;
-            ++ foundKwArgs;
+            ++foundKwArgs;
         }
         else
         {

src/robin_hood.h

@@ -36,7 +36,7 @@
 // see https://semver.org/
 #define ROBIN_HOOD_VERSION_MAJOR 3  // for incompatible API changes
 #define ROBIN_HOOD_VERSION_MINOR 11 // for adding functionality in a backwards-compatible manner
-#define ROBIN_HOOD_VERSION_PATCH 3  // for backwards-compatible bug fixes
+#define ROBIN_HOOD_VERSION_PATCH 5  // for backwards-compatible bug fixes
 
 #include <algorithm>
 #include <cstdlib>
@@ -206,7 +206,7 @@ static Counts& counts() {
 
 // workaround missing "is_trivially_copyable" in g++ < 5.0
 // See https://stackoverflow.com/a/31798726/48181
-#if defined(__GNUC__) && __GNUC__ < 5
+#if defined(__GNUC__) && __GNUC__ < 5 && !defined(__clang__)
 #    define ROBIN_HOOD_IS_TRIVIALLY_COPYABLE(...) __has_trivial_copy(__VA_ARGS__)
 #else
 #    define ROBIN_HOOD_IS_TRIVIALLY_COPYABLE(...) std::is_trivially_copyable<__VA_ARGS__>::value
@@ -1820,6 +1820,12 @@ class Table
                               InsertionState::key_found != idxAndState.second);
     }
 
+    template <typename... Args>
+    iterator emplace_hint(const_iterator position, Args&&... args) {
+        (void)position;
+        return emplace(std::forward<Args>(args)...).first;
+    }
+
     template <typename... Args>
     std::pair<iterator, bool> try_emplace(const key_type& key, Args&&... args) {
         return try_emplace_impl(key, std::forward<Args>(args)...);
@@ -1831,16 +1837,15 @@ class Table
     }
 
     template <typename... Args>
-    std::pair<iterator, bool> try_emplace(const_iterator hint, const key_type& key,
-                                          Args&&... args) {
+    iterator try_emplace(const_iterator hint, const key_type& key, Args&&... args) {
         (void)hint;
-        return try_emplace_impl(key, std::forward<Args>(args)...);
+        return try_emplace_impl(key, std::forward<Args>(args)...).first;
     }
 
     template <typename... Args>
-    std::pair<iterator, bool> try_emplace(const_iterator hint, key_type&& key, Args&&... args) {
+    iterator try_emplace(const_iterator hint, key_type&& key, Args&&... args) {
         (void)hint;
-        return try_emplace_impl(std::move(key), std::forward<Args>(args)...);
+        return try_emplace_impl(std::move(key), std::forward<Args>(args)...).first;
     }
 
     template <typename Mapped>
@@ -1854,27 +1859,36 @@ class Table
     }
 
     template <typename Mapped>
-    std::pair<iterator, bool> insert_or_assign(const_iterator hint, const key_type& key,
-                                               Mapped&& obj) {
+    iterator insert_or_assign(const_iterator hint, const key_type& key, Mapped&& obj) {
         (void)hint;
-        return insertOrAssignImpl(key, std::forward<Mapped>(obj));
+        return insertOrAssignImpl(key, std::forward<Mapped>(obj)).first;
     }
 
     template <typename Mapped>
-    std::pair<iterator, bool> insert_or_assign(const_iterator hint, key_type&& key, Mapped&& obj) {
+    iterator insert_or_assign(const_iterator hint, key_type&& key, Mapped&& obj) {
         (void)hint;
-        return insertOrAssignImpl(std::move(key), std::forward<Mapped>(obj));
+        return insertOrAssignImpl(std::move(key), std::forward<Mapped>(obj)).first;
     }
 
     std::pair<iterator, bool> insert(const value_type& keyval) {
         ROBIN_HOOD_TRACE(this)
         return emplace(keyval);
     }
 
+    iterator insert(const_iterator hint, const value_type& keyval) {
+        (void)hint;
+        return emplace(keyval).first;
+    }
+
     std::pair<iterator, bool> insert(value_type&& keyval) {
         return emplace(std::move(keyval));
     }
 
+    iterator insert(const_iterator hint, value_type&& keyval) {
+        (void)hint;
+        return emplace(std::move(keyval)).first;
+    }
+
     // Returns 1 if key is found, 0 otherwise.
     size_t count(const key_type& key) const { // NOLINT(modernize-use-nodiscard)
         ROBIN_HOOD_TRACE(this)
@@ -2308,13 +2322,14 @@ class Table
 
         auto const numElementsWithBuffer = calcNumElementsWithBuffer(max_elements);
 
-        // calloc also zeroes everything
+        // malloc & zero mInfo. Faster than calloc everything.
         auto const numBytesTotal = calcNumBytesTotal(numElementsWithBuffer);
         ROBIN_HOOD_LOG("std::calloc " << numBytesTotal << " = calcNumBytesTotal("
                                       << numElementsWithBuffer << ")")
         mKeyVals = reinterpret_cast<Node*>(
-            detail::assertNotNull<std::bad_alloc>(std::calloc(1, numBytesTotal)));
+            detail::assertNotNull<std::bad_alloc>(std::malloc(numBytesTotal)));
         mInfo = reinterpret_cast<uint8_t*>(mKeyVals + numElementsWithBuffer);
+        std::memset(mInfo, 0, numBytesTotal - numElementsWithBuffer * sizeof(Node));
 
         // set sentinel
         mInfo[numElementsWithBuffer] = 1;

src/template_parser.cpp

@@ -1,4 +1,5 @@
 #include "template_parser.h"
+#include "renderer.h"
 #include <boost/cast.hpp>
 
 namespace jinja2
@@ -203,7 +204,7 @@ StatementsParser::ParseResult StatementsParser::ParseEndFor(LexScanner&, Stateme
     {
         auto r = std::static_pointer_cast<ElseBranchStatement>(info.renderer);
         r->SetMainBody(info.compositions[0]);
-        elseRenderer = r;
+        elseRenderer = std::static_pointer_cast<IRendererBase>(r);
 
         statementsInfo.pop_back();
         info = statementsInfo.back();
@@ -246,7 +247,7 @@ StatementsParser::ParseResult StatementsParser::ParseElse(LexScanner& /*lexer*/,
 {
     auto renderer = std::make_shared<ElseBranchStatement>(ExpressionEvaluatorPtr<>());
     StatementInfo statementInfo = StatementInfo::Create(StatementInfo::ElseIfStatement, stmtTok);
-    statementInfo.renderer = renderer;
+    statementInfo.renderer = std::static_pointer_cast<IRendererBase>(renderer);
     statementsInfo.push_back(statementInfo);
     return ParseResult();
 }
@@ -262,7 +263,7 @@ StatementsParser::ParseResult StatementsParser::ParseElIf(LexScanner& lexer, Sta
 
     auto renderer = std::make_shared<ElseBranchStatement>(*valueExpr);
     StatementInfo statementInfo = StatementInfo::Create(StatementInfo::ElseIfStatement, stmtTok);
-    statementInfo.renderer = renderer;
+    statementInfo.renderer = std::static_pointer_cast<IRendererBase>(renderer);
     statementsInfo.push_back(statementInfo);
     return ParseResult();
 }

src/value_visitors.h

@@ -25,7 +25,7 @@ namespace detail
 template<typename V>
 struct RecursiveUnwrapper
 {
-    V* m_visitor;
+    V* m_visitor{};
 
     RecursiveUnwrapper(V* v)
         : m_visitor(v)

thirdparty/thirdparty-internal.cmake

@@ -18,7 +18,7 @@ include(FetchContent)
 FetchContent_Declare(
   Boost
   GIT_REPOSITORY https://github.com/boostorg/boost.git
-  GIT_TAG boost-1.80.0
+  GIT_TAG boost-1.82.0
   PATCH_COMMAND git apply --ignore-whitespace "${CMAKE_CURRENT_LIST_DIR}/../cmake/patches/0001-fix-skip-install-rules.patch" || true
 )
 FetchContent_MakeAvailable(Boost)