23365769388

Committed 20 Mar 2026 10:52PM UTC coverage: 68.228% (-3.0%) from 71.245%

Build # 23365769388

Build Type

push

github

Committed by

vigna

Commit Message

No le_bins,be_bins for webgraph

Coverage Stats

6655 of 9754 relevant lines covered (68.23%)

46582760.24 hits per line

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

0.0

/cli/src/check/eq.rs

/*
 * SPDX-FileCopyrightText: 2024 Davide Cologni
 * SPDX-FileCopyrightText: 2026 Sebastiano Vigna
 *
 * SPDX-License-Identifier: Apache-2.0 OR LGPL-2.1-or-later
 */

use anyhow::Result;
use clap::Args;
use dsi_bitstream::dispatch::factory::CodesReaderFactoryHelper;
use dsi_bitstream::prelude::*;
use std::{path::PathBuf, process::exit};
use webgraph::graphs::bvgraph::get_endianness;
use webgraph::traits::graph;
use webgraph::utils::MmapHelper;

#[derive(Args, Debug)]
#[command(
    name = "eq",
    about = "Checks that two graphs have the same contents, listed in the same order.",
    long_about = "Checks that two graphs have the same contents, listed in the same order. Useful to verify equality when two graphs are compressed with different parameters or algorithms (e.g., reference selection).",
    next_line_help = true
)]
pub struct CliArgs {
    /// The basename of the first graph.​
    pub first_basename: PathBuf,
    /// The basename of the second graph.​
    pub second_basename: PathBuf,
}

pub fn main(args: CliArgs) -> Result<()> {
    match get_endianness(&args.first_basename)?.as_str() {
        #[cfg(feature = "be_bins")]
        BE::NAME => compare_graphs::<BE>(args),
        #[cfg(feature = "le_bins")]
        LE::NAME => compare_graphs::<LE>(args),
        e => panic!("Unknown endianness: {}", e),
    }
}

pub fn compare_graphs<E: Endianness + 'static>(args: CliArgs) -> Result<()>
where
    MmapHelper<u32>: CodesReaderFactoryHelper<E>,
{
    let first_graph =
        webgraph::graphs::bvgraph::sequential::BvGraphSeq::with_basename(&args.first_basename)
            .endianness::<E>()
            .load()?;
    let second_graph =
        webgraph::graphs::bvgraph::sequential::BvGraphSeq::with_basename(&args.second_basename)
            .endianness::<E>()
            .load()?;

    log::info!("Comparing graphs...");
    let result = graph::eq(&first_graph, &second_graph);
    if let Err(eq_error) = result {
        eprintln!("{}", eq_error);
        exit(1);
    }
    log::info!("Graphs are equal.");

    Ok(())
}

1	/*
2	* SPDX-FileCopyrightText: 2024 Davide Cologni
3	* SPDX-FileCopyrightText: 2026 Sebastiano Vigna
4	*
5	* SPDX-License-Identifier: Apache-2.0 OR LGPL-2.1-or-later
6	*/
7
8	use anyhow::Result;
9	use clap::Args;
10	use dsi_bitstream::dispatch::factory::CodesReaderFactoryHelper;
11	use dsi_bitstream::prelude::*;
12	use std::{path::PathBuf, process::exit};
13	use webgraph::graphs::bvgraph::get_endianness;
14	use webgraph::traits::graph;
15	use webgraph::utils::MmapHelper;
16
17	#[derive(Args, Debug)]
18	#[command(
19	name = "eq",
20	about = "Checks that two graphs have the same contents, listed in the same order.",
21	long_about = "Checks that two graphs have the same contents, listed in the same order. Useful to verify equality when two graphs are compressed with different parameters or algorithms (e.g., reference selection).",
22	next_line_help = true
23	)]
24	pub struct CliArgs {
25	/// The basename of the first graph.
26	pub first_basename: PathBuf,
27	/// The basename of the second graph.
28	pub second_basename: PathBuf,
29	}
30
31	pub fn main(args: CliArgs) -> Result<()> {	×
32	match get_endianness(&args.first_basename)?.as_str() {	×
33	#[cfg(feature = "be_bins")]
34	BE::NAME => compare_graphs::<BE>(args),	×
35	#[cfg(feature = "le_bins")]
36	LE::NAME => compare_graphs::<LE>(args),	×
37	e => panic!("Unknown endianness: {}", e),	×
38	}
39	}
40
41	pub fn compare_graphs<E: Endianness + 'static>(args: CliArgs) -> Result<()>	×
42	where
43	MmapHelper<u32>: CodesReaderFactoryHelper<E>,
44	{
45	let first_graph =	×
46	webgraph::graphs::bvgraph::sequential::BvGraphSeq::with_basename(&args.first_basename)	×
47	.endianness::<E>()
48	.load()?;
49	let second_graph =	×
50	webgraph::graphs::bvgraph::sequential::BvGraphSeq::with_basename(&args.second_basename)	×
51	.endianness::<E>()
52	.load()?;
53
54	log::info!("Comparing graphs...");	×
55	let result = graph::eq(&first_graph, &second_graph);	×
56	if let Err(eq_error) = result {	×
57	eprintln!("{}", eq_error);	×
58	exit(1);	×
59	}
60	log::info!("Graphs are equal.");	×
61
62	Ok(())	×
63	}

vigna / webgraph-rs / 23365769388

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

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