| /external/icu4c/common/ |
| utrie.h | 69 * Increases possible data size with 16-bit index values at the cost
109 * possible duplicate entries for 1024 lead surrogates.)
548 * Opaque definition, here only to make fillIn parameters possible
604 * possible duplicate entries for 1024 lead surrogates.)
719 * @param pErrorCode a UErrorCode argument; among other possible error codes:
|
| ucnv_lmb.c | 270 That's because there are often more than one possible mappings from a Unicode
272 to figure out if there are more than one possible mappings. This table,
277 length as small as possible. Here's the two special markers we use to indicate
467 in as a string, and we map it, if possible, to one of the
571 locale. We have one structure instantiated for each of the 12 possible
[all...] |
| utrie2.h | 245 * @param pErrorCode an in/out ICU UErrorCode; among other possible error codes:
261 * @param pErrorCode an in/out ICU UErrorCode; among other possible error codes:
281 * @param pErrorCode an in/out ICU UErrorCode; among other possible error codes:
312 * @param pErrorCode an in/out ICU UErrorCode; among other possible error codes:
569 * @param pErrorCode an in/out ICU UErrorCode; among other possible error codes:
762 * Increases possible data size with 16-bit index values at the cost
[all...] |
| /external/llvm/docs/ |
| GetElementPtr.html | 597 <p>It would be possible to add special annotations to the IR, probably using
646 <p>It's not possible to write a checker which could find all rule
647 violations statically. It would be possible to write a checker which
649 it would be possible to write a static checker which catches a subset of
650 possible problems. However, no such checker exists today.</p>
|
| /external/llvm/include/llvm/Target/ |
| TargetInstrInfo.h | 407 /// If this is possible, a new instruction is returned with the specified
445 /// folding is possible.
452 /// possible, returns true as well as the new instructions by reference.
467 /// possible. If LoadRegIndex is non-null, it is filled in with the operand
631 /// operand latency. But it may not be possible for instructions with variable
[all...] |
| /external/pcre/doc/ |
| pcretest.1 | 129 included within it. It is possible to include the delimiter within the pattern
211 Searching for all possible matches within each subject string can be requested
440 possible to construct invalid UTF-8 sequences for testing purposes. On the
499 This function finds all possible matches at a given point. If, however, the \eF
501 found. This is always the shortest possible match.
|
| pcretest.txt | 118 line characters are included within it. It is possible to include the
195 Searching for all possible matches within each subject string can be
392 makes it possible to construct invalid UTF-8 sequences for testing pur-
448 This function finds all possible matches at a given point. If, however,
450 first match is found. This is always the shortest possible match.
[all...] |
| /external/pcre/ |
| pcre_study.c | 6 and semantics are as close as possible to those of the Perl 5 language.
571 attempts to build a bitmap of the set of possible starting bytes. As time goes
945 value is > 127. In fact, there are only two possible starting bytes for
1023 NULL on error or if no optimization possible
1087 /* Return NULL if no optimization is possible. */
|
| /frameworks/base/core/java/android/animation/ |
| PropertyValuesHolder.java | 235 * and an initial value will be derived, if possible, by calling a getter function
269 * and an initial value will be derived, if possible, by calling the property's
297 * and an initial value will be derived, if possible, by calling a getter function
315 * and an initial value will be derived, if possible, by calling a getter function
348 * and an initial value will be derived, if possible, by calling a getter function
[all...] |
| /frameworks/media/libvideoeditor/vss/src/ |
| M4xVSS_internal.c | [all...] |
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
| stl_algobase.h | 300 // calls to copy with memmove whenever possible. (Memmove, not memcpy,
448 * possible. Failing that, if random access iterators are passed, then the
481 * possible. Failing that, if random access iterators are passed, then the
619 * possible. Failing that, if random access iterators are passed, then the
655 * possible. Failing that, if random access iterators are passed, then the
[all...] |
| /prebuilt/ndk/android-ndk-r5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_algobase.h | 300 // calls to copy with memmove whenever possible. (Memmove, not memcpy,
448 * possible. Failing that, if random access iterators are passed, then the
481 * possible. Failing that, if random access iterators are passed, then the
619 * possible. Failing that, if random access iterators are passed, then the
655 * possible. Failing that, if random access iterators are passed, then the
[all...] |
| /prebuilt/ndk/android-ndk-r6/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_algobase.h | 300 // calls to copy with memmove whenever possible. (Memmove, not memcpy,
448 * possible. Failing that, if random access iterators are passed, then the
481 * possible. Failing that, if random access iterators are passed, then the
619 * possible. Failing that, if random access iterators are passed, then the
655 * possible. Failing that, if random access iterators are passed, then the
[all...] |
| /external/bluetooth/glib/docs/reference/glib/ |
| regex-syntax.sgml | 941 branch. If all possible alternatives start with a circumflex, that is,
977 ^ are not anchored in multiline mode, and a match for circumflex is possible
[all...] |
| /external/valgrind/main/memcheck/docs/ |
| mc-manual.xml | 427 <para>With that in mind, consider the nine possible cases described by the
459 <para>Every possible case can be reduced to one of the above nine. Memcheck
507 <para>(Note: This mapping of the nine possible cases onto four categories is
509 interior-pointers are treated inconsistently. It is possible the
587 case, it would be possible to get a high error count but not have any
730 overheads, some approximations are made. It is possible,
763 at all possible, such code should be fixed. This option should be
779 long as possible the point at which freed-up memory comes back
[all...] |
| /external/libpng/ |
| libpng-1.2.44.txt | 72 complete as possible, while keeping the code easy to understand.
80 the PNG file format in whatever way possible. While there is still
113 interfaces if at all possible.
132 We'll now walk you through the possible functions to call when reading
[all...] |
| libpng-1.2.46.txt | 72 complete as possible, while keeping the code easy to understand.
80 the PNG file format in whatever way possible. While there is still
113 interfaces if at all possible.
132 We'll now walk you through the possible functions to call when reading
[all...] |
| /external/llvm/utils/TableGen/ |
| Record.h | 826 // Fold - If possible, fold this to a simpler init. Return this if not
827 // possible to fold.
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| Calendar.java | 136 * <strong>Note:</strong> There are certain possible ambiguities in
204 * then its value is adjusted to be as close as possible to its expected value.
222 * sets the {@code DAY_OF_MONTH} to 30, the closest possible value.
246 * sets it to the closest possible value, 30. Finally, the <strong>roll rule</strong>
260 * possible value to Sunday (where Sunday is the first day of the week).
279 * <tt>Calendar</tt>. It is quite possible for <tt>Calendar</tt> subclasses
[all...] |
| /packages/providers/DownloadProvider/docs/ |
| index.html | 27 <li> <a href="#Possible_scope_for_Cupcake">Possible scope for Cupcake</a>
174 <b>ALSO</b> See also <a href="#Future_Directions">future directions</a> for possible additional technical changes.
176 <h3><a name="Possible_scope_for_Cupcake"> </a> Possible scope for Cupcake </h3>
186 and therefore reducing the number of classes when possible or relevant can reduce the memory
278 It'd be good if the download manager could be built against the SDK as much as possible.
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| UnImplNode.java | 1174 * test every possible error case normally defined on DOM operations,
1197 * test every possible error case normally defined on DOM operations,
[all...] |
| /external/jhead/ |
| jpgfile.c | 602 // Adding or removing of thumbnail is not possible - that would require rearranging
604 fprintf(stderr,"Image contains no thumbnail to replace - add is not possible\n");
606 LOGE("Image contains no thumbnail to replace - add is not possible\n");
667 // Adding or removing of thumbnail is not possible - that would require rearranging
669 fprintf(stderr,"Image contains no thumbnail to replace - add is not possible\n");
671 LOGE("Image contains no thumbnail to replace - add is not possible\n");
|
| /external/wpa_supplicant_6/wpa_supplicant/src/common/ |
| nl80211_copy.h | 434 * info as possible, see &enum nl80211_sta_info.
599 * containing info as possible, see &enum survey_info.
[all...] |
| /external/zlib/examples/ |
| zlib_how.html | 233 <tt>deflate()</tt>'s return values and dispense with them one by one. The possible values are
237 until it has no more output. <tt>Z_STREAM_ERROR</tt> is only possible if the stream is not
413 correct decompression is not possible. For this routine, we have no idea what the dictionary is,
416 <tt>inflate()</tt> can also return <tt>Z_STREAM_ERROR</tt>, which should not be possible here,
473 <tt>zerr()</tt> is used to interpret the possible error codes from <tt>def()</tt>
475 Note that these are only a subset of the possible return values from <tt>deflate()</tt>
|
| /frameworks/base/core/java/com/google/android/util/ |
| AbstractMessageParser.java | 48 /** Get the possible values for the last part of a domain name.
341 * Looks for a URL in two possible forms: either a proper URL with a known
540 /** Determines whether the given index could be a possible word break. */
545 /** Determines whether the given index could be a possible smiley break. */
590 // be considered a possible word break.
601 * recognize that this is possible.
[all...] |
