aboutsummaryrefslogtreecommitdiff
path: root/src/Data/Array
diff options
context:
space:
mode:
authorTom Smeding <tom@tomsmeding.com>2024-06-03 18:49:08 +0200
committerTom Smeding <tom@tomsmeding.com>2024-06-03 19:24:48 +0200
commit30d5f7a84c5bf516785a95de51cd0176367df450 (patch)
tree0543c7761fc216b911a2e9077c5ef2e4ace224ce /src/Data/Array
parentcc193feee38429e1a853cc23365b95e96b206672 (diff)
Test permInverse
Diffstat (limited to 'src/Data/Array')
-rw-r--r--src/Data/Array/Mixed/Permutation.hs3
1 files changed, 1 insertions, 2 deletions
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'