Fork me on GitHub
#bangalore-clj
<
2017-11-05
>
anujsays14:11:57

Correction on my talk yesterday - Pedestal routing algorithm has constant time complexity in optimal case, O(log N) otherwise. For more details, read- http://pedestal.io/reference/routing-quick-reference#_routers and see the recent presentation of Paul- https://www.youtube.com/watch?v=_Cf-STRvFy8&amp;t=15m30s

amarjeet15:11:10

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

kumarshantanu16:11:00

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

anujsays16:11:31

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