pub struct Schema {
pub fields: Vec<Field, Global>,
pub metadata: HashMap<String, String, RandomState>,
}
Expand description
Describes the meta-data of an ordered sequence of relative types.
Note that this information is only part of the meta-data and not part of the physical memory layout.
Fields§
§fields: Vec<Field, Global>
§metadata: HashMap<String, String, RandomState>
A map of key-value pairs containing additional meta data.
Implementations§
source§impl Schema
impl Schema
sourcepub const fn new_with_metadata(
fields: Vec<Field, Global>,
metadata: HashMap<String, String, RandomState>
) -> Schema
pub const fn new_with_metadata(
fields: Vec<Field, Global>,
metadata: HashMap<String, String, RandomState>
) -> Schema
Creates a new Schema
from a sequence of Field
values
and adds additional metadata in form of key value pairs.
Example
let field_a = Field::new("a", DataType::Int64, false);
let field_b = Field::new("b", DataType::Boolean, false);
let mut metadata: HashMap<String, String> = HashMap::new();
metadata.insert("row_count".to_string(), "100".to_string());
let schema = Schema::new_with_metadata(vec![field_a, field_b], metadata);
sourcepub fn with_metadata(
self,
metadata: HashMap<String, String, RandomState>
) -> Schema
pub fn with_metadata(
self,
metadata: HashMap<String, String, RandomState>
) -> Schema
Sets the metadata of this Schema
to be metadata
and returns self
sourcepub fn project(&self, indices: &[usize]) -> Result<Schema, ArrowError>
pub fn project(&self, indices: &[usize]) -> Result<Schema, ArrowError>
Returns a new schema with only the specified columns in the new schema This carries metadata from the parent schema over as well
sourcepub fn try_merge(
schemas: impl IntoIterator<Item = Schema>
) -> Result<Schema, ArrowError>
pub fn try_merge(
schemas: impl IntoIterator<Item = Schema>
) -> Result<Schema, ArrowError>
Merge schema into self if it is compatible. Struct fields will be merged recursively.
Example:
let merged = Schema::try_merge(vec![
Schema::new(vec![
Field::new("c1", DataType::Int64, false),
Field::new("c2", DataType::Utf8, false),
]),
Schema::new(vec![
Field::new("c1", DataType::Int64, true),
Field::new("c2", DataType::Utf8, false),
Field::new("c3", DataType::Utf8, false),
]),
]).unwrap();
assert_eq!(
merged,
Schema::new(vec![
Field::new("c1", DataType::Int64, true),
Field::new("c2", DataType::Utf8, false),
Field::new("c3", DataType::Utf8, false),
]),
);
sourcepub const fn fields(&self) -> &Vec<Field, Global> ⓘ
pub const fn fields(&self) -> &Vec<Field, Global> ⓘ
Returns an immutable reference of the vector of Field
instances.
sourcepub fn all_fields(&self) -> Vec<&Field, Global> ⓘ
pub fn all_fields(&self) -> Vec<&Field, Global> ⓘ
Returns a vector with references to all fields (including nested fields)
sourcepub fn field(&self, i: usize) -> &Field
pub fn field(&self, i: usize) -> &Field
Returns an immutable reference of a specific Field
instance selected using an
offset within the internal fields
vector.
sourcepub fn field_with_name(&self, name: &str) -> Result<&Field, ArrowError>
pub fn field_with_name(&self, name: &str) -> Result<&Field, ArrowError>
Returns an immutable reference of a specific Field
instance selected by name.
sourcepub fn fields_with_dict_id(&self, dict_id: i64) -> Vec<&Field, Global> ⓘ
pub fn fields_with_dict_id(&self, dict_id: i64) -> Vec<&Field, Global> ⓘ
Returns a vector of immutable references to all Field
instances selected by
the dictionary ID they use.
sourcepub fn index_of(&self, name: &str) -> Result<usize, ArrowError>
pub fn index_of(&self, name: &str) -> Result<usize, ArrowError>
Find the index of the column with the given name.
sourcepub const fn metadata(&self) -> &HashMap<String, String, RandomState>
pub const fn metadata(&self) -> &HashMap<String, String, RandomState>
Returns an immutable reference to the Map of custom metadata key-value pairs.
sourcepub fn column_with_name(&self, name: &str) -> Option<(usize, &Field)>
pub fn column_with_name(&self, name: &str) -> Option<(usize, &Field)>
Look up a column by name and return a immutable reference to the column along with its index.
sourcepub fn contains(&self, other: &Schema) -> bool
pub fn contains(&self, other: &Schema) -> bool
Check to see if self
is a superset of other
schema. Here are the comparison rules:
self
andother
should contain the same number of fields- for every field
f
inother
, the field inself
with corresponding index should be a superset off
. - self.metadata is a superset of other.metadata
In other words, any record conforms to other
should also conform to self
.
Trait Implementations§
source§impl PartialEq<Schema> for Schema
impl PartialEq<Schema> for Schema
source§impl PyArrowConvert for Schema
impl PyArrowConvert for Schema
source§impl TryFrom<&FFI_ArrowSchema> for Schema
impl TryFrom<&FFI_ArrowSchema> for Schema
§type Error = ArrowError
type Error = ArrowError
source§fn try_from(c_schema: &FFI_ArrowSchema) -> Result<Self>
fn try_from(c_schema: &FFI_ArrowSchema) -> Result<Self>
source§impl TryFrom<&Schema> for FFI_ArrowSchema
impl TryFrom<&Schema> for FFI_ArrowSchema
source§impl TryFrom<Schema> for FFI_ArrowSchema
impl TryFrom<Schema> for FFI_ArrowSchema
impl Eq for Schema
impl StructuralEq for Schema
impl StructuralPartialEq for Schema
Auto Trait Implementations§
impl RefUnwindSafe for Schema
impl Send for Schema
impl Sync for Schema
impl Unpin for Schema
impl UnwindSafe for Schema
Blanket Implementations§
§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
source§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.