generated from freudenreichan/info2Praktikum-Wortsalat
Compare commits
No commits in common. "main" and "Silvana" have entirely different histories.
@ -8,13 +8,24 @@
|
|||||||
#define EMPTY_CHAR 0
|
#define EMPTY_CHAR 0
|
||||||
#define MAX_NUMBER_OF_WORDS 100
|
#define MAX_NUMBER_OF_WORDS 100
|
||||||
|
|
||||||
|
//TODO: Spiellogik implementieren:
|
||||||
|
/* * Wörter aus der Wortliste zufällig horizontal oder vertikal platzieren
|
||||||
|
* restliche Felder mit zufälligen Buchstaben füllen */
|
||||||
|
|
||||||
|
//words und salad sind char arrays --> laengstes wort sind 100 zeichen
|
||||||
|
|
||||||
|
// 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)
|
||||||
{
|
{
|
||||||
int placedWords = 0;
|
int placedWords = 0;
|
||||||
srand(time(NULL));
|
srand(time(NULL));
|
||||||
|
|
||||||
|
int usedWords[MAX_NUMBER_OF_WORDS];
|
||||||
|
for(int i=0; i< MAX_NUMBER_OF_WORDS; i++){
|
||||||
|
usedWords[i] = -1;
|
||||||
|
}
|
||||||
|
|
||||||
placedWords = fillSalad(salad, searchFieldLen, words, wordCount);
|
placedWords = fillSalad(salad, searchFieldLen, words, wordCount, usedWords);
|
||||||
showWordSalad(salad);
|
showWordSalad(salad);
|
||||||
printf("\nPlacedWords: %d\n", placedWords);
|
printf("\nPlacedWords: %d\n", placedWords);
|
||||||
return placedWords;
|
return placedWords;
|
||||||
@ -54,10 +65,10 @@ int emptyPlaces(unsigned int wordCount)
|
|||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
int fillSalad(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsigned int searchFieldLen, const char words[][MAX_WORD_LEN], unsigned int wordCount)
|
// fills salad array with max. words from word array either horizontally or vertically
|
||||||
|
int fillSalad(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsigned int searchFieldLen, const char words[][MAX_WORD_LEN], unsigned int wordCount, int usedWords[MAX_NUMBER_OF_WORDS])
|
||||||
{
|
{
|
||||||
int addedWords = 0;
|
int addedWords = 0;
|
||||||
|
|
||||||
// empties salad
|
// empties salad
|
||||||
for(unsigned int i = 0; i < MAX_SEARCH_FIELD_LEN; i++) {
|
for(unsigned int i = 0; i < MAX_SEARCH_FIELD_LEN; i++) {
|
||||||
for(unsigned int j = 0; j < MAX_SEARCH_FIELD_LEN; j++) {
|
for(unsigned int j = 0; j < MAX_SEARCH_FIELD_LEN; j++) {
|
||||||
@ -66,30 +77,35 @@ int fillSalad(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsigned i
|
|||||||
}
|
}
|
||||||
|
|
||||||
// inserts words
|
// inserts words
|
||||||
for(unsigned int w = 0; w < wordCount; w++) { //geht words array linear durch, damit jedes Wort ueberprueft wird
|
for(unsigned int w = 0; w < wordCount; w++) {
|
||||||
int tries = 0;
|
int tries = 0;
|
||||||
int placed = 0;
|
int placed = 0;
|
||||||
|
|
||||||
while(tries < MAX_RAND_TRIES_PER_WORD && !placed) { //solange die max. Anzahl an Versuchen pro Wort nicht ueberschritten wird und das Wort nicht plaziert wurde:
|
while(tries < MAX_RAND_TRIES_PER_WORD && !placed) {
|
||||||
int horizontal = printHorizontal(); //horozontal oder vertikal?
|
int numWord = whichWord(wordCount, usedWords);
|
||||||
|
if(numWord == -5) {
|
||||||
|
// found no unused word
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
|
||||||
|
int horizontal = printHorizontal();
|
||||||
|
|
||||||
if(horizontal) {
|
if(horizontal) {
|
||||||
int row = rand() % searchFieldLen; //sucht random row aus
|
int row = rand() % searchFieldLen;
|
||||||
unsigned int wordLen = strlen(words[w]);
|
// checks if words fits
|
||||||
if(wordLen <= searchFieldLen) { //wenn wort von der Laenge her in Zeile passt
|
unsigned int wordLen = strlen(words[numWord]);
|
||||||
int startCol = rand() % (searchFieldLen - wordLen + 1); //bestimmt einen zufaelligen Startpunkt in der row zhwischen 0 und max. Index, damit das WOrt noch passt
|
if(wordLen <= searchFieldLen) {
|
||||||
|
int startCol = rand() % (searchFieldLen - wordLen + 1);
|
||||||
int canPlace = 1;
|
int canPlace = 1;
|
||||||
for(unsigned int i = 0; i < wordLen; i++) { //schaut, ob der Platz in jeder Zelle in salad frei ist oder ob Ueberlappung zweier Woerter moeglich ist
|
for(unsigned int i = 0; i < wordLen; i++) { //checks if word fits
|
||||||
if(salad[row][startCol + i] != '\0') {
|
if(salad[row][startCol + i] != '\0') {
|
||||||
if(salad[row][startCol + i] != words[w][i]) {
|
canPlace = 0;
|
||||||
canPlace = 0;
|
break;
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
if(canPlace) { //Wort kann plaziert werden -> fuellt Wort in random row ab random Zelle mit Wort und addiert erfolgreich plazierte Woerter
|
if(canPlace) { //word fits and is inserted
|
||||||
for(unsigned int i = 0; i < wordLen; i++) {
|
for(unsigned int i = 0; i < wordLen; i++) {
|
||||||
salad[row][startCol + i] = words[w][i];
|
salad[row][startCol + i] = words[numWord][i];
|
||||||
}
|
}
|
||||||
placed = 1;
|
placed = 1;
|
||||||
addedWords++;
|
addedWords++;
|
||||||
@ -98,21 +114,19 @@ int fillSalad(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsigned i
|
|||||||
} else {
|
} else {
|
||||||
// vertically
|
// vertically
|
||||||
int col = rand() % searchFieldLen;
|
int col = rand() % searchFieldLen;
|
||||||
unsigned int wordLen = strlen(words[w]);
|
unsigned int wordLen = strlen(words[numWord]);
|
||||||
if(wordLen <= searchFieldLen) {
|
if(wordLen <= searchFieldLen) {
|
||||||
int startRow = rand() % (searchFieldLen - wordLen + 1);
|
int startRow = rand() % (searchFieldLen - wordLen + 1);
|
||||||
int canPlace = 1;
|
int canPlace = 1;
|
||||||
for(unsigned int i = 0; i < wordLen; i++) {
|
for(unsigned int i = 0; i < wordLen; i++) {
|
||||||
if(salad[startRow + i][col] != '\0') {
|
if(salad[startRow + i][col] != '\0') {
|
||||||
if(salad[startRow + i][col] != words[w][i]) {
|
canPlace = 0;
|
||||||
canPlace = 0;
|
break;
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
if(canPlace) {
|
if(canPlace) {
|
||||||
for(unsigned int i = 0; i < wordLen; i++) {
|
for(unsigned int i = 0; i < wordLen; i++) {
|
||||||
salad[startRow + i][col] = words[w][i];
|
salad[startRow + i][col] = words[numWord][i];
|
||||||
}
|
}
|
||||||
placed = 1;
|
placed = 1;
|
||||||
addedWords++;
|
addedWords++;
|
||||||
@ -123,12 +137,98 @@ int fillSalad(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsigned i
|
|||||||
tries++;
|
tries++;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
fillRandom(salad);
|
fillRandom(salad);
|
||||||
return addedWords;
|
return addedWords;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
|
int whichWord(unsigned int wordCount, int usedWords[MAX_NUMBER_OF_WORDS])
|
||||||
|
{
|
||||||
|
int tries = 0;
|
||||||
|
|
||||||
|
while(tries < MAX_RAND_TRIES_PER_WORD) {
|
||||||
|
int numWord = rand() % wordCount; // 0..wordCount-1
|
||||||
|
|
||||||
|
int alreadyUsed = 0;
|
||||||
|
for(int f = 0; f < MAX_NUMBER_OF_WORDS; f++){
|
||||||
|
if(usedWords[f] == numWord){
|
||||||
|
alreadyUsed = 1;
|
||||||
|
break; // word already used
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
if(!alreadyUsed){
|
||||||
|
// Eintragen in usedWords
|
||||||
|
for(int f = 0; f < MAX_NUMBER_OF_WORDS; f++){
|
||||||
|
if(usedWords[f] == -1){ // unused
|
||||||
|
usedWords[f] = numWord;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return numWord; // unused row found
|
||||||
|
}
|
||||||
|
|
||||||
|
tries++;
|
||||||
|
}
|
||||||
|
|
||||||
|
return -5;
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
//Fills word in salad and deletes row of words of the used word
|
||||||
|
void fillWordinRow(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN],unsigned int searchFieldLen,const char words[][MAX_WORD_LEN], int numWord,int row)
|
||||||
|
{
|
||||||
|
unsigned int wordLen = strlen(words[numWord]);
|
||||||
|
|
||||||
|
// Returns if word longer than game field
|
||||||
|
if (wordLen > searchFieldLen || wordLen == 0)
|
||||||
|
return;
|
||||||
|
|
||||||
|
// Determines random starting point in the row to place word
|
||||||
|
int startCol = rand() % (searchFieldLen - wordLen + 1);
|
||||||
|
|
||||||
|
// Determines wether word fits
|
||||||
|
for (unsigned int i = 0; i < wordLen; i++)
|
||||||
|
{
|
||||||
|
if (salad[row][startCol + i] != '\0')
|
||||||
|
{
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
for (unsigned int i = 0; i < wordLen; i++)
|
||||||
|
{
|
||||||
|
salad[row][startCol + i] = words[numWord][i];
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
//Fills word in salad and deletes row of words of the used word, vertical from top to bottom
|
||||||
|
void fillWordinColumn(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsigned int searchFieldLen, const char words[][MAX_WORD_LEN], int numWord, int column)
|
||||||
|
{
|
||||||
|
unsigned int wordLen = strlen(words[numWord]);
|
||||||
|
|
||||||
|
if (wordLen > searchFieldLen || wordLen == 0)
|
||||||
|
return;
|
||||||
|
|
||||||
|
int startRow = rand() % (searchFieldLen - wordLen + 1);
|
||||||
|
|
||||||
|
for (unsigned int i = 0; i < wordLen; i++)
|
||||||
|
{
|
||||||
|
if (salad[startRow + i][column] != '\0')
|
||||||
|
{
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
for (unsigned int i = 0; i < wordLen; i++)
|
||||||
|
{
|
||||||
|
salad[startRow + i][column] = words[numWord][i];
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
// if emptyPlaces, fill these with random letters
|
// if emptyPlaces, fill these with random letters
|
||||||
void fillRandom(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN]) {
|
void fillRandom(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN]) {
|
||||||
for (int j = 0; j < MAX_SEARCH_FIELD_LEN; j++) {
|
for (int j = 0; j < MAX_SEARCH_FIELD_LEN; j++) {
|
||||||
@ -140,4 +240,3 @@ void fillRandom(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN]) {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|||||||
@ -10,7 +10,10 @@ int createWordSalad(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsi
|
|||||||
void showWordSalad(const char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN]);
|
void showWordSalad(const char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN]);
|
||||||
int printHorizontal();
|
int printHorizontal();
|
||||||
int emptyPlaces(unsigned int wordCount);
|
int emptyPlaces(unsigned int wordCount);
|
||||||
int fillSalad(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsigned int searchFieldLen, const char words[][MAX_WORD_LEN], unsigned int wordCount);
|
int fillSalad(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsigned int searchFieldLen, const char words[][MAX_WORD_LEN], unsigned int wordCount, int usedWords[MAX_NUMBER_OF_WORDS]);
|
||||||
|
int whichWord(unsigned int wordCount, int usedWords[MAX_NUMBER_OF_WORDS]);
|
||||||
|
void fillWordinRow(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsigned int searchFieldLen, const char words[][MAX_WORD_LEN], int numWord, int row);
|
||||||
|
void fillWordinColumn(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsigned int searchFieldLen, const char words[][MAX_WORD_LEN], int numWord, int column);
|
||||||
void fillRandom(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN]);
|
void fillRandom(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN]);
|
||||||
|
|
||||||
|
|
||||||
|
|||||||
@ -2,122 +2,11 @@
|
|||||||
#include <string.h>
|
#include <string.h>
|
||||||
#include <ctype.h>
|
#include <ctype.h>
|
||||||
|
|
||||||
/*
|
// TODO:
|
||||||
* ------------------------------------------------------------
|
// eine Funktion implementieren, die ein einzelnes Wort aus einer Textdatei (words.txt) einliest und als C-String zurückgibt.
|
||||||
* HILFSFUNKTION:
|
|
||||||
* Liest genau EIN Wort aus einer Datei und speichert es in 'buffer'.
|
|
||||||
*
|
|
||||||
* - Trennt Wörter anhand von Komma, Semikolon oder Leerzeichen.
|
|
||||||
* - Wandelt alle Buchstaben in GROSSBUCHSTABEN um (damit Tests passen).
|
|
||||||
* - Gibt 1 zurück, wenn ein Wort gefunden wurde.
|
|
||||||
* - Gibt 0 zurück, wenn nichts mehr zu lesen ist (EOF oder Fehler).
|
|
||||||
* ------------------------------------------------------------
|
|
||||||
*/
|
|
||||||
static int readSingleWord(FILE *file, char *buffer, size_t bufferSize)
|
|
||||||
{
|
|
||||||
int c; // aktuelles Zeichen aus der Datei
|
|
||||||
size_t len = 0; // Anzahl der bisher eingelesenen Zeichen im aktuellen Wort
|
|
||||||
|
|
||||||
// --- Sicherheitsprüfung: Sind die Übergabeparameter gültig? ---
|
// Read words from file and store in 'words' array
|
||||||
if (file == NULL || buffer == NULL || bufferSize == 0)
|
|
||||||
{
|
|
||||||
return 0; // nichts tun, wenn Datei oder Speicher ungültig ist
|
|
||||||
}
|
|
||||||
|
|
||||||
// --- 1. Führende Trennzeichen überspringen ---
|
|
||||||
// Solange Kommas, Semikolons oder Leerzeichen kommen, einfach weiter lesen.
|
|
||||||
// Erst wenn ein anderes Zeichen kommt, fängt das Wort an.
|
|
||||||
while ((c = fgetc(file)) != EOF)
|
|
||||||
{
|
|
||||||
if (c == ',' || c == ';' || isspace((unsigned char)c))
|
|
||||||
{
|
|
||||||
continue; // noch kein Buchstabe -> weiter zum nächsten Zeichen
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
break; // erstes Nicht-Trennzeichen gefunden -> Wort beginnt hier
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// --- 2. Falls direkt EOF (End of File) erreicht wurde, kein Wort mehr vorhanden ---
|
|
||||||
if (c == EOF)
|
|
||||||
{
|
|
||||||
return 0;
|
|
||||||
}
|
|
||||||
|
|
||||||
// --- 3. Erstes Zeichen des Wortes in den Buffer schreiben ---
|
|
||||||
// Dabei gleich in Großbuchstaben umwandeln
|
|
||||||
char upperChar = (char) toupper((unsigned char) c);
|
|
||||||
buffer[len++] = upperChar;
|
|
||||||
|
|
||||||
// --- 4. Rest des Wortes lesen, bis ein Trennzeichen oder das Dateiende erreicht ist ---
|
|
||||||
while ((c = fgetc(file)) != EOF)
|
|
||||||
{
|
|
||||||
// Wenn Komma, Semikolon oder Leerzeichen -> Wort ist zu Ende
|
|
||||||
if (c == ',' || c == ';' || isspace((unsigned char)c))
|
|
||||||
{
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Nur schreiben, solange noch Platz im Buffer ist (letztes Zeichen für '\0' reservieren!)
|
|
||||||
if (len < bufferSize - 1)
|
|
||||||
{
|
|
||||||
upperChar = (char) toupper((unsigned char) c); // Zeichen in Großbuchstaben
|
|
||||||
buffer[len++] = upperChar; // Zeichen im Buffer speichern
|
|
||||||
}
|
|
||||||
// Wenn kein Platz mehr, restliche Zeichen ignorieren (Vermeidung von Speicherfehlern)
|
|
||||||
}
|
|
||||||
|
|
||||||
// --- 5. String beenden ---
|
|
||||||
buffer[len] = '\0'; // Nullterminator am Ende -> macht aus dem Array einen C-String
|
|
||||||
|
|
||||||
// --- 6. Erfolg melden ---
|
|
||||||
return 1; // 1 = Wort erfolgreich eingelesen
|
|
||||||
}
|
|
||||||
|
|
||||||
/*
|
|
||||||
* ------------------------------------------------------------
|
|
||||||
* HAUPTFUNKTION:
|
|
||||||
* Liest ALLE Wörter aus einer Datei und speichert sie in 'words'.
|
|
||||||
*
|
|
||||||
* - Ruft die Hilfsfunktion 'readSingleWord()' mehrfach auf,
|
|
||||||
* um ein Wort nach dem anderen zu lesen.
|
|
||||||
* - Kopiert jedes gefundene Wort in das große 'words'-Array.
|
|
||||||
* - Zählt, wie viele Wörter tatsächlich gefunden wurden.
|
|
||||||
* ------------------------------------------------------------
|
|
||||||
*/
|
|
||||||
int readWords(FILE *file, char words[][MAX_WORD_LEN], unsigned int maxWordCount)
|
int readWords(FILE *file, char words[][MAX_WORD_LEN], unsigned int maxWordCount)
|
||||||
{
|
{
|
||||||
unsigned int count = 0; // zählt, wie viele Wörter gefunden wurden
|
return 0;
|
||||||
char buffer[MAX_WORD_LEN]; // Zwischenspeicher für EIN Wort (kommt aus der Hilfsfunktion)
|
|
||||||
|
|
||||||
// --- Sicherheitsprüfung ---
|
|
||||||
// Datei darf nicht NULL sein, das Array muss existieren, und es muss Platz vorhanden sein.
|
|
||||||
if (file == NULL || words == NULL || maxWordCount == 0)
|
|
||||||
{
|
|
||||||
return 0; // ungültige Eingaben -> keine Wörter gelesen
|
|
||||||
}
|
|
||||||
|
|
||||||
// --- Hauptschleife ---
|
|
||||||
// Solange:
|
|
||||||
// - noch Platz im 'words'-Array ist (count < maxWordCount)
|
|
||||||
// - UND readSingleWord() ein neues Wort liefern kann
|
|
||||||
while (count < maxWordCount && readSingleWord(file, buffer, sizeof(buffer)))
|
|
||||||
{
|
|
||||||
// --- 1. Wort aus dem Buffer ins große Array kopieren ---
|
|
||||||
// strcpy wäre unsicher -> strncpy schützt vor Überlauf
|
|
||||||
strncpy(words[count], buffer, MAX_WORD_LEN);
|
|
||||||
|
|
||||||
// --- 2. Sicherstellen, dass das Wort immer korrekt endet ---
|
|
||||||
// Wenn das Wort genau MAX_WORD_LEN Zeichen lang war,
|
|
||||||
// könnte der '\0' durch strncpy fehlen -> hier wird er garantiert gesetzt.
|
|
||||||
words[count][MAX_WORD_LEN - 1] = '\0';
|
|
||||||
|
|
||||||
// --- 3. Zähler erhöhen -> nächstes Wort kommt in words[count+1] ---
|
|
||||||
count++;
|
|
||||||
}
|
|
||||||
|
|
||||||
// --- Schleife beendet: entweder kein Wort mehr oder Array ist voll ---
|
|
||||||
// Rückgabe: Anzahl der tatsächlich eingelesenen Wörter
|
|
||||||
return count;
|
|
||||||
}
|
}
|
||||||
Binary file not shown.
@ -36,16 +36,17 @@ int main(int argc, char *argv[])
|
|||||||
// Create the word salad by placing words into grid
|
// Create the word salad by placing words into grid
|
||||||
placedWords = createWordSalad(wordSalad, SALAD_SIZE, words, wordCount);
|
placedWords = createWordSalad(wordSalad, SALAD_SIZE, words, wordCount);
|
||||||
|
|
||||||
|
// TODO:
|
||||||
// Check if all words were successfully placed
|
// Check if all words were successfully placed
|
||||||
if (placedWords != 0)
|
// Start the game if successful
|
||||||
{
|
// error message if some words couldn't be placed
|
||||||
// Start the game if successful
|
|
||||||
startGame(wordSalad, SALAD_SIZE, words, wordCount,800);
|
}
|
||||||
}
|
else
|
||||||
else
|
{
|
||||||
{
|
// Print error message if file couldn't be opened
|
||||||
fprintf(stderr, "Warning: Only %u out of %u words could be placed.\n", placedWords, wordCount);
|
fprintf(stderr, "Could not open file %s for reading ...\n", argv[1]);
|
||||||
}
|
exitCode = EXIT_FAILURE;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|||||||
@ -1,20 +1,18 @@
|
|||||||
# --------------------------
|
|
||||||
# Compiler und Flags
|
|
||||||
# --------------------------
|
|
||||||
CC = gcc
|
CC = gcc
|
||||||
CFLAGS = -g -Wall -I$(raylibfolder)
|
CFLAGS = -g -Wall $(raylibfolder)
|
||||||
LDFLAGS = -lopengl32 -lgdi32 -lwinmm
|
LDFLAGS = -lopengl32 -lgdi32 -lwinmm
|
||||||
BINARIES = ./windows
|
BINARIES = ./windows
|
||||||
|
|
||||||
raylibfolder = ./raylib
|
raylib_folder = ./raylib
|
||||||
unityfolder = ./unity
|
unityfolder = ./unity
|
||||||
|
|
||||||
# --------------------------
|
# --------------------------
|
||||||
# Initiales Spiel bauen
|
# initiales Spiel bauen
|
||||||
# --------------------------
|
# --------------------------
|
||||||
wordsalad_initial:
|
wordsalad_initial:
|
||||||
$(CC) -o wordsalad_initial $(BINARIES)/libwordsalad_complete.a $(BINARIES)/libraylib.a $(LDFLAGS)
|
$(CC) -o wordsalad_initial $(BINARIES)/libwordsalad_complete.a $(BINARIES)/libraylib.a $(LDFLAGS)
|
||||||
|
|
||||||
|
|
||||||
# --------------------------
|
# --------------------------
|
||||||
# Normales Spiel bauen
|
# Normales Spiel bauen
|
||||||
# --------------------------
|
# --------------------------
|
||||||
@ -25,19 +23,13 @@ main.o: main.c
|
|||||||
$(CC) -c $(CFLAGS) main.c
|
$(CC) -c $(CFLAGS) main.c
|
||||||
|
|
||||||
input.o: input.c
|
input.o: input.c
|
||||||
$(CC) -c $(CFLAGS) input.c
|
$(CC) -c $(CFLAGS)input.c
|
||||||
|
|
||||||
game.o: game.c
|
game.o: game.c
|
||||||
$(CC) -c $(CFLAGS) game.c
|
$(CC) -c $(CFLAGS) game.c
|
||||||
|
|
||||||
graphicalGame.o: graphicalGame.c
|
graphicalGame.o: graphicalGame.c
|
||||||
$(CC) $(CFLAGS) -c graphicalGame.c
|
$(CC) -I$(raylib_folder) -c $(CFLAGS) graphicalGame.c
|
||||||
|
|
||||||
# --------------------------
|
|
||||||
# Eigene Version bauen
|
|
||||||
# --------------------------
|
|
||||||
wordsalad_myversion: main.c
|
|
||||||
$(CC) $(CFLAGS) -o wordsalad_myversion main.c $(BINARIES)/libwordsalad.a $(LDFLAGS)
|
|
||||||
|
|
||||||
# --------------------------
|
# --------------------------
|
||||||
# Unit Tests
|
# Unit Tests
|
||||||
|
|||||||
File diff suppressed because it is too large
Load Diff
File diff suppressed because it is too large
Load Diff
5262
Start_Windows/rlgl.h
5262
Start_Windows/rlgl.h
File diff suppressed because it is too large
Load Diff
Loading…
x
Reference in New Issue
Block a user