2019-01-13 12:55:26 +00:00
|
|
|
// run-rustfix
|
|
|
|
#![allow(unused_imports)]
|
2019-12-08 03:10:06 +00:00
|
|
|
#![warn(
|
|
|
|
clippy::all,
|
|
|
|
clippy::style,
|
|
|
|
clippy::mem_replace_option_with_none,
|
|
|
|
clippy::mem_replace_with_default
|
|
|
|
)]
|
2018-09-16 23:25:33 +00:00
|
|
|
|
2021-03-25 18:29:11 +00:00
|
|
|
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, LinkedList, VecDeque};
|
2018-09-16 23:25:33 +00:00
|
|
|
use std::mem;
|
|
|
|
|
2019-12-08 03:10:06 +00:00
|
|
|
fn replace_option_with_none() {
|
2018-09-16 23:25:33 +00:00
|
|
|
let mut an_option = Some(1);
|
|
|
|
let _ = mem::replace(&mut an_option, None);
|
2018-09-18 23:54:01 +00:00
|
|
|
let an_option = &mut Some(1);
|
|
|
|
let _ = mem::replace(an_option, None);
|
2018-09-16 23:25:33 +00:00
|
|
|
}
|
2019-12-08 03:10:06 +00:00
|
|
|
|
|
|
|
fn replace_with_default() {
|
|
|
|
let mut s = String::from("foo");
|
|
|
|
let _ = std::mem::replace(&mut s, String::default());
|
2021-03-25 18:29:11 +00:00
|
|
|
|
2019-12-08 03:10:06 +00:00
|
|
|
let s = &mut String::from("foo");
|
|
|
|
let _ = std::mem::replace(s, String::default());
|
2019-12-08 17:26:37 +00:00
|
|
|
let _ = std::mem::replace(s, Default::default());
|
2021-03-25 18:29:11 +00:00
|
|
|
|
|
|
|
let mut v = vec![123];
|
|
|
|
let _ = std::mem::replace(&mut v, Vec::default());
|
|
|
|
let _ = std::mem::replace(&mut v, Default::default());
|
|
|
|
let _ = std::mem::replace(&mut v, Vec::new());
|
|
|
|
let _ = std::mem::replace(&mut v, vec![]);
|
|
|
|
|
|
|
|
let mut hash_map: HashMap<i32, i32> = HashMap::new();
|
|
|
|
let _ = std::mem::replace(&mut hash_map, HashMap::new());
|
|
|
|
|
|
|
|
let mut btree_map: BTreeMap<i32, i32> = BTreeMap::new();
|
|
|
|
let _ = std::mem::replace(&mut btree_map, BTreeMap::new());
|
|
|
|
|
|
|
|
let mut vd: VecDeque<i32> = VecDeque::new();
|
|
|
|
let _ = std::mem::replace(&mut vd, VecDeque::new());
|
|
|
|
|
|
|
|
let mut hash_set: HashSet<&str> = HashSet::new();
|
|
|
|
let _ = std::mem::replace(&mut hash_set, HashSet::new());
|
|
|
|
|
|
|
|
let mut btree_set: BTreeSet<&str> = BTreeSet::new();
|
|
|
|
let _ = std::mem::replace(&mut btree_set, BTreeSet::new());
|
|
|
|
|
|
|
|
let mut list: LinkedList<i32> = LinkedList::new();
|
|
|
|
let _ = std::mem::replace(&mut list, LinkedList::new());
|
|
|
|
|
|
|
|
let mut binary_heap: BinaryHeap<i32> = BinaryHeap::new();
|
|
|
|
let _ = std::mem::replace(&mut binary_heap, BinaryHeap::new());
|
2021-09-08 14:31:47 +00:00
|
|
|
|
|
|
|
let mut tuple = (vec![1, 2], BinaryHeap::<i32>::new());
|
|
|
|
let _ = std::mem::replace(&mut tuple, (vec![], BinaryHeap::new()));
|
|
|
|
|
|
|
|
let mut refstr = "hello";
|
|
|
|
let _ = std::mem::replace(&mut refstr, "");
|
|
|
|
|
|
|
|
let mut slice: &[i32] = &[1, 2, 3];
|
|
|
|
let _ = std::mem::replace(&mut slice, &[]);
|
|
|
|
}
|
|
|
|
|
|
|
|
// lint is disabled for primitives because in this case `take`
|
|
|
|
// has no clear benefit over `replace` and sometimes is harder to read
|
|
|
|
fn dont_lint_primitive() {
|
|
|
|
let mut pbool = true;
|
|
|
|
let _ = std::mem::replace(&mut pbool, false);
|
|
|
|
|
|
|
|
let mut pint = 5;
|
|
|
|
let _ = std::mem::replace(&mut pint, 0);
|
2019-12-08 03:10:06 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
fn main() {
|
|
|
|
replace_option_with_none();
|
|
|
|
replace_with_default();
|
2021-09-08 14:31:47 +00:00
|
|
|
dont_lint_primitive();
|
2019-12-08 03:10:06 +00:00
|
|
|
}
|