mirror of
https://github.com/RGBCube/uutils-coreutils
synced 2025-08-01 13:37:48 +00:00
tsort: use TsortError for errors in tsort
This commit is contained in:
parent
1e8e16b79c
commit
c9ae4819f5
1 changed files with 45 additions and 23 deletions
|
@ -8,10 +8,11 @@ use std::collections::{HashMap, HashSet, VecDeque};
|
||||||
use std::fmt::Write;
|
use std::fmt::Write;
|
||||||
use std::fs::File;
|
use std::fs::File;
|
||||||
use std::io::{stdin, BufReader, Read};
|
use std::io::{stdin, BufReader, Read};
|
||||||
|
use std::fmt::Display;
|
||||||
use std::path::Path;
|
use std::path::Path;
|
||||||
use uucore::display::Quotable;
|
use uucore::display::Quotable;
|
||||||
use uucore::error::{FromIo, UResult, USimpleError};
|
use uucore::error::{UError, UResult};
|
||||||
use uucore::{format_usage, help_about, help_usage};
|
use uucore::{format_usage, help_about, help_usage, show};
|
||||||
|
|
||||||
const ABOUT: &str = help_about!("tsort.md");
|
const ABOUT: &str = help_about!("tsort.md");
|
||||||
const USAGE: &str = help_usage!("tsort.md");
|
const USAGE: &str = help_usage!("tsort.md");
|
||||||
|
@ -20,6 +21,43 @@ mod options {
|
||||||
pub const FILE: &str = "file";
|
pub const FILE: &str = "file";
|
||||||
}
|
}
|
||||||
|
|
||||||
|
#[derive(Debug)]
|
||||||
|
enum TsortError {
|
||||||
|
/// The input file is actually a directory.
|
||||||
|
IsDir(String),
|
||||||
|
|
||||||
|
/// The number of tokens in the input data is odd.
|
||||||
|
///
|
||||||
|
/// The list of edges must be even because each edge has two
|
||||||
|
/// components: a source node and a target node.
|
||||||
|
NumTokensOdd(String),
|
||||||
|
|
||||||
|
/// The graph contains a cycle.
|
||||||
|
Loop(String),
|
||||||
|
|
||||||
|
/// A particular node in a cycle. (This is mainly used for printing.)
|
||||||
|
LoopNode(String),
|
||||||
|
}
|
||||||
|
|
||||||
|
impl std::error::Error for TsortError {}
|
||||||
|
|
||||||
|
impl UError for TsortError {}
|
||||||
|
|
||||||
|
impl Display for TsortError {
|
||||||
|
fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result {
|
||||||
|
match self {
|
||||||
|
Self::IsDir(d) => write!(f, "{d}: read error: Is a directory"),
|
||||||
|
Self::NumTokensOdd(i) => write!(
|
||||||
|
f,
|
||||||
|
"{}: input contains an odd number of tokens",
|
||||||
|
i.maybe_quote()
|
||||||
|
),
|
||||||
|
Self::Loop(i) => write!(f, "{i}: input contains a loop:"),
|
||||||
|
Self::LoopNode(v) => write!(f, "{v}"),
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
#[uucore::main]
|
#[uucore::main]
|
||||||
pub fn uumain(args: impl uucore::Args) -> UResult<()> {
|
pub fn uumain(args: impl uucore::Args) -> UResult<()> {
|
||||||
let matches = uu_app().try_get_matches_from(args)?;
|
let matches = uu_app().try_get_matches_from(args)?;
|
||||||
|
@ -36,10 +74,7 @@ pub fn uumain(args: impl uucore::Args) -> UResult<()> {
|
||||||
} else {
|
} else {
|
||||||
let path = Path::new(&input);
|
let path = Path::new(&input);
|
||||||
if path.is_dir() {
|
if path.is_dir() {
|
||||||
return Err(USimpleError::new(
|
return Err(TsortError::IsDir(input.to_string()).into());
|
||||||
1,
|
|
||||||
format!("{input}: read error: Is a directory"),
|
|
||||||
));
|
|
||||||
}
|
}
|
||||||
file_buf = File::open(path).map_err_context(|| input.to_string())?;
|
file_buf = File::open(path).map_err_context(|| input.to_string())?;
|
||||||
&mut file_buf as &mut dyn Read
|
&mut file_buf as &mut dyn Read
|
||||||
|
@ -57,32 +92,19 @@ pub fn uumain(args: impl uucore::Args) -> UResult<()> {
|
||||||
for ab in tokens.chunks(2) {
|
for ab in tokens.chunks(2) {
|
||||||
match ab.len() {
|
match ab.len() {
|
||||||
2 => g.add_edge(ab[0], ab[1]),
|
2 => g.add_edge(ab[0], ab[1]),
|
||||||
_ => {
|
_ => return Err(TsortError::NumTokensOdd(input.to_string()).into()),
|
||||||
return Err(USimpleError::new(
|
|
||||||
1,
|
|
||||||
format!(
|
|
||||||
"{}: input contains an odd number of tokens",
|
|
||||||
input.maybe_quote()
|
|
||||||
),
|
|
||||||
))
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
match g.run_tsort() {
|
match g.run_tsort() {
|
||||||
Err(cycle) => {
|
Err(cycle) => {
|
||||||
let mut error_message = format!(
|
show!(TsortError::Loop(input.to_string()));
|
||||||
"{}: {}: input contains a loop:\n",
|
|
||||||
uucore::util_name(),
|
|
||||||
input
|
|
||||||
);
|
|
||||||
for node in &cycle {
|
for node in &cycle {
|
||||||
writeln!(error_message, "{}: {}", uucore::util_name(), node).unwrap();
|
show!(TsortError::LoopNode(node.to_string()));
|
||||||
}
|
}
|
||||||
eprint!("{}", error_message);
|
|
||||||
println!("{}", cycle.join("\n"));
|
println!("{}", cycle.join("\n"));
|
||||||
Err(USimpleError::new(1, ""))
|
Ok(())
|
||||||
}
|
}
|
||||||
Ok(ordering) => {
|
Ok(ordering) => {
|
||||||
println!("{}", ordering.join("\n"));
|
println!("{}", ordering.join("\n"));
|
||||||
|
|
Loading…
Add table
Add a link
Reference in a new issue