mirror of
https://github.com/uutils/coreutils
synced 2024-12-14 15:22:38 +00:00
Fix styling in fmt
This commit is contained in:
parent
d65a3f85a1
commit
002e02f50c
1 changed files with 19 additions and 8 deletions
|
@ -60,7 +60,9 @@ pub fn break_lines(
|
|||
let (w, w_len) = match p_words_words.next() {
|
||||
Some(winfo) => (winfo.word, winfo.word_nchars),
|
||||
None => {
|
||||
return ostream.write_all(b"\n").map_err_context(|| "failed to write output".to_string());
|
||||
return ostream
|
||||
.write_all(b"\n")
|
||||
.map_err_context(|| "failed to write output".to_string());
|
||||
}
|
||||
};
|
||||
// print the init, if it exists, and get its length
|
||||
|
@ -108,7 +110,9 @@ fn break_simple<'a, T: Iterator<Item = &'a WordInfo<'a>>>(
|
|||
iter.try_fold((args.init_len, false), |l, winfo| {
|
||||
accum_words_simple(args, l, winfo)
|
||||
})?;
|
||||
args.ostream.write_all(b"\n").map_err_context(|| "failed to write output".to_string())
|
||||
args.ostream
|
||||
.write_all(b"\n")
|
||||
.map_err_context(|| "failed to write output".to_string())
|
||||
}
|
||||
|
||||
fn accum_words_simple<'a>(
|
||||
|
@ -210,7 +214,9 @@ fn break_knuth_plass<'a, T: Clone + Iterator<Item = &'a WordInfo<'a>>>(
|
|||
fresh = false;
|
||||
write_with_spaces(word, slen, args.ostream)?;
|
||||
}
|
||||
args.ostream.write_all(b"\n").map_err_context(|| "failed to write output".to_string())
|
||||
args.ostream
|
||||
.write_all(b"\n")
|
||||
.map_err_context(|| "failed to write output".to_string())
|
||||
}
|
||||
|
||||
struct LineBreak<'a> {
|
||||
|
@ -369,14 +375,19 @@ fn find_kp_breakpoints<'a, T: Iterator<Item = &'a WordInfo<'a>>>(
|
|||
build_best_path(&linebreaks, active_breaks)
|
||||
}
|
||||
|
||||
fn build_best_path<'a>(paths: &[LineBreak<'a>], active: &[usize]) -> UResult<Vec<(&'a WordInfo<'a>, bool)>> {
|
||||
fn build_best_path<'a>(
|
||||
paths: &[LineBreak<'a>],
|
||||
active: &[usize],
|
||||
) -> UResult<Vec<(&'a WordInfo<'a>, bool)>> {
|
||||
let mut breakwords = vec![];
|
||||
// of the active paths, we select the one with the fewest demerits
|
||||
let mut best_idx = match active.iter().min_by_key(|&&a| paths[a].demerits) {
|
||||
None => return Err(USimpleError::new(
|
||||
1,
|
||||
"Failed to find a k-p linebreak solution. This should never happen."
|
||||
)),
|
||||
None => {
|
||||
return Err(USimpleError::new(
|
||||
1,
|
||||
"Failed to find a k-p linebreak solution. This should never happen.",
|
||||
))
|
||||
}
|
||||
Some(&s) => s,
|
||||
};
|
||||
|
||||
|
|
Loading…
Reference in a new issue