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>
122 lines
2.7 KiB
C++
122 lines
2.7 KiB
C++
/*------------------------------------------------------------------------*/
|
|
/* */
|
|
/* PRIORTYQ.H */
|
|
/* */
|
|
/* Copyright Borland International 1991, 1993 */
|
|
/* All Rights Reserved */
|
|
/* */
|
|
/*------------------------------------------------------------------------*/
|
|
|
|
#if !defined( __PRIORTYQ_H )
|
|
#define __PRIORTYQ_H
|
|
|
|
#define BI_OLDNAMES
|
|
|
|
#if !defined( __BTREE_H )
|
|
#include "classlib\obsolete\Btree.h"
|
|
#endif
|
|
|
|
#if !defined( __SHDDEL_H )
|
|
#include "classlib\ShdDel.h"
|
|
#endif // __SHDDEL_H
|
|
|
|
#pragma option -Vo-
|
|
#if defined( __BCOPT__ ) && !defined( __FLAT__ ) && !defined( _ALLOW_po )
|
|
#pragma option -po-
|
|
#endif
|
|
|
|
_CLASSDEF(PriorityQueue)
|
|
|
|
class _CLASSTYPE PriorityQueue :
|
|
public Container,
|
|
public virtual Object::TShouldDelete
|
|
{
|
|
|
|
public:
|
|
|
|
int isEmpty() const
|
|
{
|
|
return tree.isEmpty();
|
|
}
|
|
|
|
countType getItemsInContainer() const
|
|
{
|
|
return tree.getItemsInContainer();
|
|
}
|
|
|
|
void put(Object& o)
|
|
{
|
|
tree.add(o);
|
|
}
|
|
|
|
Object& get()
|
|
{
|
|
if( isEmpty() )
|
|
return NOOBJECT;
|
|
else
|
|
{
|
|
Object& obj = tree[0];
|
|
tree.detach( obj ); // does not delete
|
|
return obj;
|
|
}
|
|
}
|
|
|
|
Object& peekLeft()
|
|
{
|
|
return (isEmpty()?NOOBJECT:tree[0]);
|
|
}
|
|
|
|
void detachLeft( DeleteType dt = NoDelete )
|
|
{
|
|
if( !isEmpty() )
|
|
tree.detach( tree[0], dt );
|
|
}
|
|
|
|
void flush( DeleteType dt = DefDelete )
|
|
{
|
|
tree.flush( dt );
|
|
}
|
|
|
|
int hasMember( Object& obj ) const
|
|
{
|
|
return tree.hasMember( obj );
|
|
}
|
|
|
|
int ownsElements()
|
|
{
|
|
return tree.ownsElements();
|
|
}
|
|
|
|
void ownsElements( int del )
|
|
{
|
|
tree.ownsElements( del );
|
|
}
|
|
|
|
virtual classType isA() const
|
|
{
|
|
return priorityQueueClass;
|
|
}
|
|
|
|
virtual char _FAR *nameOf() const
|
|
{
|
|
return "PriorityQueue";
|
|
}
|
|
|
|
virtual ContainerIterator _FAR & initIterator() const
|
|
{
|
|
return tree.initIterator();
|
|
}
|
|
|
|
private:
|
|
|
|
Btree tree;
|
|
|
|
};
|
|
|
|
#if defined( __BCOPT__ ) && !defined( __FLAT__ ) && !defined( _ALLOW_po )
|
|
#pragma option -po.
|
|
#endif
|
|
#pragma option -Vo.
|
|
|
|
#endif
|