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
|
if not modules then modules = { } end modules ['strc-reg'] = {
version = 1.001,
comment = "companion to strc-reg.tex",
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 texwrite, texsprint, texcount = tex.write, tex.sprint, tex.count
local format, gmatch = string.format, string.gmatch
local utfchar = utf.char
local ctxcatcodes = tex.ctxcatcodes
local variables = interfaces.variables
local helpers = structure.helpers
local sections = structure.sections
local documents = structure.documents
local pages = structure.pages
-- to be shared, but tested first
local function filter_collected(names,criterium,number,collected,prevmode)
if not criterium or criterium == "" then criterium = variables.all end
local data = documents.data
local numbers, depth = data.numbers, data.depth
local hash, result, all = { }, { }, not names or names == "" or names == variables.all
if not all then
for s in gmatch(names,"[^, ]+") do
hash[s] = true
end
end
if criterium == variables.all or criterium == variables.text then
for i=1,#collected do
local v = collected[i]
if all then
result[#result+1] = v
else
local vmn = v.metadata and v.metadata.name
if hash[vmn] then
result[#result+1] = v
end
end
end
elseif criterium == variables.current then
for i=1,#collected do
local v = collected[i]
local sectionnumber = jobsections.collected[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
result[#result+1] = 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
result[#result+1] = v
end
end
end
end
end
elseif criterium == variables.previous then
for i=1,#collected do
local v = collected[i]
local sectionnumber = jobsections.collected[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
result[#result+1] = v
end
end
end
end
elseif criterium == variables["local"] then
if sections.autodepth(data.numbers) == 0 then
return filter_collected(names,variables.all,number,collected,prevmode)
else
return filter_collected(names,variables.current,number,collected,prevmode)
end
else -- sectionname, number
local depth = sections.getlevel(criterium)
local number = tonumber(number) or 0
for i=1,#collected do
local v = collected[i]
local r = v.references
if r then
local sectionnumber = jobsections.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 (number == 0 or cnumbers[depth] == number) then
result[#result+1] = v
end
end
end
end
end
end
return result
end
structure.filter_collected = filter_collected
-- 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
jobregisters = jobregisters or { }
jobregisters.collected = jobregisters.collected or { }
jobregisters.tobesaved = jobregisters.tobesaved or { }
local tobesaved, collected = jobregisters.tobesaved, jobregisters.collected
local function initializer()
tobesaved, collected = jobregisters.tobesaved, jobregisters.collected
local internals = jobreferences.internals
for name, list in next, collected do
local entries = list.entries
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
internals[internal] = entry
end
end
end
end
end
job.register('jobregisters.collected', jobregisters.tobesaved, initializer)
local function allocate(class)
local d = tobesaved[class]
if not d then
d = {
metadata = {
language = 'en',
sorted = false,
class = class
},
entries = { },
}
tobesaved[class] = d
end
return d
end
jobregisters.define = allocate
local entrysplitter = lpeg.Ct(lpeg.splitat('+'))
local tagged = { }
local function preprocessentries(rawdata)
local entries = rawdata.entries
if entries then
local et = entrysplitter:match(entries[1]) -- alse &
local kt = entrysplitter:match(entries[2]) -- alse &
entries = { }
for k=1,#et do
entries[k] = { et[k] or "", kt[k] or "" }
end
rawdata.list = entries
rawdata.entries = nil
else
rawdata.list = { "", "" } -- br
end
end
function jobregisters.store(rawdata) -- metadata, references, entries
local data = allocate(rawdata.metadata.name).entries
local references = rawdata.references
references.realpage = references.realpage or 0 -- just to be sure as it can be refered to
preprocessentries(rawdata)
data[#data+1] = rawdata
local label = references.label
if label and label ~= "" then tagged[label] = #data end
texwrite(#data)
end
function jobregisters.enhance(name,n)
local r = tobesaved[name].entries[n]
if r then
r.references.realpage = texcount.realpageno
end
end
function jobregisters.extend(name,tag,rawdata) -- maybe do lastsection internally
if type(tag) == "string" then
tag = tagged[tag]
end
if tag then
local r = tobesaved[name].entries[tag]
if r then
local rr = r.references
rr.lastrealpage = texcount.realpageno
rr.lastsection = structure.sections.currentid()
if rawdata then
preprocessentries(rawdata)
for k,v in pairs(rawdata) do
if not r[k] then
r[k] = v
else
local rk = r[k]
for kk,vv in pairs(v) do
if vv ~= "" then
rk[kk] = vv
end
end
end
end
end
end
end
end
-- sorting and rendering
function jobregisters.compare(a,b)
local result = 0
local compare = sorters.comparers.basic
local ea, eb = a.split, b.split
local na, nb = #ea, #eb
local max = na
if nb < max then max = nb end
for i=1,max do
if result == 0 then
result = compare(ea[i],eb[i])
else
return result
end
end
if result ~= 0 then
return result
elseif na > nb then
return 1
elseif nb > na then
return -1
elseif a.metadata.kind == 'entry' then -- e/f/t
local page_a, page_b = a.references.realpage, b.references.realpage
if not page_a or not page_b then
--~ print(table.serialize(a),table.serialize(b))
return 0
elseif page_a < page_b then
return -1
elseif page_a > page_b then
return 1
end
else
return 0
end
end
function jobregisters.filter(data,options)
data.result = structure.filter_collected(nil,options.criterium,options.number,data.entries,true)
end
function jobregisters.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, split = result[i], { }
local list = entry.list
if list then
for l=1,#list do
local ll = list[l]
local word, key = ll[1], ll[2]
if not key or key == "" then
key = word
end
split[l] = splitter(strip(key))
end
end
entry.split = split
end
end
end
function jobregisters.sort(data,options)
sorters.sort(data.result,jobregisters.compare)
end
function jobregisters.unique(data,options)
local result, prev, equal = { }, nil, table.are_equal
for _,v in ipairs(data.result) do
if not prev then
result[#result+1], prev = v, v
else
local pr, vr = prev.references, v.references
if not equal(prev.list,v.list) then
result[#result+1], prev = v, v
elseif pr.realpage ~= vr.realpage then
result[#result+1], prev = v, v
else
local pl, vl = pr.lastrealpage, vr.lastrealpage
if pl or vl then
if not vl then
result[#result+1], prev = v, v
elseif not pl then
result[#result+1], prev = v, v
elseif pl ~= vl then
result[#result+1], prev = v, v
end
end
end
end
end
data.result = result
end
function jobregisters.finalize(data,options)
local result = data.result
data.metadata.nofsorted = #result
local split = { }
-- maps character to index (order)
for k=1,#result do
local v = result[k]
local entry, tag = sorters.firstofsplit(v.split)
local s = split[tag] -- keeps track of change
if not s then
s = { tag = tag, data = { } }
split[tag] = s
end
s.data[#s.data+1] = v
end
data.result = split
end
function jobregisters.analysed(class,options)
local data = collected[class]
if data and data.entries then
sorters.language = options.language or sorters.defaultlanguage
jobregisters.filter(data,options) -- filter entries into results (criteria)
jobregisters.prepare(data,options) -- adds split table parallel to list table
jobregisters.sort(data,options) -- sorts results
jobregisters.unique(data,options) -- get rid of duplicates
jobregisters.finalize(data,options) -- split result in ranges
data.metadata.sorted = true
return data.metadata.nofsorted or 0
else
return 0
end
end
-- todo take conversion from index
function jobregisters.flush(data,options,prefixspec,pagespec)
local equal = table.are_equal
texsprint(ctxcatcodes,"\\startregisteroutput")
local collapse_singles = options.compress == interfaces.variables.yes
local collapse_ranges = options.compress == interfaces.variables.all
local result = data.result
-- todo ownnumber
local function pagenumber(entry)
local er = entry.references
texsprint(ctxcatcodes,format("\\registeronepage{%s}{%s}{",er.internal or 0,er.realpage or 0)) -- internal realpage content
helpers.prefixpage(entry,prefixspec,pagespec)
texsprint(ctxcatcodes,"}")
end
local function pagerange(f_entry,t_entry,is_last)
local er = f_entry.references
texsprint(ctxcatcodes,format("\\registerpagerange{%s}{%s}{",er.internal or 0,er.realpage or 0))
helpers.prefixpage(f_entry,prefixspec,pagespec)
local er = t_entry.references
texsprint(ctxcatcodes,format("}{%s}{%s}{",er.internal or 0,er.realpage or 0))
if is_last then
helpers.prefixlastpage(t_entry,prefixspec,pagespec) -- swaps page and realpage keys
else
helpers.prefixpage(t_entry,prefixspec,pagespec)
end
texsprint(ctxcatcodes,"}")
end
-- ranges need checking !
for k, letter in ipairs(table.sortedkeys(result)) do
local sublist = result[letter]
local done = { false, false, false, false }
local data = sublist.data
local d, n = 0, 0
texsprint(ctxcatcodes,format("\\startregistersection{%s}",sublist.tag))
while d < #data do
d = d + 1
local entry = data[d]
local e = { false, false, false, false }
for i=1,4 do -- max 4
if entry.list[i] then
e[i] = entry.list[i][1]
end
if e[i] ~= done[i] then
if e[i] and e[i] ~= "" then
done[i] = e[i]
if n == i then
texsprint(ctxcatcodes,format("\\stopregisterentries\\startregisterentries{%s}",n))
else
while n > i do
n = n - 1
texsprint(ctxcatcodes,"\\stopregisterentries")
end
while n < i do
n = n + 1
texsprint(ctxcatcodes,format("\\startregisterentries{%s}",n))
end
end
texsprint(ctxcatcodes,format("\\registerentry{%s}",e[i]))
else
done[i] = false
end
end
end
local kind = entry.metadata.kind
if kind == 'entry' then
texsprint(ctxcatcodes,"\\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 = entry, nil, entry
local pages = { }
local dd = d
while dd < #data do
dd = dd + 1
local next = data[dd]
local el, nl = entry.list, next.list
if not equal(el,nl) then
dd = dd - 1
--~ first = nil
break
elseif next.references.lastrealpage then
if first then
pages[#pages+1] = { first, last or first }
else
pages[#pages+1] = { entry, entry }
end
pages[#pages+1] = { 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
pages[#pages+1] = { first, last or first }
first, last, prev = next, nil, next
end
end
if first then
pages[#pages+1] = { first, last or first }
end
if collapse_ranges and #pages > 1 then
-- ok, not that efficient
local function doit()
local function bubble(i)
for j=i,#pages-1 do
pages[j] = pages[j+1]
end
pages[#pages] = nil
end
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
bubble(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 }
bubble(i)
return true
elseif second_last_pn < first_last_pn then
-- 2=8, 3-4 -> 2=8
bubble(i)
return true
elseif first_last_pn < second_last_pn then
-- 2=8, 3-9 -> 2-9
pages[i-1] = { first_first, second_last }
bubble(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 }
bubble(i)
return true
elseif second_first.references.lastrealpage then
-- 2=8, 9=11 -> 2-11
pages[i-1] = { first_first, second_last }
bubble(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 }
bubble(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 }
bubble(i)
return true
end
end
return false
end
while doit() do end
end
--
if #pages > 0 then -- or 0
d = dd
for p=1,#pages do
local first, last = pages[p][1], pages[p][2]
if first == last then
if first.references.lastrealpage then
pagerange(first,first,true)
else
pagenumber(first)
end
elseif last.references.lastrealpage then
pagerange(first,last,true)
else
pagerange(first,last,false)
end
end
else
if entry.references.lastrealpage then
pagerange(entry,entry,true)
else
pagenumber(entry)
end
end
else
while true do
if entry.references.lastrealpage then
pagerange(entry,entry,true)
else
pagenumber(entry)
end
if d == #data then
break
else
d = d + 1
local next = data[d]
if not equal(entry.list,next.list) then
d = d - 1
break
else
entry = next
end
end
end
end
texsprint(ctxcatcodes,"\\stopregisterpages")
elseif kind == 'see' then
-- maybe some day more words
texsprint(ctxcatcodes,"\\startregisterseewords")
texsprint(ctxcatcodes,format("\\registeroneword{0}{0}{%s}",entry.seeword.text)) -- todo: internal
texsprint(ctxcatcodes,"\\stopregisterseewords")
end
end
while n > 0 do
texsprint(ctxcatcodes,"\\stopregisterentries")
n = n - 1
end
texsprint(ctxcatcodes,"\\stopregistersection")
end
texsprint(ctxcatcodes,"\\stopregisteroutput")
-- for now, maybe at some point we will do a multipass or so
data.result = nil
data.metadata.sorted = false
end
function jobregisters.analyse(class,options)
texwrite(jobregisters.analysed(class,options))
end
function jobregisters.process(class,...)
if jobregisters.analysed(class,...) > 0 then
jobregisters.flush(collected[class],...)
end
end
|