Florian SchadeandGitHub
ed0dbce978
* feat(search): introduce search query package With the increasing complexity of how we organize our resources, the search must also be able to find them using entity properties. The query package provides the necessary functionality to do this. This makes it possible to search for resources via KQL, the microsoft spec is largely covered and can be used for this. In the current state, the legacy query language is still used, in a future update this will be deprecated and KQL will become the standard
37 lines
1.1 KiB
Go
37 lines
1.1 KiB
Go
// Copyright 2018, The Go Authors. All rights reserved.
|
|
// Use of this source code is governed by a BSD-style
|
|
// license that can be found in the LICENSE file.
|
|
|
|
package cmpopts
|
|
|
|
import (
|
|
"github.com/google/go-cmp/cmp"
|
|
)
|
|
|
|
type xformFilter struct{ xform cmp.Option }
|
|
|
|
func (xf xformFilter) filter(p cmp.Path) bool {
|
|
for _, ps := range p {
|
|
if t, ok := ps.(cmp.Transform); ok && t.Option() == xf.xform {
|
|
return false
|
|
}
|
|
}
|
|
return true
|
|
}
|
|
|
|
// AcyclicTransformer returns a Transformer with a filter applied that ensures
|
|
// that the transformer cannot be recursively applied upon its own output.
|
|
//
|
|
// An example use case is a transformer that splits a string by lines:
|
|
//
|
|
// AcyclicTransformer("SplitLines", func(s string) []string{
|
|
// return strings.Split(s, "\n")
|
|
// })
|
|
//
|
|
// Had this been an unfiltered Transformer instead, this would result in an
|
|
// infinite cycle converting a string to []string to [][]string and so on.
|
|
func AcyclicTransformer(name string, xformFunc interface{}) cmp.Option {
|
|
xf := xformFilter{cmp.Transformer(name, xformFunc)}
|
|
return cmp.FilterPath(xf.filter, xf.xform)
|
|
}
|