Sha256: 332da395c2dac0d87c4b5de1a933dcc98ca2ba0173cb1129a6506daeb7136d2e
Contents?: true
Size: 1.91 KB
Versions: 4
Compression:
Stored size: 1.91 KB
Contents
require_relative '../table' module TTFunk class Table class Glyf < Table # Accepts a hash mapping (old) glyph-ids to glyph objects, and a hash # mapping old glyph-ids to new glyph-ids. # # Returns a hash containing: # # * :table - a string representing the encoded 'glyf' table containing # the given glyphs. # * :offsets - an array of offsets for each glyph def self.encode(glyphs, new2old, old2new) result = { table: '', offsets: [] } new2old.keys.sort.each do |new_id| glyph = glyphs[new2old[new_id]] result[:offsets] << result[:table].length result[:table] << glyph.recode(old2new) if glyph end # include an offset at the end of the table, for use in computing the # size of the last glyph result[:offsets] << result[:table].length result end def for(glyph_id) return @cache[glyph_id] if @cache.key?(glyph_id) index = file.glyph_locations.index_of(glyph_id) size = file.glyph_locations.size_of(glyph_id) if size == 0 # blank glyph, e.g. space character @cache[glyph_id] = nil return nil end parse_from(offset + index) do raw = io.read(size) number_of_contours, x_min, y_min, x_max, y_max = raw.unpack('n5').map { |i| to_signed(i) } @cache[glyph_id] = if number_of_contours == -1 Compound.new(raw, x_min, y_min, x_max, y_max) else Simple.new(raw, number_of_contours, x_min, y_min, x_max, y_max) end end end private def parse! # because the glyf table is rather complex to parse, we defer # the parse until we need a specific glyf, and then cache it. @cache = {} end end end end require_relative 'glyf/compound' require_relative 'glyf/simple'
Version data entries
4 entries across 3 versions & 2 rubygems