mirror of
https://gitlab.com/sheaf/metabrush.git
synced 2024-11-05 23:03:38 +00:00
Sprinkle in a bit of unicode
This commit is contained in:
parent
edba0416aa
commit
a59f1695fb
|
@ -1234,10 +1234,10 @@ findCuspsIn opts boxStrokeData initBoxes =
|
||||||
, _D22_dy = T ( 𝕀 ( ℝ1 ee_s_lo ) ( ℝ1 ee_s_hi ) ) }
|
, _D22_dy = T ( 𝕀 ( ℝ1 ee_s_lo ) ( ℝ1 ee_s_hi ) ) }
|
||||||
} = ( boxStrokeData t `Seq.index` i ) s
|
} = ( boxStrokeData t `Seq.index` i ) s
|
||||||
-- λ = ∂E/∂t / ∂E/∂s
|
-- λ = ∂E/∂t / ∂E/∂s
|
||||||
λ1 = 𝕀 ee_t_lo ee_t_hi `extendedDivide` 𝕀 ee_s_lo ee_s_hi
|
λ1 = 𝕀 ee_t_lo ee_t_hi ⊘ 𝕀 ee_s_lo ee_s_hi
|
||||||
-- λ = u / v
|
-- λ = u / v
|
||||||
λ2 = 𝕀 ux_lo ux_hi `extendedDivide` 𝕀 vx_lo vx_hi
|
λ2 = 𝕀 ux_lo ux_hi ⊘ 𝕀 vx_lo vx_hi
|
||||||
λ3 = 𝕀 uy_lo uy_hi `extendedDivide` 𝕀 vy_lo vy_hi
|
λ3 = 𝕀 uy_lo uy_hi ⊘ 𝕀 vy_lo vy_hi
|
||||||
λ = [ 𝕀 ( recip -0 ) ( recip 0 ) ]
|
λ = [ 𝕀 ( recip -0 ) ( recip 0 ) ]
|
||||||
`intersectMany` λ1
|
`intersectMany` λ1
|
||||||
`intersectMany` λ2
|
`intersectMany` λ2
|
||||||
|
|
|
@ -451,9 +451,9 @@ evaluateCubic bez t =
|
||||||
let inf_bez = fmap inf bez
|
let inf_bez = fmap inf bez
|
||||||
sup_bez = fmap sup bez
|
sup_bez = fmap sup bez
|
||||||
mins = fmap (Cubic.bezier @( T Double ) inf_bez)
|
mins = fmap (Cubic.bezier @( T Double ) inf_bez)
|
||||||
$ inf t :| ( sup t : filter ( `inside` t ) ( Cubic.extrema inf_bez ) )
|
$ inf t :| ( sup t : filter ( ∈ t ) ( Cubic.extrema inf_bez ) )
|
||||||
maxs = fmap (Cubic.bezier @( T Double ) sup_bez)
|
maxs = fmap (Cubic.bezier @( T Double ) sup_bez)
|
||||||
$ inf t :| ( sup t : filter ( `inside` t ) ( Cubic.extrema sup_bez ) )
|
$ inf t :| ( sup t : filter ( ∈ t ) ( Cubic.extrema sup_bez ) )
|
||||||
in 𝕀 ( minimum mins ) ( maximum maxs )
|
in 𝕀 ( minimum mins ) ( maximum maxs )
|
||||||
|
|
||||||
-- | Evaluate a quadratic Bézier curve, when both the coefficients and the
|
-- | Evaluate a quadratic Bézier curve, when both the coefficients and the
|
||||||
|
@ -464,7 +464,7 @@ evaluateQuadratic bez t =
|
||||||
let inf_bez = fmap inf bez
|
let inf_bez = fmap inf bez
|
||||||
sup_bez = fmap sup bez
|
sup_bez = fmap sup bez
|
||||||
mins = fmap (Quadratic.bezier @( T Double ) inf_bez)
|
mins = fmap (Quadratic.bezier @( T Double ) inf_bez)
|
||||||
$ inf t :| ( sup t : filter ( `inside` t ) ( Quadratic.extrema inf_bez ) )
|
$ inf t :| ( sup t : filter ( ∈ t ) ( Quadratic.extrema inf_bez ) )
|
||||||
maxs = fmap (Quadratic.bezier @( T Double ) sup_bez)
|
maxs = fmap (Quadratic.bezier @( T Double ) sup_bez)
|
||||||
$ inf t :| ( sup t : filter ( `inside` t ) ( Quadratic.extrema sup_bez ) )
|
$ inf t :| ( sup t : filter ( ∈ t ) ( Quadratic.extrema sup_bez ) )
|
||||||
in 𝕀 ( minimum mins ) ( maximum maxs )
|
in 𝕀 ( minimum mins ) ( maximum maxs )
|
||||||
|
|
|
@ -11,10 +11,9 @@ module Math.Interval
|
||||||
, 𝕀ℝ
|
, 𝕀ℝ
|
||||||
, isCanonical
|
, isCanonical
|
||||||
, singleton, nonDecreasing
|
, singleton, nonDecreasing
|
||||||
, inside
|
, (∈), (⊖), (∩), (⊘)
|
||||||
, aabb
|
, extendedRecip
|
||||||
, extendedDivide, extendedRecip
|
, aabb, bisect
|
||||||
, intersect, bisect
|
|
||||||
)
|
)
|
||||||
where
|
where
|
||||||
|
|
||||||
|
@ -72,9 +71,10 @@ nonDecreasing :: ( a -> b ) -> 𝕀 a -> 𝕀 b
|
||||||
nonDecreasing f ( 𝕀 lo hi ) = 𝕀 ( f lo ) ( f hi )
|
nonDecreasing f ( 𝕀 lo hi ) = 𝕀 ( f lo ) ( f hi )
|
||||||
|
|
||||||
-- | Does the given value lie inside the specified interval?
|
-- | Does the given value lie inside the specified interval?
|
||||||
inside :: Ord a => a -> 𝕀 a -> Bool
|
(∈) :: Ord a => a -> 𝕀 a -> Bool
|
||||||
inside x ( 𝕀 lo hi ) = x >= lo && x <= hi
|
x ∈ 𝕀 lo hi = x >= lo && x <= hi
|
||||||
{-# INLINEABLE inside #-}
|
{-# INLINEABLE (∈) #-}
|
||||||
|
infix 4 ∈
|
||||||
|
|
||||||
-- | Is this interval canonical, i.e. it consists of either 1 or 2 floating point
|
-- | Is this interval canonical, i.e. it consists of either 1 or 2 floating point
|
||||||
-- values only?
|
-- values only?
|
||||||
|
@ -91,8 +91,8 @@ midpoint ( 𝕀 x_inf x_sup ) = 0.5 * ( x_inf + x_sup )
|
||||||
--
|
--
|
||||||
-- Returns whether the first interval is a strict subset of the second interval
|
-- Returns whether the first interval is a strict subset of the second interval
|
||||||
-- (or the intersection is a single point).
|
-- (or the intersection is a single point).
|
||||||
intersect :: 𝕀 Double -> 𝕀 Double -> [ ( 𝕀 Double, Bool ) ]
|
(∩) :: 𝕀 Double -> 𝕀 Double -> [ ( 𝕀 Double, Bool ) ]
|
||||||
intersect ( 𝕀 lo1 hi1 ) ( 𝕀 lo2 hi2 )
|
𝕀 lo1 hi1 ∩ 𝕀 lo2 hi2
|
||||||
| lo > hi
|
| lo > hi
|
||||||
= [ ]
|
= [ ]
|
||||||
| otherwise
|
| otherwise
|
||||||
|
@ -100,6 +100,7 @@ intersect ( 𝕀 lo1 hi1 ) ( 𝕀 lo2 hi2 )
|
||||||
where
|
where
|
||||||
lo = max lo1 lo2
|
lo = max lo1 lo2
|
||||||
hi = min hi1 hi2
|
hi = min hi1 hi2
|
||||||
|
infix 3 ∩
|
||||||
|
|
||||||
-- | Bisect an interval.
|
-- | Bisect an interval.
|
||||||
--
|
--
|
||||||
|
@ -113,6 +114,15 @@ bisect x@( 𝕀 x_inf x_sup )
|
||||||
= 𝕀 x_inf x_mid NE.:| [ 𝕀 x_mid x_sup ]
|
= 𝕀 x_inf x_mid NE.:| [ 𝕀 x_mid x_sup ]
|
||||||
where x_mid = midpoint x
|
where x_mid = midpoint x
|
||||||
|
|
||||||
|
infixl 6 ⊖
|
||||||
|
(⊖) :: ( Ring a, Ord a ) => 𝕀 a -> 𝕀 a -> 𝕀 a
|
||||||
|
(⊖) a@( 𝕀 lo1 hi1 ) b@( 𝕀 lo2 hi2 )
|
||||||
|
| width a >= width b
|
||||||
|
= 𝕀 ( lo1 - lo2 ) ( hi1 - hi2 )
|
||||||
|
| otherwise
|
||||||
|
= 𝕀 ( hi1 - hi2 ) ( lo1 - lo2 )
|
||||||
|
{-# INLINEABLE (⊖) #-}
|
||||||
|
|
||||||
deriving via ViaAbelianGroup ( T ( 𝕀 Double ) )
|
deriving via ViaAbelianGroup ( T ( 𝕀 Double ) )
|
||||||
instance Semigroup ( T ( 𝕀 Double ) )
|
instance Semigroup ( T ( 𝕀 Double ) )
|
||||||
deriving via ViaAbelianGroup ( T ( 𝕀 Double ) )
|
deriving via ViaAbelianGroup ( T ( 𝕀 Double ) )
|
||||||
|
@ -128,8 +138,10 @@ instance Torsor ( T ( 𝕀 Double ) ) ( 𝕀 Double ) where
|
||||||
-------------------------------------------------------------------------------
|
-------------------------------------------------------------------------------
|
||||||
-- Extended division
|
-- Extended division
|
||||||
|
|
||||||
extendedDivide :: 𝕀 Double -> 𝕀 Double -> [ 𝕀 Double ]
|
-- | Extended division.
|
||||||
extendedDivide x y = nub $ map ( x * ) ( extendedRecip y )
|
(⊘) :: 𝕀 Double -> 𝕀 Double -> [ 𝕀 Double ]
|
||||||
|
x ⊘ y = nub $ map ( x * ) ( extendedRecip y )
|
||||||
|
infixl 7 ⊘
|
||||||
|
|
||||||
extendedRecip :: 𝕀 Double -> [ 𝕀 Double ]
|
extendedRecip :: 𝕀 Double -> [ 𝕀 Double ]
|
||||||
extendedRecip x@( 𝕀 lo hi )
|
extendedRecip x@( 𝕀 lo hi )
|
||||||
|
|
|
@ -192,7 +192,7 @@ isolateRootsIn ( RootIsolationOptions { rootIsolationAlgorithms } )
|
||||||
[ RootIsolationTree ( Box n ) ]
|
[ RootIsolationTree ( Box n ) ]
|
||||||
go history cand
|
go history cand
|
||||||
| -- Check the range of the equations contains zero.
|
| -- Check the range of the equations contains zero.
|
||||||
not $ ( unT ( origin @Double ) `inside` iRange )
|
not $ ( unT ( origin @Double ) ∈ iRange )
|
||||||
-- Box doesn't contain a solution: discard it.
|
-- Box doesn't contain a solution: discard it.
|
||||||
= return []
|
= return []
|
||||||
| otherwise
|
| otherwise
|
||||||
|
|
|
@ -106,7 +106,7 @@ defaultBisectionOptions minWidth _ε_eq box =
|
||||||
-- box(0)-consistency
|
-- box(0)-consistency
|
||||||
let iRange' :: Box d
|
let iRange' :: Box d
|
||||||
iRange' = eqs box' `monIndex` zeroMonomial
|
iRange' = eqs box' `monIndex` zeroMonomial
|
||||||
in unT ( origin @Double ) `inside` iRange'
|
in unT ( origin @Double ) ∈ iRange'
|
||||||
|
|
||||||
-- box(1)-consistency
|
-- box(1)-consistency
|
||||||
--let box1Options = Box1Options _ε_eq ( toList $ universe @n ) ( toList $ universe @d )
|
--let box1Options = Box1Options _ε_eq ( toList $ universe @n ) ( toList $ universe @d )
|
||||||
|
@ -117,7 +117,7 @@ defaultBisectionOptions minWidth _ε_eq box =
|
||||||
-- box'' = makeBox2Consistent _minWidth box2Options eqs box'
|
-- box'' = makeBox2Consistent _minWidth box2Options eqs box'
|
||||||
-- iRange'' :: Box d
|
-- iRange'' :: Box d
|
||||||
-- iRange'' = eqs box'' `monIndex` zeroMonomial
|
-- iRange'' = eqs box'' `monIndex` zeroMonomial
|
||||||
--in unT ( origin @Double ) `inside` iRange''
|
--in unT ( origin @Double ) ∈ iRange''
|
||||||
, fallbackBisectionCoord =
|
, fallbackBisectionCoord =
|
||||||
\ _thisRoundHist _prevRoundsHist eqs possibleCoordChoices ->
|
\ _thisRoundHist _prevRoundsHist eqs possibleCoordChoices ->
|
||||||
let datPerCoord =
|
let datPerCoord =
|
||||||
|
|
|
@ -208,17 +208,17 @@ gaussSeidelStep as b ( T x0 ) = coerce $
|
||||||
x_i = x `index` i
|
x_i = x `index` i
|
||||||
a_ii = ( as ! i ) `index` i
|
a_ii = ( as ! i ) `index` i
|
||||||
-- Take a shortcut before performing the division if possible.
|
-- Take a shortcut before performing the division if possible.
|
||||||
if | not $ 0 `inside` ( s - a_ii * x_i )
|
if | not $ 0 ∈ ( s - a_ii * x_i )
|
||||||
-- No solutions: don't bother performing a division.
|
-- No solutions: don't bother performing a division.
|
||||||
-> [ ]
|
-> [ ]
|
||||||
| 0 `inside` s && 0 `inside` a_ii
|
| 0 ∈ s && 0 ∈ a_ii
|
||||||
-- The division would produce [-oo,+oo]: don't do anything.
|
-- The division would produce [-oo,+oo]: don't do anything.
|
||||||
-> [ ( x, False ) ]
|
-> [ ( x, False ) ]
|
||||||
-- Otherwise, perform the division.
|
-- Otherwise, perform the division.
|
||||||
| otherwise
|
| otherwise
|
||||||
-> do
|
-> do
|
||||||
x_i'0 <- s `extendedDivide` a_ii
|
x_i'0 <- s ⊘ a_ii
|
||||||
( x_i', sub_i ) <- x_i'0 `intersect` x_i
|
( x_i', sub_i ) <- x_i'0 ∩ x_i
|
||||||
return $ ( set i x_i' x, sub_i && contraction )
|
return $ ( set i x_i' x, sub_i && contraction )
|
||||||
{-# INLINEABLE gaussSeidelStep #-}
|
{-# INLINEABLE gaussSeidelStep #-}
|
||||||
|
|
||||||
|
@ -244,16 +244,16 @@ gaussSeidelStep_Complete as b ( T x0 ) = coerce $ do
|
||||||
( x', subs ) <- fromComponents \ j -> do
|
( x', subs ) <- fromComponents \ j -> do
|
||||||
let x_j = x `index` j
|
let x_j = x `index` j
|
||||||
a_ij = ( as ! j ) `index` i
|
a_ij = ( as ! j ) `index` i
|
||||||
s_j = s `ominus` ( a_ij * x_j )
|
s_j = s ⊖ ( a_ij * x_j )
|
||||||
-- Shortcut division if possible (see gaussSeidelStep for commentary).
|
-- Shortcut division if possible (see gaussSeidelStep for commentary).
|
||||||
if | not $ 0 `inside` ( s_j - a_ii * x_i )
|
if | not $ 0 ∈ ( s_j - a_ii * x_i )
|
||||||
-> [ ]
|
-> [ ]
|
||||||
| 0 `inside` s_j && 0 `inside` a_ij
|
| 0 ∈ s_j && 0 ∈ a_ij
|
||||||
-> [ ( x_j, False ) ]
|
-> [ ( x_j, False ) ]
|
||||||
| otherwise
|
| otherwise
|
||||||
-> do
|
-> do
|
||||||
x_j'0 <- s_j `extendedDivide` a_ij
|
x_j'0 <- s_j ⊘ a_ij
|
||||||
( x_j', sub_j ) <- x_j'0 `intersect` x_j
|
( x_j', sub_j ) <- x_j'0 ∩ x_j
|
||||||
return $ ( x_j', sub_j )
|
return $ ( x_j', sub_j )
|
||||||
return ( x', (||) <$> contractions <*> subs )
|
return ( x', (||) <$> contractions <*> subs )
|
||||||
return ( x', and subs )
|
return ( x', and subs )
|
||||||
|
@ -269,14 +269,6 @@ fromComponents f = do
|
||||||
-- TODO: this could be more efficient.
|
-- TODO: this could be more efficient.
|
||||||
{-# INLINEABLE fromComponents #-}
|
{-# INLINEABLE fromComponents #-}
|
||||||
|
|
||||||
infixl 6 `ominus`
|
|
||||||
ominus :: 𝕀 Double -> 𝕀 Double -> 𝕀 Double
|
|
||||||
ominus a@( 𝕀 lo1 hi1 ) b@( 𝕀 lo2 hi2 )
|
|
||||||
| width a >= width b
|
|
||||||
= 𝕀 ( lo1 - lo2 ) ( hi1 - hi2 )
|
|
||||||
| otherwise
|
|
||||||
= 𝕀 ( hi1 - hi2 ) ( lo1 - lo2 )
|
|
||||||
|
|
||||||
-- | The midpoint of a box.
|
-- | The midpoint of a box.
|
||||||
boxMidpoint :: Representable Double ( ℝ n ) => 𝕀ℝ n -> ℝ n
|
boxMidpoint :: Representable Double ( ℝ n ) => 𝕀ℝ n -> ℝ n
|
||||||
boxMidpoint box =
|
boxMidpoint box =
|
||||||
|
|
|
@ -295,9 +295,9 @@ leftNarrow ε_eq ε_bis ff' = left_narrow
|
||||||
else
|
else
|
||||||
let x = 𝕀 ( sup x_left ) x_sup
|
let x = 𝕀 ( sup x_left ) x_sup
|
||||||
( _f_x, f'_x ) = ff' x
|
( _f_x, f'_x ) = ff' x
|
||||||
x's = do δ <- f_x_left `extendedDivide` f'_x
|
x's = do δ <- f_x_left ⊘ f'_x
|
||||||
let x_new = x_left - δ
|
let x_new = x_left - δ
|
||||||
map fst $ x_new `intersect` x
|
map fst $ x_new ∩ x
|
||||||
in
|
in
|
||||||
if | null x's
|
if | null x's
|
||||||
-> []
|
-> []
|
||||||
|
@ -328,9 +328,9 @@ rightNarrow ε_eq ε_bis ff' = right_narrow
|
||||||
else
|
else
|
||||||
let x = 𝕀 x_inf ( inf x_right )
|
let x = 𝕀 x_inf ( inf x_right )
|
||||||
( _f_x, f'_x ) = ff' x
|
( _f_x, f'_x ) = ff' x
|
||||||
x's = do δ <- f_x_right `extendedDivide` f'_x
|
x's = do δ <- f_x_right ⊘ f'_x
|
||||||
let x_new = x_right - δ
|
let x_new = x_right - δ
|
||||||
map fst $ x_new `intersect` x
|
map fst $ x_new ∩ x
|
||||||
in
|
in
|
||||||
if | null x's
|
if | null x's
|
||||||
-> []
|
-> []
|
||||||
|
@ -387,7 +387,7 @@ leftShave ε_eq ε_bis
|
||||||
go γ x_sup x_left =
|
go γ x_sup x_left =
|
||||||
let ( f_x_left, _f'_x_left ) = ff' x_left
|
let ( f_x_left, _f'_x_left ) = ff' x_left
|
||||||
in
|
in
|
||||||
if 0 `inside` f_x_left
|
if 0 ∈ f_x_left
|
||||||
-- Box-consistency achieved; finish.
|
-- Box-consistency achieved; finish.
|
||||||
then [ 𝕀 ( inf x_left ) x_sup ]
|
then [ 𝕀 ( inf x_left ) x_sup ]
|
||||||
else
|
else
|
||||||
|
@ -399,7 +399,7 @@ leftShave ε_eq ε_bis
|
||||||
-- NB: this always uses the initial width (to "avoid asymptotic behaviour" according to the paper)
|
-- NB: this always uses the initial width (to "avoid asymptotic behaviour" according to the paper)
|
||||||
( f_guess, f'_guess ) = ff' guess
|
( f_guess, f'_guess ) = ff' guess
|
||||||
x_minus_guess = 𝕀 ( min x_sup ( succFP $ sup guess ) ) x_sup
|
x_minus_guess = 𝕀 ( min x_sup ( succFP $ sup guess ) ) x_sup
|
||||||
in if not ( 0 `inside` f_guess )
|
in if not ( 0 ∈ f_guess )
|
||||||
then
|
then
|
||||||
-- We successfully shaved "guess" off; go round again after removing it.
|
-- We successfully shaved "guess" off; go round again after removing it.
|
||||||
-- TODO: here we could go back to the top with a new "w" maybe?
|
-- TODO: here we could go back to the top with a new "w" maybe?
|
||||||
|
@ -410,9 +410,9 @@ leftShave ε_eq ε_bis
|
||||||
-- "guesses'" refining where the function can be zero.
|
-- "guesses'" refining where the function can be zero.
|
||||||
let guesses' :: [ ( 𝕀 Double ) ]
|
let guesses' :: [ ( 𝕀 Double ) ]
|
||||||
guesses' = do
|
guesses' = do
|
||||||
δ <- f_x_left `extendedDivide` f'_guess
|
δ <- f_x_left ⊘ f'_guess
|
||||||
let guess' = singleton ( inf guess ) - δ
|
let guess' = singleton ( inf guess ) - δ
|
||||||
map fst $ guess' `intersect` guess
|
map fst $ guess' ∩ guess
|
||||||
w_guess = width guess
|
w_guess = width guess
|
||||||
w_guesses'
|
w_guesses'
|
||||||
| null guesses'
|
| null guesses'
|
||||||
|
@ -453,30 +453,30 @@ sbc ε ff' = go
|
||||||
| otherwise
|
| otherwise
|
||||||
= let x_mid = 0.5 * ( x_l + x_r )
|
= let x_mid = 0.5 * ( x_l + x_r )
|
||||||
( left_done, left_todo )
|
( left_done, left_todo )
|
||||||
| 0 `inside` ( fst $ ff' ( 𝕀 x_l x_lp ) )
|
| 0 ∈ ( fst $ ff' ( 𝕀 x_l x_lp ) )
|
||||||
= ( True, [ ] )
|
= ( True, [ ] )
|
||||||
| not $ 0 `inside` ( fst $ ff' i_l )
|
| not $ 0 ∈ ( fst $ ff' i_l )
|
||||||
= ( False, [ ] )
|
= ( False, [ ] )
|
||||||
| otherwise
|
| otherwise
|
||||||
= let
|
= let
|
||||||
xls = do
|
xls = do
|
||||||
let l = 𝕀 x_lp x_lp
|
let l = 𝕀 x_lp x_lp
|
||||||
δ <- fst ( ff' l ) `extendedDivide` snd ( ff' i_l )
|
δ <- fst ( ff' l ) ⊘ snd ( ff' i_l )
|
||||||
map fst $ ( l - δ ) `intersect` i_l
|
map fst $ ( l - δ ) ∩ i_l
|
||||||
in ( False, xls )
|
in ( False, xls )
|
||||||
where x_lp = min ( succFP x_l ) x_mid
|
where x_lp = min ( succFP x_l ) x_mid
|
||||||
i_l = 𝕀 x_lp x_mid
|
i_l = 𝕀 x_lp x_mid
|
||||||
( right_done, right_todo )
|
( right_done, right_todo )
|
||||||
| 0 `inside` ( fst $ ff' ( 𝕀 x_rm x_r ) )
|
| 0 ∈ ( fst $ ff' ( 𝕀 x_rm x_r ) )
|
||||||
= ( True, [ ] )
|
= ( True, [ ] )
|
||||||
| not $ 0 `inside` ( fst $ ff' i_r )
|
| not $ 0 ∈ ( fst $ ff' i_r )
|
||||||
= ( False, [ ] )
|
= ( False, [ ] )
|
||||||
| otherwise
|
| otherwise
|
||||||
= let
|
= let
|
||||||
xrs = do
|
xrs = do
|
||||||
let r = 𝕀 x_rm x_rm
|
let r = 𝕀 x_rm x_rm
|
||||||
δ <- fst ( ff' r ) `extendedDivide` snd ( ff' i_r )
|
δ <- fst ( ff' r ) ⊘ snd ( ff' i_r )
|
||||||
map fst $ ( r - δ ) `intersect` i_r
|
map fst $ ( r - δ ) ∩ i_r
|
||||||
in ( False, xrs )
|
in ( False, xrs )
|
||||||
where x_rm = max ( prevFP x_r ) x_mid
|
where x_rm = max ( prevFP x_r ) x_mid
|
||||||
i_r = 𝕀 x_mid x_rm
|
i_r = 𝕀 x_mid x_rm
|
||||||
|
|
Loading…
Reference in a new issue