b2f70dad52
This PR introduces the basic theory of permutations of `Array`s and proves `Array.swap_perm`. The API falls well short of what is available for `List` at this point.
18 lines
547 B
Text
18 lines
547 B
Text
/-
|
|
Copyright (c) 2024 Lean FRO. All rights reserved.
|
|
Released under Apache 2.0 license as described in the file LICENSE.
|
|
Authors: Kim Morrison
|
|
-/
|
|
prelude
|
|
import Init.Data.List.Nat.Basic
|
|
import Init.Data.List.Nat.Pairwise
|
|
import Init.Data.List.Nat.Range
|
|
import Init.Data.List.Nat.Sublist
|
|
import Init.Data.List.Nat.TakeDrop
|
|
import Init.Data.List.Nat.Count
|
|
import Init.Data.List.Nat.Erase
|
|
import Init.Data.List.Nat.Find
|
|
import Init.Data.List.Nat.BEq
|
|
import Init.Data.List.Nat.Modify
|
|
import Init.Data.List.Nat.InsertIdx
|
|
import Init.Data.List.Nat.Perm
|