()
| 40 | |
| 41 | #[test] |
| 42 | fn insert_sort_dth() { |
| 43 | let mut data = common::util::vec_alphabet(1); |
| 44 | common::util::shuffle(&mut data); |
| 45 | let len = data.len(); |
| 46 | sort::insert::sort_dth(&mut data, 0, len - 1, 0); |
| 47 | assert!(data.is_sorted()); |
| 48 | |
| 49 | // 0-th char equal |
| 50 | let mut data = vec!["af", "ae", "ad", "ac", "ab", "aa"]; |
| 51 | let len = data.len(); |
| 52 | sort::insert::sort_dth(&mut data, 0, len - 1, 0); |
| 53 | assert!(data.is_sorted()); |
| 54 | |
| 55 | // length |
| 56 | let mut data = vec!["aaaaaa", "aaaaa", "aaaa", "aaa", "aa", "a"]; |
| 57 | let len = data.len(); |
| 58 | sort::insert::sort_dth(&mut data, 0, len - 1, 0); |
| 59 | assert!(data.is_sorted()); |
| 60 | } |
| 61 | |
| 62 | #[test] |
| 63 | fn tournament_tree() { |
nothing calls this directly
no test coverage detected