# HG changeset patch
# User Karl Heuer <kwzh@gnu.org>
# Date 863681732 0
# Node ID c407a3aca56f5c09c45b77cd471061b887fb65d5
# Parent  56a59138fa6c6fb42cd3318ca473a38e0b78459d
(compute_trt_identity, compute_trt_shuffle): Add comments.

diff -r 56a59138fa6c -r c407a3aca56f src/casetab.c
--- a/src/casetab.c	Thu May 15 05:18:28 1997 +0000
+++ b/src/casetab.c	Thu May 15 07:35:32 1997 +0000
@@ -170,6 +170,15 @@
   return table;
 }
 
+/* Using the scratch array at BYTES of which the first DEPTH elements
+   are already set, and using the multi-byte structure inherited from
+   TRT, make INVERSE be an identity mapping.  That is, for each slot
+   that's indexed by a single byte, store that byte in INVERSE.
+   Where TRT has a subtable, make a corresponding subtable in INVERSE
+   and recursively initialize that subtable so that its elements are
+   the multi-byte characters that correspond to the index bytes.
+   This is the first step in generating an inverse mapping.  */
+
 static void
 compute_trt_identity (bytes, depth, trt, inverse)
      unsigned char *bytes;
@@ -201,6 +210,12 @@
     }
 }
 
+/* Using the scratch array at BYTES of which the first DEPTH elements
+   are already set, permute the elements of INVERSE (which is initially
+   an identity mapping) so that it has one cycle for each equivalence
+   class induced by the translation table TRT.  IBASE is the lispy
+   version of the outermost (depth 0) instance of INVERSE.  */
+
 static void
 compute_trt_shuffle (bytes, depth, ibase, trt, inverse)
      unsigned char *bytes;