mirror of
https://github.com/misskey-dev/misskey
synced 2024-12-23 02:58:30 +09:00
125849673a
Co-authored-by: syuilo <syuilotan@yahoo.co.jp> Co-authored-by: Acid Chicken (硫酸鶏) <root@acid-chicken.com>
41 lines
1.1 KiB
TypeScript
41 lines
1.1 KiB
TypeScript
import parser, { Node, plainParser } from './parser';
|
|
import * as A from '../prelude/array';
|
|
import * as S from '../prelude/string';
|
|
|
|
export default (source: string, plainText = false): Node[] => {
|
|
if (source == null || source == '') {
|
|
return null;
|
|
}
|
|
|
|
let nodes: Node[] = plainText ? plainParser.root.tryParse(source) : parser.root.tryParse(source);
|
|
|
|
const combineText = (es: Node[]): Node =>
|
|
({ name: 'text', props: { text: S.concat(es.map(e => e.props.text)) } });
|
|
|
|
const concatText = (nodes: Node[]): Node[] =>
|
|
A.concat(A.groupOn(x => x.name, nodes).map(es =>
|
|
es[0].name === 'text' ? [combineText(es)] : es
|
|
));
|
|
|
|
const concatTextRecursive = (es: Node[]): void => {
|
|
for (const x of es.filter(x => x.children)) {
|
|
x.children = concatText(x.children);
|
|
concatTextRecursive(x.children);
|
|
}
|
|
};
|
|
|
|
nodes = concatText(nodes);
|
|
concatTextRecursive(nodes);
|
|
|
|
const removeEmptyTextNodes = (nodes: Node[]) => {
|
|
for (const n of nodes.filter(n => n.children)) {
|
|
n.children = removeEmptyTextNodes(n.children);
|
|
}
|
|
return nodes.filter(n => !(n.name == 'text' && n.props.text == ''));
|
|
};
|
|
|
|
nodes = removeEmptyTextNodes(nodes);
|
|
|
|
return nodes;
|
|
};
|