Skip to content
GitLab
Projects
Groups
Snippets
Help
Loading...
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
Open sidebar
emacs
emacs
Commits
e16696ba
Commit
e16696ba
authored
May 15, 1997
by
Karl Heuer
Browse files
(compute_trt_identity, compute_trt_shuffle): Add comments.
parent
37a44719
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
15 additions
and
0 deletions
+15
-0
src/casetab.c
src/casetab.c
+15
-0
No files found.
src/casetab.c
View file @
e16696ba
...
...
@@ -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
;
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment