type github.com/russross/blackfriday/v2.Node

77 uses

	github.com/russross/blackfriday/v2 (current package)
		block.go#L201: func (p *Markdown) addBlock(typ NodeType, content []byte) *Node {
		block.go#L417: func finalizeHTMLBlock(block *Node) {
		block.go#L729: func finalizeCodeBlock(block *Node) {
		block.go#L1165: func endsWithBlankLine(block *Node) bool {
		block.go#L1181: func finalizeList(block *Node) {
		html.go#L314: func isSmartypantable(node *Node) bool {
		html.go#L340: func footnoteRef(prefix string, node *Node) []byte {
		html.go#L355: func itemOpenCR(node *Node) bool {
		html.go#L363: func skipParagraphTags(node *Node) bool {
		html.go#L505: func (r *HTMLRenderer) RenderNode(w io.Writer, node *Node, entering bool) WalkStatus {
		html.go#L834: func (r *HTMLRenderer) RenderHeader(w io.Writer, ast *Node) {
		html.go#L842: func (r *HTMLRenderer) RenderFooter(w io.Writer, ast *Node) {
		html.go#L897: func (r *HTMLRenderer) writeTOC(w io.Writer, ast *Node) {
		html.go#L904: 	ast.Walk(func(node *Node, entering bool) WalkStatus {
		inline.go#L49: func (p *Markdown) inline(currBlock *Node, data []byte) {
		inline.go#L86: func emphasis(p *Markdown, data []byte, offset int) (int, *Node) {
		inline.go#L131: func codeSpan(p *Markdown, data []byte, offset int) (int, *Node) {
		inline.go#L178: func maybeLineBreak(p *Markdown, data []byte, offset int) (int, *Node) {
		inline.go#L194: func lineBreak(p *Markdown, data []byte, offset int) (int, *Node) {
		inline.go#L217: func maybeImage(p *Markdown, data []byte, offset int) (int, *Node) {
		inline.go#L224: func maybeInlineFootnote(p *Markdown, data []byte, offset int) (int, *Node) {
		inline.go#L232: func link(p *Markdown, data []byte, offset int) (int, *Node) {
		inline.go#L301: 	var footnoteNode *Node
		inline.go#L549: 	var linkNode *Node
		inline.go#L630: func leftAngle(p *Markdown, data []byte, offset int) (int, *Node) {
		inline.go#L663: func escape(p *Markdown, data []byte, offset int) (int, *Node) {
		inline.go#L703: func entity(p *Markdown, data []byte, offset int) (int, *Node) {
		inline.go#L765: func maybeAutoLink(p *Markdown, data []byte, offset int) (int, *Node) {
		inline.go#L782: func autoLink(p *Markdown, data []byte, offset int) (int, *Node) {
		inline.go#L1112: func helperEmphasis(p *Markdown, data []byte, c byte) (int, *Node) {
		inline.go#L1152: func helperDoubleEmphasis(p *Markdown, data []byte, c byte) (int, *Node) {
		inline.go#L1176: func helperTripleEmphasis(p *Markdown, data []byte, offset int, c byte) (int, *Node) {
		inline.go#L1220: func text(s []byte) *Node {
		markdown.go#L148: 	RenderNode(w io.Writer, node *Node, entering bool) WalkStatus
		markdown.go#L161: 	RenderHeader(w io.Writer, ast *Node)
		markdown.go#L164: 	RenderFooter(w io.Writer, ast *Node)
		markdown.go#L169: type inlineParser func(p *Markdown, data []byte, offset int) (int, *Node)
		markdown.go#L188: 	doc                  *Node
		markdown.go#L189: 	tip                  *Node // = doc
		markdown.go#L190: 	oldTip               *Node
		markdown.go#L191: 	lastMatchedContainer *Node // = doc
		markdown.go#L215: func (p *Markdown) finalize(block *Node) {
		markdown.go#L221: func (p *Markdown) addChild(node NodeType, offset uint32) *Node {
		markdown.go#L225: func (p *Markdown) addExistingChild(node *Node, offset uint32) *Node {
		markdown.go#L391: 	ast.Walk(func(node *Node, entering bool) WalkStatus {
		markdown.go#L403: func (p *Markdown) Parse(input []byte) *Node {
		markdown.go#L410: 	p.doc.Walk(func(node *Node, entering bool) WalkStatus {
		markdown.go#L451: 	block.Walk(func(node *Node, entering bool) WalkStatus {
		markdown.go#L531: 	footnote *Node // a link to the Item node within a list of footnotes
		node.go#L87: 	Footnote    *Node  // If it's a footnote, this is a direct link to the footnote Node. Otherwise nil.
		node.go#L115: type Node struct {
		node.go#L117: 	Parent     *Node    // Points to the parent
		node.go#L118: 	FirstChild *Node    // Points to the first child, if any
		node.go#L119: 	LastChild  *Node    // Points to the last child, if any
		node.go#L120: 	Prev       *Node    // Previous sibling; nil if it's the first child
		node.go#L121: 	Next       *Node    // Next sibling; nil if it's the last child
		node.go#L136: func NewNode(typ NodeType) *Node {
		node.go#L137: 	return &Node{
		node.go#L143: func (n *Node) String() string {
		node.go#L155: func (n *Node) Unlink() {
		node.go#L173: func (n *Node) AppendChild(child *Node) {
		node.go#L188: func (n *Node) InsertBefore(sibling *Node) {
		node.go#L202: func (n *Node) isContainer() bool {
		node.go#L241: func (n *Node) canContain(t NodeType) bool {
		node.go#L277: type NodeVisitor func(node *Node, entering bool) WalkStatus
		node.go#L281: func (n *Node) Walk(visitor NodeVisitor) {
		node.go#L298: 	current  *Node
		node.go#L299: 	root     *Node
		node.go#L303: func newNodeWalker(root *Node) *nodeWalker {
		node.go#L332: func dump(ast *Node) {
		node.go#L336: func dumpR(ast *Node, depth int) string {
		node.go#L352: func dumpString(ast *Node) string {

	golang.org/x/pkgsite/internal/frontend
		overview.go#L40: 	rootNode.Walk(func(node *blackfriday.Node, entering bool) blackfriday.WalkStatus {

	golang.org/x/pkgsite/internal/postgres
		searchdoc.go#L190: func walkMarkdown(n *blackfriday.Node, buf []byte, level int) []byte {