func Has[T Steper]()

in wrap.go [121:131]

• 11 lines of code
• 2 McCabe index (conditional complexity)

func Has[T Steper](s Steper) bool {
	find := false
	Traverse(s, func(s Steper, walked []Steper) TraverseDecision {
		if _, ok := s.(T); ok {
			find = true
			return TraverseStop
		}
		return TraverseContinue
	})
	return find
}