Rearrange given input values according to the names and the order of the related input nodes. For example, given a graph with the first input node named 'A' and the second one named 'B' and input values `{'B': v, 'A': w}`, this function returns a vector `[w, v]`. # Arguments `values` - hashmap of values keyed by node names # Returns Vector of values arranged by node names # Example ``` # us
(&self, values: HashMap<&str, T>)
| 3566 | /// assert_eq!(vec![1,2], ordered_input); |
| 3567 | /// ``` |
| 3568 | pub fn prepare_input_values<T: Clone>(&self, values: HashMap<&str, T>) -> Result<Vec<T>> { |
| 3569 | self.get_context() |
| 3570 | .prepare_input_values(self.clone(), values) |
| 3571 | } |
| 3572 | } |
| 3573 | type WeakGraphBodyPointer = Weak<AtomicRefCell<GraphBody>>; |
| 3574 |