Switch to Criterion

Cargo.toml

@@ -1,6 +1,6 @@
 [package]
 name = "polylabel"
-version = "1.3.1"
+version = "1.3.2"
 authors = ["Stephan Hügel <urschrei@gmail.com>"]
 description = "A Rust implementation of the Polylabel algorithm for finding optimum polygon label positions."
 readme = "README.md"
@@ -18,6 +18,9 @@ num-traits = "0.2.8"
 [build-dependencies]
 cbindgen = "0.9.0"
 
+[dev-dependencies]
+criterion = "0.3.0"
+
 [lib]
 name = "polylabel"
 crate-type = ["rlib", "cdylib"]
@@ -28,3 +31,7 @@ doc = true
 [profile.release]
 rpath = true
 lto = true
+
+[[bench]]
+name = "benchmark"
+harness = false

benches/benchmark.rs

@@ -0,0 +1,37 @@
+#[macro_use]
+extern crate criterion;
+extern crate polylabel;
+
+use criterion::Criterion;
+use geo::Polygon;
+use polylabel::polylabel;
+
+fn criterion_benchmark(c: &mut Criterion) {
+    c.bench_function("Threaded", |bencher| {
+        // an L shape
+        let coords = vec![
+            (0.0, 0.0),
+            (4.0, 0.0),
+            (4.0, 1.0),
+            (1.0, 1.0),
+            (1.0, 4.0),
+            (0.0, 4.0),
+            (0.0, 0.0),
+        ];
+        let poly = Polygon::new(coords.into(), vec![]);
+        bencher.iter(|| {
+            polylabel(&poly, &10.0);
+        });
+    });
+
+    c.bench_function("Large Polygon", |bencher| {
+        let points = include!("../data/norway_main.rs");
+        let poly = Polygon::new(points.into(), vec![]);
+        bencher.iter(|| {
+            polylabel(&poly, &1.0);
+        });
+    });
+}
+
+criterion_group!(benches, criterion_benchmark);
+criterion_main!(benches);

src/lib.rs

@@ -14,12 +14,6 @@ use std::iter::Sum;
 mod ffi;
 pub use crate::ffi::{polylabel_ffi, Array, Position, WrapperArray};
 
-#[doc(hidden)]
-#[allow(dead_code)]
-pub extern "C" fn spare() {
-    println!();
-}
-
 /// Represention of a Quadtree node's cells. A node contains four Qcells.
 #[derive(Debug)]
 struct Qcell<T>