texlive[67222] Build/source/texk/web2c/cwebdir: [CWEB] Fix page

[commits+ascherer at tug.org]

Revision: 67222
          http://tug.org/svn/texlive?view=revision&revision=67222
Author:   ascherer
Date:     2023-05-26 19:16:52 +0200 (Fri, 26 May 2023)
Log Message:
-----------
[CWEB] Fix page number for Aragon and Seidel.

Personal communication by DEK.

Modified Paths:
--------------
    trunk/Build/source/texk/web2c/cwebdir/ChangeLog
    trunk/Build/source/texk/web2c/cwebdir/examples/wordtest.w

Modified: trunk/Build/source/texk/web2c/cwebdir/ChangeLog
===================================================================
--- trunk/Build/source/texk/web2c/cwebdir/ChangeLog	2023-05-25 23:43:15 UTC (rev 67221)
+++ trunk/Build/source/texk/web2c/cwebdir/ChangeLog	2023-05-26 17:16:52 UTC (rev 67222)
@@ -1,3 +1,7 @@
+2023-05-26  Andreas Scherer  <https://ascherer.github.io>
+
+	* examples/wordtest.w: Fix page number for Aragon and Seidel.
+
 2023-05-24  Andreas Scherer  <https://ascherer.github.io>
 
 	* refsort.ch: Make room for larger index entries.

Modified: trunk/Build/source/texk/web2c/cwebdir/examples/wordtest.w
===================================================================
--- trunk/Build/source/texk/web2c/cwebdir/examples/wordtest.w	2023-05-25 23:43:15 UTC (rev 67221)
+++ trunk/Build/source/texk/web2c/cwebdir/examples/wordtest.w	2023-05-26 17:16:52 UTC (rev 67222)
@@ -166,7 +166,7 @@
 @*Treaps. The most interesting part of this program is its sorting algorithm,
 which is based on the ``treap'' data structure of Aragon and Seidel
 [{\sl 30th IEEE Symposium on Foundations of Computer Science\/} (1989),
-540--546].
+540--545].
 @^Aragon, Cecilia Rodriguez@>@^Seidel, Raimund@>
 A treap is a binary tree whose nodes have two key fields. The primary
 key, which in our application is a word from the input, obeys