- 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>
74 lines
2.4 KiB
C++
74 lines
2.4 KiB
C++
/*------------------------------------------------------------------------*/
|
|
/* */
|
|
/* LOOKUP.CPP */
|
|
/* */
|
|
/* Copyright (c) 1991, 1993 Borland International */
|
|
/* All Rights Reserved. */
|
|
/* */
|
|
/* Hash table example file */
|
|
/* */
|
|
/*------------------------------------------------------------------------*/
|
|
|
|
#if !defined( __CSTRING_H )
|
|
#include <cstring.h>
|
|
#endif // __CSTRING_H
|
|
|
|
#if !defined( __ASSOC_H )
|
|
#include "classlib\assoc.h"
|
|
#endif // __ASSOC_H
|
|
|
|
#if !defined( __DICT_H )
|
|
#include "classlib\dict.h"
|
|
#endif // __DICT_H
|
|
|
|
#ifndef __IOSTREAM_H
|
|
#include <iostream.h>
|
|
#endif
|
|
|
|
static char *Entries[] =
|
|
{
|
|
"string", "manipulates character data",
|
|
"TDate", "manipulates dates",
|
|
"TTime", "manipulates times",
|
|
"VectorImp", "implements a zero-based vector",
|
|
"CVectorImp", "implements a zero-based counted vector",
|
|
"SVectorImp", "implements a zero-based sorted vector",
|
|
};
|
|
|
|
#define ArraySize(n) (sizeof(n)/sizeof(*n))
|
|
|
|
class HashString : public string {
|
|
public:
|
|
HashString() : string() {}
|
|
HashString(const char* s) : string(s) {}
|
|
unsigned HashValue() const { return hash(); }
|
|
};
|
|
|
|
typedef TDDAssociation<HashString,HashString> ClassData;
|
|
typedef TDictionaryAsHashTable<ClassData> Dictionary;
|
|
|
|
int main( int argc, char *argv[] )
|
|
{
|
|
if( argc != 2 )
|
|
{
|
|
cerr << "Usage: lookup classname\n";
|
|
return 1;
|
|
}
|
|
|
|
Dictionary ClassDefinitions;
|
|
string::set_case_sensitive(0);
|
|
|
|
for( int i = 0; i < ArraySize(Entries); i+=2 )
|
|
ClassDefinitions.Add( ClassData( Entries[i], Entries[i+1] ) );
|
|
|
|
ClassData *definition =
|
|
ClassDefinitions.Find( ClassData( argv[1], (char *)0 ) );
|
|
if( definition == 0 )
|
|
cout << "A definition for " << argv[1]
|
|
<< " was not found in the dictionary.\n";
|
|
else
|
|
cout << definition->Key() << " : " << definition->Value() << endl;
|
|
|
|
return 0;
|
|
}
|