@tanstack/react-router 0.0.1-beta.278 → 0.0.1-beta.279

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
@@ -2092,7 +2092,10 @@
2092
2092
  while (parsed.length > 1 && parsed[0]?.value === '/') {
2093
2093
  parsed.shift();
2094
2094
  }
2095
- const score = parsed.map(d => {
2095
+ const scores = parsed.map(d => {
2096
+ if (d.value === '/') {
2097
+ return 0.75;
2098
+ }
2096
2099
  if (d.type === 'param') {
2097
2100
  return 0.5;
2098
2101
  }
@@ -2106,38 +2109,31 @@
2106
2109
  trimmed,
2107
2110
  parsed,
2108
2111
  index: i,
2109
- score
2112
+ scores
2110
2113
  });
2111
2114
  });
2112
2115
  this.flatRoutes = scoredRoutes.sort((a, b) => {
2113
- let isIndex = a.trimmed === '/' ? 1 : b.trimmed === '/' ? -1 : 0;
2114
- if (isIndex !== 0) return isIndex;
2115
- const length = Math.min(a.score.length, b.score.length);
2116
-
2117
- // Sort by length of score
2118
- if (a.score.length !== b.score.length) {
2119
- return b.score.length - a.score.length;
2120
- }
2116
+ const minLength = Math.min(a.scores.length, b.scores.length);
2121
2117
 
2122
2118
  // Sort by min available score
2123
- for (let i = 0; i < length; i++) {
2124
- if (a.score[i] !== b.score[i]) {
2125
- return b.score[i] - a.score[i];
2119
+ for (let i = 0; i < minLength; i++) {
2120
+ if (a.scores[i] !== b.scores[i]) {
2121
+ return b.scores[i] - a.scores[i];
2126
2122
  }
2127
2123
  }
2128
2124
 
2125
+ // Sort by length of score
2126
+ if (a.scores.length !== b.scores.length) {
2127
+ return b.scores.length - a.scores.length;
2128
+ }
2129
+
2129
2130
  // Sort by min available parsed value
2130
- for (let i = 0; i < length; i++) {
2131
+ for (let i = 0; i < minLength; i++) {
2131
2132
  if (a.parsed[i].value !== b.parsed[i].value) {
2132
2133
  return a.parsed[i].value > b.parsed[i].value ? 1 : -1;
2133
2134
  }
2134
2135
  }
2135
2136
 
2136
- // Sort by length of trimmed full path
2137
- if (a.trimmed !== b.trimmed) {
2138
- return a.trimmed > b.trimmed ? 1 : -1;
2139
- }
2140
-
2141
2137
  // Sort by original index
2142
2138
  return a.index - b.index;
2143
2139
  }).map((d, i) => {