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 local utf = unicode.utf8 local next, type = next, type local format, concat, match, utfchar = string.format, table.concat, string.match, utf.char local chardata = characters and characters.data --[[ldx--We start with a registration system for atributes so that we can use the symbolic names later on.
--ldx]]-- attributes = attributes or { } attributes.names = attributes.names or { } attributes.numbers = attributes.numbers or { } attributes.list = attributes.list or { } attributes.unsetvalue = -0x7FFFFFFF storage.register("attributes/names", attributes.names, "attributes.names") storage.register("attributes/numbers", attributes.numbers, "attributes.numbers") storage.register("attributes/list", attributes.list, "attributes.list") local names, numbers, list = attributes.names, attributes.numbers, attributes.list function attributes.define(name,number) -- at the tex end if not numbers[name] then numbers[name], names[number], list[number] = number, name, { } end end --[[ldx--We can use the attributes in the range 127-255 (outside user space). These
are only used when no attribute is set at the \TEX\ end which normally
happens in
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]]-- nodes = nodes or { } local hlist = node.id('hlist') local vlist = node.id('vlist') local glyph = node.id('glyph') local glue = node.id('glue') local penalty = node.id('penalty') local kern = node.id('kern') local whatsit = node.id('whatsit') local traverse_id = node.traverse_id local traverse = node.traverse local free_node = node.free local remove_node = node.remove function nodes.remove(head, current, free_too) local t = current head, current = remove_node(head,current) if t then if free_too then free_node(t) t = nil else t.next, t.prev = nil, nil end end return head, current, t end function nodes.delete(head,current) return nodes.remove(head,current,true) end nodes.before = node.insert_before nodes.after = node.insert_after -- we need to test this, as it might be fixed now function nodes.before(h,c,n) if c then if c == h then n.next = h n.prev = nil h.prev = n else local cp = c.prev n.next = c n.prev = cp if cp then cp.next = n end c.prev = n return h, n end end return n, n end function nodes.after(h,c,n) if c then local cn = c.next if cn then n.next = cn cn.prev = n else n.next = nil end c.next = n n.prev = c return h, n end return n, n end function nodes.replace(head,current,new) if current and next then local p, n = current.prev, current.next new.prev, new.next = p, n if p then p.next = new else head = new end if n then n.prev = new end free_node(current) end return head, current end -- will move local function count(stack,flat) local n = 0 while stack do local id = stack.id if not flat and id == hlist or id == vlist then local list = stack.list if list then n = n + 1 + count(list) -- self counts too else n = n + 1 end else n = n + 1 end stack = stack.next end return n end nodes.count = count -- new function attributes.ofnode(n) local a = n.attr if a then local names = attributes.names a = a.next while a do local number, value = a.number, a.value texio.write_nl(format("%s : attribute %3i, value %4i, name %s",tostring(n),number,value,names[number] or '?')) a = a.next end end end local left, space = lpeg.P("<"), lpeg.P(" ") nodes.filterkey = left * (1-left)^0 * left * space^0 * lpeg.C((1-space)^0)