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
|
/*
# tfm_kern.c: deal with TFM kern lists.
#
# Copyright (C) 1992, 2011 Free Software Foundation, Inc.
#
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program. If not, see <http://www.gnu.org/licenses/>.
#
*/
#include "config.h"
#include "list.h"
#include "tfm.h"
/* The character RIGHT may or may not be in the list of kerns already. */
void
tfm_set_kern (list_type *kern_table, charcode_type right, real k)
{
unsigned this_right;
tfm_kern_type *new_kern;
assert (kern_table != NULL);
for (this_right = 0; this_right < LIST_SIZE (*kern_table); this_right++)
{
tfm_kern_type *kern = LIST_ELT (*kern_table, this_right);
if (kern->character == right)
{ /* Already there, just replace the value. */
kern->kern = k;
return;
}
}
/* RIGHT wasn't in the existing list. Add it to the end. */
new_kern = LIST_TAPPEND (kern_table, tfm_kern_type);
new_kern->character = right;
new_kern->kern = k;
}
/* Find the kern between the characters LEFT and RIGHT. (Return zero if
none such.) */
real
tfm_get_kern (tfm_char_type left, charcode_type right)
{
list_type kern_table;
unsigned r;
if (!TFM_CHAR_EXISTS (left))
return 0.0;
kern_table = left.kern;
for (r = 0; r < LIST_SIZE (kern_table); r++)
{
tfm_kern_type *kern = LIST_ELT (kern_table, r);
if (kern->character == right)
return kern->kern;
}
return 0.0;
}
|