Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with dictionary
Search options not deleted
user 28818
0
votes
1
answer
714
views
pset5 valgrind tests failed
/speller substring/dict substring/text...
checking for output "MISSPELLED WORDS\n\nca\ncats\ncaterpill\ncaterpillars\n\nWORDS MISSPELLED:
4\nWORDS IN DICTIONARY: 2\nWORDS IN TEXT: 6\n"...
checking … I tried to use the recursive pseudocode mentioned in the short video on the linked lists.
// Unloads dictionary from memory, returning true if successful else false
/** Your spell checker must not leak …
- 11
0
votes
Accepted
pset5 valgrind tests failed
Ok, I figured out my problem just after I posted it. Here are the changes I made
bool unload(void)
{
//free the malloc for each linked list in table
for (int i = 0; i < N; i++)
{
f …
- 11