You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
65 lines
1.8 KiB
65 lines
1.8 KiB
// ------------------------------------------------------------------------
|
|
// Project atila
|
|
// Active Thing (activething.com) git.activething.com/go
|
|
//
|
|
// File name rfields.go
|
|
// Created by DEV
|
|
// Modified 27/01/2024
|
|
//
|
|
// Copyright 2024 activething.com
|
|
// ------------------------------------------------------------------------
|
|
// 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 reflects
|
|
|
|
|
|
|
|
type (
|
|
|
|
RFields []RField
|
|
|
|
)
|
|
|
|
/*
|
|
func (f RFields) Dominant() (RField, bool) {
|
|
// The Fields are sorted in increasing index-length order, then by presence of tag.
|
|
// That means that the first RField is the dominant one. We need only check
|
|
// for error cases: two Fields at top level, either both tagged or neither tagged.
|
|
if len(f) > 1 && len(f[0].Index) == len(f[1].Index) && f[0].Tagged() == f[1].Tagged() {
|
|
return RField{}, false
|
|
}
|
|
return f[0], true
|
|
}
|
|
*/
|
|
|
|
|
|
|
|
func (f RFields) Len() int { return len(f) }
|
|
|
|
func (f RFields) Swap(i, j int) { f[i], f[j] = f[j], f[i] }
|
|
|
|
func (f RFields) Less(i, j int) bool {
|
|
for k, xik := range f[i].Index {
|
|
if k >= len(f[j].Index) {
|
|
return false
|
|
}
|
|
if xik != f[j].Index[k] {
|
|
return xik < f[j].Index[k]
|
|
}
|
|
}
|
|
return len(f[i].Index) < len(f[j].Index)
|
|
}
|
|
|
|
|