-
Notifications
You must be signed in to change notification settings - Fork 9
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
10 changed files
with
126 additions
and
84 deletions.
There are no files selected for viewing
Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.
Oops, something went wrong.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,79 +1,112 @@ | ||
| import type { BuilderLink } from "../BuilderLink"; | ||
| import { | ||
| ResolvedSegmentType, | ||
| SegmentResolver, | ||
| } from "../BuilderLink/SegmentResolver"; | ||
| import type { Location } from "../Location"; | ||
| import type { ResolvedRoute } from "./ResolvedRoute"; | ||
|
|
||
| type DecomposedSegmentType<ActionResult, Segment, Value> = ResolvedSegmentType< | ||
| ActionResult, | ||
| Segment, | ||
| Value | ||
| > & { | ||
| segment: Segment; | ||
| nextLocation: Location; | ||
| }; | ||
|
|
||
| export type SegmentDecomposer<ActionResult, Segment, Value> = ( | ||
| location: Location | ||
| ) => DecomposedSegmentType<ActionResult, Segment, Value>[]; | ||
| /** | ||
| * Create a segment decomposer function for given BuilderLink and SegmentResolver. | ||
| */ | ||
| export function createSegmentDecomposer<ActionResult, Segment, Value>( | ||
| link: BuilderLink<ActionResult, Segment, Value>, | ||
| resolveSegment: SegmentResolver<ActionResult, Segment, Value> | ||
| ): SegmentDecomposer<ActionResult, Segment, Value> { | ||
| const { composer } = link; | ||
| return (location) => { | ||
| const decomposed = composer.decompose(location); | ||
| return decomposed.flatMap(({ segment, nextLocation }) => { | ||
| const resolved = resolveSegment(segment, nextLocation); | ||
| if (resolved === undefined) { | ||
| return []; | ||
| } | ||
| return [{ ...resolved, segment, nextLocation }]; | ||
| }); | ||
| }; | ||
| } | ||
|
|
||
| /** | ||
| * Resolve location from given link and location | ||
| * @package | ||
| */ | ||
| export function resolveChain<ActionResult, Value>( | ||
| link: BuilderLink<ActionResult, unknown, Value>, | ||
| export function resolveChain<ActionResult, Segment, Value>( | ||
| link: BuilderLink<ActionResult, Segment, Value>, | ||
| location: Location, | ||
| currentLocation: Location | ||
| ): Array<ResolvedRoute<Value>> { | ||
| const decomposed = link.composer.decompose(location); | ||
| return decomposed.flatMap( | ||
| ({ segment, nextLocation: nextRemainingLocation }) => { | ||
| const resolved = link.resolveSegment?.(segment, nextRemainingLocation); | ||
| if (resolved === undefined) { | ||
| return []; | ||
| } | ||
| const nextCurrentLocation = link.composer.compose( | ||
| currentLocation, | ||
| segment | ||
| ); | ||
| const match = (resolved.type === "normal" | ||
| ? {} | ||
| : { | ||
| [resolved.matchKey]: segment, | ||
| }) as never; | ||
| const resolvedSegments = link.segmentDecomposer?.(location); | ||
| if (resolvedSegments === undefined) { | ||
| return []; | ||
| } | ||
| return resolvedSegments.flatMap((resolved) => { | ||
| const nextCurrentLocation = link.composer.compose( | ||
| currentLocation, | ||
| resolved.segment | ||
| ); | ||
| const match = (resolved.type === "normal" | ||
| ? {} | ||
| : { | ||
| [resolved.matchKey]: resolved.matchValue, | ||
| }) as never; | ||
|
|
||
| const childLink = resolved.link; | ||
| const childLink = resolved.link; | ||
|
|
||
| if (childLink === undefined) { | ||
| return [ | ||
| { | ||
| route: resolved.value, | ||
| match, | ||
| remainingLocation: nextRemainingLocation, | ||
| currentLocation: nextCurrentLocation, | ||
| }, | ||
| ]; | ||
| } | ||
| if (childLink === undefined) { | ||
| return [ | ||
| { | ||
| route: resolved.value, | ||
| match, | ||
| remainingLocation: resolved.nextLocation, | ||
| currentLocation: nextCurrentLocation, | ||
| }, | ||
| ]; | ||
| } | ||
|
|
||
| const result = resolveChain<ActionResult, Value>( | ||
| childLink, | ||
| nextRemainingLocation, | ||
| nextCurrentLocation | ||
| ); | ||
| const result = resolveChain<ActionResult, unknown, Value>( | ||
| childLink, | ||
| resolved.nextLocation, | ||
| nextCurrentLocation | ||
| ); | ||
|
|
||
| if ( | ||
| result.length === 0 && | ||
| childLink.composer.isLeaf(nextRemainingLocation) | ||
| ) { | ||
| return [ | ||
| { | ||
| route: resolved.value, | ||
| match, | ||
| remainingLocation: nextRemainingLocation, | ||
| currentLocation: nextCurrentLocation, | ||
| }, | ||
| ]; | ||
| if ( | ||
| result.length === 0 && | ||
| childLink.composer.isLeaf(resolved.nextLocation) | ||
| ) { | ||
| return [ | ||
| { | ||
| route: resolved.value, | ||
| match, | ||
| remainingLocation: resolved.nextLocation, | ||
| currentLocation: nextCurrentLocation, | ||
| }, | ||
| ]; | ||
| } | ||
| switch (resolved.type) { | ||
| case "normal": { | ||
| return result; | ||
| } | ||
| switch (resolved.type) { | ||
| case "normal": { | ||
| return result; | ||
| } | ||
| case "matching": { | ||
| const key = resolved.matchKey; | ||
| const matchedValue = resolved.matchValue; | ||
| return result.map((res) => { | ||
| // eslint-disable-next-line @typescript-eslint/no-explicit-any | ||
| (res.match as any)[key] = matchedValue; | ||
| return res; | ||
| }); | ||
| } | ||
| case "matching": { | ||
| const key = resolved.matchKey; | ||
| const matchedValue = resolved.matchValue; | ||
| return result.map((res) => { | ||
| // eslint-disable-next-line @typescript-eslint/no-explicit-any | ||
| (res.match as any)[key] = matchedValue; | ||
| return res; | ||
| }); | ||
| } | ||
| } | ||
| ); | ||
| }); | ||
| } |