pub fn keys_statically_known(&self) -> bool {
        for (root, node) in self.0.iter() {
            if !root.is_statically_known() || !node.keys_statically_known() {
                return false;
            }
        }
        true
    }
/// Return `true` if the keys of `self` have no dynamic components and thus can be converted into
/// a compact set of concrete access paths.
Return `true` if the keys of `self` have no dynamic components and thus can be converted into
a compact set of concrete access paths.
Return ` true ` if the keys of ` self ` have no dynamic components and thus can be converted into a compact set of concrete access paths .
pub fn keys_statically_known(&self) -> bool {
        for (root, node) in self.0.iter() {
            if !root.is_statically_known() || !node.keys_statically_known() {
                return false;
            }
        }
        true
    }
pub fn keys_statically_known ( & self ) -> bool { for ( root , node ) in self . 0 . iter ( ) { if ! root . is_statically_known ( ) || ! node . keys_statically_known ( ) { return false ; } } true }
Return `true` if the keys of `self` have no dynamic components and thus can be converted into
a compact set of concrete access paths.
Return ` true ` if the keys of ` self ` have no dynamic components and thus can be converted into a compact set of concrete access paths .
&self