pub struct PathDataIterator { /* private fields */ }
Expand description
PathDataIterator is a data structure that acts as starting point for iterating through the low-level events of a path. If the path was constructed from said events, then it is a very thin abstraction. If the path was created from higher-level elements, then an intermediate lyon path is required/built.
Implementations§
Source§impl PathDataIterator
impl PathDataIterator
Sourcepub fn iter(&self) -> impl Iterator<Item = Event<Point, Point>> + '_
pub fn iter(&self) -> impl Iterator<Item = Event<Point, Point>> + '_
Create a new iterator for path traversal.
Sourcepub fn fit(&mut self, width: f32, height: f32, viewbox: Option<Box2D>)
pub fn fit(&mut self, width: f32, height: f32, viewbox: Option<Box2D>)
Applies a transformation on the elements this iterator provides that tries to fit everything into the specified width/height, respecting the provided viewbox. If no viewbox is specified, the bounding rectangle of the path is used.
Auto Trait Implementations§
impl Freeze for PathDataIterator
impl RefUnwindSafe for PathDataIterator
impl Send for PathDataIterator
impl !Sync for PathDataIterator
impl Unpin for PathDataIterator
impl UnwindSafe for PathDataIterator
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