Files
test-repo/src/doc-printer.js
T

443 lines
13 KiB
JavaScript
Raw Normal View History

2017-01-10 12:18:22 -05:00
"use strict";
2017-01-28 07:50:22 -08:00
const util = require("./util");
const docBuilders = require("./doc-builders");
const concat = docBuilders.concat;
const fill = docBuilders.fill;
const cursor = docBuilders.cursor;
const MODE_BREAK = 1;
const MODE_FLAT = 2;
function rootIndent() {
return {
indent: 0,
align: {
2017-10-11 17:46:44 -05:00
spaces: "",
tabs: ""
}
};
}
function makeIndent(ind) {
return {
indent: ind.indent + 1,
align: ind.align
};
}
function makeAlign(ind, n) {
if (n === -Infinity) {
return {
indent: 0,
align: {
2017-10-11 17:46:44 -05:00
spaces: "",
tabs: ""
}
};
}
return {
indent: ind.indent,
align: {
2017-10-11 17:46:44 -05:00
spaces: ind.align.spaces + (typeof n === "number" ? " ".repeat(n) : n),
2017-11-11 15:05:07 +08:00
tabs: ind.align.tabs + (typeof n === "number" ? (n ? "\t" : "") : n)
}
};
}
function fits(next, restCommands, width, mustBeFlat) {
let restIdx = restCommands.length;
2017-01-28 07:50:22 -08:00
const cmds = [next];
2017-01-05 12:21:57 -05:00
while (width >= 0) {
if (cmds.length === 0) {
if (restIdx === 0) {
return true;
}
cmds.push(restCommands[restIdx - 1]);
restIdx--;
continue;
}
2017-01-10 12:18:22 -05:00
const x = cmds.pop();
2017-01-18 15:31:46 -08:00
const ind = x[0];
const mode = x[1];
const doc = x[2];
2017-01-05 12:21:57 -05:00
if (typeof doc === "string") {
width -= util.getStringWidth(doc);
2017-01-05 12:21:57 -05:00
} else {
switch (doc.type) {
2017-01-13 15:03:53 -05:00
case "concat":
2017-05-19 16:00:38 -04:00
for (let i = doc.parts.length - 1; i >= 0; i--) {
2017-01-28 07:50:22 -08:00
cmds.push([ind, mode, doc.parts[i]]);
}
2017-01-05 12:21:57 -05:00
2017-01-13 15:03:53 -05:00
break;
case "indent":
cmds.push([makeIndent(ind), mode, doc.contents]);
break;
case "align":
cmds.push([makeAlign(ind, doc.n), mode, doc.contents]);
2017-01-13 15:03:53 -05:00
break;
case "group":
if (mustBeFlat && doc.break) {
return false;
}
2017-01-28 07:50:22 -08:00
cmds.push([ind, doc.break ? MODE_BREAK : mode, doc.contents]);
2017-01-13 15:03:53 -05:00
break;
case "fill":
2017-05-19 16:00:38 -04:00
for (let i = doc.parts.length - 1; i >= 0; i--) {
cmds.push([ind, mode, doc.parts[i]]);
}
2017-01-13 15:03:53 -05:00
break;
case "if-break":
if (mode === MODE_BREAK) {
2017-01-18 12:13:50 -08:00
if (doc.breakContents) {
2017-01-28 07:50:22 -08:00
cmds.push([ind, mode, doc.breakContents]);
2017-01-18 12:13:50 -08:00
}
}
if (mode === MODE_FLAT) {
if (doc.flatContents) {
2017-01-28 07:50:22 -08:00
cmds.push([ind, mode, doc.flatContents]);
2017-01-18 12:13:50 -08:00
}
2017-01-13 15:03:53 -05:00
}
break;
case "line":
switch (mode) {
// fallthrough
case MODE_FLAT:
if (!doc.hard) {
if (!doc.soft) {
width -= 1;
}
break;
}
2017-05-21 21:11:09 +02:00
return true;
2017-01-13 15:03:53 -05:00
case MODE_BREAK:
return true;
}
break;
}
}
}
return false;
}
function printDocToString(doc, options) {
2017-05-21 21:11:09 +02:00
const width = options.printWidth;
const newLine = options.newLine || "\n";
let pos = 0;
// cmds is basically a stack. We've turned a recursive call into a
// while loop which is much faster. The while loop below adds new
// cmds to the array instead of recursively calling `print`.
2017-05-21 21:11:09 +02:00
const cmds = [[rootIndent(), MODE_BREAK, doc]];
const out = [];
let shouldRemeasure = false;
let lineSuffix = [];
2017-01-05 12:21:57 -05:00
while (cmds.length !== 0) {
2017-01-10 12:18:22 -05:00
const x = cmds.pop();
2017-01-18 15:31:46 -08:00
const ind = x[0];
const mode = x[1];
const doc = x[2];
2017-01-05 12:21:57 -05:00
if (typeof doc === "string") {
out.push(doc);
pos += util.getStringWidth(doc);
2017-01-05 12:21:57 -05:00
} else {
switch (doc.type) {
case "cursor":
out.push(cursor.placeholder);
break;
2017-01-13 15:03:53 -05:00
case "concat":
2017-05-19 16:00:38 -04:00
for (let i = doc.parts.length - 1; i >= 0; i--) {
2017-01-28 07:50:22 -08:00
cmds.push([ind, mode, doc.parts[i]]);
2017-01-05 12:21:57 -05:00
}
2017-01-13 15:03:53 -05:00
break;
case "indent":
cmds.push([makeIndent(ind), mode, doc.contents]);
break;
case "align":
cmds.push([makeAlign(ind, doc.n), mode, doc.contents]);
2017-01-05 12:21:57 -05:00
2017-01-13 15:03:53 -05:00
break;
case "group":
switch (mode) {
case MODE_FLAT:
if (!shouldRemeasure) {
cmds.push([
ind,
doc.break ? MODE_BREAK : MODE_FLAT,
doc.contents
]);
2017-01-05 12:21:57 -05:00
break;
2017-01-13 15:03:53 -05:00
}
2017-05-21 21:11:09 +02:00
// fallthrough
2017-01-13 15:03:53 -05:00
2017-05-21 21:11:09 +02:00
case MODE_BREAK: {
2017-01-13 15:03:53 -05:00
shouldRemeasure = false;
2017-01-28 07:50:22 -08:00
const next = [ind, MODE_FLAT, doc.contents];
2017-05-21 21:11:09 +02:00
const rem = width - pos;
2017-01-13 15:03:53 -05:00
if (!doc.break && fits(next, cmds, rem)) {
cmds.push(next);
2017-01-05 12:21:57 -05:00
} else {
2017-01-13 15:03:53 -05:00
// Expanded states are a rare case where a document
// can manually provide multiple representations of
// itself. It provides an array of documents
// going from the least expanded (most flattened)
// representation first to the most expanded. If a
// group has these, we need to manually go through
// these states and find the first one that fits.
if (doc.expandedStates) {
const mostExpanded =
doc.expandedStates[doc.expandedStates.length - 1];
2017-01-13 15:03:53 -05:00
if (doc.break) {
2017-01-28 07:50:22 -08:00
cmds.push([ind, MODE_BREAK, mostExpanded]);
2017-01-05 12:21:57 -05:00
break;
2017-01-05 12:21:57 -05:00
} else {
2017-05-19 16:00:38 -04:00
for (let i = 1; i < doc.expandedStates.length + 1; i++) {
2017-01-13 15:03:53 -05:00
if (i >= doc.expandedStates.length) {
2017-01-28 07:50:22 -08:00
cmds.push([ind, MODE_BREAK, mostExpanded]);
2017-01-05 12:21:57 -05:00
2017-01-13 15:03:53 -05:00
break;
} else {
const state = doc.expandedStates[i];
2017-01-28 07:50:22 -08:00
const cmd = [ind, MODE_FLAT, state];
2017-01-05 12:21:57 -05:00
2017-01-13 15:03:53 -05:00
if (fits(cmd, cmds, rem)) {
cmds.push(cmd);
break;
}
}
}
}
2017-01-13 15:03:53 -05:00
} else {
2017-01-28 07:50:22 -08:00
cmds.push([ind, MODE_BREAK, doc.contents]);
}
}
2017-01-13 15:03:53 -05:00
break;
2017-05-21 21:11:09 +02:00
}
2017-01-13 15:03:53 -05:00
}
break;
// Fills each line with as much code as possible before moving to a new
// line with the same indentation.
//
// Expects doc.parts to be an array of alternating content and
// whitespace. The whitespace contains the linebreaks.
//
// For example:
// ["I", line, "love", line, "monkeys"]
// or
// [{ type: group, ... }, softline, { type: group, ... }]
//
// It uses this parts structure to handle three main layout cases:
// * The first two content items fit on the same line without
// breaking
// -> output the first content item and the whitespace "flat".
// * Only the first content item fits on the line without breaking
// -> output the first content item "flat" and the whitespace with
// "break".
// * Neither content item fits on the line without breaking
// -> output the first content item and the whitespace with "break".
case "fill": {
2017-05-21 21:11:09 +02:00
const rem = width - pos;
const parts = doc.parts;
if (parts.length === 0) {
break;
}
const content = parts[0];
const contentFlatCmd = [ind, MODE_FLAT, content];
const contentBreakCmd = [ind, MODE_BREAK, content];
const contentFits = fits(contentFlatCmd, [], rem, true);
if (parts.length === 1) {
if (contentFits) {
cmds.push(contentFlatCmd);
} else {
cmds.push(contentBreakCmd);
}
break;
}
const whitespace = parts[1];
const whitespaceFlatCmd = [ind, MODE_FLAT, whitespace];
const whitespaceBreakCmd = [ind, MODE_BREAK, whitespace];
if (parts.length === 2) {
if (contentFits) {
cmds.push(whitespaceFlatCmd);
cmds.push(contentFlatCmd);
} else {
cmds.push(whitespaceBreakCmd);
cmds.push(contentBreakCmd);
}
break;
}
// At this point we've handled the first pair (context, separator)
// and will create a new fill doc for the rest of the content.
// Ideally we wouldn't mutate the array here but coping all the
// elements to a new array would make this algorithm quadratic,
// which is unusable for large arrays (e.g. large texts in JSX).
parts.splice(0, 2);
const remainingCmd = [ind, mode, fill(parts)];
const secondContent = parts[0];
const firstAndSecondContentFlatCmd = [
ind,
MODE_FLAT,
concat([content, whitespace, secondContent])
];
const firstAndSecondContentFits = fits(
firstAndSecondContentFlatCmd,
[],
rem,
true
);
if (firstAndSecondContentFits) {
cmds.push(remainingCmd);
cmds.push(whitespaceFlatCmd);
cmds.push(contentFlatCmd);
} else if (contentFits) {
cmds.push(remainingCmd);
cmds.push(whitespaceBreakCmd);
cmds.push(contentFlatCmd);
} else {
cmds.push(remainingCmd);
cmds.push(whitespaceBreakCmd);
cmds.push(contentBreakCmd);
}
break;
}
2017-01-13 15:03:53 -05:00
case "if-break":
if (mode === MODE_BREAK) {
2017-01-18 12:13:50 -08:00
if (doc.breakContents) {
2017-01-28 07:50:22 -08:00
cmds.push([ind, mode, doc.breakContents]);
2017-01-18 12:13:50 -08:00
}
}
if (mode === MODE_FLAT) {
if (doc.flatContents) {
2017-01-28 07:50:22 -08:00
cmds.push([ind, mode, doc.flatContents]);
2017-01-18 12:13:50 -08:00
}
}
2016-12-31 14:38:33 -05:00
break;
case "line-suffix":
lineSuffix.push([ind, mode, doc.contents]);
break;
2017-02-23 09:26:26 -08:00
case "line-suffix-boundary":
if (lineSuffix.length > 0) {
cmds.push([ind, mode, { type: "line", hard: true }]);
}
break;
2017-01-13 15:03:53 -05:00
case "line":
switch (mode) {
case MODE_FLAT:
if (!doc.hard) {
if (!doc.soft) {
out.push(" ");
2017-01-05 12:21:57 -05:00
2017-01-13 15:03:53 -05:00
pos += 1;
}
2017-01-05 12:21:57 -05:00
2017-01-13 15:03:53 -05:00
break;
} else {
// This line was forced into the output even if we
// were in flattened mode, so we need to tell the next
// group that no matter what, it needs to remeasure
// because the previous measurement didn't accurately
// capture the entire expression (this is necessary
// for nested groups)
shouldRemeasure = true;
}
2017-05-21 21:11:09 +02:00
// fallthrough
2017-01-13 15:03:53 -05:00
case MODE_BREAK:
if (lineSuffix.length) {
cmds.push([ind, mode, doc]);
[].push.apply(cmds, lineSuffix.reverse());
lineSuffix = [];
break;
}
2017-01-13 15:03:53 -05:00
if (doc.literal) {
out.push(newLine);
2017-01-13 15:03:53 -05:00
pos = 0;
} else {
2017-01-18 12:38:33 -08:00
if (out.length > 0) {
// Trim whitespace at the end of line
2017-04-13 18:31:49 -07:00
while (
out.length > 0 &&
out[out.length - 1].match(/^[^\S\n]*$/)
) {
out.pop();
}
if (
out.length &&
(options.parser !== "markdown" ||
// preserve markdown's `break` node (two trailing spaces)
!/\S {2}$/.test(out[out.length - 1]))
) {
out[out.length - 1] = out[out.length - 1].replace(
/[^\S\n]*$/,
""
);
}
2017-01-18 12:38:33 -08:00
}
2017-10-11 17:46:44 -05:00
const indentLength = ind.indent * options.tabWidth;
2017-05-21 21:11:09 +02:00
const indentString = options.useTabs
2017-10-11 17:46:44 -05:00
? "\t".repeat(ind.indent) + ind.align.tabs
: " ".repeat(indentLength) + ind.align.spaces;
out.push(newLine + indentString);
2017-10-11 17:46:44 -05:00
pos = indentLength + ind.align.spaces.length;
2017-01-13 15:03:53 -05:00
}
break;
2017-01-05 12:21:57 -05:00
}
break;
2017-01-13 15:03:53 -05:00
default:
}
}
2017-01-05 12:21:57 -05:00
}
const cursorPlaceholderIndex = out.indexOf(cursor.placeholder);
if (cursorPlaceholderIndex !== -1) {
const beforeCursor = out.slice(0, cursorPlaceholderIndex).join("");
const afterCursor = out.slice(cursorPlaceholderIndex + 1).join("");
return {
formatted: beforeCursor + afterCursor,
cursor: beforeCursor.length
};
}
return { formatted: out.join("") };
}
2017-01-20 10:12:37 -08:00
module.exports = { printDocToString };