Trait gdnative::core_types::ToVariant
source · [−]pub trait ToVariant {
fn to_variant(&self) -> Variant;
}
Expand description
Types that can be converted to a Variant
.
Wrappers and collections
Implementations are provided for a few common Rust wrappers and collections:
Option<T>
is unwrapped to inner value, orNil
ifNone
Result<T, E>
is represented as an externally taggedDictionary
(see below).PhantomData<T>
is represented asNil
.&[T]
andVec<T>
are represented asVariantArray
s.FromVariant
is only implemented forVec<T>
.
Deriving ToVariant
The derive macro does the following mapping between Rust structures and Godot types:
Newtype(inner)
is unwrapped toinner
Tuple(a, b, c)
is represented as aVariantArray
([a, b, c]
)Struct { a, b, c }
is represented as aDictionary
({ "a": a, "b": b, "c": c }
)Unit
is represented as an emptyDictionary
({}
)Enum::Variant(a, b, c)
is represented as an externally taggedDictionary
({ "Variant": [a, b, c] }
)
Behavior of the derive macros can be customized using attributes:
Field attributes
#[variant(to_variant_with = "path::to::func")]
Use the given function to convert the field to Variant
. The function’s signature is
expected to be fn(&T) -> Variant
, although it can be generic over T
.
#[variant(from_variant_with = "path::to::func")]
Use the given function to convert from a Variant
. The function’s signature is
expected to be fn(&Variant) -> Result<T, FromVariantError>
, although it can be generic
over T
.
#[variant(with = "path::to::mod")]
Convenience attribute that sets to_variant_with
to path::to::mod::to_variant
and
from_variant_with
to path::to::mod::from_variant
.
#[variant(skip_to_variant)]
Skip the field when converting to Variant
.
#[variant(skip_from_variant)]
Skip the field when converting from Variant
. A default vale will be obtained using
Default::default()
.
#[variant(skip)]
Convenience attribute that sets skip_to_variant
and skip_from_variant
.
Required Methods
fn to_variant(&self) -> Variant
Implementations on Foreign Types
sourceimpl<T5, T6, T7, T8, T9, T10, T11, T12> ToVariant for (T5, T6, T7, T8, T9, T10, T11, T12)where
T5: ToVariant,
T6: ToVariant,
T7: ToVariant,
T8: ToVariant,
T9: ToVariant,
T10: ToVariant,
T11: ToVariant,
T12: ToVariant,
impl<T5, T6, T7, T8, T9, T10, T11, T12> ToVariant for (T5, T6, T7, T8, T9, T10, T11, T12)where
T5: ToVariant,
T6: ToVariant,
T7: ToVariant,
T8: ToVariant,
T9: ToVariant,
T10: ToVariant,
T11: ToVariant,
T12: ToVariant,
fn to_variant(&self) -> Variant
sourceimpl<'a, T> ToVariant for &'a mut Twhere
T: ToVariant + ?Sized,
impl<'a, T> ToVariant for &'a mut Twhere
T: ToVariant + ?Sized,
fn to_variant(&self) -> Variant
sourceimpl<T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12> ToVariant for (T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12)where
T1: ToVariant,
T2: ToVariant,
T3: ToVariant,
T4: ToVariant,
T5: ToVariant,
T6: ToVariant,
T7: ToVariant,
T8: ToVariant,
T9: ToVariant,
T10: ToVariant,
T11: ToVariant,
T12: ToVariant,
impl<T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12> ToVariant for (T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12)where
T1: ToVariant,
T2: ToVariant,
T3: ToVariant,
T4: ToVariant,
T5: ToVariant,
T6: ToVariant,
T7: ToVariant,
T8: ToVariant,
T9: ToVariant,
T10: ToVariant,
T11: ToVariant,
T12: ToVariant,
fn to_variant(&self) -> Variant
sourceimpl<T9, T10, T11, T12> ToVariant for (T9, T10, T11, T12)where
T9: ToVariant,
T10: ToVariant,
T11: ToVariant,
T12: ToVariant,
impl<T9, T10, T11, T12> ToVariant for (T9, T10, T11, T12)where
T9: ToVariant,
T10: ToVariant,
T11: ToVariant,
T12: ToVariant,
fn to_variant(&self) -> Variant
sourceimpl<'a, T> ToVariant for &'a Twhere
T: ToVariant + ?Sized,
impl<'a, T> ToVariant for &'a Twhere
T: ToVariant + ?Sized,
fn to_variant(&self) -> Variant
sourceimpl<K, V> ToVariant for HashMap<K, V, RandomState>where
K: ToVariant + Hash + ToVariantEq,
V: ToVariant,
impl<K, V> ToVariant for HashMap<K, V, RandomState>where
K: ToVariant + Hash + ToVariantEq,
V: ToVariant,
Converts the hash map to a Dictionary
, wrapped in a Variant
.
Note that Rust’s HashMap
is non-deterministically ordered for security reasons, meaning that
the order of the same elements will differ between two program invocations. To provide a
deterministic output in Godot (e.g. UI elements for properties), the elements are sorted by key.
fn to_variant(&self) -> Variant
sourceimpl<T11, T12> ToVariant for (T11, T12)where
T11: ToVariant,
T12: ToVariant,
impl<T11, T12> ToVariant for (T11, T12)where
T11: ToVariant,
T12: ToVariant,
fn to_variant(&self) -> Variant
sourceimpl<T> ToVariant for PhantomData<T>
impl<T> ToVariant for PhantomData<T>
fn to_variant(&self) -> Variant
sourceimpl<T7, T8, T9, T10, T11, T12> ToVariant for (T7, T8, T9, T10, T11, T12)where
T7: ToVariant,
T8: ToVariant,
T9: ToVariant,
T10: ToVariant,
T11: ToVariant,
T12: ToVariant,
impl<T7, T8, T9, T10, T11, T12> ToVariant for (T7, T8, T9, T10, T11, T12)where
T7: ToVariant,
T8: ToVariant,
T9: ToVariant,
T10: ToVariant,
T11: ToVariant,
T12: ToVariant,
fn to_variant(&self) -> Variant
sourceimpl<T6, T7, T8, T9, T10, T11, T12> ToVariant for (T6, T7, T8, T9, T10, T11, T12)where
T6: ToVariant,
T7: ToVariant,
T8: ToVariant,
T9: ToVariant,
T10: ToVariant,
T11: ToVariant,
T12: ToVariant,
impl<T6, T7, T8, T9, T10, T11, T12> ToVariant for (T6, T7, T8, T9, T10, T11, T12)where
T6: ToVariant,
T7: ToVariant,
T8: ToVariant,
T9: ToVariant,
T10: ToVariant,
T11: ToVariant,
T12: ToVariant,
fn to_variant(&self) -> Variant
sourceimpl<T8, T9, T10, T11, T12> ToVariant for (T8, T9, T10, T11, T12)where
T8: ToVariant,
T9: ToVariant,
T10: ToVariant,
T11: ToVariant,
T12: ToVariant,
impl<T8, T9, T10, T11, T12> ToVariant for (T8, T9, T10, T11, T12)where
T8: ToVariant,
T9: ToVariant,
T10: ToVariant,
T11: ToVariant,
T12: ToVariant,
fn to_variant(&self) -> Variant
sourceimpl<T10, T11, T12> ToVariant for (T10, T11, T12)where
T10: ToVariant,
T11: ToVariant,
T12: ToVariant,
impl<T10, T11, T12> ToVariant for (T10, T11, T12)where
T10: ToVariant,
T11: ToVariant,
T12: ToVariant,
fn to_variant(&self) -> Variant
sourceimpl<T> ToVariant for HashSet<T, RandomState>where
T: ToVariant,
impl<T> ToVariant for HashSet<T, RandomState>where
T: ToVariant,
Converts the hash set to a VariantArray
, wrapped in a Variant
.
Note that Rust’s HashSet
is non-deterministically ordered for security reasons, meaning that
the order of the same elements will differ between two program invocations. To provide a
deterministic output in Godot (e.g. UI elements for properties), the elements are sorted by key.