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
|
if not modules then modules = { } end modules ['str-syn'] = {
version = 1.001,
comment = "companion to str-syn.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 texwrite, texsprint, format = tex.write, tex.sprint, string.format
local ctxcatcodes = tex.ctxcatcodes
-- interface to tex end
joblists = joblists or { }
joblists.collected = joblists.collected or { }
joblists.tobesaved = joblists.tobesaved or { }
local collected, tobesaved = joblists.collected, joblists.tobesaved
local function initializer()
collected, tobesaved = joblists.collected, joblists.tobesaved
end
local function finalizer()
for entry, data in next, tobesaved do
data.hash = nil
end
end
job.register('joblists.collected', joblists.tobesaved, initializer, finalizer)
local function allocate(class)
local d = tobesaved[class]
if not d then
d = {
metadata = {
language = 'en',
sorted = false,
class = class
},
entries = {
},
hash = {
}
}
tobesaved[class] = d
end
return d
end
function joblists.define(class,kind)
local data = allocate(class)
data.metadata.kind = kind
end
function joblists.register(class,kind,spec)
local data = allocate(class)
data.metadata.kind = kind -- runtime, not saved in format (yet)
if not data.hash[spec.definition.tag or ""] then
data.entries[#data.entries+1] = spec
data.hash[spec.definition.tag or ""] = spec
end
end
function joblists.registerused(class,tag)
local data = allocate(class)
local dht = data.hash[tag]
if dht then
dht.definition.used = true
end
end
function joblists.synonym(class,tag)
local data = allocate(class).hash
local d = data[tag]
if d then
local de = d.definition
de.used = true
texsprint(ctxcatcodes,de.synonym)
end
end
function joblists.meaning(class,tag)
local data = allocate(class).hash
local d = data[tag]
if d then
local de = d.definition
de.used = true
texsprint(ctxcatcodes,de.meaning)
end
end
joblists.compare = sorters.comparers.basic -- (a,b)
function joblists.filter(data,options)
local result = { }
local entries = data.entries
local all = options and options.criterium == interfaces.variables.all
for i=1,#entries do
local entry = entries[i]
if all or entry.definition.used then
result[#result+1] = entry
end
end
data.result = result
end
function joblists.prepare(data)
local strip = sorters.strip
local splitter = sorters.splitters.utf
local result = data.result
if result then
for i=1, #result do
local r = result[i]
local rd = r.definition
if rd then
local rt = rd.tag
local sortkey = (rt and rt ~= "" and rt) or rd.synonym
r.split = splitter(strip(sortkey))
end
end
end
end
function joblists.sort(data,options)
sorters.sort(data.result,joblists.compare)
end
function joblists.finalize(data,options)
local result = data.result
data.metadata.nofsorted = #result
local split = { }
for k=1,#result do
local v = result[k]
local entry, tag = sorters.firstofsplit(v)
local s = split[entry] -- keeps track of change
if not s then
s = { tag = tag, data = { } }
split[entry] = s
end
s.data[#s.data+1] = v
end
data.result = split
end
function joblists.flush(data,options) -- maybe pass the settings differently
local kind = data.metadata.kind -- hack, will be done better
--~ texsprint(ctxcatcodes,format("\\start%soutput",kind))
local result = data.result
local sorted = table.sortedkeys(result)
for k=1,#sorted do
local letter = sorted[k]
local sublist = result[letter]
local data = sublist.data
--~ texsprint(ctxcatcodes,format("\\start%ssection{%s}",kind,sublist.tag))
for d=1,#data do
local entry = data[d].definition
texsprint(ctxcatcodes,format("\\%sentry{%s}{%s}{%s}{%s}",kind,d,entry.tag,entry.synonym,entry.meaning or ""))
end
--~ texsprint(ctxcatcodes,format("\\stop%ssection",kind))
end
--~ texsprint(ctxcatcodes,format("\\stop%soutput",kind))
-- for now, maybe at some point we will do a multipass or so
data.result = nil
data.metadata.sorted = false
end
function joblists.analysed(class,options)
local data = joblists.collected[class]
if data and data.entries then
options = options or { }
sorters.setlanguage(options.language)
joblists.filter(data,options) -- filters entries to result
joblists.prepare(data,options) -- adds split table parallel to list table
joblists.sort(data,options) -- sorts entries in result
joblists.finalize(data,options) -- do things with data.entries
data.metadata.sorted = true
end
return data and data.metadata.sorted and data.result and next(data.result)
end
function joblists.process(class,options)
if joblists.analysed(class,options) then
joblists.flush(joblists.collected[class],options)
end
end
|
