holyhashmap 0.1.2

A hash map with stable indices.
Documentation
// Copyright (c) 2018 Jason White
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
// THE SOFTWARE.
extern crate holyhashmap;
#[macro_use]
extern crate quickcheck;

use holyhashmap::HolyHashMap;

quickcheck! {
    fn contains(insert: Vec<u32>) -> bool {
        let mut map = HolyHashMap::new();
        for &key in insert.iter() {
            map.insert(key, ());
        }

        insert.iter().all(|key| map.contains_key(key))
    }

    fn contains_not(insert: Vec<u8>, not: Vec<u8>) -> bool {
        let mut map = HolyHashMap::new();
        for &key in insert.iter() {
            map.insert(key, ());
        }

        for &key in not.iter() {
            map.remove(&key);
        }

        not.iter().all(|key| !map.contains_key(key))
    }
}