diff options
| author | Daniel Micay <danielmicay@gmail.com> | 2013-02-01 02:13:36 -0500 |
|---|---|---|
| committer | Daniel Micay <danielmicay@gmail.com> | 2013-02-03 15:55:10 -0500 |
| commit | 319eeb1c791324d1ba3a46513ab5f2c5a8e7fc5f (patch) | |
| tree | 6152371bb8ab7f805491575ea44f4840644aaa2d /src/libsyntax | |
| parent | df31373406d7edae286f0cf38d497204eb0d35e7 (diff) | |
| download | rust-319eeb1c791324d1ba3a46513ab5f2c5a8e7fc5f.tar.gz rust-319eeb1c791324d1ba3a46513ab5f2c5a8e7fc5f.zip | |
rename map -> oldmap and mark it as deprecated
LinearMap is quite a bit faster, and is fully owned/sendable without requiring copies. The older std::map also doesn't use explicit self and relies on mutable fields.
Diffstat (limited to 'src/libsyntax')
| -rw-r--r-- | src/libsyntax/ast_map.rs | 8 | ||||
| -rw-r--r-- | src/libsyntax/attr.rs | 6 | ||||
| -rw-r--r-- | src/libsyntax/ext/auto_encode.rs | 4 | ||||
| -rw-r--r-- | src/libsyntax/ext/base.rs | 2 | ||||
| -rw-r--r-- | src/libsyntax/ext/expand.rs | 2 | ||||
| -rw-r--r-- | src/libsyntax/ext/tt/macro_parser.rs | 2 | ||||
| -rw-r--r-- | src/libsyntax/ext/tt/macro_rules.rs | 2 | ||||
| -rw-r--r-- | src/libsyntax/ext/tt/transcribe.rs | 8 | ||||
| -rw-r--r-- | src/libsyntax/parse/common.rs | 2 | ||||
| -rw-r--r-- | src/libsyntax/parse/parser.rs | 2 | ||||
| -rw-r--r-- | src/libsyntax/parse/token.rs | 2 | ||||
| -rw-r--r-- | src/libsyntax/util/interner.rs | 6 |
12 files changed, 23 insertions, 23 deletions
diff --git a/src/libsyntax/ast_map.rs b/src/libsyntax/ast_map.rs index 759d3d2d824..e6a4639ad80 100644 --- a/src/libsyntax/ast_map.rs +++ b/src/libsyntax/ast_map.rs @@ -25,8 +25,8 @@ use core::cmp; use core::either; use core::str; use core::vec; -use std::map::HashMap; -use std::map; +use std::oldmap::HashMap; +use std::oldmap; use std; pub enum path_elt { @@ -106,7 +106,7 @@ pub enum ast_node { node_struct_ctor(@struct_def, @item, @path), } -pub type map = std::map::HashMap<node_id, ast_node>; +pub type map = std::oldmap::HashMap<node_id, ast_node>; pub struct ctx { map: map, mut path: path, @@ -134,7 +134,7 @@ pub fn mk_ast_map_visitor() -> vt { pub fn map_crate(diag: span_handler, c: crate) -> map { let cx = ctx { - map: std::map::HashMap(), + map: std::oldmap::HashMap(), mut path: ~[], mut local_id: 0u, diag: diag, diff --git a/src/libsyntax/attr.rs b/src/libsyntax/attr.rs index 30bd23d5936..690bac48075 100644 --- a/src/libsyntax/attr.rs +++ b/src/libsyntax/attr.rs @@ -24,8 +24,8 @@ use core::either::Either; use core::either; use core::option; use core::vec; -use std::map::HashMap; -use std::map; +use std::oldmap::HashMap; +use std::oldmap; use std; /* Constructors */ @@ -358,7 +358,7 @@ pub fn find_inline_attr(attrs: &[ast::attribute]) -> inline_attr { pub fn require_unique_names(diagnostic: span_handler, metas: &[@ast::meta_item]) { - let map = map::HashMap(); + let map = oldmap::HashMap(); for metas.each |meta| { let name = get_meta_item_name(*meta); diff --git a/src/libsyntax/ext/auto_encode.rs b/src/libsyntax/ext/auto_encode.rs index 622db9400be..03aa0cde811 100644 --- a/src/libsyntax/ext/auto_encode.rs +++ b/src/libsyntax/ext/auto_encode.rs @@ -98,8 +98,8 @@ use ext::base::*; use parse; use core::vec; -use std::map; -use std::map::HashMap; +use std::oldmap; +use std::oldmap::HashMap; // Transitional reexports so qquote can find the paths it is looking for mod syntax { diff --git a/src/libsyntax/ext/base.rs b/src/libsyntax/ext/base.rs index a37ce512ac1..3efae955965 100644 --- a/src/libsyntax/ext/base.rs +++ b/src/libsyntax/ext/base.rs @@ -20,7 +20,7 @@ use parse::{parser, token}; use core::io; use core::vec; -use std::map::HashMap; +use std::oldmap::HashMap; // new-style macro! tt code: // diff --git a/src/libsyntax/ext/expand.rs b/src/libsyntax/ext/expand.rs index 1d9c87f4e95..227a86e0766 100644 --- a/src/libsyntax/ext/expand.rs +++ b/src/libsyntax/ext/expand.rs @@ -20,7 +20,7 @@ use parse::{parser, parse_expr_from_source_str, new_parser_from_tts}; use core::option; use core::vec; -use std::map::HashMap; +use std::oldmap::HashMap; pub fn expand_expr(exts: HashMap<~str, SyntaxExtension>, cx: ext_ctxt, e: expr_, s: span, fld: ast_fold, diff --git a/src/libsyntax/ext/tt/macro_parser.rs b/src/libsyntax/ext/tt/macro_parser.rs index a31af36cc54..3ef176d62bb 100644 --- a/src/libsyntax/ext/tt/macro_parser.rs +++ b/src/libsyntax/ext/tt/macro_parser.rs @@ -26,7 +26,7 @@ use core::option; use core::str; use core::uint; use core::vec; -use std::map::HashMap; +use std::oldmap::HashMap; /* This is an Earley-like parser, without support for in-grammar nonterminals, only by calling out to the main rust parser for named nonterminals (which it diff --git a/src/libsyntax/ext/tt/macro_rules.rs b/src/libsyntax/ext/tt/macro_rules.rs index 115cb4f5f94..31172cbfa85 100644 --- a/src/libsyntax/ext/tt/macro_rules.rs +++ b/src/libsyntax/ext/tt/macro_rules.rs @@ -26,7 +26,7 @@ use parse::token::{FAT_ARROW, SEMI, LBRACE, RBRACE, nt_matchers, nt_tt}; use print; use core::io; -use std::map::HashMap; +use std::oldmap::HashMap; pub fn add_new_extension(cx: ext_ctxt, sp: span, name: ident, arg: ~[ast::token_tree]) -> base::MacResult { diff --git a/src/libsyntax/ext/tt/transcribe.rs b/src/libsyntax/ext/tt/transcribe.rs index 504a17237dc..6bf90617a6e 100644 --- a/src/libsyntax/ext/tt/transcribe.rs +++ b/src/libsyntax/ext/tt/transcribe.rs @@ -22,7 +22,7 @@ use parse::lexer::TokenAndSpan; use core::option; use core::vec; use std; -use std::map::HashMap; +use std::oldmap::HashMap; enum tt_frame_up { /* to break a circularity */ tt_frame_up(Option<tt_frame>) @@ -44,7 +44,7 @@ pub type tt_reader = @{ interner: @ident_interner, mut cur: tt_frame, /* for MBE-style macro transcription */ - interpolations: std::map::HashMap<ident, @named_match>, + interpolations: std::oldmap::HashMap<ident, @named_match>, mut repeat_idx: ~[uint], mut repeat_len: ~[uint], /* cached: */ @@ -56,14 +56,14 @@ pub type tt_reader = @{ * `src` contains no `tt_seq`s and `tt_nonterminal`s, `interp` can (and * should) be none. */ pub fn new_tt_reader(sp_diag: span_handler, itr: @ident_interner, - interp: Option<std::map::HashMap<ident,@named_match>>, + interp: Option<std::oldmap::HashMap<ident,@named_match>>, src: ~[ast::token_tree]) -> tt_reader { let r = @{sp_diag: sp_diag, interner: itr, mut cur: @{readme: src, mut idx: 0u, dotdotdoted: false, sep: None, up: tt_frame_up(option::None)}, interpolations: match interp { /* just a convienience */ - None => std::map::HashMap(), + None => std::oldmap::HashMap(), Some(x) => x }, mut repeat_idx: ~[], diff --git a/src/libsyntax/parse/common.rs b/src/libsyntax/parse/common.rs index 48ef6b873ec..d82a5a18039 100644 --- a/src/libsyntax/parse/common.rs +++ b/src/libsyntax/parse/common.rs @@ -18,7 +18,7 @@ use parse::token; use core::option::{None, Option, Some}; use core::option; -use std::map::HashMap; +use std::oldmap::HashMap; pub type seq_sep = { sep: Option<token::Token>, diff --git a/src/libsyntax/parse/parser.rs b/src/libsyntax/parse/parser.rs index 06f86f134a6..3c7250112ab 100644 --- a/src/libsyntax/parse/parser.rs +++ b/src/libsyntax/parse/parser.rs @@ -87,7 +87,7 @@ use core::either; use core::result::Result; use core::vec::push; use core::vec; -use std::map::HashMap; +use std::oldmap::HashMap; #[deriving_eq] enum restriction { diff --git a/src/libsyntax/parse/token.rs b/src/libsyntax/parse/token.rs index 843b0edcfc9..6897068a6bf 100644 --- a/src/libsyntax/parse/token.rs +++ b/src/libsyntax/parse/token.rs @@ -21,7 +21,7 @@ use core::char; use core::cmp; use core::str; use core::task; -use std::map::HashMap; +use std::oldmap::HashMap; #[auto_encode] #[auto_decode] diff --git a/src/libsyntax/util/interner.rs b/src/libsyntax/util/interner.rs index 23db470391a..19b938ccd68 100644 --- a/src/libsyntax/util/interner.rs +++ b/src/libsyntax/util/interner.rs @@ -15,13 +15,13 @@ use core::prelude::*; use core::dvec::DVec; -use std::map::HashMap; -use std::map; +use std::oldmap::HashMap; +use std::oldmap; pub type hash_interner<T> = {map: HashMap<T, uint>, vect: DVec<T>}; pub fn mk<T:Eq IterBytes Hash Const Copy>() -> Interner<T> { - let m = map::HashMap::<T, uint>(); + let m = oldmap::HashMap::<T, uint>(); let hi: hash_interner<T> = {map: m, vect: DVec()}; move ((move hi) as Interner::<T>) |
