Use mfm-js for MFM parsing (#7415)
* wip * Update mfm.ts * wip * update mfmjs * refactor * nanka * Update mfm.ts * Update to-html.ts * Update to-html.ts * wip * fix test * fix test
This commit is contained in:
parent
b378066ebf
commit
1f4ae2f63a
31 changed files with 262 additions and 1771 deletions
18
src/misc/extract-custom-emojis-from-mfm.ts
Normal file
18
src/misc/extract-custom-emojis-from-mfm.ts
Normal file
|
@ -0,0 +1,18 @@
|
|||
import * as mfm from 'mfm-js';
|
||||
import { unique } from '@/prelude/array';
|
||||
|
||||
export function extractCustomEmojisFromMfm(nodes: mfm.MfmNode[]): string[] {
|
||||
const emojiNodes = [] as mfm.MfmEmojiCode[];
|
||||
|
||||
function scan(nodes: mfm.MfmNode[]) {
|
||||
for (const node of nodes) {
|
||||
if (node.type === 'emojiCode') emojiNodes.push(node);
|
||||
else if (node.children) scan(node.children);
|
||||
}
|
||||
}
|
||||
|
||||
scan(nodes);
|
||||
|
||||
const emojis = emojiNodes.filter(x => x.props.name.length <= 100).map(x => x.props.name!);
|
||||
return unique(emojis);
|
||||
}
|
|
@ -1,9 +0,0 @@
|
|||
import { EmojiNode, MfmForest } from '../mfm/prelude';
|
||||
import { preorderF } from '../prelude/tree';
|
||||
import { unique } from '../prelude/array';
|
||||
|
||||
export default function(mfmForest: MfmForest): string[] {
|
||||
const emojiNodes = preorderF(mfmForest).filter(x => x.type === 'emoji') as EmojiNode[];
|
||||
const emojis = emojiNodes.filter(x => x.props.name && x.props.name.length <= 100).map(x => x.props.name);
|
||||
return unique(emojis);
|
||||
}
|
|
@ -1,9 +1,18 @@
|
|||
import { HashtagNode, MfmForest } from '../mfm/prelude';
|
||||
import { preorderF } from '../prelude/tree';
|
||||
import { unique } from '../prelude/array';
|
||||
import * as mfm from 'mfm-js';
|
||||
import { unique } from '@/prelude/array';
|
||||
|
||||
export default function(nodes: mfm.MfmNode[]): string[] {
|
||||
const hashtagNodes = [] as mfm.MfmHashtag[];
|
||||
|
||||
function scan(nodes: mfm.MfmNode[]) {
|
||||
for (const node of nodes) {
|
||||
if (node.type === 'hashtag') hashtagNodes.push(node);
|
||||
else if (node.children) scan(node.children);
|
||||
}
|
||||
}
|
||||
|
||||
scan(nodes);
|
||||
|
||||
export default function(mfmForest: MfmForest): string[] {
|
||||
const hashtagNodes = preorderF(mfmForest).filter(x => x.type === 'hashtag') as HashtagNode[];
|
||||
const hashtags = hashtagNodes.map(x => x.props.hashtag);
|
||||
return unique(hashtags);
|
||||
}
|
||||
|
|
|
@ -1,10 +1,19 @@
|
|||
// test is located in test/extract-mentions
|
||||
|
||||
import { MentionNode, MfmForest } from '../mfm/prelude';
|
||||
import { preorderF } from '../prelude/tree';
|
||||
import * as mfm from 'mfm-js';
|
||||
|
||||
export default function(mfmForest: MfmForest): MentionNode['props'][] {
|
||||
export default function(nodes: mfm.MfmNode[]): mfm.MfmMention['props'][] {
|
||||
// TODO: 重複を削除
|
||||
const mentionNodes = preorderF(mfmForest).filter(x => x.type === 'mention') as MentionNode[];
|
||||
const mentionNodes = [] as mfm.MfmMention[];
|
||||
|
||||
function scan(nodes: mfm.MfmNode[]) {
|
||||
for (const node of nodes) {
|
||||
if (node.type === 'mention') mentionNodes.push(node);
|
||||
else if (node.children) scan(node.children);
|
||||
}
|
||||
}
|
||||
|
||||
scan(nodes);
|
||||
|
||||
return mentionNodes.map(x => x.props);
|
||||
}
|
||||
|
|
34
src/misc/extract-url-from-mfm.ts
Normal file
34
src/misc/extract-url-from-mfm.ts
Normal file
|
@ -0,0 +1,34 @@
|
|||
import * as mfm from 'mfm-js';
|
||||
import { unique } from '@/prelude/array';
|
||||
|
||||
// unique without hash
|
||||
// [ http://a/#1, http://a/#2, http://b/#3 ] => [ http://a/#1, http://b/#3 ]
|
||||
const removeHash = (x: string) => x.replace(/#[^#]*$/, '');
|
||||
|
||||
export function extractUrlFromMfm(nodes: mfm.MfmNode[], respectSilentFlag = true): string[] {
|
||||
const urlNodes = [] as (mfm.MfmUrl | mfm.MfmLink)[];
|
||||
|
||||
function scan(nodes: mfm.MfmNode[]) {
|
||||
for (const node of nodes) {
|
||||
if (node.type === 'url') {
|
||||
urlNodes.push(node);
|
||||
} else if (node.type === 'link') {
|
||||
if (!respectSilentFlag || !node.props.silent) {
|
||||
urlNodes.push(node);
|
||||
}
|
||||
} else if (node.children) {
|
||||
scan(node.children);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
scan(nodes);
|
||||
|
||||
const urls = unique(urlNodes.map(x => x.props.url));
|
||||
|
||||
return urls.reduce((array, url) => {
|
||||
const removed = removeHash(url);
|
||||
if (!array.map(x => removeHash(x)).includes(removed)) array.push(url);
|
||||
return array;
|
||||
}, [] as string[]);
|
||||
}
|
Loading…
Add table
Add a link
Reference in a new issue