Lines Matching refs:of
9 * with the License. You may obtain a copy of the License at
47 purposes, they are classified with attributes of
54 <p> A typical calling sequence of transliteration is
74 * ( This second assumption is very complicated and may cause confusion of use)
77 * We are assuming Upper to Lower mapping as one of transliteration.
120 /** Load instance of predefined module - old style method.
126 /** Load a sequence of instances of predefined modules - supersedes
133 /** Load instance of UNO registered module.
142 transliteration modules that are always available. The names of
156 /** Load a sequence of instances of transliteration modules.
157 Output of one module is feeded as input to the next module in
172 A bitmask field of values defined in
192 Number of codepoints to be transliterated.
195 To find the grapheme of input string corresponding to the
196 grapheme of output string, rOffset provides the offset array
197 whose index is the offset of output string, the element
219 <p> Returns the number of matched code points in any case, even if
233 Number of code points to use of aStr1.
236 Returns number of matched code points in aStr1.
245 Number of code points to use of aStr2.
248 Returns number of matched code points in aStr2.
262 /** Transliterate one set of characters to another.
277 pairs of characters to represent a range.
289 Offset (from 0) of the first substring.
292 Length (from offset) of the first substring.
298 Offset (from 0) of the second substring.
301 Length (from offset) of the second substring.