srfi-14.c 57 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130
  1. /* Copyright 2001,2004,2006-2007,2009,2011,2018-2019
  2. Free Software Foundation, Inc.
  3. This file is part of Guile.
  4. Guile is free software: you can redistribute it and/or modify it
  5. under the terms of the GNU Lesser General Public License as published
  6. by the Free Software Foundation, either version 3 of the License, or
  7. (at your option) any later version.
  8. Guile is distributed in the hope that it will be useful, but WITHOUT
  9. ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  10. FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
  11. License for more details.
  12. You should have received a copy of the GNU Lesser General Public
  13. License along with Guile. If not, see
  14. <https://www.gnu.org/licenses/>. */
  15. #ifdef HAVE_CONFIG_H
  16. # include <config.h>
  17. #endif
  18. #include <stdio.h>
  19. #include <string.h>
  20. #include <unictype.h>
  21. #include "boolean.h"
  22. #include "chars.h"
  23. #include "eval.h"
  24. #include "gsubr.h"
  25. #include "list.h"
  26. #include "modules.h"
  27. #include "numbers.h"
  28. #include "pairs.h"
  29. #include "ports.h"
  30. #include "procs.h"
  31. #include "smob.h"
  32. #include "strings.h"
  33. #include "symbols.h"
  34. #include "values.h"
  35. #include "srfi-14.h"
  36. /* Include the pre-computed standard charset data. */
  37. #include "srfi-14.i.c"
  38. scm_t_char_range cs_full_ranges[] = {
  39. {0x0000, SCM_CODEPOINT_SURROGATE_START - 1}
  40. ,
  41. {SCM_CODEPOINT_SURROGATE_END + 1, SCM_CODEPOINT_MAX}
  42. };
  43. scm_t_char_set cs_full = {
  44. 2,
  45. cs_full_ranges
  46. };
  47. #define SCM_CHARSET_DATA(charset) ((scm_t_char_set *) SCM_SMOB_DATA (charset))
  48. #define SCM_CHARSET_SET(cs, idx) \
  49. scm_i_charset_set (SCM_CHARSET_DATA (cs), idx)
  50. #define SCM_CHARSET_UNSET(cs, idx) \
  51. scm_i_charset_unset (SCM_CHARSET_DATA (cs), idx)
  52. /* Smob type code for character sets. */
  53. int scm_tc16_charset = 0;
  54. int scm_tc16_charset_cursor = 0;
  55. /* True if N exists in charset CS. */
  56. int
  57. scm_i_charset_get (scm_t_char_set *cs, scm_t_wchar n)
  58. {
  59. size_t i;
  60. i = 0;
  61. while (i < cs->len)
  62. {
  63. if (cs->ranges[i].lo <= n && n <= cs->ranges[i].hi)
  64. return 1;
  65. i++;
  66. }
  67. return 0;
  68. }
  69. /* Put N into charset CS. */
  70. void
  71. scm_i_charset_set (scm_t_char_set *cs, scm_t_wchar n)
  72. {
  73. size_t i;
  74. size_t len;
  75. len = cs->len;
  76. i = 0;
  77. while (i < len)
  78. {
  79. /* Already in this range */
  80. if (cs->ranges[i].lo <= n && n <= cs->ranges[i].hi)
  81. {
  82. return;
  83. }
  84. if (n == cs->ranges[i].lo - 1)
  85. {
  86. /* This char is one below the current range. */
  87. if (i > 0 && cs->ranges[i - 1].hi + 1 == n)
  88. {
  89. /* It is also one above the previous range. */
  90. /* This is an impossible condition: in the previous
  91. iteration, the test for 'one above the current range'
  92. should already have inserted the character here. */
  93. abort ();
  94. }
  95. else
  96. {
  97. /* Expand the range down by one. */
  98. cs->ranges[i].lo = n;
  99. return;
  100. }
  101. }
  102. else if (n == cs->ranges[i].hi + 1)
  103. {
  104. /* This char is one above the current range. */
  105. if (i < len - 1 && cs->ranges[i + 1].lo - 1 == n)
  106. {
  107. /* It is also one below the next range, so combine them. */
  108. cs->ranges[i].hi = cs->ranges[i + 1].hi;
  109. if (i < len - 2)
  110. memmove (cs->ranges + (i + 1), cs->ranges + (i + 2),
  111. sizeof (scm_t_char_range) * (len - i - 2));
  112. cs->ranges = scm_gc_realloc (cs->ranges,
  113. sizeof (scm_t_char_range) * len,
  114. sizeof (scm_t_char_range) * (len -
  115. 1),
  116. "character-set");
  117. cs->len = len - 1;
  118. return;
  119. }
  120. else
  121. {
  122. /* Expand the range up by one. */
  123. cs->ranges[i].hi = n;
  124. return;
  125. }
  126. }
  127. else if (n < cs->ranges[i].lo - 1)
  128. {
  129. /* This is a new range below the current one. */
  130. cs->ranges = scm_gc_realloc (cs->ranges,
  131. sizeof (scm_t_char_range) * len,
  132. sizeof (scm_t_char_range) * (len + 1),
  133. "character-set");
  134. memmove (cs->ranges + (i + 1), cs->ranges + i,
  135. sizeof (scm_t_char_range) * (len - i));
  136. cs->ranges[i].lo = n;
  137. cs->ranges[i].hi = n;
  138. cs->len = len + 1;
  139. return;
  140. }
  141. i++;
  142. }
  143. /* This is a new range above all previous ranges. */
  144. if (len == 0)
  145. {
  146. cs->ranges = scm_gc_malloc (sizeof (scm_t_char_range), "character-set");
  147. }
  148. else
  149. {
  150. cs->ranges = scm_gc_realloc (cs->ranges,
  151. sizeof (scm_t_char_range) * len,
  152. sizeof (scm_t_char_range) * (len + 1),
  153. "character-set");
  154. }
  155. cs->ranges[len].lo = n;
  156. cs->ranges[len].hi = n;
  157. cs->len = len + 1;
  158. return;
  159. }
  160. /* Put LO to HI inclusive into charset CS. */
  161. static void
  162. scm_i_charset_set_range (scm_t_char_set *cs, scm_t_wchar lo, scm_t_wchar hi)
  163. {
  164. size_t i;
  165. i = 0;
  166. while (i < cs->len)
  167. {
  168. /* Already in this range */
  169. if (cs->ranges[i].lo <= lo && cs->ranges[i].hi >= hi)
  170. return;
  171. /* cur: +---+
  172. new: +---+
  173. */
  174. if (cs->ranges[i].lo - 1 > hi)
  175. {
  176. /* Add a new range below the current one. */
  177. cs->ranges = scm_gc_realloc (cs->ranges,
  178. sizeof (scm_t_char_range) * cs->len,
  179. sizeof (scm_t_char_range) * (cs->len + 1),
  180. "character-set");
  181. memmove (cs->ranges + (i + 1), cs->ranges + i,
  182. sizeof (scm_t_char_range) * (cs->len - i));
  183. cs->ranges[i].lo = lo;
  184. cs->ranges[i].hi = hi;
  185. cs->len += 1;
  186. return;
  187. }
  188. /* cur: +---+ or +---+ or +---+
  189. new: +---+ +---+ +---+
  190. */
  191. if (cs->ranges[i].lo > lo
  192. && (cs->ranges[i].lo - 1 <= hi && cs->ranges[i].hi >= hi))
  193. {
  194. cs->ranges[i].lo = lo;
  195. return;
  196. }
  197. /* cur: +---+ or +---+ or +---+
  198. new: +---+ +---+ +---+
  199. */
  200. else if (cs->ranges[i].hi + 1 >= lo && cs->ranges[i].hi < hi)
  201. {
  202. if (cs->ranges[i].lo > lo)
  203. cs->ranges[i].lo = lo;
  204. if (cs->ranges[i].hi < hi)
  205. cs->ranges[i].hi = hi;
  206. while (i < cs->len - 1)
  207. {
  208. /* cur: --+ +---+
  209. new: -----+
  210. */
  211. if (cs->ranges[i + 1].lo - 1 > hi)
  212. break;
  213. /* cur: --+ +---+ or --+ +---+ or --+ +--+
  214. new: -----+ ------+ ---------+
  215. */
  216. /* Combine this range with the previous one. */
  217. if (cs->ranges[i + 1].hi > hi)
  218. cs->ranges[i].hi = cs->ranges[i + 1].hi;
  219. if (i + 1 < cs->len)
  220. memmove (cs->ranges + i + 1, cs->ranges + i + 2,
  221. sizeof (scm_t_char_range) * (cs->len - i - 2));
  222. cs->ranges = scm_gc_realloc (cs->ranges,
  223. sizeof (scm_t_char_range) * cs->len,
  224. sizeof (scm_t_char_range) * (cs->len - 1),
  225. "character-set");
  226. cs->len -= 1;
  227. }
  228. return;
  229. }
  230. i ++;
  231. }
  232. /* This is a new range above all previous ranges. */
  233. if (cs->len == 0)
  234. {
  235. cs->ranges = scm_gc_malloc (sizeof (scm_t_char_range), "character-set");
  236. }
  237. else
  238. {
  239. cs->ranges = scm_gc_realloc (cs->ranges,
  240. sizeof (scm_t_char_range) * cs->len,
  241. sizeof (scm_t_char_range) * (cs->len + 1),
  242. "character-set");
  243. }
  244. cs->len += 1;
  245. cs->ranges[cs->len - 1].lo = lo;
  246. cs->ranges[cs->len - 1].hi = hi;
  247. return;
  248. }
  249. /* If N is in charset CS, remove it. */
  250. void
  251. scm_i_charset_unset (scm_t_char_set *cs, scm_t_wchar n)
  252. {
  253. size_t i;
  254. size_t len;
  255. len = cs->len;
  256. i = 0;
  257. while (i < len)
  258. {
  259. if (n < cs->ranges[i].lo)
  260. /* Not in this set. */
  261. return;
  262. if (n == cs->ranges[i].lo && n == cs->ranges[i].hi)
  263. {
  264. /* Remove this one-character range. */
  265. if (len == 1)
  266. {
  267. scm_gc_free (cs->ranges,
  268. sizeof (scm_t_char_range) * cs->len,
  269. "character-set");
  270. cs->ranges = NULL;
  271. cs->len = 0;
  272. return;
  273. }
  274. else if (i < len - 1)
  275. {
  276. memmove (cs->ranges + i, cs->ranges + (i + 1),
  277. sizeof (scm_t_char_range) * (len - i - 1));
  278. cs->ranges = scm_gc_realloc (cs->ranges,
  279. sizeof (scm_t_char_range) * len,
  280. sizeof (scm_t_char_range) * (len -
  281. 1),
  282. "character-set");
  283. cs->len = len - 1;
  284. return;
  285. }
  286. else if (i == len - 1)
  287. {
  288. cs->ranges = scm_gc_realloc (cs->ranges,
  289. sizeof (scm_t_char_range) * len,
  290. sizeof (scm_t_char_range) * (len -
  291. 1),
  292. "character-set");
  293. cs->len = len - 1;
  294. return;
  295. }
  296. }
  297. else if (n == cs->ranges[i].lo)
  298. {
  299. /* Shrink this range from the left. */
  300. cs->ranges[i].lo = n + 1;
  301. return;
  302. }
  303. else if (n == cs->ranges[i].hi)
  304. {
  305. /* Shrink this range from the right. */
  306. cs->ranges[i].hi = n - 1;
  307. return;
  308. }
  309. else if (n > cs->ranges[i].lo && n < cs->ranges[i].hi)
  310. {
  311. /* Split this range into two pieces. */
  312. cs->ranges = scm_gc_realloc (cs->ranges,
  313. sizeof (scm_t_char_range) * len,
  314. sizeof (scm_t_char_range) * (len + 1),
  315. "character-set");
  316. if (i < len - 1)
  317. memmove (cs->ranges + (i + 2), cs->ranges + (i + 1),
  318. sizeof (scm_t_char_range) * (len - i - 1));
  319. cs->ranges[i + 1].hi = cs->ranges[i].hi;
  320. cs->ranges[i + 1].lo = n + 1;
  321. cs->ranges[i].hi = n - 1;
  322. cs->len = len + 1;
  323. return;
  324. }
  325. i++;
  326. }
  327. /* This value is above all ranges, so do nothing here. */
  328. return;
  329. }
  330. static int
  331. charsets_equal (scm_t_char_set *a, scm_t_char_set *b)
  332. {
  333. if (a->len != b->len)
  334. return 0;
  335. /* Empty charsets may have ranges == NULL. We must avoid passing
  336. NULL to memcmp, even if the length is zero, to avoid undefined
  337. behavior. */
  338. if (a->len == 0)
  339. return 1;
  340. if (memcmp (a->ranges, b->ranges, sizeof (scm_t_char_range) * a->len) != 0)
  341. return 0;
  342. return 1;
  343. }
  344. /* Return true if every character in A is also in B. */
  345. static int
  346. charsets_leq (scm_t_char_set *a, scm_t_char_set *b)
  347. {
  348. size_t i = 0, j = 0;
  349. scm_t_wchar alo, ahi;
  350. if (a->len == 0)
  351. return 1;
  352. if (b->len == 0)
  353. return 0;
  354. while (i < a->len)
  355. {
  356. alo = a->ranges[i].lo;
  357. ahi = a->ranges[i].hi;
  358. while (b->ranges[j].hi < alo)
  359. {
  360. if (j < b->len - 1)
  361. j++;
  362. else
  363. return 0;
  364. }
  365. if (alo < b->ranges[j].lo || ahi > b->ranges[j].hi)
  366. return 0;
  367. i++;
  368. }
  369. return 1;
  370. }
  371. /* Merge B into A. */
  372. static void
  373. charsets_union (scm_t_char_set *a, scm_t_char_set *b)
  374. {
  375. size_t i = 0;
  376. scm_t_wchar blo, bhi;
  377. if (b->len == 0)
  378. return;
  379. if (a->len == 0)
  380. {
  381. a->len = b->len;
  382. a->ranges = scm_gc_malloc (sizeof (scm_t_char_range) * b->len,
  383. "character-set");
  384. memcpy (a->ranges, b->ranges, sizeof (scm_t_char_range) * b->len);
  385. return;
  386. }
  387. while (i < b->len)
  388. {
  389. blo = b->ranges[i].lo;
  390. bhi = b->ranges[i].hi;
  391. scm_i_charset_set_range (a, blo, bhi);
  392. i++;
  393. }
  394. return;
  395. }
  396. /* Remove elements not both in A and B from A. */
  397. static void
  398. charsets_intersection (scm_t_char_set *a, scm_t_char_set *b)
  399. {
  400. size_t i = 0;
  401. scm_t_wchar blo, bhi, n;
  402. scm_t_char_set *c;
  403. if (a->len == 0)
  404. return;
  405. if (b->len == 0)
  406. {
  407. scm_gc_free (a->ranges, sizeof (scm_t_char_range) * a->len,
  408. "character-set");
  409. a->len = 0;
  410. return;
  411. }
  412. c = (scm_t_char_set *) scm_malloc (sizeof (scm_t_char_set));
  413. c->len = 0;
  414. c->ranges = NULL;
  415. while (i < b->len)
  416. {
  417. blo = b->ranges[i].lo;
  418. bhi = b->ranges[i].hi;
  419. for (n = blo; n <= bhi; n++)
  420. if (scm_i_charset_get (a, n))
  421. scm_i_charset_set (c, n);
  422. i++;
  423. }
  424. scm_gc_free (a->ranges, sizeof (scm_t_char_range) * a->len,
  425. "character-set");
  426. a->len = c->len;
  427. if (c->len != 0)
  428. a->ranges = c->ranges;
  429. else
  430. a->ranges = NULL;
  431. free (c);
  432. return;
  433. }
  434. #define SCM_ADD_RANGE(low, high) \
  435. do { \
  436. p->ranges[idx].lo = (low); \
  437. p->ranges[idx++].hi = (high); \
  438. } while (0)
  439. #define SCM_ADD_RANGE_SKIP_SURROGATES(low, high) \
  440. do { \
  441. p->ranges[idx].lo = (low); \
  442. p->ranges[idx++].hi = SCM_CODEPOINT_SURROGATE_START - 1; \
  443. p->ranges[idx].lo = SCM_CODEPOINT_SURROGATE_END + 1; \
  444. p->ranges[idx++].hi = (high); \
  445. } while (0)
  446. /* Make P the compelement of Q. */
  447. static void
  448. charsets_complement (scm_t_char_set *p, scm_t_char_set *q)
  449. {
  450. int k, idx;
  451. idx = 0;
  452. if (q->len == 0)
  453. {
  454. /* Fill with all valid codepoints. */
  455. p->len = 2;
  456. p->ranges = scm_gc_malloc (sizeof (scm_t_char_range) * 2,
  457. "character-set");
  458. SCM_ADD_RANGE_SKIP_SURROGATES (0, SCM_CODEPOINT_MAX);
  459. return;
  460. }
  461. if (p->len > 0)
  462. scm_gc_free (p->ranges, sizeof (scm_t_char_set) * p->len,
  463. "character-set");
  464. /* Count the number of ranges needed for the output. */
  465. p->len = 0;
  466. if (q->ranges[0].lo > 0)
  467. p->len++;
  468. if (q->ranges[q->len - 1].hi < SCM_CODEPOINT_MAX)
  469. p->len++;
  470. p->len += q->len;
  471. p->ranges =
  472. (scm_t_char_range *) scm_gc_malloc (sizeof (scm_t_char_range) * p->len,
  473. "character-set");
  474. if (q->ranges[0].lo > 0)
  475. {
  476. if (q->ranges[0].lo > SCM_CODEPOINT_SURROGATE_END)
  477. SCM_ADD_RANGE_SKIP_SURROGATES (0, q->ranges[0].lo - 1);
  478. else
  479. SCM_ADD_RANGE (0, q->ranges[0].lo - 1);
  480. }
  481. for (k = 1; k < q->len; k++)
  482. {
  483. if (q->ranges[k - 1].hi < SCM_CODEPOINT_SURROGATE_START
  484. && q->ranges[k].lo - 1 > SCM_CODEPOINT_SURROGATE_END)
  485. SCM_ADD_RANGE_SKIP_SURROGATES (q->ranges[k - 1].hi + 1, q->ranges[k].lo - 1);
  486. else
  487. SCM_ADD_RANGE (q->ranges[k - 1].hi + 1, q->ranges[k].lo - 1);
  488. }
  489. if (q->ranges[q->len - 1].hi < SCM_CODEPOINT_MAX)
  490. {
  491. if (q->ranges[q->len - 1].hi < SCM_CODEPOINT_SURROGATE_START)
  492. SCM_ADD_RANGE_SKIP_SURROGATES (q->ranges[q->len - 1].hi + 1, SCM_CODEPOINT_MAX);
  493. else
  494. SCM_ADD_RANGE (q->ranges[q->len - 1].hi + 1, SCM_CODEPOINT_MAX);
  495. }
  496. return;
  497. }
  498. #undef SCM_ADD_RANGE
  499. #undef SCM_ADD_RANGE_SKIP_SURROGATES
  500. /* Replace A with elements only found in one of A or B. */
  501. static void
  502. charsets_xor (scm_t_char_set *a, scm_t_char_set *b)
  503. {
  504. size_t i = 0;
  505. scm_t_wchar blo, bhi, n;
  506. if (b->len == 0)
  507. {
  508. return;
  509. }
  510. if (a->len == 0)
  511. {
  512. a->ranges =
  513. (scm_t_char_range *) scm_gc_malloc (sizeof (scm_t_char_range) *
  514. b->len, "character-set");
  515. a->len = b->len;
  516. memcpy (a->ranges, b->ranges, sizeof (scm_t_char_range) * a->len);
  517. return;
  518. }
  519. while (i < b->len)
  520. {
  521. blo = b->ranges[i].lo;
  522. bhi = b->ranges[i].hi;
  523. for (n = blo; n <= bhi; n++)
  524. {
  525. if (scm_i_charset_get (a, n))
  526. scm_i_charset_unset (a, n);
  527. else
  528. scm_i_charset_set (a, n);
  529. }
  530. i++;
  531. }
  532. return;
  533. }
  534. /* Smob print hook for character sets. */
  535. static int
  536. charset_print (SCM charset, SCM port, scm_print_state *pstate SCM_UNUSED)
  537. {
  538. size_t i;
  539. int first = 1;
  540. scm_t_char_set *p;
  541. const size_t max_ranges_to_print = 50;
  542. p = SCM_CHARSET_DATA (charset);
  543. scm_puts ("#<charset {", port);
  544. for (i = 0; i < p->len; i++)
  545. {
  546. if (first)
  547. first = 0;
  548. else
  549. scm_puts (" ", port);
  550. scm_write (SCM_MAKE_CHAR (p->ranges[i].lo), port);
  551. if (p->ranges[i].lo != p->ranges[i].hi)
  552. {
  553. scm_puts ("..", port);
  554. scm_write (SCM_MAKE_CHAR (p->ranges[i].hi), port);
  555. }
  556. if (i >= max_ranges_to_print)
  557. {
  558. /* Too many to print here. Quit early. */
  559. scm_puts (" ...", port);
  560. break;
  561. }
  562. }
  563. scm_puts ("}>", port);
  564. return 1;
  565. }
  566. /* Smob print hook for character sets cursors. */
  567. static int
  568. charset_cursor_print (SCM cursor, SCM port,
  569. scm_print_state *pstate SCM_UNUSED)
  570. {
  571. scm_t_char_set_cursor *cur;
  572. cur = (scm_t_char_set_cursor *) SCM_SMOB_DATA (cursor);
  573. scm_puts ("#<charset-cursor ", port);
  574. if (cur->range == (size_t) (-1))
  575. scm_puts ("(empty)", port);
  576. else
  577. {
  578. scm_write (scm_from_size_t (cur->range), port);
  579. scm_puts (":", port);
  580. scm_write (scm_from_int32 (cur->n), port);
  581. }
  582. scm_puts (">", port);
  583. return 1;
  584. }
  585. /* Create a new, empty character set. */
  586. static SCM
  587. make_char_set (const char *func_name)
  588. {
  589. scm_t_char_set *p;
  590. p = scm_gc_malloc (sizeof (scm_t_char_set), "character-set");
  591. memset (p, 0, sizeof (scm_t_char_set));
  592. SCM_RETURN_NEWSMOB (scm_tc16_charset, p);
  593. }
  594. SCM_DEFINE (scm_char_set_p, "char-set?", 1, 0, 0,
  595. (SCM obj),
  596. "Return @code{#t} if @var{obj} is a character set, @code{#f}\n"
  597. "otherwise.")
  598. #define FUNC_NAME s_scm_char_set_p
  599. {
  600. return scm_from_bool (SCM_SMOB_PREDICATE (scm_tc16_charset, obj));
  601. }
  602. #undef FUNC_NAME
  603. SCM_DEFINE (scm_char_set_eq, "char-set=", 0, 0, 1,
  604. (SCM char_sets),
  605. "Return @code{#t} if all given character sets are equal.")
  606. #define FUNC_NAME s_scm_char_set_eq
  607. {
  608. int argnum = 1;
  609. scm_t_char_set *cs1_data = NULL;
  610. SCM_VALIDATE_REST_ARGUMENT (char_sets);
  611. while (!scm_is_null (char_sets))
  612. {
  613. SCM csi = SCM_CAR (char_sets);
  614. scm_t_char_set *csi_data;
  615. SCM_VALIDATE_SMOB (argnum, csi, charset);
  616. argnum++;
  617. csi_data = SCM_CHARSET_DATA (csi);
  618. if (cs1_data == NULL)
  619. cs1_data = csi_data;
  620. else if (!charsets_equal (cs1_data, csi_data))
  621. return SCM_BOOL_F;
  622. char_sets = SCM_CDR (char_sets);
  623. }
  624. return SCM_BOOL_T;
  625. }
  626. #undef FUNC_NAME
  627. SCM_DEFINE (scm_char_set_leq, "char-set<=", 0, 0, 1,
  628. (SCM char_sets),
  629. "Return @code{#t} if every character set @var{char_set}i is a subset\n"
  630. "of character set @var{char_set}i+1.")
  631. #define FUNC_NAME s_scm_char_set_leq
  632. {
  633. int argnum = 1;
  634. scm_t_char_set *prev_data = NULL;
  635. SCM_VALIDATE_REST_ARGUMENT (char_sets);
  636. while (!scm_is_null (char_sets))
  637. {
  638. SCM csi = SCM_CAR (char_sets);
  639. scm_t_char_set *csi_data;
  640. SCM_VALIDATE_SMOB (argnum, csi, charset);
  641. argnum++;
  642. csi_data = SCM_CHARSET_DATA (csi);
  643. if (prev_data)
  644. {
  645. if (!charsets_leq (prev_data, csi_data))
  646. return SCM_BOOL_F;
  647. }
  648. prev_data = csi_data;
  649. char_sets = SCM_CDR (char_sets);
  650. }
  651. return SCM_BOOL_T;
  652. }
  653. #undef FUNC_NAME
  654. SCM_DEFINE (scm_char_set_hash, "char-set-hash", 1, 1, 0,
  655. (SCM cs, SCM bound),
  656. "Compute a hash value for the character set @var{cs}. If\n"
  657. "@var{bound} is given and non-zero, it restricts the\n"
  658. "returned value to the range 0 @dots{} @var{bound} - 1.")
  659. #define FUNC_NAME s_scm_char_set_hash
  660. {
  661. const unsigned long default_bnd = 871;
  662. unsigned long bnd;
  663. scm_t_char_set *p;
  664. unsigned long val = 0;
  665. int k;
  666. scm_t_wchar c;
  667. SCM_VALIDATE_SMOB (1, cs, charset);
  668. if (SCM_UNBNDP (bound))
  669. bnd = default_bnd;
  670. else
  671. {
  672. bnd = scm_to_ulong (bound);
  673. if (bnd == 0)
  674. bnd = default_bnd;
  675. }
  676. p = SCM_CHARSET_DATA (cs);
  677. for (k = 0; k < p->len; k++)
  678. {
  679. for (c = p->ranges[k].lo; c <= p->ranges[k].hi; c++)
  680. val = c + (val << 1);
  681. }
  682. return scm_from_ulong (val % bnd);
  683. }
  684. #undef FUNC_NAME
  685. SCM_DEFINE (scm_char_set_cursor, "char-set-cursor", 1, 0, 0,
  686. (SCM cs), "Return a cursor into the character set @var{cs}.")
  687. #define FUNC_NAME s_scm_char_set_cursor
  688. {
  689. scm_t_char_set *cs_data;
  690. scm_t_char_set_cursor *cur_data;
  691. SCM_VALIDATE_SMOB (1, cs, charset);
  692. cs_data = SCM_CHARSET_DATA (cs);
  693. cur_data =
  694. (scm_t_char_set_cursor *) scm_gc_malloc (sizeof (scm_t_char_set_cursor),
  695. "charset-cursor");
  696. if (cs_data->len == 0)
  697. {
  698. cur_data->range = (size_t) (-1);
  699. cur_data->n = 0;
  700. }
  701. else
  702. {
  703. cur_data->range = 0;
  704. cur_data->n = cs_data->ranges[0].lo;
  705. }
  706. SCM_RETURN_NEWSMOB (scm_tc16_charset_cursor, cur_data);
  707. }
  708. #undef FUNC_NAME
  709. SCM_DEFINE (scm_char_set_ref, "char-set-ref", 2, 0, 0,
  710. (SCM cs, SCM cursor),
  711. "Return the character at the current cursor position\n"
  712. "@var{cursor} in the character set @var{cs}. It is an error to\n"
  713. "pass a cursor for which @code{end-of-char-set?} returns true.")
  714. #define FUNC_NAME s_scm_char_set_ref
  715. {
  716. scm_t_char_set *cs_data;
  717. scm_t_char_set_cursor *cur_data;
  718. size_t i;
  719. SCM_VALIDATE_SMOB (1, cs, charset);
  720. SCM_VALIDATE_SMOB (2, cursor, charset_cursor);
  721. cs_data = SCM_CHARSET_DATA (cs);
  722. cur_data = (scm_t_char_set_cursor *) SCM_SMOB_DATA (cursor);
  723. /* Validate that this cursor is still true. */
  724. i = cur_data->range;
  725. if (i == (size_t) (-1)
  726. || i >= cs_data->len
  727. || cur_data->n < cs_data->ranges[i].lo
  728. || cur_data->n > cs_data->ranges[i].hi)
  729. SCM_MISC_ERROR ("invalid character set cursor: ~A", scm_list_1 (cursor));
  730. return SCM_MAKE_CHAR (cur_data->n);
  731. }
  732. #undef FUNC_NAME
  733. SCM_DEFINE (scm_char_set_cursor_next, "char-set-cursor-next", 2, 0, 0,
  734. (SCM cs, SCM cursor),
  735. "Advance the character set cursor @var{cursor} to the next\n"
  736. "character in the character set @var{cs}. It is an error if the\n"
  737. "cursor given satisfies @code{end-of-char-set?}.")
  738. #define FUNC_NAME s_scm_char_set_cursor_next
  739. {
  740. scm_t_char_set *cs_data;
  741. scm_t_char_set_cursor *cur_data;
  742. size_t i;
  743. SCM_VALIDATE_SMOB (1, cs, charset);
  744. SCM_VALIDATE_SMOB (2, cursor, charset_cursor);
  745. cs_data = SCM_CHARSET_DATA (cs);
  746. cur_data = (scm_t_char_set_cursor *) SCM_SMOB_DATA (cursor);
  747. /* Validate that this cursor is still true. */
  748. i = cur_data->range;
  749. if (i == (size_t) (-1)
  750. || i >= cs_data->len
  751. || cur_data->n < cs_data->ranges[i].lo
  752. || cur_data->n > cs_data->ranges[i].hi)
  753. SCM_MISC_ERROR ("invalid character set cursor: ~A", scm_list_1 (cursor));
  754. /* Increment the cursor. */
  755. if (cur_data->n == cs_data->ranges[i].hi)
  756. {
  757. if (i + 1 < cs_data->len)
  758. {
  759. cur_data->range = i + 1;
  760. cur_data->n = cs_data->ranges[i + 1].lo;
  761. }
  762. else
  763. {
  764. /* This is the end of the road. */
  765. cur_data->range = (size_t) (-1);
  766. cur_data->n = 0;
  767. }
  768. }
  769. else
  770. {
  771. cur_data->n = cur_data->n + 1;
  772. }
  773. return cursor;
  774. }
  775. #undef FUNC_NAME
  776. SCM_DEFINE (scm_end_of_char_set_p, "end-of-char-set?", 1, 0, 0,
  777. (SCM cursor),
  778. "Return @code{#t} if @var{cursor} has reached the end of a\n"
  779. "character set, @code{#f} otherwise.")
  780. #define FUNC_NAME s_scm_end_of_char_set_p
  781. {
  782. scm_t_char_set_cursor *cur_data;
  783. SCM_VALIDATE_SMOB (1, cursor, charset_cursor);
  784. cur_data = (scm_t_char_set_cursor *) SCM_SMOB_DATA (cursor);
  785. if (cur_data->range == (size_t) (-1))
  786. return SCM_BOOL_T;
  787. return SCM_BOOL_F;
  788. }
  789. #undef FUNC_NAME
  790. SCM_DEFINE (scm_char_set_fold, "char-set-fold", 3, 0, 0,
  791. (SCM kons, SCM knil, SCM cs),
  792. "Fold the procedure @var{kons} over the character set @var{cs},\n"
  793. "initializing it with @var{knil}.")
  794. #define FUNC_NAME s_scm_char_set_fold
  795. {
  796. scm_t_char_set *cs_data;
  797. int k;
  798. scm_t_wchar n;
  799. SCM_VALIDATE_PROC (1, kons);
  800. SCM_VALIDATE_SMOB (3, cs, charset);
  801. cs_data = SCM_CHARSET_DATA (cs);
  802. if (cs_data->len == 0)
  803. return knil;
  804. for (k = 0; k < cs_data->len; k++)
  805. for (n = cs_data->ranges[k].lo; n <= cs_data->ranges[k].hi; n++)
  806. {
  807. knil = scm_call_2 (kons, SCM_MAKE_CHAR (n), knil);
  808. }
  809. return knil;
  810. }
  811. #undef FUNC_NAME
  812. SCM_DEFINE (scm_char_set_unfold, "char-set-unfold", 4, 1, 0,
  813. (SCM p, SCM f, SCM g, SCM seed, SCM base_cs),
  814. "This is a fundamental constructor for character sets.\n"
  815. "@itemize @bullet\n"
  816. "@item @var{g} is used to generate a series of ``seed'' values\n"
  817. "from the initial seed: @var{seed}, (@var{g} @var{seed}),\n"
  818. "(@var{g}^2 @var{seed}), (@var{g}^3 @var{seed}), @dots{}\n"
  819. "@item @var{p} tells us when to stop -- when it returns true\n"
  820. "when applied to one of the seed values.\n"
  821. "@item @var{f} maps each seed value to a character. These\n"
  822. "characters are added to the base character set @var{base_cs} to\n"
  823. "form the result; @var{base_cs} defaults to the empty set.\n"
  824. "@end itemize")
  825. #define FUNC_NAME s_scm_char_set_unfold
  826. {
  827. SCM result, tmp;
  828. SCM_VALIDATE_PROC (1, p);
  829. SCM_VALIDATE_PROC (2, f);
  830. SCM_VALIDATE_PROC (3, g);
  831. if (!SCM_UNBNDP (base_cs))
  832. {
  833. SCM_VALIDATE_SMOB (5, base_cs, charset);
  834. result = scm_char_set_copy (base_cs);
  835. }
  836. else
  837. result = make_char_set (FUNC_NAME);
  838. tmp = scm_call_1 (p, seed);
  839. while (scm_is_false (tmp))
  840. {
  841. SCM ch = scm_call_1 (f, seed);
  842. if (!SCM_CHARP (ch))
  843. SCM_MISC_ERROR ("procedure ~S returned non-char", scm_list_1 (f));
  844. SCM_CHARSET_SET (result, SCM_CHAR (ch));
  845. seed = scm_call_1 (g, seed);
  846. tmp = scm_call_1 (p, seed);
  847. }
  848. return result;
  849. }
  850. #undef FUNC_NAME
  851. SCM_DEFINE (scm_char_set_unfold_x, "char-set-unfold!", 5, 0, 0,
  852. (SCM p, SCM f, SCM g, SCM seed, SCM base_cs),
  853. "This is a fundamental constructor for character sets.\n"
  854. "@itemize @bullet\n"
  855. "@item @var{g} is used to generate a series of ``seed'' values\n"
  856. "from the initial seed: @var{seed}, (@var{g} @var{seed}),\n"
  857. "(@var{g}^2 @var{seed}), (@var{g}^3 @var{seed}), @dots{}\n"
  858. "@item @var{p} tells us when to stop -- when it returns true\n"
  859. "when applied to one of the seed values.\n"
  860. "@item @var{f} maps each seed value to a character. These\n"
  861. "characters are added to the base character set @var{base_cs} to\n"
  862. "form the result; @var{base_cs} defaults to the empty set.\n"
  863. "@end itemize")
  864. #define FUNC_NAME s_scm_char_set_unfold_x
  865. {
  866. SCM tmp;
  867. SCM_VALIDATE_PROC (1, p);
  868. SCM_VALIDATE_PROC (2, f);
  869. SCM_VALIDATE_PROC (3, g);
  870. SCM_VALIDATE_SMOB (5, base_cs, charset);
  871. tmp = scm_call_1 (p, seed);
  872. while (scm_is_false (tmp))
  873. {
  874. SCM ch = scm_call_1 (f, seed);
  875. if (!SCM_CHARP (ch))
  876. SCM_MISC_ERROR ("procedure ~S returned non-char", scm_list_1 (f));
  877. SCM_CHARSET_SET (base_cs, SCM_CHAR (ch));
  878. seed = scm_call_1 (g, seed);
  879. tmp = scm_call_1 (p, seed);
  880. }
  881. return base_cs;
  882. }
  883. #undef FUNC_NAME
  884. SCM_DEFINE (scm_char_set_for_each, "char-set-for-each", 2, 0, 0,
  885. (SCM proc, SCM cs),
  886. "Apply @var{proc} to every character in the character set\n"
  887. "@var{cs}. The return value is not specified.")
  888. #define FUNC_NAME s_scm_char_set_for_each
  889. {
  890. scm_t_char_set *cs_data;
  891. int k;
  892. scm_t_wchar n;
  893. SCM_VALIDATE_PROC (1, proc);
  894. SCM_VALIDATE_SMOB (2, cs, charset);
  895. cs_data = SCM_CHARSET_DATA (cs);
  896. if (cs_data->len == 0)
  897. return SCM_UNSPECIFIED;
  898. for (k = 0; k < cs_data->len; k++)
  899. for (n = cs_data->ranges[k].lo; n <= cs_data->ranges[k].hi; n++)
  900. {
  901. scm_call_1 (proc, SCM_MAKE_CHAR (n));
  902. }
  903. return SCM_UNSPECIFIED;
  904. }
  905. #undef FUNC_NAME
  906. SCM_DEFINE (scm_char_set_map, "char-set-map", 2, 0, 0,
  907. (SCM proc, SCM cs),
  908. "Map the procedure @var{proc} over every character in @var{cs}.\n"
  909. "@var{proc} must be a character -> character procedure.")
  910. #define FUNC_NAME s_scm_char_set_map
  911. {
  912. SCM result;
  913. int k;
  914. scm_t_char_set *cs_data;
  915. scm_t_wchar n;
  916. SCM_VALIDATE_PROC (1, proc);
  917. SCM_VALIDATE_SMOB (2, cs, charset);
  918. result = make_char_set (FUNC_NAME);
  919. cs_data = SCM_CHARSET_DATA (cs);
  920. if (cs_data->len == 0)
  921. return result;
  922. for (k = 0; k < cs_data->len; k++)
  923. for (n = cs_data->ranges[k].lo; n <= cs_data->ranges[k].hi; n++)
  924. {
  925. SCM ch = scm_call_1 (proc, SCM_MAKE_CHAR (n));
  926. if (!SCM_CHARP (ch))
  927. SCM_MISC_ERROR ("procedure ~S returned non-char",
  928. scm_list_1 (proc));
  929. SCM_CHARSET_SET (result, SCM_CHAR (ch));
  930. }
  931. return result;
  932. }
  933. #undef FUNC_NAME
  934. SCM_DEFINE (scm_char_set_copy, "char-set-copy", 1, 0, 0,
  935. (SCM cs),
  936. "Return a newly allocated character set containing all\n"
  937. "characters in @var{cs}.")
  938. #define FUNC_NAME s_scm_char_set_copy
  939. {
  940. SCM ret;
  941. scm_t_char_set *p1, *p2;
  942. SCM_VALIDATE_SMOB (1, cs, charset);
  943. ret = make_char_set (FUNC_NAME);
  944. p1 = SCM_CHARSET_DATA (cs);
  945. p2 = SCM_CHARSET_DATA (ret);
  946. p2->len = p1->len;
  947. if (p1->len == 0)
  948. p2->ranges = NULL;
  949. else
  950. {
  951. p2->ranges = scm_gc_malloc (sizeof (scm_t_char_range) * p1->len,
  952. "character-set");
  953. memcpy (p2->ranges, p1->ranges, sizeof (scm_t_char_range) * p1->len);
  954. }
  955. return ret;
  956. }
  957. #undef FUNC_NAME
  958. SCM_DEFINE (scm_char_set, "char-set", 0, 0, 1,
  959. (SCM rest),
  960. "Return a character set containing all given characters.")
  961. #define FUNC_NAME s_scm_char_set
  962. {
  963. SCM cs;
  964. int argnum = 1;
  965. SCM_VALIDATE_REST_ARGUMENT (rest);
  966. cs = make_char_set (FUNC_NAME);
  967. while (!scm_is_null (rest))
  968. {
  969. scm_t_wchar c;
  970. SCM_VALIDATE_CHAR_COPY (argnum, SCM_CAR (rest), c);
  971. argnum++;
  972. rest = SCM_CDR (rest);
  973. SCM_CHARSET_SET (cs, c);
  974. }
  975. return cs;
  976. }
  977. #undef FUNC_NAME
  978. SCM_DEFINE (scm_list_to_char_set, "list->char-set", 1, 1, 0,
  979. (SCM list, SCM base_cs),
  980. "Convert the character list @var{list} to a character set. If\n"
  981. "the character set @var{base_cs} is given, the character in this\n"
  982. "set are also included in the result.")
  983. #define FUNC_NAME s_scm_list_to_char_set
  984. {
  985. SCM cs;
  986. SCM_VALIDATE_LIST (1, list);
  987. if (SCM_UNBNDP (base_cs))
  988. cs = make_char_set (FUNC_NAME);
  989. else
  990. {
  991. SCM_VALIDATE_SMOB (2, base_cs, charset);
  992. cs = scm_char_set_copy (base_cs);
  993. }
  994. while (!scm_is_null (list))
  995. {
  996. SCM chr = SCM_CAR (list);
  997. scm_t_wchar c;
  998. SCM_VALIDATE_CHAR_COPY (0, chr, c);
  999. list = SCM_CDR (list);
  1000. SCM_CHARSET_SET (cs, c);
  1001. }
  1002. return cs;
  1003. }
  1004. #undef FUNC_NAME
  1005. SCM_DEFINE (scm_list_to_char_set_x, "list->char-set!", 2, 0, 0,
  1006. (SCM list, SCM base_cs),
  1007. "Convert the character list @var{list} to a character set. The\n"
  1008. "characters are added to @var{base_cs} and @var{base_cs} is\n"
  1009. "returned.")
  1010. #define FUNC_NAME s_scm_list_to_char_set_x
  1011. {
  1012. SCM_VALIDATE_LIST (1, list);
  1013. SCM_VALIDATE_SMOB (2, base_cs, charset);
  1014. while (!scm_is_null (list))
  1015. {
  1016. SCM chr = SCM_CAR (list);
  1017. scm_t_wchar c;
  1018. SCM_VALIDATE_CHAR_COPY (0, chr, c);
  1019. list = SCM_CDR (list);
  1020. SCM_CHARSET_SET (base_cs, c);
  1021. }
  1022. return base_cs;
  1023. }
  1024. #undef FUNC_NAME
  1025. SCM_DEFINE (scm_string_to_char_set, "string->char-set", 1, 1, 0,
  1026. (SCM str, SCM base_cs),
  1027. "Convert the string @var{str} to a character set. If the\n"
  1028. "character set @var{base_cs} is given, the characters in this\n"
  1029. "set are also included in the result.")
  1030. #define FUNC_NAME s_scm_string_to_char_set
  1031. {
  1032. SCM cs;
  1033. size_t k = 0, len;
  1034. SCM_VALIDATE_STRING (1, str);
  1035. if (SCM_UNBNDP (base_cs))
  1036. cs = make_char_set (FUNC_NAME);
  1037. else
  1038. {
  1039. SCM_VALIDATE_SMOB (2, base_cs, charset);
  1040. cs = scm_char_set_copy (base_cs);
  1041. }
  1042. len = scm_i_string_length (str);
  1043. while (k < len)
  1044. {
  1045. scm_t_wchar c = scm_i_string_ref (str, k++);
  1046. SCM_CHARSET_SET (cs, c);
  1047. }
  1048. scm_remember_upto_here_1 (str);
  1049. return cs;
  1050. }
  1051. #undef FUNC_NAME
  1052. SCM_DEFINE (scm_string_to_char_set_x, "string->char-set!", 2, 0, 0,
  1053. (SCM str, SCM base_cs),
  1054. "Convert the string @var{str} to a character set. The\n"
  1055. "characters from the string are added to @var{base_cs}, and\n"
  1056. "@var{base_cs} is returned.")
  1057. #define FUNC_NAME s_scm_string_to_char_set_x
  1058. {
  1059. size_t k = 0, len;
  1060. SCM_VALIDATE_STRING (1, str);
  1061. SCM_VALIDATE_SMOB (2, base_cs, charset);
  1062. len = scm_i_string_length (str);
  1063. while (k < len)
  1064. {
  1065. scm_t_wchar c = scm_i_string_ref (str, k++);
  1066. SCM_CHARSET_SET (base_cs, c);
  1067. }
  1068. scm_remember_upto_here_1 (str);
  1069. return base_cs;
  1070. }
  1071. #undef FUNC_NAME
  1072. SCM_DEFINE (scm_char_set_filter, "char-set-filter", 2, 1, 0,
  1073. (SCM pred, SCM cs, SCM base_cs),
  1074. "Return a character set containing every character from @var{cs}\n"
  1075. "so that it satisfies @var{pred}. If provided, the characters\n"
  1076. "from @var{base_cs} are added to the result.")
  1077. #define FUNC_NAME s_scm_char_set_filter
  1078. {
  1079. SCM ret;
  1080. int k;
  1081. scm_t_wchar n;
  1082. scm_t_char_set *p;
  1083. SCM_VALIDATE_PROC (1, pred);
  1084. SCM_VALIDATE_SMOB (2, cs, charset);
  1085. if (!SCM_UNBNDP (base_cs))
  1086. {
  1087. SCM_VALIDATE_SMOB (3, base_cs, charset);
  1088. ret = scm_char_set_copy (base_cs);
  1089. }
  1090. else
  1091. ret = make_char_set (FUNC_NAME);
  1092. p = SCM_CHARSET_DATA (cs);
  1093. if (p->len == 0)
  1094. return ret;
  1095. for (k = 0; k < p->len; k++)
  1096. for (n = p->ranges[k].lo; n <= p->ranges[k].hi; n++)
  1097. {
  1098. SCM res = scm_call_1 (pred, SCM_MAKE_CHAR (n));
  1099. if (scm_is_true (res))
  1100. SCM_CHARSET_SET (ret, n);
  1101. }
  1102. return ret;
  1103. }
  1104. #undef FUNC_NAME
  1105. SCM_DEFINE (scm_char_set_filter_x, "char-set-filter!", 3, 0, 0,
  1106. (SCM pred, SCM cs, SCM base_cs),
  1107. "Return a character set containing every character from @var{cs}\n"
  1108. "so that it satisfies @var{pred}. The characters are added to\n"
  1109. "@var{base_cs} and @var{base_cs} is returned.")
  1110. #define FUNC_NAME s_scm_char_set_filter_x
  1111. {
  1112. int k;
  1113. scm_t_wchar n;
  1114. scm_t_char_set *p;
  1115. SCM_VALIDATE_PROC (1, pred);
  1116. SCM_VALIDATE_SMOB (2, cs, charset);
  1117. SCM_VALIDATE_SMOB (3, base_cs, charset);
  1118. p = SCM_CHARSET_DATA (cs);
  1119. if (p->len == 0)
  1120. return base_cs;
  1121. for (k = 0; k < p->len; k++)
  1122. for (n = p->ranges[k].lo; n <= p->ranges[k].hi; n++)
  1123. {
  1124. SCM res = scm_call_1 (pred, SCM_MAKE_CHAR (n));
  1125. if (scm_is_true (res))
  1126. SCM_CHARSET_SET (base_cs, n);
  1127. }
  1128. return base_cs;
  1129. }
  1130. #undef FUNC_NAME
  1131. /* Return a character set containing all the characters from [LOWER,UPPER),
  1132. giving range errors if ERROR, adding chars from BASE_CS, and recycling
  1133. BASE_CS if REUSE is true. */
  1134. static SCM
  1135. scm_i_ucs_range_to_char_set (const char *FUNC_NAME, SCM lower, SCM upper,
  1136. SCM error, SCM base_cs, int reuse)
  1137. {
  1138. SCM cs;
  1139. size_t clower, cupper;
  1140. clower = scm_to_size_t (lower);
  1141. cupper = scm_to_size_t (upper) - 1;
  1142. SCM_ASSERT_RANGE (2, upper, cupper >= clower);
  1143. if (!SCM_UNBNDP (error))
  1144. {
  1145. if (scm_is_true (error))
  1146. {
  1147. SCM_ASSERT_RANGE (1, lower, SCM_IS_UNICODE_CHAR (clower));
  1148. SCM_ASSERT_RANGE (2, upper, SCM_IS_UNICODE_CHAR (cupper));
  1149. if (clower < SCM_CODEPOINT_SURROGATE_START
  1150. && cupper > SCM_CODEPOINT_SURROGATE_END)
  1151. scm_error(scm_out_of_range_key,
  1152. FUNC_NAME, "invalid range - contains surrogate characters: ~S to ~S",
  1153. scm_list_2 (lower, upper), scm_list_1 (upper));
  1154. }
  1155. }
  1156. if (SCM_UNBNDP (base_cs))
  1157. cs = make_char_set (FUNC_NAME);
  1158. else
  1159. {
  1160. SCM_VALIDATE_SMOB (3, base_cs, charset);
  1161. if (reuse)
  1162. cs = base_cs;
  1163. else
  1164. cs = scm_char_set_copy (base_cs);
  1165. }
  1166. if ((clower >= SCM_CODEPOINT_SURROGATE_START && clower <= SCM_CODEPOINT_SURROGATE_END)
  1167. && (cupper >= SCM_CODEPOINT_SURROGATE_START && cupper <= SCM_CODEPOINT_SURROGATE_END))
  1168. return cs;
  1169. if (clower > SCM_CODEPOINT_MAX)
  1170. clower = SCM_CODEPOINT_MAX;
  1171. if (clower >= SCM_CODEPOINT_SURROGATE_START && clower <= SCM_CODEPOINT_SURROGATE_END)
  1172. clower = SCM_CODEPOINT_SURROGATE_END + 1;
  1173. if (cupper > SCM_CODEPOINT_MAX)
  1174. cupper = SCM_CODEPOINT_MAX;
  1175. if (cupper >= SCM_CODEPOINT_SURROGATE_START && cupper <= SCM_CODEPOINT_SURROGATE_END)
  1176. cupper = SCM_CODEPOINT_SURROGATE_START - 1;
  1177. if (clower < SCM_CODEPOINT_SURROGATE_START && cupper > SCM_CODEPOINT_SURROGATE_END)
  1178. {
  1179. scm_i_charset_set_range (SCM_CHARSET_DATA (cs), clower, SCM_CODEPOINT_SURROGATE_START - 1);
  1180. scm_i_charset_set_range (SCM_CHARSET_DATA (cs), SCM_CODEPOINT_SURROGATE_END + 1, cupper);
  1181. }
  1182. else
  1183. scm_i_charset_set_range (SCM_CHARSET_DATA (cs), clower, cupper);
  1184. return cs;
  1185. }
  1186. SCM_DEFINE (scm_ucs_range_to_char_set, "ucs-range->char-set", 2, 2, 0,
  1187. (SCM lower, SCM upper, SCM error, SCM base_cs),
  1188. "Return a character set containing all characters whose\n"
  1189. "character codes lie in the half-open range\n"
  1190. "[@var{lower},@var{upper}).\n"
  1191. "\n"
  1192. "If @var{error} is a true value, an error is signalled if the\n"
  1193. "specified range contains characters which are not valid\n"
  1194. "Unicode code points. If @var{error} is @code{#f},\n"
  1195. "these characters are silently left out of the resulting\n"
  1196. "character set.\n"
  1197. "\n"
  1198. "The characters in @var{base_cs} are added to the result, if\n"
  1199. "given.")
  1200. #define FUNC_NAME s_scm_ucs_range_to_char_set
  1201. {
  1202. return scm_i_ucs_range_to_char_set (FUNC_NAME, lower, upper,
  1203. error, base_cs, 0);
  1204. }
  1205. #undef FUNC_NAME
  1206. SCM_DEFINE (scm_ucs_range_to_char_set_x, "ucs-range->char-set!", 4, 0, 0,
  1207. (SCM lower, SCM upper, SCM error, SCM base_cs),
  1208. "Return a character set containing all characters whose\n"
  1209. "character codes lie in the half-open range\n"
  1210. "[@var{lower},@var{upper}).\n"
  1211. "\n"
  1212. "If @var{error} is a true value, an error is signalled if the\n"
  1213. "specified range contains characters which are not contained in\n"
  1214. "the implemented character range. If @var{error} is @code{#f},\n"
  1215. "these characters are silently left out of the resulting\n"
  1216. "character set.\n"
  1217. "\n"
  1218. "The characters are added to @var{base_cs} and @var{base_cs} is\n"
  1219. "returned.")
  1220. #define FUNC_NAME s_scm_ucs_range_to_char_set_x
  1221. {
  1222. SCM_VALIDATE_SMOB (4, base_cs, charset);
  1223. return scm_i_ucs_range_to_char_set (FUNC_NAME, lower, upper,
  1224. error, base_cs, 1);
  1225. }
  1226. #undef FUNC_NAME
  1227. SCM_DEFINE (scm_to_char_set, "->char-set", 1, 0, 0,
  1228. (SCM x),
  1229. "Coerces x into a char-set. @var{x} may be a string, character or char-set. A string is converted to the set of its constituent characters; a character is converted to a singleton set; a char-set is returned as-is.")
  1230. #define FUNC_NAME s_scm_to_char_set
  1231. {
  1232. if (scm_is_string (x))
  1233. return scm_string_to_char_set (x, SCM_UNDEFINED);
  1234. else if (SCM_CHARP (x))
  1235. return scm_char_set (scm_list_1 (x));
  1236. else if (SCM_SMOB_PREDICATE (scm_tc16_charset, x))
  1237. return x;
  1238. else
  1239. scm_wrong_type_arg (NULL, 0, x);
  1240. }
  1241. #undef FUNC_NAME
  1242. SCM_DEFINE (scm_char_set_size, "char-set-size", 1, 0, 0,
  1243. (SCM cs),
  1244. "Return the number of elements in character set @var{cs}.")
  1245. #define FUNC_NAME s_scm_char_set_size
  1246. {
  1247. int k, count = 0;
  1248. scm_t_char_set *cs_data;
  1249. SCM_VALIDATE_SMOB (1, cs, charset);
  1250. cs_data = SCM_CHARSET_DATA (cs);
  1251. if (cs_data->len == 0)
  1252. return scm_from_int (0);
  1253. for (k = 0; k < cs_data->len; k++)
  1254. count += cs_data->ranges[k].hi - cs_data->ranges[k].lo + 1;
  1255. return scm_from_int (count);
  1256. }
  1257. #undef FUNC_NAME
  1258. SCM_DEFINE (scm_char_set_count, "char-set-count", 2, 0, 0,
  1259. (SCM pred, SCM cs),
  1260. "Return the number of the elements int the character set\n"
  1261. "@var{cs} which satisfy the predicate @var{pred}.")
  1262. #define FUNC_NAME s_scm_char_set_count
  1263. {
  1264. int k, count = 0;
  1265. scm_t_wchar n;
  1266. scm_t_char_set *cs_data;
  1267. SCM_VALIDATE_PROC (1, pred);
  1268. SCM_VALIDATE_SMOB (2, cs, charset);
  1269. cs_data = SCM_CHARSET_DATA (cs);
  1270. if (cs_data->len == 0)
  1271. return scm_from_int (0);
  1272. for (k = 0; k < cs_data->len; k++)
  1273. for (n = cs_data->ranges[k].lo; n <= cs_data->ranges[k].hi; n++)
  1274. {
  1275. SCM res = scm_call_1 (pred, SCM_MAKE_CHAR (n));
  1276. if (scm_is_true (res))
  1277. count++;
  1278. }
  1279. return SCM_I_MAKINUM (count);
  1280. }
  1281. #undef FUNC_NAME
  1282. SCM_DEFINE (scm_char_set_to_list, "char-set->list", 1, 0, 0,
  1283. (SCM cs),
  1284. "Return a list containing the elements of the character set\n"
  1285. "@var{cs}.")
  1286. #define FUNC_NAME s_scm_char_set_to_list
  1287. {
  1288. int k;
  1289. scm_t_wchar n;
  1290. SCM result = SCM_EOL;
  1291. scm_t_char_set *p;
  1292. SCM_VALIDATE_SMOB (1, cs, charset);
  1293. p = SCM_CHARSET_DATA (cs);
  1294. if (p->len == 0)
  1295. return SCM_EOL;
  1296. for (k = p->len - 1; k >= 0; k--)
  1297. for (n = p->ranges[k].hi; n >= p->ranges[k].lo; n--)
  1298. result = scm_cons (SCM_MAKE_CHAR (n), result);
  1299. return result;
  1300. }
  1301. #undef FUNC_NAME
  1302. SCM_DEFINE (scm_char_set_to_string, "char-set->string", 1, 0, 0,
  1303. (SCM cs),
  1304. "Return a string containing the elements of the character set\n"
  1305. "@var{cs}. The order in which the characters are placed in the\n"
  1306. "string is not defined.")
  1307. #define FUNC_NAME s_scm_char_set_to_string
  1308. {
  1309. int k;
  1310. int count = 0;
  1311. int idx = 0;
  1312. int wide = 0;
  1313. SCM result;
  1314. scm_t_wchar n;
  1315. scm_t_char_set *cs_data;
  1316. char *buf;
  1317. scm_t_wchar *wbuf;
  1318. SCM_VALIDATE_SMOB (1, cs, charset);
  1319. cs_data = SCM_CHARSET_DATA (cs);
  1320. if (cs_data->len == 0)
  1321. return scm_nullstr;
  1322. if (cs_data->ranges[cs_data->len - 1].hi > 255)
  1323. wide = 1;
  1324. count = scm_to_int (scm_char_set_size (cs));
  1325. if (wide)
  1326. result = scm_i_make_wide_string (count, &wbuf, 0);
  1327. else
  1328. result = scm_i_make_string (count, &buf, 0);
  1329. for (k = 0; k < cs_data->len; k++)
  1330. for (n = cs_data->ranges[k].lo; n <= cs_data->ranges[k].hi; n++)
  1331. {
  1332. if (wide)
  1333. wbuf[idx++] = n;
  1334. else
  1335. buf[idx++] = n;
  1336. }
  1337. return result;
  1338. }
  1339. #undef FUNC_NAME
  1340. SCM_DEFINE (scm_char_set_contains_p, "char-set-contains?", 2, 0, 0,
  1341. (SCM cs, SCM ch),
  1342. "Return @code{#t} iff the character @var{ch} is contained in the\n"
  1343. "character set @var{cs}.")
  1344. #define FUNC_NAME s_scm_char_set_contains_p
  1345. {
  1346. SCM_VALIDATE_SMOB (1, cs, charset);
  1347. SCM_VALIDATE_CHAR (2, ch);
  1348. return scm_from_bool (SCM_CHARSET_GET (cs, SCM_CHAR (ch)));
  1349. }
  1350. #undef FUNC_NAME
  1351. SCM_DEFINE (scm_char_set_every, "char-set-every", 2, 0, 0,
  1352. (SCM pred, SCM cs),
  1353. "Return a true value if every character in the character set\n"
  1354. "@var{cs} satisfies the predicate @var{pred}.")
  1355. #define FUNC_NAME s_scm_char_set_every
  1356. {
  1357. int k;
  1358. scm_t_wchar n;
  1359. SCM res = SCM_BOOL_T;
  1360. scm_t_char_set *cs_data;
  1361. SCM_VALIDATE_PROC (1, pred);
  1362. SCM_VALIDATE_SMOB (2, cs, charset);
  1363. cs_data = SCM_CHARSET_DATA (cs);
  1364. if (cs_data->len == 0)
  1365. return SCM_BOOL_T;
  1366. for (k = 0; k < cs_data->len; k++)
  1367. for (n = cs_data->ranges[k].lo; n <= cs_data->ranges[k].hi; n++)
  1368. {
  1369. res = scm_call_1 (pred, SCM_MAKE_CHAR (n));
  1370. if (scm_is_false (res))
  1371. return res;
  1372. }
  1373. return SCM_BOOL_T;
  1374. }
  1375. #undef FUNC_NAME
  1376. SCM_DEFINE (scm_char_set_any, "char-set-any", 2, 0, 0,
  1377. (SCM pred, SCM cs),
  1378. "Return a true value if any character in the character set\n"
  1379. "@var{cs} satisfies the predicate @var{pred}.")
  1380. #define FUNC_NAME s_scm_char_set_any
  1381. {
  1382. int k;
  1383. scm_t_wchar n;
  1384. scm_t_char_set *cs_data;
  1385. SCM_VALIDATE_PROC (1, pred);
  1386. SCM_VALIDATE_SMOB (2, cs, charset);
  1387. cs_data = SCM_CHARSET_DATA (cs);
  1388. if (cs_data->len == 0)
  1389. return SCM_BOOL_T;
  1390. for (k = 0; k < cs_data->len; k++)
  1391. for (n = cs_data->ranges[k].lo; n <= cs_data->ranges[k].hi; n++)
  1392. {
  1393. SCM res = scm_call_1 (pred, SCM_MAKE_CHAR (n));
  1394. if (scm_is_true (res))
  1395. return res;
  1396. }
  1397. return SCM_BOOL_F;
  1398. }
  1399. #undef FUNC_NAME
  1400. SCM_DEFINE (scm_char_set_adjoin, "char-set-adjoin", 1, 0, 1,
  1401. (SCM cs, SCM rest),
  1402. "Add all character arguments to the first argument, which must\n"
  1403. "be a character set.")
  1404. #define FUNC_NAME s_scm_char_set_adjoin
  1405. {
  1406. SCM_VALIDATE_SMOB (1, cs, charset);
  1407. SCM_VALIDATE_REST_ARGUMENT (rest);
  1408. cs = scm_char_set_copy (cs);
  1409. while (!scm_is_null (rest))
  1410. {
  1411. SCM chr = SCM_CAR (rest);
  1412. scm_t_wchar c;
  1413. SCM_VALIDATE_CHAR_COPY (1, chr, c);
  1414. rest = SCM_CDR (rest);
  1415. SCM_CHARSET_SET (cs, c);
  1416. }
  1417. return cs;
  1418. }
  1419. #undef FUNC_NAME
  1420. SCM_DEFINE (scm_char_set_delete, "char-set-delete", 1, 0, 1,
  1421. (SCM cs, SCM rest),
  1422. "Delete all character arguments from the first argument, which\n"
  1423. "must be a character set.")
  1424. #define FUNC_NAME s_scm_char_set_delete
  1425. {
  1426. SCM_VALIDATE_SMOB (1, cs, charset);
  1427. SCM_VALIDATE_REST_ARGUMENT (rest);
  1428. cs = scm_char_set_copy (cs);
  1429. while (!scm_is_null (rest))
  1430. {
  1431. SCM chr = SCM_CAR (rest);
  1432. scm_t_wchar c;
  1433. SCM_VALIDATE_CHAR_COPY (1, chr, c);
  1434. rest = SCM_CDR (rest);
  1435. SCM_CHARSET_UNSET (cs, c);
  1436. }
  1437. return cs;
  1438. }
  1439. #undef FUNC_NAME
  1440. SCM_DEFINE (scm_char_set_adjoin_x, "char-set-adjoin!", 1, 0, 1,
  1441. (SCM cs, SCM rest),
  1442. "Add all character arguments to the first argument, which must\n"
  1443. "be a character set.")
  1444. #define FUNC_NAME s_scm_char_set_adjoin_x
  1445. {
  1446. SCM_VALIDATE_SMOB (1, cs, charset);
  1447. SCM_VALIDATE_REST_ARGUMENT (rest);
  1448. while (!scm_is_null (rest))
  1449. {
  1450. SCM chr = SCM_CAR (rest);
  1451. scm_t_wchar c;
  1452. SCM_VALIDATE_CHAR_COPY (1, chr, c);
  1453. rest = SCM_CDR (rest);
  1454. SCM_CHARSET_SET (cs, c);
  1455. }
  1456. return cs;
  1457. }
  1458. #undef FUNC_NAME
  1459. SCM_DEFINE (scm_char_set_delete_x, "char-set-delete!", 1, 0, 1,
  1460. (SCM cs, SCM rest),
  1461. "Delete all character arguments from the first argument, which\n"
  1462. "must be a character set.")
  1463. #define FUNC_NAME s_scm_char_set_delete_x
  1464. {
  1465. SCM_VALIDATE_SMOB (1, cs, charset);
  1466. SCM_VALIDATE_REST_ARGUMENT (rest);
  1467. while (!scm_is_null (rest))
  1468. {
  1469. SCM chr = SCM_CAR (rest);
  1470. scm_t_wchar c;
  1471. SCM_VALIDATE_CHAR_COPY (1, chr, c);
  1472. rest = SCM_CDR (rest);
  1473. SCM_CHARSET_UNSET (cs, c);
  1474. }
  1475. return cs;
  1476. }
  1477. #undef FUNC_NAME
  1478. SCM_DEFINE (scm_char_set_complement, "char-set-complement", 1, 0, 0,
  1479. (SCM cs), "Return the complement of the character set @var{cs}.")
  1480. #define FUNC_NAME s_scm_char_set_complement
  1481. {
  1482. SCM res;
  1483. scm_t_char_set *p, *q;
  1484. SCM_VALIDATE_SMOB (1, cs, charset);
  1485. res = make_char_set (FUNC_NAME);
  1486. p = SCM_CHARSET_DATA (res);
  1487. q = SCM_CHARSET_DATA (cs);
  1488. charsets_complement (p, q);
  1489. return res;
  1490. }
  1491. #undef FUNC_NAME
  1492. SCM_DEFINE (scm_char_set_union, "char-set-union", 0, 0, 1,
  1493. (SCM rest),
  1494. "Return the union of all argument character sets.")
  1495. #define FUNC_NAME s_scm_char_set_union
  1496. {
  1497. int c = 1;
  1498. SCM res;
  1499. scm_t_char_set *p;
  1500. SCM_VALIDATE_REST_ARGUMENT (rest);
  1501. res = make_char_set (FUNC_NAME);
  1502. p = SCM_CHARSET_DATA (res);
  1503. while (!scm_is_null (rest))
  1504. {
  1505. SCM cs = SCM_CAR (rest);
  1506. SCM_VALIDATE_SMOB (c, cs, charset);
  1507. c++;
  1508. rest = SCM_CDR (rest);
  1509. charsets_union (p, (scm_t_char_set *) SCM_SMOB_DATA (cs));
  1510. }
  1511. return res;
  1512. }
  1513. #undef FUNC_NAME
  1514. SCM_DEFINE (scm_char_set_intersection, "char-set-intersection", 0, 0, 1,
  1515. (SCM rest),
  1516. "Return the intersection of all argument character sets.")
  1517. #define FUNC_NAME s_scm_char_set_intersection
  1518. {
  1519. SCM res;
  1520. SCM_VALIDATE_REST_ARGUMENT (rest);
  1521. if (scm_is_null (rest))
  1522. res = make_char_set (FUNC_NAME);
  1523. else
  1524. {
  1525. scm_t_char_set *p;
  1526. int argnum = 2;
  1527. res = scm_char_set_copy (SCM_CAR (rest));
  1528. p = SCM_CHARSET_DATA (res);
  1529. rest = SCM_CDR (rest);
  1530. while (scm_is_pair (rest))
  1531. {
  1532. SCM cs = SCM_CAR (rest);
  1533. scm_t_char_set *cs_data;
  1534. SCM_VALIDATE_SMOB (argnum, cs, charset);
  1535. argnum++;
  1536. cs_data = SCM_CHARSET_DATA (cs);
  1537. rest = SCM_CDR (rest);
  1538. charsets_intersection (p, cs_data);
  1539. }
  1540. }
  1541. return res;
  1542. }
  1543. #undef FUNC_NAME
  1544. SCM_DEFINE (scm_char_set_difference, "char-set-difference", 1, 0, 1,
  1545. (SCM cs1, SCM rest),
  1546. "Return the difference of all argument character sets.")
  1547. #define FUNC_NAME s_scm_char_set_difference
  1548. {
  1549. int c = 2;
  1550. SCM res, compl;
  1551. scm_t_char_set *p, *q;
  1552. SCM_VALIDATE_SMOB (1, cs1, charset);
  1553. SCM_VALIDATE_REST_ARGUMENT (rest);
  1554. res = scm_char_set_copy (cs1);
  1555. p = SCM_CHARSET_DATA (res);
  1556. compl = make_char_set (FUNC_NAME);
  1557. q = SCM_CHARSET_DATA (compl);
  1558. while (!scm_is_null (rest))
  1559. {
  1560. SCM cs = SCM_CAR (rest);
  1561. SCM_VALIDATE_SMOB (c, cs, charset);
  1562. c++;
  1563. rest = SCM_CDR (rest);
  1564. charsets_complement (q, SCM_CHARSET_DATA (cs));
  1565. charsets_intersection (p, q);
  1566. }
  1567. return res;
  1568. }
  1569. #undef FUNC_NAME
  1570. SCM_DEFINE (scm_char_set_xor, "char-set-xor", 0, 0, 1,
  1571. (SCM rest),
  1572. "Return the exclusive-or of all argument character sets.")
  1573. #define FUNC_NAME s_scm_char_set_xor
  1574. {
  1575. SCM res;
  1576. SCM_VALIDATE_REST_ARGUMENT (rest);
  1577. if (scm_is_null (rest))
  1578. res = make_char_set (FUNC_NAME);
  1579. else
  1580. {
  1581. int argnum = 2;
  1582. scm_t_char_set *p;
  1583. res = scm_char_set_copy (SCM_CAR (rest));
  1584. p = SCM_CHARSET_DATA (res);
  1585. rest = SCM_CDR (rest);
  1586. while (scm_is_pair (rest))
  1587. {
  1588. SCM cs = SCM_CAR (rest);
  1589. scm_t_char_set *cs_data;
  1590. SCM_VALIDATE_SMOB (argnum, cs, charset);
  1591. argnum++;
  1592. cs_data = SCM_CHARSET_DATA (cs);
  1593. rest = SCM_CDR (rest);
  1594. charsets_xor (p, cs_data);
  1595. }
  1596. }
  1597. return res;
  1598. }
  1599. #undef FUNC_NAME
  1600. SCM_DEFINE (scm_char_set_diff_plus_intersection, "char-set-diff+intersection", 1, 0, 1,
  1601. (SCM cs1, SCM rest),
  1602. "Return the difference and the intersection of all argument\n"
  1603. "character sets.")
  1604. #define FUNC_NAME s_scm_char_set_diff_plus_intersection
  1605. {
  1606. int c = 2;
  1607. SCM res1, res2;
  1608. scm_t_char_set *p, *q;
  1609. SCM_VALIDATE_SMOB (1, cs1, charset);
  1610. SCM_VALIDATE_REST_ARGUMENT (rest);
  1611. res1 = scm_char_set_copy (cs1);
  1612. res2 = make_char_set (FUNC_NAME);
  1613. p = SCM_CHARSET_DATA (res1);
  1614. q = SCM_CHARSET_DATA (res2);
  1615. while (!scm_is_null (rest))
  1616. {
  1617. SCM cs = SCM_CAR (rest);
  1618. scm_t_char_set *r;
  1619. SCM_VALIDATE_SMOB (c, cs, charset);
  1620. c++;
  1621. r = SCM_CHARSET_DATA (cs);
  1622. charsets_union (q, r);
  1623. charsets_intersection (p, r);
  1624. rest = SCM_CDR (rest);
  1625. }
  1626. return scm_values_2 (res1, res2);
  1627. }
  1628. #undef FUNC_NAME
  1629. SCM_DEFINE (scm_char_set_complement_x, "char-set-complement!", 1, 0, 0,
  1630. (SCM cs), "Return the complement of the character set @var{cs}.")
  1631. #define FUNC_NAME s_scm_char_set_complement_x
  1632. {
  1633. SCM_VALIDATE_SMOB (1, cs, charset);
  1634. cs = scm_char_set_complement (cs);
  1635. return cs;
  1636. }
  1637. #undef FUNC_NAME
  1638. SCM_DEFINE (scm_char_set_union_x, "char-set-union!", 1, 0, 1,
  1639. (SCM cs1, SCM rest),
  1640. "Return the union of all argument character sets.")
  1641. #define FUNC_NAME s_scm_char_set_union_x
  1642. {
  1643. SCM_VALIDATE_SMOB (1, cs1, charset);
  1644. SCM_VALIDATE_REST_ARGUMENT (rest);
  1645. cs1 = scm_char_set_union (scm_cons (cs1, rest));
  1646. return cs1;
  1647. }
  1648. #undef FUNC_NAME
  1649. SCM_DEFINE (scm_char_set_intersection_x, "char-set-intersection!", 1, 0, 1,
  1650. (SCM cs1, SCM rest),
  1651. "Return the intersection of all argument character sets.")
  1652. #define FUNC_NAME s_scm_char_set_intersection_x
  1653. {
  1654. SCM_VALIDATE_SMOB (1, cs1, charset);
  1655. SCM_VALIDATE_REST_ARGUMENT (rest);
  1656. cs1 = scm_char_set_intersection (scm_cons (cs1, rest));
  1657. return cs1;
  1658. }
  1659. #undef FUNC_NAME
  1660. SCM_DEFINE (scm_char_set_difference_x, "char-set-difference!", 1, 0, 1,
  1661. (SCM cs1, SCM rest),
  1662. "Return the difference of all argument character sets.")
  1663. #define FUNC_NAME s_scm_char_set_difference_x
  1664. {
  1665. SCM_VALIDATE_SMOB (1, cs1, charset);
  1666. SCM_VALIDATE_REST_ARGUMENT (rest);
  1667. cs1 = scm_char_set_difference (cs1, rest);
  1668. return cs1;
  1669. }
  1670. #undef FUNC_NAME
  1671. SCM_DEFINE (scm_char_set_xor_x, "char-set-xor!", 1, 0, 1,
  1672. (SCM cs1, SCM rest),
  1673. "Return the exclusive-or of all argument character sets.")
  1674. #define FUNC_NAME s_scm_char_set_xor_x
  1675. {
  1676. /* a side-effecting variant should presumably give consistent results:
  1677. (define a (char-set #\a))
  1678. (char-set-xor a a a) -> char set #\a
  1679. (char-set-xor! a a a) -> char set #\a
  1680. */
  1681. cs1 = scm_char_set_xor (scm_cons (cs1, rest));
  1682. return cs1;
  1683. }
  1684. #undef FUNC_NAME
  1685. SCM_DEFINE (scm_char_set_diff_plus_intersection_x,
  1686. "char-set-diff+intersection!", 2, 0, 1, (SCM cs1, SCM cs2,
  1687. SCM rest),
  1688. "Return the difference and the intersection of all argument\n"
  1689. "character sets.")
  1690. #define FUNC_NAME s_scm_char_set_diff_plus_intersection_x
  1691. {
  1692. SCM diff, intersect;
  1693. diff = scm_char_set_difference (cs1, scm_cons (cs2, rest));
  1694. intersect =
  1695. scm_char_set_intersection (scm_cons (cs1, scm_cons (cs2, rest)));
  1696. cs1 = diff;
  1697. cs2 = intersect;
  1698. return scm_values_2 (cs1, cs2);
  1699. }
  1700. #undef FUNC_NAME
  1701. /* Standard character sets. */
  1702. SCM scm_char_set_lower_case;
  1703. SCM scm_char_set_upper_case;
  1704. SCM scm_char_set_title_case;
  1705. SCM scm_char_set_letter;
  1706. SCM scm_char_set_digit;
  1707. SCM scm_char_set_letter_and_digit;
  1708. SCM scm_char_set_graphic;
  1709. SCM scm_char_set_printing;
  1710. SCM scm_char_set_whitespace;
  1711. SCM scm_char_set_iso_control;
  1712. SCM scm_char_set_punctuation;
  1713. SCM scm_char_set_symbol;
  1714. SCM scm_char_set_hex_digit;
  1715. SCM scm_char_set_blank;
  1716. SCM scm_char_set_ascii;
  1717. SCM scm_char_set_empty;
  1718. SCM scm_char_set_designated;
  1719. SCM scm_char_set_full;
  1720. /* Create an empty character set and return it after binding it to NAME. */
  1721. static inline SCM
  1722. define_charset (const char *name, const scm_t_char_set *p)
  1723. {
  1724. SCM cs;
  1725. SCM_NEWSMOB (cs, scm_tc16_charset, p);
  1726. scm_c_define (name, cs);
  1727. return cs;
  1728. }
  1729. SCM_DEFINE (scm_sys_char_set_dump, "%char-set-dump", 1, 0, 0, (SCM charset),
  1730. "Returns an association list containing debugging information\n"
  1731. "for @var{charset}. The association list has the following entries."
  1732. "@table @code\n"
  1733. "@item char-set\n"
  1734. "The char-set itself.\n"
  1735. "@item len\n"
  1736. "The number of character ranges the char-set contains\n"
  1737. "@item ranges\n"
  1738. "A list of lists where each sublist a range of code points\n"
  1739. "and their associated characters"
  1740. "@end table")
  1741. #define FUNC_NAME s_scm_sys_char_set_dump
  1742. {
  1743. SCM e1, e2, e3;
  1744. SCM ranges = SCM_EOL, elt;
  1745. size_t i;
  1746. scm_t_char_set *cs;
  1747. char codepoint_string_lo[13], codepoint_string_hi[13];
  1748. SCM_VALIDATE_SMOB (1, charset, charset);
  1749. cs = SCM_CHARSET_DATA (charset);
  1750. e1 = scm_cons (scm_from_latin1_symbol ("char-set"),
  1751. charset);
  1752. e2 = scm_cons (scm_from_latin1_symbol ("n"),
  1753. scm_from_size_t (cs->len));
  1754. for (i = 0; i < cs->len; i++)
  1755. {
  1756. if (cs->ranges[i].lo > 0xFFFF)
  1757. sprintf (codepoint_string_lo, "U+%06x", cs->ranges[i].lo);
  1758. else
  1759. sprintf (codepoint_string_lo, "U+%04x", cs->ranges[i].lo);
  1760. if (cs->ranges[i].hi > 0xFFFF)
  1761. sprintf (codepoint_string_hi, "U+%06x", cs->ranges[i].hi);
  1762. else
  1763. sprintf (codepoint_string_hi, "U+%04x", cs->ranges[i].hi);
  1764. elt = scm_list_4 (SCM_MAKE_CHAR (cs->ranges[i].lo),
  1765. SCM_MAKE_CHAR (cs->ranges[i].hi),
  1766. scm_from_locale_string (codepoint_string_lo),
  1767. scm_from_locale_string (codepoint_string_hi));
  1768. ranges = scm_append (scm_list_2 (ranges,
  1769. scm_list_1 (elt)));
  1770. }
  1771. e3 = scm_cons (scm_from_latin1_symbol ("ranges"),
  1772. ranges);
  1773. return scm_list_3 (e1, e2, e3);
  1774. }
  1775. #undef FUNC_NAME
  1776. void
  1777. scm_init_srfi_14 (void)
  1778. {
  1779. scm_tc16_charset = scm_make_smob_type ("character-set", 0);
  1780. scm_set_smob_print (scm_tc16_charset, charset_print);
  1781. scm_tc16_charset_cursor = scm_make_smob_type ("char-set-cursor", 0);
  1782. scm_set_smob_print (scm_tc16_charset_cursor, charset_cursor_print);
  1783. scm_char_set_upper_case =
  1784. define_charset ("char-set:upper-case", &cs_upper_case);
  1785. scm_char_set_lower_case =
  1786. define_charset ("char-set:lower-case", &cs_lower_case);
  1787. scm_char_set_title_case =
  1788. define_charset ("char-set:title-case", &cs_title_case);
  1789. scm_char_set_letter = define_charset ("char-set:letter", &cs_letter);
  1790. scm_char_set_digit = define_charset ("char-set:digit", &cs_digit);
  1791. scm_char_set_letter_and_digit =
  1792. define_charset ("char-set:letter+digit", &cs_letter_plus_digit);
  1793. scm_char_set_graphic = define_charset ("char-set:graphic", &cs_graphic);
  1794. scm_char_set_printing = define_charset ("char-set:printing", &cs_printing);
  1795. scm_char_set_whitespace =
  1796. define_charset ("char-set:whitespace", &cs_whitespace);
  1797. scm_char_set_iso_control =
  1798. define_charset ("char-set:iso-control", &cs_iso_control);
  1799. scm_char_set_punctuation =
  1800. define_charset ("char-set:punctuation", &cs_punctuation);
  1801. scm_char_set_symbol = define_charset ("char-set:symbol", &cs_symbol);
  1802. scm_char_set_hex_digit =
  1803. define_charset ("char-set:hex-digit", &cs_hex_digit);
  1804. scm_char_set_blank = define_charset ("char-set:blank", &cs_blank);
  1805. scm_char_set_ascii = define_charset ("char-set:ascii", &cs_ascii);
  1806. scm_char_set_empty = define_charset ("char-set:empty", &cs_empty);
  1807. scm_char_set_designated = define_charset ("char-set:designated", &cs_designated);
  1808. scm_char_set_full = define_charset ("char-set:full", &cs_full);
  1809. #include "srfi-14.x"
  1810. }
  1811. /* End of srfi-14.c. */