()
| 3833 | |
| 3834 | #[test] |
| 3835 | fn intersection_debug() { |
| 3836 | println!("Starting intersection debug test..."); |
| 3837 | |
| 3838 | let set1 = ["banana", "apple", "cherry"]; |
| 3839 | let set2 = ["cherry", "orange", "pineapple", "banana"]; |
| 3840 | let mut positions1 = [0; 3]; |
| 3841 | let mut positions2 = [0; 3]; |
| 3842 | |
| 3843 | println!("About to call intersection function..."); |
| 3844 | let n = intersection(&set1, &set2, 0, &mut positions1, &mut positions2).expect("intersect failed"); |
| 3845 | |
| 3846 | println!("Intersection found {} common elements", n); |
| 3847 | assert!(n == 2); |
| 3848 | println!("Test passed!"); |
| 3849 | } |
| 3850 | |
| 3851 | #[test] |
| 3852 | fn sha256_empty() { |
nothing calls this directly
no test coverage detected
searching dependent graphs…