Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched full:possible (Results 1301 - 1325 of 7007) sorted by null

<<51525354555657585960>>

/external/icu4c/common/
putilimp.h	242 * @return the largest possible pointer greater than the base 253 * - return the largest possible pointer greater than base
/external/icu4c/common/unicode/
rep.h	134 * smaller replacement if possible. This will preserve as much 135 * metadata as possible.
/external/icu4c/i18n/unicode/
ucal.h	110 * <strong>Note:</strong> There are certain possible ambiguities in 149 /** Possible types of UCalendars 174 /** Possible fields in a UCalendar 444 /** Possible days of the week in a UCalendar 467 /** Possible months in a UCalendar. Note: Calendar month is 0-based. 505 /** Possible AM/PM values in a UCalendar 695 * Possible formats for a UCalendar's display name     [all...]
ulocdata.h	38 /** The possible types of exemplar character sets. 47 /** The possible types of delimiters.
/external/icu4c/tools/genrb/
rle.c	137 * the following notations are possible: 183 * ESCAPE_BYTE. Then the following notations are possible:
/external/iproute2/man/man8/
tc.8	72 By scheduling the transmission of packets it is possible to improve interactivity 97 tries to get as many packets as possible from the qdisc, for giving them
/external/jpeg/
change.log	79 routine's return type as an argument. This makes it possible to add 204 supply routines to source or sink the compressed data. It is possible to
jdapimin.c	235 * return code need not be inspected since only JPEG_HEADER_OK is possible. 292 /* NB: every possible DSTATE value should be listed in this switch */
/external/libnfc-nxp/inc/
phNfcConfig.h	129 0x01U -> PN544 goes in standby when possible otherwise 133 0x03U -> PN544 goes in standby when possible otherwise goes in idle mode
/external/libvpx/
usage.dox	128 possible to yield the highest quality frame. 131 possible."
/external/libvpx/vpx_mem/memory_manager/
hmm_base.c	206 /* Coalesce with backward block if possible. */ 251 /* Coalesce with forward block if possible. */
/external/llvm/docs/
ExtendedIntegerResults.txt	11 There are three (interesting) possible answers: undefined, zero extended, or 111 to fully describe all possible ABIs, and now allows the optimizers to reason
/external/llvm/docs/HistoricalNotes/
2001-02-09-AdveCommentsResponse.txt	142 to the 'possible extensions' section, because they are not immediately 225 Which is ambiguous and very verbose. It would be possible to specify
/external/llvm/lib/Target/X86/
README-X86-64.txt	44 It's not possible to reference AH, BH, CH, and DH registers in an instruction 170 of the optimizations which are possible if we know the address of a va_list
/external/llvm/lib/Transforms/Scalar/
Sink.cpp	10 // This pass moves instructions into successor blocks, when possible, so that 228 // It is not possible to sink an instruction into its own block. This can
/external/mesa3d/docs/
README.AMIWIN	17 a daunting task. However, two important events made this port possible. 73 possible. I surrounded any amiga specific changes with
/external/neven/Embedded/common/src/b_TensorEm/
Flt16Vec.h	38 * overflow safety for all possible vector configurations. 126 /** scales vector such that max abs is as near as possible to 0x7FFF; returns scale factor used in format 16.16; returns 0 when vector is 0 */
/external/openssl/apps/
ec.c	234 BIO_printf(bio_err, " possible values:" 244 BIO_printf(bio_err, " possible values:"
/external/openssl/crypto/store/
str_mem.c	68 possible, while providing for as small search ranges as possible.
/external/pcre/
config.h.in	33 will assume input strings are ASCII or UTF-8 Unicode. It is not possible to 168 10. The possible values are 10 (LF), 13 (CR), 3338 (CRLF), -1 (ANY), or -2
/external/pcre/doc/html/
pcregrep.html	73 possible to search for patterns that span line boundaries. What defines a line 113 It is possible to compile <b>pcregrep</b> so that it uses <b>libz</b> or 179 because <b>pcregrep</b> has to search for all possible matches in a line, not 345 is currently possible only in Unix environments). Output to terminal is 372 Other patterns may take a very long time to search for all possible matching 431 The possible values for this option are CR, LF, CRLF, ANYCRLF, or ANY. This 432 makes it possible to use <b>pcregrep</b> on files that have come from other 586 It is possible to supply a regular expression that takes a very long time to
/external/pcre/doc/
pcregrep.1	46 possible to search for patterns that span line boundaries. What defines a line 82 It is possible to compile \fBpcregrep\fP so that it uses \fBlibz\fP or 142 because \fBpcregrep\fP has to search for all possible matches in a line, not 289 is currently possible only in Unix environments). Output to terminal is 313 Other patterns may take a very long time to search for all possible matching 365 The possible values for this option are CR, LF, CRLF, ANYCRLF, or ANY. This 366 makes it possible to use \fBpcregrep\fP on files that have come from other 515 It is possible to supply a regular expression that takes a very long time to
pcregrep.txt	48 makes it possible to search for patterns that span line boundaries. 86 It is possible to compile pcregrep so that it uses libz or libbz2 to 154 possible matches in a line, not just one, in order to colour 325 rently possible only in Unix environments). Output to termi- 354 take a very long time to search for all possible matching 418 possible values for this option are CR, LF, CRLF, ANYCRLF, or 419 ANY. This makes it possible to use pcregrep on files that 572 It is possible to supply a regular expression that takes a very lon     [all...]
/external/protobuf/gtest/include/gtest/internal/
gtest-type-util.h.pump	50 // #ifdef __GNUC__ is too general here. It is possible to use gcc without using 270 // The TypeList template makes it possible to use either a single type
/external/qemu/docs/
CHAR-DEVICES.TXT	29 In practice, this means it's not possible to reliably differentiate between 192 try to write as much data as possible to the other end. Any remaining data is stored

Completed in 1963 milliseconds

<<51525354555657585960>>