Complexity of findNodeDataForKey

A general question about a function. As i do not have access to the source code of the library, i cannot answer that by myself.

What is the complexity of the findNodeDataForKey ? I assume this function to be either constant ( use a map) or linerar (linear search).

If you can just post a piece of code that would prove the point, that would be nice.


It uses a Map, so it uses a JavaScript Object for lookup.