Browse thread
How to do this properly with OCaml?
-
Thomas Fischbacher
- Christophe Dehlinger
- Berke Durak
- Michel Quercia
- Eric Cooper
-
Michael Alexander Hamburg
-
Xavier Leroy
- Berke Durak
- Michael Alexander Hamburg
- Thomas Fischbacher
- Alex Baretta
- skaller
- Thomas Fischbacher
-
Xavier Leroy
[
Home
]
[ Index:
by date
|
by threads
]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
| Date: | -- (:) |
| From: | Stephane Glondu <Stephane.Glondu@c...> |
| Subject: | Re: [Caml-list] How to do this properly with OCaml? |
On Saturday 23 July 2005 12:59, Thomas Fischbacher wrote: > I think that this will not work. > > If I duplicate entries to fill up holes, and later on remove a > legitimate entry whose duplicates fill holes from the heap, I have to > introduce extra bookkeeping so that the other placeholder copies of that > entry are replaced as well - otherwise it could not be reclaimed by GC. Oh, you are right, I didn't think about it... However, my first idea was to use always the same value to fill the holes (e.g. the first one given), so that you keep only this one allocated. Still, it won't be a good deal if your first value uses a lot of memory... Stephane Glondu.