Method sort

ciphercore-base/src/graphs.rs:877–879

Adds a node that sorts a table given as named tuple according to the column given by the key argument. The key column must be a 2-d BIT array of shape [n, b], interpreted as bitstrings of length b. Other columns in the named tuple must be arrays of arbitrary type and shape, as long as they share the first dimension: [n, ...]. Bitstrings are sorted lexicographically, and the sorting algorithm is st

(&self, key: String)

    /// let a = a.sort("key".to_string()).unwrap();
    /// ```
    pub fn sort(&self, key: String) -> Result<Node> {
        self.get_graph().sort(self.clone(), key)
    }

    /// Adds a node to the parent graph that divides a scalar or each entry of the array associated with the node by a positive constant integer `scale`.
    ///