Merge pull request sekineh#19 from sekineh/rust-2018

Migrate to Rust 2018 Edition, etc.

Author: sekineh

CHANGELOG.md

@@ -12,6 +12,7 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
 
 ### Changed
 
+* Migrate to Rust 2018 Edition.
 * Bump MSRV (minimum supported rust version) to rust 1.31.1.
 * [CI] Switched to Github actions.
 * [CI] travis is removed because it was unreliable.

Cargo.toml

@@ -8,6 +8,7 @@ repository = "https://github.com/sekineh/binary-heap-plus-rs"
 readme = "README.md"
 keywords = ["binary", "heap", "priority", "queue"]
 categories = ["data-structures", "algorithms", ]
+edition = "2018"
 
 [dependencies]
 compare = "0.1.0"

README.md

@@ -1,7 +1,6 @@
 # binary-heap-plus-rs
 
 ![Rust](https://github.com/sekineh/binary-heap-plus-rs/workflows/Rust/badge.svg)
-[![Build status](https://ci.appveyor.com/api/projects/status/oewb6667ul5pl05d?svg=true)](https://ci.appveyor.com/project/sekineh/binary-heap-plus-rs)
 
 Enhancement over Rust's `std::collections::BinaryHeap`.
 

src/lib.rs

@@ -7,11 +7,10 @@
 //! # Quick start
 //!
 //! ## Max/Min Heap
-//! 
+//!
 //! For max heap, `BiaryHeap::from_vec()` is the most versatile way to create a heap.
 //!
 //! ```rust
-//!     extern crate binary_heap_plus; // not needed on Rust 2018
 //!     use binary_heap_plus::*;
 //!
 //!     // max heap
@@ -22,11 +21,10 @@
 //!     let mut h: BinaryHeap<i32> = BinaryHeap::from_vec((0..42).collect());
 //!     assert_eq!(h.pop(), Some(41));
 //! ```
-//! 
+//!
 //! Min heap is similar, but requires type annotation.
-//! 
+//!
 //! ```rust
-//!     extern crate binary_heap_plus; // not needed on Rust 2018
 //!     use binary_heap_plus::*;
 //!
 //!     // min heap
@@ -39,11 +37,10 @@
 //! ```
 //!
 //! ## Custom Heap
-//! 
+//!
 //! For custom heap, `BinaryHeap::from_vec_cmp()` works in a similar way to max/min heap. The only difference is that you add the comparator closure with apropriate signature.
-//! 
+//!
 //! ```rust
-//!     extern crate binary_heap_plus; // not needed on Rust 2018
 //!     use binary_heap_plus::*;
 //!
 //!     // custom heap: ordered by second value (_.1) of the tuples; min first
@@ -98,12 +95,6 @@
 
 mod binary_heap;
 pub use crate::binary_heap::*;
-extern crate compare;
-extern crate core;
-#[cfg(feature = "serde")]
-extern crate serde;
-#[cfg(all(feature = "serde", test))]
-extern crate serde_json;
 
 /// An intermediate trait for specialization of `Extend`.
 // #[doc(hidden)]
@@ -413,7 +404,6 @@ mod from_liballoc {
             d
         }
     }
-
 }
 
 #[cfg(feature = "serde")]