LukeParke/libopenapi
1
0
Fork 0
mirror of https://github.com/LukeHagar/libopenapi.git synced 2025-12-06 20:47:49 +00:00
Code Issues Packages Projects Releases Wiki Activity

99.9 % coverage & full OpenAPI v3 support

Browse Source 
A single line that tries to read an HTTP response body and fails is very hard to test without mocking, and the mock does not add value to a single line of code to check for an error that can rarely ever be triggered. Going to settle for 99.9% for now.
This commit is contained in:
Dave Shanley
2022-08-31 10:04:39 -04:00
parent 62a7c88631
commit 0de0c16c0c
6 changed files with 530 additions and 67 deletions
Download Patch File Download Diff File Expand all files Collapse all files

29
utils/utils.go
View File

@@ -30,6 +30,7 @@ const (
KebabCase
ScreamingKebabCase
RegularCase
UnknownCase
)
// FindNodes will find a node based on JSONPath, it accepts raw yaml/json as input.
@@ -169,7 +170,7 @@ func FindFirstKeyNode(key string, nodes []*yaml.Node, depth int) (keyNode *yaml.
for i, v := range nodes {
if key != "" && key == v.Value {
if i+1 >= len(nodes) {
return v, nodes[i] // next node is what we need.
return v, nodes[i] // this is the node we need.
}
return v, nodes[i+1] // next node is what we need.
}
@@ -239,21 +240,23 @@ func FindKeyNode(key string, nodes []*yaml.Node) (keyNode *yaml.Node, valueNode
return nil, nil
}
// FindKeyNodeFull is an overloaded version of FindKeyNode. Thins version however returns keys, labels and values.
// generally different things are required from different node trees, so depending on what this function is looking at
// it will return different things.
func FindKeyNodeFull(key string, nodes []*yaml.Node) (keyNode *yaml.Node, labelNode *yaml.Node, valueNode *yaml.Node) {
for i, v := range nodes {
if i%2 == 0 && key == v.Value {
return v, nodes[i], nodes[i+1] // next node is what we need.
for i := range nodes {
if i%2 == 0 && key == nodes[i].Value {
return nodes[i], nodes[i], nodes[i+1] // next node is what we need.
}
}
for _, v := range nodes {
for x, j := range v.Content {
if key == j.Value {
for x := range v.Content {
if key == v.Content[x].Value {
if IsNodeMap(v) {
if x+1 == len(v.Content) {
return v, v.Content[x], v.Content[x]
}
return v, v.Content[x], v.Content[x+1] // next node is what we need.
return v, v.Content[x], v.Content[x+1]
}
if IsNodeArray(v) {
return v, v.Content[x], v.Content[x]
@@ -356,14 +359,6 @@ func IsNodeIntValue(node *yaml.Node) bool {
return node.Tag == "!!int"
}
// IsNodeNullValue Checks of the input is null or not.
func IsNodeNullValue(node *yaml.Node) bool {
if node == nil {
return false
}
return node.Tag == "!!null"
}
// IsNodeFloatValue will check is a node is a float value.
func IsNodeFloatValue(node *yaml.Node) bool {
if node == nil {
@@ -539,7 +534,7 @@ func ConvertCase(input string, convert Case) string {
func DetectCase(input string) Case {
trim := strings.TrimSpace(input)
if trim == "" {
return -1
return UnknownCase
}
pascalCase := regexp.MustCompile("^[A-Z][a-z]+(?:[A-Z][a-z]+)*$")