209 lines
7.3 KiB
TypeScript
209 lines
7.3 KiB
TypeScript
// Process definition lists
|
|
//
|
|
import MarkdownIt, { StateBlock, Token } from 'markdown-it';
|
|
|
|
/**
|
|
* markdown-it-deflist 插件
|
|
* 用于支持定义列表语法
|
|
*/
|
|
export default function deflist_plugin(md: MarkdownIt): void {
|
|
const isSpace = md.utils.isSpace;
|
|
|
|
// Search `[:~][\n ]`, returns next pos after marker on success
|
|
// or -1 on fail.
|
|
function skipMarker(state: StateBlock, line: number): number {
|
|
let start = state.bMarks[line] + state.tShift[line];
|
|
const max = state.eMarks[line];
|
|
|
|
if (start >= max) { return -1; }
|
|
|
|
// Check bullet
|
|
const marker = state.src.charCodeAt(start++);
|
|
if (marker !== 0x7E/* ~ */ && marker !== 0x3A/* : */) { return -1; }
|
|
|
|
const pos = state.skipSpaces(start);
|
|
|
|
// require space after ":"
|
|
if (start === pos) { return -1; }
|
|
|
|
// no empty definitions, e.g. " : "
|
|
if (pos >= max) { return -1; }
|
|
|
|
return start;
|
|
}
|
|
|
|
function markTightParagraphs(state: StateBlock, idx: number): void {
|
|
const level = state.level + 2;
|
|
|
|
for (let i = idx + 2, l = state.tokens.length - 2; i < l; i++) {
|
|
if (state.tokens[i].level === level && state.tokens[i].type === 'paragraph_open') {
|
|
state.tokens[i + 2].hidden = true;
|
|
state.tokens[i].hidden = true;
|
|
i += 2;
|
|
}
|
|
}
|
|
}
|
|
|
|
function deflist(state: StateBlock, startLine: number, endLine: number, silent: boolean): boolean {
|
|
if (silent) {
|
|
// quirk: validation mode validates a dd block only, not a whole deflist
|
|
if (state.ddIndent < 0) { return false; }
|
|
return skipMarker(state, startLine) >= 0;
|
|
}
|
|
|
|
let nextLine = startLine + 1;
|
|
if (nextLine >= endLine) { return false; }
|
|
|
|
if (state.isEmpty(nextLine)) {
|
|
nextLine++;
|
|
if (nextLine >= endLine) { return false; }
|
|
}
|
|
|
|
if (state.sCount[nextLine] < state.blkIndent) { return false; }
|
|
let contentStart = skipMarker(state, nextLine);
|
|
if (contentStart < 0) { return false; }
|
|
|
|
// Start list
|
|
const listTokIdx = state.tokens.length;
|
|
let tight = true;
|
|
|
|
const token_dl_o: Token = state.push('dl_open', 'dl', 1);
|
|
const listLines: [number, number] = [startLine, 0];
|
|
token_dl_o.map = listLines;
|
|
|
|
//
|
|
// Iterate list items
|
|
//
|
|
|
|
let dtLine = startLine;
|
|
let ddLine = nextLine;
|
|
|
|
// One definition list can contain multiple DTs,
|
|
// and one DT can be followed by multiple DDs.
|
|
//
|
|
// Thus, there is two loops here, and label is
|
|
// needed to break out of the second one
|
|
//
|
|
/* eslint no-labels:0,block-scoped-var:0 */
|
|
OUTER:
|
|
for (;;) {
|
|
let prevEmptyEnd = false;
|
|
|
|
const token_dt_o: Token = state.push('dt_open', 'dt', 1);
|
|
token_dt_o.map = [dtLine, dtLine];
|
|
|
|
const token_i: Token = state.push('inline', '', 0);
|
|
token_i.map = [dtLine, dtLine];
|
|
token_i.content = state.getLines(dtLine, dtLine + 1, state.blkIndent, false).trim();
|
|
token_i.children = [];
|
|
|
|
state.push('dt_close', 'dt', -1);
|
|
|
|
for (;;) {
|
|
const token_dd_o: Token = state.push('dd_open', 'dd', 1);
|
|
const itemLines: [number, number] = [nextLine, 0];
|
|
token_dd_o.map = itemLines;
|
|
|
|
let pos = contentStart;
|
|
const max = state.eMarks[ddLine];
|
|
let offset = state.sCount[ddLine] + contentStart - (state.bMarks[ddLine] + state.tShift[ddLine]);
|
|
|
|
while (pos < max) {
|
|
const ch = state.src.charCodeAt(pos);
|
|
|
|
if (isSpace(ch)) {
|
|
if (ch === 0x09) {
|
|
offset += 4 - offset % 4;
|
|
} else {
|
|
offset++;
|
|
}
|
|
} else {
|
|
break;
|
|
}
|
|
|
|
pos++;
|
|
}
|
|
|
|
contentStart = pos;
|
|
|
|
const oldTight = state.tight;
|
|
const oldDDIndent = state.ddIndent;
|
|
const oldIndent = state.blkIndent;
|
|
const oldTShift = state.tShift[ddLine];
|
|
const oldSCount = state.sCount[ddLine];
|
|
const oldParentType = state.parentType;
|
|
state.blkIndent = state.ddIndent = state.sCount[ddLine] + 2;
|
|
state.tShift[ddLine] = contentStart - state.bMarks[ddLine];
|
|
state.sCount[ddLine] = offset;
|
|
state.tight = true;
|
|
state.parentType = 'deflist' as any;
|
|
|
|
state.md.block.tokenize(state, ddLine, endLine);
|
|
|
|
// If any of list item is tight, mark list as tight
|
|
if (!state.tight || prevEmptyEnd) {
|
|
tight = false;
|
|
}
|
|
// Item become loose if finish with empty line,
|
|
// but we should filter last element, because it means list finish
|
|
prevEmptyEnd = (state.line - ddLine) > 1 && state.isEmpty(state.line - 1);
|
|
|
|
state.tShift[ddLine] = oldTShift;
|
|
state.sCount[ddLine] = oldSCount;
|
|
state.tight = oldTight;
|
|
state.parentType = oldParentType;
|
|
state.blkIndent = oldIndent;
|
|
state.ddIndent = oldDDIndent;
|
|
|
|
state.push('dd_close', 'dd', -1);
|
|
|
|
itemLines[1] = nextLine = state.line;
|
|
|
|
if (nextLine >= endLine) { break OUTER; }
|
|
|
|
if (state.sCount[nextLine] < state.blkIndent) { break OUTER; }
|
|
contentStart = skipMarker(state, nextLine);
|
|
if (contentStart < 0) { break; }
|
|
|
|
ddLine = nextLine;
|
|
|
|
// go to the next loop iteration:
|
|
// insert DD tag and repeat checking
|
|
}
|
|
|
|
if (nextLine >= endLine) { break; }
|
|
dtLine = nextLine;
|
|
|
|
if (state.isEmpty(dtLine)) { break; }
|
|
if (state.sCount[dtLine] < state.blkIndent) { break; }
|
|
|
|
ddLine = dtLine + 1;
|
|
if (ddLine >= endLine) { break; }
|
|
if (state.isEmpty(ddLine)) { ddLine++; }
|
|
if (ddLine >= endLine) { break; }
|
|
|
|
if (state.sCount[ddLine] < state.blkIndent) { break; }
|
|
contentStart = skipMarker(state, ddLine);
|
|
if (contentStart < 0) { break; }
|
|
|
|
// go to the next loop iteration:
|
|
// insert DT and DD tags and repeat checking
|
|
}
|
|
|
|
// Finilize list
|
|
state.push('dl_close', 'dl', -1);
|
|
|
|
listLines[1] = nextLine;
|
|
|
|
state.line = nextLine;
|
|
|
|
// mark paragraphs tight if needed
|
|
if (tight) {
|
|
markTightParagraphs(state, listTokIdx);
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
md.block.ruler.before('paragraph', 'deflist', deflist, { alt: ['paragraph', 'reference', 'blockquote'] });
|
|
} |