Update some references.

diff --git a/INSTALL b/INSTALL
index 1a0eb81c8db0468a1c3e924d472785e16b023500..07e7cf42613395608ab1a3cec6c8962b9fc849bc 100644 (file)
--- a/INSTALL
+++ b/INSTALL
@@ -14,8 +14,7 @@ The pkg-config utility is required for configuration, it can be downloaded
 from <http://pkg-config.freedesktop.org/>. Also, Python 3 is required.
 
 To build the GiNaC tutorial and reference manual the doxygen utility
-(it can be downloaded from http://www.stack.nl/~dimitri/doxygen) and
-TeX are necessary.
+(it can be downloaded from https://www.doxygen.nl/) and TeX are necessary.
 
 Known to work with:
  - Linux on x86 and x86_64 using

diff --git a/INSTALL.CMake b/INSTALL.CMake
index 3c3b433a516b9b026c0bd95b7507a5588bff76cc..c36c18fc9c85dc22d91fe2b87cedbb688ae60bde 100644 (file)
--- a/INSTALL.CMake
+++ b/INSTALL.CMake
@@ -11,8 +11,8 @@ PREREQUISITES
    skipped if you don't intend to use ginsh (i.e. you need the GiNaC library
    for compiling another piece of a software).
 7. (optional) To build the GiNaC tutorial and reference manual the doxygen
-   utility (it can be downloaded from http://www.stack.nl/~dimitri/doxygen)
-   and TeX are necessary.
+   utility (it can be downloaded from https://www.doxygen.nl/) and TeX are
+   necessary.
 
 INSTALLATION
 ============

diff --git a/check/time_antipode.cpp b/check/time_antipode.cpp
index ee543215fb5516a1949f0715a6151cc618fd5447..90617949e12ce2f0f75ef627ec1d73f66582c69d 100644 (file)
--- a/check/time_antipode.cpp
+++ b/check/time_antipode.cpp
@@ -12,7 +12,7 @@
  *  This program is based on work by
  *      Isabella Bierenbaum <bierenbaum@thep.physik.uni-mainz.de> and
  *      Dirk Kreimer <dkreimer@bu.edu>.
- *  For details, please see <http://www.arXiv.org/abs/hep-th/0111192>.
+ *  For details, please see <https://www.arXiv.org/abs/hep-th/0111192>.
  */
 
 /*

diff --git a/doc/examples/lanczos.cpp b/doc/examples/lanczos.cpp
index dcad1cb80beda81865a62f510ca906f759b882e8..4a09525aa5c623058f05f2f7d51d4bd5370fb04c 100644 (file)
--- a/doc/examples/lanczos.cpp
+++ b/doc/examples/lanczos.cpp
@@ -28,7 +28,7 @@
  * The value of g is taken to be equal to the order N.
  *
  * More details can be found at Wikipedia:
- * http://en.wikipedia.org/wiki/Lanczos_approximation.
+ * https://en.wikipedia.org/wiki/Lanczos_approximation.
  *
  * (C) 2006 Chris Dams
  *

diff --git a/doc/reference/Doxyfooter.in b/doc/reference/Doxyfooter.in
index 6901019be979328ab0a6181ab34e01a08e57ebb1..0a12741b21e137e13074e617863030347d164440 100644 (file)
--- a/doc/reference/Doxyfooter.in
+++ b/doc/reference/Doxyfooter.in
@@ -2,7 +2,7 @@
 <small><i>This page is part of the <b><a
 href="https://www.ginac.de/">GiNaC</a></b>
 developer's reference. It was generated automatically by <a
-href="http://www.stack.nl/~dimitri/doxygen/index.html">doxygen</a>. For
+href="https://www.doxygen.nl/">doxygen</a>. For
 an introduction, see the <a href="../tutorial/">tutorial</a>.</i></small>
 </body>
 </html>

diff --git a/doc/tutorial/ginac.texi b/doc/tutorial/ginac.texi
index 54fd09a69a2fb137d95ec5206b0390cb2aaba137..17080bc12fed595d3abd1aa2d46ccdd893e3c01d 100644 (file)
--- a/doc/tutorial/ginac.texi
+++ b/doc/tutorial/ginac.texi
@@ -4855,7 +4855,7 @@ presented this would be impractical.
 One solution to this dilemma is the @dfn{Visitor} design pattern,
 which is implemented in GiNaC (actually, Robert Martin's Acyclic Visitor
 variation, described in detail in
-@uref{http://objectmentor.com/publications/acv.pdf}). Instead of adding
+@uref{https://condor.depaul.edu/dmumaugh/OOT/Design-Principles/acv.pdf}). Instead of adding
 virtual functions to the class hierarchy to implement operations, GiNaC
 provides a single "bouncing" method @code{accept()} that takes an instance
 of a special @code{visitor} class and redirects execution to the one
@@ -8663,9 +8663,9 @@ inserted.  But it may be useful to remember that this is not what
 happens.  Knowing this will enable you to write much more efficient
 code.  If you still have an uncertain feeling with copy-on-write
 semantics, we recommend you have a look at the
-@uref{http://www.parashift.com/c++-faq-lite/, C++-FAQ lite} by
-Marshall Cline.  Chapter 16 covers this issue and presents an
-implementation which is pretty close to the one in GiNaC.
+@uref{https://isocpp.org/faq, C++-FAQ's} chapter on memory management.
+It covers this issue and presents an implementation which is pretty
+close to the one in GiNaC.
 
 
 @node Internal representation of products and sums, Package tools, Expressions are reference counted, Internal structures

diff --git a/ginac/ex.h b/ginac/ex.h
index b1e319d9bc47e7fb49e51fe5863625738b6e1aaa..702f281b4154403b511c9e3eb1249ccd9e312719 100644 (file)
--- a/ginac/ex.h
+++ b/ginac/ex.h
@@ -43,7 +43,7 @@ namespace GiNaC {
  *  of this class in every object file that makes use of our flyweights in
  *  order to guarantee proper initialization.  Hence we put it into this
  *  file which is included by every relevant file anyways.  This is modeled
- *  after section 27.4.2.1.6 of the C++ standard, where cout and friends are
+ *  after section [ios::Init] of the C++ standard, where cout and friends are
  *  set up.
  *
  *  @see utils.cpp */

diff --git a/ginac/power.cpp b/ginac/power.cpp
index ba7a66f4bc77cb912947fa06975b2ee801e304d9..5ccf21af4d4196bb2f3090e6b9904798dddfff67 100644 (file)
--- a/ginac/power.cpp
+++ b/ginac/power.cpp
@@ -140,7 +140,7 @@ void power::do_print_latex(const print_latex & c, unsigned level) const
 static void print_sym_pow(const print_context & c, const symbol &x, int exp)
 {
        // Optimal output of integer powers of symbols to aid compiler CSE.
-       // C.f. ISO/IEC 14882:2011, section 1.9 [intro execution], paragraph 15
+       // C.f. ISO/IEC 14882:2011, section 1.9 [intro.execution], paragraph 15
        // to learn why such a parenthesation is really necessary.
        if (exp == 1) {
                x.print(c);

diff --git a/ginac/utils.h b/ginac/utils.h
index b0f24d92e9d414bce8f643beb2a5383e0498ac94..9514dbbe44e28b93883baed739067d24ae0415fd 100644 (file)
--- a/ginac/utils.h
+++ b/ginac/utils.h
@@ -397,7 +397,7 @@ private:
        // Generates all distinct permutations of a multiset.
        // (Based on Aaron Williams' algorithm 1 from "Loopless Generation of
        // Multiset Permutations using a Constant Number of Variables by Prefix
-       // Shifts." <http://webhome.csc.uvic.ca/~haron/CoolMulti.pdf>)
+       // Shifts." <https://dl.acm.org/doi/pdf/10.5555/1496770.1496877>)
        struct coolmulti {
                // element of singly linked list
                struct element {