xwords 0.3.1

Tooling to fill crossword puzzles
Documentation 
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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65

/*!
Data stores that store the result of partial word lookups
to prevent repeated work.
*/

use std::hash::{Hash, Hasher};

use rustc_hash::{FxHashMap, FxHasher};

use crate::trie::Trie;

#[derive(Clone)]
pub struct CachedWords {
    words_cache: FxHashMap<u64, Vec<String>>,
}

impl CachedWords {
    pub fn default() -> CachedWords {
        CachedWords {
            words_cache: FxHashMap::default(),
        }
    }

    pub fn words<T: Iterator<Item = char> + Clone>(
        &mut self,
        iter: T,
        trie: &Trie,
    ) -> &Vec<String> {
        let mut hasher = FxHasher::default();
        for c in iter.clone() {
            c.hash(&mut hasher);
        }
        let key = hasher.finish();

        self.words_cache
            .entry(key)
            .or_insert_with(|| trie.words(iter))
    }
}

#[derive(Clone)]
pub struct CachedIsViable {
    is_viable_cache: FxHashMap<u64, bool>,
}

impl CachedIsViable {
    pub fn default() -> CachedIsViable {
        CachedIsViable {
            is_viable_cache: FxHashMap::default(),
        }
    }

    pub fn is_viable<T: Iterator<Item = char> + Clone>(&mut self, iter: T, trie: &Trie) -> bool {
        let mut hasher = FxHasher::default();
        for c in iter.clone() {
            c.hash(&mut hasher);
        }
        let key = hasher.finish();

        *self
            .is_viable_cache
            .entry(key)
            .or_insert_with(|| trie.is_viable(iter))
    }
}