Compare commits

...
22 Commits
Author SHA1 Message Date
kesidisgi101215 28ad7982e8 merge upstream 2025-10-28 13:42:39 +00:00
Giorgi Kesidis c2166d2314 makefile change 2025-10-28 13:41:24 +01:00
freudenreichan eaa16ed84c Module fehlerhaft übersetzt. 2025-10-28 09:18:39 +00:00
Giorgi Kesidis 00ddc2b389 srand für bessere zufallszahlen 2025-10-27 20:39:19 +01:00
Giorgi Kesidis 6f1a59af0c Fix gross klein 2025-10-27 20:35:05 +01:00
Giorgi Kesidis 63b1ccd0ea fix vom 27.10 2025-10-27 20:07:40 +01:00
Giorgi Kesidis 1e229ad916 27.10 Änderung 2 2025-10-27 19:50:18 +01:00
Giorgi Kesidis a1930fa74e 27.10 änderung nach test 2025-10-27 19:45:25 +01:00
Giorgi Kesidis 12464e4152 Fertigstellung 27.10 2025-10-27 19:25:04 +01:00
Giorgi Kesidis 8269a05749 Fertigstellung 27.10 2025-10-27 19:24:23 +01:00
Giorgi Kesidis 7e8bbea8a8 24.10 Änderung 3 2025-10-24 14:24:56 +02:00
Giorgi Kesidis 2d9fc96112 Änderung 2 vom 24.10 2025-10-24 14:13:05 +02:00
zirnsackja100494 673b381e04 merge upstream 2025-10-24 12:09:35 +00:00
Giorgi Kesidis 2d66437324 input funktion stand 24.10 2025-10-24 13:59:35 +02:00
Giorgi Kesidis 1c919cb6e3 22.10 2025-10-22 00:22:37 +02:00
freudenreichan 32a6133d18 Merge pull request 'extend-unittests' (#3) from schroederen/info2Praktikum-Wortsalat:extend-unittests into main
Reviewed-on: freudenreichan/info2Praktikum-Wortsalat#3
2025-10-21 13:45:46 +00:00
freudenreichan 39e8380916 Merge pull request 'fix-makefiles' (#2) from schroederen/info2Praktikum-Wortsalat:fix-makefiles into main
Reviewed-on: freudenreichan/info2Praktikum-Wortsalat#2
2025-10-21 13:45:24 +00:00
schroederen ffaed665b9 Unittest für das Platzieren aller Wörter hinzugefügt. 2025-10-21 15:24:07 +02:00
schroederen e20bf82c19 Makefile angepasst 2025-10-21 11:45:37 +02:00
schroederen 1ed03a3444 Windows Makefile korrigiert 2025-10-21 11:24:14 +02:00
schroederen 6b435cf82d Fix makefiles. 2025-10-20 14:39:05 +02:00
schroederen 92c0ab2c28 macOS lib Ordner umbenannt (x86_64) 2025-10-16 13:48:45 +02:00
22 changed files with 236 additions and 12 deletions
Binary file not shown.
+3 -3
View File
@@ -1,9 +1,9 @@
CC = gcc CC = gcc
CFLAGS = -g -Wall -I$(raylibfolder) CFLAGS = -g -Wall
LDFLAGS = -lGL -lX11 -lm LDFLAGS = -lGL -lX11 -lm
BINARIES = ./linux BINARIES = ./linux
raylib_folder = ./raylib raylibfolder = ./raylib
unityfolder = ./unity unityfolder = ./unity
# -------------------------- # --------------------------
@@ -28,7 +28,7 @@ game.o: game.c
$(CC) $(CFLAGS) -c game.c $(CC) $(CFLAGS) -c game.c
graphicalGame.o: graphicalGame.c graphicalGame.o: graphicalGame.c
$(CC) $(CFLAGS) -c graphicalGame.c $(CC) $(CFLAGS) -I$(raylibfolder) -c graphicalGame.c
# -------------------------- # --------------------------
# Unit Tests # Unit Tests
+31
View File
@@ -101,7 +101,37 @@ void test_createWordSalad_too_small(void) {
} }
} }
void test_createWordSalad_allWordsPlaced() {
char words[3][MAX_WORD_LEN] = {"CAT", "DOG", "MOUSE"};
char saladHoriz[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN];
char saladVert[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN];
int placed = createWordSalad(saladHoriz, 20, words, 3);
for(int i = 0; i < MAX_SEARCH_FIELD_LEN; i++)
{
for(int j = 0; j < MAX_SEARCH_FIELD_LEN; j++)
{
saladVert[j][i] = saladHoriz[i][j];
}
}
for(int i = 0; i < 3; i++) {
const char* word = words[i];
int wordFound = 0;
for(int j = 0; j < MAX_SEARCH_FIELD_LEN; j++)
{
const char* row = saladHoriz[j];
const char* col = saladVert[j];
wordFound |= strstr(row, word) || strstr(col, word);
}
TEST_ASSERT_TRUE_MESSAGE(wordFound, "Not all words were placed.");
}
TEST_ASSERT_EQUAL_INT(3, placed);
}
// ---------- Test Setup und TearDown Funktionen ---------- // ---------- Test Setup und TearDown Funktionen ----------
// Hier Setup- und TearDown-Funktionen definieren, // Hier Setup- und TearDown-Funktionen definieren,
// falls Vor- und Nachbereitungen für die Tests benötigt. // falls Vor- und Nachbereitungen für die Tests benötigt.
@@ -134,6 +164,7 @@ int main(void) {
RUN_TEST(test_readWords_empty_file); RUN_TEST(test_readWords_empty_file);
RUN_TEST(test_createWordSalad_all_fit); RUN_TEST(test_createWordSalad_all_fit);
RUN_TEST(test_createWordSalad_too_small); RUN_TEST(test_createWordSalad_too_small);
RUN_TEST(test_createWordSalad_allWordsPlaced);
int result = UNITY_END(); // Test-Ergebnisse int result = UNITY_END(); // Test-Ergebnisse
print_test_result(result); print_test_result(result);
+2 -2
View File
@@ -4,7 +4,7 @@ LDFLAGS = -framework OpenGL -framework CoreFoundation -framework CoreGraphics -f
ARCH := $(shell uname -m) ARCH := $(shell uname -m)
BINARIES = ./macos-$(ARCH) BINARIES = ./macos-$(ARCH)
raylib_folder = ./raylib raylibfolder = ./raylib
unityfolder = ./unity unityfolder = ./unity
# -------------------------- # --------------------------
@@ -43,4 +43,4 @@ test: input.o game.o unit_tests.c $(BINARIES)/libunity.a
# Clean # Clean
# -------------------------- # --------------------------
clean: clean:
rm -f *.o wordsalad rm -f *.o wordsalad $(TEST_BIN)
+30
View File
@@ -101,6 +101,35 @@ void test_createWordSalad_too_small(void) {
} }
} }
void test_createWordSalad_allWordsPlaced() {
char words[3][MAX_WORD_LEN] = {"CAT", "DOG", "MOUSE"};
char saladHoriz[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN];
char saladVert[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN];
int placed = createWordSalad(saladHoriz, 20, words, 3);
for(int i = 0; i < MAX_SEARCH_FIELD_LEN; i++)
{
for(int j = 0; j < MAX_SEARCH_FIELD_LEN; j++)
{
saladVert[j][i] = saladHoriz[i][j];
}
}
for(int i = 0; i < 3; i++) {
const char* word = words[i];
int wordFound = 0;
for(int j = 0; j < MAX_SEARCH_FIELD_LEN; j++)
{
const char* row = saladHoriz[j];
const char* col = saladVert[j];
wordFound |= strstr(row, word) || strstr(col, word);
}
TEST_ASSERT_TRUE_MESSAGE(wordFound, "Not all words were placed.");
}
TEST_ASSERT_EQUAL_INT(3, placed);
}
// ---------- Test Setup und TearDown Funktionen ---------- // ---------- Test Setup und TearDown Funktionen ----------
// Hier Setup- und TearDown-Funktionen definieren, // Hier Setup- und TearDown-Funktionen definieren,
@@ -135,6 +164,7 @@ int main(void) {
RUN_TEST(test_readWords_empty_file); RUN_TEST(test_readWords_empty_file);
RUN_TEST(test_createWordSalad_all_fit); RUN_TEST(test_createWordSalad_all_fit);
RUN_TEST(test_createWordSalad_too_small); RUN_TEST(test_createWordSalad_too_small);
RUN_TEST(test_createWordSalad_allWordsPlaced);
int result = UNITY_END(); // Test-Ergebnisse int result = UNITY_END(); // Test-Ergebnisse
print_test_result(result); print_test_result(result);
+101 -4
View File
@@ -6,18 +6,115 @@
#define MAX_RAND_TRIES_PER_WORD 10 #define MAX_RAND_TRIES_PER_WORD 10
#define EMPTY_CHAR 0 #define EMPTY_CHAR 0
//TODO: Spiellogik implementieren: // TODO: Spiellogik implementieren:
/* * Wörter aus der Wortliste zufällig horizontal oder vertikal platzieren /* * Wörter aus der Wortliste zufällig horizontal oder vertikal platzieren
* restliche Felder mit zufälligen Buchstaben füllen */ * restliche Felder mit zufälligen Buchstaben füllen */
// Creates the word salad by placing words randomly and filling empty spaces // Creates the word salad by placing words randomly and filling empty spaces
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)
{ {
Printf("Hello World+1"); srand(time(NULL));
// wipe field
int placedWords = 0;
for (int i = 0; i < searchFieldLen; i++)
{
for (int j = 0; j < searchFieldLen ; j++)
salad[i][j] = EMPTY_CHAR;
}
// place Words
for (int wordNumber = 0; wordNumber < wordCount; wordNumber++)
{
int wordlength = strlen(words[wordNumber]);
int placed = 0;
for (int try = 0; (try < MAX_RAND_TRIES_PER_WORD) && !placed; try++)
{
int horizontal = rand() % 2; // 0 vertikal --> 1 horizontal
int x = rand() % searchFieldLen;
int y = rand() % searchFieldLen;
if (horizontal)
{
if (x + wordlength > searchFieldLen) // word does not fit
{
continue;
}
int fits = 1;
for (int i = 0; i < wordlength; i++) // position already occupied by other word
{
if (salad[y][x + i] != EMPTY_CHAR)
{
fits = 0;
break;
}
}
if (fits)
{
for (int i = 0; i < wordlength; i++)
{
salad[y][x + i] = words[wordNumber][i];
}
placed = 1;
placedWords++;
}
}
else
{
if ((y + wordlength) > searchFieldLen)
{
continue;
}
int fits = 1;
for (int i = 0; i < wordlength; i++) // position already occupied by other word
{
if (salad[y + i][x] != EMPTY_CHAR)
{
fits = 0;
break;
}
}
if (fits)
{
for (int i = 0; i < wordlength; i++)
{
salad[y + i][x] = words[wordNumber][i];
}
placed = 1;
placedWords++;
}
}
}
}
// fill rest with random characters
for (int i = 0; i < searchFieldLen; i++)
{
for (int j = 0; j < searchFieldLen; j++)
{
if (salad[i][j] == EMPTY_CHAR)
{
salad[i][j] = rand() % ('Z' - 'A' + 1) + 'A'; // 90 ist Z in ASCII und A ist 65
}
}
}
return placedWords;
} }
// 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 i = 0; i < searchFieldLen; i++)
{
for (int j = 0; j < searchFieldLen; j++)
{
printf("%c", salad[i][j]);
}
}
} }
Binary file not shown.
Binary file not shown.
+30
View File
@@ -8,5 +8,35 @@
// 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)
{ {
//kein fopen und fclose nötig, weil dies schon in der main passiert und mit *file übergeben wird//
if (file == NULL)
{
perror("Error invalid pointer to file");
return -1;
}
char line[1024];
unsigned int count = 0;
while (fgets(line, sizeof(line), file) && (count < maxWordCount))
{
line[strcspn(line, "\n")] = '\0';
char *token = strtok(line, " ;,");
while (token && (count < maxWordCount))
{
for (int i = 0; token[i] != '\0'; i++)
{
token[i] = toupper(token[i]);
}
strcpy(words[count], token);
count++;
token = strtok(NULL, " ;,");
}
} }
return count;
}
Binary file not shown.
+1 -1
View File
@@ -46,7 +46,7 @@ int main(int argc, char *argv[])
} }
else else
{ {
startGame(wordSalad, SALAD_SIZE, words, placedWords, 800); startGame(wordSalad, SALAD_SIZE, words, placedWords, 1024);
} }
} }
else else
Binary file not shown.
+6
View File
@@ -6,6 +6,12 @@ BINARIES = ./windows
raylibfolder = ./raylib raylibfolder = ./raylib
unityfolder = ./unity unityfolder = ./unity
# --------------------------
# my version
# --------------------------
wordsalad_myversion: main.o graphicalGame.o
$(CC) main.o graphicalGame.o -o wordsalad_myversion $(BINARIES)/libwordsalad.a $(BINARIES)/libraylib.a $(LDFLAGS)
# -------------------------- # --------------------------
# initiales Spiel bauen # initiales Spiel bauen
# -------------------------- # --------------------------
Binary file not shown.
+30
View File
@@ -101,6 +101,35 @@ void test_createWordSalad_too_small(void) {
} }
} }
void test_createWordSalad_allWordsPlaced() {
char words[3][MAX_WORD_LEN] = {"CAT", "DOG", "MOUSE"};
char saladHoriz[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN];
char saladVert[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN];
int placed = createWordSalad(saladHoriz, 20, words, 3);
for(int i = 0; i < MAX_SEARCH_FIELD_LEN; i++)
{
for(int j = 0; j < MAX_SEARCH_FIELD_LEN; j++)
{
saladVert[j][i] = saladHoriz[i][j];
}
}
for(int i = 0; i < 3; i++) {
const char* word = words[i];
int wordFound = 0;
for(int j = 0; j < MAX_SEARCH_FIELD_LEN; j++)
{
const char* row = saladHoriz[j];
const char* col = saladVert[j];
wordFound |= strstr(row, word) || strstr(col, word);
}
TEST_ASSERT_TRUE_MESSAGE(wordFound, "Not all words were placed.");
}
TEST_ASSERT_EQUAL_INT(3, placed);
}
// ---------- Test Setup und TearDown Funktionen ---------- // ---------- Test Setup und TearDown Funktionen ----------
// Hier Setup- und TearDown-Funktionen definieren, // Hier Setup- und TearDown-Funktionen definieren,
@@ -135,6 +164,7 @@ int main(void) {
RUN_TEST(test_readWords_empty_file); RUN_TEST(test_readWords_empty_file);
RUN_TEST(test_createWordSalad_all_fit); RUN_TEST(test_createWordSalad_all_fit);
RUN_TEST(test_createWordSalad_too_small); RUN_TEST(test_createWordSalad_too_small);
RUN_TEST(test_createWordSalad_allWordsPlaced);
int result = UNITY_END(); // Test-Ergebnisse int result = UNITY_END(); // Test-Ergebnisse
print_test_result(result); print_test_result(result);
Binary file not shown.
Binary file not shown.
Binary file not shown.