Map/Dict Efficiency

Alan Baljeu <[email protected]>
Newsgroups gmane.comp.ai.prolog.swi
Message-ID <[email protected]> 
>Lookup is order (N), 
while adding values, deleting values 
>and merging with other maps has 
order N. The main disadvantage 
>is that changing values in large 
maps is costly, both in terms 
>of memory and time. 


This is quite surprising to me.  *Everything* is done with 
a linear search?  I might as well use an ordinary list of pairs.
lmpx.com only provides a reader for public news (NNTP) servers. It is not affiliated with the servers or forums shown here and is not responsible for the content of articles, which is written by their respective authors.