Q:

Rust program to find the intersection of two HashSets

belongs to collection: Rust HashSet Programs

YasminRadwan26
Save to bookmark
|
2022-07-18
|
  281 
0

In this program, we will create two HashSets to store integer items, and then we will find the intersection of both sets and print the result.

RUST programming, examples, RUST programming examples,
login and add your own answer to this question

All Answers

YasminRadwan26
2022-07-18
need an explanation for this answer? contact us directly to get an explanation for this answer

Program/Source Code:

The source code to find the intersection of two HashSets is given below. The given program is compiled and executed successfully.

// Rust program to find the 
// intersection of two HashSets

use std::collections::HashSet;
fn main() {
    let set1: HashSet<_> = [10, 15, 30, 20,12].iter().cloned().collect();
    let set2: HashSet<_> = [10, 15, 20,40].iter().cloned().collect();

    println!("Intersection of set1 and set2:");
    for item in set1.intersection(&set2) {
        print!("{} ", item); 
    }
}

Output:

Intersection of set1 and set2:
20 10 15

Explanation:

Here we created two HashSets to store integer elements. Then we found the intersection of both sets using the intersection() method. After that, we printed the result.

need an explanation for this answer? contact us directly to get an explanation for this answer

total answers (1)

Rust HashSet Programs
This question belongs to these collections

Similar questions

need a help?

find thousands of online teachers now
Rust program to find the Union of two HashSets... >>
<< Rust program to find the Symmetric difference betw...