pub(crate) fn reorder<T: Real>(
t: &mut DenseBlock<T>,
z: &mut DenseBlock<T>,
rank: &[usize],
need: usize,
o: &SchurOptions<T>,
) -> (Vec<(usize, usize, usize)>, bool)Expand description
Algorithm RO: reorder t (and z) so that the blocks of least rank
lead, until at least need rows are settled. rank[b] is the rank of
block b of blocks. Returns the final blocks with their ranks and
whether every swap was accepted.