()
| 945 | } |
| 946 | |
| 947 | fn iter() { |
| 948 | let nums = [0,1,2,3,4,5,6,7,8,9]; |
| 949 | |
| 950 | let mut rbt = RBTree::<usize, u32>::new(); |
| 951 | for (k, &v) in nums.iter().enumerate() { |
| 952 | rbt.insert(k, v); |
| 953 | } |
| 954 | |
| 955 | let s: Vec<u32> = rbt.iter().map(|x| x.val).collect(); |
| 956 | assert_eq!(s, nums); |
| 957 | |
| 958 | for node in rbt.iter_mut() { node.val += 1; } |
| 959 | let s: Vec<u32> = rbt.iter().map(|x| x.val).collect(); |
| 960 | assert_eq!(s, vec![1,2,3,4,5,6,7,8,9,10]); |
| 961 | } |
| 962 | |
| 963 | fn insert() { |
| 964 | let mut rbt = RBTree::<usize, char>::new(); |