blob: dedf174fd78966c273d74145f3b16f1b30ea8cec [file] [log] [blame]
// Copyright 2019 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
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// See the License for the specific language governing permissions and
// limitations under the License.
package cue
// TODO: this code could be generated, but currently isn't.
type valueSorter struct {
a []Value
cmp Value
err error
func (s *valueSorter) ret() ([]Value, error) {
if s.err != nil {
return nil, s.err
// The input slice is already a copy and that we can modify it safely.
return s.a, nil
func (s *valueSorter) Len() int { return len(s.a) }
func (s *valueSorter) Swap(i, j int) { s.a[i], s.a[j] = s.a[j], s.a[i] }
func (s *valueSorter) Less(i, j int) bool {
x := fill(s.cmp, s.a[i], "x")
x = fill(x, s.a[j], "y")
isLess, err := x.Lookup("less").Bool()
if err != nil && s.err == nil {
s.err = err
return true
return isLess
// fill creates a new value with the old value unified with the given value.
// TODO: consider making this a method on Value.
func fill(v Value, x interface{}, path ...string) Value {
ctx := v.ctx()
root := v.path.val()
for i := len(path) - 1; i >= 0; i-- {
x = map[string]interface{}{path[i]: x}
value := convert(ctx, root, false, x)
eval := binOp(ctx, baseValue{}, opUnify, root, value)
return newValueRoot(ctx, eval)