Update

Author: hatoo

Cargo.toml

@@ -2,8 +2,9 @@
 name = "competitive-rust-snippets"
 version = "0.1.0"
 authors = ["hatoo <[email protected]>"]
+edition = "2018"
 
 [dependencies]
-cargo-snippet = "0.2"
+cargo-snippet = "0.4"
 rand = "0.4"
 

src/bucket.rs

@@ -152,7 +152,7 @@ impl BucketImpl for RangeAddQueryMax {
 #[test]
 fn test_range_add_query_max() {
     use rand::{Rng, SeedableRng, StdRng};
-    use util::random_range;
+    use crate::util::random_range;
 
     // Test against naive vector
     let size = 1000;

src/geometry.rs

@@ -72,7 +72,7 @@ impl std::ops::Div<f64> for Vector2D {
     }
 }
 
-use total::Total;
+use crate::total::Total;
 
 #[snippet("convex_hull")]
 #[allow(dead_code)]

src/lib.rs

@@ -1,4 +1,5 @@
 #![feature(custom_inner_attributes)]
+#![feature(proc_macro_hygiene)]
 #![feature(test)]
 
 extern crate test;

src/lis.rs

@@ -1,7 +1,7 @@
 use cargo_snippet::snippet;
 use std::cmp::Ordering;
 
-use binary_search::BinarySearch;
+use crate::binary_search::BinarySearch;
 
 #[snippet("lis")]
 #[snippet(include = "BinarySearch")]

src/seg_lazy.rs

@@ -179,7 +179,7 @@ impl SEGimpl for NonCommutative {
 #[test]
 fn test_seg_lazy() {
     use rand::{Rng, SeedableRng, StdRng};
-    use util;
+    use crate::util;
 
     let size = 1000;
     let mut v = vec![0; size];
@@ -216,7 +216,7 @@ fn test_seg_lazy() {
 #[test]
 fn test_seg_lazy_non_commutative() {
     use rand::{Rng, SeedableRng, StdRng};
-    use util;
+    use crate::util;
     let mut rng = StdRng::from_seed(&[1, 2, 3, 4, 5]);
 
     let size = 100;
@@ -242,7 +242,7 @@ use test::Bencher;
 #[bench]
 fn bench_lazy_segtree_range_add(b: &mut Bencher) {
     use rand::{Rng, SeedableRng, StdRng};
-    use util;
+    use crate::util;
 
     let size = 10000;
     let mut seg: SEG<RangeAddSum> = SEG::new(size, (0, 0));
@@ -271,7 +271,7 @@ fn bench_lazy_segtree_range_add(b: &mut Bencher) {
 #[bench]
 fn bench_lazy_segtree_query(b: &mut Bencher) {
     use rand::{Rng, SeedableRng, StdRng};
-    use util;
+    use crate::util;
 
     let size = 10000;
     let mut seg: SEG<RangeAddSum> = SEG::new(size, (0, 0));

src/segtree.rs

@@ -94,7 +94,7 @@ impl Monoid for SUM {
 #[test]
 fn test_segtree_vs_cumulative_sum() {
     use rand::{Rng, SeedableRng, StdRng};
-    use util::random_range;
+    use crate::util::random_range;
 
     let size = 1000;
     let mut cum_sum = vec![0; size + 1];
@@ -143,7 +143,7 @@ impl Monoid for APPEND {
 #[test]
 fn test_segtree_non_commutative() {
     use rand::{Rng, SeedableRng, StdRng};
-    use util;
+    use crate::util;
     let mut rng = StdRng::from_seed(&[1, 2, 3, 4, 5]);
 
     let size = 100;
@@ -197,7 +197,7 @@ fn bench_segtree_update(b: &mut Bencher) {
 #[bench]
 fn bench_segtree_query(b: &mut Bencher) {
     use rand::{Rng, SeedableRng, StdRng};
-    use util;
+    use crate::util;
 
     let size = 10000;
     let mut seg: SEG<SUM> = SEG::new(size);

src/template.rs

@@ -1,6 +1,4 @@
-#![snippet("template")]
-
-use cargo_snippet::snippet;
+#![cargo_snippet::snippet("template")]
 
 /// https://github.com/hatoo/competitive-rust-snippets