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
|
// Copyright 2022 CUE Authors
//
// 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 pkg
import (
"cuelang.org/go/cue"
"cuelang.org/go/internal/core/adt"
)
// A Schema represents an arbitrary cue.Value that can hold non-concrete values.
// By default function arguments are checked to be concrete.
type Schema = cue.Value
// List represents a CUE list, which can be open or closed.
type List struct {
runtime adt.Runtime
node *adt.Vertex
isOpen bool
}
// Elems returns the elements of a list.
func (l *List) Elems() []*adt.Vertex {
return l.node.Elems()
}
// IsOpen reports whether a list is open ended.
func (l *List) IsOpen() bool {
return l.isOpen
}
// Struct represents a CUE struct, which can be open or closed.
type Struct struct {
runtime adt.Runtime
node *adt.Vertex
}
// Arcs returns all arcs of s.
func (s *Struct) Arcs() []*adt.Vertex {
return s.node.Arcs
}
// Len reports the number of regular string fields of s.
func (s *Struct) Len() int {
count := 0
for _, a := range s.Arcs() {
if a.Label.IsString() && !s.node.IsOptional(a.Label) {
count++
}
}
return count
}
// IsOpen reports whether s is open or has pattern constraints.
func (s *Struct) IsOpen() bool {
if !s.node.IsClosedStruct() {
return true
}
// Technically this is not correct, but it is in the context of where
// it is used.
if s.node.PatternConstraints != nil && len(s.node.PatternConstraints.Pairs) > 0 {
return true
}
// The equivalent code for the old implementation.
ot := s.node.OptionalTypes()
return ot&^adt.HasDynamic != 0
}
// NumConstraintFields reports the number of explicit optional and required
// fields, excluding pattern constraints.
func (s Struct) NumConstraintFields() (count int) {
// If we have any optional arcs, we allow more fields.
for _, a := range s.node.Arcs {
if a.ArcType != adt.ArcMember && a.Label.IsRegular() {
count++
}
}
return count
}
// A ValidationError indicates an error that is only valid if a builtin is used
// as a validator.
type ValidationError struct {
B *adt.Bottom
}
func (v ValidationError) Error() string { return v.B.Err.Error() }
|
