mirror of
https://github.com/hanzoai/forge.git
synced 2026-10-30 15:00:39 +00:00
zeekayandHanzo Dev
aa87442fdd
Source files keep their SPDX-License-Identifier and Hanzo copyright line; the Gitea, Gogs and LFS Test Server copyrights they used to repeat now live once in NOTICE, alongside LICENSE. The header lint accepts any copyright line above the SPDX line, so it no longer demands an upstream one. Co-authored-by: Hanzo Dev <[email protected]>
49 lines
1.0 KiB
Go
49 lines
1.0 KiB
Go
// Copyright 2026 Hanzo AI, Inc. All rights reserved.
|
|
// SPDX-License-Identifier: MIT
|
|
|
|
package math
|
|
|
|
import (
|
|
"github.com/yuin/goldmark/ast"
|
|
"github.com/yuin/goldmark/util"
|
|
)
|
|
|
|
// Inline struct represents inline math e.g. $...$ or \(...\)
|
|
type Inline struct {
|
|
ast.BaseInline
|
|
}
|
|
|
|
// Inline implements Inline.Inline.
|
|
func (n *Inline) Inline() {}
|
|
|
|
// IsBlank returns if this inline node is empty
|
|
func (n *Inline) IsBlank(source []byte) bool {
|
|
for c := n.FirstChild(); c != nil; c = c.NextSibling() {
|
|
text := c.(*ast.Text).Segment
|
|
if !util.IsBlank(text.Value(source)) {
|
|
return false
|
|
}
|
|
}
|
|
return true
|
|
}
|
|
|
|
// Dump renders this inline math as debug
|
|
func (n *Inline) Dump(source []byte, level int) {
|
|
ast.DumpHelper(n, source, level, nil, nil)
|
|
}
|
|
|
|
// KindInline is the kind for math inline
|
|
var KindInline = ast.NewNodeKind("MathInline")
|
|
|
|
// Kind returns KindInline
|
|
func (n *Inline) Kind() ast.NodeKind {
|
|
return KindInline
|
|
}
|
|
|
|
// NewInline creates a new ast math inline node
|
|
func NewInline() *Inline {
|
|
return &Inline{
|
|
BaseInline: ast.BaseInline{},
|
|
}
|
|
}
|