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>
64 lines
1.9 KiB
Plaintext
64 lines
1.9 KiB
Plaintext
/*------------------------------------------------------------------------*/
|
|
/* */
|
|
/* SORTARRY.CPP */
|
|
/* */
|
|
/* Copyright Borland International 1991, 1993 */
|
|
/* All Rights Reserved */
|
|
/* */
|
|
/*------------------------------------------------------------------------*/
|
|
|
|
#if !defined( __STDLIB_H )
|
|
#include <stdlib.h>
|
|
#endif // __STDLIB_H
|
|
|
|
#if !defined( __IOSTREAM_H )
|
|
#include <iostream.h>
|
|
#endif // __IOSTREAM_H
|
|
|
|
#if !defined( __SORTARRY_H )
|
|
#include "classlib\obsolete\sortarry.h"
|
|
#endif // __SORTARRY_H
|
|
|
|
void SortedArray::add( Object& toAdd )
|
|
{
|
|
if( toAdd.isSortable() )
|
|
{
|
|
if( lastElementIndex == upperbound )
|
|
{
|
|
reallocate( arraySize() + 1 );
|
|
}
|
|
int insertionPoint = lowerbound;
|
|
while( insertionPoint <= lastElementIndex &&
|
|
(Sortable&)objectAt( insertionPoint ) < (Sortable&)toAdd
|
|
)
|
|
insertionPoint++;
|
|
|
|
insertEntry( insertionPoint );
|
|
setData( insertionPoint, &toAdd );
|
|
itemsInContainer++;
|
|
lastElementIndex++;
|
|
}
|
|
else
|
|
ClassLib_error( __ENOTSORT );
|
|
}
|
|
|
|
void SortedArray::detach( int loc, DeleteType dt )
|
|
{
|
|
if( loc != INT_MIN )
|
|
{
|
|
if( delObj(dt) )
|
|
delete ptrAt( loc );
|
|
removeEntry( loc );
|
|
itemsInContainer--;
|
|
if( loc <= lastElementIndex )
|
|
lastElementIndex--;
|
|
}
|
|
}
|
|
|
|
void SortedArray::detach( Object& toDetach, DeleteType dt )
|
|
{
|
|
int detachPoint = find( toDetach );
|
|
detach( detachPoint, dt );
|
|
}
|
|
|