refactor(api): height from volume binary search

[caila-marashaj]

Overview

For circular frusta, you can use calculus to determine a volume from a height, and not a height from a volume (the equation isolating height is a higher degree polynomial and gets pretty gross to try and solve analytically). The way we were getting around this before was by creating a lookup table during a protocol run, when a labware was loaded with a CircularFrustum, at a fixed interval of every 0.5 mm to maintain accuracy. This became a problem for very tall circular frusta (like test tubes), and protocols that used them with this code would silently pause for 2 minutes at the start to fill out these very large tables.

This implements a binary search instead to find a height from a volume within a circular frustum, upon request.

[codecov]

Codecov Report

All modified and coverable lines are covered by tests ✅

Project coverage is 25.67%. Comparing base (2a32194) to head (674f39c).
Report is 6 commits behind head on edge.

Additional details and impacted files

@@             Coverage Diff             @@
##             edge   #18081       +/-   ##
===========================================
- Coverage   57.52%   25.67%   -31.85%     
===========================================
  Files        3043     2938      -105     
  Lines      255340   227623    -27717     
  Branches    30544    27497     -3047     
===========================================
- Hits       146879    58446    -88433     
- Misses     108275   169160    +60885     
+ Partials      186       17      -169     

Flag	Coverage Δ
protocol-designer	19.04% <ø> (+0.05%)	⬆️
step-generation	4.37% <ø> (+<0.01%)	⬆️

Flags with carried forward coverage won't be shown. Click here to find out more.

see 2344 files with indirect coverage changes

🚀 New features to boost your workflow:

• ❄️ Test Analytics: Detect flaky tests, report on failures, and find test suite problems.
• 📦 JS Bundle Analysis: Save yourself from yourself by tracking and limiting bundle sizes in JS merges.

[sfoster1]

there's definitely a limit to the number of checks that we'll require, but it's still generally iffy to do a bunch of recursion in python (sadly!) because it can have a pretty heavy stack frame, so let's make this not recursive.

Let's also get this tested with hypothesis if we can, or ideally with some pretty rigorous numerics testing beyond just the boundary tests.

other than that, looks great!

[sfoster1]

This looks great and I'm always hype for hypothesis (#hypeforhypothesis)