|
@@ -363,17 +363,11 @@ class unified_bed_leveling {
|
363
|
363
|
static void line_to_destination_cartesian(const float &fr, const uint8_t e);
|
364
|
364
|
#endif
|
365
|
365
|
|
366
|
|
- #define _CMPZ(a,b) (z_values[a][b] == z_values[a][b+1])
|
367
|
|
- #define CMPZ(a) (_CMPZ(a, 0) && _CMPZ(a, 1))
|
368
|
|
- #define ZZER(a) (z_values[a][0] == 0)
|
369
|
|
-
|
370
|
|
- FORCE_INLINE bool mesh_is_valid() {
|
371
|
|
- return !(
|
372
|
|
- ( CMPZ(0) && CMPZ(1) && CMPZ(2) // adjacent z values all equal?
|
373
|
|
- && ZZER(0) && ZZER(1) && ZZER(2) // all zero at the edge?
|
374
|
|
- )
|
375
|
|
- || isnan(z_values[0][0])
|
376
|
|
- );
|
|
366
|
+ inline static bool mesh_is_valid() {
|
|
367
|
+ for (uint8_t x = 0; x < GRID_MAX_POINTS_X; x++)
|
|
368
|
+ for (uint8_t y = 0; y < GRID_MAX_POINTS_Y; y++)
|
|
369
|
+ if (isnan(z_values[x][y])) return false;
|
|
370
|
+ return true;
|
377
|
371
|
}
|
378
|
372
|
|
379
|
373
|
}; // class unified_bed_leveling
|