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>
26 lines
804 B
C++
26 lines
804 B
C++
// Borland C++ - (C) Copyright 1991, 1992 by Borland International
|
|
|
|
// list2.h: A Integer List Class
|
|
// from Getting Started
|
|
const int Max_elem = 10;
|
|
|
|
class List
|
|
{
|
|
protected: // The protected keyword gives subclasses
|
|
// direct access to inherited members
|
|
int *list; // An array of integers
|
|
int nmax; // The dimension of the array
|
|
int nelem; // The number of elements
|
|
|
|
public:
|
|
List(int n = Max_elem) {list = new int[n]; nmax = n; nelem = 0;};
|
|
~List() {delete list;};
|
|
int put_elem(int, int);
|
|
int get_elem(int&, int);
|
|
void setn(int n) {nelem = n;};
|
|
int getn() {return nelem;};
|
|
void incn() {if (nelem < nmax) ++nelem;};
|
|
int getmax() {return nmax;};
|
|
virtual void print(); // line 22
|
|
};
|
|
|