Struct freya::core::render::Compositor
pub struct Compositor { /* private fields */ }
Implementations§
§impl Compositor
impl Compositor
pub fn get_drawing_area( node_id: EntityId, layout: &Torin<EntityId>, rdom: &RealDom<CustomAttributeValues>, scale_factor: f32, ) -> Option<Rect<f32, Measure>>
pub fn with_utils<T>( node_id: EntityId, layout: &Torin<EntityId>, rdom: &RealDom<CustomAttributeValues>, run: impl FnOnce(NodeRef<'_, CustomAttributeValues>, ElementWithUtils, &LayoutNode) -> T, ) -> Option<T>
pub fn run<'a>(
&mut self,
dirty_nodes: &mut CompositorDirtyNodes,
dirty_area: &mut CompositorDirtyArea,
cache: &mut CompositorCache,
layers: &'a Layers,
dirty_layers: &'a mut Layers,
layout: &Torin<EntityId>,
rdom: &RealDom<CustomAttributeValues>,
scale_factor: f32,
) -> &'a Layers
pub fn run<'a>( &mut self, dirty_nodes: &mut CompositorDirtyNodes, dirty_area: &mut CompositorDirtyArea, cache: &mut CompositorCache, layers: &'a Layers, dirty_layers: &'a mut Layers, layout: &Torin<EntityId>, rdom: &RealDom<CustomAttributeValues>, scale_factor: f32, ) -> &'a Layers
The compositor runs from the bottom layers to the top and viceversa to check what Nodes might be affected by the
dirty area. How a Node is checked is by calculating its drawing area which consists of its layout area plus any possible
outer effect such as shadows and borders.
Calculating the drawing area might get expensive so we cache them in the cached_areas
map to make the second layers run faster
(top to bottom).
In addition to that, nodes that have already been united to the dirty area are removed from the running_layers
to avoid being checked again
at the second layers (top to bottom).
pub fn reset(&mut self)
pub fn reset(&mut self)
Reset the compositor, thus causing a full render in the next frame.
Trait Implementations§
§impl Debug for Compositor
impl Debug for Compositor
§impl Default for Compositor
impl Default for Compositor
§fn default() -> Compositor
fn default() -> Compositor
Returns the “default value” for a type. Read more
Auto Trait Implementations§
impl Freeze for Compositor
impl RefUnwindSafe for Compositor
impl Send for Compositor
impl Sync for Compositor
impl Unpin for Compositor
impl UnwindSafe for Compositor
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<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
§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
.§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
.§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.§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.§impl<T> DowncastSync for T
impl<T> DowncastSync for T
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§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 more§impl<T> NoneValue for Twhere
T: Default,
impl<T> NoneValue for Twhere
T: Default,
type NoneType = T
§fn null_value() -> T
fn null_value() -> T
The none-equivalent value.
§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()
.§impl<T, O> SuperFrom<T> for Owhere
O: From<T>,
impl<T, O> SuperFrom<T> for Owhere
O: From<T>,
§fn super_from(input: T) -> O
fn super_from(input: T) -> O
Convert from a type to another type.
§impl<T, O, M> SuperInto<O, M> for Twhere
O: SuperFrom<T, M>,
impl<T, O, M> SuperInto<O, M> for Twhere
O: SuperFrom<T, M>,
§fn super_into(self) -> O
fn super_into(self) -> O
Convert from a type to another type.