pub struct GraphNodeConstructorContainer<Node, Ctx> { /* private fields */ }
Expand description
A special container that is able to create nodes by their type UUID.
Implementations§
Source§impl<Node, Ctx> GraphNodeConstructorContainer<Node, Ctx>
impl<Node, Ctx> GraphNodeConstructorContainer<Node, Ctx>
Sourcepub fn add<Inner>(&self)where
Inner: ConstructorProvider<Node, Ctx>,
pub fn add<Inner>(&self)where
Inner: ConstructorProvider<Node, Ctx>,
Adds new type constructor for a given type and return previous constructor for the type (if any).
Sourcepub fn add_custom(
&self,
type_uuid: Uuid,
constructor: GraphNodeConstructor<Node, Ctx>,
)
pub fn add_custom( &self, type_uuid: Uuid, constructor: GraphNodeConstructor<Node, Ctx>, )
Adds custom type constructor.
Sourcepub fn try_create(&self, type_uuid: &Uuid) -> Option<Node>
pub fn try_create(&self, type_uuid: &Uuid) -> Option<Node>
Makes an attempt to create a node using provided type UUID. It may fail if there is no node constructor for specified type UUID.
Sourcepub fn map(
&self,
) -> MutexGuard<'_, RawMutex, HashMap<Uuid, GraphNodeConstructor<Node, Ctx>, BuildHasherDefault<FxHasher>>>
pub fn map( &self, ) -> MutexGuard<'_, RawMutex, HashMap<Uuid, GraphNodeConstructor<Node, Ctx>, BuildHasherDefault<FxHasher>>>
Returns the inner map of the node constructors.
Trait Implementations§
Source§impl<Node, Ctx> Default for GraphNodeConstructorContainer<Node, Ctx>
impl<Node, Ctx> Default for GraphNodeConstructorContainer<Node, Ctx>
Source§fn default() -> GraphNodeConstructorContainer<Node, Ctx>
fn default() -> GraphNodeConstructorContainer<Node, Ctx>
Returns the “default value” for a type. Read more
Auto Trait Implementations§
impl<Node, Ctx> !Freeze for GraphNodeConstructorContainer<Node, Ctx>
impl<Node, Ctx> !RefUnwindSafe for GraphNodeConstructorContainer<Node, Ctx>
impl<Node, Ctx> Send for GraphNodeConstructorContainer<Node, Ctx>
impl<Node, Ctx> Sync for GraphNodeConstructorContainer<Node, Ctx>
impl<Node, Ctx> Unpin for GraphNodeConstructorContainer<Node, Ctx>
impl<Node, Ctx> !UnwindSafe for GraphNodeConstructorContainer<Node, Ctx>
Blanket Implementations§
Source§impl<T> AsyncTaskResult for T
impl<T> AsyncTaskResult for T
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
Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Convert
Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
. Box<dyn Any>
can
then be further downcast
into Box<ConcreteType>
where ConcreteType
implements Trait
.Source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Convert
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
.Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Convert
&Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert
&mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s.Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Converts self reference as a reference to
Any
. Could be used to downcast a trait object
to a particular type.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Converts self reference as a reference to
Any
. Could be used to downcast a trait object
to a particular type.fn into_any(self: Box<T>) -> Box<dyn Any>
Source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
Source§impl<T> FieldValue for Twhere
T: 'static,
impl<T> FieldValue for Twhere
T: 'static,
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
Source§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<R, P> ReadPrimitive<R> for P
impl<R, P> ReadPrimitive<R> for P
Source§fn read_from_little_endian(read: &mut R) -> Result<Self, Error>
fn read_from_little_endian(read: &mut R) -> Result<Self, Error>
Read this value from the supplied reader. Same as
ReadEndian::read_from_little_endian()
.Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.