From mboxrd@z Thu Jan 1 00:00:00 1970 From: elfring@users.sourceforge.net (SF Markus Elfring) Date: Mon, 10 Mar 2014 22:26:17 +0100 Subject: [Cocci] Selection of class libraries ...? In-Reply-To: References: <5307CAA2.8060406@users.sourceforge.net> <530C5E18.1020800@users.sourceforge.net> <530CD2C4.4050903@users.sourceforge.net> <530CF8FF.8080600@users.sourceforge.net> <530DD06F.4090703@users.sourceforge.net> <531B0D52.5070008@users.sourceforge.net> <531B32F4.9080004@users.sourceforge.net> <531B771D.3020900@users.sourceforge.net> <531C1FAD.6030009@users.sourceforge.net> <531DFDBC.9010801@users.sourceforge.net> <531E04D9.5000605@users.sourceforge.net> <531E2A51.5050000@users.sourceforge.net> Message-ID: <531E2DF9.9020909@users.sourceforge.net> To: cocci@systeme.lip6.fr List-Id: cocci@systeme.lip6.fr > You can just add information to the front of the list, and then reverse it > at the end if that is needed. I would like to avoid even insertion at some list heads and a corresponding element reordering because of software efficiency considerations. Is a data structure available for OCaml which is similar to a standard buffer? http://ocaml.org/learn/tutorials/comparison_of_standard_containers.html#Bufferextensiblestrings Regards, Markus