16728097825

Committed 04 Aug 2025 04:00PM UTC coverage: 48.355% (-35.1%) from 83.429%

Build Type

github

Committed by

Commit Message

Merge 1b2d27fd8 into 649ba9576

Run Details

1 of 1 new or added line in 1 file covered. (100.0%)

11596 existing lines in 378 files now uncovered.

18635 of 38538 relevant lines covered (48.35%)

151786.4 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

0.0

/vortex-array/src/partial_ord.rs

1	// SPDX-License-Identifier: Apache-2.0
2	// SPDX-FileCopyrightText: Copyright the Vortex contributors
3
4	use std::cmp::Ordering;
5
6	pub trait PartialMin: PartialOrd<Self>
7	where
8	Self: Sized,
9	{
10	/// Returns the minimum of two values, if they are comparable.
11	#[inline]
UNCOV 12	fn partial_min(self, other: Self) -> Option<Self> {	×
UNCOV 13	if self.partial_cmp(&other)? == Ordering::Less {	×
UNCOV 14	Some(self)	×
15	} else {
UNCOV 16	Some(other)	×
17	}
UNCOV 18	}	×
19	}
20
UNCOV 21	pub fn partial_min<T: PartialMin>(a: T, b: T) -> Option<T> {	×
UNCOV 22	a.partial_min(b)	×
UNCOV 23	}	×
24
25	impl<T: PartialOrd> PartialMin for T {}
26
27	pub trait PartialMax: PartialOrd<Self>
28	where
29	Self: Sized,
30	{
31	/// Returns the maximum of two values, if they are comparable.
32	#[inline]
UNCOV 33	fn partial_max(self, other: Self) -> Option<Self> {	×
UNCOV 34	if self.partial_cmp(&other)? == Ordering::Greater {	×
UNCOV 35	Some(self)	×
36	} else {
UNCOV 37	Some(other)	×
38	}
UNCOV 39	}	×
40	}
41
42	impl<T: PartialOrd> PartialMax for T {}
43
UNCOV 44	pub fn partial_max<T: PartialMax>(a: T, b: T) -> Option<T> {	×
UNCOV 45	a.partial_max(b)	×
UNCOV 46	}	×