-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathLexiconTrie.java
67 lines (62 loc) · 2.07 KB
/
LexiconTrie.java
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
66
67
/**
* Copyright (C) 2002 Michael Green <[email protected]>
*
* Copyright (C) 2002 Paul Kube <[email protected]>
*
* Copyright (C) 2005 Owen Astrachan <[email protected]>
*
* Copyright (C) 2011 Hoa Long Tam <[email protected]> and Armin Samii
*
* This file is part of CS Boggle.
*
* CS Boggle is free software: you can redistribute it and/or modify it under
* the terms of the GNU General Public License as published by the Free Software
* Foundation, either version 3 of the License, or (at your option) any later
* version.
*
* CS Boggle is distributed in the hope that it will be useful, but WITHOUT ANY
* WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR
* A PARTICULAR PURPOSE. See the GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License along with
* CS boggle. If not, see <http://www.gnu.org/licenses/>.
*/
import java.util.Scanner;
public class LexiconTrie implements LexiconInterface {
/**
* Load the words from an input source and store them in this lexicon.
*
* @param input A scanner that will provide the entire dictionary.
*/
public void load(Scanner input) {
while (input.hasNext()) {
String nextStr = input.next();
/* TODO: Store the dictionary efficiently. You must implement a trie here.
*
* Use good programming practices here:
* - Keep instance variables private
* - Use methods to break up your code into logical segments.
* - Write tests for EVERY non-trivial method.
*/
}
}
/**
* If the prefix is in the lexicon, returns true.
*
* @param s The word to search for.
* @return True if the lexicon contains s.
*/
public boolean containsPrefix(String s) {
return false;
}
/**
* If the word is in the lexicon, returns true.
*
* @param s The word to search for.
* @return True if the lexicon contains s.
*/
public boolean contains(String s) {
return false;
}
}