090040bf40
for `~str`/`~[]`. Note that `~self` still remains, since I forgot to add support for `Box<self>` before the snapshot. How to update your code: * Instead of `~EXPR`, you should write `box EXPR`. * Instead of `~TYPE`, you should write `Box<Type>`. * Instead of `~PATTERN`, you should write `box PATTERN`. [breaking-change]
43 lines
1.0 KiB
Rust
43 lines
1.0 KiB
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.
|
|
|
|
/**
|
|
* A function that returns a hash of a value
|
|
*
|
|
* The hash should concentrate entropy in the lower bits.
|
|
*/
|
|
type HashFn<K> = proc(K) -> uint;
|
|
type EqFn<K> = proc(K, K) -> bool;
|
|
|
|
struct LM { resize_at: uint, size: uint }
|
|
|
|
enum HashMap<K,V> {
|
|
HashMap_(LM)
|
|
}
|
|
|
|
fn linear_map<K,V>() -> HashMap<K,V> {
|
|
HashMap_(LM{
|
|
resize_at: 32,
|
|
size: 0})
|
|
}
|
|
|
|
impl<K,V> HashMap<K,V> {
|
|
pub fn len(&mut self) -> uint {
|
|
match *self {
|
|
HashMap_(l) => l.size
|
|
}
|
|
}
|
|
}
|
|
|
|
pub fn main() {
|
|
let mut m = box linear_map::<(),()>();
|
|
assert_eq!(m.len(), 0);
|
|
}
|