| /external/icu4c/common/ |
| ucnvbocu.cpp | 63 /* number of lead bytes */
79 /* number of lead bytes for positive and negative 2/3/4-byte sequences */
98 /* The lead byte start values. */
109 /* The length of a byte sequence, according to the lead byte (!=BOCU1_RESET). */
110 #define BOCU1_LENGTH_FROM_LEAD(lead) \
111 ((BOCU1_START_NEG_2<=(lead) && (lead)<BOCU1_START_POS_2) ? 1 : \
112 (BOCU1_START_NEG_3<=(lead) && (lead)<BOCU1_START_POS_3) ? 2 : \
113 (BOCU1_START_NEG_4<=(lead) && (lead)<BOCU1_START_POS_4) ? 3 : 4
[all...] |
| ucnvscsu.c | 1030 UChar lead, trail; local
1520 UChar lead, trail; local
[all...] |
| normalizer2impl.h | 41 JAMO_L_BASE=0x1100, /* "lead" jamo */
278 * Might skip only a lead surrogate rather than the whole surrogate pair if none of
279 * the supplementary code points associated with the lead surrogate have non-zero FCD data.
325 /** Returns TRUE if the single-or-lead code unit c might have non-zero FCD data. */
326 UBool singleLeadMightHaveNonZeroFCD16(UChar32 lead) const {
327 // 0<=lead<=0xffff
328 uint8_t bits=smallFCD[lead>>8];
330 return (UBool)((bits>>((lead>>5)&7))&1);
640 * Gets the 16-bit FCD value (lead & trail CCs) for a code point, for u_getIntPropertyValue().
716 * The trie has a value for each lead surrogate code unit representing the "worst case
[all...] |
| utrie2.h | 41 * - Still separate data for lead surrogate code _units_ vs. code _points_,
42 * but the lead surrogate code unit values are not required any more
47 * in the lead surrogate data for the associated supplementary code points.
500 * A UTrie2 stores separate values for lead surrogate code _units_ vs. code _points_.
507 * code points associated with a lead surrogate.
509 * lead surrogate code _unit_, with utrie2_set32ForLeadSurrogateCodeUnit().
513 * data and the code unit is a lead surrogate, then check if a trail surrogate
516 * or UTRIE2_GET32_FROM_SUPP(); otherwise reset the lead
519 * If there is only trivial data for lead and trail surrogates, then processing
525 * Get a value from a lead surrogate code unit as stored in the trie
[all...] |
| uiter.cpp | 925 UChar lead=U16_LEAD(iter->reservedField); local
931 return lead;
|
| utext.cpp | 129 UChar lead = ut->chunkContents[ut->chunkOffset-1]; local
130 if (U16_IS_LEAD(lead)) {
215 // the original position before the unpaired lead still needs to be restored.
284 // c is an unpaired lead surrogate at the end of the text.
291 // c was an unpaired lead surrogate, not at the end of the text.
317 // (A lead surrogate seen here is just returned as is, as a surrogate value.
330 UChar32 lead = ut->chunkContents[ut->chunkOffset-1]; local
331 if (U16_IS_LEAD(lead) == FALSE) {
337 UChar32 supplementary = U16_GET_SUPPLEMENTARY(lead, c);
338 ut->chunkOffset--; // move iteration position over the lead surrogate
[all...] |
| /external/v8/test/mjsunit/ |
| global-const-var-conflicts.js | 29 // is silently ignored (and does not lead to exceptions).
|
| fuzz-natives.js | 121 // may lead to out-of-memory. Ditto for StringBuilderJoin.
|
| unicode-test.js | [all...] |
| /external/v8/test/mjsunit/regress/ |
| regress-1172.js | 31 // Note: no setters would lead to runtime exception if we ever attempt
|
| /external/webkit/Source/WebCore/rendering/ |
| RenderQuote.cpp | 273 void RenderQuote::computePreferredLogicalWidths(float lead)
276 RenderText::computePreferredLogicalWidths(lead);
|
| RenderCounter.cpp | 510 void RenderCounter::computePreferredLogicalWidths(float lead)
513 RenderText::computePreferredLogicalWidths(lead);
|
| /external/icu4c/samples/uciter8/ |
| uit_len8.c | 448 UChar lead=U16_LEAD(iter->reservedField); local
454 return lead;
|
| /external/llvm/lib/Target/NVPTX/ |
| NVPTXAsmPrinter.cpp | 1710 const char *lead; local
1727 O << lead; local
[all...] |
| /external/tinyxml2/ |
| tinyxml2.cpp | 42 // ef bb bf (Microsoft "lead bytes") - designates UTF-8
[all...] |
| /external/icu4c/i18n/ |
| ucol.cpp | 1925 UChar lead; local
3479 UChar lead; local
3810 UChar lead = getPrevNormalizedChar(source, status); local
3892 UChar lead = getPrevNormalizedChar(source, status); local
[all...] |
| /external/icu4c/test/cintltst/ |
| cnormtst.c | 1359 UChar32 c, lead, trail; local
[all...] |
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| CheckSecuritySyntaxOnly.cpp | 676 "Call to function 'vfork' is insecure as it can lead to "
|
| /external/libvpx/libvpx/examples/includes/PHP-SmartyPants-1.5.1e/ |
| smartypants.php | 771 * Changed a regular expression in `_TokenizeHTML` that could lead to
|
| /prebuilts/tools/common/m2/internal/com/ibm/icu/icu4j/2.6.1/ |
| icu4j-2.6.1.jar | |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| com.ibm.icu_4.2.1.v20100412.jar | |
| /external/v8/src/ |
| v8natives.js | 814 // There are 3 cases that lead here:
838 // There are 3 cases that lead here:
[all...] |
| objects.cc | 7112 uint16_t lead = unibrow::Utf16::LeadSurrogate(c); local
7120 uint16_t lead = unibrow::Utf16::LeadSurrogate(c); local
[all...] |
| /external/ceres-solver/docs/ |
| solving.tex | 79 The factorization methods are based on computing an exact solution of~\eqref{eq:lsqr} using a Cholesky or a QR factorization and lead to an exact step Levenberg-Marquardt algorithm. But it is not clear if an exact solution of~\eqref{eq:lsqr} is necessary at each step of the LM algorithm to solve~\eqref{eq:nonlinsq}. In fact, we have already seen evidence that this may not be the case, as~\eqref{eq:lsqr} is itself a regularized version of~\eqref{eq:linearapprox}. Indeed, it is possible to construct non-linear optimization algorithms in which the linearized problem is solved approximately. These algorithms are known as inexact Newton or truncated Newton methods~\cite{nocedal2000numerical}.
[all...] |
| /external/chromium/chrome/browser/resources/file_manager/js/ |
| file_manager.js | 928 cr.defineProperty(li, 'lead', cr.PropertyKind.BOOL_ATTR);
[all...] |
