| // Copyright 2015 The Rust Project Developers. See the COPYRIGHT |
| // file at the top-level directory of this distribution and at |
| // http://rust-lang.org/COPYRIGHT. |
| // |
| // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or |
| // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license |
| // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your |
| // option. This file may not be copied, modified, or distributed |
| // except according to those terms. |
| |
| // pretty-expanded FIXME #23616 |
| |
| #![allow(warnings)] |
| #![feature(collections)] |
| #![feature(drain, enumset, collections_bound, btree_range, vecmap)] |
| |
| extern crate collections; |
| |
| use collections::BinaryHeap; |
| use collections::{BTreeMap, BTreeSet}; |
| use collections::EnumSet; |
| use collections::LinkedList; |
| use collections::String; |
| use collections::Vec; |
| use collections::VecDeque; |
| use std::collections::HashMap; |
| use std::collections::HashSet; |
| |
| use collections::Bound::Included; |
| use collections::enum_set::CLike; |
| use std::mem; |
| |
| fn is_sync<T>(_: T) where T: Sync {} |
| fn is_send<T>(_: T) where T: Send {} |
| |
| macro_rules! all_sync_send { |
| ($ctor:expr, $($iter:ident),+) => ({ |
| $( |
| let mut x = $ctor; |
| is_sync(x.$iter()); |
| let mut y = $ctor; |
| is_send(y.$iter()); |
| )+ |
| }) |
| } |
| |
| macro_rules! is_sync_send { |
| ($ctor:expr, $iter:ident($($param:expr),+)) => ({ |
| let mut x = $ctor; |
| is_sync(x.$iter($( $param ),+)); |
| let mut y = $ctor; |
| is_send(y.$iter($( $param ),+)); |
| }) |
| } |
| |
| fn main() { |
| // The iterator "generator" list should exhaust what corresponding |
| // implementations have where `Sync` and `Send` semantics apply. |
| all_sync_send!(BinaryHeap::<usize>::new(), iter, drain, into_iter); |
| |
| all_sync_send!(BTreeMap::<usize, usize>::new(), iter, iter_mut, into_iter, keys, values); |
| is_sync_send!(BTreeMap::<usize, usize>::new(), range(Included(&0), Included(&9))); |
| is_sync_send!(BTreeMap::<usize, usize>::new(), range_mut(Included(&0), Included(&9))); |
| |
| all_sync_send!(BTreeSet::<usize>::new(), iter, into_iter); |
| is_sync_send!(BTreeSet::<usize>::new(), range(Included(&0), Included(&9))); |
| is_sync_send!(BTreeSet::<usize>::new(), difference(&BTreeSet::<usize>::new())); |
| is_sync_send!(BTreeSet::<usize>::new(), symmetric_difference(&BTreeSet::<usize>::new())); |
| is_sync_send!(BTreeSet::<usize>::new(), intersection(&BTreeSet::<usize>::new())); |
| is_sync_send!(BTreeSet::<usize>::new(), union(&BTreeSet::<usize>::new())); |
| |
| all_sync_send!(HashMap::<usize, usize>::new(), iter, iter_mut, drain, into_iter, keys, values); |
| all_sync_send!(HashSet::<usize>::new(), iter, drain, into_iter); |
| is_sync_send!(HashSet::<usize>::new(), difference(&HashSet::<usize>::new())); |
| is_sync_send!(HashSet::<usize>::new(), symmetric_difference(&HashSet::<usize>::new())); |
| is_sync_send!(HashSet::<usize>::new(), intersection(&HashSet::<usize>::new())); |
| is_sync_send!(HashSet::<usize>::new(), union(&HashSet::<usize>::new())); |
| |
| all_sync_send!(LinkedList::<usize>::new(), iter, iter_mut, into_iter); |
| |
| #[derive(Copy, Clone)] |
| #[repr(usize)] |
| #[allow(dead_code)] |
| enum Foo { A, B, C } |
| impl CLike for Foo { |
| fn to_usize(&self) -> usize { |
| *self as usize |
| } |
| |
| fn from_usize(v: usize) -> Foo { |
| unsafe { mem::transmute(v) } |
| } |
| } |
| all_sync_send!(EnumSet::<Foo>::new(), iter); |
| |
| all_sync_send!(VecDeque::<usize>::new(), iter, iter_mut, into_iter); |
| is_sync_send!(VecDeque::<usize>::new(), drain(..)); |
| |
| all_sync_send!(Vec::<usize>::new(), into_iter); |
| is_sync_send!(Vec::<usize>::new(), drain(..)); |
| is_sync_send!(String::new(), drain(..)); |
| } |