270f0eef73
This is the kind of change that one is expected to need to make to accommodate overloaded-`box`. ---- Note that this is not *all* of the changes necessary to accommodate Issue 22181. It is merely the subset of those cases where there was already a let-binding in place that made it easy to add the necesasry type ascription. (For unnamed intermediate `Box` values, one must go down a different route; `Box::new` is the option that maximizes portability, but has potential inefficiency depending on whether the call is inlined.) ---- There is one place worth note, `run-pass/coerce-match.rs`, where I used an ugly form of `Box<_>` type ascription where I would have preferred to use `Box::new` to accommodate overloaded-`box`. I deliberately did not use `Box::new` here, because that is already done in coerce-match-calls.rs. ---- Precursor for overloaded-`box` and placement-`in`; see Issue 22181.
38 lines
1,001 B
Rust
38 lines
1,001 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.
|
|
|
|
#![allow(unknown_features)]
|
|
#![feature(box_syntax)]
|
|
|
|
#[derive(Copy)]
|
|
struct LM { resize_at: uint, size: uint }
|
|
|
|
enum HashMap<K,V> {
|
|
HashMap_(LM, Vec<(K,V)>)
|
|
}
|
|
|
|
fn linear_map<K,V>() -> HashMap<K,V> {
|
|
HashMap::HashMap_(LM{
|
|
resize_at: 32,
|
|
size: 0}, Vec::new())
|
|
}
|
|
|
|
impl<K,V> HashMap<K,V> {
|
|
pub fn len(&mut self) -> uint {
|
|
match *self {
|
|
HashMap::HashMap_(ref l, _) => l.size
|
|
}
|
|
}
|
|
}
|
|
|
|
pub fn main() {
|
|
let mut m: Box<_> = box linear_map::<(),()>();
|
|
assert_eq!(m.len(), 0);
|
|
}
|