1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
|
extern crate maplit;
extern crate sorted_iter;
use maplit::*;
use sorted_iter::SortedIterator;
fn v<E>(x: impl Iterator<Item = E>) -> Vec<E> {
x.take(10).collect()
}
fn main() {
let primes = btreeset! { 2u64, 3, 5, 7, 11, 13 };
let fibs = btreeset! { 1u64, 2, 3, 5, 8, 13 };
let primes = primes.iter();
let fibs = fibs.iter();
let nats = 1u64..;
// both primes and fibs
let both = primes.clone().intersection(fibs.clone());
// either primes or fibs
let either = primes.union(fibs).cloned();
// natural numbers that are neither
let neither = nats.difference(either);
println!("Fibonacci primes: {:?}", v(both));
println!("Neither: {:?}", v(neither));
}
|
