Searched refs:compared (Results 1 – 25 of 156) sorted by relevance
1234567
| /external/llvm/docs/CommandGuide/ |
| D | llvm-diff.rst | 25 are compared; otherwise, all global values are compared, and
31 then the corresponding successors are compared; otherwise they are
|
| /external/deqp/doc/testspecs/GLES31/ |
| D | functional.separate_shader.txt | 50 resulting image is compared to a reference image drawn with the program
56 resulting image is compared to a reference image from a similar program
69 result is compared to a triangle drawn with an equivalent monolithic
|
| D | functional.image_load_store.txt | 63 compared to a reference image. All image formats are tested. The compute shader
69 their corresponding textures all have the same format. The results are compared
94 this expression is stored to the image. The result is compared to a reference
116 is compared to a reference.
|
| D | functional.tessellation.txt | 67 The vertices are read with transform feedback, and the results are compared to a
81 segment sets produced by different isolines are also compared to each other to
129 rendering cases are compared to pre-computed reference images.
|
| /external/zopfli/ |
| D | README.zopflipng | 26 gives a compression improvement of 12% compared to convert -q 95, but only 0.5%
27 compared to pngout (from better of /f0 and /f5 runs).
|
| /external/libyuv/ |
| D | README.google | 10 speed up to 10x to 16x compared to C code.
|
| /external/iptables/extensions/ |
| D | libip6t_eui64.man | 4 bit is not compared. This module doesn't match other link layer frame, and
|
| D | libxt_rateest.man | 46 In the so-called "absolute mode", only one rate estimator is used and compared
48 compared against another.
|
| /external/chromium-trace/trace-viewer/tracing/third_party/devscripts/ |
| D | README.chromium | 11 compared with the unpatched script (e.g. when sending the changes upstream).
|
| /external/bzip2/ |
| D | bzdiff.1 | 27 If only 1 file is specified, then the files compared are
|
| /external/llvm/test/CodeGen/Generic/ |
| D | 2003-07-08-BadCastToBool.ll | 12 ;; the result has to be compared with 0.
|
| D | 2003-07-06-BadIntCmp.ll | 12 ;; is wrong because the value being compared (int euclid = x*x + y*y)
|
| /external/deqp/doc/testspecs/GLES2/ |
| D | functional.texture.units.txt | 40 lookup results together. Resulting image is compared against a reference image
|
| D | functional.rasterization.txt | 40 and triangles are compared to reference, and a deviation of 1 pixel in
|
| /external/deqp/doc/testspecs/GLES3/ |
| D | functional.texture.swizzle.txt | 38 The rendered image is compared against a reference that is produced by
|
| D | functional.texture.sampler.txt | 45 Rendered image is compared against a reference image produced by a reference
|
| D | functional.texture.specification.txt | 47 textures and 3D textures) are then rendered and compared against a image produced
|
| D | functional.fbo.msaa.txt | 43 Resulting image is compared agaist an image produced by a reference renderer.
|
| D | functional.buffers.txt | 49 Results are compared against reference data or reference rendering.
|
| D | functional.fbo.blit.txt | 51 Rendered image is compared against a reference image computed by a reference
|
| D | functional.texture.shadow.txt | 38 The rendered image is compared against a reference that is produced by
|
| D | functional.frag_output.txt | 47 Resulting image is read from all render targets and compared against
|
| /external/clang/docs/ |
| D | PTHInternals.rst | 84 Further, compared to GCC's PCH implementation (which is the dominate
86 compared against) the PTH design in Clang yields several attractive
124 handicaps compared to other PCH strategies such as those used by GCC.
|
| /external/eigen/Eigen/ |
| D | CholmodSupport | 23 * Note that these classes does not bring any particular advantage compared to the built-in
|
| /external/zlib/src/doc/ |
| D | algorithm.txt | 24 strings in the chain are compared with the current input string, and
182 be constructed. That's compared to 64 entries for a single table. Or
183 compared to 16 entries for a Huffman tree (six two entry tables and one four
185 the symbols, it takes on the average 1.25 lookups per symbol. That's compared
|
1234567