keith/barkey
1
0
Fork 0
mirror of https://codeberg.org/yeentown/barkey synced 2024-11-26 20:23:01 +00:00
Code Issues Projects Releases Packages Wiki Activity

[MFM] Make some syntax block

Browse source 
Resolve #3508
This commit is contained in:
syuilo 2019-01-31 12:10:48 +09:00
parent c652add16a
commit bb92158dff
No known key found for this signature in database
GPG key ID: BDC4C49D06AB9D69
1 changed files with 5 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

10
src/mfm/language.ts
View file

@ -27,7 +27,9 @@ export const mfmLanguage = P.createLanguage({
r.title, r.title,
r.quote, r.quote,
r.search, r.search,
r.blockCode r.blockCode,
r.mathBlock,
r.center,
), ),
startOfLine: () => P((input, i) => { startOfLine: () => P((input, i) => {
if (i == 0 || input[i] == '\n' || input[i - 1] == '\n') { if (i == 0 || input[i] == '\n' || input[i - 1] == '\n') {
@ -75,9 +77,7 @@ export const mfmLanguage = P.createLanguage({
r.spin, r.spin,
r.jump, r.jump,
r.flip, r.flip,
r.center,
r.inlineCode, r.inlineCode,
r.mathBlock,
r.mathInline, r.mathInline,
r.mention, r.mention,
r.hashtag, r.hashtag,
@ -123,9 +123,9 @@ export const mfmLanguage = P.createLanguage({
}, },
jump: r => P.regexp(/<jump>(.+?)<\/jump>/, 1).map(x => createTree('jump', r.inline.atLeast(1).tryParse(x), {})), jump: r => P.regexp(/<jump>(.+?)<\/jump>/, 1).map(x => createTree('jump', r.inline.atLeast(1).tryParse(x), {})),
flip: r => P.regexp(/<flip>(.+?)<\/flip>/, 1).map(x => createTree('flip', r.inline.atLeast(1).tryParse(x), {})), flip: r => P.regexp(/<flip>(.+?)<\/flip>/, 1).map(x => createTree('flip', r.inline.atLeast(1).tryParse(x), {})),
center: r => P.regexp(/<center>([\s\S]+?)<\/center>/, 1).map(x => createTree('center', r.inline.atLeast(1).tryParse(x), {})), center: r => r.startOfLine.then(P.regexp(/<center>([\s\S]+?)<\/center>/, 1).map(x => createTree('center', r.inline.atLeast(1).tryParse(x), {}))),
inlineCode: () => P.regexp(/`([^´\n]+?)`/, 1).map(x => createLeaf('inlineCode', { code: x })), inlineCode: () => P.regexp(/`([^´\n]+?)`/, 1).map(x => createLeaf('inlineCode', { code: x })),
mathBlock: () => P.regexp(/\\\[([\s\S]+?)\\\]/, 1).map(x => createLeaf('mathBlock', { formula: x.trim() })), mathBlock: r => r.startOfLine.then(P.regexp(/\\\[([\s\S]+?)\\\]/, 1).map(x => createLeaf('mathBlock', { formula: x.trim() }))),
mathInline: () => P.regexp(/\\\((.+?)\\\)/, 1).map(x => createLeaf('mathInline', { formula: x })), mathInline: () => P.regexp(/\\\((.+?)\\\)/, 1).map(x => createLeaf('mathInline', { formula: x })),
mention: () => { mention: () => {
return P((input, i) => { return P((input, i) => {