| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| NFAToDFAConverter.java | 327 // predict any alt.
357 * The normal decision to predict alts 1, 2, 3 is:
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/ode/nonstiff/ |
| AdamsMoultonIntegrator.java | 251 // predict a first estimate of the state at step end (P in the PECE sequence)
|
| /external/chromium-trace/catapult/third_party/WebOb/docs/ |
| jsonrpc-example.txt | 623 It's hard to actually predict this exception, because the test of the
|
| /external/libavc/decoder/ |
| ih264d_process_pslice.c | 243 /* Predict Mv */
[all...] |
| /external/libavc/encoder/ |
| ime.c | 374 * This function begins by computing the mv predict vector for the current mb.
|
| /external/libogg/doc/ |
| ogg-multiplex.html | 184 timing of, for example, a specific caption is impossible to predict
|
| oggstream.html | 269 <p>Though modern design wisdom usually prefers to predict all possible
|
| /external/libvncserver/common/ |
| turbojpeg.h | 364 * represent a very rare corner case, but since there is no way to predict the
|
| /external/libvncserver/webclients/novnc/include/ |
| keyboard.js | 199 // Given a keycode, try to predict which keysym it might be.
|
| /external/llvm/lib/Transforms/Scalar/ |
| StructurizeCFG.cpp | 756 /// \brief Can we predict that this node will always be called?
|
| /external/opencv3/modules/ml/src/ |
| em.cpp | 160 float predict(InputArray _inputs, OutputArray _outputs, int) const function in class:cv::ml::EMImpl
|
| /external/tcpdump/ |
| print-dhcp6.c | 506 * Since we cannot predict the encoding, print hex dump
|
| /frameworks/av/media/libstagefright/codecs/amrnb/dec/src/ |
| d_gain_c.cpp | 210 * predict codebook gain *
|
| dec_gain.cpp | 267 * predict codebook gain *
|
| /frameworks/av/media/libstagefright/codecs/m4v_h263/dec/src/ |
| dcac_prediction.cpp | 195 /* Now predict the DC coefficient */
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/ |
| CHANGELOG | 287 Make hor UV predict ~2x faster (73 vs 132 cycles) using SSSE3.
|
| /hardware/libhardware/include/hardware/ |
| keymaster1.h | 233 * predict (or control), then the RNG output is indistinguishable from random. Thus, if the
|
| keymaster2.h | 65 * predict (or control), then the RNG output is indistinguishable from random. Thus, if the
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/nio/channels/ |
| ChannelsTest.java | 176 // they become SeekableByteChannels that can correctly predict the number of
|
| /packages/apps/ExactCalculator/src/com/android/calculator2/ |
| CalculatorResult.java | 237 * This is unfortunately complicated because we need to predict whether trailing digits
|
| /packages/apps/Test/connectivity/sl4n/rapidjson/doc/ |
| internals.md | 328 There is a great [tool](http://hackingoff.com/compilers/predict-first-follow-set) for above grammar analysis.
|
| /packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/ |
| OpenWnnEN.java | 785 candidates = mConverter.predict(mComposingText, 0, -1);
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
| function.h | 779 /* In predict.c */
|
| /prebuilts/go/darwin-x86/doc/ |
| gccgo_install.html | 432 which one is difficult to predict in general; use a cast. C <code>union</code>
|
| /prebuilts/go/linux-x86/doc/ |
| gccgo_install.html | 432 which one is difficult to predict in general; use a cast. C <code>union</code>
|
