|
52 | 52 | if bounding>0 |
53 | 53 | # If bounding is requested, add extrapolated top and bottom bounds to avoid |
54 | 54 | # issues with the stratigraphic markov chain wandering off to +/- infinity |
55 | | - (youngest, oldest) = extrema(Age) |
| 55 | + (youngest, oldest) = nanextrema([nanminimum(Age[Age_Sidedness .== -1]); Age[Age_Sidedness .== 0]; nanmaximum(Age[Age_Sidedness .== 1])]) |
56 | 56 | dt_dH = (oldest-youngest)/(top-bottom) |
57 | 57 | offset = round((top-bottom)*bounding/resolution)*resolution |
58 | 58 | Age = [oldest + offset*dt_dH; Age; youngest - offset*dt_dH] |
|
116 | 116 | if bounding>0 |
117 | 117 | # If bounding is requested, add extrapolated top and bottom bounds to avoid |
118 | 118 | # issues with the stratigraphic markov chain wandering off to +/- infinity |
119 | | - (youngest, oldest) = extrema(Age) |
| 119 | + (youngest, oldest) = nanextrema([nanminimum(Age[Age_Sidedness .== -1]); Age[Age_Sidedness .== 0]; nanmaximum(Age[Age_Sidedness .== 1])]) |
120 | 120 | dt_dH = (oldest-youngest)/(top-bottom) |
121 | 121 | offset = round((top-bottom)*bounding/resolution)*resolution |
122 | 122 | Age = [oldest + offset*dt_dH; Age; youngest - offset*dt_dH] |
|
332 | 332 | if bounding>0 |
333 | 333 | # If bounding is requested, add extrapolated top and bottom bounds to avoid |
334 | 334 | # issues with the stratigraphic markov chain wandering off to +/- infinity |
335 | | - (youngest, oldest) = extrema(Age) |
| 335 | + (youngest, oldest) = nanextrema([nanminimum(Age[Age_Sidedness .== -1]); Age[Age_Sidedness .== 0]; nanmaximum(Age[Age_Sidedness .== 1])]) |
336 | 336 | dt_dH = (oldest-youngest)/(top-bottom) |
337 | 337 | offset = round((top-bottom)*bounding/resolution)*resolution |
338 | 338 | Age = [oldest + offset*dt_dH; Age; youngest - offset*dt_dH] |
|
400 | 400 | if bounding>0 |
401 | 401 | # If bounding is requested, add extrapolated top and bottom bounds to avoid |
402 | 402 | # issues with the stratigraphic markov chain wandering off to +/- infinity |
403 | | - (youngest, oldest) = extrema(Age) |
| 403 | + (youngest, oldest) = nanextrema([nanminimum(Age[Age_Sidedness .== -1]); Age[Age_Sidedness .== 0]; nanmaximum(Age[Age_Sidedness .== 1])]) |
404 | 404 | dt_dH = (oldest-youngest)/(top-bottom) |
405 | 405 | offset = round((top-bottom)*bounding/resolution)*resolution |
406 | 406 | Age = [oldest + offset*dt_dH; Age; youngest - offset*dt_dH] |
|
491 | 491 | if bounding>0 |
492 | 492 | # If bounding is requested, add extrapolated top and bottom bounds to avoid |
493 | 493 | # issues with the stratigraphic markov chain wandering off to +/- infinity |
494 | | - (youngest, oldest) = extrema(Age) |
| 494 | + (youngest, oldest) = nanextrema([nanminimum(Age[Age_Sidedness .== -1]); Age[Age_Sidedness .== 0]; nanmaximum(Age[Age_Sidedness .== 1])]) |
495 | 495 | dt_dH = (oldest-youngest)/(top-bottom) |
496 | 496 | offset = round((top-bottom)*bounding/resolution)*resolution |
497 | 497 | Age = [oldest + offset*dt_dH; Age; youngest - offset*dt_dH] |
|
559 | 559 | if bounding>0 |
560 | 560 | # If bounding is requested, add extrapolated top and bottom bounds to avoid |
561 | 561 | # issues with the stratigraphic markov chain wandering off to +/- infinity |
562 | | - (youngest, oldest) = extrema(Age) |
| 562 | + (youngest, oldest) = nanextrema([nanminimum(Age[Age_Sidedness .== -1]); Age[Age_Sidedness .== 0]; nanmaximum(Age[Age_Sidedness .== 1])]) |
563 | 563 | dt_dH = (oldest-youngest)/(top-bottom) |
564 | 564 | offset = round((top-bottom)*bounding/resolution)*resolution |
565 | 565 | Age = [oldest + offset*dt_dH; Age; youngest - offset*dt_dH] |
|
0 commit comments