Go package for parsing a raw string into a tree of typed(-ish) nodes (that can also construct the original string again)
|
|
||
|---|---|---|
| coverage_badge.png | ||
| go.mod | ||
| go.sum | ||
| informer.go | ||
| informer_test.go | ||
| LICENSE | ||
| node.go | ||
| node_test.go | ||
| parser.go | ||
| parser_test.go | ||
| README.md | ||
| util.go | ||
Treeificator
A small module to turn a string into a tree of nodes based on a list of informers.
How to use
First import the module go get git.mstar.dev/mstar/treeificator
Then define the informers for the beginning and end of each node type you want
type PInformer struct{}
// The prefix starting a block of type PInformer
func (p *PInformer) GetPrefix() string {
return "<p>"
}
// The suffix ending a block of type PInformer
func (p *PInformer) GetSuffix() string {
return "</p>"
}
// The name of PInformer
func (p *PInformer) GetName() string {
return "p-element"
}
And finally parse any string
import "git.mstar.dev/mstar/treeificator"
treeRoot := treeificator.Marshal(yourString, &PInformer{})
See documentation for more details
