Re: [Ocaml-lib-devel] Data structures table- trial HTML

[Nicolas C. <war...@fr...>]

> Could someone with IE on Windows take a quick peek at the included HTML
> file and see if it looks sane or not?  It's validated HTML 3.2 Final- but
> it should work just fine one most any browser.  People with Opera and
> other browsers please test as well.  I've looked at it under Netscape and
> Konqueror on Linux, and all looks well.

Thanks Brian , it works.
But few comments here :
- reading verticaly the names of the data structures in a pain :)
- I think we need more primitives, for example it's not specified that the
"index" access on arrays is O(1) , and actually prepend/append/insert/remove
are not valid operations on arrays since it is not resizable.
- we need more explanations than that.

Here's how I see the thing :

List : Ocaml list are immutable, you cannot then modify their contents, but
since they're implemented as linked list, you can easily append elements at
the beginning. List in Ocaml are efficient enough for most of the usages. If
you need a list were contents can be changed, see the RefList module.
    <followed by sample samples on basic list operations with complexity>

 Array : Ocaml arrays are not resizable, but provide constant-time indexed
access. If you need resizable arrays, use DynArray
 < and so on... >

There is no direct comparison between the differents data structures, but
even a beginner can have a quick read at the list to understand about the
main differences between data structures.

Nicolas Cannasse