From ad94e31d05c28f2a16c48e25a7600f17ca86fbd2 Mon Sep 17 00:00:00 2001 From: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Date: Sun, 30 Apr 2023 15:50:07 +0000 Subject: [PATCH] Documentation for 71a7cf3bc4696a49f5bc4e81ce8d569d2c238cb2 --- annotated.html | 71 +-- annotated_dup.js | 1 + classes.html | 2 +- d1/d01/structgame__instance.html | 151 +++++ d1/d01/structgame__instance.js | 9 + d7/d43/hangman_8c__incl.map | 8 + d7/d43/hangman_8c__incl.md5 | 1 + d7/d43/hangman_8c__incl.svg | 96 +++ dc/dc5/hangman_8c.html | 591 ++++++++++++++++++ dc/dc5/hangman_8c.js | 9 + ...611b43141ac2e6ba245487c493599fc_cgraph.map | 3 + ...611b43141ac2e6ba245487c493599fc_cgraph.md5 | 1 + ...611b43141ac2e6ba245487c493599fc_cgraph.svg | 27 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 7 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 87 +++ dir_4b6f782e158b0b98da980a0e11a23a15.html | 3 + dir_4b6f782e158b0b98da980a0e11a23a15.js | 1 + files.html | 3 +- functions.html | 6 + functions_vars.html | 6 + globals_b.html | 2 +- globals_defs.html | 2 +- globals_func_b.html | 2 +- globals_func_i.html | 3 +- globals_func_m.html | 2 +- globals_func_n.html | 2 + globals_func_w.html | 1 + globals_i.html | 3 +- globals_m.html | 4 +- globals_n.html | 2 + globals_w.html | 1 + navtreedata.js | 8 +- navtreeindex0.js | 58 +- navtreeindex1.js | 72 +-- navtreeindex2.js | 30 +- navtreeindex3.js | 94 +-- navtreeindex4.js | 25 +- search/all_10.js | 32 +- search/all_15.js | 26 +- search/all_19.js | 13 +- search/all_4.js | 4 +- search/all_5.js | 3 +- search/all_9.js | 61 +- search/all_a.js | 34 +- search/all_b.js | 70 ++- search/all_f.js | 6 +- search/classes_6.js | 5 +- search/files_8.js | 17 +- search/functions_17.js | 3 +- search/functions_2.js | 4 +- search/functions_9.js | 55 +- search/functions_d.js | 2 +- search/functions_e.js | 10 +- search/variables_2.js | 3 +- search/variables_6.js | 4 +- search/variables_7.js | 3 +- search/variables_8.js | 3 +- search/variables_f.js | 15 +- 59 files changed, 1411 insertions(+), 357 deletions(-) create mode 100644 d1/d01/structgame__instance.html create mode 100644 d1/d01/structgame__instance.js create mode 100644 d7/d43/hangman_8c__incl.map create mode 100644 d7/d43/hangman_8c__incl.md5 create mode 100644 d7/d43/hangman_8c__incl.svg create mode 100644 dc/dc5/hangman_8c.html create mode 100644 dc/dc5/hangman_8c.js create mode 100644 dc/dc5/hangman_8c_a9611b43141ac2e6ba245487c493599fc_cgraph.map create mode 100644 dc/dc5/hangman_8c_a9611b43141ac2e6ba245487c493599fc_cgraph.md5 create mode 100644 dc/dc5/hangman_8c_a9611b43141ac2e6ba245487c493599fc_cgraph.svg create mode 100644 dc/dc5/hangman_8c_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 dc/dc5/hangman_8c_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 dc/dc5/hangman_8c_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg diff --git a/annotated.html b/annotated.html index de1b4961..d4e19be0 100644 --- a/annotated.html +++ b/annotated.html @@ -121,41 +121,42 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();  Celem  Ceuclidean_resultFor tests  Ceuler_3D Euler or Tait-Bryan angles (in radian) - CGraph - CGraphRep - Chash_set_t - Ckohonen_array_3dTo store info regarding 3D arrays - CL - ClistDoubly linked list struct - CListItemDefinition for a binary tree node - Cmat_3x3_A 3x3 Matrix type definition - Cmax_heapFor INT_MIN - CMEMORY_INFORMATIONFor the malloc, calloc and free functions - Cmin_heap - CNFADefinition for the NFA itself - CNFAStateDefinition for a NFA state - CNodeNode, the basic data structure of the tree - CnodeNode, the basic data structure in the tree - CNodeDistributeInfoDefinition for a binary tree node - Cobservation - CpidPID Controller - Cquaternion_Quaternion type represented using a scalar \(w\) or \(q_0\) and a 3D vector \(\left(q_1,q_2,q_3\right)\) - Cqueue - CQueueRep - Csegment_treeThis structures holds all the data that is required by a segment tree - Cstack - CStackFor printf() and scanf() - CStockSpanner - Csubset - CsudokuStructure to hold the matrix and dimensions - CT - CtermIdentifier for single-variable polynomial coefficients as a linked list - Ctnode - CtransRuleDefinition for a NFA state transition rule - Ctrie - Cvec_3d_3D vector type - CVectorFor IO operations - Cword_count_word + Cgame_instanceFor main() - tolower() for main(), new_word(), new_guess(), won() - I/O operations for all functions - exit(), rand() and file functions for main() - for string operations strlen, strchr, strcpy for new_game() - used with srand() for declaring new game instance + CGraph + CGraphRep + Chash_set_t + Ckohonen_array_3dTo store info regarding 3D arrays + CL + ClistDoubly linked list struct + CListItemDefinition for a binary tree node + Cmat_3x3_A 3x3 Matrix type definition + Cmax_heapFor INT_MIN + CMEMORY_INFORMATIONFor the malloc, calloc and free functions + Cmin_heap + CNFADefinition for the NFA itself + CNFAStateDefinition for a NFA state + CNodeNode, the basic data structure of the tree + CnodeNode, the basic data structure in the tree + CNodeDistributeInfoDefinition for a binary tree node + Cobservation + CpidPID Controller + Cquaternion_Quaternion type represented using a scalar \(w\) or \(q_0\) and a 3D vector \(\left(q_1,q_2,q_3\right)\) + Cqueue + CQueueRep + Csegment_treeThis structures holds all the data that is required by a segment tree + Cstack + CStackFor printf() and scanf() + CStockSpanner + Csubset + CsudokuStructure to hold the matrix and dimensions + CT + CtermIdentifier for single-variable polynomial coefficients as a linked list + Ctnode + CtransRuleDefinition for a NFA state transition rule + Ctrie + Cvec_3d_3D vector type + CVectorFor IO operations + Cword_count_word diff --git a/annotated_dup.js b/annotated_dup.js index eb85e5c8..11ea5666 100644 --- a/annotated_dup.js +++ b/annotated_dup.js @@ -19,6 +19,7 @@ var annotated_dup = [ "elem", "d0/d6b/structelem.html", null ], [ "euclidean_result", "d8/d1e/structeuclidean__result.html", "d8/d1e/structeuclidean__result" ], [ "euler_", "d2/de8/structeuler__.html", "d2/de8/structeuler__" ], + [ "game_instance", "d1/d01/structgame__instance.html", "d1/d01/structgame__instance" ], [ "Graph", "d4/dd4/struct_graph.html", null ], [ "GraphRep", "d2/d6a/struct_graph_rep.html", null ], [ "hash_set_t", "d0/df1/structhash__set__t.html", null ], diff --git a/classes.html b/classes.html index 2c2874b3..8d226fd2 100644 --- a/classes.html +++ b/classes.html @@ -119,7 +119,7 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
Edge
elem
euclidean_result
euler_
G
-
Graph
GraphRep
+
game_instance
Graph
GraphRep
H
hash_set_t
diff --git a/d1/d01/structgame__instance.html b/d1/d01/structgame__instance.html new file mode 100644 index 00000000..696935ff --- /dev/null +++ b/d1/d01/structgame__instance.html @@ -0,0 +1,151 @@ + + + + + + + +Algorithms_in_C: game_instance Struct Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C 1.0.0 +
+
Set of algorithms implemented in C.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+
+
+
+
+
Loading...
+
Searching...
+
No Matches
+
+
+
+
+ +
+ +
game_instance Struct Reference
+
+
+ +

for main() - tolower() for main(), new_word(), new_guess(), won() - I/O operations for all functions - exit(), rand() and file functions for main() - for string operations strlen, strchr, strcpy for new_game() - used with srand() for declaring new game instance + More...

+ + + + + + + + + + + + + + + + + + + + +

+Data Fields

+char current_word [30]
 word to be guessed by player
 
+char hidden [30]
 hidden version of word that is displayed to player
 
+int size
 size of word
 
+int incorrect
 number of incorrect guesses
 
+char guesses [25]
 previous guesses
 
+int guesses_size
 size of guesses array
 
+

Detailed Description

+

for main() - tolower() for main(), new_word(), new_guess(), won() - I/O operations for all functions - exit(), rand() and file functions for main() - for string operations strlen, strchr, strcpy for new_game() - used with srand() for declaring new game instance

+

The documentation for this struct was generated from the following file: +
+
+ + + + diff --git a/d1/d01/structgame__instance.js b/d1/d01/structgame__instance.js new file mode 100644 index 00000000..a2d1accc --- /dev/null +++ b/d1/d01/structgame__instance.js @@ -0,0 +1,9 @@ +var structgame__instance = +[ + [ "current_word", "d1/d01/structgame__instance.html#ad3caed9fb908aa7dba2aa25e8debdfdf", null ], + [ "guesses", "d1/d01/structgame__instance.html#a742506bd6e2e03ce63e504ef6abdf643", null ], + [ "guesses_size", "d1/d01/structgame__instance.html#affc18c8be0e07b6b19914458ed853aa7", null ], + [ "hidden", "d1/d01/structgame__instance.html#aabb340e08e8ab73df250a6fe3b6f532d", null ], + [ "incorrect", "d1/d01/structgame__instance.html#a89731a7d5b4676db9ccc4b0db2cd8f24", null ], + [ "size", "d1/d01/structgame__instance.html#ae7d4369a86942792c809a51965764094", null ] +]; \ No newline at end of file diff --git a/d7/d43/hangman_8c__incl.map b/d7/d43/hangman_8c__incl.map new file mode 100644 index 00000000..75214593 --- /dev/null +++ b/d7/d43/hangman_8c__incl.map @@ -0,0 +1,8 @@ + + + + + + + + diff --git a/d7/d43/hangman_8c__incl.md5 b/d7/d43/hangman_8c__incl.md5 new file mode 100644 index 00000000..c39d447e --- /dev/null +++ b/d7/d43/hangman_8c__incl.md5 @@ -0,0 +1 @@ +2661c128ff4fdff496100b20d4f24a1a \ No newline at end of file diff --git a/d7/d43/hangman_8c__incl.svg b/d7/d43/hangman_8c__incl.svg new file mode 100644 index 00000000..5e9e59e4 --- /dev/null +++ b/d7/d43/hangman_8c__incl.svg @@ -0,0 +1,96 @@ + + + + + + +games/hangman.c + + +Node1 + + +games/hangman.c + + + + + +Node2 + + +ctype.h + + + + + +Node1->Node2 + + + + + +Node3 + + +stdio.h + + + + + +Node1->Node3 + + + + + +Node4 + + +stdlib.h + + + + + +Node1->Node4 + + + + + +Node5 + + +string.h + + + + + +Node1->Node5 + + + + + +Node6 + + +time.h + + + + + +Node1->Node6 + + + + + diff --git a/dc/dc5/hangman_8c.html b/dc/dc5/hangman_8c.html new file mode 100644 index 00000000..a3639f81 --- /dev/null +++ b/dc/dc5/hangman_8c.html @@ -0,0 +1,591 @@ + + + + + + + +Algorithms_in_C: games/hangman.c File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C 1.0.0 +
+
Set of algorithms implemented in C.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+
+
+
+
+
Loading...
+
Searching...
+
No Matches
+
+
+
+
+ +
+ +
hangman.c File Reference
+
+
+ +

C implementation of Hangman Game +More...

+
#include <ctype.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <time.h>
+
+Include dependency graph for hangman.c:
+
+
+
+
+
+ + + + +

+Data Structures

struct  game_instance
 for main() - tolower() for main(), new_word(), new_guess(), won() - I/O operations for all functions - exit(), rand() and file functions for main() - for string operations strlen, strchr, strcpy for new_game() - used with srand() for declaring new game instance More...
 
+ + + + + + + + + + + + + + + + + + +

+Functions

struct game_instance new_game ()
 creates a new game - generates a random word and stores in global variable current_word
 
int new_guess (char new_guess, const char guesses[], int size)
 checks if letter has been guessed before
 
int in_word (char letter, const char word[], unsigned int size)
 checks if letter is in current word
 
void picture (int score)
 
void won (const char word[], int score)
 checks if player has won or lost
 
int main ()
 Main Function.
 
+

Detailed Description

+

C implementation of Hangman Game

+

Simple, readable version of hangman. Changed graphic to duck instead of traditional stick figure (same number of guesses).

Author
AtlantaEmrys2002
+

Function Documentation

+ +

◆ in_word()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
int in_word (char letter,
const char word[],
unsigned int size 
)
+
+ +

checks if letter is in current word

+
Parameters
+ + + + +
letterletter guessed by player
wordcurrent word
sizelength of word
+
+
+
Returns
1 if letter is in word
+
+-1 if letter is not in word
+
119 {
+
120
+
121 for (int i = 0; i < size; i++) {
+
122 if ((word[i]) == letter) {
+
123 return 1;
+
124 }
+
125 }
+
126
+
127 return -1;
+
128}
+
+
+
+ +

◆ main()

+ +
+
+ + + + + + + + +
int main (void )
+
+ +

Main Function.

+
Returns
0 on exit
+
41 {
+
42
+
43 struct game_instance game = new_game(); // new game created
+
44 char guess; // current letter guessed by player
+
45
+
46 // main loop - asks player for guesses
+
47 while ((strchr(game.hidden, '_') != NULL) && game.incorrect <= 12) {
+
48 do {
+
49 printf("\n****************************\n");
+
50 printf("Your word: ");
+
51
+
52 for (int i = 0; i < game.size; i++) {
+
53 printf("%c ", game.hidden[i]);
+
54 }
+
55
+
56 if (game.guesses_size > 0) {
+
57 printf("\nSo far, you have guessed: ");
+
58 for (int i = 0; i < game.guesses_size; i++) {
+
59 printf("%c ", game.guesses[i]);
+
60 }
+
61 }
+
62
+
63 printf("\nYou have %d guesses left.", (12 - game.incorrect));
+
64 printf("\nPlease enter a letter: ");
+
65 scanf(" %c", &guess);
+
66 guess = tolower(guess);
+
67
+
68 } while (new_guess(guess, game.guesses, game.guesses_size) != -1);
+
69
+
70 game.guesses[game.guesses_size] = guess; // adds new letter to guesses array
+
71 game.guesses_size++; // updates size of guesses array
+
72
+
73 if (in_word(guess, game.current_word, game.size) == 1) {
+
74 printf("That letter is in the word!");
+
75 for (int i = 0; i < game.size; i++) {
+
76 if ((game.current_word[i]) == guess) {
+
77 game.hidden[i] = guess;
+
78 }
+
79 }
+
80 } else {
+
81 printf("That letter is not in the word.\n");
+
82 (game.incorrect)++;
+
83 }
+
84 picture(game.incorrect);
+
85 }
+
86
+
87 won(game.current_word, game.incorrect);
+
88 return 0;
+
89}
+
void won(const char word[], int score)
checks if player has won or lost
Definition: hangman.c:192
+
int in_word(char, const char word[], unsigned int size)
checks if letter is in current word
Definition: hangman.c:119
+
int new_guess(char, const char guesses[], int size)
checks if letter has been guessed before
Definition: hangman.c:99
+
struct game_instance new_game(void)
creates a new game - generates a random word and stores in global variable current_word
Definition: hangman.c:134
+
for main() - tolower() for main(), new_word(), new_guess(), won() - I/O operations for all functions ...
Definition: hangman.c:19
+
char guesses[25]
previous guesses
Definition: hangman.c:25
+
int incorrect
number of incorrect guesses
Definition: hangman.c:24
+
char hidden[30]
hidden version of word that is displayed to player
Definition: hangman.c:22
+
char current_word[30]
word to be guessed by player
Definition: hangman.c:21
+
int size
size of word
Definition: hangman.c:23
+
int guesses_size
size of guesses array
Definition: hangman.c:26
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ new_game()

+ +
+
+ + + + + + + + +
struct game_instance new_game (void )
+
+ +

creates a new game - generates a random word and stores in global variable current_word

+
Returns
current_game - a new game instance containing randomly selected word, its length and hidden version of word
+
134 {
+
135
+
136 char word[30]; // used throughout function
+
137
+
138 FILE *fptr;
+
139 fptr = fopen("games/words.txt", "r");
+
140
+
141 if (fptr == NULL){
+
142 fprintf(stderr, "File not found.\n");
+
143 exit(EXIT_FAILURE);
+
144 }
+
145
+
146 // counts number of words in file - assumes each word on new line
+
147 int line_number = 0;
+
148 while (fgets(word, 30, fptr) != NULL) {
+
149 line_number++;
+
150 }
+
151
+
152 rewind(fptr);
+
153
+
154 // generates random number
+
155 int random_num;
+
156 srand(time(NULL));
+
157 random_num = rand() % line_number;
+
158
+
159 // selects randomly generated word
+
160 int s = 0;
+
161 while (s <= random_num){
+
162 fgets(word, 30, fptr);
+
163 s++;
+
164 }
+
165
+
166 // formats string correctly
+
167 if (strchr(word, '\n') != NULL){
+
168 word[strlen(word) - 1] = '\0';
+
169 }
+
170
+
171 fclose(fptr);
+
172
+
173 // creates new game instance
+
174 struct game_instance current_game;
+
175 strcpy(current_game.current_word, word);
+
176 current_game.size = strlen(word);
+
177 for (int i = 0; i < (strlen(word)); i++) {
+
178 current_game.hidden[i] = '_';
+
179 }
+
180 current_game.incorrect = 0;
+
181 current_game.guesses_size = 0;
+
182
+
183 return current_game;
+
184}
+
+
+
+ +

◆ new_guess()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
int new_guess (char new_guess,
const char guesses[],
int size 
)
+
+ +

checks if letter has been guessed before

+
Parameters
+ + + + +
new_guessletter that has been guessed by player
guessesarray of player's previous guesses
sizesize of guesses[] array
+
+
+
Returns
1 if letter has been guessed before
+
+-1 if letter has not been guessed before
+
99 {
+
100
+
101 for (int j = 0; j < size; j++) {
+
102 if (guesses[j] == new_guess) {
+
103 printf("\nYou have already guessed that letter.");
+
104 return 1;
+
105 }
+
106 }
+
107
+
108 return -1;
+
109}
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ picture()

+ +
+
+ + + + + + + + +
void picture (int score)
+
+
206 {
+
207
+
208 switch(score) {
+
209
+
210 case 12:
+
211 printf("\n _\n"
+
212 " __( ' )> \n"
+
213 " \\_ < _ ) ");
+
214 break;
+
215
+
216 case 11:
+
217 printf("\n _\n"
+
218 " __( ' )\n"
+
219 " \\_ < _ ) ");
+
220 break;
+
221
+
222 case 10:
+
223 printf("\n _\n"
+
224 " __( )\n"
+
225 " \\_ < _ ) ");
+
226 break;
+
227
+
228 case 9:
+
229 printf("\n \n"
+
230 " __( )\n"
+
231 " \\_ < _ ) ");
+
232 break;
+
233
+
234 case 8:
+
235 printf("\n \n"
+
236 " __( \n"
+
237 " \\_ < _ ) ");
+
238 break;
+
239
+
240 case 7:
+
241 printf("\n \n"
+
242 " __ \n"
+
243 " \\_ < _ ) ");
+
244 break;
+
245
+
246 case 6:
+
247 printf("\n \n"
+
248 " _ \n"
+
249 " \\_ < _ ) ");
+
250 break;
+
251
+
252 case 5:
+
253 printf("\n \n"
+
254 " _ \n"
+
255 " _ < _ ) ");
+
256 break;
+
257
+
258 case 4:
+
259 printf("\n \n"
+
260 " \n"
+
261 " _ < _ ) ");
+
262 break;
+
263
+
264 case 3:
+
265 printf("\n \n"
+
266 " \n"
+
267 " < _ ) ");
+
268 break;
+
269
+
270 case 2:
+
271 printf("\n \n"
+
272 " \n"
+
273 " _ ) ");
+
274 break;
+
275
+
276 case 1:
+
277 printf("\n \n"
+
278 " \n"
+
279 " ) ");
+
280 break;
+
281
+
282 case 0:
+
283 break;
+
284
+
285 default:
+
286 printf("\n _\n"
+
287 " __( ' )> QUACK!\n"
+
288 " \\_ < _ ) ");
+
289 break;
+
290 }
+
291}
+
+
+
+ +

◆ won()

+ +
+
+ + + + + + + + + + + + + + + + + + +
void won (const char word[],
int score 
)
+
+ +

checks if player has won or lost

+
Parameters
+ + + +
wordthe word player has attempted to guess
scorehow many incorrect guesses player has made
+
+
+
Returns
void
+
192 {
+
193 if (score > 12) {
+
194 printf("\nYou lost! The word was: %s.\n", word);
+
195 }
+
196 else {
+
197 printf("\nYou won! You had %d guesses left.\n", (12 - score));
+
198 }
+
199}
+
+
+
+
+
+ + + + diff --git a/dc/dc5/hangman_8c.js b/dc/dc5/hangman_8c.js new file mode 100644 index 00000000..1ce651bf --- /dev/null +++ b/dc/dc5/hangman_8c.js @@ -0,0 +1,9 @@ +var hangman_8c = +[ + [ "game_instance", "d1/d01/structgame__instance.html", "d1/d01/structgame__instance" ], + [ "in_word", "dc/dc5/hangman_8c.html#a6f5bb35e025e731286ce890c90286d2e", null ], + [ "main", "dc/dc5/hangman_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "new_game", "dc/dc5/hangman_8c.html#ad4130a1d1092d32dcfa4a46019e27d45", null ], + [ "new_guess", "dc/dc5/hangman_8c.html#a9611b43141ac2e6ba245487c493599fc", null ], + [ "won", "dc/dc5/hangman_8c.html#a669e745d87eb1740ab9b1f3b73bb7336", null ] +]; \ No newline at end of file diff --git a/dc/dc5/hangman_8c_a9611b43141ac2e6ba245487c493599fc_cgraph.map b/dc/dc5/hangman_8c_a9611b43141ac2e6ba245487c493599fc_cgraph.map new file mode 100644 index 00000000..1a9e5f95 --- /dev/null +++ b/dc/dc5/hangman_8c_a9611b43141ac2e6ba245487c493599fc_cgraph.map @@ -0,0 +1,3 @@ + + + diff --git a/dc/dc5/hangman_8c_a9611b43141ac2e6ba245487c493599fc_cgraph.md5 b/dc/dc5/hangman_8c_a9611b43141ac2e6ba245487c493599fc_cgraph.md5 new file mode 100644 index 00000000..57a6b5da --- /dev/null +++ b/dc/dc5/hangman_8c_a9611b43141ac2e6ba245487c493599fc_cgraph.md5 @@ -0,0 +1 @@ +65e0a7a4a748e17df6e7b67ef6c97153 \ No newline at end of file diff --git a/dc/dc5/hangman_8c_a9611b43141ac2e6ba245487c493599fc_cgraph.svg b/dc/dc5/hangman_8c_a9611b43141ac2e6ba245487c493599fc_cgraph.svg new file mode 100644 index 00000000..23b805fc --- /dev/null +++ b/dc/dc5/hangman_8c_a9611b43141ac2e6ba245487c493599fc_cgraph.svg @@ -0,0 +1,27 @@ + + + + + + +new_guess + + +Node1 + + +new_guess + + + + + +Node1->Node1 + + + + + diff --git a/dc/dc5/hangman_8c_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/dc/dc5/hangman_8c_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 00000000..878693b0 --- /dev/null +++ b/dc/dc5/hangman_8c_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/dc/dc5/hangman_8c_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/dc/dc5/hangman_8c_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 00000000..143a5bd1 --- /dev/null +++ b/dc/dc5/hangman_8c_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +ca9be80beef69ba766127e67acc95a99 \ No newline at end of file diff --git a/dc/dc5/hangman_8c_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dc/dc5/hangman_8c_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 00000000..0cd2e931 --- /dev/null +++ b/dc/dc5/hangman_8c_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,87 @@ + + + + + + +main + + +Node1 + + +main + + + + + +Node2 + + +in_word + + + + + +Node1->Node2 + + + + + +Node3 + + +new_game + + + + + +Node1->Node3 + + + + + +Node4 + + +new_guess + + + + + +Node1->Node4 + + + + + +Node5 + + +won + + + + + +Node1->Node5 + + + + + +Node4->Node4 + + + + + diff --git a/dir_4b6f782e158b0b98da980a0e11a23a15.html b/dir_4b6f782e158b0b98da980a0e11a23a15.html index b61c9c1f..b2930ae4 100644 --- a/dir_4b6f782e158b0b98da980a0e11a23a15.html +++ b/dir_4b6f782e158b0b98da980a0e11a23a15.html @@ -103,6 +103,9 @@ $(document).ready(function(){initNavTree('dir_4b6f782e158b0b98da980a0e11a23a15.h + + + diff --git a/dir_4b6f782e158b0b98da980a0e11a23a15.js b/dir_4b6f782e158b0b98da980a0e11a23a15.js index 743ed711..5492aa99 100644 --- a/dir_4b6f782e158b0b98da980a0e11a23a15.js +++ b/dir_4b6f782e158b0b98da980a0e11a23a15.js @@ -1,4 +1,5 @@ var dir_4b6f782e158b0b98da980a0e11a23a15 = [ + [ "hangman.c", "dc/dc5/hangman_8c.html", "dc/dc5/hangman_8c" ], [ "naval_battle.c", "db/de2/naval__battle_8c.html", "db/de2/naval__battle_8c" ] ]; \ No newline at end of file diff --git a/files.html b/files.html index c1f65357..921234cc 100644 --- a/files.html +++ b/files.html @@ -179,7 +179,8 @@ $(document).ready(function(){initNavTree('files.html',''); initResizable(); }); - + + diff --git a/functions.html b/functions.html index 4aa158ed..f717bda8 100644 --- a/functions.html +++ b/functions.html @@ -123,6 +123,7 @@ $(document).ready(function(){initNavTree('functions.html',''); initResizable();
  • CSCount : NFA
  • CT : node
  • current : Vector
  • +
  • current_word : game_instance
  • currentStates : NFA
  • @@ -155,17 +156,21 @@ $(document).ready(function(){initNavTree('functions.html',''); initResizable();

    - g -

    - h -

    - i -

    @@ -220,6 +225,7 @@ $(document).ready(function(){initNavTree('functions.html',''); initResizable();

    - s -

    @@ -155,17 +156,21 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl

    - g -

    - h -

    - i -

    @@ -220,6 +225,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl

    - s -

    Files

    file  hangman.c
     C implementation of Hangman Game
     
    file  naval_battle.c
     naval_battle implementation in C using only the stdio.h for Standard Input and Output.
     
      games
      geometry