func (q Query) MinInt() (min int, err error) {
	if q.err != nil {
		err = q.err
		return
	}
	if len(q.values) == 0 {
		return 0, ErrEmptySequence
	}
	minIndex, _, err := minMaxInts(q.values)
	if err != nil {
		return
	}
	return q.values[minIndex].(int), nil
}
// MinInt returns the element with smallest value in the leftmost of the
// sequence. Elements of the original sequence should only be int or
// ErrTypeMismatch is returned. If the sequence is empty ErrEmptySequence is
// returned.
//
// Example:
//	min, err := From([]int{1, -100, 10, 0}).MinInt() // min is -1
MinInt returns the element with smallest value in the leftmost of the
sequence. Elements of the original sequence should only be int or
ErrTypeMismatch is returned. If the sequence is empty ErrEmptySequence is
returned.


// MinInt returns the element with smallest value in the leftmost of the // sequence . Elements of the original sequence should only be int or // ErrTypeMismatch is returned . If the sequence is empty ErrEmptySequence is // returned . // // Example : // min err : = From ( [] int { 1 - 100 10 0 } ) . MinInt () // min is - 1
func (q Query) MinInt() (min int, err error) {
	if q.err != nil {
		err = q.err
		return
	}
	if len(q.values) == 0 {
		return 0, ErrEmptySequence
	}
	minIndex, _, err := minMaxInts(q.values)
	if err != nil {
		return
	}
	return q.values[minIndex].(int), nil
}
func ( q Query ) MinInt ( ) ( min int , err error ) { if q . err != nil { err = q . err return } if len ( q . values ) == 0 { return 0 , ErrEmptySequence } minIndex , _ , err := minMaxInts ( q . values ) if err != nil { return } return q . values [ minIndex ] . ( int ) , nil }
MinInt returns the element with smallest value in the leftmost of the
sequence.
MinInt returns the element with smallest value in the leftmost of the sequence .