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

237 lines
6.3 KiB
JavaScript
Raw Normal View History

2017-01-10 12:18:22 -05:00
"use strict";
const MODE_BREAK = 1;
const MODE_FLAT = 2;
function fits(next, restCommands, width) {
let restIdx = restCommands.length;
2017-01-05 12:21:57 -05:00
const cmds = [ next ];
while (width >= 0) {
if (cmds.length === 0) {
if (restIdx === 0) {
return true;
2017-01-05 12:21:57 -05:00
} else {
cmds.push(restCommands[restIdx - 1]);
2017-01-05 12:21:57 -05:00
restIdx--;
2017-01-05 12:21:57 -05:00
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 -= doc.length;
2017-01-05 12:21:57 -05:00
} else {
switch (doc.type) {
2017-01-13 15:03:53 -05:00
case "concat":
for (var i = doc.parts.length - 1; i >= 0; i--) {
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([ ind + doc.n, mode, doc.contents ]);
break;
case "group":
cmds.push([ ind, doc.break ? MODE_BREAK : mode, doc.contents ]);
break;
case "if-break":
if (mode === MODE_BREAK) {
2017-01-18 12:13:50 -08:00
if (doc.breakContents) {
2017-01-18 15:31:46 -08:00
cmds.push([ ind, mode, doc.breakContents ]);
2017-01-18 12:13:50 -08:00
}
}
if (mode === MODE_FLAT) {
if (doc.flatContents) {
cmds.push([ ind, mode, doc.flatContents ]);
}
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;
}
case MODE_BREAK:
return true;
}
break;
}
}
}
return false;
}
function printDocToString(doc, w) {
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-01-05 12:21:57 -05:00
let cmds = [ [ 0, MODE_BREAK, doc ] ];
let out = [];
let shouldRemeasure = false;
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);
2017-01-05 12:21:57 -05:00
pos += doc.length;
} else {
switch (doc.type) {
2017-01-13 15:03:53 -05:00
case "concat":
for (var i = doc.parts.length - 1; i >= 0; i--) {
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([ 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) {
// fallthrough
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
}
case MODE_BREAK:
shouldRemeasure = false;
const next = [ ind, MODE_FLAT, doc.contents ];
let rem = w - pos;
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];
if (doc.break) {
2017-01-05 12:21:57 -05:00
cmds.push([ ind, MODE_BREAK, mostExpanded ]);
break;
2017-01-05 12:21:57 -05:00
} else {
2017-01-13 15:03:53 -05:00
for (var i = 1; i < doc.expandedStates.length + 1; i++) {
if (i >= doc.expandedStates.length) {
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];
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 {
cmds.push([ ind, MODE_BREAK, doc.contents ]);
}
}
2017-01-13 15:03:53 -05:00
break;
}
break;
case "if-break":
if (mode === MODE_BREAK) {
2017-01-18 12:13:50 -08:00
if (doc.breakContents) {
2017-01-18 15:31:46 -08:00
cmds.push([ ind, mode, doc.breakContents ]);
2017-01-18 12:13:50 -08:00
}
}
if (mode === MODE_FLAT) {
if (doc.flatContents) {
cmds.push([ ind, mode, doc.flatContents ]);
}
}
2016-12-31 14:38:33 -05:00
break;
2017-01-13 15:03:53 -05:00
case "line":
switch (mode) {
// fallthrough
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-01-05 12:21:57 -05:00
2017-01-13 15:03:53 -05:00
case MODE_BREAK:
if (doc.literal) {
out.push("\n");
pos = 0;
} else {
2017-01-18 12:38:33 -08:00
if (out.length > 0) {
// Trim whitespace at the end of line
2017-01-18 15:31:46 -08:00
out[out.length - 1] = out[out.length - 1].replace(
/[^\S\n]*$/,
""
);
2017-01-18 12:38:33 -08:00
}
2017-01-18 16:33:26 -02:00
out.push("\n" + " ".repeat(ind));
2017-01-13 15:03:53 -05:00
pos = ind;
}
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
}
return out.join("");
}
2017-01-20 10:12:37 -08:00
module.exports = { printDocToString };