{"author":"Adam Hopkins","author_email":"admhpkns@gmail.com","bugtrack_url":null,"classifiers":["Development Status :: 4 - Beta","Environment :: Web Environment","License :: OSI Approved :: MIT License","Programming Language :: Python :: 3.10","Programming Language :: Python :: 3.7","Programming Language :: Python :: 3.8","Programming Language :: Python :: 3.9"],"description":"# Sanic Routing\n\n## Background\n\nBeginning in v21.3, Sanic makes use of this new AST-style router in two use cases:\n\n1. Routing paths; and\n2. Routing signals.\n\nTherefore, this package comes with a `BaseRouter` that needs to be subclassed in order to be used for its specific needs. \n\nMost Sanic users should never need to concern themselves with the details here.\n\n## Basic Example\n\nA simple implementation:\n\n```python\nimport logging\n\nfrom sanic_routing import BaseRouter\n\nlogging.basicConfig(level=logging.DEBUG)\n\n\nclass Router(BaseRouter):\n def get(self, path, *args, **kwargs):\n return self.resolve(path, *args, **kwargs)\n\n\nrouter = Router()\n\nrouter.add(\"/\", lambda: ...)\nrouter.finalize()\nrouter.tree.display()\nlogging.info(router.find_route_src)\n\nroute, handler, params = router.get(\"/matchme\", method=\"BASE\", extra=None)\n```\n\nThe above snippet uses `router.tree.display()` to show how the router has decided to arrange the routes into a tree. In this simple example:\n\n```\n\n len=1>], dynamic=True>\n```\n\nWe can can see the code that the router has generated for us. It is available as a string at `router.find_route_src`.\n\n```python\ndef find_route(path, method, router, basket, extra):\n parts = tuple(path[1:].split(router.delimiter))\n num = len(parts)\n \n # node=1 // part=__dynamic__:str\n if num == 1: # CHECK 1\n try:\n basket['__matches__'][0] = str(parts[0])\n except ValueError:\n pass\n else:\n # Return 1\n return router.dynamic_routes[('<__dynamic__:str>',)][0], basket\n raise NotFound\n```\n\n_FYI: If you are on Python 3.9, you can see a representation of the source after compilation at `router.find_route_src_compiled`_\n\n## What's it doing?\n\nTherefore, in general implementation requires you to:\n\n1. Define a router with a `get` method;\n2. Add one or more routes;\n3. Finalize the router (`router.finalize()`); and\n4. Call the router's `get` method.\n\n_NOTE: You can call `router.finalize(False)` if you do not want to compile the source code into executable form. This is useful if you only intend to review the generated output._\n\nEvery time you call `router.add` you create one (1) new `Route` instance. Even if that one route is created with multiple methods, it generates a single instance. If you `add()` another `Route` that has a similar path structure (but, perhaps has differen methods) they will be grouped together into a `RouteGroup`. It is worth also noting that a `RouteGroup` is created the first time you call `add()`, but subsequent similar routes will reuse the existing grouping instance.\n\n\nWhen you call `finalize()`, it is taking the defined route groups and arranging them into \"nodes\" in a hierarchical tree. A single node is a path segment. A `Node` instance can have one or more `RouteGroup` on it where the `Node` is the termination point for that path.\n\nPerhaps an example is easier:\n\n```python\nrouter.add(\"/path/to/\", lambda: ...)\nrouter.add(\"/path/to/\", lambda: ...)\nrouter.add(\"/path/to/different/\", lambda: ...)\nrouter.add(\"/path/to/different/\", lambda: ..., methods=[\"one\", \"two\"])\n```\n\nThe generated `RouteGroup` instances (3):\n\n```\n len=1>\n len=1>\n len=2>\n```\n\nThe generated `Route` instances (4):\n\n```\n>\n>\n>\n>\n```\n\nThe Node Tree:\n\n```\n\n \n \n \n len=2>], dynamic=True>\n len=1>], dynamic=True>\n len=1>], dynamic=True>\n```\n\nAnd, the generated source code:\n\n```python\ndef find_route(path, method, router, basket, extra):\n parts = tuple(path[1:].split(router.delimiter))\n num = len(parts)\n \n # node=1 // part=path\n if num > 1: # CHECK 1\n if parts[0] == \"path\": # CHECK 4\n \n # node=1.1 // part=to\n if num > 2: # CHECK 1\n if parts[1] == \"to\": # CHECK 4\n \n # node=1.1.1 // part=different\n if num > 3: # CHECK 1\n if parts[2] == \"different\": # CHECK 4\n \n # node=1.1.1.1 // part=__dynamic__:str\n if num == 4: # CHECK 1\n try:\n basket['__matches__'][3] = str(parts[3])\n except ValueError:\n pass\n else:\n if method in frozenset({'one', 'two'}):\n route_idx = 0\n elif method in frozenset({'BASE'}):\n route_idx = 1\n else:\n raise NoMethod\n # Return 1.1.1.1\n return router.dynamic_routes[('path', 'to', 'different', '<__dynamic__:str>')][route_idx], basket\n \n # node=1.1.2 // part=__dynamic__:int\n if num >= 3: # CHECK 1\n try:\n basket['__matches__'][2] = int(parts[2])\n except ValueError:\n pass\n else:\n if num == 3: # CHECK 5\n # Return 1.1.2\n return router.dynamic_routes[('path', 'to', '<__dynamic__:int>')][0], basket\n \n # node=1.1.3 // part=__dynamic__:str\n if num >= 3: # CHECK 1\n try:\n basket['__matches__'][2] = str(parts[2])\n except ValueError:\n pass\n else:\n if num == 3: # CHECK 5\n # Return 1.1.3\n return router.dynamic_routes[('path', 'to', '<__dynamic__:str>')][0], basket\n raise NotFound\n```\n\n## Special cases\n\nThe above example only shows routes that have a dynamic path segment in them (example: ``). But, there are other use cases that are covered differently:\n\n1. *fully static paths* - These are paths with no parameters (example: `/user/login`). These are basically matched against a key/value store.\n2. *regex paths* - If a route as a single regular expression match, then the whole route will be matched via regex. In general, this happens inline not too dissimilar than what we see in the above example.\n3. *special regex paths* - The router comes with a special `path` type (example: ``) that can match on an expanded delimiter. This is also true for any regex that uses the path delimiter in it. These cannot be matched in the normal course since they are of unknown length.\n","description_content_type":"text/markdown","docs_url":null,"download_url":"","downloads":{"last_day":-1,"last_month":-1,"last_week":-1},"dynamic":null,"home_page":"https://github.com/sanic-org/sanic-routing/","keywords":"","license":"MIT","license_expression":null,"license_files":null,"maintainer":"","maintainer_email":"","name":"sanic-routing","package_url":"https://pypi.org/project/sanic-routing/","platform":"any","project_url":"https://pypi.org/project/sanic-routing/","project_urls":{"Homepage":"https://github.com/sanic-org/sanic-routing/"},"provides_extra":null,"release_url":"https://pypi.org/project/sanic-routing/23.12.0/","requires_dist":null,"requires_python":"","summary":"Core routing component for Sanic","version":"23.12.0","yanked":false,"yanked_reason":null}

Package search

sanic-routing

project_urls

Dependencies

All package metadata

Releases