Dropping or taking from lists on the right

Taking or removing element from the tail end of a list

Main definitions

• rdrop n: drop n : ℕ elements from the tail
• rtake n: take n : ℕ elements from the tail
• rdropWhile p: remove all the elements from the tail of a list until it finds the first element for which p : α → Bool returns false. This element and everything before is returned.
• rtakeWhile p: Returns the longest terminal segment of a list for which p : α → Bool returns true.

Implementation detail

The two predicate-based methods operate by performing the regular "from-left" operation on List.reverse, followed by another List.reverse, so they are not the most performant. The other two rely on List.length l so they still traverse the list twice. One could construct another function that takes a L : ℕ and use L - n. Under a proof condition that L = l.length, the function would do the right thing.

def List.rdrop {α : Type u_1} (l : List α) (n : ℕ) : List α

Drop n elements from the tail end of a list.

Equations

• l.rdrop n = List.take (l.length - n) l

@[simp]

theorem List.rdrop_nil {α : Type u_1} (n : ℕ) : [].rdrop n = []

@[simp]

theorem List.rdrop_zero {α : Type u_1} (l : List α) : l.rdrop 0 = l

theorem List.rdrop_eq_reverse_drop_reverse {α : Type u_1} (l : List α) (n : ℕ) : l.rdrop n = (List.drop n l.reverse).reverse

@[simp]

theorem List.rdrop_concat_succ {α : Type u_1} (l : List α) (n : ℕ) (x : α) : (l ++ [x]).rdrop (n + 1) = l.rdrop n

def List.rtake {α : Type u_1} (l : List α) (n : ℕ) : List α

Take n elements from the tail end of a list.

Equations

• l.rtake n = List.drop (l.length - n) l

@[simp]

theorem List.rtake_nil {α : Type u_1} (n : ℕ) : [].rtake n = []

@[simp]

theorem List.rtake_zero {α : Type u_1} (l : List α) : l.rtake 0 = []

theorem List.rtake_eq_reverse_take_reverse {α : Type u_1} (l : List α) (n : ℕ) : l.rtake n = (List.take n l.reverse).reverse

@[simp]

theorem List.rtake_concat_succ {α : Type u_1} (l : List α) (n : ℕ) (x : α) : (l ++ [x]).rtake (n + 1) = l.rtake n ++ [x]

def List.rdropWhile {α : Type u_1} (p : α → Bool) (l : List α) : List α

Drop elements from the tail end of a list that satisfy p : α → Bool. Implemented naively via List.reverse

Equations

• List.rdropWhile p l = (List.dropWhile p l.reverse).reverse

@[simp]

theorem List.rdropWhile_nil {α : Type u_1} (p : α → Bool) : List.rdropWhile p [] = []

theorem List.rdropWhile_concat {α : Type u_1} (p : α → Bool) (l : List α) (x : α) : List.rdropWhile p (l ++ [x]) = if p x = true then List.rdropWhile p l else l ++ [x]

@[simp]

theorem List.rdropWhile_concat_pos {α : Type u_1} (p : α → Bool) (l : List α) (x : α) (h : p x = true) : List.rdropWhile p (l ++ [x]) = List.rdropWhile p l

@[simp]

theorem List.rdropWhile_concat_neg {α : Type u_1} (p : α → Bool) (l : List α) (x : α) (h : ¬p x = true) : List.rdropWhile p (l ++ [x]) = l ++ [x]

theorem List.rdropWhile_singleton {α : Type u_1} (p : α → Bool) (x : α) : List.rdropWhile p [x] = if p x = true then [] else [x]

theorem List.rdropWhile_last_not {α : Type u_1} (p : α → Bool) (l : List α) (hl : List.rdropWhile p l ≠ []) : ¬p ((List.rdropWhile p l).getLast hl) = true

theorem List.rdropWhile_prefix {α : Type u_1} (p : α → Bool) (l : List α) : List.rdropWhile p l <+: l

@[simp]

theorem List.rdropWhile_eq_nil_iff {α : Type u_1} {p : α → Bool} {l : List α} : List.rdropWhile p l = [] ↔ ∀ (x : α), x ∈ l → p x = true

@[simp]

theorem List.dropWhile_eq_self_iff {α : Type u_1} {p : α → Bool} {l : List α} : List.dropWhile p l = l ↔ ∀ (hl : 0 < l.length), ¬p (l.get ⟨0, hl⟩) = true

@[simp]

theorem List.rdropWhile_eq_self_iff {α : Type u_1} {p : α → Bool} {l : List α} : List.rdropWhile p l = l ↔ ∀ (hl : l ≠ []), ¬p (l.getLast hl) = true

theorem List.dropWhile_idempotent {α : Type u_1} (p : α → Bool) (l : List α) : List.dropWhile p (List.dropWhile p l) = List.dropWhile p l

theorem List.rdropWhile_idempotent {α : Type u_1} (p : α → Bool) (l : List α) : List.rdropWhile p (List.rdropWhile p l) = List.rdropWhile p l

def List.rtakeWhile {α : Type u_1} (p : α → Bool) (l : List α) : List α

Take elements from the tail end of a list that satisfy p : α → Bool. Implemented naively via List.reverse

Equations

• List.rtakeWhile p l = (List.takeWhile p l.reverse).reverse

@[simp]

theorem List.rtakeWhile_nil {α : Type u_1} (p : α → Bool) : List.rtakeWhile p [] = []

theorem List.rtakeWhile_concat {α : Type u_1} (p : α → Bool) (l : List α) (x : α) : List.rtakeWhile p (l ++ [x]) = if p x = true then List.rtakeWhile p l ++ [x] else []

@[simp]

theorem List.rtakeWhile_concat_pos {α : Type u_1} (p : α → Bool) (l : List α) (x : α) (h : p x = true) : List.rtakeWhile p (l ++ [x]) = List.rtakeWhile p l ++ [x]

@[simp]

theorem List.rtakeWhile_concat_neg {α : Type u_1} (p : α → Bool) (l : List α) (x : α) (h : ¬p x = true) : List.rtakeWhile p (l ++ [x]) = []

theorem List.rtakeWhile_suffix {α : Type u_1} (p : α → Bool) (l : List α) : List.rtakeWhile p l <:+ l

@[simp]

theorem List.rtakeWhile_eq_self_iff {α : Type u_1} {p : α → Bool} {l : List α} : List.rtakeWhile p l = l ↔ ∀ (x : α), x ∈ l → p x = true

@[simp]

theorem List.rtakeWhile_eq_nil_iff {α : Type u_1} {p : α → Bool} {l : List α} : List.rtakeWhile p l = [] ↔ ∀ (hl : l ≠ []), ¬p (l.getLast hl) = true

theorem List.mem_rtakeWhile_imp {α : Type u_1} {p : α → Bool} {l : List α} {x : α} (hx : x ∈ List.rtakeWhile p l) : p x = true

theorem List.rtakeWhile_idempotent {α : Type u_1} (p : α → Bool) (l : List α) : List.rtakeWhile p (List.rtakeWhile p l) = List.rtakeWhile p l

theorem List.rdrop_add {α : Type u_1} {l : List α} (i : ℕ) (j : ℕ) : (l.rdrop i).rdrop j = l.rdrop (i + j)

@[simp]

theorem List.rdrop_append_length {α : Type u_1} {l₁ : List α} {l₂ : List α} : (l₁ ++ l₂).rdrop l₂.length = l₁

theorem List.rdrop_append_of_le_length {α : Type u_1} {l₁ : List α} {l₂ : List α} (k : ℕ) : k ≤ l₂.length → (l₁ ++ l₂).rdrop k = l₁ ++ l₂.rdrop k

@[simp]

theorem List.rdrop_append_length_add {α : Type u_1} {l₁ : List α} {l₂ : List α} (k : ℕ) : (l₁ ++ l₂).rdrop (l₂.length + k) = l₁.rdrop k