pub(crate) fn full_reference_path(&self, use_bindings: bool) -> String {
        if let Some(ref prefix) = self.prefix {
            format!("{}.{}", prefix.to_string(), self.scalar_field_name())
        } else if use_bindings {
            self.binding_names().0
        } else {
            self.scalar_field_name().to_string()
        }
    }
/// Computes the full query path that would be required to traverse from the top-most
/// document all the way to the scalar to order through all hops.
Computes the full query path that would be required to traverse from the top-most
document all the way to the scalar to order through all hops.
Computes the full query path that would be required to traverse from the top - most document all the way to the scalar to order through all hops .
pub(crate) fn full_reference_path(&self, use_bindings: bool) -> String {
        if let Some(ref prefix) = self.prefix {
            format!("{}.{}", prefix.to_string(), self.scalar_field_name())
        } else if use_bindings {
            self.binding_names().0
        } else {
            self.scalar_field_name().to_string()
        }
    }
pub ( crate ) fn full_reference_path ( & self , use_bindings : bool ) -> String { if let Some ( ref prefix ) = self . prefix { format ! ( " " prefix to_string ( ) self scalar_field_name ( ) ) } else if use_bindings { self . binding_names ( ) . 0 } else { self . scalar_field_name ( ) . to_string ( ) } }
Computes the full query path that would be required to traverse from the top-most
document all the way to the scalar to order through all hops.
Computes the full query path that would be required to traverse from the top - most document all the way to the scalar to order through all hops .
&self
use_bindings
bool