HomeSort by: relevance | last modified time | path
    Searched defs:wordpath (Results 1 - 3 of 3) sorted by relevancy

  /src/games/boggle/boggle/
bog.c 103 int wordpath[MAXWORDLEN + 1]; variable in typeref:typename:int[]
298 if (checkword(w, -1, wordpath) != -1)
360 if (checkword(buf, -1, wordpath) < 0)
365 for (i = 0; wordpath[i] != -1; i++)
366 (void) printf(" %d", wordpath[i]);
434 for (i = 0; wordpath[i] != -1; i++)
435 (void) printf(" %d", wordpath[i]);
592 if (checkword(w, -1, wordpath) == -1)
688 * Clear wordpath[].
696 for (pos = 0; pos < max && (full || wordpath[pos] != -1); pos++)
    [all...]
bog.c 103 int wordpath[MAXWORDLEN + 1]; variable in typeref:typename:int[]
298 if (checkword(w, -1, wordpath) != -1)
360 if (checkword(buf, -1, wordpath) < 0)
365 for (i = 0; wordpath[i] != -1; i++)
366 (void) printf(" %d", wordpath[i]);
434 for (i = 0; wordpath[i] != -1; i++)
435 (void) printf(" %d", wordpath[i]);
592 if (checkword(w, -1, wordpath) == -1)
688 * Clear wordpath[].
696 for (pos = 0; pos < max && (full || wordpath[pos] != -1); pos++)
    [all...]
bog.c 103 int wordpath[MAXWORDLEN + 1]; variable in typeref:typename:int[]
298 if (checkword(w, -1, wordpath) != -1)
360 if (checkword(buf, -1, wordpath) < 0)
365 for (i = 0; wordpath[i] != -1; i++)
366 (void) printf(" %d", wordpath[i]);
434 for (i = 0; wordpath[i] != -1; i++)
435 (void) printf(" %d", wordpath[i]);
592 if (checkword(w, -1, wordpath) == -1)
688 * Clear wordpath[].
696 for (pos = 0; pos < max && (full || wordpath[pos] != -1); pos++)
    [all...]

Completed in 71 milliseconds