2011-05-28 00:12:21 +02:00
|
|
|
//
|
2011-06-28 04:11:32 +02:00
|
|
|
// Blackfriday Markdown Processor
|
|
|
|
// Available at http://github.com/russross/blackfriday
|
|
|
|
//
|
|
|
|
// Copyright © 2011 Russ Ross <russ@russross.com>.
|
2011-06-28 19:30:10 +02:00
|
|
|
// Distributed under the Simplified BSD License.
|
2011-06-28 04:11:32 +02:00
|
|
|
// See README.md for details.
|
2011-05-28 00:12:21 +02:00
|
|
|
//
|
|
|
|
|
2011-05-29 05:17:53 +02:00
|
|
|
//
|
|
|
|
//
|
|
|
|
// Markdown parsing and processing
|
|
|
|
//
|
|
|
|
//
|
|
|
|
|
2011-07-07 20:05:29 +02:00
|
|
|
// Blackfriday markdown processor.
|
|
|
|
//
|
|
|
|
// Translates plain text with simple formatting rules into HTML or LaTeX.
|
2011-05-29 05:17:53 +02:00
|
|
|
package blackfriday
|
2011-05-25 00:14:35 +02:00
|
|
|
|
|
|
|
import (
|
|
|
|
"bytes"
|
2011-05-31 20:04:58 +02:00
|
|
|
"utf8"
|
2011-05-25 00:14:35 +02:00
|
|
|
)
|
|
|
|
|
2011-09-26 23:45:49 +02:00
|
|
|
const VERSION = "1.1"
|
2011-06-28 19:30:10 +02:00
|
|
|
|
2011-05-29 05:17:53 +02:00
|
|
|
// These are the supported markdown parsing extensions.
|
|
|
|
// OR these values together to select multiple extensions.
|
2011-05-25 00:14:35 +02:00
|
|
|
const (
|
2011-07-07 20:05:29 +02:00
|
|
|
EXTENSION_NO_INTRA_EMPHASIS = 1 << iota // ignore emphasis markers inside words
|
|
|
|
EXTENSION_TABLES // render tables
|
|
|
|
EXTENSION_FENCED_CODE // render fenced code blocks
|
|
|
|
EXTENSION_AUTOLINK // detect embedded URLs that are not explicitly marked
|
|
|
|
EXTENSION_STRIKETHROUGH // strikethrough text using ~~test~~
|
|
|
|
EXTENSION_LAX_HTML_BLOCKS // loosen up HTML block parsing rules
|
|
|
|
EXTENSION_SPACE_HEADERS // be strict about prefix header rules
|
|
|
|
EXTENSION_HARD_LINE_BREAK // translate newlines into line breaks
|
|
|
|
EXTENSION_TAB_SIZE_EIGHT // expand tabs to eight spaces instead of four
|
2011-05-25 00:14:35 +02:00
|
|
|
)
|
|
|
|
|
2011-05-29 05:17:53 +02:00
|
|
|
// These are the possible flag values for the link renderer.
|
|
|
|
// Only a single one of these values will be used; they are not ORed together.
|
|
|
|
// These are mostly of interest if you are writing a new output format.
|
2011-05-25 00:14:35 +02:00
|
|
|
const (
|
2011-05-29 05:17:53 +02:00
|
|
|
LINK_TYPE_NOT_AUTOLINK = iota
|
|
|
|
LINK_TYPE_NORMAL
|
|
|
|
LINK_TYPE_EMAIL
|
2011-05-25 00:14:35 +02:00
|
|
|
)
|
|
|
|
|
2011-07-07 19:56:45 +02:00
|
|
|
// These are the possible flag values for the ListItem renderer.
|
2011-05-29 05:17:53 +02:00
|
|
|
// Multiple flag values may be ORed together.
|
|
|
|
// These are mostly of interest if you are writing a new output format.
|
2011-05-25 21:59:30 +02:00
|
|
|
const (
|
2011-05-29 05:17:53 +02:00
|
|
|
LIST_TYPE_ORDERED = 1 << iota
|
|
|
|
LIST_ITEM_CONTAINS_BLOCK
|
2011-07-01 19:19:42 +02:00
|
|
|
LIST_ITEM_BEGINNING_OF_LIST
|
2011-05-29 05:17:53 +02:00
|
|
|
LIST_ITEM_END_OF_LIST
|
2011-05-25 21:59:30 +02:00
|
|
|
)
|
|
|
|
|
2011-05-29 05:17:53 +02:00
|
|
|
// These are the possible flag values for the table cell renderer.
|
|
|
|
// Only a single one of these values will be used; they are not ORed together.
|
|
|
|
// These are mostly of interest if you are writing a new output format.
|
2011-05-25 21:59:30 +02:00
|
|
|
const (
|
2011-05-29 05:17:53 +02:00
|
|
|
TABLE_ALIGNMENT_LEFT = 1 << iota
|
|
|
|
TABLE_ALIGNMENT_RIGHT
|
|
|
|
TABLE_ALIGNMENT_CENTER = (TABLE_ALIGNMENT_LEFT | TABLE_ALIGNMENT_RIGHT)
|
2011-05-25 21:59:30 +02:00
|
|
|
)
|
|
|
|
|
2011-05-29 05:17:53 +02:00
|
|
|
// The size of a tab stop.
|
2011-06-28 18:58:10 +02:00
|
|
|
const (
|
|
|
|
TAB_SIZE_DEFAULT = 4
|
|
|
|
TAB_SIZE_EIGHT = 8
|
|
|
|
)
|
2011-05-29 05:17:53 +02:00
|
|
|
|
|
|
|
// These are the tags that are recognized as HTML block tags.
|
|
|
|
// Any of these can be included in markdown text without special escaping.
|
2011-06-29 00:02:12 +02:00
|
|
|
var blockTags = map[string]bool{
|
2011-05-28 17:49:21 +02:00
|
|
|
"p": true,
|
|
|
|
"dl": true,
|
|
|
|
"h1": true,
|
|
|
|
"h2": true,
|
|
|
|
"h3": true,
|
|
|
|
"h4": true,
|
|
|
|
"h5": true,
|
|
|
|
"h6": true,
|
|
|
|
"ol": true,
|
|
|
|
"ul": true,
|
|
|
|
"del": true,
|
|
|
|
"div": true,
|
|
|
|
"ins": true,
|
|
|
|
"pre": true,
|
|
|
|
"form": true,
|
|
|
|
"math": true,
|
|
|
|
"table": true,
|
|
|
|
"iframe": true,
|
|
|
|
"script": true,
|
|
|
|
"fieldset": true,
|
|
|
|
"noscript": true,
|
|
|
|
"blockquote": true,
|
2011-05-25 00:14:35 +02:00
|
|
|
}
|
|
|
|
|
2011-07-07 19:56:45 +02:00
|
|
|
// Renderer is the rendering interface.
|
2011-05-29 05:17:53 +02:00
|
|
|
// This is mostly of interest if you are implementing a new rendering format.
|
2011-07-07 19:56:45 +02:00
|
|
|
//
|
|
|
|
// When a byte slice is provided, it contains the (rendered) contents of the
|
|
|
|
// element.
|
|
|
|
//
|
|
|
|
// When a callback is provided instead, it will write the contents of the
|
|
|
|
// respective element directly to the output buffer and return true on success.
|
|
|
|
// If the callback returns false, the rendering function should reset the
|
|
|
|
// output buffer as though it had never been called.
|
|
|
|
//
|
2011-06-29 19:21:46 +02:00
|
|
|
// Currently Html and Latex implementations are provided
|
2011-06-29 19:13:17 +02:00
|
|
|
type Renderer interface {
|
|
|
|
// block-level callbacks
|
|
|
|
BlockCode(out *bytes.Buffer, text []byte, lang string)
|
|
|
|
BlockQuote(out *bytes.Buffer, text []byte)
|
|
|
|
BlockHtml(out *bytes.Buffer, text []byte)
|
|
|
|
Header(out *bytes.Buffer, text func() bool, level int)
|
|
|
|
HRule(out *bytes.Buffer)
|
|
|
|
List(out *bytes.Buffer, text func() bool, flags int)
|
|
|
|
ListItem(out *bytes.Buffer, text []byte, flags int)
|
|
|
|
Paragraph(out *bytes.Buffer, text func() bool)
|
|
|
|
Table(out *bytes.Buffer, header []byte, body []byte, columnData []int)
|
|
|
|
TableRow(out *bytes.Buffer, text []byte)
|
|
|
|
TableCell(out *bytes.Buffer, text []byte, flags int)
|
|
|
|
|
2011-06-29 21:00:54 +02:00
|
|
|
// Span-level callbacks
|
|
|
|
AutoLink(out *bytes.Buffer, link []byte, kind int)
|
|
|
|
CodeSpan(out *bytes.Buffer, text []byte)
|
|
|
|
DoubleEmphasis(out *bytes.Buffer, text []byte)
|
|
|
|
Emphasis(out *bytes.Buffer, text []byte)
|
|
|
|
Image(out *bytes.Buffer, link []byte, title []byte, alt []byte)
|
|
|
|
LineBreak(out *bytes.Buffer)
|
|
|
|
Link(out *bytes.Buffer, link []byte, title []byte, content []byte)
|
|
|
|
RawHtmlTag(out *bytes.Buffer, tag []byte)
|
|
|
|
TripleEmphasis(out *bytes.Buffer, text []byte)
|
|
|
|
StrikeThrough(out *bytes.Buffer, text []byte)
|
2011-06-29 19:13:17 +02:00
|
|
|
|
|
|
|
// Low-level callbacks
|
|
|
|
Entity(out *bytes.Buffer, entity []byte)
|
|
|
|
NormalText(out *bytes.Buffer, text []byte)
|
2011-05-31 05:44:52 +02:00
|
|
|
|
|
|
|
// Header and footer
|
2011-06-29 19:13:17 +02:00
|
|
|
DocumentHeader(out *bytes.Buffer)
|
|
|
|
DocumentFooter(out *bytes.Buffer)
|
2011-05-25 00:14:35 +02:00
|
|
|
}
|
|
|
|
|
2011-06-29 19:21:46 +02:00
|
|
|
// Callback functions for inline parsing. One such function is defined
|
|
|
|
// for each character that triggers a response when parsing inline data.
|
2011-07-07 19:56:45 +02:00
|
|
|
type inlineParser func(p *parser, out *bytes.Buffer, data []byte, offset int) int
|
2011-05-26 04:46:16 +02:00
|
|
|
|
2011-07-07 19:56:45 +02:00
|
|
|
// Parser holds runtime state used by the parser.
|
|
|
|
// This is constructed by the Markdown function.
|
|
|
|
type parser struct {
|
2011-07-05 22:22:21 +02:00
|
|
|
r Renderer
|
|
|
|
refs map[string]*reference
|
|
|
|
inlineCallback [256]inlineParser
|
|
|
|
flags int
|
|
|
|
nesting int
|
|
|
|
maxNesting int
|
|
|
|
insideLink bool
|
2011-05-25 00:14:35 +02:00
|
|
|
}
|
|
|
|
|
2011-05-29 05:17:53 +02:00
|
|
|
|
|
|
|
//
|
|
|
|
//
|
|
|
|
// Public interface
|
|
|
|
//
|
2011-05-26 17:47:41 +02:00
|
|
|
//
|
2011-05-25 00:14:35 +02:00
|
|
|
|
2011-07-07 19:56:45 +02:00
|
|
|
// MarkdownBasic is a convenience function for simple rendering.
|
|
|
|
// It processes markdown input with no extensions enabled.
|
2011-06-28 23:55:27 +02:00
|
|
|
func MarkdownBasic(input []byte) []byte {
|
|
|
|
// set up the HTML renderer
|
|
|
|
htmlFlags := HTML_USE_XHTML
|
2011-06-29 18:08:56 +02:00
|
|
|
renderer := HtmlRenderer(htmlFlags, "", "")
|
2011-06-28 23:55:27 +02:00
|
|
|
|
|
|
|
// set up the parser
|
|
|
|
extensions := 0
|
|
|
|
|
|
|
|
return Markdown(input, renderer, extensions)
|
|
|
|
}
|
|
|
|
|
|
|
|
// Call Markdown with most useful extensions enabled
|
2011-07-07 19:56:45 +02:00
|
|
|
// MarkdownCommon is a convenience function for simple rendering.
|
|
|
|
// It processes markdown input with common extensions enabled, including:
|
|
|
|
//
|
|
|
|
// * Smartypants processing with smart fractions and LaTeX dashes
|
|
|
|
//
|
|
|
|
// * Intra-word emphasis supression
|
|
|
|
//
|
|
|
|
// * Tables
|
|
|
|
//
|
|
|
|
// * Fenced code blocks
|
|
|
|
//
|
|
|
|
// * Autolinking
|
|
|
|
//
|
|
|
|
// * Strikethrough support
|
|
|
|
//
|
|
|
|
// * Strict header parsing
|
2011-06-28 23:55:27 +02:00
|
|
|
func MarkdownCommon(input []byte) []byte {
|
|
|
|
// set up the HTML renderer
|
|
|
|
htmlFlags := 0
|
|
|
|
htmlFlags |= HTML_USE_XHTML
|
|
|
|
htmlFlags |= HTML_USE_SMARTYPANTS
|
|
|
|
htmlFlags |= HTML_SMARTYPANTS_FRACTIONS
|
|
|
|
htmlFlags |= HTML_SMARTYPANTS_LATEX_DASHES
|
2011-06-29 18:08:56 +02:00
|
|
|
renderer := HtmlRenderer(htmlFlags, "", "")
|
2011-06-28 23:55:27 +02:00
|
|
|
|
|
|
|
// set up the parser
|
|
|
|
extensions := 0
|
|
|
|
extensions |= EXTENSION_NO_INTRA_EMPHASIS
|
|
|
|
extensions |= EXTENSION_TABLES
|
|
|
|
extensions |= EXTENSION_FENCED_CODE
|
|
|
|
extensions |= EXTENSION_AUTOLINK
|
|
|
|
extensions |= EXTENSION_STRIKETHROUGH
|
|
|
|
extensions |= EXTENSION_SPACE_HEADERS
|
|
|
|
|
|
|
|
return Markdown(input, renderer, extensions)
|
|
|
|
}
|
|
|
|
|
2011-07-07 19:56:45 +02:00
|
|
|
// Markdown is the main rendering function.
|
|
|
|
// It parses and renders a block of markdown-encoded text.
|
|
|
|
// The supplied Renderer is used to format the output, and extensions dictates
|
|
|
|
// which non-standard extensions are enabled.
|
|
|
|
//
|
|
|
|
// To use the supplied Html or LaTeX renderers, see HtmlRenderer and
|
|
|
|
// LatexRenderer, respectively.
|
2011-06-29 19:13:17 +02:00
|
|
|
func Markdown(input []byte, renderer Renderer, extensions int) []byte {
|
2011-05-29 05:17:53 +02:00
|
|
|
// no point in parsing if we can't render
|
|
|
|
if renderer == nil {
|
2011-05-29 06:37:12 +02:00
|
|
|
return nil
|
2011-05-26 04:46:16 +02:00
|
|
|
}
|
|
|
|
|
2011-05-29 05:17:53 +02:00
|
|
|
// fill in the render structure
|
2011-07-07 19:56:45 +02:00
|
|
|
p := new(parser)
|
|
|
|
p.r = renderer
|
|
|
|
p.flags = extensions
|
|
|
|
p.refs = make(map[string]*reference)
|
|
|
|
p.maxNesting = 16
|
|
|
|
p.insideLink = false
|
2011-05-29 19:43:18 +02:00
|
|
|
|
|
|
|
// register inline parsers
|
2011-07-07 19:56:45 +02:00
|
|
|
p.inlineCallback['*'] = emphasis
|
|
|
|
p.inlineCallback['_'] = emphasis
|
2011-06-29 19:13:17 +02:00
|
|
|
if extensions&EXTENSION_STRIKETHROUGH != 0 {
|
2011-07-07 19:56:45 +02:00
|
|
|
p.inlineCallback['~'] = emphasis
|
2011-05-29 05:17:53 +02:00
|
|
|
}
|
2011-07-07 19:56:45 +02:00
|
|
|
p.inlineCallback['`'] = codeSpan
|
|
|
|
p.inlineCallback['\n'] = lineBreak
|
|
|
|
p.inlineCallback['['] = link
|
|
|
|
p.inlineCallback['<'] = leftAngle
|
|
|
|
p.inlineCallback['\\'] = escape
|
|
|
|
p.inlineCallback['&'] = entity
|
2011-05-26 04:46:16 +02:00
|
|
|
|
2011-05-29 05:17:53 +02:00
|
|
|
if extensions&EXTENSION_AUTOLINK != 0 {
|
2011-07-07 19:56:45 +02:00
|
|
|
p.inlineCallback[':'] = autoLink
|
2011-05-29 05:17:53 +02:00
|
|
|
}
|
|
|
|
|
2011-07-07 19:56:45 +02:00
|
|
|
first := firstPass(p, input)
|
|
|
|
second := secondPass(p, first)
|
2011-06-26 17:51:36 +02:00
|
|
|
|
|
|
|
return second
|
|
|
|
}
|
|
|
|
|
|
|
|
// first pass:
|
|
|
|
// - extract references
|
|
|
|
// - expand tabs
|
|
|
|
// - normalize newlines
|
|
|
|
// - copy everything else
|
2011-07-07 19:56:45 +02:00
|
|
|
func firstPass(p *parser, input []byte) []byte {
|
2011-06-26 17:51:36 +02:00
|
|
|
var out bytes.Buffer
|
2011-06-29 00:02:12 +02:00
|
|
|
tabSize := TAB_SIZE_DEFAULT
|
2011-07-07 19:56:45 +02:00
|
|
|
if p.flags&EXTENSION_TAB_SIZE_EIGHT != 0 {
|
2011-06-29 00:02:12 +02:00
|
|
|
tabSize = TAB_SIZE_EIGHT
|
2011-06-28 18:58:10 +02:00
|
|
|
}
|
2011-05-29 05:17:53 +02:00
|
|
|
beg, end := 0, 0
|
|
|
|
for beg < len(input) { // iterate over lines
|
2011-07-07 19:56:45 +02:00
|
|
|
if end = isReference(p, input[beg:]); end > 0 {
|
2011-05-29 05:17:53 +02:00
|
|
|
beg += end
|
|
|
|
} else { // skip to the next line
|
|
|
|
end = beg
|
|
|
|
for end < len(input) && input[end] != '\n' && input[end] != '\r' {
|
|
|
|
end++
|
|
|
|
}
|
|
|
|
|
|
|
|
// add the line body if present
|
|
|
|
if end > beg {
|
2011-07-01 17:57:11 +02:00
|
|
|
expandTabs(&out, input[beg:end], tabSize)
|
2011-05-29 05:17:53 +02:00
|
|
|
}
|
2011-06-28 18:58:10 +02:00
|
|
|
out.WriteByte('\n')
|
2011-05-29 05:17:53 +02:00
|
|
|
|
2011-06-26 17:51:36 +02:00
|
|
|
if end < len(input) && input[end] == '\r' {
|
|
|
|
end++
|
|
|
|
}
|
|
|
|
if end < len(input) && input[end] == '\n' {
|
2011-05-29 05:17:53 +02:00
|
|
|
end++
|
|
|
|
}
|
|
|
|
|
|
|
|
beg = end
|
|
|
|
}
|
|
|
|
}
|
2011-07-03 18:51:07 +02:00
|
|
|
|
|
|
|
// empty input?
|
|
|
|
if out.Len() == 0 {
|
|
|
|
out.WriteByte('\n')
|
|
|
|
}
|
|
|
|
|
2011-06-26 17:51:36 +02:00
|
|
|
return out.Bytes()
|
|
|
|
}
|
2011-05-29 05:17:53 +02:00
|
|
|
|
2011-06-26 17:51:36 +02:00
|
|
|
// second pass: actual rendering
|
2011-07-07 19:56:45 +02:00
|
|
|
func secondPass(p *parser, input []byte) []byte {
|
2011-05-31 19:11:04 +02:00
|
|
|
var output bytes.Buffer
|
2011-05-29 05:17:53 +02:00
|
|
|
|
2011-07-07 19:56:45 +02:00
|
|
|
p.r.DocumentHeader(&output)
|
|
|
|
p.block(&output, input)
|
|
|
|
p.r.DocumentFooter(&output)
|
2011-05-29 05:17:53 +02:00
|
|
|
|
2011-07-07 19:56:45 +02:00
|
|
|
if p.nesting != 0 {
|
2011-05-29 05:17:53 +02:00
|
|
|
panic("Nesting level did not end at zero")
|
|
|
|
}
|
2011-05-29 06:37:12 +02:00
|
|
|
|
2011-05-29 06:50:33 +02:00
|
|
|
return output.Bytes()
|
2011-05-29 05:17:53 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-05-25 21:59:30 +02:00
|
|
|
//
|
2011-05-29 05:17:53 +02:00
|
|
|
// Link references
|
2011-05-25 21:59:30 +02:00
|
|
|
//
|
2011-05-29 05:17:53 +02:00
|
|
|
// This section implements support for references that (usually) appear
|
|
|
|
// as footnotes in a document, and can be referenced anywhere in the document.
|
|
|
|
// The basic format is:
|
2011-05-25 21:59:30 +02:00
|
|
|
//
|
2011-05-29 05:17:53 +02:00
|
|
|
// [1]: http://www.google.com/ "Google"
|
|
|
|
// [2]: http://www.github.com/ "Github"
|
2011-05-25 21:59:30 +02:00
|
|
|
//
|
2011-05-29 05:17:53 +02:00
|
|
|
// Anywhere in the document, the reference can be linked by referring to its
|
|
|
|
// label, i.e., 1 and 2 in this example, as in:
|
|
|
|
//
|
|
|
|
// This library is hosted on [Github][2], a git hosting site.
|
2011-05-25 21:59:30 +02:00
|
|
|
|
2011-05-29 05:17:53 +02:00
|
|
|
// References are parsed and stored in this struct.
|
2011-05-29 19:43:18 +02:00
|
|
|
type reference struct {
|
2011-05-29 05:17:53 +02:00
|
|
|
link []byte
|
|
|
|
title []byte
|
2011-05-25 00:14:35 +02:00
|
|
|
}
|
|
|
|
|
2011-05-29 05:17:53 +02:00
|
|
|
// Check whether or not data starts with a reference link.
|
|
|
|
// If so, it is parsed and stored in the list of references
|
|
|
|
// (in the render struct).
|
2011-06-26 17:51:36 +02:00
|
|
|
// Returns the number of bytes to skip to move past it,
|
|
|
|
// or zero if the first line is not a reference.
|
2011-07-07 19:56:45 +02:00
|
|
|
func isReference(p *parser, data []byte) int {
|
2011-05-29 05:17:53 +02:00
|
|
|
// up to 3 optional leading spaces
|
|
|
|
if len(data) < 4 {
|
|
|
|
return 0
|
2011-05-25 00:14:35 +02:00
|
|
|
}
|
2011-05-29 05:17:53 +02:00
|
|
|
i := 0
|
|
|
|
for i < 3 && data[i] == ' ' {
|
|
|
|
i++
|
2011-05-25 00:14:35 +02:00
|
|
|
}
|
2011-05-29 05:17:53 +02:00
|
|
|
|
|
|
|
// id part: anything but a newline between brackets
|
|
|
|
if data[i] != '[' {
|
|
|
|
return 0
|
2011-05-25 00:14:35 +02:00
|
|
|
}
|
2011-05-29 05:17:53 +02:00
|
|
|
i++
|
2011-06-29 00:02:12 +02:00
|
|
|
idOffset := i
|
2011-05-29 05:17:53 +02:00
|
|
|
for i < len(data) && data[i] != '\n' && data[i] != '\r' && data[i] != ']' {
|
|
|
|
i++
|
2011-05-25 00:14:35 +02:00
|
|
|
}
|
2011-05-29 05:17:53 +02:00
|
|
|
if i >= len(data) || data[i] != ']' {
|
|
|
|
return 0
|
2011-05-25 00:14:35 +02:00
|
|
|
}
|
2011-06-29 00:02:12 +02:00
|
|
|
idEnd := i
|
2011-05-25 00:14:35 +02:00
|
|
|
|
2011-05-29 05:17:53 +02:00
|
|
|
// spacer: colon (space | tab)* newline? (space | tab)*
|
|
|
|
i++
|
|
|
|
if i >= len(data) || data[i] != ':' {
|
|
|
|
return 0
|
2011-05-25 21:59:30 +02:00
|
|
|
}
|
2011-05-29 05:17:53 +02:00
|
|
|
i++
|
|
|
|
for i < len(data) && (data[i] == ' ' || data[i] == '\t') {
|
|
|
|
i++
|
2011-05-25 21:59:30 +02:00
|
|
|
}
|
2011-05-29 05:17:53 +02:00
|
|
|
if i < len(data) && (data[i] == '\n' || data[i] == '\r') {
|
|
|
|
i++
|
|
|
|
if i < len(data) && data[i] == '\n' && data[i-1] == '\r' {
|
|
|
|
i++
|
2011-05-25 21:59:30 +02:00
|
|
|
}
|
|
|
|
}
|
2011-05-29 05:17:53 +02:00
|
|
|
for i < len(data) && (data[i] == ' ' || data[i] == '\t') {
|
|
|
|
i++
|
|
|
|
}
|
|
|
|
if i >= len(data) {
|
|
|
|
return 0
|
2011-05-25 21:59:30 +02:00
|
|
|
}
|
|
|
|
|
2011-05-29 05:17:53 +02:00
|
|
|
// link: whitespace-free sequence, optionally between angle brackets
|
|
|
|
if data[i] == '<' {
|
2011-05-26 00:00:01 +02:00
|
|
|
i++
|
|
|
|
}
|
2011-06-29 00:02:12 +02:00
|
|
|
linkOffset := i
|
2011-05-29 05:17:53 +02:00
|
|
|
for i < len(data) && data[i] != ' ' && data[i] != '\t' && data[i] != '\n' && data[i] != '\r' {
|
|
|
|
i++
|
2011-05-27 21:38:10 +02:00
|
|
|
}
|
2011-06-29 00:02:12 +02:00
|
|
|
linkEnd := i
|
|
|
|
if data[linkOffset] == '<' && data[linkEnd-1] == '>' {
|
|
|
|
linkOffset++
|
|
|
|
linkEnd--
|
2011-05-27 21:38:10 +02:00
|
|
|
}
|
2011-05-27 06:27:33 +02:00
|
|
|
|
2011-05-29 05:17:53 +02:00
|
|
|
// optional spacer: (space | tab)* (newline | '\'' | '"' | '(' )
|
|
|
|
for i < len(data) && (data[i] == ' ' || data[i] == '\t') {
|
|
|
|
i++
|
2011-05-27 06:27:33 +02:00
|
|
|
}
|
2011-05-29 05:17:53 +02:00
|
|
|
if i < len(data) && data[i] != '\n' && data[i] != '\r' && data[i] != '\'' && data[i] != '"' && data[i] != '(' {
|
2011-05-27 06:27:33 +02:00
|
|
|
return 0
|
|
|
|
}
|
|
|
|
|
2011-05-29 05:17:53 +02:00
|
|
|
// compute end-of-line
|
2011-06-29 00:02:12 +02:00
|
|
|
lineEnd := 0
|
2011-05-29 05:17:53 +02:00
|
|
|
if i >= len(data) || data[i] == '\r' || data[i] == '\n' {
|
2011-06-29 00:02:12 +02:00
|
|
|
lineEnd = i
|
2011-05-27 06:27:33 +02:00
|
|
|
}
|
2011-05-29 05:17:53 +02:00
|
|
|
if i+1 < len(data) && data[i] == '\r' && data[i+1] == '\n' {
|
2011-06-29 00:02:12 +02:00
|
|
|
lineEnd++
|
2011-05-29 01:37:18 +02:00
|
|
|
}
|
|
|
|
|
2011-05-29 05:17:53 +02:00
|
|
|
// optional (space|tab)* spacer after a newline
|
2011-06-29 00:02:12 +02:00
|
|
|
if lineEnd > 0 {
|
|
|
|
i = lineEnd + 1
|
2011-05-29 05:17:53 +02:00
|
|
|
for i < len(data) && (data[i] == ' ' || data[i] == '\t') {
|
|
|
|
i++
|
2011-05-29 01:37:18 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-05-29 05:17:53 +02:00
|
|
|
// optional title: any non-newline sequence enclosed in '"() alone on its line
|
2011-06-29 00:02:12 +02:00
|
|
|
titleOffset, titleEnd := 0, 0
|
2011-05-29 05:17:53 +02:00
|
|
|
if i+1 < len(data) && (data[i] == '\'' || data[i] == '"' || data[i] == '(') {
|
2011-05-27 06:27:33 +02:00
|
|
|
i++
|
2011-06-29 00:02:12 +02:00
|
|
|
titleOffset = i
|
2011-05-27 06:27:33 +02:00
|
|
|
|
2011-05-29 05:17:53 +02:00
|
|
|
// look for EOL
|
|
|
|
for i < len(data) && data[i] != '\n' && data[i] != '\r' {
|
|
|
|
i++
|
2011-05-27 06:27:33 +02:00
|
|
|
}
|
2011-05-29 05:17:53 +02:00
|
|
|
if i+1 < len(data) && data[i] == '\n' && data[i+1] == '\r' {
|
2011-06-29 00:02:12 +02:00
|
|
|
titleEnd = i + 1
|
2011-05-29 05:17:53 +02:00
|
|
|
} else {
|
2011-06-29 00:02:12 +02:00
|
|
|
titleEnd = i
|
2011-05-29 01:37:18 +02:00
|
|
|
}
|
|
|
|
|
2011-05-29 05:17:53 +02:00
|
|
|
// step back
|
|
|
|
i--
|
2011-06-29 00:02:12 +02:00
|
|
|
for i > titleOffset && (data[i] == ' ' || data[i] == '\t') {
|
2011-05-29 05:17:53 +02:00
|
|
|
i--
|
2011-05-29 01:37:18 +02:00
|
|
|
}
|
2011-06-29 00:02:12 +02:00
|
|
|
if i > titleOffset && (data[i] == '\'' || data[i] == '"' || data[i] == ')') {
|
|
|
|
lineEnd = titleEnd
|
|
|
|
titleEnd = i
|
2011-05-29 01:37:18 +02:00
|
|
|
}
|
|
|
|
}
|
2011-06-29 00:02:12 +02:00
|
|
|
if lineEnd == 0 { // garbage after the link
|
2011-05-29 01:37:18 +02:00
|
|
|
return 0
|
|
|
|
}
|
|
|
|
|
2011-05-29 05:17:53 +02:00
|
|
|
// a valid ref has been found
|
2011-05-29 19:43:18 +02:00
|
|
|
|
|
|
|
// id matches are case-insensitive
|
2011-06-29 00:02:12 +02:00
|
|
|
id := string(bytes.ToLower(data[idOffset:idEnd]))
|
2011-07-07 19:56:45 +02:00
|
|
|
p.refs[id] = &reference{
|
2011-06-29 00:02:12 +02:00
|
|
|
link: data[linkOffset:linkEnd],
|
|
|
|
title: data[titleOffset:titleEnd],
|
2011-05-29 19:43:18 +02:00
|
|
|
}
|
2011-05-29 01:37:18 +02:00
|
|
|
|
2011-06-29 00:02:12 +02:00
|
|
|
return lineEnd
|
2011-05-29 01:37:18 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-05-29 05:17:53 +02:00
|
|
|
//
|
|
|
|
//
|
|
|
|
// Miscellaneous helper functions
|
|
|
|
//
|
|
|
|
//
|
2011-05-29 01:37:18 +02:00
|
|
|
|
|
|
|
|
2011-05-29 05:17:53 +02:00
|
|
|
// Test if a character is a punctuation symbol.
|
|
|
|
// Taken from a private function in regexp in the stdlib.
|
|
|
|
func ispunct(c byte) bool {
|
|
|
|
for _, r := range []byte("!\"#$%&'()*+,-./:;<=>?@[\\]^_`{|}~") {
|
|
|
|
if c == r {
|
|
|
|
return true
|
2011-05-29 01:37:18 +02:00
|
|
|
}
|
|
|
|
}
|
2011-05-29 05:17:53 +02:00
|
|
|
return false
|
2011-05-29 01:37:18 +02:00
|
|
|
}
|
|
|
|
|
2011-05-29 05:17:53 +02:00
|
|
|
// Test if a character is a whitespace character.
|
|
|
|
func isspace(c byte) bool {
|
|
|
|
return c == ' ' || c == '\t' || c == '\n' || c == '\r' || c == '\f' || c == '\v'
|
2011-05-29 01:37:18 +02:00
|
|
|
}
|
|
|
|
|
2011-05-29 05:17:53 +02:00
|
|
|
// Test if a character is a letter or a digit.
|
2011-05-29 19:43:18 +02:00
|
|
|
// TODO: check when this is looking for ASCII alnum and when it should use unicode
|
2011-05-29 05:17:53 +02:00
|
|
|
func isalnum(c byte) bool {
|
|
|
|
return (c >= '0' && c <= '9') || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')
|
2011-05-29 01:37:18 +02:00
|
|
|
}
|
2011-05-27 06:27:33 +02:00
|
|
|
|
2011-05-29 05:17:53 +02:00
|
|
|
// Replace tab characters with spaces, aligning to the next TAB_SIZE column.
|
2011-06-26 17:51:36 +02:00
|
|
|
// always ends output with a newline
|
2011-06-29 00:02:12 +02:00
|
|
|
func expandTabs(out *bytes.Buffer, line []byte, tabSize int) {
|
2011-05-31 20:04:58 +02:00
|
|
|
// first, check for common cases: no tabs, or only tabs at beginning of line
|
|
|
|
i, prefix := 0, 0
|
|
|
|
slowcase := false
|
|
|
|
for i = 0; i < len(line); i++ {
|
|
|
|
if line[i] == '\t' {
|
|
|
|
if prefix == i {
|
|
|
|
prefix++
|
|
|
|
} else {
|
|
|
|
slowcase = true
|
|
|
|
break
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2011-05-26 04:46:16 +02:00
|
|
|
|
2011-05-31 20:04:58 +02:00
|
|
|
// no need to decode runes if all tabs are at the beginning of the line
|
|
|
|
if !slowcase {
|
2011-06-29 00:02:12 +02:00
|
|
|
for i = 0; i < prefix*tabSize; i++ {
|
2011-05-31 20:04:58 +02:00
|
|
|
out.WriteByte(' ')
|
|
|
|
}
|
|
|
|
out.Write(line[prefix:])
|
|
|
|
return
|
|
|
|
}
|
|
|
|
|
|
|
|
// the slow case: we need to count runes to figure out how
|
|
|
|
// many spaces to insert for each tab
|
|
|
|
column := 0
|
2011-06-24 19:50:03 +02:00
|
|
|
i = 0
|
2011-05-26 04:46:16 +02:00
|
|
|
for i < len(line) {
|
2011-05-31 20:04:58 +02:00
|
|
|
start := i
|
2011-05-26 04:46:16 +02:00
|
|
|
for i < len(line) && line[i] != '\t' {
|
2011-05-31 20:04:58 +02:00
|
|
|
_, size := utf8.DecodeRune(line[i:])
|
|
|
|
i += size
|
|
|
|
column++
|
2011-05-26 04:46:16 +02:00
|
|
|
}
|
|
|
|
|
2011-05-31 20:04:58 +02:00
|
|
|
if i > start {
|
|
|
|
out.Write(line[start:i])
|
2011-05-26 04:46:16 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
if i >= len(line) {
|
|
|
|
break
|
|
|
|
}
|
|
|
|
|
|
|
|
for {
|
2011-05-29 19:43:18 +02:00
|
|
|
out.WriteByte(' ')
|
2011-05-31 20:04:58 +02:00
|
|
|
column++
|
2011-06-29 00:02:12 +02:00
|
|
|
if column%tabSize == 0 {
|
2011-05-26 04:46:16 +02:00
|
|
|
break
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
i++
|
|
|
|
}
|
|
|
|
}
|