(inputs: &[Box<dyn Value>])
| 148 | } |
| 149 | |
| 150 | pub fn general_least(inputs: &[Box<dyn Value>]) -> Box<dyn Value> { |
| 151 | let mut least = &inputs[0]; |
| 152 | |
| 153 | for value in inputs.iter().skip(1) { |
| 154 | if least.compare(value) == Some(Ordering::Less) { |
| 155 | least = value; |
| 156 | } |
| 157 | } |
| 158 | |
| 159 | least.to_owned() |
| 160 | } |
| 161 | |
| 162 | pub fn general_uuid(_inputs: &[Box<dyn Value>]) -> Box<dyn Value> { |
| 163 | let uuid = Uuid::new_v4(); |
nothing calls this directly
no test coverage detected
searching dependent graphs…