d/freebsd-dev
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
6ee5808be7
freebsd-dev/usr.bin/tr/extern.h

52 lines
2.2 KiB
C
Raw Normal View History

BSD 4.4 Lite Usr.bin Sources
1994-05-27 12:33:43 +00:00
/*-
* Copyright (c) 1991, 1993
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* @(#)extern.h 8.1 (Berkeley) 6/6/93
remove __P
2002-03-22 01:42:45 +00:00
* $FreeBSD$
BSD 4.4 Lite Usr.bin Sources
1994-05-27 12:33:43 +00:00
*/
Move the #include and #define's to the top of the file.
2002-06-14 15:56:52 +00:00
#include <limits.h>
Add support for multibyte characters. The challenge here was to use 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).
2004-07-09 02:08:07 +00:00
#define NCHARS_SB (UCHAR_MAX + 1) /* Number of single-byte characters. */
#define OOBCH -1 /* Out of band character value. */
Move the #include and #define's to the top of the file.
2002-06-14 15:56:52 +00:00
BSD 4.4 Lite Usr.bin Sources
1994-05-27 12:33:43 +00:00
typedef struct {
enum { STRING1, STRING2 } which;
No functional changes, just code reorganization from prev. commit, it makes one malloc unneeded, removes two bzero's and makes code more readable. "Bright ideas comes only _after_ commits."
2003-08-04 05:22:06 +00:00
enum { EOS, INFINITE, NORMAL, RANGE, SEQUENCE,
Add support for multibyte characters. The challenge here was to use 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).
2004-07-09 02:08:07 +00:00
CCLASS, CCLASS_UPPER, CCLASS_LOWER, SET } state;
int cnt; /* character count */
wint_t lastch; /* last character */
wctype_t cclass; /* character class from wctype() */
wint_t equiv[NCHARS_SB]; /* equivalence set */
wint_t *set; /* set of characters */
char *str; /* user's string */
BSD 4.4 Lite Usr.bin Sources
1994-05-27 12:33:43 +00:00
} STR;
Add support for multibyte characters. The challenge here was to use 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).
2004-07-09 02:08:07 +00:00
wint_t next(STR *);
This patch address two problems. 1st one is relatively minor: according our own manpage, upper and lower classes must be sorted, but currently not. 2nd one is serious: tr '[:lower:]' '[:upper:]' (and vice versa) currently works only if upper and lower classes have exact the same number of elements. When it is not true, like for many ISO8859-x locales which have bigger amount of lowercase letters, tr may do nasty things. See this page http://www.opengroup.org/onlinepubs/007908799/xcu/tr.html for detailed description of desired tr behaviour in such cases.
2003-08-03 02:23:39 +00:00
int charcoll(const void *, const void *);
Reference in New Issue Copy Permalink