// 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 or the MIT license // , at your // option. This file may not be copied, modified, or distributed // except according to those terms. pub struct Entry { key: A, value: B } pub struct alist { eq_fn: @fn(A,A) -> bool, data: @mut ~[Entry] } pub fn alist_add(lst: &alist, k: A, v: B) { lst.data.push(Entry{key:k, value:v}); } pub fn alist_get( lst: &alist, k: A) -> B { let eq_fn = lst.eq_fn; for lst.data.iter().advance |entry| { if eq_fn(entry.key.clone(), k.clone()) { return entry.value.clone(); } } fail!(); } #[inline] pub fn new_int_alist() -> alist { fn eq_int(a: int, b: int) -> bool { a == b } return alist {eq_fn: eq_int, data: @mut ~[]}; } #[inline] pub fn new_int_alist_2() -> alist { #[inline] fn eq_int(a: int, b: int) -> bool { a == b } return alist {eq_fn: eq_int, data: @mut ~[]}; }