From 30d5f7a84c5bf516785a95de51cd0176367df450 Mon Sep 17 00:00:00 2001 From: Tom Smeding Date: Mon, 3 Jun 2024 18:49:08 +0200 Subject: Test permInverse --- src/Data/Array/Mixed/Permutation.hs | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) (limited to 'src/Data/Array/Mixed/Permutation.hs') diff --git a/src/Data/Array/Mixed/Permutation.hs b/src/Data/Array/Mixed/Permutation.hs index 7c77fc4..ca99b02 100644 --- a/src/Data/Array/Mixed/Permutation.hs +++ b/src/Data/Array/Mixed/Permutation.hs @@ -65,7 +65,7 @@ permToList' = map fromIntegral . permToList -- | When called as @permCheckPermutation p k@, if @p@ is a permutation of -- @[0 .. 'length' ('permToList' p) - 1]@, @Just k@ is returned. If it isn't, -- then @Nothing@ is returned. -permCheckPermutation :: forall list r. Perm list -> (IsPermutation list => r) -> Maybe r +permCheckPermutation :: forall r list. Perm list -> (IsPermutation list => r) -> Maybe r permCheckPermutation = \p k -> let n = permLengthSNat p in case (provePerm1 (Proxy @list) n p, provePerm2 (SNat @0) n p) of @@ -210,7 +210,6 @@ shxPermutePrefix = coerce (listxPermutePrefix @(SMayNat Int SNat)) -- * Operations on permutations --- TODO: test this thing more properly permInverse :: Perm is -> (forall is'. IsPermutation is' -- cgit v1.2.3-70-g09d2