Struct arrow::ipc::gen::Schema::Map [−][src]
pub struct Map<'a> { pub _tab: Table<'a>, }
Expand description
A Map is a logical nested type that is represented as
List<entries: Struct<key: K, value: V>>
In this layout, the keys and values are each respectively contiguous. We do not constrain the key and value types, so the application is responsible for ensuring that the keys are hashable and unique. Whether the keys are sorted may be set in the metadata for this field.
In a field with Map type, the field has a child Struct field, which then has two children: key type and the second the value type. The names of the child fields may be respectively “entries”, “key”, and “value”, but this is not enforced.
Map
- child[0] entries: Struct
- child[0] key: K
- child[1] value: V
Neither the “entries” field nor the “key” field may be nullable.
The metadata is structured so that Arrow systems without special handling for Map can make Map an alias for List. The “layout” attribute for the Map field must have the same contents as a List.
Fields
_tab: Table<'a>
Implementations
impl<'a> Map<'a>
[src]
impl<'a> Map<'a>
[src]pub fn init_from_table(table: Table<'a>) -> Self
[src]
pub fn create<'bldr: 'args, 'args: 'mut_bldr, 'mut_bldr>(
_fbb: &'mut_bldr mut FlatBufferBuilder<'bldr>,
args: &'args MapArgs
) -> WIPOffset<Map<'bldr>>
[src]
_fbb: &'mut_bldr mut FlatBufferBuilder<'bldr>,
args: &'args MapArgs
) -> WIPOffset<Map<'bldr>>
pub const VT_KEYSSORTED: VOffsetT
[src]
pub fn keysSorted(&self) -> bool
[src]
pub fn keysSorted(&self) -> bool
[src]Set to true if the keys within each value are sorted
Trait Implementations
impl Verifiable for Map<'_>
[src]
impl Verifiable for Map<'_>
[src]fn run_verifier(
v: &mut Verifier<'_, '_>,
pos: usize
) -> Result<(), InvalidFlatbuffer>
[src]
fn run_verifier(
v: &mut Verifier<'_, '_>,
pos: usize
) -> Result<(), InvalidFlatbuffer>
[src]Runs the verifier for this type, assuming its at position pos
in the verifier’s buffer.
Should not need to be called directly. Read more
impl<'a> Copy for Map<'a>
[src]
impl<'a> StructuralPartialEq for Map<'a>
[src]
Auto Trait Implementations
impl<'a> RefUnwindSafe for Map<'a>
impl<'a> Send for Map<'a>
impl<'a> Sync for Map<'a>
impl<'a> Unpin for Map<'a>
impl<'a> UnwindSafe for Map<'a>
Blanket Implementations
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]pub fn borrow_mut(&mut self) -> &mut T
[src]
pub fn borrow_mut(&mut self) -> &mut T
[src]Mutably borrows from an owned value. Read more
impl<T> ToOwned for T where
T: Clone,
[src]
impl<T> ToOwned for T where
T: Clone,
[src]type Owned = T
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn to_owned(&self) -> T
[src]Creates owned data from borrowed data, usually by cloning. Read more
pub fn clone_into(&self, target: &mut T)
[src]
pub fn clone_into(&self, target: &mut T)
[src]🔬 This is a nightly-only experimental API. (toowned_clone_into
)
recently added
Uses borrowed data to replace owned data, usually by cloning. Read more
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
impl<V, T> VZip<V> for T where
V: MultiLane<T>,