From fd80dad6285286db5be6d2588cc7ddb624db7e5a Mon Sep 17 00:00:00 2001
From: Martin Leitner-Ankerl <martin.ankerl@gmail.com>
Date: Sun, 16 Jul 2023 14:58:33 +0200
Subject: [PATCH] update to 4.0.4 now that #79 is (really) resolved

---
 CMakeLists.txt                   | 2 +-
 include/ankerl/unordered_dense.h | 6 +++---
 meson.build                      | 2 +-
 test/unit/namespace.cpp          | 2 +-
 4 files changed, 6 insertions(+), 6 deletions(-)

diff --git a/CMakeLists.txt b/CMakeLists.txt
index 08b654b3..f6bebce4 100644
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -1,6 +1,6 @@
 cmake_minimum_required(VERSION 3.12)
 project("unordered_dense"
-    VERSION 4.0.3
+    VERSION 4.0.4
     DESCRIPTION "A fast & densely stored hashmap and hashset based on robin-hood backward shift deletion"
     HOMEPAGE_URL "https://github.com/martinus/unordered_dense")
 
diff --git a/include/ankerl/unordered_dense.h b/include/ankerl/unordered_dense.h
index 6b320fbc..1ff50f78 100644
--- a/include/ankerl/unordered_dense.h
+++ b/include/ankerl/unordered_dense.h
@@ -1,7 +1,7 @@
 ///////////////////////// ankerl::unordered_dense::{map, set} /////////////////////////
 
 // A fast & densely stored hashmap and hashset based on robin-hood backward shift deletion.
-// Version 4.0.3
+// Version 4.0.4
 // https://github.com/martinus/unordered_dense
 //
 // Licensed under the MIT License <http://opensource.org/licenses/MIT>.
@@ -32,7 +32,7 @@
 // see https://semver.org/spec/v2.0.0.html
 #define ANKERL_UNORDERED_DENSE_VERSION_MAJOR 4 // NOLINT(cppcoreguidelines-macro-usage) incompatible API changes
 #define ANKERL_UNORDERED_DENSE_VERSION_MINOR 0 // NOLINT(cppcoreguidelines-macro-usage) backwards compatible functionality
-#define ANKERL_UNORDERED_DENSE_VERSION_PATCH 3 // NOLINT(cppcoreguidelines-macro-usage) backwards compatible bug fixes
+#define ANKERL_UNORDERED_DENSE_VERSION_PATCH 4 // NOLINT(cppcoreguidelines-macro-usage) backwards compatible bug fixes
 
 // API versioning with inline namespace, see https://www.foonathan.net/2018/11/inline-namespaces/
 
@@ -1232,7 +1232,7 @@ class table : public std::conditional_t<is_map_v<T>, base_table_type_map<T>, bas
 
                 // copy_buckets sets m_buckets, m_num_buckets, m_max_bucket_capacity, m_shifts
                 copy_buckets(other);
-                // clear's the other's buckets so other is now already usable. 
+                // clear's the other's buckets so other is now already usable.
                 other.clear_buckets();
                 m_hash = other.m_hash;
                 m_equal = other.m_equal;
diff --git a/meson.build b/meson.build
index a2707794..599c6b27 100644
--- a/meson.build
+++ b/meson.build
@@ -18,7 +18,7 @@
 #
 
 project('unordered_dense', 'cpp',
-    version: '4.0.3',
+    version: '4.0.4',
     license: 'MIT',
     default_options : [
         'cpp_std=c++17', 
diff --git a/test/unit/namespace.cpp b/test/unit/namespace.cpp
index 7b7bd7e9..20a09247 100644
--- a/test/unit/namespace.cpp
+++ b/test/unit/namespace.cpp
@@ -2,7 +2,7 @@
 
 #include <doctest.h>
 
-namespace versioned_namespace = ankerl::unordered_dense::v4_0_3;
+namespace versioned_namespace = ankerl::unordered_dense::v4_0_4;
 
 static_assert(std::is_same_v<versioned_namespace::map<int, int>, ankerl::unordered_dense::map<int, int>>);
 static_assert(std::is_same_v<versioned_namespace::hash<int>, ankerl::unordered_dense::hash<int>>);