reference: [1] https://wahiduddin.net/calc/density_algorithms.htm [2] https://web.archive.org/web/20100528030817/https://www.colorado.edu/geography/we

dewPointFast() is > 5x faster than dewPoint() - run dewpoint_test.ino delta mdewPointFastax with dewPoint() - run dewpoint_test.ino ==> ~0.347 (earlie

pin = 0..15 value = LOW, HIGH

pin = 0..15 value = LOW, HIGH

pin = 0..7 value = LOW, HIGH

converts a packed array of bytes into a 32bit float. there can be an exponent overflow the mantissa is truncated to 23 bits.

can be optimized similar to dfactorial

Table page 3

///////////////////////////////////////////////////// DAC PART

///////////////////////////////////////////////////// ADC PART

# errors since last good read

///////////////////////////////////////////////////// CORE CONVERSION

exact ==> 12!

exact ==> 20!

FineTuneZeroPoint() a reading of v1 will be reported as v2 sort of mapping / offset check datasheet for detailed description

converts a float to a packed array of 8 bytes representing a 64 bit double restriction exponent and mantissa. float; array of 8 bytes; LSBFIRST; MSB

Y = A + B * X note if no elements are added or calculate is not called the values for A and B are 0

conversions added 0.2.3

CALL AFTER READ

get the average values of the datasets (if count > 0)

will replace getAvgX() in time

PPB

these return zero if not calibrated!

GETTERS