Struct PendingPresentationIntents

pub struct PendingPresentationIntents { /* private fields */ }

Coalescing store for presentation operations requested while detached.

Title, size, cursor, and redraw use last-value/boolean coalescing. Chrome operations retain every value in insertion order without a capacity bound. Cloning duplicates all owned titles and queued operations.

Examples

use ailloli_ui_runtime::app::{PendingPresentationIntents, PresentationIntent};
let mut pending = PendingPresentationIntents::default();
pending.push(PresentationIntent::SetTitle("first".into()));
pending.push(PresentationIntent::SetTitle("last".into()));
assert_eq!(pending.drain(), [PresentationIntent::SetTitle("last".into())]);

Implementations

impl PendingPresentationIntents

Provides the operations defined for PendingPresentationIntents.

pub fn push(&mut self, intent: PresentationIntent)

Coalesces or appends one deferred operation.

State-setting intents overwrite the prior value; redraw becomes true; chrome operations append and can grow the vector without bound.

Examples

use ailloli_ui_runtime::app::{PendingPresentationIntents, PresentationIntent};
let mut pending = PendingPresentationIntents::default();
pending.push(PresentationIntent::Redraw);
pending.push(PresentationIntent::Redraw);
assert_eq!(pending.drain(), [PresentationIntent::Redraw]);

pub fn is_empty(&self) -> bool

Returns whether no coalesced or queued operation is pending.

Examples

use ailloli_ui_runtime::app::{PendingPresentationIntents, PresentationIntent};
let mut pending = PendingPresentationIntents::default();
assert!(pending.is_empty());
pending.push(PresentationIntent::Redraw);
assert!(!pending.is_empty());

pub fn drain(&mut self) -> Vec<PresentationIntent>

Drains coalesced intents in deterministic replay order.

Replay order is title, size, cursor, every chrome operation in insertion order, then redraw, regardless of original interleaving. All stored state is cleared; a second drain is empty.

Examples

use ailloli_ui_core::Size;
use ailloli_ui_runtime::app::{PendingPresentationIntents, PresentationCursor, PresentationIntent};
let mut pending = PendingPresentationIntents::default();
pending.push(PresentationIntent::Redraw);
pending.push(PresentationIntent::SetCursor(PresentationCursor::Text));
pending.push(PresentationIntent::SetInnerSize(Size::new(10.0, 20.0)));
assert_eq!(pending.drain(), [
    PresentationIntent::SetInnerSize(Size::new(10.0, 20.0)),
    PresentationIntent::SetCursor(PresentationCursor::Text),
    PresentationIntent::Redraw,
]);
assert!(pending.is_empty());

Trait Implementations

impl Clone for PendingPresentationIntents

fn clone(&self) -> PendingPresentationIntents

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for PendingPresentationIntents

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for PendingPresentationIntents

fn default() -> PendingPresentationIntents

Returns the “default value” for a type.

impl PartialEq for PendingPresentationIntents

fn eq(&self, other: &PendingPresentationIntents) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for PendingPresentationIntents