(group_values: &[Vec<Box<dyn Value>>])
| 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]; |
| 180 | for row_values in group_values { |
| 181 | let single_value = &row_values[0]; |
| 182 | if min_value.compare(single_value) == Some(Ordering::Greater) { |
| 183 | min_value = single_value; |
| 184 | } |
| 185 | } |
| 186 | min_value.clone() |
| 187 | } |
| 188 | |
| 189 | pub fn aggregation_sum(group_values: &[Vec<Box<dyn Value>>]) -> Box<dyn Value> { |
| 190 | let mut sum: i64 = 0; |
nothing calls this directly
no test coverage detected
searching dependent graphs…