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
|
subroutine strelm
c ==================================================================
c ==
c
c evaluation des fonctions elementaires sur les chaines de
c caracteres
c
c ==================================================================
c ==
c
c Copyright INRIA
INCLUDE '../stack.h'
c
integer iadr,sadr
integer id(nsiz)
c
iadr(l)=l+l-1
sadr(l)=(l/2)+1
c
if (ddt .eq. 4) then
write(buf(1:4),'(i4)') fin
call basout(io,wte,' strelm '//buf(1:4))
endif
c
c functions/fin
c 1 2 3 4 5 6 7 8
c length part string convstr emptystr str2code code2str sort
c 9 10 11 12 13 14 15
c strcat strindex strsubst ascii grep tokens strsplit
c
c if ( fin.eq.8) then
c call intssort(id)
c else
c call cstrelm()
c endif
c return
goto (10,20,25,50,60,70,80,90,100,110,120,125,130, 135,140) fin
c
c length
c
10 continue
call intlength(id)
goto 900
c part
20 continue
call intpart(id)
goto 900
c
c string
c
25 continue
call intstring(id)
goto 900
c
c convstr
50 continue
call intconvstr(id)
goto 900
c emptystr
60 continue
call intemptystr(id)
goto 900
c
c str2code
70 continue
call intstr2code(id)
goto 900
c
c code2str
80 continue
call intcode2str(id)
goto 900
c
c sort
90 continue
call intssort(id)
goto 900
c
c strcat(str [,ins])
100 continue
call instrcat(id)
goto 900
c
c strindex(str1,str2)
110 continue
call instrindex(id)
goto 900
c
c strsubst(str1,str2,str3)
120 continue
call intstrsubst(id)
goto 900
c
c ascii
c
125 continue
call intascii(id)
goto 900
c
c grep(str1,str2)
130 continue
call intgrep()
goto 900
c
c tokens(str [,sep])
135 continue
call inttokens(id)
goto 900
c strsplit(str,v)
140 continue
call intstrsplit(id)
goto 900
c
900 return
end
integer function strord(r1,l1,r2,l2)
integer r1(*),r2(*),c1,c2
integer blank
data blank/40/
c
iord=0
if(l1.eq.0) then
if(l2.gt.0) then
strord=-1
return
else
strord=0
return
endif
else
if(l2.eq.0) then
strord=1
return
endif
endif
ll=min(l1,l2)
do 10 i=1,max(l1,l2)
if(i.le.l1) then
c1=r1(i)
else
c1=blank
endif
if(i.le.l2) then
c2=r2(i)
else
c2=blank
endif
if(c1.ge.0) c1=256-c1
if(c2.ge.0) c2=256-c2
if(c1.gt.c2) then
strord=1
return
elseif(c1.lt.c2) then
strord=-1
return
endif
10 continue
strord=0
return
end
subroutine instrcat(id)
INCLUDE '../stack.h'
c
integer id(nsiz),vol,tops
logical ref
c
integer iadr,sadr
c
iadr(l)=l+l-1
sadr(l)=(l/2)+1
c
c strcat(tr [,ins])
c
if (rhs.eq.3) then
call cstrelm()
return
endif
if(rhs.ne.1.and.rhs.ne.2) then
call error(39)
return
endif
if (lhs .ne. 1) then
call error(41)
return
endif
c
tops=top
c
if(rhs.eq.2) then
il2=iadr(lstk(top))
if(istk(il2).lt.0) il2=iadr(istk(il2+1))
if(istk(il2).ne.10) then
fun=-1
top=tops
call funnam(ids(1,pt+1),'strcat',il2)
return
endif
if(istk(il2+1)*istk(il2+2).ne.1) then
err=2
call error(36)
return
endif
l2=il2+6
nv2=istk(il2+5)-1
top=top-1
endif
c
il1=iadr(lstk(top))
ilr=il1
if(istk(il1).lt.0) il1=iadr(istk(il1+1))
ref=ilr.ne.il1
if(istk(il1).eq.1) then
if(istk(il1+1)*istk(il1+2).eq.0) then
istk(ilr)=10
istk(ilr+1)=1
istk(ilr+2)=1
istk(ilr+3)=0
istk(ilr+4)=1
istk(ilr+5)=1
lstk(top+1)=sadr(ilr+6)
return
endif
endif
if(istk(il1).ne.10) then
fun=-1
top=tops
call funnam(ids(1,pt+1),'strcat',il1)
return
endif
m1=istk(il1+1)
n1=istk(il1+2)
mn1=m1*n1
id1=il1+4
l1=id1+mn1+1
vol=istk(id1+mn1)-1
c
if(rhs.eq.1) then
istk(ilr)=10
istk(ilr+1)=1
istk(ilr+2)=1
istk(ilr+3)=0
istk(ilr+4)=1
istk(ilr+5)=1+vol
l=ilr+6
call icopy(vol,istk(l1),1,istk(l),1)
lstk(top+1)=sadr(l+vol)
else
lw = iadr(lstk(tops+1))
err=sadr(lw+vol+mn1*nv2)-lstk(bot)
if(err.gt.0) then
call error(17)
return
endif
ll1=l1
ll2=lw
do 10 i=1,mn1
ln=istk(id1+i)-istk(id1-1+i)
call icopy(ln,istk(ll1),1,istk(ll2),1)
ll1=ll1+ln
ll2=ll2+ln
call icopy(nv2,istk(l2),1,istk(ll2),1)
ll2=ll2+nv2
10 continue
vol=vol+(mn1-1)*nv2
istk(ilr)=10
istk(ilr+1)=1
istk(ilr+2)=1
istk(ilr+3)=0
istk(ilr+4)=1
istk(ilr+5)=1+vol
l=ilr+6
call icopy(vol,istk(lw),1,istk(l),1)
lstk(top+1)=sadr(l+vol)
endif
end
subroutine instrindex(id)
INCLUDE '../stack.h'
c
integer id(nsiz),vol,tops
logical ref
c
integer iadr,sadr
c
iadr(l)=l+l-1
sadr(l)=(l/2)+1
c
c strindex(str1,str2)
c
tops=top
if(rhs.ne.2) then
call error(39)
return
endif
if (lhs .gt. 2) then
call error(41)
return
endif
c
il2=iadr(lstk(top))
if(istk(il2).lt.0) il2=iadr(istk(il2+1))
if(istk(il2).ne.10) then
fun=-1
top=tops
call funnam(ids(1,pt+1),'strindex',il2)
return
endif
mn2=istk(il2+1)*istk(il2+2)
l2=il2+5+mn2
do 01 i=1,mn2
if(istk(il2+4+i)-istk(il2+3+i).eq.0) then
err=2
call error(249)
return
endif
01 continue
top=top-1
c
il1=iadr(lstk(top))
ilr=il1
if(istk(il1).lt.0) il1=iadr(istk(il1+1))
ref=ilr.ne.il1
if(istk(il1).eq.1) then
if(istk(il1+1)*istk(il1+2).eq.0) then
istk(ilr)=1
istk(ilr+1)=0
istk(ilr+2)=0
istk(ilr+3)=0
lstk(top+1)=sadr(ilr+4)
if(lhs.eq.1) return
top=top+1
ilr=iadr(lstk(top))
istk(ilr)=1
istk(ilr+1)=0
istk(ilr+2)=0
istk(ilr+3)=0
lstk(top+1)=sadr(ilr+4)
return
endif
endif
if(istk(il1).ne.10) then
fun=-1
top=tops
call funnam(ids(1,pt+1),'strindex',il1)
return
endif
if(istk(il1+1)*istk(il1+2).ne.1) then
err=1
call error(36)
return
endif
c
mn1=1
id1=il1+4
l1=id1+mn1+1
vol=istk(id1+mn1)-1
lw = lstk(tops+1)
ilm=iadr(lw)
lw=sadr(ilm+mn2)
lpos=lw
err=lpos+10-lstk(bot)
if(err.gt.0) then
call error(17)
return
endif
c
mc=0
if(vol.le.0) goto 36
ll1=l1-1
10 ll1=ll1+1
if(ll1-l1.ge.vol) goto 35
nok=0
do 11 i=1,mn2
if(istk(ll1).eq.istk(l2+istk(il2+3+i)-1)) then
istk(ilm+nok)=i
nok=nok+1
endif
11 continue
if(nok.eq.0) goto 10
c first character matches
k=0
15 k=k+1
nok1=0
do 16 ii=0,nok-1
i=istk(ilm+ii)
if(k.ge.istk(il2+4+i)-istk(il2+3+i)) then
c . a match found for ith string
nfound=i
goto 30
elseif(istk(ll1+k).eq.istk(l2+istk(il2+3+i)-1+k)) then
istk(ilm+nok1)=i
nok1=nok1+1
endif
16 continue
nok=nok1
if(nok.eq.0) goto 10
goto 15
30 continue
c a match found
mc=mc+1
if(mod(mc,10).eq.0) then
err=lpos+2*(mc+10)-lstk(bot)
if(err.gt.0) then
call error(17)
return
endif
endif
stk(lpos+2*(mc-1)) = dble(ll1-l1+1)
stk(lpos+2*(mc-1)+1) = dble(nfound)
goto 10
35 continue
c end of string str1 reached
36 if(mc.eq.0) then
istk(ilr)=1
istk(ilr+1)=0
istk(ilr+2)=0
istk(ilr+3)=0
lstk(top+1)=sadr(ilr+4)
if (lhs.eq.1) return
top=top+1
ilr=iadr(lstk(top))
istk(ilr)=1
istk(ilr+1)=0
istk(ilr+2)=0
istk(ilr+3)=0
lstk(top+1)=sadr(ilr+4)
else
if(lhs.eq.1) then
l=sadr(ilr+4)
call unsfdcopy(mc,stk(lpos),2,stk(l),1)
istk(ilr)=1
istk(ilr+1)=1
istk(ilr+2)=mc
istk(ilr+3)=0
lstk(top+1)=l+mc
else
lw=lpos+2*mc
ilw=iadr(lw)
err=lw+2*sadr(4)+2*mc-lstk(bot)
if(err.gt.0) then
call error(17)
return
endif
istk(ilw)=1
istk(ilw+1)=1
istk(ilw+2)=mc
istk(ilw+3)=0
l=sadr(ilw+4)
call dcopy(mc,stk(lpos),2,stk(l),1)
l=l+mc
l1=l
ilw=iadr(l)
istk(ilw)=1
istk(ilw+1)=1
istk(ilw+2)=mc
istk(ilw+3)=0
l=sadr(ilw+4)
call dcopy(mc,stk(lpos+1),2,stk(l),1)
l=l+mc
c . copy the variables at the top of the stack
call unsfdcopy(l-lw,stk(lw),1,stk(lstk(top)),1)
lstk(top+1)=lstk(top)+l1-lw
top=top+1
lstk(top+1)=lstk(top)+l-l1
endif
endif
return
end
subroutine intstrsubst(id)
INCLUDE '../stack.h'
c
integer id(nsiz),vol,tops
logical ref
c
integer iadr,sadr
c
iadr(l)=l+l-1
sadr(l)=(l/2)+1
c
c strsubst(str1,str2,str3)
c
if(rhs.ne.3) then
call error(39)
return
endif
if (lhs .ne. 1) then
call error(41)
return
endif
c
tops=top
c
lw = iadr(lstk(top+1))
c
il3=iadr(lstk(top))
if(istk(il3).lt.0) il3=iadr(istk(il3+1))
if(istk(il3).ne.10) then
fun=-1
top=tops
call funnam(ids(1,pt+1),'strsubst',il3)
return
endif
if(istk(il3+1)*istk(il3+2).ne.1) then
err=3
call error(36)
return
endif
l3=il3+6
nv3=istk(il3+5)-1
top=top-1
il2=iadr(lstk(top))
if(istk(il2).lt.0) il2=iadr(istk(il2+1))
if(istk(il2).ne.10) then
fun=-1
top=tops
call funnam(ids(1,pt+1),'strsubst',il2)
return
endif
if(istk(il2+1)*istk(il2+2).ne.1) then
err=2
call error(36)
return
endif
l2=il2+6
nv2=istk(il2+5)-1
if(nv2.eq.0) then
err=2
call error(249)
return
endif
top=top-1
c
il1=iadr(lstk(top))
ilr1=il1
if(istk(il1).lt.0) il1=iadr(istk(il1+1))
ref=il1.ne.ilr1
if(istk(il1).eq.1) then
if(istk(il1+1)*istk(il1+2).eq.0) then
istk(ilr1)=1
istk(ilr1+1)=0
istk(ilr1+2)=0
istk(ilr1+3)=0
lstk(top+1)=sadr(ilr1+4)
return
endif
endif
if(istk(il1).ne.10) then
fun=-1
top=tops
call funnam(ids(1,pt+1),'strsubst',il1)
return
endif
mn1=istk(il1+1)*istk(il1+2)
id1=il1+4
l1=id1+mn1+1
c
if(ref) then
id1r=lw
istk(id1r)=1
lw=lw+mn1+1
else
id1r=id1
endif
ilr=lw
ilr0=ilr
err=sadr(ilr)-lstk(bot)
if(err.gt.0) then
call error(17)
return
endif
vol=istk(id1+1)-istk(id1)
c
do 40 ij=1,mn1
mc=0
if(vol.eq.0) goto 36
ll0=l1
ll1=l1-1
10 ll1=ll1+1
if(ll1-l1.ge.vol+1-nv2) goto 35
if(istk(ll1).ne.istk(l2)) goto 10
c first character matches
k=0
15 k=k+1
if(k.ge.nv2) goto 30
if(istk(ll1+k).eq.istk(l2+k)) goto 15
goto 10
30 continue
c a match found
err=sadr(ilr+ll1-ll0+nv3) -lstk(bot)
if(err.gt.0) then
call error(17)
return
endif
mc=mc+1
call icopy(ll1-ll0,istk(ll0),1,istk(ilr),1)
ilr=ilr+ll1-ll0
ll0=ll1+nv2
call icopy(nv3,istk(l3),1,istk(ilr),1)
ilr=ilr+nv3
ll1=ll1+nv2-1
goto 10
35 continue
c end of string reached
err=sadr(ilr+vol-(ll0-l1))-lstk(bot)
if(err.gt.0) then
call error(17)
return
endif
call icopy(vol-(ll0-l1),istk(ll0),1,istk(ilr),1)
ilr=ilr+vol-(ll0-l1)
l1=l1+vol
36 vol=istk(id1+ij+1)-istk(id1+ij)
istk(id1r+ij)=istk(id1r+ij-1)+ilr-ilr0
ilr0=ilr
40 continue
id1=ilr1+4
if(ref) then
call icopy(4,istk(il1),1,istk(ilr1),1)
call icopy(mn1+1,istk(id1r),1,istk(id1),1)
endif
call icopy(ilr-lw,istk(lw),1,istk(id1+mn1+1),1)
lstk(top+1)=sadr(id1+mn1+1+ilr-lw)
return
end
subroutine intlength(id)
INCLUDE '../stack.h'
c
integer id(nsiz)
logical ref
integer iadr,sadr
c
iadr(l)=l+l-1
sadr(l)=(l/2)+1
c
if(lhs*rhs.ne.1) then
call error(39)
return
endif
il1=iadr(lstk(top+1-rhs))
ilr=il1
if(istk(il1).lt.0) il1=iadr(istk(il1+1))
ref=ilr.ne.il1
itype=istk(il1)
if(itype.eq.1.or.itype.eq.2.or.itype.eq.4) then
c length( )=prod(size( )) for matrices (+ polynomial and boolean)
l=sadr(ilr+4)
stk(l)=dble(istk(il1+1)*istk(il1+2))
istk(ilr)=1
istk(ilr+1)=1
istk(ilr+2)=1
istk(ilr+3)=0
lstk(top+1)=l+1
elseif(itype.ge.15.and.itype.le.17) then
c length(list)=size(list)
l=sadr(ilr+4)
stk(l)=dble(istk(il1+1))
istk(ilr)=1
istk(ilr+1)=1
istk(ilr+2)=1
istk(ilr+3)=0
lstk(top+1)=l+1
elseif(itype.eq.10) then
m1=istk(il1+1)
n1=istk(il1+2)
mn1=m1*n1
id1=il1+4
l1=id1+mn1+1
c
if(ref) then
ll=sadr(ilr+4)
else
ll=sadr(l1)
endif
err=ll+mn1-lstk(bot)
if(err.gt.0) then
call error(17)
return
endif
c
do 11 k=1,mn1
stk(ll-1+k)=dble(istk(id1+k)-istk(id1+k-1))
11 continue
l=sadr(ilr+4)
if(.not.ref) call unsfdcopy(mn1,stk(ll),1,stk(l),1)
istk(ilr)=1
istk(ilr+1)=m1
istk(ilr+2)=n1
istk(ilr+3)=0
lstk(top+1)=l+mn1
else
fun=-1
call funnam(ids(1,pt+1),'length',il1)
return
endif
return
end
subroutine intpart(id)
INCLUDE '../stack.h'
c
integer blank,id(nsiz),vol
logical ref
integer iadr,sadr
data blank/40/
c
iadr(l)=l+l-1
sadr(l)=(l/2)+1
if(lhs.ne.1.or.rhs.ne.2) then
call error(39)
return
endif
c
il1=iadr(lstk(top+1-rhs))
ilr=il1
if(istk(il1).lt.0) il1=iadr(istk(il1+1))
ref=ilr.ne.il1
if(istk(il1).ne.10) then
fun=-1
call funnam(ids(1,pt+1),'part',il1)
return
endif
c
m1=istk(il1+1)
n1=istk(il1+2)
mn1=m1*n1
id1=il1+4
l1=id1+mn1+1
vol=istk(id1+mn1)-1
lw=lstk(top+1)
c
lr=max(iadr(lw),ilr+mn1+5)
ilv=iadr(lstk(top))
if(istk(ilv).lt.0) ilv=iadr(istk(ilv+1))
c
if(istk(ilv).ne.1) then
err=rhs
call error(53)
return
endif
if(istk(ilv+1).gt.1.and.istk(ilv+2).gt.1) then
err=rhs
call error(89)
return
endif
if(istk(ilv+3).ne.0) then
err=rhs
call error(52)
return
endif
nv=istk(ilv+1)*istk(ilv+2)
c
if(nv.eq.0) then
if(ref) then
call icopy(4,istk(il1),1,istk(ilr),1)
id1=ilr+4
l1=id1+mn1+1
endif
call iset(mn1+1,1,istk(id1),1)
top=top-1
lstk(top+1)=sadr(l1)
goto 999
endif
lv=sadr(ilv+4)
do 21 k=0,nv-1
if(int(stk(lv+k)).le.0) then
err=2
call error(36)
return
endif
21 continue
err=sadr(lr+mn1*nv)-lstk(bot)
if(err.gt.0) then
call error(17)
return
endif
call iset(mn1*nv,blank,istk(lr),1)
lrijk=lr
lij=l1
do 23 ij=1,mn1
nij=istk(id1+ij)-istk(id1+ij-1)
do 22 k=1,nv
mv=int(stk(lv-1+k))
if(mv.le.nij) istk(lrijk)=istk(lij-1+mv)
lrijk=lrijk+1
22 continue
lij=lij+nij
23 continue
c
if(ref) then
call icopy(4,istk(il1),1,istk(ilr),1)
id1=ilr+4
l1=id1+mn1+1
endif
istk(id1)=1
do 24 ij=1,mn1
istk(id1+ij)=istk(id1+ij-1)+nv
24 continue
top=top-1
if(lr.ne.l1) call icopy(mn1*nv,istk(lr),1,istk(l1),1)
lstk(top+1)=sadr(l1+istk(id1+mn1))
999 return
end
subroutine intstring(id)
INCLUDE '../stack.h'
c
integer id(nsiz)
integer eol,nclas
logical ref
integer iadr,sadr
data eol/99/,nclas/29/
c
iadr(l)=l+l-1
sadr(l)=(l/2)+1
if(rhs.ne.1) then
call error(39)
return
endif
c
il=iadr(lstk(top))
ilr=il
if(istk(il).lt.0) il=iadr(istk(il+1))
ref=ilr.ne.il
if(istk(il).eq.10) then
call ref2val
goto 999
endif
c
lw=iadr(lstk(top+1))
c
if(istk(il).eq.1) then
c
c conversion d'une matrice de scalaires
c -------------------------------------
if(lhs.ne.1) then
call error(39)
return
endif
m=istk(il+1)
n=istk(il+2)
if(m*n.eq.0) goto 999
it=istk(il+3)
l=sadr(il+4)
if(ref) then
lw=ilr+4
else
lw=iadr(lstk(top+1))
endif
err=sadr(lw+m*n*(2*lct(7)+4))-lstk(bot)
if(err.gt.0) then
call error(17)
return
endif
lstr=lw+m*n+1
if(it.eq.0) call cvdm(stk(l),m,m,n,lct(7),lct(6),
1 istk(lstr),istk(lw))
if(it.eq.1) call cvwm(stk(l),stk(l+m*n),m,m,n,lct(7),lct(6),
1 istk(lstr),istk(lw))
nstr=istk(lw+m*n)-1
if(.not.ref) call icopy(m*n+1+nstr,istk(lw),1,istk(ilr+4),1)
istk(ilr)=10
istk(ilr+1)=m
istk(ilr+2)=n
istk(ilr+3)=0
lstk(top+1)=sadr(ilr+5+m*n+nstr)
goto 999
c
elseif(abs(istk(il)).eq.11.or.abs(istk(il)).eq.13) then
c
c conversion d'une macro non compilee
c -----------------------------------
ilm=il
c
if(lhs.ne.3) then
call error(41)
return
endif
c form vectors of output and input variables
il=il+1
lw=lstk(top+1)
do 37 i=1,2
n=istk(il)
il=il+1
ilio=iadr(lw)
istk(ilio)=10
if(n.eq.0) istk(ilio)=1
istk(ilio+1)=min(1,n)
istk(ilio+2)=n
istk(ilio+3)=0
ilp=ilio+4
istk(ilp)=1
l=ilp+n
if (n.eq.0) goto 35
do 34 j=1,n
call namstr(istk(il),istk(l+1),nn,1)
l=l+nn
istk(ilp+j)=l+1-(ilp+n)
il=il+nsiz
34 continue
35 if(i.eq.1) then
lout=lw
else
llin=lw
endif
lw=sadr(l+1)
37 continue
c
c
if(istk(ilm).eq.13) then
ltxt=lw
ilt=iadr(ltxt)
istk(ilt)=1
istk(ilt+2)=0
istk(ilt+3)=0
istk(ilt+4)=1
ilt=ilt+4
goto 43
endif
ltxt=lw
ilt=iadr(ltxt)
istk(ilt)=10
istk(ilt+2)=1
istk(ilt+3)=0
istk(ilt+4)=1
ilp=ilt+4
c
c compute number of lines of the macro
nch=istk(il)
nl=0
il=il+1
l=il-1
39 l=l+1
if(istk(l).eq.eol) then
if(istk(l+1).eq.eol) goto 40
nl=nl+1
endif
goto 39
c
40 continue
istk(ilt+1)=nl
if(nl.eq.0) then
istk(ilt)=1
istk(ilt+2)=0
ilt=ilt+3
goto 43
endif
ilt=ilp+nl+1
l=il
41 if(istk(l).eq.eol) goto 42
l=l+1
goto 41
42 if(istk(l+1).eq.eol) goto 43
n=l-il
ilp=ilp+1
istk(ilp)=istk(ilp-1)+n
call icopy(n,istk(il),1,istk(ilt),1)
ilt=ilt+n
il=l+1
l=il
goto 41
c
43 continue
lw=sadr(ilt+1)
c update stack
if(lhs.eq.3) then
n=llin-lout
call unsfdcopy(n,stk(lout),1,stk(lstk(top)),1)
lstk(top+1)=lstk(top)+n+1
top=top+1
n=ltxt-llin
call unsfdcopy(n,stk(llin),1,stk(lstk(top)),1)
lstk(top+1)=lstk(top)+n+1
top=top+1
endif
n=lw-ltxt
call unsfdcopy(n,stk(ltxt),1,stk(lstk(top)),1)
lstk(top+1)=lstk(top)+n+1
goto 999
elseif(istk(il).eq.14) then
c librairies
if(lhs.ne.1) then
call error(39)
return
endif
il0=ilr
c
n1=istk(il+1)
l1=il+2
il=il+n1+2
n=istk(il)
il=il+nclas+2
if(.not.ref) ilr=lw
err=sadr(ilr+6+n1+(nlgh+1)*n)-lstk(bot)
if(err.gt.0) then
call error(17)
return
endif
istk(ilr)=10
istk(ilr+1)=n+1
istk(ilr+2)=1
istk(ilr+3)=0
istk(ilr+4)=1
l=ilr+6+n
call icopy(n1,istk(l1),1,istk(l),1)
istk(ilr+5)=1+n1
l=l+n1
do 49 k=1,n
call namstr(istk(il),istk(l),nn,1)
istk(ilr+5+k)=istk(ilr+4+k)+nn
l=l+nn
il=il+nsiz
49 continue
if(.not.ref) call icopy(l-ilr,istk(ilr),1,istk(il0),1)
lstk(top+1)=sadr(il0+l-ilr)
goto 999
else
fun=-1
call funnam(ids(1,pt+1),'string',il)
return
endif
999 return
end
subroutine intconvstr(id)
INCLUDE '../stack.h'
c
integer id(nsiz)
logical ref,lgq,cremat
integer tops
integer iadr,sadr
c
iadr(l)=l+l-1
sadr(l)=(l/2)+1
c
if(rhs.gt.2.or.rhs.lt.1) then
call error(39)
return
endif
c
tops=top
c
if(rhs.eq.2) then
c conversion flag
il1=iadr(lstk(top))
if(istk(il1).lt.0) il1=iadr(istk(il1+1))
if(istk(il1).ne.10) then
err=2
call error(55)
return
endif
if(istk(il1+1).ne.1.or.istk(il1+2).ne.1) then
err=2
call error(89)
return
endif
if(abs(istk(il1+6)).eq.30) then
lgq=.true.
elseif(abs(istk(il1+6)).ne.21) then
err=2
call error(36)
return
else
lgq=.false.
endif
top=top-1
else
lgq=.false.
endif
c
51 continue
il1=iadr(lstk(top))
il=il1
if(istk(il).lt.0) il=iadr(istk(il+1))
if(istk(il).ne.10) then
if(istk(il1).eq.1) then
if(istk(il+1)*istk(il+2).eq.0) then
c convstr([])
lgq=cremat('convstr', top, 0, 0, 0, lr, lc)
return
endif
endif
top=tops
fun=-1
call funnam(ids(1,pt+1),'convstr',il)
return
endif
if(istk(il1).lt.0) then
rhs=1
call ref2val
endif
m1=istk(il1+1)
n1=istk(il1+2)
if (lgq) goto 53
c
c conversion en minuscule
c
k=iadr(lstk(top+1))-1
do 52 i=il1+5,k
if(istk(i).lt.-35.or.istk(i).gt.-10) goto 52
istk(i)=-istk(i)
52 continue
goto 999
c
c conversion en majuscule
c
53 continue
k0=il1+4
k =k0+m1*n1
do 55 i=1,m1*n1
k1=istk(k0+1)-istk(k0)
k0=k0+1
do 54 l=1,k1
k=k+1
if(istk(k).lt.10.or.istk(k).gt.35) goto 54
istk(k)=-istk(k)
54 continue
55 continue
goto 999
c
999 return
end
subroutine intemptystr(id)
INCLUDE '../stack.h'
c
integer id(nsiz)
logical ref
integer iadr,sadr
c
iadr(l)=l+l-1
sadr(l)=(l/2)+1
if(lhs.ne.1) then
call error(59)
return
endif
if(rhs.eq.2) then
il=iadr(lstk(top))
if(istk(il).lt.0) il=iadr(istk(il+1))
if(istk(il).ne.1) then
err=2
call error(53)
return
endif
if(istk(il+1)*istk(il+2).ne.1) then
err=2
call error(89)
return
endif
if(istk(il+3).ne.0) then
err=2
call error(52)
return
endif
n=int(stk(sadr(il+4)))
top=top-1
c
il=iadr(lstk(top))
if(istk(il).lt.0) il=iadr(istk(il+1))
if(istk(il).ne.1) then
err=1
call error(53)
return
endif
if(istk(il+1)*istk(il+2).ne.1) then
err=1
call error(89)
return
endif
if(istk(il+3).ne.0) then
err=1
call error(52)
return
endif
m=int(stk(sadr(il+4)))
elseif(rhs.eq.1) then
il=iadr(lstk(top))
ilr=il
if(istk(il).lt.0) il=iadr(istk(il+1))
if(istk(il).gt.10) then
fun=-1
call funnam(ids(1,pt+1),'emptystr',il)
return
endif
ref=ilr.ne.il
m=istk(il+1)
n=istk(il+2)
if(m*n.eq.0) then
if(ref) call ref2val
return
endif
elseif(rhs.le.0) then
m=1
n=1
top=top+1
else
call error(42)
return
endif
il=iadr(lstk(top))
istk(il)=10
istk(il+1)=m
istk(il+2)=n
istk(il+3)=0
call iset(m*n+1,1,istk(il+4),1)
lstk(top+1)=sadr(il+6+m*n)
c The correct assignation should be
c lstk(top+1)=sadr(il+5+m*n)
goto 999
999 return
end
subroutine intstr2code(id)
INCLUDE '../stack.h'
c
integer id(nsiz)
logical ref
integer iadr,sadr
c
iadr(l)=l+l-1
sadr(l)=(l/2)+1
if (rhs .ne. 1) then
call error(39)
return
endif
if (lhs .ne. 1) then
call error(41)
return
endif
c checking variable str (number 1)
c
il1 = iadr(lstk(top-rhs+1))
ilr=il1
if(istk(il1).lt.0) il1=iadr(istk(il1+1))
ref=ilr.ne.il1
if (istk(il1) .ne. 10) then
fun=-1
call funnam(ids(1,pt+1),'str2code',il1)
return
endif
if (istk(il1+1)*istk(il1+2) .ne. 1) then
err = 1
call error(89)
return
endif
n1 = istk(il1+5)-1
l1 = il1+6
if(.not.ref) then
call icopy(n1,istk(l1),1,istk(l1-2),1)
l1=sadr(ilr+4)
call int2db(n1,istk(il1+4),-1,stk(l1),-1)
else
l1=sadr(ilr+4)
call int2db(n1,istk(il1+6),1,stk(l1),1)
endif
istk(ilr)=1
istk(ilr+1)=n1
istk(ilr+2)=1
istk(ilr+3)=0
lstk(top+1)=l1+n1
goto 999
999 return
end
subroutine intcode2str(id)
INCLUDE '../stack.h'
c
integer id(nsiz)
logical ref
integer iadr,sadr
c
iadr(l)=l+l-1
sadr(l)=(l/2)+1
if (rhs .ne. 1) then
call error(39)
return
endif
if (lhs .ne. 1) then
call error(41)
return
endif
c checking variable str (number 1)
c
il1 = iadr(lstk(top-rhs+1))
ilr=il1
if(istk(il1).lt.0) il1=iadr(istk(il1+1))
if (istk(il1) .ne. 1) then
fun=-1
call funnam(ids(1,pt+1),'code2str2',il1)
return
endif
ref=ilr.ne.il1
if (istk(il1+3) .ne. 0) then
err = 1
call error(52)
return
endif
n1 = istk(il1+1)*istk(il1+2)
l1 = sadr(il1+4)
if(.not.ref) then
call unsfdcopy(n1,stk(l1),-1,stk(l1+2),-1)
l1=l1+2
endif
istk(ilr+4)=1
istk(ilr+5)=n1+1
do 81 i=1,n1
istk(ilr+5+i)=stk(l1-1+i)
81 continue
istk(ilr)=10
istk(ilr+1)=1
istk(ilr+2)=1
istk(ilr+3)=0
lstk(top+1)=sadr(ilr+6+n1)
goto 999
999 return
end
subroutine intssort(id)
INCLUDE '../stack.h'
c
integer id(nsiz),tops,vol,sel
logical ref
external strord
integer strord
integer iadr,sadr
c
iadr(l)=l+l-1
sadr(l)=(l/2)+1
if(rhs.gt.2) then
call error(42)
return
endif
if(lhs.gt.2) then
call error(41)
return
endif
tops=top
c select type of sort to perform
sel=0
if(rhs.eq.2) then
call getorient(top,sel)
if(err.gt.0) return
top=top-1
endif
if(sel.eq.2) then
top=tops
fun=-1
call funnam(ids(1,pt+1),'sort',iadr(lstk(top+1-rhs)))
return
endif
if(rhs.eq.2) rhs=rhs-1
call ref2val
c
il1=iadr(lstk(top))
ilr=il1
m=istk(il1+1)
n=istk(il1+2)
mn=m*n
id1=il1+4
l1=id1+mn+1
vol=istk(id1+mn)-1
c
id1r=id1
ls=iadr(lstk(top+1))
lsz=ls+vol
lind=lsz+mn
lw=lind+mn
err=sadr(lw)-lstk(bot)
if(err.gt.0) then
call error(17)
return
endif
call icopy(vol,istk(l1),1,istk(ls),1)
do 91 i=0,mn-1
istk(lsz+i)=istk(id1+i+1)-istk(id1+i)
91 continue
c
if(sel.eq.0) then
c sort(a) <=> sort(a,'*')
call rcsort(strord,istk(lsz),istk(id1),istk(ls),mn,istk(lind))
elseif(sel.eq.1) then
c sort(a,'r') <=> sort(a,1)
lszi=lsz
idi=id1
lindi=lind
do 95 i=0,n-1
call rcsort(strord,istk(lszi),istk(idi),istk(ls),m,
$ istk(lindi))
lszi=lszi+m
idi=idi+m
lindi=lindi+m
95 continue
endif
l2=ilr+4+mn+1
do 93 i=0,mn-1
call icopy(istk(lsz+i),istk(ls-1+istk(id1+i)),1,istk(l2),1)
l2=l2+istk(lsz+i)
93 continue
lstk(top+1)=sadr(l2)
istk(id1)=1
do 94 i=0,mn-1
istk(id1+i+1)=istk(id1+i)+istk(lsz+i)
94 continue
if(lhs.eq.1) goto 999
top=top+1
il=iadr(lstk(top))
l=sadr(il+4)
inc=-1
if(sadr(lind).gt.l) inc=1
call int2db(mn,istk(lind),inc,stk(l),inc)
istk(il)=1
istk(il+1)=m
istk(il+2)=n
istk(il+3)=0
lstk(top+1)=l+mn
go to 999
999 return
end
subroutine intascii(id)
include '../stack.h'
c
integer id(nsiz),tops,vol,sel,eol
logical ref
external strord,getfastcode
integer strord,getfastcode
character*1 c
integer iadr,sadr
data eol/99/
c
iadr(l)=l+l-1
sadr(l)=(l/2)+1
if(rhs.ne.1) then
call error(42)
return
endif
if(lhs.ne.1) then
call error(41)
return
endif
il=iadr(lstk(top))
ilr=il
if(istk(il).lt.0) il=iadr(istk(il+1))
ref=il.ne.ilr
if(istk(il).eq.1) then
c argument is a vector of ascii codes return a scilab string
n=istk(il+1)*istk(il+2)
l=sadr(il+4)
if(.not.ref) then
err=l+n-lstk(bot)
if(err.gt.0) then
call error(17)
return
endif
call unsfdcopy(n,stk(l),1,stk(l+n),1)
l=l+n
else
err=sadr(ilr+6+n)-lstk(bot)
if(err.gt.0) then
call error(17)
return
endif
endif
istk(ilr)=10
istk(ilr+1)=1
istk(ilr+2)=1
istk(ilr+3)=0
istk(ilr+4)=1
istk(ilr+5)=1+n
lr=ilr+6
do 20 i=0,n-1
c=char(int(stk(l+i)))
istk(lr+i)=getfastcode(c)
20 continue
lstk(top+1)=sadr(lr+n)
elseif(istk(il).eq.10) then
c argument is a scilab string return a vector of ascii codes
n=istk(il+4+istk(il+1)*istk(il+2))-1
l=il+5+istk(il+1)*istk(il+2)
if(.not.ref) then
lw=l+n
err=sadr(lw+n)-lstk(bot)
if(err.gt.0) then
call error(17)
return
endif
call icopy(n,istk(l),1,istk(lw),1)
l=lw
else
err=sadr(ilr+4)+n-lstk(bot)
if(err.gt.0) then
call error(17)
return
endif
endif
istk(ilr)=1
istk(ilr+1)=1
istk(ilr+2)=n
istk(ilr+3)=0
lr=sadr(ilr+4)
do 30 i=0,n-1
mc=istk(l+i)
if(mc.gt.eol) then
stk(lr+i)=ichar(char(mc-(eol+1)))
elseif(mc.lt.0) then
stk(lr+i)=ichar(alfb(abs(mc)+1))
elseif(mc.eq.eol) then
stk(lr+i)=10.
else
stk(lr+i)=ichar(alfa(mc+1))
endif
30 continue
lstk(top+1)=lr+n
else
fun=-1
call funnam(ids(1,pt+1),'ascii',il)
endif
end
subroutine intgrep()
INCLUDE '../stack.h'
c
integer vol,vol2,tops
logical ref
c
integer iadr,sadr
c
iadr(l)=l+l-1
sadr(l)=(l/2)+1
c
c strindex(str1,str2)
c
tops=top
if(rhs.ne.2) then
call error(39)
return
endif
if (lhs .gt. 2) then
call error(41)
return
endif
c
il2=iadr(lstk(top))
if(istk(il2).lt.0) il2=iadr(istk(il2+1))
if(istk(il2).ne.10) then
fun=-1
top=tops
call funnam(ids(1,pt+1),'grep',il2)
return
endif
mn2=istk(il2+1)*istk(il2+2)
l2=il2+5+mn2
do 01 i=1,mn2
if(istk(il2+4+i)-istk(il2+3+i).eq.0) then
err=2
call error(249)
return
endif
01 continue
top=top-1
c
il1=iadr(lstk(top))
ilr=il1
if(istk(il1).lt.0) il1=iadr(istk(il1+1))
ref=ilr.ne.il1
if(istk(il1).eq.1) then
if(istk(il1+1)*istk(il1+2).eq.0) then
istk(ilr)=1
istk(ilr+1)=0
istk(ilr+2)=0
istk(ilr+3)=0
lstk(top+1)=sadr(ilr+4)
return
endif
endif
if(istk(il1).ne.10) then
fun=-1
top=tops
call funnam(ids(1,pt+1),'grep',il1)
return
endif
c
mn1=istk(il1+1)*istk(il1+2)
id1=il1+4
l1=id1+mn1+1
vol=istk(id1+mn1)-1
lw = max(lstk(tops+1),lstk(top)+mn1+2)
ilrow=lw
lw=ilrow+mn1
if(lhs.eq.2) then
ilm=lw
lw=ilm+mn1
endif
err=lw-lstk(bot)
if(err.gt.0) then
call error(17)
return
endif
c
c loops on arg1 entries
mc=0
do 36 k1=1,mn1
vol=istk(id1+k1)-istk(id1+k1-1)
ll1=l1-1
10 ll1=ll1+1
if(ll1-l1.ge.vol) goto 35
c . loop on arg2 strings
do 32 k2=1,mn2
ll2=l2+istk(il2+3+k2)-1
vol2=istk(il2+4+k2)-istk(il2+3+k2)
c . check for a match on characters arg1(k1)(ll1) and arg2(k2)(1)
if(istk(ll1).eq.istk(ll2)) then
c . they match
i2=k2
else
c . characters arg1(k1)(ll1) and arg2(k2)(1) doesnt match
goto 32
endif
c first character matches check if next chars match
12 k=0
15 k=k+1
if(k.ge.vol2) then
c . end of arg2(k2) reached a match found or ith string
nfound=k2
goto 30
elseif(ll1+k.ge.l1+vol) then
c . not enough chars in arg1(k1)
goto 32
elseif(istk(ll1+k).eq.istk(ll2+k)) then
c . next characters matches go ahaead
goto 15
else
c . next characters doesnt match, chech for an other string in arg2
goto 32
endif
30 continue
c a match found
mc=mc+1
stk(ilrow+mc-1)=k1
if(lhs.eq.2) stk(ilm+mc-1)=nfound
goto 35
32 continue
c . arg1(k1)(ll1) doesnt match with any string in arg2
goto 10
c end of loop skip to next entry
35 l1=l1+vol
36 continue
c
c end of string str1 reached
if(mc.eq.0) then
istk(ilr)=1
istk(ilr+1)=0
istk(ilr+2)=0
istk(ilr+3)=0
lstk(top+1)=sadr(ilr+4)
if(lhs.eq.2) then
top=top+1
ilr=iadr(lstk(top))
istk(ilr)=1
istk(ilr+1)=0
istk(ilr+2)=0
istk(ilr+3)=0
lstk(top+1)=sadr(ilr+4)
endif
else
lrow=sadr(ilr+4)
lstk(top+1)=lrow+mc
if(lhs.eq.2) then
top=top+1
il2=iadr(lstk(top))
lm=sadr(il2+4)
lstk(top+1)=lm+mc
endif
err=lstk(top+1)-lstk(bot)
if(err.gt.0) then
call error(17)
return
endif
istk(ilr)=1
istk(ilr+1)=1
istk(ilr+2)=mc
istk(ilr+3)=0
inc=1
if(lrow.gt.ilrow) inc=-1
call unsfdcopy(mc,stk(ilrow),inc,stk(lrow),inc)
if(lhs.eq.2) then
istk(il2)=1
istk(il2+1)=1
istk(il2+2)=mc
istk(il2+3)=0
inc=1
if(lm.gt.ilm) inc=-1
call unsfdcopy(mc,stk(ilm),inc,stk(lm),inc)
endif
endif
return
end
subroutine inttokens(id)
c
c Interface code for tokens :
c
c words = tokens( str [, sep])
c
c which cut the string str into words (as a vector column of words)
c the words being sub-strings of str between separators chars.
c
c where str must be a simple string
c and sep a vector (or matrix) of characters (not string of chars)
c sep is optionnal and if it is is omitted then sep = [ " ", TAB ]
c
c Added by Bruno
c (Initially tokens was coded as a scilab macro but was very inefficient).
c
implicit none
INCLUDE '../stack.h'
integer id(nsiz)
integer lw, tops, il2, m2, n2, p2, i_sep, nb_sep, il1, l1, nv1,
$ ilr, nb_chars, nb_words, i, c, ipt, size, lword, iwd
logical in_sep
logical is_a_sep
external error, funnam, is_a_sep, icopy
integer BLANK, TAB
parameter (BLANK = 40, TAB = -40)
integer iadr,sadr, l
iadr(l)=l+l-1
sadr(l)=(l/2)+1
if(rhs.lt.1 .or. rhs.gt.2) then
call error(39)
return
endif
if (lhs .ne. 1) then
call error(41)
return
endif
tops=top
lw = iadr(lstk(top+1))
if (rhs .eq. 2) then
c get the separators sep
il2 = iadr(lstk(top))
if (istk(il2).lt.0) il2 = iadr(istk(il2+1))
if (istk(il2).ne.10) then
fun=-1
top=tops
call funnam(ids(1,pt+1),'tokens',il2)
return
endif
m2 = istk(il2+1)
n2 = istk(il2+2)
c verify that each element of sep is a simple character
p2 = il2 + 4
do i = 1, m2*n2
if (istk(p2+i)-istk(p2+i-1) .ne. 1) then
buf='a separator must be formed by only one character'
call error(9999)
return
endif
enddo
nb_sep = m2*n2
c ! there are nb_sep separators, and the first is located at istk(i_sep)
i_sep = p2 + 1 + nb_sep
top = top - 1
else
c no separators given => uses the 2 default separators (blank and tab)
i_sep = lw
nb_sep = 2
lw = lw + 2
err=sadr(lw)-lstk(bot)
if ( err.gt.0 ) then
call error(17)
return
endif
istk(i_sep) = BLANK
istk(i_sep+1) = TAB
endif
c get the string str
il1 = iadr(lstk(top))
if(istk(il1).lt.0) il1 = iadr(istk(il1+1))
if(istk(il1).ne.10) then
fun = -1
top = tops
call funnam(ids(1,pt+1),'tokens',il1)
return
endif
if(istk(il1+1)*istk(il1+2).ne.1) then
c ! str must be a simple string not a vector|matrix of strings
call error(36)
return
endif
l1 = il1+6
nv1 = istk(il1+5)-1
c ! nv1 is the number of chars of str
if(nv1.eq.0) then
c ! str is an empty string => return a void matrix
il1=iadr(lstk(top))
istk(il1) = 1
istk(il1+1) = 0
istk(il1+2) = 0
istk(il1+3) = 0
return
endif
c count the number of words (and characters)
nb_words = 0
nb_chars = 0
in_sep = .true.
do i = 0, nv1-1
c = istk(l1+i)
if ( is_a_sep(c, istk(i_sep), nb_sep) ) then
in_sep = .true.
else
nb_chars = nb_chars + 1
if (in_sep) then
nb_words = nb_words + 1
in_sep = .false.
endif
endif
enddo
if ( nb_words .eq. 0 ) then
c ! return a void matrix
il1=iadr(lstk(top))
istk(il1) = 1
istk(il1+1) = 0
istk(il1+2) = 0
istk(il1+3) = 0
return
endif
c prepare memory for the result
ilr = lw
size = 5 + nb_words + nb_chars
c ! size of the resulting scilab object
lw = lw + size
err = sadr(lw) - lstk(bot)
if ( err.gt.0 ) then
call error(17)
return
endif
c form the output
istk(ilr) = 10
istk(ilr+1) = nb_words
istk(ilr+2) = 1
istk(ilr+3) = 0
istk(ilr+4) = 1
ipt = ilr + 5
iwd = ipt + nb_words
istk(iwd-1) = nb_chars + 1
c dernier pointeur (necessaire lorsque la chaine ne se termine pas
C par un separateur)
lword = 0
do i = 0, nv1-1
c = istk(l1+i)
if ( is_a_sep(c, istk(i_sep), nb_sep) ) then
if (lword .gt. 0) then
c ! on vient donc de terminer un mot
istk(ipt) = istk(ipt-1) + lword
ipt = ipt + 1
lword = 0
endif
else
istk(iwd) = c
iwd = iwd + 1
lword = lword + 1
endif
enddo
c copy result at top
il1=iadr(lstk(top))
call icopy(size, istk(ilr), 1, istk(il1), 1)
lstk(top+1)=sadr(il1 + size)
end
logical function is_a_sep(c, sep, nb_sep)
c
c utility function used by inttokens (Bruno)
c
implicit none
integer c, nb_sep, sep(nb_sep)
integer i
is_a_sep = .false.
do i = 1, nb_sep
if (c .eq. sep(i)) then
is_a_sep = .true.
return
endif
enddo
end
subroutine intstrsplit(id)
INCLUDE '../stack.h'
c
integer id(nsiz),vol,tops
logical ref1,ref2
c
integer iadr,sadr
c
iadr(l)=l+l-1
sadr(l)=(l/2)+1
c
c strsplit(str,v)
c
if(rhs.ne.2) then
call error(39)
return
endif
if (lhs .ne. 1) then
call error(41)
return
endif
c
tops=top
c
lw=lstk(top+1)
il2=iadr(lstk(top))
ref2=istk(il2).lt.0
if(ref2) il2=iadr(istk(il2+1))
if(istk(il2).ne.1) then
fun=-1
top=tops
call funnam(ids(1,pt+1),'strsplit',il2)
return
endif
n2=istk(il2+1)*istk(il2+2)
l2=sadr(il2+4)
if (stk(l2).lt.1) then
err=2
call error(116)
return
endif
do i=1,n2-1
if (stk(l2+i).lt.stk(l2+i-1)) then
err=2
call error(99)
return
endif
enddo
c
top=top-1
il1=iadr(lstk(top))
ref1=istk(il1).lt.0
if(ref1) il1=iadr(istk(il1+1))
if(istk(il1).eq.1) then
if(istk(il1+1)*istk(il1+2).eq.0) then
ilr=iadr(lstk(top))
istk(ilr)=1
istk(ilr+1)=0
istk(ilr+2)=0
istk(ilr+3)=0
lstk(top+1)=sadr(ilr+4)
return
endif
endif
if(istk(il1).ne.10) then
fun=-1
top=tops
call funnam(ids(1,pt+1),'strsplit',il1)
return
endif
if (istk(il1+1)*istk(il1+2).ne.1) then
err=1
call error(89)
return
endif
id1=il1+4
l1=id1+2
vol=istk(id1+1)-1
if (stk(l2+n2-1).ge.vol) then
err=2
call error(116)
return
endif
if(ref1.and.ref2) then
ilr=iadr(lstk(top))
else
ilr=iadr(lw)
err = sadr(ilr+4+n2+2+vol) - lstk(bot)
if ( err.gt.0 ) then
call error(17)
return
endif
endif
istk(ilr)=10
istk(ilr+1)=n2+1
istk(ilr+2)=1
istk(ilr+3)=0
istk(ilr+4)=1
do i=1,n2
istk(ilr+4+i)=stk(l2+i-1)+1
enddo
istk(ilr+5+n2)=vol+1
call icopy(vol,istk(l1),1,istk(ilr+6+n2),1)
if(ref1.and.ref2) then
lstk(top+1)=sadr(ilr+6+n2+vol)
else
il=iadr(lstk(top))
call icopy(6+n2+vol,istk(ilr),1,istk(il),1)
lstk(top+1)=sadr(il+6+n2+vol)
endif
end
|
