Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
[Caml-list] productivity improvement
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2003-05-10 (20:25)
From: Eray Ozkural <exa@k...>
Subject: Re: [Caml-list] Array.resize ?
On Saturday 19 October 2002 04:51, Oleg wrote:
> This is exactly what I meant when I wrote "memory is reserved in chunks
> automatically ... " above.
> (BTW might I suggest you save the condescending tone for somewhere else?)

I may have wanted to say an array is not something you append to, but a 
"vector" in C++ terminology is.... Sorry for the inappropriate manner.

In fact, the data structure library should be careful enough to distinguish 
list ADT implemented with extensible arrays from list ADT implemented with 
linked lists. I was thinking about this the other day. That distinction is 
probably one of the few things that C++ standard library has implemented 
quite well. (I personally don't like the "iterator" abstraction at all)

Also, a dynamic array which you can resize would be worthwhile. Any name 
suggestions for such a module? I used Dynarray for the small code I posted on 
the list but somebody else may have a better one (like "flex" in algol) I 
always end up using strange names.

Best Regards,

Eray Ozkural (exa) <>
Comp. Sci. Dept., Bilkent University, Ankara  KDE Project:
www:  Malfunction:
GPG public key fingerprint: 360C 852F 88B0 A745 F31B  EA0F 7C07 AE16 874D 539C

To unsubscribe, mail Archives:
Bug reports: FAQ:
Beginner's list: