319eeb1c79
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.
25 lines
786 B
Rust
25 lines
786 B
Rust
// Copyright 2012 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.
|
|
|
|
#[link(name = "req")];
|
|
#[crate_type = "lib"];
|
|
|
|
extern mod std;
|
|
|
|
use core::dvec::*;
|
|
use std::oldmap::HashMap;
|
|
|
|
pub type header_map = HashMap<~str, @DVec<@~str>>;
|
|
|
|
// the unused ty param is necessary so this gets monomorphized
|
|
pub fn request<T: Copy>(req: header_map) {
|
|
let _x = copy *(copy *req.get(~"METHOD"))[0u];
|
|
}
|