Shared via Rust Playground

playground.rs

use std::hash::Hash;
use std::collections::{HashMap, HashSet};


pub type Value = u32;
// list of values, assumed to be small to large
pub const VALUES : [Value; 5] = [1, 2, 3, 4, 5];


pub trait Info<T> where T: Hash + Eq + Clone + Copy {
    // get all a-priori possibilities
    fn get_all_possibilities() -> Iterator<Item=T>;
}

#[derive(Debug,Clone)]
pub struct ExampleInfo(HashSet<u32>);
impl ExampleInfo {
    pub fn new() -> ExampleInfo { ExampleInfo(HashSet::new()) }
}
impl Info<Value> for ExampleInfo {
    fn get_all_possibilities() -> Iterator<Item=Value> { VALUES.iter() as Iterator<Item=Value> }
}

fn main() {
}