func (rs *ResourceSet) order(s *state) {
	s.orderedKeys = make([]Identifier, 0, len(rs.Types))
	for ident, te := range rs.Types {
		s.orderedKeys = append(s.orderedKeys, ident)
		te.Order()
	}

	// Names in case sensitive ascending order, then IDs in ascending order
	sort.Slice(s.orderedKeys, func(i, j int) bool {
		return s.orderedKeys[i].lessThan(s.orderedKeys[j])
	})

	// Count Names by searching the first ID
	s.namesCount = sort.Search(len(s.orderedKeys), func(i int) bool {
		_, ok := s.orderedKeys[i].(ID)
		return ok
	})
}
// order orders identifiers in the whole resource set.
order orders identifiers in the whole resource set.
// order orders identifiers in the whole resource set .
func (rs *ResourceSet) order(s *state) {
	s.orderedKeys = make([]Identifier, 0, len(rs.Types))
	for ident, te := range rs.Types {
		s.orderedKeys = append(s.orderedKeys, ident)
		te.Order()
	}
	sort.Slice(s.orderedKeys, func(i, j int) bool {
		return s.orderedKeys[i].lessThan(s.orderedKeys[j])
	})
	s.namesCount = sort.Search(len(s.orderedKeys), func(i int) bool {
		_, ok := s.orderedKeys[i].(ID)
		return ok
	})
}
func ( rs * ResourceSet ) order ( s * state ) { s . orderedKeys = make ( [ ] Identifier , 0 , len ( rs . Types ) ) for ident , te := range rs . Types { s . orderedKeys = append ( s . orderedKeys , ident ) te . Order ( ) } sort . Slice ( s . orderedKeys , func ( i , j int ) bool { return s . orderedKeys [ i ] . lessThan ( s . orderedKeys [ j ] ) } ) s . namesCount = sort . Search ( len ( s . orderedKeys ) , func ( i int ) bool { _ , ok := s . orderedKeys [ i ] . ( ID ) return ok } ) }
order orders identifiers in the whole resource set.
order orders identifiers in the whole resource set .
// Names in case sensitive ascending order, then IDs in ascending order // Count Names by searching the first ID