mirror of
https://github.com/softdorothy/GliderPRO.git
synced 2024-11-22 20:31:19 +00:00
7a70d18ba6
Sources for Glider PRO, a Macintosh game written by John Calhoun and published by Casady & Greene, Inc. I believe it was using CodeWarrior IDE to create a fat (68K and PowerPC) binary.
1 line
7.3 KiB
C
Executable File
1 line
7.3 KiB
C
Executable File
|
|
//============================================================================
|
|
//----------------------------------------------------------------------------
|
|
// StringUtils.c
|
|
//----------------------------------------------------------------------------
|
|
//============================================================================
|
|
|
|
|
|
#include <TextUtils.h>
|
|
#include "Externs.h"
|
|
|
|
|
|
//============================================================== Functions
|
|
//-------------------------------------------------------------- PasStringCopy
|
|
// Given a source string and storage for a second, this functionÉ
|
|
// copies from one to the other. It assumes Pascal style strings.
|
|
|
|
void PasStringCopy (StringPtr p1, StringPtr p2)
|
|
{
|
|
register short stringLength;
|
|
|
|
stringLength = *p2++ = *p1++;
|
|
while (--stringLength >= 0)
|
|
*p2++ = *p1++;
|
|
}
|
|
|
|
//-------------------------------------------------------------- WhichStringFirst
|
|
|
|
// This is a sorting function that handles two Pascal strings. ItÉ
|
|
// will return a 1 to indicate the 1st string is "greater", a 1 toÉ
|
|
// indicate the 2nd was greater and a 0 to indicate that the stringsÉ
|
|
// are equal.
|
|
|
|
short WhichStringFirst (StringPtr p1, StringPtr p2)
|
|
{
|
|
short smallestLength, seek, greater;
|
|
char char1, char2;
|
|
Boolean foundIt;
|
|
|
|
smallestLength = p1[0];
|
|
if (p2[0] < smallestLength)
|
|
smallestLength = p2[0];
|
|
|
|
greater = 0; // neither are greater, they are equal
|
|
seek = 1; // start at character #1
|
|
foundIt = false;
|
|
do
|
|
{
|
|
char1 = p1[seek]; // make upper case (if applicable)
|
|
if ((char1 > 0x60) && (char1 < 0x7B))
|
|
char1 -= 0x20;
|
|
char2 = p2[seek]; // make upper case (if applicable)
|
|
if ((char2 > 0x60) && (char2 < 0x7B))
|
|
char2 -= 0x20;
|
|
|
|
if (char1 > char2) // first string is greater
|
|
{
|
|
greater = 1;
|
|
foundIt = true;
|
|
}
|
|
else if (char1 < char2) // second string is greater
|
|
{
|
|
greater = 2;
|
|
foundIt = true;
|
|
}
|
|
seek++;
|
|
if (seek > smallestLength) // we've reached the end of the line
|
|
{
|
|
if (!foundIt)
|
|
{
|
|
if (p1[0] < p2[0]) // shortest string wins
|
|
greater = 1;
|
|
else if (p1[0] > p2[0])
|
|
greater = 2;
|
|
}
|
|
foundIt = true;
|
|
}
|
|
}
|
|
while (!foundIt);
|
|
|
|
return (greater);
|
|
}
|
|
|
|
//-------------------------------------------------------------- PasStringCopyNum
|
|
|
|
// This function copies a specified number of characters from oneÉ
|
|
// Pascal string to another.
|
|
|
|
void PasStringCopyNum (StringPtr p1, StringPtr p2, short charsToCopy)
|
|
{
|
|
short i;
|
|
|
|
if (charsToCopy > *p1) // if trying to copy more chars than there are
|
|
charsToCopy = *p1; // reduce the number of chars to copy to this size
|
|
|
|
*p2 = charsToCopy;
|
|
|
|
*p2++;
|
|
*p1++;
|
|
|
|
for (i = 0; i < charsToCopy; i++)
|
|
*p2++ = *p1++;
|
|
}
|
|
|
|
//-------------------------------------------------------------- PasStringConcat
|
|
// This function concatenates the second Pascal string to the end ofÉ
|
|
// the first Pascal string.
|
|
|
|
void PasStringConcat (StringPtr p1, StringPtr p2)
|
|
{
|
|
short wasLength, addedLength, i;
|
|
|
|
wasLength = *p1;
|
|
if (wasLength > 255)
|
|
wasLength = 255;
|
|
|
|
addedLength = *p2;
|
|
if ((wasLength + addedLength) > 255)
|
|
addedLength = 255 - wasLength;
|
|
|
|
*p1 = wasLength + addedLength;
|
|
|
|
*p1++;
|
|
*p2++;
|
|
|
|
for (i = 0; i < wasLength; i++)
|
|
*p1++;
|
|
|
|
for (i = 0; i < addedLength; i++)
|
|
*p1++ = *p2++;
|
|
}
|
|
|
|
//-------------------------------------------------------------- GetLineOfText
|
|
|
|
// This function walks through a source string and looks for anÉ
|
|
// entire line of text. A "line" of text is assumed to be boundedÉ
|
|
// by carriage returns. The index variable indicates which lineÉ
|
|
// is sought.
|
|
|
|
void GetLineOfText (StringPtr srcStr, short index, StringPtr textLine)
|
|
{
|
|
short i, srcLength, count, start, stop;
|
|
Boolean foundIt;
|
|
|
|
PasStringCopy("\p", textLine);
|
|
srcLength = srcStr[0];
|
|
|
|
if (index == 0) // walk through to "index"
|
|
start = 1;
|
|
else
|
|
{
|
|
start = 0;
|
|
count = 0;
|
|
i = 0;
|
|
foundIt = false;
|
|
do
|
|
{
|
|
i++;
|
|
if (srcStr[i] == kReturnKeyASCII)
|
|
{
|
|
count++;
|
|
if (count == index)
|
|
{
|
|
start = i + 1;
|
|
foundIt = true;
|
|
}
|
|
}
|
|
}
|
|
while ((i < srcLength) && (!foundIt));
|
|
}
|
|
|
|
if (start != 0)
|
|
{
|
|
i = start;
|
|
|
|
foundIt = false;
|
|
do
|
|
{
|
|
if (srcStr[i] == kReturnKeyASCII)
|
|
{
|
|
stop = i;
|
|
foundIt = true;
|
|
}
|
|
i++;
|
|
}
|
|
while ((i < srcLength) && (!foundIt));
|
|
|
|
if (!foundIt)
|
|
{
|
|
if (start > srcLength)
|
|
{
|
|
start = srcLength;
|
|
stop = srcLength - 1;
|
|
}
|
|
else
|
|
stop = i;
|
|
}
|
|
|
|
count = 0;
|
|
|
|
for (i = start; i <= stop; i++)
|
|
{
|
|
count++;
|
|
textLine[count] = srcStr[i];
|
|
}
|
|
textLine[0] = count;
|
|
}
|
|
}
|
|
|
|
//-------------------------------------------------------------- WrapText
|
|
|
|
// Given a string and the maximum number of characters to put onÉ
|
|
// one line, this function goes through and inserts carriage returnsÉ
|
|
// in order to ensure that no line of text exceeds maxChars.
|
|
|
|
void WrapText (StringPtr theText, short maxChars)
|
|
{
|
|
short lastChar, count, chars, spaceIs;
|
|
Boolean foundEdge, foundSpace;
|
|
|
|
lastChar = theText[0];
|
|
count = 0;
|
|
|
|
do
|
|
{
|
|
chars = 0;
|
|
foundEdge = false;
|
|
foundSpace = false;
|
|
do
|
|
{
|
|
count++;
|
|
chars++;
|
|
if (theText[count] == kReturnKeyASCII)
|
|
foundEdge = true;
|
|
else if (theText[count] == kSpaceBarASCII)
|
|
{
|
|
foundSpace = true;
|
|
spaceIs = count;
|
|
}
|
|
}
|
|
while ((count < lastChar) && (chars < maxChars) && (!foundEdge));
|
|
|
|
if ((!foundEdge) && (count < lastChar) && (foundSpace))
|
|
{
|
|
theText[spaceIs] = kReturnKeyASCII;
|
|
count = spaceIs + 1;
|
|
}
|
|
}
|
|
while (count < lastChar);
|
|
}
|
|
|
|
//-------------------------------------------------------------- GetFirstWordOfString
|
|
|
|
// Walks a string looking for a space (denoting first word of string).
|
|
|
|
void GetFirstWordOfString (StringPtr stringIn, StringPtr stringOut)
|
|
{
|
|
short isLong, spaceAt, i;
|
|
|
|
isLong = stringIn[0];
|
|
spaceAt = isLong;
|
|
|
|
for (i = 1; i < isLong; i++)
|
|
{
|
|
if ((stringIn[i] == ' ') && (spaceAt == isLong))
|
|
spaceAt = i - 1;
|
|
}
|
|
|
|
if (spaceAt <= 0)
|
|
PasStringCopy("\p", stringOut);
|
|
else
|
|
PasStringCopyNum(stringIn, stringOut, spaceAt);
|
|
}
|
|
|
|
//-------------------------------------------------------------- CollapseStringToWidth
|
|
|
|
// Given a string and a maximum width (in pixels), this functionÉ
|
|
// calculates how wide the text would be drawn with the currentÉ
|
|
// font. If the text would exceed our width limit, charactersÉ
|
|
// are dropped off the end of the string and "É" appended.
|
|
|
|
void CollapseStringToWidth (StringPtr theStr, short wide)
|
|
{
|
|
short dotsWide;
|
|
Boolean tooWide;
|
|
|
|
dotsWide = StringWidth("\pÉ");
|
|
tooWide = StringWidth(theStr) > wide;
|
|
while (tooWide)
|
|
{
|
|
theStr[0]--;
|
|
tooWide = ((StringWidth(theStr) + dotsWide) > wide);
|
|
if (!tooWide)
|
|
PasStringConcat(theStr, "\pÉ");
|
|
}
|
|
}
|
|
|
|
//-------------------------------------------------------------- GetChooserName
|
|
|
|
// This function extracts the user name stored away by the Chooser.
|
|
|
|
void GetChooserName (StringPtr thisName)
|
|
{
|
|
#define kChooserStringID -16096
|
|
Handle theNameHandle;
|
|
Byte oldState;
|
|
|
|
theNameHandle = (Handle)GetString(kChooserStringID);
|
|
if (theNameHandle != nil) {
|
|
oldState = HGetState(theNameHandle);
|
|
HLock(theNameHandle);
|
|
PasStringCopy((StringPtr)*theNameHandle, thisName);
|
|
HSetState(theNameHandle, oldState);
|
|
}
|
|
else
|
|
thisName[0] = 0;
|
|
}
|
|
|
|
//-------------------------------------------------------------- GetLocalizedString
|
|
|
|
StringPtr GetLocalizedString (short index, StringPtr theString)
|
|
{
|
|
#define kLocalizedStringsID 150
|
|
|
|
GetIndString(theString, kLocalizedStringsID, index);
|
|
return (theString);
|
|
}
|
|
|
|
|