OCaml "list" with constant addition front and back?

Question

I am new to OCaml and am curious if there is an (standard) data structure in OCaml equivalent to

which provides O (1) add and add operations?

+4

Jonathan gallagher Apr 20 '15 at 23:11

1 answer

Jeffrey scofield · Accepted Answer · 2015-04-20T23:23:09+0000

I believe this is commonly called deque.

Here's the implementation implemented in OCaml Batteries:

It looks like something similar in Jane Street Core:

These (I would require) are the two most widely used OCaml core libraries.