blob: 6e39b19528c18ed670601c424f5923429714e16c (
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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
|
/*
* Copyright 2008 Ben Boeckel <MathStuf@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License along
* with this program. If not, see <http://www.gnu.org/licenses/>.
*/
// Header include
#include "Containment.h"
// Sigbattle includes
#include "TeamMember.h"
// Sigscript includes
#include "../sigscript/RulesWrapper.h"
#include "../sigscript/SigmodWrapper.h"
Sigbattle::Containment::Containment(Sigscript::SigmodWrapper* sigmod, QObject* parent) :
QObject(parent),
m_sigmod(sigmod)
{
}
QList<Sigbattle::TeamMember*> Sigbattle::Containment::members() const
{
return m_members;
}
bool Sigbattle::Containment::addMember(TeamMember* member)
{
if (m_members.size() < sigmod()->rules()->maxParty())
{
m_members.append(member);
// member->reparent(this);
return true;
}
return false;
}
Sigbattle::TeamMember* Sigbattle::Containment::findMember(const QUuid& id) const
{
foreach (TeamMember* member, m_members)
{
if (member->id() == id)
return member;
}
return NULL;
}
Sigscript::SigmodWrapper* Sigbattle::Containment::sigmod() const
{
return m_sigmod;
}
|