find node algorithm complexity

[lanyusan]

Hi, I am further evaluating Konva for my project.So far I am very happy with it.

I am thinking of extensively using the stage.find() function. Can I check what's the complexity of this function of finding nodes, especially find by id?

Is it random access of O(1) or close to constant or linear O(n) or worse? This is a critical information for my evaluation.

Thanks in advance.

[lavrton]

I think it is O(n). It is not so hard to make a quick performance demo if it is important for you.

[lanyusan]

Thanks. Would do performance testing some time later, not only for this. But it is always good to hear from developer first of course.