Linear Search Router

Provides the user with the most control over routing outside of implementing a custom router.

You require precise control over routing and the routing performance tradeoff is acceptable to your service.

Add the key :io.pedestal.http/router to the service map with the value :linear-search.

This implementation routes requests in linear time, so it’s the simplest and slowest of Pedestal’s router implementations.

Pedestal’s first router implementation.

Query and path constraints are used in routing decisions unlike the Prefix Tree Router or Map Tree Router. That is, if a route is considered (based on path, method, and so forth) but the path or query parameters violate the constraints defined in the route, then the search will continue. For the other routers, a route is matched and then either used, or (if constraints do not match) the entire request is treated as unrouted.