( routeList: Array<TRouteLike>, processedTree: ProcessedTree<any, TRouteLike, any>, )
| 671 | } |
| 672 | |
| 673 | export function processRouteMasks< |
| 674 | TRouteLike extends Extract<RouteLike, { from: string }>, |
| 675 | >( |
| 676 | routeList: Array<TRouteLike>, |
| 677 | processedTree: ProcessedTree<any, TRouteLike, any>, |
| 678 | ) { |
| 679 | const segmentTree = createStaticNode<TRouteLike>('/') |
| 680 | const data = new Uint16Array(6) |
| 681 | for (const route of routeList) { |
| 682 | parseSegments(false, data, route, 1, segmentTree, 0) |
| 683 | } |
| 684 | sortTreeNodes(segmentTree) |
| 685 | processedTree.masksTree = segmentTree |
| 686 | processedTree.flatCache = createLRUCache< |
| 687 | string, |
| 688 | ReturnType<typeof findMatch<TRouteLike>> |
| 689 | >(1000) |
| 690 | } |
| 691 | |
| 692 | /** |
| 693 | * Take an arbitrary list of routes, create a tree from them (if it hasn't been created already), and match a path against it. |
no test coverage detected