mirror of
https://github.com/ahgamut/rust-ape-example.git
synced 2024-05-15 18:12:43 +00:00
44 lines
1.2 KiB
Rust
44 lines
1.2 KiB
Rust
// ./src/std/hash/hashset.md
|
|
|
|
|
|
use std::collections::HashSet;
|
|
|
|
fn part0() {
|
|
let mut a: HashSet<i32> = vec![1i32, 2, 3].into_iter().collect();
|
|
let mut b: HashSet<i32> = vec![2i32, 3, 4].into_iter().collect();
|
|
|
|
assert!(a.insert(4));
|
|
assert!(a.contains(&4));
|
|
|
|
// `HashSet::insert()` returns false if
|
|
// there was a value already present.
|
|
// assert!(b.insert(4), "Value 4 is already in set B!");
|
|
// FIXME ^ Comment out this line
|
|
|
|
b.insert(5);
|
|
|
|
// If a collection's element type implements `Debug`,
|
|
// then the collection implements `Debug`.
|
|
// It usually prints its elements in the format `[elem1, elem2, ...]`
|
|
println!("A: {:?}", a);
|
|
println!("B: {:?}", b);
|
|
|
|
// Print [1, 2, 3, 4, 5] in arbitrary order
|
|
println!("Union: {:?}", a.union(&b).collect::<Vec<&i32>>());
|
|
|
|
// This should print [1]
|
|
println!("Difference: {:?}", a.difference(&b).collect::<Vec<&i32>>());
|
|
|
|
// Print [2, 3, 4] in arbitrary order.
|
|
println!("Intersection: {:?}", a.intersection(&b).collect::<Vec<&i32>>());
|
|
|
|
// Print [1, 5]
|
|
println!("Symmetric Difference: {:?}",
|
|
a.symmetric_difference(&b).collect::<Vec<&i32>>());
|
|
}
|
|
|
|
pub fn main() {
|
|
part0();
|
|
}
|
|
|