pub struct ComplexityAnalysis {
pub time_complexity: Option<String>,
pub space_complexity: Option<String>,
pub parallelization_potential: f64,
pub sequential_dependencies: usize,
}Expand description
Complexity analysis of the computation
Fields§
§time_complexity: Option<String>Asymptotic (Big-O) time complexity, when it can honestly be
derived. A single ComputationGraph is one concrete, fixed-shape
instance – it has no symbolic size parameter n to be asymptotic
in, so there is nothing to honestly derive here today; always
None, never a fabricated "O(n)". Concrete costs for the actual
instance are available for real via FlopAnalysis::total_flops.
space_complexity: Option<String>Asymptotic (Big-O) space complexity. Same honesty caveat as
Self::time_complexity; concrete space for this instance is
available for real via MemoryAnalysis::total_memory_usage.
parallelization_potential: f64Real, structural parallelization-potential estimate in [0, 1]:
1 - (critical_path_length_in_nodes / node_count), i.e. the
fraction of nodes that are not on the graph’s longest
dependency chain and could in principle execute alongside it. 0.0
for a pure sequential chain (every node is on the critical path),
approaching 1.0 for a wide, shallow graph. Computed from the
graph’s real topology (see
ComputationGraphAnalyzer::analyze_flop_usage) – never the old
constant 0.7.
sequential_dependencies: usizeSequential dependencies
Trait Implementations§
Source§impl Clone for ComplexityAnalysis
impl Clone for ComplexityAnalysis
Source§fn clone(&self) -> ComplexityAnalysis
fn clone(&self) -> ComplexityAnalysis
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreSource§impl Debug for ComplexityAnalysis
impl Debug for ComplexityAnalysis
Source§impl<'de> Deserialize<'de> for ComplexityAnalysis
impl<'de> Deserialize<'de> for ComplexityAnalysis
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Auto Trait Implementations§
impl Freeze for ComplexityAnalysis
impl RefUnwindSafe for ComplexityAnalysis
impl Send for ComplexityAnalysis
impl Sync for ComplexityAnalysis
impl Unpin for ComplexityAnalysis
impl UnsafeUnpin for ComplexityAnalysis
impl UnwindSafe for ComplexityAnalysis
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> ConfigSerializable for Twhere
T: Serialize + for<'de> Deserialize<'de>,
impl<T> ConfigSerializable for Twhere
T: Serialize + for<'de> Deserialize<'de>,
Source§fn save_to_file(&self, path: &Path) -> Result<(), TrustformersError>
fn save_to_file(&self, path: &Path) -> Result<(), TrustformersError>
Source§fn load_from_file(path: &Path) -> Result<Self, TrustformersError>where
Self: Sized,
fn load_from_file(path: &Path) -> Result<Self, TrustformersError>where
Self: Sized,
impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
Source§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> ⓘ
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> ⓘ
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
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
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>
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
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
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self to the equivalent element of its superset.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>
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
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
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self to the equivalent element of its superset.