ccc8fe2fc5
The previous code calculates each step time via an "exponential search" followed by a "false position with Illinois algorithm" search. Replace with a "secant method" with "bounds check" search. This simplifies the code, improves the performance, and does a better job of finding steps near a direction change. Signed-off-by: Kevin O'Connor <kevin@koconnor.net> |
||
|---|---|---|
| .. | ||
| __init__.py | ||
| compiler.h | ||
| itersolve.c | ||
| itersolve.h | ||
| kin_cartesian.c | ||
| kin_corexy.c | ||
| kin_corexz.c | ||
| kin_delta.c | ||
| kin_extruder.c | ||
| kin_polar.c | ||
| kin_rotary_delta.c | ||
| kin_shaper.c | ||
| kin_winch.c | ||
| list.h | ||
| pyhelper.c | ||
| pyhelper.h | ||
| serialqueue.c | ||
| serialqueue.h | ||
| stepcompress.c | ||
| stepcompress.h | ||
| trapq.c | ||
| trapq.h | ||