rust/tests/compile-fail/entry.rs

61 lines
2.1 KiB
Rust
Raw Normal View History

2015-12-22 00:35:56 +01:00
#![feature(plugin)]
#![plugin(clippy)]
#![allow(unused, if_not_else)]
2015-12-22 00:35:56 +01:00
#![deny(map_entry)]
2015-12-22 00:35:56 +01:00
use std::collections::{BTreeMap, HashMap};
2015-12-22 00:35:56 +01:00
use std::hash::Hash;
fn foo() {}
fn insert_if_absent0<K: Eq + Hash, V>(m: &mut HashMap<K, V>, k: K, v: V) {
if !m.contains_key(&k) { m.insert(k, v); }
2016-01-13 17:17:19 +01:00
//~^ ERROR usage of `contains_key` followed by `insert` on `HashMap`
//~| HELP Consider
//~| SUGGESTION m.entry(k).or_insert(v)
}
fn insert_if_absent1<K: Eq + Hash, V>(m: &mut HashMap<K, V>, k: K, v: V) {
if !m.contains_key(&k) { foo(); m.insert(k, v); }
2016-01-13 17:17:19 +01:00
//~^ ERROR usage of `contains_key` followed by `insert` on `HashMap`
//~| NOTE Consider using `m.entry(k)`
2015-12-22 00:35:56 +01:00
}
fn insert_if_absent2<K: Eq + Hash, V>(m: &mut HashMap<K, V>, k: K, v: V) {
if !m.contains_key(&k) { m.insert(k, v) } else { None };
2016-01-13 17:17:19 +01:00
//~^ ERROR usage of `contains_key` followed by `insert` on `HashMap`
//~| NOTE Consider using `m.entry(k)`
}
fn insert_if_present2<K: Eq + Hash, V>(m: &mut HashMap<K, V>, k: K, v: V) {
if m.contains_key(&k) { None } else { m.insert(k, v) };
//~^ ERROR usage of `contains_key` followed by `insert` on `HashMap`
//~| NOTE Consider using `m.entry(k)`
}
fn insert_if_absent3<K: Eq + Hash, V>(m: &mut HashMap<K, V>, k: K, v: V) {
if !m.contains_key(&k) { foo(); m.insert(k, v) } else { None };
2016-01-13 17:17:19 +01:00
//~^ ERROR usage of `contains_key` followed by `insert` on `HashMap`
//~| NOTE Consider using `m.entry(k)`
}
fn insert_if_present3<K: Eq + Hash, V>(m: &mut HashMap<K, V>, k: K, v: V) {
if m.contains_key(&k) { None } else { foo(); m.insert(k, v) };
//~^ ERROR usage of `contains_key` followed by `insert` on `HashMap`
//~| NOTE Consider using `m.entry(k)`
2015-12-22 00:35:56 +01:00
}
fn insert_in_btreemap<K: Ord, V>(m: &mut BTreeMap<K, V>, k: K, v: V) {
if !m.contains_key(&k) { foo(); m.insert(k, v) } else { None };
2016-01-13 17:17:19 +01:00
//~^ ERROR usage of `contains_key` followed by `insert` on `BTreeMap`
//~| NOTE Consider using `m.entry(k)`
}
2015-12-22 00:35:56 +01:00
fn insert_other_if_absent<K: Eq + Hash, V>(m: &mut HashMap<K, V>, k: K, o: K, v: V) {
2016-01-03 16:31:28 +01:00
if !m.contains_key(&k) { m.insert(o, v); }
2015-12-22 00:35:56 +01:00
}
fn main() {
}