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.9 KiB
C++
122 lines
2.9 KiB
C++
/*------------------------------------------------------------------------*/
|
|
/* */
|
|
/* TESTDIR.CPP */
|
|
/* */
|
|
/* Copyright (c) 1991, 1993 Borland International */
|
|
/* All Rights Reserved. */
|
|
/* */
|
|
/* Sorted container example source file */
|
|
/* */
|
|
/*------------------------------------------------------------------------*/
|
|
|
|
#if !defined( __DIR_H )
|
|
#include <dir.h>
|
|
#endif // __DIR_H
|
|
|
|
#ifndef __STDLIB_H
|
|
#include <stdlib.h>
|
|
#endif
|
|
|
|
#ifndef __IOSTREAM_H
|
|
#include <iostream.h>
|
|
#endif
|
|
|
|
#if !defined( __CLASSLIB_ARRAYS_H )
|
|
#include <classlib\arrays.h>
|
|
#endif
|
|
|
|
#ifndef __FILEDATA_H
|
|
#include "filedata.h"
|
|
#endif
|
|
|
|
template <class T> class Directory
|
|
{
|
|
|
|
public:
|
|
|
|
Directory( const char *FileSpec );
|
|
void Show();
|
|
|
|
private:
|
|
|
|
TISArrayAsVector<T> Array;
|
|
|
|
};
|
|
|
|
template <class T> Directory<T>::Directory( const char *FileSpec ) :
|
|
Array( 10, 0, 5 )
|
|
{
|
|
struct ffblk FileBlock;
|
|
int Done = findfirst( FileSpec, &FileBlock, 0 );
|
|
while( !Done )
|
|
{
|
|
Array.Add( new T(FileBlock) );
|
|
Done = findnext( &FileBlock );
|
|
}
|
|
}
|
|
|
|
static void ShowBlock( FilesByName &blk, void * )
|
|
{
|
|
cout << blk << endl;
|
|
}
|
|
|
|
static void ShowBlock( FilesByDate &blk, void * )
|
|
{
|
|
cout << blk << endl;
|
|
}
|
|
|
|
static void ShowBlock( FilesBySize &blk, void * )
|
|
{
|
|
cout << blk << endl;
|
|
}
|
|
|
|
template <class T> inline void Directory<T>::Show()
|
|
{
|
|
Array.ForEach( ShowBlock, 0 );
|
|
}
|
|
|
|
void SortByName( const char *FileSpec )
|
|
{
|
|
Directory<FilesByName> dir( FileSpec );
|
|
dir.Show();
|
|
}
|
|
|
|
void SortByDate( const char *FileSpec )
|
|
{
|
|
Directory<FilesByDate> dir( FileSpec );
|
|
dir.Show();
|
|
}
|
|
|
|
void SortBySize( const char *FileSpec )
|
|
{
|
|
Directory<FilesBySize> dir( FileSpec );
|
|
dir.Show();
|
|
}
|
|
|
|
int main( int argc, char *argv[] )
|
|
{
|
|
if( argc < 2 || argc > 3 )
|
|
{
|
|
cerr << "Usage: directry [options] filespec" << endl << endl;
|
|
cerr << "Options:" << endl;
|
|
cerr << "\t-sd\tsort by date" << endl;
|
|
cerr << "\t-sn\tsort by name" << endl;
|
|
cerr << "\t-ss\tsort by size" << endl;
|
|
exit(1);
|
|
}
|
|
|
|
if( argc != 3 )
|
|
SortByName( argv[1] );
|
|
else
|
|
{
|
|
if( strcmp( argv[1], "-sn" ) == 0 )
|
|
SortByName( argv[2] );
|
|
else if( strcmp( argv[1], "-sd" ) == 0 )
|
|
SortByDate( argv[2] );
|
|
else if( strcmp( argv[1], "-ss" ) == 0 )
|
|
SortBySize( argv[2] );
|
|
}
|
|
|
|
return 0;
|
|
}
|