summaryrefslogtreecommitdiffstats
path: root/src/Common/UserLists/UserList.cpp
blob: a14111de4ed38786d72eda2ac52a316341966e09 (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
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
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
/*
 * UserList.cpp
 *
 * Copyright (C) 2009 Matthias Schiffer <matthias@gamezock.de>
 *
 * This program 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 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 Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public License along
 * with this program. If not, see <http://www.gnu.org/licenses/>.
 */

#include "UserList.h"

namespace Mad {
namespace Common {
namespace UserLists {

std::list<UserListEntry>::iterator UserList::findEntry(const std::string &name) {
  for(std::list<UserListEntry>::iterator it = list.begin(); it != list.end(); ++it) {
    if(it->getName() == name) {
      return it;
    }
  }

  return list.end();
}

std::list<UserListEntry>::const_iterator UserList::findEntry(const std::string &name) const {
  for(std::list<UserListEntry>::const_iterator it = list.begin(); it != list.end(); ++it) {
    if(it->getName() == name) {
      return it;
    }
  }

  return list.end();
}

UserList::iterator UserList::find(const std::string &name) {
  if(!names.count(name))
    return end();

  return iterator(findEntry(name));
}

UserList::const_iterator UserList::find(const std::string &name) const {
  if(!names.count(name))
    return end();

  return const_iterator(findEntry(name));
}

void UserList::registerEntry(const UserListEntry &entry) {
  std::set<std::string> details = entry.getDetailList();

  for(std::set<std::string>::iterator detail = details.begin(); detail != details.end(); ++detail) {
    std::map<std::string, unsigned>::iterator it = detailCounts.find(*detail);
    if(it == detailCounts.end())
      detailCounts.insert(make_pair(*detail, 1));
    else
      ++it->second;
  }
}

void UserList::unregisterEntry(const UserListEntry &entry) {
  std::set<std::string> details = entry.getDetailList();

  for(std::set<std::string>::iterator detail = details.begin(); detail != details.end(); ++detail) {
    std::map<std::string, unsigned>::iterator it = detailCounts.find(*detail);
    // TODO Assert
    if(it == detailCounts.end())
      continue;

    if(it->second > 1)
      --it->second;
    else
      detailCounts.erase(it);
  }
}


bool UserList::addUser(const UserListEntry &entry) {
  return insertUser(entry, end());
}

bool UserList::insertUser(const UserListEntry &entry, iterator after) {
  if(!names.insert(entry.getName()).second)
    return false;

  list.insert(after.it, entry);
  registerEntry(entry);
  return true;
}

bool UserList::removeUser(const std::string &name) {
  if(!names.erase(name))
    return false;

  std::list<UserListEntry>::iterator it = findEntry(name);
  // TODO Assert

  unregisterEntry(*it);
  list.erase(it);
  return true;
}

bool UserList::updateUser(const UserListEntry &entry) {
  if(!names.count(entry.getName()))
    return false;

  std::list<UserListEntry>::iterator it = findEntry(entry.getName());
  // TODO Assert

  unregisterEntry(*it);
  *it = entry;
  registerEntry(entry);
  return true;
}

}
}
}