blob: 934581b783d216cdb6f013f305eb9e12804851b6 (
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
|
/***************************************************************************
copyright : (C) 2005-2006 by Robby Stephenson
email : [email protected]
***************************************************************************/
/***************************************************************************
* *
* This program is free software; you can redistribute it and/or modify *
* it under the terms of version 2 of the GNU General Public License as *
* published by the Free Software Foundation; *
* *
***************************************************************************/
#ifndef TELLICO_STRINGSET_H
#define TELLICO_STRINGSET_H
#include <tqdict.h>
#include <tqstringlist.h>
namespace Tellico {
/**
* @author Robby Stephenson
*/
class StringSet {
public:
StringSet(int size = 17) : m_dict(size) {}
// replace instead of insert, to ensure unique keys
void add(const TQString& val) { if(!val.isEmpty()) m_dict.replace(val, reinterpret_cast<const int *>(1)); }
void add(const TQStringList& vals) {
for(TQStringList::ConstIterator it = vals.begin(), end = vals.end(); it != end; ++it) {
add(*it);
}
}
bool remove(const TQString& val) { return !val.isEmpty() && m_dict.remove(val); }
void clear() { m_dict.clear(); }
bool has(const TQString& val) const { return !val.isEmpty() && (m_dict.find(val) != 0); }
bool isEmpty() const { return m_dict.isEmpty(); }
uint count() const { return m_dict.count(); }
TQStringList toList() const {
TQStringList list;
for(TQDictIterator<int> it(m_dict); it.current(); ++it) {
list << it.currentKey();
}
return list;
}
private:
// use a dict for fast random access to keep track of the values
TQDict<int> m_dict;
};
}
#endif
|
