Commit 14a51e76 for tesseract

commit 14a51e76577ca257df1a1de73fc4ed25eefe2f8b
Author: Stefan Weil <sw@weilnetz.de>
Date:   Tue Jul 21 14:27:43 2026 +0200

    Replace http:// by https:// for selected URLs

    Some of them were also updated to avoid redirects.

    Signed-off-by: Stefan Weil <sw@weilnetz.de>

diff --git a/CMakeLists.txt b/CMakeLists.txt
index a3444256..17cf7f64 100644
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -844,7 +844,7 @@ if(WIN32
    AND CLANG
    AND OPENMP_BUILD)
   # Workaround for "libomp.lib is not automatically added on Windows" see:
-  # http://lists.llvm.org/pipermail/openmp-dev/2015-August/000857.html
+  # https://lists.llvm.org/pipermail/openmp-dev/2015-August/000857.html
   target_link_libraries(libtesseract PRIVATE ${OpenMP_LIBRARY})
 endif()

diff --git a/configure.ac b/configure.ac
index a4ba9fd2..6b660c89 100644
--- a/configure.ac
+++ b/configure.ac
@@ -326,7 +326,7 @@ case "${host_os}" in
 esac

 # check whether to build tesseract with -fvisibility=hidden -fvisibility-inlines-hidden
-# http://gcc.gnu.org/wiki/Visibility
+# https://gcc.gnu.org/wiki/Visibility
 # https://groups.google.com/g/tesseract-dev/c/l2ZFrpgYkSc/m/_cdYSRDSXuUJ
 AC_MSG_CHECKING([--enable-visibility argument])
 AC_ARG_ENABLE([visibility],
diff --git a/src/ccstruct/linlsq.cpp b/src/ccstruct/linlsq.cpp
index 237b401c..92012a4e 100644
--- a/src/ccstruct/linlsq.cpp
+++ b/src/ccstruct/linlsq.cpp
@@ -246,7 +246,7 @@ double LLSQ::rms_orth(const FCOORD &dir) const {
 // uses this formula is http://web.mit.edu/18.06/www/Essays/tlsfit.pdf but
 // that is still a much more complex derivation. It seems Pearson had already
 // found this simple solution in 1901.
-// http://books.google.com/books?id=WXwvAQAAIAAJ&pg=PA559
+// https://books.google.com/books?id=WXwvAQAAIAAJ&pg=PA559
 FCOORD LLSQ::vector_fit() const {
   double x_var = x_variance();
   double y_var = y_variance();
diff --git a/src/ccutil/genericheap.h b/src/ccutil/genericheap.h
index e5977b55..adf35684 100644
--- a/src/ccutil/genericheap.h
+++ b/src/ccutil/genericheap.h
@@ -42,7 +42,7 @@ namespace tesseract {
 // to use Key::operator< to generate a MIN heap and KDPairDec defines
 // Pair::operator< to use Key::operator> to generate a MAX heap by reversing
 // all the comparisons.
-// See http://en.wikipedia.org/wiki/Heap_(data_structure) for more detail on
+// See https://en.wikipedia.org/wiki/Heap_(data_structure) for more detail on
 // the basic heap implementation.
 //
 // Insertion and removal are both O(log n) and, unlike the STL heap, an
diff --git a/src/ccutil/helpers.h b/src/ccutil/helpers.h
index fa2f38ec..0bedade1 100644
--- a/src/ccutil/helpers.h
+++ b/src/ccutil/helpers.h
@@ -67,7 +67,7 @@ inline const std::vector<std::string> split(const std::string &s, char c) {

 // A simple linear congruential random number generator,
 // using Knuth's constants from:
-// http://en.wikipedia.org/wiki/Linear_congruential_generator.
+// https://en.wikipedia.org/wiki/Linear_congruential_generator.
 class TRand {
 public:
   TRand() = default;
diff --git a/unittest/util/utf8/unicodetext.cc b/unittest/util/utf8/unicodetext.cc
index 22c5c276..04e55138 100644
--- a/unittest/util/utf8/unicodetext.cc
+++ b/unittest/util/utf8/unicodetext.cc
@@ -389,7 +389,7 @@ string UnicodeText::DebugString() const {

 // The implementation of const_iterator would be nicer if it
 // inherited from boost::iterator_facade
-// (http://boost.org/libs/iterator/doc/iterator_facade.html).
+// (https://www.boost.org/doc/libs/latest/libs/iterator/doc/iterator_facade.html).

 UnicodeText::const_iterator::const_iterator() : it_(nullptr) {}