func (re *ResourceEntry) order() {
	if re.OrderedKeys != nil {
		return
	}

	re.OrderedKeys = make([]ID, 0, len(re.Data))
	for id := range re.Data {
		re.OrderedKeys = append(re.OrderedKeys, id)
	}

	// LCIDs in ascending order
	sort.Slice(re.OrderedKeys, func(i, j int) bool {
		return re.OrderedKeys[i].lessThan(re.OrderedKeys[j])
	})
}
// order orders LCIDs and saves them in orderedKeys.
order orders LCIDs and saves them in orderedKeys.
// order orders LCIDs and saves them in orderedKeys .
func (re *ResourceEntry) order() {
	if re.OrderedKeys != nil {
		return
	}
	re.OrderedKeys = make([]ID, 0, len(re.Data))
	for id := range re.Data {
		re.OrderedKeys = append(re.OrderedKeys, id)
	}
	sort.Slice(re.OrderedKeys, func(i, j int) bool {
		return re.OrderedKeys[i].lessThan(re.OrderedKeys[j])
	})
}
func ( re * ResourceEntry ) order ( ) { if re . OrderedKeys != nil { return } re . OrderedKeys = make ( [ ] ID , 0 , len ( re . Data ) ) for id := range re . Data { re . OrderedKeys = append ( re . OrderedKeys , id ) } sort . Slice ( re . OrderedKeys , func ( i , j int ) bool { return re . OrderedKeys [ i ] . lessThan ( re . OrderedKeys [ j ] ) } ) }
order orders LCIDs and saves them in orderedKeys.
order orders LCIDs and saves them in orderedKeys .
// LCIDs in ascending order