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 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408
|
/*--------------------------------------------------------------------*//*:Ignore this sentence.
Copyright (C) 1999, 2001 SIL International. All rights reserved.
Distributable under the terms of either the Common Public License or the
GNU Lesser General Public License, as specified in the LICENSING.txt file.
File: GdlGlyph.h
Responsibility: Sharon Correll
Last reviewed: Not yet.
Description:
Description of simple glyph or range of glyphs.
-------------------------------------------------------------------------------*//*:End Ignore*/
#ifdef _MSC_VER
#pragma once
#endif
#ifndef GLYPH_INCLUDED
#define GLYPH_INCLUDED
/*----------------------------------------------------------------------------------------------
Class: GdlGlyphDefn
Description: A glyph or set of glyphs specified by a single codepoint, Unicode value,
Postscript name, or a contiguous range of these.
Hungarian: glf
----------------------------------------------------------------------------------------------*/
class PsuedoLess;
class GdlGlyphDefn : public GdlGlyphClassMember
{
friend class PseudoLess;
public:
// Constructors:
// unicode(0x1234), glyphid(0x3333)
GdlGlyphDefn(GlyphType glft, int nFirst)
: GdlGlyphClassMember(),
m_glft(glft),
m_nFirst(nFirst),
m_nLast(nFirst),
m_wCodePage(0),
m_nUnicodeInput(0),
m_pglfOutput(NULL),
m_fGAResolved(false),
m_fNoRangeCheck(false)
{
Assert(m_glft != kglftPseudo);
Assert(m_glft != kglftCodepoint); // must include a codepage
}
// unicode(0x1234..1237), glyphid(0x3333..03335), codepage(0x1234, 1252);
GdlGlyphDefn(GlyphType glft, int nFirst, int nLast)
: GdlGlyphClassMember(),
m_glft(glft),
m_nFirst(nFirst),
m_nLast(nLast),
m_wCodePage(0),
m_nUnicodeInput(0),
m_pglfOutput(NULL),
m_fGAResolved(false),
m_fNoRangeCheck(false)
{
Assert(m_glft != kglftPseudo);
if (m_glft == kglftCodepoint)
{
m_wCodePage = (utf16)m_nLast;
m_nLast = m_nFirst;
}
}
// codepoint(1..2, 0x2222)
GdlGlyphDefn(GlyphType glft, int nFirst, int nLast, utf16 wCodePage)
: GdlGlyphClassMember(),
m_glft(glft),
m_nFirst(nFirst),
m_nLast(nLast),
m_wCodePage(wCodePage),
m_nUnicodeInput(0),
m_pglfOutput(NULL),
m_fGAResolved(false)
{
Assert(m_glft == kglftCodepoint);
}
// postscript("Ccedilla")
GdlGlyphDefn(GlyphType glft, std::string sta)
: GdlGlyphClassMember(),
m_glft(glft),
m_nFirst(0),
m_nLast(0),
m_wCodePage(0),
m_nUnicodeInput(0),
m_pglfOutput(NULL),
m_sta(sta),
m_fGAResolved(false)
{
Assert(m_glft == kglftPostscript);
}
// codepoint("abc", 0x04e4)
GdlGlyphDefn(GlyphType glft, std::string sta, utf16 wCodePage)
: GdlGlyphClassMember(),
m_glft(glft),
m_nFirst(0),
m_nLast(0),
m_wCodePage(wCodePage),
m_nUnicodeInput(0),
m_pglfOutput(NULL),
m_sta(sta),
m_fGAResolved(false)
{
Assert(m_glft == kglftCodepoint);
}
// pseudo(unicode(0x3344))
GdlGlyphDefn(GlyphType glft, GdlGlyphDefn * pglf)
: GdlGlyphClassMember(),
m_glft(glft),
m_nFirst(0),
m_nLast(0),
m_wCodePage(0),
m_nUnicodeInput(0),
m_pglfOutput(pglf),
m_fGAResolved(false)
{
Assert(m_glft == kglftPseudo);
Assert(m_pglfOutput->m_glft != kglftPseudo);
}
// pseudo(unicode(0x3344), 0xf123)
GdlGlyphDefn(GlyphType glft, GdlGlyphDefn * pglf, int nInput)
: GdlGlyphClassMember(),
m_glft(glft),
m_nFirst(0),
m_nLast(0),
m_wCodePage(0),
m_nUnicodeInput(nInput),
m_pglfOutput(pglf),
m_fGAResolved(false)
{
Assert(m_glft == kglftPseudo);
Assert(m_pglfOutput->m_glft != kglftPseudo);
}
~GdlGlyphDefn()
{
if (m_pglfOutput)
delete m_pglfOutput;
}
// Error checking:
// int ErrorCheck()
// {
// if (m_sta.Length() == 0 && m_glft == kglftPostscript)
// return 1; // ERROR: bad POSTSCRIPT fcn format--omitted PS name
// if (m_sta.Length() != 0 && m_glft != kglftPostscript)
// return 1; // ERROR: bad fcn format--included string
// }
// Getters:
GlyphType GetGlyphType()
{
return m_glft;
}
unsigned int First()
{
return m_nFirst;
}
unsigned int Last()
{
return m_nLast;
}
utf16 CodePage()
{
Assert(m_glft == kglftCodepoint);
return m_wCodePage;
}
unsigned int UnicodeInput()
{
Assert(m_glft == kglftPseudo);
return m_nUnicodeInput;
}
GdlGlyphDefn * OutputGlyph()
{
Assert(m_glft == kglftPseudo);
return m_pglfOutput;
}
std::string PostscriptName()
{
Assert(m_glft == kglftPostscript);
return m_sta;
}
std::string CodepointString()
{
Assert(m_glft == kglftCodepoint);
return m_sta;
}
utf16 AssignedPseudo()
{
Assert(m_glft == kglftPseudo);
return m_wPseudo;
}
// Setters:
void SetAssignedPseudo(utf16 w)
{
m_wPseudo = w;
}
void SetNoRangeCheck()
{
m_fNoRangeCheck = true;
}
void AddGlyphID(utf16 w)
{
m_vwGlyphIDs.push_back(w);
}
public:
// Pre-compiler:
virtual bool CheckRecursiveGlyphClasses(std::vector<GdlGlyphClassDefn*> & vpglfcStack);
virtual void ExplicitPseudos(PseudoSet & setpglf, bool fProcessClasses);
virtual int ActualForPseudo(utf16 wPseudo);
// Answer true if there is exactly one glyph represented by the object.
// bool SingleGlyph()
// {
// if (m_glft == kglftPostscript)
// return true;
// if (m_glft == kglftUnicode || m_glft == kglftGlyphID)
// return m_wFirst > 0 && m_wFirst == m_wLast;
// Assert(m_glft == kglftCodepoint);
// if (m_wFirst == 0 && m_wLast == 0)
// return m_sta.Length() == 1;
// else
// return m_wFirst == m_wLast;
// }
virtual int GlyphIDCount();
virtual unsigned int FirstGlyphInClass(bool * pfMoreThanOne);
virtual void AssignGlyphIDsToClassMember(GrcFont *, utf16 wGlyphIDLim,
std::map<utf16, utf16> & hmActualForPseudo,
bool fLookUpPseudo = true);
virtual void AssignGlyphAttrsToClassMembers(GrcGlyphAttrMatrix * pgax,
GdlRenderer * prndr, GrcLigComponentList * plclist,
std::vector<GdlGlyphAttrSetting *> & vpglfaAttrs, int cgid, int & igid);
virtual void CheckExistenceOfGlyphAttr(GdlObject * pgdlAvsOrExp,
GrcSymbolTable * psymtbl, GrcGlyphAttrMatrix * pgax, Symbol psymGlyphAttr);
virtual void CheckCompleteAttachmentPoint(GdlObject * pgdlAvsOrExp,
GrcSymbolTable * psymtbl, GrcGlyphAttrMatrix * pgax, Symbol psymGlyphAttr,
bool * pfXY, bool * pfGpoint);
virtual void CheckCompBox(GdlObject * pritset,
GrcSymbolTable * psymtbl, GrcGlyphAttrMatrix * pgax, Symbol psymCompRef);
virtual void StorePseudoToActualAsGlyphAttr(GrcGlyphAttrMatrix * pgax, int nAttrID,
std::vector<GdlExpression *> & vpexpExtra);
static std::string GlyphIDString(utf16 wGlyphID)
{
char rgch[20];
itoa(int(wGlyphID), rgch, 10);
std::string staRet(rgch);
staRet += " [0x";
char rgchHex[20];
itoa(int(wGlyphID), rgchHex, 16);
std::string staHex(rgchHex);
for (int ich = staHex.size(); ich < 4; ich++)
staRet += "0";
staRet += staHex;
staRet += "]";
return staRet;
}
static std::string UsvString(utf16 wUsv)
{
char rgch[20];
itoa(int(wUsv), rgch, 16);
std::string staNum(rgch);
std::string staRet;
for (int ich = staNum.size(); ich < 4; ich++)
staRet += "0";
staRet += staNum;
return staRet;
}
static std::string CodepointIDString(int n)
{
char rgch[20];
itoa(int(n), rgch, 16);
std::string staNum(rgch);
std::string staRet;
for (int ich = staNum.size(); ich < 4; ich++)
staRet += "0";
staRet += staNum;
return staRet;
}
virtual bool IncludesGlyph(utf16 w)
{
for (size_t iw = 0; iw < m_vwGlyphIDs.size(); iw++)
{
if (m_vwGlyphIDs[iw] == w)
return true;
}
return false;
}
virtual bool HasOverlapWith(GdlGlyphClassMember * glfd, GrcFont * pfont);
virtual bool HasBadGlyph()
{
for (size_t iw = 0; iw < m_vwGlyphIDs.size(); iw++)
{
if (m_vwGlyphIDs[iw] == kBadGlyph)
return true;
}
return false;
}
virtual bool WarnAboutBadGlyphs(bool fTop);
virtual bool DeleteBadGlyphs();
virtual void FlattenGlyphList(std::vector<utf16> & vgidFlattened)
{
for (size_t igid = 0; igid < m_vwGlyphIDs.size(); igid++)
{
vgidFlattened.push_back(m_vwGlyphIDs[igid]);
}
}
virtual bool IsSpaceGlyph(std::vector<utf16> & vwSpaceGlyphs);
public:
// Compiler:
virtual void RecordInclusionInClass(GdlPass * ppass, GdlGlyphClassDefn * pglfc);
virtual void GetMachineClasses(FsmMachineClass ** ppfsmcAssignments,
FsmMachineClassSet & setpfsmc);
// Output:
void AddGlyphsToUnsortedList(std::vector<utf16> & vwGlyphs);
void AddGlyphsToSortedList(std::vector<utf16> & vwGlyphs, std::vector<int> & vnIndices);
// debugger
virtual void DebugCmapForMember(GrcFont * pfont,
utf16 * rgchwUniToGlyphID, unsigned int * rgnGlyphIDToUni);
virtual void DebugXmlClassMembers(std::ofstream & strmOut, std::string staPathToCur,
GdlGlyphClassDefn * pglfdParent, GrpLineAndFile lnf, int & cwGlyphIDs);
protected:
// Instance variables:
GlyphType m_glft; // unicode, glyphID, codepoint, postscript, pseudo
unsigned int m_nFirst;
unsigned int m_nLast;
utf16 m_wCodePage;
unsigned int m_nUnicodeInput; // input for pseudo-glyph
GdlGlyphDefn * m_pglfOutput; // pseudo-glyph output
std::string m_sta; // postscript name or codepoint string
// for compiler use:
std::vector<utf16> m_vwGlyphIDs; // equivalent glyph IDs
utf16 m_wPseudo; // glyph id assigned to pseudo-glyph
std::vector<GlyphBoundaries> m_vgbdy;
bool m_fGAResolved; // temporary use: glyph attributes resolved
bool m_fNoRangeCheck; // true for pseudo definitions generated by the compiler
// This isn't an adequate comparison, makes too many assumptions.
//bool PseudoLessThan(const GdlGlyphDefn * pglf) const
//{
// if (this->m_glft == kglftPseudo && pglf->m_glft == kglftPseudo)
// {
// if (this->m_nUnicodeInput != pglf->m_nUnicodeInput)
// {
// return (this->m_nUnicodeInput < pglf->m_nUnicodeInput);
// }
// if (this->m_pglfOutput && this->m_pglfOutput)
// {
// return (strcmp(this->m_pglfOutput->m_sta.data(), pglf->m_pglfOutput->m_sta.data()) < 0);
// }
// }
// // Comparing memory addresses is not ideal for the regression test, but it will
// // work:
// return (this < pglf);
//}
};
// Functor class for set manipulation
//class PseudoLess
//{
// friend class GdlGlyphDefn;
//public:
// operator()(const GdlGlyphDefn * pglf1, const GdlGlyphDefn * pglf2) const
// {
// return (pglf1->PseudoLessThan(pglf2));
// }
//};
// defined in GdlGlyphClassDefn.h:
//typedef std::set<GdlGlyphDefn *> PseudoSet;
#endif // GLYPH_INCLUDED
|