1. The assignment to handler is unnecessary.
2. The ctor for GameHandler missed gameplayerid and spandisks
3. GameTree::GameTree assigns node several times but doesn't
always use it. Any unused assignment is removed.
4. The conditional for nodeInt is unnecessary since nodeInt is
guaranteed to be not zero because of the conditional just
before it.
Signed-off-by: Erik Hovland <erik@hovland.org>
---
mythplugins/mythgame/mythgame/gamehandler.cpp | 4 ++--
mythplugins/mythgame/mythgame/gamehandler.h | 8 +++-----
mythplugins/mythgame/mythgame/gametree.cpp | 13 ++++++-------
3 files changed, 11 insertions(+), 14 deletions(-)
diff --git a/mythplugins/mythgame/mythgame/gamehandler.cpp b/mythplugins/mythgame/mythgame/gamehandler.cpp
index 7eb1871..9b1e48b 100644
a
|
b
|
void GameHandler::Launchgame(RomInfo *romdata, QString systemname) |
879 | 879 | |
880 | 880 | RomInfo* GameHandler::CreateRomInfo(RomInfo* parent) |
881 | 881 | { |
882 | | GameHandler *handler; |
883 | | if((handler = GetHandler(parent))) |
| 882 | if(GetHandler(parent)) |
884 | 883 | return new RomInfo(*parent); |
| 884 | |
885 | 885 | return NULL; |
886 | 886 | } |
887 | 887 | |
diff --git a/mythplugins/mythgame/mythgame/gamehandler.h b/mythplugins/mythgame/mythgame/gamehandler.h
index 1d25f45..122dfba 100644
a
|
b
|
class GameHandler |
57 | 57 | { |
58 | 58 | public: |
59 | 59 | GameHandler() |
60 | | { |
61 | | m_RemoveAll = false; |
62 | | m_KeepAll = false; |
63 | | rebuild = false; |
64 | | } |
| 60 | : rebuild(false), spandisks(0), |
| 61 | gameplayerid(0), m_RemoveAll(false), |
| 62 | m_KeepAll(false) {} |
65 | 63 | |
66 | 64 | static void updateSettings(GameHandler*); |
67 | 65 | static GameHandler* getHandler(uint i); |
diff --git a/mythplugins/mythgame/mythgame/gametree.cpp b/mythplugins/mythgame/mythgame/gametree.cpp
index a0a32c5..f139c23 100644
a
|
b
|
GameTree::GameTree(MythMainWindow *parent, QString windowName, |
227 | 227 | root = new GameTreeRoot(levels, systemFilter); |
228 | 228 | m_gameTreeRoots.push_back(root); |
229 | 229 | m_gameTreeItems.push_back(new GameTreeItem(root, m_showHashed)); |
230 | | node = m_gameTree->addNode(tr("All Games"), m_gameTreeItems.size(), false); |
| 230 | m_gameTree->addNode(tr("All Games"), m_gameTreeItems.size(), false); |
231 | 231 | |
232 | 232 | root = new GameTreeRoot("genre gamename", systemFilter); |
233 | 233 | m_gameTreeRoots.push_back(root); |
234 | 234 | m_gameTreeItems.push_back(new GameTreeItem(root)); |
235 | | node = m_gameTree->addNode(tr("- By Genre"), m_gameTreeItems.size(), false); |
| 235 | m_gameTree->addNode(tr("- By Genre"), m_gameTreeItems.size(), false); |
236 | 236 | |
237 | 237 | root = new GameTreeRoot("year gamename", systemFilter); |
238 | 238 | m_gameTreeRoots.push_back(root); |
239 | 239 | m_gameTreeItems.push_back(new GameTreeItem(root)); |
240 | | node = m_gameTree->addNode(tr("- By Year"), m_gameTreeItems.size(), false); |
| 240 | m_gameTree->addNode(tr("- By Year"), m_gameTreeItems.size(), false); |
241 | 241 | |
242 | 242 | root = new GameTreeRoot("gamename", systemFilter); |
243 | 243 | m_gameTreeRoots.push_back(root); |
244 | 244 | m_gameTreeItems.push_back(new GameTreeItem(root)); |
245 | | node = m_gameTree->addNode(tr("- By Name"), m_gameTreeItems.size(), false); |
| 245 | m_gameTree->addNode(tr("- By Name"), m_gameTreeItems.size(), false); |
246 | 246 | |
247 | 247 | root = new GameTreeRoot("publisher gamename", systemFilter); |
248 | 248 | m_gameTreeRoots.push_back(root); |
249 | 249 | m_gameTreeItems.push_back(new GameTreeItem(root)); |
250 | | node = m_gameTree->addNode(tr("- By Publisher"), m_gameTreeItems.size(), false); |
251 | | |
| 250 | m_gameTree->addNode(tr("- By Publisher"), m_gameTreeItems.size(), false); |
252 | 251 | |
253 | 252 | m_gameTreeUI->assignTreeData(m_gameTree); |
254 | 253 | m_gameTreeUI->enter(); |
… |
… |
void GameTree::handleTreeListSelection(int nodeInt, IntVector *) |
371 | 370 | { |
372 | 371 | if (nodeInt > 0) |
373 | 372 | { |
374 | | GameTreeItem *item = nodeInt ? m_gameTreeItems[nodeInt - 1] : 0; |
| 373 | GameTreeItem *item = m_gameTreeItems[nodeInt - 1]; |
375 | 374 | |
376 | 375 | if (item->isLeaf()) |
377 | 376 | { |