`type reversed`````
`type not_reversed`````
`type 'r t`````
`type not_reversed_t``= not_reversed t```
`val empty : not_reversed_t`
`val singleton : InferIR.Sil.instr ‑> not_reversed_t`
`val append_list : not_reversed_t ‑> InferIR.Sil.instr list ‑> not_reversed_t`
`val prepend_one : InferIR.Sil.instr ‑> not_reversed_t ‑> not_reversed_t`
`val of_list : InferIR.Sil.instr list ‑> not_reversed_t`
`val of_rev_list : InferIR.Sil.instr list ‑> not_reversed_t`
`val filter_map : not_reversed_t ‑> f:(InferIR.Sil.instr ‑> InferIR.Sil.instr option) ‑> not_reversed_t`
`val map_changed : equal:(InferIR.Sil.instr ‑> InferIR.Sil.instr ‑> bool) ‑> not_reversed_t ‑> f:(InferIR.Sil.instr ‑> InferIR.Sil.instr) ‑> not_reversed_t`
`val reverse_order : not_reversed_t ‑> reversed t`
`val is_empty : _ t ‑> bool`
`val count : _ t ‑> int`
`val exists : _ t ‑> f:(InferIR.Sil.instr ‑> bool) ‑> bool`
`val for_all : _ t ‑> f:(InferIR.Sil.instr ‑> bool) ‑> bool`
`val nth_exists : _ t ‑> int ‑> bool`
`val nth_exn : _ t ‑> int ‑> InferIR.Sil.instr`
`val last : _ t ‑> InferIR.Sil.instr option`
`val find_map : _ t ‑> f:(InferIR.Sil.instr ‑> 'a option) ‑> 'a option`
`val pp : InferStdlib.Pp.env ‑> Format.formatter ‑> _ t ‑> unit`
`val fold : (_ t, InferIR.Sil.instr, 'a) InferStdlib.IStd.Container.fold`
`val iter : (_ t, InferIR.Sil.instr) InferStdlib.IStd.Container.iter`