| /external/eigen/Eigen/src/Core/ |
| Random.h | 25 { enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess = false, IsRepeatable = false }; };
|
| /external/eigen/blas/ |
| level1_cplx_impl.h | 21 enum { Cost = 3 * NumTraits<Scalar>::AddCost, PacketAccess = 0 };
|
| /external/eigen/doc/ |
| TopicAssertions.dox | 24 Assertions cost run time and can be turned off. You can suppress eigen_assert by defining \c EIGEN_NO_DEBUG \b before including Eigen headers. \c EIGEN_NO_DEBUG is undefined by default unless \c NDEBUG is defined.
|
| /external/eigen/test/eigen2/ |
| eigen2_cwiseop.cpp | 19 enum { Cost = NumTraits<Scalar>::AddCost };
|
| /external/gemmlowp/public/ |
| gemmlowp.h | 30 // Thus the ratio of compute/packing cost is rows*cols/(rows+cols)
|
| /external/glide/library/src/main/java/com/bumptech/glide/load/resource/gifbitmap/ |
| GifBitmapWrapperResourceDecoder.java | 105 // instead. Returning a Bitmap incurs the cost of allocating the GifDrawable as well as the normal
|
| /external/guava/guava/src/com/google/common/util/concurrent/ |
| RateLimiter.java | 84 * request that will experience extra throttling, thus paying for the cost of the expensive
92 // TODO(user): switch to nano precision. A natural unit of cost is "bytes", and a micro precision
213 * <p>Note though that, since each request repays (by waiting, if necessary) the cost
216 * it will pay the cost of the previous request, which is in terms of the previous rate.
|
| /external/icu/icu4c/source/common/ |
| bytestrieiterator.cpp | 37 // cost is minimal.
|
| ucharstrieiterator.cpp | 37 // cost is minimal.
|
| /external/icu/icu4c/source/test/perf/howExpensiveIs/ |
| readme.txt | 28 ** The data shows that, for example, parsing a number and opening the GB18030 converter are about the same cost. It also shows that opening a number formatter is about 60 times as expensive as formatting a number.
|
| /external/iproute2/man/man8/ |
| tc-tbf.8 | 34 Much higher rates are possible but at the cost of losing the minimal burstiness. In that
|
| /external/libavc/encoder/ |
| ih264e_rate_control.h | 261 * intra cost ,mb type and other
|
| /external/libjpeg-turbo/ |
| jconfig.txt | 45 * If you're not sure, leaving it undefined will work at some cost in speed.
|
| /external/liblzf/ |
| lzfP.h | 79 * Unconditionally aligning does not cost very much, so do it if unsure
|
| /external/libnfc-nci/halimpl/bcm2079x/hal/hal/ |
| nfc_hal_dm_cfg.c | 117 0x80, /* B4 threshold: Bigger thresholds give a smaller LPTD range but more immunity to false detections. Smaller thresholds increase LPTD range at the cost of greater likelihood of false detections. */
|
| /external/libphonenumber/libphonenumber/src/com/google/i18n/phonenumbers/ |
| MultiFileMetadataSourceImpl.java | 51 // Toll Free Service) and 808 (International Shared Cost Service).
|
| /external/libunwind/src/x86_64/ |
| getcontext.S | 33 and hence avoid the cost of a system call per unwind.
|
| /external/llvm/docs/HistoricalNotes/ |
| 2001-02-09-AdveComments.txt | 14 and readability. I agree to some extent, but it also comes at the cost
|
| /external/llvm/include/llvm/CodeGen/ |
| ResourcePriorityQueue.h | 104 /// Single cost function reflecting benefit of scheduling SU
|
| /external/llvm/include/llvm/DebugInfo/ |
| DIContext.h | 180 /// is not available, or the cost of retrieving it would be prohibitive, this
|
| /external/llvm/include/llvm/Support/ |
| StringPool.h | 10 // This file declares an interned string pool, which helps reduce the cost of
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| CodeExtractor.h | 104 /// significant impact on the cost however.
|
| /external/llvm/lib/CodeGen/ |
| RegAllocBase.h | 29 // the cost of splitting. The basic allocator allows for heuristic reassignment
|
| /external/llvm/lib/Target/PowerPC/ |
| PPCScheduleA2.td | 159 // A2 machine model for scheduling and other instruction cost heuristics.
|
| PPCScheduleG5.td | 117 // G5 machine model for scheduling and other instruction cost heuristics.
|
