inductive Regex.Data.CaptureGroups : Type

Groups captured by a regex match.

• For .group tag first last rest, the group with tag tag starts at position first and ends at position last. It will overwrite the positions with the same tag in rest.
• .concat g₁ g₂ joins the capture groups for concatenations by preferring the groups in g₂ over g₁. (Last write wins.)

• empty : CaptureGroups
• group (tag : Nat) (first last : String.Pos) (rest : CaptureGroups) : CaptureGroups
• concat (g₁ g₂ : CaptureGroups) : CaptureGroups

def Regex.Data.CaptureGroups.mem (groups : CaptureGroups) (group : Nat × String.Pos × String.Pos) : Prop

Equations

• Regex.Data.CaptureGroups.empty.mem group = False
• (Regex.Data.CaptureGroups.group tag first last rest).mem group = (tag = group.fst ∧ first = group.snd.fst ∧ last = group.snd.snd ∨ rest.mem group)
• (g₁.concat g₂).mem group = (g₁.mem group ∨ g₂.mem group)

instance Regex.Data.CaptureGroups.instMembershipProdNatPos : Membership (Nat × String.Pos × String.Pos) CaptureGroups

Equations

• Regex.Data.CaptureGroups.instMembershipProdNatPos = { mem := Regex.Data.CaptureGroups.mem }

@[simp]

theorem Regex.Data.CaptureGroups.mem_empty {group : Nat × String.Pos × String.Pos} : group ∈ empty ↔ False

@[simp]

theorem Regex.Data.CaptureGroups.mem_group {group : Nat × String.Pos × String.Pos} {tag : Nat} {first last : String.Pos} {rest : CaptureGroups} : group ∈ CaptureGroups.group tag first last rest ↔ group = (tag, first, last) ∨ group ∈ rest

@[simp]

theorem Regex.Data.CaptureGroups.mem_concat {group : Nat × String.Pos × String.Pos} {g₁ g₂ : CaptureGroups} : group ∈ g₁.concat g₂ ↔ group ∈ g₁ ∨ group ∈ g₂