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
|
if not modules then modules = { } end modules ['strc-reg'] = {
version = 1.001,
comment = "companion to strc-reg.mkiv",
author = "Hans Hagen, PRAGMA-ADE, Hasselt NL",
copyright = "PRAGMA ADE / ConTeXt Development Team",
license = "see context related readme files"
}
local next, type = next, type
local format, gmatch = string.format, string.gmatch
local equal, concat, remove = table.are_equal, table.concat, table.remove
local lpegmatch, P, C, Ct = lpeg.match, lpeg.P, lpeg.C, lpeg.Ct
local allocate = utilities.storage.allocate
local trace_registers = false trackers.register("structures.registers", function(v) trace_registers = v end)
local report_registers = logs.reporter("structure","registers")
local structures = structures
local registers = structures.registers
local helpers = structures.helpers
local sections = structures.sections
local documents = structures.documents
local pages = structures.pages
local references = structures.references
local usedinternals = references.usedinternals
local mappings = sorters.mappings
local entries = sorters.entries
local replacements = sorters.replacements
local processors = typesetters.processors
local splitprocessor = processors.split
local texgetcount = tex.getcount
local variables = interfaces.variables
local v_forward = variables.forward
local v_all = variables.all
local v_yes = variables.yes
local v_packed = variables.packed
local v_current = variables.current
local v_previous = variables.previous
local v_first = variables.first
local v_last = variables.last
local v_text = variables.text
local context = context
local commands = commands
local implement = interfaces.implement
local matchingtilldepth = sections.matchingtilldepth
local numberatdepth = sections.numberatdepth
local currentlevel = sections.currentlevel
local currentid = sections.currentid
local touserdata = helpers.touserdata
local internalreferences = references.internals
local setinternalreference = references.setinternalreference
local setmetatableindex = table.setmetatableindex
local absmaxlevel = 5 -- \c_strc_registers_maxlevel
local h_prefixpage = helpers.prefixpage
local h_prefixlastpage = helpers.prefixlastpage
local h_title = helpers.title
local ctx_startregisteroutput = context.startregisteroutput
local ctx_stopregisteroutput = context.stopregisteroutput
local ctx_startregistersection = context.startregistersection
local ctx_stopregistersection = context.stopregistersection
local ctx_startregisterentries = context.startregisterentries
local ctx_stopregisterentries = context.stopregisterentries
local ctx_startregisterentry = context.startregisterentry
local ctx_stopregisterentry = context.stopregisterentry
local ctx_startregisterpages = context.startregisterpages
local ctx_stopregisterpages = context.stopregisterpages
local ctx_startregisterseewords = context.startregisterseewords
local ctx_stopregisterseewords = context.stopregisterseewords
local ctx_registerentry = context.registerentry
local ctx_registerseeword = context.registerseeword
local ctx_registerpagerange = context.registerpagerange
local ctx_registeronepage = context.registeronepage
local ctx_registerpacked = context.registerpacked
-- possible export, but ugly code (overloads)
--
-- local output, section, entries, nofentries, pages, words, rawtext
--
-- h_title = function(a,b) rawtext = a end
--
-- local function ctx_startregisteroutput()
-- output = { }
-- section = nil
-- entries = nil
-- nofentries = nil
-- pages = nil
-- words = nil
-- rawtext = nil
-- end
-- local function ctx_stopregisteroutput()
-- inspect(output)
-- output = nil
-- section = nil
-- entries = nil
-- nofentries = nil
-- pages = nil
-- words = nil
-- rawtext = nil
-- end
-- local function ctx_startregistersection(tag)
-- section = { }
-- output[#output+1] = {
-- section = section,
-- tag = tag,
-- }
-- end
-- local function ctx_stopregistersection()
-- end
-- local function ctx_startregisterentries(n)
-- entries = { }
-- nofentries = 0
-- section[#section+1] = entries
-- end
-- local function ctx_stopregisterentries()
-- end
-- local function ctx_startregisterentry(n) -- or subentries (nested?)
-- nofentries = nofentries + 1
-- entry = { }
-- entries[nofentries] = entry
-- end
-- local function ctx_stopregisterentry()
-- nofentries = nofentries - 1
-- entry = entries[nofentries]
-- end
-- local function ctx_startregisterpages()
-- pages = { }
-- entry.pages = pages
-- end
-- local function ctx_stopregisterpages()
-- end
-- local function ctx_startregisterseewords()
-- words = { }
-- entry.words = words
-- end
-- local function ctx_stopregisterseewords()
-- end
-- local function ctx_registerentry(processor,internal,seeparent,text)
-- text()
-- entry.text = {
-- processor = processor,
-- internal = internal,
-- seeparent = seeparent,
-- text = rawtext,
-- }
-- end
-- local function ctx_registerseeword(i,n,processor,internal,seeindex,seetext)
-- seetext()
-- entry.words[i] = {
-- processor = processor,
-- internal = internal,
-- seeparent = seeparent,
-- seetext = rawtext,
-- }
-- end
-- local function ctx_registerpagerange(fprocessor,finternal,frealpage,lprocessor,linternal,lrealpage)
-- pages[#pages+1] = {
-- first = {
-- processor = fprocessor,
-- internal = finternal,
-- realpage = frealpage,
-- },
-- last = {
-- processor = lprocessor,
-- internal = linternal,
-- realpage = lrealpage,
-- },
-- }
-- end
-- local function ctx_registeronepage(processor,internal,realpage)
-- pages[#pages+1] = {
-- processor = processor,
-- internal = internal,
-- realpage = realpage,
-- }
-- end
-- some day we will share registers and lists (although there are some conceptual
-- differences in the application of keywords)
local function filtercollected(names,criterium,number,collected,prevmode)
if not criterium or criterium == "" then
criterium = v_all
end
local data = documents.data
local numbers = data.numbers
local depth = data.depth
local hash = { }
local result = { }
local nofresult = 0
local all = not names or names == "" or names == v_all
local detail = nil
if not all then
for s in gmatch(names,"[^, ]+") do
hash[s] = true
end
end
if criterium == v_all or criterium == v_text then
for i=1,#collected do
local v = collected[i]
if all then
nofresult = nofresult + 1
result[nofresult] = v
else
local vmn = v.metadata and v.metadata.name
if hash[vmn] then
nofresult = nofresult + 1
result[nofresult] = v
end
end
end
elseif criterium == v_current then
local collectedsections = sections.collected
for i=1,#collected do
local v = collected[i]
local sectionnumber = collectedsections[v.references.section]
if sectionnumber then
local cnumbers = sectionnumber.numbers
if prevmode then
if (all or hash[v.metadata.name]) and #cnumbers >= depth then -- is the = ok for lists as well?
local ok = true
for d=1,depth do
if not (cnumbers[d] == numbers[d]) then -- no zero test
ok = false
break
end
end
if ok then
nofresult = nofresult + 1
result[nofresult] = v
end
end
else
if (all or hash[v.metadata.name]) and #cnumbers > depth then
local ok = true
for d=1,depth do
local cnd = cnumbers[d]
if not (cnd == 0 or cnd == numbers[d]) then
ok = false
break
end
end
if ok then
nofresult = nofresult + 1
result[nofresult] = v
end
end
end
end
end
elseif criterium == v_previous then
local collectedsections = sections.collected
for i=1,#collected do
local v = collected[i]
local sectionnumber = collectedsections[v.references.section]
if sectionnumber then
local cnumbers = sectionnumber.numbers
if (all or hash[v.metadata.name]) and #cnumbers >= depth then
local ok = true
if prevmode then
for d=1,depth do
if not (cnumbers[d] == numbers[d]) then
ok = false
break
end
end
else
for d=1,depth do
local cnd = cnumbers[d]
if not (cnd == 0 or cnd == numbers[d]) then
ok = false
break
end
end
end
if ok then
nofresult = nofresult + 1
result[nofresult] = v
end
end
end
end
elseif criterium == variables["local"] then
if sections.autodepth(data.numbers) == 0 then
return filtercollected(names,v_all,number,collected,prevmode)
else
return filtercollected(names,v_current,number,collected,prevmode)
end
else -- sectionname, number
-- beware, this works ok for registers
-- to be redone with reference instead
local depth = sections.getlevel(criterium)
local number = tonumber(number) or numberatdepth(depth) or 0
if trace_registers then
detail = format("depth: %s, number: %s, numbers: %s, startset: %s",depth,number,concat(sections.numbers(),".",1,depth),#collected)
end
if number > 0 then
for i=1,#collected do
local v = collected[i]
local r = v.references
if r then
local sectionnumber = sections.collected[r.section]
if sectionnumber then
local metadata = v.metadata
local cnumbers = sectionnumber.numbers
if cnumbers then
if (all or hash[metadata.name or false]) and #cnumbers >= depth and matchingtilldepth(depth,cnumbers) then
nofresult = nofresult + 1
result[nofresult] = v
end
end
end
end
end
end
end
if trace_registers then
if detail then
report_registers("criterium %a, detail %a, found %a",criterium,detail,#result)
else
report_registers("criterium %a, detail %a, found %a",criterium,nil,#result)
end
end
return result
end
local tobesaved = allocate()
local collected = allocate()
registers.collected = collected
registers.tobesaved = tobesaved
registers.filtercollected = filtercollected
-- we follow a different strategy than by lists, where we have a global
-- result table; we might do that here as well but since sorting code is
-- older we delay that decision
-- maybe store the specification in the format (although we predefine only
-- saved registers)
local function checker(t,k)
local v = {
metadata = {
language = 'en',
sorted = false,
class = class,
},
entries = { },
}
t[k] = v
return v
end
local function initializer()
tobesaved = registers.tobesaved
collected = registers.collected
setmetatableindex(tobesaved,checker)
setmetatableindex(collected,checker)
local usedinternals = references.usedinternals
for name, list in next, collected do
local entries = list.entries
if not list.metadata.notsaved then
for e=1,#entries do
local entry = entries[e]
local r = entry.references
if r then
local internal = r and r.internal
if internal then
internalreferences[internal] = entry
usedinternals[internal] = r.used
end
end
end
end
end
end
local function finalizer()
local flaginternals = references.flaginternals
local usedviews = references.usedviews
for k, v in next, tobesaved do
local entries = v.entries
if entries then
for i=1,#entries do
local r = entries[i].references
if r then
local i = r.internal
local f = flaginternals[i]
if f then
r.used = usedviews[i] or true
end
end
end
end
end
end
job.register('structures.registers.collected', tobesaved, initializer, finalizer)
setmetatableindex(tobesaved,checker)
setmetatableindex(collected,checker)
local function defineregister(class,method)
local d = tobesaved[class]
if method == v_forward then
d.metadata.notsaved = true
end
end
registers.define = defineregister -- 4 times is somewhat over the top but we want consistency
registers.setmethod = defineregister -- and we might have a difference some day
implement {
name = "defineregister",
actions = defineregister,
arguments = { "string", "string" }
}
implement {
name = "setregistermethod",
actions = defineregister, -- duplicate use
arguments = { "string", "string" }
}
local p_s = P("+")
local p_e = P("&") * (1-P(";"))^0 * P(";")
local p_r = C((p_e + (1-p_s))^0)
local entrysplitter_xml = Ct(p_r * (p_s * p_r)^0) -- bah
local entrysplitter_tex = lpeg.tsplitat('+') -- & obsolete in mkiv
local tagged = { }
-- this whole splitting is an inheritance of mkii
local function preprocessentries(rawdata)
local entries = rawdata.entries
if entries then
--
-- local e = entries[1] or ""
-- local k = entries[2] or ""
-- local et, kt, entryproc, pageproc
-- if type(e) == "table" then
-- et = e
-- else
-- entryproc, e = splitprocessor(e)
-- et = lpegmatch(entrysplitter,e)
-- end
-- if type(k) == "table" then
-- kt = k
-- else
-- pageproc, k = splitprocessor(k)
-- kt = lpegmatch(entrysplitter,k)
-- end
--
local processors = rawdata.processors
local et = entries.entries
local kt = entries.keys
local entryproc = processors and processors.entry
local pageproc = processors and processors.page
local coding = rawdata.metadata.coding
if entryproc == "" then
entryproc = nil
end
if pageproc == "" then
pageproc = nil
end
if not et then
local p, e = splitprocessor(entries.entry or "")
if p then
entryproc = p
end
et = lpegmatch(coding == "xml" and entrysplitter_xml or entrysplitter_tex,e)
end
if not kt then
local p, k = splitprocessor(entries.key or "")
if p then
pageproc = p
end
kt = lpegmatch(coding == "xml" and entrysplitter_xml or entrysplitter_tex,k)
end
--
entries = { }
local ok = false
for k=#et,1,-1 do
local etk = et[k]
local ktk = kt[k]
if not ok and etk == "" then
entries[k] = nil
else
entries[k] = { etk or "", ktk ~= "" and ktk or nil }
ok = true
end
end
rawdata.list = entries
if pageproc or entryproc then
rawdata.processors = { entryproc, pageproc } -- old way: indexed .. will be keys
end
rawdata.entries = nil
end
local seeword = rawdata.seeword
if seeword then
seeword.processor, seeword.text = splitprocessor(seeword.text or "")
end
end
local function storeregister(rawdata) -- metadata, references, entries
local references = rawdata.references
local metadata = rawdata.metadata
-- checking
if not metadata then
metadata = { }
rawdata.metadata = metadata
end
--
if not metadata.kind then
metadata.kind = "entry"
end
--
if not metadata.catcodes then
metadata.catcodes = tex.catcodetable -- get
end
--
local name = metadata.name
local notsaved = tobesaved[name].metadata.notsaved
--
if not references then
references = { }
rawdata.references = references
end
--
local internal = references.internal
if not internal then
internal = texgetcount("locationcount") -- we assume that it has been set
references.internal = internal
end
--
if notsaved then
usedinternals[internal] = references.used -- todo view (we assume that forward references index entries are used)
end
--
if not references.realpage then
references.realpage = 0 -- just to be sure as it can be refered to
end
--
local userdata = rawdata.userdata
if userdata then
rawdata.userdata = touserdata(userdata)
end
--
references.section = currentid()
metadata.level = currentlevel()
--
local data = notsaved and collected[name] or tobesaved[name]
local entries = data.entries
internalreferences[internal] = rawdata
preprocessentries(rawdata)
entries[#entries+1] = rawdata
local label = references.label
if label and label ~= "" then
tagged[label] = #entries
else
references.label = nil
end
return #entries
end
registers.store = storeregister
function registers.enhance(name,n)
local data = tobesaved[name].metadata.notsaved and collected[name] or tobesaved[name]
local entry = data.entries[n]
if entry then
entry.references.realpage = texgetcount("realpageno")
end
end
function registers.extend(name,tag,rawdata) -- maybe do lastsection internally
if type(tag) == "string" then
tag = tagged[tag]
end
if tag then
local data = tobesaved[name].metadata.notsaved and collected[name] or tobesaved[name]
local entry = data.entries[tag]
if entry then
local references = entry.references
references.lastrealpage = texgetcount("realpageno")
references.lastsection = currentid()
if rawdata then
local userdata = rawdata.userdata
if userdata then
rawdata.userdata = touserdata(userdata)
end
if rawdata.entries then
preprocessentries(rawdata)
end
local metadata = rawdata.metadata
if metadata and not metadata.catcodes then
metadata.catcodes = tex.catcodetable -- get
end
for k, v in next, rawdata do
local rk = references[k]
if not rk then
references[k] = v
else
for kk, vv in next, v do
if type(vv) == "table" then
if next(vv) then
rk[kk] = vv
end
elseif vv ~= "" then
rk[kk] = vv
end
end
end
end
end
end
end
end
function registers.get(tag,n)
local list = tobesaved[tag]
return list and list.entries[n]
end
implement {
name = "enhanceregister",
actions = registers.enhance,
arguments = { "string", "integer" }
}
implement {
name = "extendregister",
actions = registers.extend,
arguments = { "string", "string" }
}
implement {
name = "storeregister",
-- actions = function(rawdata)
-- local nofentries = storeregister(rawdata)
-- setinternalreference { internal = rawdata.references.internal }
-- context(nofentries)
-- end,
actions = { storeregister, context },
arguments = {
{
{ "metadata", {
{ "kind" },
{ "name" },
{ "coding" },
{ "level", "integer" },
{ "catcodes", "integer" },
{ "own" },
{ "xmlroot" },
{ "xmlsetup" }
}
},
{ "entries", {
{ "entries", "list" },
{ "keys", "list" },
{ "entry" },
{ "key" }
}
},
{ "references", {
{ "internal", "integer" },
{ "section", "integer" },
{ "view" },
{ "label" }
}
},
{ "seeword", {
{ "text" }
}
},
{ "processors", {
{ "entry" },
{ "key" },
{ "page" }
}
},
{ "userdata" },
}
}
}
-- sorting and rendering
local compare = sorters.comparers.basic
function registers.compare(a,b)
local result = compare(a,b)
if result ~= 0 then
return result
else
local ka = a.metadata.kind
local kb = b.metadata.kind
if ka == kb then
local page_a, page_b = a.references.realpage, b.references.realpage
if not page_a or not page_b then
return 0
elseif page_a < page_b then
return -1
elseif page_a > page_b then
return 1
end
elseif ka == "see" then
return 1
elseif kb == "see" then
return -1
end
end
return 0
end
function registers.filter(data,options)
data.result = registers.filtercollected(nil,options.criterium,options.number,data.entries,true)
end
local seeindex = 0
-- meerdere loops, seewords, dan words, anders seewords
local function crosslinkseewords(result) -- all words
-- collect all seewords
local seewords = { }
for i=1,#result do
local data = result[i]
local seeword = data.seeword
if seeword then
local seetext = seeword.text
if seetext and not seewords[seetext] then
seeindex = seeindex + 1
seewords[seetext] = seeindex
if trace_registers then
report_registers("see word %03i: %s",seeindex,seetext)
end
end
end
end
-- mark seeparents
local seeparents = { }
for i=1,#result do
local data = result[i]
local word = data.list[1]
word = word and word[1]
if word then
local seeindex = seewords[word]
if seeindex then
seeparents[word] = data
data.references.seeparent = seeindex
if trace_registers then
report_registers("see parent %03i: %s",seeindex,word)
end
end
end
end
-- mark seewords and extend sort list
for i=1,#result do
local data = result[i]
local seeword = data.seeword
if seeword then
local text = seeword.text
if text then
local seeparent = seeparents[text]
if seeparent then
local seeindex = seewords[text]
local s, ns, d, w, l = { }, 0, data.split, seeparent.split, data.list
-- trick: we influence sorting by adding fake subentries
for i=1,#d do
ns = ns + 1
s[ns] = d[i] -- parent
end
for i=1,#w do
ns = ns + 1
s[ns] = w[i] -- see
end
data.split = s
-- we also register a fake extra list entry so that the
-- collapser works okay
l[#l+1] = { text, "" }
data.references.seeindex = seeindex
if trace_registers then
report_registers("see crosslink %03i: %s",seeindex,text)
end
end
end
end
end
end
local function removeemptyentries(result)
local i, n, m = 1, #result, 0
while i <= n do
local entry = result[i]
if #entry.list == 0 or #entry.split == 0 then
remove(result,i)
n = n - 1
m = m + 1
else
i = i + 1
end
end
if m > 0 then
report_registers("%s empty entries removed in register",m)
end
end
function registers.prepare(data)
-- data has 'list' table
local strip = sorters.strip
local splitter = sorters.splitters.utf
local result = data.result
if result then
for i=1, #result do
local entry = result[i]
local split = { }
local list = entry.list
if list then
for l=1,#list do
local ll = list[l]
local word = ll[1]
local key = ll[2]
if not key or key == "" then
key = word
end
split[l] = splitter(strip(key))
end
end
entry.split = split
end
removeemptyentries(result)
crosslinkseewords(result)
end
end
function registers.sort(data,options)
-- if options.pagenumber == false then
-- sorters.sort(data.result,compare)
-- else
sorters.sort(data.result,registers.compare)
-- end
end
function registers.unique(data,options)
local result, nofresult, prev = { }, 0, nil
local dataresult = data.result
for k=1,#dataresult do
local v = dataresult[k]
if prev then
local vr = v.references
local pr = prev.references
if not equal(prev.list,v.list) then
-- ok
elseif pr.realpage ~= vr.realpage then
-- ok
else
local pl, vl = pr.lastrealpage, vr.lastrealpage
if pl or vl then
if not vl then
-- ok
elseif not pl then
-- ok
elseif pl ~= vl then
-- ok
else
v = nil
end
else
v = nil
end
end
end
if v then
nofresult = nofresult + 1
result[nofresult] = v
prev = v
end
end
data.result = result
end
function registers.finalize(data,options) -- maps character to index (order)
local result = data.result
data.metadata.nofsorted = #result
local split, nofsplit, lasttag, done, nofdone = { }, 0, nil, nil, 0
local firstofsplit = sorters.firstofsplit
for k=1,#result do
local v = result[k]
local entry, tag = firstofsplit(v)
if tag ~= lasttag then
if trace_registers then
report_registers("splitting at %a",tag)
end
done = { }
nofdone = 0
nofsplit = nofsplit + 1
lasttag = tag
split[nofsplit] = { tag = tag, data = done }
end
nofdone = nofdone + 1
done[nofdone] = v
end
data.result = split
end
local function analyzeregister(class,options)
local data = collected[class]
if data and data.entries then
options = options or { }
sorters.setlanguage(options.language,options.method,options.numberorder)
registers.filter(data,options) -- filter entries into results (criteria)
registers.prepare(data,options) -- adds split table parallel to list table
registers.sort(data,options) -- sorts results
registers.unique(data,options) -- get rid of duplicates
registers.finalize(data,options) -- split result in ranges
data.metadata.sorted = true
return data.metadata.nofsorted or 0
else
return 0
end
end
registers.analyze = analyzeregister
implement {
name = "analyzeregister",
actions = { analyzeregister, context },
arguments = {
"string",
{
{ "language" },
{ "method" },
{ "numberorder" },
{ "compress" },
{ "criterium" },
{ "pagenumber", "boolean" },
}
}
}
-- todo take conversion from index
function registers.userdata(index,name)
local data = references.internals[tonumber(index)]
return data and data.userdata and data.userdata[name] or nil
end
implement {
name = "registeruserdata",
actions = { registers.userdata, context },
arguments = { "integer", "string" }
}
-- todo: ownnumber
local function pagerange(f_entry,t_entry,is_last,prefixspec,pagespec)
local fer, ter = f_entry.references, t_entry.references
ctx_registerpagerange(
f_entry.processors and f_entry.processors[2] or "",
fer.internal or 0,
fer.realpage or 0,
function()
h_prefixpage(f_entry,prefixspec,pagespec)
end,
ter.internal or 0,
ter.lastrealpage or ter.realpage or 0,
function()
if is_last then
h_prefixlastpage(t_entry,prefixspec,pagespec) -- swaps page and realpage keys
else
h_prefixpage (t_entry,prefixspec,pagespec)
end
end
)
end
local function pagenumber(entry,prefixspec,pagespec)
local er = entry.references
ctx_registeronepage(
entry.processors and entry.processors[2] or "",
er.internal or 0,
er.realpage or 0,
function() h_prefixpage(entry,prefixspec,pagespec) end
)
end
local function packed(f_entry,t_entry)
local fer, ter = f_entry.references, t_entry.references
ctx_registerpacked(
fer.internal or 0,
ter.internal or 0
)
end
local function collapsedpage(pages)
for i=2,#pages do
local first, second = pages[i-1], pages[i]
local first_first, first_last, second_first, second_last = first[1], first[2], second[1], second[2]
local first_last_pn = first_last .references.realpage
local second_first_pn = second_first.references.realpage
local second_last_pn = second_last .references.realpage
local first_last_last = first_last .references.lastrealpage
local second_first_last = second_first.references.lastrealpage
if first_last_last then
first_last_pn = first_last_last
if second_first == second_last and second_first_pn <= first_last_pn then
-- 2=8, 5 -> 12=8
remove(pages,i)
return true
elseif second_first == second_last and second_first_pn > first_last_pn then
-- 2=8, 9 -> 2-9
pages[i-1] = { first_first, second_last }
remove(pages,i)
return true
elseif second_last_pn < first_last_pn then
-- 2=8, 3-4 -> 2=8
remove(pages,i)
return true
elseif first_last_pn < second_last_pn then
-- 2=8, 3-9 -> 2-9
pages[i-1] = { first_first, second_last }
remove(pages,i)
return true
elseif first_last_pn + 1 == second_first_pn and second_last_pn > first_last_pn then
-- 2=8, 9-11 -> 2-11
pages[i-1] = { first_first, second_last }
remove(pages,i)
return true
elseif second_first.references.lastrealpage then
-- 2=8, 9=11 -> 2-11
pages[i-1] = { first_first, second_last }
remove(pages,i)
return true
end
elseif second_first_last then
second_first_pn = second_first_last
if first_last_pn == second_first_pn then
-- 2-4, 5=9 -> 2-9
pages[i-1] = { first_first, second_last }
remove(pages,i)
return true
end
elseif first_last_pn == second_first_pn then
-- 2-3, 3-4 -> 2-4
pages[i-1] = { first_last, second_last }
remove(pages,i)
return true
end
end
return false
end
local function collapsepages(pages)
while collapsedpage(pages) do end
return #pages
end
-- todo: create an intermediate structure and flush that
function registers.flush(data,options,prefixspec,pagespec)
local compress = options.compress
local collapse_singles = compress == v_yes
local collapse_ranges = compress == v_all
local collapse_packed = compress == v_packed
local show_page_number = options.pagenumber ~= false -- true or false
local result = data.result
local maxlevel = 0
--
for i=1,#result do
local data = result[i].data
for d=1,#data do
local m = #data[d].list
if m > maxlevel then
maxlevel = m
end
end
end
if maxlevel > absmaxlevel then
maxlevel = absmaxlevel
report_registers("limiting level to %a",maxlevel)
end
--
ctx_startregisteroutput()
local done = { }
local started = false
for i=1,#result do
-- ranges need checking !
local sublist = result[i]
-- local done = { false, false, false, false }
for i=1,maxlevel do
done[i] = false
end
local data = sublist.data
local d, n = 0, 0
ctx_startregistersection(sublist.tag)
for d=1,#data do
local entry = data[d]
if entry.metadata.kind == "see" then
local list = entry.list
if #list > 1 then
list[#list] = nil
else
-- we have an \seeindex{Foo}{Bar} without Foo being defined anywhere .. somehow this message is wrong
-- report_registers("invalid see entry in register %a, reference %a",entry.metadata.name,list[1][1])
end
end
end
-- ok, this is tricky: we use e[i] delayed so we need it to be local
-- but we don't want to allocate too many entries so there we go
while d < #data do
d = d + 1
local entry = data[d]
local metadata = entry.metadata
local kind = metadata.kind
local list = entry.list
local e = { false, false, false }
for i=3,maxlevel do
e[i] = false
end
for i=1,maxlevel do
if list[i] then
e[i] = list[i][1]
end
if e[i] == done[i] then
-- skip
elseif not e[i] then
-- see ends up here
-- can't happen any more
done[i] = false
for j=i+1,maxlevel do
done[j] = false
end
elseif e[i] == "" then
done[i] = false
for j=i+1,maxlevel do
done[j] = false
end
else
done[i] = e[i]
for j=i+1,maxlevel do
done[j] = false
end
if started then
ctx_stopregisterentry()
started = false
end
if n == i then
-- ctx_stopregisterentries()
-- ctx_startregisterentries(n)
else
while n > i do
n = n - 1
ctx_stopregisterentries()
end
while n < i do
n = n + 1
ctx_startregisterentries(n)
end
end
local references = entry.references
local processors = entry.processors
local internal = references.internal or 0
local seeparent = references.seeparent or ""
local processor = processors and processors[1] or ""
-- so, we need to keep e as is (local), or we need local title = e[i] ... which might be
-- more of a problem
ctx_startregisterentry(0) -- will become a counter
started = true
if metadata then
ctx_registerentry(processor,internal,seeparent,function() h_title(e[i],metadata) end)
else
-- can this happen?
ctx_registerentry(processor,internal,seeindex,e[i])
end
end
end
if kind == 'entry' then
if show_page_number then
ctx_startregisterpages()
if collapse_singles or collapse_ranges then
-- we collapse ranges and keep existing ranges as they are
-- so we get prebuilt as well as built ranges
local first, last, prev, pages, dd, nofpages = entry, nil, entry, { }, d, 0
while dd < #data do
dd = dd + 1
local next = data[dd]
if next and next.metadata.kind == "see" then
dd = dd - 1
break
else
local el, nl = entry.list, next.list
if not equal(el,nl) then
dd = dd - 1
--~ first = nil
break
elseif next.references.lastrealpage then
nofpages = nofpages + 1
pages[nofpages] = first and { first, last or first } or { entry, entry }
nofpages = nofpages + 1
pages[nofpages] = { next, next }
first, last, prev = nil, nil, nil
elseif not first then
first, prev = next, next
elseif next.references.realpage - prev.references.realpage == 1 then -- 1 ?
last, prev = next, next
else
nofpages = nofpages + 1
pages[nofpages] = { first, last or first }
first, last, prev = next, nil, next
end
end
end
if first then
nofpages = nofpages + 1
pages[nofpages] = { first, last or first }
end
if collapse_ranges and nofpages > 1 then
nofpages = collapsepages(pages)
end
if nofpages > 0 then -- or 0
d = dd
for p=1,nofpages do
local first, last = pages[p][1], pages[p][2]
if first == last then
if first.references.lastrealpage then
pagerange(first,first,true,prefixspec,pagespec)
else
pagenumber(first,prefixspec,pagespec)
end
elseif last.references.lastrealpage then
pagerange(first,last,true,prefixspec,pagespec)
else
pagerange(first,last,false,prefixspec,pagespec)
end
end
elseif entry.references.lastrealpage then
pagerange(entry,entry,true,prefixspec,pagespec)
else
pagenumber(entry,prefixspec,pagespec)
end
elseif collapse_packed then
local first = nil
local last = nil
while true do
if not first then
first = entry
end
last = entry
if d == #data then
break
else
d = d + 1
local next = data[d]
if next.metadata.kind == "see" or not equal(entry.list,next.list) then
d = d - 1
break
else
entry = next
end
end
end
packed(first,last) -- returns internals
else
while true do
if entry.references.lastrealpage then
pagerange(entry,entry,true,prefixspec,pagespec)
else
pagenumber(entry,prefixspec,pagespec)
end
if d == #data then
break
else
d = d + 1
local next = data[d]
if next.metadata.kind == "see" or not equal(entry.list,next.list) then
d = d - 1
break
else
entry = next
end
end
end
end
ctx_stopregisterpages()
end
elseif kind == 'see' then
local t, nt = { }, 0
while true do
nt = nt + 1
t[nt] = entry
if d == #data then
break
else
d = d + 1
local next = data[d]
if next.metadata.kind ~= "see" or not equal(entry.list,next.list) then
d = d - 1
break
else
entry = next
end
end
end
ctx_startregisterseewords()
for i=1,nt do
local entry = t[i]
local seeword = entry.seeword
local seetext = seeword.text or ""
local processor = seeword.processor or (entry.processors and entry.processors[1]) or ""
local seeindex = entry.references.seeindex or ""
-- ctx_registerseeword(i,nt,processor,0,seeindex,seetext)
ctx_registerseeword(i,nt,processor,0,seeindex,function() h_title(seetext,metadata) end)
end
ctx_stopregisterseewords()
end
end
if started then
ctx_stopregisterentry()
started = false
end
while n > 0 do
ctx_stopregisterentries()
n = n - 1
end
ctx_stopregistersection()
end
ctx_stopregisteroutput()
-- for now, maybe at some point we will do a multipass or so
data.result = nil
data.metadata.sorted = false
-- temp hack for luajittex :
local entries = data.entries
for i=1,#entries do
entries[i].split = nil
end
-- collectgarbage("collect")
end
function registers.process(class,...)
if analyzeregister(class,...) > 0 then
local data = collected[class]
registers.flush(data,...)
end
end
implement {
name = "processregister",
actions = registers.process,
arguments = {
"string",
{
{ "language" },
{ "method" },
{ "numberorder" },
{ "compress" },
{ "criterium" },
{ "pagenumber", "boolean" },
},
{
{ "separatorset" },
{ "conversionset" },
{ "starter" },
{ "stopper" },
{ "set" },
{ "segments" },
{ "connector" },
},
{
{ "prefix" },
{ "separatorset" },
{ "conversionset" },
{ "starter" },
{ "stopper" },
{ "segments" },
}
}
}
-- linked registers
function registers.findinternal(tag,where,n)
-- local collected = registers.collected
local current = collected[tag]
if not current then
return 0
end
local entries = current.entries
if not entries then
return 0
end
local entry = entries[n]
if not entry then
return 0
end
local list = entry.list
local size = #list
--
local start, stop, step
if where == v_previous then
start = n - 1
stop = 1
step = -1
elseif where == v_first then
start = 1
stop = #entries
step = 1
elseif where == v_last then
start = #entries
stop = 1
step = -1
else
start = n + 1
stop = #entries
step = 1
end
--
for i=start,stop,step do
local r = entries[i]
local l = r.list
local s = #l
if s == size then
local ok = true
for i=1,size do
if list[i][1] ~= l[i][1] then
ok = false
break
end
end
if ok then
return r.references.internal or 0
end
end
end
return 0
end
interfaces.implement {
name = "findregisterinternal",
arguments = { "string", "string", "integer" },
actions = { registers.findinternal, context },
}
|