1 // Copyright 2015 The Rust Project Developers. See the COPYRIGHT
2 // file at the top-level directory of this distribution and at
3 // http://rust-lang.org/COPYRIGHT.
5 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
6 // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
7 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
8 // option. This file may not be copied, modified, or distributed
9 // except according to those terms.
12 #![feature(drain, collections_bound, btree_range, vecmap)]
14 use std::collections::BinaryHeap;
15 use std::collections::{BTreeMap, BTreeSet};
16 use std::collections::LinkedList;
17 use std::collections::VecDeque;
18 use std::collections::HashMap;
19 use std::collections::HashSet;
21 use std::collections::Bound::Included;
24 fn is_sync<T>(_: T) where T: Sync {}
25 fn is_send<T>(_: T) where T: Send {}
27 macro_rules! all_sync_send {
28 ($ctor:expr, $($iter:ident),+) => ({
38 macro_rules! is_sync_send {
39 ($ctor:expr, $iter:ident($($param:expr),+)) => ({
41 is_sync(x.$iter($( $param ),+));
43 is_send(y.$iter($( $param ),+));
48 // The iterator "generator" list should exhaust what corresponding
49 // implementations have where `Sync` and `Send` semantics apply.
50 all_sync_send!(BinaryHeap::<usize>::new(), iter, drain, into_iter);
52 all_sync_send!(BTreeMap::<usize, usize>::new(), iter, iter_mut, into_iter, keys, values);
53 is_sync_send!(BTreeMap::<usize, usize>::new(), range((Included(&0), Included(&9))));
54 is_sync_send!(BTreeMap::<usize, usize>::new(), range_mut((Included(&0), Included(&9))));
56 all_sync_send!(BTreeSet::<usize>::new(), iter, into_iter);
57 is_sync_send!(BTreeSet::<usize>::new(), range((Included(&0), Included(&9))));
58 is_sync_send!(BTreeSet::<usize>::new(), difference(&BTreeSet::<usize>::new()));
59 is_sync_send!(BTreeSet::<usize>::new(), symmetric_difference(&BTreeSet::<usize>::new()));
60 is_sync_send!(BTreeSet::<usize>::new(), intersection(&BTreeSet::<usize>::new()));
61 is_sync_send!(BTreeSet::<usize>::new(), union(&BTreeSet::<usize>::new()));
63 all_sync_send!(HashMap::<usize, usize>::new(), iter, iter_mut, drain, into_iter, keys, values);
64 all_sync_send!(HashSet::<usize>::new(), iter, drain, into_iter);
65 is_sync_send!(HashSet::<usize>::new(), difference(&HashSet::<usize>::new()));
66 is_sync_send!(HashSet::<usize>::new(), symmetric_difference(&HashSet::<usize>::new()));
67 is_sync_send!(HashSet::<usize>::new(), intersection(&HashSet::<usize>::new()));
68 is_sync_send!(HashSet::<usize>::new(), union(&HashSet::<usize>::new()));
70 all_sync_send!(LinkedList::<usize>::new(), iter, iter_mut, into_iter);
72 all_sync_send!(VecDeque::<usize>::new(), iter, iter_mut, into_iter);
73 is_sync_send!(VecDeque::<usize>::new(), drain(..));
75 all_sync_send!(Vec::<usize>::new(), into_iter);
76 is_sync_send!(Vec::<usize>::new(), drain(..));
77 is_sync_send!(String::new(), drain(..));