if not modules then modules = { } end modules ['node-ini'] = { version = 1.001, comment = "companion to node-ini.mkiv", author = "Hans Hagen, PRAGMA-ADE, Hasselt NL", copyright = "PRAGMA ADE / ConTeXt Development Team", license = "see context related readme files" } --[[ldx--
Most of the code that had accumulated here is now separated in modules.
--ldx]]-- -- this module is being reconstructed -- -- todo: datatype table per node type -- todo: query names with new node.subtypes local next, type, tostring = next, type, tostring local gsub = string.gsub local concat, remove = table.concat, table.remove local sortedhash, sortedkeys, swapped = table.sortedhash, table.sortedkeys, table.swapped --[[ldx--Access to nodes is what gives
When manipulating node lists in
First of all, we noticed that the bottleneck is more with excessive
callbacks (some gets called very often) and the conversion from and to
This resulted in two special situations in passing nodes back to
Insertion is handled (at least in
When we collapse (something that we only do when really needed), we also ignore the empty nodes. [This is obsolete!]
--ldx]]-- -- local gf = node.direct.getfield -- local n = table.setmetatableindex("number") -- function node.direct.getfield(a,b) n[b] = n[b] + 1 print(b,n[b]) return gf(a,b) end nodes = nodes or { } local nodes = nodes nodes.handlers = nodes.handlers or { } local mark = utilities.storage.mark local allocate = utilities.storage.allocate local formatcolumns = utilities.formatters.formatcolumns local getsubtypes = node.subtypes -- local listcodes = allocate { -- [0] = "unknown", -- [1] = "line", -- [2] = "box", -- [3] = "indent", -- [4] = "alignment", -- row or column -- [5] = "cell", -- [6] = "equation", -- [7] = "equationnumber", -- } local listcodes = mark(getsubtypes("list")) -- local rulecodes = allocate { -- [0] = "normal", -- [1] = "box", -- [2] = "image", -- [3] = "empty", -- [4] = "user", -- } local rulecodes = mark(getsubtypes("rule")) if not rulecodes[5] then rulecodes[5] = "over" rulecodes[6] = "under" rulecodes[7] = "fraction" rulecodes[8] = "radical" end -- local glyphcodes = allocate { -- [0] = "character", -- [1] = "glyph", -- [2] = "ligature", -- [3] = "ghost", -- [4] = "left", -- [5] = "right", -- } local glyphcodes = mark(getsubtypes("glyph")) -- local disccodes = allocate { -- [0] = "discretionary", -- \discretionary -- [1] = "explicit", -- \- -- [2] = "automatic", -- following a - -- [3] = "regular", -- by hyphenator: simple -- [4] = "first", -- by hyphenator: hard first item -- [5] = "second", -- by hyphenator: hard second item -- } local disccodes = mark(getsubtypes("disc")) -- local skipcodes = allocate { -- [ 0] = "userskip", -- [ 1] = "lineskip", -- [ 2] = "baselineskip", -- [ 3] = "parskip", -- [ 4] = "abovedisplayskip", -- [ 5] = "belowdisplayskip", -- [ 6] = "abovedisplayshortskip", -- [ 7] = "belowdisplayshortskip", -- [ 8] = "leftskip", -- [ 9] = "rightskip", -- [ 10] = "topskip", -- [ 11] = "splittopskip", -- [ 12] = "tabskip", -- [ 13] = "spaceskip", -- [ 14] = "xspaceskip", -- [ 15] = "parfillskip", -- [ 16] = "mathskip", -- experiment -- [ 17] = "thinmuskip", -- [ 18] = "medmuskip", -- [ 19] = "thickmuskip", -- [ 98] = "conditionalmathglue", -- [ 99] = "muskip", -- [100] = "leaders", -- [101] = "cleaders", -- [102] = "xleaders", -- [103] = "gleaders", -- } local skipcodes = mark(getsubtypes("glue")) -- local leadercodes = allocate { -- [100] = "leaders", -- [101] = "cleaders", -- [102] = "xleaders", -- [103] = "gleaders", -- } local leadercodes = mark(getsubtypes("leader")) -- local fillcodes = allocate { -- [0] = "stretch", -- [1] = "fi", -- [2] = "fil", -- [3] = "fill", -- [4] = "filll", -- } local fillcodes = mark(getsubtypes("fill")) -- for now: local boundarycodes = allocate { [0] = "cancel", [1] = "user", [2] = "protrusion", [3] = "word", } -- local boundarycodes = mark(getsubtypes("boundary")) -- local penaltycodes = allocate { -- unfortunately not used (yet) -- [ 0] = "userpenalty", -- } local penaltycodes = mark(getsubtypes("penalty")) table.setmetatableindex(penaltycodes,function(t,k) return "userpenalty" end) -- not used anyway -- local kerncodes = allocate { -- [0] = "fontkern", -- [1] = "userkern", -- [2] = "accentkern", -- [3] = "italiccorrection", -- } local kerncodes = mark(getsubtypes("kern")) -- local margincodes = allocate { -- [0] = "left", -- [1] = "right", -- } local margincodes = mark(getsubtypes("marginkern")) -- local mathcodes = allocate { -- [0] = "beginmath", -- [1] = "endmath", -- } local mathcodes = mark(getsubtypes("math")) -- local noadcodes = allocate { -- simple nodes -- [ 0] = "ord", -- [ 1] = "opdisplaylimits", -- [ 2] = "oplimits", -- [ 3] = "opnolimits", -- [ 4] = "bin", -- [ 5] = "rel", -- [ 6] = "open", -- [ 7] = "close", -- [ 8] = "punct", -- [ 9] = "inner", -- [10] = "under", -- [11] = "over", -- [12] = "vcenter", -- } local noadcodes = mark(getsubtypes("noad")) -- local radicalcodes = allocate { -- [0] = "radical", -- [1] = "uradical", -- [2] = "uroot", -- [3] = "uunderdelimiter", -- [4] = "uoverdelimiter", -- [5] = "udelimiterunder", -- [6] = "udelimiterover", -- } local radicalcodes = mark(getsubtypes("radical")) -- local accentcodes = allocate { -- [0] = "bothflexible", -- [1] = "fixedtop", -- [2] = "fixedbottom", -- [3] = "fixedboth", -- } local accentcodes = mark(getsubtypes("accent")) -- local fencecodes = allocate { -- [0] = "unset", -- [1] = "left", -- [2] = "middle", -- [3] = "right", -- [4] = "no", -- } local fencecodes = mark(getsubtypes("fence")) -- maybe we also need fractioncodes local function simplified(t) local r = { } for k, v in next, t do r[k] = gsub(v,"_","") end return r end local nodecodes = simplified(node.types()) local whatcodes = simplified(node.whatsits()) local usercodes = allocate { [ 97] = "attributes", -- a [100] = "number", -- d [108] = "lua", -- l [110] = "nodes", -- n [115] = "string", -- s [116] = "tokens" -- t } local noadoptions = allocate { set = 0x08, unused_1 = 0x00 + 0x08, unused_2 = 0x01 + 0x08, axis = 0x02 + 0x08, no_axis = 0x04 + 0x08, exact = 0x10 + 0x08, left = 0x11 + 0x08, middle = 0x12 + 0x08, right = 0x14 + 0x08, } skipcodes = allocate(swapped(skipcodes,skipcodes)) boundarycodes = allocate(swapped(boundarycodes,boundarycodes)) noadcodes = allocate(swapped(noadcodes,noadcodes)) radicalcodes = allocate(swapped(radicalcodes,radicalcodes)) nodecodes = allocate(swapped(nodecodes,nodecodes)) whatcodes = allocate(swapped(whatcodes,whatcodes)) listcodes = allocate(swapped(listcodes,listcodes)) glyphcodes = allocate(swapped(glyphcodes,glyphcodes)) kerncodes = allocate(swapped(kerncodes,kerncodes)) penaltycodes = allocate(swapped(penaltycodes,penaltycodes)) mathcodes = allocate(swapped(mathcodes,mathcodes)) fillcodes = allocate(swapped(fillcodes,fillcodes)) margincodes = allocate(swapped(margincodes,margincodes)) disccodes = allocate(swapped(disccodes,disccodes)) accentcodes = allocate(swapped(accentcodes,accentcodes)) fencecodes = allocate(swapped(fencecodes,fencecodes)) rulecodes = allocate(swapped(rulecodes,rulecodes)) leadercodes = allocate(swapped(leadercodes,leadercodes)) usercodes = allocate(swapped(usercodes,usercodes)) noadoptions = allocate(swapped(noadoptions,noadoptions)) nodes.skipcodes = skipcodes nodes.boundarycodes = boundarycodes nodes.noadcodes = noadcodes nodes.nodecodes = nodecodes nodes.whatcodes = whatcodes nodes.listcodes = listcodes nodes.glyphcodes = glyphcodes nodes.kerncodes = kerncodes nodes.penaltycodes = penaltycodes nodes.mathcodes = mathcodes nodes.fillcodes = fillcodes nodes.margincodes = margincodes nodes.disccodes = disccodes nodes.accentcodes = accentcodes nodes.radicalcodes = radicalcodes nodes.fencecodes = fencecodes nodes.rulecodes = rulecodes nodes.leadercodes = leadercodes nodes.usercodes = usercodes nodes.noadoptions = noadoptions nodes.gluecodes = skipcodes -- more official nodes.whatsitcodes = whatcodes -- more official nodes.marginkerncodes = margincodes nodes.discretionarycodes = disccodes listcodes.row = listcodes.alignment listcodes.column = listcodes.alignment kerncodes.kerning = kerncodes.fontkern kerncodes.italiccorrection = kerncodes.italiccorrection or 1 -- new nodes.codes = allocate { -- mostly for listing glue = skipcodes, boundary = boundarycodes, noad = noadcodes, node = nodecodes, hlist = listcodes, vlist = listcodes, glyph = glyphcodes, kern = kerncodes, penalty = penaltycodes, math = mathnodes, fill = fillcodes, margin = margincodes, disc = disccodes, whatsit = whatcodes, accent = accentcodes, fence = fencecodes, rule = rulecodes, leader = leadercodes, user = usercodes, noadoptions = noadoptions, } nodes.noadoptions = { set = 0x08, unused_1 = 0x00 + 0x08, unused_2 = 0x01 + 0x08, axis = 0x02 + 0x08, no_axis = 0x04 + 0x08, exact = 0x10 + 0x08, left = 0x11 + 0x08, middle = 0x12 + 0x08, right = 0x14 + 0x08, } local report_codes = logs.reporter("nodes","codes") function nodes.showcodes() local t = { } for name, codes in sortedhash(nodes.codes) do local sorted = sortedkeys(codes) for i=1,#sorted do local s = sorted[i] if type(s) ~= "number" then t[#t+1] = { name, s, codes[s] } end end end formatcolumns(t) for k=1,#t do report_codes (t[k]) end end trackers.register("system.showcodes", nodes.showcodes) if not nodecodes.dir then report_codes("use a newer version of luatex") os.exit() end -- We don't need this sanitize-after-callback in ConTeXt and by disabling it we -- also have a way to check if LuaTeX itself does the right thing. if node.fix_node_lists then node.fix_node_lists(false) end