Browse thread
Impact of GC on memoized algorithm
-
Alex Baretta
-
Jon Harrop
-
Alex Baretta
-
Alexander S. Usov
- Marcin 'Qrczak' Kowalczyk
-
Alexander S. Usov
-
Alex Baretta
-
Jon Harrop
[
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: | Marcin 'Qrczak' Kowalczyk <qrczak@k...> |
| Subject: | Re: [Caml-list] Impact of GC on memoized algorithm |
"Alexander S. Usov" <A.S.Usov@KVI.nl> writes:
>> Rather, what happens, time-wise, if I create a hashtable with 4096 slots
>> and end up filling it with several million key-value pairs?
>
> In the best case you end up with a few hundreds or even few thousands of
> elements per bucket.
No, OCaml's hash tables are resized automatically.
--
__("< Marcin Kowalczyk
\__/ qrczak@knm.org.pl
^^ http://qrnik.knm.org.pl/~qrczak/