I'm using EE:Map to store data with a Str key. I'm just wondering if the find() method is performance expensive?

Does it search through the map looking for the key value? If the desired key happens to be the last in the list, does it search the entire list before returning?

Or does Map use some sort of cached lookup or something internally to make find() calls fast?

Isn't it binary search?
http://en.wikipedia.org/wiki/Binary_sear...erformance

If you are looking for near instantaneous retrieval of data based on a key, try using a hash table; I've got an implementation that uses Esenthels memory containers if you require that... if that is what you are looking for of course

Makes sense that its a binary search considering you need to supply a compare function. Nevertheless... I am in fact ideally looking for "instant" retrieval based on a string key. Thanks for the offer jonathon... I would definitely like to see your implementation.

Cool It needs refining but it works very well at the moment. Sent it to you via PM; if anyone else would like to use it please feel free to message me