mirror of
https://github.com/LukeHagar/libopenapi.git
synced 2025-12-09 04:20:17 +00:00
248b4daa80
lookups are performed inline now. keeps things simpler, however it has a performance knock, so it's time to refine async building were possible.
97 lines
2.5 KiB
Go
97 lines
2.5 KiB
Go
package v3
|
|
|
|
import (
|
|
"github.com/pb33f/libopenapi/datamodel/low"
|
|
"github.com/pb33f/libopenapi/index"
|
|
"github.com/pb33f/libopenapi/utils"
|
|
"gopkg.in/yaml.v3"
|
|
)
|
|
|
|
const (
|
|
SecurityLabel = "security"
|
|
SecuritySchemesLabel = "securitySchemes"
|
|
OAuthFlowsLabel = "flows"
|
|
)
|
|
|
|
type SecurityScheme struct {
|
|
Type low.NodeReference[string]
|
|
Description low.NodeReference[string]
|
|
Name low.NodeReference[string]
|
|
In low.NodeReference[string]
|
|
Scheme low.NodeReference[string]
|
|
BearerFormat low.NodeReference[string]
|
|
Flows low.NodeReference[*OAuthFlows]
|
|
OpenIdConnectURL low.NodeReference[string]
|
|
Extensions map[low.KeyReference[string]]low.ValueReference[any]
|
|
}
|
|
|
|
type SecurityRequirement struct {
|
|
Value []low.ValueReference[map[low.KeyReference[string]][]low.ValueReference[string]]
|
|
}
|
|
|
|
func (ss *SecurityScheme) Build(root *yaml.Node, idx *index.SpecIndex) error {
|
|
ss.Extensions = ExtractExtensions(root)
|
|
|
|
oa, oaErr := ExtractObject[*OAuthFlows](OAuthFlowsLabel, root, idx)
|
|
if oaErr != nil {
|
|
return oaErr
|
|
}
|
|
if oa.Value != nil {
|
|
ss.Flows = oa
|
|
}
|
|
|
|
return nil
|
|
}
|
|
|
|
func (sr *SecurityRequirement) FindRequirement(name string) []low.ValueReference[string] {
|
|
for _, r := range sr.Value {
|
|
for k, v := range r.Value {
|
|
if k.Value == name {
|
|
return v
|
|
}
|
|
}
|
|
}
|
|
return nil
|
|
}
|
|
|
|
func (sr *SecurityRequirement) Build(root *yaml.Node, idx *index.SpecIndex) error {
|
|
if utils.IsNodeArray(root) {
|
|
var requirements []low.ValueReference[map[low.KeyReference[string]][]low.ValueReference[string]]
|
|
for _, n := range root.Content {
|
|
var currSec *yaml.Node
|
|
if utils.IsNodeMap(n) {
|
|
res := make(map[low.KeyReference[string]][]low.ValueReference[string])
|
|
var dat []low.ValueReference[string]
|
|
for i, r := range n.Content {
|
|
if i%2 == 0 {
|
|
currSec = r
|
|
continue
|
|
}
|
|
if utils.IsNodeArray(r) {
|
|
// value (should be) an array of strings
|
|
var keyValues []low.ValueReference[string]
|
|
for _, strN := range r.Content {
|
|
keyValues = append(keyValues, low.ValueReference[string]{
|
|
Value: strN.Value,
|
|
ValueNode: strN,
|
|
})
|
|
}
|
|
dat = keyValues
|
|
}
|
|
}
|
|
res[low.KeyReference[string]{
|
|
Value: currSec.Value,
|
|
KeyNode: currSec,
|
|
}] = dat
|
|
requirements = append(requirements, low.ValueReference[map[low.KeyReference[string]][]low.ValueReference[string]]{
|
|
Value: res,
|
|
ValueNode: n,
|
|
})
|
|
}
|
|
}
|
|
sr.Value = requirements
|
|
}
|
|
|
|
return nil
|
|
}
|