pub fn new(cmp: F, n: usize) -> Self {
		Self {
			top: BTreeSet::with_cmp(NeverEqual::new(cmp)),
			n,
		}
	}
/// Create an empty `Sort` data structure with the specified `n` capacity.
Create an empty `Sort` data structure with the specified `n` capacity.
Create an empty ` Sort ` data structure with the specified ` n ` capacity .
pub fn new(cmp: F, n: usize) -> Self {
		Self {
			top: BTreeSet::with_cmp(NeverEqual::new(cmp)),
			n,
		}
	}
pub fn new ( cmp : F , n : usize ) -> Self { Self { top : BTreeSet :: with_cmp ( NeverEqual :: new ( cmp ) ) , n , } }
Create an empty `Sort` data structure with the specified `n` capacity.
Create an empty ` Sort ` data structure with the specified ` n ` capacity .
cmp
F
n
usize