You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: src/lib.rs
+5-6Lines changed: 5 additions & 6 deletions
Original file line number
Diff line number
Diff line change
@@ -7,7 +7,7 @@
7
7
//! # Quick start
8
8
//!
9
9
//! ## Max/Min Heap
10
-
//!
10
+
//!
11
11
//! For max heap, `BiaryHeap::from_vec()` is the most versatile way to create a heap.
12
12
//!
13
13
//! ```rust
@@ -21,9 +21,9 @@
21
21
//! let mut h: BinaryHeap<i32> = BinaryHeap::from_vec((0..42).collect());
22
22
//! assert_eq!(h.pop(), Some(41));
23
23
//! ```
24
-
//!
24
+
//!
25
25
//! Min heap is similar, but requires type annotation.
26
-
//!
26
+
//!
27
27
//! ```rust
28
28
//! use binary_heap_plus::*;
29
29
//!
@@ -37,9 +37,9 @@
37
37
//! ```
38
38
//!
39
39
//! ## Custom Heap
40
-
//!
40
+
//!
41
41
//! 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.
0 commit comments