Rust
HashSet
Build a set of unique elements with HashSet.
HashSet
HashSet<T> is a set keeping only one of each value. It's used to remove duplicates and answer "is this present?" quickly:
use std::collections::HashSet;
let mut gorulen = HashSet::new();
println!("{}", gorulen.insert("ali")); // true: new
println!("{}", gorulen.insert("ali")); // false: already there
println!("{}", gorulen.contains("ece")); // false
Since insert returns a bool, the "have I seen this before?" check fits in one line.
Set operations
Set operations return iterators of references; the result must be collected or counted. A HashSet is unordered too, so sort before printing:
let a: HashSet<i32> = [1, 2, 3, 4].into_iter().collect();
let b: HashSet<i32> = [3, 4, 5].into_iter().collect();
let mut ortak: Vec<i32> = a.intersection(&b).copied().collect();
ortak.sort();
println!("{:?} {}", ortak, a.union(&b).count()); // [3, 4] 5
If you need a sorted set, use BTreeSet.
Exercise Common elements
Create two HashSets from the arrays [1, 2, 3, 4] and [3, 4, 5]. Collect the intersection into a sorted vector; print the vector and the number of elements in the union separated by a space.
Show example solution
use std::collections::HashSet;
fn main() {
let a: HashSet<i32> = [1, 2, 3, 4].into_iter().collect();
let b: HashSet<i32> = [3, 4, 5].into_iter().collect();
let mut ortak: Vec<i32> = a.intersection(&b).copied().collect();
ortak.sort();
println!("{:?} {}", ortak, a.union(&b).count());
}
Test yourself
-
What does <code>a.intersection(&b)</code> give?
- Only those in a
- All elements
- Those in neither
- Elements present in both sets
Show answer
Elements present in both sets — union is the union, difference the difference, symmetric_difference those in only one.
-
Intersection
let ortak: Vec<i32> = a.____(&b).copied().collect();
Show answer
let ortak: Vec<i32> = a.intersection(&b).copied().collect();
-
Operation and result (a = {1,2,3,4}, b = {3,4,5})
- intersection
- {3, 4}
- union
- {1, 2, 3, 4, 5}
- a.difference(&b)
- {1, 2}
- symmetric_difference
- {1, 2, 5}
Next lesson: Entry API
