HomeSort by relevance Sort by last modified time
    Searched full:possible (Results 451 - 475 of 11328) sorted by null

<<11121314151617181920>>

  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/
test_startfile.py 6 # A possible improvement would be to have empty.vbs do something that
  /tools/external/fat32lib/src/main/java/de/waldheinz/fs/
ReadOnlyException.java 24 * an unchecked exception, as it should always be possible to query the object
  /external/clang/test/SemaCXX/
addr-of-overloaded-function.cpp 64 C &makeAC(); // expected-note{{possible target for call}}
65 const C &makeAC() const; // expected-note{{possible target for call}}
75 void q1(int); // expected-note{{possible target for call}}
77 void q2(T t = T()); // expected-note{{possible target for call}}
79 void q3(); // expected-note{{possible target for call}}
81 void q4(); // expected-note{{possible target for call}}
83 void q5(); // expected-note{{possible target for call}}
  /external/mesa3d/src/gallium/drivers/llvmpipe/
lp_rast_debug.c 336 unsigned possible = 0; local
356 possible += 64*64;
378 debug_printf("this tile total: %u possible %u: percentage: %f\n",
380 possible,
381 total * 100.0 / (float)possible);
384 _possible += possible;
386 debug_printf("overall total: %llu possible %llu: percentage: %f\n",
  /external/pcre/dist/doc/html/
pcrematching.html 44 When there is only one possible way in which a given subject string can match a
54 there are three possible answers. The standard algorithm finds only one of
81 the algorithm stops. Thus, if there is more than one possible match, this
112 Thus, if there is more than one possible match, this algorithm finds all of
133 DFA matching, this means that only one possible match is found. If you really
142 1. Because the algorithm finds all possible matches, the greedy or ungreedy
193 1. All possible matches (at a single point in the subject) are automatically
200 never needs to backtrack (except for lookbehinds), it is possible to pass very
202 partial matching each time. Although it is possible to do multi-segment
215 because it has to search for all possible matches, but is also because it i
    [all...]
pcre.html 32 Starting with release 8.30, it is possible to compile two separate PCRE
36 built. The majority of the work to make this possible was done by Zoltan
40 Starting with release 8.32 it is possible to compile a third separate PCRE
43 work to make this possible was done by Christian Persch.
99 function makes it possible for a client to discover which features are
114 clashes. In some environments, it is possible to control which external symbols
  /external/clang/lib/StaticAnalyzer/Core/
RangeConstraintManager.cpp 72 /// possible values for that symbol.
163 // The entire range is outside the symbol's set of possible values.
168 // However, if the range wraps around, it spans all possible values.
173 // The range starts below what's possible but ends within it. Pin.
178 // The range spans all possible values for the symbol. Pin.
187 // The range wraps around, but all lower values are not possible.
197 // The range starts within what's possible but ends above it. Pin.
206 // The range wraps but is outside the symbol's set of possible values.
209 // The range starts above what's possible but ends within it (wrap).
214 // The entire range is outside the symbol's set of possible values
    [all...]
  /external/icu/icu4c/source/common/
caniter.cpp 378 //String possible = (String) it2.next();
379 //UnicodeString *possible = new UnicodeString(*((UnicodeString *)(ne2->value.pointer)));
380 UnicodeString possible(*((UnicodeString *)(ne2->value.pointer)));
382 nfd.normalize(possible, attempt, status);
386 //if (PROGRESS) printf("Adding Permutation: %s\n", UToS(Tr(*possible)));
388 result.put(possible, new UnicodeString(possible), status); //add(possible);
390 //if (PROGRESS) printf("-Skipping Permutation: %s\n", UToS(Tr(*possible)));
  /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/nio/channels/
SocketChannelTest.java     [all...]
  /cts/apps/CameraITS/pymodules/its/
objects.py 148 may slow down capture set to OFF or FAST if possible
181 req: the input request. filter will be set to OFF or FAST if possible.
199 OFF or FAST if possible.
237 format specification, for the fastest possible (legal) capture that
252 """Returns the maximum amount of zooming possible by the camera device.
258 A float indicating the maximum amount of zooming possible by the
  /external/llvm/utils/lit/
TODO 21 * It isn't possible to specify virtual tests as inputs. For example, it is not
22 possible to specify an individual subtest to run with the googletest format.
65 input specifiers. For test formats we could ostensibly require all the possible
100 converts scripts to bash doesn't try and validate the syntax, it is possible
138 example, and would probably interact well with other possible features like
143 * One possible downside could be for test formats that cannot determine their
  /external/lzma/xz-embedded/
xz.h 50 * It is possible to enable support only for a subset of the above
66 * return code is possible only in multi-call mode
70 * is still possible in multi-call mode by simply
78 * possible only if the decoder was initialized
84 * xz_dec_init(). This return value is possible
205 * The possible return values depend on build options and operation mode.
  /external/pcre/dist/doc/
pcre.3 14 Starting with release 8.30, it is possible to compile two separate PCRE
18 built. The majority of the work to make this possible was done by Zoltan
21 Starting with release 8.32 it is possible to compile a third separate PCRE
24 work to make this possible was done by Christian Persch.
93 function makes it possible for a client to discover which features are
115 clashes. In some environments, it is possible to control which external symbols
  /external/valgrind/helgrind/tests/
annotate_rwlock.stderr.exp 17 Possible data race during read of size 4 at 0x........ by thread #x
34 Possible data race during read of size 4 at 0x........ by thread #x
51 Possible data race during write of size 4 at 0x........ by thread #x
68 Possible data race during write of size 4 at 0x........ by thread #x
85 Possible data race during write of size 4 at 0x........ by thread #x
107 Possible data race during write of size 4 at 0x........ by thread #x
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/sys/
cdefs.h 205 (although this would be possible) since it generates warnings. */
214 (although this would be possible) since it generates warnings. */
223 (although this would be possible) since it generates warnings. */
241 (although this would be possible) since it generates warnings.
253 unconditionally (although this would be possible) since it
322 /* It is possible to compile containing GCC extensions even if GCC is
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/x86_64-linux-gnu/bits/
fcntl.h 292 This function is a possible cancellation point and therefore not
300 This function is a possible cancellation point and therefore not
307 This function is a possible cancellation point and therefore not
315 This function is a possible cancellation point and therefore not
322 This function is a possible cancellation point and therefore not
348 This function is a possible cancellation point and therefore not
  /cts/tools/dasm/src/dasm/
Utils.java 44 * Converts string to a smallest possible number (int, long, float or
68 * Converts string to a smallest possible integer (int or long)
  /developers/build/prebuilts/gradle/RenderScriptIntrinsic/
README.md 30 RenderScript intrinsics will usually be the fastest possible way for a developer to perform these operations. The
31 Android team works closely with our partners to ensure that the intrinsics perform as fast as possible on their
  /developers/samples/android/renderScript/RenderScriptIntrinsic/
README.md 30 RenderScript intrinsics will usually be the fastest possible way for a developer to perform these operations. The
31 Android team works closely with our partners to ensure that the intrinsics perform as fast as possible on their
template-params.xml 93 RenderScript intrinsics will usually be the fastest possible way for a developer to perform these operations. The
94 Android team works closely with our partners to ensure that the intrinsics perform as fast as possible on their
  /development/ndk/platforms/android-9/arch-mips/include/sys/
_sigdefs.h 72 __BIONIC_SIGDEF(IO,22,"I/O possible")
96 __BIONIC_SIGDEF(IO,29,"I/O possible")
  /external/bison/build-aux/
cross-options.pl 14 (?:(-\w),\s+)? # $1: $short: Possible short option.
17 (?:=(\S+))? # $4: $arg: Possible argument name.
  /external/clang/test/CXX/dcl.dcl/dcl.spec/dcl.type/dcl.spec.auto/
p6.cpp 88 int method(int); // expected-note{{possible target for call}}
89 int method(float); // expected-note{{possible target for call}}
  /external/eigen/Eigen/src/Core/util/
Constants.h 36 * These are the possible bits which can be OR'ed to constitute the flags of a matrix or
72 * case, there is the additional condition that it be possible to access all the
75 * there is no such condition on the total size and strides, so it might not be possible to access
106 * (row,col)-based access. Expressions for which that isn't possible don't have the LinearAccessBit.
163 * Enum containing possible values for the \p Mode parameter of
204 * Enum containing possible values for the \p Direction parameter of
260 * Enum containing possible values for the \p _Options template parameter of
356 * Possible values for the \p QRPreconditioner template parameter of JacobiSVD. */
  /external/freetype/include/
ftsizes.h 62 /* It is however possible to create more sizes for a given face, */
130 /* Even though it is possible to create several size objects for a */

Completed in 500 milliseconds

<<11121314151617181920>>