On 09Apr18, Colin Ingarfield allegedly wrote:

> > quickly on a modern CPU. I am assuming that zeromq does better than
> > linear since topics are exact prefix match there are plenty of
> > alogrithmic solutions that are far faster than O(n).
> I believe it uses a prefix matching trie.?? Worst case is O(length of
> longest topic).?? If topic names are reasonably short, it's negligible on
> a modern cpu.

Thanks Colin, good to know. So yes, 500 topics should be trivial.

Measure measure measure.


Mark.
_______________________________________________
zeromq-dev mailing list
zeromq-dev@lists.zeromq.org
https://lists.zeromq.org/mailman/listinfo/zeromq-dev

Reply via email to