theorem Array.forIn_eq_forIn_toList {m : Type u_1 → Type u_2} {α : Type u_3} {β : Type u_1} [Monad m] (as : Array α) (b : β) (f : α → β → m (ForInStep β)) : forIn as b f = forIn as.toList b f

@[deprecated Array.forIn_eq_forIn_toList (since := "2024-09-09")]

theorem Array.forIn_eq_forIn_data {m : Type u_1 → Type u_2} {α : Type u_3} {β : Type u_1} [Monad m] (as : Array α) (b : β) (f : α → β → m (ForInStep β)) : forIn as b f = forIn as.toList b f

Alias of Array.forIn_eq_forIn_toList.

zipWith / zip

@[deprecated Array.toList_zipWith (since := "2024-09-09")]

theorem Array.data_zipWith {α : Type u_1} {β : Type u_2} {γ : Type u_3} (f : α → β → γ) (xs : Array α) (ys : Array β) : (zipWith f xs ys).toList = List.zipWith f xs.toList ys.toList

Alias of Array.toList_zipWith.

flatten

@[deprecated Array.toList_flatten (since := "2024-09-09")]

theorem Array.data_join {α : Type u_1} {xss : Array (Array α)} : xss.flatten.toList = (List.map toList xss.toList).flatten

Alias of Array.toList_flatten.

@[deprecated Array.mem_flatten (since := "2024-10-15")]

theorem Array.mem_join {α : Type u_1} {a : α} {xss : Array (Array α)} : a ∈ xss.flatten ↔ ∃ (xs : Array α), xs ∈ xss ∧ a ∈ xs

Alias of Array.mem_flatten.

indexOf?

theorem Array.idxOf?_toList {α : Type u_1} [BEq α] {a : α} {l : Array α} : List.idxOf? a l.toList = l.idxOf? a

erase

@[deprecated List.eraseP_toArray (since := "2025-02-06")]

theorem Array.eraseP_toArray {α : Type u_1} {as : List α} {p : α → Bool} : as.toArray.eraseP p = (List.eraseP p as).toArray

Alias of List.eraseP_toArray.

@[deprecated List.erase_toArray (since := "2025-02-06")]

theorem Array.erase_toArray {α : Type u_1} [BEq α] {as : List α} {a : α} : as.toArray.erase a = (as.erase a).toArray

Alias of List.erase_toArray.

@[simp]

theorem Array.toList_erase {α : Type u_1} [BEq α] (l : Array α) (a : α) : (l.erase a).toList = l.toList.erase a

@[simp]

theorem Array.size_eraseIdxIfInBounds {α : Type u_1} (a : Array α) (i : Nat) : (a.eraseIdxIfInBounds i).size = if i < a.size then a.size - 1 else a.size

set

theorem Array.size_set! {α : Type u_1} (a : Array α) (i : Nat) (v : α) : (a.set! i v).size = a.size

map

mem

insertAt

@[deprecated Array.size_insertIdx (since := "2024-11-20")]

theorem Array.size_insertAt {α : Type u} {a : α} {i : Nat} {xs : Array α} (h : i ≤ xs.size) : (xs.insertIdx i a h).size = xs.size + 1

Alias of Array.size_insertIdx.

@[deprecated Array.getElem_insertIdx_of_lt (since := "2024-11-20")]

theorem Array.getElem_insertAt_lt {α : Type u} {xs : Array α} {x : α} {i k : Nat} (w : i ≤ xs.size) (h : k < i) : (xs.insertIdx i x w)[k] = xs[k]

Alias of Array.getElem_insertIdx_of_lt.

@[deprecated Array.getElem_insertIdx_self (since := "2024-11-20")]

theorem Array.getElem_insertAt_eq {α : Type u} {xs : Array α} {x : α} {i : Nat} (w : i ≤ xs.size) : (xs.insertIdx i x w)[i] = x

Alias of Array.getElem_insertIdx_self.

@[deprecated Array.getElem_insertIdx_of_gt (since := "2024-11-20")]

theorem Array.getElem_insertAt_gt {α : Type u} {xs : Array α} {x : α} {i k : Nat} (w : k ≤ xs.size) (h : k > i) : (xs.insertIdx i x ⋯)[k] = xs[k - 1]

Alias of Array.getElem_insertIdx_of_gt.

@[deprecated Array.getElem_insertIdx_of_lt (since := "2025-02-06")]

theorem Array.getElem_insertIdx_lt {α : Type u} {xs : Array α} {x : α} {i k : Nat} (w : i ≤ xs.size) (h : k < i) : (xs.insertIdx i x w)[k] = xs[k]

Alias of Array.getElem_insertIdx_of_lt.

@[deprecated Array.getElem_insertIdx_self (since := "2025-02-06")]

theorem Array.getElem_insertIdx_eq {α : Type u} {xs : Array α} {x : α} {i : Nat} (w : i ≤ xs.size) : (xs.insertIdx i x w)[i] = x

Alias of Array.getElem_insertIdx_self.

@[deprecated Array.getElem_insertIdx_of_gt (since := "2025-02-06")]

theorem Array.getElem_insertIdx_gt {α : Type u} {xs : Array α} {x : α} {i k : Nat} (w : k ≤ xs.size) (h : k > i) : (xs.insertIdx i x ⋯)[k] = xs[k - 1]

Alias of Array.getElem_insertIdx_of_gt.