diff options
author | Philipp Gesang <phg@phi-gamma.net> | 2016-04-18 20:24:16 +0200 |
---|---|---|
committer | Philipp Gesang <phg@phi-gamma.net> | 2016-04-18 20:24:16 +0200 |
commit | b8b264a266beed6f95e53ea1801bd96f345fc745 (patch) | |
tree | ad92896a7893c7f22b22250c471e603d8ea30581 /src/fontloader/misc/fontloader-font-gbn.lua | |
parent | 81566459ade8e03f22f19ebae7003aaa9b1e83ad (diff) | |
download | luaotfload-b8b264a266beed6f95e53ea1801bd96f345fc745.tar.gz |
[fontloader] sync with Context as of 2016-04-18
Diffstat (limited to 'src/fontloader/misc/fontloader-font-gbn.lua')
-rw-r--r-- | src/fontloader/misc/fontloader-font-gbn.lua | 24 |
1 files changed, 23 insertions, 1 deletions
diff --git a/src/fontloader/misc/fontloader-font-gbn.lua b/src/fontloader/misc/fontloader-font-gbn.lua index a645a97..daa072b 100644 --- a/src/fontloader/misc/fontloader-font-gbn.lua +++ b/src/fontloader/misc/fontloader-font-gbn.lua @@ -20,6 +20,7 @@ local nuts = nodes.nuts -- context abstraction of direct nodes local traverse_id = nuts.traverse_id local remove_node = nuts.remove +local free_node = nuts.free local glyph_code = nodes.nodecodes.glyph local disc_code = nodes.nodecodes.disc @@ -30,11 +31,13 @@ local tonut = nuts.tonut local getfont = nuts.getfont local getchar = nuts.getchar local getid = nuts.getid +local getboth = nuts.getboth local getprev = nuts.getprev local getnext = nuts.getnext local getdisc = nuts.getdisc local setchar = nuts.setchar local setlink = nuts.setlink +local setprev = nuts.setprev -- from now on we apply ligaturing and kerning here because it might interfere with complex -- opentype discretionary handling where the base ligature pass expect some weird extra @@ -136,7 +139,26 @@ function nodes.handlers.nodepass(head) end if redundant then for i=1,#redundant do - remove_node(nuthead,redundant[i],true) + local r = redundant[i] + local p, n = getboth(r) + if r == nuthead then + nuthead = n + setprev(n) + else + setlink(p,n) + end + if b > 0 then + for i=1,b do + local bi = basefonts[i] + if r == bi[1] then + bi[1] = n + end + if r == bi[2] then + bi[2] = n + end + end + end + free_node(r) end end for d in traverse_id(disc_code,nuthead) do |