CydandClaude Fable 5
63312e07f9
- 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>
66 lines
2.0 KiB
Plaintext
66 lines
2.0 KiB
Plaintext
/*------------------------------------------------------------------------*/
|
|
/* */
|
|
/* BSORTARY.CPP */
|
|
/* */
|
|
/* Copyright Borland International 1991, 1993 */
|
|
/* All Rights Reserved */
|
|
/* */
|
|
/*------------------------------------------------------------------------*/
|
|
|
|
#if !defined( TEMPLATES )
|
|
#define TEMPLATES
|
|
#endif
|
|
|
|
#if 0
|
|
|
|
#if !defined( __SORTABLE_H )
|
|
#include "classlib\obsolete\sortable.h"
|
|
#endif // __SORTABLE_H
|
|
|
|
#if !defined( __ARRAYS_H )
|
|
#include "classlib\arrays.h"
|
|
#endif // __ARRAYS_H
|
|
|
|
void BI_ISObjectVector::add( Object _FAR *o )
|
|
{
|
|
if( count_ >= lim )
|
|
resize( count_+1 );
|
|
unsigned loc = count_++;
|
|
while( loc > 0 && *(Sortable _FAR *)o < *(Sortable _FAR *)(void _FAR *)(data[loc-1]) )
|
|
{
|
|
data[loc] = data[loc-1];
|
|
loc--;
|
|
}
|
|
data[loc] = o;
|
|
}
|
|
|
|
unsigned BI_ISObjectVector::find( void _FAR * obj ) const
|
|
{
|
|
unsigned lower = 0;
|
|
unsigned upper = count_-1;
|
|
if( count_ != 0 )
|
|
{
|
|
while( lower < upper && upper != UINT_MAX )
|
|
{
|
|
unsigned middle = (lower+upper)/2;
|
|
if( *(const Sortable _FAR *)(void _FAR *)(data[middle]) ==
|
|
*(const Sortable _FAR *)obj
|
|
)
|
|
return middle;
|
|
if( *(const Sortable _FAR *)(const void _FAR *)(data[middle]) <
|
|
*(const Sortable _FAR *)obj
|
|
)
|
|
lower = middle+1;
|
|
else
|
|
upper = middle-1;
|
|
}
|
|
}
|
|
if( lower == upper &&
|
|
*(const Sortable _FAR *)(const void _FAR *)(data[lower]) == *(const Sortable _FAR *)obj
|
|
)
|
|
return lower;
|
|
else
|
|
return UINT_MAX;
|
|
}
|
|
#endif
|