| /external/eigen/Eigen/src/Core/ |
| GeneralProduct.h | 21 * \param LhsNested the type used to store the left-hand side
22 * \param RhsNested the type used to store the right-hand side
136 * \param Lhs the type of the left-hand side
137 * \param Rhs the type of the right-hand side
408 // on, the other hand it is good for the cache to pack the vector anyways...
480 // on, the other hand it is good for the cache to pack the vector anyways...
|
| /external/chromium_org/third_party/sqlite/src/test/ |
| fts4aa.test | 110 INSERT INTO t1(docid,words) VALUES(1003022,'And the LORD God said, Behold, the man is become as one of us, to know good and evil: and now, lest he put forth his hand, and take also of the tree of life, and eat, and live for ever:');
123 INSERT INTO t1(docid,words) VALUES(1004011,'And now art thou cursed from the earth, which hath opened her mouth to receive thy brother''s blood from thy hand;');
[all...] |
| tkt-80e031a00f.test | 14 # right-hand sides. Such expressions should always return TRUE or FALSE
15 # even if the left-hand side is NULL.
32 # list of scalar values on the right-hand side of an IN or NOT IN
|
| /external/eigen/doc/ |
| C09_TutorialSparse.dox | 72 On the other hand, inserting elements with increasing inner indices in a given inner vector is much more efficient since this only requires to increase the respective \c InnerNNZs entry that is a O(1) operation.
83 On the other hand, the insertion of a new element into a SparseMatrix converts this later to the \b uncompressed mode.
101 Such problem can be mathematically expressed as a linear problem of the form \f$ Ax=b \f$ where \f$ x \f$ is the vector of \c m unknowns (in our case, the values of the pixels), \f$ b \f$ is the right hand side vector resulting from the boundary conditions, and \f$ A \f$ is an \f$ m \times m \f$ matrix containing only a few non-zero elements resulting from the discretization of the Laplacian operator.
113 In the main function, we declare a list \c coefficients of triplets (as a std vector) and the right hand side vector \f$ b \f$ which are filled by the \a buildProblem function.
303 // solve for another right hand side:
355 On the other hand, there is no restriction on the target matrix sm4.
415 Just as with dense matrices, the triangularView() function can be used to address a triangular part of the matrix, and perform triangular solves with a dense right hand side:
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/logging/ |
| config.py | 142 for hand in hlist:
143 sectname = "handler_%s" % hand
169 handlers[hand] = h
197 for hand in hlist:
198 log.addHandler(handlers[hand])
249 for hand in hlist:
250 logger.addHandler(handlers[hand])
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/logging/ |
| config.py | 142 for hand in hlist:
143 sectname = "handler_%s" % hand
169 handlers[hand] = h
197 for hand in hlist:
198 log.addHandler(handlers[hand])
249 for hand in hlist:
250 logger.addHandler(handlers[hand])
[all...] |
| /frameworks/base/docs/html/tools/debugging/ |
| debugging-ui.jd | 134 <strong>Tree View</strong>: The left-hand pane displays the Tree View,
167 The upper right-hand pane displays the <strong>Tree Overview</strong>, a smaller map
176 The middle right-hand pane displays the <strong>Properties View</strong>,
186 The lower right-hand pane displays the <strong>Layout View</strong>,
215 clicking the window selection icon in the bottom left-hand corner of the window. This
|
| /hardware/ti/omap3/omx/system/src/openmax_il/perf/inc/ |
| perf.h | 477 * from another module. These go hand-in-hand with
544 * goes in hand with the PERF_ReceivedCommand to measure the
570 * another module. These go hand-in-hand with SendingBuffer and
[all...] |
| /external/ceres-solver/internal/ceres/ |
| schur_eliminator.h | 178 // least squares problem [A;D] x = [b;0]. The left hand side and the
179 // right hand side of the reduced linear system are returned in lhs
347 // Locks for the blocks in the right hand side of the reduced linear
|
| /external/chromium_org/chrome/browser/omnibox/ |
| omnibox_field_trial.cc | 263 // This is a best-effort conversion; we trust the hand-crafted parameters
291 // This is a best-effort conversion; we trust the hand-crafted parameters
314 // This is a best-effort conversion; we trust the hand-crafted parameters
|
| /external/chromium_org/third_party/icu/source/common/ |
| rbbicst.pl | 14 # of a normal ICU build. It is run by hand when needed, and the
242 print " * Generated Java File. Do not edit by hand.\n";
338 print "// Generated Header File. Do not edit by hand.\n";
|
| /external/chromium_org/third_party/openssl/openssl/crypto/bn/asm/ |
| via-mont.pl | 16 # Lines marked with "software integer" denote performance of hand-
18 # refers to hand-coded SSE2 Montgomery multiplication procedure found
61 # running hand-coded SSE2 bn_mul_mont found in 0.9.9, i.e. "software
|
| /external/eigen/Eigen/src/Cholesky/ |
| LLT.h | 126 && "LLT::solve(): invalid number of rows of the right hand side matrix b");
437 * \param bAndX represents both the right-hand side matrix b and result x.
441 * This version avoids a copy when the right hand side matrix b is not
|
| /external/eigen/Eigen/src/CholmodSupport/ |
| CholmodSupport.h | 222 && "CholmodDecomposition::solve(): invalid number of rows of the right hand side matrix b");
236 && "CholmodDecomposition::solve(): invalid number of rows of the right hand side matrix b");
483 * On the other hand, it does not provide access to the result of the factorization.
|
| /external/icu4c/common/ |
| rbbicst.pl | 14 # of a normal ICU build. It is run by hand when needed, and the
242 print " * Generated Java File. Do not edit by hand.\n";
338 print "// Generated Header File. Do not edit by hand.\n";
|
| /external/openssl/crypto/bn/asm/ |
| via-mont.pl | 16 # Lines marked with "software integer" denote performance of hand-
18 # refers to hand-coded SSE2 Montgomery multiplication procedure found
61 # running hand-coded SSE2 bn_mul_mont found in 0.9.9, i.e. "software
|
| /external/robolectric/src/main/java/com/xtremelabs/robolectric/res/ |
| ResourceLoader.java | 304 // Hand tested
326 // Hand tested
336 // Hand tested
|
| /frameworks/base/graphics/java/android/renderscript/ |
| Matrix4f.java | 223 * @param lhs left hand side matrix
224 * @param rhs right hand side matrix
355 * @param rhs right hand side to multiply by
|
| /frameworks/support/v8/renderscript/java/src/android/support/v8/renderscript/ |
| Matrix4f.java | 223 * @param lhs left hand side matrix
224 * @param rhs right hand side matrix
355 * @param rhs right hand side to multiply by
|
| /external/chromium_org/chrome/common/extensions/docs/server2/ |
| cron_servlet.py | 155 # Start running the hand-written Cron methods first; they can be run in
216 # Resolve the hand-written Cron method futures.
|
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| StdLibExtras.h | 199 // chopping off the right hand half of the array.
202 // Discard all values in the left hand half of the array, up to and including the item at pos.
|
| /external/chromium_org/third_party/sqlite/src/doc/ |
| lemon.html | 287 A nonterminal, on the other hand, is any string of alphanumeric
312 The list of terminals and nonterminals on the right-hand side of the
314 Rules can occur in any order, except that the left-hand side of the
345 action to stand for the value of the left-hand side of the rule and
348 right-hand side of the rule.
351 to miscount the number of symbols on the right-hand side of a grammar
388 right-hand side of a rule.</p>
582 the right-hand side is not linked to C code.
[all...] |
| /external/clang/test/SemaObjC/ |
| atomoic-property-synnthesis-rules.m | 7 3. the current @implementation contains a hand-written setter XOR getter
143 // same as above, but @synthesize follows the hand-written methods - might warn
|
| /external/dropbear/libtommath/ |
| bn_mp_div.c | 213 /* find left hand */
222 /* find right hand */
|
| /external/icu4c/samples/ufortune/resources/ |
| root.txt | 112 "A bird in the hand is worth what it will bring.",
114 "A bird in the hand makes it awfully hard to blow your nose.",
|
