about summary refs log tree commit diff
path: root/src/test/run-pass/explicit-self-generic.rs
blob: ac19592accf8b0e517c0e0de094fa5d774f780eb (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
// 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.

extern mod std;

/**
 * A function that returns a hash of a value
 *
 * The hash should concentrate entropy in the lower bits.
 */
type HashFn<K> = ~fn(K) -> uint;
type EqFn<K> = ~fn(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})
}

pub impl<K,V> HashMap<K,V> {
    fn len(&mut self) -> uint {
        self.size
    }
}

pub fn main() {
    let mut m = ~linear_map::<(),()>();
    assert!(m.len() == 0);
}