ticks_diff.py 1.1 KB

123456789101112131415161718192021222324252627282930313233
  1. from utime import ticks_diff, ticks_add
  2. MAX = ticks_add(0, -1)
  3. # Should be done like this to avoid small int overflow
  4. MODULO_HALF = MAX // 2 + 1
  5. # Invariants:
  6. # if ticks_diff(a, b) = c,
  7. # then ticks_diff(b, a) = -c
  8. assert ticks_diff(1, 0) == 1, ticks_diff(1, 0)
  9. assert ticks_diff(0, 1) == -1
  10. assert ticks_diff(0, MAX) == 1
  11. assert ticks_diff(MAX, 0) == -1
  12. assert ticks_diff(0, MAX - 1) == 2
  13. # Maximum "positive" distance
  14. assert ticks_diff(MODULO_HALF, 1) == MODULO_HALF - 1, ticks_diff(MODULO_HALF, 1)
  15. # Step further, and it becomes a negative distance
  16. assert ticks_diff(MODULO_HALF, 0) == -MODULO_HALF
  17. # Offsetting that in either direction doesn't affect the result
  18. off = 100
  19. # Cheating and skipping to use ticks_add() when we know there's no wraparound
  20. # Real apps should use always it.
  21. assert ticks_diff(MODULO_HALF + off, 1 + off) == MODULO_HALF - 1
  22. assert ticks_diff(MODULO_HALF + off, 0 + off) == -MODULO_HALF
  23. assert ticks_diff(MODULO_HALF - off, ticks_add(1, -off)) == MODULO_HALF - 1
  24. assert ticks_diff(MODULO_HALF - off, ticks_add(0, -off)) == -MODULO_HALF
  25. print("OK")