Prefix Tree Router
Provide a performant router which is efficient in time and space.
The implementation is modeled after httprouter, a library for Go.
Most performant builtin router implementation when dynamic routes (those using path parameters and wildcards) are required. The prefix tree router operates in logarithmic time.
Provides less control over routing. For example, Wild card routes
always win. The path
/foo/:bar will always match over
Like the Map Tree Router, query and path constraints are not used in routing decisions. They are only used to invalidate a route match.