| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/pgen2/ |
| driver.py | 40 # XXX Move the prefix computation into a wrapper around tokenize.
|
| /external/guava/guava/src/com/google/common/collect/ |
| MapMaker.java | 56 * <li>on-demand computation of values for keys not already present
574 * Builds a thread-safe map, without on-demand computation of values. This method does not alter
606 * Builds a map that supports atomic, on-demand computation of values. {@link Map#get} either
616 * computation from the cache's {@code Map} view.
620 * until the value's computation completes.
637 * <p>If {@link Map#put} is called before a computation completes, other threads waiting on the
638 * computation will wake up and return the stored value.
[all...] |
| /external/guava/guava/src/com/google/common/util/concurrent/ |
| Futures.java | 605 * their implementations defer starting computation until their
640 * their implementations defer starting computation until their
[all...] |
| /external/clang/lib/Sema/ |
| DeclSpec.cpp | 63 "NestedNameSpecifierLoc range computation incorrect");
76 "NestedNameSpecifierLoc range computation incorrect");
89 "NestedNameSpecifierLoc range computation incorrect");
102 "NestedNameSpecifierLoc range computation incorrect");
112 "NestedNameSpecifierLoc range computation incorrect");
[all...] |
| /external/eigen/doc/ |
| I03_InsideEigenExample.dox | 58 SSE2, like AltiVec, is a set of instructions allowing to perform computations on packets of 128 bits at once. Since a float is 32 bits, this means that SSE2 instructions can handle 4 floats at once. This means that, if correctly used, they can make our computation go up to 4x faster.
60 However, in the above program, we have chosen size=50, so our vectors consist of 50 float's, and 50 is not a multiple of 4. This means that we cannot hope to do all of that computation using SSE2 instructions. The second best thing, to which we should aim, is to handle the 48 first coefficients with SSE2 instructions, since 48 is the biggest multiple of 4 below 50, and then handle separately, without SSE2, the 49th and 50th coefficients. Something like this:
123 The executive summary is that operator+ returns a "sum of vectors" expression, but doesn't actually perform the computation. It is the operator=, whose call occurs thereafter, that does the computation.
141 The CwiseBinaryOp class is our first encounter with an expression template. As we said, the operator+ doesn't by itself perform any computation, it just returns an abstract "sum of vectors" expression. Since there are also "difference of vectors" and "coefficient-wise product of vectors" expressions, we unify them all as "coefficient-wise binary operations", which we abbreviate as "CwiseBinaryOp". "Coefficient-wise" means that the operations is performed coefficient by coefficient. "binary" means that there are two operands -- we are adding two vectors with one another.
216 Thus, the operator+ hasn't performed any actual computation. To summarize, the operation \a v + \a w just returned an object of type CwiseBinaryOp which did nothing else than just storing references to \a v and \a w.
|
| /external/llvm/include/llvm/CodeGen/ |
| ISDOpcodes.h | 652 /// It considers the computation as being folded into the load /
654 /// computation as well as performing the memory transaction).
658 /// computation); a pre-indexed store produces one value (result
659 /// of the address computation).
666 /// computation); a post-indexed store produces one value (the
667 /// the result of the base +/- offset computation).
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| LL1Analyzer.java | 58 /** Used during LOOK to detect computation cycles */
284 * and lets ANTLR do a simple LL(1)+pred computation.
|
| /external/ceres-solver/include/ceres/ |
| types.h | 220 // Storage". Mathematics of Computation 35 (151): 773?782.
256 // The default trust region strategy is to use the step computation
|
| /external/chromium_org/ash/wm/ |
| window_resizer.cc | 377 // for the window origin computation.
410 // for the window origin computation.
|
| /external/chromium_org/native_client_sdk/src/doc/ |
| overview.rst | 82 code for the computation engine of your application directly to Native Client,
88 * **Heavy computation in enterprise applications:** Native Client can handle the
|
| /external/chromium_org/third_party/libxml/src/ |
| TODO | 25 - Computation of base when HTTP redirect occurs, might affect HTTP
27 - Computation of base in XInclude. Relativization of URIs.
|
| /external/chromium_org/third_party/mesa/src/docs/ |
| relnotes-9.0.2.html | 234 <li>st/mesa: fix computation of last_level during texture creation</li>
235 <li>st/mesa: fix computation of last_level in GenerateMipmap</li>
|
| /external/chromium_org/third_party/opus/src/silk/ |
| control_codec.c | 238 psEnc->sCmn.TargetRate_bps = 0; /* trigger new SNR computation */
253 psEnc->sCmn.TargetRate_bps = 0; /* trigger new SNR computation */
|
| /external/chromium_org/third_party/skia/src/gpu/ |
| GrDrawState.cpp | 220 // Check whether coverage is treated as color. If so we run through the coverage computation.
354 // of if we can skip color computation and just emit coverage
|
| /external/eigen/Eigen/src/Cholesky/ |
| LLT.h | 159 /** \brief Reports whether previous computation was successful.
161 * \returns \c Success if computation was succesful,
|
| /external/eigen/Eigen/src/CholmodSupport/ |
| CholmodSupport.h | 193 /** \brief Reports whether previous computation was successful.
195 * \returns \c Success if computation was succesful,
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| ComplexSchur.h | 186 /** \brief Reports whether previous computation was successful.
188 * \returns \c Success if computation was succesful, \c NoConvergence otherwise.
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| IncompleteLUT.h | 74 /** \brief Reports whether previous computation was successful.
76 * \returns \c Success if computation was succesful,
|
| /external/eigen/Eigen/src/LU/ |
| Inverse.h | 325 * Computation of matrix inverse and determinant, with invertibility check.
365 * Computation of matrix inverse, with invertibility check.
|
| /external/eigen/Eigen/src/UmfPackSupport/ |
| UmfPackSupport.h | 156 /** \brief Reports whether previous computation was successful.
158 * \returns \c Success if computation was succesful,
|
| /external/fdlibm/ |
| k_rem_pio2.c | 84 * in the computation. The recommended value is 2,3,4,
93 * computation. In general, we want
|
| /external/libgsm/src/ |
| rpe.c | 309 /* This computation uses the fact that the decoded version of xmaxc
320 /* Direct computation of xMc[0..12] using table 4.5
|
| /external/libvorbis/lib/ |
| lsp.c | 17 few bugfixes) from "On the Computation of the LSP Frequencies" by
44 /* three possible LSP to f curve functions; the exact computation
|
| /external/mesa3d/docs/ |
| relnotes-9.0.2.html | 234 <li>st/mesa: fix computation of last_level during texture creation</li>
235 <li>st/mesa: fix computation of last_level in GenerateMipmap</li>
|
| /external/pixman/pixman/ |
| pixman-radial-gradient.c | 46 * Exact computation, assuming that the input values can
301 /* warning: this computation may overflow */
|
