Crate jetty

Implementations of common inclusive jet clustering algorithms.

In the current version, the following distance measures are implemented:

• anti-kt
• Cambridge/Aachen
• kt
• Generalised kt.

For state-of-the-art implementations of many more jet algorithms, have a look at the excellent fastjet library.

Examples

Cluster a number of partons into jets using the anti-kt algorithm with radius 0.4:

use jetty::{anti_kt_f, pseudojet_f, Cluster, ClusterHistory, ClusterStep};

let partons = vec![
    pseudojet_f(0.2626773221934335, -0.08809521946454194, -0.1141608706693822, -0.2195584284654444),
    pseudojet_f(2.21902459329915, -0.7529973704809976, -0.9658189214109036, -1.850475321845671)
];

// get all jets
let all_jets = partons.clone().cluster(anti_kt_f(0.4));
assert_eq!(all_jets.len(), 1);

// get all jets with at least 40 GeV
let jets_40gev = partons.clone().cluster_if(
   anti_kt_f(0.4),
   |jet| jet.pt2() > 40. * 40.
);
assert_eq!(jets_40gev.len(), 0);

// go through the cluster history step-by-step
let history = ClusterHistory::new(partons, anti_kt_f(0.4));
for step in history {
   match step {
      ClusterStep::Jet(j) => println!("Found a jet: {j:?}"),
      ClusterStep::Combine([_j1, _j2]) => println!("Combined two pseudojets"),
   }
}

Re-exports

• pub use cluster::cluster;
  Deprecated
• pub use cluster::cluster_if;
  Deprecated
• pub use cluster::Cluster;
• pub use cluster::ClusterHistory;
• pub use cluster::ClusterStep;
• pub use distance::anti_kt;
• pub use distance::cambridge_aachen;
• pub use distance::gen_kt;
• pub use distance::kt;
• pub use distance::anti_kt_f;
• pub use distance::cambridge_aachen_f;
• pub use distance::gen_kt_f;
• pub use distance::kt_f;
• pub use pseudojet::pseudojet;
• pub use pseudojet::pseudojet_f;
• pub use pseudojet::PseudoJet;

Modules

• cluster
  Jet clustering algorithms
• distance
  Distances and jet definitions
• pseudojet
  Pseudojets