pub mod common;
pub mod ppaux;
pub mod nodemap;
- pub mod lev_distance;
pub mod num;
pub mod fs;
}
+++ /dev/null
-// Copyright 2012-2014 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.
-
-use std::cmp;
-
-pub fn lev_distance(me: &str, t: &str) -> usize {
- if me.is_empty() { return t.chars().count(); }
- if t.is_empty() { return me.chars().count(); }
-
- let mut dcol: Vec<_> = (0..t.len() + 1).collect();
- let mut t_last = 0;
-
- for (i, sc) in me.chars().enumerate() {
-
- let mut current = i;
- dcol[0] = current + 1;
-
- for (j, tc) in t.chars().enumerate() {
-
- let next = dcol[j + 1];
-
- if sc == tc {
- dcol[j + 1] = current;
- } else {
- dcol[j + 1] = cmp::min(current, next);
- dcol[j + 1] = cmp::min(dcol[j + 1], dcol[j]) + 1;
- }
-
- current = next;
- t_last = j;
- }
- }
-
- dcol[t_last + 1]
-}
-
-#[test]
-fn test_lev_distance() {
- use std::char::{ from_u32, MAX };
- // Test bytelength agnosticity
- for c in (0..MAX as u32)
- .filter_map(|i| from_u32(i))
- .map(|i| i.to_string()) {
- assert_eq!(lev_distance(&c[..], &c[..]), 0);
- }
-
- let a = "\nMäry häd ä little lämb\n\nLittle lämb\n";
- let b = "\nMary häd ä little lämb\n\nLittle lämb\n";
- let c = "Mary häd ä little lämb\n\nLittle lämb\n";
- assert_eq!(lev_distance(a, b), 1);
- assert_eq!(lev_distance(b, a), 1);
- assert_eq!(lev_distance(a, c), 2);
- assert_eq!(lev_distance(c, a), 2);
- assert_eq!(lev_distance(b, c), 1);
- assert_eq!(lev_distance(c, b), 1);
-}
use rustc::middle::subst::{ParamSpace, FnSpace, TypeSpace};
use rustc::middle::ty::{Freevar, FreevarMap, TraitMap, GlobMap};
use rustc::util::nodemap::{NodeMap, DefIdSet, FnvHashMap};
-use rustc::util::lev_distance::lev_distance;
use syntax::ast;
use syntax::ast::{CRATE_NODE_ID, Ident, Name, NodeId, CrateNum, TyIs, TyI8, TyI16, TyI32, TyI64};
use syntax::parse::token::{self, special_names, special_idents};
use syntax::ptr::P;
use syntax::codemap::{self, Span, Pos};
+use syntax::util::lev_distance::lev_distance;
use rustc_front::intravisit::{self, FnKind, Visitor};
use rustc_front::hir;
use lint;
use util::common::{block_query, ErrorReported, indenter, loop_query};
use util::nodemap::{DefIdMap, FnvHashMap, NodeMap};
-use util::lev_distance::lev_distance;
use std::cell::{Cell, Ref, RefCell};
use std::collections::{HashSet};
use syntax::owned_slice::OwnedSlice;
use syntax::parse::token::{self, InternedString};
use syntax::ptr::P;
+use syntax::util::lev_distance::lev_distance;
use rustc_front::intravisit::{self, Visitor};
use rustc_front::hir;
use parse::token::{InternedString, intern, str_to_ident};
use ptr::P;
use util::small_vector::SmallVector;
+use util::lev_distance::lev_distance;
use ext::mtwt;
use fold::Folder;
pub fn name_of(&self, st: &str) -> ast::Name {
token::intern(st)
}
+
+ pub fn suggest_macro_name(&mut self, name: &str, span: Span) {
+ use std::cmp::max;
+
+ let mut min: Option<(Name, usize)> = None;
+ let max_dist = max(name.len() / 3, 1);
+ for macro_name in self.syntax_env.names.iter() {
+ let dist = lev_distance(name, ¯o_name.as_str());
+ if dist <= max_dist && (min.is_none() || min.unwrap().1 > dist) {
+ min = Some((*macro_name, dist));
+ }
+ }
+ if let Some((suggestion, _)) = min {
+ self.span_help(span, &format!("did you mean `{}`?", suggestion));
+ }
+ }
}
/// Extract a string literal from the macro expanded version of `expr`,
pth.span,
&format!("macro undefined: '{}!'",
&extname));
+ fld.cx.suggest_macro_name(&extname.as_str(), pth.span);
// let compilation continue
None
pub mod util {
pub mod interner;
+ pub mod lev_distance;
pub mod node_count;
pub mod parser;
#[cfg(test)]
--- /dev/null
+// Copyright 2012-2014 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.
+
+use std::cmp;
+
+pub fn lev_distance(me: &str, t: &str) -> usize {
+ if me.is_empty() { return t.chars().count(); }
+ if t.is_empty() { return me.chars().count(); }
+
+ let mut dcol: Vec<_> = (0..t.len() + 1).collect();
+ let mut t_last = 0;
+
+ for (i, sc) in me.chars().enumerate() {
+
+ let mut current = i;
+ dcol[0] = current + 1;
+
+ for (j, tc) in t.chars().enumerate() {
+
+ let next = dcol[j + 1];
+
+ if sc == tc {
+ dcol[j + 1] = current;
+ } else {
+ dcol[j + 1] = cmp::min(current, next);
+ dcol[j + 1] = cmp::min(dcol[j + 1], dcol[j]) + 1;
+ }
+
+ current = next;
+ t_last = j;
+ }
+ }
+
+ dcol[t_last + 1]
+}
+
+#[test]
+fn test_lev_distance() {
+ use std::char::{ from_u32, MAX };
+ // Test bytelength agnosticity
+ for c in (0..MAX as u32)
+ .filter_map(|i| from_u32(i))
+ .map(|i| i.to_string()) {
+ assert_eq!(lev_distance(&c[..], &c[..]), 0);
+ }
+
+ let a = "\nMäry häd ä little lämb\n\nLittle lämb\n";
+ let b = "\nMary häd ä little lämb\n\nLittle lämb\n";
+ let c = "Mary häd ä little lämb\n\nLittle lämb\n";
+ assert_eq!(lev_distance(a, b), 1);
+ assert_eq!(lev_distance(b, a), 1);
+ assert_eq!(lev_distance(a, c), 2);
+ assert_eq!(lev_distance(c, a), 2);
+ assert_eq!(lev_distance(b, c), 1);
+ assert_eq!(lev_distance(c, b), 1);
+}