pub fn update_from_tuple(reference: &mut Bounds, other: &Tuple) {
        // Interestingly, using seemingly optimized logic like the following, is slower:
        //
        // if other.x < reference.min.x {
        //     reference.min.x = other.x
        // } else if other.x > reference.max.x {
        //     reference.max.x = other.x
        // }

        reference.min.x = reference.min.x.min(other.x);
        reference.min.y = reference.min.y.min(other.y);
        reference.min.z = reference.min.z.min(other.z);

        reference.max.x = reference.max.x.max(other.x);
        reference.max.y = reference.max.y.max(other.y);
        reference.max.z = reference.max.z.max(other.z);
    }
// Same as above.
//
// It's a PITA not to have overloading, and it's not worth to use the trait workaround.
//
Same as above.
It's a PITA not to have overloading, and it's not worth to use the trait workaround.
Same as above . It ' s a PITA not to have overloading and it ' s not worth to use the trait workaround .
pub fn update_from_tuple(reference: &mut Bounds, other: &Tuple) {
        // Interestingly, using seemingly optimized logic like the following, is slower:
        //
        // if other.x < reference.min.x {
        //     reference.min.x = other.x
        // } else if other.x > reference.max.x {
        //     reference.max.x = other.x
        // }
        reference.min.x = reference.min.x.min(other.x);
        reference.min.y = reference.min.y.min(other.y);
        reference.min.z = reference.min.z.min(other.z);
        reference.max.x = reference.max.x.max(other.x);
        reference.max.y = reference.max.y.max(other.y);
        reference.max.z = reference.max.z.max(other.z);
    }
pub fn update_from_tuple ( reference : & mut Bounds , other : & Tuple ) { // Interestingly, using seemingly optimized logic like the following, is slower: // // if other.x < reference.min.x { //     reference.min.x = other.x // } else if other.x > reference.max.x { //     reference.max.x = other.x // } reference . min . x = reference . min . x . min ( other . x ) ; reference . min . y = reference . min . y . min ( other . y ) ; reference . min . z = reference . min . z . min ( other . z ) ; reference . max . x = reference . max . x . max ( other . x ) ; reference . max . y = reference . max . y . max ( other . y ) ; reference . max . z = reference . max . z . max ( other . z ) ; }
Same as above.
Same as above .
reference
&mut Bounds
other
&Tuple