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>
60 lines
1.4 KiB
C++
60 lines
1.4 KiB
C++
// Borland C++ - (C) Copyright 1991, 1992 by Borland International
|
|
|
|
// BARCHART Example Program
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <float.h>
|
|
#include <graphics.h>
|
|
#include <math.h>
|
|
#include <conio.h>
|
|
|
|
#define MAX 50
|
|
#define ARRAYMAX 10
|
|
|
|
void makegraph(float p[]);
|
|
|
|
void main(void)
|
|
{
|
|
int i;
|
|
int scores[ARRAYMAX];
|
|
float percents[ARRAYMAX];
|
|
|
|
for (i = 0; i < ARRAYMAX; i++)
|
|
{
|
|
printf("\nEnter score between 0 and %d: ", MAX);
|
|
scanf("%d", &scores[i]);
|
|
}
|
|
for (i = 0; i < ARRAYMAX; i++)
|
|
percents[i] = ((float) scores[i]) / MAX;
|
|
|
|
printf("\n\n\n\tSCORE\tPERCENT");
|
|
for (i = 0; i < ARRAYMAX; i++)
|
|
printf("\n%d. \t%d\t%3.0f", i + 1, scores[i], (percents[i] * 100));
|
|
getch();
|
|
makegraph(percents);
|
|
}
|
|
|
|
void makegraph(float p[])
|
|
{
|
|
int g_driver, g_mode;
|
|
int i, left, top, wide, bottom, deep;
|
|
|
|
detectgraph(&g_driver, &g_mode);
|
|
initgraph(&g_driver, &g_mode, "..\\..\\bgi");
|
|
wide = (int)((getmaxx()) / ((ARRAYMAX * 2 ) + 1));
|
|
bottom = getmaxy() - 20;
|
|
deep = (int) (wide / 4);
|
|
left = wide;
|
|
for (i = 0; i < ARRAYMAX; i++)
|
|
{
|
|
top = (bottom) - ((int)(p[i] * 300));
|
|
bar3d(left, top, (left + wide), bottom, deep, 1);
|
|
left += (wide * 2);
|
|
}
|
|
getch();
|
|
closegraph();
|
|
return;
|
|
}
|
|
|
|
|