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


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