arcattackandClaude Opus 4.8
7b7d465e5e
Clean, self-contained extraction of the BattleTech-specific work from the
reverse-engineering workspace -- engine + game + content + build, with nothing
from Red Planet or the raw archive dumps. Builds green (Win32) and runs the
single-player drive->animate->target->fire->damage->destroy loop out of the box.
Layout:
engine/ MUNGA + MUNGA_L4 shared 2007 engine, carrying our BT render/loader
work (bgfload/L4D3D/L4VIDEO: BSL bit-slice decode, LOD/ground/shadow
models) + image codec; the minimal rp/ headers the audio HAL needs
game/ reconstructed BT logic + surviving-original BT source + fwd shims
+ WinMain launcher
content/ full runtime tree (BTL4.RES, VIDEO/, GAUGE/, AUDIO/, eggs, BTDPL.INI)
docs/ format specs + reconstruction ledgers
reference/ raw Ghidra pseudocode (recon source-of-truth) + decomp exporter
tools/ MP console emulator + map/resource scanners
One top-level CMake builds munga_engine lib + bt410_l4 game lib + btl4.exe.
All paths relativized (186 fwd shims + ~437 CMake abs paths -> repo-relative);
DXSDK is the one external, overridable via -DDXSDK. Verified: builds to a
byte-identical 2.27MB exe and runs combat (TARGET DESTROYED, 0 crashes) against
the bundled content.
Co-Authored-By: Claude Opus 4.8 (1M context) <noreply@anthropic.com>
132 lines
3.1 KiB
C++
132 lines
3.1 KiB
C++
#pragma once
|
|
|
|
#include "srtskt.h"
|
|
#include "vchain.h"
|
|
|
|
class Hash : public SortedSocket
|
|
{
|
|
friend class HashIterator;
|
|
|
|
public:
|
|
Hash(CollectionSize size, Node *node, Logical has_unique_entries);
|
|
~Hash();
|
|
|
|
Logical TestInstance() const;
|
|
static Logical TestClass();
|
|
static Logical ProfileClass();
|
|
|
|
protected:
|
|
void AddImplementation(Plug *plug);
|
|
void AddValueImplementation(Plug *plug, const void *value);
|
|
Plug *FindImplementation(const void *value);
|
|
|
|
VChain **hashTable;
|
|
CollectionSize hashTableSize;
|
|
|
|
private:
|
|
virtual VChain* MakeVChain();
|
|
|
|
virtual IteratorPosition GetHashIndex(const void *value);
|
|
|
|
void BuildHashTable();
|
|
};
|
|
|
|
template <class T, class V> class HashOf : public Hash
|
|
{
|
|
public:
|
|
HashOf(CollectionSize size, Node *node, Logical has_unique_entries);
|
|
~HashOf();
|
|
|
|
void AddValue(T plug, const V &value) { AddValueImplementation(Cast_Object(Plug*, plug), &value); }
|
|
|
|
T Find(const V &value) { return (T)FindImplementation(&value); }
|
|
|
|
private:
|
|
VChain *MakeVChain();
|
|
|
|
IteratorPosition GetHashIndex(const void *value);
|
|
};
|
|
|
|
template <class T, class V> HashOf<T, V>::HashOf(CollectionSize size, Node *node, Logical has_unique_entries) : Hash(size, node, has_unique_entries)
|
|
{
|
|
}
|
|
|
|
template <class T, class V> HashOf<T, V>::~HashOf()
|
|
{
|
|
}
|
|
|
|
template <class T, class V> VChain *HashOf<T, V>::MakeVChain()
|
|
{
|
|
return new VChainOf<T, V>(GetReleaseNode(), HasUniqueEntries());
|
|
}
|
|
|
|
template <class T, class V> IteratorPosition HashOf<T, V>::GetHashIndex(const void *value)
|
|
{
|
|
Check_Pointer(value);
|
|
return (IteratorPosition(*(V*)value) % hashTableSize);
|
|
// return ((IteratorPosition)*(V*)value % hashTableSize);
|
|
}
|
|
|
|
class HashIterator : public SortedIterator
|
|
{
|
|
public:
|
|
HashIterator(Hash *hash);
|
|
~HashIterator();
|
|
Logical TestInstance() const;
|
|
|
|
void First();
|
|
void Last();
|
|
void Next();
|
|
void Previous();
|
|
CollectionSize GetSize();
|
|
void Remove();
|
|
|
|
protected:
|
|
#if 0
|
|
void *ReadAndNextImplementation();
|
|
void *ReadAndPreviousImplementation();
|
|
#endif
|
|
void *GetCurrentImplementation();
|
|
#if 0
|
|
void *GetNthImplementation(CollectionSize index);
|
|
#endif
|
|
Plug *FindImplementation(const void *value);
|
|
|
|
private:
|
|
void ReceiveMemo(IteratorMemo memo, void *content);
|
|
|
|
void DeleteVChainIterator();
|
|
|
|
void NextVChainIterator(IteratorPosition index);
|
|
|
|
VChain **hashTable;
|
|
CollectionSize hashTableSize;
|
|
IteratorPosition currentPosition;
|
|
VChainIterator *vchainIterator;
|
|
};
|
|
|
|
template <class T, class V> class HashIteratorOf : public HashIterator
|
|
{
|
|
public:
|
|
HashIteratorOf(HashOf<T, V> *hash);
|
|
HashIteratorOf(HashOf<T, V> &hash);
|
|
~HashIteratorOf();
|
|
|
|
T ReadAndNext() { return (T)ReadAndNextImplementation(); }
|
|
T ReadAndPrevious() { return (T)ReadAndPreviousImplementation(); }
|
|
T GetCurrent() { return (T)GetCurrentImplementation(); }
|
|
T GetNth(CollectionSize index) { return (T)GetNthImplementation(index); }
|
|
T Find(const V &value) { return (T)FindImplementation(&value); }
|
|
};
|
|
|
|
template <class T, class V> HashIteratorOf<T, V>::HashIteratorOf(HashOf<T, V> *hash) : HashIterator(hash)
|
|
{
|
|
}
|
|
|
|
template <class T, class V> HashIteratorOf<T, V>::HashIteratorOf(HashOf<T, V> &hash) : HashIterator(&hash)
|
|
{
|
|
}
|
|
|
|
template <class T, class V> HashIteratorOf<T, V>::~HashIteratorOf()
|
|
{
|
|
} |