mirror of
https://github.com/LukeHagar/libopenapi.git
synced 2025-12-09 20:47:44 +00:00
Designs for handling multiple versions of objects have been set, seems clean and scalable. Generic functions for handling maps has been added also, which will cut down time moving forward.
185 lines
5.1 KiB
Go
185 lines
5.1 KiB
Go
// Copyright 2022 Princess B33f Heavy Industries / Dave Shanley
|
|
// SPDX-License-Identifier: MIT
|
|
|
|
package v2
|
|
|
|
import (
|
|
"github.com/pb33f/libopenapi/datamodel/low"
|
|
"github.com/pb33f/libopenapi/index"
|
|
"github.com/pb33f/libopenapi/utils"
|
|
"gopkg.in/yaml.v3"
|
|
)
|
|
|
|
// Header Represents a low-level Swagger / OpenAPI 2 Header object.
|
|
//
|
|
// A Header is essentially identical to a Parameter, except it does not contain 'name' or 'in' properties.
|
|
// - https://swagger.io/specification/v2/#headerObject
|
|
type Header struct {
|
|
Type low.NodeReference[string]
|
|
Format low.NodeReference[string]
|
|
Description low.NodeReference[string]
|
|
Items low.NodeReference[*Items]
|
|
CollectionFormat low.NodeReference[string]
|
|
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[string]]
|
|
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 (h *Header) FindExtension(ext string) *low.ValueReference[any] {
|
|
return low.FindItemInMap[any](ext, h.Extensions)
|
|
}
|
|
|
|
// Build will build out items, extensions and default value from the supplied node.
|
|
func (h *Header) Build(root *yaml.Node, idx *index.SpecIndex) error {
|
|
h.Extensions = low.ExtractExtensions(root)
|
|
items, err := low.ExtractObject[*Items](ItemsLabel, root, idx)
|
|
if err != nil {
|
|
return err
|
|
}
|
|
h.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)
|
|
h.Default = low.NodeReference[any]{
|
|
Value: j,
|
|
KeyNode: ln,
|
|
ValueNode: vn,
|
|
}
|
|
return nil
|
|
}
|
|
h.Default = low.NodeReference[any]{
|
|
Value: k,
|
|
KeyNode: ln,
|
|
ValueNode: vn,
|
|
}
|
|
return nil
|
|
}
|
|
h.Default = low.NodeReference[any]{
|
|
Value: n,
|
|
KeyNode: ln,
|
|
ValueNode: vn,
|
|
}
|
|
return nil
|
|
}
|
|
return nil
|
|
}
|
|
|
|
// IsHeader compliance methods
|
|
|
|
func (h *Header) GetType() *low.NodeReference[string] {
|
|
return &h.Type
|
|
}
|
|
func (h *Header) GetDescription() *low.NodeReference[string] {
|
|
return &h.Description
|
|
}
|
|
|
|
func (h *Header) GetDeprecated() *low.NodeReference[bool] {
|
|
// not implemented.
|
|
return nil
|
|
}
|
|
func (h *Header) GetSchema() *low.NodeReference[any] {
|
|
// not implemented.
|
|
return &low.NodeReference[any]{}
|
|
}
|
|
func (h *Header) GetFormat() *low.NodeReference[string] {
|
|
return &h.Format
|
|
}
|
|
func (h *Header) GetItems() *low.NodeReference[any] {
|
|
i := low.NodeReference[any]{
|
|
KeyNode: h.Items.KeyNode,
|
|
ValueNode: h.Items.ValueNode,
|
|
Value: h.Items.KeyNode,
|
|
}
|
|
return &i
|
|
}
|
|
func (h *Header) GetStyle() *low.NodeReference[string] {
|
|
// not implemented.
|
|
return nil
|
|
}
|
|
func (h *Header) GetCollectionFormat() *low.NodeReference[string] {
|
|
return &h.CollectionFormat
|
|
}
|
|
func (h *Header) GetDefault() *low.NodeReference[any] {
|
|
return &h.Default
|
|
}
|
|
func (h *Header) GetAllowReserved() *low.NodeReference[bool] {
|
|
return nil // not implemented
|
|
}
|
|
func (h *Header) GetExplode() *low.NodeReference[bool] {
|
|
return nil // not implemented
|
|
}
|
|
func (h *Header) GetMaximum() *low.NodeReference[int] {
|
|
return &h.Maximum
|
|
}
|
|
func (h *Header) GetExclusiveMaximum() *low.NodeReference[bool] {
|
|
return &h.ExclusiveMaximum
|
|
}
|
|
func (h *Header) GetMinimum() *low.NodeReference[int] {
|
|
return &h.Minimum
|
|
}
|
|
func (h *Header) GetExclusiveMinimum() *low.NodeReference[bool] {
|
|
return &h.ExclusiveMinimum
|
|
}
|
|
func (h *Header) GetMaxLength() *low.NodeReference[int] {
|
|
return &h.MaxLength
|
|
}
|
|
func (h *Header) GetMinLength() *low.NodeReference[int] {
|
|
return &h.MinLength
|
|
}
|
|
func (h *Header) GetPattern() *low.NodeReference[string] {
|
|
return &h.Pattern
|
|
}
|
|
func (h *Header) GetMaxItems() *low.NodeReference[int] {
|
|
return &h.MaxItems
|
|
}
|
|
func (h *Header) GetMinItems() *low.NodeReference[int] {
|
|
return &h.MaxItems
|
|
}
|
|
func (h *Header) GetUniqueItems() *low.NodeReference[bool] {
|
|
return &h.UniqueItems
|
|
}
|
|
func (h *Header) GetEnum() *low.NodeReference[[]low.ValueReference[string]] {
|
|
return &h.Enum
|
|
}
|
|
func (h *Header) GetMultipleOf() *low.NodeReference[int] {
|
|
return &h.MultipleOf
|
|
}
|
|
func (h *Header) GetExample() *low.NodeReference[any] {
|
|
return nil // not implemented
|
|
}
|
|
func (h *Header) GetExamples() *low.NodeReference[any] {
|
|
return nil // not implemented
|
|
}
|
|
func (h *Header) GetContent() *low.NodeReference[any] {
|
|
return nil // not implemented
|
|
}
|
|
|
|
func (h *Header) GetRequired() *low.NodeReference[bool] {
|
|
return nil // not implemented
|
|
}
|
|
func (h *Header) GetAllowEmptyValue() *low.NodeReference[bool] {
|
|
return nil // not implemented
|
|
}
|