{-# OPTIONS_HADDOCK show-extensions #-}
{-# LANGUAGE BangPatterns, FlexibleContexts, NoImplicitPrelude #-}
module Phladiprelio.Constraints (
unsafeOrderIJ
, filterOrderIJ
, unsafeTriples
, unsafeQuadruples
, unsafeSeveralA
, unsafeSeveralB
, fixedPointsG
, fixedPointsS
, unsafeSignDistanceIJ
, unsafeUnsignDistanceIJ
, filterSignDistanceIJ
, filterUnsignDistanceIJ
, filterSignDistanceIJK3
, filterUnsignDistanceIJK3
, filterMixedDistanceIJK3
) where
import GHC.Base hiding (foldr)
import GHC.Num ((-),(+))
import Data.Maybe (fromJust)
import Data.SubG (InsertLeft(..),filterG)
import GHC.Arr
import Data.Foldable (all, foldr)
unsafeOrderIJ :: Int -> Int -> Array Int Int -> Bool
unsafeOrderIJ :: Int -> Int -> Array Int Int -> Bool
unsafeOrderIJ Int
i Int
j = (\(Int
_,Int
_,Integer
r) -> if Integer
r forall a. Eq a => a -> a -> Bool
== Integer
0 then Bool
True else Bool
False) forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (t :: * -> *) a b.
Foldable t =>
(a -> b -> b) -> b -> t a -> b
foldr forall {c} {a}. (Num c, Eq a, Eq c) => a -> (a, a, c) -> (a, a, c)
helpG (Int
j,Int
i,Integer
0)
helpG :: a -> (a, a, c) -> (a, a, c)
helpG a
z (a
t,a
u,c
n)
| a
z forall a. Eq a => a -> a -> Bool
== a
t = (a
t,a
u,c
1)
| a
z forall a. Eq a => a -> a -> Bool
== a
u =
case c
n of
c
0 -> (a
t,a
u,c
2)
c
_ -> (a
t,a
u,c
n forall a. Num a => a -> a -> a
- c
1)
| Bool
otherwise = (a
t,a
u,c
n)
{-# INLINE helpG #-}
unsafeSignDistanceIJ
:: Int
-> Int
-> Int
-> Array Int Int
-> Bool
unsafeSignDistanceIJ :: Int -> Int -> Int -> Array Int Int -> Bool
unsafeSignDistanceIJ Int
i Int
j Int
d = (\(Int
_,Int
_,Int
r) -> if Int
r forall a. Ord a => a -> a -> Bool
> Int
100 then (Int
100 forall a. Num a => a -> a -> a
- Int
r) forall a. Eq a => a -> a -> Bool
== Int
d else Int
r forall a. Eq a => a -> a -> Bool
== Int
d) forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (t :: * -> *) a b.
Foldable t =>
(a -> b -> b) -> b -> t a -> b
foldr forall {c} {a}.
(Ord c, Ord a, Num c, Num a) =>
a -> (a, a, c) -> (a, a, c)
helpG2 (Int
j, Int
i, -Int
1)
helpG2 :: a -> (a, a, c) -> (a, a, c)
helpG2 a
z (a
t, a
u, c
n)
| c
n forall a. Ord a => a -> a -> Bool
< c
0 = if (a
z forall a. Eq a => a -> a -> Bool
/= a
t Bool -> Bool -> Bool
&& a
z forall a. Eq a => a -> a -> Bool
/= a
u) then (a
t, a
u, c
n) else (a
t, a
u, if a
z forall a. Eq a => a -> a -> Bool
== a
t then c
1 else c
101)
| a
z forall a. Eq a => a -> a -> Bool
/= a
u Bool -> Bool -> Bool
&& a
z forall a. Eq a => a -> a -> Bool
/= a
t Bool -> Bool -> Bool
&& a
t forall a. Ord a => a -> a -> Bool
>= a
0 = (a
t, a
u, c
n forall a. Num a => a -> a -> a
+ c
1)
| Bool
otherwise = (-a
1, a
u, c
n)
unsafeUnsignDistanceIJ
:: Int
-> Int
-> Int
-> Array Int Int
-> Bool
unsafeUnsignDistanceIJ :: Int -> Int -> Int -> Array Int Int -> Bool
unsafeUnsignDistanceIJ Int
i Int
j Int
d = (\(Int
_,Int
_,Int
r) -> Int
r forall a. Eq a => a -> a -> Bool
== Int
d) forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (t :: * -> *) a b.
Foldable t =>
(a -> b -> b) -> b -> t a -> b
foldr forall {c} {a}.
(Ord c, Ord a, Num c, Num a) =>
a -> (a, a, c) -> (a, a, c)
helpG3 (Int
j, Int
i, -Int
1)
helpG3 :: a -> (a, a, c) -> (a, a, c)
helpG3 a
z (a
t, a
u, c
n)
| c
n forall a. Ord a => a -> a -> Bool
< c
0 = if (a
z forall a. Eq a => a -> a -> Bool
/= a
t Bool -> Bool -> Bool
&& a
z forall a. Eq a => a -> a -> Bool
/= a
u) then (a
t, a
u, c
n) else (a
t, a
u, c
1)
| a
z forall a. Eq a => a -> a -> Bool
/= a
u Bool -> Bool -> Bool
&& a
z forall a. Eq a => a -> a -> Bool
/= a
t Bool -> Bool -> Bool
&& a
t forall a. Ord a => a -> a -> Bool
>= a
0 = (a
t, a
u, c
n forall a. Num a => a -> a -> a
+ c
1)
| Bool
otherwise = (-a
1, a
u, c
n)
filterOrderIJ :: (InsertLeft t (Array Int Int), Monoid (t (Array Int Int))) => Int -> Int -> t (Array Int Int) -> t (Array Int Int)
filterOrderIJ :: forall (t :: * -> *).
(InsertLeft t (Array Int Int), Monoid (t (Array Int Int))) =>
Int -> Int -> t (Array Int Int) -> t (Array Int Int)
filterOrderIJ Int
i Int
j = forall (t :: * -> *) a.
(InsertLeft t a, Monoid (t a)) =>
(a -> Bool) -> t a -> t a
filterG (Int -> Int -> Array Int Int -> Bool
unsafeOrderIJ Int
i Int
j)
filterSignDistanceIJ :: (InsertLeft t (Array Int Int), Monoid (t (Array Int Int))) => Int -> Int -> Int -> t (Array Int Int) -> t (Array Int Int)
filterSignDistanceIJ :: forall (t :: * -> *).
(InsertLeft t (Array Int Int), Monoid (t (Array Int Int))) =>
Int -> Int -> Int -> t (Array Int Int) -> t (Array Int Int)
filterSignDistanceIJ Int
i Int
j Int
d = forall (t :: * -> *) a.
(InsertLeft t a, Monoid (t a)) =>
(a -> Bool) -> t a -> t a
filterG (Int -> Int -> Int -> Array Int Int -> Bool
unsafeSignDistanceIJ Int
i Int
j Int
d)
filterUnsignDistanceIJ :: (InsertLeft t (Array Int Int), Monoid (t (Array Int Int))) => Int -> Int -> Int -> t (Array Int Int) -> t (Array Int Int)
filterUnsignDistanceIJ :: forall (t :: * -> *).
(InsertLeft t (Array Int Int), Monoid (t (Array Int Int))) =>
Int -> Int -> Int -> t (Array Int Int) -> t (Array Int Int)
filterUnsignDistanceIJ Int
i Int
j Int
d = forall (t :: * -> *) a.
(InsertLeft t a, Monoid (t a)) =>
(a -> Bool) -> t a -> t a
filterG (Int -> Int -> Int -> Array Int Int -> Bool
unsafeUnsignDistanceIJ Int
i Int
j Int
d)
filterSignDistanceIJK3 :: (InsertLeft t (Array Int Int), Monoid (t (Array Int Int))) => Int -> Int -> Int -> Int -> Int -> t (Array Int Int) -> t (Array Int Int)
filterSignDistanceIJK3 :: forall (t :: * -> *).
(InsertLeft t (Array Int Int), Monoid (t (Array Int Int))) =>
Int
-> Int
-> Int
-> Int
-> Int
-> t (Array Int Int)
-> t (Array Int Int)
filterSignDistanceIJK3 Int
i Int
j Int
k Int
d1 Int
d2 = forall (t :: * -> *) a.
(InsertLeft t a, Monoid (t a)) =>
(a -> Bool) -> t a -> t a
filterG (\Array Int Int
arr -> Int -> Int -> Int -> Array Int Int -> Bool
unsafeSignDistanceIJ Int
i Int
j Int
d1 Array Int Int
arr Bool -> Bool -> Bool
&& Int -> Int -> Int -> Array Int Int -> Bool
unsafeSignDistanceIJ Int
j Int
k Int
d2 Array Int Int
arr)
filterUnsignDistanceIJK3 :: (InsertLeft t (Array Int Int), Monoid (t (Array Int Int))) => Int -> Int -> Int -> Int -> Int -> t (Array Int Int) -> t (Array Int Int)
filterUnsignDistanceIJK3 :: forall (t :: * -> *).
(InsertLeft t (Array Int Int), Monoid (t (Array Int Int))) =>
Int
-> Int
-> Int
-> Int
-> Int
-> t (Array Int Int)
-> t (Array Int Int)
filterUnsignDistanceIJK3 Int
i Int
j Int
k Int
d1 Int
d2 = forall (t :: * -> *) a.
(InsertLeft t a, Monoid (t a)) =>
(a -> Bool) -> t a -> t a
filterG (\Array Int Int
arr -> Int -> Int -> Int -> Array Int Int -> Bool
unsafeUnsignDistanceIJ Int
i Int
j Int
d1 Array Int Int
arr Bool -> Bool -> Bool
&& Int -> Int -> Int -> Array Int Int -> Bool
unsafeUnsignDistanceIJ Int
j Int
k Int
d2 Array Int Int
arr)
filterMixedDistanceIJK3 :: (InsertLeft t (Array Int Int), Monoid (t (Array Int Int))) => Int -> Int -> Int -> Int -> Int -> t (Array Int Int) -> t (Array Int Int)
filterMixedDistanceIJK3 :: forall (t :: * -> *).
(InsertLeft t (Array Int Int), Monoid (t (Array Int Int))) =>
Int
-> Int
-> Int
-> Int
-> Int
-> t (Array Int Int)
-> t (Array Int Int)
filterMixedDistanceIJK3 Int
i Int
j Int
k Int
d1 Int
d2 = forall (t :: * -> *) a.
(InsertLeft t a, Monoid (t a)) =>
(a -> Bool) -> t a -> t a
filterG (\Array Int Int
arr -> Int -> Int -> Int -> Array Int Int -> Bool
unsafeSignDistanceIJ Int
i Int
j Int
d1 Array Int Int
arr Bool -> Bool -> Bool
&& Int -> Int -> Int -> Array Int Int -> Bool
unsafeUnsignDistanceIJ Int
j Int
k Int
d2 Array Int Int
arr)
unsafeTriples :: (InsertLeft t (Array Int Int), Monoid (t (Array Int Int))) => Int -> Int -> Int -> t (Array Int Int) -> t (Array Int Int)
unsafeTriples :: forall (t :: * -> *).
(InsertLeft t (Array Int Int), Monoid (t (Array Int Int))) =>
Int -> Int -> Int -> t (Array Int Int) -> t (Array Int Int)
unsafeTriples Int
i Int
j Int
k = forall (t :: * -> *) a.
(InsertLeft t a, Monoid (t a)) =>
(a -> Bool) -> t a -> t a
filterG (\Array Int Int
v -> Int -> Int -> Array Int Int -> Bool
unsafeOrderIJ Int
i Int
j Array Int Int
v Bool -> Bool -> Bool
&& Int -> Int -> Array Int Int -> Bool
unsafeOrderIJ Int
j Int
k Array Int Int
v)
unsafeQuadruples :: (InsertLeft t (Array Int Int), Monoid (t (Array Int Int))) => Int -> Int -> Int -> Int -> t (Array Int Int) -> t (Array Int Int)
unsafeQuadruples :: forall (t :: * -> *).
(InsertLeft t (Array Int Int), Monoid (t (Array Int Int))) =>
Int -> Int -> Int -> Int -> t (Array Int Int) -> t (Array Int Int)
unsafeQuadruples Int
i Int
j Int
k Int
l = forall (t :: * -> *) a.
(InsertLeft t a, Monoid (t a)) =>
(a -> Bool) -> t a -> t a
filterG (\Array Int Int
v -> Int -> Int -> Array Int Int -> Bool
unsafeOrderIJ Int
i Int
j Array Int Int
v Bool -> Bool -> Bool
&& Int -> Int -> Array Int Int -> Bool
unsafeOrderIJ Int
j Int
k Array Int Int
v Bool -> Bool -> Bool
&& Int -> Int -> Array Int Int -> Bool
unsafeOrderIJ Int
k Int
l Array Int Int
v)
unsafeSeveralA :: (InsertLeft t (Array Int Int), Monoid (t (Array Int Int))) => Int -> Array Int Int -> t (Array Int Int) -> t (Array Int Int)
unsafeSeveralA :: forall (t :: * -> *).
(InsertLeft t (Array Int Int), Monoid (t (Array Int Int))) =>
Int -> Array Int Int -> t (Array Int Int) -> t (Array Int Int)
unsafeSeveralA !Int
i0 Array Int Int
arr t (Array Int Int)
x = forall (t :: * -> *) a.
(InsertLeft t a, Monoid (t a)) =>
(a -> Bool) -> t a -> t a
filterG (forall {t :: * -> *}.
Foldable t =>
Int -> t Int -> Array Int Int -> Bool
g Int
i0 Array Int Int
arr) t (Array Int Int)
x
where g :: Int -> t Int -> Array Int Int -> Bool
g !Int
i0 !t Int
arr1 Array Int Int
arr2 = forall (t :: * -> *) a. Foldable t => (a -> Bool) -> t a -> Bool
all (\Int
k -> Int -> Int -> Array Int Int -> Bool
unsafeOrderIJ Int
i0 Int
k Array Int Int
arr2) t Int
arr1
unsafeSeveralB :: (InsertLeft t (Array Int Int), Monoid (t (Array Int Int))) => Int -> Array Int Int -> t (Array Int Int) -> t (Array Int Int)
unsafeSeveralB :: forall (t :: * -> *).
(InsertLeft t (Array Int Int), Monoid (t (Array Int Int))) =>
Int -> Array Int Int -> t (Array Int Int) -> t (Array Int Int)
unsafeSeveralB !Int
i0 Array Int Int
arr t (Array Int Int)
x = forall (t :: * -> *) a.
(InsertLeft t a, Monoid (t a)) =>
(a -> Bool) -> t a -> t a
filterG (forall {t :: * -> *}.
Foldable t =>
Int -> t Int -> Array Int Int -> Bool
g Int
i0 Array Int Int
arr) t (Array Int Int)
x
where g :: Int -> t Int -> Array Int Int -> Bool
g !Int
i0 !t Int
arr1 Array Int Int
arr2 = forall (t :: * -> *) a. Foldable t => (a -> Bool) -> t a -> Bool
all (\Int
k -> Int -> Int -> Array Int Int -> Bool
unsafeOrderIJ Int
k Int
i0 Array Int Int
arr2) t Int
arr1
fixedPointsG :: (InsertLeft t (Array Int Int), Monoid (t (Array Int Int))) => Array Int (Int,Int) -> t (Array Int Int) -> t (Array Int Int)
fixedPointsG :: forall (t :: * -> *).
(InsertLeft t (Array Int Int), Monoid (t (Array Int Int))) =>
Array Int (Int, Int) -> t (Array Int Int) -> t (Array Int Int)
fixedPointsG Array Int (Int, Int)
arr t (Array Int Int)
xs = forall (t :: * -> *) a.
(InsertLeft t a, Monoid (t a)) =>
(a -> Bool) -> t a -> t a
filterG (forall {t :: * -> *} {a} {i}.
(Foldable t, Eq a) =>
t (Int, a) -> Array i a -> Bool
f Array Int (Int, Int)
arr) t (Array Int Int)
xs
where f :: t (Int, a) -> Array i a -> Bool
f t (Int, a)
arr1 Array i a
arr2 = forall (t :: * -> *) a. Foldable t => (a -> Bool) -> t a -> Bool
all (\(Int
k,a
j) -> forall i e. Array i e -> Int -> e
unsafeAt Array i a
arr2 Int
k forall a. Eq a => a -> a -> Bool
== a
j) t (Int, a)
arr1
fixedPointsS :: (InsertLeft t (Array Int Int), Monoid (t (Array Int Int))) => Array Int Int -> t (Array Int Int) -> t (Array Int Int)
fixedPointsS :: forall (t :: * -> *).
(InsertLeft t (Array Int Int), Monoid (t (Array Int Int))) =>
Array Int Int -> t (Array Int Int) -> t (Array Int Int)
fixedPointsS Array Int Int
arr t (Array Int Int)
xs = forall (t :: * -> *) a.
(InsertLeft t a, Monoid (t a)) =>
(a -> Bool) -> t a -> t a
filterG (forall {t :: * -> *} {i}.
Foldable t =>
t Int -> Array i Int -> Bool
f Array Int Int
arr) t (Array Int Int)
xs
where f :: t Int -> Array i Int -> Bool
f t Int
arr1 Array i Int
arr2 = forall (t :: * -> *) a. Foldable t => (a -> Bool) -> t a -> Bool
all (\Int
k -> forall i e. Array i e -> Int -> e
unsafeAt Array i Int
arr2 Int
k forall a. Eq a => a -> a -> Bool
== Int
k) t Int
arr1