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>
107 lines
2.7 KiB
Plaintext
107 lines
2.7 KiB
Plaintext
/*------------------------------------------------------------------------*/
|
|
/* */
|
|
/* LIST.CPP */
|
|
/* */
|
|
/* Copyright Borland International 1991, 1993 */
|
|
/* All Rights Reserved */
|
|
/* */
|
|
/*------------------------------------------------------------------------*/
|
|
|
|
#if !defined( __RESOURCE_H )
|
|
#include "classlib\resource.h"
|
|
#endif // __RESOURCE_H
|
|
|
|
#if !defined( __LIST_H )
|
|
#include "classlib\obsolete\list.h"
|
|
#endif // __LIST_H
|
|
|
|
unsigned ListBlockInitializer::count = 0;
|
|
|
|
MemBlocks *List::ListElement::mgr = 0;
|
|
|
|
void List::add( Object& toAdd )
|
|
{
|
|
ListElement *newElement = new ListElement( &toAdd, head->next );
|
|
CHECK( newElement != 0 );
|
|
head->next = newElement;
|
|
itemsInContainer++;
|
|
}
|
|
|
|
List::ListElement *List::findPred( const Object& o )
|
|
{
|
|
tail->data = (Object *)&o;
|
|
ListElement *cursor = head;
|
|
while( o != *(cursor->next->data) )
|
|
cursor = cursor->next;
|
|
tail->data = 0;
|
|
return cursor;
|
|
}
|
|
|
|
void List::detach( Object& toDetach, DeleteType dt )
|
|
{
|
|
ListElement *pred = findPred( toDetach );
|
|
ListElement *item = pred->next;
|
|
if( delObj(dt) && pred->next != tail )
|
|
delete item->data;
|
|
pred->next = pred->next->next;
|
|
if( item != tail )
|
|
{
|
|
itemsInContainer--;
|
|
delete item;
|
|
}
|
|
}
|
|
|
|
void List::flush( DeleteType dt )
|
|
{
|
|
ListElement *current = head->next;
|
|
while( current != tail )
|
|
{
|
|
ListElement *temp = current;
|
|
current = current->next;
|
|
if( delObj(dt) )
|
|
delete temp->data;
|
|
delete temp;
|
|
}
|
|
head->next = tail;
|
|
itemsInContainer = 0;
|
|
}
|
|
|
|
ContainerIterator& List::initIterator() const
|
|
{
|
|
return *( (ContainerIterator *)new ListIterator( *this ) );
|
|
}
|
|
|
|
ListIterator::~ListIterator()
|
|
{
|
|
}
|
|
|
|
ListIterator::operator int()
|
|
{
|
|
return currentElement->next != currentElement;
|
|
}
|
|
|
|
Object& ListIterator::current()
|
|
{
|
|
return currentElement->data == 0 ? NOOBJECT : *(currentElement->data);
|
|
}
|
|
|
|
Object& ListIterator::operator ++ ( int )
|
|
{
|
|
Object *data = currentElement->data;
|
|
currentElement = currentElement->next;
|
|
return data == 0 ? NOOBJECT : *data;
|
|
}
|
|
|
|
Object& ListIterator::operator ++ ()
|
|
{
|
|
currentElement = currentElement->next;
|
|
return currentElement->data == 0 ? NOOBJECT : *(currentElement->data);
|
|
}
|
|
|
|
void ListIterator::restart()
|
|
{
|
|
currentElement = startingElement;
|
|
}
|
|
|
|
|