blob: b6d3ba09a4015f8e986518e8e98d7e13ae957c10 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
|
#include "stdafx.h"
#include "net.minecraft.world.item.h"
#include "net.minecraft.world.entity.player.h"
#include "AbstractContainerMenu.h"
#include "Slot.h"
#include "MenuBackup.h"
MenuBackup::MenuBackup(shared_ptr<Inventory> inventory, AbstractContainerMenu *menu)
{
backups = new unordered_map<short, ItemInstanceArray *>();
this->inventory = inventory;
this->menu = menu;
}
void MenuBackup::save(short changeUid)
{
ItemInstanceArray *backup = new ItemInstanceArray( (int)menu->slots.size() + 1 );
(*backup)[0] = ItemInstance::clone(inventory->getCarried());
for (unsigned int i = 0; i < menu->slots.size(); i++)
{
(*backup)[i + 1] = ItemInstance::clone(menu->slots.at(i)->getItem());
}
// TODO Is unordered_map use correct?
// Was backups.put(changeUid, backup);
(*backups)[changeUid] = backup;
}
// Cannot use delete as function name as it is a reserved keyword
void MenuBackup::deleteBackup(short changeUid)
{
// TODO Is the unordered_map use correct?
// 4J Was backups.remove(changeUid);
backups->erase(changeUid);
}
void MenuBackup::rollback(short changeUid)
{
ItemInstanceArray *backup = backups->at(changeUid);
backups->clear();
inventory->setCarried( (*backup)[0] );
for (unsigned int i = 0; i < menu->slots.size(); i++)
{
menu->slots.at(i)->set( (*backup)[i + 1] );
}
}
|
