Struct StrictSchema 

pub struct StrictSchema {
    pub columns: Vec<ColumnDef>,
    pub version: u32,
    pub dropped_columns: Vec<DroppedColumn>,
    pub bitemporal: bool,
}

Schema for a strict document collection (Binary Tuple serialization).

Fields

columns: Vec<ColumnDef>

version: u32

dropped_columns: Vec<DroppedColumn>

Columns that were removed via ALTER DROP COLUMN. Retained so the reader can reconstruct the physical layout of tuples written before the drop.

bitemporal: bool

When true, the tuple reserves fixed-Int64 slots 0/1/2 for __system_from_ms, __valid_from_ms, __valid_until_ms. These columns are prepended by StrictSchema::new_bitemporal and appear in columns like any other field; the flag preserves the intent across catalog round-trips.

Implementations

impl StrictSchema

pub fn new(columns: Vec<ColumnDef>) -> Result<Self, SchemaError>

pub fn new_bitemporal(user_columns: Vec<ColumnDef>) -> Result<Self, SchemaError>

Build a schema for a bitemporal strict collection. Prepends three reserved Int64 columns (__system_from_ms, __valid_from_ms, __valid_until_ms) at positions 0/1/2 so the tuple decoder can extract them via fixed-offset jump. User columns are rejected if any collides with a reserved name.

pub fn variable_column_count(&self) -> usize

Count of variable-length columns (determines offset table size).

pub fn fixed_fields_size(&self) -> usize

Total fixed-field byte size (for Binary Tuple layout computation).

pub fn null_bitmap_size(&self) -> usize

Null bitmap size in bytes.

pub fn schema_for_version(&self, version: u32) -> StrictSchema

Build a sub-schema matching the physical layout of tuples written at the given version. Columns added after version are excluded; columns dropped after version are re-inserted at their original positions.

pub fn parse_default_literal(expr: &str) -> Value

Parse a SQL default literal (e.g. 'n/a', 0, true) into a Value.

Covers the common cases produced by ALTER ADD COLUMN ... DEFAULT .... Returns Value::Null for expressions that cannot be trivially evaluated at read time (functions, sub-queries, etc.).

Trait Implementations

impl Clone for StrictSchema

fn clone(&self) -> StrictSchema

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for StrictSchema

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for StrictSchema

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<'__msgpack_de> FromMessagePack<'__msgpack_de> for StrictSchema

fn read<R: Read<'__msgpack_de>>(reader: &mut R) -> Result<Self, Error>

where Self: Sized,

Reads the MessagePack representation of this value from the provided reader.

impl PartialEq for StrictSchema

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

Tests for self and other values to be equal, and is used by ==.

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

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

impl SchemaOps for StrictSchema

fn columns(&self) -> &[ColumnDef]

fn column_index(&self, name: &str) -> Option<usize>

fn column(&self, name: &str) -> Option<&ColumnDef>

fn primary_key_columns(&self) -> Vec<&ColumnDef>

fn len(&self) -> usize

fn is_empty(&self) -> bool

impl Serialize for StrictSchema

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl ToMessagePack for StrictSchema

fn write<W: Write>(&self, writer: &mut W) -> Result<(), Error>

Writes the MessagePack representation of this value into the provided writer.

impl Eq for StrictSchema

impl StructuralPartialEq for StrictSchema