js.documents 14.6.5 → 14.6.6

package/README.md

@@ -934,7 +934,7 @@ To run a single test file: `pnpm vitest run src/path/to/file.test.ts`.
 - **Font resolution uses a real registry, standard 14 as last resort.** A family with no embedded/caller/vendored face (Aptos, third-party typefaces) renders through the nearest standard-14 face with a width-correction factor — expect a visual approximation, not line-identical output. MathML formula rendering is separate: it embeds STIX Two Math, not registry-resolvable.
 - **Justified paragraphs stretch inter-word gaps** in all three layout engines (`engine.ts`, `slides.ts`, `sheets.ts`). `justifyLineGapsPt` divides slack evenly across detected word gaps; final lines stay left-aligned.
 - **Encrypted PDFs and CCITT/JBIG2/JPX images are real capabilities** in pdf-codec — not scope boundaries. The permanent boundary is adversarial/malformed-input robustness.
-- **PDF → docx/pptx/odt/odp table recovery requires a real drawn gridline lattice** — never text alignment (which would invent structure). A lattice with no text inside is rejected.
+- **PDF → docx/pptx/odt/odp table recovery requires drawn rules** — never text alignment alone (which would invent structure). Either a real gridline lattice, or a table ruled between its rows (`src/layout/ruled-rows.ts`): at least three horizontal rules of one span, with the columns taken from the gutters every row holding text in more than one place leaves, a heading row above the first rule read when its lines keep to the columns, a row crossing a gutter read as a spanning cell, and a band whose every line fills its columns split into a row per line. Such a grid is refused when every column reads as running prose or when anything other than horizontal strokes and full-width shading is drawn inside it (a diagram). A lattice with no text inside is rejected.
 - **Merged table cells round-trip as merged.** docx: horizontal merge collapses to one `w:tc` with `w:gridSpan`; vertical merge needs one `w:tc` per covered row with `w:vMerge`. ODF: one entry per grid position, covered cells get `table:covered-table-cell`.
 - **docx headers/footers/comments/footnotes/numbering are readable via `readDocxExtras`** — `readDocxContent` still drops them (`ContentDocument` has nowhere to put them). `PAGE`/`NUMPAGES` field substitution is never read (it's a render-time value).
 - **A docx inline image reads as a real `ContentImageBlock`** — `buildDocxPackage` recognises the flat docx reader's two-block pattern (empty-text paragraph + image) and writes it back as one paragraph, avoiding spurious blank paragraphs on round trip.
@@ -1012,7 +1012,7 @@ Read as **row → column**. `✓` lossless, `~` bounded, `✗` lossy, `✗✗` s
 
 **odf → PDF and embedded formulas** render faithful mathematical typesetting through STIX Two Math: real box-model layout, per-glyph metrics, font-wide constants from the `MATH` table, stretchy fences and braces via `MathVariants`. `pdfToOdf` is not attempted — recovering a semantic operator tree from glyphs is OCR-adjacent.
 
-**PDF → docx/pptx/odt/odp** is best-effort reconstruction from geometry. Reading order, font properties, page count survive; paragraph boundaries are inferred from baseline spacing. Text set in columns is read one column at a time: a vertical strip that no text touches over a run of lines, with running prose on both sides (a measure of at least twenty characters, lines that wrap, word gaps narrower than the strip), splits the page there before lines are clustered, so two columns whose baselines line up no longer interleave line by line. Lines crossing the strip (a full-width heading, a boxed passage) are read in page order between the column bands above and below them, and images and recovered tables are placed by the column they sit in. A table's rows are still read across, since its columns are too narrow or too ragged to pass as prose; a page with no such strip, or with text whose horizontal extent the reader did not report, reads exactly as clustering the whole page always did (`src/layout/reading-order.ts`). Tables recover only from a real gridline lattice. Vector primitives recover into a nested drawing document.
+**PDF → docx/pptx/odt/odp** is best-effort reconstruction from geometry. Reading order, font properties, page count survive; paragraph boundaries are inferred from baseline spacing. Text set in columns is read one column at a time: a vertical strip that no text touches over a run of lines, with running prose on both sides (a measure of at least twenty characters, lines that wrap, word gaps narrower than the strip), splits the page there before lines are clustered, so two columns whose baselines line up no longer interleave line by line. Lines crossing the strip (a full-width heading, a boxed passage) are read in page order between the column bands above and below them, and images and recovered tables are placed by the column they sit in. A table's rows are still read across, since its columns are too narrow or too ragged to pass as prose; a page with no such strip, or with text whose horizontal extent the reader did not report, reads exactly as clustering the whole page always did (`src/layout/reading-order.ts`). Tables recover only from drawn rules: a real gridline lattice, or a table ruled between its rows with its columns set apart by whitespace, which is read cell by cell so a cell's wrapped lines stay together however the producer ordered its drawing (see the table-recovery gotcha below). Vector primitives recover into a nested drawing document.
 
 **PDF → odg** is near-1:1 mapping (no clustering needed). Kind narrows upstream: rotated rects, freeform curves, multi-subpath figures become `path`.
 

package/dist/{composition-plan-DMTkmk8n.js → composition-plan-BLhc55_x.js}

@@ -23,7 +23,7 @@ import { buildCsvText } from "./csv/write.js";
 import { i as readSvgContent } from "./read-BSH--XB4.js";
 import { buildSvgText } from "./svg/write.js";
 import { throwIfAborted } from "./ports/abort.js";
-import { _ as reconstructWordprocessing, g as reconstructSpreadsheet, i as reconstructPresentation, r as reconstructDrawing } from "./reconstruct-presentations-prod-D1KbGPxa.js";
+import { _ as reconstructWordprocessing, g as reconstructSpreadsheet, i as reconstructPresentation, r as reconstructDrawing } from "./reconstruct-presentations-prod-DV7UQqMT.js";
 import { stampPdfPackageTables } from "./convert/pdf-package-tables.js";
 import { drawingToPresentation, presentationToDrawing, presentationToWordprocessing, spreadsheetToWordprocessing, wordprocessingToPresentation } from "./convert/variant-bridges.js";
 import { UnsupportedConversionError } from "./convert/capability.js";

package/dist/{composition-plan-DJQgPvBj.cjs → composition-plan-CgjS-XZU.cjs}

@@ -23,7 +23,7 @@ const require_csv_write = require("./csv/write.cjs");
 const require_read$1 = require("./read-CahCZMwG.cjs");
 const require_svg_write = require("./svg/write.cjs");
 const require_ports_abort = require("./ports/abort.cjs");
-const require_reconstruct_presentations_prod = require("./reconstruct-presentations-prod-CsvGlvP2.cjs");
+const require_reconstruct_presentations_prod = require("./reconstruct-presentations-prod-DtpKKgRY.cjs");
 const require_convert_pdf_package_tables = require("./convert/pdf-package-tables.cjs");
 const require_convert_variant_bridges = require("./convert/variant-bridges.cjs");
 const require_convert_capability = require("./convert/capability.cjs");

package/dist/convert/composition-plan.cjs

@@ -1,5 +1,5 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_composition_plan = require("../composition-plan-DJQgPvBj.cjs");
+const require_composition_plan = require("../composition-plan-CgjS-XZU.cjs");
 exports.buildCompositionGraph = require_composition_plan.buildCompositionGraph;
 exports.isContentFormat = require_composition_plan.isContentFormat;
 exports.isSourceContentFormat = require_composition_plan.isSourceContentFormat;

package/dist/convert/composition-plan.js

@@ -1,2 +1,2 @@
-import { a as shortestPath, i as resolveCompositionPlan, n as isContentFormat, r as isSourceContentFormat, t as buildCompositionGraph } from "../composition-plan-DMTkmk8n.js";
+import { a as shortestPath, i as resolveCompositionPlan, n as isContentFormat, r as isSourceContentFormat, t as buildCompositionGraph } from "../composition-plan-BLhc55_x.js";
 export { buildCompositionGraph, isContentFormat, isSourceContentFormat, resolveCompositionPlan, shortestPath };

package/dist/convert/composition-to-pdf.cjs

@@ -7,7 +7,7 @@ const require_ports_abort = require("../ports/abort.cjs");
 const require_sheets = require("../sheets-BQCpNXsE.cjs");
 const require_layout_drawing = require("../layout/drawing.cjs");
 const require_convert_capability = require("./capability.cjs");
-const require_composition_plan = require("../composition-plan-DJQgPvBj.cjs");
+const require_composition_plan = require("../composition-plan-CgjS-XZU.cjs");
 let document_schema_js = require("document-schema.js");
 let pdf_codec = require("pdf-codec");
 //#region src/convert/composition-to-pdf.ts

package/dist/convert/composition-to-pdf.js

@@ -6,7 +6,7 @@ import { throwIfAborted } from "../ports/abort.js";
 import { l as convertSpreadsheetToLayout } from "../sheets-DWDvGN-g.js";
 import { convertDrawingToLayout } from "../layout/drawing.js";
 import { UnsupportedConversionError } from "./capability.js";
-import { _ as executeFromPdf, b as runCompositionPlan, c as LAYOUT_CAPABLE, d as READ_ONLY_FORMAT_NODES, g as executeBridge, i as resolveCompositionPlan, s as FORMAT_NODES, v as isReadOnlyContentFormat, y as isTextFormatNode } from "../composition-plan-DMTkmk8n.js";
+import { _ as executeFromPdf, b as runCompositionPlan, c as LAYOUT_CAPABLE, d as READ_ONLY_FORMAT_NODES, g as executeBridge, i as resolveCompositionPlan, s as FORMAT_NODES, v as isReadOnlyContentFormat, y as isTextFormatNode } from "../composition-plan-BLhc55_x.js";
 import { assembleTree } from "document-schema.js";
 import { createFontMeasurer, createFontRegistry, loadMathFont, writePdf } from "pdf-codec";
 //#region src/convert/composition-to-pdf.ts

package/dist/convert/composition.cjs

@@ -1,5 +1,5 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_composition_plan = require("../composition-plan-DJQgPvBj.cjs");
+const require_composition_plan = require("../composition-plan-CgjS-XZU.cjs");
 exports.CONTENT_FORMATS = require_composition_plan.CONTENT_FORMATS;
 exports.FORMAT_NODES = require_composition_plan.FORMAT_NODES;
 exports.LAYOUT_CAPABLE = require_composition_plan.LAYOUT_CAPABLE;

package/dist/convert/composition.js

@@ -1,2 +1,2 @@
-import { _ as executeFromPdf, b as runCompositionPlan, c as LAYOUT_CAPABLE, d as READ_ONLY_FORMAT_NODES, f as RECONSTRUCTORS, g as executeBridge, h as convertDocumentFromPdf, l as MAX_CONVERSION_PATH_NODES, m as TRANSFORMS, o as CONTENT_FORMATS, p as THROUGH_PDF_EDGE_COST, s as FORMAT_NODES, u as READ_ONLY_CONTENT_FORMATS, v as isReadOnlyContentFormat, y as isTextFormatNode } from "../composition-plan-DMTkmk8n.js";
+import { _ as executeFromPdf, b as runCompositionPlan, c as LAYOUT_CAPABLE, d as READ_ONLY_FORMAT_NODES, f as RECONSTRUCTORS, g as executeBridge, h as convertDocumentFromPdf, l as MAX_CONVERSION_PATH_NODES, m as TRANSFORMS, o as CONTENT_FORMATS, p as THROUGH_PDF_EDGE_COST, s as FORMAT_NODES, u as READ_ONLY_CONTENT_FORMATS, v as isReadOnlyContentFormat, y as isTextFormatNode } from "../composition-plan-BLhc55_x.js";
 export { CONTENT_FORMATS, FORMAT_NODES, LAYOUT_CAPABLE, MAX_CONVERSION_PATH_NODES, READ_ONLY_CONTENT_FORMATS, READ_ONLY_FORMAT_NODES, RECONSTRUCTORS, THROUGH_PDF_EDGE_COST, TRANSFORMS, convertDocumentFromPdf, executeBridge, executeFromPdf, isReadOnlyContentFormat, isTextFormatNode, runCompositionPlan };

package/dist/convert/from-pdf.cjs

@@ -1,7 +1,7 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_reconstruct_presentations_prod = require("../reconstruct-presentations-prod-CsvGlvP2.cjs");
+const require_reconstruct_presentations_prod = require("../reconstruct-presentations-prod-DtpKKgRY.cjs");
 const require_convert_pdf_package_tables = require("./pdf-package-tables.cjs");
-const require_composition_plan = require("../composition-plan-DJQgPvBj.cjs");
+const require_composition_plan = require("../composition-plan-CgjS-XZU.cjs");
 const require_codecs_read = require("../codecs/read.cjs");
 let document_schema_js = require("document-schema.js");
 let pdf_codec_read = require("pdf-codec/read");

package/dist/convert/from-pdf.js

@@ -1,6 +1,6 @@
-import { _ as reconstructWordprocessing } from "../reconstruct-presentations-prod-D1KbGPxa.js";
+import { _ as reconstructWordprocessing } from "../reconstruct-presentations-prod-DV7UQqMT.js";
 import { stampPdfPackageTables } from "./pdf-package-tables.js";
-import { h as convertDocumentFromPdf } from "../composition-plan-DMTkmk8n.js";
+import { h as convertDocumentFromPdf } from "../composition-plan-BLhc55_x.js";
 import { CONTENT_READERS } from "../codecs/read.js";
 import { assembleTree } from "document-schema.js";
 import { readPdf } from "pdf-codec/read";

package/dist/convert/local.cjs

@@ -1,7 +1,7 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
 const require_convert_capability = require("./capability.cjs");
 const require_convert_port = require("./port.cjs");
-const require_composition_plan = require("../composition-plan-DJQgPvBj.cjs");
+const require_composition_plan = require("../composition-plan-CgjS-XZU.cjs");
 const require_convert_composition_to_pdf = require("./composition-to-pdf.cjs");
 const require_convert_convert = require("./convert.cjs");
 //#region src/convert/local.ts

package/dist/convert/local.js

@@ -1,6 +1,6 @@
 import { UnsupportedConversionError } from "./capability.js";
 import { DOCUMENT_FORMATS } from "./port.js";
-import { i as resolveCompositionPlan } from "../composition-plan-DMTkmk8n.js";
+import { i as resolveCompositionPlan } from "../composition-plan-BLhc55_x.js";
 import { convertDocument } from "./composition-to-pdf.js";
 import { odfToPdf } from "./convert.js";
 //#region src/convert/local.ts

package/dist/index.cjs

@@ -93,7 +93,7 @@ const require_ports_abort = require("./ports/abort.cjs");
 const require_sheets = require("./sheets-BQCpNXsE.cjs");
 const require_layout_drawing = require("./layout/drawing.cjs");
 const require_layout_lattice = require("./layout/lattice.cjs");
-const require_reconstruct_presentations_prod = require("./reconstruct-presentations-prod-CsvGlvP2.cjs");
+const require_reconstruct_presentations_prod = require("./reconstruct-presentations-prod-DtpKKgRY.cjs");
 const require_hsqldb_script = require("./hsqldb/script.cjs");
 const require_odb_csv = require("./odb/csv.cjs");
 const require_hsqldb_rowformat = require("./hsqldb/rowformat.cjs");
@@ -107,7 +107,7 @@ const require_firebird_backup = require("./firebird/backup.cjs");
 const require_odb_read = require("./odb/read.cjs");
 const require_odb_spreadsheet = require("./odb/spreadsheet.cjs");
 const require_convert_port = require("./convert/port.cjs");
-const require_composition_plan = require("./composition-plan-DJQgPvBj.cjs");
+const require_composition_plan = require("./composition-plan-CgjS-XZU.cjs");
 const require_convert_composition_to_pdf = require("./convert/composition-to-pdf.cjs");
 const require_convert_convert = require("./convert/convert.cjs");
 const require_package_codec = require("./package-codec.cjs");

package/dist/index.js

@@ -92,7 +92,7 @@ import { throwIfAborted } from "./ports/abort.js";
 import { l as convertSpreadsheetToLayout } from "./sheets-DWDvGN-g.js";
 import { convertDrawingToLayout } from "./layout/drawing.js";
 import { detectGridLattice } from "./layout/lattice.js";
-import { _ as reconstructWordprocessing, g as reconstructSpreadsheet, i as reconstructPresentation, r as reconstructDrawing } from "./reconstruct-presentations-prod-D1KbGPxa.js";
+import { _ as reconstructWordprocessing, g as reconstructSpreadsheet, i as reconstructPresentation, r as reconstructDrawing } from "./reconstruct-presentations-prod-DV7UQqMT.js";
 import { HsqldbScriptParseError, displayTextFor, parseHsqldbScript } from "./hsqldb/script.js";
 import { OdbTableNotFoundError, OdbTableNotSpecifiedError } from "./odb/csv.js";
 import { HsqldbRowFormatError } from "./hsqldb/rowformat.js";
@@ -106,7 +106,7 @@ import { FirebirdBackupFormatError, SUPPORTED_BACKUP_FORMAT_VERSION, readFirebir
 import { OdbNoEmbeddedDataSourceError, OdbUnsupportedFormatError, readOdbTables } from "./odb/read.js";
 import { odbTablesToSpreadsheetDocument } from "./odb/spreadsheet.js";
 import { DOCUMENT_FORMATS, DocumentFormatSchema } from "./convert/port.js";
-import { i as resolveCompositionPlan } from "./composition-plan-DMTkmk8n.js";
+import { i as resolveCompositionPlan } from "./composition-plan-BLhc55_x.js";
 import { convertDocument } from "./convert/composition-to-pdf.js";
 import { OdmUnresolvedSectionError, csvToMarkdown, csvToOds, csvToPdf, csvToXlsx, docToMarkdown, docToPdf, docxToMarkdown, docxToOdt, docxToPdf, docxToPptx, epubToPdf, markdownToCsv, markdownToDocx, markdownToOdt, markdownToPdf, markdownToXlsx, odbReportToDocx, odbReportToOdt, odbReportToPdf, odbToCsv, odbToXlsx, odfToPdf, odgToPdf, odgToSvg, odmToPdf, odpToOdt, odpToPdf, odpToPptx, odsToCsv, odsToPdf, odsToXlsx, odtToDocx, odtToMarkdown, odtToOdp, odtToPdf, pptToMarkdown, pptToPdf, pptxToDocx, pptxToOdp, pptxToPdf, rtfToPdf, svgToOdg, svgToPdf, xlsToMarkdown, xlsToPdf, xlsxToCsv, xlsxToMarkdown, xlsxToOds, xlsxToPdf } from "./convert/convert.js";
 import { UnsupportedPackageFormatError, decodeDocumentPackage, decodeOdbPackage, encodeDocumentPackage } from "./package-codec.js";

package/dist/layout/lattice.cjs

@@ -29,7 +29,7 @@ function extractLineCandidates(items) {
 			continue;
 		}
 		if (item.kind === "rect") {
-			const isThinEnoughToBeALine = Math.min(item.widthPt, item.heightPt) <= RECT_LINE_THICKNESS_TOLERANCE_PT;
+			const isThinEnoughToBeALine = Math.min(item.widthPt, item.heightPt) <= 3;
 			if (isThinEnoughToBeALine && item.widthPt > item.heightPt) {
 				const midYPt = item.yPt + item.heightPt / 2;
 				segments.push({
@@ -123,7 +123,7 @@ function hasClosedOuterRectangle(rowLines, columnLines) {
 	const rightXPt = columnLines[columnLines.length - 1].position;
 	const topYPt = rowLines[0].position;
 	const bottomYPt = rowLines[rowLines.length - 1].position;
-	return unionCoverageRatio(rowLines[0].ranges, leftXPt, rightXPt) >= EDGE_COVERAGE_RATIO && unionCoverageRatio(rowLines[rowLines.length - 1].ranges, leftXPt, rightXPt) >= EDGE_COVERAGE_RATIO && unionCoverageRatio(columnLines[0].ranges, bottomYPt, topYPt) >= EDGE_COVERAGE_RATIO && unionCoverageRatio(columnLines[columnLines.length - 1].ranges, bottomYPt, topYPt) >= EDGE_COVERAGE_RATIO;
+	return unionCoverageRatio(rowLines[0].ranges, leftXPt, rightXPt) >= .9 && unionCoverageRatio(rowLines[rowLines.length - 1].ranges, leftXPt, rightXPt) >= .9 && unionCoverageRatio(columnLines[0].ranges, bottomYPt, topYPt) >= .9 && unionCoverageRatio(columnLines[columnLines.length - 1].ranges, bottomYPt, topYPt) >= .9;
 }
 function unionFind(size) {
 	return Array.from({ length: size }, (_, i) => i);
@@ -154,7 +154,7 @@ function findCellRegions(rowLines, columnLines) {
 		const rowBottomPt = rowLines[i + 1].position;
 		for (let j = 0; j < colCount - 1; j++) {
 			const divider = columnLines[j + 1];
-			if (unionCoverageRatio(divider.ranges, rowBottomPt, rowTopPt) < EDGE_COVERAGE_RATIO) union(parents, indexOf(i, j), indexOf(i, j + 1));
+			if (unionCoverageRatio(divider.ranges, rowBottomPt, rowTopPt) < .9) union(parents, indexOf(i, j), indexOf(i, j + 1));
 		}
 	}
 	for (let j = 0; j < colCount; j++) {
@@ -162,7 +162,7 @@ function findCellRegions(rowLines, columnLines) {
 		const colRightPt = columnLines[j + 1].position;
 		for (let i = 0; i < rowCount - 1; i++) {
 			const divider = rowLines[i + 1];
-			if (unionCoverageRatio(divider.ranges, colLeftPt, colRightPt) < EDGE_COVERAGE_RATIO) union(parents, indexOf(i, j), indexOf(i + 1, j));
+			if (unionCoverageRatio(divider.ranges, colLeftPt, colRightPt) < .9) union(parents, indexOf(i, j), indexOf(i + 1, j));
 		}
 	}
 	const cellsByRoot = /* @__PURE__ */ new Map();
@@ -220,6 +220,25 @@ function clusterSegments(horizontal, vertical) {
 	}
 	return [...clusters.values()];
 }
+/**
+* Every horizontal rule on the page that its drawn segments cover across its own span, top to bottom.
+* @param items - the page's items; lines, paths and thin rectangles are read as segments, as for a lattice
+* @returns one rule per boundary position, merging collinear segments the way a lattice boundary does, and only those whose segments cover at least EDGE_COVERAGE_RATIO of the span from their leftmost to their rightmost point, so a rule broken at a table's column gutters counts while a row of separate short rules (underlines under a few words) does not
+*/
+function horizontalRules(items) {
+	const horizontal = extractLineCandidates(items).map(classifyAxisLine).filter((segment) => segment?.axis === "horizontal");
+	if (horizontal.length === 0) return [];
+	return dedupeAxisLines(horizontal, true).flatMap((line) => {
+		const leftPt = Math.min(...line.ranges.map((range) => range.startPt));
+		const rightPt = Math.max(...line.ranges.map((range) => range.endPt));
+		return unionCoverageRatio(line.ranges, leftPt, rightPt) >= .9 ? [{
+			position: line.position,
+			leftPt,
+			rightPt,
+			items: line.items
+		}] : [];
+	});
+}
 function detectGridLattice(items) {
 	const horizontal = [];
 	const vertical = [];
@@ -235,7 +254,7 @@ function detectGridLattice(items) {
 		const clusterVertical = cluster.filter((s) => s.axis === "vertical");
 		const rowLines = dedupeAxisLines(clusterHorizontal, true);
 		const columnLines = dedupeAxisLines(clusterVertical, false);
-		if (rowLines.length < MIN_GRIDLINE_COUNT_PER_AXIS || columnLines.length < MIN_GRIDLINE_COUNT_PER_AXIS) continue;
+		if (rowLines.length < 3 || columnLines.length < 3) continue;
 		if (!hasClosedOuterRectangle(rowLines, columnLines)) continue;
 		const regions = findCellRegions(rowLines, columnLines);
 		if (regions === void 0) continue;
@@ -267,8 +286,12 @@ function findColumnIndex(columnBoundariesAscPt, xPt) {
 	return lastIndex - 1;
 }
 //#endregion
+exports.EDGE_COVERAGE_RATIO = EDGE_COVERAGE_RATIO;
+exports.MIN_GRIDLINE_COUNT_PER_AXIS = MIN_GRIDLINE_COUNT_PER_AXIS;
+exports.RECT_LINE_THICKNESS_TOLERANCE_PT = RECT_LINE_THICKNESS_TOLERANCE_PT;
 exports.detectGridLattice = detectGridLattice;
 exports.extractLineCandidates = extractLineCandidates;
 exports.findCellRegions = findCellRegions;
 exports.findColumnIndex = findColumnIndex;
 exports.findRowIndex = findRowIndex;
+exports.horizontalRules = horizontalRules;

package/dist/layout/lattice.d.cts

@@ -1,5 +1,6 @@
 import { LayoutItem } from "pdf-codec";
 //#region src/layout/lattice.d.ts
+declare const RECT_LINE_THICKNESS_TOLERANCE_PT = 3;
 interface LineSegment {
   readonly item: LayoutItem;
   readonly x1Pt: number;
@@ -17,6 +18,8 @@ interface AxisLine {
   readonly ranges: readonly Range[];
   readonly items: readonly LayoutItem[];
 }
+declare const MIN_GRIDLINE_COUNT_PER_AXIS = 3;
+declare const EDGE_COVERAGE_RATIO = 0.9;
 interface TableRegion {
   readonly rowStart: number;
   readonly rowEnd: number;
@@ -30,8 +33,20 @@ interface GridLattice {
   readonly regions: readonly TableRegion[];
   readonly sourceItems: ReadonlySet<LayoutItem>;
 }
+interface HorizontalRule {
+  readonly position: number;
+  readonly leftPt: number;
+  readonly rightPt: number;
+  readonly items: readonly LayoutItem[];
+}
+/**
+ * Every horizontal rule on the page that its drawn segments cover across its own span, top to bottom.
+ * @param items - the page's items; lines, paths and thin rectangles are read as segments, as for a lattice
+ * @returns one rule per boundary position, merging collinear segments the way a lattice boundary does, and only those whose segments cover at least EDGE_COVERAGE_RATIO of the span from their leftmost to their rightmost point, so a rule broken at a table's column gutters counts while a row of separate short rules (underlines under a few words) does not
+ */
+declare function horizontalRules(items: readonly LayoutItem[]): HorizontalRule[];
 declare function detectGridLattice(items: readonly LayoutItem[]): GridLattice | undefined;
 declare function findRowIndex(rowBoundariesDescPt: readonly number[], yPt: number): number | undefined;
 declare function findColumnIndex(columnBoundariesAscPt: readonly number[], xPt: number): number | undefined;
 //#endregion
-export { GridLattice, LineSegment, TableRegion, detectGridLattice, extractLineCandidates, findCellRegions, findColumnIndex, findRowIndex };
+export { EDGE_COVERAGE_RATIO, GridLattice, HorizontalRule, LineSegment, MIN_GRIDLINE_COUNT_PER_AXIS, RECT_LINE_THICKNESS_TOLERANCE_PT, TableRegion, detectGridLattice, extractLineCandidates, findCellRegions, findColumnIndex, findRowIndex, horizontalRules };

package/dist/layout/lattice.d.ts

@@ -1,5 +1,6 @@
 import { LayoutItem } from "pdf-codec";
 //#region src/layout/lattice.d.ts
+declare const RECT_LINE_THICKNESS_TOLERANCE_PT = 3;
 interface LineSegment {
   readonly item: LayoutItem;
   readonly x1Pt: number;
@@ -17,6 +18,8 @@ interface AxisLine {
   readonly ranges: readonly Range[];
   readonly items: readonly LayoutItem[];
 }
+declare const MIN_GRIDLINE_COUNT_PER_AXIS = 3;
+declare const EDGE_COVERAGE_RATIO = 0.9;
 interface TableRegion {
   readonly rowStart: number;
   readonly rowEnd: number;
@@ -30,8 +33,20 @@ interface GridLattice {
   readonly regions: readonly TableRegion[];
   readonly sourceItems: ReadonlySet<LayoutItem>;
 }
+interface HorizontalRule {
+  readonly position: number;
+  readonly leftPt: number;
+  readonly rightPt: number;
+  readonly items: readonly LayoutItem[];
+}
+/**
+ * Every horizontal rule on the page that its drawn segments cover across its own span, top to bottom.
+ * @param items - the page's items; lines, paths and thin rectangles are read as segments, as for a lattice
+ * @returns one rule per boundary position, merging collinear segments the way a lattice boundary does, and only those whose segments cover at least EDGE_COVERAGE_RATIO of the span from their leftmost to their rightmost point, so a rule broken at a table's column gutters counts while a row of separate short rules (underlines under a few words) does not
+ */
+declare function horizontalRules(items: readonly LayoutItem[]): HorizontalRule[];
 declare function detectGridLattice(items: readonly LayoutItem[]): GridLattice | undefined;
 declare function findRowIndex(rowBoundariesDescPt: readonly number[], yPt: number): number | undefined;
 declare function findColumnIndex(columnBoundariesAscPt: readonly number[], xPt: number): number | undefined;
 //#endregion
-export { GridLattice, LineSegment, TableRegion, detectGridLattice, extractLineCandidates, findCellRegions, findColumnIndex, findRowIndex };
+export { EDGE_COVERAGE_RATIO, GridLattice, HorizontalRule, LineSegment, MIN_GRIDLINE_COUNT_PER_AXIS, RECT_LINE_THICKNESS_TOLERANCE_PT, TableRegion, detectGridLattice, extractLineCandidates, findCellRegions, findColumnIndex, findRowIndex, horizontalRules };

package/dist/layout/lattice.js

@@ -28,7 +28,7 @@ function extractLineCandidates(items) {
 			continue;
 		}
 		if (item.kind === "rect") {
-			const isThinEnoughToBeALine = Math.min(item.widthPt, item.heightPt) <= RECT_LINE_THICKNESS_TOLERANCE_PT;
+			const isThinEnoughToBeALine = Math.min(item.widthPt, item.heightPt) <= 3;
 			if (isThinEnoughToBeALine && item.widthPt > item.heightPt) {
 				const midYPt = item.yPt + item.heightPt / 2;
 				segments.push({
@@ -122,7 +122,7 @@ function hasClosedOuterRectangle(rowLines, columnLines) {
 	const rightXPt = columnLines[columnLines.length - 1].position;
 	const topYPt = rowLines[0].position;
 	const bottomYPt = rowLines[rowLines.length - 1].position;
-	return unionCoverageRatio(rowLines[0].ranges, leftXPt, rightXPt) >= EDGE_COVERAGE_RATIO && unionCoverageRatio(rowLines[rowLines.length - 1].ranges, leftXPt, rightXPt) >= EDGE_COVERAGE_RATIO && unionCoverageRatio(columnLines[0].ranges, bottomYPt, topYPt) >= EDGE_COVERAGE_RATIO && unionCoverageRatio(columnLines[columnLines.length - 1].ranges, bottomYPt, topYPt) >= EDGE_COVERAGE_RATIO;
+	return unionCoverageRatio(rowLines[0].ranges, leftXPt, rightXPt) >= .9 && unionCoverageRatio(rowLines[rowLines.length - 1].ranges, leftXPt, rightXPt) >= .9 && unionCoverageRatio(columnLines[0].ranges, bottomYPt, topYPt) >= .9 && unionCoverageRatio(columnLines[columnLines.length - 1].ranges, bottomYPt, topYPt) >= .9;
 }
 function unionFind(size) {
 	return Array.from({ length: size }, (_, i) => i);
@@ -153,7 +153,7 @@ function findCellRegions(rowLines, columnLines) {
 		const rowBottomPt = rowLines[i + 1].position;
 		for (let j = 0; j < colCount - 1; j++) {
 			const divider = columnLines[j + 1];
-			if (unionCoverageRatio(divider.ranges, rowBottomPt, rowTopPt) < EDGE_COVERAGE_RATIO) union(parents, indexOf(i, j), indexOf(i, j + 1));
+			if (unionCoverageRatio(divider.ranges, rowBottomPt, rowTopPt) < .9) union(parents, indexOf(i, j), indexOf(i, j + 1));
 		}
 	}
 	for (let j = 0; j < colCount; j++) {
@@ -161,7 +161,7 @@ function findCellRegions(rowLines, columnLines) {
 		const colRightPt = columnLines[j + 1].position;
 		for (let i = 0; i < rowCount - 1; i++) {
 			const divider = rowLines[i + 1];
-			if (unionCoverageRatio(divider.ranges, colLeftPt, colRightPt) < EDGE_COVERAGE_RATIO) union(parents, indexOf(i, j), indexOf(i + 1, j));
+			if (unionCoverageRatio(divider.ranges, colLeftPt, colRightPt) < .9) union(parents, indexOf(i, j), indexOf(i + 1, j));
 		}
 	}
 	const cellsByRoot = /* @__PURE__ */ new Map();
@@ -219,6 +219,25 @@ function clusterSegments(horizontal, vertical) {
 	}
 	return [...clusters.values()];
 }
+/**
+* Every horizontal rule on the page that its drawn segments cover across its own span, top to bottom.
+* @param items - the page's items; lines, paths and thin rectangles are read as segments, as for a lattice
+* @returns one rule per boundary position, merging collinear segments the way a lattice boundary does, and only those whose segments cover at least EDGE_COVERAGE_RATIO of the span from their leftmost to their rightmost point, so a rule broken at a table's column gutters counts while a row of separate short rules (underlines under a few words) does not
+*/
+function horizontalRules(items) {
+	const horizontal = extractLineCandidates(items).map(classifyAxisLine).filter((segment) => segment?.axis === "horizontal");
+	if (horizontal.length === 0) return [];
+	return dedupeAxisLines(horizontal, true).flatMap((line) => {
+		const leftPt = Math.min(...line.ranges.map((range) => range.startPt));
+		const rightPt = Math.max(...line.ranges.map((range) => range.endPt));
+		return unionCoverageRatio(line.ranges, leftPt, rightPt) >= .9 ? [{
+			position: line.position,
+			leftPt,
+			rightPt,
+			items: line.items
+		}] : [];
+	});
+}
 function detectGridLattice(items) {
 	const horizontal = [];
 	const vertical = [];
@@ -234,7 +253,7 @@ function detectGridLattice(items) {
 		const clusterVertical = cluster.filter((s) => s.axis === "vertical");
 		const rowLines = dedupeAxisLines(clusterHorizontal, true);
 		const columnLines = dedupeAxisLines(clusterVertical, false);
-		if (rowLines.length < MIN_GRIDLINE_COUNT_PER_AXIS || columnLines.length < MIN_GRIDLINE_COUNT_PER_AXIS) continue;
+		if (rowLines.length < 3 || columnLines.length < 3) continue;
 		if (!hasClosedOuterRectangle(rowLines, columnLines)) continue;
 		const regions = findCellRegions(rowLines, columnLines);
 		if (regions === void 0) continue;
@@ -266,4 +285,4 @@ function findColumnIndex(columnBoundariesAscPt, xPt) {
 	return lastIndex - 1;
 }
 //#endregion
-export { detectGridLattice, extractLineCandidates, findCellRegions, findColumnIndex, findRowIndex };
+export { EDGE_COVERAGE_RATIO, MIN_GRIDLINE_COUNT_PER_AXIS, RECT_LINE_THICKNESS_TOLERANCE_PT, detectGridLattice, extractLineCandidates, findCellRegions, findColumnIndex, findRowIndex, horizontalRules };

package/dist/layout/reading-order.cjs

@@ -199,4 +199,6 @@ function firstWordWidthPt(item) {
 }
 //#endregion
 exports.compareReadingPosition = compareReadingPosition;
+exports.isRunningProse = isRunningProse;
 exports.readingOrder = readingOrder;
+exports.spaceAdvancePt = spaceAdvancePt;

package/dist/layout/reading-order.d.cts

@@ -36,5 +36,7 @@ declare function compareReadingPosition(a: {
   readonly path: readonly number[];
   readonly yPt: number;
 }): number;
+declare function spaceAdvancePt(item: LayoutText): number;
+declare function isRunningProse(items: readonly LayoutText[], gutterWidthPt: number): boolean;
 //#endregion
-export { ReadingOrder, ReadingRegion, compareReadingPosition, readingOrder };
+export { ReadingOrder, ReadingRegion, compareReadingPosition, isRunningProse, readingOrder, spaceAdvancePt };

package/dist/layout/reading-order.d.ts

@@ -36,5 +36,7 @@ declare function compareReadingPosition(a: {
   readonly path: readonly number[];
   readonly yPt: number;
 }): number;
+declare function spaceAdvancePt(item: LayoutText): number;
+declare function isRunningProse(items: readonly LayoutText[], gutterWidthPt: number): boolean;
 //#endregion
-export { ReadingOrder, ReadingRegion, compareReadingPosition, readingOrder };
+export { ReadingOrder, ReadingRegion, compareReadingPosition, isRunningProse, readingOrder, spaceAdvancePt };

package/dist/layout/reading-order.js

@@ -197,4 +197,4 @@ function firstWordWidthPt(item) {
 	return text.length === 0 ? 0 : (item.widthPt ?? 0) * firstWord.length / item.text.length;
 }
 //#endregion
-export { compareReadingPosition, readingOrder };
+export { compareReadingPosition, isRunningProse, readingOrder, spaceAdvancePt };

package/dist/layout/reconstruct-presentations-prod.cjs

@@ -1,5 +1,5 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_reconstruct_presentations_prod = require("../reconstruct-presentations-prod-CsvGlvP2.cjs");
+const require_reconstruct_presentations_prod = require("../reconstruct-presentations-prod-DtpKKgRY.cjs");
 exports.layoutItemToVector = require_reconstruct_presentations_prod.layoutItemToVector;
 exports.lineToParagraph = require_reconstruct_presentations_prod.lineToParagraph;
 exports.reconstructDrawing = require_reconstruct_presentations_prod.reconstructDrawing;

package/dist/layout/reconstruct-presentations-prod.js

@@ -1,2 +1,2 @@
-import { a as reconstructSheet, i as reconstructPresentation, n as lineToParagraph, o as recoverPageVectors, r as reconstructDrawing, s as splitLineByLargeGaps, t as layoutItemToVector } from "../reconstruct-presentations-prod-D1KbGPxa.js";
+import { a as reconstructSheet, i as reconstructPresentation, n as lineToParagraph, o as recoverPageVectors, r as reconstructDrawing, s as splitLineByLargeGaps, t as layoutItemToVector } from "../reconstruct-presentations-prod-DV7UQqMT.js";
 export { layoutItemToVector, lineToParagraph, reconstructDrawing, reconstructPresentation, reconstructSheet, recoverPageVectors, splitLineByLargeGaps };

package/dist/layout/reconstruct-tables.cjs

@@ -1,5 +1,5 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_reconstruct_presentations_prod = require("../reconstruct-presentations-prod-CsvGlvP2.cjs");
+const require_reconstruct_presentations_prod = require("../reconstruct-presentations-prod-DtpKKgRY.cjs");
 exports.buildGridFromLattice = require_reconstruct_presentations_prod.buildGridFromLattice;
 exports.buildGridFromTextClustering = require_reconstruct_presentations_prod.buildGridFromTextClustering;
 exports.recoverTables = require_reconstruct_presentations_prod.recoverTables;

package/dist/layout/reconstruct-tables.js

@@ -1,2 +1,2 @@
-import { b as recoverTables, v as buildGridFromLattice, y as buildGridFromTextClustering } from "../reconstruct-presentations-prod-D1KbGPxa.js";
+import { b as recoverTables, v as buildGridFromLattice, y as buildGridFromTextClustering } from "../reconstruct-presentations-prod-DV7UQqMT.js";
 export { buildGridFromLattice, buildGridFromTextClustering, recoverTables };

package/dist/layout/reconstruct.cjs

@@ -1,5 +1,5 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_reconstruct_presentations_prod = require("../reconstruct-presentations-prod-CsvGlvP2.cjs");
+const require_reconstruct_presentations_prod = require("../reconstruct-presentations-prod-DtpKKgRY.cjs");
 exports.CELL_TYPES = require_reconstruct_presentations_prod.CELL_TYPES;
 exports.DEFAULT_COLUMN_WIDTH_FALLBACK_PT = require_reconstruct_presentations_prod.DEFAULT_COLUMN_WIDTH_FALLBACK_PT;
 exports.NO_ITEMS = require_reconstruct_presentations_prod.NO_ITEMS;

package/dist/layout/reconstruct.js

@@ -1,2 +1,2 @@
-import { _ as reconstructWordprocessing, c as CELL_TYPES, d as ROW_TYPES, f as TABLE_TYPES, g as reconstructSpreadsheet, h as nearestOfType, l as DEFAULT_COLUMN_WIDTH_FALLBACK_PT, m as indexStructure, p as ZERO_MARGINS, u as NO_ITEMS } from "../reconstruct-presentations-prod-D1KbGPxa.js";
+import { _ as reconstructWordprocessing, c as CELL_TYPES, d as ROW_TYPES, f as TABLE_TYPES, g as reconstructSpreadsheet, h as nearestOfType, l as DEFAULT_COLUMN_WIDTH_FALLBACK_PT, m as indexStructure, p as ZERO_MARGINS, u as NO_ITEMS } from "../reconstruct-presentations-prod-DV7UQqMT.js";
 export { CELL_TYPES, DEFAULT_COLUMN_WIDTH_FALLBACK_PT, NO_ITEMS, ROW_TYPES, TABLE_TYPES, ZERO_MARGINS, indexStructure, nearestOfType, reconstructSpreadsheet, reconstructWordprocessing };

package/dist/layout/ruled-rows.cjs

@@ -0,0 +1,214 @@
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const require_layout_reconstruct_lines = require("./reconstruct-lines.cjs");
+const require_layout_lattice = require("./lattice.cjs");
+const require_layout_reading_order = require("./reading-order.cjs");
+//#region src/layout/ruled-rows.ts
+/**
+* The grid of a table ruled between its rows and set apart by gutters between its columns, when the page holds one.
+* @param items - the page's items; rules are read from its lines, paths and thin rectangles, and text from its text items
+* @returns a lattice whose row boundaries are the rules (and the top of an unruled heading row above them) and whose column boundaries are the table's two ends and the middle of each gutter, a row that crosses a gutter spanning the columns it covers; undefined when no set of rules of one span holds two rows of text, fewer than two rows hold text in more than one place, the rows leave no gutter they all share, or every column reads as running prose
+*/
+function detectRuledRowLattice(items) {
+	const rules = rulesOfOneTable(items);
+	if (rules === void 0) return;
+	const text = items.filter((item) => item.kind === "text" && item.text.trim().length > 0 && item.xPt >= rules.leftPt && item.xPt < rules.rightPt);
+	if (text.some((item) => item.widthPt === void 0 || item.writingMode !== void 0 || (item.rotationDeg ?? 0) !== 0)) return;
+	const ruledRows = rules.positionsDescPt.slice(1).map((lowerPt, row) => text.filter((item) => item.yPt > lowerPt && item.yPt < rules.positionsDescPt[row]));
+	const widestSpacePt = Math.max(...ruledRows.flat().map(require_layout_reading_order.spaceAdvancePt));
+	const shared = sharedGutters(ruledRows, widestSpacePt);
+	if (shared === void 0) return;
+	const { gutters } = shared;
+	const dividersPt = gutters.map((gutter) => (gutter.loPt + gutter.hiPt) / 2);
+	const topRulePt = rules.positionsDescPt[0];
+	const heading = headingRow(text.filter((item) => item.yPt > topRulePt), topRulePt, dividersPt, require_layout_reconstruct_lines.clusterIntoLines(ruledRows.flat()), widestSpacePt);
+	const rows = heading === void 0 ? ruledRows : [heading.items, ...ruledRows];
+	if (shared.rowsWithColumns + (heading !== void 0 && textRuns(heading.items, widestSpacePt).length > 1 ? 1 : 0) < 2) return;
+	const columnBoundariesAscPt = [
+		rules.leftPt,
+		...dividersPt,
+		rules.rightPt
+	];
+	if (holdsDrawing(items, rules, heading?.topPt ?? rules.positionsDescPt[0])) return;
+	const narrowestGutterPt = Math.min(...gutters.map((gutter) => gutter.hiPt - gutter.loPt));
+	if (columnBoundariesAscPt.slice(1).map((rightPt, column) => rows.flat().filter((item) => item.xPt >= columnBoundariesAscPt[column] && item.xPt < rightPt)).every((column) => require_layout_reading_order.isRunningProse(column, narrowestGutterPt))) return;
+	const bands = [...heading === void 0 ? [] : [heading], ...ruledRows.map((rowItems, row) => ({
+		items: rowItems,
+		topPt: rules.positionsDescPt[row]
+	}))].flatMap((band) => rowsOfBand(band.items, band.topPt, dividersPt, widestSpacePt));
+	return {
+		rowBoundariesDescPt: [...bands.map((band) => band.topPt), rules.positionsDescPt.at(-1)],
+		columnBoundariesAscPt,
+		regions: bands.flatMap((band, rowIndex) => rowRegions(band.items, rowIndex, dividersPt, widestSpacePt)),
+		sourceItems: rules.sourceItems
+	};
+}
+function rulesOfOneTable(items) {
+	const groups = [];
+	for (const rule of require_layout_lattice.horizontalRules(items)) {
+		const group = groups.find((members) => members.every((member) => spansOverlap(member, rule)));
+		if (group === void 0) groups.push([rule]);
+		else group.push(rule);
+	}
+	const best = groups.filter((members) => members.length >= 3).map((members) => ({
+		members,
+		leftPt: Math.min(...members.map((rule) => rule.leftPt)),
+		rightPt: Math.max(...members.map((rule) => rule.rightPt))
+	})).sort((a, b) => b.members.length - a.members.length || b.rightPt - b.leftPt - (a.rightPt - a.leftPt))[0];
+	if (best === void 0) return;
+	return {
+		positionsDescPt: best.members.map((rule) => rule.position).sort((a, b) => b - a),
+		leftPt: best.leftPt,
+		rightPt: best.rightPt,
+		sourceItems: new Set(best.members.flatMap((rule) => rule.items))
+	};
+}
+function holdsDrawing(items, rules, topPt) {
+	const bottomPt = rules.positionsDescPt.at(-1);
+	const widthPt = rules.rightPt - rules.leftPt;
+	const inside = (box) => box.loXPt < rules.rightPt - 3 && box.hiXPt > rules.leftPt + 3 && box.loYPt < topPt && box.hiYPt > bottomPt;
+	const spansRow = (box) => box.hiXPt - box.loXPt >= require_layout_lattice.EDGE_COVERAGE_RATIO * widthPt;
+	const horizontal = (box) => box.hiYPt - box.loYPt <= 3 && box.hiXPt - box.loXPt > box.hiYPt - box.loYPt;
+	return items.some((item) => {
+		if (rules.sourceItems.has(item)) return false;
+		const box = boxOf(item);
+		return box !== void 0 && inside(box) && !horizontal(box) && !(item.kind !== "image" && item.kind !== "ellipse" && spansRow(box));
+	});
+}
+function boxOf(item) {
+	switch (item.kind) {
+		case "image":
+		case "rect":
+		case "ellipse": return {
+			loXPt: item.xPt,
+			hiXPt: item.xPt + item.widthPt,
+			loYPt: item.yPt,
+			hiYPt: item.yPt + item.heightPt
+		};
+		case "line": return {
+			loXPt: Math.min(item.x1Pt, item.x2Pt),
+			hiXPt: Math.max(item.x1Pt, item.x2Pt),
+			loYPt: Math.min(item.y1Pt, item.y2Pt),
+			hiYPt: Math.max(item.y1Pt, item.y2Pt)
+		};
+		case "path": {
+			const xs = item.subpaths.flatMap((subpath) => [subpath.startXPt, ...subpath.segments.flatMap((segment) => segment.kind === "cubic" ? [
+				segment.c1xPt,
+				segment.c2xPt,
+				segment.xPt
+			] : [segment.xPt])]);
+			const ys = item.subpaths.flatMap((subpath) => [subpath.startYPt, ...subpath.segments.flatMap((segment) => segment.kind === "cubic" ? [
+				segment.c1yPt,
+				segment.c2yPt,
+				segment.yPt
+			] : [segment.yPt])]);
+			return {
+				loXPt: Math.min(...xs),
+				hiXPt: Math.max(...xs),
+				loYPt: Math.min(...ys),
+				hiYPt: Math.max(...ys)
+			};
+		}
+		case "text":
+		case "link":
+		case "internalLink": return;
+	}
+}
+function spansOverlap(a, b) {
+	const overlapPt = Math.min(a.rightPt, b.rightPt) - Math.max(a.leftPt, b.leftPt);
+	const unionPt = Math.max(a.rightPt, b.rightPt) - Math.min(a.leftPt, b.leftPt);
+	return overlapPt >= require_layout_lattice.EDGE_COVERAGE_RATIO * unionPt;
+}
+function textRuns(row, widestSpacePt) {
+	const runs = [];
+	for (const item of [...row].sort((a, b) => a.xPt - b.xPt)) {
+		const last = runs.at(-1);
+		if (last !== void 0 && item.xPt - last.hiPt <= widestSpacePt) last.hiPt = Math.max(last.hiPt, rightEdge(item));
+		else runs.push({
+			loPt: item.xPt,
+			hiPt: rightEdge(item)
+		});
+	}
+	return runs;
+}
+function sharedGutters(rows, widestSpacePt) {
+	const gapsByRow = rows.map((row) => textRuns(row, widestSpacePt)).filter((runs) => runs.length > 1).map((runs) => runs.slice(1).map((run, index) => ({
+		loPt: runs[index].hiPt,
+		hiPt: run.loPt
+	})));
+	const [first, ...rest] = gapsByRow;
+	if (first === void 0) return;
+	const gutters = rest.reduce((shared, gaps) => shared.flatMap((gutter) => gaps.flatMap((gap) => {
+		const loPt = Math.max(gutter.loPt, gap.loPt);
+		const hiPt = Math.min(gutter.hiPt, gap.hiPt);
+		return hiPt - loPt > widestSpacePt ? [{
+			loPt,
+			hiPt
+		}] : [];
+	})), first);
+	return gutters.length > 0 ? {
+		gutters,
+		rowsWithColumns: gapsByRow.length
+	} : void 0;
+}
+function headingRow(above, topRulePt, dividersPt, tableLines, widestSpacePt) {
+	const reachPt = require_layout_reconstruct_lines.PARAGRAPH_GAP_MULTIPLIER * require_layout_reconstruct_lines.estimateModalLineSpacing(tableLines);
+	const items = [];
+	let lowerPt = topRulePt;
+	for (const line of [...require_layout_reconstruct_lines.clusterIntoLines(above)].reverse()) {
+		if (line.items.some((item) => dividersPt.some((dividerPt) => item.xPt < dividerPt && rightEdge(item) > dividerPt)) || line.baselineY - lowerPt > reachPt) break;
+		items.push(...line.items);
+		lowerPt = line.baselineY;
+	}
+	if (columnsHolding(items, dividersPt, widestSpacePt).size < 2) return;
+	return {
+		items,
+		topPt: Math.max(...items.map((item) => item.yPt + item.sizePt))
+	};
+}
+function columnsHolding(items, dividersPt, widestSpacePt) {
+	return new Set(textRuns(items, widestSpacePt).map((run) => dividersPt.filter((dividerPt) => dividerPt <= run.loPt).length));
+}
+function rowsOfBand(items, topPt, dividersPt, widestSpacePt) {
+	const lines = require_layout_reconstruct_lines.clusterIntoLines(items);
+	const first = lines[0];
+	const opening = first === void 0 ? /* @__PURE__ */ new Set() : columnsHolding(first.items, dividersPt, widestSpacePt);
+	if (!(lines.length > 1 && opening.size > 1 && lines.every((line) => {
+		const occupied = columnsHolding(line.items, dividersPt, widestSpacePt);
+		return [...opening].every((column) => occupied.has(column));
+	}))) return [{
+		items: [...items],
+		topPt
+	}];
+	return lines.map((line, index) => ({
+		items: [...line.items],
+		topPt: index === 0 ? topPt : (lines[index - 1].baselineY + line.baselineY) / 2
+	}));
+}
+function rowRegions(row, rowIndex, dividersPt, widestSpacePt) {
+	const runs = textRuns(row, widestSpacePt);
+	const regions = [];
+	let colStart = 0;
+	dividersPt.forEach((dividerPt, index) => {
+		if (!runs.some((run) => run.loPt < dividerPt && run.hiPt > dividerPt)) {
+			regions.push({
+				rowStart: rowIndex,
+				rowEnd: rowIndex + 1,
+				colStart,
+				colEnd: index + 1
+			});
+			colStart = index + 1;
+		}
+	});
+	regions.push({
+		rowStart: rowIndex,
+		rowEnd: rowIndex + 1,
+		colStart,
+		colEnd: dividersPt.length + 1
+	});
+	return regions;
+}
+function rightEdge(item) {
+	return item.xPt + (item.widthPt ?? 0);
+}
+//#endregion
+exports.detectRuledRowLattice = detectRuledRowLattice;

package/dist/layout/ruled-rows.d.cts

@@ -0,0 +1,11 @@
+import { GridLattice } from "./lattice.cjs";
+import { LayoutItem } from "pdf-codec";
+//#region src/layout/ruled-rows.d.ts
+/**
+ * The grid of a table ruled between its rows and set apart by gutters between its columns, when the page holds one.
+ * @param items - the page's items; rules are read from its lines, paths and thin rectangles, and text from its text items
+ * @returns a lattice whose row boundaries are the rules (and the top of an unruled heading row above them) and whose column boundaries are the table's two ends and the middle of each gutter, a row that crosses a gutter spanning the columns it covers; undefined when no set of rules of one span holds two rows of text, fewer than two rows hold text in more than one place, the rows leave no gutter they all share, or every column reads as running prose
+ */
+declare function detectRuledRowLattice(items: readonly LayoutItem[]): GridLattice | undefined;
+//#endregion
+export { detectRuledRowLattice };

package/dist/layout/ruled-rows.d.ts

@@ -0,0 +1,11 @@
+import { GridLattice } from "./lattice.js";
+import { LayoutItem } from "pdf-codec";
+//#region src/layout/ruled-rows.d.ts
+/**
+ * The grid of a table ruled between its rows and set apart by gutters between its columns, when the page holds one.
+ * @param items - the page's items; rules are read from its lines, paths and thin rectangles, and text from its text items
+ * @returns a lattice whose row boundaries are the rules (and the top of an unruled heading row above them) and whose column boundaries are the table's two ends and the middle of each gutter, a row that crosses a gutter spanning the columns it covers; undefined when no set of rules of one span holds two rows of text, fewer than two rows hold text in more than one place, the rows leave no gutter they all share, or every column reads as running prose
+ */
+declare function detectRuledRowLattice(items: readonly LayoutItem[]): GridLattice | undefined;
+//#endregion
+export { detectRuledRowLattice };

package/dist/layout/ruled-rows.js

@@ -0,0 +1,213 @@
+import { PARAGRAPH_GAP_MULTIPLIER, clusterIntoLines, estimateModalLineSpacing } from "./reconstruct-lines.js";
+import { EDGE_COVERAGE_RATIO, horizontalRules } from "./lattice.js";
+import { isRunningProse, spaceAdvancePt } from "./reading-order.js";
+//#region src/layout/ruled-rows.ts
+/**
+* The grid of a table ruled between its rows and set apart by gutters between its columns, when the page holds one.
+* @param items - the page's items; rules are read from its lines, paths and thin rectangles, and text from its text items
+* @returns a lattice whose row boundaries are the rules (and the top of an unruled heading row above them) and whose column boundaries are the table's two ends and the middle of each gutter, a row that crosses a gutter spanning the columns it covers; undefined when no set of rules of one span holds two rows of text, fewer than two rows hold text in more than one place, the rows leave no gutter they all share, or every column reads as running prose
+*/
+function detectRuledRowLattice(items) {
+	const rules = rulesOfOneTable(items);
+	if (rules === void 0) return;
+	const text = items.filter((item) => item.kind === "text" && item.text.trim().length > 0 && item.xPt >= rules.leftPt && item.xPt < rules.rightPt);
+	if (text.some((item) => item.widthPt === void 0 || item.writingMode !== void 0 || (item.rotationDeg ?? 0) !== 0)) return;
+	const ruledRows = rules.positionsDescPt.slice(1).map((lowerPt, row) => text.filter((item) => item.yPt > lowerPt && item.yPt < rules.positionsDescPt[row]));
+	const widestSpacePt = Math.max(...ruledRows.flat().map(spaceAdvancePt));
+	const shared = sharedGutters(ruledRows, widestSpacePt);
+	if (shared === void 0) return;
+	const { gutters } = shared;
+	const dividersPt = gutters.map((gutter) => (gutter.loPt + gutter.hiPt) / 2);
+	const topRulePt = rules.positionsDescPt[0];
+	const heading = headingRow(text.filter((item) => item.yPt > topRulePt), topRulePt, dividersPt, clusterIntoLines(ruledRows.flat()), widestSpacePt);
+	const rows = heading === void 0 ? ruledRows : [heading.items, ...ruledRows];
+	if (shared.rowsWithColumns + (heading !== void 0 && textRuns(heading.items, widestSpacePt).length > 1 ? 1 : 0) < 2) return;
+	const columnBoundariesAscPt = [
+		rules.leftPt,
+		...dividersPt,
+		rules.rightPt
+	];
+	if (holdsDrawing(items, rules, heading?.topPt ?? rules.positionsDescPt[0])) return;
+	const narrowestGutterPt = Math.min(...gutters.map((gutter) => gutter.hiPt - gutter.loPt));
+	if (columnBoundariesAscPt.slice(1).map((rightPt, column) => rows.flat().filter((item) => item.xPt >= columnBoundariesAscPt[column] && item.xPt < rightPt)).every((column) => isRunningProse(column, narrowestGutterPt))) return;
+	const bands = [...heading === void 0 ? [] : [heading], ...ruledRows.map((rowItems, row) => ({
+		items: rowItems,
+		topPt: rules.positionsDescPt[row]
+	}))].flatMap((band) => rowsOfBand(band.items, band.topPt, dividersPt, widestSpacePt));
+	return {
+		rowBoundariesDescPt: [...bands.map((band) => band.topPt), rules.positionsDescPt.at(-1)],
+		columnBoundariesAscPt,
+		regions: bands.flatMap((band, rowIndex) => rowRegions(band.items, rowIndex, dividersPt, widestSpacePt)),
+		sourceItems: rules.sourceItems
+	};
+}
+function rulesOfOneTable(items) {
+	const groups = [];
+	for (const rule of horizontalRules(items)) {
+		const group = groups.find((members) => members.every((member) => spansOverlap(member, rule)));
+		if (group === void 0) groups.push([rule]);
+		else group.push(rule);
+	}
+	const best = groups.filter((members) => members.length >= 3).map((members) => ({
+		members,
+		leftPt: Math.min(...members.map((rule) => rule.leftPt)),
+		rightPt: Math.max(...members.map((rule) => rule.rightPt))
+	})).sort((a, b) => b.members.length - a.members.length || b.rightPt - b.leftPt - (a.rightPt - a.leftPt))[0];
+	if (best === void 0) return;
+	return {
+		positionsDescPt: best.members.map((rule) => rule.position).sort((a, b) => b - a),
+		leftPt: best.leftPt,
+		rightPt: best.rightPt,
+		sourceItems: new Set(best.members.flatMap((rule) => rule.items))
+	};
+}
+function holdsDrawing(items, rules, topPt) {
+	const bottomPt = rules.positionsDescPt.at(-1);
+	const widthPt = rules.rightPt - rules.leftPt;
+	const inside = (box) => box.loXPt < rules.rightPt - 3 && box.hiXPt > rules.leftPt + 3 && box.loYPt < topPt && box.hiYPt > bottomPt;
+	const spansRow = (box) => box.hiXPt - box.loXPt >= EDGE_COVERAGE_RATIO * widthPt;
+	const horizontal = (box) => box.hiYPt - box.loYPt <= 3 && box.hiXPt - box.loXPt > box.hiYPt - box.loYPt;
+	return items.some((item) => {
+		if (rules.sourceItems.has(item)) return false;
+		const box = boxOf(item);
+		return box !== void 0 && inside(box) && !horizontal(box) && !(item.kind !== "image" && item.kind !== "ellipse" && spansRow(box));
+	});
+}
+function boxOf(item) {
+	switch (item.kind) {
+		case "image":
+		case "rect":
+		case "ellipse": return {
+			loXPt: item.xPt,
+			hiXPt: item.xPt + item.widthPt,
+			loYPt: item.yPt,
+			hiYPt: item.yPt + item.heightPt
+		};
+		case "line": return {
+			loXPt: Math.min(item.x1Pt, item.x2Pt),
+			hiXPt: Math.max(item.x1Pt, item.x2Pt),
+			loYPt: Math.min(item.y1Pt, item.y2Pt),
+			hiYPt: Math.max(item.y1Pt, item.y2Pt)
+		};
+		case "path": {
+			const xs = item.subpaths.flatMap((subpath) => [subpath.startXPt, ...subpath.segments.flatMap((segment) => segment.kind === "cubic" ? [
+				segment.c1xPt,
+				segment.c2xPt,
+				segment.xPt
+			] : [segment.xPt])]);
+			const ys = item.subpaths.flatMap((subpath) => [subpath.startYPt, ...subpath.segments.flatMap((segment) => segment.kind === "cubic" ? [
+				segment.c1yPt,
+				segment.c2yPt,
+				segment.yPt
+			] : [segment.yPt])]);
+			return {
+				loXPt: Math.min(...xs),
+				hiXPt: Math.max(...xs),
+				loYPt: Math.min(...ys),
+				hiYPt: Math.max(...ys)
+			};
+		}
+		case "text":
+		case "link":
+		case "internalLink": return;
+	}
+}
+function spansOverlap(a, b) {
+	const overlapPt = Math.min(a.rightPt, b.rightPt) - Math.max(a.leftPt, b.leftPt);
+	const unionPt = Math.max(a.rightPt, b.rightPt) - Math.min(a.leftPt, b.leftPt);
+	return overlapPt >= EDGE_COVERAGE_RATIO * unionPt;
+}
+function textRuns(row, widestSpacePt) {
+	const runs = [];
+	for (const item of [...row].sort((a, b) => a.xPt - b.xPt)) {
+		const last = runs.at(-1);
+		if (last !== void 0 && item.xPt - last.hiPt <= widestSpacePt) last.hiPt = Math.max(last.hiPt, rightEdge(item));
+		else runs.push({
+			loPt: item.xPt,
+			hiPt: rightEdge(item)
+		});
+	}
+	return runs;
+}
+function sharedGutters(rows, widestSpacePt) {
+	const gapsByRow = rows.map((row) => textRuns(row, widestSpacePt)).filter((runs) => runs.length > 1).map((runs) => runs.slice(1).map((run, index) => ({
+		loPt: runs[index].hiPt,
+		hiPt: run.loPt
+	})));
+	const [first, ...rest] = gapsByRow;
+	if (first === void 0) return;
+	const gutters = rest.reduce((shared, gaps) => shared.flatMap((gutter) => gaps.flatMap((gap) => {
+		const loPt = Math.max(gutter.loPt, gap.loPt);
+		const hiPt = Math.min(gutter.hiPt, gap.hiPt);
+		return hiPt - loPt > widestSpacePt ? [{
+			loPt,
+			hiPt
+		}] : [];
+	})), first);
+	return gutters.length > 0 ? {
+		gutters,
+		rowsWithColumns: gapsByRow.length
+	} : void 0;
+}
+function headingRow(above, topRulePt, dividersPt, tableLines, widestSpacePt) {
+	const reachPt = PARAGRAPH_GAP_MULTIPLIER * estimateModalLineSpacing(tableLines);
+	const items = [];
+	let lowerPt = topRulePt;
+	for (const line of [...clusterIntoLines(above)].reverse()) {
+		if (line.items.some((item) => dividersPt.some((dividerPt) => item.xPt < dividerPt && rightEdge(item) > dividerPt)) || line.baselineY - lowerPt > reachPt) break;
+		items.push(...line.items);
+		lowerPt = line.baselineY;
+	}
+	if (columnsHolding(items, dividersPt, widestSpacePt).size < 2) return;
+	return {
+		items,
+		topPt: Math.max(...items.map((item) => item.yPt + item.sizePt))
+	};
+}
+function columnsHolding(items, dividersPt, widestSpacePt) {
+	return new Set(textRuns(items, widestSpacePt).map((run) => dividersPt.filter((dividerPt) => dividerPt <= run.loPt).length));
+}
+function rowsOfBand(items, topPt, dividersPt, widestSpacePt) {
+	const lines = clusterIntoLines(items);
+	const first = lines[0];
+	const opening = first === void 0 ? /* @__PURE__ */ new Set() : columnsHolding(first.items, dividersPt, widestSpacePt);
+	if (!(lines.length > 1 && opening.size > 1 && lines.every((line) => {
+		const occupied = columnsHolding(line.items, dividersPt, widestSpacePt);
+		return [...opening].every((column) => occupied.has(column));
+	}))) return [{
+		items: [...items],
+		topPt
+	}];
+	return lines.map((line, index) => ({
+		items: [...line.items],
+		topPt: index === 0 ? topPt : (lines[index - 1].baselineY + line.baselineY) / 2
+	}));
+}
+function rowRegions(row, rowIndex, dividersPt, widestSpacePt) {
+	const runs = textRuns(row, widestSpacePt);
+	const regions = [];
+	let colStart = 0;
+	dividersPt.forEach((dividerPt, index) => {
+		if (!runs.some((run) => run.loPt < dividerPt && run.hiPt > dividerPt)) {
+			regions.push({
+				rowStart: rowIndex,
+				rowEnd: rowIndex + 1,
+				colStart,
+				colEnd: index + 1
+			});
+			colStart = index + 1;
+		}
+	});
+	regions.push({
+		rowStart: rowIndex,
+		rowEnd: rowIndex + 1,
+		colStart,
+		colEnd: dividersPt.length + 1
+	});
+	return regions;
+}
+function rightEdge(item) {
+	return item.xPt + (item.widthPt ?? 0);
+}
+//#endregion
+export { detectRuledRowLattice };

package/dist/{reconstruct-presentations-prod-D1KbGPxa.js → reconstruct-presentations-prod-DV7UQqMT.js}

@@ -6,6 +6,7 @@ import { throwIfAborted } from "./ports/abort.js";
 import { HALF_POINT_BUCKET_PT, bucketCounts, clusterIntoLines, clusterIntoParagraphs, estimateModalLineSpacing, fontSizesClose, gapExceeds, lineBox, modeOf, paragraphToContentParagraph, pushRunsForLine, textBoxOfItem, textItemToContentRun, textItemVerticalExtent } from "./layout/reconstruct-lines.js";
 import { detectGridLattice, findColumnIndex, findRowIndex } from "./layout/lattice.js";
 import { compareReadingPosition, readingOrder } from "./layout/reading-order.js";
+import { detectRuledRowLattice } from "./layout/ruled-rows.js";
 import { denseTableRows } from "document-schema.js";
 import { sourcePageIndex } from "pdf-codec/layout";
 //#region src/layout/reconstruct-tables.ts
@@ -14,8 +15,23 @@ function recoverTables(page, pageIndex, structure) {
 		const tagged = recoverTaggedTables(page, pageIndex, structure);
 		if (tagged.length > 0) return tagged;
 	}
-	const lattice = recoverTable(page, pageIndex);
-	return lattice === void 0 ? [] : [lattice];
+	const grid = detectGridLattice(page.items);
+	const gridItems = grid?.sourceItems ?? NO_ITEMS;
+	return [grid, detectRuledRowLattice(page.items.filter((item) => !gridItems.has(item)))].filter((lattice) => lattice !== void 0).filter((lattice, index, lattices) => index === 0 || !latticesOverlap(lattices[0], lattice)).flatMap((lattice) => {
+		const table = recoverTable(page, pageIndex, lattice);
+		return table === void 0 ? [] : [table];
+	});
+}
+function latticesOverlap(a, b) {
+	const aLeft = a.columnBoundariesAscPt[0];
+	const aRight = a.columnBoundariesAscPt.at(-1);
+	const aTop = a.rowBoundariesDescPt[0];
+	const aBottom = a.rowBoundariesDescPt.at(-1);
+	const bLeft = b.columnBoundariesAscPt[0];
+	const bRight = b.columnBoundariesAscPt.at(-1);
+	const bTop = b.rowBoundariesDescPt[0];
+	const bBottom = b.rowBoundariesDescPt.at(-1);
+	return aLeft < bRight && bLeft < aRight && aBottom < bTop && bBottom < aTop;
 }
 function recoverTaggedTables(page, pageIndex, structure) {
 	const cellsByTable = /* @__PURE__ */ new Map();
@@ -126,9 +142,7 @@ function indexRegions(lattice, rowCount, columnCount) {
 	for (const region of lattice.regions) for (let i = region.rowStart; i < region.rowEnd; i++) for (let j = region.colStart; j < region.colEnd; j++) regionAt[i][j] = region;
 	return regionAt;
 }
-function recoverTable(page, pageIndex) {
-	const lattice = detectGridLattice(page.items);
-	if (lattice === void 0) return;
+function recoverTable(page, pageIndex, lattice) {
 	const rowCount = lattice.rowBoundariesDescPt.length - 1;
 	const columnCount = lattice.columnBoundariesAscPt.length - 1;
 	const regionAt = indexRegions(lattice, rowCount, columnCount);

package/dist/{reconstruct-presentations-prod-CsvGlvP2.cjs → reconstruct-presentations-prod-DtpKKgRY.cjs}

@@ -6,6 +6,7 @@ const require_ports_abort = require("./ports/abort.cjs");
 const require_layout_reconstruct_lines = require("./layout/reconstruct-lines.cjs");
 const require_layout_lattice = require("./layout/lattice.cjs");
 const require_layout_reading_order = require("./layout/reading-order.cjs");
+const require_layout_ruled_rows = require("./layout/ruled-rows.cjs");
 let document_schema_js = require("document-schema.js");
 let pdf_codec_layout = require("pdf-codec/layout");
 //#region src/layout/reconstruct-tables.ts
@@ -14,8 +15,23 @@ function recoverTables(page, pageIndex, structure) {
 		const tagged = recoverTaggedTables(page, pageIndex, structure);
 		if (tagged.length > 0) return tagged;
 	}
-	const lattice = recoverTable(page, pageIndex);
-	return lattice === void 0 ? [] : [lattice];
+	const grid = require_layout_lattice.detectGridLattice(page.items);
+	const gridItems = grid?.sourceItems ?? NO_ITEMS;
+	return [grid, require_layout_ruled_rows.detectRuledRowLattice(page.items.filter((item) => !gridItems.has(item)))].filter((lattice) => lattice !== void 0).filter((lattice, index, lattices) => index === 0 || !latticesOverlap(lattices[0], lattice)).flatMap((lattice) => {
+		const table = recoverTable(page, pageIndex, lattice);
+		return table === void 0 ? [] : [table];
+	});
+}
+function latticesOverlap(a, b) {
+	const aLeft = a.columnBoundariesAscPt[0];
+	const aRight = a.columnBoundariesAscPt.at(-1);
+	const aTop = a.rowBoundariesDescPt[0];
+	const aBottom = a.rowBoundariesDescPt.at(-1);
+	const bLeft = b.columnBoundariesAscPt[0];
+	const bRight = b.columnBoundariesAscPt.at(-1);
+	const bTop = b.rowBoundariesDescPt[0];
+	const bBottom = b.rowBoundariesDescPt.at(-1);
+	return aLeft < bRight && bLeft < aRight && aBottom < bTop && bBottom < aTop;
 }
 function recoverTaggedTables(page, pageIndex, structure) {
 	const cellsByTable = /* @__PURE__ */ new Map();
@@ -126,9 +142,7 @@ function indexRegions(lattice, rowCount, columnCount) {
 	for (const region of lattice.regions) for (let i = region.rowStart; i < region.rowEnd; i++) for (let j = region.colStart; j < region.colEnd; j++) regionAt[i][j] = region;
 	return regionAt;
 }
-function recoverTable(page, pageIndex) {
-	const lattice = require_layout_lattice.detectGridLattice(page.items);
-	if (lattice === void 0) return;
+function recoverTable(page, pageIndex, lattice) {
 	const rowCount = lattice.rowBoundariesDescPt.length - 1;
 	const columnCount = lattice.columnBoundariesAscPt.length - 1;
 	const regionAt = indexRegions(lattice, rowCount, columnCount);

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "js.documents",
-  "version": "14.6.5",
+  "version": "14.6.6",
   "description": "Converts between docx, pptx, odt, odp, ods, odg, xlsx, csv, svg, markdown, rtf, doc, xls, ppt and PDF through one shared, Zod-typed content schema (wpd read-only), plus read+write editors for OOXML and OpenDocument. Worker-isomorphic.",
   "type": "module",
   "repository": {
@@ -83,7 +83,7 @@
     "document-schema.js": "7.16.2",
     "epub-codec": "5.1.17",
     "fflate": "0.8.3",
-    "markdown-codec": "11.2.0",
+    "markdown-codec": "11.2.1",
     "odf.js": "11.2.3",
     "ooxml.js": "12.2.33",
     "pdf-codec": "5.7.0",