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>
112 lines
3.0 KiB
C++
112 lines
3.0 KiB
C++
/*------------------------------------------------------------------------*/
|
|
/* */
|
|
/* SORTABLE.H */
|
|
/* */
|
|
/* Copyright Borland International 1991, 1993 */
|
|
/* All Rights Reserved */
|
|
/* */
|
|
/*------------------------------------------------------------------------*/
|
|
|
|
#if !defined( _SORTABLE_H )
|
|
#define _SORTABLE_H
|
|
|
|
#define BI_OLDNAMES
|
|
|
|
#if !defined( __CLSDEFS_H )
|
|
#include "classlib\obsolete\ClsDefs.h"
|
|
#endif // __CLSDEFS_H
|
|
|
|
#if !defined( __OBJECT_H )
|
|
#include "classlib\obsolete\Object.h"
|
|
#endif // __OBJECT_H
|
|
|
|
#if !defined( __CHECKS_H )
|
|
#include <checks.h>
|
|
#endif // __CHECKS_H
|
|
|
|
#pragma option -Vo-
|
|
#if defined( __BCOPT__ ) && !defined( __FLAT__ ) && !defined( _ALLOW_po )
|
|
#pragma option -po-
|
|
#endif
|
|
|
|
_CLASSDEF(ostream)
|
|
_CLASSDEF(Sortable)
|
|
|
|
class _CLASSTYPE Sortable : public Object
|
|
{
|
|
|
|
public:
|
|
|
|
virtual int isEqual( const Object _FAR & ) const = 0;
|
|
virtual int isLessThan( const Object _FAR & ) const = 0;
|
|
virtual int isSortable() const
|
|
{
|
|
return 1;
|
|
}
|
|
|
|
virtual classType isA() const = 0;
|
|
virtual char _FAR *nameOf() const = 0;
|
|
virtual hashValueType hashValue() const = 0;
|
|
virtual void printOn( ostream& ) const = 0;
|
|
|
|
};
|
|
|
|
inline
|
|
int operator < ( const Object _FAR & test1, const Object _FAR & test2 )
|
|
{
|
|
CHECK( test1.isSortable() && test2.isSortable() );
|
|
return ((Sortable&)test1) < ((Sortable&)test2);
|
|
}
|
|
|
|
inline
|
|
int operator > ( const Object _FAR & test1, const Object _FAR & test2 )
|
|
{
|
|
CHECK( test1.isSortable() && test2.isSortable() );
|
|
return ((Sortable&)test1) > ((Sortable&)test2);
|
|
}
|
|
|
|
inline
|
|
int operator >= ( const Object _FAR & test1, const Object _FAR & test2 )
|
|
{
|
|
CHECK( test1.isSortable() && test2.isSortable() );
|
|
return ((Sortable&)test1) >= ((Sortable&)test2);
|
|
}
|
|
|
|
inline
|
|
int operator <= ( const Object _FAR & test1, const Object _FAR & test2 )
|
|
{
|
|
CHECK( test1.isSortable() && test2.isSortable() );
|
|
return ((Sortable&)test1) <= ((Sortable&)test2);
|
|
}
|
|
|
|
inline
|
|
int operator < ( const Sortable _FAR & test1, const Sortable _FAR & test2 )
|
|
{
|
|
return ( (test1.isA() == test2.isA()) && test1.isLessThan( test2 ) );
|
|
}
|
|
|
|
inline
|
|
int operator > ( const Sortable _FAR & test1, const Sortable _FAR & test2 )
|
|
{
|
|
return !( test1 < test2 ) && test1 != test2;
|
|
}
|
|
|
|
inline
|
|
int operator >=( const Sortable _FAR & test1, const Sortable _FAR & test2 )
|
|
{
|
|
return ( !( test1 <( test2 ) ) );
|
|
}
|
|
|
|
inline
|
|
int operator <=( const Sortable _FAR & test1, const Sortable _FAR & test2 )
|
|
{
|
|
return ( test1 < test2 || test1 == test2 );
|
|
}
|
|
|
|
#if defined( __BCOPT__ ) && !defined( __FLAT__ ) && !defined( _ALLOW_po )
|
|
#pragma option -po.
|
|
#endif
|
|
#pragma option -Vo.
|
|
|
|
#endif
|