func()

in namer/order.go [32:52]

• 21 lines of code
• 6 McCabe index (conditional complexity)

func (o *Orderer) OrderUniverse(u types.Universe) []*types.Type {
	list := tList{
		namer: o.Namer,
	}
	for _, p := range u {
		for _, t := range p.Types {
			list.types = append(list.types, t)
		}
		for _, f := range p.Functions {
			list.types = append(list.types, f)
		}
		for _, v := range p.Variables {
			list.types = append(list.types, v)
		}
		for _, v := range p.Constants {
			list.types = append(list.types, v)
		}
	}
	sort.Sort(list)
	return list.types
}