generated from freudenreichan/info2Praktikum-Wortsalat
Compare commits
6 Commits
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
841e147b9b | ||
|
|
6a3b7700e8 | ||
|
|
c596dc20c3 | ||
|
|
a5d5cf82b6 | ||
|
|
b2118b4c24 | ||
|
|
45fb1f651b |
@ -2,7 +2,6 @@
|
|||||||
#include <time.h>
|
#include <time.h>
|
||||||
#include <stdlib.h>
|
#include <stdlib.h>
|
||||||
#include <string.h>
|
#include <string.h>
|
||||||
#include <ctype.h>
|
|
||||||
|
|
||||||
#define MAX_RAND_TRIES_PER_WORD 10
|
#define MAX_RAND_TRIES_PER_WORD 10
|
||||||
#define EMPTY_CHAR 0
|
#define EMPTY_CHAR 0
|
||||||
@ -15,83 +14,88 @@
|
|||||||
int createWordSalad(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsigned int searchFieldLen, const char words[][MAX_WORD_LEN], unsigned int wordCount)
|
int createWordSalad(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsigned int searchFieldLen, const char words[][MAX_WORD_LEN], unsigned int wordCount)
|
||||||
{
|
{
|
||||||
srand(time(NULL));
|
srand(time(NULL));
|
||||||
int placedWords = 0;
|
|
||||||
|
|
||||||
// Array mit . füllen
|
int placedWords = 0;
|
||||||
for (int r = 0; r < searchFieldLen; r++){
|
unsigned int tries = 0;
|
||||||
for(int s = 0; s < searchFieldLen; s++){
|
unsigned int check_direction = 0, check_overlap = 0;
|
||||||
salad[r][s] = '.';
|
int zeile = 0, spalte = 0, len = 0;
|
||||||
|
|
||||||
|
//1. Schritt: Alle Felder mit 0 befüllen
|
||||||
|
for(int m = 0; m < searchFieldLen; m++) //m Zeilen
|
||||||
|
{
|
||||||
|
for(int n = 0; n < searchFieldLen; n++) //n Spalte
|
||||||
|
{
|
||||||
|
salad[m][n] = 0;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
// -> erst wenn die ganze Länge des Wortes frei ist, array hinzufügen
|
// 2. Schritt: Prüfen ob Wort in Array geschrieben darf
|
||||||
// MAX Versuche das Wort zu platzieren == 10
|
for(int num_words = 0; num_words < wordCount && num_words < searchFieldLen; num_words++) //eingelesen Wörter zählen
|
||||||
|
{
|
||||||
|
len = strlen(words[num_words]); //Größe des Wortes ermitteln
|
||||||
|
|
||||||
// Wörter in salad einsortieren
|
if (len < searchFieldLen)
|
||||||
for (int num_words = 0; num_words < wordCount; num_words++){
|
return -1; //ERROR, falls Wort größer als Größe des Feldes (unnötig, da bei worteingabe bereits überprüft)
|
||||||
|
|
||||||
int laenge = strlen(words[num_words]);
|
|
||||||
|
|
||||||
// muss noch prüfen, ob in der Zeile schon was ist
|
|
||||||
// 1 ist horizontal, 0 ist vertikal
|
|
||||||
// isalpha == 0 -> kein Buchstabe
|
|
||||||
|
|
||||||
for(int versuch = 0; versuch < MAX_RAND_TRIES_PER_WORD; versuch++){
|
while(tries < MAX_RAND_TRIES_PER_WORD)
|
||||||
int richtung = rand()% 2;
|
{
|
||||||
int belegt = 0;
|
// zufällige Richtung auswählen
|
||||||
|
int direction = rand() % 2; // 0 = VERTIKAL, 1 = HORIZONTAL
|
||||||
|
|
||||||
|
// zufälliger Startpunkt, Startkoordinaten
|
||||||
|
if (direction == 0) // 0 = VERTIKAL -> Spalte egal
|
||||||
|
{
|
||||||
|
zeile = rand() % (searchFieldLen - len);
|
||||||
|
spalte = rand() % (searchFieldLen);
|
||||||
|
check_direction = 1;
|
||||||
|
}
|
||||||
|
|
||||||
// horizontale Eingabe
|
if (direction == 1) // 1 = HORIZONTAL -> Zeile egal
|
||||||
if (richtung == 1){
|
{
|
||||||
int zeile = rand()% searchFieldLen;
|
zeile = rand() % (searchFieldLen);
|
||||||
int spalte = rand()% (searchFieldLen- laenge +1);
|
spalte = rand() % (searchFieldLen - len);
|
||||||
|
check_direction = 1;
|
||||||
//prüft, ob die herausgesuchte Zeile noch frei ist
|
}
|
||||||
// belegt == 1 -> Zeile nicht frei
|
|
||||||
for (int o = spalte; o < spalte + laenge; o++){
|
//Prüfen auf Überlappung ----------> Logikfehler
|
||||||
if(salad[zeile][o] != '.'){
|
for(int i_overlap = 0; i_overlap < len; i_overlap++)
|
||||||
belegt = 1;
|
{
|
||||||
break;
|
if (direction == 0) // 0 = VERTIKAL
|
||||||
|
{
|
||||||
|
if (words[num_words][i_overlap] == salad[zeile][spalte + i_overlap]);
|
||||||
|
check_overlap = 1;
|
||||||
|
}
|
||||||
|
else if (direction == 1) // 1 = HORIZONTAL
|
||||||
|
{
|
||||||
|
if (words[num_words][i_overlap] == salad[zeile + i_overlap][spalte]);
|
||||||
|
check_overlap = 1;
|
||||||
|
}
|
||||||
|
if(check_overlap == 0)
|
||||||
|
{
|
||||||
|
tries++;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
//3. Schritt: Wort in Wortsalat schreiben
|
||||||
|
if(check_direction == 1 && check_overlap == 1 && tries < MAX_RAND_TRIES_PER_WORD)
|
||||||
|
{
|
||||||
|
for(int i_set = 0; i_set < len; i_set++)
|
||||||
|
{
|
||||||
|
if (direction == 0) // 0 = VERTIKAL
|
||||||
|
{
|
||||||
|
salad[zeile + i_set][spalte] = words[num_words][i_set];
|
||||||
|
placedWords++;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (direction == 1) // 1 = HORIZONTAL
|
||||||
|
{
|
||||||
|
salad[zeile][spalte + i_set] = words[num_words][i_set];
|
||||||
|
placedWords++;
|
||||||
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
// setzt in das Array ein, wenn frei oder erhöht die Versuchsanzahl
|
|
||||||
if (belegt == 0){
|
|
||||||
for(int k = 0; k < laenge; k++){
|
|
||||||
salad[zeile][spalte + k] = words[num_words][k];
|
|
||||||
|
|
||||||
}
|
|
||||||
placedWords++;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
// vertikale Eingabe
|
|
||||||
else if (richtung == 0){
|
|
||||||
|
|
||||||
int zeile = rand()% (searchFieldLen - laenge +1);
|
|
||||||
int spalte = rand()% searchFieldLen;
|
|
||||||
|
|
||||||
//prüft, ob die herausgesuchte Zeile noch frei ist
|
|
||||||
for (int n = zeile; n < zeile + laenge; n++){
|
|
||||||
if(salad[n][spalte] != '.'){
|
|
||||||
belegt = 1;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
// setzt in das Array ein, wenn frei oder erhöht die Versuchsanzahl
|
|
||||||
if (belegt == 0){
|
|
||||||
for(int j = 0; j < laenge; j++){
|
|
||||||
salad[zeile + j][spalte] = words[num_words][j];
|
|
||||||
|
|
||||||
}
|
|
||||||
placedWords++;
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
else{
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
|
|
||||||
}
|
}
|
||||||
|
|
||||||
// fügt zufällige Buchstaben ein
|
// fügt zufällige Buchstaben ein
|
||||||
@ -99,7 +103,7 @@ int createWordSalad(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsi
|
|||||||
for(int m = 0; m < searchFieldLen; m++ ){
|
for(int m = 0; m < searchFieldLen; m++ ){
|
||||||
if(isalpha(salad[l][m]) == 0 ){
|
if(isalpha(salad[l][m]) == 0 ){
|
||||||
// zufällige Buchstaben erzeugen
|
// zufällige Buchstaben erzeugen
|
||||||
char alphabet [] = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
|
char alphabet [] = "abcdefghijklmnopqrstuvwxyz";
|
||||||
int laenge = strlen(alphabet);
|
int laenge = strlen(alphabet);
|
||||||
int zufallszahl = rand()% laenge;
|
int zufallszahl = rand()% laenge;
|
||||||
char zufallsbuchstabe = alphabet[zufallszahl];
|
char zufallsbuchstabe = alphabet[zufallszahl];
|
||||||
@ -108,17 +112,20 @@ int createWordSalad(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsi
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
return placedWords;
|
return placedWords; //platzierte Wörter zurückgeben
|
||||||
}
|
}
|
||||||
|
|
||||||
// Prints the word salad to console
|
// Prints the word salad to console
|
||||||
void showWordSalad(const char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsigned int searchFieldLen)
|
void showWordSalad(const char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsigned int searchFieldLen)
|
||||||
{
|
{
|
||||||
for(int p = 0; p < searchFieldLen; p++){
|
for(int p = 0; p < searchFieldLen; p++)
|
||||||
for(int q = 0; q < searchFieldLen; q++){
|
{
|
||||||
|
for(int q = 0; q < searchFieldLen; q++)
|
||||||
|
{
|
||||||
printf("%c", salad[p][q]);
|
printf("%c", salad[p][q]);
|
||||||
}
|
}
|
||||||
printf("\n");
|
printf("\n");
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|||||||
Binary file not shown.
@ -8,28 +8,37 @@
|
|||||||
// Read words from file and store in 'words' array
|
// Read words from file and store in 'words' array
|
||||||
int readWords(FILE *file, char words[][MAX_WORD_LEN], unsigned int maxWordCount)
|
int readWords(FILE *file, char words[][MAX_WORD_LEN], unsigned int maxWordCount)
|
||||||
{
|
{
|
||||||
char puffer[MAX_LINE_LEN]; //Array für eingelesene Zeile
|
// MAX_WORD_LEN 100
|
||||||
int counter = 0; //Zähler für Anzahl eingelesener Wörter
|
// MAX_LINE_LEN 1024
|
||||||
int i;
|
// *file ist Datei
|
||||||
|
// words ist Array
|
||||||
|
// MAX_WORD_LEN ist maximale Wortlänge
|
||||||
|
// maxWordCount ist maximale Anzahl an Wörtern
|
||||||
|
char puffer[MAX_LINE_LEN];
|
||||||
|
int counter = 0;
|
||||||
|
|
||||||
while(fgets(puffer, MAX_LINE_LEN-1, file) != NULL && counter < maxWordCount)
|
while(fgets(puffer, MAX_LINE_LEN-1, file) != NULL && counter < maxWordCount)
|
||||||
{
|
{
|
||||||
char *word_parts = strtok(puffer, ",;\n\t/. "); //Wörter aufteilen
|
char *parts = strtok(puffer, ",;\n\t/. ");
|
||||||
|
|
||||||
while(word_parts != NULL && counter < maxWordCount)
|
while(parts != NULL && counter < maxWordCount)
|
||||||
{
|
{
|
||||||
// Kopiere das Wort in words-Array
|
//strncpy(words[counter][MAX_WORD_LEN], puffer, MAX_LINE_LEN-1);
|
||||||
strncpy(words[counter], word_parts, MAX_WORD_LEN - 1);
|
//words[counter][MAX_WORD_LEN-1] = "\0";
|
||||||
words[counter][MAX_WORD_LEN - 1] = '\0';
|
//Großbuchstaben
|
||||||
|
for(int i = 0; i < MAX_WORD_LEN -1 && parts[i] != '\0'; i++)
|
||||||
// Alles in Großbuchstaben umwandeln
|
{
|
||||||
for(i = 0; words[counter][i] != '\0'; i++)
|
words[counter][i] = toupper(parts[i]);
|
||||||
{
|
words[counter][i] = '\0';
|
||||||
words[counter][i] = toupper(words[counter][i]);
|
}
|
||||||
}
|
|
||||||
counter++; // Wort eingelesen, Wortzähler erhöhen
|
|
||||||
word_parts = strtok(NULL, ",;\n\t/. "); //NULL für Zeiger angeben
|
|
||||||
}
|
}
|
||||||
|
counter++; // Wort eingelesen -> Wortzähler erhöhen
|
||||||
|
parts = strtok(NULL, ",;\n\t/. ");
|
||||||
|
|
||||||
}
|
}
|
||||||
return counter;
|
return counter;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
//TODO: Wörter auf Zahlen, Umlaute überprüfen -> ändern
|
||||||
Binary file not shown.
@ -40,15 +40,9 @@ int main(int argc, char *argv[])
|
|||||||
// Check if all words were successfully placed
|
// Check if all words were successfully placed
|
||||||
// Start the game if successful
|
// Start the game if successful
|
||||||
// error message if some words couldn't be placed
|
// error message if some words couldn't be placed
|
||||||
if (placedWords == wordCount){
|
|
||||||
startGame(wordSalad,SALAD_SIZE,words, wordCount,750);
|
// wordcount mit placedwords vergleichen
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
printf("Error. The words couldn't be placed.\n");
|
|
||||||
return -1;
|
|
||||||
}
|
|
||||||
|
|
||||||
}
|
}
|
||||||
else
|
else
|
||||||
{
|
{
|
||||||
|
|||||||
@ -33,17 +33,19 @@ graphicalGame.o: graphicalGame.c
|
|||||||
# --------------------------
|
# --------------------------
|
||||||
# Unit Tests
|
# Unit Tests
|
||||||
# --------------------------
|
# --------------------------
|
||||||
TEST_BIN = runTests2
|
TEST_BIN = runTests
|
||||||
|
|
||||||
test: input.o game.o unit_tests.c
|
test: input.o game.o unit_tests.c
|
||||||
$(CC) $(CFLAGS) -I$(unityfolder) -o $(TEST_BIN) input.o game.o unit_tests.c $(BINARIES)/libunity.a
|
$(CC) $(CFLAGS) -I$(unityfolder) -o $(TEST_BIN) input.o game.o unit_tests.c $(BINARIES)/libunity.a
|
||||||
|
|
||||||
|
|
||||||
# --------------------------
|
# --------------------------
|
||||||
# Clean
|
# Clean
|
||||||
# --------------------------
|
# --------------------------
|
||||||
clean:
|
clean:
|
||||||
del /f *.o *.exe
|
del /f *.o *.exe
|
||||||
|
|
||||||
#hier eigene wordsalad kopieren, library rauslassen
|
#hier eigene wordsalad kopieren, library rauslassen
|
||||||
|
|
||||||
wordsalad_myversion: main.o input.o game.o graphicalGame.o
|
wordsalad_myversion: main.o input.o game.o graphicalGame.o $(BINARIES)/libwordsalad.a
|
||||||
$(CC) $(CFLAGS) -o wordsalad main.o input.o game.o graphicalGame.o $(BINARIES)/libraylib.a $(LDFLAGS)
|
$(CC) $(CFLAGS) -o wordsalad_myversion main.o input.o game.o graphicalGame.o $(BINARIES)/libwordsalad.a $(LDFLAGS)
|
||||||
Binary file not shown.
@ -1 +0,0 @@
|
|||||||
Hund,Katze; Maus
|
|
||||||
@ -1,3 +0,0 @@
|
|||||||
Apfel
|
|
||||||
Banane
|
|
||||||
Kiwi
|
|
||||||
BIN
Start_Windows/unity/unity.o
Normal file
BIN
Start_Windows/unity/unity.o
Normal file
Binary file not shown.
Binary file not shown.
Binary file not shown.
Loading…
x
Reference in New Issue
Block a user