func (s *Set) List() []Dependency {
	s.RLock()
	defer s.RUnlock()
	r := make([]Dependency, len(s.list))
	for i, k := range s.list {
		r[i] = s.set[k]
	}
	return r
}
func (s *Set) List() []Dependency {
	s.RLock()
	defer s.RUnlock()
	r := make([]Dependency, len(s.list))
	for i, k := range s.list {
		r[i] = s.set[k]
	}
	return r
}
func ( s * Set ) List ( ) [ ] Dependency { s . RLock ( ) defer s . RUnlock ( ) r := make ( [ ] Dependency , len ( s . list ) ) for i , k := range s . list { r [ i ] = s . set [ k ] } return r }
// List returns the insertion-ordered list of dependencies.
List returns the insertion - ordered list of dependencies .