summaryrefslogtreecommitdiff
path: root/tex/context/base/char-cmp.lua
diff options
context:
space:
mode:
authorMarius <mariausol@gmail.com>2010-10-07 15:53:01 +0300
committerMarius <mariausol@gmail.com>2010-10-07 15:53:01 +0300
commit2040be98036288cccf0384479819e8c0c17e8d8d (patch)
tree1e775ec1491e701839806c9768d865ab829adccc /tex/context/base/char-cmp.lua
parent592d84d67cf9d58d8a205b46bb912ed9fe84d7a2 (diff)
downloadcontext-2040be98036288cccf0384479819e8c0c17e8d8d.tar.gz
beta 2010.10.06 10:20
Diffstat (limited to 'tex/context/base/char-cmp.lua')
-rw-r--r--tex/context/base/char-cmp.lua41
1 files changed, 23 insertions, 18 deletions
diff --git a/tex/context/base/char-cmp.lua b/tex/context/base/char-cmp.lua
index 1f414d502..be75dc0fd 100644
--- a/tex/context/base/char-cmp.lua
+++ b/tex/context/base/char-cmp.lua
@@ -34,24 +34,10 @@ characters.basedigits = allocate {
--[[ldx--
<p>The next three tables can for instance be be used to enhance
kerning tables that lack kerning pairs for these special characters.
-Of course they may come in handy elsewhere too</p>
+Of course they may come in handy elsewhere too. Using shcodes is
+not handy here (incpmplete).</p>
--ldx]]--
--- we can use shcodes, but then we also need slcode and srcode
---
--- AEligature
--- => slcode == ub('A')
--- => srcode == ub('E')
--- or
--- => shcode == { ub('A'), ub('E') }
--- => reduction = "AE"
---
--- eacute
--- => shcode == ub('A')
--- or
--- => shcode == { ub('a') }
--- => reduction = "a"
-
uncomposed.left = allocate {
AEligature = "A", aeligature = "a",
OEligature = "O", oeligature = "o",
@@ -191,9 +177,28 @@ uncomposed.both = allocate {
}
+-- adobename ... inclomplete
+--
+-- if characters.data then
+-- uncomposed.left, uncomposed.right, uncomposed.both = allocate(), allocate(), allocate()
+-- for k,v in next, characters.data do
+-- local s = v.shcode
+-- if s then
+-- local name = v.adobename
+-- if not name then
+-- -- table.print(v) -- only used for afm anyway
+-- elseif type(s) == "table" then
+-- uncomposed.left[name], uncomposed.right[name] = s[1], s[#s]
+-- else
+-- uncomposed.both[name] = s
+-- end
+-- end
+-- end
+-- end
+
--[[ldx--
-<p>The following function is used in the indexing code, where
-we need some sort of default fallback mapping.</p>
+<p>The following function is used in the indexing code, where we
+need some sort of default fallback mapping. (This is obsolete!)</p>
--ldx]]--
function characters.uncompose(n) -- n == string|number, returns string