| 7341 | * cannot pay goes out as it was, without a note. |
| 7342 | */ |
| 7343 | const noteCutBodies = ( |
| 7344 | windowed: ReadonlyArray<SectionPart>, original: ReadonlyArray<SectionPart>, |
| 7345 | c: ExploreCluster, focus: ReadonlyArray<number>, |
| 7346 | ): SectionPart[] => { |
| 7347 | const marked = windowed.map((w): SectionPart => { |
| 7348 | const source = original.find((p) => p.range.start <= w.range.start && w.range.end <= p.range.end); |
| 7349 | if (!source || w.range.end >= source.range.end) return w; |
| 7350 | const host = c.members |
| 7351 | .filter((m) => m.definition && m.start <= w.range.end && m.end > w.range.end) |
| 7352 | .sort((a, b) => (a.end - a.start) - (b.end - b.start))[0]; |
| 7353 | return host ? { ...w, cut: { host: host.name, hostStart: host.start, hostEnd: host.end } } : w; |
| 7354 | }); |
| 7355 | return marked.map((p, i) => { |
| 7356 | if (!p.cut) return p; |
| 7357 | let lowest = Math.max(p.range.start + MIN_WINDOW_LINES - 1, p.cut.hostStart); |
| 7358 | for (const l of focus) if (l >= p.range.start && l <= p.range.end) lowest = Math.max(lowest, l); |
| 7359 | for (const m of c.members) { |
| 7360 | if (m.definition && m.start >= p.range.start && m.end <= p.range.end) lowest = Math.max(lowest, m.end); |
| 7361 | } |
| 7362 | for (let end = p.range.end; end >= lowest; end--) { |
| 7363 | const range = { start: p.range.start, end }; |
| 7364 | const text = renderSpan(range) + cutNoteOf(p, marked[i + 1], end); |
| 7365 | if (text.length <= p.text.length) return { range, text, cut: p.cut }; |
| 7366 | } |
| 7367 | return { range: p.range, text: p.text }; |
| 7368 | }); |
| 7369 | }; |
| 7370 | |
| 7371 | /** |
| 7372 | * One cluster's final parts: built, shrunk if it overruns `cap`, then |