-
-
Notifications
You must be signed in to change notification settings - Fork 139
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
✨ Support for inserting custom blocks siyuan-note/siyuan#8418
- Loading branch information
Showing
18 changed files
with
293 additions
and
19 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.
Oops, something went wrong.
Large diffs are not rendered by default.
Oops, something went wrong.
Large diffs are not rendered by default.
Oops, something went wrong.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,130 @@ | ||
| // Lute - 一款结构化的 Markdown 引擎，支持 Go 和 JavaScript | ||
| // Copyright (c) 2019-present, b3log.org | ||
| // | ||
| // Lute is licensed under Mulan PSL v2. | ||
| // You can use this software according to the terms and conditions of the Mulan PSL v2. | ||
| // You may obtain a copy of Mulan PSL v2 at: | ||
| // http://license.coscl.org.cn/MulanPSL2 | ||
| // THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OF ANY KIND, EITHER EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO NON-INFRINGEMENT, MERCHANTABILITY OR FIT FOR A PARTICULAR PURPOSE. | ||
| // See the Mulan PSL v2 for more details. | ||
|
|
||
| package parse | ||
|
|
||
| import ( | ||
| "bytes" | ||
| "strings" | ||
|
|
||
| "github.com/88250/lute/ast" | ||
| "github.com/88250/lute/editor" | ||
| "github.com/88250/lute/html" | ||
| "github.com/88250/lute/lex" | ||
| ) | ||
|
|
||
| // CustomBlockStart 判断围栏自定义块（;;;）是否开始。 | ||
| func CustomBlockStart(t *Tree, container *ast.Node) int { | ||
| if t.Context.indented { | ||
| return 0 | ||
| } | ||
|
|
||
| if ok, offset, info := t.parseCustomBlock(); ok { | ||
| t.Context.closeUnmatchedBlocks() | ||
| container := t.Context.addChild(ast.NodeCustomBlock) | ||
| container.CustomBlockFenceOffset = offset | ||
| container.CustomBlockInfo = info | ||
| t.Context.advanceNextNonspace() | ||
| t.Context.advanceOffset(3, false) | ||
| return 2 | ||
| } | ||
| return 0 | ||
| } | ||
|
|
||
| func CustomBlockContinue(customBlock *ast.Node, context *Context) int { | ||
| ln := context.currentLine | ||
| indent := context.indent | ||
| if ok := context.isCustomBlockClose(ln[context.nextNonspace:]); indent <= 3 && ok { | ||
| context.finalize(customBlock) | ||
| return 2 | ||
| } else { | ||
| // 跳过围栏标记符 ; 之前可能存在的空格 | ||
| i := customBlock.CustomBlockFenceOffset | ||
| var token byte | ||
| for i > 0 { | ||
| token = lex.Peek(ln, context.offset) | ||
| if lex.ItemSpace != token && lex.ItemTab != token { | ||
| break | ||
| } | ||
| context.advanceOffset(1, true) | ||
| i-- | ||
| } | ||
| } | ||
| return 0 | ||
| } | ||
|
|
||
| func (context *Context) customBlockFinalize(customBlock *ast.Node) { | ||
| content := customBlock.Tokens | ||
| length := len(content) | ||
| if 1 > length { | ||
| return | ||
| } | ||
|
|
||
| var i int | ||
| for ; i < length; i++ { | ||
| if lex.ItemNewline == content[i] { | ||
| break | ||
| } | ||
| } | ||
| customBlock.Tokens = content[i+1:] | ||
| } | ||
|
|
||
| func (t *Tree) parseCustomBlock() (ok bool, fenceOffset int, info string) { | ||
| marker := t.Context.currentLine[t.Context.nextNonspace] | ||
| if lex.ItemSemicolon != marker { | ||
| return | ||
| } | ||
|
|
||
| var fenceLen int | ||
| for i := t.Context.nextNonspace; i < t.Context.currentLineLen && lex.ItemSemicolon == t.Context.currentLine[i]; i++ { | ||
| fenceLen++ | ||
| } | ||
|
|
||
| if 3 > fenceLen { | ||
| return | ||
| } | ||
|
|
||
| infoTokens := t.Context.currentLine[t.Context.nextNonspace+fenceLen:] | ||
| if lex.ItemSemicolon == marker && 0 < bytes.IndexByte(infoTokens, lex.ItemSemicolon) { | ||
| // info 部分不能包含 ; | ||
| return | ||
| } | ||
| info = string(lex.TrimWhitespace(infoTokens)) | ||
| info = html.UnescapeString(info) | ||
| if idx := strings.IndexByte(info, ' '); 0 <= idx { | ||
| info = info[:idx] | ||
| } | ||
| return true, t.Context.indent, info | ||
| } | ||
|
|
||
| func (context *Context) isCustomBlockClose(tokens []byte) (ok bool) { | ||
| closeMarker := tokens[0] | ||
| if closeMarker != lex.ItemSemicolon { | ||
| return false | ||
| } | ||
| if 3 > lex.Accept(tokens, closeMarker) { | ||
| return false | ||
| } | ||
| tokens = lex.TrimWhitespace(tokens) | ||
| endCaret := bytes.HasSuffix(tokens, editor.CaretTokens) | ||
| if context.ParseOption.VditorWYSIWYG || context.ParseOption.VditorIR || context.ParseOption.VditorSV || context.ParseOption.ProtyleWYSIWYG { | ||
| tokens = bytes.ReplaceAll(tokens, editor.CaretTokens, nil) | ||
| if endCaret { | ||
| context.Tip.Tokens = bytes.TrimSuffix(context.Tip.Tokens, []byte("\n")) | ||
| context.Tip.Tokens = append(context.Tip.Tokens, editor.CaretTokens...) | ||
| } | ||
| } | ||
| for _, token := range tokens { | ||
| if token != lex.ItemSemicolon { | ||
| return false | ||
| } | ||
| } | ||
| return true | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.