| /external/clang/lib/Frontend/ |
| InitHeaderSearch.cpp | 588 // Deduplicate and remember index.
|
| /external/clang/lib/Parse/ |
| ParseInit.cpp | 323 // If this is a normal array designator, remember it.
|
| /external/clang/lib/Rewrite/ |
| HTMLRewrite.cpp | 99 // Remember this character.
|
| /external/compiler-rt/lib/asan/ |
| asan_interceptors.cc | 176 // But asan does not remember UserId's for threads (pthread_t);
|
| /external/curl/lib/ |
| progress.c | 406 /* remember the exact time for this moment */
|
| /external/curl/lib/vauth/ |
| ntlm.c | 393 size_t domoff = hostoff + hostlen; /* This is 0: remember that host and
|
| /external/curl/src/ |
| tool_formparse.c | 69 /* remember the first escape position */
|
| /external/desugar/java/com/google/devtools/build/android/desugar/ |
| DefaultMethodClassFixer.java | 411 // Remember we stubbed this method in case it's also defined by subsequently visited
|
| LambdaDesugaring.java | 173 // (Note lambda body methods have unique names, so we don't need to remember desc here.)
|
| /external/e2fsprogs/ext2ed/ |
| general_com.c | 772 void remember (char *command_line) function
|
| /external/eigen/Eigen/src/Cholesky/ |
| LDLT.h | 43 * Remember that Cholesky decompositions are not rank-revealing. Also, do not use a Cholesky
|
| LLT.h | 37 * Remember that Cholesky decompositions are not rank-revealing. This LLT decomposition is only stable on positive definite matrices,
|
| /external/eigen/Eigen/src/QR/ |
| ColPivHouseholderQR.h | 543 // remember the maximum absolute value of diagonal coefficients
|
| FullPivHouseholderQR.h | 524 // remember the maximum absolute value of diagonal coefficients
|
| /external/eigen/doc/ |
| SparseLinearSystems.dox | 158 For iterative solvers, the compute step is used to eventually setup a preconditioner. For instance, with the ILUT preconditioner, the incomplete factors L and U are computed in this step. Remember that, basically, the goal of the preconditioner is to speedup the convergence of an iterative method by solving a modified linear system where the coefficient matrix has more clustered eigenvalues. For real problems, an iterative solver should always be used with a preconditioner. In Eigen, a preconditioner is selected by simply adding it as a template parameter to the iterative solver object.
|
| /external/elfutils/libdw/ |
| dwarf_getsrclines.c | 273 /* Remember array with the standard opcode length (-1 to account for
|
| /external/elfutils/src/ |
| size.c | 151 /* To print the total sizes in a reasonable format remember the higest
|
| /external/fio/tools/plot/ |
| fio2gnuplot | 193 # Index will be used to remember what file was featuring what value
|
| /external/freetype/docs/ |
| raster.txt | 340 Remember that a profile is an array, associating a _scanline_ to
|
| /external/freetype/src/autofit/ |
| afloader.c | 454 /* remember unhinted values to later account */
|
| /external/golang-protobuf/proto/ |
| extensions.go | 396 // Remember the decoded version and drop the encoded version.
|
| /external/google-breakpad/src/client/mac/sender/ |
| crash_report_sender.m | 287 // we go. Remember that the origin is in the bottom left, so elements above
|
| /external/google-breakpad/src/testing/gtest/include/gtest/ |
| gtest-param-test.h.pump | 109 // actual test case name. Remember to pick unique prefixes for different
|
| /external/googletest/googletest/include/gtest/ |
| gtest-param-test.h.pump | 109 // actual test case name. Remember to pick unique prefixes for different
|
| /external/guava/guava/src/com/google/common/base/ |
| Preconditions.java | 50 * come at a significant performance cost. Remember that parameter values for message construction
|
