Welcome to mirror list, hosted at ThFree Co, Russian Federation.

set.h « windirstat - github.com/windirstat/windirstat.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
blob: 4bd150450e393f62effb2b7f5b9127b496e1f744 (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
// set.h	- Declaration and implementatino of CSet<>
//
// WinDirStat - Directory Statistics
// Copyright (C) 2003 Bernhard Seifert
//
// 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 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, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
//
// Author: bseifert@users.sourceforge.net, bseifert@daccord.net

#pragma once


//
// CSet. A set class. I simply use the CMap class, which is in fact
// a set of assocs (x->y) and ignore the ys.
//
template<class KEY, class ARG_KEY>
class CSet
{
public:
	CSet(int nBlockSize = 10): m_map(nBlockSize) { }
	~CSet()	{ }
	void Serialize(CArchive& ar) { m_map.Serialize(ar); }

	int GetCount() const { return m_map.GetCount(); }
	BOOL IsEmpty() const { return m_map.IsEmpty(); }
	BOOL Lookup(ARG_KEY key) const { int dummy; return m_map.Lookup(key, dummy); }
	void SetKey(ARG_KEY key) { m_map.SetAt(key, 0); }
	BOOL RemoveKey(ARG_KEY key) { return m_map.RemoveKey(key); }
	void RemoveAll() { m_map.RemoveAll(); }
	POSITION GetStartPosition() const { return m_map.GetStartPosition(); }
	void GetNextAssoc(POSITION& rNextPosition, KEY& rKey) const { int dummy; m_map.GetNextAssoc(rNextPosition, rKey, dummy); }
	UINT GetHashTableSize() const { return m_map.GetHashTableSize(); }
	void InitHashTable(UINT hashSize, BOOL bAllocNow = TRUE) { m_map.InitHashTable(hashSize, bAllocNow); }

protected:
	CMap<KEY, ARG_KEY, int, int> m_map;

public:
#ifdef _DEBUG
	void Dump(CDumpContext& dc) const { m_map.Dump(dc); }
	void AssertValid() const { m_map.AssertValid(); }
#endif
};