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(collections)]
14 extern crate collections;
16 use collections::BinaryHeap;
17 use collections::{BitSet, BitVec};
18 use collections::{BTreeMap, BTreeSet};
19 use collections::EnumSet;
20 use collections::LinkedList;
22 use collections::VecDeque;
23 use collections::VecMap;
25 use collections::Bound::Included;
26 use collections::enum_set::CLike;
29 fn is_sync<T>(_: T) where T: Sync {}
30 fn is_send<T>(_: T) where T: Send {}
32 macro_rules! all_sync_send {
33 ($ctor:expr, $($iter:ident),+) => ({
43 macro_rules! is_sync_send {
44 ($ctor:expr, $iter:ident($($param:expr),+)) => ({
46 is_sync(x.$iter($( $param ),+));
48 is_send(y.$iter($( $param ),+));
53 // The iterator "generator" list should exhaust what corresponding
54 // implementations have where `Sync` and `Send` semantics apply.
55 all_sync_send!(BinaryHeap::<usize>::new(), iter, drain, into_iter);
57 all_sync_send!(BitVec::new(), iter);
59 all_sync_send!(BitSet::new(), iter);
60 is_sync_send!(BitSet::new(), union(&BitSet::new()));
61 is_sync_send!(BitSet::new(), intersection(&BitSet::new()));
62 is_sync_send!(BitSet::new(), difference(&BitSet::new()));
63 is_sync_send!(BitSet::new(), symmetric_difference(&BitSet::new()));
65 all_sync_send!(BTreeMap::<usize, usize>::new(), iter, iter_mut, into_iter, keys, values);
66 is_sync_send!(BTreeMap::<usize, usize>::new(), range(Included(&0), Included(&9)));
67 is_sync_send!(BTreeMap::<usize, usize>::new(), range_mut(Included(&0), Included(&9)));
69 all_sync_send!(BTreeSet::<usize>::new(), iter, into_iter);
70 is_sync_send!(BTreeSet::<usize>::new(), range(Included(&0), Included(&9)));
71 is_sync_send!(BTreeSet::<usize>::new(), difference(&BTreeSet::<usize>::new()));
72 is_sync_send!(BTreeSet::<usize>::new(), symmetric_difference(&BTreeSet::<usize>::new()));
73 is_sync_send!(BTreeSet::<usize>::new(), intersection(&BTreeSet::<usize>::new()));
74 is_sync_send!(BTreeSet::<usize>::new(), union(&BTreeSet::<usize>::new()));
76 all_sync_send!(LinkedList::<usize>::new(), iter, iter_mut, into_iter);
83 fn to_usize(&self) -> usize {
87 fn from_usize(v: usize) -> Foo {
88 unsafe { mem::transmute(v) }
91 all_sync_send!(EnumSet::<Foo>::new(), iter);
93 all_sync_send!(VecDeque::<usize>::new(), iter, iter_mut, drain, into_iter);
95 all_sync_send!(VecMap::<usize>::new(), iter, iter_mut, drain, into_iter, keys, values);
97 all_sync_send!(Vec::<usize>::new(), into_iter, drain);