2016-02-01 11:47:31 +00:00
|
|
|
//! lint on enum variants that are prefixed or suffixed by the same characters
|
|
|
|
|
|
|
|
use rustc::lint::*;
|
|
|
|
use syntax::ast::*;
|
2016-06-08 15:43:27 +00:00
|
|
|
use syntax::codemap::Span;
|
2016-11-23 20:19:03 +00:00
|
|
|
use syntax::symbol::InternedString;
|
2016-06-08 13:32:30 +00:00
|
|
|
use utils::{span_help_and_lint, span_lint};
|
2016-06-08 15:43:27 +00:00
|
|
|
use utils::{camel_case_from, camel_case_until, in_macro};
|
2016-02-01 11:47:31 +00:00
|
|
|
|
2016-08-06 07:55:04 +00:00
|
|
|
/// **What it does:** Detects enumeration variants that are prefixed or suffixed
|
|
|
|
/// by the same characters.
|
2016-02-01 11:47:31 +00:00
|
|
|
///
|
2016-08-06 07:55:04 +00:00
|
|
|
/// **Why is this bad?** Enumeration variant names should specify their variant,
|
|
|
|
/// not repeat the enumeration name.
|
2016-02-01 11:47:31 +00:00
|
|
|
///
|
2016-08-06 07:55:04 +00:00
|
|
|
/// **Known problems:** None.
|
2016-02-01 11:47:31 +00:00
|
|
|
///
|
2016-07-15 22:25:44 +00:00
|
|
|
/// **Example:**
|
|
|
|
/// ```rust
|
|
|
|
/// enum Cake {
|
|
|
|
/// BlackForestCake,
|
|
|
|
/// HummingbirdCake,
|
|
|
|
/// }
|
|
|
|
/// ```
|
2016-02-05 23:13:29 +00:00
|
|
|
declare_lint! {
|
2016-08-06 08:18:36 +00:00
|
|
|
pub ENUM_VARIANT_NAMES,
|
|
|
|
Warn,
|
|
|
|
"enums where all variants share a prefix/postfix"
|
2016-02-05 23:13:29 +00:00
|
|
|
}
|
2016-02-01 11:47:31 +00:00
|
|
|
|
2016-12-21 12:30:57 +00:00
|
|
|
/// **What it does:** Detects enumeration variants that are prefixed or suffixed
|
|
|
|
/// by the same characters.
|
|
|
|
///
|
|
|
|
/// **Why is this bad?** Enumeration variant names should specify their variant,
|
|
|
|
/// not repeat the enumeration name.
|
|
|
|
///
|
|
|
|
/// **Known problems:** None.
|
|
|
|
///
|
|
|
|
/// **Example:**
|
|
|
|
/// ```rust
|
|
|
|
/// enum Cake {
|
|
|
|
/// BlackForestCake,
|
|
|
|
/// HummingbirdCake,
|
|
|
|
/// }
|
|
|
|
/// ```
|
|
|
|
declare_lint! {
|
|
|
|
pub PUB_ENUM_VARIANT_NAMES,
|
|
|
|
Allow,
|
|
|
|
"enums where all variants share a prefix/postfix"
|
|
|
|
}
|
|
|
|
|
2016-08-06 07:55:04 +00:00
|
|
|
/// **What it does:** Detects type names that are prefixed or suffixed by the
|
|
|
|
/// containing module's name.
|
2016-06-16 16:37:56 +00:00
|
|
|
///
|
2016-08-06 07:55:04 +00:00
|
|
|
/// **Why is this bad?** It requires the user to type the module name twice.
|
2016-06-16 16:37:56 +00:00
|
|
|
///
|
2016-08-06 07:55:04 +00:00
|
|
|
/// **Known problems:** None.
|
2016-06-16 16:37:56 +00:00
|
|
|
///
|
2016-07-15 22:25:44 +00:00
|
|
|
/// **Example:**
|
|
|
|
/// ```rust
|
|
|
|
/// mod cake {
|
|
|
|
/// struct BlackForestCake;
|
|
|
|
/// }
|
|
|
|
/// ```
|
2016-06-16 16:37:56 +00:00
|
|
|
declare_lint! {
|
2016-08-06 08:18:36 +00:00
|
|
|
pub STUTTER,
|
|
|
|
Allow,
|
|
|
|
"type names prefixed/postfixed with their containing module's name"
|
2016-06-16 16:37:56 +00:00
|
|
|
}
|
|
|
|
|
2017-08-09 07:30:56 +00:00
|
|
|
/// **What it does:** Checks for modules that have the same name as their
|
|
|
|
/// parent module
|
2016-09-12 08:30:42 +00:00
|
|
|
///
|
2017-08-09 07:30:56 +00:00
|
|
|
/// **Why is this bad?** A typical beginner mistake is to have `mod foo;` and
|
|
|
|
/// again `mod foo { ..
|
2016-12-21 09:25:14 +00:00
|
|
|
/// }` in `foo.rs`.
|
|
|
|
/// The expectation is that items inside the inner `mod foo { .. }` are then
|
|
|
|
/// available
|
2017-08-09 07:30:56 +00:00
|
|
|
/// through `foo::x`, but they are only available through
|
|
|
|
/// `foo::foo::x`.
|
2016-12-21 09:25:14 +00:00
|
|
|
/// If this is done on purpose, it would be better to choose a more
|
|
|
|
/// representative module name.
|
2016-09-12 08:30:42 +00:00
|
|
|
///
|
|
|
|
/// **Known problems:** None.
|
|
|
|
///
|
|
|
|
/// **Example:**
|
|
|
|
/// ```rust
|
|
|
|
/// // lib.rs
|
|
|
|
/// mod foo;
|
|
|
|
/// // foo.rs
|
|
|
|
/// mod foo {
|
|
|
|
/// ...
|
|
|
|
/// }
|
|
|
|
/// ```
|
|
|
|
declare_lint! {
|
|
|
|
pub MODULE_INCEPTION,
|
|
|
|
Warn,
|
|
|
|
"modules that have the same name as their parent module"
|
|
|
|
}
|
|
|
|
|
2016-06-08 15:43:27 +00:00
|
|
|
pub struct EnumVariantNames {
|
2016-09-12 08:30:42 +00:00
|
|
|
modules: Vec<(InternedString, String)>,
|
2016-08-06 18:59:27 +00:00
|
|
|
threshold: u64,
|
|
|
|
}
|
|
|
|
|
|
|
|
impl EnumVariantNames {
|
2017-08-21 11:32:12 +00:00
|
|
|
pub fn new(threshold: u64) -> Self {
|
|
|
|
Self {
|
2016-12-20 17:21:30 +00:00
|
|
|
modules: Vec::new(),
|
|
|
|
threshold: threshold,
|
|
|
|
}
|
2016-08-06 18:59:27 +00:00
|
|
|
}
|
2016-06-08 15:43:27 +00:00
|
|
|
}
|
2016-02-01 11:47:31 +00:00
|
|
|
|
|
|
|
impl LintPass for EnumVariantNames {
|
|
|
|
fn get_lints(&self) -> LintArray {
|
2016-12-21 12:30:57 +00:00
|
|
|
lint_array!(ENUM_VARIANT_NAMES, PUB_ENUM_VARIANT_NAMES, STUTTER, MODULE_INCEPTION)
|
2016-02-01 11:47:31 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fn var2str(var: &Variant) -> InternedString {
|
|
|
|
var.node.name.name.as_str()
|
|
|
|
}
|
|
|
|
|
2016-06-08 13:32:30 +00:00
|
|
|
/// Returns the number of chars that match from the start
|
2016-02-15 15:59:56 +00:00
|
|
|
fn partial_match(pre: &str, name: &str) -> usize {
|
|
|
|
let mut name_iter = name.chars();
|
|
|
|
let _ = name_iter.next_back(); // make sure the name is never fully matched
|
2017-08-09 07:30:56 +00:00
|
|
|
pre.chars()
|
|
|
|
.zip(name_iter)
|
|
|
|
.take_while(|&(l, r)| l == r)
|
|
|
|
.count()
|
2016-02-15 15:59:56 +00:00
|
|
|
}
|
|
|
|
|
2016-06-08 13:32:30 +00:00
|
|
|
/// Returns the number of chars that match from the end
|
2016-02-15 15:59:56 +00:00
|
|
|
fn partial_rmatch(post: &str, name: &str) -> usize {
|
|
|
|
let mut name_iter = name.chars();
|
|
|
|
let _ = name_iter.next(); // make sure the name is never fully matched
|
2017-08-09 07:30:56 +00:00
|
|
|
post.chars()
|
|
|
|
.rev()
|
|
|
|
.zip(name_iter.rev())
|
|
|
|
.take_while(|&(l, r)| l == r)
|
|
|
|
.count()
|
2016-02-01 11:47:31 +00:00
|
|
|
}
|
|
|
|
|
2016-06-08 15:43:27 +00:00
|
|
|
// FIXME: #600
|
|
|
|
#[allow(while_let_on_iterator)]
|
2016-12-21 11:14:54 +00:00
|
|
|
fn check_variant(
|
|
|
|
cx: &EarlyContext,
|
|
|
|
threshold: u64,
|
|
|
|
def: &EnumDef,
|
|
|
|
item_name: &str,
|
|
|
|
item_name_chars: usize,
|
2016-12-21 12:30:57 +00:00
|
|
|
span: Span,
|
2017-08-09 07:30:56 +00:00
|
|
|
lint: &'static Lint,
|
2016-12-21 11:14:54 +00:00
|
|
|
) {
|
2016-08-06 18:59:27 +00:00
|
|
|
if (def.variants.len() as u64) < threshold {
|
|
|
|
return;
|
|
|
|
}
|
2016-06-08 15:43:27 +00:00
|
|
|
for var in &def.variants {
|
|
|
|
let name = var2str(var);
|
2017-10-10 10:15:55 +00:00
|
|
|
if partial_match(item_name, &name) == item_name_chars &&
|
|
|
|
name.chars().nth(item_name_chars).map_or(false, |c| !c.is_lowercase()) {
|
2016-12-21 12:30:57 +00:00
|
|
|
span_lint(cx, lint, var.span, "Variant name starts with the enum's name");
|
2016-06-08 15:43:27 +00:00
|
|
|
}
|
|
|
|
if partial_rmatch(item_name, &name) == item_name_chars {
|
2016-12-21 12:30:57 +00:00
|
|
|
span_lint(cx, lint, var.span, "Variant name ends with the enum's name");
|
2016-06-08 15:43:27 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
let first = var2str(&def.variants[0]);
|
|
|
|
let mut pre = &first[..camel_case_until(&*first)];
|
|
|
|
let mut post = &first[camel_case_from(&*first)..];
|
|
|
|
for var in &def.variants {
|
|
|
|
let name = var2str(var);
|
|
|
|
|
|
|
|
let pre_match = partial_match(pre, &name);
|
|
|
|
pre = &pre[..pre_match];
|
|
|
|
let pre_camel = camel_case_until(pre);
|
|
|
|
pre = &pre[..pre_camel];
|
|
|
|
while let Some((next, last)) = name[pre.len()..].chars().zip(pre.chars().rev()).next() {
|
|
|
|
if next.is_lowercase() {
|
|
|
|
let last = pre.len() - last.len_utf8();
|
|
|
|
let last_camel = camel_case_until(&pre[..last]);
|
|
|
|
pre = &pre[..last_camel];
|
|
|
|
} else {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
let post_match = partial_rmatch(post, &name);
|
|
|
|
let post_end = post.len() - post_match;
|
|
|
|
post = &post[post_end..];
|
|
|
|
let post_camel = camel_case_from(post);
|
|
|
|
post = &post[post_camel..];
|
|
|
|
}
|
|
|
|
let (what, value) = match (pre.is_empty(), post.is_empty()) {
|
|
|
|
(true, true) => return,
|
|
|
|
(false, _) => ("pre", pre),
|
|
|
|
(true, false) => ("post", post),
|
|
|
|
};
|
2017-08-09 07:30:56 +00:00
|
|
|
span_help_and_lint(
|
|
|
|
cx,
|
|
|
|
lint,
|
|
|
|
span,
|
|
|
|
&format!("All variants have the same {}fix: `{}`", what, value),
|
|
|
|
&format!(
|
|
|
|
"remove the {}fixes and use full paths to \
|
2017-09-05 09:33:04 +00:00
|
|
|
the variants instead of glob imports",
|
2017-08-09 07:30:56 +00:00
|
|
|
what
|
|
|
|
),
|
|
|
|
);
|
2016-06-08 15:43:27 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
fn to_camel_case(item_name: &str) -> String {
|
|
|
|
let mut s = String::new();
|
|
|
|
let mut up = true;
|
|
|
|
for c in item_name.chars() {
|
|
|
|
if c.is_uppercase() {
|
|
|
|
// we only turn snake case text into CamelCase
|
|
|
|
return item_name.to_string();
|
|
|
|
}
|
|
|
|
if c == '_' {
|
|
|
|
up = true;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
if up {
|
|
|
|
up = false;
|
|
|
|
s.extend(c.to_uppercase());
|
|
|
|
} else {
|
|
|
|
s.push(c);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
s
|
|
|
|
}
|
|
|
|
|
2016-02-01 11:47:31 +00:00
|
|
|
impl EarlyLintPass for EnumVariantNames {
|
2016-06-08 15:43:27 +00:00
|
|
|
fn check_item_post(&mut self, _cx: &EarlyContext, _item: &Item) {
|
|
|
|
let last = self.modules.pop();
|
|
|
|
assert!(last.is_some());
|
|
|
|
}
|
|
|
|
|
2016-02-01 11:47:31 +00:00
|
|
|
fn check_item(&mut self, cx: &EarlyContext, item: &Item) {
|
2016-06-08 13:32:30 +00:00
|
|
|
let item_name = item.ident.name.as_str();
|
|
|
|
let item_name_chars = item_name.chars().count();
|
2016-06-08 15:43:27 +00:00
|
|
|
let item_camel = to_camel_case(&item_name);
|
2017-03-31 22:14:04 +00:00
|
|
|
if !in_macro(item.span) {
|
2016-09-12 08:30:42 +00:00
|
|
|
if let Some(&(ref mod_name, ref mod_camel)) = self.modules.last() {
|
2016-06-10 14:30:39 +00:00
|
|
|
// constants don't have surrounding modules
|
|
|
|
if !mod_camel.is_empty() {
|
2017-03-09 09:58:31 +00:00
|
|
|
if *mod_name == item_name {
|
2016-09-13 08:19:55 +00:00
|
|
|
if let ItemKind::Mod(..) = item.node {
|
2017-08-09 07:30:56 +00:00
|
|
|
span_lint(
|
|
|
|
cx,
|
|
|
|
MODULE_INCEPTION,
|
|
|
|
item.span,
|
|
|
|
"module has the same name as its containing module",
|
|
|
|
);
|
2016-09-13 08:19:55 +00:00
|
|
|
}
|
2016-09-12 08:30:42 +00:00
|
|
|
}
|
2016-09-13 08:19:55 +00:00
|
|
|
if item.vis == Visibility::Public {
|
|
|
|
let matching = partial_match(mod_camel, &item_camel);
|
|
|
|
let rmatching = partial_rmatch(mod_camel, &item_camel);
|
|
|
|
let nchars = mod_camel.chars().count();
|
|
|
|
if matching == nchars {
|
|
|
|
span_lint(cx, STUTTER, item.span, "item name starts with its containing module's name");
|
|
|
|
}
|
|
|
|
if rmatching == nchars {
|
|
|
|
span_lint(cx, STUTTER, item.span, "item name ends with its containing module's name");
|
|
|
|
}
|
2016-02-01 11:47:31 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2016-06-08 15:43:27 +00:00
|
|
|
if let ItemKind::Enum(ref def, _) = item.node {
|
2016-12-21 12:30:57 +00:00
|
|
|
let lint = match item.vis {
|
|
|
|
Visibility::Public => PUB_ENUM_VARIANT_NAMES,
|
|
|
|
_ => ENUM_VARIANT_NAMES,
|
|
|
|
};
|
|
|
|
check_variant(cx, self.threshold, def, &item_name, item_name_chars, item.span, lint);
|
2016-06-08 15:43:27 +00:00
|
|
|
}
|
2016-09-12 08:30:42 +00:00
|
|
|
self.modules.push((item_name, item_camel));
|
2016-02-01 11:47:31 +00:00
|
|
|
}
|
|
|
|
}
|