Expand description
Auto-generated module
🤖 Generated with SplitRS
Functions§
- arr_
ext_ array2d_ ty Array2D : Type → Nat → Nat → Type- arr_
ext_ chunks_ cover_ ty Array.chunks_cover : ∀ {α n k}, Array α n → Prop- arr_
ext_ chunks_ of_ ty Array.chunksOf : {α : Type} → {n : Nat} → Nat → Array α n → List (List α)- arr_
ext_ convolution_ ty Array.convolution : {n : Nat} → Array Nat n → Array Nat n → Array Nat n- arr_
ext_ diff_ array_ ty Array.diff_array : {α : Type} → {n : Nat} → Array α n → Array α n- arr_
ext_ fft_ conv_ correct_ ty Array.fft_conv_correct : ∀ {n}, Array Nat n → Array Nat n → Prop- arr_
ext_ filter_ map_ fuse_ ty Array.filter_map_fuse : ∀ {α β n}, (α → Option β) → Array α n → Prop- arr_
ext_ fold_ map_ fuse_ ty Array.fold_map_fuse : ∀ {α β γ n}, (β → γ → γ) → γ → (α → β) → Array α n → Prop- arr_
ext_ map_ fuse_ ty Array.map_fuse : ∀ {α β γ n}, (β → γ) → (α → β) → Array α n → Prop- arr_
ext_ par_ map_ correct_ ty Array.par_map_correct : ∀ {α β n}, (α → β) → Array α n → Prop- arr_
ext_ par_ map_ ty Array.par_map : {α β : Type} → {n : Nat} → (α → β) → Array α n → Array β n- arr_
ext_ par_ reduce_ ty Array.par_reduce : {α : Type} → {n : Nat} → (α → α → α) → α → Array α n → α- arr_
ext_ persistent_ array_ ty PersistentArray : Type → Nat → Type- arr_
ext_ persistent_ get_ ty PersistentArray.get : {α : Type} → {n : Nat} → PersistentArray α n → Fin n → α- arr_
ext_ persistent_ set_ ty PersistentArray.set : {α : Type} → {n : Nat} → PersistentArray α n → Fin n → α → PersistentArray α n- arr_
ext_ prefix_ sum_ correct_ ty Array.prefix_sum_correct : ∀ {n}, Array Nat n → Prop- arr_
ext_ rmq_ correct_ ty Array.rmq_correct : ∀ {α n}, [Ord α] → Array α n → Prop- arr_
ext_ rotate_ inverse_ ty Array.rotate_inverse : ∀ {α n k}, Array α n → Prop- arr_
ext_ rotate_ left_ ty Array.rotate_left : {α : Type} → {n : Nat} → Nat → Array α n → Array α n- arr_
ext_ rotate_ right_ ty Array.rotate_right : {α : Type} → {n : Nat} → Nat → Array α n → Array α n- arr_
ext_ scan_ left_ ty Array.scan_left : {α β : Type} → {n : Nat} → (β → α → β) → β → Array α n → Array β (n+1)- arr_
ext_ sparse_ table_ ty Array.sparse_table : {α : Type} → {n : Nat} → [Ord α] → Array α n → Type- arr_
ext_ suffix_ array_ correct_ ty Array.suffix_array_correct : ∀ {n}, Array Nat n → Prop- arr_
ext_ suffix_ array_ ty Array.suffix_array : {n : Nat} → Array Nat n → Array Nat n- arr_
ext_ transpose_ ty Array2D.transpose : {α : Type} → {r c : Nat} → Array2D α r c → Array2D α c r- merge_
sort - Merge sort implementation on a mutable slice.
- register_
array_ extended - Register all extended array axioms into the kernel environment.