Re: [Caml-list] Map that maintains insertion-order on keys

[Jesper Louis Andersen <jesper.louis.andersen@gmail.com>]

[-- Attachment #1: Type: text/plain, Size: 1078 bytes --]

Hi,

Could you give some small example of what you want or a more precise
definition? I can think of at least 3 ways to parse meaning out of "gives
keys in order of insertion", and I don't know which you might want.

On Thu, Jul 14, 2016 at 8:02 PM, Christoph Höger <
christoph.hoeger@tu-berlin.de> wrote:

> Dear all,
>
> I need a data structure has all the functionality of a Map.t but also
> gives keys in the order of insertion. Is such a structure readily
> available in some OCaml library?
>
> thanks,
>
> Christoph
> --
> Christoph Höger
>
> Technische Universität Berlin
> Fakultät IV - Elektrotechnik und Informatik
> Übersetzerbau und Programmiersprachen
>
> Sekr. TEL12-2, Ernst-Reuter-Platz 7, 10587 Berlin
>
> Tel.: +49 (30) 314-24890
> E-Mail: christoph.hoeger@tu-berlin.de
>
> --
> Caml-list mailing list.  Subscription management and archives:
> https://sympa.inria.fr/sympa/arc/caml-list
> Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
> Bug reports: http://caml.inria.fr/bin/caml-bugs
>



-- 
J.

[-- Attachment #2: Type: text/html, Size: 2008 bytes --]