Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension


Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions Cargo.toml
Original file line number Diff line number Diff line change
Expand Up @@ -17,7 +17,7 @@ default = ["datasets"]
ndarray-bindings = ["ndarray"]
nalgebra-bindings = ["nalgebra"]
datasets = []
fp_bench = []
fp_bench = ["itertools"]

[dependencies]
ndarray = { version = "0.15", optional = true }
Expand All @@ -27,7 +27,7 @@ num = "0.4"
rand = "0.8"
rand_distr = "0.4"
serde = { version = "1", features = ["derive"], optional = true }
itertools = "0.10.3"
itertools = { version = "0.10.3", optional = true }

[target.'cfg(target_arch = "wasm32")'.dependencies]
getrandom = { version = "0.2", features = ["js"] }
Expand Down
3 changes: 1 addition & 2 deletions src/algorithm/neighbour/fastpair.rs
Original file line number Diff line number Diff line change
@@ -1,5 +1,3 @@
#![allow(non_snake_case)]
use itertools::Itertools;
///
/// # FastPair: Data-structure for the dynamic closest-pair problem.
///
Expand Down Expand Up @@ -177,6 +175,7 @@ impl<'a, T: RealNumber, M: Matrix<T>> FastPair<'a, T, M> {
///
#[cfg(feature = "fp_bench")]
pub fn closest_pair_brute(&self) -> PairwiseDistance<T> {
use itertools::Itertools;
let m = self.samples.shape().0;

let mut closest_pair = PairwiseDistance {
Expand Down