Alessandro Pini ([EMAIL PROTECTED]) wrote:
> >- Open Your Mind -<
>
>Quoting from Brian Hawley's message (08-Jul-00 01:31:18).
>
>b> This either means resorting the list after every
>b> insert, using an incremental insertion sort, or making
>b> sure the data is inserted in order.
>
>Hmmm. :-
Eric wrote:
==
Hashes seem to be particularly slow when searching for nonexistent key
values. For 100,000 searches:
loop 10 [ if select z "1533695" [x: x + 1]] ; first key value, 0:02
loop 10 [ if select z "501730" [x: x + 1]] ; 5000th key value, 0:53
loop 10 [ i
Hi,
regarding memoizing. There is a class of functions, that must use
some kind of memoizing to work at all, I think. The number of the
possibilities for parameters does not matter, you can store only
important results (depending on what you consider important - eg.
expensive or recent results...
Hi,
my experiment was raher related to Brian's Memoize, or other
simple associative structures. The result is, that for structures
containing more than 4 096 elements, the natives Find, Select,...
can successfully be replaced by some appropriately designed
approaches.
Regards
Ladislav
