Struct re_types_builder::LazyField

pub struct LazyField {
    pub name: String,
    pub datatype: LazyDatatype,
    pub is_nullable: bool,
    pub metadata: BTreeMap<String, String>,
}

A yet-to-be-resolved [arrow2::datatypes::Field].

Type resolution is a two-pass process as we first need to register all existing types before we can denormalize their definitions into their parents.

Fields

name: String

Its name

datatype: LazyDatatype

Its logical [DataType]

is_nullable: bool

Its nullability

metadata: BTreeMap<String, String>

Additional custom (opaque) metadata.

Implementations

impl LazyField

fn resolve(&self, registry: &ArrowRegistry) -> Field

Recursively resolves the field using the specified registry.

Trait Implementations

impl Clone for LazyField

fn clone(&self) -> LazyField

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for LazyField

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl From<Field> for LazyField

fn from(field: Field) -> Self

Converts to this type from the input type.

impl Hash for LazyField

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for LazyField

fn eq(&self, other: &LazyField) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for LazyField

impl StructuralPartialEq for LazyField