{-# OPTIONS_HADDOCK show-extensions #-}
{-# LANGUAGE BangPatterns, FlexibleContexts, NoImplicitPrelude #-}
module Phladiprelio.Constraints (
unsafeOrderIJ
, unsafeSignDistanceIJ
, unsafeUnsignDistanceIJ
, isSignDistIJK3
, isUnsignDistIJK3
, isMixedDistIJK3
, isTripleOrdered
, isQuadrupleOrdered
, isQuintupleOrdered
, isSeveralAOrdered
, isSeveralBOrdered
, isFixedPointTup
, isFixedPoint
, notSignDistIJK3
, notUnsignDistIJK3
, notMixedDistIJK3
, notTripleOrdered
, notQuadrupleOrdered
, notQuintupleOrdered
, notSeveralAOrdered
, notSeveralBOrdered
, notFixedPointTup
, notFixedPoint
, filterOrderIJ
, unsafeTriples
, unsafeQuadruples
, unsafeQuintuples
, unsafeSeveralA
, unsafeSeveralB
, fixedPointsG
, fixedPointsS
, filterSignDistanceIJ
, filterUnsignDistanceIJ
, filterSignDistanceIJK3
, filterUnsignDistanceIJK3
, filterMixedDistanceIJK3
) where
import GHC.Base hiding (foldr)
import GHC.Num (Num, (-),(+))
import Data.SubG (InsertLeft(..),filterG)
import GHC.Arr
import GHC.Int (Int8(..))
import Data.Bits ((.&.),testBit, shiftR, setBit, clearBit)
import Data.Foldable (Foldable, all, foldr, any)
f2 :: (Foldable t, Eq p) => p -> p -> t p -> Int8
f2 :: forall (t :: * -> *) p. (Foldable t, Eq p) => p -> p -> t p -> Int8
f2 p
i p
j = forall (t :: * -> *) a b.
Foldable t =>
(a -> b -> b) -> b -> t a -> b
foldr p -> Int8 -> Int8
g (Int8
0::Int8)
where g :: p -> Int8 -> Int8
g p
x Int8
y
| Int8
y forall a. Eq a => a -> a -> Bool
== Int8
3 = Int8
3
| p
x forall a. Eq a => a -> a -> Bool
== p
j = Bool -> Int8 -> Int -> Int8
bitChange (forall a. Bits a => a -> Int -> a
shiftR Int8
y Int
1 forall a. Eq a => a -> a -> Bool
== Int8
0) Int8
y Int
0
| p
x forall a. Eq a => a -> a -> Bool
== p
i = Bool -> Int8 -> Int -> Int8
bitChange (forall a. Bits a => a -> Int -> Bool
testBit Int8
y Int
0) Int8
y Int
1
| Bool
otherwise = Int8
y
{-# INLINE f2 #-}
f3 :: (Foldable t, Eq p) => p -> p -> p -> t p -> Int8
f3 :: forall (t :: * -> *) p.
(Foldable t, Eq p) =>
p -> p -> p -> t p -> Int8
f3 p
i p
j p
k = forall (t :: * -> *) a b.
Foldable t =>
(a -> b -> b) -> b -> t a -> b
foldr p -> Int8 -> Int8
g (Int8
0::Int8)
where g :: p -> Int8 -> Int8
g p
x Int8
y
| Int8
y forall a. Eq a => a -> a -> Bool
== Int8
7 = Int8
7
| p
x forall a. Eq a => a -> a -> Bool
== p
k = Bool -> Int8 -> Int -> Int8
bitChange (forall a. Bits a => a -> Int -> a
shiftR Int8
y Int
1 forall a. Eq a => a -> a -> Bool
== Int8
0) Int8
y Int
0
| p
x forall a. Eq a => a -> a -> Bool
== p
j = Bool -> Int8 -> Int -> Int8
bitChange (Bool -> Bool
not (forall a. Bits a => a -> Int -> Bool
testBit Int8
y Int
2) Bool -> Bool -> Bool
&& forall a. Bits a => a -> Int -> Bool
testBit Int8
y Int
0) Int8
y Int
1
| p
x forall a. Eq a => a -> a -> Bool
== p
i = Bool -> Int8 -> Int -> Int8
bitChange (forall a. Bits a => a -> Int -> a
clearBit Int8
y Int
2 forall a. Eq a => a -> a -> Bool
== Int8
3) Int8
y Int
2
| Bool
otherwise = Int8
y
{-# INLINE f3 #-}
f4 :: (Foldable t, Eq p) => p -> p -> p -> p -> t p -> Int8
f4 :: forall (t :: * -> *) p.
(Foldable t, Eq p) =>
p -> p -> p -> p -> t p -> Int8
f4 p
i p
j p
k p
l = forall (t :: * -> *) a b.
Foldable t =>
(a -> b -> b) -> b -> t a -> b
foldr p -> Int8 -> Int8
g (Int8
0::Int8)
where g :: p -> Int8 -> Int8
g p
x Int8
y
| Int8
y forall a. Eq a => a -> a -> Bool
== Int8
15 = Int8
15
| p
x forall a. Eq a => a -> a -> Bool
== p
l = Bool -> Int8 -> Int -> Int8
bitChange (forall a. Bits a => a -> Int -> a
shiftR Int8
y Int
1 forall a. Eq a => a -> a -> Bool
== Int8
0) Int8
y Int
0
| p
x forall a. Eq a => a -> a -> Bool
== p
k = Bool -> Int8 -> Int -> Int8
bitChange (forall a. Bits a => a -> Int -> a
shiftR Int8
y Int
2 forall a. Eq a => a -> a -> Bool
== Int8
0 Bool -> Bool -> Bool
&& forall a. Bits a => a -> Int -> Bool
testBit Int8
y Int
0) Int8
y Int
1
| p
x forall a. Eq a => a -> a -> Bool
== p
j = Bool -> Int8 -> Int -> Int8
bitChange (Bool -> Bool
not (forall a. Bits a => a -> Int -> Bool
testBit Int8
y Int
3) Bool -> Bool -> Bool
&& Int8
y forall a. Bits a => a -> a -> a
.&. Int8
3 forall a. Eq a => a -> a -> Bool
== Int8
3) Int8
y Int
2
| p
x forall a. Eq a => a -> a -> Bool
== p
i = Bool -> Int8 -> Int -> Int8
bitChange (forall a. Bits a => a -> Int -> a
clearBit Int8
y Int
3 forall a. Eq a => a -> a -> Bool
== Int8
7) Int8
y Int
3
| Bool
otherwise = Int8
y
{-# INLINE f4 #-}
f5 :: (Foldable t, Eq p) => p -> p -> p -> p -> p -> t p -> Int8
f5 :: forall (t :: * -> *) p.
(Foldable t, Eq p) =>
p -> p -> p -> p -> p -> t p -> Int8
f5 p
i p
j p
k p
l p
m = forall (t :: * -> *) a b.
Foldable t =>
(a -> b -> b) -> b -> t a -> b
foldr p -> Int8 -> Int8
g (Int8
0::Int8)
where g :: p -> Int8 -> Int8
g p
x Int8
y
| Int8
y forall a. Eq a => a -> a -> Bool
== Int8
31 = Int8
31
| p
x forall a. Eq a => a -> a -> Bool
== p
m = Bool -> Int8 -> Int -> Int8
bitChange (forall a. Bits a => a -> Int -> a
shiftR Int8
y Int
1 forall a. Eq a => a -> a -> Bool
== Int8
0) Int8
y Int
0
| p
x forall a. Eq a => a -> a -> Bool
== p
l = Bool -> Int8 -> Int -> Int8
bitChange (forall a. Bits a => a -> Int -> Bool
testBit Int8
y Int
0 Bool -> Bool -> Bool
&& forall a. Bits a => a -> Int -> a
shiftR Int8
y Int
2 forall a. Eq a => a -> a -> Bool
== Int8
0) Int8
y Int
1
| p
x forall a. Eq a => a -> a -> Bool
== p
k = Bool -> Int8 -> Int -> Int8
bitChange (forall a. Bits a => a -> Int -> a
shiftR Int8
y Int
3 forall a. Eq a => a -> a -> Bool
== Int8
0 Bool -> Bool -> Bool
&& Int8
y forall a. Bits a => a -> a -> a
.&. Int8
3 forall a. Eq a => a -> a -> Bool
== Int8
3) Int8
y Int
2
| p
x forall a. Eq a => a -> a -> Bool
== p
j = Bool -> Int8 -> Int -> Int8
bitChange (Bool -> Bool
not (forall a. Bits a => a -> Int -> Bool
testBit Int8
y Int
4) Bool -> Bool -> Bool
&& Int8
y forall a. Bits a => a -> a -> a
.&. Int8
7 forall a. Eq a => a -> a -> Bool
== Int8
7) Int8
y Int
3
| p
x forall a. Eq a => a -> a -> Bool
== p
i = Bool -> Int8 -> Int -> Int8
bitChange (forall a. Bits a => a -> Int -> a
clearBit Int8
y Int
4 forall a. Eq a => a -> a -> Bool
== Int8
15) Int8
y Int
4
| Bool
otherwise = Int8
y
{-# INLINE f5 #-}
bitChange
:: Bool
-> Int8
-> Int
-> Int8
bitChange :: Bool -> Int8 -> Int -> Int8
bitChange Bool
bool = (if Bool
bool then forall a. Bits a => a -> Int -> a
setBit else forall a. Bits a => a -> Int -> a
clearBit)
{-# INLINE bitChange #-}
unsafeOrderIJ :: Int -> Int -> Array Int Int -> Bool
unsafeOrderIJ :: Int -> Int -> Array Int Int -> Bool
unsafeOrderIJ Int
i Int
j = (forall a. Eq a => a -> a -> Bool
== Int8
3) forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (t :: * -> *) p. (Foldable t, Eq p) => p -> p -> t p -> Int8
f2 Int
i Int
j
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 a1 a2.
(Ord a1, Ord a2, Num a1, Num a2) =>
a2 -> (a2, a2, a1) -> (a2, a2, a1)
helpG2 (Int
j, Int
i, -Int
1)
helpG2 :: (Ord a1, Ord a2, Num a1, Num a2) => a2 -> (a2, a2, a1) -> (a2, a2, a1)
helpG2 :: forall a1 a2.
(Ord a1, Ord a2, Num a1, Num a2) =>
a2 -> (a2, a2, a1) -> (a2, a2, a1)
helpG2 a2
z (a2
t, a2
u, a1
n)
| a1
n forall a. Ord a => a -> a -> Bool
< a1
0 = if (a2
z forall a. Eq a => a -> a -> Bool
/= a2
t Bool -> Bool -> Bool
&& a2
z forall a. Eq a => a -> a -> Bool
/= a2
u) then (a2
t, a2
u, a1
n) else (a2
t, a2
u, if a2
z forall a. Eq a => a -> a -> Bool
== a2
t then a1
1 else a1
101)
| a2
z forall a. Eq a => a -> a -> Bool
/= a2
u Bool -> Bool -> Bool
&& a2
z forall a. Eq a => a -> a -> Bool
/= a2
t Bool -> Bool -> Bool
&& a2
t forall a. Ord a => a -> a -> Bool
>= a2
0 = (a2
t, a2
u, a1
n forall a. Num a => a -> a -> a
+ a1
1)
| Bool
otherwise = (-a2
1, a2
u, a1
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 a1 a2.
(Ord a1, Ord a2, Num a1, Num a2) =>
a2 -> (a2, a2, a1) -> (a2, a2, a1)
helpG3 (Int
j, Int
i, -Int
1)
helpG3 :: (Ord a1, Ord a2, Num a1, Num a2) => a2 -> (a2, a2, a1) -> (a2, a2, a1)
helpG3 :: forall a1 a2.
(Ord a1, Ord a2, Num a1, Num a2) =>
a2 -> (a2, a2, a1) -> (a2, a2, a1)
helpG3 a2
z (a2
t, a2
u, a1
n)
| a1
n forall a. Ord a => a -> a -> Bool
< a1
0 = if (a2
z forall a. Eq a => a -> a -> Bool
/= a2
t Bool -> Bool -> Bool
&& a2
z forall a. Eq a => a -> a -> Bool
/= a2
u) then (a2
t, a2
u, a1
n) else (a2
t, a2
u, a1
1)
| a2
z forall a. Eq a => a -> a -> Bool
/= a2
u Bool -> Bool -> Bool
&& a2
z forall a. Eq a => a -> a -> Bool
/= a2
t Bool -> Bool -> Bool
&& a2
t forall a. Ord a => a -> a -> Bool
>= a2
0 = (a2
t, a2
u, a1
n forall a. Num a => a -> a -> a
+ a1
1)
| Bool
otherwise = (-a2
1, a2
u, a1
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 (Int -> Int -> Int -> Int -> Int -> Array Int Int -> Bool
isSignDistIJK3 Int
i Int
j Int
k Int
d1 Int
d2)
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 (Int -> Int -> Int -> Int -> Int -> Array Int Int -> Bool
isUnsignDistIJK3 Int
i Int
j Int
k Int
d1 Int
d2)
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 (Int -> Int -> Int -> Int -> Int -> Array Int Int -> Bool
isMixedDistIJK3 Int
i Int
j Int
k Int
d1 Int
d2)
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 (Int -> Int -> Int -> Array Int Int -> Bool
isTripleOrdered Int
i Int
j Int
k)
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 (Int -> Int -> Int -> Int -> Array Int Int -> Bool
isQuadrupleOrdered Int
i Int
j Int
k Int
l)
unsafeQuintuples :: (InsertLeft t (Array Int Int), Monoid (t (Array Int Int))) => Int -> Int -> Int -> Int -> Int -> t (Array Int Int) -> t (Array Int Int)
unsafeQuintuples :: 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)
unsafeQuintuples Int
i Int
j Int
k Int
l Int
m = forall (t :: * -> *) a.
(InsertLeft t a, Monoid (t a)) =>
(a -> Bool) -> t a -> t a
filterG (Int -> Int -> Int -> Int -> Int -> Array Int Int -> Bool
isQuintupleOrdered Int
i Int
j Int
k Int
l Int
m)
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 = forall (t :: * -> *) a.
(InsertLeft t a, Monoid (t a)) =>
(a -> Bool) -> t a -> t a
filterG (Int -> Array Int Int -> Array Int Int -> Bool
isSeveralAOrdered Int
i0 Array Int Int
arr)
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 = forall (t :: * -> *) a.
(InsertLeft t a, Monoid (t a)) =>
(a -> Bool) -> t a -> t a
filterG (Int -> Array Int Int -> Array Int Int -> Bool
isSeveralBOrdered Int
i0 Array Int Int
arr)
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 = forall (t :: * -> *) a.
(InsertLeft t a, Monoid (t a)) =>
(a -> Bool) -> t a -> t a
filterG (Array Int (Int, Int) -> Array Int Int -> Bool
isFixedPointTup Array Int (Int, Int)
arr)
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 = forall (t :: * -> *) a.
(InsertLeft t a, Monoid (t a)) =>
(a -> Bool) -> t a -> t a
filterG (Array Int Int -> Array Int Int -> Bool
isFixedPoint Array Int Int
arr)
isSignDistIJK3 :: Int -> Int -> Int -> Int -> Int -> Array Int Int -> Bool
isSignDistIJK3 :: Int -> Int -> Int -> Int -> Int -> Array Int Int -> Bool
isSignDistIJK3 Int
i Int
j Int
k Int
d1 Int
d2 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
{-# INLINE isSignDistIJK3 #-}
isUnsignDistIJK3 :: Int -> Int -> Int -> Int -> Int -> Array Int Int -> Bool
isUnsignDistIJK3 :: Int -> Int -> Int -> Int -> Int -> Array Int Int -> Bool
isUnsignDistIJK3 Int
i Int
j Int
k Int
d1 Int
d2 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
{-# INLINE isUnsignDistIJK3 #-}
isMixedDistIJK3 :: Int -> Int -> Int -> Int -> Int -> Array Int Int -> Bool
isMixedDistIJK3 :: Int -> Int -> Int -> Int -> Int -> Array Int Int -> Bool
isMixedDistIJK3 Int
i Int
j Int
k Int
d1 Int
d2 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
{-# INLINE isMixedDistIJK3 #-}
isTripleOrdered :: Int -> Int -> Int -> Array Int Int -> Bool
isTripleOrdered :: Int -> Int -> Int -> Array Int Int -> Bool
isTripleOrdered Int
i Int
j Int
k = (forall a. Eq a => a -> a -> Bool
== Int8
7) forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (t :: * -> *) p.
(Foldable t, Eq p) =>
p -> p -> p -> t p -> Int8
f3 Int
i Int
j Int
k
{-# INLINE isTripleOrdered #-}
isQuadrupleOrdered :: Int -> Int -> Int -> Int -> Array Int Int -> Bool
isQuadrupleOrdered :: Int -> Int -> Int -> Int -> Array Int Int -> Bool
isQuadrupleOrdered Int
i Int
j Int
k Int
l = (forall a. Eq a => a -> a -> Bool
== Int8
15) forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (t :: * -> *) p.
(Foldable t, Eq p) =>
p -> p -> p -> p -> t p -> Int8
f4 Int
i Int
j Int
k Int
l
{-# INLINE isQuadrupleOrdered #-}
isQuintupleOrdered :: Int -> Int -> Int -> Int -> Int -> Array Int Int -> Bool
isQuintupleOrdered :: Int -> Int -> Int -> Int -> Int -> Array Int Int -> Bool
isQuintupleOrdered Int
i Int
j Int
k Int
l Int
m = (forall a. Eq a => a -> a -> Bool
== Int8
31) forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (t :: * -> *) p.
(Foldable t, Eq p) =>
p -> p -> p -> p -> p -> t p -> Int8
f5 Int
i Int
j Int
k Int
l Int
m
{-# INLINE isQuintupleOrdered #-}
isSeveralAOrdered :: Int -> Array Int Int -> Array Int Int -> Bool
isSeveralAOrdered :: Int -> Array Int Int -> Array Int Int -> Bool
isSeveralAOrdered !Int
i0 !Array Int 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) Array Int Int
arr1
{-# INLINE isSeveralAOrdered #-}
isSeveralBOrdered :: Int -> Array Int Int -> Array Int Int -> Bool
isSeveralBOrdered :: Int -> Array Int Int -> Array Int Int -> Bool
isSeveralBOrdered !Int
i0 !Array Int 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) Array Int Int
arr1
{-# INLINE isSeveralBOrdered #-}
isFixedPointTup :: Array Int (Int, Int) -> Array Int Int -> Bool
isFixedPointTup :: Array Int (Int, Int) -> Array Int Int -> Bool
isFixedPointTup Array Int (Int, Int)
arr1 Array Int Int
arr2 = forall (t :: * -> *) a. Foldable t => (a -> Bool) -> t a -> Bool
all (\(Int
k,Int
j) -> forall i e. Array i e -> Int -> e
unsafeAt Array Int Int
arr2 Int
k forall a. Eq a => a -> a -> Bool
== Int
j) Array Int (Int, Int)
arr1
{-# INLINE isFixedPointTup #-}
isFixedPoint :: Array Int Int -> Array Int Int -> Bool
isFixedPoint :: Array Int Int -> Array Int Int -> Bool
isFixedPoint Array Int Int
arr1 Array Int 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 Int Int
arr2 Int
k forall a. Eq a => a -> a -> Bool
== Int
k) Array Int Int
arr1
{-# INLINE isFixedPoint #-}
notSignDistIJK3 :: Int -> Int -> Int -> Int -> Int -> Array Int Int -> Bool
notSignDistIJK3 :: Int -> Int -> Int -> Int -> Int -> Array Int Int -> Bool
notSignDistIJK3 Int
i Int
j Int
k Int
d1 Int
d2 Array Int Int
arr = Int -> Int -> Int -> Array Int Int -> Bool
unsafeSignDistanceIJ Int
j Int
i Int
d1 Array Int Int
arr Bool -> Bool -> Bool
|| Int -> Int -> Int -> Array Int Int -> Bool
unsafeSignDistanceIJ Int
k Int
j Int
d2 Array Int Int
arr
{-# INLINE notSignDistIJK3 #-}
notUnsignDistIJK3 :: Int -> Int -> Int -> Int -> Int -> Array Int Int -> Bool
notUnsignDistIJK3 :: Int -> Int -> Int -> Int -> Int -> Array Int Int -> Bool
notUnsignDistIJK3 Int
i Int
j Int
k Int
d1 Int
d2 = Bool -> Bool
not forall b c a. (b -> c) -> (a -> b) -> a -> c
. Int -> Int -> Int -> Int -> Int -> Array Int Int -> Bool
isUnsignDistIJK3 Int
i Int
j Int
k Int
d1 Int
d2
{-# INLINE notUnsignDistIJK3 #-}
notMixedDistIJK3 :: Int -> Int -> Int -> Int -> Int -> Array Int Int -> Bool
notMixedDistIJK3 :: Int -> Int -> Int -> Int -> Int -> Array Int Int -> Bool
notMixedDistIJK3 Int
i Int
j Int
k Int
d1 Int
d2 Array Int Int
arr = Int -> Int -> Int -> Array Int Int -> Bool
unsafeSignDistanceIJ Int
j Int
i Int
d1 Array Int Int
arr Bool -> Bool -> Bool
|| Bool -> Bool
not (Int -> Int -> Int -> Array Int Int -> Bool
unsafeUnsignDistanceIJ Int
j Int
k Int
d2 Array Int Int
arr)
{-# INLINE notMixedDistIJK3 #-}
notTripleOrdered :: Int -> Int -> Int -> Array Int Int -> Bool
notTripleOrdered :: Int -> Int -> Int -> Array Int Int -> Bool
notTripleOrdered Int
i Int
j Int
k = (forall a. Eq a => a -> a -> Bool
/= Int8
7) forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (t :: * -> *) p.
(Foldable t, Eq p) =>
p -> p -> p -> t p -> Int8
f3 Int
i Int
j Int
k
{-# INLINE notTripleOrdered #-}
notQuadrupleOrdered :: Int -> Int -> Int -> Int -> Array Int Int -> Bool
notQuadrupleOrdered :: Int -> Int -> Int -> Int -> Array Int Int -> Bool
notQuadrupleOrdered Int
i Int
j Int
k Int
l = (forall a. Eq a => a -> a -> Bool
/= Int8
15) forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (t :: * -> *) p.
(Foldable t, Eq p) =>
p -> p -> p -> p -> t p -> Int8
f4 Int
i Int
j Int
k Int
l
{-# INLINE notQuadrupleOrdered #-}
notQuintupleOrdered :: Int -> Int -> Int -> Int -> Int -> Array Int Int -> Bool
notQuintupleOrdered :: Int -> Int -> Int -> Int -> Int -> Array Int Int -> Bool
notQuintupleOrdered Int
i Int
j Int
k Int
l Int
m = (forall a. Eq a => a -> a -> Bool
/= Int8
31) forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (t :: * -> *) p.
(Foldable t, Eq p) =>
p -> p -> p -> p -> p -> t p -> Int8
f5 Int
i Int
j Int
k Int
l Int
m
{-# INLINE notQuintupleOrdered #-}
notSeveralAOrdered :: Int -> Array Int Int -> Array Int Int -> Bool
notSeveralAOrdered :: Int -> Array Int Int -> Array Int Int -> Bool
notSeveralAOrdered !Int
i0 !Array Int Int
arr1 = Bool -> Bool
not forall b c a. (b -> c) -> (a -> b) -> a -> c
. Int -> Array Int Int -> Array Int Int -> Bool
isSeveralAOrdered Int
i0 Array Int Int
arr1
{-# INLINE notSeveralAOrdered #-}
notSeveralBOrdered :: Int -> Array Int Int -> Array Int Int -> Bool
notSeveralBOrdered :: Int -> Array Int Int -> Array Int Int -> Bool
notSeveralBOrdered !Int
i0 !Array Int Int
arr1 = Bool -> Bool
not forall b c a. (b -> c) -> (a -> b) -> a -> c
. Int -> Array Int Int -> Array Int Int -> Bool
isSeveralBOrdered Int
i0 Array Int Int
arr1
{-# INLINE notSeveralBOrdered #-}
notFixedPointTup :: Array Int (Int, Int) -> Array Int Int -> Bool
notFixedPointTup :: Array Int (Int, Int) -> Array Int Int -> Bool
notFixedPointTup Array Int (Int, Int)
arr1 Array Int Int
arr2 = forall (t :: * -> *) a. Foldable t => (a -> Bool) -> t a -> Bool
any (\(Int
k,Int
j) -> forall i e. Array i e -> Int -> e
unsafeAt Array Int Int
arr2 Int
k forall a. Eq a => a -> a -> Bool
/= Int
j) Array Int (Int, Int)
arr1
{-# INLINE notFixedPointTup #-}
notFixedPoint :: Array Int Int -> Array Int Int -> Bool
notFixedPoint :: Array Int Int -> Array Int Int -> Bool
notFixedPoint Array Int Int
arr1 Array Int Int
arr2 = forall (t :: * -> *) a. Foldable t => (a -> Bool) -> t a -> Bool
any (\Int
k -> forall i e. Array i e -> Int -> e
unsafeAt Array Int Int
arr2 Int
k forall a. Eq a => a -> a -> Bool
/= Int
k) Array Int Int
arr1
{-# INLINE notFixedPoint #-}