mirror of
https://github.com/LukeHagar/libopenapi.git
synced 2025-12-06 20:47:49 +00:00
Using some designs unearthed from building the higher level model, I have brough that design down to the lower level to speed things up. It only took 8 years, but finally, I think I have mastered mult-threading. No more deadlocks, and no more need for waitgroups for everything.
70 lines
1.3 KiB
Go
70 lines
1.3 KiB
Go
package low
|
|
|
|
import (
|
|
"fmt"
|
|
"github.com/pb33f/libopenapi/index"
|
|
"gopkg.in/yaml.v3"
|
|
)
|
|
|
|
type HasNode interface {
|
|
GetNode() *yaml.Node
|
|
}
|
|
|
|
type Buildable[T any] interface {
|
|
Build(node *yaml.Node, idx *index.SpecIndex) error
|
|
*T
|
|
}
|
|
|
|
type NodeReference[T any] struct {
|
|
Value T
|
|
ValueNode *yaml.Node
|
|
KeyNode *yaml.Node
|
|
}
|
|
|
|
type KeyReference[T any] struct {
|
|
Value T
|
|
KeyNode *yaml.Node
|
|
}
|
|
|
|
type ValueReference[T any] struct {
|
|
Value T
|
|
ValueNode *yaml.Node
|
|
}
|
|
|
|
func (n NodeReference[T]) IsEmpty() bool {
|
|
return n.KeyNode == nil && n.ValueNode == nil
|
|
}
|
|
|
|
func (n NodeReference[T]) GenerateMapKey() string {
|
|
return fmt.Sprintf("%d:%d", n.ValueNode.Line, n.ValueNode.Column)
|
|
}
|
|
|
|
func (n ValueReference[T]) IsEmpty() bool {
|
|
return n.ValueNode == nil
|
|
}
|
|
|
|
func (n ValueReference[T]) GenerateMapKey() string {
|
|
return fmt.Sprintf("%d:%d", n.ValueNode.Line, n.ValueNode.Column)
|
|
}
|
|
|
|
func (n KeyReference[T]) IsEmpty() bool {
|
|
return n.KeyNode == nil
|
|
}
|
|
|
|
func (n KeyReference[T]) GenerateMapKey() string {
|
|
return fmt.Sprintf("%d:%d", n.KeyNode.Line, n.KeyNode.Column)
|
|
}
|
|
|
|
func IsCircular(node *yaml.Node, idx *index.SpecIndex) bool {
|
|
if idx == nil {
|
|
return false // no index! nothing we can do.
|
|
}
|
|
refs := idx.GetCircularReferences()
|
|
for i := range idx.GetCircularReferences() {
|
|
if refs[i].LoopPoint.Node == node {
|
|
return true
|
|
}
|
|
}
|
|
return false
|
|
}
|