Thomas Pelletier
250e073408
* Benchmark script * Rewrite unmarshaler using the stack Instead of tracking the build chain using `target`s, use the stack instead. Working and most benchmarks look good, but regression on structs unmarshalling. ~60% slower on ReferenceFile/struct. * Shortcut to check if last node of iterator * Remove unecessary pointer allocation * Skip over unused keys without marking them as seen * Add some tests * Fix mktemp on macos
108 lines
1.7 KiB
Go
108 lines
1.7 KiB
Go
package toml
|
|
|
|
import (
|
|
"github.com/pelletier/go-toml/v2/internal/ast"
|
|
"github.com/pelletier/go-toml/v2/internal/tracker"
|
|
"github.com/pelletier/go-toml/v2/internal/unsafe"
|
|
)
|
|
|
|
type strict struct {
|
|
Enabled bool
|
|
|
|
// Tracks the current key being processed.
|
|
key tracker.KeyTracker
|
|
|
|
missing []decodeError
|
|
}
|
|
|
|
func (s *strict) EnterTable(node ast.Node) {
|
|
if !s.Enabled {
|
|
return
|
|
}
|
|
|
|
s.key.UpdateTable(node)
|
|
}
|
|
|
|
func (s *strict) EnterArrayTable(node ast.Node) {
|
|
if !s.Enabled {
|
|
return
|
|
}
|
|
|
|
s.key.UpdateArrayTable(node)
|
|
}
|
|
|
|
func (s *strict) EnterKeyValue(node ast.Node) {
|
|
if !s.Enabled {
|
|
return
|
|
}
|
|
|
|
s.key.Push(node)
|
|
}
|
|
|
|
func (s *strict) ExitKeyValue(node ast.Node) {
|
|
if !s.Enabled {
|
|
return
|
|
}
|
|
|
|
s.key.Pop(node)
|
|
}
|
|
|
|
func (s *strict) MissingTable(node ast.Node) {
|
|
if !s.Enabled {
|
|
return
|
|
}
|
|
|
|
s.missing = append(s.missing, decodeError{
|
|
highlight: keyLocation(node),
|
|
message: "missing table",
|
|
key: s.key.Key(),
|
|
})
|
|
}
|
|
|
|
func (s *strict) MissingField(node ast.Node) {
|
|
if !s.Enabled {
|
|
return
|
|
}
|
|
|
|
s.missing = append(s.missing, decodeError{
|
|
highlight: keyLocation(node),
|
|
message: "missing field",
|
|
key: s.key.Key(),
|
|
})
|
|
}
|
|
|
|
func (s *strict) Error(doc []byte) error {
|
|
if !s.Enabled || len(s.missing) == 0 {
|
|
return nil
|
|
}
|
|
|
|
err := &StrictMissingError{
|
|
Errors: make([]DecodeError, 0, len(s.missing)),
|
|
}
|
|
|
|
for _, derr := range s.missing {
|
|
derr := derr
|
|
err.Errors = append(err.Errors, *wrapDecodeError(doc, &derr))
|
|
}
|
|
|
|
return err
|
|
}
|
|
|
|
func keyLocation(node ast.Node) []byte {
|
|
k := node.Key()
|
|
|
|
hasOne := k.Next()
|
|
if !hasOne {
|
|
panic("should not be called with empty key")
|
|
}
|
|
|
|
start := k.Node().Data
|
|
end := k.Node().Data
|
|
|
|
for k.Next() {
|
|
end = k.Node().Data
|
|
}
|
|
|
|
return unsafe.BytesRange(start, end)
|
|
}
|