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
|
/*
* Copyright (C) 2008 Apple Inc. All rights reserved.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library 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
* Library General Public License for more details.
*
* You should have received a copy of the GNU Library General Public License
* along with this library; see the file COPYING.LIB. If not, write to
* the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*/
#ifndef SVGGlyphMap_h
#define SVGGlyphMap_h
#if ENABLE(SVG_FONTS)
#include "SurrogatePairAwareTextIterator.h"
#include "SVGGlyph.h"
#include <wtf/HashMap.h>
#include <wtf/Vector.h>
namespace WebCore {
struct GlyphMapNode;
class SVGFontData;
typedef HashMap<UChar32, RefPtr<GlyphMapNode> > GlyphMapLayer;
struct GlyphMapNode : public RefCounted<GlyphMapNode> {
private:
GlyphMapNode() { }
public:
static PassRefPtr<GlyphMapNode> create() { return adoptRef(new GlyphMapNode); }
Vector<SVGGlyph> glyphs;
GlyphMapLayer children;
};
class SVGGlyphMap {
public:
SVGGlyphMap() : m_currentPriority(0) { }
void addGlyph(const String& glyphName, const String& unicodeString, SVGGlyph glyph)
{
ASSERT(!glyphName.isEmpty() || !unicodeString.isEmpty());
bool hasGlyphName = !glyphName.isEmpty();
if (unicodeString.isEmpty()) {
// Register named glyph in the named glyph map and in the glyph table.
ASSERT(hasGlyphName);
appendToGlyphTable(glyph);
m_namedGlyphs.add(glyphName, glyph.tableEntry);
return;
}
GlyphMapLayer* currentLayer = &m_rootLayer;
RefPtr<GlyphMapNode> node;
size_t length = unicodeString.length();
UChar32 character = 0;
unsigned clusterLength = 0;
SurrogatePairAwareTextIterator textIterator(unicodeString.characters(), 0, length, length);
while (textIterator.consume(character, clusterLength)) {
node = currentLayer->get(character);
if (!node) {
node = GlyphMapNode::create();
currentLayer->set(character, node);
}
currentLayer = &node->children;
textIterator.advance(clusterLength);
}
if (!node)
return;
// Register glyph associated with an unicode string into the glyph map.
node->glyphs.append(glyph);
SVGGlyph& lastGlyph = node->glyphs.last();
lastGlyph.priority = m_currentPriority++;
lastGlyph.unicodeStringLength = length;
// If the glyph is named, also add it to the named glyph name, and to the glyph table in both cases.
appendToGlyphTable(lastGlyph);
if (hasGlyphName)
m_namedGlyphs.add(glyphName, lastGlyph.tableEntry);
}
void appendToGlyphTable(SVGGlyph& glyph)
{
size_t tableEntry = m_glyphTable.size();
ASSERT(tableEntry < std::numeric_limits<unsigned short>::max());
// The first table entry starts with 1. 0 denotes an unknown glyph.
glyph.tableEntry = tableEntry + 1;
m_glyphTable.append(glyph);
}
static inline bool compareGlyphPriority(const SVGGlyph& first, const SVGGlyph& second)
{
return first.priority < second.priority;
}
void collectGlyphsForString(const String& string, Vector<SVGGlyph>& glyphs)
{
GlyphMapLayer* currentLayer = &m_rootLayer;
const UChar* characters = string.characters();
size_t length = string.length();
UChar32 character = 0;
unsigned clusterLength = 0;
SurrogatePairAwareTextIterator textIterator(characters, 0, length, length);
while (textIterator.consume(character, clusterLength)) {
RefPtr<GlyphMapNode> node = currentLayer->get(character);
if (!node)
break;
glyphs.appendVector(node->glyphs);
currentLayer = &node->children;
textIterator.advance(clusterLength);
}
std::sort(glyphs.begin(), glyphs.end(), compareGlyphPriority);
}
void clear()
{
m_rootLayer.clear();
m_glyphTable.clear();
m_currentPriority = 0;
}
const SVGGlyph& svgGlyphForGlyph(Glyph glyph) const
{
if (!glyph || glyph > m_glyphTable.size()) {
DEFINE_STATIC_LOCAL(SVGGlyph, defaultGlyph, ());
return defaultGlyph;
}
return m_glyphTable[glyph - 1];
}
const SVGGlyph& glyphIdentifierForGlyphName(const String& glyphName) const
{
return svgGlyphForGlyph(m_namedGlyphs.get(glyphName));
}
private:
GlyphMapLayer m_rootLayer;
Vector<SVGGlyph, 256> m_glyphTable;
HashMap<String, Glyph> m_namedGlyphs;
int m_currentPriority;
};
}
#endif // ENABLE(SVG_FONTS)
#endif // SVGGlyphMap_h
|
