/usr/share/perl5/Font/TTF/Coverage.pm is in libfont-ttf-perl 1.04-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 | package Font::TTF::Coverage;
=head1 NAME
Font::TTF::Coverage - Opentype coverage and class definition objects
=head1 DESCRIPTION
Coverage tables and class definition objects are virtually identical concepts
in OpenType. Their difference comes purely in their storage. Therefore we can
say that a coverage table is a class definition in which the class definition
for each glyph is the corresponding index in the coverage table. The resulting
data structure is that a Coverage table has the following fields:
=over
=item cover
A boolean to indicate whether this table is a coverage table (TRUE) or a
class definition (FALSE)
=item val
A hash of glyph ids against values (either coverage index or class value)
=item fmt
The storage format used is given here, but is recalculated when the table
is written out.
=item count
A count of the elements in a coverage table for use with add. Each subsequent
addition is added with the current count and increments the count.
=item max
Maximum class value in a class table.
=back
=head1 METHODS
=cut
=head2 new($isCover [, vals])
Creates a new coverage table or class definition table, depending upon the
value of $isCover. if $isCover then vals may be a list of glyphs to include in order.
If no $isCover, then vals is a hash of glyphs against class values.
=cut
our $dontsort;
sub new
{
my ($class) = shift;
my ($isCover) = shift;
my ($self) = {};
$self->{'cover'} = $isCover;
if ($isCover)
{
$self->{'count'} = 0;
my ($v);
foreach $v (@_)
{ $self->{'val'}{$v} = $self->{'count'}++; }
}
else
{
$self->{'max'} = 0;
$self->{'val'} = {@_};
foreach (values %{$self->{'val'}}) {$self->{'max'} = $_ if $_ > $self->{'max'}}
}
bless $self, $class;
}
=head2 read($fh)
Reads the coverage/class table from the given file handle
=cut
sub read
{
my ($self, $fh) = @_;
my ($dat, $fmt, $num, $i, $c);
$fh->read($dat, 4);
($fmt, $num) = unpack("n2", $dat);
$self->{'fmt'} = $fmt;
if ($self->{'cover'})
{
if ($fmt == 1)
{
$fh->read($dat, $num << 1);
map {$self->{'val'}{$_} = $i++} unpack("n*", $dat);
$self->{'count'} = $num;
} elsif ($fmt == 2)
{
$fh->read($dat, $num * 6);
for ($i = 0; $i < $num; $i++)
{
($first, $last, $c) = unpack("n3", substr($dat, $i * 6, 6));
map {$self->{'val'}{$_} = $c++} ($first .. $last);
}
$self->{'count'} = $c;
}
} elsif ($fmt == 1)
{
$fh->read($dat, 2);
$first = $num;
($num) = unpack("n", $dat);
$fh->read($dat, $num << 1);
map {$self->{'val'}{$first++} = $_; $self->{'max'} = $_ if ($_ > $self->{'max'})} unpack("n*", $dat);
} elsif ($fmt == 2)
{
$fh->read($dat, $num * 6);
for ($i = 0; $i < $num; $i++)
{
($first, $last, $c) = unpack("n3", substr($dat, $i * 6, 6));
map {$self->{'val'}{$_} = $c} ($first .. $last);
$self->{'max'} = $c if ($c > $self->{'max'});
}
}
$self;
}
=head2 out($fh, $state)
Writes the coverage/class table to the given file handle. If $state is 1 then
the output string is returned rather than being output to a filehandle.
=cut
sub out
{
my ($self, $fh, $state) = @_;
my ($g, $eff, $grp, $out);
my ($shipout) = ($state ? sub {$out .= $_[0];} : sub {$fh->print($_[0]);});
my (@gids) = sort {$a <=> $b} keys %{$self->{'val'}};
if ($self->{'cover'})
{ $self->sort() unless ($self->{'dontsort'} or $dontsort); }
else
{ @gids = grep {$self->{'val'}{$_} > 0} @gids;} # class value=0 is not explicitly coded in class table
$fmt = 1; $grp = 1; $eff = 0;
for ($i = 1; $i <= $#gids; $i++)
{
if ($self->{'val'}{$gids[$i]} < $self->{'val'}{$gids[$i-1]} && $self->{'cover'})
{
$fmt = 2;
last;
} elsif ($gids[$i] == $gids[$i-1] + 1 && ($self->{'cover'} || $self->{'val'}{$gids[$i]} == $self->{'val'}{$gids[$i-1]}))
{ $eff++; }
else
{
$grp++;
$eff += $gids[$i] - $gids[$i-1] if (!$self->{'cover'});
}
}
# if ($self->{'cover'})
{ $fmt = 2 if ($eff / $grp > 3 || scalar (@gids) == 0); }
# else
# { $fmt = 2 if ($grp > 1); }
if ($fmt == 1 && $self->{'cover'})
{
my ($last) = 0;
&$shipout(pack('n2', 1, scalar @gids));
&$shipout(pack('n*', @gids));
} elsif ($fmt == 1)
{
my ($last) = $gids[0];
&$shipout(pack("n3", 1, $last, $gids[-1] - $last + 1));
foreach $g (@gids)
{
if ($g > $last + 1)
{ &$shipout(pack('n*', (0) x ($g - $last - 1))); }
&$shipout(pack('n', $self->{'val'}{$g}));
$last = $g;
}
} else
{
my ($start, $end, $ind, $numloc, $endloc, $num);
&$shipout(pack("n2", 2, 0));
$numloc = $fh->tell() - 2 unless $state;
$start = 0; $end = 0; $num = 0;
while ($end < $#gids)
{
if ($gids[$end + 1] == $gids[$end] + 1
&& $self->{'val'}{$gids[$end + 1]}
== $self->{'val'}{$gids[$end]}
+ ($self->{'cover'} ? 1 : 0))
{
$end++;
next;
}
&$shipout(pack("n3", $gids[$start], $gids[$end],
$self->{'val'}{$gids[$start]}));
$start = $end + 1;
$end++;
$num++;
}
if (scalar(@gids))
{
&$shipout(pack("n3", $gids[$start], $gids[$end],
$self->{'val'}{$gids[$start]}));
$num++;
}
if ($state)
{ substr($out, 2, 2) = pack('n', $num); }
else
{
$endloc = $fh->tell();
$fh->seek($numloc, 0);
$fh->print(pack("n", $num));
$fh->seek($endloc, 0);
}
}
return ($state ? $out : $self);
}
=head2 $c->add($glyphid[, $class])
Adds a glyph id to the coverage or class table.
Returns the index or class number of the glyphid added.
=cut
sub add
{
my ($self, $gid, $class) = @_;
return $self->{'val'}{$gid} if (defined $self->{'val'}{$gid});
if ($self->{'cover'})
{
$self->{'val'}{$gid} = $self->{'count'};
return $self->{'count'}++;
}
else
{
$self->{'val'}{$gid} = $class || '0';
$self->{'max'} = $class if ($class > $self->{'max'});
return $class;
}
}
=head2 $c->signature
Returns a vector of all the glyph ids covered by this coverage table or class
=cut
sub signature
{
my ($self) = @_;
my ($vec, $range, $size);
if (0)
{
if ($self->{'cover'})
{ $range = 1; $size = 1; }
else
{
$range = $self->{'max'};
$size = 1;
while ($range > 1)
{
$size = $size << 1;
$range = $range >> 1;
}
$range = $self->{'max'} + 1;
}
foreach (keys %{$self->{'val'}})
{ vec($vec, $_, $size) = $self->{'val'}{$_} > $range ? $range : $self->{'val'}{$_}; }
length($vec) . ":" . $vec;
}
$vec = join(";", map{"$_,$self->{'val'}{$_}"} sort { $a <=> $b} keys %{$self->{'val'}});
}
=head2 @map=$c->sort
Sorts the coverage table so that indexes are in ascending order of glyphid.
Returns a map such that $map[$new_index]=$old_index.
=cut
sub sort
{
my ($self) = @_;
my (@res, $i);
foreach (sort {$a <=> $b} keys %{$self->{'val'}})
{
push(@res, $self->{'val'}{$_});
$self->{'val'}{$_} = $i++;
}
@res;
}
=head2 $c->out_xml($context)
Outputs this coverage/class in XML
=cut
sub out_xml
{
my ($self, $context, $depth) = @_;
my ($fh) = $context->{'fh'};
$fh->print("$depth<" . ($self->{'cover'} ? 'coverage' : 'class') . ">\n");
foreach $gid (sort {$a <=> $b} keys %{$self->{'val'}})
{
$fh->printf("$depth$context->{'indent'}<gref glyph='%s' val='%s'/>\n", $gid, $self->{'val'}{$gid});
}
$fh->print("$depth</" . ($self->{'cover'} ? 'coverage' : 'class') . ">\n");
$self;
}
sub release
{ }
1;
=head1 AUTHOR
Martin Hosken L<Martin_Hosken@sil.org>.
=head1 LICENSING
Copyright (c) 1998-2013, SIL International (http://www.sil.org)
This module is released under the terms of the Artistic License 2.0.
For details, see the full text of the license in the file LICENSE.
=cut
|