Searched refs:rightToLeft (Results 1 - 25 of 55) sorted by relevance

123

/external/icu/icu4c/source/layout/
H A DGlyphPositioningTables.cpp19 void GlyphPositioningTableHeader::process(const LEReferenceTo<GlyphPositioningTableHeader> &base, LEGlyphStorage &glyphStorage, GlyphPositionAdjustments *glyphPositionAdjustments, le_bool rightToLeft, argument
33 processor.process(glyphStorage, glyphPositionAdjustments, rightToLeft, glyphDefinitionTableHeader, fontInstance, success);
35 glyphPositionAdjustments->applyCursiveAdjustments(glyphStorage, rightToLeft, fontInstance);
H A DGlyphSubstitutionTables.cpp22 le_bool rightToLeft,
37 return processor.process(glyphStorage, NULL, rightToLeft, glyphDefinitionTableHeader, NULL, success);
20 process(const LEReferenceTo<GlyphSubstitutionTableHeader> &base, LEGlyphStorage &glyphStorage, le_bool rightToLeft, LETag scriptTag, LETag languageTag, const LEReferenceTo<GlyphDefinitionTableHeader> &glyphDefinitionTableHeader, const LEGlyphFilter *filter, const FeatureMap *featureMap, le_int32 featureMapCount, le_bool featureOrder, LEErrorCode &success) const argument
H A DCanonShaping.h24 static void reorderMarks(const LEUnicode *inChars, le_int32 charCount, le_bool rightToLeft,
H A DGXLayoutEngine2.cpp29 le_int32 GXLayoutEngine2::computeGlyphs(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool rightToLeft, LEGlyphStorage &glyphStorage, LEErrorCode &success) argument
40 mapCharsToGlyphs(chars, offset, count, rightToLeft, rightToLeft, glyphStorage, success);
H A DGlyphPositioningTables.h31 le_bool rightToLeft, LETag scriptTag, LETag languageTag,
H A DGlyphSubstitutionTables.h30 le_bool rightToLeft,
H A DHanLayoutEngine.h86 * @param rightToLeft - <code>TRUE</code> if the characters are in a right to left directional run
99 virtual le_int32 characterProcessing(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool rightToLeft,
H A DGXLayoutEngine.cpp32 le_int32 GXLayoutEngine::computeGlyphs(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool rightToLeft, LEGlyphStorage &glyphStorage, LEErrorCode &success) argument
43 mapCharsToGlyphs(chars, offset, count, FALSE, rightToLeft, glyphStorage, success);
H A DIndicLayoutEngine.h112 * @param rightToLeft - <code>TRUE</code> if the characters are in a right to left directional run
123 virtual le_int32 characterProcessing(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool rightToLeft,
140 * @param rightToLeft - <code>TRUE</code> if the characters are in a right to left directional run
154 virtual le_int32 glyphProcessing(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool rightToLeft,
H A DKhmerLayoutEngine.cpp44 le_int32 KhmerOpenTypeLayoutEngine::characterProcessing(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool rightToLeft, argument
65 glyphStorage.allocateGlyphArray(worstCase, rightToLeft, success);
H A DLEInsertionList.cpp25 LEInsertionList::LEInsertionList(le_bool rightToLeft) argument
26 : head(NULL), tail(NULL), growAmount(0), append(rightToLeft)
H A DTibetanLayoutEngine.cpp50 le_int32 TibetanOpenTypeLayoutEngine::characterProcessing(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool rightToLeft, argument
71 glyphStorage.allocateGlyphArray(worstCase, rightToLeft, success);
H A DIndicLayoutEngine.cpp56 le_int32 IndicOpenTypeLayoutEngine::glyphProcessing(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool rightToLeft, argument
68 le_int32 retCount = OpenTypeLayoutEngine::glyphProcessing(chars, offset, count, max, rightToLeft, glyphStorage, success);
77 OpenTypeLayoutEngine::glyphSubstitution(count,max, rightToLeft, glyphStorage, success);
87 le_int32 IndicOpenTypeLayoutEngine::characterProcessing(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool rightToLeft, argument
108 glyphStorage.allocateGlyphArray(worstCase, rightToLeft, success);
H A DOpenTypeLayoutEngine.h267 * @param rightToLeft - TRUE if the characters are in a right to left directional run
279 virtual le_int32 characterProcessing(const LEUnicode /*chars*/[], le_int32 offset, le_int32 count, le_int32 max, le_bool /*rightToLeft*/,
296 * @param rightToLeft - TRUE if the characters are in a right to left directional run
311 virtual le_int32 glyphProcessing(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool rightToLeft,
314 virtual le_int32 glyphSubstitution(le_int32 count, le_int32 max, le_bool rightToLeft, LEGlyphStorage &glyphStorage, LEErrorCode &success);
352 * @param rightToLeft - TRUE if the text is in a right to left directional run
365 virtual le_int32 computeGlyphs(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool rightToLeft, LEGlyphStorage &glyphStorage, LEErrorCode &success);
H A DArabicShaping.h60 le_bool rightToLeft, LEGlyphStorage &glyphStorage);
H A DGXLayoutEngine.h94 * @param rightToLeft - <code>TRUE</code> if the text is in a right to left directional run
104 virtual le_int32 computeGlyphs(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool rightToLeft,
H A DGXLayoutEngine2.h93 * @param rightToLeft - <code>TRUE</code> if the text is in a right to left directional run
103 virtual le_int32 computeGlyphs(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool rightToLeft,
H A DHangulLayoutEngine.h110 * @param rightToLeft - <code>TRUE</code> if the characters are in a right to left directional run
121 virtual le_int32 characterProcessing(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool rightToLeft,
H A DKhmerLayoutEngine.h113 * @param rightToLeft - <code>TRUE</code> if the characters are in a right to left directional run
124 virtual le_int32 characterProcessing(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool rightToLeft,
H A DLEInsertionList.h69 * @param rightToLeft <code>TRUE</code> if the glyphs are stored
74 LEInsertionList(le_bool rightToLeft);
H A DThaiLayoutEngine.h103 * @param rightToLeft - <code>TRUE</code> if the text is in a right to left directional run
115 virtual le_int32 computeGlyphs(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool rightToLeft,
H A DTibetanLayoutEngine.h113 * @param rightToLeft - <code>TRUE</code> if the characters are in a right to left directional run
124 virtual le_int32 characterProcessing(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool rightToLeft,
H A DCanonShaping.cpp34 void CanonShaping::reorderMarks(const LEUnicode *inChars, le_int32 charCount, le_bool rightToLeft, argument
65 if (rightToLeft) {
H A DLayoutEngine.cpp198 le_int32 LayoutEngine::characterProcessing(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool rightToLeft, argument
226 fakeGlyphStorage.allocateGlyphArray(count, rightToLeft, success);
245 CanonShaping::reorderMarks(&chars[offset], count, rightToLeft, reordered, fakeGlyphStorage);
256 if (rightToLeft) {
270 outCharCount = canonGSUBTable->process(canonGSUBTable, fakeGlyphStorage, rightToLeft, scriptTag, langSysTag, (const GlyphDefinitionTableHeader*)NULL, substitutionFilter, canonFeatureMap, canonFeatureMapCount, FALSE, success);
277 out = (rightToLeft? outCharCount - 1 : 0);
305 le_int32 LayoutEngine::computeGlyphs(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool rightToLeft, argument
318 le_int32 outCharCount = characterProcessing(chars, offset, count, max, rightToLeft, outChars, glyphStorage, success);
321 mapCharsToGlyphs(outChars, 0, outCharCount, rightToLeft, rightToLeft, glyphStorag
487 layoutChars(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool rightToLeft, float x, float y, LEErrorCode &success) argument
[all...]
/external/chromium_org/third_party/angle/src/compiler/translator/
H A DIntermTraverse.cpp19 // preVisit, postVisit, and rightToLeft control what order
56 if (it->rightToLeft)
124 if (it->rightToLeft)
173 if (it->rightToLeft)
210 if (it->rightToLeft)

Completed in 1051 milliseconds

123