words-game 0.1.0

Spelling game implementation
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

use std::collections::HashSet;
use std::str;

pub static HAND_SIZE: usize = 10;

/*
  The Map of the default board
    . - Empty piece
    3 - Triple word
    2 - Double word
    @ - Double letter
    # - Triple letter
    + - Starting spot
*/
pub static BOARD: &str = "\
  3..@...3...@..3\
  .2...#...#...2.\
  ..2...@.@...2..\
  @..2...@...2..@\
  ....2.....2....\
  .#...#...#...#.\
  ..@...@.@...@..\
  3..@...+...@..3\
  ..@...@.@...@..\
  .#...#...#...#.\
  ....2.....2....\
  @..2...@...2..@\
  ..2...@.@...2..\
  .2...#...#...2.\
  3..@...3...@..3";

pub static BOARD_SIZE: u32 = 15;

lazy_static! {
    pub static ref DICTIONARY: HashSet<&'static str> = {
        let mut dict = HashSet::new();

        let words = include_str!("dictionary.txt");

        for line in words.lines() {
            dict.insert(line);
        }

        dict
    };
}

pub fn check_dictionary(s: &str) -> bool {
    DICTIONARY.contains(s)
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn dictionary_has_word() {
        assert_eq!(DICTIONARY.contains("MOTORCYCLE"), true);
    }

    #[test]
    fn dictionary_no_word() {
        assert_eq!(DICTIONARY.contains("BLAHBLAHBLAH"), false);
    }
}