def Array.merge {α : Type u_1} (lt : α → α → Bool) (xs : Array α) (ys : Array α) : Array α

O(|xs| + |ys|). Merge arrays xs and ys. If the arrays are sorted according to lt, then the result is sorted as well. If two (or more) elements are equal according to lt, they are preserved.

Equations

• Array.merge lt xs ys = Array.merge.go lt xs ys (Array.mkEmpty (xs.size + ys.size)) 0 0

@[irreducible]

def Array.merge.go {α : Type u_1} (lt : α → α → Bool) (xs : Array α) (ys : Array α) (acc : Array α) (i : Nat) (j : Nat) : Array α

Auxiliary definition for merge.

Equations

• One or more equations did not get rendered due to their size.

@[deprecated Array.merge]

def Array.mergeSortedPreservingDuplicates {α : Type u_1} [ord : Ord α] (xs : Array α) (ys : Array α) : Array α

O(|xs| + |ys|). Merge arrays xs and ys. If the arrays are sorted according to lt, then the result is sorted as well. If two (or more) elements are equal according to lt, they are preserved.

Equations

• xs.mergeSortedPreservingDuplicates ys = Array.merge (fun (x x_1 : α) => (compare x x_1).isLT) xs ys

def Array.mergeDedupWith {α : Type u_1} [ord : Ord α] (xs : Array α) (ys : Array α) (merge : α → α → α) : Array α

O(|xs| + |ys|). Merge arrays xs and ys, which must be sorted according to compare and must not contain duplicates. Equal elements are merged using merge. If merge respects the order (i.e. for all x, y, y', z, if x < y < z and x < y' < z then x < merge y y' < z) then the resulting array is again sorted.

Equations

• xs.mergeDedupWith ys merge = Array.mergeDedupWith.go xs ys merge (Array.mkEmpty (xs.size + ys.size)) 0 0

@[irreducible]

def Array.mergeDedupWith.go {α : Type u_1} [ord : Ord α] (xs : Array α) (ys : Array α) (merge : α → α → α) (acc : Array α) (i : Nat) (j : Nat) : Array α

Auxiliary definition for mergeDedupWith.

Equations

• One or more equations did not get rendered due to their size.

@[deprecated Array.mergeDedupWith]

def Array.mergeSortedMergingDuplicates {α : Type u_1} [ord : Ord α] (xs : Array α) (ys : Array α) (merge : α → α → α) : Array α

Alias of Array.mergeDedupWith.

---

O(|xs| + |ys|). Merge arrays xs and ys, which must be sorted according to compare and must not contain duplicates. Equal elements are merged using merge. If merge respects the order (i.e. for all x, y, y', z, if x < y < z and x < y' < z then x < merge y y' < z) then the resulting array is again sorted.

Equations

• @Array.mergeSortedMergingDuplicates = @Array.mergeDedupWith

@[inline]

def Array.mergeDedup {α : Type u_1} [ord : Ord α] (xs : Array α) (ys : Array α) : Array α

O(|xs| + |ys|). Merge arrays xs and ys, which must be sorted according to compare and must not contain duplicates. If an element appears in both xs and ys, only one copy is kept.

Equations

• xs.mergeDedup ys = xs.mergeDedupWith ys fun (x x_1 : α) => x

@[deprecated Array.mergeDedup]

def Array.mergeSortedDeduplicating {α : Type u_1} [ord : Ord α] (xs : Array α) (ys : Array α) : Array α

Alias of Array.mergeDedup.

---

O(|xs| + |ys|). Merge arrays xs and ys, which must be sorted according to compare and must not contain duplicates. If an element appears in both xs and ys, only one copy is kept.

Equations

• @Array.mergeSortedDeduplicating = @Array.mergeDedup

def Array.mergeUnsortedDedup {α : Type u_1} [eq : BEq α] (xs : Array α) (ys : Array α) : Array α

O(|xs| * |ys|). Merge xs and ys, which do not need to be sorted. Elements which occur in both xs and ys are only added once. If xs and ys do not contain duplicates, then neither does the result.

Equations

• xs.mergeUnsortedDedup ys = if xs.size < ys.size then Array.mergeUnsortedDedup.go ys xs else Array.mergeUnsortedDedup.go xs ys

@[inline]

def Array.mergeUnsortedDedup.go {α : Type u_1} [eq : BEq α] (xs : Array α) (ys : Array α) : Array α

Auxiliary definition for mergeUnsortedDedup.

Equations

• Array.mergeUnsortedDedup.go xs ys = let xsSize := xs.size; Array.foldl (fun (xs : Array α) (y : α) => if xs.any (fun (x : α) => x == y) 0 xsSize = true then xs else xs.push y) xs ys 0

@[deprecated Array.mergeUnsortedDedup]

def Array.mergeUnsortedDeduplicating {α : Type u_1} [eq : BEq α] (xs : Array α) (ys : Array α) : Array α

Alias of Array.mergeUnsortedDedup.

---

O(|xs| * |ys|). Merge xs and ys, which do not need to be sorted. Elements which occur in both xs and ys are only added once. If xs and ys do not contain duplicates, then neither does the result.

Equations

• @Array.mergeUnsortedDeduplicating = @Array.mergeUnsortedDedup

def Array.mergeAdjacentDups {α : Type u_1} [eq : BEq α] (f : α → α → α) (xs : Array α) : Array α

O(|xs|). Replace each run [x₁, ⋯, xₙ] of equal elements in xs with f ⋯ (f (f x₁ x₂) x₃) ⋯ xₙ.

Equations

• Array.mergeAdjacentDups f xs = if h : 0 < xs.size then Array.mergeAdjacentDups.go f xs (Array.mkEmpty xs.size) 1 (xs.get ⟨0, h⟩) else xs

@[irreducible]

def Array.mergeAdjacentDups.go {α : Type u_1} [eq : BEq α] (f : α → α → α) (xs : Array α) (acc : Array α) (i : Nat) (hd : α) : Array α

Auxiliary definition for mergeAdjacentDups.

Equations

• One or more equations did not get rendered due to their size.

@[deprecated Array.mergeAdjacentDups]

def Array.mergeAdjacentDuplicates {α : Type u_1} [eq : BEq α] (f : α → α → α) (xs : Array α) : Array α

Alias of Array.mergeAdjacentDups.

---

O(|xs|). Replace each run [x₁, ⋯, xₙ] of equal elements in xs with f ⋯ (f (f x₁ x₂) x₃) ⋯ xₙ.

Equations

• @Array.mergeAdjacentDuplicates = @Array.mergeAdjacentDups

def Array.dedupSorted {α : Type u_1} [eq : BEq α] (xs : Array α) : Array α

O(|xs|). Deduplicate a sorted array. The array must be sorted with to an order which agrees with ==, i.e. whenever x == y then compare x y == .eq.

Equations

• xs.dedupSorted = Array.mergeAdjacentDups (fun (x x_1 : α) => x) xs

@[deprecated Array.dedupSorted]

def Array.deduplicateSorted {α : Type u_1} [eq : BEq α] (xs : Array α) : Array α

Alias of Array.dedupSorted.

---

O(|xs|). Deduplicate a sorted array. The array must be sorted with to an order which agrees with ==, i.e. whenever x == y then compare x y == .eq.

Equations

• @Array.deduplicateSorted = @Array.dedupSorted

def Array.sortDedup {α : Type u_1} [ord : Ord α] (xs : Array α) : Array α

O(|xs| log |xs|). Sort and deduplicate an array.

Equations

• xs.sortDedup = let_fun this := ord.toBEq; (xs.qsort (fun (x x_1 : α) => (compare x x_1).isLT) 0).dedupSorted

@[deprecated Array.sortDedup]

def Array.sortAndDeduplicate {α : Type u_1} [ord : Ord α] (xs : Array α) : Array α

Alias of Array.sortDedup.

---

O(|xs| log |xs|). Sort and deduplicate an array.

Equations

• @Array.sortAndDeduplicate = @Array.sortDedup