2021-12-05 17:54:36 +00:00
|
|
|
#include "CDLootTableTable.h"
|
2023-10-18 14:18:47 +00:00
|
|
|
#include "CDClientManager.h"
|
|
|
|
#include "CDComponentsRegistryTable.h"
|
|
|
|
#include "CDItemComponentTable.h"
|
|
|
|
#include "eReplicaComponentType.h"
|
|
|
|
|
|
|
|
// Sort the tables by their rarity so the highest rarity items are first.
|
|
|
|
void SortTable(LootTableEntries& table) {
|
|
|
|
auto* componentsRegistryTable = CDClientManager::Instance().GetTable<CDComponentsRegistryTable>();
|
|
|
|
auto* itemComponentTable = CDClientManager::Instance().GetTable<CDItemComponentTable>();
|
|
|
|
// We modify the table in place so the outer loop keeps track of what is sorted
|
|
|
|
// and the inner loop finds the highest rarity item and swaps it with the current position
|
|
|
|
// of the outer loop.
|
|
|
|
for (auto oldItrOuter = table.begin(); oldItrOuter != table.end(); oldItrOuter++) {
|
|
|
|
auto lootToInsert = oldItrOuter;
|
|
|
|
// Its fine if this starts at 0, even if this doesnt match lootToInsert as the actual highest will
|
|
|
|
// either be found and overwrite these values, or the original is somehow zero and is still the highest rarity.
|
|
|
|
uint32_t highestLootRarity = 0;
|
|
|
|
for (auto oldItrInner = oldItrOuter; oldItrInner != table.end(); oldItrInner++) {
|
|
|
|
uint32_t itemComponentId = componentsRegistryTable->GetByIDAndType(oldItrInner->itemid, eReplicaComponentType::ITEM);
|
|
|
|
uint32_t rarity = itemComponentTable->GetItemComponentByID(itemComponentId).rarity;
|
|
|
|
if (rarity > highestLootRarity) {
|
|
|
|
highestLootRarity = rarity;
|
|
|
|
lootToInsert = oldItrInner;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
std::swap(*oldItrOuter, *lootToInsert);
|
|
|
|
}
|
|
|
|
}
|
2021-12-05 17:54:36 +00:00
|
|
|
|
2023-10-09 20:33:22 +00:00
|
|
|
CDLootTable CDLootTableTable::ReadRow(CppSQLite3Query& tableData) const {
|
|
|
|
CDLootTable entry{};
|
|
|
|
if (tableData.eof()) return entry;
|
|
|
|
entry.itemid = tableData.getIntField("itemid", -1);
|
|
|
|
entry.MissionDrop = tableData.getIntField("MissionDrop", -1) == 1 ? true : false;
|
|
|
|
entry.sortPriority = tableData.getIntField("sortPriority", -1);
|
|
|
|
return entry;
|
|
|
|
}
|
|
|
|
|
2023-08-11 04:27:40 +00:00
|
|
|
void CDLootTableTable::LoadValuesFromDatabase() {
|
2022-07-28 13:39:57 +00:00
|
|
|
|
|
|
|
// First, get the size of the table
|
2024-01-09 07:54:14 +00:00
|
|
|
uint32_t size = 0;
|
2022-07-28 13:39:57 +00:00
|
|
|
auto tableSize = CDClientDatabase::ExecuteQuery("SELECT COUNT(*) FROM LootTable");
|
|
|
|
while (!tableSize.eof()) {
|
|
|
|
size = tableSize.getIntField(0, 0);
|
|
|
|
|
|
|
|
tableSize.nextRow();
|
|
|
|
}
|
|
|
|
|
|
|
|
// Reserve the size
|
|
|
|
this->entries.reserve(size);
|
|
|
|
|
|
|
|
// Now get the data
|
|
|
|
auto tableData = CDClientDatabase::ExecuteQuery("SELECT * FROM LootTable");
|
|
|
|
while (!tableData.eof()) {
|
|
|
|
CDLootTable entry;
|
2023-10-09 20:33:22 +00:00
|
|
|
uint32_t lootTableIndex = tableData.getIntField("LootTableIndex", -1);
|
|
|
|
|
|
|
|
this->entries[lootTableIndex].push_back(ReadRow(tableData));
|
2022-07-28 13:39:57 +00:00
|
|
|
tableData.nextRow();
|
|
|
|
}
|
2023-10-18 14:18:47 +00:00
|
|
|
for (auto& [id, table] : this->entries) {
|
|
|
|
SortTable(table);
|
|
|
|
}
|
2021-12-05 17:54:36 +00:00
|
|
|
}
|
|
|
|
|
2023-10-09 20:33:22 +00:00
|
|
|
const LootTableEntries& CDLootTableTable::GetTable(uint32_t tableId) {
|
|
|
|
auto itr = this->entries.find(tableId);
|
|
|
|
if (itr != this->entries.end()) {
|
|
|
|
return itr->second;
|
|
|
|
}
|
2022-07-28 13:39:57 +00:00
|
|
|
|
2023-10-09 20:33:22 +00:00
|
|
|
auto query = CDClientDatabase::CreatePreppedStmt("SELECT * FROM LootTable WHERE LootTableIndex = ?;");
|
|
|
|
query.bind(1, static_cast<int32_t>(tableId));
|
|
|
|
auto tableData = query.execQuery();
|
2022-07-28 13:39:57 +00:00
|
|
|
|
2023-10-09 20:33:22 +00:00
|
|
|
while (!tableData.eof()) {
|
|
|
|
CDLootTable entry;
|
|
|
|
this->entries[tableId].push_back(ReadRow(tableData));
|
|
|
|
tableData.nextRow();
|
|
|
|
}
|
2023-10-18 14:18:47 +00:00
|
|
|
SortTable(this->entries[tableId]);
|
2021-12-05 17:54:36 +00:00
|
|
|
|
2023-10-09 20:33:22 +00:00
|
|
|
return this->entries[tableId];
|
2021-12-05 17:54:36 +00:00
|
|
|
}
|