From 6ab1a268f151312bbd9c00e3326fac5fe3f4fafd Mon Sep 17 00:00:00 2001 From: kazuhiko Date: Wed, 6 Dec 2000 02:33:32 +0000 Subject: [PATCH] Initial revision --- src/casetab.h | 66 +++++++++++++ tests/automated/case-tests.el | Bin 0 -> 9333 bytes tests/automated/regexp-tests.el | 206 +++++++++++++++++++++++++++++++++++++++ 3 files changed, 272 insertions(+) create mode 100644 src/casetab.h create mode 100644 tests/automated/case-tests.el create mode 100644 tests/automated/regexp-tests.el diff --git a/src/casetab.h b/src/casetab.h new file mode 100644 index 0000000..fad321c --- /dev/null +++ b/src/casetab.h @@ -0,0 +1,66 @@ +/* XEmacs routines to deal with case tables. + Copyright (C) 2000 Yoshiki Hayashi. +This file is part of XEmacs. + +XEmacs is free software; you can redistribute it and/or modify it +under the terms of the GNU General Public License as published by the +Free Software Foundation; either version 2, or (at your option) any +later version. + +XEmacs is distributed in the hope that it will be useful, but WITHOUT +ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or +FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License +for more details. + +You should have received a copy of the GNU General Public License +along with XEmacs; see the file COPYING. If not, write to +the Free Software Foundation, Inc., 59 Temple Place - Suite 330, +Boston, MA 02111-1307, USA. */ + +/* Synched up with: Not in FSF. */ + +#ifndef INCLUDED_casetab_h_ +#define INCLUDED_casetab_h_ + +struct Lisp_Case_Table +{ + struct lcrecord_header header; + Lisp_Object downcase_table; + Lisp_Object upcase_table; + Lisp_Object case_canon_table; + Lisp_Object case_eqv_table; +}; +typedef struct Lisp_Case_Table Lisp_Case_Table; + +DECLARE_LRECORD (case_table, Lisp_Case_Table); +#define XCASE_TABLE(x) XRECORD (x, case_table, Lisp_Case_Table) +#define XSETCASE_TABLE(x, p) XSETRECORD (x, p, case_table) +#define CASE_TABLEP(x) RECORDP (x, case_table) +#define CHECK_CASE_TABLE(x) CHECK_RECORD (x, case_table) +#define CONCHECK_CASE_TABLE(x) CONCHECK_RECORD (x, case_table) + +#define CASE_TABLE_DOWNCASE(ct) ((ct)->downcase_table) +#define CASE_TABLE_UPCASE(ct) ((ct)->upcase_table) +#define CASE_TABLE_CANON(ct) ((ct)->case_canon_table) +#define CASE_TABLE_EQV(ct) ((ct)->case_eqv_table) +#define XCASE_TABLE_DOWNCASE(ct) (XCASE_TABLE (ct)->downcase_table) +#define XCASE_TABLE_UPCASE(ct) (XCASE_TABLE (ct)->upcase_table) +#define XCASE_TABLE_CANON(ct) (XCASE_TABLE (ct)->case_canon_table) +#define XCASE_TABLE_EQV(ct) (XCASE_TABLE (ct)->case_eqv_table) + +#define SET_CASE_TABLE_DOWNCASE(ct, p) ((ct)->downcase_table = p) +#define SET_CASE_TABLE_UPCASE(ct, p) ((ct)->upcase_table = p) +#define SET_CASE_TABLE_CANON(ct, p) ((ct)->case_canon_table = p) +#define SET_CASE_TABLE_EQV(ct, p) ((ct)->case_eqv_table = p) +#define XSET_CASE_TABLE_DOWNCASE(ct, p) \ + SET_CASE_TABLE_DOWNCASE (XCASE_TABLE (ct), p) +#define XSET_CASE_TABLE_UPCASE(ct, p) \ + SET_CASE_TABLE_UPCASE (XCASE_TABLE (ct), p) +#define XSET_CASE_TABLE_CANON(ct, p) \ + SET_CASE_TABLE_CANON (XCASE_TABLE (ct), p) +#define XSET_CASE_TABLE_EQV(ct, p) \ + SET_CASE_TABLE_EQV (XCASE_TABLE (ct), p) + +extern Lisp_Object Vstandard_case_table; + +#endif /* INCLUDED_casetab_h_ */ diff --git a/tests/automated/case-tests.el b/tests/automated/case-tests.el new file mode 100644 index 0000000000000000000000000000000000000000..2a294d541068e441deb9e0d32b7b6f35036b7b56 GIT binary patch literal 9333 zcmeHMcYNE%6;9J>bvNDfm2E1}5fqZL6kAH-(5z&$u|`Fzj#_sdfg=eE1ZWJ&>`GVC zJ(BLd(36RvV+dnG(_>+jc``-HAyLX4FsVR_m%AlC4 zW>h9YvrT#T?(scxnjQ}g;c(8ZH!Q7EbwJ7`A(Kj_V8-Gc3TD|^V-|-Q(=}A)Xr?g& zc|#c$tFo?BHLXclHtnjmqQL>yVE7-v*$wZ>dB=E-DfXyoRn8?bvrID_{P2w|%2}K_ zT%8nZ5z6_zv1VGTJqZrC9b2eUtZFutHJzh%P-m6{W*IJ+7ShE8?|&LClVP@R*c3EO z7ZhfI#Z}FAEUn}^2;u-U)H6*BYUs3b10RrN^Z~cPsdAKT)ohYMU-r)}!G4ZbF&!4% zlCCLmP*b>Jb6}_qJ+Z4?g;Ik+XhocJr+{lXZow+IY;-ncMgWzNm_vG6VAd%FNrGWU z19WsubFLSYmYpqgRL~3|wrbW<^(vyFfoqzsLy3cH^Rlat02)rXhw{Y(^Gij@&Mm{C z?BZf}uDCpflQGn;1ALWxP+G07YiJX)!(xWhKwr@6+3CgH0bG*Zmp_;|!yWTRNCsgoUNWh55qtC_n)t;yaQ+VtiQ^;XpE~97&|xp25o)KO1$^ zRj9I6j&W4Dwu+iDBz&Fp3ZP?fg)?>2s0br{(oBKv>m*2(n_pPY&+SK5^JOqhX9U(P z4SC|20-VB0FtO<}0^@t2$kAsU7Ida?kfGob!q`}91ooM>Lzy+3C6rVqoleW?vD8^3 zuvEwjGZDLCC`2N+F7%v)ITOQZz)WGrpOG_bHIDgZH732B!0bS3+gx^72?bl6_@YAD zH58%|(>14oYo)AhbIcg2HCL{KWILDw%u?mn<784$ZytS355dEwEF6tPLFzk0J9dEg zBh}anmnqHA-I?(T*vpcwQA5+g|B$2@y*7f_Ew9uq@1)4;)pH?cOsvb@n;u?mdr{ z6qT1NRqe=%UNg-4QOkDR)wN@dhd$u&;RinG!4HX_@UVwJ;*l3V>d}vR?Bg!F`0-D8 z;**~Il&3!J>Cd?2(q}&F+0S|I^Pc~L7ryAlFL~+9UjB+#zUtMNz2>!-U-7!vzu}E< zdh=V}`nI>fzyHG@|Mcg- zTz%zV|MvHP{PSP`zA9$?8h`xSL~_Vad$)eFU6b9HyZ7|W{sZ~@oPTh3Zhqmui-qFS z{SIBQeE*Z;nh$^EqaQo|@lSm6Q=k6KXFvD(FMRP!U;fHhzxMTST=UIuefvA#{oeOO zuJLMUT(t#2VmVrk+aPIFF+GZgRKR`Si6T&av4!lY2dV!;v zCswe~KitsyS9b6K zCzsrEnOn4dv^S6V1cs&mcYW6;$P*A87zn|QUh;|C>;_a+)fhGnPBB+QHA;^2Gw^;o34Val*&iF ztCFyXh`QeRAjXKp@c=&Bh=U?ABRsSb%&1U?ITLmd;`Sz6J5$&FGwN}1NEPhE!YZ12 zVy9ti4qnZnOPeQ*NCU49=p@XNVx8YaL6g!G-2`24#|d#cv#amyO-nt#A*mg+yQQ*Y zo)^N}k2SR~F=fTe#&~1X^UT%j0AvGiAwoeb((Z-FQ$v6NT{u`W%l-UuIZXf$~ zHq7HFX14n*JJsRA_8b47AV4dk$FFWPMuI; zokH?!ljP+p|R!ydaEHRCf)-(&>^k^&I=ywENH0$ zAt_#eBJB3Nl87#lI`58yN!L1@;rEImK?#2+PlQE!asaSQ`&<<5P%k121)@^2N#^$5 zUCfV7i#9ae5GvIC5KB4!bVdjDMhDXP)(lQY!+H0UAhB z53hx})`1lzFTE90Hjm%S04&<{Zd%5B4?G_xnArZ>0<4?n3KlsT>zjlbNEakQ;W%As zFC9S=Mx9j!X8ZL?k1B +;; Maintainer: Yoshiki Hayashi +;; Created: 2000 +;; Keywords: tests + +;; This file is part of XEmacs. + +;; XEmacs is free software; you can redistribute it and/or modify it +;; under the terms of the GNU General Public License as published by +;; the Free Software Foundation; either version 2, or (at your option) +;; any later version. + +;; XEmacs is distributed in the hope that it will be useful, but +;; WITHOUT ANY WARRANTY; without even the implied warranty of +;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU +;; General Public License for more details. + +;; You should have received a copy of the GNU General Public License +;; along with XEmacs; see the file COPYING. If not, write to the Free +;; Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA +;; 02111-1307, USA. + +;;; Synched up with: Not in FSF. + +;;; Commentary: + +;; Test regular expression. + +(Check-Error-Message error "Trailing backslash" + (string-match "\\" "a")) +(Check-Error-Message error "Invalid preceding regular expression" + (string-match "a++" "a")) +(Check-Error-Message error "Invalid preceding regular expression" + (string-match "a**" "a")) +(Check-Error-Message error "Invalid preceding regular expression" + (string-match "a???" "a")) +(Check-Error-Message error "Unmatched \\[ or \\[^" + (string-match "[" "a")) +(Check-Error-Message error "Unmatched \\[ or \\[^" + (string-match "[abc" "a")) +(Check-Error-Message error "Unmatched ) or \\\\)" + (string-match "\\)" "a")) +(Check-Error-Message error "Invalid regular expression" + (string-match "\\(?.\\)" "a")) +(Check-Error-Message error "Unmatched \\\\{" + (string-match "a\\{" "a")) +(Check-Error-Message error "Invalid content of \\\\{\\\\}" + (string-match "a\\{a\\}" "a")) + +;; exactn + +;; string-match +(with-temp-buffer + ;; case-insensitive + (Assert (string-match "ä" "ä")) + (Assert (string-match "ä" "Ä")) + (Assert (string-match "Ä" "Ä")) + (Assert (string-match "Ä" "ä")) + ;; case-sensitive + (setq case-fold-search nil) + (Assert (string-match "ä" "ä")) + (Assert (not (string-match "ä" "Ä"))) + (Assert (string-match "Ä" "Ä")) + (Assert (not (string-match "Ä" "ä")))) + +;; looking-at +(with-temp-buffer + (insert "äÄ") + ;; case-insensitive + (goto-char (point-min)) + (Assert (looking-at "ä")) + (Assert (looking-at "Ä")) + (forward-char) + (Assert (looking-at "ä")) + (Assert (looking-at "Ä")) + ;; case-sensitive + (setq case-fold-search nil) + (goto-char (point-min)) + (Assert (looking-at "ä")) + (Assert (not (looking-at "Ä"))) + (forward-char) + (Assert (not (looking-at "ä"))) + (Assert (looking-at "Ä"))) + +;; re-search-forward and re-search-backward +(with-temp-buffer + (insert "äÄ") + ;; case insensitive + ;; forward + (goto-char (point-min)) + ;; Avoid trivial regexp. + (Assert (eq 2 (re-search-forward "ä\\|a" nil t))) + (goto-char (point-min)) + (Assert (eq 2 (re-search-forward "Ä\\|a" nil t))) + (goto-char (1+ (point-min))) + (Assert (eq 3 (re-search-forward "ä\\|a" nil t))) + (goto-char (1+ (point-min))) + (Assert (eq 3 (re-search-forward "Ä\\|a" nil t))) + ;; backward + (goto-char (point-max)) + (Assert (eq 2 (re-search-backward "ä\\|a" nil t))) + (goto-char (point-max)) + (Assert (eq 2 (re-search-backward "Ä\\|a" nil t))) + (goto-char (1- (point-max))) + (Assert (eq 1 (re-search-backward "ä\\|a" nil t))) + (goto-char (1- (point-max))) + (Assert (eq 1 (re-search-backward "Ä\\|a" nil t))) + ;; case sensitive + (setq case-fold-search nil) + ;; forward + (goto-char (point-min)) + (Assert (eq 2 (re-search-forward "ä\\|a" nil t))) + (goto-char (point-min)) + (Assert (eq 3 (re-search-forward "Ä\\|a" nil t))) + (goto-char (1+ (point-min))) + (Assert (not (re-search-forward "ä\\|a" nil t))) + (goto-char (1+ (point-min))) + (Assert (eq 3 (re-search-forward "Ä\\|a" nil t))) + ;; backward + (goto-char (point-max)) + (Assert (eq 1 (re-search-backward "ä\\|a" nil t))) + (goto-char (point-max)) + (Assert (eq 2 (re-search-backward "Ä\\|a" nil t))) + (goto-char (1- (point-max))) + (Assert (eq 1 (re-search-backward "ä\\|a" nil t))) + (goto-char (1- (point-max))) + (Assert (not (re-search-backward "Ä\\|a" nil t)))) + +;; duplicate +(with-temp-buffer + ;; case insensitive + (Assert (string-match "^\\(ä\\)\\1$" "ää")) + (Assert (string-match "^\\(ä\\)\\1$" "äÄ")) + (Assert (string-match "^\\(ä\\)\\1$" "ÄÄ")) + (Assert (string-match "^\\(ä\\)\\1$" "Ää")) + (Assert (string-match "^\\(Ä\\)\\1$" "ää")) + (Assert (string-match "^\\(Ä\\)\\1$" "äÄ")) + (Assert (string-match "^\\(Ä\\)\\1$" "ÄÄ")) + (Assert (string-match "^\\(Ä\\)\\1$" "Ää")) + ;; case sensitive + (setq case-fold-search nil) + (Assert (string-match "^\\(ä\\)\\1$" "ää")) + (Assert (not (string-match "^\\(ä\\)\\1$" "äÄ"))) + (Assert (not (string-match "^\\(ä\\)\\1$" "ÄÄ"))) + (Assert (not (string-match "^\\(ä\\)\\1$" "Ää"))) + (Assert (not (string-match "^\\(Ä\\)\\1$" "ää"))) + (Assert (not (string-match "^\\(Ä\\)\\1$" "äÄ"))) + (Assert (string-match "^\\(Ä\\)\\1$" "ÄÄ")) + (Assert (not (string-match "^\\(Ä\\)\\1$" "Ää")))) + +;; charset, charset_not +;; Not called because it takes too much time. +(defun test-regexp-charset-paranoid () + (let ((i 0) + (max (expt 2 (if (featurep 'mule) 19 8))) + (range "[a-z]") + (range-not "[^a-z]") + char string) + (while (< i max) + (when (setq char (int-to-char i)) + (setq string (char-to-string char)) + (if (or (and (<= 65 i) + (<= i 90)) + (and (<= 97 i) + (<= i 122))) + (progn + (Assert (string-match range string)) + (Assert (not (string-match range-not string)))) + (Assert (not (string-match range string))) + (Assert (string-match range-not string)))) + (setq i (1+ i))))) + +;; (test-regexp-charset-paranoid) + +;; charset_mule, charset_mule_not +;; Not called because it takes too much time. +(defun test-regex-charset-mule-paranoid () + (if (featurep 'mule) + (let ((i 0) + (max (expt 2 19)) + (range (format "[%c-%c]" + (make-char 'japanese-jisx0208 36 34) + (make-char 'japanese-jisx0208 36 42))) + (range-not (format "[^%c-%c]" + (make-char 'japanese-jisx0208 36 34) + (make-char 'japanese-jisx0208 36 42))) + (min-int (char-to-int (make-char 'japanese-jisx0208 36 34))) + (max-int (char-to-int (make-char 'japanese-jisx0208 36 42))) + char string) + (while (< i max) + (when (setq char (int-to-char i)) + (setq string (char-to-string char)) + (if (and (<= min-int i) + (<= i max-int)) + (progn + (Assert (string-match range string)) + (Assert (not (string-match range-not string)))) + (Assert (not (string-match range string))) + (Assert (string-match range-not string)))) + (setq i (1+ i)))))) + +;; (test-regex-charset-mule-paranoid) -- 1.7.10.4