summaryrefslogtreecommitdiffstats
path: root/vendor/github.com/gomarkdown/markdown/parser/include.go
diff options
context:
space:
mode:
authorBenjamin <b.mpickford@outlook.com>2019-11-18 06:18:01 +1000
committerWim <wim@42.be>2019-11-17 21:18:01 +0100
commit0917dc876613fd71c9726a34bf0138b4f5121be9 (patch)
tree1eacaadaa4869e8f74ccf65c684c2a80f90787f9 /vendor/github.com/gomarkdown/markdown/parser/include.go
parentaba86855b5f71c9809d892a7eebc6b69872fcd5b (diff)
downloadmatterbridge-msglm-0917dc876613fd71c9726a34bf0138b4f5121be9.tar.gz
matterbridge-msglm-0917dc876613fd71c9726a34bf0138b4f5121be9.tar.bz2
matterbridge-msglm-0917dc876613fd71c9726a34bf0138b4f5121be9.zip
Update markdown parsing library to github.com/gomarkdown/markdown (#944)
Diffstat (limited to 'vendor/github.com/gomarkdown/markdown/parser/include.go')
-rw-r--r--vendor/github.com/gomarkdown/markdown/parser/include.go129
1 files changed, 129 insertions, 0 deletions
diff --git a/vendor/github.com/gomarkdown/markdown/parser/include.go b/vendor/github.com/gomarkdown/markdown/parser/include.go
new file mode 100644
index 00000000..2448a685
--- /dev/null
+++ b/vendor/github.com/gomarkdown/markdown/parser/include.go
@@ -0,0 +1,129 @@
+package parser
+
+import (
+ "bytes"
+ "path"
+ "path/filepath"
+)
+
+// isInclude parses {{...}}[...], that contains a path between the {{, the [...] syntax contains
+// an address to select which lines to include. It is treated as an opaque string and just given
+// to readInclude.
+func (p *Parser) isInclude(data []byte) (filename string, address []byte, consumed int) {
+ i := skipCharN(data, 0, ' ', 3) // start with up to 3 spaces
+ if len(data[i:]) < 3 {
+ return "", nil, 0
+ }
+ if data[i] != '{' || data[i+1] != '{' {
+ return "", nil, 0
+ }
+ start := i + 2
+
+ // find the end delimiter
+ i = skipUntilChar(data, i, '}')
+ if i+1 >= len(data) {
+ return "", nil, 0
+ }
+ end := i
+ i++
+ if data[i] != '}' {
+ return "", nil, 0
+ }
+ filename = string(data[start:end])
+
+ if i+1 < len(data) && data[i+1] == '[' { // potential address specification
+ start := i + 2
+
+ end = skipUntilChar(data, start, ']')
+ if end >= len(data) {
+ return "", nil, 0
+ }
+ address = data[start:end]
+ return filename, address, end + 1
+ }
+
+ return filename, address, i + 1
+}
+
+func (p *Parser) readInclude(from, file string, address []byte) []byte {
+ if p.Opts.ReadIncludeFn != nil {
+ return p.Opts.ReadIncludeFn(from, file, address)
+ }
+
+ return nil
+}
+
+// isCodeInclude parses <{{...}} which is similar to isInclude the returned bytes are, however wrapped in a code block.
+func (p *Parser) isCodeInclude(data []byte) (filename string, address []byte, consumed int) {
+ i := skipCharN(data, 0, ' ', 3) // start with up to 3 spaces
+ if len(data[i:]) < 3 {
+ return "", nil, 0
+ }
+ if data[i] != '<' {
+ return "", nil, 0
+ }
+ start := i
+
+ filename, address, consumed = p.isInclude(data[i+1:])
+ if consumed == 0 {
+ return "", nil, 0
+ }
+ return filename, address, start + consumed + 1
+}
+
+// readCodeInclude acts like include except the returned bytes are wrapped in a fenced code block.
+func (p *Parser) readCodeInclude(from, file string, address []byte) []byte {
+ data := p.readInclude(from, file, address)
+ if data == nil {
+ return nil
+ }
+ ext := path.Ext(file)
+ buf := &bytes.Buffer{}
+ buf.Write([]byte("```"))
+ if ext != "" { // starts with a dot
+ buf.WriteString(" " + ext[1:] + "\n")
+ } else {
+ buf.WriteByte('\n')
+ }
+ buf.Write(data)
+ buf.WriteString("```\n")
+ return buf.Bytes()
+}
+
+// incStack hold the current stack of chained includes. Each value is the containing
+// path of the file being parsed.
+type incStack struct {
+ stack []string
+}
+
+func newIncStack() *incStack {
+ return &incStack{stack: []string{}}
+}
+
+// Push updates i with new.
+func (i *incStack) Push(new string) {
+ if path.IsAbs(new) {
+ i.stack = append(i.stack, path.Dir(new))
+ return
+ }
+ last := ""
+ if len(i.stack) > 0 {
+ last = i.stack[len(i.stack)-1]
+ }
+ i.stack = append(i.stack, path.Dir(filepath.Join(last, new)))
+}
+
+// Pop pops the last value.
+func (i *incStack) Pop() {
+ if len(i.stack) == 0 {
+ return
+ }
+ i.stack = i.stack[:len(i.stack)-1]
+}
+
+func (i *incStack) Last() string {
+ if len(i.stack) == 0 {
+ return ""
+ }
+ return i.stack[len(i.stack)-1]
+}