Files
TeslaRel410/BORLAND/BC45/SOURCE/CLASSLIB/GEOMETRY.CPP
T
CydandClaude Fable 5 63312e07f9 source410: literal 4.10 source reconstruction + BC++ 4.52 fleet toolchain archived
- BORLAND/: Borland C++ 4.52 (chosen over 4.5 by byte-match: CODE/RP/CW32.LIB
  is identical to 4.52's install lib). BCC32/TLINK32/TLIB/MAKE run natively on
  Win11; CODE/BT/OPT.MAK is the shipped BTL4OPT.EXE's exact flag recipe
  (extender = Borland PowerPack DPMI32, not Phar Lap TNT).
- restoration/source410/: the literal 1995-form reconstruction of the missing
  BT game source (never mixed into CODE/). Round 1-3 state:
  * 6 of 10 surviving original TUs COMPILE CLEAN under the period toolchain
    (BTMSSN, BTCNSL, BTSCNRL, BTTEAM, BTL4MODE, BTL4ARND) - first builds
    since 1996.
  * BT_L4/BTL4APP.CPP pilot reconstruction: 12/12 functions, Fail() lands on
    its binary-recorded line 400 exactly.
  * BT/BTCNSL.HPP: console wire IDs recovered from the binary's ctors
    (Killed=9, Damaged=10, ScoreUpdate=13, DeathWithoutHonor=15 [T1];
    TeamScore=12 flagged [T4]).
  * MUNGA/: 8 engine-header backfills back-dated from the BT412 WinTesla tree
    (VDATA numbering decomp-verified; AUDREND's OpenAL-era virtual removed -
    the period compiler is the drift detector).
  * Tooling: backdate.py (WinTesla->1995 header transform), compile410.sh
    (per-TU verification sweep under authentic OPT.MAK flags).
  * README: corrected roadmap - MECH.HPP is the capstone grown with the mech
    TU reconstructions; BTREG.CPP green = the header-family milestone.

Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>
2026-07-19 07:33:26 -05:00

236 lines
4.7 KiB
C++

//----------------------------------------------------------------------------
// (C) Copyright 1993, 1994 by Borland International, All Rights Reserved
// Implementation of geometry (TPoint, TSize, TRect) classes.
//----------------------------------------------------------------------------
#if !defined(_Windows)
# define _Windows // pretend we are in windows to get the headers we need
#endif
#include <osl/defs.h>
#include <osl/geometry.h>
//
// Calculate the integer square root of a 32bit signed long. return a 16bit
// signed. Is fairly fast, esp. compared to FP versions
//
int _BIDSFUNC
Sqrt(long val)
{
if (val <= 0)
return 0; // Throw a math exception?
unsigned mask = 1; // Bit mask to shift left
int best = 0; // Best estimate so far
for (; !(mask&0x8000); mask <<= 1)
if (((long)best+mask)*(best+mask) <= val)
best |= mask;
return best;
}
//
// Make a duplicate of a C string using new char[]
//
char* _BIDSFUNC
strnewdup(const char* s, size_t allocSize)
{
if (!s)
s = "";
int alloc = max(strlen(s)+1, allocSize);
return strcpy(new char[alloc], s);
}
//
// Make a far duplicate of a C string using new char[] far
//
#if defined(BI_DATA_NEAR)
char far* _BIDSFUNC
strnewdup(const char far* s, size_t allocSize)
{
if (!s)
s = "";
int alloc = max(strlen(s)+1, allocSize);
return strcpy(new far char[alloc], s);
}
long
atol(const char far* s)
{
for (long val = 0; *s && isdigit(*s); s++)
val = val*10 + *s - '0';
return val;
}
#endif
#if !defined(BI_PLAT_WIN16)
//
// Make a duplicate of a wide C string using new wchar_t[]
//
wchar_t* _BIDSFUNC
strnewdup(const wchar_t* s, size_t allocSize)
{
if (!s)
s = L"";
int alloc = max((size_t)lstrlenW(s)+1, allocSize);
return lstrcpyW(new wchar_t[alloc], s);
}
//
// Wide string copy function.
//
wchar_t* _BIDSFUNC
strcpy(wchar_t* dst, const wchar_t* src)
{
wchar_t* p = dst;
while ((*p++ = *src++) != 0)
;
return dst;
}
//
// Wide string length function.
//
size_t _BIDSFUNC
strlen(const wchar_t* str)
{
const wchar_t* p = str;
for (; *p; p++)
;
return p - str;
}
#endif
//----------------------------------------------------------------------------
TRect&
TRect::Normalize()
{
if (left > right)
Swap(left, right);
if (top > bottom)
Swap(top, bottom);
return *this;
}
TRect&
TRect::Offset(int dx, int dy)
{
left += dx;
top += dy;
right += dx;
bottom += dy;
return *this;
}
TRect&
TRect::Inflate(int dx, int dy)
{
left -= dx;
top -= dy;
right += dx;
bottom += dy;
return *this;
}
TRect&
TRect::operator &=(const TRect& other)
{
if (!IsNull()) {
if (other.IsNull())
SetNull();
else {
left = Max(left, other.left);
top = Max(top, other.top);
right = Min(right, other.right);
bottom = Min(bottom, other.bottom);
}
}
return *this;
}
TRect&
TRect::operator |=(const TRect& other)
{
if (!other.IsNull()) {
if (IsNull())
*this = other;
else {
left = Min(left, other.left);
top = Min(top, other.top);
right = Max(right, other.right);
bottom = Max(bottom, other.bottom);
}
}
return *this;
}
//----------------------------------------------------------------------------
// class TCmdLine implementation
const char whitespace[] = " \t";
const char terminator[] = "=/ \t"; // remove /- to dissallow separating there
TCmdLine::TCmdLine(const char far* cmdLine)
{
Buffer = new char[strlen(cmdLine)+1];
strcpy(Buffer, cmdLine);
Reset();
}
void TCmdLine::Reset()
{
Token = TokenStart = Buffer;
TokenLen = 0;
Kind = Start;
}
TCmdLine::~TCmdLine()
{
delete [] Buffer;
}
TCmdLine::TKind TCmdLine::NextToken(bool removeCurrent)
{
// Done parsing, no more tokens
//
if (Kind == Done)
return Kind;
// Move Token ptr to next token, by copying over current token, or by ptr
// adjustment. TokenStart stays right past previous token
//
if (removeCurrent) {
strcpy(TokenStart, Token+TokenLen);
Token = TokenStart;
}
else {
Token += TokenLen;
TokenStart = Token;
}
// Adjust token ptr to begining of token & determine kind
//
Token += strspn(Token, whitespace); // skip leading whitespace
switch (*Token) {
case 0:
Kind = Done;
break;
case '=':
Kind = Value;
Token++;
break;
case '-':
case '/':
Kind = Option;
Token++;
break;
default:
Kind = Name;
}
Token += strspn(Token, whitespace); // skip any more whitespace
TokenLen = strcspn(Token, terminator);
return Kind;
}