pub struct EdgeMap { /* private fields */ }Expand description
Which 8×8-grid edges exist, at four-sample granularity.
An edge is only a candidate where a transform block actually ends. Inside a 32×32 transform there is nothing to smooth at sample 8, 16 or 24, and filtering there would blur real content — so the tree’s leaf boundaries have to be recorded as it is built.
Implementations§
Auto Trait Implementations§
impl Forget for EdgeMap
impl Freeze for EdgeMap
impl Move for EdgeMap
impl RefUnwindSafe for EdgeMap
impl Send for EdgeMap
impl Sync for EdgeMap
impl Unpin for EdgeMap
impl UnsafeUnpin for EdgeMap
impl UnwindSafe for EdgeMap
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
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