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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
|
/***************************************************************************
* *
* Powersave Daemon *
* *
* Copyright (C) 2004,2005,2006 SUSE Linux Products GmbH *
* *
* Author(s): Holger Macht <hmacht@suse.de> *
* *
* 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 2 of the License, or (at you *
* 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, write to the Free Software Foundation, Inc., *
* 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA *
* *
***************************************************************************/
#include "clientConnection.h"
#include "powerlib.h"
using namespace std;
ClientConnection::~ClientConnection()
{
_clients.clear();
}
bool ClientConnection::addClient(const char *name, int capabilities)
{
cNode client;
if (name == NULL)
return false;
/* unique name of the client */
client.name = name;
client.capabilities = capabilities;
// add the client to the list
_clients.push_back(client);
return true;
}
bool ClientConnection::checkClientRemoval(const char *name)
{
for (list < cNode >::iterator i = _clients.begin(); i != _clients.end(); ++i) {
if (i->name == name) {
_clients.erase(i);
pDebug(DBG_INFO, "Removed client %s", name);
return true;
}
}
return false;
}
bool ClientConnection::checkClientCapabilities(int capability)
{
for (list < cNode >::iterator i = _clients.begin(); i != _clients.end(); ++i) {
if (i->capabilities & capability) {
return true;
}
}
return false;
}
int ClientConnection::count() const
{
//return how much clients are connected
return _clients.size();
}
void ClientConnection::getClients(std::list< std::string > &names,
std::list< int > &caps)
{
for (list < cNode >::iterator i = _clients.begin(); i != _clients.end(); ++i) {
names.push_back(i->name);
caps.push_back(i->capabilities);
}
}
|
