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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
|
/*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*
* ActionQueue.cpp
* The Action Queue class.
* Copyright (C) 2005 Simon Newton
*/
#include <vector>
#include "ola/ActionQueue.h"
#include "ola/Callback.h"
#include "ola/Logging.h"
#include "ola/stl/STLUtils.h"
namespace ola {
using std::vector;
ActionQueue::~ActionQueue() {
STLDeleteElements(&m_actions);
}
void ActionQueue::AddAction(Action *action) {
m_actions.push_back(action);
}
/*
* Check the state of the current action, and if necessary run the next action.
*/
void ActionQueue::NextAction() {
if (!m_success)
return;
if (m_action_index >= 0 && m_action_index <
static_cast<int>(m_actions.size())) {
if (m_actions[m_action_index]->IsFatal() &&
m_actions[m_action_index]->Failed()) {
// abort the chain here
m_success = false;
m_on_complete->Run(this);
return;
}
}
if (m_action_index >= static_cast<int>(m_actions.size())) {
OLA_WARN << "Action queue already finished!";
} else if (m_action_index == static_cast<int>(m_actions.size()) - 1) {
m_action_index++;
m_on_complete->Run(this);
} else {
m_action_index++;
m_actions[m_action_index]->Perform(
NewSingleCallback(this, &ActionQueue::NextAction));
}
}
Action *ActionQueue::GetAction(unsigned int i) {
if (i >= ActionCount())
return NULL;
return m_actions[i];
}
} // namespace ola
|
