Updated version date, and modified a few comments.

Author: Bill-Gray

miscell.cpp

@@ -669,6 +669,6 @@ int pattern_match(const char* pattern, const char* string)
 const char *find_orb_version_jd( double *jd)
 {
     if( jd)
-      *jd = 2460629.5;
-    return( "2024 Nov 15");
+      *jd = 2460655.5;
+    return( "2024 Dec 11");
 }

shadow.cpp

@@ -32,10 +32,10 @@ I = 0.436 + 0.72 * mu - 0.16 mu^2
 
    where I = intensity and mu^2 = 1 - (r/R)^2,  r = distance from
 the center of the solar disk and R = radius of the solar disk.  It
-refers to a no-longer-available source,
+refers to :
 
 Youles, S. (2017). "PH3010: Solar Limb Darkening."
-https://twiki.ph.rhul.ac.uk/twiki/pub/Public/SamYoules/PH3010_Solar_limb_darkening.pdf
+https://twiki.ph.rhul.ac.uk/twiki/pub/Public/Solar_Limb_Darkening_Project/Solar_Limb_Darkening.pdf
 
    Two similar polynomials that include terms to mu^5 are given in
 

shellsor.cpp

@@ -158,15 +158,16 @@ void shellsort_r( void *base, const size_t n_elements, const size_t elem_size,
 
 #ifdef NOT_CURRENTLY_USED
 /*  https://sourceware.org/ml/libc-alpha/2008-12/msg00007.html mentions
-that, with the arguments given in the order used in glibc,  a non-recursive
-sort can be (and,  in glibc,  is) implemented just by using the recursive
-version.  The last "context" parameter is simply ignored on all
-architectures of which the author was aware.
+that, with the arguments given in the order used in glibc,  a non-re-entrant
+sort can be (and,  in glibc,  is) implemented simply by using the re-entrant
+version,  passing a NULL context pointer.  On all architectures of which the
+author was aware,  this can be done safely,  with the unused/unset NULL
+context pointer never getting used.
 
    It seems like an excellent idea.  The weird cast is essentially the one
 used for bsearch_ext() (see below),  and I am reasonably confident the
 following would work.  However,  I've not needed it yet and it is therefore
-untested and #ifdeffed out.  If I someday decide I need a non-recursive
+untested and #ifdeffed out.  If I someday decide I need a non-re-entrant
 sort,  I'll test it then. */
 
 void shellsort( void *base, const size_t n_elements, const size_t elem_size,