Traversable instance for DLists

This file provides the equivalence between List α and DList α and the traversable instance for DList.

def Std.DList.listEquivDList (α : Type u_1) : List α ≃ Std.DList α

The natural equivalence between lists and difference lists, using DList.ofList and DList.toList.

Equations

• Std.DList.listEquivDList α = { toFun := Std.DList.ofList, invFun := Std.DList.toList, left_inv := ⋯, right_inv := ⋯ }

instance Std.instTraversableDList : Traversable Std.DList

Equations

• Std.instTraversableDList = Equiv.traversable Std.DList.listEquivDList

instance Std.instLawfulTraversableDListInstTraversableDList : LawfulTraversable Std.DList

Equations

• Std.instLawfulTraversableDListInstTraversableDList = ⋯

instance Std.instInhabitedDList {α : Type u_2} : Inhabited (Std.DList α)

Equations

• Std.instInhabitedDList = { default := Std.DList.empty }