31:T627,viewof versions = inputStates(viewof form, { label: "Presets", states: { "Bowery b/w Delancey & Cooper Square": {street: "Bowery", crossA: "Delancey Street", crossB: "Cooper Square", boroughs: ["Manhattan"]}, "Nostrand b/w Atlantic & Halsey": {street: "Nostrand Avenue", crossA: "Atlantic Avenue", crossB: "Halsey Street", boroughs: ["Brooklyn"]}, "Broadway b/w Dyckman & Van Cortlandt Park S": {street: "Broadway", crossA: "Dyckman Street", crossB: "Van Cortlandt Park South", boroughs: ["Manhattan", "Bronx"]}, "Northern b/w Queens Plaza & BQE": {street: "Northern Boulevard", crossA: "Queens Plaza North", crossB: "Brooklyn Queens Expressway", boroughs: ["Queens"]}, "Victory b/w Van Duzer & Bay": {street: "Victory Boulevard", crossA: "Van Duzer Street", crossB: "Bay Street", boroughs: ["Staten Island"]}, "Queens Midtown Tunnel b/w 1st & Center": {street: "Queens Midtown Tunnel", crossA: "1 Avenue", crossB: "Center Boulevard", boroughs: ["Manhattan","Queens"]}, "Delancey b/w Essex & Pitt ⚠️": {street: "Delancey Street", crossA: "Essex Street", crossB: "Pitt Street", boroughs: ["Manhattan"]}, "Tillary b/w Clinton & Jay ⚠️": {street: "Tillary Street", crossA: "Clinton Street", crossB: "Jay Street", boroughs: ["Brooklyn"]}, "Sands b/w Adams & Pearl ⚠️": {street: "Sands Street", crossA: "Adams Street", crossB: "Pearl Street", boroughs: ["Brooklyn"]}, "Clinton b/w Cherry & Grand ⚠️": {street: "Clinton Street", crossA: "Cherry Street", crossB: "Grand Street", boroughs: ["Manhattan","Brooklyn"]} }, })32:T4c1,// Get segments of a multiline between two points function getLineBetweenIntersections(street, intersectionA, intersectionB) { const points = [intersectionA, intersectionB].map(int => turf.coordAll(int)[0]); let start = -1; let end = -1; const segment = []; const sorted = sortLineSegments(street); const matches = points.map(p => turf.nearestPointOnLine(sorted, p).properties); sorted.geometry.coordinates.forEach((line, multiIndex) => { line.forEach((coord, segmentIndex) => { if (end >= 0) return; // look for start point if (start === -1) { matches.forEach((match, matchIndex) => { if (multiIndex === match.multiFeatureIndex && segmentIndex === match.segmentIndex) start = matchIndex; }); } // add coordinates if started if (start > -1) { segment.push(coord); } else { return; } // look for end point if (end === -1) { const endIndex = Math.abs(start - 1); if (multiIndex === matches[endIndex].multiFeatureIndex && segmentIndex === matches[endIndex].segmentIndex) end = endIndex; segment.push(coord); } }); }); return turf.lineString(segment); }33:Tcb1,/** * Takes a MultiLineString, groups and sorts its segments into contiguous lines, and ensures a consistent order among all lines * - 70% AI-written. Can only assume there's better algorithms for this (suggestions: https://stackoverflow.com/a/39133413) * - linemerge (from GEOS and JSTS) doesn't work with unsorted/non-continuous lines, apparently * - should try this one again: https://observablehq.com/@julesblm/join-unordered-geojson-linestrings */ function sortLineSegments(feature) { const segments = turf.segmentReduce(feature, (prev, segment) => [...prev, segment.geometry.coordinates], []); if (segments.length === 0) return []; if (segments.length === 1) return segments[0]; // group segments based on shared coordinates const unused = new Set(segments.map((_, i) => i)); const lines = []; while (unused.size > 0) { // start a new group with an unused segment const startIdx = unused.values().next().value; unused.delete(startIdx); let currentLine = [...segments[startIdx]]; let extending = true; // keep extending the group as long as connecting segments are found while (extending) { extending = false; const lineStart = currentLine[0]; const lineEnd = currentLine[currentLine.length - 1]; for (const idx of unused) { const segment = segments[idx]; const segmentStart = segment[0]; const segmentEnd = segment[segment.length - 1]; if (pointsEqual(lineEnd, segmentStart)) { currentLine.push(...segment.slice(1)); unused.delete(idx); extending = true; break; } else if (pointsEqual(lineEnd, segmentEnd)) { currentLine.push(...segment.slice(0, -1).reverse()); unused.delete(idx); extending = true; break; } else if (pointsEqual(lineStart, segmentEnd)) { currentLine.unshift(...segment.slice(0, -1)); unused.delete(idx); extending = true; break; } else if (pointsEqual(lineStart, segmentStart)) { currentLine.unshift(...segment.slice(1).reverse()); unused.delete(idx); extending = true; break; } } } lines.push(currentLine); } // sort and flip lines so they point in the same direction and are roughly continuous const bbox = turf.bbox(turf.multiLineString(lines)); const northWestCorner = turf.point([bbox[0], bbox[3]]); const startPoint = nearestLineEnd(northWestCorner, lines); const unusedLines = [...lines]; const orderedLines = []; while (unusedLines.filter(Boolean).length > 0) { let point; if (orderedLines.length === 0) { point = startPoint; } else { const lastLine = orderedLines[orderedLines.length - 1]; const lastEndPoint = lastLine[lastLine.length - 1]; point = nearestLineEnd(lastEndPoint, unusedLines); } const lineIndex = point.properties.lineIndex; const line = lines[lineIndex]; orderedLines.push(pointsEqual(line[0], point.geometry.coordinates) ? line : line.toReversed()); unusedLines.splice(lineIndex, 1, null); // replace used lines with null to preserve index } return turf.multiLineString(orderedLines); }34:Tb97,function customForm({value = {}} = {}) { const boroughs = ["Manhattan", "Brooklyn", "Queens", "Bronx", "Staten Island"]; const resetButton = html`

Cross streets