-
Notifications
You must be signed in to change notification settings - Fork 10
/
schemas.go
136 lines (121 loc) · 2.79 KB
/
schemas.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
// Copyright 2022 Snyk Ltd
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package schemas
import (
"fmt"
"strconv"
"strings"
)
type Type string
const (
Unknown Type = "unknown"
Bool Type = "bool"
Int Type = "int"
Float Type = "float"
String Type = "string"
Array Type = "array"
Map Type = "map"
Object Type = "object"
)
// A Schema correponds to a resource or a subtree of a resource.
// They may contain infinite loops.
type Schema struct {
Type Type `json:"type"`
Sensitive bool `json:"sensitive,omitempty"`
Properties map[string]*Schema `json:"properties,omitempty"`
Items *Schema `json:"items,omitempty"`
}
func Apply(val interface{}, schema *Schema) interface{} {
if schema == nil {
return val
}
if schema.Sensitive {
switch val.(type) {
case string:
return "******"
default:
return nil
}
}
switch v := val.(type) {
case []interface{}:
return ApplyArray(v, schema)
case map[string]interface{}:
return ApplyObject(v, schema)
case string:
switch schema.Type {
case String:
return v
case Bool:
return strings.ToLower(v) == "true"
case Int:
if n, err := strconv.Atoi(v); err == nil {
return n
}
case Float:
if f, err := strconv.ParseFloat(v, 64); err == nil {
return f
}
}
case int:
switch schema.Type {
case String:
return fmt.Sprintf("%d", v)
}
case float64:
switch schema.Type {
case String:
return fmt.Sprintf("%f", v)
}
}
return val
}
func ApplyArray(arr []interface{}, schema *Schema) []interface{} {
if schema == nil || schema.Type != Array || schema.Items == nil {
return arr
}
if schema.Sensitive {
return nil
}
coerce := make([]interface{}, len(arr))
for i, v := range arr {
coerce[i] = Apply(v, schema.Items)
}
return coerce
}
func ApplyObject(obj map[string]interface{}, schema *Schema) map[string]interface{} {
if schema == nil {
return obj
}
if schema.Sensitive {
return nil
}
coerce := map[string]interface{}{}
if schema.Type == Object {
for k, v := range obj {
if s, ok := schema.Properties[k]; ok {
coerce[k] = Apply(v, s)
} else {
coerce[k] = v
}
}
return coerce
} else if schema.Type == Map {
for k, v := range obj {
coerce[k] = Apply(v, schema.Items)
}
return coerce
}
return obj
}