pub struct LatencyTable {
pub op_latencies: HashMap<String, f64>,
pub size_scale: f64,
}Expand description
Lookup table mapping (operation_name, input_size) → latency in milliseconds.
The default constructor populates a set of representative estimates.
Fields§
§op_latencies: HashMap<String, f64>Raw latency data: key = operation name, value = base latency (ms).
size_scale: f64Scale factor applied per input-size unit.
Implementations§
Source§impl LatencyTable
impl LatencyTable
Sourcepub fn new() -> Self
pub fn new() -> Self
Create a new table with default hardware latency estimates.
Values are representative of a mid-range mobile CPU at 224×224 feature map.
Sourcepub fn latency_of(&self, op: &str, input_size: usize) -> f64
pub fn latency_of(&self, op: &str, input_size: usize) -> f64
Latency for a single operation given input_size (e.g., HWC).
Uses a simple linear model: latency = base + size_scale * input_size.
Sourcepub fn total_latency(&self, arch: &[(String, usize)]) -> f64
pub fn total_latency(&self, arch: &[(String, usize)]) -> f64
Total latency for a sequence of (operation_name, input_size) pairs.
Trait Implementations§
Source§impl Clone for LatencyTable
impl Clone for LatencyTable
Source§fn clone(&self) -> LatencyTable
fn clone(&self) -> LatencyTable
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for LatencyTable
impl Debug for LatencyTable
Auto Trait Implementations§
impl Freeze for LatencyTable
impl RefUnwindSafe for LatencyTable
impl Send for LatencyTable
impl Sync for LatencyTable
impl Unpin for LatencyTable
impl UnsafeUnpin for LatencyTable
impl UnwindSafe for LatencyTable
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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<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.