[time.cal.month.nonmembers,time.cal.wd.nonmembers] Do not digress to Eucledian algorithm.

jensmaurer · jensmaurer · commit 2f3823a08cc9 · 2018-05-24T11:44:41.000+02:00
diff --git a/source/utilities.tex b/source/utilities.tex
@@ -21856,16 +21856,9 @@
 \begin{itemdescr}
 \pnum
 \returns
-\begin{codeblock}
-month{modulo(static_cast<long long>(unsigned{x}) + (y.count() - 1), 12) + 1}
-\end{codeblock}
-where \tcode{modulo(n, 12)} computes the remainder of \tcode{n} divided by 12 using Euclidean division.
-\begin{note}
-Given a divisor of 12, Euclidean division truncates towards negative infinity and
-always produces a remainder in the range of \crange{0}{11}.
-Assuming no overflow in the signed summation,
-this operation results in a \tcode{month} holding a value in the range \crange{1}{12} even if \tcode{!x.ok()}.
-\end{note}
+A \tcode{month} with \tcode{m_} equal to the sum of \tcode{unsigned\{x\}}
+and \tcode{y.count()}, reduced modulo 12 to an integer in the range
+\crange{1}{12}.
 \begin{example}
 \tcode{February + months\{11\} == January}.
 \end{example}
@@ -22564,16 +22557,9 @@
 \begin{itemdescr}
 \pnum
 \returns
-\begin{codeblock}
-weekday{modulo(static_cast<long long>(unsigned{x}) + y.count(), 7)}
-\end{codeblock}
-where \tcode{modulo(n, 7)} computes the remainder of \tcode{n} divided by 7 using Euclidean division.
-\begin{note}
-Given a divisor of 7, Euclidean division truncates towards negative infinity and
-always produces a remainder in the range of \crange{0}{6}.
-Assuming no overflow in the signed summation,
-this operation results in a \tcode{weekday} holding a value in the range \crange{0}{6} even if \tcode{!x.ok()}.
-\end{note}
+A \tcode{weekday} with \tcode{wd_} equal to the sum of \tcode{unsigned\{x\}}
+and \tcode{y.count()}, reduced modulo 7 to an integer in the range
+\crange{0}{6}.
 \begin{example}
 \tcode{Monday + days\{6\} == Sunday}.
 \end{example}
