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