From e16696bacc4aa567d04fa725cc4c1f2913d6e2c7 Mon Sep 17 00:00:00 2001 From: Karl Heuer Date: Thu, 15 May 1997 07:35:32 +0000 Subject: [PATCH] (compute_trt_identity, compute_trt_shuffle): Add comments. --- src/casetab.c | 15 +++++++++++++++ 1 file changed, 15 insertions(+) diff --git a/src/casetab.c b/src/casetab.c index adf871764f..c5a4e7a030 100644 --- a/src/casetab.c +++ b/src/casetab.c @@ -170,6 +170,15 @@ set_case_table (table, standard) 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 @@ compute_trt_identity (bytes, depth, trt, inverse) } } +/* 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; -- 2.20.1