Fork me on GitHub

Correction on my talk yesterday - Pedestal routing algorithm has constant time complexity in optimal case, O(log N) otherwise. For more details, read- and see the recent presentation of Paul-;t=15m30s


yeah, I was about to ping you to check on this, I was watching this video today

Shantanu Kumar16:11:00

@anujsays In case you happen to benchmark Pedestal routing against any Ring equivalent, please let me know.


Sure. I will do that before pushing this to production. Will keep you posted.