X-Git-Url: https://git.distorted.org.uk/~mdw/sgt/agedu/blobdiff_plain/c1065ef6db11830ffb544b5ffabe6af3e59688f6..19199555f89d30bc913539850089ecafe64af043:/tree.but

diff --git a/tree.but b/tree.but
index 2569075..45133f6 100644
--- a/tree.but
+++ b/tree.but
@@ -13,7 +13,7 @@ an arbitrary quadrant (i.e. a region both upward and leftward of a
 user-specified point).
 
 The program
-\W{http://www.chiark.greenend.org.uk/~sgtatham/agedu}\cw{agedu},
+\W{http://www.chiark.greenend.org.uk/~sgtatham/agedu/}\cw{agedu},
 which uses a data structure of this type for its on-disk index
 files, is used as a case study.
 
@@ -177,8 +177,8 @@ dependent on the dynamic updatability of the one-dimensional base
 structure, but the resulting structure is not dynamically updatable
 in turn, it follows that this technique cannot be applied twice: no
 analogous transformation will construct a \e{three}-dimensional
-struccture capable of counting the total weight of an octant
-\cw{\{x\_ <\_x0, y\_<\_y0, z\_<\_z0\}}. I know of no efficient way
+structure capable of counting the total weight of an octant
+\cw{\{x\_<\_x0, y\_<\_y0, z\_<\_z0\}}. I know of no efficient way
 to do that.
 
 The structure as described above uses \cw{O(N log N)} storage. Many
@@ -189,7 +189,7 @@ log N)} space is larger than you think!
 \C{application} An application: \cw{agedu}
 
 The application for which I developed this data structure is
-\W{http://www.chiark.greenend.org.uk/~sgtatham/agedu}\cw{agedu}, a
+\W{http://www.chiark.greenend.org.uk/~sgtatham/agedu/}\cw{agedu}, a
 program which scans a file system and indexes pathnames against
 last-access times (\q{atimes}, in Unix terminology) so as to be able
 to point out directories which take up a lot of disk space but whose