mirror of
https://github.com/LukeHagar/libopenapi.git
synced 2025-12-10 12:37:48 +00:00
Every `Build()` method now requires a `context.Context`. This is so the rolodex knows where to resolve from when locating relative links. Without knowing where we are, there is no way to resolve anything. This new mechanism allows the model to recurse across as many files as required to locate references, without loosing track of where we are in the process. Signed-off-by: quobix <dave@quobix.com>
213 lines
6.1 KiB
Go
213 lines
6.1 KiB
Go
// Copyright 2022 Princess B33f Heavy Industries / Dave Shanley
|
|
// SPDX-License-Identifier: MIT
|
|
|
|
package v2
|
|
|
|
import (
|
|
"context"
|
|
"crypto/sha256"
|
|
"fmt"
|
|
"github.com/pb33f/libopenapi/datamodel/low"
|
|
"github.com/pb33f/libopenapi/index"
|
|
"github.com/pb33f/libopenapi/utils"
|
|
"gopkg.in/yaml.v3"
|
|
"sort"
|
|
"strings"
|
|
)
|
|
|
|
// Items is a low-level representation of a Swagger / OpenAPI 2 Items object.
|
|
//
|
|
// Items is a limited subset of JSON-Schema's items object. It is used by parameter definitions that are not
|
|
// located in "body". Items, is actually identical to a Header, except it does not have description.
|
|
// - https://swagger.io/specification/v2/#itemsObject
|
|
type Items struct {
|
|
Type low.NodeReference[string]
|
|
Format low.NodeReference[string]
|
|
CollectionFormat low.NodeReference[string]
|
|
Items low.NodeReference[*Items]
|
|
Default low.NodeReference[any]
|
|
Maximum low.NodeReference[int]
|
|
ExclusiveMaximum low.NodeReference[bool]
|
|
Minimum low.NodeReference[int]
|
|
ExclusiveMinimum low.NodeReference[bool]
|
|
MaxLength low.NodeReference[int]
|
|
MinLength low.NodeReference[int]
|
|
Pattern low.NodeReference[string]
|
|
MaxItems low.NodeReference[int]
|
|
MinItems low.NodeReference[int]
|
|
UniqueItems low.NodeReference[bool]
|
|
Enum low.NodeReference[[]low.ValueReference[any]]
|
|
MultipleOf low.NodeReference[int]
|
|
Extensions map[low.KeyReference[string]]low.ValueReference[any]
|
|
}
|
|
|
|
// FindExtension will attempt to locate an extension value using a name lookup.
|
|
func (i *Items) FindExtension(ext string) *low.ValueReference[any] {
|
|
return low.FindItemInMap[any](ext, i.Extensions)
|
|
}
|
|
|
|
// GetExtensions returns all Items extensions and satisfies the low.HasExtensions interface.
|
|
func (i *Items) GetExtensions() map[low.KeyReference[string]]low.ValueReference[any] {
|
|
return i.Extensions
|
|
}
|
|
|
|
// Hash will return a consistent SHA256 Hash of the Items object
|
|
func (i *Items) Hash() [32]byte {
|
|
var f []string
|
|
if i.Type.Value != "" {
|
|
f = append(f, i.Type.Value)
|
|
}
|
|
if i.Format.Value != "" {
|
|
f = append(f, i.Format.Value)
|
|
}
|
|
if i.CollectionFormat.Value != "" {
|
|
f = append(f, i.CollectionFormat.Value)
|
|
}
|
|
if i.Default.Value != "" {
|
|
f = append(f, fmt.Sprintf("%x", sha256.Sum256([]byte(fmt.Sprint(i.Default.Value)))))
|
|
}
|
|
f = append(f, fmt.Sprint(i.Maximum.Value))
|
|
f = append(f, fmt.Sprint(i.Minimum.Value))
|
|
f = append(f, fmt.Sprint(i.ExclusiveMinimum.Value))
|
|
f = append(f, fmt.Sprint(i.ExclusiveMaximum.Value))
|
|
f = append(f, fmt.Sprint(i.MinLength.Value))
|
|
f = append(f, fmt.Sprint(i.MaxLength.Value))
|
|
f = append(f, fmt.Sprint(i.MinItems.Value))
|
|
f = append(f, fmt.Sprint(i.MaxItems.Value))
|
|
f = append(f, fmt.Sprint(i.MultipleOf.Value))
|
|
f = append(f, fmt.Sprint(i.UniqueItems.Value))
|
|
if i.Pattern.Value != "" {
|
|
f = append(f, fmt.Sprintf("%x", sha256.Sum256([]byte(fmt.Sprint(i.Pattern.Value)))))
|
|
}
|
|
keys := make([]string, len(i.Enum.Value))
|
|
z := 0
|
|
for k := range i.Enum.Value {
|
|
keys[z] = fmt.Sprint(i.Enum.Value[k].Value)
|
|
z++
|
|
}
|
|
sort.Strings(keys)
|
|
f = append(f, keys...)
|
|
|
|
if i.Items.Value != nil {
|
|
f = append(f, low.GenerateHashString(i.Items.Value))
|
|
}
|
|
keys = make([]string, len(i.Extensions))
|
|
z = 0
|
|
for k := range i.Extensions {
|
|
keys[z] = fmt.Sprintf("%s-%x", k.Value, sha256.Sum256([]byte(fmt.Sprint(i.Extensions[k].Value))))
|
|
z++
|
|
}
|
|
sort.Strings(keys)
|
|
f = append(f, keys...)
|
|
return sha256.Sum256([]byte(strings.Join(f, "|")))
|
|
}
|
|
|
|
// Build will build out items and default value.
|
|
func (i *Items) Build(ctx context.Context, _, root *yaml.Node, idx *index.SpecIndex) error {
|
|
root = utils.NodeAlias(root)
|
|
utils.CheckForMergeNodes(root)
|
|
i.Extensions = low.ExtractExtensions(root)
|
|
items, iErr := low.ExtractObject[*Items](ctx, ItemsLabel, root, idx)
|
|
if iErr != nil {
|
|
return iErr
|
|
}
|
|
i.Items = items
|
|
|
|
_, ln, vn := utils.FindKeyNodeFull(DefaultLabel, root.Content)
|
|
if vn != nil {
|
|
var n map[string]interface{}
|
|
err := vn.Decode(&n)
|
|
if err != nil {
|
|
// if not a map, then try an array
|
|
var k []interface{}
|
|
err = vn.Decode(&k)
|
|
if err != nil {
|
|
// lets just default to interface
|
|
var j interface{}
|
|
_ = vn.Decode(&j)
|
|
i.Default = low.NodeReference[any]{
|
|
Value: j,
|
|
KeyNode: ln,
|
|
ValueNode: vn,
|
|
}
|
|
return nil
|
|
}
|
|
i.Default = low.NodeReference[any]{
|
|
Value: k,
|
|
KeyNode: ln,
|
|
ValueNode: vn,
|
|
}
|
|
return nil
|
|
}
|
|
i.Default = low.NodeReference[any]{
|
|
Value: n,
|
|
KeyNode: ln,
|
|
ValueNode: vn,
|
|
}
|
|
return nil
|
|
}
|
|
return nil
|
|
}
|
|
|
|
// IsHeader compliance methods
|
|
|
|
func (i *Items) GetType() *low.NodeReference[string] {
|
|
return &i.Type
|
|
}
|
|
func (i *Items) GetFormat() *low.NodeReference[string] {
|
|
return &i.Format
|
|
}
|
|
func (i *Items) GetItems() *low.NodeReference[any] {
|
|
k := low.NodeReference[any]{
|
|
KeyNode: i.Items.KeyNode,
|
|
ValueNode: i.Items.ValueNode,
|
|
Value: i.Items.Value,
|
|
}
|
|
return &k
|
|
}
|
|
func (i *Items) GetCollectionFormat() *low.NodeReference[string] {
|
|
return &i.CollectionFormat
|
|
}
|
|
func (i *Items) GetDescription() *low.NodeReference[string] {
|
|
return nil // not implemented, but required to align with header contract
|
|
}
|
|
func (i *Items) GetDefault() *low.NodeReference[any] {
|
|
return &i.Default
|
|
}
|
|
func (i *Items) GetMaximum() *low.NodeReference[int] {
|
|
return &i.Maximum
|
|
}
|
|
func (i *Items) GetExclusiveMaximum() *low.NodeReference[bool] {
|
|
return &i.ExclusiveMaximum
|
|
}
|
|
func (i *Items) GetMinimum() *low.NodeReference[int] {
|
|
return &i.Minimum
|
|
}
|
|
func (i *Items) GetExclusiveMinimum() *low.NodeReference[bool] {
|
|
return &i.ExclusiveMinimum
|
|
}
|
|
func (i *Items) GetMaxLength() *low.NodeReference[int] {
|
|
return &i.MaxLength
|
|
}
|
|
func (i *Items) GetMinLength() *low.NodeReference[int] {
|
|
return &i.MinLength
|
|
}
|
|
func (i *Items) GetPattern() *low.NodeReference[string] {
|
|
return &i.Pattern
|
|
}
|
|
func (i *Items) GetMaxItems() *low.NodeReference[int] {
|
|
return &i.MaxItems
|
|
}
|
|
func (i *Items) GetMinItems() *low.NodeReference[int] {
|
|
return &i.MinItems
|
|
}
|
|
func (i *Items) GetUniqueItems() *low.NodeReference[bool] {
|
|
return &i.UniqueItems
|
|
}
|
|
func (i *Items) GetEnum() *low.NodeReference[[]low.ValueReference[any]] {
|
|
return &i.Enum
|
|
}
|
|
func (i *Items) GetMultipleOf() *low.NodeReference[int] {
|
|
return &i.MultipleOf
|
|
}
|