mirror of
https://github.com/LukeHagar/libopenapi.git
synced 2025-12-08 12:37:49 +00:00
0e0b99225d
No breaking changes, gofmt seems to have gone a little nuts for some reason, but this is an internal change that moves everything to a pointer, for better reflection use down the chain.
101 lines
3.2 KiB
Go
101 lines
3.2 KiB
Go
// Copyright 2022 Princess B33f Heavy Industries / Dave Shanley
|
|
// SPDX-License-Identifier: MIT
|
|
|
|
package model
|
|
|
|
import (
|
|
"github.com/pb33f/libopenapi/datamodel/low"
|
|
"github.com/pb33f/libopenapi/datamodel/low/v3"
|
|
)
|
|
|
|
// CallbackChanges represents all changes made between two Callback OpenAPI objects.
|
|
type CallbackChanges struct {
|
|
*PropertyChanges
|
|
ExpressionChanges map[string]*PathItemChanges `json:"expressions,omitempty" yaml:"expressions,omitempty"`
|
|
ExtensionChanges *ExtensionChanges `json:"extensions,omitempty" yaml:"extensions,omitempty"`
|
|
}
|
|
|
|
// TotalChanges returns a total count of all changes made between Callback objects
|
|
func (c *CallbackChanges) TotalChanges() int {
|
|
d := c.PropertyChanges.TotalChanges()
|
|
for k := range c.ExpressionChanges {
|
|
d += c.ExpressionChanges[k].TotalChanges()
|
|
}
|
|
if c.ExtensionChanges != nil {
|
|
d += c.ExtensionChanges.TotalChanges()
|
|
}
|
|
return d
|
|
}
|
|
|
|
// TotalBreakingChanges returns a total count of all changes made between Callback objects
|
|
func (c *CallbackChanges) TotalBreakingChanges() int {
|
|
d := c.PropertyChanges.TotalBreakingChanges()
|
|
for k := range c.ExpressionChanges {
|
|
d += c.ExpressionChanges[k].TotalBreakingChanges()
|
|
}
|
|
if c.ExtensionChanges != nil {
|
|
d += c.ExtensionChanges.TotalBreakingChanges()
|
|
}
|
|
return d
|
|
}
|
|
|
|
// CompareCallback will compare two Callback objects and return a pointer to CallbackChanges with all the things
|
|
// that have changed between them.
|
|
func CompareCallback(l, r *v3.Callback) *CallbackChanges {
|
|
|
|
cc := new(CallbackChanges)
|
|
var changes []*Change
|
|
|
|
lHashes := make(map[string]string)
|
|
rHashes := make(map[string]string)
|
|
|
|
lValues := make(map[string]low.ValueReference[*v3.PathItem])
|
|
rValues := make(map[string]low.ValueReference[*v3.PathItem])
|
|
|
|
for k := range l.Expression.Value {
|
|
lHashes[k.Value] = low.GenerateHashString(l.Expression.Value[k].Value)
|
|
lValues[k.Value] = l.Expression.Value[k]
|
|
}
|
|
|
|
for k := range r.Expression.Value {
|
|
rHashes[k.Value] = low.GenerateHashString(r.Expression.Value[k].Value)
|
|
rValues[k.Value] = r.Expression.Value[k]
|
|
}
|
|
|
|
expChanges := make(map[string]*PathItemChanges)
|
|
|
|
// check left path item hashes
|
|
for k := range lHashes {
|
|
rhash := rHashes[k]
|
|
if rhash == "" {
|
|
CreateChange(&changes, ObjectRemoved, k,
|
|
lValues[k].GetValueNode(), nil, true,
|
|
lValues[k].GetValue(), nil)
|
|
continue
|
|
}
|
|
if lHashes[k] == rHashes[k] {
|
|
continue
|
|
}
|
|
// run comparison.
|
|
expChanges[k] = ComparePathItems(lValues[k].Value, rValues[k].Value)
|
|
}
|
|
|
|
//check right path item hashes
|
|
for k := range rHashes {
|
|
lhash := lHashes[k]
|
|
if lhash == "" {
|
|
CreateChange(&changes, ObjectAdded, k,
|
|
nil, rValues[k].GetValueNode(), false,
|
|
nil, rValues[k].GetValue())
|
|
continue
|
|
}
|
|
}
|
|
cc.ExpressionChanges = expChanges
|
|
cc.ExtensionChanges = CompareExtensions(l.Extensions, r.Extensions)
|
|
cc.PropertyChanges = NewPropertyChanges(changes)
|
|
if cc.TotalChanges() <= 0 {
|
|
return nil
|
|
}
|
|
return cc
|
|
}
|