summaryrefslogtreecommitdiff
path: root/Build/source
diff options
context:
space:
mode:
authorAndreas Scherer <andreas_tex@freenet.de>2023-05-26 17:16:52 +0000
committerAndreas Scherer <andreas_tex@freenet.de>2023-05-26 17:16:52 +0000
commit0df9406790fca20ef33fdbe106664e8324227be0 (patch)
tree323f6845d45c3b272473f89633f5f8411ac69a9f /Build/source
parent1492dc45e1e51976576c69810e3e765ef46c8804 (diff)
[CWEB] Fix page number for Aragon and Seidel.
Personal communication by DEK. git-svn-id: svn://tug.org/texlive/trunk@67222 c570f23f-e606-0410-a88d-b1316a301751
Diffstat (limited to 'Build/source')
-rw-r--r--Build/source/texk/web2c/cwebdir/ChangeLog4
-rw-r--r--Build/source/texk/web2c/cwebdir/examples/wordtest.w2
2 files changed, 5 insertions, 1 deletions
diff --git a/Build/source/texk/web2c/cwebdir/ChangeLog b/Build/source/texk/web2c/cwebdir/ChangeLog
index 8a8761e9c1b..4f602ec35a1 100644
--- a/Build/source/texk/web2c/cwebdir/ChangeLog
+++ b/Build/source/texk/web2c/cwebdir/ChangeLog
@@ -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.
diff --git a/Build/source/texk/web2c/cwebdir/examples/wordtest.w b/Build/source/texk/web2c/cwebdir/examples/wordtest.w
index 98de5aedc60..000166815d9 100644
--- a/Build/source/texk/web2c/cwebdir/examples/wordtest.w
+++ b/Build/source/texk/web2c/cwebdir/examples/wordtest.w
@@ -166,7 +166,7 @@ default: print_usage: fprintf(stderr,
@*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