pub struct TablesRequest {
pub per_image: bool,
pub per_class: bool,
pub per_detection: bool,
pub per_pair: bool,
}Expand description
Which tables to compute for an evaluate(...) call.
All-false (Self::NONE) means “summary only” — the default
evaluate() path. per_detection and per_pair additionally
require the spine to retain its IoU matrices (set upstream via
crate::EvaluateParams::retain_iou).
Fields§
§per_image: boolBuild a one-row-per-image rollup table.
per_class: boolBuild a one-row-per-category summary table.
per_detection: boolBuild a one-row-per-detection table (requires IoU retention).
per_pair: boolBuild a one-row-per-(DT, GT)-pair table (requires IoU retention).
Implementations§
Source§impl TablesRequest
impl TablesRequest
Sourcepub const NONE: Self
pub const NONE: Self
“No tables, summary only.” Equivalent to Default::default();
named for readability at call sites.
Sourcepub const CHEAP: Self
pub const CHEAP: Self
The two zero-overhead-on-the-spine tables: per_image +
per_class. Both fold over data the matching engine and
accumulator already produce; neither needs IoU retention.
Sourcepub const ALL: Self
pub const ALL: Self
Every table. Requires the upstream evaluator to have been built with IoU retention enabled.
Sourcepub fn requires_iou_retention(&self) -> bool
pub fn requires_iou_retention(&self) -> bool
True iff at least one requested table requires the spine to retain per-cell IoU matrices.
Trait Implementations§
Source§impl Clone for TablesRequest
impl Clone for TablesRequest
Source§fn clone(&self) -> TablesRequest
fn clone(&self) -> TablesRequest
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 TablesRequest
impl Debug for TablesRequest
Source§impl Default for TablesRequest
impl Default for TablesRequest
Source§fn default() -> TablesRequest
fn default() -> TablesRequest
Source§impl PartialEq for TablesRequest
impl PartialEq for TablesRequest
Source§fn eq(&self, other: &TablesRequest) -> bool
fn eq(&self, other: &TablesRequest) -> bool
self and other values to be equal, and is used by ==.impl Copy for TablesRequest
impl Eq for TablesRequest
impl StructuralPartialEq for TablesRequest
Auto Trait Implementations§
impl Freeze for TablesRequest
impl RefUnwindSafe for TablesRequest
impl Send for TablesRequest
impl Sync for TablesRequest
impl Unpin for TablesRequest
impl UnsafeUnpin for TablesRequest
impl UnwindSafe for TablesRequest
Blanket Implementations§
Source§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
Source§type ArchivedMetadata = ()
type ArchivedMetadata = ()
Source§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<T> LayoutRaw for T
impl<T> LayoutRaw for T
Source§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
Source§impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
Source§unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
Source§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
out indicating that a T is niched.