Add palindromic number non-STL implementation

CMakeLists.txt

@@ -157,6 +157,7 @@ add_executable(
   "benchmark/first_missing_positive_benchmark.cpp"
   "benchmark/lru_cache_benchmark.cpp"
   "benchmark/palindrome_benchmark.cpp"
+  "benchmark/palindromic_number_benchmark.cpp"
 )
 target_link_libraries(
   benchmark

benchmark/palindromic_number_benchmark.cpp

@@ -0,0 +1,42 @@
+// Copyright (c) Omar Boukli-Hacene. All rights reserved.
+// Distributed under an MIT-style license that can be
+// found in the LICENSE file.
+
+// SPDX-License-Identifier: MIT
+
+#include <type_traits>
+
+#include <catch2/catch_test_macros.hpp>
+
+#include <nanobench.h>
+
+#include <nameof.hpp>
+
+#include "forfun/palindromic_number.hpp"
+
+inline constexpr int const p{1234554321};
+
+TEST_CASE(
+    "palindromic_number benchmarking", "[benchmark][palindromic_number]") {
+    static_assert(p >= 0 && p <= std::numeric_limits<decltype(p)>::max());
+
+    ankerl::nanobench::Bench()
+
+        .title("Palindromic number")
+
+        .run(
+            NAMEOF_RAW(forfun::palindromic_number::fast::is_palindrome).c_str(),
+            []() {
+                auto r{forfun::palindromic_number::fast::is_palindrome(p)};
+                ankerl::nanobench::doNotOptimizeAway(r);
+            })
+
+        .run(
+            NAMEOF_RAW(forfun::palindromic_number::stl::is_palindrome).c_str(),
+            []() {
+                auto r{forfun::palindromic_number::stl::is_palindrome(p)};
+                ankerl::nanobench::doNotOptimizeAway(r);
+            })
+
+        ;
+}

include/forfun/palindromic_number.hpp

@@ -10,6 +10,29 @@
 #ifndef FORFUN_PALINDROMIC_NUMBER_HPP_
 #define FORFUN_PALINDROMIC_NUMBER_HPP_
 
+namespace forfun::palindromic_number {
+
+namespace fast {
+
+[[nodiscard]] constexpr bool is_palindrome(int const n) noexcept {
+    int nn{0};
+    int d{n};
+    while (d > 0) {
+        nn = (nn * 10) + d % 10;
+        d /= 10;
+    }
+
+    return n == nn;
+}
+
+} // namespace fast
+
+namespace stl {
+
 [[nodiscard]] bool is_palindrome(int const n) noexcept;
 
+} // namespace stl
+
+} // namespace forfun::palindromic_number
+
 #endif // FORFUN_PALINDROMIC_NUMBER_HPP_

src/palindromic_number.cpp

@@ -8,6 +8,10 @@
 
 #include <cstdlib>
 
+namespace forfun::palindromic_number {
+
+namespace stl {
+
 [[nodiscard]] bool is_palindrome(int const n) noexcept {
     int nn{0};
     std::div_t d{.quot = n, .rem = 0};
@@ -18,3 +22,7 @@
 
     return n == nn;
 }
+
+} // namespace stl
+
+} // namespace forfun::palindromic_number

test/palindromic_number_test.cpp

@@ -12,7 +12,8 @@
 
 TEMPLATE_TEST_CASE_SIG(
     "palindromic_number", "", ((auto sut), sut),
-    (is_palindrome)) {
+    (forfun::palindromic_number::fast::is_palindrome),
+    (forfun::palindromic_number::stl::is_palindrome)) {
     SECTION("Palindromic numbers") {
         GIVEN("a palindromic number") {
             auto const [palindromic_number]{GENERATE(table<int>({