(group_values: &[Vec<Box<dyn Value>>])
| 165 | } |
| 166 | |
| 167 | pub fn aggregation_max(group_values: &[Vec<Box<dyn Value>>]) -> Box<dyn Value> { |
| 168 | let mut max_value = &group_values[0][0]; |
| 169 | for row_values in group_values { |
| 170 | let single_value = &row_values[0]; |
| 171 | if max_value.compare(single_value) == Some(Ordering::Less) { |
| 172 | max_value = single_value; |
| 173 | } |
| 174 | } |
| 175 | max_value.clone() |
| 176 | } |
| 177 | |
| 178 | pub fn aggregation_min(group_values: &[Vec<Box<dyn Value>>]) -> Box<dyn Value> { |
| 179 | let mut min_value = &group_values[0][0]; |
nothing calls this directly
no test coverage detected
searching dependent graphs…