pub struct PrimitiveKeys(pub BTreeMap<String, Vec<u32>>);Expand description
core.primitive_keys, on a mesh: one u32 per primitive for every named field. A
shader::VariantKey::field names one of these exact keys; core does not interpret its namespace.
Tuple Fields§
§0: BTreeMap<String, Vec<u32>>Trait Implementations§
Source§impl Clone for PrimitiveKeys
impl Clone for PrimitiveKeys
Source§impl Component for PrimitiveKeys
impl Component for PrimitiveKeys
const NAME: &'static str = "core.primitive_keys"
Source§const GEOMETRY: Geometry = Geometry::PerPrimitive
const GEOMETRY: Geometry = Geometry::PerPrimitive
What the value holds of its entity’s mesh primitives and vertices (
Geometry). Stated by every component,
with no default, so data that describes a mesh can’t be left behind by an edit of it unawares: the World’s edit
paths take it from there.Source§fn to_json(&self) -> Result<Option<Value>, JsonError>
fn to_json(&self) -> Result<Option<Value>, JsonError>
The component as JSON, for glTF extras, the debug text form and golden tests;
Ok(None) for components
that are not shown (bulk data, handles). The view must never lose a value: components that can be shown
derive serde::Serialize and return crate::json::to_value(self).map(Some), which refuses non-finite
floats instead of writing them as null.Source§fn apply_linear(&self, _l: &Linear) -> Linearity<Self>
fn apply_linear(&self, _l: &Linear) -> Linearity<Self>
The component after its entity’s local space was mapped by
l (a pass that bakes a placement’s mirror or
shear into a copy of its geometry, so transforms stay rigid). World::apply_linear calls it for every
component of the entity. The default is Linearity::Unsupported: a component that holds local-space
geometry and does not say how it follows is never silently left behind; one without geometry says
Linearity::Invariant.Source§fn remap_primitives(&self, from: &[usize]) -> Option<Result<Self, String>>
fn remap_primitives(&self, from: &[usize]) -> Option<Result<Self, String>>
The component after its entity’s mesh primitives were rebuilt, for a component that holds something per
primitive (
Geometry::PerPrimitive, Geometry::PerVertex): new primitive i comes from old primitive
from[i] (a source may repeat, when a primitive is split, or be absent, when one is dropped). Such a component
always answers (a value holding nothing per primitive answers with itself); None, the default, is for
components of Geometry::None, and World::remap_primitives refuses a dependent component that gives it.
An index the component does not have is an error. remap_list does the work for a list with one entry per
primitive.Source§fn verify(&self, e: Entity, w: &World) -> Result<(), String>
fn verify(&self, e: Entity, w: &World) -> Result<(), String>
The component’s own invariants on entity
e (indices in range, stream lengths equal, …). The pass manager
runs it on every component after the reader, after every pass and before the writer, together with the
world’s own check that every entity of Component::references is alive. World-wide rules (one name -> one
payload) are pass::Validators instead.Source§const VERSION: u32 = 1
const VERSION: u32 = 1
Schema version of the component’s content. Bump it when the meaning or layout of a field changes.
Source§fn references(&self, _out: &mut Vec<Entity>)
fn references(&self, _out: &mut Vec<Entity>)
The entities this component refers to (a prototype, materials, textures), appended to
out: the edges
World::closure follows. A component holding entity references must declare every one of them.Source§fn payload_bytes(&self) -> u64
fn payload_bytes(&self) -> u64
The bytes of bulk payload the value holds (vertex streams and indices, texture levels, triangle soups), for
memory reports: element counts times element sizes, not allocated capacity. 0 for small components.
Source§fn remap_vertices(
&self,
_primitive: usize,
_from: &[u32],
) -> Option<Result<Self, String>>
fn remap_vertices( &self, _primitive: usize, _from: &[u32], ) -> Option<Result<Self, String>>
The component after the vertices of its entity’s mesh primitive
primitive were compacted or reordered, for a
component that holds something per vertex (Geometry::PerVertex): new vertex i of that primitive is old
vertex from[i] (a source may repeat or be absent). Such a component always answers (with itself when it holds
nothing for that primitive); None, the default, is for the others, and World::remap_vertices refuses a
per-vertex component that gives it. An index the component does not have is an error. Every pass that compacts
or reorders a primitive’s vertices calls World::remap_vertices. After a rebuild of the primitive list
(World::rebuild_primitives, Component::remap_primitives) a primitive’s per-vertex data is its source
primitive’s, and the vertex map is relative to that source.Source§fn blend_vertices(
&self,
_primitive: usize,
_from: &[VertexBlend],
) -> Option<Result<Self, String>>
fn blend_vertices( &self, _primitive: usize, _from: &[VertexBlend], ) -> Option<Result<Self, String>>
The component after the vertices of its entity’s mesh primitive
primitive were rebuilt as blends of old ones
(VertexBlend), for a component that holds something per vertex (Geometry::PerVertex): new vertex i
is the combination from[i] of old vertices, in whatever way the component’s data combines (a morph target’s
delta is interpolated, the way the surface it moves is). It answers as Component::remap_vertices does: with
itself when it holds nothing for that primitive; None, the default, is for a component that does not know how
to combine its data, and World::blend_vertices refuses a per-vertex component that gives it. An index the
component does not have is an error. A vertex that is a copy of one old vertex (VertexBlend::copy) is the
case Component::remap_vertices states, and a component answering one answers the other alike.Source§fn restate(&self, _resolved: &Resolved<'_>) -> Restated<Self>
fn restate(&self, _resolved: &Resolved<'_>) -> Restated<Self>
The component after
resolve-state (crate::state::ResolveState) gave the axes in resolved their values: a
component that holds crate::state::Clauses of its own (a record of parts each present in some states) reduces
them as core.condition is reduced (crate::state::Resolved::reduce: a clause that fails is dropped, a clause
left with no literal holds whatever the other axes are). Restated::Absent says the entity is not present in
this state (every clause failed): it is despawned as one whose core.condition fails is. The default holds no
clause: Restated::Unchanged.Source§impl Debug for PrimitiveKeys
impl Debug for PrimitiveKeys
Source§impl Default for PrimitiveKeys
impl Default for PrimitiveKeys
Source§impl<'de> Deserialize<'de> for PrimitiveKeys
impl<'de> Deserialize<'de> for PrimitiveKeys
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
impl Eq for PrimitiveKeys
Source§impl PartialEq for PrimitiveKeys
impl PartialEq for PrimitiveKeys
Source§impl Serialize for PrimitiveKeys
impl Serialize for PrimitiveKeys
impl StructuralPartialEq for PrimitiveKeys
Auto Trait Implementations§
impl Forget for PrimitiveKeys
impl Freeze for PrimitiveKeys
impl RefUnwindSafe for PrimitiveKeys
impl Send for PrimitiveKeys
impl Sync for PrimitiveKeys
impl Unpin for PrimitiveKeys
impl UnsafeUnpin for PrimitiveKeys
impl UnwindSafe for PrimitiveKeys
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.