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>
143 lines
4.0 KiB
Plaintext
143 lines
4.0 KiB
Plaintext
/*------------------------------------------------------------------------*/
|
|
/* */
|
|
/* CONTAIN.CPP */
|
|
/* */
|
|
/* Copyright Borland International 1991, 1993 */
|
|
/* All Rights Reserved */
|
|
/* */
|
|
/*------------------------------------------------------------------------*/
|
|
|
|
#if !defined( __IOSTREAM_H )
|
|
#include <iostream.h>
|
|
#endif // __IOSTREAM_H
|
|
|
|
#if !defined( CHECKS_H )
|
|
#include <checks.h>
|
|
#endif // CHECKS_H
|
|
|
|
#if !defined( __CONTAIN_H )
|
|
#include "classlib\obsolete\contain.h"
|
|
#endif // __CONTAIN_H
|
|
|
|
void Container::forEach( iterFuncType actionPtr, void *paramListPtr )
|
|
{
|
|
PRECONDITION( actionPtr != 0 );
|
|
ContainerIterator& containerIterator = initIterator();
|
|
while( containerIterator != 0 )
|
|
containerIterator++.forEach( actionPtr, paramListPtr );
|
|
delete &containerIterator;
|
|
}
|
|
|
|
Object& Container::firstThat( condFuncType testFuncPtr,
|
|
void *paramListPtr
|
|
) const
|
|
{
|
|
PRECONDITION( testFuncPtr != 0 );
|
|
ContainerIterator &containerIterator = initIterator();
|
|
while( containerIterator != 0 )
|
|
{
|
|
Object& testResult =
|
|
containerIterator++.firstThat( testFuncPtr, paramListPtr );
|
|
if ( testResult != NOOBJECT )
|
|
{
|
|
delete &containerIterator;
|
|
return testResult;
|
|
}
|
|
}
|
|
delete &containerIterator;
|
|
return NOOBJECT;
|
|
}
|
|
|
|
Object& Container::lastThat( condFuncType testFuncPtr,
|
|
void *paramListPtr
|
|
) const
|
|
{
|
|
PRECONDITION( testFuncPtr != 0 );
|
|
ContainerIterator& containerIterator = initIterator();
|
|
Object *lastMet = ZERO;
|
|
while( containerIterator != 0 )
|
|
{
|
|
Object& testResult =
|
|
containerIterator++.lastThat( testFuncPtr, paramListPtr );
|
|
if( testResult != NOOBJECT )
|
|
lastMet = &testResult;
|
|
}
|
|
delete &containerIterator;
|
|
return *lastMet;
|
|
}
|
|
|
|
int Container::isEqual( const Object& testContainer ) const
|
|
{
|
|
PRECONDITION( isA() == testContainer.isA() );
|
|
|
|
int res = 1;
|
|
|
|
ContainerIterator& thisIterator = initIterator();
|
|
ContainerIterator& testContainerIterator =
|
|
((Container &)(testContainer)).initIterator();
|
|
while( thisIterator != 0 && testContainerIterator != 0 )
|
|
{
|
|
if( thisIterator++ != testContainerIterator++ )
|
|
{
|
|
res = 0;
|
|
break;
|
|
}
|
|
}
|
|
|
|
if( thisIterator != 0 || testContainerIterator != 0 )
|
|
res = 0;
|
|
|
|
delete &testContainerIterator;
|
|
delete &thisIterator;
|
|
return res;
|
|
}
|
|
|
|
void Container::printOn( ostream& outputStream ) const
|
|
{
|
|
ContainerIterator& printIterator = initIterator();
|
|
printHeader( outputStream );
|
|
while( printIterator != 0 )
|
|
{
|
|
printIterator++.printOn( outputStream );
|
|
if ( printIterator != 0 )
|
|
printSeparator( outputStream );
|
|
else
|
|
break;
|
|
}
|
|
printTrailer( outputStream );
|
|
delete &printIterator;
|
|
}
|
|
|
|
static void getHashValue( Object& o, void *valPtr )
|
|
{
|
|
hashValueType *val = (hashValueType *)valPtr;
|
|
*val += o.hashValue();
|
|
}
|
|
|
|
#pragma warn -ncf
|
|
|
|
hashValueType Container::hashValue() const
|
|
{
|
|
hashValueType val = 0;
|
|
forEach( getHashValue, &val );
|
|
return val;
|
|
}
|
|
|
|
#pragma warn .ncf
|
|
|
|
void Container::printHeader( ostream& outputStream ) const
|
|
{
|
|
outputStream << nameOf() << " {\n ";
|
|
}
|
|
|
|
void Container::printSeparator( ostream& outputStream ) const
|
|
{
|
|
outputStream << ",\n ";
|
|
}
|
|
|
|
void Container::printTrailer( ostream& outputStream ) const
|
|
{
|
|
outputStream << " }\n";
|
|
}
|
|
|