blob: 7670775c2424da8ec264d4f2f6ee070800c92440 [file] [log] [blame]
// Copyright 2021 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 cue
import (
"cuelang.org/go/internal/core/adt"
)
// This file contains query-related code.
// getScopePrefix finds the Vertex that exists in v for the longest prefix of p.
//
// It is used to make the parent scopes visible when resolving expressions.
func getScopePrefix(v Value, p Path) Value {
for _, sel := range p.Selectors() {
w := v.LookupPath(MakePath(sel))
if !w.Exists() {
break
}
v = w
}
return v
}
// LookupPath reports the value for path p relative to v.
func (v Value) LookupPath(p Path) Value {
if v.v == nil {
return Value{}
}
n := v.v
parent := v.parent_
ctx := v.ctx()
outer:
for _, sel := range p.path {
f := sel.sel.feature(v.idx)
for _, a := range n.Arcs {
if a.Label == f {
parent = linkParent(parent, n, a)
n = a
continue outer
}
}
if sel.sel.optional() {
x := &adt.Vertex{
Parent: n,
Label: sel.sel.feature(ctx),
}
n.MatchAndInsert(ctx, x)
if len(x.Conjuncts) > 0 {
x.Finalize(ctx)
parent = linkParent(parent, n, x)
n = x
continue
}
}
var x *adt.Bottom
if err, ok := sel.sel.(pathError); ok {
x = &adt.Bottom{Err: err.Error}
} else {
// TODO: better message.
x = mkErr(v.idx, n, adt.NotExistError, "field %q not found", sel.sel)
}
v := makeValue(v.idx, n, parent)
return newErrValue(v, x)
}
return makeValue(v.idx, n, parent)
}