func visitFieldsInSlice(ctx *visitorContext, val reflect.Value) (result bool) {
	for i := 0; i < val.Len(); i++ {
		v := val.Index(i)
		if !v.CanInterface() {
			continue
		}

		if ctx.indexedElemPreVisitor != nil {
			ctx.indexedElemPreVisitor(i)
		}

		result = visitField(ctx, v.Interface()) || result

		if ctx.indexedElemPostVisitor != nil {
			ctx.indexedElemPostVisitor(i)
		}
	}

	return result
}
// visitFieldsInSlice iterates the slice specified by val and recursively
// visits each element. The returned value is the logical OR of the responses
// returned by visiting all slice elements.
visitFieldsInSlice iterates the slice specified by val and recursively
visits each element. The returned value is the logical OR of the responses
returned by visiting all slice elements.
// visitFieldsInSlice iterates the slice specified by val and recursively // visits each element . The returned value is the logical OR of the responses // returned by visiting all slice elements .
func visitFieldsInSlice(ctx *visitorContext, val reflect.Value) (result bool) {
	for i := 0; i < val.Len(); i++ {
		v := val.Index(i)
		if !v.CanInterface() {
			continue
		}
		if ctx.indexedElemPreVisitor != nil {
			ctx.indexedElemPreVisitor(i)
		}
		result = visitField(ctx, v.Interface()) || result
		if ctx.indexedElemPostVisitor != nil {
			ctx.indexedElemPostVisitor(i)
		}
	}
	return result
}
func visitFieldsInSlice ( ctx * visitorContext , val reflect . Value ) ( result bool ) { for i := 0 ; i < val . Len ( ) ; i ++ { v := val . Index ( i ) if ! v . CanInterface ( ) { continue } if ctx . indexedElemPreVisitor != nil { ctx . indexedElemPreVisitor ( i ) } result = visitField ( ctx , v . Interface ( ) ) || result if ctx . indexedElemPostVisitor != nil { ctx . indexedElemPostVisitor ( i ) } } return result }
visitFieldsInSlice iterates the slice specified by val and recursively
visits each element.
visitFieldsInSlice iterates the slice specified by val and recursively visits each element .