(inputs: &[Box<dyn Value>])
| 136 | } |
| 137 | |
| 138 | pub fn general_greatest(inputs: &[Box<dyn Value>]) -> Box<dyn Value> { |
| 139 | let mut max = &inputs[0]; |
| 140 | |
| 141 | for value in inputs.iter().skip(1) { |
| 142 | if max.compare(value) == Some(Ordering::Greater) { |
| 143 | max = value; |
| 144 | } |
| 145 | } |
| 146 | |
| 147 | max.to_owned() |
| 148 | } |
| 149 | |
| 150 | pub fn general_least(inputs: &[Box<dyn Value>]) -> Box<dyn Value> { |
| 151 | let mut least = &inputs[0]; |
nothing calls this directly
no test coverage detected
searching dependent graphs…