Represents a Mentat schema.
Maintains the mapping between string idents and positive integer entids; and exposes the schema
flags associated to a given entid (equivalently, ident).
TODO: consider a single bi-directional map instead of separate ident->entid and entid->ident
maps.
Map entid->ident.
Invariant: is the inverse map of ident_map
.
Map ident->entid.
Invariant: is the inverse map of entid_map
.
Map entid->attribute flags.
Invariant: key-set is the same as the key-set of entid_map
(equivalently, the value-set of
ident_map
).
Maintain a vec of unique attribute IDs for which the corresponding attribute in attribute_map
has .component == true
.
Returns an symbolic representation of the schema suitable for applying across Mentat stores.
Performs copy-assignment from source
. Read more
Formats the value using the given formatter. Read more
Returns the "default value" for a type. Read more
Feeds this value into the given [Hasher
]. Read more
Feeds a slice of this type into the given [Hasher
]. Read more
This method returns an Ordering
between self
and other
. Read more
fn max(self, other: Self) -> Self | 1.21.0 [src] |
[−]
Compares and returns the maximum of two values. Read more
fn min(self, other: Self) -> Self | 1.21.0 [src] |
[−]
Compares and returns the minimum of two values. Read more
This method returns an ordering between self
and other
values if one exists. Read more
This method tests less than (for self
and other
) and is used by the <
operator. Read more
This method tests less than or equal to (for self
and other
) and is used by the <=
operator. Read more
This method tests greater than (for self
and other
) and is used by the >
operator. Read more
This method tests greater than or equal to (for self
and other
) and is used by the >=
operator. Read more
This method tests for self
and other
values to be equal, and is used by ==
. Read more
This method tests for !=
.
Return true if the provided entid identifies an attribute in this schema.
Return true if the provided ident identifies an attribute in this schema.