d291df1e3f
data structures that scale better with large character sets, instead of arrays indexed by character value: - Sets of characters to delete/squeeze are stored in a new "cset" structure, which is implemented as a splay tree of extents. This structure has the ability to store character classes (ala wctype(3)), but this is not currently fully utilized. - Mappings between characters are stored in a new "cmap" structure, which is also a splay tree. - The parser no longer builds arrays containing all the characters in a particular class; instead, next() determines them on-the-fly using nextwctype(3).
8 lines
114 B
Makefile
8 lines
114 B
Makefile
# @(#)Makefile 8.1 (Berkeley) 6/6/93
|
|
# $FreeBSD$
|
|
|
|
PROG= tr
|
|
SRCS= cmap.c cset.c str.c tr.c
|
|
|
|
.include <bsd.prog.mk>
|