Home
last modified time | relevance | path

Searched refs:average (Results 1 – 8 of 8) sorted by relevance

/device/google/contexthub/firmware/os/drivers/ams_tmd2772/
Dams_tmd2772.c525 uint16_t average = mData.calibrationSampleTotal / mData.calibrationSampleCount; in handle_calibration_event() local
526 uint16_t crosstalk = (average > 0x7f) ? 0x7f : average; in handle_calibration_event()
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Tools/pybench/
DREADME46 values for minimum and average time, then you likely have some
152 Test minimum average operation overhead
342 - changed to use min() as timing estimator (average
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Modules/zlib/
Dalgorithm.txt86 those cases, the table ended up one bit longer than the ``average'' code
185 the symbols, it takes on the average 1.25 lookups per symbol. That's compared
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/zlib/
Dalgorithm.txt86 those cases, the table ended up one bit longer than the ``average'' code
185 the symbols, it takes on the average 1.25 lookups per symbol. That's compared
/device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/antlr/
Dantlr1.txt181 the general case of LL(k) parsing. The average com-
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Objects/
Dlistsort.txt38 comparisons on average, it can be expected to do better the more
104 average (across all permutations). When a method gets significantly
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Objects/
Dlistsort.txt38 comparisons on average, it can be expected to do better the more
105 the best any comparison-based sorting algorithm can do on average (across
/device/linaro/bootloader/arm-trusted-firmware/docs/
Dfirmware-design.rst2169 minimum latency of acquiring a lock is on an average 3-4 micro seconds whereas