()
| 44 | |
| 45 | #[test] |
| 46 | fn set() { |
| 47 | //only 1 |
| 48 | let t = vec![10]; |
| 49 | let mut heap = max_heap::BinaryHeap::new(t); |
| 50 | // data layout: |
| 51 | // vec![10]; |
| 52 | heap.set(0, 100); |
| 53 | let data = heap.keys_slice(); |
| 54 | assert_eq!(data, vec![100]); |
| 55 | |
| 56 | //set fail |
| 57 | let t = vec![10]; |
| 58 | let mut heap = max_heap::BinaryHeap::new(t); |
| 59 | // data layout: |
| 60 | // vec![10]; |
| 61 | heap.set(0, 9); |
| 62 | let data = heap.keys_slice(); |
| 63 | assert_eq!(data, vec![10]); |
| 64 | |
| 65 | //normal |
| 66 | let t = vec![4, 1, 3, 2, 16, 9, 10, 14, 8, 7]; |
| 67 | let mut heap = max_heap::BinaryHeap::new(t); |
| 68 | // data layout: |
| 69 | // vec![16, 14, 10, 8, 7, 9, 3, 2, 4, 1]; |
| 70 | heap.set(3, 100); |
| 71 | let data = heap.keys_slice(); |
| 72 | assert_eq!(data, vec![100, 16, 10, 14, 7, 9, 3, 2, 4, 1]) |
| 73 | } |
| 74 | |
| 75 | #[test] |
| 76 | fn insert() { |
nothing calls this directly
no test coverage detected